Uses of Class
tools.jackson.databind.util.internal.PrivateMaxEntriesMap.Node

Packages that use PrivateMaxEntriesMap.Node

Package	Description
tools.jackson.databind.util.internal	This package contains an implementation of a bounded ConcurrentMap data structure.

Uses of PrivateMaxEntriesMap.Node in tools.jackson.databind.util.internal

Classes in tools.jackson.databind.util.internal that implement interfaces with type arguments of type PrivateMaxEntriesMap.Node

Modifier and Type	Class	Description
(package private) static final class	PrivateMaxEntriesMap.Node<K,V>	A node contains the key, the weighted value, and the linkage pointers on the page-replacement algorithm's data structures.

Fields in tools.jackson.databind.util.internal declared as PrivateMaxEntriesMap.Node

Modifier and Type	Field	Description
(package private) PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.EntryIterator.current
(package private) PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.ValueIterator.current
(package private) PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.Node.next
(package private) final PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.AddTask.node
(package private) final PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.RemovalTask.node
(package private) final PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.UpdateTask.node
(package private) PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.Node.prev

Fields in tools.jackson.databind.util.internal with type parameters of type PrivateMaxEntriesMap.Node

Modifier and Type	Field	Description
(package private) final ConcurrentMap<K, PrivateMaxEntriesMap.Node<K,V>>	PrivateMaxEntriesMap.data
(package private) final LinkedDeque<PrivateMaxEntriesMap.Node<K,V>>	PrivateMaxEntriesMap.evictionDeque
(package private) final Iterator<PrivateMaxEntriesMap.Node<K,V>>	PrivateMaxEntriesMap.EntryIterator.iterator
(package private) final Iterator<PrivateMaxEntriesMap.Node<K,V>>	PrivateMaxEntriesMap.ValueIterator.iterator
(package private) final AtomicReferenceArray<PrivateMaxEntriesMap.Node<K,V>>	PrivateMaxEntriesMap.readBuffers

Methods in tools.jackson.databind.util.internal that return PrivateMaxEntriesMap.Node

Modifier and Type	Method	Description
PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.Node.getNext()
PrivateMaxEntriesMap.Node<K,V>	PrivateMaxEntriesMap.Node.getPrevious()

Methods in tools.jackson.databind.util.internal with parameters of type PrivateMaxEntriesMap.Node

Modifier and Type	Method	Description
(package private) void	PrivateMaxEntriesMap.afterRead(PrivateMaxEntriesMap.Node<K,V> node)	Performs the post-processing work required after a read.
(package private) void	PrivateMaxEntriesMap.applyRead(PrivateMaxEntriesMap.Node<K,V> node)	Updates the node's location in the page replacement policy.
(package private) void	PrivateMaxEntriesMap.makeDead(PrivateMaxEntriesMap.Node<K,V> node)	Atomically transitions the node to the dead state and decrements the weightedSize.
(package private) void	PrivateMaxEntriesMap.makeRetired(PrivateMaxEntriesMap.Node<K,V> node)	Atomically transitions the node from the alive state to the retired state, if a valid transition.
(package private) long	PrivateMaxEntriesMap.recordRead(int bufferIndex, PrivateMaxEntriesMap.Node<K,V> node)	Records a read in the buffer and return its write count.
void	PrivateMaxEntriesMap.Node.setNext(PrivateMaxEntriesMap.Node<K,V> next)
void	PrivateMaxEntriesMap.Node.setPrevious(PrivateMaxEntriesMap.Node<K,V> prev)
(package private) boolean	PrivateMaxEntriesMap.tryToRetire(PrivateMaxEntriesMap.Node<K,V> node, PrivateMaxEntriesMap.WeightedValue<V> expect)	Attempts to transition the node from the alive state to the retired state.

Constructors in tools.jackson.databind.util.internal with parameters of type PrivateMaxEntriesMap.Node

Modifier	Constructor	Description
(package private)	AddTask(PrivateMaxEntriesMap.Node<K,V> node, int weight)
(package private)	RemovalTask(PrivateMaxEntriesMap.Node<K,V> node)
(package private)	UpdateTask(PrivateMaxEntriesMap.Node<K,V> node, int weightDifference)
(package private)	WriteThroughEntry(PrivateMaxEntriesMap.Node<K,V> node)