public class STree<T> extends Tree<Integer,T>
Tree using a simple counter as connection infoAbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Modifier | Constructor and Description |
|---|---|
protected |
STree()
constructor
|
|
STree(T node,
Tree<Integer,T> parent)
constructor
|
|
STree(T node,
Tree<Integer,T> parent,
Map<? extends Integer,? extends Tree<Integer,T>> m)
constructor
|
|
STree(T node,
Tree<Integer,T> parent,
T... children) |
|
STree(T node,
Tree<Integer,T> parent,
de.tsl2.nano.incubation.tree.TreeOrderStrategy strategy,
T... children)
constructor
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(Integer connection,
T child) |
void |
add(T... childs) |
protected int |
createKey(T node)
creates a new connection-info as map-key for the map of child-trees. see
TreeOrderStrategy for several creation-strategies. |
collect, collect, collectChildNodes, collectTree, collectTree, equals, fromString, getChildren, getLevel, getNode, getNode, getParent, getRoot, hashCode, init, isLeaf, toString, transform, transformTreeceilingEntry, 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 STree()
public STree(T node, Tree<Integer,T> parent, Map<? extends Integer,? extends Tree<Integer,T>> m)
node - parent - m - public STree(T node, Tree<Integer,T> parent, de.tsl2.nano.incubation.tree.TreeOrderStrategy strategy, T... children)
node - parent - m - Copyright © 2012–2018. All rights reserved.