Iterator which traverses only the nodes which are siblings of each other. More...
#include <tree.hh>
Public Types | |
typedef ptrdiff_t | difference_type |
typedef std::bidirectional_iterator_tag | iterator_category |
typedef T * | pointer |
typedef T & | reference |
typedef size_t | size_type |
typedef T | value_type |
Public Member Functions | |
sibling_iterator () | |
sibling_iterator (tree_node *) | |
sibling_iterator (const iterator_base &) | |
sibling_iterator (const sibling_iterator &) | |
sibling_iterator | begin () const |
sibling_iterator | end () const |
unsigned int | number_of_children () const |
Number of children of the node pointed to by the iterator. | |
bool | operator!= (const sibling_iterator &) const |
T & | operator* () const |
sibling_iterator | operator++ (int) |
sibling_iterator & | operator++ () |
sibling_iterator & | operator+= (unsigned int) |
sibling_iterator & | operator-- () |
sibling_iterator | operator-- (int) |
sibling_iterator & | operator-= (unsigned int) |
T * | operator-> () const |
bool | operator== (const sibling_iterator &) const |
tree_node * | range_first () const |
tree_node * | range_last () const |
void | skip_children (bool skip) |
void | skip_children () |
When called, the next increment/decrement skips children of this node. | |
Public Attributes | |
tree_node * | node |
tree_node * | parent_ |
Protected Attributes | |
bool | skip_current_children_ |
Private Member Functions | |
void | set_parent_ () |
Iterator which traverses only the nodes which are siblings of each other.
Definition at line 265 of file tree.hh.