public class

LinkedList

extends AbstractSequentialList<E>
implements Serializable Cloneable Deque<E> List<E> Queue<E>
java.lang.Object
   ↳ java.util.AbstractCollection<E>
     ↳ java.util.AbstractList<E>
       ↳ java.util.AbstractSequentialList<E>
         ↳ java.util.LinkedList<E>

Class Overview

LinkedList is an implementation of List, backed by a doubly-linked list. All optional operations including adding, removing, and replacing elements are supported.

All elements are permitted, including null.

This class is primarily useful if you need queue-like behavior. It may also be useful as a list if you expect your lists to contain zero or one element, but still require the ability to scale to slightly larger numbers of elements. In general, though, you should probably use ArrayList if you don't need the queue-like behavior.

Summary

[Expand]
Inherited Fields
From class java.util.AbstractList
Public Constructors
LinkedList()
Constructs a new empty instance of LinkedList.
LinkedList(Collection<? extends E> collection)
Constructs a new instance of LinkedList that holds all of the elements contained in the specified collection.
Public Methods
boolean add(E object)
Adds the specified object at the end of this LinkedList.
void add(int location, E object)
Inserts the specified object into this LinkedList at the specified location.
boolean addAll(Collection<? extends E> collection)
Adds the objects in the specified Collection to this LinkedList.
boolean addAll(int location, Collection<? extends E> collection)
Inserts the objects in the specified collection at the specified location in this LinkedList.
void addFirst(E object)
Adds the specified object at the beginning of this LinkedList.
void addLast(E object)
Adds the specified object at the end of this LinkedList.
void clear()
Removes all elements from this LinkedList, leaving it empty.
Object clone()
Returns a new LinkedList with the same elements and size as this LinkedList.
boolean contains(Object object)
Searches this LinkedList for the specified object.
Iterator<E> 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).
E get(int location)
Returns the element at the specified location in this list.
E getFirst()
Returns the first element in this LinkedList.
E getLast()
Returns the last element in this LinkedList.
int indexOf(Object object)
Searches this list for the specified object and returns the index of the first occurrence.
int lastIndexOf(Object object)
Searches this LinkedList for the specified object and returns the index of the last occurrence.
ListIterator<E> listIterator(int location)
Returns a ListIterator on the elements of this LinkedList.
boolean offer(E o)
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, returning true upon success and throwing an IllegalStateException if no space is currently available.
E remove()
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque).
E remove(int location)
Removes the object at the specified location from this LinkedList.
boolean remove(Object object)
Removes one instance of the specified object from this Collection if one is contained (optional).
E removeFirst()
Removes the first object from this LinkedList.
boolean removeFirstOccurrence(Object o)
Removes the first occurrence of the specified element from this deque.
E removeLast()
Removes the last object from this LinkedList.
boolean removeLastOccurrence(Object o)
Removes the last occurrence of the specified element from this deque.
E set(int location, E object)
Replaces the element at the specified location in this LinkedList with the specified object.
int size()
Returns the number of elements in this LinkedList.
<T> T[] toArray(T[] contents)
Returns an array containing all elements contained in this LinkedList.
Object[] toArray()
Returns a new array containing all elements contained in this LinkedList.
[Expand]
Inherited Methods
From class java.util.AbstractSequentialList
From class java.util.AbstractList
From class java.util.AbstractCollection
From class java.lang.Object
From interface java.lang.Iterable
From interface java.util.Collection
From interface java.util.Deque
From interface java.util.List
From interface java.util.Queue

Public Constructors

public LinkedList ()

Since: API Level 1

Constructs a new empty instance of LinkedList.

public LinkedList (Collection<? extends E> collection)

Since: API Level 1

Constructs a new instance of LinkedList that holds all of the elements contained in the specified collection. The order of the elements in this new LinkedList will be determined by the iteration order of collection.

Parameters
collection the collection of elements to add.

Public Methods

public boolean add (E object)

Since: API Level 1

Adds the specified object at the end of this LinkedList.

Parameters
object the object to add.
Returns
  • always true

public void add (int location, E object)

Since: API Level 1

Inserts the specified object into this LinkedList at the specified location. The object is inserted before any previous element at the specified location. If the location is equal to the size of this LinkedList, the object is added at the end.

Parameters
location the index at which to insert.
object the object to add.
Throws
IndexOutOfBoundsException if location < 0 || >= size()

