Class NodeFactory.SStMS<K,V>
- java.lang.Object
-
- com.github.benmanes.caffeine.cache.NodeFactory.SSt<K,V>
-
- com.github.benmanes.caffeine.cache.NodeFactory.SStMS<K,V>
-
- All Implemented Interfaces:
AccessOrderDeque.AccessOrder<Node<K,V>>
,Node<K,V>
,WriteOrderDeque.WriteOrder<Node<K,V>>
- Enclosing class:
- NodeFactory
static final class NodeFactory.SStMS<K,V> extends NodeFactory.SSt<K,V>
-
-
Field Summary
Fields Modifier and Type Field Description private Node<K,V>
nextInAccessOrder
private Node<K,V>
previousInAccessOrder
private int
queueType
-
Fields inherited from class com.github.benmanes.caffeine.cache.NodeFactory.SSt
KEY_OFFSET, VALUE_OFFSET
-
-
Constructor Summary
Constructors Constructor Description SStMS(java.lang.Object keyReference, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)
SStMS(K key, java.lang.ref.ReferenceQueue<K> keyReferenceQueue, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description Node<K,V>
getNextInAccessOrder()
Retrieves the next element or null if either the element is unlinked or the last element on the deque.Node<K,V>
getPreviousInAccessOrder()
Retrieves the previous element or null if either the element is unlinked or the first element on the deque.int
getQueueType()
Returns the queue that the entry's resides in (eden, probation, or protected).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 (eden, probation, or protected).-
Methods inherited from class com.github.benmanes.caffeine.cache.NodeFactory.SSt
containsValue, die, getKey, getKeyReference, getValue, getValueReference, isAlive, isDead, isRetired, retire, setValue, 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.Node
casWriteTime, getAccessTime, getNextInWriteOrder, getPolicyWeight, getPreviousInWriteOrder, getWeight, getWriteTime, inEden, inMainProbation, inMainProtected, makeMainProbation, makeMainProtected, setAccessTime, setNextInWriteOrder, setPolicyWeight, setPreviousInWriteOrder, setWeight, setWriteTime
-
-
-
-
Method Detail
-
getQueueType
public final int getQueueType()
Description copied from interface:Node
Returns the queue that the entry's resides in (eden, probation, or protected).
-
setQueueType
public final void setQueueType(int queueType)
Description copied from interface:Node
Set queue that the entry resides in (eden, probation, or protected).
-
getPreviousInAccessOrder
public final Node<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.
-
setPreviousInAccessOrder
public final void setPreviousInAccessOrder(Node<K,V> previousInAccessOrder)
Description copied from interface:AccessOrderDeque.AccessOrder
Sets the previous element or null if there is no link.
-
getNextInAccessOrder
public final Node<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.
-
setNextInAccessOrder
public final void setNextInAccessOrder(Node<K,V> nextInAccessOrder)
Description copied from interface:AccessOrderDeque.AccessOrder
Sets the next element or null if there is no link.
-
-