Uses of Class
org.pcollections.KVTree
-
Uses of KVTree in org.pcollections
Fields in org.pcollections declared as KVTreeModifier and TypeFieldDescriptionprivate static final KVTree
<?, ?> KVTree.EMPTY
The empty tree / leaf node.KVTree.left
KVTree.EntryIterator.nextSubtree
node that we need to enterKVTree.right
TreePMap.tree
TreePSet.tree
Fields in org.pcollections with type parameters of type KVTreeModifier and TypeFieldDescriptionKVTree.EntryIterator.stack
nodes that we've recursed into, but not yet returnedMethods in org.pcollections that return KVTreeModifier and TypeMethodDescriptionprivate static <K,
V> KVTree <K, V> (package private) static <K,
V> KVTree <K, V> KVTree.empty()
KVTree.EntryIterator.firstChild
(KVTree<K, V> node) (package private) static <K,
V> KVTree <K, V> KVTree.fromEntryIterator
(Iterator<? extends Map.Entry<? extends K, ? extends V>> iterator) private static <K,
V> KVTree <K, V> KVTree.fromIterator
(Iterator<?> iterator, KVTree.IteratorType iteratorType, int maxHeight) (package private) static <K,
V> KVTree <K, V> KVTree.fromKeyIterator
(Iterator<? extends K> iterator) KVTree.getLeftmost()
KVTree.getRightmost()
private static <K,
V> KVTree <K, V> 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.KVTree.minus
(K key, Comparator<? super K> comparator) KVTree.minusLeftmost()
KVTree.minusRightmost()
KVTree.plus
(K key, V value, Comparator<? super K> comparator) KVTree.range
(K leftBound, boolean isLeftBoundInclusive, K rightBound, boolean isRightBoundInclusive, Comparator<? super K> comparator) KVTree.rangeToLeft
(K rightBound, boolean isRightBoundInclusive, Comparator<? super K> comparator) KVTree.rangeToRight
(K leftBound, boolean isleftBoundInclusive, Comparator<? super K> comparator) KVTree.replaceLeft
(KVTree<K, V> newLeft) KVTree.replaceRight
(KVTree<K, V> newRight) KVTree.replaceValue
(V newValue) KVTree.search
(K key, Comparator<? super K> comparator, KVTree.SearchType searchType) TreePMap.search
(K key, KVTree.SearchType searchTypeIfLeftToRight, KVTree.SearchType searchTypeIfRightToLeft) KVTree.EntryIterator.secondChild
(KVTree<K, V> node) Methods in org.pcollections with parameters of type KVTreeModifier and TypeMethodDescriptionprivate static <K,
V> KVTree <K, V> KVTree.EntryIterator.firstChild
(KVTree<K, V> node) private static <K,
V> KVTree <K, V> 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.KVTree.replaceLeft
(KVTree<K, V> newLeft) KVTree.replaceRight
(KVTree<K, V> newRight) KVTree.EntryIterator.secondChild
(KVTree<K, V> node) Constructors in org.pcollections with parameters of type KVTreeModifierConstructorDescription(package private)
EntryIterator
(KVTree<K, V> tree, boolean isLeftToRight) private
Constructor for a non-empty/non-leaf node.private
(package private)
TreePSet
(KVTree<E, ?> tree, Comparator<? super E> ltrComparator, boolean isLeftToRight) Non-private only because also used by TreePMap.keySet().