OA::NewExprTree::PreOrderIterator Class Reference

#include <NewExprTree.hpp>

Inheritance diagram for OA::NewExprTree::PreOrderIterator:

Collaboration diagram for OA::NewExprTree::PreOrderIterator:

List of all members.

Public Member Functions
	PreOrderIterator (Tree &t)
virtual	~PreOrderIterator ()
OA_ptr< Node >	current () const

---

Detailed Description

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

Definition at line 408 of file NewExprTree.hpp.

---

Constructor & Destructor Documentation

OA::NewExprTree::PreOrderIterator::PreOrderIterator

(

Tree &

t

)

[inline]

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.

Reimplemented from OA::Tree::PreOrderIterator.

Definition at line 410 of file NewExprTree.hpp.

virtual OA::NewExprTree::PreOrderIterator::~PreOrderIterator

(

)

[inline, virtual]

Reimplemented from OA::Tree::PreOrderIterator.

Definition at line 411 of file NewExprTree.hpp.

---

Member Function Documentation

OA_ptr<Node> OA::NewExprTree::PreOrderIterator::current

(

)

const [inline]

Reimplemented from OA::Tree::PreOrderIterator.

Definition at line 412 of file NewExprTree.hpp.

References OA::OA_ptr< T >::convert(), and OA::n.

Here is the call graph for this function:

---

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

• NewExprTree.hpp