SparseTree::PreorderIterator Class Reference

#include <sparse-tree.h>

Inheritance diagram for SparseTree::PreorderIterator:

List of all members.

---

Detailed Description

template<class T>
class libpmk::SparseTree< T >::PreorderIterator

Preorder depth-first iterator for SparseTrees.

Public Member Functions
	PreorderIterator (T *node)
virtual	~PreorderIterator ()
virtual Iterator &	operator++ ()
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 SparseTreeNode.
T *	get ()
	Returns a pointer to the SparseTreeNode.
Protected Attributes
SparseTreeNode *	node_

---

Constructor & Destructor Documentation

PreorderIterator

(

T *

node

)

[inline]

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

virtual ~PreorderIterator

(

)

[inline, virtual]

---

Member Function Documentation

SparseTree< T >::Iterator & operator++

(

)

[virtual]

Implements SparseTree::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 SparseTreeNode.

T* get

(

)

[inline, inherited]

Returns a pointer to the SparseTreeNode.

---

Member Data Documentation

SparseTreeNode* node_ [protected, inherited]

---

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

• tree/sparse-tree.h
• tree/sparse-tree.cc

---