static final class ConcurrentLinkedHashMap.Node<K,V> extends AtomicReference<ConcurrentLinkedHashMap.WeightedValue<V>> implements Linked<ConcurrentLinkedHashMap.Node<K,V>>
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 and Description |
---|
Node(K key,
ConcurrentLinkedHashMap.WeightedValue<V> weightedValue)
Creates a new, unlinked node.
|
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.
|
final K key
ConcurrentLinkedHashMap.Node<K,V> prev
ConcurrentLinkedHashMap.Node<K,V> next
Node(K key, ConcurrentLinkedHashMap.WeightedValue<V> weightedValue)
public ConcurrentLinkedHashMap.Node<K,V> getPrevious()
Linked
getPrevious
in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>
public void setPrevious(ConcurrentLinkedHashMap.Node<K,V> prev)
Linked
setPrevious
in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>
public ConcurrentLinkedHashMap.Node<K,V> getNext()
Linked
getNext
in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>
public void setNext(ConcurrentLinkedHashMap.Node<K,V> next)
Linked
setNext
in interface Linked<ConcurrentLinkedHashMap.Node<K,V>>
V getValue()
Copyright © 2010-2020 Toolsverse. All Rights Reserved.