Tree::PostorderIterator Class Reference

#include <tree.h>

Inheritance diagram for Tree::PostorderIterator:

List of all members.

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

Public Member Functions
	PostorderIterator (int node_id, const Tree< T > *tree)
	Creates a new iterator rooted at <node_id>. The resulting traversal will ignore any parents of <node_id>.
virtual	~PostorderIterator ()
virtual Iterator &	operator++ ()
bool	operator== (const Iterator &other)
	Returns true iff <other> points to the same node.
bool	operator!= (const Iterator &other)
	Returns true iff <other> points to a different node.
int	operator * ()
int	id ()
Protected Attributes
int	node_id_
const Tree< T > *	source_tree_

---

Constructor & Destructor Documentation

PostorderIterator	(	int	node_id,
		const Tree< T > *	tree
	)

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

virtual ~PostorderIterator

(

)

[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.

bool operator!=

(

const Iterator &

other

)

[inline, inherited]

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

int operator *

(

)

[inline, inherited]

int id

(

)

[inline, inherited]

---

Member Data Documentation

int node_id_ [protected, inherited]

const Tree<T>* source_tree_ [protected, inherited]

---

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

• tree/tree.h
• tree/tree.cc

---