jsr166x
Class ArrayDeque<E>

java.lang.Object
  java.util.AbstractCollection<E>
      jsr166x.ArrayDeque<E>

Type Parameters:

E - the type of elements held in this collection

All Implemented Interfaces:

Serializable, Cloneable, Iterable<E>, Collection<E>, Queue<E>, Deque<E>

public class ArrayDeque<E>
extends AbstractCollection<E>
implements Deque<E>, Cloneable, Serializable

Resizable-array implementation of the Deque interface. 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 than Stack when used as as a stack, and faster than LinkedList when used as a queue.

Most ArrayDeque operations run in amortized constant time. Exceptions include remove, removeFirstOccurrence, removeLastOccurrence, contains , iterator.remove(), and the bulk operations, all of which run in linear time.

The iterators returned by this class's iterator method are fail-fast: If the deque is modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will generally throw a ConcurrentModificationException. 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 ConcurrentModificationException on 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 Collection and Iterator interfaces. This class is a member of the Java Collections Framework.

Since:

1.6

Author:

Josh Bloch and Doug Lea

See Also:

Serialized Form

Constructor Summary

ArrayDeque()
Constructs an empty array deque with the an initial capacity sufficient to hold 16 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.

ArrayDeque(int numElements)
Constructs an empty array deque with an initial capacity sufficient to hold the specified number of elements.

Method Summary

boolean	add(E e) Inserts the specified element to the end of this deque.
void	addFirst(E e) Inserts the specified element to the front this deque.
void	addLast(E e) Inserts the specified element to the end this deque.
void	clear() Removes all of the elements from this deque.
ArrayDeque<E>	clone() Returns a copy of this deque.
boolean	contains(Object o) Returns true if this deque contains the specified element.
E	element() Retrieves, but does not remove, the head of the queue represented by this deque.
E	getFirst() Retrieves, but does not remove, the first element of this deque.
E	getLast() Retrieves, but does not remove, the last element of this deque.
boolean	isEmpty() Returns true if this collection contains no elements.
Iterator<E>	iterator() Returns an iterator over the elements in this deque.
boolean	offer(E e) Inserts the specified element to the end of this deque.
boolean	offerFirst(E e) Inserts the specified element to the front this deque.
boolean	offerLast(E e) Inserts the specified element to the end this deque.
E	peek() Retrieves, but does not remove, the head of the queue represented by this deque, returning null if this deque is empty.
E	peekFirst() Retrieves, but does not remove, the first element of this deque, returning null if this deque is empty.
E	peekLast() Retrieves, but does not remove, the last element of this deque, returning null if this deque is empty.
E	poll() Retrieves and removes the head of the queue represented by this deque, or null if this deque is empty.
E	pollFirst() Retrieves and removes the first element of this deque, or null if this deque is empty.
E	pollLast() Retrieves and removes the last element of this deque, or null if this deque is empty.
E	pop() Pops an element from the stack represented by this deque.
void	push(E e) Pushes an element onto the stack represented by this deque.
E	remove() Retrieves and removes the head of the queue represented by this deque.
boolean	remove(Object e) Removes a single instance of the specified element from this deque.
E	removeFirst() Retrieves and removes the first element of this deque.
boolean	removeFirstOccurrence(Object e) Removes the first occurrence of the specified element in this deque (when traversing the deque from head to tail).
E	removeLast() Retrieves and removes the last element of this deque.
boolean	removeLastOccurrence(Object e) Removes the last occurrence of the specified element in this deque (when traversing the deque from head to tail).
int	size() Returns the number of elements in this deque.
Object[]	toArray() Returns an array containing all of the elements in this list in the correct order.
<T> T[]	toArray(T[] a) Returns an array containing all of the elements in this deque in the correct order; the runtime type of the returned array is that of the specified array.

Methods inherited from class java.util.AbstractCollection

addAll, containsAll, removeAll, retainAll, toString

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

addAll, containsAll, equals, hashCode, removeAll, retainAll

Constructor Detail

ArrayDeque

public ArrayDeque()

Constructs an empty array deque with the an initial capacity sufficient to hold 16 elements.

ArrayDeque

public 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

ArrayDeque

public 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

addFirst

public void addFirst(E e)

Inserts the specified element to the front this deque.

Specified by:

addFirst in interface Deque<E>

Parameters:

