- java.lang.Object
- 
- java.util.AbstractCollection<E>
- 
- java.util.ArrayDeque<E>
 
 
- 
- Type Parameters:
- E- the type of elements held in this deque
 - All Implemented Interfaces:
- Serializable,- Cloneable,- Iterable<E>,- Collection<E>,- Deque<E>,- Queue<E>
 
 public class ArrayDeque<E> extends AbstractCollection<E> implements Deque<E>, Cloneable, Serializable Resizable-array implementation of theDequeinterface. Array deques have no capacity restrictions; they grow as necessary to support usage. They are not thread-safe; in the absence of external synchronization, they do not support concurrent access by multiple threads. Null elements are prohibited. This class is likely to be faster thanStackwhen used as a stack, and faster thanLinkedListwhen used as a queue.Most ArrayDequeoperations run in amortized constant time. Exceptions includeremove,removeFirstOccurrence,removeLastOccurrence,contains,iterator.remove(), and the bulk operations, all of which run in linear time.The iterators returned by this class's iteratormethod are fail-fast: If the deque is modified at any time after the iterator is created, in any way except through the iterator's ownremovemethod, the iterator will generally throw aConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationExceptionon a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.This class and its iterator implement all of the optional methods of the CollectionandIteratorinterfaces.This class is a member of the Java Collections Framework. - Since:
- 1.6
- See Also:
- Serialized Form
 
- 
- 
Constructor SummaryConstructors Constructor Description ArrayDeque()Constructs an empty array deque with an initial capacity sufficient to hold 16 elements.ArrayDeque(int numElements)Constructs an empty array deque with an initial capacity sufficient to hold the specified number of elements.ArrayDeque(Collection<? extends E> c)Constructs a deque containing the elements of the specified collection, in the order they are returned by the collection's iterator.
 - 
Method SummaryAll Methods Instance Methods Concrete Methods Modifier and Type Method Description booleanadd(E e)Inserts the specified element at the end of this deque.booleanaddAll(Collection<? extends E> c)Adds all of the elements in the specified collection at the end of this deque, as if by callingaddLast(E)on each one, in the order that they are returned by the collection's iterator.voidaddFirst(E e)Inserts the specified element at the front of this deque.voidaddLast(E e)Inserts the specified element at the end of this deque.voidclear()Removes all of the elements from this deque.ArrayDeque<E>clone()Returns a copy of this deque.booleancontains(Object o)Returnstrueif this deque contains the specified element.Eelement()Retrieves, but does not remove, the head of the queue represented by this deque.voidforEach(Consumer<? super E> action)Performs the given action for each element of theIterableuntil all elements have been processed or the action throws an exception.EgetFirst()Retrieves, but does not remove, the first element of this deque.EgetLast()Retrieves, but does not remove, the last element of this deque.booleanisEmpty()Returnstrueif this deque contains no elements.Iterator<E>iterator()Returns an iterator over the elements in this deque.booleanoffer(E e)Inserts the specified element at the end of this deque.booleanofferFirst(E e)Inserts the specified element at the front of this deque.booleanofferLast(E e)Inserts the specified element at the end of this deque.Epeek()Retrieves, but does not remove, the head of the queue represented by this deque, or returnsnullif this deque is empty.Epoll()Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), or returnsnullif this deque is empty.Epop()Pops an element from the stack represented by this deque.voidpush(E e)Pushes an element onto the stack represented by this deque.Eremove()Retrieves and removes the head of the queue represented by this deque.booleanremove(Object o)Removes a single instance of the specified element from this deque.booleanremoveAll(Collection<?> c)Removes all of this collection's elements that are also contained in the specified collection (optional operation).EremoveFirst()Retrieves and removes the first element of this deque.booleanremoveFirstOccurrence(Object o)Removes the first occurrence of the specified element in this deque (when traversing the deque from head to tail).booleanremoveIf(Predicate<? super E> filter)Removes all of the elements of this collection that satisfy the given predicate.EremoveLast()Retrieves and removes the last element of this deque.booleanremoveLastOccurrence(Object o)Removes the last occurrence of the specified element in this deque (when traversing the deque from head to tail).booleanretainAll(Collection<?> c)Retains only the elements in this collection that are contained in the specified collection (optional operation).intsize()Returns the number of elements in this deque.Spliterator<E>spliterator()Creates a late-binding and fail-fastSpliteratorover the elements in this deque.Object[]toArray()Returns an array containing all of the elements in this deque in proper sequence (from first to last element).<T> T[]toArray(T[] a)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 declared in class java.util.AbstractCollectioncontainsAll, toString
 - 
