#include <UT_RLEBitArray.h>
Public Types | |
| enum | { LOWEST_INDEX = INT_MIN } |
Public Member Functions | |
| UT_RLEBitArray () | |
| ~UT_RLEBitArray () | |
| void | swap (UT_RLEBitArray &other) |
| int | numBitsSet () const |
| int | getBit (int idx) const |
| bool | getBitRun (int idx, int &start, int &end) const |
| void | setBitTrue (int idx) |
| void | setBitFalse (int idx) |
| void | setBit (int idx, int value) |
| void | setBitRunTrue (int start, int end) |
| int | toggleBit (int idx) |
| void | clear () |
| bool | isEmpty () const |
| int | getNextRun (int &start, int &end, bool first=false) |
| bool | iterate (int ¤tBit) |
| int64 | getMemoryUsage () const |
| void | display () const |
| int | operator() (int index) const |
| int | operator[] (int index) const |
| const UT_RLEBitArray & | operator&= (const UT_RLEBitArray &v) |
| const UT_RLEBitArray & | operator|= (const UT_RLEBitArray &v) |
| const UT_RLEBitArray & | operator^= (const UT_RLEBitArray &v) |
| const UT_RLEBitArray & | operator-= (const UT_RLEBitArray &v) |
| const UT_RLEBitArray & | operator= (const UT_RLEBitArray &v) |
| int | operator== (const UT_RLEBitArray &v) const |
| int | operator!= (const UT_RLEBitArray &v) const |
Protected Member Functions | |
| void | restartSearch () const |
| void | restartSearchForIndex (int idx) const |
| void | advanceSearchNode () const |
Protected Attributes | |
| UT_LinkList | myList |
| Node * | mySearchNode |
| int | myLastIndex |
Definition at line 30 of file UT_RLEBitArray.h.
| anonymous enum |
| UT_RLEBitArray::UT_RLEBitArray | ( | ) |
| UT_RLEBitArray::~UT_RLEBitArray | ( | ) |
| void UT_RLEBitArray::advanceSearchNode | ( | ) | const [protected] |
| void UT_RLEBitArray::clear | ( | ) |
| void UT_RLEBitArray::display | ( | ) | const |
| int UT_RLEBitArray::getBit | ( | int | idx | ) | const |
| bool UT_RLEBitArray::getBitRun | ( | int | idx, | |
| int & | start, | |||
| int & | end | |||
| ) | const |
| int64 UT_RLEBitArray::getMemoryUsage | ( | ) | const |
| int UT_RLEBitArray::getNextRun | ( | int & | start, | |
| int & | end, | |||
| bool | first = false | |||
| ) |
| bool UT_RLEBitArray::isEmpty | ( | ) | const |
| bool UT_RLEBitArray::iterate | ( | int & | currentBit | ) |
| int UT_RLEBitArray::numBitsSet | ( | ) | const |
| int UT_RLEBitArray::operator!= | ( | const UT_RLEBitArray & | v | ) | const |
| const UT_RLEBitArray& UT_RLEBitArray::operator&= | ( | const UT_RLEBitArray & | v | ) |
| int UT_RLEBitArray::operator() | ( | int | index | ) | const [inline] |
Definition at line 78 of file UT_RLEBitArray.h.
| const UT_RLEBitArray& UT_RLEBitArray::operator-= | ( | const UT_RLEBitArray & | v | ) |
| const UT_RLEBitArray& UT_RLEBitArray::operator= | ( | const UT_RLEBitArray & | v | ) |
| int UT_RLEBitArray::operator== | ( | const UT_RLEBitArray & | v | ) | const |
| int UT_RLEBitArray::operator[] | ( | int | index | ) | const [inline] |
Definition at line 79 of file UT_RLEBitArray.h.
| const UT_RLEBitArray& UT_RLEBitArray::operator^= | ( | const UT_RLEBitArray & | v | ) |
| const UT_RLEBitArray& UT_RLEBitArray::operator|= | ( | const UT_RLEBitArray & | v | ) |
| void UT_RLEBitArray::restartSearch | ( | ) | const [protected] |
| void UT_RLEBitArray::restartSearchForIndex | ( | int | idx | ) | const [protected] |
| void UT_RLEBitArray::setBit | ( | int | idx, | |
| int | value | |||
| ) | [inline] |
Definition at line 49 of file UT_RLEBitArray.h.
| void UT_RLEBitArray::setBitFalse | ( | int | idx | ) |
| void UT_RLEBitArray::setBitRunTrue | ( | int | start, | |
| int | end | |||
| ) |
| void UT_RLEBitArray::setBitTrue | ( | int | idx | ) |
| void UT_RLEBitArray::swap | ( | UT_RLEBitArray & | other | ) |
| int UT_RLEBitArray::toggleBit | ( | int | idx | ) |
int UT_RLEBitArray::myLastIndex [mutable, protected] |
Definition at line 101 of file UT_RLEBitArray.h.
UT_LinkList UT_RLEBitArray::myList [protected] |
Definition at line 97 of file UT_RLEBitArray.h.
Node* UT_RLEBitArray::mySearchNode [mutable, protected] |
Definition at line 100 of file UT_RLEBitArray.h.
1.5.9