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 <LVSpeechPort.h> or <LV_SRE_ParseTree.h>
| Function |
Return Type |
Description |
| Iterator(void) |
|
Constructs a blank Iterator; its not pointing over anything. |
| Iterator(const Iterator& other) |
|
Copy constructor. |
| operator=(const Iterator& other) |
LVParseTree::Iterator& |
Assignment operator. |
| ~Iterator(void) |
|
Destructor. |
| operator ++ (void) |
LVParseTree::Iterator& |
pre-increments the iterator (++itr). |
| operator ++ (int) |
LVParseTree::Iterator |
post-increments the iterator (itr++). |
| operator -> (void) |
const LVParseTree::Node* |
provides pointer-like access to the node the iterator is currently over
( e.g const char* text = itr->Text( ) ) |
| operator * (void) |
const LVParseTree::Node& |
provides access to the node the iterator is currently over
(e.g. LVParseTree::Node n = *itr ) |
| operator == (const Iterator& other) |
bool |
Tests equality with another Iterator. Two Iterators are equal if they are pointing to the same node in the same tree. |
| operator != (const Iterator& other) |
bool |
returns true if and only if the equality operator returns false. |
