SparseTree::Iterator Class Reference

#include <sparse-tree.h>

Inheritance diagram for SparseTree::Iterator:

List of all members.

---

Detailed Description

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

An iterator for SparseTrees.

Public Member Functions
	Iterator (SparseTreeNode *node)
	Creates a new iterator pointing at the given node.
virtual	~Iterator ()
Iterator &	operator= (const Iterator &other)
	Copy assignment 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.
virtual Iterator &	operator++ ()=0
Protected Attributes
SparseTreeNode *	node_

---

Constructor & Destructor Documentation

Iterator

(

SparseTreeNode *

node

)

[inline]

Creates a new iterator pointing at the given node.

virtual ~Iterator

(

)

[inline, virtual]

---

Member Function Documentation

Iterator& operator=

(

const Iterator &

other

)

[inline]

Copy assignment operator.

bool operator==

(

const Iterator &

other

)

[inline]

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

bool operator!=

(

const Iterator &

other

)

[inline]

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

T* operator->

(

)

[inline]

Accesses the pointer to the SparseTreeNode.

T* get

(

)

[inline]

Returns a pointer to the SparseTreeNode.

virtual Iterator& operator++

(

)

[pure virtual]

Implemented in SparseTree::PreorderIterator, SparseTree::PostorderIterator, and SparseTree::BreadthFirstIterator.

---

Member Data Documentation

SparseTreeNode* node_ [protected]

---

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

• tree/sparse-tree.h

---