All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class com.sun.java.swing.tree.DefaultMutableTreeNode

java.lang.Object
   |
   +----com.sun.java.swing.tree.DefaultMutableTreeNode

public class DefaultMutableTreeNode

extends Object

implements Cloneable, MutableTreeNode, Serializable

A DefaultMutableTreeNode is a general-purpose node in a tree data structure. A tree node may have at most one parent and 0 or more children. DefaultMutableTreeNode provides operations for examining and modifying a node's parent and children and also operations for examining the tree that the node is a part of. A node's tree is the set of all nodes that can be reached by starting at the node and following all the possible links to parents and children. A node with no parent is the root of its tree; a node with no children is a leaf. A tree may consist of many subtrees, each node acting as the root for its own subtree.

This class provides enumerations for efficiently traversing a tree or subtree in various orders or for following the path between two nodes. A DefaultMutableTreeNode may also hold a reference to a user object, the use of which is left to the user. Asking a DefaultMutableTreeNode for its string representation with toString() returns the string representation of its user object.

This is not a thread safe class.If you intend to use a DefaultMutableTreeNode (or a tree of TreeNodes) in more than one thread, you need to do your own synchronizing. A good convention to adopt is synchronizing on the root node of a tree.

Warning: serialized objects of this class will not be compatible with future swing releases. The current serialization support is appropriate for short term storage or RMI between Swing1.0 applications. It will not be possible to load serialized Swing1.0 objects with future releases of Swing. The JDK1.2 release of Swing will be the compatibility baseline for the serialized form of Swing objects.

allowsChildren

true iff the node is able to have children

children

array of children, may be null if this node has no children

EMPTY_ENUMERATION

parent

this node's parent, or null if this node has no parent

userObject

optional user object

DefaultMutableTreeNode()

Creates a tree node with no parent and no children.

DefaultMutableTreeNode(Object)

Creates a tree node with no parent, no children, and a user object userObject allowing children.

DefaultMutableTreeNode(Object, boolean)

Creates a tree node with no parent, no children, and a user object userObject and allows children set to allowsChildren.

add(MutableTreeNode)

Removes newChild from its parent and makes it a child of this node by adding it to the end of this node's child array.

breadthFirstEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in breadth-first order.

children()

Creates and returns a forward-order enumeration of this node's children.

clone()

Overridden to make clone public.

depthFirstEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in depth-first order.

getAllowsChildren()

Returns true if an only if this node is allowed to have children.

getChildAfter(TreeNode)

Returns the child in this node's child array that immediately follows aChild, which must be a child of this node.

getChildAt(int)

Returns the child at index in this node's child array.

getChildBefore(TreeNode)

Returns the child in this node's child array that immediately precedes aChild, which must be a child of this node.

getChildCount()

Returns the number of children of this node.

getDepth()

Returns the depth of the tree rooted at this node, i.e.

getFirstChild()

Returns this node's first child.

getFirstLeaf()

Finds and returns the first leaf that is a descendant of this node, i.e.

getIndex(TreeNode)

Returns the index of aChild in this node's child array.

getLastChild()

Returns this node's last child.

getLastLeaf()

Finds and returns the last leaf that is a descendant of this node, i.e.

getLeafCount()

Returns the total number of leaves that are descendants of this node.

getLevel()

Returns the number of levels above this node, i.e.

getNextLeaf()

Returns the leaf after this node or null if this node is the last leaf in its tree.

getNextNode()

Returns the node that follows this node in a preorder traversal of this node's tree.

getNextSibling()

Returns the next sibling of this node in the parent's children array.

getParent()

Returns this node's parent or null if this node has no parent.

getPath()

Returns the path, from the root, to get to this node.

getPathToRoot(TreeNode, int)

getPreviousLeaf()

Returns the leaf before this node or null if this node is the first leaf in its tree.

getPreviousNode()

Returns the node that precedes this node in a preorder traversal of this node's tree.

getPreviousSibling()

Returns the previous sibling of this node in the parent's children array.

getRoot()

Returns the root of the tree that contains this node.

getSharedAncestor(DefaultMutableTreeNode)