e - the element to insert

Throws:

NullPointerException - if e is null

addLast

public void addLast(E e)

Inserts the specified element to the end this deque. This method is equivalent to Collection.add(E) and push(E).

Specified by:

addLast in interface Deque<E>

Parameters:

e - the element to insert

Throws:

NullPointerException - if e is null

pollFirst

public E pollFirst()

Retrieves and removes the first element of this deque, or null if this deque is empty.

Specified by:

pollFirst in interface Deque<E>

Returns:

the first element of this deque, or null if this deque is empty

pollLast

public E pollLast()

Retrieves and removes the last element of this deque, or null if this deque is empty.

Specified by:

pollLast in interface Deque<E>

Returns:

the last element of this deque, or null if this deque is empty

offerFirst

public boolean offerFirst(E e)

Inserts the specified element to the front this deque.

Specified by:

offerFirst in interface Deque<E>

Parameters:

e - the element to insert

Returns:

true (as per the spec for Deque.offerFirst(E))

Throws:

NullPointerException - if e is null

offerLast

public boolean offerLast(E e)

Inserts the specified element to the end this deque.

Specified by:

offerLast in interface Deque<E>

Parameters:

e - the element to insert

Returns:

true (as per the spec for Deque.offerLast(E))

Throws:

NullPointerException - if e is null

removeFirst

public E removeFirst()

Retrieves and removes the first element of this deque. This method differs from the pollFirst method in that it throws an exception if this deque is empty.

Specified by:

removeFirst in interface Deque<E>

Returns:

the first element of this deque

Throws:

NoSuchElementException - if this deque is empty

removeLast

public E removeLast()

Retrieves and removes the last element of this deque. This method differs from the pollLast method in that it throws an exception if this deque is empty.

Specified by:

removeLast in interface Deque<E>

Returns:

the last element of this deque

Throws:

NoSuchElementException - if this deque is empty

peekFirst

public E peekFirst()

Retrieves, but does not remove, the first element of this deque, returning null if this deque is empty.

Specified by:

peekFirst in interface Deque<E>

Returns:

the first element of this deque, or null if this deque is empty

peekLast

public E peekLast()

Retrieves, but does not remove, the last element of this deque, returning null if this deque is empty.

Specified by:

peekLast in interface Deque<E>

Returns:

the last element of this deque, or null if this deque is empty

getFirst

public E getFirst()

Retrieves, but does not remove, the first element of this deque. This method differs from the peek method only in that it throws an exception if this deque is empty.

Specified by:

getFirst in interface Deque<E>

Returns:

the first element of this deque

Throws:

NoSuchElementException - if this deque is empty

getLast

public E getLast()

Retrieves, but does not remove, the last element of this deque. This method differs from the peek method only in that it throws an exception if this deque is empty.

Specified by:

getLast in interface Deque<E>

Returns:

the last element of this deque

Throws:

NoSuchElementException - if this deque is empty

removeFirstOccurrence

public boolean removeFirstOccurrence(Object e)

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.

Specified by:

removeFirstOccurrence in interface Deque<E>

Parameters:

e - element to be removed from this deque, if present

Returns:

true if the deque contained the specified element

removeLastOccurrence

public boolean removeLastOccurrence(Object e)

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.

Specified by:

removeLastOccurrence in interface Deque<E>

Parameters:

e - element to be removed from this deque, if present

Returns:

true if the deque contained the specified element

offer

public boolean offer(E e)

Inserts the specified element to the end of this deque.

This method is equivalent to offerLast(E).

Specified by:

offer in interface Queue<E>

Specified by:

offer in interface Deque<E>

Parameters:

e - the element to insert

Returns:

true (as per the spec for Queue.offer(E))

Throws:

NullPointerException - if e is null

add

public boolean add(E e)

Inserts the specified element to the end of this deque.

This method is equivalent to addLast(E).

Specified by:

add in interface Collection<E>

Specified by:

add in interface Queue<E>

Specified by:

add in interface Deque<E>

Overrides:

add in class AbstractCollection<E>

Parameters:

e - the element to insert

Returns:

true (as per the spec for Collection.add(E))

Throws:

NullPointerException - if e is null

poll

public E poll()

Retrieves and removes the head of the queue represented by this deque, or null if this deque is empty. In other words, retrieves and removes the first element of this deque, or null if this deque is empty.

