public class ListDoubleList extends Object implements Serializable
Number
-valued List
to the DoubleList
interface.
This implementation delegates most methods
to the provided List
implementation in the "obvious" way.Constructor and Description |
---|
ListDoubleList(List list)
Creates an
DoubleList wrapping
the specified List . |
Modifier and Type | Method and Description |
---|---|
boolean |
add(double element)
Ensures that I contain the specified element
(optional operation).
|
void |
add(int index,
double element)
Inserts the specified element at the specified position
(optional operation).
|
boolean |
addAll(DoubleCollection c)
Adds all of the elements in the
specified collection to me (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).
|
void |
clear()
Removes all my elements (optional operation).
|
boolean |
contains(double element)
Returns
true iff I contain
the specified element. |
boolean |
containsAll(DoubleCollection c)
Returns
true iff I contain
all of the elements in the given collection. |
boolean |
equals(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 Collection |
getCollection() |
protected 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. |
boolean |
isEmpty()
Returns
true iff I contain no elements. |
DoubleIterator |
iterator()
|
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)
|
boolean |
removeAll(DoubleCollection c)
Removes all of my elements that are contained in the
specified collection (optional operation).
|
boolean |
removeElement(double element)
Removes a single occurrence of the specified element
(optional operation).
|
double |
removeElementAt(int index)
Removes the element at the specified position in
(optional operation).
|
boolean |
retainAll(DoubleCollection c)
Removes all of my elements that are not contained in the
specified collection (optional operation).
|
double |
set(int index,
double element)
Replaces the element at the specified
position in me with the specified element
(optional operation).
|
int |
size()
Returns the number of elements I contain.
|
DoubleList |
subList(int fromIndex,
int toIndex)
Returns a view of the elements within me
between the specified fromIndex, inclusive, and
toIndex, exclusive.
|
double[] |
toArray()
Returns an array containing all of my elements.
|
double[] |
toArray(double[] dest)
Returns an array containing all of my elements,
using the given array if it is large
enough.
|
String |
toString() |
static DoubleList |
wrap(List list)
Create an
DoubleList wrapping
the specified List . |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
add, iterator
addAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, size, toArray, toArray
public ListDoubleList(List list)
DoubleList
wrapping
the specified List
.wrap(java.util.List)
public static DoubleList wrap(List list)
list
- the (possibly null
)
List
to wrapDoubleList
wrapping the given
list, or null
when list is
null
.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(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
a 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 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 Object
protected final Collection getCollection()
public boolean add(double element)
DoubleCollection
true
iff I changed as a result of this call.
If a collection refuses to add the specified
element for any reason other than that it already contains
the element, it must throw an exception (rather than
simply returning false). This preserves the invariant
that a collection always contains the specified element after
this call returns.add
in interface DoubleCollection
element
- the value whose presence within me is to be ensuredtrue
iff I changed as a result of this callpublic boolean addAll(DoubleCollection c)
DoubleCollection
Adds
all of the elements in the
specified collection to me (optional operation).addAll
in interface DoubleCollection
c
- the collection of elements whose presence within me is to
be ensuredtrue
iff I changed as a result of this callpublic void clear()
DoubleCollection
empty
after this
method successfully returns.clear
in interface DoubleCollection
public boolean contains(double element)
DoubleCollection
true
iff I contain
the specified element.contains
in interface DoubleCollection
element
- the value whose presence within me is to be testedtrue
iff I contain the specified elementpublic boolean containsAll(DoubleCollection c)
DoubleCollection
true
iff I contain
all of the elements in the given collection.containsAll
in interface DoubleCollection
c
- the collection of elements whose presence within me is to
be testedtrue
iff I contain the all the specified elementspublic boolean isEmpty()
DoubleCollection
true
iff I contain no elements.isEmpty
in interface DoubleCollection
true
iff I contain no elements.public DoubleIterator iterator()
iterator
in interface DoubleCollection
iterator
over all my elements.public boolean removeElement(double element)
DoubleCollection
removeElement
in interface DoubleCollection
element
- the element to remove, if presenttrue
iff I contained the specified element,
in other words, iff I changed as a result of this callpublic boolean removeAll(DoubleCollection c)
DoubleCollection
removeAll
in interface DoubleCollection
c
- the collection of elements to removetrue
iff I contained the at least one of the
specified elements, in other words, returns true
iff I changed as a result of this callpublic boolean retainAll(DoubleCollection c)
DoubleCollection
retainAll
in interface DoubleCollection
c
- the collection of elements to retaintrue
iff I changed as a result
of this callpublic int size()
DoubleCollection
size
in interface DoubleCollection
public double[] toArray()
DoubleCollection
size
.
The returned array will be independent of me,
so that callers may modify that
returned array without modifying this collection.
When I guarantee the order in which
elements are returned by an iterator
,
the returned array will contain elements in the
same order.toArray
in interface DoubleCollection
public double[] toArray(double[] dest)
DoubleCollection
iterator
,
the returned array will contain elements in the
same order.toArray
in interface DoubleCollection
dest
- an array that may be used to contain the elementsCopyright © 2002-2013 The Apache Software Foundation. All Rights Reserved.