ITree Interface | 
Namespace: Stimulsoft.Data.Expressions.Antlr.Runtime.Tree
The ITree type exposes the following members.
| Name | Description | |
|---|---|---|
| CharPositionInLine | ||
| ChildCount | ||
| ChildIndex | This node is what child index? 0..n-1  | |
| IsNil | 
            Indicates the node is a nil node but may still have children, meaning
            the tree is a flat list.
              | |
| Line | In case we don't have a token payload, what is the line for errors?  | |
| Parent | ||
| Text | ||
| TokenStartIndex | 
            What is the smallest token index (indexing from 0) for this node
            and its children?
              | |
| TokenStopIndex | 
            What is the largest token index (indexing from 0) for this node
            and its children?
              | |
| Type | Return a token type; needed for tree parsing  | 
| Name | Description | |
|---|---|---|
| AddChild | 
            Add t as a child to this node.  If t is null, do nothing.  If t
            is nil, add all children of t to this' children.
              | |
| DeleteChild | ||
| DupNode | ||
| FreshenParentAndChildIndexes | Set the parent and child index values for all children  | |
| GetAncestor | Walk upwards and get first ancestor with this token type.  | |
| GetAncestors | 
            Return a list of all ancestors of this node.  The first node of
            list is the root and the last is the parent of this node.
              | |
| GetChild | ||
| HasAncestor | Is there is a node above with token type ttype?  | |
| ReplaceChildren | 
            Delete children from start to stop and replace with t even if t is
            a list (nil-root tree).  num of children can increase or decrease.
            For huge child lists, inserting children can force walking rest of
            children to set their childindex; could be slow.
              | |
| SetChild | Set ith child (0..n-1) to t; t must be non-null and non-nil node  | |
| ToString | ||
| ToStringTree |