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

Introduction

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

The text is from its open source code.

Implementation

java.util.Deque has the following implementations.
Click this link to see all its implementation.

Method

boolean	add(E e) Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
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 if it is possible to do so immediately without violating capacity restrictions, throwing an IllegalStateException if no space is currently available.
void	addLast(E e) Inserts the specified element at the end of this deque if it is possible to do so immediately without violating capacity restrictions, throwing an IllegalStateException if no space is currently available.
void	clear() Removes all of the elements from this collection (optional operation).
boolean	contains(Object o) Returns true if this deque contains the specified element.
boolean	containsAll(Collection c) Returns true if this collection contains all of the elements in the specified collection.
Iterator	descendingIterator() Returns an iterator over the elements in this deque in reverse sequential order.
E	element() Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque).
void	forEach(Consumer action) Performs the given action for each element of the Iterable until all elements have been processed or the action throws an exception.
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	iterator() Returns an iterator over the elements in this deque in proper sequence.
boolean	offer(E e) Inserts the specified element into the queue represented by this deque (in other words, at the tail of this deque) if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.
boolean	offerFirst(E e) Inserts the specified element at the front of this deque unless it would violate capacity restrictions.
boolean	offerLast(E e) Inserts the specified element at the end of this deque unless it would violate capacity restrictions.
E	peek() Retrieves, but does not remove, 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	peekFirst() Retrieves, but does not remove, the first element of this deque, or returns null if this deque is empty.
E	peekLast() Retrieves, but does not remove, the last element of this deque, or returns null if this deque is empty.
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() Retrieves and removes the first element of this deque, or returns null if this deque is empty.
E	pollLast() Retrieves and removes the last element of this deque, or returns 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 (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, throwing an IllegalStateException if no space is currently available.
boolean	remove(Object o) Removes the first occurrence of the specified element from this deque.
E	remove() Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque).
boolean	removeAll(Collection c) Removes all of this collection's elements that are also contained in the specified collection (optional operation).
E	removeFirst() Retrieves and removes the first element of this deque.
boolean	removeFirstOccurrence(Object o) Removes the first occurrence of the specified element from this deque.
E	removeLast() Retrieves and removes the last element of this deque.
boolean	removeLastOccurrence(Object o) Removes the last occurrence of the specified element from this deque.
int	size() Returns the number of elements in this deque.
Stream	stream() Returns a sequential Stream with this collection as its source.
Object[]	toArray() Returns an array containing all of the elements in this collection.
T[]	toArray(T[] a) Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.