#include <compact_tree.h>

Inheritance diagram for compact_tree::preorder_iterator:

Collaboration diagram for compact_tree::preorder_iterator:

Public Member Functions
	preorder_iterator (CT_NODE_T x)

	preorder_iterator (const preorder_iterator &it)

preorder_iterator &	operator= (const preorder_iterator &it)

preorder_iterator &	operator++ ()

preorder_iterator	operator++ (int)

bool	operator== (const preorder_iterator &rhs) const

bool	operator!= (const preorder_iterator &rhs) const

CT_NODE_T	operator* ()

Detailed Description

Pre-order traversal iterator. The only guarantee is that a node will be visited before its children. Currently, nodes will be visited in the order they appear in the original Newick string.

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

CompactTree/compact_tree.h

Public Member Functions

Detailed Description