Package | Description |
---|---|
org.glassfish.jersey.internal.util.collection |
Common set of Jersey collection classes.
|
Modifier and Type | Class and Description |
---|---|
(package private) static class |
ConcurrentHashMapV8.ForwardingNode<K,V>
A node inserted at head of bins during transfer operations.
|
(package private) static class |
ConcurrentHashMapV8.ReservationNode<K,V>
A place-holder node used in computeIfAbsent and compute
|
(package private) static class |
ConcurrentHashMapV8.TreeBin<K,V>
TreeNodes used at the heads of bins.
|
(package private) static class |
ConcurrentHashMapV8.TreeNode<K,V>
Nodes for use in TreeBins
|
Modifier and Type | Field and Description |
---|---|
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.BaseIterator.lastReturned |
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.Node.next |
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.Traverser.next |
private ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.nextTable
The next table to use; non-null only while resizing.
|
(package private) ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.ForwardingNode.nextTable |
(package private) ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.Traverser.tab |
(package private) ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.table
The array of bins.
|
Modifier and Type | Method and Description |
---|---|
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.Traverser.advance()
Advances if possible, returning next valid node, or null if none.
|
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.Node.find(int h,
java.lang.Object k)
Virtualized support for map.get(); overridden in subclasses.
|
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.ForwardingNode.find(int h,
java.lang.Object k) |
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.ReservationNode.find(int h,
java.lang.Object k) |
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.TreeNode.find(int h,
java.lang.Object k) |
(package private) ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.TreeBin.find(int h,
java.lang.Object k)
Returns matching node or null if none.
|
(package private) ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.helpTransfer(ConcurrentHashMapV8.Node<K,V>[] tab,
ConcurrentHashMapV8.Node<K,V> f)
Helps transfer if a resize is in progress.
|
private ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.initTable()
Initializes table, using the size recorded in sizeCtl.
|
(package private) static <K,V> ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.tabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i) |
(package private) static <K,V> ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.untreeify(ConcurrentHashMapV8.Node<K,V> b)
Returns a list on non-TreeNodes replacing those in given list.
|
Modifier and Type | Method and Description |
---|---|
(package private) static <K,V> boolean |
ConcurrentHashMapV8.casTabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i,
ConcurrentHashMapV8.Node<K,V> c,
ConcurrentHashMapV8.Node<K,V> v) |
(package private) static <K,V> boolean |
ConcurrentHashMapV8.casTabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i,
ConcurrentHashMapV8.Node<K,V> c,
ConcurrentHashMapV8.Node<K,V> v) |
(package private) static <K,V> boolean |
ConcurrentHashMapV8.casTabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i,
ConcurrentHashMapV8.Node<K,V> c,
ConcurrentHashMapV8.Node<K,V> v) |
(package private) ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.helpTransfer(ConcurrentHashMapV8.Node<K,V>[] tab,
ConcurrentHashMapV8.Node<K,V> f)
Helps transfer if a resize is in progress.
|
(package private) ConcurrentHashMapV8.Node<K,V>[] |
ConcurrentHashMapV8.helpTransfer(ConcurrentHashMapV8.Node<K,V>[] tab,
ConcurrentHashMapV8.Node<K,V> f)
Helps transfer if a resize is in progress.
|
(package private) static <K,V> void |
ConcurrentHashMapV8.setTabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i,
ConcurrentHashMapV8.Node<K,V> v) |
(package private) static <K,V> void |
ConcurrentHashMapV8.setTabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i,
ConcurrentHashMapV8.Node<K,V> v) |
(package private) static <K,V> ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.tabAt(ConcurrentHashMapV8.Node<K,V>[] tab,
int i) |
private void |
ConcurrentHashMapV8.transfer(ConcurrentHashMapV8.Node<K,V>[] tab,
ConcurrentHashMapV8.Node<K,V>[] nextTab)
Moves and/or copies the nodes in each bin to new table.
|
private void |
ConcurrentHashMapV8.transfer(ConcurrentHashMapV8.Node<K,V>[] tab,
ConcurrentHashMapV8.Node<K,V>[] nextTab)
Moves and/or copies the nodes in each bin to new table.
|
private void |
ConcurrentHashMapV8.treeifyBin(ConcurrentHashMapV8.Node<K,V>[] tab,
int index)
Replaces all linked nodes in bin at given index unless table is
too small, in which case resizes instead.
|
(package private) static <K,V> ConcurrentHashMapV8.Node<K,V> |
ConcurrentHashMapV8.untreeify(ConcurrentHashMapV8.Node<K,V> b)
Returns a list on non-TreeNodes replacing those in given list.
|
Constructor and Description |
---|
BaseIterator(ConcurrentHashMapV8.Node<K,V>[] tab,
int size,
int index,
int limit,
ConcurrentHashMapV8<K,V> map) |
EntryIterator(ConcurrentHashMapV8.Node<K,V>[] tab,
int index,
int size,
int limit,
ConcurrentHashMapV8<K,V> map) |
ForwardingNode(ConcurrentHashMapV8.Node<K,V>[] tab) |
KeyIterator(ConcurrentHashMapV8.Node<K,V>[] tab,
int index,
int size,
int limit,
ConcurrentHashMapV8<K,V> map) |
Node(int hash,
K key,
V val,
ConcurrentHashMapV8.Node<K,V> next) |
Traverser(ConcurrentHashMapV8.Node<K,V>[] tab,
int size,
int index,
int limit) |
TreeNode(int hash,
K key,
V val,
ConcurrentHashMapV8.Node<K,V> next,
ConcurrentHashMapV8.TreeNode<K,V> parent) |
ValueIterator(ConcurrentHashMapV8.Node<K,V>[] tab,
int index,
int size,
int limit,
ConcurrentHashMapV8<K,V> map) |