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