abstract class AbstractListDoubleList extends AbstractCollectionDoubleCollection implements DoubleList
| Constructor and Description |
|---|
AbstractListDoubleList() |
| Modifier and Type | Method and Description |
|---|---|
void |
add(int index,
double element)
Inserts the specified element at the specified position
(optional operation).
|
boolean |
addAll(int index,
DoubleCollection collection)
Inserts all of the elements in the specified collection into me,
at the specified position (optional operation).
|
boolean |
equals(java.lang.Object obj)
Returns
true iff that is an DoubleList
that contains the same elements in the same order as me. |
double |
get(int index)
Returns the value of the element at the specified position
within me.
|
protected java.util.Collection |
getCollection() |
protected abstract java.util.List |
getList() |
int |
hashCode()
Returns my hash code.
|
int |
indexOf(double element)
Returns the index of the first occurrence
of the specified element within me,
or
-1 if I do not contain
the element. |
int |
lastIndexOf(double element)
Returns the index of the last occurrence
of the specified element within me,
or -1 if I do not contain the element.
|
DoubleListIterator |
listIterator()
|
DoubleListIterator |
listIterator(int index)
|
double |
removeElementAt(int index)
Removes the element at the specified position in
(optional operation).
|
double |
set(int index,
double element)
Replaces the element at the specified
position in me with the specified element
(optional operation).
|
DoubleList |
subList(int fromIndex,
int toIndex)
Returns a view of the elements within me
between the specified fromIndex, inclusive, and
toIndex, exclusive.
|
add, addAll, clear, contains, containsAll, isEmpty, iterator, removeAll, removeElement, retainAll, size, toArray, toArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitadd, iteratoraddAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, size, toArray, toArraypublic void add(int index,
double element)
DoubleListadd in interface DoubleListindex - the index at which to insert the elementelement - the value to insertpublic boolean addAll(int index,
DoubleCollection collection)
DoubleListiterator.addAll in interface DoubleListindex - the index at which to insert the first element from
the specified collectioncollection - the DoubleCollection of elements to addtrue iff I changed as a result of this callpublic double get(int index)
DoubleListget in interface DoubleListindex - the index of the element to returnpublic int indexOf(double element)
DoubleList-1 if I do not contain
the element.indexOf in interface DoubleListelement - the element to search for-1 if no such matching element can be foundpublic int lastIndexOf(double element)
DoubleListlastIndexOf in interface DoubleListelement - the element to search for-1 if no such matching element can be foundpublic DoubleListIterator listIterator()
listIterator in interface DoubleListpublic DoubleListIterator listIterator(int index)
listIterator in interface DoubleListpublic double removeElementAt(int index)
DoubleListremoveElementAt in interface DoubleListindex - the index of the element to removepublic double set(int index,
double element)
DoubleListset in interface DoubleListindex - the index of the element to changeelement - the value to be stored at the specified positionpublic DoubleList subList(int fromIndex, int toIndex)
DoubleListDoubleList
is backed by me, so that any changes in
the returned list are reflected in me, and vice-versa.
The returned list supports all of the optional operations
that I support.
Note that when fromIndex == toIndex,
the returned list is initially empty, and when
fromIndex == 0 && toIndex == size()
the returned list is my "improper" sublist, containing all my elements.
The semantics of the returned list become undefined
if I am structurally modified in any way other than
via the returned list.subList in interface DoubleListfromIndex - the smallest index (inclusive) in me that appears in
the returned listtoIndex - the largest index (exclusive) in me that appears in the
returned listpublic boolean equals(java.lang.Object obj)
DoubleListtrue iff that is an DoubleList
that contains the same elements in the same order as me.
In other words, returns true iff that is
an DoubleList that has the same size as me,
and for which the elements returned by its
iterator are equal (==) to
the corresponding elements within me.
(This contract ensures that this method works properly across
different implementations of the DoubleList interface.)equals in interface DoubleListequals in class java.lang.Objectobj - the object to compare to metrue iff that is an DoubleList
that contains the same elements in the same order as mepublic int hashCode()
DoubleListDoubleList is defined to be the
result of the following calculation:
int hash = 1;
for(DoubleIterator iter = iterator(); iter.hasNext(); ) {
double value = iter.next();
hash = 31*hash + (int)(value ^ (value >>> 32));
}
This contract ensures that this method is consistent with
equals and with the
hashCode
method of a List of Doubles.hashCode in interface DoubleListhashCode in class java.lang.Objectprotected final java.util.Collection getCollection()
getCollection in class AbstractCollectionDoubleCollectionprotected abstract java.util.List getList()
Copyright (c) 2002-2003 - Apache Software Foundation