Searched refs:pollFirst (Results 1 - 23 of 23) sorted by relevance

/libcore/luni/src/main/java/java/util/
H A DDeque.java58 * <td>{@link #pollFirst pollFirst()}</td>
97 * <td>{@link #pollFirst pollFirst()}</td>
242 * differs from {@link #pollFirst pollFirst} only in that it throws an
266 E pollFirst(); method in interface:Deque
416 * <p>This method is equivalent to {@link #pollFirst()}.
H A DNavigableSet.java25 * {@code pollFirst} and {@code pollLast} that return and remove the
120 E pollFirst(); method in interface:NavigableSet
H A DArrayDeque.java185 // addLast, pollFirst, pollLast. The other methods are defined in
246 E x = pollFirst();
262 public E pollFirst() { method in class:ArrayDeque
421 * <p>This method is equivalent to {@link #pollFirst}.
427 return pollFirst();
H A DTreeSet.java278 * @see java.util.NavigableSet#pollFirst()
281 public E pollFirst() { method in class:TreeSet
H A DLinkedList.java770 * @see java.util.Deque#pollFirst()
773 public E pollFirst() { method in class:LinkedList
H A DTreeMap.java1016 public K pollFirst() { method in class:TreeMap.KeySet
1576 public K pollFirst() { method in class:TreeMap.BoundedMap.BoundedKeySet
H A DCollections.java2783 return q.pollFirst();
/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListSubSetTest.java119 q.pollFirst();
120 q.pollFirst();
131 q.pollFirst();
229 assertEquals(new Integer(i), q.pollFirst());
238 assertEquals(i, q.pollFirst());
240 assertNull(q.pollFirst());
271 q.pollFirst();
319 p.pollFirst();
333 Integer x = (Integer)(p.pollFirst());
418 assertSame(o[i], q.pollFirst());
[all...]
H A DTreeSubSetTest.java116 q.pollFirst();
117 q.pollFirst();
128 q.pollFirst();
226 assertEquals(new Integer(i), q.pollFirst());
235 assertEquals(i, q.pollFirst());
237 assertNull(q.pollFirst());
268 q.pollFirst();
316 p.pollFirst();
330 Integer x = (Integer)(p.pollFirst());
415 assertSame(o[i], q.pollFirst());
[all...]
H A DConcurrentSkipListSetTest.java123 assertEquals(ints[i], q.pollFirst());
138 assertEquals(ints[i], q.pollFirst());
150 q.pollFirst();
151 q.pollFirst();
162 q.pollFirst();
261 assertEquals(i, q.pollFirst());
265 * pollFirst succeeds unless empty
270 assertEquals(i, q.pollFirst());
272 assertNull(q.pollFirst());
283 assertNull(q.pollFirst());
[all...]
H A DTreeSetTest.java127 assertEquals(ints[i], q.pollFirst());
142 assertEquals(ints[i], q.pollFirst());
154 q.pollFirst();
155 q.pollFirst();
166 q.pollFirst();
265 assertEquals(new Integer(i), q.pollFirst());
269 * pollFirst succeeds unless empty
274 assertEquals(i, q.pollFirst());
276 assertNull(q.pollFirst());
287 assertNull(q.pollFirst());
[all...]
H A DLinkedBlockingDequeTest.java140 * pollFirst succeeds unless empty
145 assertEquals(i, q.pollFirst());
147 assertNull(q.pollFirst());
168 assertEquals(i, q.pollFirst());
182 assertEquals(i, q.pollFirst());
210 assertEquals(i, q.pollFirst());
1027 * timed pollFirst with zero timeout succeeds when non-empty, else times out
1032 assertEquals(i, q.pollFirst(0, MILLISECONDS));
1034 assertNull(q.pollFirst(0, MILLISECONDS));
1038 * timed pollFirst wit
[all...]
H A DArrayDequeTest.java96 assertEquals(ints[i], q.pollFirst());
345 assertEquals(ints[i], q.pollFirst());
349 * pollFirst() succeeds unless empty
354 assertEquals(i, q.pollFirst());
356 assertNull(q.pollFirst());
423 assertEquals(i, q.pollFirst());
480 assertEquals(i, q.pollFirst());
571 assertEquals(i, q.pollFirst());
H A DConcurrentLinkedDequeTest.java364 * pollFirst() succeeds unless empty
369 assertEquals(i, q.pollFirst());
371 assertNull(q.pollFirst());
467 assertEquals(i, q.pollFirst());
495 assertEquals(i, q.pollFirst());
H A DLinkedListTest.java565 assertEquals(i, q.pollFirst());
590 assertEquals(i, q.pollFirst());
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DArrayDequeTest.java230 * {@link java.util.ArrayDeque#pollFirst()}
237 assertEquals(testObjOne, testQue.pollFirst());
239 assertEquals(testObjTwo, testQue.pollFirst());
240 assertEquals(testObjThree, testQue.pollFirst());
242 assertNull(testQue.pollFirst());
258 assertNull(testQue.pollFirst());
271 assertEquals(testObjOne, testQue.pollFirst());
273 assertEquals(testObjTwo, testQue.pollFirst());
274 assertEquals(testObjThree, testQue.pollFirst());
317 assertEquals(testObjOne, testQue.pollFirst());
[all...]
H A DLinkedListTest.java873 * {@link java.util.LinkedList#pollFirst()}
880 assertEquals(testObjOne, testList.pollFirst());
882 assertEquals(testObjTwo, testList.pollFirst());
883 assertEquals(testObjThree, testList.pollFirst());
885 assertNull(testList.pollFirst());
901 assertNull(testList.pollFirst());
914 assertEquals(testObjOne, testList.pollFirst());
916 assertEquals(testObjTwo, testList.pollFirst());
917 assertEquals(testObjThree, testList.pollFirst());
H A DTreeMapExtendTest.java3707 entry = (Entry) descendingSubMapEntrySet.pollFirst();
3710 assertNull(descendingSubMapEntrySet.pollFirst());
3722 entry = (Entry) descendingSubMapEntrySet.pollFirst();
3725 assertNull(descendingSubMapEntrySet.pollFirst());
3737 entry = (Entry) descendingSubMapEntrySet.pollFirst();
3740 assertNull(descendingSubMapEntrySet.pollFirst());
3752 entry = (Entry) descendingSubMapEntrySet.pollFirst();
3755 assertNull(descendingSubMapEntrySet.pollFirst());
3768 entry = (Entry) descendingEntrySet.pollFirst();
3775 entry = (Entry) descendingEntrySet.pollFirst();
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DBlockingDeque.java48 * <td>{@link #pollFirst pollFirst()}</td>
50 * <td>{@link #pollFirst(long, TimeUnit) pollFirst(time, unit)}</td>
136 * <td>{@link #pollFirst() pollFirst()}</td>
144 * <td>{@link #pollFirst(long, TimeUnit) pollFirst(time, unit)}</td>
347 E pollFirst(long timeout, TimeUnit unit) method in interface:BlockingDeque
501 * <p>This method is equivalent to {@link #pollFirst()}
[all...]
H A DLinkedBlockingDeque.java420 E x = pollFirst();
434 public E pollFirst() { method in class:LinkedBlockingDeque
480 public E pollFirst(long timeout, TimeUnit unit) method in class:LinkedBlockingDeque
645 return pollFirst();
653 return pollFirst(timeout, unit);
H A DConcurrentLinkedDeque.java208 * when an addFirst(A) is racing with pollFirst() removing B, it is
936 public E pollFirst() { method in class:ConcurrentLinkedDeque
962 return screenNullResult(pollFirst());
997 public E poll() { return pollFirst(); }
1179 while (pollFirst() != null)
H A DConcurrentSkipListSet.java336 public E pollFirst() { method in class:ConcurrentSkipListSet
H A DConcurrentSkipListMap.java2301 public E pollFirst() { method in class:ConcurrentSkipListMap.KeySet

Completed in 1790 milliseconds