public class TreeList extends AbstractList
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 sligtly more memory.
modCount| Constructor and Description |
|---|
TreeList()
Constructs a new empty list.
|
TreeList(Collection coll)
Constructs a new empty list that copies the specified list.
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(int index,
Object obj)
Adds a new element to the list.
|
void |
clear()
Clears the list, removing all entries.
|
boolean |
contains(Object object)
Searches for the presence of an object in the list.
|
Object |
get(int index)
Gets the element at the specified index.
|
int |
indexOf(Object object)
Searches for the index of an object in the list.
|
Iterator |
iterator()
Gets an iterator over the list.
|
ListIterator |
listIterator()
Gets a ListIterator over the list.
|
ListIterator |
listIterator(int fromIndex)
Gets a ListIterator over the list.
|
Object |
remove(int index)
Removes the element at the specified index.
|
Object |
set(int index,
Object obj)
Sets the element at the specified index.
|
int |
size()
Gets the current size of the list.
|
Object[] |
toArray()
Converts the list into an array.
|
add, addAll, equals, hashCode, lastIndexOf, removeRange, subListaddAll, containsAll, isEmpty, remove, removeAll, retainAll, toArray, toStringpublic TreeList()
public TreeList(Collection coll)
coll - the collection to copyNullPointerException - if the collection is nullpublic Object get(int index)
get in interface Listget in class AbstractListindex - the index to retrievepublic int size()
size in interface Collectionsize in interface Listsize in class AbstractCollectionpublic Iterator iterator()
iterator in interface Iterableiterator in interface Collectioniterator in interface Listiterator in class AbstractListpublic ListIterator listIterator()
listIterator in interface ListlistIterator in class AbstractListpublic ListIterator listIterator(int fromIndex)
listIterator in interface ListlistIterator in class AbstractListfromIndex - the index to start frompublic int indexOf(Object object)
indexOf in interface ListindexOf in class AbstractListpublic boolean contains(Object object)
contains in interface Collectioncontains in interface Listcontains in class AbstractCollectionpublic Object[] toArray()
toArray in interface CollectiontoArray in interface ListtoArray in class AbstractCollectionpublic void add(int index,
Object obj)
add in interface Listadd in class AbstractListindex - the index to add beforeobj - the element to addpublic Object set(int index, Object obj)
set in interface Listset in class AbstractListindex - the index to setobj - the object to store at the specified indexIndexOutOfBoundsException - if the index is invalidpublic Object remove(int index)
remove in interface Listremove in class AbstractListindex - the index to removepublic void clear()
clear in interface Collectionclear in interface Listclear in class AbstractListCopyright © 2001–2015 The Apache Software Foundation. All rights reserved.