GraphTreeNode

java.lang.Object
- com.sh.javax.tree.GraphTreeNode

所有已实现的接口:

java.lang.Cloneable, javax.swing.tree.MutableTreeNode, javax.swing.tree.TreeNode
```
public class GraphTreeNode
extends java.lang.Object
implements java.lang.Cloneable, javax.swing.tree.MutableTreeNode
```
Title: 结构化数据的图形树

Description: 结构化数据的图形树
Swing包的JTree加强版
根据DefaultMutableTreeNode改写不实现串行化接口不维护用户对象 userObject 维护节点模板 nodeTemplet (兼用户对象)

版本:

1.0

字段概要

字段
限定符和类型	字段和说明
`boolean`	`allowMapping` 是否允许输出热点映射 (默认允许)
`java.lang.String`	`anchor` 超级链接锚点
`static java.lang.String`	`CTLR` 当前平台的回车换行符
`static java.util.Enumeration`	`EMPTY_ENUMERATION` An enumeration that is always empty.
`int`	`height` 坐标以及尺寸
`int`	`isoH` 记忆等容尺寸
`int`	`isoW` 记忆等容尺寸
`int`	`level` 层信息
`java.lang.String`	`target` 超级链接锚点连接目标
`java.lang.String`	`toolTips` 热点提示信息
`int`	`treeHeight` 记忆领导子树的展开宽 (横向演化则treeHeight有效，纵向演化则treeWidth有效)
`int`	`treeWidth` 记忆领导子树的展开宽 (横向演化则treeHeight有效，纵向演化则treeWidth有效)
`int`	`width` 坐标以及尺寸
`int`	`x` 坐标以及尺寸
`int`	`y` 坐标以及尺寸

构造器概要

构造器
构造器和说明
`GraphTreeNode()` Creates a tree node that has no parent and no children, but which allows children.
`GraphTreeNode(NodeTemplet nodeTemplet)` Creates a tree node with no parent, no children, but which allows children, and initializes it with the specified user object.
`GraphTreeNode(NodeTemplet nodeTemplet, boolean allowsChildren)` Creates a tree node with no parent, no children, initialized with the specified user object, and that allows children only if specified.

方法概要

