An LVParseTree::ChildrenIterator Object traverses the immediate children of a rule node, from left to right. You get a ChildrenIterator object from a Node by calling
LVParseTree::Node::ChildrenBegin()
and
LVParseTree::Node::ChildrenEnd()
Use <LVSpeechPort.h> or <LV_SRE_ParseTree.h>
Function |
Return Type |
Description |
Iterator(void) |
|
Constructs a blank ChildrenIterator; its not pointing over anything. |
Iterator(const ChildrenIterator& other) |
|
Copy constructor. |
operator=(const ChildrenIterator& other) |
LVParseTree::ChildrenIterator& |
Assignment operator. |
~ChildrenIterator(void) |
|
Destructor. |
operator ++ (void) |
LVParseTree::ChildrenIterator& |
pre-increments the iterator (++itr). |
operator ++ (int) |
LVParseTree::ChildrenIterator |
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 ChildrenIterator& other) |
bool |
Tests equality with another ChildrenIterator. Two ChildrenIterators are equal if they are pointing
to the same node in the same tree. (e.g if itr1 == itr2 do something) |
operator!=(const ChildrenIterator& other) |
bool |
returns true if and only if the equality operator returns false. |