Cross Reference: /libcore/luni/src/main/java/java/util/concurrent/ConcurrentLinkedDeque.java

Lines Matching defs:element
56  * actions subsequent to the access or removal of that element from
103      * A new element is added atomically by CASing the null prev or
105      * containing the element.  The element's node atomically becomes
134      * the element from the collection, and makes the containing node
172      * the same element twice, but we don't guarantee whether a
207      * We believe (without full proof) that all single-element deque
325      * Links e as first element.
346                         // for e to become an element of this deque,
358      * Links e as last element.
379                         // for e to become an element of this deque,
769      * @param v the element
777      * Returns element unless it is null, in which case throws
780      * @param v the element
781      * @return the element
858      * Inserts the specified element at the front of this deque.
862      * @throws NullPointerException if the specified element is null
869      * Inserts the specified element at the end of this deque.
875      * @throws NullPointerException if the specified element is null
882      * Inserts the specified element at the front of this deque.
886      * @throws NullPointerException if the specified element is null
894      * Inserts the specified element at the end of this deque.
900      * @throws NullPointerException if the specified element is null
978      * Inserts the specified element at the tail of this deque.
982      * @throws NullPointerException if the specified element is null
989      * Inserts the specified element at the tail of this deque.
994      * @throws NullPointerException if the specified element is null
1003     public E element()        { return getFirst(); }
1008      * Removes the first element {@code e} such that
1009      * {@code o.equals(e)}, if such an element exists in this deque.
1010      * If the deque does not contain the element, it is unchanged.
1012      * @param o element to be removed from this deque, if present
1013      * @return {@code true} if the deque contained the specified element
1014      * @throws NullPointerException if the specified element is null
1029      * Removes the last element {@code e} such that
1030      * {@code o.equals(e)}, if such an element exists in this deque.
1031      * If the deque does not contain the element, it is unchanged.
1033      * @param o element to be removed from this deque, if present
1034      * @return {@code true} if the deque contained the specified element
1035      * @throws NullPointerException if the specified element is null
1051      * element {@code e} such that {@code o.equals(e)}.
1053      * @param o element whose presence in this deque is to be tested
1054      * @return {@code true} if this deque contains the specified element
1102      * Removes the first element {@code e} such that
1103      * {@code o.equals(e)}, if such an element exists in this deque.
1104      * If the deque does not contain the element, it is unchanged.
1106      * @param o element to be removed from this deque, if present
1107      * @return {@code true} if the deque contained the specified element
1108      * @throws NullPointerException if the specified element is null
1188      * proper sequence (from first to last element).
1205      * in proper sequence (from first to last element); the runtime
1212      * (i.e., the array has more elements than this deque), the element in
1236      *         is not a supertype of the runtime type of every element in
1287          * that an element exists in hasNext(), we must return it in
1295          * Reset to null if this element is deleted by a call to remove.