Package com.google.cloud.firestore.collection

Class LLRBValueNode<K,V>

java.lang.Object

com.google.cloud.firestore.collection.LLRBValueNode<K,V>

All Implemented Interfaces:

LLRBNode<K,V>

Direct Known Subclasses:

LLRBBlackValueNode, LLRBRedValueNode

@InternalApi
public abstract class LLRBValueNode<K,V>
extends Object
implements LLRBNode<K,V>

Nested Class Summary

Nested classes/interfaces inherited from interface com.google.cloud.firestore.collection.LLRBNode

LLRBNode.Color, LLRBNode.NodeVisitor<K,V>, LLRBNode.ShortCircuitingNodeVisitor<K,V>

Method Summary

Modifier and Type	Method	Description
LLRBValueNode<K,V>	copy(K key, V value, LLRBNode.Color color, LLRBNode<K,V> left, LLRBNode<K,V> right)
protected abstract LLRBValueNode<K,V>	copy(K key, V value, LLRBNode<K,V> left, LLRBNode<K,V> right)
protected abstract LLRBNode.Color	getColor()
K	getKey()
LLRBNode<K,V>	getLeft()
LLRBNode<K,V>	getMax()
LLRBNode<K,V>	getMin()
LLRBNode<K,V>	getRight()
V	getValue()
void	inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
LLRBNode<K,V>	insert(K key, V value, Comparator<K> comparator)
boolean	isEmpty()
LLRBNode<K,V>	remove(K key, Comparator<K> comparator)
boolean	shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
boolean	shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.google.cloud.firestore.collection.LLRBNode

isRed, size

Method Details

getLeft

public LLRBNode<K,V> getLeft()

Specified by:

getLeft in interface LLRBNode<K,V>

getRight

public LLRBNode<K,V> getRight()

Specified by:

getRight in interface LLRBNode<K,V>

getKey

public K getKey()

Specified by:

getKey in interface LLRBNode<K,V>

getValue

public V getValue()

Specified by:

getValue in interface LLRBNode<K,V>

getColor

protected abstract LLRBNode.Color getColor()

copy

protected abstract LLRBValueNode<K,V> copy(K key,
 V value,
 LLRBNode<K,V> left,
 LLRBNode<K,V> right)

copy

public LLRBValueNode<K,V> copy(K key,
 V value,
 LLRBNode.Color color,
 LLRBNode<K,V> left,
 LLRBNode<K,V> right)

Specified by:

copy in interface LLRBNode<K,V>

insert

public LLRBNode<K,V> insert(K key,
 V value,
 Comparator<K> comparator)

Specified by:

insert in interface LLRBNode<K,V>

remove

public LLRBNode<K,V> remove(K key,
 Comparator<K> comparator)

Specified by:

remove in interface LLRBNode<K,V>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface LLRBNode<K,V>

getMin

public LLRBNode<K,V> getMin()

Specified by:

getMin in interface LLRBNode<K,V>

getMax

public LLRBNode<K,V> getMax()

Specified by:

getMax in interface LLRBNode<K,V>

inOrderTraversal

public void inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)

Specified by:

inOrderTraversal in interface LLRBNode<K,V>

shortCircuitingInOrderTraversal

public boolean shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)

Specified by:

shortCircuitingInOrderTraversal in interface LLRBNode<K,V>

shortCircuitingReverseOrderTraversal

public boolean shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)

Specified by:

shortCircuitingReverseOrderTraversal in interface LLRBNode<K,V>