Some or all of the information on this page might not apply to Trusted Cloud by S3NS.
Class LLRBValueNode<K,V> (3.22.0)
Note: Some or all of the information on this page might not apply
to Trusted Cloud. For a list of services that are available in
Trusted Cloud, see Services available for
Trusted Cloud .
Version 3.22.0keyboard_arrow_down
public abstract class LLRBValueNode<K , V > implements LLRBNode<K , V >
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 )
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 >
getColor()
protected abstract LLRBNode . Color getColor ()
getKey()
Returns
Type
Description
K
getLeft()
public LLRBNode<K , V > getLeft ()
getMax()
public LLRBNode<K , V > getMax ()
getMin()
public LLRBNode<K , V > getMin ()
getRight()
public LLRBNode<K , V > getRight ()
getValue()
Returns
Type
Description
V
inOrderTraversal(LLRBNode.NodeVisitor<K,V> visitor)
public void inOrderTraversal ( LLRBNode . NodeVisitor<K , V > visitor )
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 >
isEmpty()
remove(K key, Comparator<K> comparator)
public LLRBNode<K , V > remove ( K key , Comparator<K> comparator )
Parameters
Name
Description
key
K
comparator
Comparator <K >
shortCircuitingInOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
public boolean shortCircuitingInOrderTraversal ( LLRBNode . ShortCircuitingNodeVisitor<K , V > visitor )
shortCircuitingReverseOrderTraversal(LLRBNode.ShortCircuitingNodeVisitor<K,V> visitor)
public boolean shortCircuitingReverseOrderTraversal ( LLRBNode . ShortCircuitingNodeVisitor<K , V > visitor )
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License , and code samples are licensed under the Apache 2.0 License . For details, see the Google Developers Site Policies . Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2025-08-02 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-08-02 UTC."],[],[]]