|
Java Platform 1.2 Beta 4 |
|||||||||
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
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 LinkedList concurrently, and at least one of the threads modifies the LinkedList 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 LinkedList. If no such object exists, the LinkedList should be "wrapped" using the Collections.synchronizedList method. This is best done at creation time, to prevent accidental unsynchronized access to the LinkedList:
List list = Collections.synchronizedList(new LinkedList(...));
The Iterators returned by LinkedList's iterator and listIterator methods are fail-fast: if the LinkedList 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 FormFields inherited from class java.util.AbstractList | |
modCount |
Constructor Summary | |
LinkedList()
Constructs an empty Linked List. |
|
LinkedList(Collection c)
Constructs a LinkedList 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 this LinkedList, 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 LinkedList, 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 ListIterator 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 LinkedList in the correct order. |
Object[] | toArray(Object[] a)
Returns an array containing all of the elements in this LinkedList in the correct order. |
Methods inherited from class java.util.AbstractSequentialList | |
iterator |
Methods inherited from class java.util.AbstractList | |
equals , hashCode , listIterator , 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 |
Constructor Detail |
public LinkedList()
public LinkedList(Collection c)
Method Detail |
public Object getFirst()
public Object getLast()
public Object removeFirst()
public Object removeLast()
public void addFirst(Object o)
public void addLast(Object o)
public boolean contains(Object o)
e
such that (o==null ? e==null :
o.equals(e))
.
o
- element whose presence in this List is to be tested.public int size()
public boolean add(Object o)
o
- element to be appended to this List.public boolean remove(Object o)
(o==null ? get(i)==null : o.equals(get(i)))
(if
such an element exists).
o
- element to be removed from this List, if present.public boolean addAll(Collection c)
index
- index at which to insert first element
from the specified collection.
c
- elements to be inserted into this LinkedList.public boolean addAll(int index, Collection c)
index
- index at which to insert first element
from the specified collection.
c
- elements to be inserted into this LinkedList.public void clear()
public Object get(int index)
index
- index of element to return.public Object set(int index, Object element)
index
- index of element to replace.
element
- element to be stored at the specified position.public void add(int index, Object element)
index
- index at which the specified element is to be inserted.
element
- element to be inserted.public Object remove(int index)
index
- the index of the element to removed.public int indexOf(Object o)
(o==null ? get(i)==null : o.equals(get(i)))
, or -1 if
there is no such index.
o
- element to search for.public int lastIndexOf(Object o)
(o==null ? get(i)==null : o.equals(get(i)))
, or -1 if
there is no such index.
o
- element to search for.public ListIterator listIterator(int index)
The ListIterator is fail-fast: if the LinkedList is structurally modified at any time after the Iterator is created, in any way except through the ListIterator'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.
index
- index of first element to be returned from the
ListIterator (by a call to getNext).List.listIterator(int)
public Object clone()
public Object[] toArray()
public Object[] toArray(Object[] a)
If the LinkedList fits in the specified array with room to spare (i.e., the array has more elements than the LinkedList), 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 LinkedList only if the caller knows that the LinkedList does not contain any null elements.
a
- the array into which the elements of the LinkedList are to
be stored, if it is big enough; otherwise, a new array of the
same runtime type is allocated for this purpose.
|
Java Platform 1.2 Beta 4 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |