Public Member Functions

tree< T, tree_node_allocator >::post_order_iterator Class Reference

Depth-first iterator, first accessing the children, then the node itself. More...

#include <tree.hh>

Inheritance diagram for tree< T, tree_node_allocator >::post_order_iterator:
Inheritance graph
[legend]
Collaboration diagram for tree< T, tree_node_allocator >::post_order_iterator:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 post_order_iterator ()
 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_iteratoroperator++ ()
post_order_iteratoroperator-- ()
post_order_iterator operator++ (int)
post_order_iterator operator-- (int)
post_order_iteratoroperator+= (unsigned int)
post_order_iteratoroperator-= (unsigned int)
void descend_all ()
 Set iterator to the first child as deep as possible down the tree.

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::post_order_iterator

Depth-first iterator, first accessing the children, then the node itself.


Constructor & Destructor Documentation

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator (  ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator ( tree_node tn  ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator ( const iterator_base other  ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator ( const sibling_iterator other  ) 

Member Function Documentation

template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::post_order_iterator::descend_all (  ) 

Set iterator to the first child as deep as possible down the tree.

References tree_node_< T >::first_child, and tree< T, tree_node_allocator >::iterator_base::node.

template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::post_order_iterator::operator!= ( const post_order_iterator other  )  const
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator++ ( int   ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator++ (  ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator+= ( unsigned int  num  ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator-- (  ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator-- ( int   ) 
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator-= ( unsigned int  num  ) 
template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::post_order_iterator::operator== ( const post_order_iterator other  )  const

The documentation for this class was generated from the following file: