public class TreeList<E>
extends java.util.AbstractList<E>
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.
 
| Constructor and Description | 
|---|
TreeList()
Constructs a new empty list. 
 | 
TreeList(java.util.Collection<? extends E> coll)
Constructs a new empty list that copies the specified collection. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
add(int index,
   E obj)
Adds a new element to the list. 
 | 
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. 
 | 
void | 
clear()
Clears the list, removing all entries. 
 | 
boolean | 
contains(java.lang.Object object)
Searches for the presence of an object in the list. 
 | 
E | 
get(int index)
Gets the element at the specified index. 
 | 
int | 
indexOf(java.lang.Object object)
Searches for the index of an object in the list. 
 | 
java.util.Iterator<E> | 
iterator()
Gets an iterator over the list. 
 | 
java.util.ListIterator<E> | 
listIterator()
Gets a ListIterator over the list. 
 | 
java.util.ListIterator<E> | 
listIterator(int fromIndex)
Gets a ListIterator over the list. 
 | 
E | 
remove(int index)
Removes the element at the specified index. 
 | 
E | 
set(int index,
   E obj)
Sets the element at the specified index. 
 | 
int | 
size()
Gets the current size of the list. 
 | 
java.lang.Object[] | 
toArray()
Converts the list into an array. 
 | 
add, addAll, equals, hashCode, lastIndexOf, subListcontainsAll, isEmpty, remove, removeAll, retainAll, toArray, toStringpublic TreeList()
public TreeList(java.util.Collection<? extends E> coll)
coll - the collection to copyjava.lang.NullPointerException - if the collection is nullpublic E get(int index)
public int size()
public java.util.Iterator<E> iterator()
public java.util.ListIterator<E> listIterator()
public java.util.ListIterator<E> listIterator(int fromIndex)
public int indexOf(java.lang.Object object)
public boolean contains(java.lang.Object object)
public java.lang.Object[] toArray()
public void add(int index,
                E obj)
public boolean addAll(java.util.Collection<? extends E> c)
 This method runs in O(n + log m) time, where m is
 the size of this list and n is the size of c.
addAll in interface java.util.Collection<E>addAll in interface java.util.List<E>addAll in class java.util.AbstractCollection<E>c - the collection to be added to this listtrue if this list changed as a result of the calljava.lang.NullPointerExceptionpublic E remove(int index)
Copyright © 2010 - 2023 Adobe. All Rights Reserved