![]() |
App Engine Python SDK
v1.6.9 rev.445
The Python runtime is available as an experimental Preview feature.
|
Public Member Functions | |
def | getChild |
def | getChildCount |
def | getParent |
def | setParent |
def | getChildIndex |
def | setChildIndex |
def | freshenParentAndChildIndexes |
def | addChild |
def | setChild |
def | deleteChild |
def | replaceChildren |
def | isNil |
def | getTokenStartIndex |
def | setTokenStartIndex |
def | getTokenStopIndex |
def | setTokenStopIndex |
def | dupNode |
def | getType |
def | getText |
def | getLine |
def | getCharPositionInLine |
def | toStringTree |
def | toString |
@brief Abstract baseclass for tree nodes. What does a tree look like? ANTLR has a number of support classes such as CommonTreeNodeStream that work on these kinds of trees. You don't have to make your trees implement this interface, but if you do, you'll be able to use more support code. NOTE: When constructing trees, ANTLR can build any kind of tree; it can even use Token objects as trees if you add a child list to your tokens. This is a tree node without any payload; just navigation and factory stuff.
def google.appengine._internal.antlr3.tree.Tree.addChild | ( | self, | |
t | |||
) |
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.
def google.appengine._internal.antlr3.tree.Tree.freshenParentAndChildIndexes | ( | self | ) |
Set the parent and child index values for all children
def google.appengine._internal.antlr3.tree.Tree.getChildIndex | ( | self | ) |
This node is what child index? 0..n-1
def google.appengine._internal.antlr3.tree.Tree.getLine | ( | self | ) |
In case we don't have a token payload, what is the line for errors?
def google.appengine._internal.antlr3.tree.Tree.getParent | ( | self | ) |
Tree tracks parent and child index now > 3.0
def google.appengine._internal.antlr3.tree.Tree.getTokenStartIndex | ( | self | ) |
What is the smallest token index (indexing from 0) for this node and its children?
def google.appengine._internal.antlr3.tree.Tree.getTokenStopIndex | ( | self | ) |
What is the largest token index (indexing from 0) for this node and its children?
def google.appengine._internal.antlr3.tree.Tree.getType | ( | self | ) |
Return a token type; needed for tree parsing.
def google.appengine._internal.antlr3.tree.Tree.isNil | ( | self | ) |
Indicates the node is a nil node but may still have children, meaning the tree is a flat list.
def google.appengine._internal.antlr3.tree.Tree.replaceChildren | ( | self, | |
startChildIndex, | |||
stopChildIndex, | |||
t | |||
) |
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.
def google.appengine._internal.antlr3.tree.Tree.setChild | ( | self, | |
i, | |||
t | |||
) |
Set ith child (0..n-1) to t; t must be non-null and non-nil node
def google.appengine._internal.antlr3.tree.Tree.setChildIndex | ( | self, | |
index | |||
) |
This node is what child index? 0..n-1
def google.appengine._internal.antlr3.tree.Tree.setParent | ( | self, | |
t | |||
) |
Tree tracks parent and child index now > 3.0