LinkedList tutorial with example program

By candid | Posted : Dec 9, 2015 | Updated : Dec 9, 2015

All Implemented Interfaces:

Serializable, Cloneable, Iterable, Collection, Deque, Queue

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

}

Since:

1.6

See Also:

Serialized Form

Constructor Summary

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.

Method summary

Inserts the specified element at the end of this deque.

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

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.

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.

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

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.

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

Retrieves and removes the first element of this deque.

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

Retrieves and removes the last element of this deque.

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(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 inherited from class java.util.AbstractCollection

public boolean addAll(Collection c)

Adds all of the elements in the specified collection to this collection (optional operation). The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (This implies that the behavior of this call is undefined if the specified collection is this collection, and this collection is nonempty.)

public boolean containsAll(Collection c)

Returns true if this collection contains all of the elements in the specified collection.

Methods inherited from interface java.util.Collection

boolean removeAll(Collection c)

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.

boolean retainAll(Collection c)

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.

Methods inherited from class java.lang.Object

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

LinkedList tutorial with example program

Comments

Recent Posts