Class FSWMS<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.FSW<K,V>
com.github.benmanes.caffeine.cache.FSWMS<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)
- ExpireWrite (inherited)
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) int
Fields inherited from class com.github.benmanes.caffeine.cache.FSW
nextInWriteOrder, previousInWriteOrder, WRITE_TIME_OFFSET, writeTime
Fields inherited from class com.github.benmanes.caffeine.cache.FS
key, KEY_OFFSET, value, VALUE_OFFSET
Fields inherited from interface com.github.benmanes.caffeine.cache.NodeFactory
DEAD_STRONG_KEY, DEAD_WEAK_KEY, RETIRED_STRONG_KEY, RETIRED_WEAK_KEY
-
Constructor Summary
ConstructorsConstructorDescriptionFSWMS()
FSWMS
(Object keyReference, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) FSWMS
(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.int
Returns 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.void
setNextInAccessOrder
(Node<K, V> nextInAccessOrder) Sets the next element or null if there is no link.void
setPreviousInAccessOrder
(Node<K, V> previousInAccessOrder) Sets the previous element or null if there is no link.void
setQueueType
(int queueType) Set queue that the entry resides in (window, probation, or protected).Methods inherited from class com.github.benmanes.caffeine.cache.FSW
casVariableTime, getNextInVariableOrder, getNextInWriteOrder, getPreviousInVariableOrder, getPreviousInWriteOrder, getVariableTime, getWriteTime, setNextInVariableOrder, setNextInWriteOrder, setPreviousInVariableOrder, setPreviousInWriteOrder, setVariableTime, setWriteTime
Methods inherited from class com.github.benmanes.caffeine.cache.FS
containsValue, die, getKey, getKeyReference, getValue, getValueReference, isAlive, isDead, isRetired, newLookupKey, newReferenceKey, retire, setValue
Methods inherited from class com.github.benmanes.caffeine.cache.Node
casWriteTime, getAccessTime, getPolicyWeight, getWeight, inMainProbation, inMainProtected, inWindow, makeMainProbation, makeMainProtected, makeWindow, setAccessTime, setPolicyWeight, setWeight, toString
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface com.github.benmanes.caffeine.cache.NodeFactory
softValues, weakValues
-
Field Details
-
queueType
int queueType -
previousInAccessOrder
-
nextInAccessOrder
-
-
Constructor Details
-
FSWMS
FSWMS() -
FSWMS
FSWMS(K key, ReferenceQueue<K> keyReferenceQueue, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now) -
FSWMS
FSWMS(Object keyReference, V value, ReferenceQueue<V> valueReferenceQueue, int weight, long now)
-
-
Method Details
-
getQueueType
public int getQueueType()Description copied from class:Node
Returns the queue that the entry's resides in (window, probation, or protected).- Overrides:
getQueueType
in classNode<K,
V>
-
setQueueType
public void setQueueType(int queueType) Description copied from class:Node
Set queue that the entry resides in (window, probation, or protected).- Overrides:
setQueueType
in classNode<K,
V>
-
getPreviousInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrder
Retrieves the previous element or null if either the element is unlinked or the first element on the deque.- Specified by:
getPreviousInAccessOrder
in interfaceAccessOrderDeque.AccessOrder<K>
- Overrides:
getPreviousInAccessOrder
in classNode<K,
V>
-
setPreviousInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrder
Sets the previous element or null if there is no link.- Specified by:
setPreviousInAccessOrder
in interfaceAccessOrderDeque.AccessOrder<K>
- Overrides:
setPreviousInAccessOrder
in classNode<K,
V>
-
getNextInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrder
Retrieves the next element or null if either the element is unlinked or the last element on the deque.- Specified by:
getNextInAccessOrder
in interfaceAccessOrderDeque.AccessOrder<K>
- Overrides:
getNextInAccessOrder
in classNode<K,
V>
-
setNextInAccessOrder
Description copied from interface:AccessOrderDeque.AccessOrder
Sets the next element or null if there is no link.- Specified by:
setNextInAccessOrder
in interfaceAccessOrderDeque.AccessOrder<K>
- Overrides:
setNextInAccessOrder
in 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:NodeFactory
Returns 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:NodeFactory
Returns a node optimized for the specified features.
-