|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.abego.treelayout.util.AbstractTreeForTreeLayout<TreeNode>
org.abego.treelayout.util.DefaultTreeForTreeLayout<TreeNode>
TreeNode - public class DefaultTreeForTreeLayout<TreeNode>
Provides a generic implementation for the TreeForTreeLayout
interface, applicable to any type of tree node.
It allows you to create a tree "from scratch", without creating any new class.
To create a tree you must provide the root of the tree (see
DefaultTreeForTreeLayout(Object). Then you can incrementally
construct the tree by adding children to the root or other nodes of the tree
(see addChild(Object, Object) and
addChildren(Object, Object...)).
| Constructor Summary | |
|---|---|
DefaultTreeForTreeLayout(TreeNode root)
Creates a new instance with a given node as the root |
|
| Method Summary | |
|---|---|
void |
addChild(TreeNode parentNode,
TreeNode node)
|
void |
addChildren(TreeNode parentNode,
TreeNode... nodes)
|
List<TreeNode> |
getChildrenList(TreeNode node)
Return the children of a node as a List. |
TreeNode |
getParent(TreeNode node)
Returns the parent of a node, if it has one. |
boolean |
hasNode(TreeNode node)
|
| Methods inherited from class org.abego.treelayout.util.AbstractTreeForTreeLayout |
|---|
getChildren, getChildrenReverse, getFirstChild, getLastChild, getRoot, isChildOfParent, isLeaf |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public DefaultTreeForTreeLayout(TreeNode root)
root - the node to be used as the root.| Method Detail |
|---|
public TreeNode getParent(TreeNode node)
AbstractTreeForTreeLayoutTime Complexity: O(1)
getParent in class AbstractTreeForTreeLayout<TreeNode>public List<TreeNode> getChildrenList(TreeNode node)
AbstractTreeForTreeLayoutList.
Time Complexity: O(1)
Also the access to an item of the list must have time complexity O(1).
A client must not modify the returned list.
getChildrenList in class AbstractTreeForTreeLayout<TreeNode>public boolean hasNode(TreeNode node)
node -
public void addChild(TreeNode parentNode,
TreeNode node)
parentNode - [hasNode(parentNode)]node - [!hasNode(node)]
public void addChildren(TreeNode parentNode,
TreeNode... nodes)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||