Appends the specified element to the end of this list.

  Appends the specified element to the end of this list.
Returns: true (as specified by {@link Collection#add})
Parameters:
- e - element to be appended to this list

  Inserts the specified element at the specified position in this list.

  Inserts the specified element at the specified position in this
list. Shifts the element currently at that position (if any) and
any subsequent elements to the right (adds one to their indices).
Parameters:
- index - index at which the specified element is to be inserted
- element - element to be inserted
Throws:
- IndexOutOfBoundsException - {@inheritDoc}

  Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's Iterator.

  Appends all of the elements in the specified collection to the end of
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. (This implies that the behavior of this call is
undefined if the specified collection is this list, and this
list is nonempty.)
Returns: true if this list changed as a result of the call
Parameters:
- c - collection containing elements to be added to this list
Throws:
- NullPointerException - if the specified collection is null

  Inserts all of the elements in the specified collection into this list, starting at the specified position.

  Inserts all of the elements in the specified collection into this
list, starting at the specified position. 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 the list in the order that they are returned by the
specified collection's iterator.
Returns: true if this list changed as a result of the call
Parameters:
- index - index at which to insert the first element from the specified collection
- c - collection containing elements to be added to this list
Throws:
- IndexOutOfBoundsException - {@inheritDoc}
- NullPointerException - if the specified collection is null

  Removes all of the elements from this list.

  Removes all of the elements from this list. The list will
be empty after this call returns.

  Returns a shallow copy of this ArrayList instance.

  Returns a shallow copy of this ArrayList instance. (The
elements themselves are not copied.)
Returns: a clone of this ArrayList instance

  Returns true if this list contains the specified element.

  Returns true if this list contains the specified element.
More formally, returns true if and only if this list contains
at least one element e such that
(o==null ? e==null : o.equals(e)).
Returns: true if this list contains the specified element
Parameters:
- o - element whose presence in this list is to be tested

  Returns true if this collection contains all of the elements in the specified collection.

  Returns true if this collection contains all of the elements in the specified collection.

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),

  Increases the capacity of this ArrayList instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.

  Increases the capacity of this ArrayList instance, if
necessary, to ensure that it can hold at least the number of elements
specified by the minimum capacity argument.
Parameters:
- minCapacity - the desired minimum capacity

  Compares the specified object with this list for equality.

  Compares the specified object with this list for equality. Returns true 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 are equal. (Two elements e1 and e2 are equal 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.

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

  Returns the element at the specified position in this list.

  Returns the element at the specified position in this list.
Returns: the element at the specified position in this list
Parameters:
- index - index of the element to return
Throws:
- IndexOutOfBoundsException - {@inheritDoc}

  Returns the hash code value for this list.

  Returns the hash code value for 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

  Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.

  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 index i such that
(o==null ? get(i)==null : o.equals(get(i))),
or -1 if there is no such index.

  Returns true if this list contains no elements.

  Returns true if this list contains no elements.
Returns: true if this list contains no elements

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

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

This 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.
Returns: an iterator over the elements in this list in proper sequence
See Also: AbstractList.modCount,

  Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.

  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 index i such that
(o==null ? get(i)==null : o.equals(get(i))),
or -1 if there is no such index.

  Returns a list iterator over the elements in this list (in proper sequence).

  Returns a list iterator over the elements in this list (in proper sequence).

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

  Returns a list iterator of the elements in this list (in proper sequence), starting at the specified position in this list.

  Returns a list iterator of the elements in this list (in proper sequence), starting at the specified position in this list. The specified index indicates the first element that would be returned by an initial call to next. An initial call to previous would return the element with the specified index minus one.

This 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, E), add(int, E) 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, E), and add(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.
Throws:
- IndexOutOfBoundsException - {@inheritDoc}
See Also: AbstractList.modCount,

  Removes the element at the specified position in this list.

  Removes the element at the specified position in this list.
Shifts any subsequent elements to the left (subtracts one from their
indices).
Returns: the element that was removed from the list
Parameters:
- index - the index of the element to be removed
Throws:
- IndexOutOfBoundsException - {@inheritDoc}

  Removes the first occurrence of the specified element from this list, if it is present.

  Removes the first occurrence of the specified element from this list,
if it is present. If the list does not contain the element, it is
unchanged. More formally, removes the element with the lowest index
i such that
(o==null ? get(i)==null : o.equals(get(i)))
(if such an element exists). Returns true if this list
contained the specified element (or equivalently, if this list
changed as a result of the call).
Returns: true if this list contained the specified element
Parameters:
- o - element to be removed from this list, if present

  Removes all of this collection's elements that are also contained in the specified collection (optional operation).

  Removes all of this collection's elements that are also contained in the specified collection (optional operation). After this call returns, this collection will contain no elements in common with the specified collection.

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),

  Removes from this list all of the elements whose index is between fromIndex, inclusive, and toIndex, exclusive.

  Removes from this list all of the elements whose index is between
fromIndex, inclusive, and toIndex, exclusive.
Shifts any succeeding elements to the left (reduces their index).
This call shortens the list by (toIndex - fromIndex) elements.
(If toIndex==fromIndex, this operation has no effect.)
Parameters:
- fromIndex - index of first element to be removed
- toIndex - index after last element to be removed
Throws:
- IndexOutOfBoundsException - if fromIndex or toIndex out of range (fromIndex < 0 || fromIndex >= size() || toIndex > size() || toIndex < fromIndex)

  Retains only the elements in this collection that are contained in the specified collection (optional operation).

  Retains only the elements in this collection that are contained in the specified collection (optional operation). In other words, removes from this collection all of its elements that are not contained in the specified collection.

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),

  Replaces the element at the specified position in this list with the specified element.

  Replaces the element at the specified position in this list with
the specified element.
Returns: the element previously at the specified position
Parameters:
- index - index of the element to replace
- element - element to be stored at the specified position
Throws:
- IndexOutOfBoundsException - {@inheritDoc}

  Returns the number of elements in this list.

  Returns the number of elements in this list.
Returns: the number of elements in this list

  Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive.

  Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive. (If fromIndex and toIndex 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 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 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)}

  Returns an array containing all of the elements in this list in proper sequence (from first to last element).

  Returns an array containing all of the elements in this list in proper sequence (from first to last element).

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

This method acts as bridge between array-based and collection-based APIs.
Returns: an array containing all of the elements in this list in proper sequence

  Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array.

  Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the list fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this list.

If the list fits in the specified array with room to spare (i.e., the array has more elements than the list), the element in the array immediately following the end of the collection is set to null. (This is useful in determining the length of the list only if the caller knows that the list does not contain any null elements.)
Returns: an array containing the elements of the list
Parameters:
- a - the array into which the elements of the list are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.
Throws:
- ArrayStoreException - if the runtime type of the specified array is not a supertype of the runtime type of every element in this list
- NullPointerException - if the specified array is null

  Returns a string representation of this collection.

  Returns a string representation of this collection. The string
representation consists of a list of the collection's elements in the
order they are returned by its iterator, enclosed in square brackets
("[]"). Adjacent elements are separated by the characters
", " (comma and space). Elements are converted to strings as
by String.valueOf(Object).
Returns: a string representation of this collection

  Trims the capacity of this ArrayList instance to be the list's current size.

  Trims the capacity of this ArrayList instance to be the
list's current size. An application can use this operation to minimize
the storage of an ArrayList instance.