|
JavaTM 2 Platform Std. Ed. v1.3 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object
|
+--java.util.AbstractCollection
|
+--java.util.AbstractList
|
+--java.util.AbstractSequentialList
|
+--java.util.LinkedList
Linked list implementation of the List interface. Implements all optional list operations, and permits all elements (including null). In addition to implementing the List interface, the LinkedList class provides uniformly named methods to get, remove and insert an element at the beginning and end of the list. These operations allow linked lists to be used as a stack, queue, or double-ended queue (deque).
All of the stack/queue/deque operations could be easily recast in terms of the standard list operations. They're included here primarily for convenience, though they may run slightly faster than the equivalent List operations.
All of the operations perform as could be expected for a doubly-linked list. Operations that index into the list will traverse the list from the begining or the end, whichever is closer to the specified index.
Note that this implementation is not synchronized. If multiple threads access a list concurrently, and at least one of the threads modifies the list structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements; merely setting the value of an element is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the list. If no such object exists, the list should be "wrapped" using the Collections.synchronizedList method. This is best done at creation time, to prevent accidental unsynchronized access to the list:
List list = Collections.synchronizedList(new LinkedList(...));
The iterators returned by the this class's iterator and listIterator methods are fail-fast: if the list is structurally modified at any time after the iterator is created, in any way except through the Iterator's own remove or add methods, the iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
List,
ArrayList,
Vector,
Collections.synchronizedList(List), Serialized Form| Fields inherited from class java.util.AbstractList |
modCount |
| Constructor Summary | |
LinkedList()
Constructs an empty list. |
|
LinkedList(Collection c)
Constructs a list containing the elements of the specified collection, in the order they are returned by the collection's iterator. |
|
| Method Summary | |
void |
add(int index,
Object element)
Inserts the specified element at the specified position in this list. |
boolean |
add(Object o)
Appends the specified element to the end of this list. |
boolean |
addAll(Collection c)
Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator. |
boolean |
addAll(int index,
Collection c)
Inserts all of the elements in the specified collection into this list, starting at the specified position. |
void |
addFirst(Object o)
Inserts the given element at the beginning of this list. |
void |
addLast(Object o)
Appends the given element to the end of this list. |
void |
clear()
Removes all of the elements from this list. |
Object |
clone()
Returns a shallow copy of this LinkedList. |
boolean |
contains(Object o)
Returns true if this list contains the specified element. |
Object |
get(int index)
Returns the element at the specified position in this list. |
Object |
getFirst()
Returns the first element in this list. |
Object |
getLast()
Returns the last element in this list. |
int |
indexOf(Object o)
Returns the index in this list of the first occurrence of the specified element, or -1 if the List does not contain this element. |
int |
lastIndexOf(Object o)
Returns the index in this list of the last occurrence of the specified element, or -1 if the list does not contain this element. |
ListIterator |
listIterator(int index)
Returns a list-iterator of the elements in this list (in proper sequence), starting at the specified position in the list. |
Object |
remove(int index)
Removes the element at the specified position in this list. |
boolean |
remove(Object o)
Removes the first occurrence of the specified element in this list. |
Object |
removeFirst()
Removes and returns the first element from this list. |
Object |
removeLast()
Removes and returns the last element from this list. |
Object |
set(int index,
Object element)
Replaces the element at the specified position in this list with the specified element. |
int |
size()
Returns the number of elements in this list. |
Object[] |
toArray()
Returns an array containing all of the elements in this list in the correct order. |
Object[] |
toArray(Object[] a)
Returns an array containing all of the elements in this list in the correct order. |
| Methods inherited from class java.util.AbstractSequentialList |
iterator |
| Methods inherited from class java.util.AbstractList |
equals, hashCode, listIterator, removeRange, subList |
| Methods inherited from class java.util.AbstractCollection |
containsAll, isEmpty, removeAll, retainAll, toString |
| Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.List |
containsAll, equals, hashCode, isEmpty, iterator, listIterator, removeAll, retainAll, subList |
| Constructor Detail |
public LinkedList()
public LinkedList(Collection c)
c - the collection whose elements are to be placed into this list.| Method Detail |
public Object getFirst()
public Object getLast()
NoSuchElementException - if this list is empty.public Object removeFirst()
NoSuchElementException - if this list is empty.public Object removeLast()
NoSuchElementException - if this list is empty.public void addFirst(Object o)
o - the element to be inserted at the beginning of this list.public void addLast(Object o)
o - the element to be inserted at the end of this list.public boolean contains(Object o)
contains in interface Listcontains in class AbstractCollectiono - element whose presence in this list is to be tested.public int size()
size in interface Listsize in class AbstractCollectionpublic boolean add(Object o)
add in interface Listadd in class AbstractListo - element to be appended to this list.public boolean remove(Object o)
remove in interface Listremove in class AbstractCollectiono - element to be removed from this list, if present.public boolean addAll(Collection c)
addAll in interface ListaddAll in class AbstractCollectionc - the elements to be inserted into this list.IndexOutOfBoundsException - if the specified index is out of
range (index < 0 || index > size()).
public boolean addAll(int index,
Collection c)
addAll in interface ListaddAll in class AbstractSequentialListindex - index at which to insert first element
from the specified collection.c - elements to be inserted into this list.IndexOutOfBoundsException - if the specified index is out of
range (index < 0 || index > size()).public void clear()
clear in interface Listclear in class AbstractListjava.util.ListUnsupportedOperationException - if the clear method is
not supported by this list.public Object get(int index)
get in interface Listget in class AbstractSequentialListindex - index of element to return.IndexOutOfBoundsException - if the specified index is is out of
range (index < 0 || index >= size()).
public Object set(int index,
Object element)
set in interface Listset in class AbstractSequentialListindex - index of element to replace.element - element to be stored at the specified position.IndexOutOfBoundsException - if the specified index is out of
range (index < 0 || index >= size()).
public void add(int index,
Object element)
add in interface Listadd in class AbstractSequentialListindex - index at which the specified element is to be inserted.element - element to be inserted.IndexOutOfBoundsException - if the specified index is out of
range (index < 0 || index > size()).public Object remove(int index)
remove in interface Listremove in class AbstractSequentialListindex - the index of the element to removed.IndexOutOfBoundsException - if the specified index is out of
range (index < 0 || index >= size()).public int indexOf(Object o)
indexOf in interface ListindexOf in class AbstractListo - element to search for.public int lastIndexOf(Object o)
lastIndexOf in interface ListlastIndexOf in class AbstractListo - element to search for.public ListIterator listIterator(int index)
The list-iterator is fail-fast: if the list is structurally modified at any time after the Iterator is created, in any way except through the list-iterator's own remove or add methods, the list-iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
listIterator in interface ListlistIterator in class AbstractSequentialListindex - index of first element to be returned from the
list-iterator (by a call to next).IndexOutOfBoundsException - if index is out of range
(index < 0 || index > size()).List.listIterator(int)public Object clone()
clone in class Objectpublic Object[] toArray()
toArray in interface ListtoArray in class AbstractCollectionpublic Object[] toArray(Object[] a)
If the list fits in the specified array with room to spare (i.e., the array has more elements than the list), the element in the array immediately following the end of the collection is set to null. This is useful in determining the length of the list only if the caller knows that the list does not contain any null elements.
toArray in interface ListtoArray in class AbstractCollectiona - the array into which the elements of the list are to
be stored, if it is big enough; otherwise, a new array of the
same runtime type is allocated for this purpose.ArrayStoreException - if the runtime type of a is not a
supertype of the runtime type of every element in this list.
|
JavaTM 2 Platform Std. Ed. v1.3 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
Java, Java 2D, and JDBC are trademarks or registered trademarks of Sun Microsystems, Inc. in the US and other countries.
Copyright 1993-2000 Sun Microsystems, Inc. 901 San Antonio Road
Palo Alto, California, 94303, U.S.A. All Rights Reserved.