所有方法实例方法具体方法
限定符和类型	方法和说明
`void`	`_enum()` 枚举测试
`void`	`_print()`
`void`	`_print(java.lang.String demo)`
`void`	`add(javax.swing.tree.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.
`java.util.Enumeration`	`breadthFirstEnumeration()` Creates and returns an enumeration that traverses the subtree rooted at this node in breadth-first order.
`java.util.Enumeration`	`children()` Creates and returns a forward-order enumeration of this node's children.
`java.lang.Object`	`clone()` Overridden to make clone public.
`java.util.Enumeration`	`depthFirstEnumeration()` Creates and returns an enumeration that traverses the subtree rooted at this node in depth-first order.
`boolean`	`getAllowMapping()`
`boolean`	`getAllowsChildren()` Returns true if this node is allowed to have children.
`java.lang.String`	`getAnchor()` 返回锚点
`java.awt.Rectangle`	`getBound()`
`int`	`getCenX()` 中心点
`int`	`getCenY()`
`javax.swing.tree.TreeNode`	`getChildAfter(javax.swing.tree.TreeNode aChild)`
`javax.swing.tree.TreeNode`	`getChildAt(int index)` Returns the child at the specified index in this node's child array.
`javax.swing.tree.TreeNode`	`getChildBefore(javax.swing.tree.TreeNode aChild)` Returns the child in this node's child array that immediately precedes `aChild`, which must be a child of this node.
`int`	`getChildCount()` Returns the number of children of this node.
`java.lang.String`	`getCoords()`
`int`	`getDepth()` Returns the depth of the tree rooted at this node -- the longest distance from this node to a leaf.
`javax.swing.tree.TreeNode`	`getFirstChild()` Returns this node's first child.
`GraphTreeNode`	`getFirstLeaf()` Finds and returns the first leaf that is a descendant of this node -- either this node or its first child's first leaf.
`int`	`getHeight()`
`int`	`getIndex(javax.swing.tree.TreeNode aChild)` Returns the index of the specified child in this node's child array.
`javax.swing.tree.TreeNode`	`getLastChild()` Returns this node's last child.
`GraphTreeNode`	`getLastLeaf()` Finds and returns the last leaf that is a descendant of this node -- either this node or its last child's last leaf.
`java.awt.Dimension`	`getLeadingTreeSize()`
`int`	`getLeafCount()` Returns the total number of leaves that are descendants of this node.
`int`	`getLevel()` Returns the number of levels above this node -- the distance from the root to this node.
`int`	`getNegX()` 负焦点
`int`	`getNegY()`
`GraphTreeNode`	`getNextLeaf()` Returns the leaf after this node or null if this node is the last leaf in the tree.
`GraphTreeNode`	`getNextNode()` Returns the node that follows this node in a preorder traversal of this node's tree.
`GraphTreeNode`	`getNextSibling()` Returns the next sibling of this node in the parent's children array.
`NodeTemplet`	`getNodeTemplet()` 返回节点模板.
`javax.swing.tree.TreeNode`	`getParent()` Returns this node's parent or null if this node has no parent.
`javax.swing.tree.TreeNode[]`	`getPath()` Returns the path from the root, to get to this node.
`int`	`getPathIsoHeight(int space)`
`int`	`getPathIsoWidth(int space)`
`java.awt.Point`	`getPoint()`
`java.awt.Point`	`getPoint2()`
`java.awt.Point`	`getPointEast()`
`java.awt.Point`	`getPointNorth()` 吸附点坐标提供给连接线使用
`java.awt.Point`	`getPointSouth()`
`java.awt.Point`	`getPointWest()`
`GraphTreeNode`	`getPreviousLeaf()` Returns the leaf before this node or null if this node is the first leaf in the tree.
`GraphTreeNode`	`getPreviousNode()` Returns the node that precedes this node in a preorder traversal of this node's tree.
`GraphTreeNode`	`getPreviousSibling()` Returns the previous sibling of this node in the parent's children array.
`javax.swing.tree.TreeNode`	`getRoot()` Returns the root of the tree that contains this node.
`javax.swing.tree.TreeNode`	`getSharedAncestor(GraphTreeNode aNode)` Returns the nearest common ancestor to this node and `aNode`.
`int`	`getSiblingCount()` Returns the number of siblings of this node.
`java.awt.Dimension`	`getSize()`
`java.lang.String`	`getTarget()` 返回锚点
`java.lang.String`	`getToolTips()` 返回提示信息
`int`	`getTotalDepth()` 获取总的树深
`java.lang.Object`	`getUserObject()` Returns this node's user object.
`java.lang.Object[]`	`getUserObjectPath()` Returns the user object path, from the root, to get to this node.
`int`	`getWidth()`
`int`	`getX()`
`int`	`getY()`
`void`	`initGraphics()` 初始化图形节点
`void`	`insert(javax.swing.tree.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`.
`boolean`	`isAllowMapping()` 判断是否生成该结点的热点信息
`boolean`	`isLeaf()` Returns true if this node has no children.
`boolean`	`isNodeAncestor(javax.swing.tree.TreeNode anotherNode)` Returns true if `anotherNode` is an ancestor of this node -- if it is this node, this node's parent, or an ancestor of this node's parent.
`boolean`	`isNodeChild(javax.swing.tree.TreeNode aNode)` Returns true if `aNode` is a child of this node.
`boolean`	`isNodeDescendant(GraphTreeNode anotherNode)` Returns true if `anotherNode` is a descendant of this node -- if it is this node, one of this node's children, or a descendant of one of this node's children.
`boolean`	`isNodeRelated(GraphTreeNode aNode)` Returns true if and only if `aNode` is in the same tree as this node.
`boolean`	`isNodeSibling(javax.swing.tree.TreeNode anotherNode)` Returns true if `anotherNode` is a sibling of (has the same parent as) this node.
`boolean`	`isRoot()` Returns true if this node is the root of the tree.
`void`	`moveWithChildren(int dx, int dy)` 移动当前节点同时移动子树
`void`	`moveWithoutChildren(int dx, int dy)` 移动当前节点不移动子树
`java.util.Enumeration`	`pathFromAncestorEnumeration(javax.swing.tree.TreeNode ancestor)`
`java.util.Enumeration`	`postorderEnumeration()` Creates and returns an enumeration that traverses the subtree rooted at this node in postorder.
`java.util.Enumeration`	`preorderEnumeration()` Creates and returns an enumeration that traverses the subtree rooted at this node in preorder.
`void`	`rememberLevel()` 让节点实体记忆自己的层信息 (这个函数主要为复杂布局运算提高性能而设计)
`void`	`remove(int childIndex)` Removes the child at the specified index from this node's children and sets that node's parent to null.
`void`	`remove(javax.swing.tree.MutableTreeNode aChild)` Removes `aChild` from this node's child array, giving it a null parent.
`void`	`removeAllChildren()` Removes all of this node's children, setting their parents to null.
`void`	`removeFromParent()` Removes the subtree rooted at this node from the tree, giving this node a null parent.
`void`	`setAllowMapping(boolean allow)` 设置是否生成该结点的热点信息,对应于MAP文件的AREA部分
`void`	`setAllowsChildren(boolean allows)` Determines whether or not this node is allowed to have children.
`void`	`setAnchor(java.lang.String url)` 重新设置锚点
`void`	`setBound(int x, int y, int w, int h)`
`void`	`setHeight(int h)`
`void`	`setLeadingTreeSize(int tw, int th)`
`void`	`setNodeTemplet(NodeTemplet templet)` 设置节点模板到`nodeTemplet`.
`void`	`setParent(javax.swing.tree.MutableTreeNode newParent)` Sets this node's parent to `newParent` but does not change the parent's child array.
`void`	`setPoint(int x, int y)`
`void`	`setSize(int w, int h)`
`void`	`setTarget(java.lang.String aim)` 重新设置锚点
`void`	`setToolTips(java.lang.String s)` 提示信息重设
`void`	`setUserObject(java.lang.Object nodeTemplet)` Sets the user object for this node to `nodeTemplet`.
`void`	`setWidth(int w)`
`void`	`setX(int x)`
`void`	`setY(int y)`
`java.lang.String`	`toMap()` 热点映射
`java.lang.String`	`toString()` Returns the result of sending `toString()` to this node's user object, or null if this node has no user object.

从类继承的方法 java.lang.Object
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

- 字段详细资料
  - EMPTY_ENUMERATION
```
public static final java.util.Enumeration EMPTY_ENUMERATION
```
    An enumeration that is always empty. This is used when an enumeration of a leaf node's children is requested.
  - x
```
public int x
```
    坐标以及尺寸
  - y
```
public int y
```
    坐标以及尺寸
  - width
```
public int width
```
    坐标以及尺寸
  - height
```
public int height
```
    坐标以及尺寸
  - level
```
public int level
```
    层信息
  - isoW
```
public int isoW
```
    记忆等容尺寸
  - isoH
```
public int isoH
```
    记忆等容尺寸
  - treeWidth
```
public int treeWidth
```
    记忆领导子树的展开宽 (横向演化则treeHeight有效，纵向演化则treeWidth有效)
  - treeHeight
```
public int treeHeight
```
    记忆领导子树的展开宽 (横向演化则treeHeight有效，纵向演化则treeWidth有效)
  - CTLR
```
public static final java.lang.String CTLR
```
    当前平台的回车换行符
  - toolTips
```
public java.lang.String toolTips
```
    热点提示信息
  - anchor
```
public java.lang.String anchor
```
    超级链接锚点
  - target
```
public java.lang.String target
```
    超级链接锚点连接目标
  - allowMapping
```
public boolean allowMapping
```
    是否允许输出热点映射 (默认允许)
- 构造器详细资料
  - GraphTreeNode
```
public GraphTreeNode()
```
    Creates a tree node that has no parent and no children, but which allows children.
  - GraphTreeNode
```
public GraphTreeNode(NodeTemplet nodeTemplet)
```
    Creates a tree node with no parent, no children, but which allows children, and initializes it with the specified user object.
    
    参数:
    
    nodeTemplet - an Object provided by the user that constitutes the node's data
  - GraphTreeNode
```
public GraphTreeNode(NodeTemplet nodeTemplet,
                     boolean allowsChildren)
```
    Creates a tree node with no parent, no children, initialized with the specified user object, and that allows children only if specified.
    
    参数:
    
    nodeTemplet - an Object provided by the user that constitutes the node's data
    
    allowsChildren - if true, the node is allowed to have child nodes -- otherwise, it is always a leaf node
- 方法详细资料
  - setX
```
public void setX(int x)
```
  - setY
```
public void setY(int y)
```
  - setWidth
```
public void setWidth(int w)
```
  - setHeight
```
public void setHeight(int h)
```
  - setPoint
```
public void setPoint(int x,
                     int y)
```
  - setSize
```
public void setSize(int w,
                    int h)
```
  - setBound
```
public void setBound(int x,
                     int y,
                     int w,
                     int h)
```
  - getX
```
public int getX()
```
  - getY
```
public int getY()
```
  - getWidth
```
public int getWidth()
```
  - getHeight
```
public int getHeight()
```
  - getPoint
```
public java.awt.Point getPoint()
```
  - getSize
```
public java.awt.Dimension getSize()
```
  - getBound
```
public java.awt.Rectangle getBound()
```
  - getNegX
```
public int getNegX()
```
    负焦点
    
    返回:
    
    int
  - getNegY
```
public int getNegY()
```
  - getPoint2
```
public java.awt.Point getPoint2()
```
  - getCenX
```
public int getCenX()
```
    中心点
    
    返回:
    
    int
  - getCenY
```
public int getCenY()
```
  - getPointNorth
```
public java.awt.Point getPointNorth()
```
    吸附点坐标提供给连接线使用
    
    返回:
    
    Point
  - getPointSouth
```
public java.awt.Point getPointSouth()
```
  - getPointWest
```
public java.awt.Point getPointWest()
```
  - getPointEast
```
public java.awt.Point getPointEast()
```
  - initGraphics
```
public void initGraphics()
```
    初始化图形节点
  - rememberLevel
```
public void rememberLevel()
```
    让节点实体记忆自己的层信息 (这个函数主要为复杂布局运算提高性能而设计)
  - getPathIsoWidth
```
public int getPathIsoWidth(int space)
```
  - getPathIsoHeight
```
public int getPathIsoHeight(int space)
```
  - setLeadingTreeSize
```
public void setLeadingTreeSize(int tw,
                               int th)
```
  - getLeadingTreeSize
```
public java.awt.Dimension getLeadingTreeSize()
```
  - moveWithChildren
```
public void moveWithChildren(int dx,
                             int dy)
```
    移动当前节点同时移动子树
    
    参数:
    
    dx - X轴平移
    
    dy - Y轴平移
  - moveWithoutChildren
```
public void moveWithoutChildren(int dx,
                                int dy)
```
    移动当前节点不移动子树
    
    参数:
    
    dx - X轴平移
    
    dy - Y轴平移
  - getTotalDepth
```
public int getTotalDepth()
```
    获取总的树深
    
    返回:
    
    从根节点到Level最大的节点的差值
  - _print
```
public void _print()
```
  - _print
```
public void _print(java.lang.String demo)
```
  - _enum
```
public void _enum()
```
    枚举测试
  - getNodeTemplet
```
public NodeTemplet getNodeTemplet()
```
    返回节点模板.
    
    返回:
    
    用户自定义数据的模板
    
    另请参阅:
    
    setNodeTemplet(com.sh.javax.tree.NodeTemplet), toString()
  - setNodeTemplet
```
public void setNodeTemplet(NodeTemplet templet)
```
    设置节点模板到nodeTemplet.
    
    参数:
    
    templet - 包含节点的用户自定义数据的模板
    
    另请参阅:
    
    getNodeTemplet(), toString()
  - toMap
```
public java.lang.String toMap()
```
    热点映射
    
    返回:
    
    String
  - getCoords
```
public java.lang.String getCoords()
```
  - setToolTips
```
public void setToolTips(java.lang.String s)
```
    提示信息重设
    
    参数:
    
    s - 信息提示字符串
  - getToolTips
```
public java.lang.String getToolTips()
```
    返回提示信息
    
    返回:
    
    String
  - setAnchor
```
public void setAnchor(java.lang.String url)
```
    重新设置锚点
    
    参数:
    
    url - String
  - getAnchor
```
public java.lang.String getAnchor()
```
    返回锚点
    
    返回:
    
    String
  - setTarget
```
public void setTarget(java.lang.String aim)
```
    重新设置锚点
    
    参数:
    
    aim - String
  - getTarget
```
public java.lang.String getTarget()
```
    返回锚点
    
    返回:
    
    String
  - setAllowMapping
```
public void setAllowMapping(boolean allow)
```
    设置是否生成该结点的热点信息,对应于MAP文件的AREA部分
    
    参数:
    
    allow - boolean true生成(默认),false不生成
  - getAllowMapping
```
public boolean getAllowMapping()
```
  - isAllowMapping
```
public boolean isAllowMapping()
```
    判断是否生成该结点的热点信息
    
    返回:
    
    boolean true生成,false不生成
  - insert
```
public void insert(javax.swing.tree.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.
    
    指定者:
    
    insert 在接口中 javax.swing.tree.MutableTreeNode
    
    参数:
    
    newChild - the MutableTreeNode to insert under this node
    
    childIndex - the index in this node's child array where this node is to be inserted
    
    抛出:
    
    java.lang.ArrayIndexOutOfBoundsException - if childIndex is out of bounds
    
    java.lang.IllegalArgumentException - if newChild is null or is an ancestor of this node
    
    java.lang.IllegalStateException - if this node does not allow children
    
    另请参阅:
    
    isNodeDescendant(com.sh.javax.tree.GraphTreeNode)
  - remove
```
public void remove(int childIndex)
```
    Removes the child at the specified index from this node's children and sets that node's parent to null. The child node to remove must be a MutableTreeNode.
    
    指定者:
    
    remove 在接口中 javax.swing.tree.MutableTreeNode
    
    参数:
    
    childIndex - the index in this node's child array of the child to remove
    
    抛出:
    
    java.lang.ArrayIndexOutOfBoundsException - if childIndex is out of bounds
  - setParent
```
public void setParent(javax.swing.tree.MutableTreeNode newParent)
```
    Sets this node's parent to newParent but does not change the parent's child array. This method is called from insert() and remove() to reassign a child's parent, it should not be messaged from anywhere else.
    
    指定者:
    
    setParent 在接口中 javax.swing.tree.MutableTreeNode
    
    参数:
    
    newParent - this node's new parent
  - getParent
```
public javax.swing.tree.TreeNode getParent()
```
    Returns this node's parent or null if this node has no parent.
    
    指定者:
    
    getParent 在接口中 javax.swing.tree.TreeNode
    
    返回:
    
    this node's parent TreeNode, or null if this node has no parent
  - getChildAt
```
public javax.swing.tree.TreeNode getChildAt(int index)
```
    Returns the child at the specified index in this node's child array.
    
    指定者:
    
    getChildAt 在接口中 javax.swing.tree.TreeNode
    
    参数:
    
    index - an index into this node's child array
    
    返回:
    
    the TreeNode in this node's child array at the specified index
    
    抛出:
    
    java.lang.ArrayIndexOutOfBoundsException - if index is out of bounds
  - getChildCount
```
public int getChildCount()
```
    Returns the number of children of this node.
    
    指定者:
    
    getChildCount 在接口中 javax.swing.tree.TreeNode
    
    返回:
    
    an int giving the number of children of this node
  - getIndex
```
public int getIndex(javax.swing.tree.TreeNode aChild)
```
    Returns the index of the specified child in this node's child array. If the specified node 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.
    
    指定者:
    
    getIndex 在接口中 javax.swing.tree.TreeNode
    
    参数:
    
    aChild - the TreeNode to search for among this node's children
    
    返回:
    
    an int giving the index of the node in this node's child array, or -1 if the specified node is a not a child of this node
    
    抛出:
    
    java.lang.IllegalArgumentException - if aChild is null
  - children
```
public java.util.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.
    
    指定者:
    
    children 在接口中 javax.swing.tree.TreeNode
    
    返回:
    
    an Enumeration of this node's children
  - setAllowsChildren
```
public void setAllowsChildren(boolean allows)
```
    Determines whether or not this node is allowed to have children. If allows is false, all of this node's children are removed.
    Note: By default, a node allows children.
    
    参数:
    
    allows - true if this node is allowed to have children
  - getAllowsChildren
```
public boolean getAllowsChildren()
```
    Returns true if this node is allowed to have children.
    
    指定者:
    
    getAllowsChildren 在接口中 javax.swing.tree.TreeNode
    
    返回:
    
    true if this node allows children, else false
  - setUserObject
```
public void setUserObject(java.lang.Object nodeTemplet)
```
    Sets the user object for this node to nodeTemplet.
    
    指定者:
    
    setUserObject 在接口中 javax.swing.tree.MutableTreeNode
    
    参数:
    
    nodeTemplet - the Object that constitutes this node's user-specified data
    
    另请参阅:
    
    getUserObject(), toString()
  - getUserObject
```
public java.lang.Object getUserObject()
```
    Returns this node's user object.
    
    返回:
    
    the Object stored at this node by the user
    
    另请参阅:
    
    setUserObject(java.lang.Object), toString()
  - removeFromParent
```
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.
    
    指定者:
    
    removeFromParent 在接口中 javax.swing.tree.MutableTreeNode
  - remove
```
public void remove(javax.swing.tree.MutableTreeNode aChild)
```
    Removes aChild from this node's child array, giving it a null parent.
    
    指定者:
    
    remove 在接口中 javax.swing.tree.MutableTreeNode
    
    参数:
    
    aChild - a child of this node to remove
    
    抛出:
    
    java.lang.IllegalArgumentException - if aChild is null or is not a child of this node
  - removeAllChildren
```
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.
  - add
```
public void add(javax.swing.tree.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.
    
    参数:
    
    newChild - node to add as a child of this node
    
    抛出:
    
    java.lang.IllegalArgumentException - if newChild is null
    
    java.lang.IllegalStateException - if this node does not allow children
    
    另请参阅:
    
    insert(javax.swing.tree.MutableTreeNode, int)
  - isNodeAncestor
```
public boolean isNodeAncestor(javax.swing.tree.TreeNode anotherNode)
```
    Returns true if anotherNode is an ancestor of this node -- 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.
    
    参数:
    
    anotherNode - node to test as an ancestor of this node
    
    返回:
    
    true if this node is a descendant of anotherNode
    
    另请参阅:
    
    isNodeDescendant(com.sh.javax.tree.GraphTreeNode), getSharedAncestor(com.sh.javax.tree.GraphTreeNode)
  - isNodeDescendant
```
public boolean isNodeDescendant(GraphTreeNode anotherNode)
```
    Returns true if anotherNode is a descendant of this node -- 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.
    
    参数:
    
    anotherNode - node to test as descendant of this node
    
    返回:
    
    true if this node is an ancestor of anotherNode
    
    另请参阅:
    
    isNodeAncestor(javax.swing.tree.TreeNode), getSharedAncestor(com.sh.javax.tree.GraphTreeNode)
  - getSharedAncestor
```
public javax.swing.tree.TreeNode getSharedAncestor(GraphTreeNode aNode)
```
    Returns the nearest common ancestor to this node and aNode. Returns null, if no such ancestor exists -- if this node and aNode are in different trees or if aNode is null. A node is considered an ancestor of itself.
    
    参数:
    
    aNode - node to find common ancestor with
    
    返回:
    
    nearest ancestor common to this node and aNode, or null if none
    
    另请参阅:
    
    isNodeAncestor(javax.swing.tree.TreeNode), isNodeDescendant(com.sh.javax.tree.GraphTreeNode)
  - isNodeRelated
```
public boolean isNodeRelated(GraphTreeNode aNode)
```
    Returns true if and only if aNode is in the same tree as this node. Returns false if aNode is null.
    
    参数:
    
    aNode - GraphTreeNode
    
    返回:
    
    true if aNode is in the same tree as this node; false if aNode is null
    
    另请参阅:
    
    getSharedAncestor(com.sh.javax.tree.GraphTreeNode), getRoot()
  - getDepth
```
public int getDepth()
```
    Returns the depth of the tree rooted at this node -- 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.
    
    返回:
    
    the depth of the tree whose root is this node
    
    另请参阅:
    
    getLevel()
  - getLevel
```
public int getLevel()
```
    Returns the number of levels above this node -- the distance from the root to this node. If this node is the root, returns 0.
    
    返回:
    
    the number of levels above this node
    
    另请参阅:
    
    getDepth()
  - getPath
```
public javax.swing.tree.TreeNode[] getPath()
```
    Returns the path from the root, to get to this node. The last element in the path is this node.
    
    返回:
    
    an array of TreeNode objects giving the path, where the first element in the path is the root and the last element is this node.
  - getUserObjectPath
```
public java.lang.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.
    
    返回:
    
    Object[]
  - getRoot
```
public javax.swing.tree.TreeNode getRoot()
```
    Returns the root of the tree that contains this node. The root is the ancestor with a null parent.
    
    返回:
    
    the root of the tree that contains this node
    
    另请参阅:
    
    isNodeAncestor(javax.swing.tree.TreeNode)
  - isRoot
```
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.
    
    返回:
    
    true if this node is the root of its tree
  - getNextNode
```
public GraphTreeNode 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.
    
    返回:
    
    the node that follows this node in a preorder traversal, or null if this node is last
    
    另请参阅:
    
    preorderEnumeration()
  - getPreviousNode
```
public GraphTreeNode 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 traversal -- the root of the tree. This is an inefficient way to traverse the entire tree; use an enumeration, instead.
    
    返回:
    
    the node that precedes this node in a preorder traversal, or null if this node is the first
    
    另请参阅:
    
    preorderEnumeration()
  - preorderEnumeration
```
public java.util.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.
    
    返回:
    
    an enumeration for traversing the tree in preorder
    
    另请参阅:
    
    postorderEnumeration()
  - postorderEnumeration
```
public java.util.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.
    
    返回:
    
    an enumeration for traversing the tree in postorder
    
    另请参阅:
    
    depthFirstEnumeration(), preorderEnumeration()
  - breadthFirstEnumeration
```
public java.util.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.
    
    返回:
    
    an enumeration for traversing the tree in breadth-first order
    
    另请参阅:
    
    depthFirstEnumeration()
  - depthFirstEnumeration
```
public java.util.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.
    
    返回:
    
    an enumeration for traversing the tree in depth-first order
    
    另请参阅:
    
    breadthFirstEnumeration(), postorderEnumeration()
  - pathFromAncestorEnumeration
```
public java.util.Enumeration pathFromAncestorEnumeration(javax.swing.tree.TreeNode ancestor)
```
  - isNodeChild
```
public boolean isNodeChild(javax.swing.tree.TreeNode aNode)
```
    Returns true if aNode is a child of this node. If aNode is null, this method returns false.
    
    参数:
    
    aNode - TreeNode
    
    返回:
    
    true if aNode is a child of this node; false if aNode is null
  - getFirstChild
```
public javax.swing.tree.TreeNode getFirstChild()
```
    Returns this node's first child. If this node has no children, throws NoSuchElementException.
    
    返回:
    
    the first child of this node
    
    抛出:
    
    java.util.NoSuchElementException - if this node has no children
  - getLastChild
```
public javax.swing.tree.TreeNode getLastChild()
```
    Returns this node's last child. If this node has no children, throws NoSuchElementException.
    
    返回:
    
    the last child of this node
    
    抛出:
    
    java.util.NoSuchElementException - if this node has no children
  - getChildAfter
```
public javax.swing.tree.TreeNode getChildAfter(javax.swing.tree.TreeNode aChild)
```
  - getChildBefore
```
public javax.swing.tree.TreeNode getChildBefore(javax.swing.tree.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.
    
    参数:
    
    aChild - TreeNode
    
    返回:
    
    the child of this node that immediately precedes aChild
    
    抛出:
    
    java.lang.IllegalArgumentException - if aChild is null or is not a child of this node
  - isNodeSibling
```
public boolean isNodeSibling(javax.swing.tree.TreeNode anotherNode)
```
    Returns true if anotherNode is a sibling of (has the same parent as) this node. A node is its own sibling. If anotherNode is null, returns false.
    
    参数:
    
    anotherNode - node to test as sibling of this node
    
    返回:
    
    true if anotherNode is a sibling of this node
  - getSiblingCount
```
public int getSiblingCount()
```
    Returns the number of siblings of this node. A node is its own sibling (if it has no parent or no siblings, this method returns 1).
    
    返回:
    
    the number of siblings of this node
  - getNextSibling
```
public GraphTreeNode 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.
    
    返回:
    
    the sibling of this node that immediately follows this node
    
    另请参阅:
    
    children
  - getPreviousSibling
```
public GraphTreeNode 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.
    
    返回:
    
    the sibling of this node that immediately precedes this node
  - isLeaf
```
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
    
    指定者:
    
    isLeaf 在接口中 javax.swing.tree.TreeNode
    
    返回:
    
    true if this node has no children
    
    另请参阅:
    
    getAllowsChildren()
  - getFirstLeaf
```
public GraphTreeNode getFirstLeaf()
```
    Finds and returns the first leaf that is a descendant of this node -- either this node or its first child's first leaf. Returns this node if it is a leaf.
    
    返回:
    
    the first leaf in the subtree rooted at this node
    
    另请参阅:
    
    isLeaf(), isNodeDescendant(com.sh.javax.tree.GraphTreeNode)
  - getLastLeaf
```
public GraphTreeNode getLastLeaf()
```
    Finds and returns the last leaf that is a descendant of this node -- either this node or its last child's last leaf. Returns this node if it is a leaf.
    
    返回:
    
    the last leaf in the subtree rooted at this node
    
    另请参阅:
    
    isLeaf(), isNodeDescendant(com.sh.javax.tree.GraphTreeNode)
  - getNextLeaf
```
public GraphTreeNode getNextLeaf()
```
    Returns the leaf after this node or null if this node is the last leaf in the tree.
    In this implementation of the MutableNode interface, this operation is very inefficient. In order to determine the next node, this method first performs a linear search in the parent's child-list in order to find the current node.
    That implementation makes the operation suitable for short traversals from a known position. But to traverse all of the leaves in the tree, you should use depthFirstEnumeration to enumerate the nodes in the tree and use isLeaf on each node to determine which are leaves.
    
    返回:
    
    returns the next leaf past this node
    
    另请参阅:
    
    depthFirstEnumeration(), isLeaf()
  - getPreviousLeaf
```
public GraphTreeNode getPreviousLeaf()
```
    Returns the leaf before this node or null if this node is the first leaf in the tree.
    In this implementation of the MutableNode interface, this operation is very inefficient. In order to determine the previous node, this method first performs a linear search in the parent's child-list in order to find the current node.
    That implementation makes the operation suitable for short traversals from a known position. But to traverse all of the leaves in the tree, you should use depthFirstEnumeration to enumerate the nodes in the tree and use isLeaf on each node to determine which are leaves.
    
    返回:
    
    returns the leaf before this node
    
    另请参阅:
    
    depthFirstEnumeration(), isLeaf()
  - getLeafCount
```
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.
    
    返回:
    
    the number of leaves beneath this node
    
    另请参阅:
    
    isNodeAncestor(javax.swing.tree.TreeNode)
  - toString
```
public java.lang.String toString()
```
    Returns the result of sending toString() to this node's user object, or null if this node has no user object.
    
    覆盖:
    
    toString 在类中 java.lang.Object
    
    另请参阅:
    
    getUserObject()
  - clone
```
public java.lang.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.
    
    覆盖:
    
    clone 在类中 java.lang.Object
    
    返回:
    
    a copy of this node

类 GraphTreeNode

字段概要

构造器概要

方法概要

从类继承的方法 java.lang.Object

字段详细资料

EMPTY_ENUMERATION

x

y

width

height

level

isoW

isoH

treeWidth

treeHeight

CTLR

toolTips

anchor

target

allowMapping

构造器详细资料

GraphTreeNode

GraphTreeNode

GraphTreeNode

方法详细资料

setX

setY

setWidth

setHeight

setPoint

setSize

setBound

getX

getY

getWidth

getHeight

getPoint

getSize

getBound

getNegX

getNegY

getPoint2

getCenX

getCenY

getPointNorth

getPointSouth

getPointWest

getPointEast

initGraphics

rememberLevel

getPathIsoWidth

getPathIsoHeight

setLeadingTreeSize

getLeadingTreeSize

moveWithChildren

moveWithoutChildren

getTotalDepth

_print

_print

_enum

getNodeTemplet

setNodeTemplet

toMap

getCoords

setToolTips

getToolTips

setAnchor

getAnchor

setTarget

getTarget

setAllowMapping

getAllowMapping

isAllowMapping

insert

remove

setParent

getParent

getChildAt

getChildCount