Methods declared in class java.lang.Objectequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
 - 
Methods declared in interface java.util.CollectioncontainsAll, equals, hashCode, parallelStream, stream, toArray
 
- 
 
- 
- 
- 
Constructor Detail- 
ArrayDequepublic ArrayDeque() Constructs an empty array deque with an initial capacity sufficient to hold 16 elements.
 - 
ArrayDequepublic ArrayDeque(int numElements) Constructs an empty array deque with an initial capacity sufficient to hold the specified number of elements.- Parameters:
- numElements- lower bound on initial capacity of the deque
 
 - 
ArrayDequepublic ArrayDeque(Collection<? extends E> c) Constructs a deque containing the elements of the specified collection, in the order they are returned by the collection's iterator. (The first element returned by the collection's iterator becomes the first element, or front of the deque.)- Parameters:
- c- the collection whose elements are to be placed into the deque
- Throws:
- NullPointerException- if the specified collection is null
 
 
- 
 - 
Method Detail- 
addFirstpublic void addFirst(E e) Inserts the specified element at the front of this deque.- Specified by:
- addFirstin interface- Deque<E>
- Parameters:
- e- the element to add
- Throws:
- NullPointerException- if the specified element is null
 
 - 
addLastpublic void addLast(E e) Inserts the specified element at the end of this deque.This method is equivalent to add(E).- Specified by:
- addLastin interface- Deque<E>
- Parameters:
- e- the element to add
- Throws:
- NullPointerException- if the specified element is null
 
 - 
addAllpublic boolean addAll(Collection<? extends E> c) Adds all of the elements in the specified collection at the end of this deque, as if by callingaddLast(E)on each one, in the order that they are returned by the collection's iterator.- Specified by:
- addAllin interface- Collection<E>
- Specified by:
- addAllin interface- Deque<E>
- Overrides:
- addAllin class- AbstractCollection<E>
- Parameters:
- c- the elements to be inserted into this deque
- Returns:
- trueif this deque changed as a result of the call
- Throws:
- NullPointerException- if the specified collection or any of its elements are null
- See Also:
- AbstractCollection.add(Object)
 
 - 
offerFirstpublic boolean offerFirst(E e) Inserts the specified element at the front of this deque.- Specified by:
- offerFirstin interface- Deque<E>
- Parameters:
- e- the element to add
- Returns:
- true(as specified by- Deque.offerFirst(E))
- Throws:
- NullPointerException- if the specified element is null
 
 - 
offerLastpublic boolean offerLast(E e) Inserts the specified element at the end of this deque.- Specified by:
- offerLastin interface- Deque<E>
- Parameters:
- e- the element to add
- Returns:
- true(as specified by- Deque.offerLast(E))
- Throws:
- NullPointerException- if the specified element is null
 
 - 
removeFirstpublic E removeFirst() Description copied from interface:DequeRetrieves and removes the first element of this deque. This method differs frompollFirstonly in that it throws an exception if this deque is empty.- Specified by:
- removeFirstin interface- Deque<E>
- Returns:
- the head of this deque
- Throws:
- NoSuchElementException- if this deque is empty
 
 - 
removeLastpublic E removeLast() Description copied from interface:DequeRetrieves and removes the last element of this deque. This method differs frompollLastonly in that it throws an exception if this deque is empty.- Specified by:
- removeLastin interface- Deque<E>
- Returns:
- the tail of this deque
- Throws:
- NoSuchElementException- if this deque is empty
 
 - 
getFirstpublic E getFirst() Description copied from interface:DequeRetrieves, but does not remove, the first element of this deque. This method differs frompeekFirstonly in that it throws an exception if this deque is empty.- Specified by:
- getFirstin interface- Deque<E>
- Returns:
- the head of this deque
- Throws:
- NoSuchElementException- if this deque is empty
 
 - 
getLastpublic E getLast() Description copied from interface:DequeRetrieves, but does not remove, the last element of this deque. This method differs frompeekLastonly in that it throws an exception if this deque is empty.- Specified by:
- getLastin interface- Deque<E>
- Returns:
- the tail of this deque
- Throws:
- NoSuchElementException- if this deque is empty
 
 - 
