| org.apache.commons.collections.primitives.LongList
All known Subclasses: org.apache.commons.collections.primitives.ArrayLongList, org.apache.commons.collections.primitives.adapters.AbstractListLongList, org.apache.commons.collections.primitives.RandomAccessLongList, org.apache.commons.collections.primitives.ArrayUnsignedIntList, org.apache.commons.collections.primitives.decorators.BaseProxyLongList,
| Method Summary | |
| boolean | add(long element)
Appends the specified element to the end of me
(optional operation). | | void | add(int index, long element)
Inserts the specified element at the specified position
(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.
The hash code of an 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
LongList.equals equals and with the
java.util.List.hashCode hashCode method of a
java.util.List List of
Long s. | | 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
LongIterator 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
LongListIterator bidirectional iterator over all my elements, in the appropriate sequence. | | LongListIterator | listIterator(int index)
Returns a
LongListIterator 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. |
| add | | boolean add(long element)(Code) | | Appends the specified element to the end of me
(optional operation). Returns 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.
Parameters:
element - the value whose presence within me is to be ensured true iff I changed as a result of this call
throws:
UnsupportedOperationException - when this operation is not supported
throws:
IllegalArgumentException - may be thrown if some aspect of the specified element prevents it from being added to me |
| add | | void add(int index, long element)(Code) | | Inserts the specified element at the specified position
(optional operation). Shifts the element currently
at that position (if any) and any subsequent elements to the
right, increasing their indices.
Parameters:
index - the index at which to insert the element
Parameters:
element - the value to insert
throws:
UnsupportedOperationException - when this operation is not supported
throws:
IllegalArgumentException - if some aspect of the specified element prevents it from being added to me
throws:
IndexOutOfBoundsException - if the specified index is out of range |
| addAll | | boolean addAll(int index, LongCollection collection)(Code) | | Inserts all of the elements in the specified collection into me,
at the specified position (optional operation). Shifts the
element currently at that position (if any) and any subsequent
elements to the right, increasing their indices. The new elements
will appear in the order that they are returned by the given
collection's
LongCollection.iterator iterator .
Parameters:
index - the index at which to insert the first element from the specified collection
Parameters:
collection - the LongCollection LongCollection of elements to add true iff I changed as a result of this call
throws:
UnsupportedOperationException - when this operation is not supported
throws:
IndexOutOfBoundsException - if the specified index is out of range |
| equals | | boolean equals(Object that)(Code) | | Returns 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
an LongList that has the same
LongList.size size as me,
and for which the elements returned by its
LongList.iterator iterator are equal (==) to
the corresponding elements within me.
(This contract ensures that this method works properly across
different implementations of the LongList interface.)
Parameters:
that - the object to compare to me true iff that is an LongListthat contains the same elements in the same order as me |
| get | | long get(int index)(Code) | | Returns the value of the element at the specified position
within me.
Parameters:
index - the index of the element to return the value of the element at the specified position
throws:
IndexOutOfBoundsException - if the specified index is out of range |
| hashCode | | int hashCode()(Code) | | Returns my hash code.
The hash code of an 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
LongList.equals equals and with the
java.util.List.hashCode hashCode method of a
java.util.List List of
Long s.
my hash code |
| indexOf | | int indexOf(long element)(Code) | | Returns the index of the first occurrence
of the specified element within me,
or -1 if I do not contain
the element.
Parameters:
element - the element to search for the smallest index of an element matching the specified value,or -1 if no such matching element can be found |
| lastIndexOf | | int lastIndexOf(long element)(Code) | | Returns the index of the last occurrence
of the specified element within me,
or -1 if I do not contain the element.
Parameters:
element - the element to search for the largest index of an element matching the specified value,or -1 if no such matching element can be found |
| removeElementAt | | long removeElementAt(int index)(Code) | | Removes the element at the specified position in
(optional operation). Any subsequent elements
are shifted to the left, subtracting one from their
indices. Returns the element that was removed.
Parameters:
index - the index of the element to remove the value of the element that was removed
throws:
UnsupportedOperationException - when this operation is not supported
throws:
IndexOutOfBoundsException - if the specified index is out of range |
| set | | long set(int index, long element)(Code) | | Replaces the element at the specified
position in me with the specified element
(optional operation).
Parameters:
index - the index of the element to change
Parameters:
element - the value to be stored at the specified position the value previously stored at the specified position
throws:
UnsupportedOperationException - when this operation is not supported
throws:
IndexOutOfBoundsException - if the specified index is out of range |
| subList | | LongList subList(int fromIndex, int toIndex)(Code) | | Returns a view of the elements within me
between the specified fromIndex, inclusive, and
toIndex, exclusive. The returned 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 ==
LongList.size() 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.
Parameters:
fromIndex - the smallest index (inclusive) in me that appears in the returned list
Parameters:
toIndex - the largest index (exclusive) in me that appears in the returned list a view of this list from fromIndex (inclusive) to toIndex (exclusive)
throws:
IndexOutOfBoundsException - if either specified index is out of range |
|
|