An LVParseTree::Iterator Object traverses a parse tree in a top-to-bottom, left-to-right fashion (sometimes called a pre-order or LL traversal)
Use <LVSpeechPort2.h> or <LV_SRE_ParseTree.h>
|
Return Type |
Function |
Description |
|
|
|
|
|
|
Iterator(void) |
Constructs a blank Iterator; its not pointing over anything. |
|
|
Iterator(const Iterator& other) |
Copy constructor. |
|
LVParseTree::Iterator& |
operator=(const Iterator& other) |
Assignment operator. |
|
|
~Iterator(void) |
Destructor. |
|
|
|
|
|
LVParseTree::Iterator& |
operator ++ (void) |
pre-increments the iterator (++itr). |
|
LVParseTree::Iterator |
operator ++ (int) |
post-increments the iterator (itr++). |
|
const LVParseTree::Node* |
operator -> (void) |
provides pointer-like access to the node the iterator is currently over |
|
const LVParseTree::Node& |
operator * (void) |
provides access to the node the iterator is currently over |
|
bool |
operator == (const Iterator& other) |
Tests equality with another Iterator. Two Iterators are equal if they are pointing to the same node in the same tree. |
|
bool |
operator != (const Iterator& other) |
returns true if and only if the equality operator returns false. |
|
|
|
|
Complete Help Topic List | Speech Engine Product Information