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 |
|---|---|
protected double[] |
a
The backing array.
|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
protected int |
size
The current actual size of the list (never greater than the backing-array length).
|
| Modifier | 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.
|
protected |
DoubleArrayList(double[] a,
boolean dummy)
Creates a new array list using 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)
Ensures that this collection contains the specified element (optional operation).
|
void |
add(int index,
double k)
Inserts the specified element at the specified position in this list (optional operation).
|
boolean |
addAll(int index,
DoubleCollection c)
Inserts all of the elements in the specified type-specific collection into this type-specific list at the specified position (optional operation).
|
boolean |
addAll(int index,
DoubleList l)
Inserts all of the elements in the specified type-specific list into this type-specific list at the specified position (optional operation).
|
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)
Returns the element at the specified position in this list.
|
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)
Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
boolean |
isEmpty()
Checks whether the stack is empty.
|
int |
lastIndexOf(double k)
Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
DoubleListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
boolean |
rem(double k)
Removes a single instance of the specified element from this collection, if it is present (optional operation).
|
boolean |
removeAll(Collection<?> c) |
boolean |
removeAll(DoubleCollection c)
Remove from this collection all elements in the given type-specific collection.
|
double |
removeDouble(int index)
Removes the element at the specified position in this list (optional operation).
|
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
double |
set(int index,
double k)
Replaces the element at the specified position in this list with the specified element (optional operation).
|
void |
setElements(int index,
double[] a,
int offset,
int length)
Sets elements to this type-specific list using optimized system calls.
|
int |
size() |
void |
size(int size)
Sets the size of this list.
|
void |
sort(DoubleComparator comp)
Sort a list using a type-specific comparator.
|
double[] |
toArray(double[] a)
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.
|
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.
|
void |
unstableSort(DoubleComparator comp)
Sorts this list using a sort not assured to be stable.
|
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.
|
addAll, addAll, addAll, addAll, addElements, compareTo, contains, ensureIndex, ensureRestrictedIndex, equals, hashCode, iterator, listIterator, peekDouble, popDouble, push, subList, topDouble, toStringadd, contains, containsAll, remove, retainAll, toDoubleArray, toDoubleArraycontainsAll, retainAll, toArray, toArrayfinalize, getClass, notify, notifyAll, wait, wait, waitadd, add, contains, get, indexOf, lastIndexOf, remove, remove, set, setElements, setElements, sort, unstableSortcontainsAll, replaceAll, retainAll, spliterator, toArray, toArraycontainsAll, removeIf, removeIf, retainAll, toDoubleArray, toDoubleArrayparallelStream, streamforEach, forEachpeek, pop, push, toppublic static final int DEFAULT_INITIAL_CAPACITY
protected transient double[] a
protected int size
protected DoubleArrayList(double[] a,
boolean dummy)
This constructor is only meant to be used by the wrapping methods.
a - the array that will be used to back this array list.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)
Note it is guaranteed
that the type of the array returned by elements() will be the same
(see the comments in the class documentation).
a - an array to wrap.length - the length of the resulting array list.public static DoubleArrayList wrap(double[] a)
Note it is guaranteed
that the type of the array returned by elements() will be the same
(see the comments in the class documentation).
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)
AbstractDoubleListThis implementation always throws an UnsupportedOperationException.
add in interface DoubleListadd in class AbstractDoubleListList.add(int,Object)public boolean add(double k)
AbstractDoubleListThis implementation always throws an UnsupportedOperationException.
This implementation delegates to the type-specific version of List.add(int, Object).
add in interface DoubleCollectionadd in interface DoubleListadd in class AbstractDoubleListCollection.add(Object)public double getDouble(int index)
DoubleListgetDouble in interface DoubleListList.get(int)public int indexOf(double k)
DoubleListindexOf in interface DoubleListindexOf in class AbstractDoubleListList.indexOf(Object)public int lastIndexOf(double k)
DoubleListlastIndexOf in interface DoubleListlastIndexOf in class AbstractDoubleListList.lastIndexOf(Object)public double removeDouble(int index)
AbstractDoubleListThis implementation always throws an UnsupportedOperationException.
removeDouble in interface DoubleListremoveDouble in class AbstractDoubleListList.remove(int)public boolean rem(double k)
AbstractDoubleListThis implementation delegates to indexOf().
rem in interface DoubleCollectionrem in class AbstractDoubleListList.remove(Object)public double set(int index,
double k)
AbstractDoubleListThis implementation always throws an UnsupportedOperationException.
set in interface DoubleListset in class AbstractDoubleListList.set(int,Object)public void clear()
AbstractDoubleListThis implementation delegates to AbstractDoubleList.removeElements(int, int).
clear in interface Collection<Double>clear in interface List<Double>clear in class AbstractDoubleListpublic 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 void setElements(int index,
double[] a,
int offset,
int length)
setElements in interface DoubleListindex - the index at which to start setting 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[] toArray(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.
toArray in interface DoubleCollectiontoArray 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)
DoubleListaddAll in interface DoubleListaddAll in class AbstractDoubleListList.addAll(int,java.util.Collection)public boolean addAll(int index,
DoubleList l)
AbstractDoubleListThis implementation delegates to the type-specific version of List.addAll(int, Collection).
addAll in interface DoubleListaddAll in class AbstractDoubleListList.add(int,Object)public boolean removeAll(DoubleCollection c)
DoubleCollectionremoveAll in interface DoubleCollectionremoveAll in class AbstractDoubleCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.removeAll(Collection)public boolean removeAll(Collection<?> c)
removeAll in interface Collection<Double>removeAll in interface List<Double>removeAll in class AbstractCollection<Double>public DoubleListIterator listIterator(int index)
AbstractDoubleListThis implementation is based on the random-access methods.
listIterator in interface DoubleListlistIterator in interface List<Double>listIterator in class AbstractDoubleListList.listIterator(int)public void sort(DoubleComparator comp)
DoubleListPass null to sort using natural ordering.
sort in interface DoubleListList.sort(java.util.Comparator)public void unstableSort(DoubleComparator comp)
DoubleListPass null to sort using natural ordering.
This differs from List.sort(java.util.Comparator) in that the results are
not assured to be stable, but may be a bit faster.
Unless a subclass specifies otherwise, the results of the method if the list is concurrently modified during the sort are unspecified.
unstableSort in interface DoubleListpublic 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.Copyright © 2020. All rights reserved.