| Name | Package | Description |
|---|
| AbstractCollection | edu.emory.mathcs.backport.java.util | Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent collections. |
| AbstractExecutorService | edu.emory.mathcs.backport.java.util.concurrent | Provides default implementations of ExecutorService
execution methods. |
| AbstractList | edu.emory.mathcs.backport.java.util | Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent lists. |
| AbstractMap | edu.emory.mathcs.backport.java.util | Convenience base class for map implementations that provides helper classes
representing simple map entries, both mutable and immutable. |
| AbstractMap.SimpleEntry | edu.emory.mathcs.backport.java.util | An Entry maintaining a key and a value. |
| AbstractMap.SimpleImmutableEntry | edu.emory.mathcs.backport.java.util | An Entry maintaining an immutable key and value, This class
does not support method setValue. |
| AbstractQueue | edu.emory.mathcs.backport.java.util | This class provides skeletal implementations of some Queue
operations. |
| AbstractSequentialList | edu.emory.mathcs.backport.java.util | Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent lists. |
| AbstractSet | edu.emory.mathcs.backport.java.util | Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent sets. |
| ArrayBlockingQueue | edu.emory.mathcs.backport.java.util.concurrent | A bounded blocking queue backed by an
array. |
| ArrayDeque | edu.emory.mathcs.backport.java.util | Resizable-array implementation of the Deque interface. |
| Arrays | edu.emory.mathcs.backport.java.util | No description provided. |
| AtomicBoolean | edu.emory.mathcs.backport.java.util.concurrent.atomic | A boolean value that may be updated atomically. |
| AtomicInteger | edu.emory.mathcs.backport.java.util.concurrent.atomic | An int value that may be updated atomically. |
| AtomicIntegerArray | edu.emory.mathcs.backport.java.util.concurrent.atomic | An int array in which elements may be updated atomically. |
| AtomicLong | edu.emory.mathcs.backport.java.util.concurrent.atomic | A long value that may be updated atomically. |
| AtomicLongArray | edu.emory.mathcs.backport.java.util.concurrent.atomic | A long array in which elements may be updated atomically. |
| AtomicMarkableReference | edu.emory.mathcs.backport.java.util.concurrent.atomic | An AtomicMarkableReference maintains an object reference
along with a mark bit, that can be updated atomically. |
| AtomicReference | edu.emory.mathcs.backport.java.util.concurrent.atomic | An object reference that may be updated atomically. |
| AtomicReferenceArray | edu.emory.mathcs.backport.java.util.concurrent.atomic | An array of object references in which elements may be updated
atomically. |
| AtomicStampedReference | edu.emory.mathcs.backport.java.util.concurrent.atomic | An AtomicStampedReference maintains an object reference
along with an integer "stamp", that can be updated atomically. |
| Collections | edu.emory.mathcs.backport.java.util | Augments Collections with methods added in Java 5.0
and higher. |
| ConcurrentHashMap | edu.emory.mathcs.backport.java.util.concurrent | A hash table supporting full concurrency of retrievals and
adjustable expected concurrency for updates. |
| ConcurrentLinkedQueue | edu.emory.mathcs.backport.java.util.concurrent | An unbounded thread-safe queue based on linked nodes. |
| ConcurrentSkipListMap | edu.emory.mathcs.backport.java.util.concurrent | A scalable concurrent ConcurrentNavigableMap implementation. |
| ConcurrentSkipListSet | edu.emory.mathcs.backport.java.util.concurrent | A scalable concurrent NavigableSet implementation based on
a ConcurrentSkipListMap . |
| CopyOnWriteArrayList | edu.emory.mathcs.backport.java.util.concurrent | No description provided. |
| CopyOnWriteArraySet | edu.emory.mathcs.backport.java.util.concurrent | A Set that uses an internal CopyOnWriteArrayList
for all of its operations. |
| CountDownLatch | edu.emory.mathcs.backport.java.util.concurrent | A synchronization aid that allows one or more threads to wait until
a set of operations being performed in other threads completes. |
| CyclicBarrier | edu.emory.mathcs.backport.java.util.concurrent | A synchronization aid that allows a set of threads to all wait for
each other to reach a common barrier point. |
| DelayQueue | edu.emory.mathcs.backport.java.util.concurrent | An unbounded blocking queue of
Delayed elements, in which an element can only be taken
when its delay has expired. |
| Exchanger | edu.emory.mathcs.backport.java.util.concurrent | A synchronization point at which threads can pair and swap elements
within pairs. |
| ExecutorCompletionService | edu.emory.mathcs.backport.java.util.concurrent | A CompletionService that uses a supplied Executor
to execute tasks. |
| Executors | edu.emory.mathcs.backport.java.util.concurrent | Factory and utility methods for Executor , ExecutorService , ScheduledExecutorService , ThreadFactory , and Callable classes defined in this
package. |
| FIFOWaitQueue | edu.emory.mathcs.backport.java.util.concurrent.helpers | Simple linked list queue used in FIFOSemaphore. |
| FutureTask | edu.emory.mathcs.backport.java.util.concurrent | A cancellable asynchronous computation. |
| LinkedBlockingDeque | edu.emory.mathcs.backport.java.util.concurrent | An optionally-bounded blocking deque based on
linked nodes. |
| LinkedBlockingQueue | edu.emory.mathcs.backport.java.util.concurrent | An optionally-bounded blocking queue based on
linked nodes. |
| LinkedList | edu.emory.mathcs.backport.java.util | No description provided. |
| PriorityBlockingQueue | edu.emory.mathcs.backport.java.util.concurrent | An unbounded blocking queue that uses
the same ordering rules as class PriorityQueue and supplies
blocking retrieval operations. |
| PriorityQueue | edu.emory.mathcs.backport.java.util | An unbounded queue that supports element retrieval
in the order of relative priority. |
| ReentrantLock | edu.emory.mathcs.backport.java.util.concurrent.locks | A reentrant mutual exclusion Lock with the same basic
behavior and semantics as the implicit monitor lock accessed using
synchronized methods and statements, but with extended
capabilities. |
| ReentrantReadWriteLock | edu.emory.mathcs.backport.java.util.concurrent.locks | An implementation of ReadWriteLock supporting similar
semantics to ReentrantLock . |
| ReentrantReadWriteLock.ReadLock | edu.emory.mathcs.backport.java.util.concurrent.locks | The lock returned by method readLock() . |
| ReentrantReadWriteLock.WriteLock | edu.emory.mathcs.backport.java.util.concurrent.locks | The lock returned by method writeLock() . |
| ScheduledThreadPoolExecutor | edu.emory.mathcs.backport.java.util.concurrent | A ThreadPoolExecutor that can additionally schedule
commands to run after a given delay, or to execute
periodically. |
| Semaphore | edu.emory.mathcs.backport.java.util.concurrent | A counting semaphore. |
| SynchronousQueue | edu.emory.mathcs.backport.java.util.concurrent | A blocking queue in which each insert
operation must wait for a corresponding remove operation by another
thread, and vice versa. |
| ThreadHelpers | edu.emory.mathcs.backport.java.util.concurrent.helpers | Emulation of some new functionality present in java.lang.Thread in J2SE 5.0. |
| ThreadPoolExecutor | edu.emory.mathcs.backport.java.util.concurrent | An ExecutorService that executes each submitted task using
one of possibly several pooled threads, normally configured
using Executors factory methods. |
| ThreadPoolExecutor.AbortPolicy | edu.emory.mathcs.backport.java.util.concurrent | A handler for rejected tasks that throws a
RejectedExecutionException. |
| ThreadPoolExecutor.CallerRunsPolicy | edu.emory.mathcs.backport.java.util.concurrent | A handler for rejected tasks that runs the rejected task
directly in the calling thread of the execute method,
unless the executor has been shut down, in which case the task
is discarded. |
| ThreadPoolExecutor.DiscardOldestPolicy | edu.emory.mathcs.backport.java.util.concurrent | A handler for rejected tasks that discards the oldest unhandled
request and then retries execute, unless the executor
is shut down, in which case the task is discarded. |
| ThreadPoolExecutor.DiscardPolicy | edu.emory.mathcs.backport.java.util.concurrent | A handler for rejected tasks that silently discards the
rejected task. |
| TimeUnit | edu.emory.mathcs.backport.java.util.concurrent | A TimeUnit represents time durations at a given unit of
granularity and provides utility methods to convert across units,
and to perform timing and delay operations in these units. |
| TreeMap | edu.emory.mathcs.backport.java.util | Sorted map implementation based on a red-black tree and implementing
all the methods from the NavigableMap interface. |
| TreeMap.Entry | edu.emory.mathcs.backport.java.util | No description provided. |
| TreeSet | edu.emory.mathcs.backport.java.util | No description provided. |
| Utils | edu.emory.mathcs.backport.java.util.concurrent.helpers |
This class groups together the functionality of java.util.concurrent that
cannot be fully and reliably implemented in backport, but for which some
form of emulation is possible. |
| WaitQueue | edu.emory.mathcs.backport.java.util.concurrent.helpers | Base class for internal queue classes for semaphores, etc. |
| WaitQueue.WaitNode | edu.emory.mathcs.backport.java.util.concurrent.helpers | No description provided. |
