mirror of
https://github.com/baldurk/renderdoc.git
synced 2026-05-15 06:20:41 +00:00
baldurk
768e812e45
* On windows it's strongly desired to be able to compile straight out of a clean checkout or source download. This means anyone can download the source and investigate something quickly, without having to worry about the hassle of figuring out how the project downloads 3rd party dependencies, fetching them, getting them registered in the right place. * This can't be put in a submodule as git submodules don't get downloaded by default so people new to git will get confusing compilation messages, and someone downloading the source from github directly without cloning via git won't get submodules included. * It does add some extra size to a fresh download/checkout which is unfortunate, but absolutely worth the cost. Shallow checkouts still aren't unfeasibly large, and it's only a one-off cost at clone time.
177 lines
6.4 KiB
C++
177 lines
6.4 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
|
** Contact: https://www.qt.io/licensing/
|
|
**
|
|
** This file is part of the QtCore module of the Qt Toolkit.
|
|
**
|
|
** $QT_BEGIN_LICENSE:LGPL$
|
|
** Commercial License Usage
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
** accordance with the commercial license agreement provided with the
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
** a written agreement between you and The Qt Company. For licensing terms
|
|
** and conditions see https://www.qt.io/terms-conditions. For further
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
|
**
|
|
** GNU Lesser General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
** General Public License version 3 as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.LGPL3 included in the
|
|
** packaging of this file. Please review the following information to
|
|
** ensure the GNU Lesser General Public License version 3 requirements
|
|
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
|
|
**
|
|
** GNU General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
** General Public License version 2.0 or (at your option) the GNU General
|
|
** Public license version 3 or any later version approved by the KDE Free
|
|
** Qt Foundation. The licenses are as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
|
|
** included in the packaging of this file. Please review the following
|
|
** information to ensure the GNU General Public License requirements will
|
|
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
|
|
** https://www.gnu.org/licenses/gpl-3.0.html.
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
#ifndef QBITARRAY_H
|
|
#define QBITARRAY_H
|
|
|
|
#include <QtCore/qbytearray.h>
|
|
|
|
QT_BEGIN_NAMESPACE
|
|
|
|
|
|
class QBitRef;
|
|
class Q_CORE_EXPORT QBitArray
|
|
{
|
|
friend Q_CORE_EXPORT QDataStream &operator<<(QDataStream &, const QBitArray &);
|
|
friend Q_CORE_EXPORT QDataStream &operator>>(QDataStream &, QBitArray &);
|
|
friend Q_CORE_EXPORT uint qHash(const QBitArray &key, uint seed) Q_DECL_NOTHROW;
|
|
QByteArray d;
|
|
|
|
public:
|
|
inline QBitArray() Q_DECL_NOTHROW {}
|
|
explicit QBitArray(int size, bool val = false);
|
|
QBitArray(const QBitArray &other) : d(other.d) {}
|
|
inline QBitArray &operator=(const QBitArray &other) { d = other.d; return *this; }
|
|
#ifdef Q_COMPILER_RVALUE_REFS
|
|
inline QBitArray(QBitArray &&other) Q_DECL_NOTHROW : d(std::move(other.d)) {}
|
|
inline QBitArray &operator=(QBitArray &&other) Q_DECL_NOTHROW
|
|
{ qSwap(d, other.d); return *this; }
|
|
#endif
|
|
|
|
inline void swap(QBitArray &other) Q_DECL_NOTHROW { qSwap(d, other.d); }
|
|
|
|
inline int size() const { return (d.size() << 3) - *d.constData(); }
|
|
inline int count() const { return (d.size() << 3) - *d.constData(); }
|
|
int count(bool on) const;
|
|
|
|
inline bool isEmpty() const { return d.isEmpty(); }
|
|
inline bool isNull() const { return d.isNull(); }
|
|
|
|
void resize(int size);
|
|
|
|
inline void detach() { d.detach(); }
|
|
inline bool isDetached() const { return d.isDetached(); }
|
|
inline void clear() { d.clear(); }
|
|
|
|
bool testBit(int i) const;
|
|
void setBit(int i);
|
|
void setBit(int i, bool val);
|
|
void clearBit(int i);
|
|
bool toggleBit(int i);
|
|
|
|
bool at(int i) const;
|
|
QBitRef operator[](int i);
|
|
bool operator[](int i) const;
|
|
QBitRef operator[](uint i);
|
|
bool operator[](uint i) const;
|
|
|
|
QBitArray& operator&=(const QBitArray &);
|
|
QBitArray& operator|=(const QBitArray &);
|
|
QBitArray& operator^=(const QBitArray &);
|
|
QBitArray operator~() const;
|
|
|
|
inline bool operator==(const QBitArray& other) const { return d == other.d; }
|
|
inline bool operator!=(const QBitArray& other) const { return d != other.d; }
|
|
|
|
inline bool fill(bool val, int size = -1);
|
|
void fill(bool val, int first, int last);
|
|
|
|
inline void truncate(int pos) { if (pos < size()) resize(pos); }
|
|
|
|
public:
|
|
typedef QByteArray::DataPtr DataPtr;
|
|
inline DataPtr &data_ptr() { return d.data_ptr(); }
|
|
};
|
|
|
|
inline bool QBitArray::fill(bool aval, int asize)
|
|
{ *this = QBitArray((asize < 0 ? this->size() : asize), aval); return true; }
|
|
|
|
Q_CORE_EXPORT QBitArray operator&(const QBitArray &, const QBitArray &);
|
|
Q_CORE_EXPORT QBitArray operator|(const QBitArray &, const QBitArray &);
|
|
Q_CORE_EXPORT QBitArray operator^(const QBitArray &, const QBitArray &);
|
|
|
|
inline bool QBitArray::testBit(int i) const
|
|
{ Q_ASSERT(uint(i) < uint(size()));
|
|
return (*(reinterpret_cast<const uchar*>(d.constData())+1+(i>>3)) & (1 << (i & 7))) != 0; }
|
|
|
|
inline void QBitArray::setBit(int i)
|
|
{ Q_ASSERT(uint(i) < uint(size()));
|
|
*(reinterpret_cast<uchar*>(d.data())+1+(i>>3)) |= uchar(1 << (i & 7)); }
|
|
|
|
inline void QBitArray::clearBit(int i)
|
|
{ Q_ASSERT(uint(i) < uint(size()));
|
|
*(reinterpret_cast<uchar*>(d.data())+1+(i>>3)) &= ~uchar(1 << (i & 7)); }
|
|
|
|
inline void QBitArray::setBit(int i, bool val)
|
|
{ if (val) setBit(i); else clearBit(i); }
|
|
|
|
inline bool QBitArray::toggleBit(int i)
|
|
{ Q_ASSERT(uint(i) < uint(size()));
|
|
uchar b = uchar(1<<(i&7)); uchar* p = reinterpret_cast<uchar*>(d.data())+1+(i>>3);
|
|
uchar c = uchar(*p&b); *p^=b; return c!=0; }
|
|
|
|
inline bool QBitArray::operator[](int i) const { return testBit(i); }
|
|
inline bool QBitArray::operator[](uint i) const { return testBit(i); }
|
|
inline bool QBitArray::at(int i) const { return testBit(i); }
|
|
|
|
class Q_CORE_EXPORT QBitRef
|
|
{
|
|
private:
|
|
QBitArray& a;
|
|
int i;
|
|
inline QBitRef(QBitArray& array, int idx) : a(array), i(idx) {}
|
|
friend class QBitArray;
|
|
public:
|
|
inline operator bool() const { return a.testBit(i); }
|
|
inline bool operator!() const { return !a.testBit(i); }
|
|
QBitRef& operator=(const QBitRef& val) { a.setBit(i, val); return *this; }
|
|
QBitRef& operator=(bool val) { a.setBit(i, val); return *this; }
|
|
};
|
|
|
|
inline QBitRef QBitArray::operator[](int i)
|
|
{ Q_ASSERT(i >= 0); return QBitRef(*this, i); }
|
|
inline QBitRef QBitArray::operator[](uint i)
|
|
{ return QBitRef(*this, i); }
|
|
|
|
|
|
#ifndef QT_NO_DATASTREAM
|
|
Q_CORE_EXPORT QDataStream &operator<<(QDataStream &, const QBitArray &);
|
|
Q_CORE_EXPORT QDataStream &operator>>(QDataStream &, QBitArray &);
|
|
#endif
|
|
|
|
#ifndef QT_NO_DEBUG_STREAM
|
|
Q_CORE_EXPORT QDebug operator<<(QDebug, const QBitArray &);
|
|
#endif
|
|
|
|
Q_DECLARE_SHARED(QBitArray)
|
|
|
|
QT_END_NAMESPACE
|
|
|
|
#endif // QBITARRAY_H
|