Package com.github.benmanes.caffeine.cache

Class PDMW<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.PDMW<K,V>

All Implemented Interfaces:

AccessOrderDeque.AccessOrder<Node<K,V>>, NodeFactory<K,V>, WriteOrderDeque.WriteOrder<Node<K,V>>

final class PDMW<K,V>
extends PD<K,V>

WARNING: GENERATED CODE A cache entry that provides the following features:

• MaximumWeight
• StrongKeys (inherited)
• SoftValues (inherited)

Field Summary

Fields

Modifier and Type	Field	Description
(package private) Node<K,V>	nextInAccessOrder
(package private) int	policyWeight
(package private) Node<K,V>	previousInAccessOrder
(package private) int	queueType
(package private) int	weight

Fields inherited from class com.github.benmanes.caffeine.cache.PD

value, VALUE_OFFSET

Fields inherited from class com.github.benmanes.caffeine.cache.Node

PROBATION, PROTECTED, WINDOW

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
PDMW()
PDMW(java.lang.Object keyReference, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)
PDMW(K key, java.lang.ref.ReferenceQueue<K> keyReferenceQueue, V value, java.lang.ref.ReferenceQueue<V> valueReferenceQueue, int weight, long now)

Method Summary

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.
int	getPolicyWeight()	Returns the weight of this entry from the policy's perspective.
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 (window, probation, or protected).
int	getWeight()	Returns the weight of this entry from the entry's perspective.
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.
void	setNextInAccessOrder(Node<K,V> nextInAccessOrder)	Sets the next element or null if there is no link.
void	setPolicyWeight(int policyWeight)	Sets the weight from the policy's perspective.
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).
void	setWeight(int weight)	Sets the weight from the entry's perspective.

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

casVariableTime, casWriteTime, getAccessTime, getNextInVariableOrder, getNextInWriteOrder, getPreviousInVariableOrder, getPreviousInWriteOrder, getVariableTime, getWriteTime, inMainProbation, inMainProtected, inWindow, makeMainProbation, makeMainProtected, makeWindow, setAccessTime, setNextInVariableOrder, setNextInWriteOrder, setPreviousInVariableOrder, setPreviousInWriteOrder, setVariableTime, 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

Field Detail

queueType

int queueType

weight

int weight

policyWeight

int policyWeight

previousInAccessOrder

Node<K,V> previousInAccessOrder

nextInAccessOrder

Node<K,V> nextInAccessOrder

Constructor Detail

PDMW

PDMW()

PDMW

PDMW(K key,
     java.lang.ref.ReferenceQueue<K> keyReferenceQueue,
     V value,
     java.lang.ref.ReferenceQueue<V> valueReferenceQueue,
     int weight,
     long now)

PDMW

PDMW(java.lang.Object keyReference,
     V value,
     java.lang.ref.ReferenceQueue<V> valueReferenceQueue,
     int weight,
     long now)

Method Detail

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 class Node<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 class Node<K,V>

getWeight

public int getWeight()

Description copied from class: Node

Returns the weight of this entry from the entry's perspective.

Overrides:

getWeight in class Node<K,V>

setWeight

public void setWeight(int weight)

Description copied from class: Node

Sets the weight from the entry's perspective.

Overrides:

setWeight in class Node<K,V>

getPolicyWeight

public int getPolicyWeight()

Description copied from class: Node

Returns the weight of this entry from the policy's perspective.

Overrides:

getPolicyWeight in class Node<K,V>

setPolicyWeight

public void setPolicyWeight(int policyWeight)

Description copied from class: Node

Sets the weight from the policy's perspective.

Overrides:

setPolicyWeight in class Node<K,V>

getPreviousInAccessOrder

public 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.

Specified by:

getPreviousInAccessOrder in interface AccessOrderDeque.AccessOrder<K>

Overrides:

getPreviousInAccessOrder in class Node<K,V>

setPreviousInAccessOrder

public void setPreviousInAccessOrder(Node<K,V> previousInAccessOrder)

Description copied from interface: AccessOrderDeque.AccessOrder

Sets the previous element or null if there is no link.

Specified by:

setPreviousInAccessOrder in interface AccessOrderDeque.AccessOrder<K>

Overrides:

setPreviousInAccessOrder in class Node<K,V>

getNextInAccessOrder

public 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.

Specified by:

getNextInAccessOrder in interface AccessOrderDeque.AccessOrder<K>

Overrides:

getNextInAccessOrder in class Node<K,V>

setNextInAccessOrder

public void setNextInAccessOrder(Node<K,V> nextInAccessOrder)

Description copied from interface: AccessOrderDeque.AccessOrder

Sets the next element or null if there is no link.

Specified by:

setNextInAccessOrder in interface AccessOrderDeque.AccessOrder<K>

Overrides:

setNextInAccessOrder in class Node<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: NodeFactory

Returns a node optimized for the specified features.

Specified by:

newNode in interface NodeFactory<K,V>

Overrides:

newNode in class PD<K,V>

newNode

public Node<K,V> newNode(java.lang.Object keyReference,
                               V value,
                               java.lang.ref.ReferenceQueue<V> valueReferenceQueue,
                               int weight,
                               long now)

Description copied from interface: NodeFactory

Returns a node optimized for the specified features.

Specified by:

newNode in interface NodeFactory<K,V>

Overrides:

newNode in class PD<K,V>