public boolean addAll (Collection<? extends E> collection)

Since: API Level 1

Adds the objects in the specified Collection to this LinkedList.

Parameters
collection the collection of objects.
Returns
  • true if this LinkedList is modified, false otherwise.

public boolean addAll (int location, Collection<? extends E> collection)

Since: API Level 1

Inserts the objects in the specified collection at the specified location in this LinkedList. The objects are added in the order they are returned from the collection's iterator.

Parameters
location the index at which to insert.
collection the collection of objects
Returns
  • true if this LinkedList is modified, false otherwise.
Throws
ClassCastException if the class of an object is inappropriate for this list.
IllegalArgumentException if an object cannot be added to this list.
IndexOutOfBoundsException if location < 0 || > size()

public void addFirst (E object)

Since: API Level 1

Adds the specified object at the beginning of this LinkedList.

Parameters
object the object to add.

public void addLast (E object)

Since: API Level 1

Adds the specified object at the end of this LinkedList.

Parameters
object the object to add.

public void clear ()

Since: API Level 1

Removes all elements from this LinkedList, leaving it empty.

See Also

public Object clone ()

Since: API Level 1

Returns a new LinkedList with the same elements and size as this LinkedList.

Returns
  • a shallow copy of this LinkedList.
See Also

public boolean contains (Object object)

Since: API Level 1

Searches this LinkedList for the specified object.

Parameters
object the object to search for.
Returns
  • true if object is an element of this LinkedList, false otherwise

public Iterator<E> descendingIterator ()

Since: API Level 9

Returns an iterator over the elements in this deque in reverse sequential order. The elements will be returned in order from last (tail) to first (head).

Returns
  • an iterator over the elements in this deque in reverse sequence
See Also

public E element ()

Since: API Level 1

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

This method is equivalent to getFirst().

Returns
  • the head of the queue represented by this deque

public E get (int location)

Since: API Level 1

Returns the element at the specified location in this list.

Parameters
location the index of the element to return.
Returns
  • the element at the specified index.

public E getFirst ()

Since: API Level 1

Returns the first element in this LinkedList.

Returns
  • the first element.
Throws
NoSuchElementException if this LinkedList is empty.

public E getLast ()

Since: API Level 1

Returns the last element in this LinkedList.

Returns
  • the last element
Throws
NoSuchElementException if this LinkedList is empty

public int indexOf (Object object)

Since: API Level 1

Searches this list for the specified object and returns the index of the first occurrence.

Parameters
object the object to search for.
Returns
  • the index of the first occurrence of the object, or -1 if it was not found.

public int lastIndexOf (Object object)

Since: API Level 1

Searches this LinkedList for the specified object and returns the index of the last occurrence.

Parameters
object the object to search for
Returns
  • the index of the last occurrence of the object, or -1 if it was not found.

public ListIterator<E> listIterator (int location)

Since: API Level 1

Returns a ListIterator on the elements of this LinkedList. The elements are iterated in the same order that they occur in the LinkedList. The iteration starts at the specified location.

Parameters
location the index at which to start the iteration
Returns
  • a ListIterator on the elements of this LinkedList
Throws
IndexOutOfBoundsException if location < 0 || >= size()
See Also

public boolean offer (E o)

Since: API Level 1

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. When using a capacity-restricted deque, this method is generally preferable to the add(E) method, which can fail to insert an element only by throwing an exception.

This method is equivalent to offerLast(E).

Parameters
o the element to add
Returns
  • true if the element was added to this deque, else false

public boolean offerFirst (E e)

Since: API Level 9

Inserts the specified element at the front of this deque unless it would violate capacity restrictions. When using a capacity-restricted deque, this method is generally preferable to the addFirst(E) method, which can fail to insert an element only by throwing an exception.

Parameters
e the element to add
Returns
  • true if the element was added to this deque, else false
See Also

public boolean offerLast (E e)

Since: API Level 9

Inserts the specified element at the end of this deque unless it would violate capacity restrictions. When using a capacity-restricted deque, this method is generally preferable to the addLast(E) method, which can fail to insert an element only by throwing an exception.

Parameters
e the element to add
Returns
  • true if the element was added to this deque, else false
See Also

public E peek ()

Since: API Level 1

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.

This method is equivalent to peekFirst().

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

