- peek() - Method in class java.util.ArrayDeque
-
Retrieves, but does not remove, the head of the queue represented by this deque, or returns null if this
deque is empty.
- peek() - Method in interface java.util.Deque
-
Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first
element of this deque), or returns null if this deque is empty.
- peek() - Method in class java.util.LinkedList
-
Retrieves, but does not remove, the head (first element) of this list.
- peek() - Method in interface java.util.Queue
-
Retrieves, but does not remove, the head of this queue, or returns null if this queue is empty.
- peekFirst() - Method in class java.util.ArrayDeque
-
- peekFirst() - Method in interface java.util.Deque
-
Retrieves, but does not remove, the first element of this deque, or returns null if this deque is empty.
- peekFirst() - Method in class java.util.LinkedList
-
Retrieves, but does not remove, the first element of this list, or returns null
if this list is empty.
- peekLast() - Method in class java.util.ArrayDeque
-
- peekLast() - Method in interface java.util.Deque
-
Retrieves, but does not remove, the last element of this deque, or returns null if this deque is empty.
- peekLast() - Method in class java.util.LinkedList
-
Retrieves, but does not remove, the last element of this list, or returns null
if this list is empty.
- poll() - Method in class java.util.ArrayDeque
-
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this
deque), or returns null if this deque is empty.
- poll() - Method in interface java.util.Deque
-
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this
deque), or returns null if this deque is empty.
- poll() - Method in class java.util.LinkedList
-
Retrieves and removes the head (first element) of this list.
- poll() - Method in interface java.util.Queue
-
Retrieves and removes the head of this queue, or returns null if this queue is empty.
- pollFirst() - Method in class java.util.ArrayDeque
-
- pollFirst() - Method in interface java.util.Deque
-
Retrieves and removes the first element of this deque, or returns null if this deque is empty.
- pollFirst() - Method in class java.util.LinkedList
-
Retrieves and removes the first element of this list, or returns null
if this list is empty.
- pollFirst() - Method in interface java.util.NavigableSet
-
Retrieves and removes the first (lowest) element, or returns null
if this set is empty.
- pollFirst() - Method in class java.util.TreeSet
-
- pollFirstEntry() - Method in interface java.util.NavigableMap
-
Removes and returns a key-value mapping associated with the least key in this map, or null
if the map is
empty.
- pollFirstEntry() - Method in class java.util.TreeMap
-
- pollLast() - Method in class java.util.ArrayDeque
-
- pollLast() - Method in interface java.util.Deque
-
Retrieves and removes the last element of this deque, or returns null if this deque is empty.
- pollLast() - Method in class java.util.LinkedList
-
Retrieves and removes the last element of this list, or returns null
if this list is empty.
- pollLast() - Method in interface java.util.NavigableSet
-
Retrieves and removes the last (highest) element, or returns null
if this set is empty.
- pollLast() - Method in class java.util.TreeSet
-
- pollLastEntry() - Method in interface java.util.NavigableMap
-
Removes and returns a key-value mapping associated with the greatest key in this map, or null
if the map
is empty.
- pollLastEntry() - Method in class java.util.TreeMap
-
- pop() - Method in class java.util.ArrayDeque
-
Pops an element from the stack represented by this deque.
- pop() - Method in interface java.util.Deque
-
Pops an element from the stack represented by this deque.
- pop() - Method in class java.util.LinkedList
-
Pops an element from the stack represented by this list.
- push(E) - Method in class java.util.ArrayDeque
-
Pushes an element onto the stack represented by this deque.
- push(E) - Method in interface java.util.Deque
-
Pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is
possible to do so immediately without violating capacity restrictions, returning true upon success and
throwing an IllegalStateException if no space is currently available.
- push(E) - Method in class java.util.LinkedList
-
Pushes an element onto the stack represented by this list.
- put(K, V) - Method in class java.util.TreeMap
-
Associates the specified value with the specified key in this map.
- putAll(Map<? extends K, ? extends V>) - Method in class java.util.TreeMap
-
Copies all of the mappings from the specified map to this map.