Class PDA<K,V>
- java.lang.Object
-
- com.github.benmanes.caffeine.cache.Node<K,V>
-
- com.github.benmanes.caffeine.cache.PD<K,V>
-
- com.github.benmanes.caffeine.cache.PDA<K,V>
-
- All Implemented Interfaces:
AccessOrderDeque.AccessOrder<Node<K,V>>,NodeFactory<K,V>,WriteOrderDeque.WriteOrder<Node<K,V>>
class PDA<K,V> extends PD<K,V>
WARNING: GENERATED CODE A cache entry that provides the following features:- ExpireAccess
- StrongKeys (inherited)
- SoftValues (inherited)
-
-
Field Summary
Fields Modifier and Type Field Description protected static longACCESS_TIME_OFFSET(package private) longaccessTime(package private) Node<K,V>nextInAccessOrder(package private) Node<K,V>previousInAccessOrder-
Fields inherited from class com.github.benmanes.caffeine.cache.PD
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
Constructors Constructor Description PDA()PDA(java.lang.Object keyReference, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)PDA(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 booleancasVariableTime(long expect, long update)Atomically sets the variable time to the given updated value if the current value equals the expected value and returns if the update was successful.longgetAccessTime()Returns the time that this entry was last accessed, in ns.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>getNextInVariableOrder()Node<K,V>getPreviousInAccessOrder()Retrieves the previous element or null if either the element is unlinked or the first element on the deque.Node<K,V>getPreviousInVariableOrder()longgetVariableTime()Returns the variable expiration time, in nanoseconds.Node<K,V>newNode(java.lang.Object keyReference, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)Returns a node optimized for the specified features.Node<K,V>newNode(K key, java.lang.ref.ReferenceQueue<K> keyReferenceQueue, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)Returns a node optimized for the specified features.voidsetAccessTime(long accessTime)Sets the access time in nanoseconds.voidsetNextInAccessOrder(Node<K,V> nextInAccessOrder)Sets the next element or null if there is no link.voidsetNextInVariableOrder(Node<K,V> nextInAccessOrder)voidsetPreviousInAccessOrder(Node<K,V> previousInAccessOrder)Sets the previous element or null if there is no link.voidsetPreviousInVariableOrder(Node<K,V> previousInAccessOrder)voidsetVariableTime(long accessTime)Sets the variable expiration time in nanoseconds.-
Methods inherited from class com.github.benmanes.caffeine.cache.PD
containsValue, die, getKey, getKeyReference, getValue, getValueReference, isAlive, isDead, isRetired, retire, setValue, softValues
-
Methods inherited from class com.github.benmanes.caffeine.cache.Node
casWriteTime, getNextInWriteOrder, getPolicyWeight, getPreviousInWriteOrder, getQueueType, getWeight, getWriteTime, inMainProbation, inMainProtected, inWindow, makeMainProbation, makeMainProtected, makeWindow, setNextInWriteOrder, setPolicyWeight, setPreviousInWriteOrder, setQueueType, setWeight, setWriteTime, 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
newLookupKey, newReferenceKey, weakValues
-
-
-
-
Method Detail
-
getPreviousInVariableOrder
public Node<K,V> getPreviousInVariableOrder()
- Overrides:
getPreviousInVariableOrderin classNode<K,V>
-
setPreviousInVariableOrder
public void setPreviousInVariableOrder(Node<K,V> previousInAccessOrder)
- Overrides:
setPreviousInVariableOrderin classNode<K,V>
-
getNextInVariableOrder
public Node<K,V> getNextInVariableOrder()
- Overrides:
getNextInVariableOrderin classNode<K,V>
-
setNextInVariableOrder
public void setNextInVariableOrder(Node<K,V> nextInAccessOrder)
- Overrides:
setNextInVariableOrderin classNode<K,V>
-
getVariableTime
public long getVariableTime()
Description copied from class:NodeReturns the variable expiration time, in nanoseconds.- Overrides:
getVariableTimein classNode<K,V>
-
setVariableTime
public void setVariableTime(long accessTime)
Description copied from class:NodeSets the variable expiration time in nanoseconds. This update may be set lazily and rely on the memory fence when the lock is released.- Overrides:
setVariableTimein classNode<K,V>
-
casVariableTime
public boolean casVariableTime(long expect, long update)Description copied from class:NodeAtomically sets the variable time to the given updated value if the current value equals the expected value and returns if the update was successful.- Overrides:
casVariableTimein classNode<K,V>
-
getAccessTime
public final long getAccessTime()
Description copied from class:NodeReturns the time that this entry was last accessed, in ns.- Overrides:
getAccessTimein classNode<K,V>
-
setAccessTime
public final void setAccessTime(long accessTime)
Description copied from class:NodeSets the access time in nanoseconds. This update may be set lazily and rely on the memory fence when the lock is released.- Overrides:
setAccessTimein classNode<K,V>
-
getPreviousInAccessOrder
public final Node<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
public final void setPreviousInAccessOrder(Node<K,V> previousInAccessOrder)
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
public final Node<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
public final void setNextInAccessOrder(Node<K,V> nextInAccessOrder)
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, java.lang.ref.ReferenceQueue<K> keyReferenceQueue, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)
Description copied from interface:NodeFactoryReturns a node optimized for the specified features.
-
-