StRoot
1
|
#include <StiKTNIterator.h>
Public Member Functions | |
StiKTNIterator (KTN_t *leaf=0, int dir=0) | |
ctr-dstr | |
StiKTNIterator (KTN_t &leaf, int dir=0) | |
StiKTNIterator | begin () |
StiKTNIterator | rbegin () |
bool | operator== (const StiKTNIterator &rhs) const |
equality: | |
bool | operator!= (const StiKTNIterator &rhs) const |
inequlity | |
KTN_t & | operator* () |
KTN_t * | operator() () |
StiKTNIterator & | operator++ () |
prefix More... | |
StiKTNIterator | operator++ (int) |
postfix More... | |
StiKTNIterator & | operator-- () |
prefix More... | |
StiKTNIterator | operator-- (int) |
postfix More... | |
Static Public Member Functions | |
static const StiKTNIterator & | end () |
We demarcate the end of the traversal via a singular iterator. | |
static const StiKTNIterator & | rend () |
static StiKTNIterator | begin (KTN_t *fist) |
static StiKTNIterator | rbegin (KTN_t *last) |
This class is an STL compliant forward iterator that will traverse from the leaf of a tree upward to a root.
Definition at line 25 of file StiKTNIterator.h.
|
inline |
prefix
In the case where the prefix operator increments beyond the last leaf of the tree, the pointer to mNode is set to -. This demarcates the end of traversal.
Definition at line 126 of file StiKTNIterator.h.
References StiTreeNode::getNextNode().
|
inline |
postfix
In the case where the prefix operator increments beyond the root of the tree, the pointer to mNode is set to 0. This demarcates the end of the traversal.
Definition at line 115 of file StiKTNIterator.h.
|
inline |
prefix
In the case where the prefix operator increments beyond the root of the tree, the pointer to mNode is set to 0. This demarcates the end of the traversal.
Definition at line 102 of file StiKTNIterator.h.
|
inline |
postfix
In the case where the prefix operator increments beyond the root of the tree, the pointer to mNode is set to 0. This demarcates the end of the traversal.
Definition at line 145 of file StiKTNIterator.h.