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.

This implementation calls add(size(), e).

Note that this implementation throws an UnsupportedOperationException unless add(int, E) is overridden.
Returns: {@code true} (as specified by {@link Collection#add})
Parameters:
- e - element to be appended to this list
Throws:
- UnsupportedOperationException - if the {@code add} 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

This implementation iterates over the specified collection, and adds each object returned by the iterator to this collection, in turn.

Note that this implementation will throw an UnsupportedOperationException unless add is overridden (assuming the specified collection is non-empty).
Throws:
- UnsupportedOperationException - {@inheritDoc}
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}
- IllegalArgumentException - {@inheritDoc}
- IllegalStateException - {@inheritDoc}
See Also: AbstractCollection.add(Object),

This implementation calls removeRange(0, size()).

Note that this implementation throws an UnsupportedOperationException unless remove(int index) or removeRange(int fromIndex, int toIndex) is overridden.
Throws:
- UnsupportedOperationException - if the {@code clear} operation is not supported by this list

This implementation iterates over the elements in the collection, checking each element in turn for equality with the specified element.
Throws:
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}

This implementation iterates over the specified collection, checking each element returned by the iterator in turn to see if it's contained in this collection. If all elements are so contained true is returned, otherwise false.
Throws:
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}
See Also: AbstractCollection.contains(Object),

This implementation first checks if the specified object is this list. If so, it returns true; if not, it checks if the specified object is a list. If not, it returns false; if so, it iterates over both lists, comparing corresponding pairs of elements. If any comparison returns false, this method returns false. If either iterator runs out of elements before the other it returns false (as the lists are of unequal length); otherwise it returns true when the iterations complete.
Returns: {@code true} if the specified object is equal to this list
Parameters:
- o - the object to be compared for equality with this list

This implementation uses exactly the code that is used to define the list hash function in the documentation for the List.hashCode() method.
Returns: the hash code value for this list

This implementation first gets a list iterator (with listIterator()). Then, it iterates over the list until the specified element is found or the end of the list is reached.
Throws:
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}

This implementation returns size() == 0.

This implementation first gets a list iterator that points to the end of the list (with listIterator(size())). Then, it iterates backwards over the list until the specified element is found, or the beginning of the list is reached.
Throws:
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}

This implementation returns listIterator(0).
See Also: AbstractList.listIterator(int),

This implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.

Note that this implementation throws an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection contains the specified object.
Throws:
- UnsupportedOperationException - {@inheritDoc}
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}

This implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's so contained, it's removed from this collection with the iterator's remove method.

Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method and this collection contains one or more elements in common with the specified collection.
Throws:
- UnsupportedOperationException - {@inheritDoc}
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}
See Also: AbstractCollection.remove(Object), AbstractCollection.contains(Object),

This 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.
Parameters:
- fromIndex - index of first element to be removed
- toIndex - index after last element to be removed

This implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's not so contained, it's removed from this collection with the iterator's remove method.

Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method and this collection contains one or more elements not present in the specified collection.
Throws:
- UnsupportedOperationException - {@inheritDoc}
- ClassCastException - {@inheritDoc}
- NullPointerException - {@inheritDoc}
See Also: AbstractCollection.remove(Object), AbstractCollection.contains(Object),

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();
 

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 this 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, E), get(int), add(int, E), 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.
Throws:
- IndexOutOfBoundsException - endpoint index value out of range {@code (fromIndex < 0 || toIndex > size)}
- IllegalArgumentException - if the endpoint indices are out of order {@code (fromIndex > toIndex)}

The returned array will be "safe" in that no references to it are maintained by this collection. (In other words, this method must allocate a new array even if this collection is backed by an array). The caller is thus free to modify the returned array.

This method acts as bridge between array-based and collection-based APIs.

This implementation returns an array containing all the elements returned by this collection's iterator, in the same order, stored in consecutive elements of the array, starting with index 0. The length of the returned array is equal to the number of elements returned by the iterator, even if the size of this collection changes during iteration, as might happen if the collection permits concurrent modification during iteration. The size method is called only as an optimization hint; the correct result is returned even if the iterator returns a different number of elements.

This method is equivalent to:

 List<E> list = new ArrayList<E>(size());
 for (E e : this)
     list.add(e);
 return list.toArray();
 

If this collection fits in the specified array with room to spare (i.e., the array has more elements than this collection), the element in the array immediately following the end of the collection is set to null. (This is useful in determining the length of this collection only if the caller knows that this collection does not contain any null elements.)

If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.

Like the Collection.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 collection known to contain only strings. The following code can be used to dump the collection into a newly allocated array of String:

     String[] y = x.toArray(new String[0]);

This implementation returns an array containing all the elements returned by this collection's iterator in the same order, stored in consecutive elements of the array, starting with index 0. If the number of elements returned by the iterator is too large to fit into the specified array, then the elements are returned in a newly allocated array with length equal to the number of elements returned by the iterator, even if the size of this collection changes during iteration, as might happen if the collection permits concurrent modification during iteration. The size method is called only as an optimization hint; the correct result is returned even if the iterator returns a different number of elements.

This method is equivalent to:

 List<E> list = new ArrayList<E>(size());
 for (E e : this)
     list.add(e);
 return list.toArray(a);