static final class EquivalentConcurrentHashMapV8.TreeNode<K,V> extends EquivalentConcurrentHashMapV8.Node<K,V>
Modifier and Type | Field and Description |
---|---|
(package private) EquivalentConcurrentHashMapV8.TreeNode<K,V> |
left |
(package private) EquivalentConcurrentHashMapV8.TreeNode<K,V> |
parent |
(package private) EquivalentConcurrentHashMapV8.TreeNode<K,V> |
prev |
(package private) boolean |
red |
(package private) EquivalentConcurrentHashMapV8.TreeNode<K,V> |
right |
Constructor and Description |
---|
EquivalentConcurrentHashMapV8.TreeNode(int hash,
EquivalentConcurrentHashMapV8.NodeEquivalence<K,V> nodeEq,
K key,
V val,
EquivalentConcurrentHashMapV8.Node<K,V> next,
EquivalentConcurrentHashMapV8.TreeNode<K,V> parent) |
Modifier and Type | Method and Description |
---|---|
(package private) EquivalentConcurrentHashMapV8.Node<K,V> |
find(int h,
java.lang.Object k)
Virtualized support for map.get(); overridden in subclasses.
|
(package private) EquivalentConcurrentHashMapV8.TreeNode<K,V> |
findTreeNode(int h,
java.lang.Object k,
java.lang.Class<?> kc)
Returns the TreeNode (or null if not found) for the given key
starting at given root.
|
EquivalentConcurrentHashMapV8.TreeNode<K,V> parent
EquivalentConcurrentHashMapV8.TreeNode<K,V> left
EquivalentConcurrentHashMapV8.TreeNode<K,V> right
EquivalentConcurrentHashMapV8.TreeNode<K,V> prev
boolean red
EquivalentConcurrentHashMapV8.TreeNode(int hash, EquivalentConcurrentHashMapV8.NodeEquivalence<K,V> nodeEq, K key, V val, EquivalentConcurrentHashMapV8.Node<K,V> next, EquivalentConcurrentHashMapV8.TreeNode<K,V> parent)
EquivalentConcurrentHashMapV8.Node<K,V> find(int h, java.lang.Object k)
EquivalentConcurrentHashMapV8.Node
find
in class EquivalentConcurrentHashMapV8.Node<K,V>
final EquivalentConcurrentHashMapV8.TreeNode<K,V> findTreeNode(int h, java.lang.Object k, java.lang.Class<?> kc)