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

/libcore/ojluni/src/main/java/java/util/
H A DDeque.java84 * <td>{@link Deque#pollFirst pollFirst()}</td>
123 * <td>{@link #pollFirst pollFirst()}</td>
271 * differs from {@link #pollFirst pollFirst} only in that it throws an
295 E pollFirst(); method in interface:Deque
447 * <p>This method is equivalent to {@link #pollFirst()}.
H A DNavigableSet.java56 * #pollFirst} and {@link #pollLast} that return and remove the lowest
153 E pollFirst(); method in interface:NavigableSet
H A DArrayDeque.java201 // addLast, pollFirst, pollLast. The other methods are defined in
262 E x = pollFirst();
278 public E pollFirst() { method in class:ArrayDeque
437 * <p>This method is equivalent to {@link #pollFirst}.
443 return pollFirst();
H A DTreeSet.java453 public E pollFirst() { method in class:TreeSet
H A DLinkedList.java758 public E pollFirst() { method in class:LinkedList
H A DCollections.java1289 public E pollFirst() { throw new UnsupportedOperationException(); } method in class:Collections.UnmodifiableNavigableSet
2347 public E pollFirst() { synchronized (mutex) {return ns.pollFirst();} } method in class:Collections.SynchronizedNavigableSet
3395 public E pollFirst() { return ns.pollFirst(); } method in class:Collections.CheckedNavigableSet
5580 public E poll() { return q.pollFirst(); }
H A DTreeMap.java1147 public E pollFirst() { method in class:TreeMap.KeySet
/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.java122 assertEquals(ints[i], q.pollFirst());
137 assertEquals(ints[i], q.pollFirst());
149 q.pollFirst();
150 q.pollFirst();
161 q.pollFirst();
260 assertEquals(i, q.pollFirst());
264 * pollFirst succeeds unless empty
269 assertEquals(i, q.pollFirst());
271 assertNull(q.pollFirst());
282 assertNull(q.pollFirst());
[all...]
H A DTreeSetTest.java126 assertEquals(ints[i], q.pollFirst());
141 assertEquals(ints[i], q.pollFirst());
153 q.pollFirst();
154 q.pollFirst();
165 q.pollFirst();
264 assertEquals(new Integer(i), q.pollFirst());
268 * pollFirst succeeds unless empty
273 assertEquals(i, q.pollFirst());
275 assertNull(q.pollFirst());
286 assertNull(q.pollFirst());
[all...]
H A DLinkedBlockingDequeTest.java139 * pollFirst succeeds unless empty
144 assertEquals(i, q.pollFirst());
146 assertNull(q.pollFirst());
167 assertEquals(i, q.pollFirst());
181 assertEquals(i, q.pollFirst());
209 assertEquals(i, q.pollFirst());
1024 * timed pollFirst with zero timeout succeeds when non-empty, else times out
1029 assertEquals(i, q.pollFirst(0, MILLISECONDS));
1031 assertNull(q.pollFirst(0, MILLISECONDS));
1035 * timed pollFirst wit
[all...]
H A DArrayDequeTest.java95 assertEquals(ints[i], q.pollFirst());
343 assertEquals(ints[i], q.pollFirst());
347 * pollFirst() succeeds unless empty
352 assertEquals(i, q.pollFirst());
354 assertNull(q.pollFirst());
421 assertEquals(i, q.pollFirst());
478 assertEquals(i, q.pollFirst());
569 assertEquals(i, q.pollFirst());
H A DConcurrentLinkedDequeTest.java362 * pollFirst() succeeds unless empty
367 assertEquals(i, q.pollFirst());
369 assertNull(q.pollFirst());
465 assertEquals(i, q.pollFirst());
493 assertEquals(i, q.pollFirst());
H A DLinkedListTest.java567 assertEquals(i, q.pollFirst());
592 assertEquals(i, q.pollFirst());
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DBlockingDeque.java82 * <td>{@link #pollFirst pollFirst()}</td>
84 * <td>{@link #pollFirst(long, TimeUnit) pollFirst(time, unit)}</td>
169 * <td>{@link #pollFirst() pollFirst()}</td>
177 * <td>{@link #pollFirst(long, TimeUnit) pollFirst(time, unit)}</td>
380 E pollFirst(long timeout, TimeUnit unit) method in interface:BlockingDeque
534 * <p>This method is equivalent to {@link #pollFirst()}
[all...]
H A DLinkedBlockingDeque.java452 E x = pollFirst();
466 public E pollFirst() { method in class:LinkedBlockingDeque
512 public E pollFirst(long timeout, TimeUnit unit) method in class:LinkedBlockingDeque
676 return pollFirst();
684 return pollFirst(timeout, unit);
H A DConcurrentLinkedDeque.java237 * when an addFirst(A) is racing with pollFirst() removing B, it is
934 public E pollFirst() { method in class:ConcurrentLinkedDeque
960 return screenNullResult(pollFirst());
995 public E poll() { return pollFirst(); }
1209 while (pollFirst() != null)
H A DConcurrentSkipListSet.java377 public E pollFirst() { method in class:ConcurrentSkipListSet
H A DConcurrentSkipListMap.java2375 public K pollFirst() { method in class:ConcurrentSkipListMap.KeySet
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DArrayDequeTest.java235 * {@link java.util.ArrayDeque#pollFirst()}
242 assertEquals(testObjOne, testQue.pollFirst());
244 assertEquals(testObjTwo, testQue.pollFirst());
245 assertEquals(testObjThree, testQue.pollFirst());
247 assertNull(testQue.pollFirst());
263 assertNull(testQue.pollFirst());
276 assertEquals(testObjOne, testQue.pollFirst());
278 assertEquals(testObjTwo, testQue.pollFirst());
279 assertEquals(testObjThree, testQue.pollFirst());
322 assertEquals(testObjOne, testQue.pollFirst());
[all...]
H A DLinkedListTest.java878 * {@link java.util.LinkedList#pollFirst()}
885 assertEquals(testObjOne, testList.pollFirst());
887 assertEquals(testObjTwo, testList.pollFirst());
888 assertEquals(testObjThree, testList.pollFirst());
890 assertNull(testList.pollFirst());
906 assertNull(testList.pollFirst());
919 assertEquals(testObjOne, testList.pollFirst());
921 assertEquals(testObjTwo, testList.pollFirst());
922 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/ojluni/src/main/java/java/util/stream/
H A DNodes.java976 while ((n = stack.pollFirst()) != null) {

Completed in 484 milliseconds