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