removeFirstOccurrencepublic boolean removeFirstOccurrence(Object o) Removes the first occurrence of the specified element in this deque (when traversing the deque from head to tail). If the deque does not contain the element, it is unchanged. More formally, removes the first elementesuch thato.equals(e)(if such an element exists). Returnstrueif this deque contained the specified element (or equivalently, if this deque changed as a result of the call).- Specified by:
- removeFirstOccurrencein interface- Deque<E>
- Parameters:
- o- element to be removed from this deque, if present
- Returns:
- trueif the deque contained the specified element
 
 - 
removeLastOccurrencepublic boolean removeLastOccurrence(Object o) Removes the last occurrence of the specified element in this deque (when traversing the deque from head to tail). If the deque does not contain the element, it is unchanged. More formally, removes the last elementesuch thato.equals(e)(if such an element exists). Returnstrueif this deque contained the specified element (or equivalently, if this deque changed as a result of the call).- Specified by:
- removeLastOccurrencein interface- Deque<E>
- Parameters:
- o- element to be removed from this deque, if present
- Returns:
- trueif the deque contained the specified element
 
 - 
addpublic boolean add(E e) Inserts the specified element at the end of this deque.This method is equivalent to addLast(E).- Specified by:
- addin interface- Collection<E>
- Specified by:
- addin interface- Deque<E>
- Specified by:
- addin interface- Queue<E>
- Overrides:
- addin class- AbstractCollection<E>
- Parameters:
- e- the element to add
- Returns:
- true(as specified by- Collection.add(E))
- Throws:
- NullPointerException- if the specified element is null
 
 - 
offerpublic boolean offer(E e) Inserts the specified element at the end of this deque.This method is equivalent to offerLast(E).- Specified by:
- offerin interface- Deque<E>
- Specified by:
- offerin interface- Queue<E>
- Parameters:
- e- the element to add
- Returns:
- true(as specified by- Queue.offer(E))
- Throws:
- NullPointerException- if the specified element is null
 
 - 
removepublic E remove() Retrieves and removes the head of the queue represented by this deque. This method differs frompoll()only in that it throws an exception if this deque is empty.This method is equivalent to removeFirst().
 - 
pollpublic E poll() Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), or returnsnullif this deque is empty.This method is equivalent to Deque.pollFirst().
 - 
elementpublic E element() Retrieves, but does not remove, the head of the queue represented by this deque. This method differs frompeekonly in that it throws an exception if this deque is empty.This method is equivalent to getFirst().
 - 
peekpublic E peek() Retrieves, but does not remove, the head of the queue represented by this deque, or returnsnullif this deque is empty.This method is equivalent to Deque.peekFirst().
 - 
pushpublic void push(E e) Pushes an element onto the stack represented by this deque. In other words, inserts the element at the front of this deque.This method is equivalent to addFirst(E).- Specified by:
- pushin interface- Deque<E>
- Parameters:
- e- the element to push
- Throws:
- NullPointerException- if the specified element is null
 
 - 
poppublic E pop() 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().- Specified by:
- popin interface- Deque<E>
- Returns:
- the element at the front of this deque (which is the top of the stack represented by this deque)
- Throws:
- NoSuchElementException- if this deque is empty
 
 - 
sizepublic int size() Returns the number of elements in this deque.
 - 
isEmptypublic boolean isEmpty() Returnstrueif this deque contains no elements.- Specified by:
- isEmptyin interface- Collection<E>
- Overrides:
- isEmptyin class- AbstractCollection<E>
- Returns:
- trueif this deque contains no elements
 
 - 
spliteratorpublic Spliterator<E> spliterator() Creates a late-binding and fail-fastSpliteratorover the elements in this deque.The SpliteratorreportsSpliterator.SIZED,Spliterator.SUBSIZED,Spliterator.ORDERED, andSpliterator.NONNULL. Overriding implementations should document the reporting of additional characteristic values.- Specified by:
- spliteratorin interface- Collection<E>
- Specified by:
- spliteratorin interface- Iterable<E>
- Returns:
- a Spliteratorover the elements in this deque
- Since:
- 1.8
 
 - 
