/libcore/ojluni/src/main/java/java/nio/file/ |
H A D | WatchService.java | 43 * {@link #poll() poll} or {@link #take() take} methods to retrieve keys 113 * <p> If a thread is currently blocked in the {@link #take take} or {@link 173 WatchKey take() throws InterruptedException; method in interface:WatchService
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | CompletionService.java | 41 * {@code submit} tasks for execution. Consumers {@code take} 59 * actions following a successful return from the corresponding {@code take()}. 98 Future<V> take() throws InterruptedException; method in interface:CompletionService
|
H A D | BlockingQueue.java | 81 * <td>{@link #take take()}</td> 152 * while (true) { consume(queue.take()); } 263 E take() throws InterruptedException; method in interface:BlockingQueue
|
H A D | ExecutorCompletionService.java | 41 * upon completion, placed on a queue accessible using {@code take}. 65 * Result r = ecs.take().get(); 89 * Result r = ecs.take().get(); 194 public Future<V> take() throws InterruptedException { method in class:ExecutorCompletionService 195 return completionQueue.take();
|
H A D | BlockingDeque.java | 172 * <td>{@link #take() take()}</td> 550 E take() throws InterruptedException; method in interface:BlockingDeque
|
H A D | ArrayBlockingQueue.java | 67 * will result in the operation blocking; attempts to {@code take} an 99 /** items index for next take, poll, peek or remove */ 161 * Extracts element at current take position, advances, and signals. 382 public E take() throws InterruptedException { method in class:ArrayBlockingQueue 676 int take = takeIndex; 681 E x = (E) items[take]; 683 items[take] = null; 684 if (++take == items.length) take = 0; 692 takeIndex = take; [all...] |
H A D | AbstractExecutorService.java | 194 f = ecs.take();
|
H A D | DelayQueue.java | 61 * removed using {@code take} or {@code poll}, they are otherwise 89 * signal some other thread before returning from take() or 209 public E take() throws InterruptedException { method in class:DelayQueue
|
H A D | LinkedBlockingQueue.java | 91 * used. When a put notices that it has enabled at least one take, 154 /** Lock held by take, poll, etc */ 167 * Signals a waiting take. Called only from put/offer (which do not 181 * Signals a waiting put. Called only from take/poll. 333 // Note: convention in all put/take/etc is to preset local var 434 public E take() throws InterruptedException { method in class:LinkedBlockingQueue 760 * still have it to return even if lost race with a take etc.
|
H A D | PriorityBlockingQueue.java | 542 public E take() throws InterruptedException { method in class:PriorityBlockingQueue
|
H A D | ScheduledThreadPoolExecutor.java | 888 * signal some other thread before returning from take() or 1085 * Performs common bookkeeping for poll and take: Replaces 1113 public RunnableScheduledFuture<?> take() throws InterruptedException { method in class:ScheduledThreadPoolExecutor.DelayedWorkQueue
|
/libcore/ojluni/src/main/java/sun/nio/fs/ |
H A D | AbstractWatchService.java | 89 // re-queue in case there are other threads blocked in take/poll 114 public final WatchKey take() method in class:AbstractWatchService 118 WatchKey key = pendingKeys.take(); 156 // threads blocked in take/poll wakeup
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ExecutorCompletionServiceTest.java | 99 Future f = ecs.take(); 113 Future f2 = ecs.take(); 182 Future f2 = ecs.take(); 183 assertSame("submit and take must return same objects", f1, f2); 213 Future f2 = ecs.take(); 214 assertSame("submit and take must return same objects", f1, f2);
|
H A D | PriorityBlockingQueueTest.java | 281 * put doesn't block waiting for take 294 q.take(); 314 * take retrieves elements in priority order 319 assertEquals(i, q.take()); 332 assertEquals(i, q.take()); 337 q.take(); 344 q.take(); 549 assertSame(o[i], q.take()); 562 assertSame(ints[i], q.take());
|
H A D | LinkedTransferQueueTest.java | 205 * take retrieves elements in FIFO order 210 assertEquals(i, (int) q.take()); 215 * take removes existing elements until empty, then blocks interruptibly 223 assertEquals(i, q.take()); 228 q.take(); 235 q.take(); 393 assertSame(q.take(), three); 523 assertEquals(it.next(), q.take()); 618 assertSame(one, q.take()); 734 * timed poll() or take() increment [all...] |
H A D | LinkedBlockingQueueTest.java | 301 * put blocks interruptibly waiting for take when full 325 assertEquals(0, q.take()); 361 * take retrieves elements in FIFO order 366 assertEquals(i, q.take()); 379 assertEquals(i, q.take()); 384 q.take(); 391 q.take(); 523 assertNotNull(q.take()); 650 assertEquals(it.next(), q.take()); 744 assertSame(one, q.take()); [all...] |
H A D | ArrayBlockingQueueTest.java | 311 * put blocks interruptibly waiting for take when full 335 assertEquals(0, q.take()); 371 * take retrieves elements in FIFO order 376 assertEquals(i, q.take()); 389 assertEquals(i, q.take()); 394 q.take(); 401 q.take(); 714 assertEquals(it.next(), q.take()); 811 assertSame(one, q.take());
|
H A D | BlockingQueueTest.java | 258 * take() blocks interruptibly when empty 267 q.take(); 280 * take() throws InterruptedException immediately if interrupted 289 q.take();
|
H A D | DelayQueueTest.java | 311 * put doesn't block waiting for take 344 * take retrieves elements in priority order 349 assertEquals(new PDelay(i), q.take()); 362 assertEquals(new PDelay(i), ((PDelay)q.take())); 367 q.take(); 374 q.take(); 593 assertSame(o[i], q.take()); 703 NanoDelay e = q.take();
|
H A D | LinkedBlockingDequeTest.java | 609 * put blocks interruptibly waiting for take when full 633 assertEquals(0, q.take()); 669 * take retrieves elements in FIFO order 674 assertEquals(i, q.take()); 679 * take removes existing elements until empty, then blocks interruptibly 687 assertEquals(i, q.take()); 692 q.take(); 699 q.take(); 839 * putFirst blocks interruptibly waiting for take when full 863 assertEquals(capacity - 1, q.take()); [all...] |
H A D | SynchronousQueueTest.java | 155 * put blocks interruptibly waiting for take 178 try { assertSame(one, q.take()); } 495 assertSame(one, q.take());
|
/libcore/luni/src/test/java/tests/security/ |
H A D | SecureRandomTest.java | 93 ecs.take().get();
|
/libcore/support/src/test/java/tests/http/ |
H A D | MockWebServer.java | 132 return requestQueue.take(); 224 responseQueue.take(); 417 return responseQueue.take();
|
/libcore/ojluni/src/main/java/sun/nio/ch/ |
H A D | EPollPort.java | 262 ev = queue.take();
|
/libcore/luni/src/test/java/libcore/java/nio/channels/ |
H A D | AsynchronousFileChannelTest.java | 677 assertSame(serviceThread.get(), observedThreads.take()); 681 assertSame(serviceThread.get(), observedThreads.take());
|