LibOFX
|
Depth-first iterator, first accessing the children, then the node itself. More...
Public Member Functions | |
post_order_iterator (tree_node *) | |
post_order_iterator (const iterator_base &) | |
post_order_iterator (const sibling_iterator &) | |
bool | operator== (const post_order_iterator &) const |
bool | operator!= (const post_order_iterator &) const |
post_order_iterator & | operator++ () |
post_order_iterator & | operator-- () |
post_order_iterator | operator++ (int) |
post_order_iterator | operator-- (int) |
post_order_iterator & | operator+= (unsigned int) |
post_order_iterator & | operator-= (unsigned int) |
void | descend_all () |
Set iterator to the first child as deep as possible down the tree. | |
post_order_iterator (tree_node *) | |
post_order_iterator (const iterator_base &) | |
post_order_iterator (const sibling_iterator &) | |
bool | operator== (const post_order_iterator &) const |
bool | operator!= (const post_order_iterator &) const |
post_order_iterator & | operator++ () |
post_order_iterator & | operator-- () |
post_order_iterator | operator++ (int) |
post_order_iterator | operator-- (int) |
post_order_iterator & | operator+= (unsigned int) |
post_order_iterator & | operator-= (unsigned int) |
void | descend_all () |
Set iterator to the first child as deep as possible down the tree. |
Depth-first iterator, first accessing the children, then the node itself.