![]() |
App Engine Python SDK
v1.6.9 rev.445
The Python runtime is available as an experimental Preview feature.
|
warnings.warn( "Using create() is deprecated, use createWithPayload()", DeprecationWarning, stacklevel=2 ) More...
Public Member Functions | |
def | __init__ |
def | getChild |
def | getChildren |
def | getFirstChildWithType |
def | getChildCount |
def | addChild |
def | addChildren |
def | setChild |
def | deleteChild |
def | replaceChildren |
def | isNil |
def | freshenParentAndChildIndexes |
def | sanityCheckParentAndChildIndexes |
def | getChildIndex |
def | setChildIndex |
def | getParent |
def | setParent |
def | toStringTree |
def | getLine |
def | getCharPositionInLine |
def | toString |
![]() | |
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 |
Public Attributes | |
children | |
parent | |
childIndex | |
warnings.warn( "Using create() is deprecated, use createWithPayload()", DeprecationWarning, stacklevel=2 )
warnings.warn( "Using create() is deprecated, use createFromToken()", DeprecationWarning, stacklevel=2 ) warnings.warn( "Using create() is deprecated, use createFromToken()", DeprecationWarning, stacklevel=2 ) warnings.warn( "Using create() is deprecated, use createFromType()", DeprecationWarning, stacklevel=2 )
base implementation of Tree and TreeAdaptor
@brief A generic tree implementation with no payload. You must subclass to actually have any user data. ANTLR v3 uses a list of children approach instead of the child-sibling approach in v2. A flat tree (a list) is an empty node whose children represent the list. An empty, but non-null node is called "nil".
def google.appengine._internal.antlr3.tree.BaseTree.__init__ | ( | self, | |
node = None |
|||
) |
Create a new node from an existing node does nothing for BaseTree as there are no fields other than the children list, which cannot be copied as the children are not considered part of this node.
def google.appengine._internal.antlr3.tree.BaseTree.addChild | ( | self, | |
childTree | |||
) |
Add t as child of this node. Warning: if t has no children, but child does and child isNil then this routine moves children to t via t.children = child.children; i.e., without copying the array.
def google.appengine._internal.antlr3.tree.BaseTree.addChildren | ( | self, | |
children | |||
) |
Add all elements of kids list as children of this node
def google.appengine._internal.antlr3.tree.BaseTree.getChildIndex | ( | self | ) |
BaseTree doesn't track child indexes.
def google.appengine._internal.antlr3.tree.BaseTree.getChildren | ( | self | ) |
@brief Get the children internal List Note that if you directly mess with the list, do so at your own risk.
def google.appengine._internal.antlr3.tree.BaseTree.getParent | ( | self | ) |
BaseTree doesn't track parent pointers.
def google.appengine._internal.antlr3.tree.BaseTree.replaceChildren | ( | self, | |
startChildIndex, | |||
stopChildIndex, | |||
newTree | |||
) |
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.BaseTree.setChildIndex | ( | self, | |
index | |||
) |
BaseTree doesn't track child indexes.
def google.appengine._internal.antlr3.tree.BaseTree.setParent | ( | self, | |
t | |||
) |
BaseTree doesn't track parent pointers.
def google.appengine._internal.antlr3.tree.BaseTree.toString | ( | self | ) |
Override to say how a node (not a tree) should look as text
def google.appengine._internal.antlr3.tree.BaseTree.toStringTree | ( | self | ) |
Print out a whole tree not just a node