| 
 | Java™ Platform Standard Ed. 6 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface ListIterator<E>
An iterator for lists that allows the programmer to traverse the list in either direction, modify the list during iteration, and obtain the iterator's current position in the list. A ListIterator has no current element; its cursor position always lies between the element that would be returned by a call to previous() and the element that would be returned by a call to next(). An iterator for a list of length n has n+1 possible cursor positions, as illustrated by the carets (^) below:
                      Element(0)   Element(1)   Element(2)   ... Element(n-1)
 cursor positions:  ^            ^            ^            ^                  ^
 
 Note that the remove() and set(Object) methods are
 not defined in terms of the cursor position;  they are defined to
 operate on the last element returned by a call to next() or previous().
 This interface is a member of the Java Collections Framework.
Collection, 
List, 
Iterator, 
Enumeration, 
List.listIterator()| Method Summary | |
|---|---|
|  void | add(E e)Inserts the specified element into the list (optional operation). | 
|  boolean | hasNext()Returns true if this list iterator has more elements when traversing the list in the forward direction. | 
|  boolean | hasPrevious()Returns true if this list iterator has more elements when traversing the list in the reverse direction. | 
|  E | next()Returns the next element in the list. | 
|  int | nextIndex()Returns the index of the element that would be returned by a subsequent call to next. | 
|  E | previous()Returns the previous element in the list. | 
|  int | previousIndex()Returns the index of the element that would be returned by a subsequent call to previous. | 
|  void | remove()Removes from the list the last element that was returned by next or previous (optional operation). | 
|  void | set(E e)Replaces the last element returned by next or previous with the specified element (optional operation). | 
| Method Detail | 
|---|
boolean hasNext()
hasNext in interface Iterator<E>E next()
next in interface Iterator<E>NoSuchElementException - if the iteration has no next element.boolean hasPrevious()
E previous()
NoSuchElementException - if the iteration has no previous
            element.int nextIndex()
int previousIndex()
void remove()
remove in interface Iterator<E>UnsupportedOperationException - if the remove
            operation is not supported by this list iterator.
IllegalStateException - neither next nor
            previous have been called, or remove or
            add have been called after the last call to
            next or previous.void set(E e)
e - the element with which to replace the last element returned by
          next or previous.
UnsupportedOperationException - if the set operation
                  is not supported by this list iterator.
ClassCastException - if the class of the specified element
                  prevents it from being added to this list.
IllegalArgumentException - if some aspect of the specified
                  element prevents it from being added to this list.
IllegalStateException - if neither next nor
                  previous have been called, or remove or
                  add have been called after the last call to
                  next or previous.void add(E e)
e - the element to insert.
UnsupportedOperationException - if the add method is
                  not supported by this list iterator.
ClassCastException - if the class of the specified element
                  prevents it from being added to this list.
IllegalArgumentException - if some aspect of this element
            prevents it from being added to this list.| 
 | Java™ Platform Standard Ed. 6 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
Copyright 2006 Sun Microsystems, Inc. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.