This method is equivalent to pollFirst().

Specified by:

poll in interface Queue<E>

Specified by:

poll in interface Deque<E>

Returns:

the first element of this deque, or null if this deque is empty

remove

public E remove()

Retrieves and removes the head of the queue represented by this deque. This method differs from the poll method in that it throws an exception if this deque is empty.

This method is equivalent to removeFirst().

Specified by:

remove in interface Queue<E>

Specified by:

remove in interface Deque<E>

Returns:

the head of the queue represented by this deque

Throws:

NoSuchElementException - if this deque is empty

peek

public E peek()

Retrieves, but does not remove, the head of the queue represented by this deque, returning null if this deque is empty.

This method is equivalent to peekFirst()

Specified by:

peek in interface Queue<E>

Specified by:

peek in interface Deque<E>

Returns:

the head of the queue represented by this deque, or null if this deque is empty

element

public E element()

Retrieves, but does not remove, the head of the queue represented by this deque. This method differs from the peek method only in that it throws an exception if this deque is empty.

This method is equivalent to getFirst()

Specified by:

element in interface Queue<E>

Specified by:

element in interface Deque<E>

Returns:

the head of the queue represented by this deque

Throws:

NoSuchElementException - if this deque is empty

push

public void push(E e)

Pushes an element onto the stack represented by this deque. In other words, inserts the element to the front this deque.

This method is equivalent to addFirst(E).

Specified by:

push in interface Deque<E>

Parameters:

e - the element to push

Throws:

NullPointerException - if e is null

pop

public E pop()

Pops an element from the stack represented by this deque. In other words, removes and returns the the first element of this deque.

This method is equivalent to removeFirst().

Specified by:

pop in 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

size

public int size()

Returns the number of elements in this deque.

Specified by:

size in interface Collection<E>

Specified by:

size in class AbstractCollection<E>

Returns:

the number of elements in this deque

isEmpty

public boolean isEmpty()

Returns true if this collection contains no elements.

Specified by:

isEmpty in interface Collection<E>

Overrides:

isEmpty in class AbstractCollection<E>

Returns:

true if this collection contains no elements.

iterator

public Iterator<E> iterator()

Returns an iterator over the elements in this deque. The elements will be ordered from first (head) to last (tail). This is the same order that elements would be dequeued (via successive calls to remove() or popped (via successive calls to pop()).

Specified by:

iterator in interface Iterable<E>

Specified by:

iterator in interface Collection<E>

Specified by:

iterator in interface Deque<E>

Specified by:

iterator in class AbstractCollection<E>

Returns:

an Iterator over the elements in this deque

contains

public boolean contains(Object o)

Returns true if this deque contains the specified element. More formally, returns true if and only if this deque contains at least one element e such that e.equals(o).

Specified by:

contains in interface Collection<E>

Overrides:

contains in class AbstractCollection<E>

Parameters:

o - object to be checked for containment in this deque

Returns:

true if this deque contains the specified element

remove

public boolean remove(Object e)

Removes a single instance of the specified element from this deque. This method is equivalent to removeFirstOccurrence(java.lang.Object).

Specified by:

remove in interface Collection<E>

Overrides:

remove in class AbstractCollection<E>

Parameters:

e - element to be removed from this deque, if present

Returns:

true if this deque contained the specified element

clear

public void clear()

Removes all of the elements from this deque.

Specified by:

clear in interface Collection<E>

Overrides:

clear in class AbstractCollection<E>

toArray

public Object[] toArray()

Returns an array containing all of the elements in this list in the correct order.

Specified by:

toArray in interface Collection<E>

Overrides:

toArray in class AbstractCollection<E>

Returns:

an array containing all of the elements in this list in the correct order

toArray

public <T> T[] toArray(T[] a)

Returns an array containing all of the elements in this deque in the correct order; 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 the deque fits in the specified array with room to spare (i.e., the array has more elements than the deque), the element in the array immediately following the end of the collection is set to null.

Specified by:

toArray in interface Collection<E>

Overrides:

toArray in class AbstractCollection<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 the elements of the deque

Throws:

ArrayStoreException - if the runtime type of a is not a supertype of the runtime type of every element in this deque

clone

public ArrayDeque<E> clone()

Returns a copy of this deque.

Overrides:

clone in class Object

Returns:

a copy of this deque