org.nutz.lang.util
接口 Node<T>

类型参数:
T -
所有已知实现类:
SimpleNode, Tag

public interface Node<T>

树节点。

作者:
zozoh(zozohtnt@gmail.com)

方法摘要
 Node<T> add(Node<?>... nodes)
           
 Node<T> addFirst(Node<T> node)
           
 Node<T> child(int index)
           
 Node<T> clearChildren()
           
 int countChildren()
           
 int depth()
           
 Node<T> desc(int... indexes)
           
 Node<T> firstChild()
           
 T get()
           
 java.util.List<Node<T>> getAncestors()
           
 java.util.List<Node<T>> getChildren()
           
 int getIndex()
           
 java.util.List<Node<T>> getNextSibling()
           
 java.util.List<Node<T>> getPrevSibling()
           
 boolean hasChild()
           
 int index()
           
 Node<T> insertBefore(int index, Node<T> node)
           
 boolean isFirst()
           
 boolean isLast()
           
 boolean isRoot()
           
 java.util.Iterator<Node<T>> iterator()
           
 Node<T> lastChild()
           
 Node<T> next()
           
 Node<T> next(int index)
           
 Node<T> next(Node<T> node)
           
 Node<T> parent()
           
 Node<T> parent(Node<T> node)
           
 Node<T> pop()
           
 Node<T> popFirst()
           
 Node<T> prev()
           
 Node<T> prev(int index)
           
 Node<T> prev(Node<T> node)
           
 boolean remove()
           
 Node<T> removeChild(int index)
           
 Node<T> set(T obj)
           
 Node<T> top()
           
 

方法详细信息

get

T get()

set

Node<T> set(T obj)

parent

Node<T> parent(Node<T> node)

parent

Node<T> parent()

top

Node<T> top()

prev

Node<T> prev()

prev

Node<T> prev(Node<T> node)

prev

Node<T> prev(int index)

next

Node<T> next()

next

Node<T> next(Node<T> node)

next

Node<T> next(int index)

add

Node<T> add(Node<?>... nodes)

addFirst

Node<T> addFirst(Node<T> node)

pop

Node<T> pop()

popFirst

Node<T> popFirst()

removeChild

Node<T> removeChild(int index)

getIndex

int getIndex()

remove

boolean remove()
返回:
true 成功移除,false 不能移除

clearChildren

Node<T> clearChildren()

insertBefore

Node<T> insertBefore(int index,
                     Node<T> node)

isRoot

boolean isRoot()

isLast

boolean isLast()

isFirst

boolean isFirst()

getAncestors

java.util.List<Node<T>> getAncestors()

depth

int depth()

getNextSibling

java.util.List<Node<T>> getNextSibling()

getPrevSibling

java.util.List<Node<T>> getPrevSibling()

index

int index()

getChildren

java.util.List<Node<T>> getChildren()

child

Node<T> child(int index)

desc

Node<T> desc(int... indexes)

countChildren

int countChildren()

hasChild

boolean hasChild()

firstChild

Node<T> firstChild()

lastChild

Node<T> lastChild()

iterator

java.util.Iterator<Node<T>> iterator()