private static <K,V> KVTree<K,V> |
KVTree.concat(KVTree<K,V> left,
KVTree<K,V> right) |
|
(package private) static <K,V> KVTree<K,V> |
KVTree.empty() |
|
private KVTree<K,V> |
KVTree.EntryIterator.firstChild(KVTree<K,V> node) |
|
(package private) static <K,V> KVTree<K,V> |
KVTree.fromEntryIterator(java.util.Iterator<? extends java.util.Map.Entry<? extends K,? extends V>> iterator) |
|
private static <K,V> KVTree<K,V> |
KVTree.fromIterator(java.util.Iterator<?> iterator,
KVTree.IteratorType iteratorType,
int maxHeight) |
|
(package private) static <K,V> KVTree<K,V> |
KVTree.fromKeyIterator(java.util.Iterator<? extends K> iterator) |
|
(package private) KVTree<K,V> |
KVTree.getLeftmost() |
|
(package private) KVTree<K,V> |
KVTree.getRightmost() |
|
private static <K,V> KVTree<K,V> |
KVTree.join(KVTree<K,V> left,
K key,
V value,
KVTree<K,V> right) |
Creates a tree consisting of all the mappings of 'left', in order, followed by a mapping from
'key' to 'value', followed by all the mappings of 'right', in order.
|
(package private) KVTree<K,V> |
KVTree.minus(K key,
java.util.Comparator<? super K> comparator) |
|
(package private) KVTree<K,V> |
KVTree.minusLeftmost() |
|
(package private) KVTree<K,V> |
KVTree.minusRightmost() |
|
(package private) KVTree<K,V> |
KVTree.plus(K key,
V value,
java.util.Comparator<? super K> comparator) |
|
(package private) KVTree<K,V> |
KVTree.range(K leftBound,
boolean isLeftBoundInclusive,
K rightBound,
boolean isRightBoundInclusive,
java.util.Comparator<? super K> comparator) |
|
(package private) KVTree<K,V> |
KVTree.rangeToLeft(K rightBound,
boolean isRightBoundInclusive,
java.util.Comparator<? super K> comparator) |
|
(package private) KVTree<K,V> |
KVTree.rangeToRight(K leftBound,
boolean isleftBoundInclusive,
java.util.Comparator<? super K> comparator) |
|
private KVTree<K,V> |
KVTree.replaceLeft(KVTree<K,V> newLeft) |
|
private KVTree<K,V> |
KVTree.replaceRight(KVTree<K,V> newRight) |
|
private KVTree<K,V> |
KVTree.replaceValue(V newValue) |
|
(package private) KVTree<K,V> |
KVTree.search(K key,
java.util.Comparator<? super K> comparator,
KVTree.SearchType searchType) |
|
private KVTree<K,V> |
TreePMap.search(K key,
KVTree.SearchType searchTypeIfLeftToRight,
KVTree.SearchType searchTypeIfRightToLeft) |
|
private KVTree<K,V> |
KVTree.EntryIterator.secondChild(KVTree<K,V> node) |
|