Overview 
Module 
Package 
Class 
 Use 
Tree 
Deprecated 
Index 
Help 
PREV   NEXT      All Classes   All Packages
FRAMES    NO FRAMES
FlexDoc/Javadoc 2.0
Demo Java Doc
Uses of Class
java.lang.InterruptedException
Packages that use InterruptedException
java.lang
Provides classes that are fundamental to the design of the Java programming language.
java.util.concurrent
Utility classes commonly useful in concurrent programming.
Uses of InterruptedException in java.lang
Methods in java.lang that throw InterruptedException
final void
Object.wait()
Causes the current thread to wait until it is awakened, typically by being notified or interrupted.
final void
Object.wait(long timeoutMillis)
Causes the current thread to wait until it is awakened, typically by being notified or interrupted, or until a certain amount of real time has elapsed.
final void
Object.wait(long timeoutMillis, int nanos)
Causes the current thread to wait until it is awakened, typically by being notified or interrupted, or until a certain amount of real time has elapsed.
abstract int
Process.waitFor()
Causes the current thread to wait, if necessary, until the process represented by this Process object has terminated.
boolean
Process.waitFor(long timeout, TimeUnit unit)
Causes the current thread to wait, if necessary, until the process represented by this Process object has terminated, or the specified waiting time elapses.
final void
Thread.join()
Waits for this thread to die.
final void
Thread.join(long millis)
Waits at most millis milliseconds for this thread to die.
final void
Thread.join(long millis, int nanos)
Waits at most millis milliseconds plus nanos nanoseconds for this thread to die.
static void
Thread.sleep(long millis)
Causes the currently executing thread to sleep (temporarily cease execution) for the specified number of milliseconds, subject to the precision and accuracy of system timers and schedulers.
static void
Thread.sleep(long millis, int nanos)
Causes the currently executing thread to sleep (temporarily cease execution) for the specified number of milliseconds plus the specified number of nanoseconds, subject to the precision and accuracy of system timers and schedulers.
Uses of InterruptedException in java.util.concurrent
Methods in java.util.concurrent that throw InterruptedException
<T> List<Future<T>>
AbstractExecutorService.invokeAll(Collection<? extends Callable<T>> tasks)
Executes the given tasks, returning a list of Futures holding their status and results when all complete.
<T> List<Future<T>>
AbstractExecutorService.invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
Executes the given tasks, returning a list of Futures holding their status and results when all complete or the timeout expires, whichever happens first.
<T> T
AbstractExecutorService.invokeAny(Collection<? extends Callable<T>> tasks)
Executes the given tasks, returning the result of one that has completed successfully (i.e., without throwing an exception), if any do.
<T> T
AbstractExecutorService.invokeAny(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
Executes the given tasks, returning the result of one that has completed successfully (i.e., without throwing an exception), if any do before the given timeout elapses.
boolean
ArrayBlockingQueue.offer(E e, long timeout, TimeUnit unit)
Inserts the specified element at the tail of this queue, waiting up to the specified wait time for space to become available if the queue is full.
E
ArrayBlockingQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
void
ArrayBlockingQueue.put(E e)
Inserts the specified element at the tail of this queue, waiting for space to become available if the queue is full.
E
ArrayBlockingQueue.take()
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.
boolean
BlockingDeque.offer(E e, long timeout, TimeUnit unit)
Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque), waiting up to the specified wait time if necessary for space to become available.
boolean
BlockingDeque.offerFirst(E e, long timeout, TimeUnit unit)
Inserts the specified element at the front of this deque, waiting up to the specified wait time if necessary for space to become available.
boolean
BlockingDeque.offerLast(E e, long timeout, TimeUnit unit)
Inserts the specified element at the end of this deque, waiting up to the specified wait time if necessary for space to become available.
E
BlockingDeque.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), waiting up to the specified wait time if necessary for an element to become available.
E
BlockingDeque.pollFirst(long timeout, TimeUnit unit)
Retrieves and removes the first element of this deque, waiting up to the specified wait time if necessary for an element to become available.
E
BlockingDeque.pollLast(long timeout, TimeUnit unit)
Retrieves and removes the last element of this deque, waiting up to the specified wait time if necessary for an element to become available.
void
BlockingDeque.put(E e)
Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque), waiting if necessary for space to become available.
void
BlockingDeque.putFirst(E e)
Inserts the specified element at the front of this deque, waiting if necessary for space to become available.
void
BlockingDeque.putLast(E e)
Inserts the specified element at the end of this deque, waiting if necessary for space to become available.
E
BlockingDeque.take()
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), waiting if necessary until an element becomes available.
E
BlockingDeque.takeFirst()
Retrieves and removes the first element of this deque, waiting if necessary until an element becomes available.
E
BlockingDeque.takeLast()
Retrieves and removes the last element of this deque, waiting if necessary until an element becomes available.
boolean
BlockingQueue.offer(E e, long timeout, TimeUnit unit)
Inserts the specified element into this queue, waiting up to the specified wait time if necessary for space to become available.
E
BlockingQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
void
BlockingQueue.put(E e)
Inserts the specified element into this queue, waiting if necessary for space to become available.
E
BlockingQueue.take()
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.
T
CompletableFuture.get()
Waits if necessary for this future to complete, and then returns its result.
T
CompletableFuture.get(long timeout, TimeUnit unit)
Waits if necessary for at most the given time for this future to complete, and then returns its result, if available.
Future<V>
CompletionService.poll(long timeout, TimeUnit unit)
Retrieves and removes the Future representing the next completed task, waiting if necessary up to the specified wait time if none are yet present.
Future<V>
CompletionService.take()
Retrieves and removes the Future representing the next completed task, waiting if none are yet present.
void
CountDownLatch.await()
Causes the current thread to wait until the latch has counted down to zero, unless the thread is interrupted.
boolean
CountDownLatch.await(long timeout, TimeUnit unit)
Causes the current thread to wait until the latch has counted down to zero, unless the thread is interrupted, or the specified waiting time elapses.
int
CyclicBarrier.await()
Waits until all parties have invoked await on this barrier.
int
CyclicBarrier.await(long timeout, TimeUnit unit)
Waits until all parties have invoked await on this barrier, or the specified waiting time elapses.
E
DelayQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting if necessary until an element with an expired delay is available on this queue, or the specified wait time expires.
E
DelayQueue.take()
Retrieves and removes the head of this queue, waiting if necessary until an element with an expired delay is available on this queue.
V
Exchanger.exchange(V x)
Waits for another thread to arrive at this exchange point (unless the current thread is interrupted), and then transfers the given object to it, receiving its object in return.
V
Exchanger.exchange(V x, long timeout, TimeUnit unit)
Waits for another thread to arrive at this exchange point (unless the current thread is interrupted or the specified waiting time elapses), and then transfers the given object to it, receiving its object in return.
Future<V>
ExecutorCompletionService.poll(long timeout, TimeUnit unit)
Retrieves and removes the Future representing the next completed task, waiting if necessary up to the specified wait time if none are yet present.
Future<V>
ExecutorCompletionService.take()
Retrieves and removes the Future representing the next completed task, waiting if none are yet present.
boolean
ExecutorService.awaitTermination(long timeout, TimeUnit unit)
Blocks until all tasks have completed execution after a shutdown request, or the timeout occurs, or the current thread is interrupted, whichever happens first.
<T> List<Future<T>>
ExecutorService.invokeAll(Collection<? extends Callable<T>> tasks)
Executes the given tasks, returning a list of Futures holding their status and results when all complete.
<T> List<Future<T>>
ExecutorService.invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
Executes the given tasks, returning a list of Futures holding their status and results when all complete or the timeout expires, whichever happens first.
<T> T
ExecutorService.invokeAny(Collection<? extends Callable<T>> tasks)
Executes the given tasks, returning the result of one that has completed successfully (i.e., without throwing an exception), if any do.
<T> T
ExecutorService.invokeAny(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
Executes the given tasks, returning the result of one that has completed successfully (i.e., without throwing an exception), if any do before the given timeout elapses.
boolean
ForkJoinPool.awaitTermination(long timeout, TimeUnit unit)
Blocks until all tasks have completed execution after a shutdown request, or the timeout occurs, or the current thread is interrupted, whichever happens first.
<T> List<Future<T>>
ForkJoinPool.invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
Executes the given tasks, returning a list of Futures holding their status and results when all complete or the timeout expires, whichever happens first.
<T> T
ForkJoinPool.invokeAny(Collection<? extends Callable<T>> tasks)
Executes the given tasks, returning the result of one that has completed successfully (i.e., without throwing an exception), if any do.
<T> T
ForkJoinPool.invokeAny(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
Executes the given tasks, returning the result of one that has completed successfully (i.e., without throwing an exception), if any do before the given timeout elapses.
static void
ForkJoinPool.managedBlock(ForkJoinPool.ManagedBlocker blocker)
Runs the given possibly blocking task.
boolean
ForkJoinPool.ManagedBlocker.block()
Possibly blocks the current thread, for example waiting for a lock or condition.
final V
ForkJoinTask.get()
Waits if necessary for the computation to complete, and then retrieves its result.
final V
ForkJoinTask.get(long timeout, TimeUnit unit)
Waits if necessary for at most the given time for the computation to complete, and then retrieves its result, if available.
V
Future.get()
Waits if necessary for the computation to complete, and then retrieves its result.
V
Future.get(long timeout, TimeUnit unit)
Waits if necessary for at most the given time for the computation to complete, and then retrieves its result, if available.
V
FutureTask.get()
Waits if necessary for the computation to complete, and then retrieves its result.
V
FutureTask.get(long timeout, TimeUnit unit)
Waits if necessary for at most the given time for the computation to complete, and then retrieves its result, if available.
boolean
LinkedBlockingDeque.offer(E e, long timeout, TimeUnit unit)
Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque), waiting up to the specified wait time if necessary for space to become available.
boolean
LinkedBlockingDeque.offerFirst(E e, long timeout, TimeUnit unit)
Inserts the specified element at the front of this deque, waiting up to the specified wait time if necessary for space to become available.
boolean
LinkedBlockingDeque.offerLast(E e, long timeout, TimeUnit unit)
Inserts the specified element at the end of this deque, waiting up to the specified wait time if necessary for space to become available.
E
LinkedBlockingDeque.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), waiting up to the specified wait time if necessary for an element to become available.
E
LinkedBlockingDeque.pollFirst(long timeout, TimeUnit unit)
Retrieves and removes the first element of this deque, waiting up to the specified wait time if necessary for an element to become available.
E
LinkedBlockingDeque.pollLast(long timeout, TimeUnit unit)
Retrieves and removes the last element of this deque, waiting up to the specified wait time if necessary for an element to become available.
void
LinkedBlockingDeque.put(E e)
Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque), waiting if necessary for space to become available.
void
LinkedBlockingDeque.putFirst(E e)
Inserts the specified element at the front of this deque, waiting if necessary for space to become available.
void
LinkedBlockingDeque.putLast(E e)
Inserts the specified element at the end of this deque, waiting if necessary for space to become available.
E
LinkedBlockingDeque.take()
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), waiting if necessary until an element becomes available.
E
LinkedBlockingDeque.takeFirst()
Retrieves and removes the first element of this deque, waiting if necessary until an element becomes available.
E
LinkedBlockingDeque.takeLast()
Retrieves and removes the last element of this deque, waiting if necessary until an element becomes available.
boolean
LinkedBlockingQueue.offer(E e, long timeout, TimeUnit unit)
Inserts the specified element at the tail of this queue, waiting if necessary up to the specified wait time for space to become available.
E
LinkedBlockingQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
void
LinkedBlockingQueue.put(E e)
Inserts the specified element at the tail of this queue, waiting if necessary for space to become available.
E
LinkedBlockingQueue.take()
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.
E
LinkedTransferQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
E
LinkedTransferQueue.take()
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.
void
LinkedTransferQueue.transfer(E e)
Transfers the element to a consumer, waiting if necessary to do so.
boolean
LinkedTransferQueue.tryTransfer(E e, long timeout, TimeUnit unit)
Transfers the element to a consumer if it is possible to do so before the timeout elapses.
int
Phaser.awaitAdvanceInterruptibly(int phase)
Awaits the phase of this phaser to advance from the given phase value, throwing InterruptedException if interrupted while waiting, or returning immediately if the current phase is not equal to the given phase value or this phaser is terminated.
int
Phaser.awaitAdvanceInterruptibly(int phase, long timeout, TimeUnit unit)
Awaits the phase of this phaser to advance from the given phase value or the given timeout to elapse, throwing InterruptedException if interrupted while waiting, or returning immediately if the current phase is not equal to the given phase value or this phaser is terminated.
E
PriorityBlockingQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
E
PriorityBlockingQueue.take()
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.
void
Semaphore.acquire()
Acquires a permit from this semaphore, blocking until one is available, or the thread is interrupted.
void
Semaphore.acquire(int permits)
Acquires the given number of permits from this semaphore, blocking until all are available, or the thread is interrupted.
boolean
Semaphore.tryAcquire(int permits, long timeout, TimeUnit unit)
Acquires the given number of permits from this semaphore, if all become available within the given waiting time and the current thread has not been interrupted.
boolean
Semaphore.tryAcquire(long timeout, TimeUnit unit)
Acquires a permit from this semaphore, if one becomes available within the given waiting time and the current thread has not been interrupted.
boolean
SynchronousQueue.offer(E e, long timeout, TimeUnit unit)
Inserts the specified element into this queue, waiting if necessary up to the specified wait time for another thread to receive it.
E
SynchronousQueue.poll(long timeout, TimeUnit unit)
Retrieves and removes the head of this queue, waiting if necessary up to the specified wait time, for another thread to insert it.
void
SynchronousQueue.put(E e)
Adds the specified element to this queue, waiting if necessary for another thread to receive it.
E
SynchronousQueue.take()
Retrieves and removes the head of this queue, waiting if necessary for another thread to insert it.
boolean
ThreadPoolExecutor.awaitTermination(long timeout, TimeUnit unit)
Blocks until all tasks have completed execution after a shutdown request, or the timeout occurs, or the current thread is interrupted, whichever happens first.
void
TimeUnit.sleep(long timeout)
Performs a Thread.sleep using this time unit.
void
TimeUnit.timedJoin(Thread thread, long timeout)
Performs a timed Thread.join using this time unit.
void
TimeUnit.timedWait(Object obj, long timeout)
Performs a timed Object.wait using this time unit.
void
TransferQueue.transfer(E e)
Transfers the element to a consumer, waiting if necessary to do so.
boolean
TransferQueue.tryTransfer(E e, long timeout, TimeUnit unit)
Transfers the element to a consumer if it is possible to do so before the timeout elapses.
Overview 
Module 
Package 
Class 
 Use 
Tree 
Deprecated 
Index 
Help 
PREV   NEXT      All Classes   All Packages
FRAMES    NO FRAMES
FlexDoc/Javadoc 2.0
Demo Java Doc
Java API documentation generated with FlexDoc/Javadoc 2.0 using JavadocClassic 3.0 template set.
FlexDoc/Javadoc is a template-driven programming tool for rapid development of any Javadoc-based Java API documentation generators (i.e. doclets). If you need to customize your Javadoc without writing a full-blown doclet from scratch, FlexDoc/Javadoc may be the only tool able to help you! Find out more at www.flexdoc.xyz