Package net.sf.beanlib.util.concurrent

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

See:
Description

Interface Summary

BlockingDeque<E>	A Deque that additionally supports operations that wait for the deque to become non-empty when retrieving an element, and wait for space to become available in the deque when storing an element.
ConcurrentNavigableMap<K,V>	A ConcurrentMap supporting NavigableMap operations, and recursively so for its navigable sub-maps.

Class Summary

ConcurrentLinkedBlockingQueue<E>	An unbounded concurrent blocking queue implemented upon ConcurrentLinkedQueue.
ConcurrentLinkedBlockingQueue.ThreadMarker
ConcurrentLinkedBoundedBlockingQueue<E>	An bounded concurrent blocking queue implemented upon ConcurrentLinkedQueue.
ConcurrentSkipListMap<K,V>	A scalable concurrent ConcurrentNavigableMap implementation.
ConcurrentSkipListMap.ComparableUsingComparator<K>	Represents a key with a comparator as a Comparable.
ConcurrentSkipListMap.EntrySet<K1,V1>
ConcurrentSkipListMap.HeadIndex<K,V>	Nodes heading each level keep track of their level.
ConcurrentSkipListMap.Index<K,V>	Index nodes represent the levels of the skip list.
ConcurrentSkipListMap.KeySet<E>
ConcurrentSkipListMap.Node<K,V>	Nodes hold keys and values, and are singly linked in sorted order, possibly with some intervening marker nodes.
ConcurrentSkipListMap.SubMap<K,V>	Submaps returned by ConcurrentSkipListMap submap operations represent a subrange of mappings of their underlying maps.
ConcurrentSkipListMap.Values<E>
ConcurrentSkipListSet<E>	A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap.
LinkedBlockingDeque<E>	An optionally-bounded blocking deque based on linked nodes.
LinkedBlockingDeque.Node<E>	Doubly-linked list node class
UnboundedLinkedBlockingQueue<E>

Package net.sf.beanlib.util.concurrent Description

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