Searched defs:addFirst (Results 1 - 7 of 7) sorted by relevance

/openjdk7/jdk/src/share/classes/java/util/
H A DDeque.java75 * <td>{@link #addFirst addFirst(e)}</td>
148 * <td>{@link #addFirst addFirst(e)}</td>
211 void addFirst(E e); method in interface:Deque
236 * this method is generally preferable to the {@link #addFirst} method,
491 * <p>This method is equivalent to {@link #addFirst}.
H A DArrayDeque.java214 // The main insertion and extraction methods are addFirst,
224 public void addFirst(E e) { method in class:ArrayDeque
256 addFirst(e);
487 * <p>This method is equivalent to {@link #addFirst}.
493 addFirst(e);
H A DLinkedList.java290 public void addFirst(E e) { method in class:LinkedList
706 addFirst(e);
778 * <p>This method is equivalent to {@link #addFirst}.
784 addFirst(e);
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DBlockingDeque.java67 * <td>{@link #addFirst addFirst(e)}</td>
221 void addFirst(E e); method in interface:BlockingDeque
244 * preferable to the {@link #addFirst(Object) addFirst} method, which can
642 * <p>This method is equivalent to {@link #addFirst(Object) addFirst}.
H A DLinkedBlockingDeque.java321 public void addFirst(E e) { method in class:LinkedBlockingDeque
766 addFirst(e);
H A DConcurrentLinkedDeque.java235 * operations (e.g., addFirst, peekLast, pollLast) are linearizable
238 * when an addFirst(A) is racing with pollFirst() removing B, it is
891 public void addFirst(E e) { method in class:ConcurrentLinkedDeque
1031 public void push(E e) { addFirst(e); }
/openjdk7/jdk/src/share/classes/sun/awt/util/
H A DIdentityLinkedList.java167 public void addFirst(E e) { method in class:IdentityLinkedList
495 addFirst(e);
571 * <p>This method is equivalent to {@link #addFirst}.
577 addFirst(e);

Completed in 46 milliseconds