java.util
Class LinkedList<T>
- Cloneable, Collection<E>, Deque, Iterable<E>, List<E>, Serializable
Linked list implementation of the List interface. In addition to the
methods of the List interface, this class provides access to the first
and last list elements in O(1) time for easy stack, queue, or double-ended
queue (deque) creation. The list is doubly-linked, with traversal to a
given index starting from the end closest to the element.
LinkedList is not synchronized, so if you need multi-threaded access,
consider using:
List l = Collections.synchronizedList(new LinkedList(...));
The iterators are
fail-fast, meaning that any structural
modification, except for
remove() called on the iterator
itself, cause the iterator to throw a
ConcurrentModificationException rather than exhibit
non-deterministic behavior.
LinkedList()- Create an empty linked list.
|
LinkedList(T> c)- Create a linked list containing the elements, in order, of a given
collection.
|
| S[] toArray(S[] a)- Returns an Array whose component type is the runtime component type of
the passed-in Array.
|
boolean | add(T o)- Adds an element to the end of the list.
|
void | add(int index, T o)- Inserts an element in the given position in the list.
|
boolean | addAll(T> c)- Append the elements of the collection in iteration order to the end of
this list.
|
boolean | addAll(int index, T> c)- Insert the elements of the collection in iteration order at the given
index of this list.
|
void | addFirst(T o)- Insert an element at the first of the list.
|
void | addLast(T o)- Insert an element at the last of the list.
|
void | clear()- Remove all elements from this list.
|
Object | clone()- Create a shallow copy of this LinkedList (the elements are not cloned).
|
boolean | contains(Object o)- Returns true if the list contains the given object.
|
Iterator | descendingIterator()- Obtain an Iterator over this list in reverse sequential order.
|
T | element()- Returns the first element of the list without removing
it.
|
T | get(int index)- Return the element at index.
|
T | getFirst()- Returns the first element in the list.
|
T | getLast()- Returns the last element in the list.
|
int | indexOf(Object o)- Returns the first index where the element is located in the list, or -1.
|
int | lastIndexOf(Object o)- Returns the last index where the element is located in the list, or -1.
|
ListIterator | listIterator(int index)- Obtain a ListIterator over this list, starting at a given index.
|
boolean | offer(T value)- Adds the specified element to the end of the list.
|
boolean | offerFirst(T value)- Inserts the specified element at the front of the list.
|
boolean | offerLast(T value)- Inserts the specified element at the end of the list.
|
T | peek()- Returns the first element of the list without removing
it.
|
T | peekFirst()- Returns the first element of the list without removing
it.
|
T | peekLast()- Returns the last element of the list without removing
it.
|
T | poll()- Removes and returns the first element of the list.
|
T | pollFirst()- Removes and returns the first element of the list.
|
T | pollLast()- Removes and returns the last element of the list.
|
T | pop()- Pops an element from the stack by removing and returning
the first element in the list.
|
void | push(T value)- Pushes an element on to the stack by adding it to the
front of the list.
|
T | remove()- Removes and returns the first element of the list.
|
T | remove(int index)- Removes the element at the given position from the list.
|
boolean | remove(Object o)- Removes the entry at the lowest index in the list that matches the given
object, comparing by
o == null ?
|
T | removeFirst()- Remove and return the first element in the list.
|
boolean | removeFirstOccurrence(Object o)- Removes the first occurrence of the specified element
from the list, when traversing the list from head to
tail.
|
T | removeLast()- Remove and return the last element in the list.
|
boolean | removeLastOccurrence(Object o)- Removes the last occurrence of the specified element
from the list, when traversing the list from head to
tail.
|
T | set(int index, T o)- Replace the element at the given location in the list.
|
int | size()- Returns the size of the list.
|
Object[] | toArray()- Returns an array which contains the elements of the list in order.
|
add, add, addAll, clear, equals, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, listIterator, remove, removeRange, set, subList |
T[] toArray, add, addAll, clear, contains, containsAll, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toString |
clone, equals, extends Object> getClass, finalize, hashCode, notify, notifyAll, toString, wait, wait, wait |
LinkedList
public LinkedList()
Create an empty linked list.
LinkedList
public LinkedList(T> c)
Create a linked list containing the elements, in order, of a given
collection.
c - the collection to populate this list from
S[] toArray
public S[] toArray(S[] a)
Returns an Array whose component type is the runtime component type of
the passed-in Array. The returned Array is populated with all of the
elements in this LinkedList. If the passed-in Array is not large enough
to store all of the elements in this List, a new Array will be created
and returned; if the passed-in Array is larger than the size
of this List, then size() index will be set to null.
- an array representation of this list
add
public boolean add(T o)
Adds an element to the end of the list.
- true, as it always succeeds
add
public void add(int index,
T o) Inserts an element in the given position in the list.
index - where to insert the elemento - the element to insert
addAll
public boolean addAll(T> c)
Append the elements of the collection in iteration order to the end of
this list. If this list is modified externally (for example, if this
list is the collection), behavior is unspecified.
c - the collection to append
- true if the list was modified
addAll
public boolean addAll(int index,
T> c) Insert the elements of the collection in iteration order at the given
index of this list. If this list is modified externally (for example,
if this list is the collection), behavior is unspecified.
c - the collection to append
- true if the list was modified
addFirst
public void addFirst(T o)
Insert an element at the first of the list.
o - the element to insert
addLast
public void addLast(T o)
Insert an element at the last of the list.
o - the element to insert
clone
public Object clone()
Create a shallow copy of this LinkedList (the elements are not cloned).
- clone in interface Object
- an object of the same class as this object, containing the
same elements in the same order
descendingIterator
public Iterator descendingIterator()
Obtain an Iterator over this list in reverse sequential order.
- an Iterator over the elements of the list in
reverse order.
element
public T element()
Returns the first element of the list without removing
it.
- the first element of the list.
getFirst
public T getFirst()
Returns the first element in the list.
getLast
public T getLast()
Returns the last element in the list.
listIterator
public ListIterator listIterator(int index)
Obtain a ListIterator over this list, starting at a given index. The
ListIterator returned by this method supports the add, remove and set
methods.
- listIterator in interface List<E>
- listIterator in interface AbstractSequentialList<E>
index - the index of the element to be returned by the first call to
next(), or size() to be initially positioned at the end of the list
offer
public boolean offer(T value)
Adds the specified element to the end of the list.
value - the value to add.
offerFirst
public boolean offerFirst(T value)
Inserts the specified element at the front of the list.
value - the element to insert.
offerLast
public boolean offerLast(T value)
Inserts the specified element at the end of the list.
value - the element to insert.
peek
public T peek()
Returns the first element of the list without removing
it.
- the first element of the list, or
null
if the list is empty.
peekFirst
public T peekFirst()
Returns the first element of the list without removing
it.
- the first element of the list, or
null
if the list is empty.
peekLast
public T peekLast()
Returns the last element of the list without removing
it.
- the last element of the list, or
null
if the list is empty.
poll
public T poll()
Removes and returns the first element of the list.
- the first element of the list, or
null
if the list is empty.
pollFirst
public T pollFirst()
Removes and returns the first element of the list.
- the first element of the list, or
null
if the list is empty.
pollLast
public T pollLast()
Removes and returns the last element of the list.
- the last element of the list, or
null
if the list is empty.
pop
public T pop()
Pops an element from the stack by removing and returning
the first element in the list. This is equivalent to
calling
removeFirst().
- the top of the stack, which is the first element
of the list.
push
public void push(T value)
Pushes an element on to the stack by adding it to the
front of the list. This is equivalent to calling
addFirst(T).
value - the element to push on to the stack.
remove
public T remove()
Removes and returns the first element of the list.
- the first element of the list.
removeFirst
public T removeFirst()
Remove and return the first element in the list.
- the former first element in the list
removeFirstOccurrence
public boolean removeFirstOccurrence(Object o)
Removes the first occurrence of the specified element
from the list, when traversing the list from head to
tail. The list is unchanged if the element is not found.
This is equivalent to calling
remove(Object).
o - the element to remove.
- true if an instance of the object was removed.
removeLast
public T removeLast()
Remove and return the last element in the list.
- the former last element in the list
removeLastOccurrence
public boolean removeLastOccurrence(Object o)
Removes the last occurrence of the specified element
from the list, when traversing the list from head to
tail. The list is unchanged if the element is not found.
o - the element to remove.
- true if an instance of the object was removed.
set
public T set(int index,
T o) Replace the element at the given location in the list.
index - which index to changeo - the new element
LinkedList.java -- Linked list implementation of the List interface
Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004, 2005, 2006 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version.