Class AbstractList<E>

java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractList<E>
Type Parameters:
E - the type of elements in this list
All Implemented Interfaces:
Iterable<E>,Collection<E>,List<E>,SequencedCollection<E>
Direct Known Subclasses:
AbstractSequentialList,ArrayList,Vector
public abstract classAbstractList<E>extendsAbstractCollection<E>implementsList<E>
This class provides a skeletal implementation of theList interface to minimize the effort required to implement this interface backed by a "random access" data store (such as an array). For sequential access data (such as a linked list),AbstractSequentialList should be used in preference to this class.

To implement an unmodifiable list, the programmer needs only to extend this class and provide implementations for theget(int) andsize() methods.

To implement a modifiable list, the programmer must additionally override theset(int, E) method (which otherwise throws anUnsupportedOperationException). If the list is variable-size the programmer must additionally override theadd(int, E) andremove(int) methods.

The programmer should generally provide a void (no argument) and collection constructor, as per the recommendation in theCollection interface specification.

Unlike the other abstract collection implementations, the programmer doesnot have to provide an iterator implementation; the iterator and list iterator are implemented by this class, on top of the "random access" methods:get(int),set(int, E),add(int, E) andremove(int).

The documentation for each non-abstract method in this class describes its implementation in detail. Each of these methods may be overridden if the collection being implemented admits a more efficient implementation.

This class is a member of the Java Collections Framework.

