C - connection descriptorT - node typepublic class Tree<C,T> extends TreeMap<C,Tree<C,T>>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Modifier | Constructor and Description |
|---|---|
protected |
Tree()
constructor
|
|
Tree(T node,
Tree<C,T> parent)
constructor
|
|
Tree(T node,
Tree<C,T> parent,
Comparator<? super C> comparator)
constructor
|
|
Tree(T node,
Tree<C,T> parent,
Map<? extends C,? extends Tree<C,T>> m)
constructor
|
|
Tree(T node,
Tree<C,T> parent,
SortedMap<C,? extends Tree<C,T>> m)
constructor
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(C connection,
T child) |
List<T> |
collect(de.tsl2.nano.core.IPredicate<T> condition) |
List<T> |
collect(de.tsl2.nano.core.IPredicate<T> condition,
List<T> c)
TODO: test
collects all tree nodes that satisfy condition.
|
List<T> |
collectChildNodes(T node) |
List<Tree<C,T>> |
collectTree(de.tsl2.nano.core.IPredicate<Tree<C,T>> condition) |
List<Tree<C,T>> |
collectTree(de.tsl2.nano.core.IPredicate<Tree<C,T>> condition,
List<Tree<C,T>> c)
TODO: test
collects all tree nodes that satisfy condition.
|
boolean |
equals(Object o) |
static Tree<String,String> |
fromString(Scanner scanner) |
Collection<T> |
getChildren()
getChildren
|
int |
getLevel() |
T |
getNode()
getNode
|
<N extends Tree<C,T>> |
getNode(T node)
uses
collectTree(IPredicate) to find the given node |
Tree<C,T> |
getParent() |
Tree<C,T> |
getRoot() |
int |
hashCode() |
protected void |
init(T node,
Tree<C,T> parent)
init
|
boolean |
isLeaf()
isLeaf
|
String |
toString()
creates a graphviz like string.
|
void |
transform(de.tsl2.nano.core.ITransformer<T,T> transformer)
TODO: test
walks through the tree nodes and calls the transformer on each node.
|
<TREE extends Tree<C,T>> |
transformTree(de.tsl2.nano.core.ITransformer<TREE,TREE> transformer)
TODO: test
walks through the tree nodes and calls the transformer on each node.
|
ceilingEntry, ceilingKey, clear, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, put, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, valuesisEmptyfinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, getOrDefault, isEmpty, merge, putIfAbsent, removeprotected T node
protected Tree()
public Tree(T node, Tree<C,T> parent, Comparator<? super C> comparator)
comparator - public Tree(T node, Tree<C,T> parent, Map<? extends C,? extends Tree<C,T>> m)
m - public T getNode()
public boolean isLeaf()
public Collection<T> getChildren()
public int getLevel()
public <N extends Tree<C,T>> N getNode(T node)
collectTree(IPredicate) to find the given nodenode - node to findpublic List<T> collect(de.tsl2.nano.core.IPredicate<T> condition, List<T> c)
root - INode implementation holding the root object.condition - collecting conditionpublic List<Tree<C,T>> collectTree(de.tsl2.nano.core.IPredicate<Tree<C,T>> condition, List<Tree<C,T>> c)
root - INode implementation holding the root object.condition - collecting conditionpublic void transform(de.tsl2.nano.core.ITransformer<T,T> transformer)
transformer - transformerpublic <TREE extends Tree<C,T>> void transformTree(de.tsl2.nano.core.ITransformer<TREE,TREE> transformer)
transformer - transformerpublic int hashCode()
public boolean equals(Object o)
Copyright © 2012–2018. All rights reserved.