/**************************************************************************** ** ** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** 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 Digia. For licensing terms and ** conditions see http://qt.digia.com/licensing. For further information ** use the contact form at http://qt.digia.com/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 2.1 as published by the Free Software ** Foundation and appearing in the file LICENSE.LGPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU Lesser General Public License version 2.1 requirements ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, Digia gives you certain additional ** rights. These rights are described in the Digia Qt LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 3.0 as published by the Free Software ** Foundation and appearing in the file LICENSE.GPL included in the ** packaging of this file. Please review the following information to ** ensure the GNU General Public License version 3.0 requirements will be ** met: http://www.gnu.org/copyleft/gpl.html. ** ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QBITARRAY_H #define QBITARRAY_H #include QT_BEGIN_HEADER QT_BEGIN_NAMESPACE QT_MODULE(Core) 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); QByteArray d; public: inline QBitArray() {} 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 &operator=(QBitArray &&other) { qSwap(d, other.d); return *this; } #endif inline void swap(QBitArray &other) { 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; // ### Qt 5: Store the number of set bits separately 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& a) const { return d == a.d; } inline bool operator!=(const QBitArray& a) const { return d != a.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(d.constData())+1+(i>>3)) & (1 << (i & 7))) != 0; } inline void QBitArray::setBit(int i) { Q_ASSERT(uint(i) < uint(size())); *(reinterpret_cast(d.data())+1+(i>>3)) |= uchar(1 << (i & 7)); } inline void QBitArray::clearBit(int i) { Q_ASSERT(uint(i) < uint(size())); *(reinterpret_cast(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(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 Q_DECLARE_TYPEINFO(QBitArray, Q_MOVABLE_TYPE); Q_DECLARE_SHARED(QBitArray) QT_END_NAMESPACE QT_END_HEADER #endif // QBITARRAY_H