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>
Function | Return Type | Description |
LVParseTree_Iterator_Create (void) | H_PARSE_TREE_ITR | Creates a blank Iterator; pointing at nothing. |
LVParseTree_Iterator_CreateFromCopy (H_PARSE_TREE_ITR Other) | H_PARSE_TREE_ITR | Creates a new Iterator from another. Both Iterators will need to be released when no longer needed. |
LVParseTree_Iterator_Copy (H_PARSE_TREE Iterator, H_PARSE_TREE_ITR Other) | void | Copies the data from one handle into another. |
LVParseTree_Iterator_Release (H_PARSE_TREE Iterator) | void | Releases the memory allocated to the Iterator handle. |
LVParseTree_Iterator_Advance (H_PARSE_TREE_ITR Iterator) | void | Advances the Iterator one position. |
LVParseTree_ChildrenIterator_IsPastEnd (H_PARSE_TREE_CHILDREN_ITR Itr) | int | Tests whether the iterator is past the end of the parse tree. |
LVParseTree_Iterator_GetNode (H_PARSE_TREE_ITR Iterator) | H_PARSE_TREE_NODE | Provides access to a node in the parse tree. |
LVParseTree_Iterator_AreEqual (H_PARSE_TREE_ITR Iterator1, H_PARSE_TREE_ITR Iterator2) | int | Tests equality with another Iterator. Two Iterators are equal if they are pointing to the same node in a parse tree. |