Searched defs:pollLast (Results 1 - 11 of 11) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DNavigableSet.java55 * #pollFirst} and {@link #pollLast} that return and remove the lowest
160 E pollLast(); method in interface:NavigableSet
H A DDeque.java88 * <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 DTreeSet.java461 public E pollLast() { method in class:TreeSet
H A DArrayDeque.java200 // addLast, pollFirst, pollLast. The other methods are defined in
271 E x = pollLast();
290 public E pollLast() { method in class:ArrayDeque
H A DLinkedList.java771 public E pollLast() { method in class:LinkedList
H A DTreeMap.java1171 public E pollLast() { method in class:TreeMap.KeySet
/libcore/luni/src/main/java/java/util/concurrent/
H A DBlockingDeque.java84 * <td>{@link #pollLast() pollLast()}</td>
86 * <td>{@link #pollLast(long, TimeUnit) pollLast(time, unit)}</td>
367 E pollLast(long timeout, TimeUnit unit) method in interface:BlockingDeque
H A DConcurrentSkipListSet.java353 public E pollLast() { method in class:ConcurrentSkipListSet
H A DConcurrentLinkedDeque.java205 * operations (e.g., addFirst, peekLast, pollLast) are linearizable
916 public E pollLast() { method in class:ConcurrentLinkedDeque
938 return screenNullResult(pollLast());
H A DLinkedBlockingDeque.java432 E x = pollLast();
447 public E pollLast() { method in class:LinkedBlockingDeque
501 public E pollLast(long timeout, TimeUnit unit) method in class:LinkedBlockingDeque
H A DConcurrentSkipListMap.java2350 public K pollLast() { method in class:ConcurrentSkipListMap.KeySet

Completed in 215 milliseconds