java.lang.Object | +--java.util.AbstractCollection | +--java.util.AbstractList | +--java.util.SubList | +--java.util.RandomAccessSubList
void
add(int index,
Object element)
boolean
addAll(Collection c)
boolean
addAll(int index,
Collection c)
ListIterator
listIterator(int index)
Object
remove(int index)
protected void
removeRange(int fromIndex,
int toIndex)
Object
set(int index,
Object element)
List
subList(int fromIndex,
int toIndex)
RandomAccessSubList(AbstractList list, int fromIndex, int toIndex)
public List subList(int fromIndex, int toIndex)
AbstractListThis method eliminates the need for explicit range operations (of the sort that commonly exist for arrays). Any operation that expects a list can be used as a range operation by operating on a subList view instead of a whole list. For example, the following idiom removes a range of elements from a list:
list.subList(from, to).clear();Similar idioms may be constructed for indexOf and lastIndexOf, and all of the algorithms in the Collections class can be applied to a subList.
The semantics of the list returned by this method become undefined if the backing list (i.e., this list) is structurally modified in any way other than via the returned list. (Structural modifications are those that change the size of the list, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.)
This implementation returns a list that subclasses AbstractList. The subclass stores, in private fields, the offset of the subList within the backing list, the size of the subList (which can change over its lifetime), and the expected modCount value of the backing list. There are two variants of the subclass, one of which implements RandomAccess. If this list implements RandomAccess the returned list will be an instance of the subclass that implements RandomAccess.
The subclass's set(int, Object), get(int), add(int, Object), remove(int), addAll(int, Collection) and removeRange(int, int) methods all delegate to the corresponding methods on the backing abstract list, after bounds-checking the index and adjusting for the offset. The addAll(Collection c) method merely returns addAll(size, c).
The listIterator(int) method returns a "wrapper object" over a list iterator on the backing list, which is created with the corresponding method on the backing list. The iterator method merely returns listIterator(), and the size method merely returns the subclass's size field.
All methods first check to see if the actual modCount of the backing list is equal to its expected value, and throw a ConcurrentModificationException if it is not.
fromIndex - low endpoint (inclusive) of the subList.toIndex - high endpoint (exclusive) of the subList.
public Object set(int index, Object element)
AbstractListThis implementation always throws an UnsupportedOperationException.
set in interface Listset in class AbstractListindex - index of element to replace.element - element to be stored at the specified position.
public Object get(int index)
AbstractList
get in interface Listget in class AbstractListindex - index of element to return.
public int size()
List
size in interface Listsize in class AbstractCollectionpublic void add(int index, Object element)
AbstractListThis implementation always throws an UnsupportedOperationException.
add in interface Listadd in class AbstractListindex - index at which the specified element is to be inserted.element - element to be inserted.public Object remove(int index)
AbstractListThis implementation always throws an UnsupportedOperationException.
remove in interface Listremove in class AbstractListindex - the index of the element to remove.
protected void removeRange(int fromIndex, int toIndex)
AbstractListThis method is called by the clear operation on this list and its subLists. Overriding this method to take advantage of the internals of the list implementation can substantially improve the performance of the clear operation on this list and its subLists.
This implementation gets a list iterator positioned before fromIndex, and repeatedly calls ListIterator.next followed by ListIterator.remove until the entire range has been removed. Note: if ListIterator.remove requires linear time, this implementation requires quadratic time.
removeRange in class AbstractListfromIndex - index of first element to be removed.toIndex - index after last element to be removed.public boolean addAll(Collection c)
List
addAll in interface ListaddAll in class AbstractCollectionc - collection whose elements are to be added to this list.
List.add(Object)public boolean addAll(int index, Collection c)
AbstractListThis implementation gets an iterator over the specified collection and iterates over it, inserting the elements obtained from the iterator into this list at the appropriate position, one at a time, using add(int, Object). Many implementations will override this method for efficiency.
Note that this implementation throws an UnsupportedOperationException unless add(int, Object) is overridden.
addAll in interface ListaddAll in class AbstractListindex - index at which to insert the first element from the
specified collection.c - elements to be inserted into this List.
public Iterator iterator()
AbstractListThis implementation returns a straightforward implementation of the iterator interface, relying on the backing list's size(), get(int), and remove(int) methods.
Note that the iterator returned by this method will throw an UnsupportedOperationException in response to its remove method unless the list's remove(int) method is overridden.
This implementation can be made to throw runtime exceptions in the face of concurrent modification, as described in the specification for the (protected) modCount field.
iterator in interface Listiterator in class AbstractListAbstractList.modCountpublic ListIterator listIterator(int index)
AbstractListThis implementation returns a straightforward implementation of the ListIterator interface that extends the implementation of the Iterator interface returned by the iterator() method. The ListIterator implementation relies on the backing list's get(int), set(int, Object), add(int, Object) and remove(int) methods.
Note that the list iterator returned by this implementation will throw an UnsupportedOperationException in response to its remove, set and add methods unless the list's remove(int), set(int, Object), and add(int, Object) methods are overridden.
This implementation can be made to throw runtime exceptions in the face of concurrent modification, as described in the specification for the (protected) modCount field.
listIterator in interface ListlistIterator in class AbstractListindex - index of the first element to be returned from the list
iterator (by a call to the next method).
AbstractList.modCount