BitList class
![]() | BitList (size_t size = 0, size_t inc = 0) Default constructor |
![]() | BitList (const BitList &) Copy constructor |
![]() | operator = (const BitList &) The assignment operator. |
![]() | set (size_t index, bool value) Set a bit at a specific index to a given value |
![]() | operator [] (size_t) const Get the bit at a given index |
![]() | size () const Get the size of the BitList |
![]() | count () const Count the TRUE bits from a certain index on |
![]() | trim () Just chop off all trailing 'false' bits. Returns new size. |
![]() | clear (bool keepLength = false) Clear the list, reset size to 0 by default |
![]() | operator &= (const BitList &) The standard &= operator. |
![]() | operator |= (const BitList &) The standard |= operator. |
![]() | operator ^= (const BitList &) The standard ^= operator. |
![]() | invert () The inversion method, flip every bit in the BitList. |
![]() | covers (const BitList & BL) const Check if BL is a subset of the current list |
![]() | overlaps (const BitList & BL) const Check if the current BitList overlaps with the other |
![]() | compress (ostream &) const compress output |
![]() | decompress (istream &) decompress input |
BitList class. The BitList is an array of bits. A bit can be set at any index using the set member function, the array expands itself automatically if the index exceeds the current size.
BitList(const BitList &)
BitList& operator = (const BitList &)
void set(size_t index, bool value)
bool operator [](size_t) const
size_t size() const
size_t count() const
size_t trim()
void clear(bool keepLength = false)
BitList& operator &= (const BitList &)
BitList& operator |= (const BitList &)
BitList& operator ^= (const BitList &)
void invert()
bool covers(const BitList & BL) const
bool overlaps(const BitList & BL) const
alphabetic index hierarchy of classes