public E peekFirst ()

Since: API Level 9

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

Returns
  • the head of this deque, or null if this deque is empty
See Also

public E peekLast ()

Since: API Level 9

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

Returns
  • the tail of this deque, or null if this deque is empty
See Also

public E poll ()

Since: API Level 1

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.

This method is equivalent to pollFirst().

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

public E pollFirst ()

Since: API Level 9

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

Returns
  • the head of this deque, or null if this deque is empty
See Also

public E pollLast ()

Since: API Level 9

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

Returns
  • the tail of this deque, or null if this deque is empty
See Also

public E pop ()

Since: API Level 9

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

This method is equivalent to removeFirst().

Returns
  • the element at the front of this deque (which is the top of the stack represented by this deque)
See Also

public void push (E e)

Since: API Level 9

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, returning true upon success and throwing an IllegalStateException if no space is currently available.

This method is equivalent to addFirst(E).

Parameters
e the element to push
See Also

public E remove ()

Since: API Level 1

Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque). This method differs from poll only in that it throws an exception if this deque is empty.

This method is equivalent to removeFirst().

Returns
  • the head of the queue represented by this deque

public E remove (int location)

Since: API Level 1

Removes the object at the specified location from this LinkedList.

Parameters
location the index of the object to remove
Returns
  • the removed object
Throws
IndexOutOfBoundsException if location < 0 || >= size()

public boolean remove (Object object)

Since: API Level 1

Removes one instance of the specified object from this Collection if one is contained (optional). This implementation iterates over this Collection and tests for each element e returned by the iterator, whether e is equal to the given object. If object != null then this test is performed using object.equals(e), otherwise using object == null. If an element equal to the given object is found, then the remove method is called on the iterator and true is returned, false otherwise. If the iterator does not support removing elements, an UnsupportedOperationException is thrown.

Parameters
object the object to remove.
Returns
  • true if this Collection is modified, false otherwise.

public E removeFirst ()

Since: API Level 1

Removes the first object from this LinkedList.

Returns
  • the removed object.
Throws
NoSuchElementException if this LinkedList is empty.

public boolean removeFirstOccurrence (Object o)

Since: API Level 9

Removes the first occurrence of the specified element from this deque. If the deque does not contain the element, it is unchanged. More formally, removes the first element e such that (o==null ? e==null : o.equals(e)) (if such an element exists). Returns true if this deque contained the specified element (or equivalently, if this deque changed as a result of the call).

Parameters
o element to be removed from this deque, if present
Returns
  • true if an element was removed as a result of this call
See Also

public E removeLast ()

Since: API Level 1

Removes the last object from this LinkedList.

Returns
  • the removed object.
Throws
NoSuchElementException if this LinkedList is empty.

public boolean removeLastOccurrence (Object o)

Since: API Level 9

Removes the last occurrence of the specified element from this deque. If the deque does not contain the element, it is unchanged. More formally, removes the last element e such that (o==null ? e==null : o.equals(e)) (if such an element exists). Returns true if this deque contained the specified element (or equivalently, if this deque changed as a result of the call).

Parameters
o element to be removed from this deque, if present
Returns
  • true if an element was removed as a result of this call
See Also

public E set (int location, E object)

Since: API Level 1

Replaces the element at the specified location in this LinkedList with the specified object.

Parameters
location the index at which to put the specified object.
object the object to add.
Returns
  • the previous element at the index.
Throws
ClassCastException if the class of an object is inappropriate for this list.
IllegalArgumentException if an object cannot be added to this list.
IndexOutOfBoundsException if location < 0 || >= size()

public int size ()

Since: API Level 1

Returns the number of elements in this LinkedList.

Returns
  • the number of elements in this LinkedList.

public T[] toArray (T[] contents)

Since: API Level 1

Returns an array containing all elements contained in this LinkedList. If the specified array is large enough to hold the elements, the specified array is used, otherwise an array of the same type is created. If the specified array is used and is larger than this LinkedList, the array element following the collection elements is set to null.

Parameters
contents the array.
Returns
  • an array of the elements from this LinkedList.
Throws
ArrayStoreException if the type of an element in this LinkedList cannot be stored in the type of the specified array.

public Object[] toArray ()

Since: API Level 1

Returns a new array containing all elements contained in this LinkedList.

Returns
  • an array of the elements from this LinkedList.