Searched defs:take (Results 1 - 12 of 12) sorted by relevance

/libcore/luni/src/main/java/java/util/concurrent/
H A DCompletionService.java12 * <tt>submit</tt> tasks for execution. Consumers <tt>take</tt>
30 * actions following a successful return from the corresponding {@code take()}.
70 Future<V> take() throws InterruptedException; method in interface:CompletionService
H A DBlockingQueue.java51 * <td>{@link #take take()}</td>
122 * while (true) { consume(queue.take()); }
233 E take() throws InterruptedException; method in interface:BlockingQueue
H A DExecutorCompletionService.java12 * upon completion, placed on a queue accessible using {@code take}.
36 * Result r = ecs.take().get();
61 * Result r = ecs.take().get();
163 public Future<V> take() throws InterruptedException { method in class:ExecutorCompletionService
164 return completionQueue.take();
H A DBlockingDeque.java136 * <td>{@link #take() take()}</td>
514 E take() throws InterruptedException; method in interface:BlockingDeque
H A DDelayQueue.java27 * removed using <tt>take</tt> or <tt>poll</tt>, they are otherwise
56 * signal some other thread before returning from take() or
177 public E take() throws InterruptedException { method in class:DelayQueue
H A DLinkedBlockingQueue.java60 * used. When a put notices that it has enabled at least one take,
123 /** Lock held by take, poll, etc */
136 * Signals a waiting take. Called only from put/offer (which do not
150 * Signals a waiting put. Called only from take/poll.
303 // Note: convention in all put/take/etc is to preset local var
405 public E take() throws InterruptedException { method in class:LinkedBlockingQueue
757 * still have it to return even if lost race with a take etc.
H A DPriorityBlockingQueue.java499 public E take() throws InterruptedException { method in class:PriorityBlockingQueue
H A DLinkedBlockingDeque.java648 public E take() throws InterruptedException { method in class:LinkedBlockingDeque
H A DArrayBlockingQueue.java33 * will result in the operation blocking; attempts to {@code take} an
65 /** items index for next take, poll, peek or remove */
143 * Extracts element at current take position, advances, and signals.
367 public E take() throws InterruptedException { method in class:ArrayBlockingQueue
673 int take = takeIndex;
677 @SuppressWarnings("unchecked") E x = (E) items[take];
679 items[take] = null;
680 take = inc(take);
688 takeIndex = take;
[all...]
H A DLinkedTransferQueue.java194 * (We also take similar care to wipe out possibly garbage
247 * of offer, put, poll, take, or transfer (each possibly with
347 * the list because of an untimed call to take at the front of the
557 private static final int SYNC = 2; // for transfer, take
569 * @param e the item or null for take
570 * @param haveData true if this is a put, else a take
1059 * {@link #take} or timed {@link #poll(long,TimeUnit) poll}),
1073 * {@link #take} or timed {@link #poll(long,TimeUnit) poll}),
1092 * {@link #take} or timed {@link #poll(long,TimeUnit) poll}),
1109 public E take() throw method in class:LinkedTransferQueue
[all...]
H A DScheduledThreadPoolExecutor.java819 * signal some other thread before returning from take() or
1016 * Performs common bookkeeping for poll and take: Replaces
1045 public RunnableScheduledFuture<?> take() throws InterruptedException { method in class:ScheduledThreadPoolExecutor.DelayedWorkQueue
H A DSynchronousQueue.java71 * or "requests" -- slots representing take operations, or is
80 * take. These are unified into a single method because in dual
81 * data structures, the put and take operations are symmetrical,
138 * Performs a put or take.
502 * from non-null to null (for put) or vice versa (for take).
613 /* Basic algorithm is to loop trying to take either of
893 public E take() throws InterruptedException { method in class:SynchronousQueue

Completed in 132 milliseconds