Package com.google.cloud.firestore.collection

Interface LLRBNode<K,V>

All Known Implementing Classes:

LLRBBlackValueNode, LLRBEmptyNode, LLRBRedValueNode, LLRBValueNode

@InternalApi
public interface LLRBNode<K,V>

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static enum	LLRBNode.Color
static class	LLRBNode.NodeVisitor<K,V>
static interface	LLRBNode.ShortCircuitingNodeVisitor<K,V>

Method Summary

Modifier and Type	Method	Description
LLRBNode<K,V>	copy(K key, V value, LLRBNode.Color color, LLRBNode<K,V> left, LLRBNode<K,V> right)
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()
boolean	isRed()
LLRBNode<K,V>	remove(K key, Comparator<K> comparator)
boolean	shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
boolean	shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
int	size()

Method Details

copy

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

insert

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

remove

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

isEmpty

boolean isEmpty()

isRed

boolean isRed()

getKey

K getKey()

getValue

V getValue()

getLeft

LLRBNode<K,V> getLeft()

getRight

LLRBNode<K,V> getRight()

getMin

LLRBNode<K,V> getMin()

getMax

LLRBNode<K,V> getMax()

size

int size()

inOrderTraversal

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

shortCircuitingInOrderTraversal

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

shortCircuitingReverseOrderTraversal

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