Uses of Class
org.pcollections.KVTree

Uses of KVTree in org.pcollections

Fields in org.pcollections declared as KVTree

Modifier and Type	Field	Description
private static final KVTree<?,?>	KVTree.EMPTY	The empty tree / leaf node.
private final KVTree<K,V>	KVTree.left
private KVTree<K,V>	KVTree.EntryIterator.nextSubtree	node that we need to enter
private final KVTree<K,V>	KVTree.right
private final KVTree<K,V>	TreePMap.tree
private final KVTree<E,?>	TreePSet.tree

Fields in org.pcollections with type parameters of type KVTree

Modifier and Type	Field	Description
private final ArrayList<KVTree<K,V>>	KVTree.EntryIterator.stack	nodes that we've recursed into, but not yet returned

Methods in org.pcollections that return KVTree

Modifier and Type	Method	Description
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(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)
(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, 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, Comparator<? super K> comparator)
(package private) KVTree<K,V>	KVTree.range(K leftBound, boolean isLeftBoundInclusive, K rightBound, boolean isRightBoundInclusive, Comparator<? super K> comparator)
(package private) KVTree<K,V>	KVTree.rangeToLeft(K rightBound, boolean isRightBoundInclusive, Comparator<? super K> comparator)
(package private) KVTree<K,V>	KVTree.rangeToRight(K leftBound, boolean isleftBoundInclusive, 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, 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)

Methods in org.pcollections with parameters of type KVTree

Modifier and Type	Method	Description
private static <K,V> KVTree<K,V>	KVTree.concat(KVTree<K,V> left, KVTree<K,V> right)
private KVTree<K,V>	KVTree.EntryIterator.firstChild(KVTree<K,V> node)
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.
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.EntryIterator.secondChild(KVTree<K,V> node)
private TreePMap<K,V>	TreePMap.withTree(KVTree<K,V> updatedTree)
private TreePSet<E>	TreePSet.withTree(KVTree<E,?> tree)

Constructors in org.pcollections with parameters of type KVTree

Modifier	Constructor	Description
(package private)	EntryIterator(KVTree<K,V> tree, boolean isLeftToRight)
private	KVTree(KVTree<K,V> left, K key, V value, KVTree<K,V> right)	Constructor for a non-empty/non-leaf node.
private	TreePMap(KVTree<K,V> tree, Comparator<? super K> ltrComparator, boolean isLeftToRight)
(package private)	TreePSet(KVTree<E,?> tree, Comparator<? super E> ltrComparator, boolean isLeftToRight)	Non-private only because also used by TreePMap.keySet().