tree< T, tree_node_allocator >::iterator_base Class Reference
Base class for iterators, only pointers stored, no traversal logic. More...
#include <tree.h>
Inheritance diagram for tree< T, tree_node_allocator >::iterator_base:
Collaboration diagram for tree< T, tree_node_allocator >::iterator_base:
Public Member Functions | |
| void | skip_children () |
| When called, the next increment/decrement skips children of this node. | |
| unsigned int | number_of_children () const |
| Number of children of the node pointed to by the iterator. | |
Detailed Description
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::iterator_base
Base class for iterators, only pointers stored, no traversal logic. The documentation for this class was generated from the following file:
- D:/Uni/InfoVis/LU/src/tree.h