Since:
1.2

  • Field Details

    • modCount

      protected transient int modCount
      The number of times this list has beenstructurally modified. 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 field is used by the iterator and list iterator implementation returned by theiterator andlistIterator methods. If the value of this field changes unexpectedly, the iterator (or list iterator) will throw aConcurrentModificationException in response to thenext,remove,previous,set oradd operations. This providesfail-fast behavior, rather than non-deterministic behavior in the face of concurrent modification during iteration.

      Use of this field by subclasses is optional. If a subclass wishes to provide fail-fast iterators (and list iterators), then it merely has to increment this field in itsadd(int, E) andremove(int) methods (and any other methods that it overrides that result in structural modifications to the list). A single call toadd(int, E) orremove(int) must add no more than one to this field, or the iterators (and list iterators) will throw bogusConcurrentModificationExceptions. If an implementation does not wish to provide fail-fast iterators, this field may be ignored.

  • Constructor Details

    • AbstractList

      protected AbstractList()
      Sole constructor. (For invocation by subclass constructors, typically implicit.)

  • Method Details

    • add

      public boolean add(E e)
      Appends the specified element to the end of this list (optional operation).

      Lists that support this operation may place limitations on what elements may be added to this list. In particular, some lists will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. List classes should clearly specify in their documentation any restrictions on what elements may be added.

      Specified by:
      add in interface Collection<E>
      Specified by:
      add in interface List<E>
      Overrides:
      add in class AbstractCollection<E>
      Implementation Requirements:
      This implementation callsadd(size(), e).

      Note that this implementation throws anUnsupportedOperationException unlessadd(int, E) is overridden.

      Parameters:
      e - element to be appended to this list
      Returns:
      true (as specified byCollection.add(E))
      Throws:
      UnsupportedOperationException - if theadd operation is not supported by this list
      ClassCastException - if the class of the specified element prevents it from being added to this list
      NullPointerException - if the specified element is null and this list does not permit null elements
      IllegalArgumentException - if some property of this element prevents it from being added to this list

    • get

      public abstract E get(int index)
      Returns the element at the specified position in this list.
      Specified by:
      get in interface List<E>
      Parameters:
      index - index of the element to return
      Returns:
      the element at the specified position in this list
      Throws:
      IndexOutOfBoundsException - if the index is out of range (index < 0 || index >= size())

    • set

      public E set(int index,E element)
      Replaces the element at the specified position in this list with the specified element (optional operation).
      Specified by:
      set in interface List<E>
      Implementation Requirements:
      This implementation always throws anUnsupportedOperationException.
      Parameters:
      index - index of the element to replace
      element - element to be stored at the specified position
      Returns:
      the element previously at the specified position
      Throws:
      UnsupportedOperationException - if theset operation is not supported by this list
      ClassCastException - if the class of the specified element prevents it from being added to this list
      NullPointerException - if the specified element is null and this list does not permit null elements
      IllegalArgumentException - if some property of the specified element prevents it from being added to this list
      IndexOutOfBoundsException - if the index is out of range (index < 0 || index >= size())

    • add

      public void add(int index,E element)
      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).
      Specified by:
      add in interface List<E>
      Implementation Requirements:
      This implementation always throws anUnsupportedOperationException.
      Parameters:
      index - index at which the specified element is to be inserted
      element - element to be inserted
      Throws:
      UnsupportedOperationException - if theadd operation is not supported by this list
      ClassCastException - if the class of the specified element prevents it from being added to this list
      NullPointerException - if the specified element is null and this list does not permit null elements
      IllegalArgumentException - if some property of the specified element prevents it from being added to this list
      IndexOutOfBoundsException - if the index is out of range (index < 0 || index > size())

    • remove

      public E remove(int index)
      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.
      Specified by:
      remove in interface List<E>
      Implementation Requirements:
      This implementation always throws anUnsupportedOperationException.
      Parameters:
      index - the index of the element to be removed
      Returns:
      the element previously at the specified position
      Throws:
      UnsupportedOperationException - if theremove operation is not supported by this list
      IndexOutOfBoundsException - if the index is out of range (index < 0 || index >= size())

    • indexOf

      public int indexOf(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 indexi such thatObjects.equals(o, get(i)), or -1 if there is no such index.
      Specified by:
      indexOf in interface List<E>
      Implementation Requirements:
      This implementation first gets a list iterator (withlistIterator()). Then, it iterates over the list until the specified element is found or the end of the list is reached.
      Parameters:
      o - element to search for
      Returns:
      the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element
      Throws:
      ClassCastException - if the type of the specified element is incompatible with this list (optional)
      NullPointerException - if the specified element is null and this list does not permit null elements (optional)

    • lastIndexOf

      public int lastIndexOf(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 indexi such thatObjects.equals(o, get(i)), or -1 if there is no such index.
      Specified by:
      lastIndexOf in interface List<E>
      Implementation Requirements:
      This implementation first gets a list iterator that points to the end of the list (withlistIterator(size())). Then, it iterates backwards over the list until the specified element is found, or the beginning of the list is reached.
      Parameters:
      o - element to search for
      Returns:
      the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element
      Throws:
      ClassCastException - if the type of the specified element is incompatible with this list (optional)
      NullPointerException - if the specified element is null and this list does not permit null elements (optional)

    • clear

      public void clear()
      Removes all of the elements from this list (optional operation). The list will be empty after this call returns.
      Specified by:
      clear in interface Collection<E>
      Specified by:
      clear in interface List<E>
      Overrides:
      clear in class AbstractCollection<E>
      Implementation Requirements:
      This implementation callsremoveRange(0, size()).

      Note that this implementation throws anUnsupportedOperationException unlessremove(int index) orremoveRange(int fromIndex, int toIndex) is overridden.

      Throws:
      UnsupportedOperationException - if theclear operation is not supported by this list

    • addAll

      public boolean addAll(int index,Collection<? extendsE> c)
      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.)
      Specified by:
      addAll in interface List<E>
      Implementation Requirements:
      This 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, usingadd(int, E). Many implementations will override this method for efficiency.

      Note that this implementation throws anUnsupportedOperationException unlessadd(int, E) is overridden.

      Parameters:
      index - index at which to insert the first element from the specified collection
      c - collection containing elements to be added to this list
      Returns:
      true if this list changed as a result of the call
      Throws:
      UnsupportedOperationException - if theaddAll operation is not supported by this list
      ClassCastException - if the class of an element of the specified collection prevents it from being added to this list
      NullPointerException - if the specified collection contains one or more null elements and this list does not permit null elements, or if the specified collection is null
      IllegalArgumentException - if some property of an element of the specified collection prevents it from being added to this list
      IndexOutOfBoundsException - if the index is out of range (index < 0 || index > size())

    • iterator

      public Iterator<E> iterator()
      Returns an iterator over the elements in this list in proper sequence.
      Specified by:
      iterator in interface Collection<E>
      Specified by:
      iterator in interface Iterable<E>
      Specified by:
      iterator in interface List<E>
      Specified by:
      iterator in class AbstractCollection<E>
      Implementation Requirements:
      This implementation returns a straightforward implementation of the iterator interface, relying on the backing list'ssize(),get(int), andremove(int) methods.

      Note that the iterator returned by this method will throw anUnsupportedOperationException in response to itsremove method unless the list'sremove(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.

      Returns:
      an iterator over the elements in this list in proper sequence

    • listIterator

      public ListIterator<E> listIterator()
      Returns a list iterator over the elements in this list (in proper sequence).
      Specified by:
      listIterator in interface List<E>
      Implementation Requirements:
      This implementation returnslistIterator(0).
      Returns:
      a list iterator over the elements in this list (in proper sequence)
      See Also:

    • listIterator

      public ListIterator<E> listIterator(int index)
      Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. The specified index indicates the first element that would be returned by an initial call tonext. An initial call toprevious would return the element with the specified index minus one.
      Specified by:
      listIterator in interface List<E>
      Implementation Requirements:
      This implementation returns a straightforward implementation of theListIterator interface that extends the implementation of theIterator interface returned by theiterator() method. TheListIterator implementation relies on the backing list'sget(int),set(int, E),add(int, E) andremove(int) methods.

      Note that the list iterator returned by this implementation will throw anUnsupportedOperationException in response to itsremove,set andadd methods unless the list'sremove(int),set(int, E), andadd(int, E) 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.

      Parameters:
      index - index of the first element to be returned from the list iterator (by a call tonext)
      Returns:
      a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list
      Throws:
      IndexOutOfBoundsException - if the index is out of range (index < 0 || index > size())

    • subList

      public List<E> subList(int fromIndex, int toIndex)
      Returns a view of the portion of this list between the specifiedfromIndex, inclusive, andtoIndex, exclusive. (IffromIndex andtoIndex are equal, the returned list is empty.) The returned list is backed by this list, so non-structural changes in the returned list are reflected in this list, and vice-versa. The returned list supports all of the optional list operations supported by this list.

      This 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 passing 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 forindexOf andlastIndexOf, and all of the algorithms in theCollections 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) isstructurally modified in any way other than via the returned list. (Structural modifications are those that change the size of this list, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.)

      Specified by:
      subList in interface List<E>
      Implementation Requirements:
      This implementation returns a list that subclassesAbstractList. The subclass stores, in private fields, the size of the subList (which can change over its lifetime), and the expectedmodCount value of the backing list. There are two variants of the subclass, one of which implementsRandomAccess. If this list implementsRandomAccess the returned list will be an instance of the subclass that implementsRandomAccess.

      The subclass'sset(int, E),get(int),add(int, E),remove(int),addAll(int, Collection) andremoveRange(int, int) methods all delegate to the corresponding methods on the backing abstract list, after bounds-checking the index and adjusting for the offset. TheaddAll(Collection c) method merely returnsaddAll(size, c).

      ThelistIterator(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. Theiterator method merely returnslistIterator(), and thesize method merely returns the subclass'ssize field.

      All methods first check to see if the actualmodCount of the backing list is equal to its expected value, and throw aConcurrentModificationException if it is not.

      Parameters:
      fromIndex - low endpoint (inclusive) of the subList
      toIndex - high endpoint (exclusive) of the subList
      Returns:
      a view of the specified range within this list
      Throws:
      IndexOutOfBoundsException - if an endpoint index value is out of range(fromIndex < 0 || toIndex > size)
      IllegalArgumentException - if the endpoint indices are out of order(fromIndex > toIndex)

    • equals

      public boolean equals(Object o)
      Compares the specified object with this list for equality. Returnstrue if and only if the specified object is also a list, both lists have the same size, and all corresponding pairs of elements in the two lists areequal. (Two elementse1 ande2 areequal if(e1==null ? e2==null : e1.equals(e2)).) In other words, two lists are defined to be equal if they contain the same elements in the same order.
      Specified by:
      equals in interface Collection<E>
      Specified by:
      equals in interface List<E>
      Overrides:
      equals in class Object
      Implementation Requirements:
      This implementation first checks if the specified object is this list. If so, it returnstrue; if not, it checks if the specified object is a list. If not, it returnsfalse; if so, it iterates over both lists, comparing corresponding pairs of elements. If any comparison returnsfalse, this method returnsfalse. If either iterator runs out of elements before the other it returnsfalse (as the lists are of unequal length); otherwise it returnstrue when the iterations complete.
      Parameters:
      o - the object to be compared for equality with this list
      Returns:
      true if the specified object is equal to this list
      See Also:

    • hashCode

      public int hashCode()
      Returns the hash code value for this list.
      Specified by:
      hashCode in interface Collection<E>
      Specified by:
      hashCode in interface List<E>
      Overrides:
      hashCode in class Object
      Implementation Requirements:
      This implementation uses exactly the code that is used to define the list hash function in the documentation for theList.hashCode() method.
      Returns:
      the hash code value for this list
      See Also:

    • removeRange

      protected void removeRange(int fromIndex, int toIndex)
      Removes from this list all of the elements whose index is betweenfromIndex, inclusive, andtoIndex, exclusive. Shifts any succeeding elements to the left (reduces their index). This call shortens the list by(toIndex - fromIndex) elements. (IftoIndex==fromIndex, this operation has no effect.)

      This method is called by theclear operation on this list and its subLists. Overriding this method to take advantage of the internals of the list implementation cansubstantially improve the performance of theclear operation on this list and its subLists.

      Implementation Requirements:
      This implementation gets a list iterator positioned beforefromIndex, and repeatedly callsListIterator.next followed byListIterator.remove until the entire range has been removed.Note: ifListIterator.remove requires linear time, this implementation requires quadratic time.
      Parameters:
      fromIndex - index of first element to be removed
      toIndex - index after last element to be removed