Class ConcurrentLinkedDeque<E>
- Type Parameters:
E- the type of elements held in this collection
- All Implemented Interfaces:
Serializable,Iterable<E>,Collection<E>,Deque<E>,Queue<E>,SequencedCollection<E>
Deque (double-ended queue).
This class should not be considered a part of the public API.
Concurrent insertion, removal, and access
operations execute safely across multiple threads. 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.
This class and its iterators implement all of the
optional methods of the Collection and Iterator interfaces. Like most other concurrent collection
implementations, this class does not permit the use of
null elements. because some null arguments and return
values cannot be reliably distinguished from the absence of
elements. Arbitrarily, the Collection.remove(java.lang.Object) method is
mapped to removeFirstOccurrence, and Collection.add(E) is mapped to addLast.
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.
This class is Serializable, but relies on default
serialization mechanisms. Usually, it is a better idea for any
serializable class using a ConcurrentLinkedDeque to instead
serialize a snapshot of the elements obtained by method
toArray.
- See Also:
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic interfaceDeprecated. -
Constructor Summary
ConstructorsConstructorDescriptionDeprecated.Constructs an empty deque.ConcurrentLinkedDeque(Collection<? extends E> c) Deprecated.Constructs a deque initially containing the elements of the given collection, added in traversal order of the collection's iterator. -
Method Summary
Modifier and TypeMethodDescriptionbooleanDeprecated.Inserts the specified element at the tail of this deque.booleanaddAll(Collection<? extends E> c) Deprecated.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.voidDeprecated.Inserts the specified element at the front of this deque.voidDeprecated.Inserts the specified element at the end of this deque.voidclear()Deprecated.Removes all of the elements from this deque.booleanDeprecated.Returnstrueif this deque contains at least one elementesuch thato.equals(e).Deprecated.Not yet implemented.element()Deprecated.getFirst()Deprecated.getLast()Deprecated.booleanisEmpty()Deprecated.Returnstrueif this collection contains no elements.iterator()Deprecated.Returns an iterator over the elements in this deque in proper sequence.booleanDeprecated.Inserts the specified element at the tail of this queue.booleanofferFirst(E e) Deprecated.Inserts the specified element at the front of this deque.booleanDeprecated.Inserts the specified element at the end of this deque.peek()Deprecated.Deprecated.peekLast()Deprecated.poll()Deprecated.Deprecated.pollLast()Deprecated.pop()Deprecated.voidDeprecated.remove()Deprecated.booleanDeprecated.Removes the first elementesuch thato.equals(e), if such an element exists in this deque.Deprecated.booleanDeprecated.Removes the first elementesuch thato.equals(e), if such an element exists in this deque.Deprecated.booleanDeprecated.Removes the last elementesuch thato.equals(e), if such an element exists in this deque.intsize()Deprecated.Returns the number of elements in this deque.Object[]toArray()Deprecated.Returns an array containing all of the elements in this deque, in proper sequence (from first to last element).<T> T[]toArray(T[] a) Deprecated.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.Methods inherited from class java.util.AbstractCollection
containsAll, removeAll, retainAll, toStringMethods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Collection
containsAll, equals, hashCode, parallelStream, removeAll, removeIf, retainAll, spliterator, stream, toArray
-
Constructor Details
-
ConcurrentLinkedDeque
public ConcurrentLinkedDeque()Deprecated.Constructs an empty deque. -
ConcurrentLinkedDeque
Deprecated.Constructs a deque initially containing the elements of the given collection, added in traversal order of the collection's iterator.- Parameters:
c- the collection of elements to initially contain- Throws:
NullPointerException- if the specified collection or any of its elements are null
-
-
Method Details
-
addFirst
Deprecated.Inserts the specified element at the front of this deque. -
addLast
Deprecated.Inserts the specified element at the end of this deque. This is identical in function to theaddmethod. -
offerFirst
Deprecated.Inserts the specified element at the front of this deque.- Specified by:
offerFirstin interfaceDeque<E>- Returns:
truealways
-
offerLast
Deprecated.Inserts the specified element at the end of this deque.This method is equivalent to
add(E). -
peekFirst
Deprecated. -
peekLast
Deprecated. -
getFirst
Deprecated. -
getLast
Deprecated. -
pollFirst
Deprecated. -
pollLast
Deprecated. -
removeFirst
Deprecated.- Specified by:
removeFirstin interfaceDeque<E>- Specified by:
removeFirstin interfaceSequencedCollection<E>
-
removeLast
Deprecated.- Specified by:
removeLastin interfaceDeque<E>- Specified by:
removeLastin interfaceSequencedCollection<E>
-
offer
Deprecated.Inserts the specified element at the tail of this queue.- Specified by:
offerin interfaceDeque<E>- Specified by:
offerin interfaceQueue<E>- Returns:
true(as specified byQueue.offer)- Throws:
NullPointerException- if the specified element is null
-
add
Deprecated.Inserts the specified element at the tail of this deque.- Specified by:
addin interfaceCollection<E>- Specified by:
addin interfaceDeque<E>- Specified by:
addin interfaceQueue<E>- Overrides:
addin classAbstractCollection<E>- Returns:
true(as specified byCollection.add(E))- Throws:
NullPointerException- if the specified element is null
-
poll
Deprecated. -
remove
Deprecated. -
peek
Deprecated. -
element
Deprecated. -
push
Deprecated. -
pop
Deprecated. -
removeFirstOccurrence
Deprecated.Removes the first elementesuch thato.equals(e), if such an element exists in this deque. If the deque does not contain the element, it is unchanged.- Specified by:
removeFirstOccurrencein interfaceDeque<E>- Parameters:
o- element to be removed from this deque, if present- Returns:
trueif the deque contained the specified element- Throws:
NullPointerException- if the specified element isnull
-
removeLastOccurrence
Deprecated.Removes the last elementesuch thato.equals(e), if such an element exists in this deque. If the deque does not contain the element, it is unchanged.- Specified by:
removeLastOccurrencein interfaceDeque<E>- Parameters:
o- element to be removed from this deque, if present- Returns:
trueif the deque contained the specified element- Throws:
NullPointerException- if the specified element isnull
-
contains
Deprecated.Returnstrueif this deque contains at least one elementesuch thato.equals(e).- Specified by:
containsin interfaceCollection<E>- Specified by:
containsin interfaceDeque<E>- Overrides:
containsin classAbstractCollection<E>- Parameters:
o- element whose presence in this deque is to be tested- Returns:
trueif this deque contains the specified element
-
isEmpty
public boolean isEmpty()Deprecated.Returnstrueif this collection contains no elements.- Specified by:
isEmptyin interfaceCollection<E>- Overrides:
isEmptyin classAbstractCollection<E>- Returns:
trueif this collection contains no elements
-
size
public int size()Deprecated.Returns the number of elements in this deque. If this deque contains more thanInteger.MAX_VALUEelements, it returnsInteger.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.
- Specified by:
sizein interfaceCollection<E>- Specified by:
sizein interfaceDeque<E>- Specified by:
sizein classAbstractCollection<E>- Returns:
- the number of elements in this deque
-
remove
Deprecated.Removes the first elementesuch thato.equals(e), if such an element exists in this deque. If the deque does not contain the element, it is unchanged.- Specified by:
removein interfaceCollection<E>- Specified by:
removein interfaceDeque<E>- Overrides:
removein classAbstractCollection<E>- Parameters:
o- element to be removed from this deque, if present- Returns:
trueif the deque contained the specified element- Throws:
NullPointerException- if the specified element isnull
-
addAll
Deprecated.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. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (This implies that the behavior of this call is undefined if the specified Collection is this deque, and this deque is nonempty.)- Specified by:
addAllin interfaceCollection<E>- Specified by:
addAllin interfaceDeque<E>- Overrides:
addAllin classAbstractCollection<E>- Parameters:
c- the elements to be inserted into this deque- Returns:
trueif this deque changed as a result of the call- Throws:
NullPointerException- ifcor any element within it isnull
-
clear
public void clear()Deprecated.Removes all of the elements from this deque.- Specified by:
clearin interfaceCollection<E>- Overrides:
clearin classAbstractCollection<E>
-
toArray
Deprecated.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.
- Specified by:
toArrayin interfaceCollection<E>- Overrides:
toArrayin classAbstractCollection<E>- Returns:
- an array containing all of the elements in this deque
-
toArray
public <T> T[] toArray(T[] a) Deprecated.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
xis a deque known to contain only strings. The following code can be used to dump the deque into a newly allocated array ofString:String[] y = x.toArray(new String[0]);Note thattoArray(new Object[0])is identical in function totoArray().- Specified by:
toArrayin interfaceCollection<E>- Overrides:
toArrayin classAbstractCollection<E>- Parameters:
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- Returns:
- an array containing all of the elements in this deque
- Throws:
ArrayStoreException- if the runtime type of the specified array is not a supertype of the runtime type of every element in this dequeNullPointerException- if the specified array is null
-
iterator
Deprecated.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 returnedIteratoris a "weakly consistent" iterator that will never throwConcurrentModificationException, 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. -
descendingIterator
Deprecated.Not yet implemented.- Specified by:
descendingIteratorin interfaceDeque<E>
-