public interface LongList extends LongCollection
long
values.LongListList
,
ListLongList
Modifier and Type | Method and Description |
---|---|
void |
add(int index,
long element)
Inserts the specified element at the specified position
(optional operation).
|
boolean |
add(long element)
Appends the specified element to the end of me
(optional operation).
|
boolean |
addAll(int index,
LongCollection collection)
Inserts all of the elements in the specified collection into me,
at the specified position (optional operation).
|
boolean |
equals(Object that)
Returns
true iff that is an LongList
that contains the same elements in the same order as me. |
long |
get(int index)
Returns the value of the element at the specified position
within me.
|
int |
hashCode()
Returns my hash code.
|
int |
indexOf(long element)
Returns the index of the first occurrence
of the specified element within me,
or
-1 if I do not contain
the element. |
LongIterator |
iterator()
Returns an
iterator over all my elements,
in the appropriate sequence. |
int |
lastIndexOf(long element)
Returns the index of the last occurrence
of the specified element within me,
or -1 if I do not contain the element.
|
LongListIterator |
listIterator()
Returns a
bidirectional iterator
over all my elements, in the appropriate sequence. |
LongListIterator |
listIterator(int index)
Returns a
bidirectional iterator
over all my elements, in the appropriate sequence,
starting at the specified position. |
long |
removeElementAt(int index)
Removes the element at the specified position in
(optional operation).
|
long |
set(int index,
long element)
Replaces the element at the specified
position in me with the specified element
(optional operation).
|
LongList |
subList(int fromIndex,
int toIndex)
Returns a view of the elements within me
between the specified fromIndex, inclusive, and
toIndex, exclusive.
|
addAll, clear, contains, containsAll, isEmpty, removeAll, removeElement, retainAll, size, toArray, toArray
boolean add(long element)
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 LongCollection
element
- the value whose presence within me is to be ensuredtrue
iff I changed as a result of this callUnsupportedOperationException
- when this operation is not
supportedIllegalArgumentException
- may be thrown if some aspect of the
specified element prevents it from being added to mevoid add(int index, long element)
index
- the index at which to insert the elementelement
- the value to insertUnsupportedOperationException
- when this operation is not
supportedIllegalArgumentException
- if some aspect of the specified element
prevents it from being added to meIndexOutOfBoundsException
- if the specified index is out of rangeboolean addAll(int index, LongCollection collection)
iterator
.index
- the index at which to insert the first element from
the specified collectioncollection
- the LongCollection
of elements to addtrue
iff I changed as a result of this callUnsupportedOperationException
- when this operation is not
supportedIndexOutOfBoundsException
- if the specified index is out of rangeboolean equals(Object that)
true
iff that is an LongList
that contains the same elements in the same order as me.
In other words, returns true
iff that is
a LongList
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 LongList
interface.)long get(int index)
index
- the index of the element to returnIndexOutOfBoundsException
- if the specified index is out of rangeint hashCode()
LongList
is defined to be the
result of the following calculation:
int hash = 1; for(LongIterator iter = iterator(); iter.hasNext(); ) { long 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 Long
s.int indexOf(long element)
-1
if I do not contain
the element.element
- the element to search for-1
if no such matching element can be foundLongIterator iterator()
iterator
over all my elements,
in the appropriate sequence.iterator
in interface LongCollection
iterator
over all my elements.int lastIndexOf(long element)
element
- the element to search for-1
if no such matching element can be foundLongListIterator listIterator()
bidirectional iterator
over all my elements, in the appropriate sequence.LongListIterator listIterator(int index)
bidirectional iterator
over all my elements, in the appropriate sequence,
starting at the specified position. The
specified index indicates the first
element that would be returned by an initial
call to the
next
method. An initial call to the
previous
method would return the element with the specified
index minus one.IndexOutOfBoundsException
- if the specified index is out of rangelong removeElementAt(int index)
index
- the index of the element to removeUnsupportedOperationException
- when this operation is not
supportedIndexOutOfBoundsException
- if the specified index is out of rangelong set(int index, long element)
index
- the index of the element to changeelement
- the value to be stored at the specified positionUnsupportedOperationException
- when this operation is not
supportedIndexOutOfBoundsException
- if the specified index is out of rangeLongList subList(int fromIndex, int toIndex)
LongList
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.fromIndex
- the smallest index (inclusive) in me that appears in
the returned listtoIndex
- the largest index (exclusive) in me that appears in the
returned listIndexOutOfBoundsException
- if either specified index is out of rangeCopyright © 2002-2013 The Apache Software Foundation. All Rights Reserved.