/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
H A D | CompletionService.java | 80 Future<V> poll(); method in interface:CompletionService 96 Future<V> poll(long timeout, TimeUnit unit) throws InterruptedException; method in interface:CompletionService
|
H A D | ExecutorCompletionService.java | 161 public Future<V> poll() { method in class:ExecutorCompletionService 162 return completionQueue.poll(); 165 public Future<V> poll(long timeout, TimeUnit unit) throws InterruptedException { method in class:ExecutorCompletionService 166 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 * <tt>poll</tt> operations. 248 E poll(long timeout, TimeUnit unit) method in interface:BlockingQueue
|
H A D | DelayQueue.java | 21 * past. If no delay has expired there is no head and <tt>poll</tt> 25 * removed using <tt>take</tt> or <tt>poll</tt>, they are otherwise 53 * poll(...), unless some other thread becomes leader in the 152 public E poll() { method in class:DelayQueue 160 return q.poll(); 184 return q.poll(); 216 public E poll(long timeout, TimeUnit unit) throws InterruptedException { method in class:DelayQueue 231 return q.poll(); 259 * <tt>poll</tt>, if no expired elements are available in the queue, 305 c.add(q.poll()); [all...] |
H A D | PriorityBlockingQueue.java | 204 public E poll() { method in class:PriorityBlockingQueue 208 return q.poll(); 225 E x = q.poll(); 233 public E poll(long timeout, TimeUnit unit) throws InterruptedException { method in class:PriorityBlockingQueue 239 E x = q.poll(); 387 while ( (e = q.poll()) != null) { 415 while (n < maxElements && (e = q.poll()) != null) {
|
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/platform/ |
H A D | RuntimeMemorySpy.java | 29 Reference ref = notifyQueue.poll(); // non-blocking check 32 ref = notifyQueue.poll();
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | Queue.java | 31 * {@code poll} returns {@code null} to indicate that there is no element left 61 public E poll(); method in interface:Queue
|
H A D | AbstractQueue.java | 22 * {@code element} are based on {@code offer, poll}, and {@code peek} except 95 E o = poll(); 124 o = poll();
|
H A D | WeakHashMap.java | 174 // cannot poll() as that would change the expectedModCount 260 while (referenceQueue.poll() != null) { 293 poll(); 351 poll(); 432 poll(); 473 poll(); 496 poll(); 528 poll(); 567 void poll() { method in class:WeakHashMap 569 while ((toRemove = (Entry<K, V>) referenceQueue.poll()) ! [all...] |
/dalvik/libcore/luni/src/test/java/tests/api/java/lang/ref/ |
H A D | ReferenceQueueTest.java | 66 * @tests java.lang.ref.ReferenceQueue#poll() 71 method = "poll", 84 assertNull(rq.poll()); 90 assertNull("Remove failed.", rq.poll().get()); 96 assertEquals("Remove failed.", obj, (rq.poll().get())); 102 assertTrue("Remove failed.", ((Boolean) rq.poll().get()) 107 assertNull(rq.poll()); 115 assertNull(rq.poll()); 141 assertNull(rq.poll()); 168 assertNull(rq.poll()); [all...] |
H A D | ReferenceTest.java | 144 assertTrue("Not properly enqueued.", rq.poll().get() == obj); 148 && (rq.poll() == null)); 156 assertTrue("Not properly enqueued2.", rq.poll().get() == obj); 160 && (rq.poll() == null)); 165 assertNull("Not properly enqueued3.", rq.poll().get()); 169 && (rq.poll() == null)); 231 ref = rq.poll(); 378 rq.poll();
|
H A D | SoftReferenceTest.java | 159 ref = rq.poll();
|
/dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
H A D | ExecutorCompletionServiceTest.java | 119 * If poll returns non-null, the returned task is completed 125 assertNull(ecs.poll()); 130 Future f = ecs.poll(); 144 * If timed poll returns non-null, the returned task is completed 150 assertNull(ecs.poll()); 153 Future f = ecs.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS);
|
H A D | PriorityQueueTest.java | 115 assertEquals(ints[i], q.poll()); 133 assertEquals(ints[i], q.poll()); 275 assertEquals(new Integer(i), q.poll()); 281 * poll succeeds unless empty 286 assertEquals(i, ((Integer)q.poll()).intValue()); 288 assertNull(q.poll()); 298 q.poll(); 312 q.poll(); 358 q.poll(); 434 assertEquals(o[i], q.poll()); [all...] |
H A D | SynchronousQueueTest.java | 378 * poll fails unless active taker 382 assertNull(q.poll()); 391 assertNull(q.poll(0, TimeUnit.MILLISECONDS)); 403 assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); 410 * Interrupted timed poll throws InterruptedException instead of 418 assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); 434 * timed poll before a delayed offer fails; after offer succeeds; 442 threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); 443 q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); 444 q.poll(LONG_DELAY_M [all...] |
H A D | ConcurrentLinkedQueueTest.java | 94 assertEquals(ints[i], q.poll()); 236 assertEquals(ints[i], q.poll()); 242 * poll succeeds unless empty 247 assertEquals(i, ((Integer)q.poll()).intValue()); 249 assertNull(q.poll()); 259 q.poll(); 273 q.poll(); 319 q.poll(); 395 assertEquals(o[i], q.poll()); 407 assertEquals(ints[i], q.poll()); [all...] |
H A D | LinkedListTest.java | 67 assertEquals(ints[i], q.poll()); 158 assertEquals(ints[i], q.poll()); 192 * poll succeeds unless empty 197 assertEquals(i, ((Integer)q.poll()).intValue()); 199 assertNull(q.poll()); 209 q.poll(); 223 q.poll(); 269 q.poll(); 345 assertEquals(o[i], q.poll()); 357 assertEquals(ints[i], q.poll()); [all...] |
H A D | DelayQueueTest.java | 188 assertEquals(ints[i], q.poll()); 334 assertEquals(ints[i], q.poll()); 494 * poll succeeds unless empty 499 assertEquals(new PDelay(i), ((PDelay)q.poll())); 501 assertNull(q.poll()); 511 assertEquals(new PDelay(i), ((PDelay)q.poll(0, TimeUnit.MILLISECONDS))); 513 assertNull(q.poll(0, TimeUnit.MILLISECONDS)); 526 assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS))); 528 assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); 535 * Interrupted timed poll throw [all...] |
H A D | PriorityBlockingQueueTest.java | 119 assertEquals(ints[i], q.poll()); 137 assertEquals(ints[i], q.poll()); 296 assertEquals(ints[i], q.poll()); 456 * poll succeeds unless empty 461 assertEquals(i, ((Integer)q.poll()).intValue()); 463 assertNull(q.poll()); 473 assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue()); 475 assertNull(q.poll(0, TimeUnit.MILLISECONDS)); 488 assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); 490 assertNull(q.poll(SHORT_DELAY_M [all...] |
H A D | ArrayBlockingQueueTest.java | 118 assertEquals(ints[i], q.poll()); 280 assertEquals(ints[i], q.poll()); 476 * poll succeeds unless empty 481 assertEquals(i, ((Integer)q.poll()).intValue()); 483 assertNull(q.poll()); 493 assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue()); 495 assertNull(q.poll(0, TimeUnit.MILLISECONDS)); 508 assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); 510 assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); 517 * Interrupted timed poll throw [all...] |
H A D | LinkedBlockingQueueTest.java | 109 assertEquals(ints[i], q.poll()); 270 assertEquals(ints[i], q.poll()); 466 * poll succeeds unless empty 471 assertEquals(i, ((Integer)q.poll()).intValue()); 473 assertNull(q.poll()); 483 assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue()); 485 assertNull(q.poll(0, TimeUnit.MILLISECONDS)); 498 assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); 500 assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); 507 * Interrupted timed poll throw [all...] |
H A D | AbstractQueueTest.java | 31 public Integer poll() { return one; } method in class:AbstractQueueTest.Succeed 42 public Integer poll() { return null; } method in class:AbstractQueueTest.Fail 80 * remove returns normally if poll succeeds 88 * remove throws NSEE if poll returns null
|
/dalvik/libcore/luni/src/main/java/java/lang/ref/ |
H A D | ReferenceQueue.java | 50 public synchronized Reference<? extends T> poll() { method in class:ReferenceQueue 118 return poll();
|
/dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
H A D | PriorityQueueTest.java | 164 assertEquals(newArray[i], integerQueue.poll()); 349 assertEquals(array[i], integerQueue.poll()); 416 assertEquals(queue.poll(), constructedQueue.poll()); 441 assertEquals(iter.next(), queue.poll()); 468 assertEquals(array[i], objectQueue.poll()); 516 assertEquals(iter.next(), queue.poll()); 556 assertEquals(sortedArray[i], queue.poll()); 559 assertNull(queue.poll()); 611 * @tests java.util.PriorityQueue#poll() [all...] |
/dalvik/libcore/luni-kernel/src/main/java/java/lang/ |
H A D | ProcessManager.java | 107 while ((reference = referenceQueue.poll()) != null) { 342 public ProcessReference poll() { method in class:ProcessManager.ProcessReferenceQueue 344 Object reference = super.poll();
|