Returns the nearest common ancestor to this node and aNode.

getSiblingCount()

Returns the number of siblings of this node.

getUserObject()

Returns the user object.

getUserObjectPath()

Returns the user object path, from the root, to get to this node.

insert(MutableTreeNode, int)

Removes newChild from its present parent (if it has a parent), sets the child's parent to this node, and then adds the child to this node's child array at index childIndex.

isLeaf()

Returns true if this node has no children.

isNodeAncestor(TreeNode)

Returns true if anotherNode is an ancestor of this node, i.e.

isNodeChild(TreeNode)

Returns true if aNode is a child of this node.

isNodeDescendant(DefaultMutableTreeNode)

Returns true if anotherNode is a descendant of this node; i.e.

isNodeRelated(DefaultMutableTreeNode)

Returns true if and only if aNode is in the same tree as this node.

isNodeSibling(TreeNode)

Returns true if anotherNode is a sibling of (i.e.

isRoot()

Returns true if this node is the root of the tree.

pathFromAncestorEnumeration(TreeNode)

Creates and returns an enumeration that follows the path from ancestor to this node.

postorderEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in postorder.

preorderEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in preorder.

remove(int)

Removes the child at childIndex from this node's children index and sets its parent to null.

remove(MutableTreeNode)

Removes aChild from this node's child array, giving it a null parent.

removeAllChildren()

Removes all of this node's children, setting their parents to null.

removeFromParent()

Removes the subtree rooted at this node from the tree, giving this node a null parent.

setAllowsChildren(boolean)

Sets whether or not this node is allowed to have children.

setParent(MutableTreeNode)

Sets this node's parent to newParent but does not change the parent's child array.

setUserObject(Object)

Sets the user object to userObject.

toString()

Returns the result of sending toString() to this node's user object, or null if this node has no user object.

 public static final Enumeration EMPTY_ENUMERATION

 protected MutableTreeNode parent

this node's parent, or null if this node has no parent

 protected Vector children

array of children, may be null if this node has no children

 protected transient Object userObject

optional user object

 protected boolean allowsChildren

true iff the node is able to have children

 public DefaultMutableTreeNode()

Creates a tree node with no parent and no children.

 public DefaultMutableTreeNode(Object userObject)

Creates a tree node with no parent, no children, and a user object userObject allowing children.

 public DefaultMutableTreeNode(Object userObject,
                               boolean allowsChildren)

Creates a tree node with no parent, no children, and a user object userObject and allows children set to allowsChildren.

 public void insert(MutableTreeNode newChild,
                    int childIndex)

Removes newChild from its present parent (if it has a parent), sets the child's parent to this node, and then adds the child to this node's child array at index childIndex. newChild must not be null and must not be an ancestor of this node.

Parameters:

newChild - the node to become a child of this node

childIndex - the index in this node's child array where this node should be inserted

Throws: ArrayIndexOutOfBoundsException

if childIndex is out of bounds

Throws: IllegalArgumentException

if newChild is null or is an ancestor of this node

Throws: IllegalStateException

if this node does not allow children

See Also:

isNodeDescendant

 public void remove(int childIndex)

Removes the child at childIndex from this node's children index and sets its parent to null. setParent is messaged to the child, meaning it must be a MutableTreeNode.

Parameters:

childIndex - the index in this node's child array of the child to remove

Throws: ArrayIndexOutOfBoundsException

if childIndex is out of bounds

 public void setParent(MutableTreeNode newParent)

Sets this node's parent to newParent but does not change the parent's child array. This method is sent from insert() and remove() to reassign a child's parent, it should not be messaged from anywhere else.

Parameters:

newParent - this node's new parent

 public TreeNode getParent()

Returns this node's parent or null if this node has no parent.

Returns:

this node's parent, or null if this node has no parent

 public TreeNode getChildAt(int index)

Returns the child at index in this node's child array.

Parameters:

index - an index into this node's child array

Returns:

the child in this node's child array at index

Throws: ArrayIndexOutOfBoundsException

if index is out of bounds

 public int getChildCount()

Returns the number of children of this node.

Returns:

the number of children of this node

 public int getIndex(TreeNode aChild)

Returns the index of aChild in this node's child array. If aChild is not a child of this node, returns -1. This method performs a linear search and is O(n) where n is the number of children.

Parameters:

aChild - a child to search this node's children for

Returns:

the index into this node's child array of aChild, or -1

Throws: IllegalArgumentException

if aChild is null

 public Enumeration children()

Creates and returns a forward-order enumeration of this node's children. Modifying this node's child array invalidates any child enumerations created before the modification.

Returns:

an enumeration of this node's children

 public void setAllowsChildren(boolean allows)

Sets whether or not this node is allowed to have children. If allows is false, all of this node's children are removed.

By default, a node allows children.

Parameters:

allows - true if and only iff this node should be allowed to have children

See Also:

allowsChildren

 public boolean getAllowsChildren()

Returns true if an only if this node is allowed to have children.

Returns:

true if and only if this node allows children

 public void setUserObject(Object userObject)

Sets the user object to userObject.

Parameters:

userObject - this node's new user object

See Also:

getUserObject, toString

 public Object getUserObject()

Returns the user object.

Returns:

this node's user object

See Also:

setUserObject, toString

 public void removeFromParent()

Removes the subtree rooted at this node from the tree, giving this node a null parent. Does nothing if this node is the root of its tree.

 public void remove(MutableTreeNode aChild)

Removes aChild from this node's child array, giving it a null parent.

Parameters:

aChild - a child of this node to remove

Throws: IllegalArgumentException

if aChild is null or is not a child of this node

 public void removeAllChildren()

Removes all of this node's children, setting their parents to null. If this node has no children, this method does nothing.

 public void add(MutableTreeNode newChild)

Removes newChild from its parent and makes it a child of this node by adding it to the end of this node's child array.

Parameters:

aNode - node to add as a child of this node

Throws: IllegalArgumentException

if newChild is null

Throws: IllegalStateException

if this node does not allow children

See Also:

insert

 public boolean isNodeAncestor(TreeNode anotherNode)

Returns true if anotherNode is an ancestor of this node, i.e. if it is this node, this node's parent, or an ancestor of this node's parent. Note that a node is considered an ancestor of itself. If anotherNode is null, this method returns false. This operation is at worst O(h) where h is the distance from the root to this node.

Parameters:

anotherNode - node to test as an ancestor of this node

Returns:

true if this node is a descendant of anotherNode

See Also:

isNodeDescendant, getSharedAncestor

 public boolean isNodeDescendant(DefaultMutableTreeNode anotherNode)

Returns true if anotherNode is a descendant of this node; i.e. if it is this node, one of this node's children, or a descendant of one of this node's children. Note that a node is considered a descendant of itself. If anotherNode is null, returns false. This operation is at worst O(h) where h is the distance from the root to anotherNode.

Parameters:

anotherNode - node to test as descendant of this node

Returns:

true if this node is an ancestor of anotherNode

See Also:

isNodeAncestor, getSharedAncestor

 public TreeNode getSharedAncestor(DefaultMutableTreeNode aNode)

Returns the nearest common ancestor to this node and aNode. Returns null, if no such ancestor exists, i.e. if this node and aNode are in different trees or if aNode is null. A node is considered an ancestor of itself.

Parameters:

aNode - node to find common ancestor with

Returns:

nearest ancestor common to this node and aNode, or null if none

See Also:

isNodeAncestor, isNodeDescendant

 public boolean isNodeRelated(DefaultMutableTreeNode aNode)

Returns true if and only if aNode is in the same tree as this node. Returns false if aNode is null.

Returns:

true if aNode is in the same tree as this node; false if aNode is null

See Also:

getSharedAncestor, getRoot

 public int getDepth()

Returns the depth of the tree rooted at this node, i.e. the longest distance from this node to a leaf. If this node has no children, returns 0. This operation is much more expensive than getLevel() because it must effectively traverse the entire tree rooted at this node.

Returns:

the depth of the tree whose root is this node

See Also:

getLevel

 public int getLevel()

Returns the number of levels above this node, i.e. the distance from the root to this node. If this node is the root, returns 0.

Returns:

the number of levels above this node

See Also:

getDepth

 public TreeNode[] getPath()

Returns the path, from the root, to get to this node. The last element in the path will be this node.

 protected TreeNode[] getPathToRoot(TreeNode aNode,
                                    int depth)

 public Object[] getUserObjectPath()

Returns the user object path, from the root, to get to this node. If some of the TreeNodes in the path have null user objects, the returned path will contain nulls.

 public TreeNode getRoot()

Returns the root of the tree that contains this node. The root is the ancestor with a null parent.

Returns:

the root of the tree that contains this node

See Also:

isNodeAncestor

 public boolean isRoot()

Returns true if this node is the root of the tree. The root is the only node in the tree with a null parent; every tree has exactly one root.

Returns:

true if this node is the root of its tree

 public DefaultMutableTreeNode getNextNode()

Returns the node that follows this node in a preorder traversal of this node's tree. Returns null if this node is the last node of the traversal. This is an inefficient way to traverse the entire tree; use an enumeration, instead.

Returns:

the node that follows this node in a preorder traversal, or null if this node is last

See Also:

preorderEnumeration

 public DefaultMutableTreeNode getPreviousNode()

Returns the node that precedes this node in a preorder traversal of this node's tree. Returns null if this node is the first node of the traveral, i.e. the root of the tree. This is an inefficient way to traverse the entire tree; use an enumeration, instead.

Returns:

the node that precedes this node in a preorder traversal, or null if this node is the first

See Also:

preorderEnumeration

 public Enumeration preorderEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in preorder. The first node returned by the enumeration's nextElement() method is this node.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.

Returns:

an enumeration for traversing the tree in preorder

See Also:

postorderEnumeration

 public Enumeration postorderEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in postorder. The first node returned by the enumeration's nextElement() method is the leftmost leaf. This is the same as a depth-first traversal.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.

Returns:

an enumeration for traversing the tree in postorder

See Also:

depthFirstEnumeration, preorderEnumeration

 public Enumeration breadthFirstEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in breadth-first order. The first node returned by the enumeration's nextElement() method is this node.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.

Returns:

an enumeration for traversing the tree in breadth-first order

See Also:

depthFirstEnumeration

 public Enumeration depthFirstEnumeration()

Creates and returns an enumeration that traverses the subtree rooted at this node in depth-first order. The first node returned by the enumeration's nextElement() method is the leftmost leaf. This is the same as a postorder traversal.

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.

Returns:

an enumeration for traversing the tree in depth-first order

See Also:

breadthFirstEnumeration, postorderEnumeration

 public Enumeration pathFromAncestorEnumeration(TreeNode ancestor)

Creates and returns an enumeration that follows the path from ancestor to this node. The enumeration's nextElement() method first returns ancestor, then the child of ancestor that is an ancestor of this node, and so on, and finally returns this node. Creation of the enumeration is O(m) where m is the number of nodes between this node and ancestor, inclusive. Each nextElement() message is O(1).

Modifying the tree by inserting, removing, or moving a node invalidates any enumerations created before the modification.

Returns:

an enumeration for following the path from an ancestor of this node to this one

Throws: IllegalArgumentException

if ancestor is not an ancestor of this node

See Also:

isNodeAncestor, isNodeDescendant

 public boolean isNodeChild(TreeNode aNode)

Returns true if aNode is a child of this node. If aNode is null, this method returns false.

Returns:

true if aNode is a child of this node; false if aNode is null

 public TreeNode getFirstChild()

Returns this node's first child. If this node has no children, throws NoSuchElementException.

Returns:

the first child of this node

Throws: NoSuchElementException

if this node has no children

 public TreeNode getLastChild()

Returns this node's last child. If this node has no children, throws NoSuchElementException.

Returns:

the last child of this node

Throws: NoSuchElementException

if this node has no children

 public TreeNode getChildAfter(TreeNode aChild)

Returns the child in this node's child array that immediately follows aChild, which must be a child of this node. If aChild is the last child, returns null. This method performs a linear search of this node's children for aChild and is O(n) where n is the number of children; to traverse the entire array of children, use an enumeration instead.

Returns:

the child of this node that immediately follows aChild

Throws: IllegalArgumentException

if aChild is null or is not a child of this node

See Also:

children

 public TreeNode getChildBefore(TreeNode aChild)

Returns the child in this node's child array that immediately precedes aChild, which must be a child of this node. If aChild is the first child, returns null. This method performs a linear search of this node's children for aChild and is O(n) where n is the number of children.

Returns:

the child of this node that immediately precedes aChild

Throws: IllegalArgumentException

if aChild is null or is not a child of this node

 public boolean isNodeSibling(TreeNode anotherNode)

Returns true if anotherNode is a sibling of (i.e. has the same parent as) this node. A node is its own sibling. If anotherNode is null, returns false.

Parameters:

anotherNode - node to test as sibling of this node

Returns:

true if anotherNode is a sibling of this node

 public int getSiblingCount()

Returns the number of siblings of this node. A node is its own sibling (i.e. if it has no parent or no siblings, this method returns 1).

Returns:

the number of siblings of this node

 public DefaultMutableTreeNode getNextSibling()

Returns the next sibling of this node in the parent's children array. Returns null if this node has no parent or is the parent's last child. This method performs a linear search that is O(n) where n is the number of children; to traverse the entire array, use the parent's child enumeration instead.

Returns:

the sibling of this node that immediately follows this node

See Also:

children

 public DefaultMutableTreeNode getPreviousSibling()

Returns the previous sibling of this node in the parent's children array. Returns null if this node has no parent or is the parent's first child. This method performs a linear search that is O(n) where n is the number of children.

Returns:

the sibling of this node that immediately precedes this node

 public boolean isLeaf()

Returns true if this node has no children. To distinguish between nodes that have no children and nodes that cannot have children (e.g. to distinguish files from empty directories), use this method in conjunction with getAllowsChildren

Returns:

true if this node has no children

See Also:

getAllowsChildren

 public DefaultMutableTreeNode getFirstLeaf()

Finds and returns the first leaf that is a descendant of this node, i.e. this node or its first child's first leaf. Note that if this node is a leaf, this method returns this node.

Returns:

the first leaf in the subtree rooted at this node

See Also:

isLeaf, isNodeDescendant

 public DefaultMutableTreeNode getLastLeaf()

Finds and returns the last leaf that is a descendant of this node, i.e. this node or its last child's last leaf. Note that if this node is a leaf, this method returns this node.

Returns:

the last leaf in the subtree rooted at this node

See Also:

isLeaf, isNodeDescendant

 public DefaultMutableTreeNode getNextLeaf()

Returns the leaf after this node or null if this node is the last leaf in its tree. This method performs a linear search that is O(n) where n is the number of children in this node's parent; to traverse all of the leaves in the tree, use an enumeration and isLeaf() instead. PENDING: better description?

Returns:

returns the next leaf past this node

See Also:

depthFirstEnumeration, isLeaf

 public DefaultMutableTreeNode getPreviousLeaf()

Returns the leaf before this node or null if this node is the first leaf in its tree. This method performs a linear search that is O(n) where n is the number of children in this node's parent; to traverse all of the leaves in the tree, structure the code to use an enumeration and isLeaf() instead. PENDING: better description?

Returns:

returns the leaf before this node

See Also:

depthFirstEnumeration, isLeaf

 public int getLeafCount()

Returns the total number of leaves that are descendants of this node. If this node is a leaf, returns 1. This method is O(n) where n is the number of descendants of this node.

Returns:

the number of leaves beneath this node

See Also:

isNodeAncestor

 public String toString()

Returns the result of sending toString() to this node's user object, or null if this node has no user object.

Overrides:

toString in class Object

See Also:

getUserObject

 public Object clone()

Overridden to make clone public. Returns a shallow copy of this node; the new node has no parent or children and has a reference to the same user object, if any.

Returns:

a copy of this node

Overrides:

clone in class Object

All Packages  Class Hierarchy  This Package  Previous  Next  Index