com.toolsverse.util.concurrentlinkedhashmap

Class ConcurrentLinkedHashMap.Node<K,V>

Object

AtomicReference<ConcurrentLinkedHashMap.WeightedValue<V>>

com.toolsverse.util.concurrentlinkedhashmap.ConcurrentLinkedHashMap.Node<K,V>

All Implemented Interfaces:

Linked<ConcurrentLinkedHashMap.Node<K,V>>, Serializable

Enclosing class:

ConcurrentLinkedHashMap<K,V>

static final class ConcurrentLinkedHashMap.Node<K,V>
extends AtomicReference<ConcurrentLinkedHashMap.WeightedValue<V>>
implements Linked<ConcurrentLinkedHashMap.Node<K,V>>

A node contains the key, the weighted value, and the linkage pointers on the page-replacement algorithm's data structures.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) K	key
(package private) ConcurrentLinkedHashMap.Node<K,V>	next
(package private) ConcurrentLinkedHashMap.Node<K,V>	prev

Constructor Summary

Constructors

Constructor and Description
Node(K key, ConcurrentLinkedHashMap.WeightedValue<V> weightedValue) Creates a new, unlinked node.

Method Summary

Modifier and Type	Method and Description
ConcurrentLinkedHashMap.Node<K,V>	getNext() Retrieves the next element or null if either the element is unlinked or the last element on the deque.
ConcurrentLinkedHashMap.Node<K,V>	getPrevious() Retrieves the previous element or null if either the element is unlinked or the first element on the deque.
(package private) V	getValue() Retrieves the value held by the current WeightedValue.
void	setNext(ConcurrentLinkedHashMap.Node<K,V> next) Sets the next element or null if there is no link.
void	setPrevious(ConcurrentLinkedHashMap.Node<K,V> prev) Sets the previous element or null if there is no link.

Methods inherited from class AtomicReference

accumulateAndGet, compareAndSet, get, getAndAccumulate, getAndSet, getAndUpdate, lazySet, set, toString, updateAndGet, weakCompareAndSet

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

key

final K key

prev

ConcurrentLinkedHashMap.Node<K,V> prev

next

ConcurrentLinkedHashMap.Node<K,V> next

Constructor Detail

Node

Node(K key,
     ConcurrentLinkedHashMap.WeightedValue<V> weightedValue)

Creates a new, unlinked node.

Method Detail

getPrevious

public ConcurrentLinkedHashMap.Node<K,V> getPrevious()

Description copied from interface: Linked

Retrieves the previous element or null if either the element is unlinked or the first element on the deque.

Specified by:

getPrevious in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>

setPrevious

public void setPrevious(ConcurrentLinkedHashMap.Node<K,V> prev)

Description copied from interface: Linked

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

Specified by:

setPrevious in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>

getNext

public ConcurrentLinkedHashMap.Node<K,V> getNext()

Description copied from interface: Linked

Retrieves the next element or null if either the element is unlinked or the last element on the deque.

Specified by:

getNext in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>

setNext

public void setNext(ConcurrentLinkedHashMap.Node<K,V> next)

Description copied from interface: Linked

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

Specified by:

setNext in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>

getValue

V getValue()

Retrieves the value held by the current WeightedValue.