public class TreeList<E>
extends java.util.AbstractList<E>

A List implementation that is optimised for fast insertions and removals at any index in the list. This list implementation utilises a tree structure internally to ensure that all insertions and removals are O(log n). This provides much faster performance than both an ArrayList and a LinkedList where elements are inserted and removed repeatedly from anywhere in the list. The following relative performance statistics are indicative of this class: get add insert iterate remove TreeList 3 5 1 2 1 ArrayList 1 1 40 1 40 LinkedList 5800 1 350 2 325 ArrayList is a good general purpose list implementation. It is faster than TreeList for most operations except inserting and removing in the middle of the list. ArrayList also uses less memory as TreeList uses one object per entry. LinkedList is rarely a good choice of implementation. TreeList is almost always a good replacement for it, although it does use slightly more memory.

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.

Clears the list, removing all entries.

Searches for the presence of an object in the list.

Gets the element at the specified index.

Searches for the index of an object in the list.

Gets an iterator over the list.

Gets a ListIterator over the list.

Gets a ListIterator over the list.

Removes the element at the specified index.

Sets the element at the specified index.

Gets the current size of the list.

Converts the list into an array.

public TreeList(java.util.Collection<? extends E> coll)

Constructs a new empty list that copies the specified collection.

public java.util.ListIterator<E> listIterator()

Gets a ListIterator over the list.

public java.util.ListIterator<E> listIterator(int fromIndex)

Gets a ListIterator over the list.

public int indexOf(java.lang.Object object)

Searches for the index of an object in the list.

public boolean contains(java.lang.Object object)

Searches for the presence of an object in the list.

public boolean addAll(java.util.Collection<? extends E> c)

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. This method runs in O(n + log m) time, where m is the size of this list and n is the size of c .