Uses of Class
gw.util.concurrent.Cache.ConcurrentLinkedHashMap.Node

Packages that use Cache.ConcurrentLinkedHashMap.Node

Package	Description
gw.util.concurrent

Uses of Cache.ConcurrentLinkedHashMap.Node in gw.util.concurrent

Fields in gw.util.concurrent declared as Cache.ConcurrentLinkedHashMap.Node

Modifier and Type	Field	Description
(package private) final Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.head
private Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.Node.next
private Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.Node.prev
(package private) final Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.tail

Fields in gw.util.concurrent with type parameters of type Cache.ConcurrentLinkedHashMap.Node

Modifier and Type	Field	Description
private Map.Entry<K,Cache.ConcurrentLinkedHashMap.Node<K,V>>	Cache.ConcurrentLinkedHashMap.EntryIteratorAdapter.current
(package private) final ConcurrentMap<K,Cache.ConcurrentLinkedHashMap.Node<K,V>>	Cache.ConcurrentLinkedHashMap.data
private final Iterator<Map.Entry<K,Cache.ConcurrentLinkedHashMap.Node<K,V>>>	Cache.ConcurrentLinkedHashMap.EntryIteratorAdapter.iterator
private static final AtomicReferenceFieldUpdater<Cache.ConcurrentLinkedHashMap.Node,Cache.ConcurrentLinkedHashMap.Node>	Cache.ConcurrentLinkedHashMap.Node.nextUpdater
private static final AtomicReferenceFieldUpdater<Cache.ConcurrentLinkedHashMap.Node,Cache.ConcurrentLinkedHashMap.Node>	Cache.ConcurrentLinkedHashMap.Node.nextUpdater
private static final AtomicReferenceFieldUpdater<Cache.ConcurrentLinkedHashMap.Node,Cache.ConcurrentLinkedHashMap.Node>	Cache.ConcurrentLinkedHashMap.Node.prevUpdater
private static final AtomicReferenceFieldUpdater<Cache.ConcurrentLinkedHashMap.Node,Cache.ConcurrentLinkedHashMap.Node>	Cache.ConcurrentLinkedHashMap.Node.prevUpdater
private static final AtomicReferenceFieldUpdater<Cache.ConcurrentLinkedHashMap.Node,Cache.ConcurrentLinkedHashMap.Node.State>	Cache.ConcurrentLinkedHashMap.Node.stateUpdater
private static final AtomicReferenceFieldUpdater<Cache.ConcurrentLinkedHashMap.Node,Object>	Cache.ConcurrentLinkedHashMap.Node.valueUpdater

Methods in gw.util.concurrent that return Cache.ConcurrentLinkedHashMap.Node

Modifier and Type	Method	Description
Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.Node.getNext()
Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.Node.getPrev()
private Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.poll()	Retrieves and removes the first node on the list or null if empty.
private Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.putIfAbsent(Cache.ConcurrentLinkedHashMap.Node<K,V> node)	Adds a node to the list and data store if it does not already exist.

Methods in gw.util.concurrent with parameters of type Cache.ConcurrentLinkedHashMap.Node

Modifier and Type	Method	Description
boolean	Cache.ConcurrentLinkedHashMap.Node.casNext(Cache.ConcurrentLinkedHashMap.Node<K,V> expect, Cache.ConcurrentLinkedHashMap.Node<K,V> update)
boolean	Cache.ConcurrentLinkedHashMap.Node.casPrev(Cache.ConcurrentLinkedHashMap.Node<K,V> expect, Cache.ConcurrentLinkedHashMap.Node<K,V> update)
private void	Cache.ConcurrentLinkedHashMap.offer(Cache.ConcurrentLinkedHashMap.Node<K,V> node)	Inserts the specified node on to the tail of the list.
(package private) abstract <K, V> boolean	Cache.ConcurrentLinkedHashMap.EvictionPolicy.onEvict(Cache.ConcurrentLinkedHashMap<K,V> map, Cache.ConcurrentLinkedHashMap.Node<K,V> node)	Determines whether to evict the node at the head of the list.
(package private) abstract <K, V> void	Cache.ConcurrentLinkedHashMap.EvictionPolicy.onGet(Cache.ConcurrentLinkedHashMap<K,V> map, Cache.ConcurrentLinkedHashMap.Node<K,V> node)	Performs any operations required by the policy after a node was successfully retrieved.
(package private) <K, V> void	Cache.ConcurrentLinkedHashMap.EvictionPolicy.onRemove(Cache.ConcurrentLinkedHashMap<K,V> map, Cache.ConcurrentLinkedHashMap.Node<K,V> node)	Expires a node so that, for all intents and purposes, it is a dead on the list.
private Cache.ConcurrentLinkedHashMap.Node<K,V>	Cache.ConcurrentLinkedHashMap.putIfAbsent(Cache.ConcurrentLinkedHashMap.Node<K,V> node)	Adds a node to the list and data store if it does not already exist.
void	Cache.ConcurrentLinkedHashMap.Node.setNext(Cache.ConcurrentLinkedHashMap.Node<K,V> node)
void	Cache.ConcurrentLinkedHashMap.Node.setPrev(Cache.ConcurrentLinkedHashMap.Node<K,V> node)

Constructor parameters in gw.util.concurrent with type arguments of type Cache.ConcurrentLinkedHashMap.Node

Modifier	Constructor	Description
	EntryIteratorAdapter(Iterator<Map.Entry<K,Cache.ConcurrentLinkedHashMap.Node<K,V>>> iterator)