LibOFX
|
Base class for iterators, only pointers stored, no traversal logic. More...
#include <tree.hh>
Public Types | |
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 |
Public Member Functions | |
iterator_base (tree_node *) | |
T & | operator* () const |
T * | operator-> () const |
void | skip_children () |
When called, the next increment/decrement skips children of this node. More... | |
unsigned int | number_of_children () const |
Number of children of the node pointed to by the iterator. More... | |
sibling_iterator | begin () const |
sibling_iterator | end () const |
Data Fields | |
tree_node * | node |
Protected Attributes | |
bool | skip_current_children_ |
Base class for iterators, only pointers stored, no traversal logic.
typedef ptrdiff_t tree< T, tree_node_allocator >::iterator_base::difference_type |
typedef std::bidirectional_iterator_tag tree< T, tree_node_allocator >::iterator_base::iterator_category |
typedef T* tree< T, tree_node_allocator >::iterator_base::pointer |
typedef T& tree< T, tree_node_allocator >::iterator_base::reference |
typedef size_t tree< T, tree_node_allocator >::iterator_base::size_type |
typedef T tree< T, tree_node_allocator >::iterator_base::value_type |
tree< T, tree_node_allocator >::iterator_base::iterator_base |
unsigned int tree< T, tree_node_allocator >::iterator_base::number_of_children |
T & tree< T, tree_node_allocator >::iterator_base::operator* |
T * tree< T, tree_node_allocator >::iterator_base::operator-> |
void tree< T, tree_node_allocator >::iterator_base::skip_children |
|
protected |