Depth-first iterator, first accessing the node, then its children. More...
#include <tree.h>
Additional Inherited Members | |
Public Types inherited from tree< T, tree_node_allocator >::iterator_base | |
typedef ptrdiff_t | difference_type |
typedef ptrdiff_t | difference_type |
typedef std::bidirectional_iterator_tag | iterator_category |
typedef std::bidirectional_iterator_tag | iterator_category |
typedef T * | pointer |
typedef T * | pointer |
typedef T & | reference |
typedef T & | reference |
typedef size_t | size_type |
typedef size_t | size_type |
typedef T | value_type |
typedef T | value_type |
Public Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
tree_node * | node |
Protected Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
bool | skip_current_children_ |
Depth-first iterator, first accessing the node, then its children.
tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | ) |
tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | tree_node * | ) |
tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | const iterator_base & | ) |
tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | const sibling_iterator & | ) |
tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | ) |
tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | tree_node * | ) |
bool tree< T, tree_node_allocator >::pre_order_iterator::operator!= | ( | const pre_order_iterator & | ) | const |
bool tree< T, tree_node_allocator >::pre_order_iterator::operator!= | ( | const pre_order_iterator & | ) | const |
pre_order_iterator& tree< T, tree_node_allocator >::pre_order_iterator::operator++ | ( | ) |
pre_order_iterator tree< T, tree_node_allocator >::pre_order_iterator::operator++ | ( | int | ) |
tree< T, tree_node_allocator >::pre_order_iterator & tree< T, tree_node_allocator >::pre_order_iterator::operator++ | ( | ) |
tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::pre_order_iterator::operator++ | ( | int | ) |
pre_order_iterator& tree< T, tree_node_allocator >::pre_order_iterator::operator+= | ( | unsigned | int | ) |
pre_order_iterator& tree< T, tree_node_allocator >::pre_order_iterator::operator+= | ( | unsigned | int | ) |
pre_order_iterator& tree< T, tree_node_allocator >::pre_order_iterator::operator-- | ( | ) |
pre_order_iterator tree< T, tree_node_allocator >::pre_order_iterator::operator-- | ( | int | ) |
tree< T, tree_node_allocator >::pre_order_iterator & tree< T, tree_node_allocator >::pre_order_iterator::operator-- | ( | ) |
tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::pre_order_iterator::operator-- | ( | int | ) |
pre_order_iterator& tree< T, tree_node_allocator >::pre_order_iterator::operator-= | ( | unsigned | int | ) |
pre_order_iterator& tree< T, tree_node_allocator >::pre_order_iterator::operator-= | ( | unsigned | int | ) |
bool tree< T, tree_node_allocator >::pre_order_iterator::operator== | ( | const pre_order_iterator & | ) | const |
bool tree< T, tree_node_allocator >::pre_order_iterator::operator== | ( | const pre_order_iterator & | ) | const |