public abstract class AbstractDoubleList extends AbstractDoubleCollection implements DoubleList, DoubleStack
As an additional bonus, this class implements on top of the list operations a type-specific stack.
Most of the methods in this class are optimized with the assumption that the List will have
have constant-time random access. If this is not the case, you
should probably at least override listIterator(int) and the xAll() methods
(such as addAll(int, java.util.Collection<? extends java.lang.Double>)) with a more appropriate iteration scheme. Note the subList(int, int)
method is cognizant of random-access or not, so that need not be reimplemented.
| Modifier and Type | Class and Description |
|---|---|
static class |
AbstractDoubleList.DoubleRandomAccessSubList |
static class |
AbstractDoubleList.DoubleSubList
A class implementing a sublist view.
|
| Modifier | Constructor and Description |
|---|---|
protected |
AbstractDoubleList() |
| 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(java.util.Collection<? extends java.lang.Double> c) |
boolean |
addAll(DoubleCollection c)
Adds all elements of the given type-specific collection to this collection.
|
boolean |
addAll(int index,
java.util.Collection<? extends java.lang.Double> c)
Adds all of the elements in the specified collection to 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).
|
void |
addElements(int index,
double[] a)
Add (hopefully quickly) elements to this type-specific list.
|
void |
addElements(int index,
double[] a,
int offset,
int length)
Add (hopefully quickly) elements to this type-specific list.
|
void |
clear() |
int |
compareTo(java.util.List<? extends java.lang.Double> l)
Compares this list to another object.
|
boolean |
contains(double k)
Returns true if this list contains the specified element.
|
protected void |
ensureIndex(int index)
Ensures that the given index is nonnegative and not greater than the list size.
|
protected void |
ensureRestrictedIndex(int index)
Ensures that the given index is nonnegative and smaller than the list size.
|
boolean |
equals(java.lang.Object o) |
void |
forEach(java.util.function.DoubleConsumer action)
Performs the given action for each element of this type-specific
Iterable
until all elements have been processed or the action throws an
exception. |
void |
getElements(int from,
double[] a,
int offset,
int length)
Copies (hopefully quickly) elements of this type-specific list into the given array.
|
int |
hashCode()
Returns the hash code for this list, which is identical to
List.hashCode(). |
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.
|
DoubleListIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
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()
Returns a type-specific list iterator on the list.
|
DoubleListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
double |
peekDouble(int i)
Peeks at an element on the stack (optional operation).
|
double |
popDouble()
Pops the top off the stack.
|
void |
push(double o)
Pushes the given object on the stack.
|
boolean |
rem(double k)
Removes a single instance of the specified element from this collection, if it is present (optional operation).
|
double |
removeDouble(int i)
Removes the element at the specified position in this list (optional operation).
|
void |
removeElements(int from,
int to)
Removes (hopefully quickly) elements of this type-specific list.
|
void |
replaceAll(DoubleUnaryOperator operator)
Replaces each element of this list with the result of applying the
operator to that element.
|
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)
Set (hopefully quickly) elements to match the array given.
|
void |
size(int size)
Sets the size of this list.
|
DoubleList |
subList(int from,
int to)
Returns a type-specific view of the portion of this list from the index
from, inclusive, to the index to, exclusive. |
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.
|
double[] |
toDoubleArray()
Returns a primitive type array containing the items of this collection.
|
double |
topDouble()
Peeks at the top of the stack (optional operation).
|
java.lang.String |
toString() |
add, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toDoubleArrayclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, add, addAll, addAll, contains, get, getDouble, indexOf, lastIndexOf, of, of, of, of, of, remove, remove, replaceAll, replaceAll, set, setElements, setElements, sort, sort, spliterator, unstableSort, unstableSortcontainsAll, isEmpty, removeAll, retainAll, size, toArray, toArraycontainsAll, doubleIterator, doubleParallelStream, doubleSpliterator, doubleStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toDoubleArrayforEach, forEachpeek, pop, push, topprotected void ensureIndex(int index)
index - an index.java.lang.IndexOutOfBoundsException - if the given index is negative or greater than the list size.protected void ensureRestrictedIndex(int index)
index - an index.java.lang.IndexOutOfBoundsException - if the given index is negative or not smaller than the list size.public void add(int index,
double k)
add in interface DoubleListList.add(int,Object)public boolean add(double k)
add in interface DoubleCollectionadd in interface DoubleListadd in class AbstractDoubleCollectionCollection.add(Object)public double removeDouble(int i)
removeDouble in interface DoubleListList.remove(int)public double set(int index,
double k)
set in interface DoubleListList.set(int,Object)public boolean addAll(int index,
java.util.Collection<? extends java.lang.Double> c)
addAll in interface java.util.List<java.lang.Double>public boolean addAll(java.util.Collection<? extends java.lang.Double> c)
addAll in interface java.util.Collection<java.lang.Double>addAll in interface java.util.List<java.lang.Double>addAll in class AbstractDoubleCollectionpublic DoubleListIterator iterator()
iterator in interface DoubleCollectioniterator in interface DoubleIterableiterator in interface DoubleListiterator in interface java.lang.Iterable<java.lang.Double>iterator in interface java.util.Collection<java.lang.Double>iterator in interface java.util.List<java.lang.Double>iterator in class AbstractDoubleCollectionIterable.iterator()public DoubleListIterator listIterator()
listIterator in interface DoubleListlistIterator in interface java.util.List<java.lang.Double>List.listIterator()public DoubleListIterator listIterator(int index)
listIterator in interface DoubleListlistIterator in interface java.util.List<java.lang.Double>List.listIterator(int)public boolean contains(double k)
contains in interface DoubleCollectioncontains in class AbstractDoubleCollectionList.contains(Object)public int indexOf(double k)
DoubleListindexOf in interface DoubleListList.indexOf(Object)public int lastIndexOf(double k)
DoubleListlastIndexOf in interface DoubleListList.lastIndexOf(Object)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 - the new size.public DoubleList subList(int from, int to)
DoubleListfrom, inclusive, to the index to, exclusive.subList in interface DoubleListsubList in interface java.util.List<java.lang.Double>List.subList(int,int)public void forEach(java.util.function.DoubleConsumer action)
Iterable
until all elements have been processed or the action throws an
exception.forEach in interface DoubleIterableaction - the action to be performed for each element.Iterable.forEach(java.util.function.Consumer)public void removeElements(int from,
int to)
This is a trivial iterator-based based implementation. It is expected that implementations will override this method with a more optimized version.
removeElements in interface DoubleListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
double[] a,
int offset,
int length)
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
addElements in interface DoubleListindex - 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 addElements(int index,
double[] a)
addElements in interface DoubleListindex - the index at which to add elements.a - the array containing the elements.public void getElements(int from,
double[] a,
int offset,
int length)
This is a trivial iterator-based implementation. It is expected that implementations will override this method with a more optimized version.
getElements in interface DoubleListfrom - 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 setElements(int index,
double[] a,
int offset,
int length)
DoubleList
ListIterator iter = listIterator(index);
int i = 0;
while (i < length) {
iter.next();
iter.set(a[offset + i++]);
}
However, the exact implementation may be more efficient, taking into account
whether random access is faster or not, or at the discretion of subclasses,
abuse internals.setElements in interface DoubleListindex - the index at which to start setting elements.a - the array containing the elementsoffset - the offset of the first element to add.length - the number of elements to add.public void clear()
clear in interface java.util.Collection<java.lang.Double>clear in interface java.util.List<java.lang.Double>clear in class java.util.AbstractCollection<java.lang.Double>public int hashCode()
List.hashCode().hashCode in interface java.util.Collection<java.lang.Double>hashCode in interface java.util.List<java.lang.Double>hashCode in class java.lang.Objectpublic boolean equals(java.lang.Object o)
equals in interface java.util.Collection<java.lang.Double>equals in interface java.util.List<java.lang.Double>equals in class java.lang.Objectpublic int compareTo(java.util.List<? extends java.lang.Double> l)
List, this method performs a lexicographical comparison; otherwise,
it throws a ClassCastException.compareTo in interface java.lang.Comparable<java.util.List<? extends java.lang.Double>>l - a list.List, a negative integer,
zero, or a positive integer as this list is lexicographically less than, equal
to, or greater than the argument.java.lang.ClassCastException - if the argument is not a list.public void push(double o)
DoubleStackpush in interface DoubleStacko - the object to push on the stack.Stack.push(Object)public double popDouble()
DoubleStackpopDouble in interface DoubleStackStack.pop()public double topDouble()
DoubleStacktopDouble in interface DoubleStackStack.top()public double peekDouble(int i)
DoubleStackpeekDouble in interface DoubleStacki - an index from the stop of the stack (0 represents the top).i-th element on the stack.Stack.peek(int)public boolean rem(double k)
rem in interface DoubleCollectionrem in class AbstractDoubleCollectionList.remove(Object)public double[] toDoubleArray()
DoubleCollectiontoDoubleArray in interface DoubleCollectiontoDoubleArray in class AbstractDoubleCollectionCollection.toArray()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 DoubleListList.addAll(int,java.util.Collection)public boolean addAll(DoubleCollection c)
addAll in interface DoubleCollectionaddAll in class AbstractDoubleCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.addAll(Collection)public final void replaceAll(DoubleUnaryOperator operator)
WARNING: Overriding this method is almost always a mistake, as this
overload only exists to disambiguate. Instead, override the replaceAll() overload
that uses the JDK's primitive unary operator type (e.g. IntUnaryOperator).
If Java supported final default methods, this would be one, but sadly it does not.
If you checked and are overriding the version with java.util.function.XUnaryOperator, and
still see this warning, then your IDE is incorrectly conflating this method with the proper
method to override, and you can safely ignore this message.
replaceAll in interface DoubleListoperator - the operator to apply to each elementList.replaceAll(java.util.function.UnaryOperator<E>)public java.lang.String toString()
toString in class AbstractDoubleCollection