public abstract class AbstractSequentialList<E>
extends java.util.AbstractList<E>
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
Modifier | Constructor and Description |
---|---|
protected |
AbstractSequentialList()
Sole constructor.
|
Modifier and Type | Method and Description |
---|---|
void |
add(int index,
E element)
Inserts the specified element at the specified position in this list (optional operation).
|
boolean |
addAll(int index,
java.util.Collection<? extends E> c)
Inserts all of the elements in the specified collection into this list at the specified position (optional
operation).
|
E |
get(int index)
Returns the element at the specified position in this list.
|
java.util.Iterator<E> |
iterator()
Returns an iterator over the elements in this list (in proper sequence).
|
abstract java.util.ListIterator<E> |
listIterator(int index)
Returns a list iterator over the elements in this list (in proper sequence).
|
E |
remove(int index)
Removes the element at the specified position in this list (optional operation).
|
E |
set(int index,
E element)
Replaces the element at the specified position in this list with the specified element (optional operation).
|
add, clear, equals, hashCode, indexOf, lastIndexOf, listIterator, removeRange, subList
protected AbstractSequentialList()
public E get(int index)
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it gets the element using ListIterator.next and returns it.
public E set(int index, E element)
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it gets the current element using ListIterator.next and replaces it with ListIterator.set.
Note that this implementation will throw an UnsupportedOperationException if the list iterator does not implement the set operation.
public void add(int index, E element)
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it inserts the specified element with ListIterator.add.
Note that this implementation will throw an UnsupportedOperationException if the list iterator does not implement the add operation.
public E remove(int index)
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it removes the element with ListIterator.remove.
Note that this implementation will throw an UnsupportedOperationException if the list iterator does not implement the remove operation.
public boolean addAll(int index, java.util.Collection<? extends E> c)
This implementation gets an iterator over the specified collection and a list iterator over this list pointing to the indexed element (with listIterator(index)). Then, it iterates over the specified collection, inserting the elements obtained from the iterator into this list, one at a time, using ListIterator.add followed by ListIterator.next (to skip over the added element).
Note that this implementation will throw an UnsupportedOperationException if the list iterator returned by the listIterator method does not implement the add operation.
public java.util.Iterator<E> iterator()
This implementation merely returns a list iterator over the list.
public abstract java.util.ListIterator<E> listIterator(int index)
listIterator
in interface java.util.List<E>
listIterator
in class java.util.AbstractList<E>
index
- index of first element to be returned from the list iterator (by a call to the next
method)java.lang.IndexOutOfBoundsException