T - The type of the wrapped data of the tree node.public abstract class AbstractTreeModel<T> extends Object implements TreeModel<T>
TreeModel. Implementors basically only need to implement createChildren()
wherein a concrete instance of the desired underlying Collection is returned.ListTreeModel,
SortedTreeModel,
Serialized Form| Constructor and Description |
|---|
AbstractTreeModel() |
| Modifier and Type | Method and Description |
|---|---|
TreeModel<T> |
addChild(T data)
Creates and adds a child tree node with the given wrapped data to the current tree node.
|
TreeModel<T> |
addChildNode(TreeModel<T> child)
Adds the given child tree node to the current tree node.
|
protected abstract Collection<TreeModel<T>> |
createChildren()
Returns a concrete (and usually empty)
Collection instance which should hold the tree's children. |
boolean |
equals(Object object) |
int |
getChildCount()
Returns the count of the children of the current tree node.
|
List<TreeModel<T>> |
getChildren()
Returns an unmodifiable list of all child tree nodes of the current tree node.
|
T |
getData()
Returns the wrapped data of the current tree node.
|
String |
getIndex()
Returns the zero-based unique index of the current tree node.
|
int |
getLevel()
Returns the level of the current tree node.
|
TreeModel<T> |
getNextSibling()
Returns the next tree node sibling of the current tree node.
|
TreeModel<T> |
getParent()
Returns the parent tree node of the current tree node.
|
TreeModel<T> |
getPreviousSibling()
Returns the previous tree node sibling of the current tree node.
|
int |
hashCode() |
boolean |
isFirst()
Returns whether the current tree node is the first child of its parent, if any.
|
boolean |
isLast()
Returns whether the current tree node is the last child of its parent, if any.
|
boolean |
isLeaf()
Returns whether the current tree node is a leaf node.
|
boolean |
isRoot()
Returns whether the current tree node is the root node.
|
Iterator<TreeModel<T>> |
iterator()
Returns an unmodifiable iterator over the children of the current tree node.
|
TreeModel<T> |
remove()
Removes the current tree node from its parent, if any.
|
void |
setData(T data)
Sets the wrapped data of the current tree node.
|
String |
toString() |
protected abstract Collection<TreeModel<T>> createChildren()
Collection instance which should hold the tree's children.Collection instance which should hold the tree's children.public void setData(T data)
TreeModelpublic TreeModel<T> addChild(T data)
TreeModelpublic TreeModel<T> addChildNode(TreeModel<T> child)
TreeModeladdChildNode in interface TreeModel<T>child - The child tree node to be added.public TreeModel<T> remove()
TreeModelpublic T getData()
TreeModelpublic TreeModel<T> getParent()
TreeModelnull if there is none.public TreeModel<T> getNextSibling()
TreeModelnull if there is none.getNextSibling in interface TreeModel<T>public TreeModel<T> getPreviousSibling()
TreeModelnull if there is none.getPreviousSibling in interface TreeModel<T>public int getChildCount()
TreeModelgetChildCount in interface TreeModel<T>public List<TreeModel<T>> getChildren()
TreeModelTreeModel.addChild(Object) method on the
tree node parent. Removing children should be done by the TreeModel.remove() method on the tree node itself.getChildren in interface TreeModel<T>public Iterator<TreeModel<T>> iterator()
TreeModelpublic int getLevel()
TreeModelpublic String getIndex()
TreeModelnull. The first child has
index 0. The second child of first child has index 0_1. The first child of second child
of third child has index 2_1_0.public boolean isRoot()
TreeModelpublic boolean isLeaf()
TreeModelpublic boolean isFirst()
TreeModelpublic boolean isLast()
TreeModel