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()
ByteListIterator
true
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 ByteIterator
hasNext
in interface ByteListIterator
true
iff I have more elements when
traversed in the forward directionpublic boolean hasPrevious()
ByteListIterator
true
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 ByteListIterator
true
iff I have more elements when
traversed in the reverse directionpublic int nextIndex()
ByteListIterator
ByteListIterator.next()
, or the number
of elements in my iteration if I have no next element.nextIndex
in interface ByteListIterator
public int previousIndex()
ByteListIterator
ByteListIterator.previous()
, or
-1
if I have no previous element.previousIndex
in interface ByteListIterator
public byte next()
ByteListIterator
next
in interface ByteIterator
next
in interface ByteListIterator
public byte previous()
ByteListIterator
previous
in interface ByteListIterator
public void add(byte value)
ByteListIterator
ByteListIterator.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 ByteListIterator
value
- the value to be insertedpublic void remove()
ByteListIterator
ByteListIterator.next()
or ByteListIterator.previous()
(optional operation).remove
in interface ByteIterator
remove
in interface ByteListIterator
public void set(byte value)
ByteListIterator
ByteListIterator.next()
or ByteListIterator.previous()
with the specified value (optional operation).set
in interface ByteListIterator
value
- the value to replace the last returned element withCopyright © 2002-2013 The Apache Software Foundation. All Rights Reserved.