| Type Params | Return Type | Name and description | 
|---|---|---|
|  | CSTNode | add(CSTNode element)Adds an element to the node. | 
|  | Reduction | asReduction()Creates a Reductionfrom this node. | 
|  | CSTNode | get(int index)Returns the specified element, or null. | 
|  | Token | getRoot()Returns the root of the node, the Token that indicates it's type. | 
|  | boolean | isAnExpression()Returns true if the node is a complete expression. | 
|  | boolean | isEmpty()Returns true if the node is completely empty (no root, even). | 
|  | void | markAsExpression()Marks the node a complete expression. | 
|  | static Reduction | newContainer()Creates a new ReductionwithToken.NULLas it's root. | 
|  | CSTNode | remove(int index)Removes a node from the Reduction. | 
|  | CSTNode | set(int index, CSTNode element)Sets an element in at the specified index. | 
|  | int | size()Returns the number of elements in the node. | 
| Methods inherited from class | Name | 
|---|---|
| class CSTNode | add, addChildrenOf, asReduction, canMean, children, get, get, getDescription, getMeaning, getMeaningAs, getRoot, getRoot, getRootText, getStartColumn, getStartLine, getType, hasChildren, isA, isAllOf, isAnExpression, isEmpty, isOneOf, markAsExpression, set, setMeaning, size, toString, write, write | 
 Initializes the Reduction with the specified root.
     
 Creates a Reduction from this node.  Returns self if the
 node is already a Reduction.
     
Returns the specified element, or null.
Returns the root of the node, the Token that indicates it's type. Returns null if there is no root (usually only if the node is a placeholder of some kind -- see isEmpty()).
Returns true if the node is a complete expression.
Returns true if the node is completely empty (no root, even).
Marks the node a complete expression.
 Creates a new Reduction with Token.NULL
 as it's root.
     
 Removes a node from the Reduction.  You cannot remove
 the root node (index 0).
     
Returns the number of elements in the node.
Copyright © 2003-2021 The Apache Software Foundation. All rights reserved.