@GwtCompatible public abstract class ForwardingListIterator<E> extends ForwardingIterator<E> implements ListIterator<E>
| Modifier | Constructor and Description | 
|---|---|
| protected  | ForwardingListIterator()Constructor for use by subclasses. | 
| Modifier and Type | Method and Description | 
|---|---|
| void | add(E element)Inserts the specified element into the list (optional operation). | 
| protected abstract ListIterator<E> | delegate()Returns the backing delegate instance that methods are forwarded to. | 
| boolean | hasPrevious()Returns  trueif this list iterator has more elements when
 traversing the list in the reverse direction. | 
| int | nextIndex()Returns the index of the element that would be returned by a
 subsequent call to  ListIterator.next(). | 
| E | previous()Returns the previous element in the list and moves the cursor
 position backwards. | 
| int | previousIndex()Returns the index of the element that would be returned by a
 subsequent call to  ListIterator.previous(). | 
| void | set(E element)Replaces the last element returned by  ListIterator.next()orListIterator.previous()with the specified element (optional operation). | 
hasNext, next, removetoStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waithasNext, next, removeprotected ForwardingListIterator()
protected abstract ListIterator<E> delegate()
ForwardingObjectForwardingSet.delegate(). Concrete subclasses override this method to supply
 the instance being decorated.delegate in class ForwardingIterator<E>public void add(E element)
java.util.ListIteratorListIterator.next(), if any, and after the element
 that would be returned by ListIterator.previous(), if any.  (If the
 list contains no elements, the new element becomes the sole element
 on the list.)  The new element is inserted before the implicit
 cursor: a subsequent call to next would be unaffected, and a
 subsequent call to previous would return the new element.
 (This call increases by one the value that would be returned by a
 call to nextIndex or previousIndex.)add in interface ListIterator<E>element - the element to insertpublic boolean hasPrevious()
java.util.ListIteratortrue if this list iterator has more elements when
 traversing the list in the reverse direction.  (In other words,
 returns true if ListIterator.previous() would return an element
 rather than throwing an exception.)hasPrevious in interface ListIterator<E>true if the list iterator has more elements when
         traversing the list in the reverse directionpublic int nextIndex()
java.util.ListIteratorListIterator.next(). (Returns list size if the list
 iterator is at the end of the list.)nextIndex in interface ListIterator<E>next, or list size if the list
         iterator is at the end of the listpublic E previous()
java.util.ListIteratorListIterator.next() to go back and forth.  (Note that alternating calls
 to next and previous will return the same
 element repeatedly.)previous in interface ListIterator<E>public int previousIndex()
java.util.ListIteratorListIterator.previous(). (Returns -1 if the list
 iterator is at the beginning of the list.)previousIndex in interface ListIterator<E>previous, or -1 if the list
         iterator is at the beginning of the listpublic void set(E element)
java.util.ListIteratorListIterator.next() or
 ListIterator.previous() with the specified element (optional operation).
 This call can be made only if neither ListIterator.remove() nor ListIterator.add(E) have been called after the last call to next or
 previous.set in interface ListIterator<E>element - the element with which to replace the last element returned by
          next or previousCopyright © 2010-2014. All Rights Reserved.