CompactTree
|
#include <compact_tree.h>
Public Member Functions | |
leaves_iterator (CT_NODE_T x, const compact_tree *const tp) | |
leaves_iterator (const leaves_iterator &it) | |
leaves_iterator & | operator= (const leaves_iterator &it) |
leaves_iterator & | operator++ () |
leaves_iterator | operator++ (int) |
bool | operator== (const leaves_iterator &rhs) const |
bool | operator!= (const leaves_iterator &rhs) const |
CT_NODE_T | operator* () |
Iterate over the leaves of this tree. Currently, leaves will be visited in the order they appear in the original Newick string.