public class Tree<T> extends HashMap<T,Tree<T>> implements Serializable
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description | 
|---|
| Tree() | 
| Tree(Map.Entry<T,Tree<T>>... children) | 
| Tree(T... children) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | addTree(Tree<T> tree) | 
| List<T> | getLeafObjects() | 
| List<Tree<T>> | getLeafTrees() | 
| List<T> | getObjectsAtDepth(int depth) | 
| List<Tree<T>> | getTreesAtDepth(int depth) | 
| boolean | isLeaf() | 
| List<Tree<T>> | splitParents() | 
clear, clone, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, forEach, get, getOrDefault, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesequals, hashCode, toStringpublic Tree()
@SafeVarargs public Tree(T... children)
@SafeVarargs public Tree(Map.Entry<T,Tree<T>>... children)
Copyright © 2013–2018 Apache Software Foundation. All rights reserved.