Class PrivateMaxEntriesMap.Node<K,V>
- java.lang.Object
-
- java.util.concurrent.atomic.AtomicReference<PrivateMaxEntriesMap.WeightedValue<V>>
-
- com.fasterxml.jackson.databind.util.internal.PrivateMaxEntriesMap.Node<K,V>
-
- All Implemented Interfaces:
Linked<PrivateMaxEntriesMap.Node<K,V>>,java.io.Serializable
- Enclosing class:
- PrivateMaxEntriesMap<K,V>
static final class PrivateMaxEntriesMap.Node<K,V> extends java.util.concurrent.atomic.AtomicReference<PrivateMaxEntriesMap.WeightedValue<V>> implements Linked<PrivateMaxEntriesMap.Node<K,V>>
A node contains the key, the weighted value, and the linkage pointers on the page-replacement algorithm's data structures.
-
-
Field Summary
Fields Modifier and Type Field Description (package private) Kkey(package private) PrivateMaxEntriesMap.Node<K,V>next(package private) PrivateMaxEntriesMap.Node<K,V>prev
-
Constructor Summary
Constructors Constructor Description Node(K key, PrivateMaxEntriesMap.WeightedValue<V> weightedValue)Creates a new, unlinked node.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description PrivateMaxEntriesMap.Node<K,V>getNext()Retrieves the next element or null if either the element is unlinked or the last element on the deque.PrivateMaxEntriesMap.Node<K,V>getPrevious()Retrieves the previous element or null if either the element is unlinked or the first element on the deque.(package private) VgetValue()Retrieves the value held by the currentWeightedValue.voidsetNext(PrivateMaxEntriesMap.Node<K,V> next)Sets the next element or null if there is no link.voidsetPrevious(PrivateMaxEntriesMap.Node<K,V> prev)Sets the previous element or null if there is no link.-
Methods inherited from class java.util.concurrent.atomic.AtomicReference
accumulateAndGet, compareAndExchange, compareAndExchangeAcquire, compareAndExchangeRelease, compareAndSet, get, getAcquire, getAndAccumulate, getAndSet, getAndUpdate, getOpaque, getPlain, lazySet, set, setOpaque, setPlain, setRelease, toString, updateAndGet, weakCompareAndSet, weakCompareAndSetAcquire, weakCompareAndSetPlain, weakCompareAndSetRelease, weakCompareAndSetVolatile
-
-
-
-
Field Detail
-
key
final K key
-
prev
PrivateMaxEntriesMap.Node<K,V> prev
-
next
PrivateMaxEntriesMap.Node<K,V> next
-
-
Constructor Detail
-
Node
Node(K key, PrivateMaxEntriesMap.WeightedValue<V> weightedValue)
Creates a new, unlinked node.
-
-
Method Detail
-
getPrevious
public PrivateMaxEntriesMap.Node<K,V> getPrevious()
Description copied from interface:LinkedRetrieves the previous element or null if either the element is unlinked or the first element on the deque.- Specified by:
getPreviousin interfaceLinked<K>
-
setPrevious
public void setPrevious(PrivateMaxEntriesMap.Node<K,V> prev)
Description copied from interface:LinkedSets the previous element or null if there is no link.- Specified by:
setPreviousin interfaceLinked<K>
-
getNext
public PrivateMaxEntriesMap.Node<K,V> getNext()
Description copied from interface:LinkedRetrieves the next element or null if either the element is unlinked or the last element on the deque.
-
setNext
public void setNext(PrivateMaxEntriesMap.Node<K,V> next)
Description copied from interface:LinkedSets the next element or null if there is no link.
-
getValue
V getValue()
Retrieves the value held by the currentWeightedValue.
-
-