static final class ConcurrentHashMapV8.TreeNode<K,V> extends ConcurrentHashMapV8.Node<K,V>
Modifier and Type | Field and Description |
---|---|
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
left |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
parent |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
prev |
(package private) boolean |
red |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
right |
hash, key, next, val
Constructor and Description |
---|
TreeNode(int hash,
K key,
V val,
ConcurrentHashMapV8.Node<K,V> next,
ConcurrentHashMapV8.TreeNode<K,V> parent) |
Modifier and Type | Method and Description |
---|---|
(package private) ConcurrentHashMapV8.Node<K,V> |
find(int h,
java.lang.Object k)
Virtualized support for map.get(); overridden in subclasses.
|
(package private) ConcurrentHashMapV8.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.
|
equals, getKey, getValue, hashCode, setValue, toString
ConcurrentHashMapV8.TreeNode<K,V> parent
ConcurrentHashMapV8.TreeNode<K,V> left
ConcurrentHashMapV8.TreeNode<K,V> right
ConcurrentHashMapV8.TreeNode<K,V> prev
boolean red
TreeNode(int hash, K key, V val, ConcurrentHashMapV8.Node<K,V> next, ConcurrentHashMapV8.TreeNode<K,V> parent)
ConcurrentHashMapV8.Node<K,V> find(int h, java.lang.Object k)
ConcurrentHashMapV8.Node
find
in class ConcurrentHashMapV8.Node<K,V>
final ConcurrentHashMapV8.TreeNode<K,V> findTreeNode(int h, java.lang.Object k, java.lang.Class<?> kc)