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) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.ValueIterator.current |
(package private) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.EntryIterator.current |
(package private) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.Node.next |
(package private) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.AddTask.node |
(package private) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.RemovalTask.node |
(package private) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.UpdateTask.node |
(package private) ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.Node.prev |
Modifier and Type | Field and Description |
---|---|
(package private) ConcurrentMap<K,ConcurrentLinkedHashMap.Node<K,V>> |
ConcurrentLinkedHashMap.data |
(package private) LinkedDeque<ConcurrentLinkedHashMap.Node<K,V>> |
ConcurrentLinkedHashMap.evictionDeque |
(package private) Iterator<ConcurrentLinkedHashMap.Node<K,V>> |
ConcurrentLinkedHashMap.ValueIterator.iterator |
(package private) Iterator<ConcurrentLinkedHashMap.Node<K,V>> |
ConcurrentLinkedHashMap.EntryIterator.iterator |
(package private) Queue<ConcurrentLinkedHashMap.Node<K,V>> |
ConcurrentLinkedHashMap.pendingNotifications |
Modifier and Type | Method and Description |
---|---|
ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.Node.getNext() |
ConcurrentLinkedHashMap.Node<K,V> |
ConcurrentLinkedHashMap.Node.getPrevious() |
Modifier and Type | Method and Description |
---|---|
(package private) void |
ConcurrentLinkedHashMap.afterRead(ConcurrentLinkedHashMap.Node<K,V> node)
Performs the post-processing work required after a read.
|
(package private) void |
ConcurrentLinkedHashMap.applyRead(ConcurrentLinkedHashMap.Node<K,V> node)
Updates the node's location in the page replacement policy.
|
(package private) void |
ConcurrentLinkedHashMap.makeDead(ConcurrentLinkedHashMap.Node<K,V> node)
Atomically transitions the node to the dead state and decrements
the weightedSize.
|
(package private) void |
ConcurrentLinkedHashMap.makeRetired(ConcurrentLinkedHashMap.Node<K,V> node)
Atomically transitions the node from the alive state to the
retired state, if a valid transition.
|
(package private) long |
ConcurrentLinkedHashMap.recordRead(int bufferIndex,
ConcurrentLinkedHashMap.Node<K,V> node)
Records a read in the buffer and return its write count.
|
void |
ConcurrentLinkedHashMap.Node.setNext(ConcurrentLinkedHashMap.Node<K,V> next) |
void |
ConcurrentLinkedHashMap.Node.setPrevious(ConcurrentLinkedHashMap.Node<K,V> prev) |
(package private) boolean |
ConcurrentLinkedHashMap.tryToRetire(ConcurrentLinkedHashMap.Node<K,V> node,
ConcurrentLinkedHashMap.WeightedValue<V> expect)
Attempts to transition the node from the alive state to the
retired state.
|
Constructor and Description |
---|
AddTask(ConcurrentLinkedHashMap.Node<K,V> node,
int weight) |
RemovalTask(ConcurrentLinkedHashMap.Node<K,V> node) |
UpdateTask(ConcurrentLinkedHashMap.Node<K,V> node,
int weightDifference) |
WriteThroughEntry(ConcurrentLinkedHashMap.Node<K,V> node) |
Copyright © 2010-2020 Toolsverse. All Rights Reserved.