| java.lang.Object | ||
| ↳ | java.util.AbstractCollection<E> | |
| ↳ | java.util.concurrent.ConcurrentLinkedDeque<E> | |
An unbounded concurrent deque based on linked nodes.
Concurrent insertion, removal, and access operations execute safely
across multiple threads.
A ConcurrentLinkedDeque is an appropriate choice when
many threads will share access to a common collection.
Like most other concurrent collection implementations, this class
does not permit the use of null elements.
Iterators are weakly consistent, returning elements
reflecting the state of the deque at some point at or since the
creation of the iterator. They do not throw ConcurrentModificationException, and may proceed concurrently with
other operations.
Beware that, unlike in most collections, the size method
is NOT a constant-time operation. Because of the
asynchronous nature of these deques, determining the current number
of elements requires a traversal of the elements, and so may report
inaccurate results if this collection is modified during traversal.
Additionally, the bulk operations addAll,
removeAll, retainAll, containsAll,
equals, and toArray are not guaranteed
to be performed atomically. For example, an iterator operating
concurrently with an addAll operation might view only some
of the added elements.
This class and its iterator implement all of the optional
methods of the Deque and Iterator interfaces.
Memory consistency effects: As with other concurrent collections,
actions in a thread prior to placing an object into a
ConcurrentLinkedDeque
happen-before
actions subsequent to the access or removal of that element from
the ConcurrentLinkedDeque in another thread.
| Public Constructors | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
Constructs an empty deque.
| |||||||||||
Constructs a deque initially containing the elements of
the given collection, added in traversal order of the
collection's iterator.
| |||||||||||
| Public Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
Inserts the specified element at the tail of this deque.
| |||||||||||
Appends all of the elements in the specified collection to the end of
this deque, in the order that they are returned by the specified
collection's iterator.
| |||||||||||
Inserts the specified element at the front of this deque.
| |||||||||||
Inserts the specified element at the end of this deque.
| |||||||||||
Removes all of the elements from this deque.
| |||||||||||
Returns
true if this deque contains at least one
element e such that o.equals(e).
| |||||||||||
Returns an iterator over the elements in this deque in reverse
sequential order.
| |||||||||||
Retrieves, but does not remove, the head of the queue represented by
this deque (in other words, the first element of this deque).
| |||||||||||
Retrieves, but does not remove, the first element of this deque.
| |||||||||||
Retrieves, but does not remove, the last element of this deque.
| |||||||||||
Returns
true if this collection contains no elements.
| |||||||||||
Returns an iterator over the elements in this deque in proper sequence.
| |||||||||||
Inserts the specified element at the tail of this deque.
| |||||||||||
Inserts the specified element at the front of this deque.
| |||||||||||
Inserts the specified element at the end of this 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.
| |||||||||||
Retrieves, but does not remove, the first element of this deque,
or returns null if this deque is empty.
| |||||||||||
Retrieves, but does not remove, the last element of this deque,
or returns null if this deque is empty.
| |||||||||||
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.
| |||||||||||
Retrieves and removes the first element of this deque,
or returns null if this deque is empty.
| |||||||||||
Retrieves and removes the last element of this deque,
or returns null if this deque is empty.
| |||||||||||
Pops an element from the stack represented by this 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.
| |||||||||||
Retrieves and removes the head of the queue represented by this deque
(in other words, the first element of this deque).
| |||||||||||
Removes the first element
e such that
o.equals(e), if such an element exists in this deque.
| |||||||||||
Retrieves and removes the first element of this deque.
| |||||||||||
Removes the first element
e such that
o.equals(e), if such an element exists in this deque.
| |||||||||||
Retrieves and removes the last element of this deque.
| |||||||||||
Removes the last element
e such that
o.equals(e), if such an element exists in this deque.
| |||||||||||
Returns the number of elements in this deque.
| |||||||||||
Returns an array containing all of the elements in this deque,
in proper sequence (from first to last element); the runtime
type of the returned array is that of the specified array.
| |||||||||||
Returns an array containing all of the elements in this deque, in
proper sequence (from first to last element).
| |||||||||||
|
[Expand]
Inherited Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
From class
java.util.AbstractCollection
| |||||||||||
|
From class
java.lang.Object
| |||||||||||
|
From interface
java.util.Collection
| |||||||||||
|
From interface
java.util.Deque
| |||||||||||
|
From interface
java.lang.Iterable
| |||||||||||
|
From interface
java.util.Queue
| |||||||||||
Constructs a deque initially containing the elements of the given collection, added in traversal order of the collection's iterator.
| c | the collection of elements to initially contain |
|---|
| NullPointerException | if the specified collection or any of its elements are null |
|---|
Inserts the specified element at the tail of this deque.
As the deque is unbounded, this method will never throw
IllegalStateException or return false.
| e | the object to add. |
|---|
Developers
true (as specified by add(E))| NullPointerException | if the specified element is null |
|---|
Appends all of the elements in the specified collection to the end of
this deque, in the order that they are returned by the specified
collection's iterator. Attempts to addAll of a deque to
itself result in IllegalArgumentException.
| c | the elements to be inserted into this deque |
|---|
true if this deque changed as a result of the call| NullPointerException | if the specified collection or any of its elements are null |
|---|---|
| IllegalArgumentException | if the collection is this deque |
Inserts the specified element at the front of this deque.
As the deque is unbounded, this method will never throw
IllegalStateException.
| e | the element to add |
|---|
| NullPointerException | if the specified element is null |
|---|
Inserts the specified element at the end of this deque.
As the deque is unbounded, this method will never throw
IllegalStateException.
This method is equivalent to add(E).
| e | the element to add |
|---|
| NullPointerException | if the specified element is null |
|---|
Returns true if this deque contains at least one
element e such that o.equals(e).
| o | element whose presence in this deque is to be tested |
|---|
true if this deque contains the specified element
Returns an iterator over the elements in this deque in reverse sequential order. The elements will be returned in order from last (tail) to first (head).
The returned iterator is a "weakly consistent" iterator that
will never throw ConcurrentModificationException, and guarantees to traverse
elements as they existed upon construction of the iterator, and
may (but is not guaranteed to) reflect any modifications
subsequent to construction.
Retrieves, but does not remove, the head of the queue represented by
this deque (in other words, the first element of this deque).
This method differs from peek only in that it throws an
exception if this deque is empty.
This method is equivalent to getFirst().
Retrieves, but does not remove, the first element of this deque.
This method differs from peekFirst only in that it
throws an exception if this deque is empty.
| NoSuchElementException |
|---|
Retrieves, but does not remove, the last element of this deque.
This method differs from peekLast only in that it
throws an exception if this deque is empty.
| NoSuchElementException |
|---|
Returns true if this collection contains no elements.
true if this collection contains no elements
Returns an iterator over the elements in this deque in proper sequence. The elements will be returned in order from first (head) to last (tail).
The returned iterator is a "weakly consistent" iterator that
will never throw ConcurrentModificationException, and guarantees to traverse
elements as they existed upon construction of the iterator, and
may (but is not guaranteed to) reflect any modifications
subsequent to construction.
Inserts the specified element at the tail of this deque.
As the deque is unbounded, this method will never return false.
| e | the element to add |
|---|
true (as specified by offer(E))| NullPointerException | if the specified element is null |
|---|
Inserts the specified element at the front of this deque.
As the deque is unbounded, this method will never return false.
| e | the element to add |
|---|
true (as specified by offerFirst(E))| NullPointerException | if the specified element is null |
|---|
Inserts the specified element at the end of this deque.
As the deque is unbounded, this method will never return false.
This method is equivalent to add(E).
| e | the element to add |
|---|
true (as specified by offerLast(E))| NullPointerException | if the specified element is null |
|---|
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.
This method is equivalent to peekFirst().
Retrieves, but does not remove, the first element of this deque, or returns null if this deque is empty.
Retrieves, but does not remove, the last element of this deque, or returns null if this deque is empty.
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.
This method is equivalent to pollFirst().
Retrieves and removes the first element of this deque, or returns null if this deque is empty.
Retrieves and removes the last element of this deque, or returns null if this deque is empty.
Pops an element from the stack represented by this deque. In other words, removes and returns the first element of this deque.
This method is equivalent to removeFirst().
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.
This method is equivalent to addFirst(E).
| e | the element to push |
|---|
Retrieves and removes the head of the queue represented by this deque
(in other words, the first element of this deque).
This method differs from poll only in that it throws an
exception if this deque is empty.
This method is equivalent to removeFirst().
Removes the first element e such that
o.equals(e), if such an element exists in this deque.
If the deque does not contain the element, it is unchanged.
| o | element to be removed from this deque, if present |
|---|
true if the deque contained the specified element| NullPointerException | if the specified element is null |
|---|
Retrieves and removes the first element of this deque. This method
differs from pollFirst only in that it throws an
exception if this deque is empty.
| NoSuchElementException |
|---|
Removes the first element e such that
o.equals(e), if such an element exists in this deque.
If the deque does not contain the element, it is unchanged.
| o | element to be removed from this deque, if present |
|---|
true if the deque contained the specified element| NullPointerException | if the specified element is null |
|---|
Retrieves and removes the last element of this deque. This method
differs from pollLast only in that it throws an
exception if this deque is empty.
| NoSuchElementException |
|---|
Removes the last element e such that
o.equals(e), if such an element exists in this deque.
If the deque does not contain the element, it is unchanged.
| o | element to be removed from this deque, if present |
|---|
true if the deque contained the specified element| NullPointerException | if the specified element is null |
|---|
Returns the number of elements in this deque. If this deque
contains more than Integer.MAX_VALUE elements, it
returns Integer.MAX_VALUE.
Beware that, unlike in most collections, this method is NOT a constant-time operation. Because of the asynchronous nature of these deques, determining the current number of elements requires traversing them all to count them. Additionally, it is possible for the size to change during execution of this method, in which case the returned result will be inaccurate. Thus, this method is typically not very useful in concurrent applications.
Returns an array containing all of the elements in this deque, in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the deque fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this deque.
If this deque fits in the specified array with room to spare
(i.e., the array has more elements than this deque), the element in
the array immediately following the end of the deque is set to
null.
Like the toArray() method, this method acts as
bridge between array-based and collection-based APIs. Further,
this method allows precise control over the runtime type of the
output array, and may, under certain circumstances, be used to
save allocation costs.
Suppose x is a deque known to contain only strings.
The following code can be used to dump the deque into a newly
allocated array of String:
String[] y = x.toArray(new String[0]);
Note that toArray(new Object[0]) is identical in function to
toArray().| a | the array into which the elements of the deque are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose |
|---|
| ArrayStoreException | if the runtime type of the specified array is not a supertype of the runtime type of every element in this deque |
|---|---|
| NullPointerException | if the specified array is null |
Returns an array containing all of the elements in this deque, in proper sequence (from first to last element).
The returned array will be "safe" in that no references to it are maintained by this deque. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.