Property Detail

• java.util.LinkedList<TreeNode<T>> children

  Nodes children.

• T data

  Node's data.

• static final org.gradle.api.logging.Logger log

• java.util.LinkedList<TreeNode<T>> parents

  Nodes parents.

Constructor Detail

• TreeNode(T data)

  Constructs a TreeNode with 0 parents and 0 children.

  Parameters:

  data - data for TreeNode

• TreeNode(T data, java.util.LinkedList<TreeNode<T>> parents)

  Constructs a TreeNode with parents and 0 children. Sets this tree node as the child of all parents to make a dual sided relationship.

  Parameters:

  data - contents for TreeNode

  parents - parents of the node-to-be

• TreeNode(T data, TreeNode<T> parent)

  Constructs a TreeNode with 1 parent and 0 children. Set this tree node as the parent's child to make a dual sided relationship.

  Parameters:

  data - contents for TreeNode

  parents - parents of the node-to-be

Method Detail

• void addChild(TreeNode<T> child, boolean twoWayRelationship)

  Adds a child to the current node. If a two way relationship is desired, child references this node as a parent, and parent has as reference to this child. true creates this dual relationship, false creates a one sided relationship.

  This comes in handy when a node depends on ancestors of the parent, the child needs to reference the ancestor as a parent, but the reverse would allow the node to be parsed far too early.

  Parameters:

  child - child to add to this node

  twoWayRelationship - create a dual sided (two way) relationship

• void addParent(TreeNode<T> parent, boolean twoWayRelationship)

  Adds a parent to the current node. If a two way relationship is desired, this node references the parent and the parent has a reference to this node as a child. true creates this dual relationship, false creates a one sided relationship.

  This comes in handy when a node depends on ancestors of the parent, the child needs to reference the ancestor as a parent, but the reverse would allow the node to be parsed far too early.

  Parameters:

  parent - parent to add to this node

  twoWayRelationship - create a dual sided (two way) relationship

• boolean equals(java.lang.Object other)

  Compares this node to another node. Need to compare children AND parents. But not delve into them. Just checking their size is sufficient. If they are traversed, it leads to an infinite loop in this comparison.

  Parameters:

  other - node to compare against this one

• java.util.Set<TreeNode<T>> getAncestors()

  Get ancestors, depth first. Nodes could be duplicates depending on the ancestry path -- a set is necessary.

  Returns:

  node ancestors of current node

• int hashCode()

  Generates the hash code for this node.

  Returns:

  this node's hash cod

• java.lang.String toString()