TreeLayoutNode class
Constructors
- TreeLayoutNode(TreeLayoutNode? parent, TreeData data, {int deep = 0, int maxDeep = -1, num value = 0})
Properties
- childCount → int
-
no setterinherited
- childIndex → int
-
自身在父节点中的索引 如果为-1表示没有父节点
no setterinherited
-
children
→ List<
TreeLayoutNode> -
no setterinherited
-
childrenReverse
→ List<
TreeLayoutNode> -
no setterinherited
- count → int
-
返回后代节点数
调用该方法前必须先调用 computeCount，否则永远返回0
no setterinherited
- data → TreeData
-
final
- deep → int
-
no setterinherited
- expand ↔ bool
-
getter/setter pairinherited
- firstChild → TreeLayoutNode
-
no setterinherited
- hasChild → bool
-
no setterinherited
- hashCode → int
-
The hash code for this object.
no setterinherited
- height → int
-
no setterinherited
- isLeaf → bool
-
no setterinherited
- lastChild → TreeLayoutNode
-
no setterinherited
- maxDeep ↔ int
-
整颗树最大的深度
getter/setter pairinherited
- notChild → bool
-
no setterinherited
- parent ↔ TreeLayoutNode?
-
getter/setter pairinherited
- position → Offset
-
no setter
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
- select ↔ bool
-
getter/setter pairinherited
- size ↔ Size
-
保存节点大小和位置
getter/setter pairinherited
- value ↔ double
-
getter/setter pairinherited
- x ↔ num
-
记录节点坐标
getter/setter pair
- y ↔ num
-
getter/setter pair
Methods
-
add(
TreeLayoutNode node) → void -
inherited
-
ancestors(
) → List< TreeLayoutNode> -
返回从当前节点开始的祖先节点
inherited
-
bottom2Top(
) → void -
inherited
-
childAt(
int index) → TreeLayoutNode -
inherited
-
clear(
) → void -
inherited
-
computeCount(
) → int -
计算当前节点的后代节点数
inherited
-
computeDeep(
TreeLayoutNode node, [int initDeep = 0]) → void -
inherited
-
computeHeight(
TreeLayoutNode node, [int initHeight = 0]) → void -
计算树的高度
inherited
-
copy(
TreeLayoutNode build(TreeLayoutNode?, TreeLayoutNode), [int deep = 0]) → TreeLayoutNode -
从复制当前节点及其后代
复制后的节点没有parent
inherited
-
depthNode(
int depth, [bool only = true]) → List< TreeLayoutNode> -
从当前节点开始查找深度等于给定深度的节点
广度优先遍历
only==true 只返回对应层次的,否则返回<=inherited -
descendants(
) → List< TreeLayoutNode> -
返回其所有后代节点
inherited
-
each(
TreeFun< TreeLayoutNode> callback) → TreeLayoutNode -
inherited
-
eachAfter(
TreeFun< TreeLayoutNode> callback) → TreeLayoutNode -
后序遍历
inherited
-
eachBefore(
TreeFun< TreeLayoutNode> callback) → TreeLayoutNode -
先序遍历
inherited
-
find(
TreeFun< TreeLayoutNode> callback) → TreeLayoutNode? -
在子节点中查找对应节点
inherited
-
findMaxDeep(
) → int -
inherited
-
getBoundBox(
) → Rect -
inherited
-
iterator(
) → List< TreeLayoutNode> -
返回其后代所有节点(按照拓扑结构)
inherited
-
leafLeft(
) → TreeLayoutNode -
返回当前节点下最左边的叶子节点
inherited
-
leafRight(
) → TreeLayoutNode -
inherited
-
leaves(
) → List< TreeLayoutNode> -
返回其所有的叶子结点
inherited
-
links(
) → List< Link< TreeLayoutNode> > -
返回当前节点的后续的所有Link
inherited
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
path(
TreeLayoutNode target) → List< TreeLayoutNode> -
返回从当前节点到指定节点的最短路径
inherited
-
remove(
TreeLayoutNode node) → void -
inherited
-
removeAt(
int i) → TreeLayoutNode -
inherited
-
removeChild(
bool filter(TreeLayoutNode)) → void -
inherited
-
removeFirst(
) → TreeLayoutNode -
inherited
-
removeLast(
) → TreeLayoutNode -
inherited
-
removeWhere(
bool where(TreeLayoutNode), [bool iterator = false]) → void -
inherited
-
resetDeep(
int deep, [bool iterator = true]) → void -
重新设置深度
inherited
-
right2Left(
) → void -
inherited
-
setExpand(
bool e, [bool iterator = true]) → void -
inherited
-
sort(
int compare(TreeLayoutNode, TreeLayoutNode), [bool iterator = true]) → TreeLayoutNode -
inherited
-
sum(
[num valueCallback(TreeLayoutNode)?]) → TreeLayoutNode -
计算当前节点值
如果给定了回调,那么将使用给定的回调进行值统计
否则直接使用 _value 统计
inherited
-
toString(
) → String -
A string representation of this object.
inherited
-
translate(
num dx, num dy) → void -
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited