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