Serializable, Cloneable, Iterable, Collection, Deque, Queue

public class ArrayDeque
extends AbstractCollection
implements Deque, Cloneable, Serializable
{
  //

}

1.6

Serialized Form

ArrayDeque()

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

ArrayDeque(Collection 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.

Inserts the specified element at the end of this deque.

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 a copy of this deque.

Returns true if this deque contains the specified element.

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.

Retrieves, but does not remove, the first element of this deque.

Retrieves, but does not remove, the last element of this deque.

Returns an iterator over the elements in this deque.

Inserts the specified element at the end 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, 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.

Retrieves and removes the head of the queue represented by this deque.

Removes a single instance of the specified element from this deque.

Retrieves and removes the first element of this deque.

Removes the first occurrence of the specified element in this deque (when traversing the deque from head to tail).

Retrieves and removes the last element of this deque.

Removes the last occurrence of the specified element in this deque (when traversing the deque from head to tail).

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).

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 true if this collection contains all of the elements in the specified collection.

Removes 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.

Retains 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.

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

Recent Posts

Struts tutorial with example program

Struts 2 default XML validation tutorial

Struts 2 Form validation tutorial

Struts 2 Redirect Action tutorial

Struts 2 Multi action tutorial

Struts 2 running hello world application

List of core java example program

Public JRE vs Private JRE in java setup

Understanding JDK and JRE in java installation

Java PriorityQueue tutorial with example program