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, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
add, iterator
addAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, size, toArray, toArray
public void add(int index, double element)
DoubleList
add
in interface DoubleList
index
- the index at which to insert the elementelement
- the value to insertpublic boolean addAll(int index, DoubleCollection collection)
DoubleList
iterator
.addAll
in interface DoubleList
index
- 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)
DoubleList
get
in interface DoubleList
index
- the index of the element to returnpublic int indexOf(double element)
DoubleList
-1
if I do not contain
the element.indexOf
in interface DoubleList
element
- the element to search for-1
if no such matching element can be foundpublic int lastIndexOf(double element)
DoubleList
lastIndexOf
in interface DoubleList
element
- the element to search for-1
if no such matching element can be foundpublic DoubleListIterator listIterator()
listIterator
in interface DoubleList
public DoubleListIterator listIterator(int index)
listIterator
in interface DoubleList
public double removeElementAt(int index)
DoubleList
removeElementAt
in interface DoubleList
index
- the index of the element to removepublic double set(int index, double element)
DoubleList
set
in interface DoubleList
index
- the index of the element to changeelement
- the value to be stored at the specified positionpublic DoubleList subList(int fromIndex, int toIndex)
DoubleList
DoubleList
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 DoubleList
fromIndex
- 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)
DoubleList
true
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 DoubleList
equals
in class java.lang.Object
obj
- the object to compare to metrue
iff that is an DoubleList
that contains the same elements in the same order as mepublic int hashCode()
DoubleList
DoubleList
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 Double
s.hashCode
in interface DoubleList
hashCode
in class java.lang.Object
protected final java.util.Collection getCollection()
getCollection
in class AbstractCollectionDoubleCollection
protected abstract java.util.List getList()
Copyright (c) 2002-2003 - Apache Software Foundation