|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
ExecutorService
execution methods.List
interface to minimize the effort required to implement this interface
backed by a "random access" data store (such as an array).Queue
operations.AbstractQueuedSynchronizer in
which synchronization state is maintained as a long.AbstractQueuedLongSynchronizer serving as the basis of a Lock implementation.AbstractQueuedSynchronizer serving as the basis of a Lock implementation.ForkJoinTask that performs the run
method of the given Runnable as its action, and returns
a null result upon ForkJoinTask.join().
ForkJoinTask that performs the run
method of the given Runnable as its action, and returns
the given result upon ForkJoinTask.join().
ForkJoinTask that performs the call
method of the given Callable as its action, and returns
its result upon ForkJoinTask.join(), translating any checked exceptions
encountered into RuntimeException.
i.
i.
Deque interface.Deque as a Last-in-first-out (Lifo)
Queue.
boolean value that may be updated atomically.AtomicBoolean with the given initial value.
AtomicBoolean with initial value false.
int value that may be updated atomically.0.
int array in which elements may be updated atomically.volatile int fields of designated classes.long value that may be updated atomically.0.
long array in which elements may be updated atomically.volatile long fields of designated classes.AtomicMarkableReference maintains an object reference
along with a mark bit, that can be updated atomically.AtomicMarkableReference with the given
initial values.
volatile reference fields of designated
classes.AtomicStampedReference maintains an object reference
along with an integer "stamp", that can be updated atomically.AtomicStampedReference with the given
initial values.
== to the expected
reference.
== to the expected
reference.
InterruptedException if interrupted
while waiting, or returning immediately if the current phase of
the barrier is not equal to the given phase value or this
barrier is terminated.
InterruptedException if interrupted while waiting, or
returning immediately if the current phase of the barrier is
not equal to the given phase value or this barrier is
terminated.
Deque that additionally supports blocking 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.Queue that additionally supports operations
that wait for the queue to become non-empty when retrieving an
element, and wait for space to become available in the queue when
storing an element.Callable object that, when
called, runs the given task and returns the given result.
Callable object that, when
called, runs the given task and returns null.
Callable object that, when
called, runs the given privileged action and returns its result.
Callable object that, when
called, runs the given privileged exception action and returns
its result.
FutureTask, cannot be retrieved because the task
was cancelled.null if there is no such element.
null if
there is no such key.
null if there is no such key.
TreeSet instance.
null if this queue is sorted according to
the natural ordering of its elements.
== the expected value.
== the expected value.
i to the given
updated value if the current value == the expected value.
== the
expected value.
== the expected value.
== the expected value.
== the
expected value.
== to the expected reference
and the current mark is equal to the expected mark.
== the expected value.
i to the given
updated value if the current value == the expected value.
== the
expected value.
== to the expected reference
and the current stamp is equal to the expected stamp.
null result upon join and related
operations.
join and related operations.
ConcurrentLinkedQueue that is initially empty.
ConcurrentLinkedQueue
initially containing the elements of the given collection,
added in traversal order of the collection's iterator.
Map providing additional atomic
putIfAbsent, remove, and replace methods.ConcurrentMap supporting NavigableMap operations,
and recursively so for its navigable sub-maps.ConcurrentNavigableMap implementation.NavigableSet implementation based on
a ConcurrentSkipListMap.Condition factors out the Object monitor
methods (wait, notify
and 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.true if this queue contains the specified element.
true if this deque contains the specified element.
true if this queue contains the specified element.
true if this queue contains the specified element.
true if this set contains the specified element.
true if this vector contains the specified element.
ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array.Set that uses an internal CopyOnWriteArrayList
for all of its operations.CountDownLatch initialized with the given count.
ThreadLocalRandom.
i.
i.
Delayed instances.
NavigableSet view of the keys contained in this map.
NavigableSet view of the keys contained in this map.
Vector object.
Set view of the mappings contained in this map.
Set view of the mappings contained in this map.
Set view of the mappings contained in this map.
command with zero required delay.
Runnable tasks.CompletionService that uses a supplied Executor
to execute tasks.LinkedBlockingQueue as a completion queue.
Executor, ExecutorService, ScheduledExecutorService, ThreadFactory, and Callable classes defined in this
package.Executor that provides methods to manage termination and
methods that can produce a Future for tracking progress of
one or more asynchronous tasks.Fences for
the current Fences class based on this preliminary revision.shutdown when this executor is no longer
referenced and it has no threads.
0) of
this vector.
null if the map is empty.
null if there is no such element.
null if there
is no such key.
null if there is no such key.
ExecutorService for running ForkJoinTasks.ForkJoinPool with parallelism equal to Runtime.availableProcessors(), and using the default thread factory.
ForkJoinPool with the indicated parallelism
level and using the default thread factory.
ForkJoinPool with parallelism equal to Runtime.availableProcessors(), and using the given
thread factory.
ForkJoinPool with the given parallelism and
thread factory.
ForkJoinWorkerThreads.ForkJoinPools.ForkJoinPool.ForkJoinPool.null if this map contains no mapping for the key.
i.
i.
i.
null if this map contains no mapping for the key.
null if this map contains no mapping for the key.
null if this map contains no mapping for the key.
i.
i.
i.
i.
i.
i.
i to the given
value and returns the old value.
i to the given value
and returns the old value.
i to the given
value and returns the old value.
true if this pool uses local first-in-first-out
scheduling mode for forked tasks that are never joined.
shutdown.
CancellationException if cancelled, or null if
none or if the method has not yet completed.
shutdown.
null if no threads are currently queued.
null if no threads are currently queued.
true if this pool dynamically maintains its
target parallelism level.
null if not owned.
null if not owned.
null if none.
ForkJoinTask.join(), even
if this task completed abnormally, or null if this task
is not known to have been completed.
BlockingQueue.take() or timed
poll.
true if there are any tasks submitted to this
pool that have not yet begun executing.
true if there is at least one consumer waiting
to receive an element via BlockingQueue.take() or
timed poll.
inclusive is true) toKey.
inclusive is true) toElement.
is
done, then returns the result of the computation.
is quiescent.
null if there is no such element.
null if there
is no such key.
null if there is no such key.
i.
i.
index, or returns -1 if
the element is not found.
true if the current thread is executing as a
ForkJoinPool computation.
index.
isDone holds for
each task or an (unchecked) exception is encountered, in which
case the exception is rethrown.
isDone holds for
each task or an (unchecked) exception is encountered, in which
case the exception is rethrown.
isDone holds for each task or an (unchecked) exception
is encountered.
true if this task threw an exception or was cancelled.
true if this task completed without throwing an
exception and was not cancelled.
true if this queue contains no elements.
true if this queue contains no elements.
true if this set contains no elements.
true if this lock has fairness set true.
true if this lock has fairness set true.
true if this semaphore has fairness set true.
true if synchronization is held exclusively with
respect to the current (calling) thread.
true if synchronization is held exclusively with
respect to the current (calling) thread.
true if all worker threads are currently idle.
true if blocking is unnecessary.
true if this pool has been shut down.
true if all tasks have completed following shut down.
true if this barrier has been terminated.
true if the process of termination has
commenced but not yet completed.
ThreadPoolExecutor.shutdown() or ThreadPoolExecutor.shutdownNow() but has not
completely terminated.
is done.
Set view of the keys contained in this map.
Set view of the keys contained in this map.
NavigableSet view of the keys contained in this map.
NavigableSet view of the keys contained in this map.
Set view of the keys contained in this map.
null if the map is empty.
index, or returns -1 if
the element is not found.
i to the given value.
i to the given value.
i to the given value.
LinkedBlockingDeque with a capacity of
Integer.MAX_VALUE.
LinkedBlockingDeque with the given (fixed) capacity.
LinkedBlockingDeque with a capacity of
Integer.MAX_VALUE, initially containing the elements of
the given collection, added in traversal order of the
collection's iterator.
LinkedBlockingQueue with a capacity of
Integer.MAX_VALUE.
LinkedBlockingQueue with the given (fixed) capacity.
LinkedBlockingQueue with a capacity of
Integer.MAX_VALUE, initially containing the elements of the
given collection,
added in traversal order of the collection's iterator.
TransferQueue based on linked nodes.LinkedTransferQueue.
LinkedTransferQueue
initially containing the elements of the given collection,
added in traversal order of the collection's iterator.
Lock implementations provide more extensive locking
operations than can be obtained using synchronized methods
and statements.null if there is no such element.
null if there is
no such key.
null if there is no such key.
NavigableSet view of the keys contained in this map.
NavigableSet view of the keys contained in this map.
SortedMap extended with navigation methods returning the
closest matches for given search targets.SortedSet extended with navigation methods reporting
closest matches for given search targets.Condition instance that is bound to this
Lock instance.
Condition instance for use with this
Lock instance.
UnsupportedOperationException because
ReadLocks do not support conditions.
Condition instance for use with this
Lock instance.
Thread.
boolean value from this random number generator's
sequence.
double value
between 0 (inclusive) and the specified value (exclusive).
double value between 0.0 and
1.0 from this random number generator's sequence.
float
value between 0.0 and 1.0 from this random
number generator's sequence.
double value with mean 0.0 and standard
deviation 1.0 from this random number generator's sequence.
int
value from this random number generator's sequence.
int value
between 0 (inclusive) and the specified value (exclusive), drawn from
this random number generator's sequence.
long
value from this random number generator's sequence.
true upon success and false if this queue
is full.
CyclicBarrier and
CountDownLatch
but supporting more flexible usage.null if this set is empty.
null if the map is empty.
null if this set is empty.
null if the map is empty.
PriorityQueue and supplies
blocking retrieval operations.PriorityQueue with the default initial
capacity (11) that orders its elements according to their
natural ordering.
PriorityQueue with the specified initial
capacity that orders its elements according to their
natural ordering.
PriorityQueue with the specified initial capacity
that orders its elements according to the specified comparator.
PriorityQueue containing the elements in the
specified collection.
PriorityQueue containing the elements in the
specified priority queue.
PriorityQueue containing the elements in the
specified sorted set.
Callable object that will, when
called, execute the given callable under the current
access control context.
Callable object that will, when
called, execute the given callable under the current
access control context, with the current context class loader
as the context class loader.
Future
tasks that have been cancelled.
is
done.
long seed.
java.lang.ref package documentation), regardless of any prior
actions of the program that might otherwise cause the object to
become unreachable; thus, the referenced object is not
reclaimable by garbage collection at least until after the
invocation of this method.
locks, one for read-only operations and one for writing.ForkJoinTask.ForkJoinTask.Lock with the same basic
behavior and semantics as the implicit monitor lock accessed using
synchronized methods and statements, but with extended
capabilities.ReentrantLock.
ReentrantLock with the
given fairness policy.
ReadWriteLock supporting similar
semantics to ReentrantLock.ReentrantReadWriteLock with
default (nonfair) ordering properties.
ReentrantReadWriteLock with
the given fairness policy.
ReentrantReadWriteLock.readLock().ReentrantReadWriteLock.writeLock().fork.
ThreadPoolExecutor when
execute cannot accept a
task.
Executor when a task cannot be
accepted for execution.ThreadPoolExecutor.Integer.MAX_VALUE because a
LinkedTransferQueue is not capacity constrained.
fromIndex, inclusive, and toIndex, exclusive.
fromIndex, inclusive, and toIndex, exclusive.
fromIndex, inclusive, and toIndex, exclusive.
Future that is Runnable.ScheduledFuture that is Runnable.ExecutorService that can schedule commands to run after a given
delay, or to execute periodically.ThreadPoolExecutor that can additionally schedule
commands to run after a given delay, or to execute
periodically.ScheduledThreadPoolExecutor with the
given core pool size.
ScheduledThreadPoolExecutor with the
given initial parameters.
Semaphore with the given number of
permits and nonfair fairness setting.
Semaphore with the given number of
permits and the given fairness setting.
i to the given value.
i to the given value.
i to the given value.
shutdown.
index of this
vector to be the specified object.
shutdown.
UnsupportedOperationException.
long seed.
Stack class represents a last-in-first-out
(LIFO) stack of objects.fromIndex, inclusive, and toIndex, exclusive.
fromKey to toKey.
fromElement to toElement.
inclusive is true) fromKey.
inclusive is true) fromElement.