| liborigin2
    29/08/2011
    | 
Depth-first iterator, first accessing the node, then its children. More...
#include <tree.hh>
 
  
 | Public Member Functions | |
| bool | operator!= (const pre_order_iterator &) const | 
| pre_order_iterator & | operator++ () | 
| pre_order_iterator | operator++ (int) | 
| pre_order_iterator & | operator+= (unsigned int) | 
| pre_order_iterator & | operator-- () | 
| pre_order_iterator | operator-- (int) | 
| pre_order_iterator & | operator-= (unsigned int) | 
| bool | operator== (const pre_order_iterator &) const | 
| pre_order_iterator () | |
| pre_order_iterator (tree_node *) | |
| pre_order_iterator (const iterator_base &) | |
| pre_order_iterator (const sibling_iterator &) | |
|  Public Member Functions inherited from tree< T, tree_node_allocator >::iterator_base | |
| sibling_iterator | begin () const | 
| sibling_iterator | end () const | 
| iterator_base () | |
| iterator_base (tree_node *) | |
| unsigned int | number_of_children () const | 
| Number of children of the node pointed to by the iterator.  More... | |
| T & | operator* () const | 
| T * | operator-> () const | 
| void | skip_children () | 
| When called, the next increment/decrement skips children of this node.  More... | |
| void | skip_children (bool skip) | 
| Additional Inherited Members | |
|  Public Types inherited from tree< T, tree_node_allocator >::iterator_base | |
| 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 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 * | tn | ) | 
| tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | const iterator_base & | other | ) | 
| tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator | ( | const sibling_iterator & | other | ) | 
| bool tree< T, tree_node_allocator >::pre_order_iterator::operator!= | ( | const pre_order_iterator & | other | ) | const | 
| 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 | ) | 
| tree< T, tree_node_allocator >::pre_order_iterator & tree< T, tree_node_allocator >::pre_order_iterator::operator+= | ( | unsigned int | num | ) | 
| 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 | ) | 
| tree< T, tree_node_allocator >::pre_order_iterator & tree< T, tree_node_allocator >::pre_order_iterator::operator-= | ( | unsigned int | num | ) | 
| bool tree< T, tree_node_allocator >::pre_order_iterator::operator== | ( | const pre_order_iterator & | other | ) | const | 
 1.8.10
 1.8.10