io.lacuna.bifurcan.nodes

Class SortedMapNodes.Node<K,V>

java.lang.Object

io.lacuna.bifurcan.nodes.SortedMapNodes.Node<K,V>

Enclosing class:

SortedMapNodes

public static class SortedMapNodes.Node<K,V>
extends java.lang.Object

Field Summary

Fields

Modifier and Type	Field and Description
SortedMapNodes.Color	c
K	k
SortedMapNodes.Node<K,V>	l
SortedMapNodes.Node<K,V>	r
int	size
V	v

Constructor Summary

Constructors

Constructor and Description
Node(SortedMapNodes.Color c, SortedMapNodes.Node<K,V> l, K k, V v, SortedMapNodes.Node<K,V> r)

Method Summary

Modifier and Type	Method and Description
SortedMapNodes.Node<K,V>	balance()
SortedMapNodes.Node<K,V>	blacken()
SortedMapNodes.Node<K,V>	ceil(K key, java.util.Comparator<K> comparator)
int	checkInvariant()
SortedMapNodes.Node<K,V>	floor(K key, java.util.Comparator<K> comparator)
<U> SortedMapNodes.Node<K,U>	mapValues(java.util.function.BiFunction<K,V,U> f)
SortedMapNodes.Node<K,V>	put(K key, V value, java.util.function.BinaryOperator<V> merge, java.util.Comparator<K> comparator)
SortedMapNodes.Node<K,V>	redden()
SortedMapNodes.Node<K,V>	remove(K key, java.util.Comparator<K> comparator)
SortedMapNodes.Node<K,V>	rotate()
SortedMapNodes.Node<K,V>	slice(K min, K max, java.util.Comparator<K> comparator)
void	split(int targetSize, IList<SortedMapNodes.Node<K,V>> acc)
SortedMapNodes.Node<K,V>	unblacken()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

c

public final SortedMapNodes.Color c

k

public final K k

v

public final V v

l

public final SortedMapNodes.Node<K,V> l

r

public final SortedMapNodes.Node<K,V> r

size

public final int size

Constructor Detail

Node

public Node(SortedMapNodes.Color c,
            SortedMapNodes.Node<K,V> l,
            K k,
            V v,
            SortedMapNodes.Node<K,V> r)

Method Detail

redden

public SortedMapNodes.Node<K,V> redden()

blacken

public SortedMapNodes.Node<K,V> blacken()

unblacken

public SortedMapNodes.Node<K,V> unblacken()

remove

public SortedMapNodes.Node<K,V> remove(K key,
                                       java.util.Comparator<K> comparator)

put

public SortedMapNodes.Node<K,V> put(K key,
                                    V value,
                                    java.util.function.BinaryOperator<V> merge,
                                    java.util.Comparator<K> comparator)

split

public void split(int targetSize,
                  IList<SortedMapNodes.Node<K,V>> acc)

balance

public SortedMapNodes.Node<K,V> balance()

rotate

public SortedMapNodes.Node<K,V> rotate()

floor

public SortedMapNodes.Node<K,V> floor(K key,
                                      java.util.Comparator<K> comparator)

ceil

public SortedMapNodes.Node<K,V> ceil(K key,
                                     java.util.Comparator<K> comparator)

slice

public SortedMapNodes.Node<K,V> slice(K min,
                                      K max,
                                      java.util.Comparator<K> comparator)

mapValues

public <U> SortedMapNodes.Node<K,U> mapValues(java.util.function.BiFunction<K,V,U> f)

checkInvariant

public int checkInvariant()