Class FSMS<K,V>
java.lang.Object
com.github.benmanes.caffeine.cache.Node<K,V>
com.github.benmanes.caffeine.cache.FS<K,V>
com.github.benmanes.caffeine.cache.FSMS<K,V>
- All Implemented Interfaces:
AccessOrderDeque.AccessOrder<Node<K,V>>, NodeFactory<K, V>, WriteOrderDeque.WriteOrder<Node<K, V>>
WARNING: GENERATED CODE
A cache entry that provides the following features:
- MaximumSize
- WeakKeys (inherited)
- StrongValues (inherited)
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) intFields inherited from class FS
key, KEY_OFFSET, value, VALUE_OFFSETFields inherited from interface NodeFactory
DEAD_STRONG_KEY, DEAD_WEAK_KEY, RETIRED_STRONG_KEY, RETIRED_WEAK_KEY -
Constructor Summary
ConstructorsConstructorDescriptionFSMS()FSMS(Object keyReference, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) FSMS(K key, ReferenceQueue<K> keyReferenceQueue, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) -
Method Summary
Modifier and TypeMethodDescriptionRetrieves the next element or null if either the element is unlinked or the last element on the deque.Retrieves the previous element or null if either the element is unlinked or the first element on the deque.intReturns the queue that the entry's resides in (window, probation, or protected).newNode(Object keyReference, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) Returns a node optimized for the specified features.newNode(K key, ReferenceQueue<K> keyReferenceQueue, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) Returns a node optimized for the specified features.voidsetNextInAccessOrder(Node<K, V> nextInAccessOrder) Sets the next element or null if there is no link.voidsetPreviousInAccessOrder(Node<K, V> previousInAccessOrder) Sets the previous element or null if there is no link.voidsetQueueType(int queueType) Set queue that the entry resides in (window, probation, or protected).Methods inherited from class FS
containsValue, die, getKey, getKeyReference, getValue, getValueReference, isAlive, isDead, isRetired, newLookupKey, newReferenceKey, retire, setValueMethods inherited from class Node
casVariableTime, casWriteTime, getAccessTime, getNextInVariableOrder, getNextInWriteOrder, getPolicyWeight, getPreviousInVariableOrder, getPreviousInWriteOrder, getVariableTime, getWeight, getWriteTime, inMainProbation, inMainProtected, inWindow, makeMainProbation, makeMainProtected, makeWindow, setAccessTime, setNextInVariableOrder, setNextInWriteOrder, setPolicyWeight, setPreviousInVariableOrder, setPreviousInWriteOrder, setVariableTime, setWeight, setWriteTime, toStringMethods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface NodeFactory
softValues, weakValues
-
Field Details
-
queueType
int queueType -
previousInAccessOrder
-
nextInAccessOrder
-
-
Constructor Details
-
FSMS
FSMS() -
FSMS
FSMS(K key, ReferenceQueue<K> keyReferenceQueue, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) -
FSMS
FSMS(Object keyReference, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now)
-
-
Method Details
-
getQueueType
public int getQueueType()Description copied from class:NodeReturns the queue that the entry's resides in (window, probation, or protected).- Overrides:
getQueueTypein classNode<K,V>
-
setQueueType
public void setQueueType(int queueType) Description copied from class:NodeSet queue that the entry resides in (window, probation, or protected).- Overrides:
setQueueTypein classNode<K,V>
-
getPreviousInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrderRetrieves the previous element or null if either the element is unlinked or the first element on the deque.- Specified by:
getPreviousInAccessOrderin interfaceAccessOrderDeque.AccessOrder<K>- Overrides:
getPreviousInAccessOrderin classNode<K,V>
-
setPreviousInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrderSets the previous element or null if there is no link.- Specified by:
setPreviousInAccessOrderin interfaceAccessOrderDeque.AccessOrder<K>- Overrides:
setPreviousInAccessOrderin classNode<K,V>
-
getNextInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrderRetrieves the next element or null if either the element is unlinked or the last element on the deque.- Specified by:
getNextInAccessOrderin interfaceAccessOrderDeque.AccessOrder<K>- Overrides:
getNextInAccessOrderin classNode<K,V>
-
setNextInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrderSets the next element or null if there is no link.- Specified by:
setNextInAccessOrderin interfaceAccessOrderDeque.AccessOrder<K>- Overrides:
setNextInAccessOrderin classNode<K,V>
-
newNode
public Node<K,V> newNode(K key, ReferenceQueue<K> keyReferenceQueue, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) Description copied from interface:NodeFactoryReturns a node optimized for the specified features. -
newNode
public Node<K,V> newNode(Object keyReference, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) Description copied from interface:NodeFactoryReturns a node optimized for the specified features.
-