Depth-first iterator, first accessing the children, then the node itself. Подробнее...

#include <tree.h>

Граф наследования:tree< T, tree_node_allocator >::post_order_iterator:

Граф связей класса tree< T, tree_node_allocator >::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_iterator &	operator++ ()

post_order_iterator &	operator-- ()

post_order_iterator	operator++ (int)

post_order_iterator	operator-- (int)

post_order_iterator &	operator+= (unsigned int)

post_order_iterator &	operator-= (unsigned int)

void	descend_all ()
	Set iterator to the first child as deep as possible down the tree.

Открытые члены inherited from tree< T, tree_node_allocator >::iterator_base
	iterator_base (tree_node *)

T &	operator* () const

T *	operator-> () const

void	skip_children ()
	When called, the next increment/decrement skips children of this node.

void	skip_children (bool skip)

unsigned int	number_of_children () const
	Number of children of the node pointed to by the iterator.

sibling_iterator	begin () const

sibling_iterator	end () const

Additional Inherited Members
Открытые типы inherited from tree< T, tree_node_allocator >::iterator_base
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

Открытые атрибуты inherited from tree< T, tree_node_allocator >::iterator_base
tree_node *	node

Защищенные данные inherited from tree< T, tree_node_allocator >::iterator_base
bool	skip_current_children_

Подробное описание

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

Объявления и описания членов класса находятся в файле:

Открытые члены