Java java.util ArrayDeque fields, constructors, methods, implement or subclass

Introduction

In this page you can find the methods, fields and constructors for java.util ArrayDeque.

The text is from its open source code.

Constructor

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

Method

boolean	add(E e) Inserts the specified element at the end of this deque.
boolean	addAll(Collection c) Adds all of the elements in the specified collection at the end of this deque, as if by calling #addLast on each one, in the order that they are returned by the collection's iterator.
void	addFirst(E e) Inserts the specified element at the front of this deque.
void	addLast(E e) Inserts the specified element at the end of this deque.
void	clear() Removes all of the elements from this deque.
ArrayDeque	clone() Returns a copy of this deque.
boolean	contains(Object o) Returns true if this deque contains the specified element.
Iterator	descendingIterator()
E	element() Retrieves, but does not remove, the head of the queue represented by this deque.
E	getFirst()
E	getLast()
boolean	isEmpty() Returns true if this deque contains no elements.
Iterator	iterator() Returns an iterator over the elements in this deque.
boolean	offer(E e) Inserts the specified element at the end of this deque.
boolean	offerFirst(E e) Inserts the specified element at the front of this deque.
boolean	offerLast(E e) Inserts the specified element at the end of this deque.
E	peek() Retrieves, but does not remove, the head of the queue represented by this deque, or returns null if this deque is empty.
E	peekFirst()
E	peekLast()
E	poll() 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.
E	pollFirst()
E	pollLast()
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 o) Removes a single instance of the specified element from this deque.
E	removeFirst()
boolean	removeFirstOccurrence(Object o) Removes the first occurrence of the specified element in this deque (when traversing the deque from head to tail).
E	removeLast()
boolean	removeLastOccurrence(Object o) 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 deque in proper sequence (from first to last element).
T[]	toArray(Class klazz)
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.