/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | CompletionService.java | 78 Future<V> poll(); method in interface:CompletionService 94 Future<V> poll(long timeout, TimeUnit unit) throws InterruptedException; method in interface:CompletionService
|
H A D | ExecutorCompletionService.java | 167 public Future<V> poll() { method in class:ExecutorCompletionService 168 return completionQueue.poll(); 171 public Future<V> poll(long timeout, TimeUnit unit) method in class:ExecutorCompletionService 173 return completionQueue.poll(timeout, unit);
|
H A D | BlockingQueue.java | 50 * <td>{@link #poll poll()}</td> 52 * <td>{@link #poll(long, TimeUnit) poll(time, unit)}</td> 67 * {@code poll} operations. 247 E poll(long timeout, TimeUnit unit) method in interface:BlockingQueue
|
H A D | BlockingDeque.java | 132 * <td>{@link #poll() poll()}</td> 140 * <td>{@link #poll(long, TimeUnit) poll(time, unit)}</td> 483 * This method differs from {@link #poll poll} only in that it 502 E poll(); method in interface:BlockingDeque 528 E poll(long timeout, TimeUnit unit) method in interface:BlockingDeque
|
H A D | DelayQueue.java | 22 * past. If no delay has expired there is no head and {@code poll} 26 * removed using {@code take} or {@code poll}, they are otherwise 55 * poll(...), unless some other thread becomes leader in the 154 public E poll() { method in class:DelayQueue 162 return q.poll(); 186 return q.poll(); 219 public E poll(long timeout, TimeUnit unit) throws InterruptedException { method in class:DelayQueue 234 return q.poll(); 263 * {@code poll}, if no expired elements are available in the queue, 318 q.poll(); [all...] |
/libcore/luni/src/main/java/java/util/ |
H A D | Queue.java | 40 * <td>{@link #poll poll()}</td> 56 * {@link #poll()}. In a FIFO queue, all new elements are inserted at 69 * <p>The {@link #remove()} and {@link #poll()} methods remove and 74 * <tt>poll()</tt> methods differ only in their behavior when the 76 * while the <tt>poll()</tt> method returns <tt>null</tt>. 92 * used as a special return value by the <tt>poll</tt> method to 155 * from {@link #poll poll} only in that it throws an exception if this 169 E poll(); method in interface:Queue [all...] |
H A D | AbstractQueue.java | 19 * #poll poll}, and {@link #peek peek}, respectively, but throw 26 * Queue#peek}, {@link Queue#poll}, {@link Collection#size}, and 74 * from {@link #poll poll} only in that it throws an exception if this 77 * <p>This implementation returns the result of <tt>poll</tt> 84 E x = poll(); 114 * <p>This implementation repeatedly invokes {@link #poll poll} until it 118 while (poll() ! [all...] |
H A D | Deque.java | 96 * <td>{@link java.util.Queue#poll poll()}</td> 401 * This method differs from {@link #poll poll} only in that it throws an 421 E poll(); method in interface:Deque
|
H A D | WeakHashMap.java | 174 // cannot poll() as that would change the expectedModCount 261 while (referenceQueue.poll() != null) { 294 poll(); 352 poll(); 413 poll(); 454 poll(); 477 poll(); 509 poll(); 548 void poll() { method in class:WeakHashMap 550 while ((toRemove = (Entry<K, V>) referenceQueue.poll()) ! [all...] |
/libcore/luni/src/main/java/java/lang/ref/ |
H A D | ReferenceQueue.java | 47 public synchronized Reference<? extends T> poll() { method in class:ReferenceQueue 95 return poll(); 103 return poll(); 125 return poll();
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/ref/ |
H A D | ReferenceQueueTest.java | 61 * java.lang.ref.ReferenceQueue#poll() 73 assertNull(rq.poll()); 79 assertTrue("Remove failed.", ((Boolean) rq.poll().get()) 86 assertEquals("Remove failed.", obj, (rq.poll().get())); 92 assertNull("Remove failed.", rq.poll().get()); 97 assertNull(rq.poll()); 104 assertNull(rq.poll()); 124 assertNull(rq.poll()); 151 assertNull(rq.poll()); 159 assertNull("Queue should be empty. (poll)", r [all...] |
H A D | ReferenceTest.java | 117 assertTrue("Not properly enqueued.", rq.poll().get() == obj); 121 && (rq.poll() == null)); 129 assertTrue("Not properly enqueued2.", rq.poll().get() == obj); 133 && (rq.poll() == null)); 138 assertNull("Not properly enqueued3.", rq.poll().get()); 142 && (rq.poll() == null)); 163 ref = queue.poll(); 272 rq.poll();
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | LinkedTransferQueueTest.java | 100 assertEquals(ints[i], q.poll()); 161 assertEquals(ints[i], q.poll()); 221 * poll succeeds unless empty 226 assertEquals(i, (int) q.poll()); 228 assertNull(q.poll()); 233 * timed poll with zero timeout succeeds when non-empty, else times out 238 assertEquals(i, (int) q.poll(0, MILLISECONDS)); 240 assertNull(q.poll(0, MILLISECONDS)); 245 * timed poll with nonzero timeout succeeds when non-empty, else times out 251 assertEquals(i, (int) q.poll(LONG_DELAY_M [all...] |
H A D | PriorityBlockingQueueTest.java | 116 assertEquals(ints[i], q.poll()); 131 assertEquals(ints[i], q.poll()); 238 assertEquals(ints[i], q.poll()); 331 * poll succeeds unless empty 336 assertEquals(i, q.poll()); 338 assertNull(q.poll()); 342 * timed poll with zero timeout succeeds when non-empty, else times out 347 assertEquals(i, q.poll(0, MILLISECONDS)); 349 assertNull(q.poll(0, MILLISECONDS)); 353 * timed poll wit [all...] |
H A D | ExecutorCompletionServiceTest.java | 115 * If poll returns non-null, the returned task is completed 121 assertNull(ecs.poll()); 127 while ((f = ecs.poll()) == null) { 140 * If timed poll returns non-null, the returned task is completed 146 assertNull(ecs.poll()); 149 Future f = ecs.poll(SHORT_DELAY_MS, MILLISECONDS); 176 assertNull(ecs.poll()); 208 assertNull(ecs.poll());
|
H A D | PriorityQueueTest.java | 104 assertEquals(ints[i], q.poll()); 119 assertEquals(ints[i], q.poll()); 256 assertEquals(new Integer(i), q.poll()); 260 * poll succeeds unless empty 265 assertEquals(i, q.poll()); 267 assertNull(q.poll()); 277 assertEquals(i, q.poll()); 291 assertEquals(i, q.poll()); 341 q.poll(); 417 assertSame(o[i], q.poll()); [all...] |
H A D | BlockingQueueTest.java | 194 assertSame(one, q.poll()); 200 * timed poll before a delayed offer times out; after offer succeeds; 210 assertNull(q.poll(timeoutMillis(), MILLISECONDS)); 215 assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); 219 q.poll(LONG_DELAY_MS, MILLISECONDS); 226 q.poll(LONG_DELAY_MS, MILLISECONDS); 285 * timed poll() blocks interruptibly when empty 294 q.poll(2 * LONG_DELAY_MS, MILLISECONDS); 307 * timed poll() throws InterruptedException immediately if 316 q.poll( [all...] |
H A D | ConcurrentLinkedQueueTest.java | 85 assertEquals(ints[i], q.poll()); 220 assertEquals(ints[i], q.poll()); 224 * poll succeeds unless empty 229 assertEquals(i, q.poll()); 231 assertNull(q.poll()); 241 assertEquals(i, q.poll()); 255 assertEquals(i, q.poll()); 305 q.poll(); 380 assertSame(o[i], q.poll()); 392 assertSame(ints[i], q.poll()); [all...] |
H A D | ArrayBlockingQueueTest.java | 118 assertEquals(ints[i], q.poll()); 229 assertEquals(ints[i], q.poll()); 385 * poll succeeds unless empty 390 assertEquals(i, q.poll()); 392 assertNull(q.poll()); 396 * timed poll with zero timeout succeeds when non-empty, else times out 401 assertEquals(i, q.poll(0, MILLISECONDS)); 403 assertNull(q.poll(0, MILLISECONDS)); 408 * timed poll with nonzero timeout succeeds when non-empty, else times out 414 assertEquals(i, q.poll(LONG_DELAY_M [all...] |
H A D | AbstractQueueTest.java | 25 public Integer poll() { return one; } method in class:AbstractQueueTest.Succeed 36 public Integer poll() { return null; } method in class:AbstractQueueTest.Fail 72 * remove returns normally if poll succeeds 80 * remove throws NSEE if poll returns null
|
H A D | DelayQueueTest.java | 178 assertEquals(ints[i], q.poll()); 272 assertEquals(ints[i], q.poll()); 365 * poll succeeds unless empty 370 assertEquals(new PDelay(i), ((PDelay)q.poll())); 372 assertNull(q.poll()); 376 * timed poll with zero timeout succeeds when non-empty, else times out 381 assertEquals(new PDelay(i), ((PDelay)q.poll(0, MILLISECONDS))); 383 assertNull(q.poll(0, MILLISECONDS)); 387 * timed poll with nonzero timeout succeeds when non-empty, else times out 393 assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_M [all...] |
H A D | LinkedBlockingQueueTest.java | 107 assertEquals(ints[i], q.poll()); 219 assertEquals(ints[i], q.poll()); 375 * poll succeeds unless empty 380 assertEquals(i, q.poll()); 382 assertNull(q.poll()); 386 * timed poll with zero timeout succeeds when non-empty, else times out 391 assertEquals(i, q.poll(0, MILLISECONDS)); 393 assertNull(q.poll(0, MILLISECONDS)); 397 * timed poll with nonzero timeout succeeds when non-empty, else times out 403 assertEquals(i, (int) q.poll(LONG_DELAY_M [all...] |
H A D | LinkedListTest.java | 60 assertEquals(ints[i], q.poll()); 143 assertEquals(ints[i], q.poll()); 175 * poll succeeds unless empty 180 assertEquals(i, q.poll()); 182 assertNull(q.poll()); 192 assertEquals(i, q.poll()); 206 assertEquals(i, q.poll()); 256 q.poll(); 331 assertSame(o[i], q.poll()); 343 assertSame(ints[i], q.poll()); [all...] |
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | OldPriorityQueueTest.java | 118 assertEquals(i, (int) q.poll()); 120 assertNull(q.poll());
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | PriorityQueueTest.java | 133 assertEquals(newArray[i], integerQueue.poll()); 274 assertEquals(array[i], integerQueue.poll()); 323 assertEquals(queue.poll(), constructedQueue.poll()); 342 assertEquals(iter.next(), queue.poll()); 363 assertEquals(array[i], objectQueue.poll()); 392 assertEquals(iter.next(), queue.poll()); 420 assertEquals(sortedArray[i], queue.poll()); 423 assertNull(queue.poll()); 463 * java.util.PriorityQueue#poll() [all...] |