Class LLRBValueNode<K,V> (3.21.3)

Version latest

• 3.21.3 (latest)
• 3.21.1
• 3.20.0
• 3.17.0
• 3.16.3
• 3.15.7
• 3.14.4
• 3.13.2
• 3.12.1
• 3.11.0
• 3.10.0
• 3.9.6
• 3.8.2
• 3.7.10
• 3.6.0
• 3.5.0
• 3.4.2
• 3.3.0
• 3.2.0
• 3.1.0
• 3.0.21

public abstract class LLRBValueNode<K,V> implements LLRBNode<K,V>

Inheritance

java.lang.Object > LLRBValueNode<K,V>

Implements

LLRBNode<K,V>

Inherited Members

Object.clone()

Object.equals(Object)

Object.finalize()

Object.getClass()

Object.hashCode()

Object.notify()

Object.notifyAll()

Object.toString()

Object.wait()

Object.wait(long)

Object.wait(long,int)

Type Parameters
Name	Description
K
V

Methods

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

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

Parameters
Name	Description
key	K
value	V
color	LLRBNode.Color
left	LLRBNode<K,V>
right	LLRBNode<K,V>

Returns
Type	Description
LLRBValueNode<K,V>

copy(K key, V value, 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)

Parameters
Name	Description
key	K
value	V
left	LLRBNode<K,V>
right	LLRBNode<K,V>

Returns
Type	Description
LLRBValueNode<K,V>

getColor()

protected abstract LLRBNode.Color getColor()

Returns
Type	Description
LLRBNode.Color

getKey()

public K getKey()

Returns
Type	Description
K

getLeft()

public LLRBNode<K,V> getLeft()

Returns
Type	Description
LLRBNode<K,V>

getMax()

public LLRBNode<K,V> getMax()

Returns
Type	Description
LLRBNode<K,V>

getMin()

public LLRBNode<K,V> getMin()

Returns
Type	Description
LLRBNode<K,V>

getRight()

public LLRBNode<K,V> getRight()

Returns
Type	Description
LLRBNode<K,V>

getValue()

public V getValue()

Returns
Type	Description
V

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

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

Parameter
Name	Description
visitor	NodeVisitor<K,V>

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

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

Parameters
Name	Description
key	K
value	V
comparator	Comparator<K>

Returns
Type	Description
LLRBNode<K,V>

isEmpty()

public boolean isEmpty()

Returns
Type	Description
boolean

remove(K key, Comparator<K> comparator)

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

Parameters
Name	Description
key	K
comparator	Comparator<K>

Returns
Type	Description
LLRBNode<K,V>

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

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

Parameter
Name	Description
visitor	ShortCircuitingNodeVisitor<K,V>

Returns
Type	Description
boolean

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

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

Parameter
Name	Description
visitor	ShortCircuitingNodeVisitor<K,V>

Returns
Type	Description
boolean