public final class TreeifyUtil extends Object
| 限定符和类型 | 方法和说明 |
|---|---|
static <K,T extends MultiTreeify<K,T>> |
multiTree2List(T node,
boolean containSelf,
boolean disconnect)
将树节点node展开为list
|
static <K,T extends MultiTreeify<K,T>> |
multiTree2List(T node,
boolean containSelf,
boolean disconnect,
Comparator<? super T> comparator)
将树节点node展开为list
|
static <K,T extends MultiTreeify<K,T>> |
multiTree2Map(T node,
boolean containSelf,
boolean disconnect)
将树节点node展开为Map
|
static <K,T extends Treeify<K,T>> |
tree2List(T node,
boolean containSelf,
boolean disconnect)
将树节点node展开为list
|
static <K,T extends Treeify<K,T>> |
tree2List(T node,
boolean containSelf,
boolean disconnect,
Comparator<? super T> comparator)
将树节点node展开为list
|
static <K,T extends Treeify<K,T>> |
tree2Map(T node,
boolean containSelf,
boolean disconnect)
将树节点node展开为Map
|
static <K,T extends Treeify<K,T>> |
treeify(List<? extends Treeify<K,T>> nodeList)
获取树map
|
static <K,T extends Treeify<K,T>> |
treeify(List<? extends Treeify<K,T>> nodeList,
Comparator<? super T> childrenComparator)
获取树map
|
static <K,T extends Treeify<K,T>> |
treeify(List<? extends Treeify<K,T>> nodeList,
Comparator<? super T> childrenComparator,
K nodeKey)
获取指定根节点的树
|
static <K,T extends Treeify<K,T>> |
treeify(List<? extends Treeify<K,T>> nodeList,
K nodeKey)
获取指定根节点的树
|
static <K,T extends MultiTreeify<K,T>> |
treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList)
获取树map
|
static <K,T extends MultiTreeify<K,T>> |
treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList,
Comparator<? super T> childrenComparator)
获取树map
|
static <K,T extends MultiTreeify<K,T>> |
treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList,
Comparator<? super T> childrenComparator,
K nodeKey)
获取指定根节点的树
|
static <K,T extends MultiTreeify<K,T>> |
treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList,
K nodeKey)
获取指定根节点的树
|
static <K,T extends MultiTreeify<K,T>> |
treeifyMultiWithSort(List<? extends MultiTreeify<K,T>> nodeList,
Comparator<? super T> childrenComparator)
获取树map
P.S. key-唯一定位节点的key, value-以key对应的节点为根节点的树
|
static <K,T extends Treeify<K,T>> |
treeifyWithSort(List<? extends Treeify<K,T>> nodeList,
Comparator<? super T> childrenComparator)
获取树map
P.S. key-唯一定位节点的key, value-以key对应的节点为根节点的树
|
public static <K,T extends Treeify<K,T>> T treeify(List<? extends Treeify<K,T>> nodeList, K nodeKey)
public static <K,T extends Treeify<K,T>> T treeify(List<? extends Treeify<K,T>> nodeList, Comparator<? super T> childrenComparator, K nodeKey)
nodeList - 需要树化的节点childrenComparator - 子节点排序器(, 若其不为空,则会对子节点进行排序)public static <K,T extends Treeify<K,T>> Map<K,T> treeify(List<? extends Treeify<K,T>> nodeList)
public static <K,T extends Treeify<K,T>> Map<K,T> treeify(List<? extends Treeify<K,T>> nodeList, Comparator<? super T> childrenComparator)
public static <K,T extends Treeify<K,T>> Map<K,T> treeifyWithSort(List<? extends Treeify<K,T>> nodeList, Comparator<? super T> childrenComparator)
P.S. key-唯一定位节点的key, value-以key对应的节点为根节点的树
nodeList - 需要树化的节点childrenComparator - 子节点排序器(, 若其不为空,则会对子节点进行排序)public static <K,T extends Treeify<K,T>> List<T> tree2List(T node, boolean containSelf, boolean disconnect)
public static <K,T extends Treeify<K,T>> List<T> tree2List(T node, boolean containSelf, boolean disconnect, Comparator<? super T> comparator)
node - 要展开的tree的根节点containSelf - 是否包含本身节点disconnect - 是否断开父子节点之间的children集合联系
comparator - 节点排序比较器(, 若其不为空,则会对生成的list进行比较并排序)public static <K,T extends Treeify<K,T>> Map<K,T> tree2Map(T node, boolean containSelf, boolean disconnect)
node - 要展开的tree的根节点containSelf - 是否包含本身节点disconnect - 是否断开父子节点之间的children集合联系
public static <K,T extends MultiTreeify<K,T>> T treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList, K nodeKey)
public static <K,T extends MultiTreeify<K,T>> T treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList, Comparator<? super T> childrenComparator, K nodeKey)
nodeList - 需要树化的节点childrenComparator - 子节点排序器(, 若其不为空,则会对子节点进行排序)public static <K,T extends MultiTreeify<K,T>> Map<K,T> treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList)
public static <K,T extends MultiTreeify<K,T>> Map<K,T> treeifyMulti(List<? extends MultiTreeify<K,T>> nodeList, Comparator<? super T> childrenComparator)
public static <K,T extends MultiTreeify<K,T>> Map<K,T> treeifyMultiWithSort(List<? extends MultiTreeify<K,T>> nodeList, Comparator<? super T> childrenComparator)
P.S. key-唯一定位节点的key, value-以key对应的节点为根节点的树
nodeList - 需要树化的节点childrenComparator - 子节点排序器(, 若其不为空,则会对子节点进行排序)public static <K,T extends MultiTreeify<K,T>> List<T> multiTree2List(T node, boolean containSelf, boolean disconnect)
public static <K,T extends MultiTreeify<K,T>> List<T> multiTree2List(T node, boolean containSelf, boolean disconnect, Comparator<? super T> comparator)
node - 要展开的tree的根节点containSelf - 是否包含本身节点disconnect - 是否断开父子节点之间的children集合联系
comparator - 节点排序比较器(, 若其不为空,则会对生成的list进行比较并排序)public static <K,T extends MultiTreeify<K,T>> Map<K,T> multiTree2Map(T node, boolean containSelf, boolean disconnect)
node - 要展开的tree的根节点containSelf - 是否包含本身节点disconnect - 是否断开父子节点之间的children集合联系
Copyright © 2023. All rights reserved.