ITree Methods

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.

Set the parent and child index values for all children

Walk upwards and get first ancestor with this token type.

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.

Is there is a node above with token type ttype?

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.

Set ith child (0..n-1) to t; t must be non-null and non-nil node