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