BitListIterator class
![]() | BitListIterator () Default Constructor. |
![]() | BitListIterator (const BitList & bitlist) Normal Constructor |
![]() | BitListIterator (const BitList & bitlist, size_t start) Alternate constructor |
![]() | BitListIterator (const BitListIterator &) Copy Constructor. |
![]() | operator = (const BitListIterator &) Assignment. |
![]() | setindex (size_t index) Init: set current index |
![]() | next (bool bit, size_t & _index) Set the internal index to the next 'true' or 'false' bit; indicated by the first argument, and return the index in the second argument |
![]() | prev (bool bit, size_t & _index) Just like next(), but the index is moved backwards. |
![]() | next (bool & bit) Increment the internal index and return the value of the bit it points to Returns 'false' if the boundary is reached |
![]() | prev (bool & bit) Just like next() above, just decrement the internal index |
BitListIterator class. The BitListIterator iterates through a BitList efficiently. next() and prev() functions are supplied. The functionality is the following: The BLI saves an index to a certain bit in the BitList. By calling either next() or prev(), the index is incremented/decremented and the bit it is pointing to now is returned. If it gets out of bounds, these functions return 'false'. The out-of-bounds index is always index=size. So by calling next() or prev() again when a 'false' was returned previously, they return the first/last bit, respectively.
BitListIterator(const BitList & bitlist)
BitListIterator(const BitList & bitlist, size_t start)
BitListIterator(const BitListIterator &)
BitListIterator& operator = (const BitListIterator &)
void setindex(size_t index)
bool next(bool bit, size_t & _index)
bool prev(bool bit, size_t & _index)
bool next(bool & bit)
bool prev(bool & bit)
alphabetic index hierarchy of classes