public class ArrayValue extends AbstractNode<ArrayValue> implements Value<ArrayValue>
Constructor and Description |
---|
ArrayValue() |
ArrayValue(java.util.List<Value> values) |
Modifier and Type | Method and Description |
---|---|
TraversalControl |
accept(TraverserContext<Node> context,
NodeVisitor visitor)
Double-dispatch entry point.
|
ArrayValue |
deepCopy() |
java.util.List<Node> |
getChildren() |
java.util.List<Value> |
getValues() |
boolean |
isEqualTo(Node o)
Compares just the content and not the children.
|
void |
setValues(java.util.List<Value> values) |
java.lang.String |
toString() |
deepCopy, deepCopy, getComments, getSourceLocation, setComments, setSourceLocation
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
getComments, getSourceLocation
public ArrayValue()
public ArrayValue(java.util.List<Value> values)
public java.util.List<Value> getValues()
public void setValues(java.util.List<Value> values)
public java.util.List<Node> getChildren()
getChildren
in interface Node<ArrayValue>
public boolean isEqualTo(Node o)
Node
isEqualTo
in interface Node<ArrayValue>
o
- the other node to compare topublic java.lang.String toString()
toString
in class java.lang.Object
public ArrayValue deepCopy()
deepCopy
in interface Node<ArrayValue>
deepCopy
in interface Value<ArrayValue>
public TraversalControl accept(TraverserContext<Node> context, NodeVisitor visitor)
Node
instanceOf
check when decision based on the actual
type of Node is needed, which happens redundantly during traversing AST.
Additional advantage of this pattern is to decouple tree traversal mechanism
from the code that needs to be executed when traversal "visits" a particular Node
in the tree. This leads to a better code re-usability and maintainability.accept
in interface Node<ArrayValue>
context
- TraverserContext bound to this Node objectvisitor
- Visitor instance that performs actual processing on the Nodes(s)