| Methods Summary |
|---|
| public boolean | add(E e)Appends the specified element to the end of this list.
This method is equivalent to {@link #addLast}.
addBefore(e, header);
return true;
|
| public void | add(int index, E element)Inserts the specified element at the specified position in this list.
Shifts the element currently at that position (if any) and any
subsequent elements to the right (adds one to their indices).
addBefore(element, (index==size ? header : entry(index)));
|
| public boolean | addAll(java.util.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. The behavior of this operation is undefined if
the specified collection is modified while the operation is in
progress. (Note that this will occur if the specified collection is
this list, and it's nonempty.)
return addAll(size, c);
|
| public boolean | addAll(int index, java.util.Collection c)Inserts all of the elements in the specified collection into this
list, starting at the specified position. Shifts the element
currently at that position (if any) and any subsequent elements to
the right (increases their indices). The new elements will appear
in the list in the order that they are returned by the
specified collection's iterator.
if (index < 0 || index > size)
throw new IndexOutOfBoundsException("Index: "+index+
", Size: "+size);
Object[] a = c.toArray();
int numNew = a.length;
if (numNew==0)
return false;
modCount++;
Entry<E> successor = (index==size ? header : entry(index));
Entry<E> predecessor = successor.previous;
for (int i=0; i<numNew; i++) {
Entry<E> e = new Entry<E>((E)a[i], successor, predecessor);
predecessor.next = e;
predecessor = e;
}
successor.previous = predecessor;
size += numNew;
return true;
|
| private java.util.LinkedList$Entry | addBefore(E e, java.util.LinkedList$Entry entry)
Entry<E> newEntry = new Entry<E>(e, entry, entry.previous);
newEntry.previous.next = newEntry;
newEntry.next.previous = newEntry;
size++;
modCount++;
return newEntry;
|
| public void | addFirst(E e)Inserts the specified element at the beginning of this list.
addBefore(e, header.next);
|
| public void | addLast(E e)Appends the specified element to the end of this list.
This method is equivalent to {@link #add}.
addBefore(e, header);
|
| public void | clear()Removes all of the elements from this list.
Entry<E> e = header.next;
while (e != header) {
Entry<E> next = e.next;
e.next = e.previous = null;
e.element = null;
e = next;
}
header.next = header.previous = header;
size = 0;
modCount++;
|
| public java.lang.Object | clone()Returns a shallow copy of this LinkedList. (The elements
themselves are not cloned.)
LinkedList<E> clone = null;
try {
clone = (LinkedList<E>) super.clone();
} catch (CloneNotSupportedException e) {
throw new InternalError();
}
// Put clone into "virgin" state
clone.header = new Entry<E>(null, null, null);
clone.header.next = clone.header.previous = clone.header;
clone.size = 0;
clone.modCount = 0;
// Initialize clone with our elements
for (Entry<E> e = header.next; e != header; e = e.next)
clone.add(e.element);
return clone;
|
| public boolean | contains(java.lang.Object o)Returns true if this list contains the specified element.
More formally, returns true if and only if this list contains
at least one element e such that
(o==null ? e==null : o.equals(e)).
return indexOf(o) != -1;
|
| public java.util.Iterator | descendingIterator()
return new DescendingIterator();
|
| public E | element()Retrieves, but does not remove, the head (first element) of this list.
return getFirst();
|
| private java.util.LinkedList$Entry | entry(int index)Returns the indexed entry.
if (index < 0 || index >= size)
throw new IndexOutOfBoundsException("Index: "+index+
", Size: "+size);
Entry<E> e = header;
if (index < (size >> 1)) {
for (int i = 0; i <= index; i++)
e = e.next;
} else {
for (int i = size; i > index; i--)
e = e.previous;
}
return e;
|
| public E | get(int index)Returns the element at the specified position in this list.
return entry(index).element;
|
| public E | getFirst()Returns the first element in this list.
if (size==0)
throw new NoSuchElementException();
return header.next.element;
|
| public E | getLast()Returns the last element in this list.
if (size==0)
throw new NoSuchElementException();
return header.previous.element;
|
| public int | indexOf(java.lang.Object o)Returns the index of the first occurrence of the specified element
in this list, or -1 if this list does not contain the element.
More formally, returns the lowest index i such that
(o==null ? get(i)==null : o.equals(get(i))),
or -1 if there is no such index.
int index = 0;
if (o==null) {
for (Entry e = header.next; e != header; e = e.next) {
if (e.element==null)
return index;
index++;
}
} else {
for (Entry e = header.next; e != header; e = e.next) {
if (o.equals(e.element))
return index;
index++;
}
}
return -1;
|
| public int | lastIndexOf(java.lang.Object o)Returns the index of the last occurrence of the specified element
in this list, or -1 if this list does not contain the element.
More formally, returns the highest index i such that
(o==null ? get(i)==null : o.equals(get(i))),
or -1 if there is no such index.
int index = size;
if (o==null) {
for (Entry e = header.previous; e != header; e = e.previous) {
index--;
if (e.element==null)
return index;
}
} else {
for (Entry e = header.previous; e != header; e = e.previous) {
index--;
if (o.equals(e.element))
return index;
}
}
return -1;
|
| public java.util.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.
Obeys the general contract of List.listIterator(int).
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.
return new ListItr(index);
|
| public boolean | offer(E e)Adds the specified element as the tail (last element) of this list.
return add(e);
|
| public boolean | offerFirst(E e)Inserts the specified element at the front of this list.
addFirst(e);
return true;
|
| public boolean | offerLast(E e)Inserts the specified element at the end of this list.
addLast(e);
return true;
|
| public E | peek()Retrieves, but does not remove, the head (first element) of this list.
if (size==0)
return null;
return getFirst();
|
| public E | peekFirst()Retrieves, but does not remove, the first element of this list,
or returns null if this list is empty.
if (size==0)
return null;
return getFirst();
|
| public E | peekLast()Retrieves, but does not remove, the last element of this list,
or returns null if this list is empty.
if (size==0)
return null;
return getLast();
|
| public E | poll()Retrieves and removes the head (first element) of this list
if (size==0)
return null;
return removeFirst();
|
| public E | pollFirst()Retrieves and removes the first element of this list,
or returns null if this list is empty.
if (size==0)
return null;
return removeFirst();
|
| public E | pollLast()Retrieves and removes the last element of this list,
or returns null if this list is empty.
if (size==0)
return null;
return removeLast();
|
| public E | pop()Pops an element from the stack represented by this list. In other
words, removes and returns the first element of this list.
This method is equivalent to {@link #removeFirst()}.
return removeFirst();
|
| public void | push(E e)Pushes an element onto the stack represented by this list. In other
words, inserts the element at the front of this list.
This method is equivalent to {@link #addFirst}.
addFirst(e);
|
| private void | readObject(java.io.ObjectInputStream s)Reconstitute this LinkedList instance from a stream (that is
deserialize it).
// Read in any hidden serialization magic
s.defaultReadObject();
// Read in size
int size = s.readInt();
// Initialize header
header = new Entry<E>(null, null, null);
header.next = header.previous = header;
// Read in all elements in the proper order.
for (int i=0; i<size; i++)
addBefore((E)s.readObject(), header);
|
| public boolean | remove(java.lang.Object o)Removes the first occurrence of the specified element from this list,
if it is present. If this list does not contain the element, it is
unchanged. More formally, removes the element with the lowest index
i such that
(o==null ? get(i)==null : o.equals(get(i)))
(if such an element exists). Returns true if this list
contained the specified element (or equivalently, if this list
changed as a result of the call).
if (o==null) {
for (Entry<E> e = header.next; e != header; e = e.next) {
if (e.element==null) {
remove(e);
return true;
}
}
} else {
for (Entry<E> e = header.next; e != header; e = e.next) {
if (o.equals(e.element)) {
remove(e);
return true;
}
}
}
return false;
|
| public E | remove(int index)Removes the element at the specified position in this list. Shifts any
subsequent elements to the left (subtracts one from their indices).
Returns the element that was removed from the list.
return remove(entry(index));
|
| public E | remove()Retrieves and removes the head (first element) of this list.
return removeFirst();
|
| private E | remove(java.util.LinkedList$Entry e)
if (e == header)
throw new NoSuchElementException();
E result = e.element;
e.previous.next = e.next;
e.next.previous = e.previous;
e.next = e.previous = null;
e.element = null;
size--;
modCount++;
return result;
|
| public E | removeFirst()Removes and returns the first element from this list.
return remove(header.next);
|
| public boolean | removeFirstOccurrence(java.lang.Object o)Removes the first occurrence of the specified element in this
list (when traversing the list from head to tail). If the list
does not contain the element, it is unchanged.
return remove(o);
|
| public E | removeLast()Removes and returns the last element from this list.
return remove(header.previous);
|
| public boolean | removeLastOccurrence(java.lang.Object o)Removes the last occurrence of the specified element in this
list (when traversing the list from head to tail). If the list
does not contain the element, it is unchanged.
if (o==null) {
for (Entry<E> e = header.previous; e != header; e = e.previous) {
if (e.element==null) {
remove(e);
return true;
}
}
} else {
for (Entry<E> e = header.previous; e != header; e = e.previous) {
if (o.equals(e.element)) {
remove(e);
return true;
}
}
}
return false;
|
| public E | set(int index, E element)Replaces the element at the specified position in this list with the
specified element.
Entry<E> e = entry(index);
E oldVal = e.element;
e.element = element;
return oldVal;
|
| public int | size()Returns the number of elements in this list.
return size;
|
| public java.lang.Object[] | toArray()Returns an array containing all of the elements in this list
in proper sequence (from first to last element).
The returned array will be "safe" in that no references to it are
maintained by this list. (In other words, this method must allocate
a new array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based
APIs.
Object[] result = new Object[size];
int i = 0;
for (Entry<E> e = header.next; e != header; e = e.next)
result[i++] = e.element;
return result;
|
| public T[] | toArray(T[] a)Returns an array containing all of the elements in this list in
proper sequence (from first to last element); the runtime type of
the returned array is that of the specified array. If the list fits
in the specified array, it is returned therein. Otherwise, a new
array is allocated with the runtime type of the specified array and
the size of this list.
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 list 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.)
Like the {@link #toArray()} method, this method acts as bridge between
array-based and collection-based APIs. Further, this method allows
precise control over the runtime type of the output array, and may,
under certain circumstances, be used to save allocation costs.
Suppose x is a list known to contain only strings.
The following code can be used to dump the list into a newly
allocated array of String:
String[] y = x.toArray(new String[0]);
Note that toArray(new Object[0]) is identical in function to
toArray().
if (a.length < size)
a = (T[])java.lang.reflect.Array.newInstance(
a.getClass().getComponentType(), size);
int i = 0;
Object[] result = a;
for (Entry<E> e = header.next; e != header; e = e.next)
result[i++] = e.element;
if (a.length > size)
a[size] = null;
return a;
|
| private void | writeObject(java.io.ObjectOutputStream s)Save the state of this LinkedList instance to a stream (that
is, serialize it).
// Write out any hidden serialization magic
s.defaultWriteObject();
// Write out size
s.writeInt(size);
// Write out all elements in the proper order.
for (Entry e = header.next; e != header; e = e.next)
s.writeObject(e.element);
|
