public static class DoubleLists.EmptyList extends DoubleCollections.EmptyCollection implements DoubleList, RandomAccess, Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific list.
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(Double k)
Deprecated.
Please use the corresponding type-specific method
instead.
|
void |
add(int index,
double k)
Inserts the specified element at the specified position in this list
(optional operation).
|
void |
add(int index,
Double k)
Deprecated.
Please use the corresponding type-specific method
instead.
|
boolean |
addAll(DoubleList c)
Appends all of the elements in the specified type-specific list to the
end of this type-specific list (optional operation).
|
boolean |
addAll(int i,
Collection<? extends Double> c)
Inserts all of the elements in the specified collection into this
list at the specified position (optional operation).
|
boolean |
addAll(int i,
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 i,
DoubleList c)
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)
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.
|
Object |
clone()
Creates and returns a copy of this object.
|
int |
compareTo(List<? extends Double> o)
Compares this object with the specified object for order.
|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
Double |
get(int index)
Deprecated.
Please use the corresponding type-specific method
instead.
|
double |
getDouble(int i)
Returns the element at the specified position in this list.
|
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 a hash code value for the object.
|
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.
|
int |
indexOf(Object k)
Deprecated.
Please use the corresponding type-specific method
instead.
|
DoubleListIterator |
iterator()
Returns an iterator over the elements contained in 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.
|
int |
lastIndexOf(Object k)
Deprecated.
Please use the corresponding type-specific method
instead.
|
DoubleListIterator |
listIterator()
Returns a type-specific list iterator on the list.
|
DoubleListIterator |
listIterator(int i)
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).
|
Double |
remove(int k)
Deprecated.
Please use the corresponding type-specific method
instead.
|
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.
|
double |
set(int index,
double k)
Replaces the element at the specified position in this list with the
specified element (optional operation).
|
Double |
set(int index,
Double k)
Deprecated.
Please use the corresponding type-specific method
instead.
|
void |
size(int s)
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. |
String |
toString()
Returns a string representation of this collection.
|
addAll, addAll, clear, contains, removeAll, removeAll, retainAll, retainAll, size, toArrayadd, contains, containsAll, remove, toArray, toDoubleArray, toDoubleArraycontainsAll, isEmpty, toArrayaddaddAll, clear, contains, containsAll, isEmpty, remove, removeAll, replaceAll, retainAll, size, sort, spliterator, toArray, toArrayaddAll, contains, contains, containsAll, remove, removeAll, retainAll, toArray, toDoubleArray, toDoubleArrayparallelStream, removeIf, streamforEach, forEachpublic double getDouble(int i)
DoubleListgetDouble in interface DoubleListList.get(int)public boolean rem(double k)
AbstractDoubleCollection
Note that this method should be called
remove(), 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().
This implementation iterates over the elements in the collection, looking for the specified element and tries to remove it.
rem in interface DoubleCollectionrem in class AbstractDoubleCollectionCollection.remove(Object)public double removeDouble(int i)
DoubleListremoveDouble in interface DoubleListList.remove(int)public void add(int index,
double k)
DoubleListadd in interface DoubleListList.add(int,Object)public double set(int index,
double k)
DoubleListset in interface DoubleListList.set(int,Object)public int indexOf(double k)
DoubleListindexOf in interface DoubleListList.indexOf(Object)public int lastIndexOf(double k)
DoubleListlastIndexOf in interface DoubleListList.lastIndexOf(Object)public boolean addAll(int i,
Collection<? extends Double> c)
java.util.Listpublic boolean addAll(DoubleList c)
DoubleListaddAll in interface DoubleListList.add(int,Object)public boolean addAll(int i,
DoubleCollection c)
DoubleListaddAll in interface DoubleListList.addAll(int,java.util.Collection)public boolean addAll(int i,
DoubleList c)
DoubleListaddAll in interface DoubleListList.add(int,Object)@Deprecated public void add(int index, Double k)
add in interface DoubleListadd in interface List<Double>index - index at which the specified element is to be insertedk - element to be inserted@Deprecated public Double get(int index)
get in interface DoubleListget in interface List<Double>index - index of the element to return@Deprecated public boolean add(Double k)
Collections that support this operation may place limitations on what elements may be added to this collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.
If a collection refuses to add a particular element for any reason other than that it already contains the element, it must throw an exception (rather than returning false). This preserves the invariant that a collection always contains the specified element after this call returns.
This implementation always throws an UnsupportedOperationException.
This implementation delegates to the corresponding type-specific method.
add in interface DoubleCollectionadd in interface DoubleListadd in interface Collection<Double>add in interface List<Double>add in class AbstractDoubleCollectionk - element whose presence in this collection is to be ensured@Deprecated public Double set(int index, Double k)
set in interface DoubleListset in interface List<Double>index - index of the element to replacek - element to be stored at the specified position@Deprecated public Double remove(int k)
remove in interface DoubleListremove in interface List<Double>k - the index of the element to be removed@Deprecated public int indexOf(Object k)
indexOf in interface DoubleListindexOf in interface List<Double>k - element to search for@Deprecated public int lastIndexOf(Object k)
lastIndexOf in interface DoubleListlastIndexOf in interface List<Double>k - element to search forpublic DoubleListIterator listIterator()
DoubleListlistIterator in interface DoubleListlistIterator in interface List<Double>List.listIterator()public DoubleListIterator iterator()
java.util.AbstractCollectioniterator in interface DoubleCollectioniterator in interface DoubleIterableiterator in interface DoubleListiterator in interface Iterable<Double>iterator in interface Collection<Double>iterator in interface List<Double>iterator in class DoubleCollections.EmptyCollectionIterable.iterator()public DoubleListIterator listIterator(int i)
DoubleListlistIterator in interface DoubleListlistIterator in interface List<Double>i - index of the first element to be returned from the
list iterator (by a call to next)List.listIterator(int)public DoubleList subList(int from, int to)
DoubleListfrom, inclusive, to the index to, exclusive.
Note that this specification strengthens the one given in
List.subList(int,int).
subList in interface DoubleListsubList in interface List<Double>from - low endpoint (inclusive) of the subListto - high endpoint (exclusive) of the subListList.subList(int,int)public void getElements(int from,
double[] a,
int offset,
int length)
DoubleListgetElements 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 removeElements(int from,
int to)
DoubleListremoveElements in interface DoubleListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
double[] a,
int offset,
int length)
DoubleListaddElements 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)
DoubleListaddElements in interface DoubleListindex - the index at which to add elements.a - the array containing the elements.public void size(int s)
DoubleList
If 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 DoubleLists - the new size.public int compareTo(List<? extends Double> o)
java.lang.ComparableThe implementor must ensure sgn(x.compareTo(y)) == -sgn(y.compareTo(x)) for all x and y. (This implies that x.compareTo(y) must throw an exception iff y.compareTo(x) throws an exception.)
The implementor must also ensure that the relation is transitive: (x.compareTo(y)>0 && y.compareTo(z)>0) implies x.compareTo(z)>0.
Finally, the implementor must ensure that x.compareTo(y)==0 implies that sgn(x.compareTo(z)) == sgn(y.compareTo(z)), for all z.
It is strongly recommended, but not strictly required that (x.compareTo(y)==0) == (x.equals(y)). Generally speaking, any class that implements the Comparable interface and violates this condition should clearly indicate this fact. The recommended language is "Note: this class has a natural ordering that is inconsistent with equals."
In the foregoing description, the notation sgn(expression) designates the mathematical signum function, which is defined to return one of -1, 0, or 1 according to whether the value of expression is negative, zero or positive.
compareTo in interface Comparable<List<? extends Double>>o - the object to be compared.public Object clone()
java.lang.Objectx, the expression:
will be true, and that the expression:x.clone() != x
will bex.clone().getClass() == x.getClass()
true, but these are not absolute requirements.
While it is typically the case that:
will bex.clone().equals(x)
true, this is not an absolute requirement.
By convention, the returned object should be obtained by calling
super.clone. If a class and all of its superclasses (except
Object) obey this convention, it will be the case that
x.clone().getClass() == x.getClass().
By convention, the object returned by this method should be independent
of this object (which is being cloned). To achieve this independence,
it may be necessary to modify one or more fields of the object returned
by super.clone before returning it. Typically, this means
copying any mutable objects that comprise the internal "deep structure"
of the object being cloned and replacing the references to these
objects with references to the copies. If a class contains only
primitive fields or references to immutable objects, then it is usually
the case that no fields in the object returned by super.clone
need to be modified.
The method clone for class Object performs a
specific cloning operation. First, if the class of this object does
not implement the interface Cloneable, then a
CloneNotSupportedException is thrown. Note that all arrays
are considered to implement the interface Cloneable and that
the return type of the clone method of an array type T[]
is T[] where T is any reference or primitive type.
Otherwise, this method creates a new instance of the class of this
object and initializes all its fields with exactly the contents of
the corresponding fields of this object, as if by assignment; the
contents of the fields are not themselves cloned. Thus, this method
performs a "shallow copy" of this object, not a "deep copy" operation.
The class Object does not itself implement the interface
Cloneable, so calling the clone method on an object
whose class is Object will result in throwing an
exception at run time.
public int hashCode()
java.lang.ObjectHashMap.
The general contract of hashCode is:
hashCode method
must consistently return the same integer, provided no information
used in equals comparisons on the object is modified.
This integer need not remain consistent from one execution of an
application to another execution of the same application.
equals(Object)
method, then calling the hashCode method on each of
the two objects must produce the same integer result.
Object.equals(java.lang.Object)
method, then calling the hashCode method on each of the
two objects must produce distinct integer results. However, the
programmer should be aware that producing distinct integer results
for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by
class Object does return distinct integers for distinct
objects. (This is typically implemented by converting the internal
address of the object into an integer, but this implementation
technique is not required by the
Java™ programming language.)
hashCode in interface Collection<Double>hashCode in interface List<Double>hashCode in class DoubleCollections.EmptyCollectionObject.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)public boolean equals(Object o)
java.lang.Object
The equals method implements an equivalence relation
on non-null object references:
x, x.equals(x) should return
true.
x and y, x.equals(y)
should return true if and only if
y.equals(x) returns true.
x, y, and z, if
x.equals(y) returns true and
y.equals(z) returns true, then
x.equals(z) should return true.
x and y, multiple invocations of
x.equals(y) consistently return true
or consistently return false, provided no
information used in equals comparisons on the
objects is modified.
x,
x.equals(null) should return false.
The equals method for class Object implements
the most discriminating possible equivalence relation on objects;
that is, for any non-null reference values x and
y, this method returns true if and only
if x and y refer to the same object
(x == y has the value true).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden, so as to maintain the
general contract for the hashCode method, which states
that equal objects must have equal hash codes.
equals in interface Collection<Double>equals in interface List<Double>equals in class DoubleCollections.EmptyCollectiono - the reference object with which to compare.true if this object is the same as the obj
argument; false otherwise.Object.hashCode(),
HashMappublic String toString()
java.util.AbstractCollectionString.valueOf(Object).toString in class AbstractDoubleCollection