| /libcore/ojluni/src/main/java/java/util/ |
| H A D | Deque.java | 86 * <td>{@link Deque#pollLast pollLast()}</td>
281 * differs from {@link #pollLast pollLast} only in that it throws an
303 E pollLast(); method in interface:Deque
|
| H A D | NavigableSet.java | 56 * #pollFirst} and {@link #pollLast} that return and remove the lowest
161 E pollLast(); method in interface:NavigableSet
|
| H A D | TreeSet.java | 461 public E pollLast() { method in class:TreeSet
|
| H A D | ArrayDeque.java | 201 // addLast, pollFirst, pollLast. The other methods are defined in
272 E x = pollLast();
291 public E pollLast() { method in class:ArrayDeque
|
| H A D | LinkedList.java | 771 public E pollLast() { method in class:LinkedList
|
| H A D | Collections.java | 1290 public E pollLast() { throw new UnsupportedOperationException(); } method in class:Collections.UnmodifiableNavigableSet
2348 public E pollLast() { synchronized (mutex) {return ns.pollLast();} } method in class:Collections.SynchronizedNavigableSet
3396 public E pollLast() {return ns.pollLast(); } method in class:Collections.CheckedNavigableSet
|
| H A D | TreeMap.java | 1151 public E pollLast() { method in class:TreeMap.KeySet
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | BlockingDeque.java | 113 * <td>{@link #pollLast() pollLast()}</td>
115 * <td>{@link #pollLast(long, TimeUnit) pollLast(time, unit)}</td>
396 E pollLast(long timeout, TimeUnit unit) method in interface:BlockingDeque
|
| H A D | ConcurrentSkipListSet.java | 382 public E pollLast() { method in class:ConcurrentSkipListSet
|
| H A D | LinkedBlockingDeque.java | 461 E x = pollLast();
476 public E pollLast() { method in class:LinkedBlockingDeque
530 public E pollLast(long timeout, TimeUnit unit) method in class:LinkedBlockingDeque
|
| H A D | ConcurrentLinkedDeque.java | 234 * operations (e.g., addFirst, peekLast, pollLast) are linearizable
945 public E pollLast() { method in class:ConcurrentLinkedDeque
967 return screenNullResult(pollLast());
|
| H A D | ConcurrentSkipListMap.java | 2379 public K pollLast() { method in class:ConcurrentSkipListMap.KeySet
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | LinkedBlockingDequeTest.java | 150 * pollLast succeeds unless empty
155 assertEquals(i, q.pollLast());
157 assertNull(q.pollLast());
195 assertEquals(i, q.pollLast());
225 assertEquals(i, q.pollLast());
313 q.pollLast();
323 q.pollLast();
460 q.pollLast();
1291 * timed pollLast with zero timeout succeeds when non-empty, else times out
1296 assertEquals(SIZE - i - 1, q.pollLast(
[all...] |
| H A D | LinkedListTest.java | 550 * pollLast succeeds unless empty
555 assertEquals(i, q.pollLast());
557 assertNull(q.pollLast());
581 assertEquals(i, q.pollLast());
607 assertEquals(i, q.pollLast());
|
| H A D | ArrayDequeTest.java | 143 q.pollLast();
358 * pollLast() succeeds unless empty
363 assertEquals(i, q.pollLast());
365 assertNull(q.pollLast());
449 assertEquals(i, q.pollLast());
493 assertEquals(i, q.pollLast());
|
| H A D | ConcurrentLinkedDequeTest.java | 147 q.pollLast();
373 * pollLast() succeeds unless empty
378 assertEquals(i, q.pollLast());
380 assertNull(q.pollLast());
479 assertEquals(i, q.pollLast());
508 assertEquals(i, q.pollLast());
|
| H A D | ConcurrentSkipListSetTest.java | 275 * pollLast succeeds unless empty
280 assertEquals(i, q.pollLast());
|
| H A D | TreeSetTest.java | 279 * pollLast succeeds unless empty
284 assertEquals(i, q.pollLast());
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| H A D | ArrayDequeTest.java | 258 assertEquals(testObjThree, testQue.pollLast());
260 assertEquals(testObjTwo, testQue.pollLast());
261 assertEquals(testObjOne, testQue.pollLast());
299 assertEquals(testObjThree, testQue.pollLast());
301 assertEquals(testObjTwo, testQue.pollLast());
302 assertEquals(testObjOne, testQue.pollLast());
340 assertEquals(testObjThree, testQue.pollLast());
342 assertEquals(testObjTwo, testQue.pollLast());
343 assertEquals(testObjOne, testQue.pollLast());
|
| H A D | LinkedListTest.java | 894 * {@link java.util.LinkedList#pollLast()}
901 assertEquals(testObjThree, testList.pollLast());
903 assertEquals(testObjTwo, testList.pollLast());
904 assertEquals(testObjOne, testList.pollLast());
937 assertEquals(testObjThree, testList.pollLast());
939 assertEquals(testObjTwo, testList.pollLast());
940 assertEquals(testObjOne, testList.pollLast());
|
| H A D | TreeMapExtendTest.java | 3788 entry = (Entry) descendingSubMapEntrySet.pollLast();
3803 entry = (Entry) descendingSubMapEntrySet.pollLast();
3818 entry = (Entry) descendingSubMapEntrySet.pollLast();
3833 entry = (Entry) descendingSubMapEntrySet.pollLast();
3849 entry = (Entry) descendingEntrySet.pollLast();
3856 entry = (Entry) descendingEntrySet.pollLast();
5280 assertNull(keySet.pollLast());
5293 assertNull(keySet.pollLast());
5306 assertNull(keySet.pollLast());
5319 assertNull(keySet.pollLast());
[all...] |