Package introspector.model

Class ArrayNode

java.lang.Object

introspector.model.AbstractNode

introspector.model.ArrayNode

All Implemented Interfaces:

Node, Serializable

public class ArrayNode
extends AbstractNode
implements Node

ArrayNode provides a Node implementation to represent any value whose type is an array.

See Also:

• Serialized Form

Constructor Summary

Constructors

Constructor	Description
ArrayNode(String name, Object value)
ArrayNode(String name, Object value, Class<?> type)

Method Summary

Modifier and Type	Method	Description
Set<Node>	compareTrees(Node node2, boolean equalName, Set<Node> modifiedNodes, Set<SymmetricPair<Node,Node>> alreadyTraversed)	Compare two trees and return the list of modified nodes.
List<Node>	getChildren()	An array node has as many children as elements in the array.
boolean	isLeaf()	An array node is not leaf.

Methods inherited from class introspector.model.AbstractNode

equals, getChild, getChildrenCount, getClassName, getIndexOfChild, getName, getNodeDescription, getType, getValue, hashCode, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface introspector.model.Node

getChild, getChildrenCount, getClassName, getIndexOfChild, getName, getNodeDescription, getType, getValue

Constructor Details

ArrayNode

public ArrayNode(String name,
 Object value)

See Also:

• AbstractNode(String, Object)

ArrayNode

public ArrayNode(String name,
 Object value,
 Class<?> type)

See Also:

• AbstractNode(String, Object, Class)

Method Details

isLeaf

public boolean isLeaf()

An array node is not leaf.

Specified by:

isLeaf in interface Node

Returns:

Whether the node is a leaf node (no children) or not

See Also:

• Node.isLeaf()

getChildren

public List<Node> getChildren()

An array node has as many children as elements in the array. A node is created for each child.

Specified by:

getChildren in class AbstractNode

Returns:

The children of this node (null if there are no children)

See Also:

• AbstractNode.getChildren()

compareTrees

public Set<Node> compareTrees(Node node2,
 boolean equalName,
 Set<Node> modifiedNodes,
 Set<SymmetricPair<Node,Node>> alreadyTraversed)

Description copied from interface: Node

Compare two trees and return the list of modified nodes.

Specified by:

compareTrees in interface Node

Overrides:

compareTrees in class AbstractNode

Parameters:

node2 - The node to compare with the other tree

equalName - Whether the node names must be the same or not (important for root nodes)

modifiedNodes - The list of modified nodes

alreadyTraversed - The list of nodes that have been visited in this traversal

Returns:

The list of modified nodes

See Also:

• Node.compareTrees(Node, boolean, Set, Set)