LibOFX
|
Depth-first iterator, first accessing the children, then the node itself. More...
#include <tree.hh>
Additional Inherited Members | |
![]() | |
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 |
![]() | |
tree_node * | node |
![]() | |
bool | skip_current_children_ |
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 | ( | 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 |
bool tree< T, tree_node_allocator >::post_order_iterator::operator!= | ( | const post_order_iterator & | other | ) | const |
bool tree< T, tree_node_allocator >::post_order_iterator::operator== | ( | const post_order_iterator & | other | ) | const |