Iterator which traverses only the leaves. More...

#include <tree.hh>

Inheritance diagram for tree< T, tree_node_allocator >::leaf_iterator:

Public Member Functions
	leaf_iterator (tree_node , tree_node top=0)

	leaf_iterator (const sibling_iterator &)

	leaf_iterator (const iterator_base &)

bool	operator== (const leaf_iterator &) const

bool	operator!= (const leaf_iterator &) const

leaf_iterator &	operator++ ()

leaf_iterator &	operator-- ()

leaf_iterator	operator++ (int)

leaf_iterator	operator-- (int)

leaf_iterator &	operator+= (unsigned int)

leaf_iterator &	operator-= (unsigned int)

Public Member Functions 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
Public Types 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

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_

Detailed Description

Iterator which traverses only the leaves.

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

Public Member Functions