forEachpublic void forEach(Consumer<? super E> action) Description copied from interface:IterablePerforms the given action for each element of theIterableuntil all elements have been processed or the action throws an exception. Actions are performed in the order of iteration, if that order is specified. Exceptions thrown by the action are relayed to the caller.The behavior of this method is unspecified if the action performs side-effects that modify the underlying source of elements, unless an overriding class has specified a concurrent modification policy. - Specified by:
- forEachin interface- Iterable<E>
- Parameters:
- action- The action to be performed for each element
- Throws:
- NullPointerException- if the specified action is null
 
 - 
removeIfpublic boolean removeIf(Predicate<? super E> filter) Description copied from interface:CollectionRemoves all of the elements of this collection that satisfy the given predicate. Errors or runtime exceptions thrown during iteration or by the predicate are relayed to the caller.- Specified by:
- removeIfin interface- Collection<E>
- Parameters:
- filter- a predicate which returns- truefor elements to be removed
- Returns:
- trueif any elements were removed
- Throws:
- NullPointerException- if the specified filter is null
 
 - 
removeAllpublic boolean removeAll(Collection<?> c) Description copied from class:AbstractCollectionRemoves all of this collection's elements that are also contained in the specified collection (optional operation). After this call returns, this collection will contain no elements in common with the specified collection.- Specified by:
- removeAllin interface- Collection<E>
- Overrides:
- removeAllin class- AbstractCollection<E>
- Parameters:
- c- collection containing elements to be removed from this collection
- Returns:
- trueif this collection changed as a result of the call
- Throws:
- NullPointerException- if this collection contains one or more null elements and the specified collection does not support null elements (optional), or if the specified collection is null
- See Also:
- AbstractCollection.remove(Object),- AbstractCollection.contains(Object)
 
 - 
retainAllpublic boolean retainAll(Collection<?> c) Description copied from class:AbstractCollectionRetains only the elements in this collection that are contained in the specified collection (optional operation). In other words, removes from this collection all of its elements that are not contained in the specified collection.- Specified by:
- retainAllin interface- Collection<E>
- Overrides:
- retainAllin class- AbstractCollection<E>
- Parameters:
- c- collection containing elements to be retained in this collection
- Returns:
- trueif this collection changed as a result of the call
- Throws:
- NullPointerException- if this collection contains one or more null elements and the specified collection does not permit null elements (optional), or if the specified collection is null
- See Also:
- AbstractCollection.remove(Object),- AbstractCollection.contains(Object)
 
 - 
containspublic boolean contains(Object o) Returnstrueif this deque contains the specified element. More formally, returnstrueif and only if this deque contains at least one elementesuch thato.equals(e).- Specified by:
- containsin interface- Collection<E>
- Specified by:
- containsin interface- Deque<E>
- Overrides:
- containsin class- AbstractCollection<E>
- Parameters:
- o- object to be checked for containment in this deque
- Returns:
- trueif this deque contains the specified element
 
 - 
removepublic boolean remove(Object o) Removes a single instance of the specified element from this deque. If the deque does not contain the element, it is unchanged. More formally, removes the first elementesuch thato.equals(e)(if such an element exists). Returnstrueif this deque contained the specified element (or equivalently, if this deque changed as a result of the call).This method is equivalent to removeFirstOccurrence(Object).- Specified by:
- removein interface- Collection<E>
- Specified by:
- removein interface- Deque<E>
- Overrides:
- removein class- AbstractCollection<E>
- Parameters:
- o- element to be removed from this deque, if present
- Returns:
- trueif this deque contained the specified element
 
 - 
clearpublic void clear() Removes all of the elements from this deque. The deque will be empty after this call returns.- Specified by:
- clearin interface- Collection<E>
- Overrides:
- clearin class- AbstractCollection<E>
 
 - 
toArraypublic Object[] toArray() 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 interface- Collection<E>
- Overrides:
- toArrayin class- AbstractCollection<E>
- Returns:
- an array containing all of the elements in this deque
 
 - 
toArraypublic <T> T[] toArray(T[] a) 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:
 Note thatString[] y = x.toArray(new String[0]);toArray(new Object[0])is identical in function totoArray().- Specified by:
- toArrayin interface- Collection<E>
- Overrides:
- toArrayin class- AbstractCollection<E>
- Type Parameters:
- T- the component type of the array to contain the collection
- 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 deque
- NullPointerException- if the specified array is null
 
 - 
clonepublic ArrayDeque<E> clone() Returns a copy of this deque.
 
- 
 
-