BigList<java.lang.Double>, DoubleBigList, DoubleCollection, DoubleIterable, DoubleStack, Size64, Stack<java.lang.Double>, java.io.Serializable, java.lang.Cloneable, java.lang.Comparable<BigList<? extends java.lang.Double>>, java.lang.Iterable<java.lang.Double>, java.util.Collection<java.lang.Double>, java.util.RandomAccesspublic class DoubleBigArrayBigList extends AbstractDoubleBigList implements java.util.RandomAccess, java.lang.Cloneable, java.io.Serializable
This class implements a lightweight, fast, open, optimized, reuse-oriented
version of big-array-based big lists. Instances of this class represent a big
list with a big array that is enlarged as needed when new entries are created
(by doubling the current length), but is never made smaller (even on
a clear()). A family of trimming methods lets
you control the size of the backing big 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 big 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 FormAbstractDoubleBigList.DoubleSubList| Modifier and Type | Field | Description |
|---|---|---|
static int |
DEFAULT_INITIAL_CAPACITY |
The initial default capacity of a big-array big list.
|
| Constructor | Description |
|---|---|
DoubleBigArrayBigList() |
Creates a new big-array big list with
DEFAULT_INITIAL_CAPACITY
capacity. |
DoubleBigArrayBigList(double[][] a) |
Creates a new big-array big list and fills it with the elements of a given
big array.
|
DoubleBigArrayBigList(double[][] a,
long offset,
long length) |
Creates a new big-array big list and fills it with the elements of a given
big array.
|
DoubleBigArrayBigList(long capacity) |
Creates a new big-array big list with given capacity.
|
DoubleBigArrayBigList(DoubleBigList l) |
Creates a new big-array big list and fills it with a given type-specific
list.
|
DoubleBigArrayBigList(DoubleCollection c) |
Creates a new big-array big list and fills it with a given type-specific
collection.
|
DoubleBigArrayBigList(DoubleIterator i) |
Creates a new big-array big list and fills it with the elements returned by a
type-specific iterator..
|
DoubleBigArrayBigList(java.util.Iterator<? extends java.lang.Double> i) |
Creates a new big-array big list and fills it with the elements returned by
an iterator..
|
| Modifier and Type | Method | Description |
|---|---|---|
boolean |
add(double k) |
Ensures that this collection contains the specified element (optional
operation).
|
void |
add(long index,
double k) |
Inserts the specified element at the specified position in this type-specific
big list (optional operation).
|
void |
addElements(long index,
double[][] a,
long offset,
long length) |
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
|
DoubleBigArrayBigList |
clone() |
|
int |
compareTo(DoubleBigArrayBigList l) |
Compares this big list to another big list.
|
double[][] |
elements() |
Returns the backing big array of this big list.
|
void |
ensureCapacity(long capacity) |
Ensures that this big-array big list can contain the given number of entries
without resizing.
|
boolean |
equals(DoubleBigArrayBigList l) |
Compares this type-specific big-array list to another one.
|
double |
getDouble(long index) |
Returns the element at the specified position.
|
void |
getElements(long from,
double[][] a,
long offset,
long length) |
Copies element of this type-specific list into the given big array using
optimized system calls.
|
long |
indexOf(double k) |
Returns the index of the first occurrence of the specified element in this
type-specific big list, or -1 if this big list does not contain the element.
|
boolean |
isEmpty() |
Checks whether the stack is empty.
|
long |
lastIndexOf(double k) |
Returns the index of the last occurrence of the specified element in this
type-specific big list, or -1 if this big list does not contain the element.
|
DoubleBigListIterator |
listIterator(long index) |
Returns a type-specific list iterator on this type-specific big 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(DoubleCollection c) |
Remove from this collection all elements in the given type-specific
collection.
|
boolean |
removeAll(java.util.Collection<?> c) |
|
double |
removeDouble(long index) |
Removes the element at the specified position.
|
void |
removeElements(long from,
long to) |
Removes elements of this type-specific list using optimized system calls.
|
double |
set(long index,
double k) |
Replaces the element at the specified position in this big list with the
specified element (optional operation).
|
void |
size(long size) |
Sets the size of this big list.
|
long |
size64() |
Returns the size of this data structure as a long.
|
void |
trim() |
Trims this big-array big list so that the capacity is equal to the size.
|
void |
trim(long n) |
Trims the backing big array if it is too large.
|
static DoubleBigArrayBigList |
wrap(double[][] a) |
Wraps a given big array into a big-array big list.
|
static DoubleBigArrayBigList |
wrap(double[][] a,
long length) |
Wraps a given big array into a big-array list of given size.
|
add, addAll, addAll, addAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, peekDouble, pop, popDouble, push, push, remove, set, size, subList, top, topDouble, toStringadd, contains, containsAll, remove, retainAll, toArray, toDoubleArray, toDoubleArraycontainsAll, parallelStream, retainAll, spliterator, stream, toArray, toArrayadd, contains, containsAll, remove, removeIf, removeIf, retainAll, toArray, toDoubleArray, toDoubleArrayforEach, forEachpublic static final int DEFAULT_INITIAL_CAPACITY
public DoubleBigArrayBigList(long capacity)
capacity - the initial capacity of the array list (may be 0).public DoubleBigArrayBigList()
DEFAULT_INITIAL_CAPACITY
capacity.public DoubleBigArrayBigList(DoubleCollection c)
c - a type-specific collection that will be used to fill the array
list.public DoubleBigArrayBigList(DoubleBigList l)
l - a type-specific list that will be used to fill the array list.public DoubleBigArrayBigList(double[][] a)
Note that this constructor makes it easy to build big lists from literal
arrays declared as
type[][] {{ init_values }}. The only
constraint is that the number of initialisation values is below
BigArrays.SEGMENT_SIZE.
a - a big array whose elements will be used to fill the array list.public DoubleBigArrayBigList(double[][] a,
long offset,
long length)
Note that this constructor makes it easy to build big lists from literal
arrays declared as
type[][] {{ init_values }}. The only
constraint is that the number of initialisation values is below
BigArrays.SEGMENT_SIZE.
a - a big 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 DoubleBigArrayBigList(java.util.Iterator<? extends java.lang.Double> i)
i - an iterator whose returned elements will fill the array list.public DoubleBigArrayBigList(DoubleIterator i)
i - a type-specific iterator whose returned elements will fill the
array list.public double[][] elements()
public static DoubleBigArrayBigList wrap(double[][] a, long length)
a - a big array to wrap.length - the length of the resulting big-array list.public static DoubleBigArrayBigList wrap(double[][] a)
a - a big array to wrap.public void ensureCapacity(long capacity)
capacity - the new minimum capacity for this big-array big list.public void add(long index,
double k)
AbstractDoubleBigList
This implementation always throws an UnsupportedOperationException.
add in interface DoubleBigListadd in class AbstractDoubleBigListBigList.add(long,Object)public boolean add(double k)
AbstractDoubleBigList
This implementation always throws an UnsupportedOperationException.
This implementation delegates to the type-specific version of
BigList.add(long, Object).
add in interface DoubleCollectionadd in class AbstractDoubleBigListCollection.add(Object)public double getDouble(long index)
DoubleBigListgetDouble in interface DoubleBigListBigList.get(long)public long indexOf(double k)
DoubleBigListindexOf in interface DoubleBigListindexOf in class AbstractDoubleBigListBigList.indexOf(Object)public long lastIndexOf(double k)
DoubleBigListlastIndexOf in interface DoubleBigListlastIndexOf in class AbstractDoubleBigListBigList.lastIndexOf(Object)public double removeDouble(long index)
AbstractDoubleBigList
This implementation always throws an UnsupportedOperationException.
removeDouble in interface DoubleBigListremoveDouble in class AbstractDoubleBigListBigList.remove(long)public boolean rem(double k)
AbstractDoubleBigList
This implementation delegates to indexOf().
rem in interface DoubleCollectionrem in class AbstractDoubleBigListCollection.remove(Object)public double set(long index,
double k)
AbstractDoubleBigList
This implementation always throws an UnsupportedOperationException.
set in interface DoubleBigListset in class AbstractDoubleBigListBigList.set(long,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(java.util.Collection<?> c)
removeAll in interface java.util.Collection<java.lang.Double>removeAll in class java.util.AbstractCollection<java.lang.Double>public void clear()
AbstractDoubleBigList
This implementation delegates to AbstractDoubleBigList.removeElements(long, long).
clear in interface java.util.Collection<java.lang.Double>clear in class AbstractDoubleBigListpublic long size64()
Size64public void size(long size)
BigListIf 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 BigList<java.lang.Double>size in class AbstractDoubleBigListsize - the new size.public boolean isEmpty()
Stackpublic void trim()
ArrayList.trimToSize()public void trim(long n)
n, this
method does nothing. Otherwise, it trims the big-array length to the maximum
between n and size64().
This method is useful when reusing big lists. Clearing a big list leaves the big-array length untouched. If you are reusing a big list many times, you can call this method with a typical size to avoid keeping around a very large big array just because of a few large transient big lists.
n - the threshold for the trimming.public void getElements(long from,
double[][] a,
long offset,
long length)
getElements in interface DoubleBigListgetElements in class AbstractDoubleBigListfrom - the start index (inclusive).a - the destination big 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(long from,
long to)
removeElements in interface DoubleBigListremoveElements in class AbstractDoubleBigListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(long index,
double[][] a,
long offset,
long length)
addElements in interface DoubleBigListaddElements in class AbstractDoubleBigListindex - the index at which to add elements.a - the big array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public DoubleBigListIterator listIterator(long index)
AbstractDoubleBigList
Note that this specification strengthens the one given in
BigList.listIterator(long).
This implementation is based on the random-access methods.
listIterator in interface BigList<java.lang.Double>listIterator in interface DoubleBigListlistIterator in class AbstractDoubleBigListindex - index of first element to be returned from the big-list iterator.BigList.listIterator(long)public DoubleBigArrayBigList clone()
public boolean equals(DoubleBigArrayBigList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a type-specific big-array list.public int compareTo(DoubleBigArrayBigList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a big list.