| org.apache.openjpa.lib.util.concurrent |
|
Concurrent Utilities
|
| Java Source File Name | Type | Comment |
| AbstractCollection.java | Class | Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent collections. |
| AbstractConcurrentEventManager.java | Class | Base event manager that handles adding/removing listeners
and firing events. |
| AbstractQueue.java | Class | This class provides skeletal implementations of some
Queue operations. |
| AbstractSet.java | Class | Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent sets. |
| Arrays.java | Class | |
| ConcurrentHashMap.java | Class | This class implements a HashMap which has limited synchronization.
In particular mutators are generally synchronized while accessors
are generally not. |
| ConcurrentHashSet.java | Class | A concurrent set. |
| ConcurrentLinkedQueue.java | Class | An unbounded thread-safe
based on linked nodes.
This queue orders elements FIFO(first-in-first-out).
The head of the queue is that element that has been on the
queue the longest time.
The tail of the queue is that element that has been on the
queue the shortest time. |
| ConcurrentMap.java | Interface | A highly concurrent map. |
| ConcurrentReferenceHashMap.java | Class | This class implements a HashMap which has limited synchronization
and reference keys or values(but not both). |
| ConcurrentReferenceHashSet.java | Class | A concurrent set whose values may be stored as weak or soft references. |
| Condition.java | Interface | Condition factors out the Object monitor
methods(
Object.wait wait ,
Object.notify notify and
Object.notifyAll notifyAll ) into distinct objects to
give the effect of having multiple wait-sets per object, by
combining them with the use of arbitrary
Lock implementations.
Where a Lock replaces the use of synchronized methods
and statements, a Condition replaces the use of the Object
monitor methods. |
| CondVar.java | Class | |
| CopyOnWriteArrayList.java | Class | |
| CopyOnWriteArraySet.java | Class | A
java.util.Set that uses an internal
CopyOnWriteArrayList for all of its operations. |
| FIFOCondVar.java | Class | |
| FIFOWaitQueue.java | Class | Simple linked list queue used in FIFOSemaphore. |
| Lock.java | Interface | Lock implementations provide more extensive locking
operations than can be obtained using synchronized methods
and statements. |
| NanoTimer.java | Interface | Interface to specify custom implementation of precise timer. |
| Queue.java | Interface | A collection designed for holding elements prior to processing.
Besides basic
java.util.Collection Collection operations,
queues provide additional insertion, extraction, and inspection
operations. |
| ReentrantLock.java | Class | 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.
A ReentrantLock is owned by the thread last
successfully locking, but not yet unlocking it. |
| TestConcurrentMap.java | Class | Tests the methods of
ConcurrentMap . |
| TimeUnit.java | Class | 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. |
| Utils.java | Class | 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.
Currently, this class contains methods related to nanosecond-precision
timing, particularly via the
Utils.nanoTime method. |
| WaitQueue.java | Class | Base class for internal queue classes for semaphores, etc. |