liborigin2 13/09/2010
|
Depth-first iterator, first accessing the children, then the node itself. More...
#include <tree.hh>
Public Member Functions | |
void | descend_all () |
Set iterator to the first child as deep as possible down the tree. | |
bool | operator!= (const post_order_iterator &) const |
post_order_iterator | operator++ (int) |
post_order_iterator & | operator++ () |
post_order_iterator & | operator+= (unsigned int) |
post_order_iterator & | operator-- () |
post_order_iterator | operator-- (int) |
post_order_iterator & | operator-= (unsigned int) |
bool | operator== (const post_order_iterator &) const |
post_order_iterator () | |
post_order_iterator (tree_node *) | |
post_order_iterator (const iterator_base &) | |
post_order_iterator (const sibling_iterator &) |
Depth-first iterator, first accessing the children, then the node itself.
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | ) |
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | tree_node * | tn | ) |
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | const iterator_base & | other | ) |
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | const sibling_iterator & | other | ) |
void tree< T, tree_node_allocator >::post_order_iterator::descend_all | ( | ) |
Set iterator to the first child as deep as possible down the tree.
bool tree< T, tree_node_allocator >::post_order_iterator::operator!= | ( | const post_order_iterator & | other | ) | const |
tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator++ | ( | int | ) |
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator++ | ( | ) |
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator+= | ( | unsigned int | num | ) |
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator-- | ( | ) |
tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator-- | ( | int | ) |
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator-= | ( | unsigned int | num | ) |
bool tree< T, tree_node_allocator >::post_order_iterator::operator== | ( | const post_order_iterator & | other | ) | const |