Class RedBlackTree<K,V>
java.lang.Object
com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree<K,V>
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate static final Comparator
private final TreeFactory
private final KeyFunction
<K, V> private final Comparator
<? super K> -
Constructor Summary
ConstructorsConstructorDescriptionRedBlackTree
(TreeFactory factory, Comparator<? super K> ordering, KeyFunction<K, V> keyFunction) -
Method Summary
Modifier and TypeMethodDescriptionprivate <E> List
<E> boolean
static int
<U> void
Comparator
<? super K> private boolean
isBlackTree
(Tree<?, ?> tree) boolean
private boolean
keysIterator
(Tree<K, V> tree) unzipBoth
(Tree<K, V> left, Tree<K, V> right, List<Tree<K, V>> leftZipper, List<Tree<K, V>> rightZipper, int smallerDepth) valuesIterator
(Tree<K, V> tree)
-
Field Details
-
factory
-
ordering
-
kf
-
DEFAULT_COMPARATOR
-
-
Constructor Details
-
RedBlackTree
public RedBlackTree() -
RedBlackTree
public RedBlackTree(TreeFactory factory, Comparator<? super K> ordering, KeyFunction<K, V> keyFunction)
-
-
Method Details
-
getKeyFunction
-
getOrdering
-
isEmpty
-
contains
-
get
-
lookup
-
count
-
update
-
delete
-
range
-
from
-
until
-
drop
-
take
-
slice
-
smallest
-
greatest
-
forEach
-
iterator
-
keysIterator
-
valuesIterator
-
isRedTree
-
isBlackTree
-
blacken
-
mkTree
-
balanceLeft
-
balanceRight
-
upd
-
updNth
-
del
-
balance
-
subl
-
balLeft
-
balRight
-
delLeft
-
delRight
-
append
-
doFrom
-
doUntil
-
doRange
-
doDrop
-
doTake
-
doSlice
-
compareDepth
-
unzip
-
cons
-
unzipBoth
-
findDepth
-
rebalance
-