@InternalApi
public interface LLRBNode<K,V>
Modifier and Type | Interface and Description |
---|---|
static class |
LLRBNode.Color |
static class |
LLRBNode.NodeVisitor<K,V> |
static interface |
LLRBNode.ShortCircuitingNodeVisitor<K,V> |
Modifier and Type | Method and 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() |
LLRBNode<K,V> copy(K key, V value, LLRBNode.Color color, LLRBNode<K,V> left, LLRBNode<K,V> right)
boolean isEmpty()
boolean isRed()
K getKey()
V getValue()
int size()
void inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
boolean shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
boolean shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
Copyright © 2019 Google LLC. All rights reserved.