Modifier and Type | Class and Description |
---|---|
static class |
Node.PlanVORec<T> |
Modifier and Type | Field and Description |
---|---|
java.util.List<Node<T>> |
children |
T |
data |
Node<T> |
parent |
static int |
SKIP
Use this constant to skip the current node only.
|
static int |
SKIP_CHILDRENS_KEEP_PARENT
Use this constant to skip the childrens of a parent.
|
static int |
SKIP_INCLUDING_ALL_CHILDRENS
Use this constant to skip the current node along with all of its childrens.
|
Modifier and Type | Method and Description |
---|---|
Node<T> |
addChild(Node<T> node)
Adds a child node to the current node.
|
void |
addChild(java.util.Stack<T> hierarchy)
Adds the hierarchy of objects to the current Node.
|
Node<T> |
addChild(T child)
Adds a child to the current node.
|
boolean |
equals(java.lang.Object toCompare)
Compares is the given Node is equal to the current node.
|
Node<T> |
findNode(java.util.Comparator<T> cmp,
java.lang.String defName,
java.lang.String defType,
java.lang.String conflictElm)
Finds a matching node using the comparator and defname,deftype,conflictElement.
|
Node<T> |
findNode(java.util.Comparator<T> cmp,
T toCompare)
Finds a matching node using the comparator.
|
int |
getLevel()
Returns the depth of the current node as part of the tree.
|
Node<T> |
getParentNode(Node<T> node)
Returns the parent node for a given node.
|
java.util.Comparator<T> |
getSearchNodeComparator()
Returns the comparator for the purpose of searching a node
within the tree.
|
boolean |
isLeaf()
Check to see if a node is leaf
|
boolean |
isRoot()
Check to see if a node is root
|
java.util.Iterator<Node<T>> |
iterator()
Returns the iterator for iterating the node.
|
java.lang.String |
printTree()
Prints the tree representation of this node.
|
void |
registerChildForSearch(Node<T> node)
Adds this node in the tree hierarchy so that it can be searched using findnode API
|
void |
setSkip(int skip)
Mark the node to be skipped
|
int |
skip()
Returns current skip status of this node.
|
java.lang.String |
toString()
Returns the string representation of a Node.
|
public T data
public static final int SKIP
public static final int SKIP_INCLUDING_ALL_CHILDRENS
public static final int SKIP_CHILDRENS_KEEP_PARENT
public Node(T data)
public boolean isRoot()
public boolean isLeaf()
public java.util.Comparator<T> getSearchNodeComparator()
public Node<T> addChild(T child)
child
- public Node<T> addChild(Node<T> node)
node
- public void addChild(java.util.Stack<T> hierarchy)
hierarchy
- Stack containing objects that needs to be added to the current node.public int getLevel()
public void registerChildForSearch(Node<T> node)
node
- public Node<T> findNode(java.util.Comparator<T> cmp, T toCompare)
cmp
- Comparator to be used for comparingtoCompare
- Object to be comparedpublic Node<T> findNode(java.util.Comparator<T> cmp, java.lang.String defName, java.lang.String defType, java.lang.String conflictElm)
cmp
- Comparator to be used for comparingdefName
- defName to be compareddefType
- defType to be comparedconflictElm
- conflictElm to be comparedpublic Node<T> getParentNode(Node<T> node)
node
- public java.lang.String printTree()
public java.lang.String toString()
toString
in class java.lang.Object
public boolean equals(java.lang.Object toCompare)
equals
in class java.lang.Object
toCompare
- public void setSkip(int skip)
skip
- use SKIP to mark the current node as skip
use SKIP_INCLUDING_ALL_CHILDRENS to mark the entire node with all its children as skippublic int skip()