| 
 | |||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Objectjavax.swing.tree.DefaultMutableTreeNode
org.annotation.util.SortedTreeNode
SortedTreeNode is a data structure to have a sorted tree structure. Nodes are inserted such that any node which is contained by another will be one of its children. Node which are less than or grater than one another will be siblings and sibling will be kept in asscending order from left to right.
| Field Summary | |
| protected  TreeComparable | data | 
| Fields inherited from class javax.swing.tree.DefaultMutableTreeNode | 
| allowsChildren, children, EMPTY_ENUMERATION, parent, userObject | 
| Constructor Summary | |
| SortedTreeNode(TreeComparable d) | |
| Method Summary | |
|  void | add(javax.swing.tree.MutableTreeNode n)Adds a SortedTreeNode to an existing tree inserting it in its proper location. | 
|  int | compareTo(java.lang.Object o) | 
|  SortedTreeNode[] | getChildrenWithProperty(java.lang.String p,
                        boolean top) | 
|  SortedTreeNode[] | getContainedNodesWithProperty(SortedTreeNode s,
                              java.lang.String p,
                              boolean top)Finds nodes which are contained by span sand have 
 propertyp. | 
|  SortedTreeNode[] | getContainedNodesWithProperty(java.lang.String p,
                              boolean top)Finds nodes which are contained by this node's span and have property p. | 
|  SortedTreeNode | getContainerNodeWithProperty(java.lang.String p)Finds node having property pwhich subsumes
 TreeComparatortc | 
|  SortedTreeNode | getNode(SortedTreeNode node) | 
|  boolean | gt(java.lang.Object o)Determines whether this is greater than o. | 
|  boolean | hasProperty(java.lang.String p) | 
|  boolean | intersects(java.lang.Object o)Determines whether this intersects o. | 
|  boolean | lt(java.lang.Object o)Determines whether this is less than o. | 
|  void | showIndent() | 
|  void | showIndent(java.lang.String indent) | 
|  boolean | subsumes(java.lang.Object o)Determines whether this subsumes o. | 
| Methods inherited from class javax.swing.tree.DefaultMutableTreeNode | 
| breadthFirstEnumeration, children, clone, depthFirstEnumeration, getAllowsChildren, getChildAfter, getChildAt, getChildBefore, getChildCount, getDepth, getFirstChild, getFirstLeaf, getIndex, getLastChild, getLastLeaf, getLeafCount, getLevel, getNextLeaf, getNextNode, getNextSibling, getParent, getPath, getPathToRoot, getPreviousLeaf, getPreviousNode, getPreviousSibling, getRoot, getSharedAncestor, getSiblingCount, getUserObject, getUserObjectPath, insert, isLeaf, isNodeAncestor, isNodeChild, isNodeDescendant, isNodeRelated, isNodeSibling, isRoot, pathFromAncestorEnumeration, postorderEnumeration, preorderEnumeration, remove, remove, removeAllChildren, removeFromParent, setAllowsChildren, setParent, setUserObject, toString | 
| Methods inherited from class java.lang.Object | 
| equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait | 
| Field Detail | 
protected TreeComparable data
| Constructor Detail | 
public SortedTreeNode(TreeComparable d)
| Method Detail | 
public void add(javax.swing.tree.MutableTreeNode n)
node unless a node in the tree with the same 
 span already exist.
public SortedTreeNode getContainerNodeWithProperty(java.lang.String p)
p which subsumes
 TreeComparator tc
public SortedTreeNode[] getChildrenWithProperty(java.lang.String p,
                                                boolean top)
public SortedTreeNode[] getContainedNodesWithProperty(java.lang.String p,
                                                      boolean top)
p.  If top is true then only the
 top-most nodes are returned, otherwise all nodes satisfying the above
 criteria are returned.
public SortedTreeNode[] getContainedNodesWithProperty(SortedTreeNode s,
                                                      java.lang.String p,
                                                      boolean top)
s and have 
 property p.  If top is true then only the
 top-most nodes are returned, otherwise all nodes satisfying the above
 criteria are returned.
public boolean hasProperty(java.lang.String p)
public SortedTreeNode getNode(SortedTreeNode node)
public void showIndent()
public void showIndent(java.lang.String indent)
public boolean subsumes(java.lang.Object o)
TreeComparableo.  If this equals
 o then this subsumes o.
subsumes in interface TreeComparablepublic boolean intersects(java.lang.Object o)
TreeComparableo.
intersects in interface TreeComparablepublic boolean lt(java.lang.Object o)
TreeComparableo.
lt in interface TreeComparablepublic boolean gt(java.lang.Object o)
TreeComparableo.
gt in interface TreeComparablepublic int compareTo(java.lang.Object o)
compareTo in interface java.lang.Comparable| 
 | |||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||