public final class UnmodifiableLongListIterator extends Object
| Modifier and Type | Method and Description |
|---|---|
void |
add(long value)
Inserts the specified element into my underlying collection
(optional operation).
|
protected LongIterator |
getIterator() |
protected LongListIterator |
getListIterator() |
boolean |
hasNext()
Returns
true iff I have more elements. |
boolean |
hasPrevious()
Returns
true iff I have more elements
when traversed in the reverse direction. |
long |
next()
Returns the next element in me.
|
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). |
static LongListIterator |
wrap(LongListIterator iterator) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waithasNext, nextpublic void remove()
LongListIteratorLongListIterator.next() or LongListIterator.previous()
(optional operation).public void add(long value)
LongListIteratorLongListIterator.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().value - the value to be insertedpublic void set(long value)
LongListIteratorLongListIterator.next() or LongListIterator.previous()
with the specified value (optional operation).value - the value to replace the last returned element withprotected LongListIterator getListIterator()
public static final LongListIterator wrap(LongListIterator iterator)
public boolean hasPrevious()
LongListIteratortrue 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 LongListIteratortrue iff I have more elements when
traversed in the reverse directionpublic int nextIndex()
LongListIteratorLongListIterator.next(), or the number
of elements in my iteration if I have no next element.nextIndex in interface LongListIteratorpublic long previous()
LongListIteratorprevious in interface LongListIteratorpublic int previousIndex()
LongListIteratorLongListIterator.previous(), or
-1 if I have no previous element.previousIndex in interface LongListIteratorprotected final LongIterator getIterator()
public boolean hasNext()
LongIteratortrue iff I have more elements.
(In other words, returns true iff
a subsequent call to next will return
an element rather than throwing an exception.)hasNext in interface LongIteratortrue iff I have more elementspublic long next()
LongIteratornext in interface LongIteratorCopyright © 2002-2013 The Apache Software Foundation. All Rights Reserved.