|
|
| Avl_set_iter ()=default |
| | Create an invalid iterator (end marker).
|
| | Avl_set_iter (Node const *t) |
| | Create an iterator for the given tree.
|
| | Avl_set_iter (Base const &o) |
| | Create an iterator from a BST iterator.
|
|
| Avl_set_iter (Non_const_iter const &o) |
| | Allow copy of non-const iterator to const iterator versions.
|
|
Avl_set_iter & | operator= (Non_const_iter const &o) |
| | Allow assignment of non-const iterator to const iterator versions.
|
| Key & | operator* () const |
| | Dereference the iterator and get the item out of the tree.
|
| Key * | operator-> () const |
| | Member access to the item the iterator points to.
|
|
Avl_set_iter & | operator++ () |
| | Set the iterator to the next element (pre increment).
|
|
Avl_set_iter | operator++ (int) |
| | Set the iterator to the next element (post increment).
|
template<typename Node, typename Key, typename Node_op>
class cxx::Bits::Avl_set_iter< Node, Key, Node_op >
Generic iterator for the AVL-tree based set.
Definition at line 35 of file avl_set.