#include <Tree.hpp>

Inheritance diagram for OA::Tree::PreOrderIterator:

Collaboration diagram for OA::Tree::PreOrderIterator:

Public Member Functions
	PreOrderIterator (Tree &t)

virtual	~PreOrderIterator ()

void	operator++ ()

void	operator++ (int)

bool	isValid () const

OA_ptr< Node >	current () const

Public Member Functions inherited from OA::Iterator
	Iterator ()

virtual	~Iterator ()

void	operator++ (int)

Private Attributes
OA_ptr< Node >	p

Detailed Description

Pre-order iterator enumerates the nodes in pre-order (a node is visited before all its sub-trees).

Definition at line 396 of file Tree.hpp.

Constructor & Destructor Documentation

OA::Tree::PreOrderIterator::PreOrderIterator ( Tree & t)

PreOrderIterator creates an iterator to enumerate the tree nodes in pre-order. If this is the first time a pre-order traversal has been demanded for this tree, or the tree has changed since the last pre-order traversal, a pre-order walk is carried out using the recursive method create_preorder_links. This links up the nodes in pre-order and subsequent pre-order traversals simply follow the links.

Definition at line 73 of file Tree.cpp.

References OA::Tree::create_preorder_links(), OA::n, OA::Tree::Node::next_preorder, OA::Tree::node_set, OA::Tree::preorder_needed, OA::OA_ptr< T >::ptrEqual(), and OA::Tree::root_node.

Here is the call graph for this function: