#include <bitset.H>
|
| RWProxy | get_current () |
| |
| RWProxy | get_current () const |
| |
| | ArrayIterator () |
| |
| | ArrayIterator (const DynBitSet &a) |
| |
| | ArrayIterator (const DynBitSet &a, nat_t c) |
| |
| | ArrayIterator (const ArrayIterator &it) |
| |
| | ArrayIterator (ArrayIterator &&it) |
| |
| ArrayIterator & | operator= (const ArrayIterator &it) |
| |
| ArrayIterator & | operator= (ArrayIterator &&it) |
| |
| void | swap (ArrayIterator &it) |
| |
| bool | has_current () const |
| |
| void | next () |
| |
| void | next_n (nat_t p) |
| |
| void | prev () |
| |
| void | prev_n (nat_t p) |
| |
| void | move_to (nat_t p) |
| |
| void | reset () |
| |
| nat_t | get_position () const |
| |
Public Member Functions inherited from Designar::RandomAccessIterator< Iterator, bool, RET_CPY > |
| RetType< RET_CPY, bool, bool & > | operator[] (nat_t i) |
| |
| Iterator & | operator+= (nat_t p) |
| |
| Iterator | operator+ (nat_t p) |
| |
| Iterator & | operator-= (nat_t p) |
| |
| Iterator | operator- (nat_t p) |
| |
| bool | operator< (const Iterator &it) const |
| |
| bool | operator<= (const Iterator &it) const |
| |
| bool | operator> (const Iterator &it) const |
| |
| bool | operator>= (const Iterator &it) const |
| |
| Iterator & | operator-- () |
| |
| Iterator | operator-- (int) |
| |
| Iterator & | operator++ () |
| |
| Iterator | operator++ (int) |
| |
| bool | has_curr () const |
| |
| RetType< RET_CPY, bool, bool & > | get_curr () |
| |
| RetType< RET_CPY, bool, const bool & > | get_curr () const |
| |
| RetType< RET_CPY, bool, bool & > | operator* () |
| |
| RetType< RET_CPY, bool, const bool & > | operator* () const |
| |
| bool * | operator-> () |
| |
| bool | operator== (const Iterator &it) const |
| |
| bool | operator!= (const Iterator &it) const |
| |
| RWProxy Designar::DynBitSet::Iterator::get_current |
( |
| ) |
|
| RWProxy Designar::DynBitSet::Iterator::get_current |
( |
| ) |
const |
The documentation for this class was generated from the following file: