List
interface to minimize the effort required to implement this interface
backed by a "sequential access" data store (such as a linked list). For
random access data (such as an array), AbstractList
should be used
in preference to this class.
This class is the opposite of the AbstractList
class in the sense
that it implements the "random access" methods (get(int index)
,
set(int index, E element)
, add(int index, E element)
and
remove(int index)
) on top of the list's list iterator, instead of
the other way around.
To implement a list the programmer needs only to extend this class and
provide implementations for the listIterator
and size
methods. For an unmodifiable list, the programmer need only implement the
list iterator's hasNext
, next
, hasPrevious
,
previous
and index
methods.
For a modifiable list the programmer should additionally implement the list
iterator's set
method. For a variable-size list the programmer
should additionally implement the list iterator's remove
and
add
methods.
The programmer should generally provide a void (no argument) and collection
constructor, as per the recommendation in the Collection
interface
specification.
This class is a member of the Java Collections Framework.
Collection
, List
, AbstractList
, AbstractCollection
Access | Constructor and Description |
---|---|
protected |
Modifier and Type | Method and Description |
---|---|
public void | add(int
index at which the specified element is to be inserted index, E element to be inserted element)Overrides java. Implements java. Inserts the specified element at the specified position in this list (optional operation). |
public boolean | addAll(int
index at which to insert the first element from the
specified collection index, Collection<? extends E> collection containing elements to be added to this list c)Overrides java. Implements java. Inserts all of the elements in the specified collection into this list at the specified position (optional operation). |
public E | get(int
index of the element to return index)Implements abstract java. Implements java. Returns the element at the specified position in this list. |
public Iterator | Returns: an iterator over the elements in this list (in proper sequence)Overrides java. Implements java. Returns an iterator over the elements in this list (in proper sequence). |
public abstract ListIterator | Returns: a list iterator over the elements in this list (in proper sequence)index of first element to be returned from the list
iterator (by a call to the index)next method)Redeclares java. Overrides java. Returns a list iterator over the elements in this list (in proper sequence). |
public E | remove(int
the index of the element to be removed index)Overrides java. Implements java. Removes the element at the specified position in this list (optional operation). |
public E | set(int
index of the element to replace index, E element to be stored at the specified position element)Overrides java. Implements java. Replaces the element at the specified position in this list with the specified element (optional operation). |
AbstractSequentialList | back to summary |
---|---|
protected AbstractSequentialList() Sole constructor. (For invocation by subclass constructors, typically implicit.) |
add | back to summary |
---|---|
public void add(int index, E element) Overrides java. Implements java. Inserts the specified element at the specified position in this list (optional operation). Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices). This implementation first gets a list iterator pointing to the
indexed element (with Note that this implementation will throw an
|
addAll | back to summary |
---|---|
public boolean addAll(int index, Collection<? extends E> c) Overrides java. Implements java. Inserts all of the elements in the specified collection into this list at the specified position (optional operation). 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 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.) This implementation gets an iterator over the specified collection and
a list iterator over this list pointing to the indexed element (with
Note that this implementation will throw an
|
get | back to summary |
---|---|
public E get(int index) Implements abstract java. Implements java. Returns the element at the specified position in this list. This implementation first gets a list iterator pointing to the
indexed element (with
|
iterator | back to summary |
---|---|
public Iterator Overrides java. Implements java. Returns an iterator over the elements in this list (in proper sequence). This implementation merely returns a list iterator over the list.
|
listIterator | back to summary |
---|---|
public abstract ListIterator Redeclares java. Overrides java. Returns a list iterator over the elements in this list (in proper sequence).
|
remove | back to summary |
---|---|
public E remove(int index) Overrides java. Implements java. Removes the element at the specified position in this list (optional operation). Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list. This implementation first gets a list iterator pointing to the
indexed element (with Note that this implementation will throw an
|
set | back to summary |
---|---|
public E set(int index, E element) Overrides java. Implements java. Replaces the element at the specified position in this list with the specified element (optional operation). This implementation first gets a list iterator pointing to the
indexed element (with Note that this implementation will throw an
|