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). You can get an iterator over a subtree rooted at a Node by calling:
LVParseTree_Node_CreateIteratorBegin(H_PARSE_TREE_NODE Node)
LVParseTree_Node_CreateIteratorEnd(node)
Use <LVSpeechPort.h> or <LV_SRE_ParseTree.h>
|
Return Type |
Function |
Description |
|
|
|
|
|
H_PARSE_TREE_ITR |
LVParseTree_Iterator_Create(void) |
Creates a blank Iterator; its not pointing over anything. |
|
H_PARSE_TREE_ITR |
LVParseTree_Iterator_CreateFromCopy(H_PARSE_TREE_ITR Other) |
Creates a new Iterator from another. Both Iterators will need to be released when no longer needed. |
|
void |
LVParseTree_Iterator_Copy(H_PARSE_TREE Iterator, |
Copies the data from one handle into another. |
|
void |
LVParseTree_Iterator_Release(H_PARSE_TREE Iterator) |
Releases the memory allocated to the Iterator handle. |
|
|
|
|
|
void |
LVParseTree_Iterator_Advance(H_PARSE_TREE_ITR Iterator) |
Advances the Iterator one position. |
|
H_PARSE_TREE_NODE |
LVParseTree_Iterator_GetNode(H_PARSE_TREE_ITR Iterator) |
Provides access to a node in the parse tree. |
|
int |
LVParseTree_Iterator_AreEqual(H_PARSE_TREE_ITR Iterator1, |
Tests equality with another Iterator. Two Iterators are equal if they are pointing to the same node in a parse tree. |
|
|
|
|
Complete Help Topic List | Speech Engine Product Information