Walk the entire tree and make a node name to nodes mapping.
For now, use recursion but later nonrecursive version may be
more efficient. Returns Map<Integer, List> where the List is
of your AST node type. The Integer is the token type of the node.
Namespace:
Stimulsoft.Data.Expressions.Antlr.Runtime.Tree
Assembly:
Stimulsoft.Data (in Stimulsoft.Data.dll) Version: 2019.3.1.0
Syntaxpublic IDictionary<int, IList> Index(
Object t
)
Public Function Index (
t As Object
) As IDictionary(Of Integer, IList)
Parameters
- t
- Type: SystemObject
[Missing <param name="t"/> documentation for "M:Stimulsoft.Data.Expressions.Antlr.Runtime.Tree.TreeWizard.Index(System.Object)"]
Return Value
Type:
IDictionaryInt32,
IList[Missing <returns> documentation for "M:Stimulsoft.Data.Expressions.Antlr.Runtime.Tree.TreeWizard.Index(System.Object)"]
Remarks
TODO: save this index so that find and visit are faster
See Also