Package | Description |
---|---|
com.toolsverse.util.concurrentlinkedhashmap |
This package contains an implementation of a bounded
ConcurrentMap data structure. |
Modifier and Type | Field and Description |
---|---|
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.first |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeNode.left |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeNode.parent |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeNode.prev |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeNode.right |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.root |
Modifier and Type | Method and Description |
---|---|
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.balanceDeletion(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> x) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.balanceInsertion(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> x) |
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeNode.findTreeNode(int h,
Object k,
Class<?> kc)
Returns the TreeNode (or null if not found) for the given key
starting at given root.
|
(package private) ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.putTreeVal(int h,
K k,
V v)
Finds or adds a node.
|
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.rotateLeft(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> p) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.rotateRight(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> p) |
Modifier and Type | Method and Description |
---|---|
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.balanceDeletion(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> x) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.balanceDeletion(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> x) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.balanceInsertion(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> x) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.balanceInsertion(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> x) |
(package private) static <K,V> boolean |
ConcurrentHashMapV8.TreeBin.checkInvariants(ConcurrentHashMapV8.TreeNode<K,V> t)
Recursive invariant check
|
(package private) boolean |
ConcurrentHashMapV8.TreeBin.removeTreeNode(ConcurrentHashMapV8.TreeNode<K,V> p)
Removes the given node, that must be present before this
call.
|
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.rotateLeft(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> p) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.rotateLeft(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> p) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.rotateRight(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> p) |
(package private) static <K,V> ConcurrentHashMapV8.TreeNode<K,V> |
ConcurrentHashMapV8.TreeBin.rotateRight(ConcurrentHashMapV8.TreeNode<K,V> root,
ConcurrentHashMapV8.TreeNode<K,V> p) |
Constructor and Description |
---|
TreeBin(ConcurrentHashMapV8.TreeNode<K,V> b)
Creates bin with initial set of nodes headed by b.
|
TreeNode(int hash,
K key,
V val,
ConcurrentHashMapV8.Node<K,V> next,
ConcurrentHashMapV8.TreeNode<K,V> parent) |
Copyright © 2010-2020 Toolsverse. All Rights Reserved.