- ReadWriteLock - interface edu.emory.mathcs.backport.java.util.concurrent.locks.ReadWriteLock.
- A ReadWriteLock maintains a pair of associated
locks, one for read-only operations and one for writing. - ReentrantLock - class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantLock.
- A reentrant mutual exclusion
Lock with the same basic
behavior and semantics as the implicit monitor lock accessed using
methods and statements, but with extended
capabilities. - ReentrantLock() -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantLock
- Creates an instance of .
- ReentrantLock(boolean) -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantLock
- Creates an instance of with the
given fairness policy.
- ReentrantReadWriteLock - class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock.
- An implementation of
ReadWriteLock supporting similar
semantics to ReentrantLock. - ReentrantReadWriteLock() -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock
- Creates a new with
default (nonfair) ordering properties.
- ReentrantReadWriteLock.ReadLock - class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock.ReadLock.
- The lock returned by method
ReentrantReadWriteLock.readLock(). - ReentrantReadWriteLock.ReadLock(ReentrantReadWriteLock) -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock.ReadLock
- Constructor for use by subclasses
- ReentrantReadWriteLock.WriteLock - class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock.WriteLock.
- The lock returned by method
ReentrantReadWriteLock.writeLock(). - ReentrantReadWriteLock.WriteLock(ReentrantReadWriteLock) -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock.WriteLock
- Constructor for use by subclasses
- RejectedExecutionException - exception edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionException.
- Exception thrown by an
Executor when a task cannot be
accepted for execution. - RejectedExecutionException() -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionException
- Constructs a RejectedExecutionException with no detail message.
- RejectedExecutionException(String) -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionException
- Constructs a RejectedExecutionException with the
specified detail message.
- RejectedExecutionException(String, Throwable) -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionException
- Constructs a RejectedExecutionException with the
specified detail message and cause.
- RejectedExecutionException(Throwable) -
Constructor for class edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionException
- Constructs a RejectedExecutionException with the
specified cause.
- RejectedExecutionHandler - interface edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler.
- A handler for tasks that cannot be executed by a
ThreadPoolExecutor. - RunnableFuture - interface edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture.
- A
Future that is Runnable. - RunnableScheduledFuture - interface edu.emory.mathcs.backport.java.util.concurrent.RunnableScheduledFuture.
- A
ScheduledFuture that is Runnable. - readLock() -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.locks.ReadWriteLock
- Returns the lock used for reading.
- readLock() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.locks.ReentrantReadWriteLock
-
- readResolve() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.TimeUnit
-
- recheck(WaitQueue.WaitNode) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.helpers.WaitQueue.QueuedSync
-
- reducePermits(int) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.Semaphore
- Shrinks the number of available permits by the indicated
reduction.
- rejectedExecution(Runnable, ThreadPoolExecutor) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.RejectedExecutionHandler
- Method that may be invoked by a
ThreadPoolExecutor when
execute cannot accept a
task.
- rejectedExecution(Runnable, ThreadPoolExecutor) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor.AbortPolicy
- Always throws RejectedExecutionException.
- rejectedExecution(Runnable, ThreadPoolExecutor) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor.CallerRunsPolicy
- Executes task r in the caller's thread, unless the executor
has been shut down, in which case the task is discarded.
- rejectedExecution(Runnable, ThreadPoolExecutor) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor.DiscardOldestPolicy
- Obtains and ignores the next task that the executor
would otherwise execute, if one is immediately available,
and then retries execution of task r, unless the executor
is shut down, in which case task r is instead discarded.
- rejectedExecution(Runnable, ThreadPoolExecutor) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor.DiscardPolicy
- Does nothing, which has the effect of discarding task r.
- release() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.Semaphore
- Releases a permit, returning it to the semaphore.
- release(int) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.Semaphore
- Releases the given number of permits, returning them to the semaphore.
- remainingCapacity() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue
- Returns the number of additional elements that this queue can ideally
(in the absence of memory or resource constraints) accept without
blocking.
- remainingCapacity() -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue
- Returns the number of additional elements that this queue can ideally
(in the absence of memory or resource constraints) accept without
blocking, or Integer.MAX_VALUE if there is no intrinsic
limit.
- remainingCapacity() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.DelayQueue
- Always returns Integer.MAX_VALUE because
a DelayQueue is not capacity constrained.
- remainingCapacity() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
- Returns the number of additional elements that this deque can ideally
(in the absence of memory or resource constraints) accept without
blocking.
- remainingCapacity() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue
- Returns the number of additional elements that this queue can ideally
(in the absence of memory or resource constraints) accept without
blocking.
- remainingCapacity() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.PriorityBlockingQueue
- Always returns Integer.MAX_VALUE because
a PriorityBlockingQueue is not capacity constrained.
- remainingCapacity() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.SynchronousQueue
- Always returns zero.
- remove() -
Method in class edu.emory.mathcs.backport.java.util.AbstractQueue
- Retrieves and removes the head of this queue.
- remove() -
Method in class edu.emory.mathcs.backport.java.util.ArrayDeque
- Retrieves and removes the head of the queue represented by this deque.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.ArrayDeque
- Removes a single instance of the specified element from this deque.
- remove() -
Method in interface edu.emory.mathcs.backport.java.util.Deque
- Retrieves and removes the head of the queue represented by this deque
(in other words, the first element of this deque).
- remove(Object) -
Method in interface edu.emory.mathcs.backport.java.util.Deque
- Removes the first occurrence of the specified element from this deque.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- remove(int) -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- remove() -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- remove() -
Method in class edu.emory.mathcs.backport.java.util.PriorityQueue
- Retrieves and removes the head of this queue.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.PriorityQueue
- Removes a single instance of the specified element from this queue,
if it is present.
- remove() -
Method in interface edu.emory.mathcs.backport.java.util.Queue
- Retrieves and removes the head of this queue.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.TreeMap
-
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.TreeSet
-
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue
- Removes a single instance of the specified element from this queue,
if it is present.
- remove() -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.BlockingDeque
- Retrieves and removes the head of the queue represented by this deque
(in other words, the first element of this deque).
- remove(Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.BlockingDeque
- Removes the first occurrence of the specified element from this deque.
- remove(Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue
- Removes a single instance of the specified element from this queue,
if it is present.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentHashMap
- Removes the key (and its corresponding value) from this map.
- remove(Object, Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentHashMap
- Removes the entry for a key only if currently mapped to a given value.
This is equivalent to
if (map.containsKey(key) && map.get(key).equals(value)) {
map.remove(key);
return true;
} else return false;
except that the action is performed atomically.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentLinkedQueue
- Removes a single instance of the specified element from this queue,
if it is present.
- remove(Object, Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.ConcurrentMap
- Removes the entry for a key only if currently mapped to a given value.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListMap
- Removes the mapping for the specified key from this map if present.
- remove(Object, Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListMap
- Removes the entry for a key only if currently mapped to a given value.
This is equivalent to
if (map.containsKey(key) && map.get(key).equals(value)) {
map.remove(key);
return true;
} else return false;
except that the action is performed atomically.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListSet
- Removes the specified element from this set if it is present.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArrayList
-
- remove(int) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArrayList
-
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArraySet
- Removes the specified element from this set if it is present.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.DelayQueue
- Removes a single instance of the specified element from this
queue, if it is present, whether or not it has expired.
- remove() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
- Retrieves and removes the head of the queue represented by this deque.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
- Removes the first occurrence of the specified element from this deque.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue
- Removes a single instance of the specified element from this queue,
if it is present.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.PriorityBlockingQueue
- Removes a single instance of the specified element from this queue,
if it is present.
- remove(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.SynchronousQueue
- Always returns false.
- remove(Runnable) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ThreadPoolExecutor
- Removes this task from the executor's internal queue if it is
present, thus causing it not to be run if it has not already
started.
- removeAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListSet
- Removes from this set all of its elements that are contained in
the specified collection.
- removeAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArrayList
-
- removeAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArraySet
- Removes from this set all of its elements that are contained in the
specified collection.
- removeAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.SynchronousQueue
- Always returns false.
- removeFirst() -
Method in class edu.emory.mathcs.backport.java.util.ArrayDeque
-
- removeFirst() -
Method in interface edu.emory.mathcs.backport.java.util.Deque
- Retrieves and removes the first element of this deque.
- removeFirst() -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- removeFirst() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
-
- removeFirstOccurrence(Object) -
Method in class edu.emory.mathcs.backport.java.util.ArrayDeque
- Removes the first occurrence of the specified element in this
deque (when traversing the deque from head to tail).
- removeFirstOccurrence(Object) -
Method in interface edu.emory.mathcs.backport.java.util.Deque
- Removes the first occurrence of the specified element from this deque.
- removeFirstOccurrence(Object) -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- removeFirstOccurrence(Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.BlockingDeque
- Removes the first occurrence of the specified element from this deque.
- removeFirstOccurrence(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
-
- removeLast() -
Method in class edu.emory.mathcs.backport.java.util.ArrayDeque
-
- removeLast() -
Method in interface edu.emory.mathcs.backport.java.util.Deque
- Retrieves and removes the last element of this deque.
- removeLast() -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- removeLast() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
-
- removeLastOccurrence(Object) -
Method in class edu.emory.mathcs.backport.java.util.ArrayDeque
- Removes the last occurrence of the specified element in this
deque (when traversing the deque from head to tail).
- removeLastOccurrence(Object) -
Method in interface edu.emory.mathcs.backport.java.util.Deque
- Removes the last occurrence of the specified element from this deque.
- removeLastOccurrence(Object) -
Method in class edu.emory.mathcs.backport.java.util.LinkedList
-
- removeLastOccurrence(Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.BlockingDeque
- Removes the last occurrence of the specified element from this deque.
- removeLastOccurrence(Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingDeque
-
- replace(Object, Object, Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentHashMap
- Replaces the entry for a key only if currently mapped to a given value.
This is equivalent to
if (map.containsKey(key) && map.get(key).equals(oldValue)) {
map.put(key, newValue);
return true;
} else return false;
except that the action is performed atomically.
- replace(Object, Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentHashMap
- Replaces the entry for a key only if currently mapped to some value.
This is equivalent to
if (map.containsKey(key)) {
return map.put(key, value);
} else return null;
except that the action is performed atomically.
- replace(Object, Object, Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.ConcurrentMap
- Replaces the entry for a key only if currently mapped to a given value.
- replace(Object, Object) -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.ConcurrentMap
- Replaces the entry for a key only if currently mapped to some value.
- replace(Object, Object, Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListMap
- Replaces the entry for a key only if currently mapped to a given value.
This is equivalent to
if (map.containsKey(key) && map.get(key).equals(oldValue)) {
map.put(key, newValue);
return true;
} else return false;
except that the action is performed atomically.
- replace(Object, Object) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.ConcurrentSkipListMap
- Replaces the entry for a key only if currently mapped to some value.
This is equivalent to
if (map.containsKey(key)) {
return map.put(key, value);
} else return null;
except that the action is performed atomically.
- replaceAll(List, Object, Object) -
Static method in class edu.emory.mathcs.backport.java.util.Collections
-
- reset() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CyclicBarrier
- Resets the barrier to its initial state.
- retainAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArrayList
-
- retainAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.CopyOnWriteArraySet
- Retains only the elements in this set that are contained in the
specified collection.
- retainAll(Collection) -
Method in class edu.emory.mathcs.backport.java.util.concurrent.SynchronousQueue
- Always returns false.
- reverse(List) -
Static method in class edu.emory.mathcs.backport.java.util.Collections
-
- reverseOrder() -
Static method in class edu.emory.mathcs.backport.java.util.Collections
-
- reverseOrder(Comparator) -
Static method in class edu.emory.mathcs.backport.java.util.Collections
-
- rotate(List, int) -
Static method in class edu.emory.mathcs.backport.java.util.Collections
-
- run() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.FutureTask
- Sets this Future to the result of its computation
unless it has been cancelled.
- run() -
Method in interface edu.emory.mathcs.backport.java.util.concurrent.RunnableFuture
- Sets this Future to the result of its computation
unless it has been cancelled.
- runAndReset() -
Method in class edu.emory.mathcs.backport.java.util.concurrent.FutureTask
- Executes the computation without setting its result, and then
resets this Future to initial state, failing to do so if the
computation encounters an exception or is cancelled.