Base class for iterators, only pointers stored, no traversal logic.
More...
|
|
typedef T | value_type |
| |
|
typedef T * | pointer |
| |
|
typedef T & | reference |
| |
|
typedef size_t | size_type |
| |
|
typedef ptrdiff_t | difference_type |
| |
typedef
std::bidirectional_iterator_tag | iterator_category |
| |
|
typedef T | value_type |
| |
|
typedef T * | pointer |
| |
|
typedef T & | reference |
| |
|
typedef size_t | size_type |
| |
|
typedef ptrdiff_t | difference_type |
| |
typedef
std::bidirectional_iterator_tag | iterator_category |
| |
|
|
bool | skip_current_children_ |
| |
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.
Definition at line 130 of file tree.hh.
The documentation for this class was generated from the following file: