Uses of Class
net.sf.beanlib.util.concurrent.ConcurrentSkipListMap.Node

Packages that use ConcurrentSkipListMap.Node

net.sf.beanlib.util.concurrent

Mirror package of java.util.concurrent of Java 6 beta 2.

Uses of ConcurrentSkipListMap.Node in net.sf.beanlib.util.concurrent

Fields in net.sf.beanlib.util.concurrent declared as ConcurrentSkipListMap.Node

(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.Iter.lastReturned the last node returned by next()
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.SubMap.SubMapIter.lastReturned the last node returned by next()
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.Node.next
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.Iter.next the next node to return from next();
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.SubMap.SubMapIter.next the next node to return from next();
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.Index.node

Fields in net.sf.beanlib.util.concurrent with type parameters of type ConcurrentSkipListMap.Node

(package private) static AtomicReferenceFieldUpdater<ConcurrentSkipListMap.Node,ConcurrentSkipListMap.Node>	ConcurrentSkipListMap.Node.nextUpdater Updater for casNext
(package private) static AtomicReferenceFieldUpdater<ConcurrentSkipListMap.Node,ConcurrentSkipListMap.Node>	ConcurrentSkipListMap.Node.nextUpdater Updater for casNext
(package private) static AtomicReferenceFieldUpdater<ConcurrentSkipListMap.Node,Object>	ConcurrentSkipListMap.Node.valueUpdater Updater for casValue

Methods in net.sf.beanlib.util.concurrent that return ConcurrentSkipListMap.Node

(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.findFirst() Specialized variant of findNode to get first valid node.
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.findLast() Specialized version of find to get last valid node.
(package private) ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.findNear(K kkey, int rel) Utility for ceiling, floor, lower, higher methods.
private ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.findNode(Comparable<? super K> key) Returns node holding key or null if no such, clearing out any deleted nodes seen along the way.
private ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.findPredecessor(Comparable<? super K> key) Returns a base-level node with key strictly less than given key, or the base-level header if there is no such node.
private ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.findPredecessorOfLast() Specialized variant of findPredecessor to get predecessor of last valid node.
private ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.SubMap.hiNode() Returns highest node.
private ConcurrentSkipListMap.Node<K,V>	ConcurrentSkipListMap.SubMap.loNode() Returns lowest node.

Methods in net.sf.beanlib.util.concurrent with parameters of type ConcurrentSkipListMap.Node

(package private) boolean	ConcurrentSkipListMap.Node.appendMarker(ConcurrentSkipListMap.Node<K,V> f) Tries to append a deletion marker to this node.
(package private) boolean	ConcurrentSkipListMap.Node.casNext(ConcurrentSkipListMap.Node<K,V> cmp, ConcurrentSkipListMap.Node<K,V> val) compareAndSet next field
(package private) boolean	ConcurrentSkipListMap.Node.casNext(ConcurrentSkipListMap.Node<K,V> cmp, ConcurrentSkipListMap.Node<K,V> val) compareAndSet next field
(package private) void	ConcurrentSkipListMap.Node.helpDelete(ConcurrentSkipListMap.Node<K,V> b, ConcurrentSkipListMap.Node<K,V> f) Helps out a deletion by appending marker or unlinking from predecessor.
(package private) void	ConcurrentSkipListMap.Node.helpDelete(ConcurrentSkipListMap.Node<K,V> b, ConcurrentSkipListMap.Node<K,V> f) Helps out a deletion by appending marker or unlinking from predecessor.
private void	ConcurrentSkipListMap.insertIndex(ConcurrentSkipListMap.Node<K,V> z, int level) Creates and adds index nodes for the given node.
private boolean	ConcurrentSkipListMap.SubMap.isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n) Returns true if node key is less than upper bound of range

Constructors in net.sf.beanlib.util.concurrent with parameters of type ConcurrentSkipListMap.Node

ConcurrentSkipListMap.HeadIndex(ConcurrentSkipListMap.Node<K,V> node, ConcurrentSkipListMap.Index<K,V> down, ConcurrentSkipListMap.Index<K,V> right, int level)

ConcurrentSkipListMap.Index(ConcurrentSkipListMap.Node<K,V> node, ConcurrentSkipListMap.Index<K,V> down, ConcurrentSkipListMap.Index<K,V> right)
Creates index node with given values.

ConcurrentSkipListMap.Node(ConcurrentSkipListMap.Node<K,V> next)
Creates a new marker node.

ConcurrentSkipListMap.Node(K key, Object value, ConcurrentSkipListMap.Node<K,V> next)
Creates a new regular node.