Uses of Class
tools.jackson.databind.util.internal.PrivateMaxEntriesMap.Node
Packages that use PrivateMaxEntriesMap.Node
Package
Description
This package contains an implementation of a bounded
ConcurrentMap data structure.-
Uses of PrivateMaxEntriesMap.Node in tools.jackson.databind.util.internal
Fields in tools.jackson.databind.util.internal declared as PrivateMaxEntriesMap.NodeModifier and TypeFieldDescription(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.prevFields in tools.jackson.databind.util.internal with type parameters of type PrivateMaxEntriesMap.NodeModifier and TypeFieldDescription(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.readBuffersMethods in tools.jackson.databind.util.internal that return PrivateMaxEntriesMap.NodeModifier and TypeMethodDescriptionPrivateMaxEntriesMap.Node.getNext()PrivateMaxEntriesMap.Node.getPrevious()Methods in tools.jackson.databind.util.internal with parameters of type PrivateMaxEntriesMap.NodeModifier and TypeMethodDescription(package private) voidPrivateMaxEntriesMap.afterRead(PrivateMaxEntriesMap.Node<K, V> node) Performs the post-processing work required after a read.(package private) voidPrivateMaxEntriesMap.applyRead(PrivateMaxEntriesMap.Node<K, V> node) Updates the node's location in the page replacement policy.(package private) voidPrivateMaxEntriesMap.makeDead(PrivateMaxEntriesMap.Node<K, V> node) Atomically transitions the node to thedeadstate and decrements theweightedSize.(package private) voidPrivateMaxEntriesMap.makeRetired(PrivateMaxEntriesMap.Node<K, V> node) Atomically transitions the node from thealivestate to theretiredstate, if a valid transition.(package private) longPrivateMaxEntriesMap.recordRead(int bufferIndex, PrivateMaxEntriesMap.Node<K, V> node) Records a read in the buffer and return its write count.voidPrivateMaxEntriesMap.Node.setNext(PrivateMaxEntriesMap.Node<K, V> next) voidPrivateMaxEntriesMap.Node.setPrevious(PrivateMaxEntriesMap.Node<K, V> prev) (package private) booleanPrivateMaxEntriesMap.tryToRetire(PrivateMaxEntriesMap.Node<K, V> node, PrivateMaxEntriesMap.WeightedValue<V> expect) Attempts to transition the node from thealivestate to theretiredstate.Constructors in tools.jackson.databind.util.internal with parameters of type PrivateMaxEntriesMap.NodeModifierConstructorDescription(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)