public class DoubleArrayList extends AbstractDoubleList implements RandomAccess, Cloneable, Serializable
This class implements a lightweight, fast, open, optimized,
reuse-oriented version of array-based lists. Instances of this class
represent a list with an array that is enlarged as needed when new entries
are created (by doubling its current length), but is
never made smaller (even on a clear()). A family of
trimming methods lets you control the size of the
backing array; this is particularly useful if you reuse instances of this class.
Range checks are equivalent to those of java.util's classes, but
they are delayed as much as possible. The backing array is exposed by the
elements() method.
This class implements the bulk methods removeElements(),
addElements() and getElements() using
high-performance system calls (e.g., System.arraycopy() instead of
expensive loops.
ArrayList,
Serialized FormAbstractDoubleList.DoubleSubList| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
| Constructor and Description |
|---|
DoubleArrayList()
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
DoubleArrayList(Collection<? extends Double> c)
Creates a new array list and fills it with a given collection.
|
DoubleArrayList(double[] a)
Creates a new array list and fills it with the elements of a given array.
|
DoubleArrayList(double[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array.
|
DoubleArrayList(DoubleCollection c)
Creates a new array list and fills it with a given type-specific collection.
|
DoubleArrayList(DoubleIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator..
|
DoubleArrayList(DoubleList l)
Creates a new array list and fills it with a given type-specific list.
|
DoubleArrayList(int capacity)
Creates a new array list with given capacity.
|
DoubleArrayList(Iterator<? extends Double> i)
Creates a new array list and fills it with the elements returned by an iterator..
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(double k) |
void |
add(int index,
double k) |
boolean |
addAll(int index,
DoubleCollection c)
Delegates to a more generic method.
|
boolean |
addAll(int index,
DoubleList l)
Delegates to a more generic method.
|
void |
addElements(int index,
double[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
DoubleArrayList |
clone() |
int |
compareTo(DoubleArrayList l)
Compares this array list to another array list.
|
double[] |
elements()
Returns the backing array of this list.
|
void |
ensureCapacity(int capacity)
Ensures that this array list can contain the given number of entries without resizing.
|
boolean |
equals(DoubleArrayList l)
Compares this type-specific array list to another one.
|
double |
getDouble(int index) |
void |
getElements(int from,
double[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls.
|
int |
indexOf(double k) |
boolean |
isEmpty()
Checks whether the stack is empty.
|
int |
lastIndexOf(double k) |
DoubleListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
boolean |
rem(double k)
|
double |
removeDouble(int index) |
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
double |
set(int index,
double k) |
int |
size() |
void |
size(int size)
Sets the size of this list.
|
double[] |
toDoubleArray(double[] a)
Returns a primitive type array containing the items of this collection.
|
void |
trim()
Trims this array list so that the capacity is equal to the size.
|
void |
trim(int n)
Trims the backing array if it is too large.
|
static DoubleArrayList |
wrap(double[] a)
Wraps a given array into an array list.
|
static DoubleArrayList |
wrap(double[] a,
int length)
Wraps a given array into an array list of given size.
|
add, addAll, addAll, addAll, addAll, addElements, compareTo, contains, doubleListIterator, doubleListIterator, doubleSubList, equals, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, peekDouble, pop, popDouble, push, push, remove, remove, set, subList, top, topDouble, toStringadd, contains, containsAll, containsAll, doubleIterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toDoubleArrayadd, contains, containsAll, removeAll, retainAll, toArray, toArraycontainsAll, doubleIterator, removeAll, retainAll, toArray, toArray, toDoubleArraypublic static final int DEFAULT_INITIAL_CAPACITY
public DoubleArrayList(int capacity)
capacity - the initial capacity of the array list (may be 0).public DoubleArrayList()
DEFAULT_INITIAL_CAPACITY capacity.public DoubleArrayList(Collection<? extends Double> c)
c - a collection that will be used to fill the array list.public DoubleArrayList(DoubleCollection c)
c - a type-specific collection that will be used to fill the array list.public DoubleArrayList(DoubleList l)
l - a type-specific list that will be used to fill the array list.public DoubleArrayList(double[] a)
a - an array whose elements will be used to fill the array list.public DoubleArrayList(double[] a,
int offset,
int length)
a - an array whose elements will be used to fill the array list.offset - the first element to use.length - the number of elements to use.public DoubleArrayList(Iterator<? extends Double> i)
i - an iterator whose returned elements will fill the array list.public DoubleArrayList(DoubleIterator i)
i - a type-specific iterator whose returned elements will fill the array list.public double[] elements()
public static DoubleArrayList wrap(double[] a, int length)
a - an array to wrap.length - the length of the resulting array list.public static DoubleArrayList wrap(double[] a)
a - an array to wrap.public void ensureCapacity(int capacity)
capacity - the new minimum capacity for this array list.public void add(int index,
double k)
add in interface DoubleListadd in class AbstractDoubleListList.add(int,Object)public boolean add(double k)
add in interface DoubleCollectionadd in interface DoubleListadd in class AbstractDoubleListCollection.add(Object)public double getDouble(int index)
getDouble in interface DoubleListList.get(int)public int indexOf(double k)
indexOf in interface DoubleListindexOf in class AbstractDoubleListList.indexOf(Object)public int lastIndexOf(double k)
lastIndexOf in interface DoubleListlastIndexOf in class AbstractDoubleListList.lastIndexOf(Object)public double removeDouble(int index)
removeDouble in interface DoubleListremoveDouble in class AbstractDoubleListList.remove(int)public boolean rem(double k)
DoubleCollectionremove(), but the clash
with the similarly named index-based method in the List interface
forces us to use a distinguished name. For simplicity, the set interfaces reinstates
remove().rem in interface DoubleCollectionrem in class AbstractDoubleListCollection.remove(Object)public double set(int index,
double k)
set in interface DoubleListset in class AbstractDoubleListList.set(int,Object)public void clear()
clear in interface Collection<Double>clear in interface List<Double>clear in class AbstractCollection<Double>public int size()
size in interface Collection<Double>size in interface List<Double>size in class AbstractCollection<Double>public void size(int size)
DoubleListIf the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null/false.
size in interface DoubleListsize in class AbstractDoubleListsize - the new size.public boolean isEmpty()
Stackpublic void trim()
ArrayList.trimToSize()public void trim(int n)
n, this method does nothing. Otherwise, it trims the
array length to the maximum between n and size().
This method is useful when reusing lists. Clearing a list leaves the array length untouched. If you are reusing a list many times, you can call this method with a typical size to avoid keeping around a very large array just because of a few large transient lists.
n - the threshold for the trimming.public void getElements(int from,
double[] a,
int offset,
int length)
getElements in interface DoubleListgetElements in class AbstractDoubleListfrom - the start index (inclusive).a - the destination array.offset - the offset into the destination array where to store the first element copied.length - the number of elements to be copied.public void removeElements(int from,
int to)
removeElements in interface DoubleListremoveElements in class AbstractDoubleListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
double[] a,
int offset,
int length)
addElements in interface DoubleListaddElements in class AbstractDoubleListindex - the index at which to add elements.a - the array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public double[] toDoubleArray(double[] a)
DoubleCollectionNote that, contrarily to Collection.toArray(Object[]), this
methods just writes all elements of this collection: no special
value will be added after the last one.
toDoubleArray in interface DoubleCollectiontoDoubleArray in class AbstractDoubleCollectiona - if this array is big enough, it will be used to store this collection.Collection.toArray(Object[])public boolean addAll(int index,
DoubleCollection c)
AbstractDoubleListaddAll in interface DoubleListaddAll in class AbstractDoubleListList.add(int,Object)public boolean addAll(int index,
DoubleList l)
AbstractDoubleListaddAll in interface DoubleListaddAll in class AbstractDoubleListList.add(int,Object)public DoubleListIterator listIterator(int index)
DoubleListlistIterator in interface DoubleListlistIterator in interface List<Double>listIterator in class AbstractDoubleListList.listIterator(int)public DoubleArrayList clone()
public boolean equals(DoubleArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a type-specific array list.public int compareTo(DoubleArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - an array list.