Class ConcurrentHashMapV8.TreeNode<K,V>
java.lang.Object
org.glassfish.jersey.internal.util.collection.ConcurrentHashMapV8.Node<K,V>
org.glassfish.jersey.internal.util.collection.ConcurrentHashMapV8.TreeNode<K,V>
- All Implemented Interfaces:
Map.Entry<K,
V>
- Enclosing class:
ConcurrentHashMapV8<K,
V>
Nodes for use in TreeBins
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) ConcurrentHashMapV8.TreeNode
<K, V> (package private) ConcurrentHashMapV8.TreeNode
<K, V> (package private) ConcurrentHashMapV8.TreeNode
<K, V> (package private) boolean
(package private) ConcurrentHashMapV8.TreeNode
<K, V> Fields inherited from class org.glassfish.jersey.internal.util.collection.ConcurrentHashMapV8.Node
hash, key, next, val
-
Constructor Summary
ConstructorsConstructorDescriptionTreeNode
(int hash, K key, V val, ConcurrentHashMapV8.Node<K, V> next, ConcurrentHashMapV8.TreeNode<K, V> parent) -
Method Summary
Modifier and TypeMethodDescription(package private) ConcurrentHashMapV8.Node
<K, V> Virtualized support for map.get(); overridden in subclasses.(package private) final ConcurrentHashMapV8.TreeNode
<K, V> findTreeNode
(int h, Object k, Class<?> kc) Returns the TreeNode (or null if not found) for the given key starting at given root.
-
Field Details
-
parent
ConcurrentHashMapV8.TreeNode<K,V> parent -
left
ConcurrentHashMapV8.TreeNode<K,V> left -
right
ConcurrentHashMapV8.TreeNode<K,V> right -
prev
ConcurrentHashMapV8.TreeNode<K,V> prev -
red
boolean red
-
-
Constructor Details
-
TreeNode
TreeNode(int hash, K key, V val, ConcurrentHashMapV8.Node<K, V> next, ConcurrentHashMapV8.TreeNode<K, V> parent)
-
-
Method Details
-
find
Description copied from class:ConcurrentHashMapV8.Node
Virtualized support for map.get(); overridden in subclasses.- Overrides:
find
in classConcurrentHashMapV8.Node<K,
V>
-
findTreeNode
Returns the TreeNode (or null if not found) for the given key starting at given root.
-