Tree::BreadthFirstIterator Class Reference

#include <tree.h>

Inheritance diagram for Tree::BreadthFirstIterator:

Tree::Iterator List of all members.

Detailed Description

template<class T>
class libpmk::Tree< T >::BreadthFirstIterator

Breadth-first iterator for Trees.


Public Member Functions

 BreadthFirstIterator (T *node)
virtual ~BreadthFirstIterator ()
virtual Iteratoroperator++ ()
bool operator== (const Iterator &other)
 Returns true iff <other> points to the same node in memory.
bool operator!= (const Iterator &other)
 Returns true iff <other> points to a different node in memory.
T * operator-> ()
 Accesses the pointer to the TreeNode.
T * get ()
 Returns a pointer to the TreeNode.

Protected Attributes

TreeNodenode_


Constructor & Destructor Documentation

BreadthFirstIterator ( T *  node  )  [inline]

Creates a new iterator rooted at <node>. The resulting traversal will ignore any parents of <node>.

virtual ~BreadthFirstIterator (  )  [inline, virtual]


Member Function Documentation

Tree< T >::Iterator & operator++ (  )  [virtual]

Implements Tree::Iterator.

bool operator== ( const Iterator other  )  [inline, inherited]

Returns true iff <other> points to the same node in memory.

bool operator!= ( const Iterator other  )  [inline, inherited]

Returns true iff <other> points to a different node in memory.

T* operator-> (  )  [inline, inherited]

Accesses the pointer to the TreeNode.

T* get (  )  [inline, inherited]

Returns a pointer to the TreeNode.


Member Data Documentation

TreeNode* node_ [protected, inherited]


The documentation for this class was generated from the following files:
Generated on Wed May 2 11:17:13 2007 for libpmk by  doxygen 1.5.1