protected static class RandomAccessLongList.RandomAccessLongListIterator extends Object implements LongListIterator
Modifier and Type | Method and Description |
---|---|
void |
add(long value)
Inserts the specified element into my underlying collection
(optional operation).
|
boolean |
hasNext()
Returns
true iff I have more elements
when traversed in the forward direction. |
boolean |
hasPrevious()
Returns
true iff I have more elements
when traversed in the reverse direction. |
long |
next()
Returns the next element in me when traversed in the
forward direction.
|
int |
nextIndex()
Returns the index of the element that would be returned
by a subsequent call to
LongListIterator.next() , or the number
of elements in my iteration if I have no next element. |
long |
previous()
Returns the next element in me when traversed in the
reverse direction.
|
int |
previousIndex()
Returns the index of the element that would be returned
by a subsequent call to
LongListIterator.previous() , or
-1 if I have no previous element. |
void |
remove()
Removes from my underlying collection the last
element returned by
LongListIterator.next() or LongListIterator.previous()
(optional operation). |
void |
set(long value)
Replaces in my underlying collection the last
element returned by
LongListIterator.next() or LongListIterator.previous()
with the specified value (optional operation). |
public boolean hasNext()
LongListIterator
true
iff I have more elements
when traversed in the forward direction.
(In other words, returns true
iff
a call to LongListIterator.next()
will return an element
rather than throwing an exception.hasNext
in interface LongIterator
hasNext
in interface LongListIterator
true
iff I have more elements when
traversed in the forward directionpublic boolean hasPrevious()
LongListIterator
true
iff I have more elements
when traversed in the reverse direction.
(In other words, returns true
iff
a call to LongListIterator.previous()
will return an element
rather than throwing an exception.hasPrevious
in interface LongListIterator
true
iff I have more elements when
traversed in the reverse directionpublic int nextIndex()
LongListIterator
LongListIterator.next()
, or the number
of elements in my iteration if I have no next element.nextIndex
in interface LongListIterator
public int previousIndex()
LongListIterator
LongListIterator.previous()
, or
-1
if I have no previous element.previousIndex
in interface LongListIterator
public long next()
LongListIterator
next
in interface LongIterator
next
in interface LongListIterator
public long previous()
LongListIterator
previous
in interface LongListIterator
public void add(long value)
LongListIterator
LongListIterator.next()
, if any,
and immediately after the next element that would have been
returned by LongListIterator.previous()
, if any.
The new element is inserted immediately before the implied
cursor. A subsequent call to LongListIterator.previous()
will return
the added element, a subsequent call to LongListIterator.next()
will
be unaffected. This call increases by one the value that
would be returned by a call to LongListIterator.nextIndex()
or
LongListIterator.previousIndex()
.add
in interface LongListIterator
value
- the value to be insertedpublic void remove()
LongListIterator
LongListIterator.next()
or LongListIterator.previous()
(optional operation).remove
in interface LongIterator
remove
in interface LongListIterator
public void set(long value)
LongListIterator
LongListIterator.next()
or LongListIterator.previous()
with the specified value (optional operation).set
in interface LongListIterator
value
- the value to replace the last returned element withCopyright © 2002-2013 The Apache Software Foundation. All Rights Reserved.