gnu.javax.net.ssl.provider
Class ExtensionList.ExtensionsIterator
- ExtensionList
- Iterator<E>, ListIterator<E>
List iterator interface to an extensions list.
void | add(Extension e)
|
boolean | hasNext() - Tests whether there are elements remaining in the list in the forward
direction.
|
boolean | hasPrevious() - Tests whether there are elements remaining in the list in the reverse
direction.
|
Extension | next() - Obtain the next element in the list in the forward direction.
|
int | nextIndex() - Find the index of the element that would be returned by a call to next.
|
Extension | previous() - Obtain the next element in the list in the reverse direction.
|
int | previousIndex() - Find the index of the element that would be returned by a call to
previous.
|
void | remove() - Remove from the list the element last returned by a call to next or
previous (optional operation).
|
void | set(Extension e)
|
clone , equals , extends Object> getClass , finalize , hashCode , notify , notifyAll , toString , wait , wait , wait |
ExtensionsIterator
public ExtensionsIterator()
The basic constructor. Object is special, because it has no
superclass, so there is no call to super().
hasNext
public boolean hasNext()
Tests whether there are elements remaining in the list in the forward
direction. In other words, next() will not fail with a
NoSuchElementException.
- hasNext in interface ListIterator<E>
- hasNext in interface Iterator<E>
- true if the list continues in the forward direction
hasPrevious
public boolean hasPrevious()
Tests whether there are elements remaining in the list in the reverse
direction. In other words, previous() will not fail with a
NoSuchElementException.
- hasPrevious in interface ListIterator<E>
- true if the list continues in the reverse direction
next
public Extension next()
throws NoSuchElementException
Obtain the next element in the list in the forward direction. Repeated
calls to next may be used to iterate over the entire list, or calls to
next and previous may be used together to go forwards and backwards.
Alternating calls to next and previous will return the same element.
- next in interface ListIterator<E>
- next in interface Iterator<E>
- the next element in the list in the forward direction
nextIndex
public int nextIndex()
Find the index of the element that would be returned by a call to next.
If hasNext() returns false, this returns the list size.
- nextIndex in interface ListIterator<E>
- the index of the element that would be returned by next()
previous
public Extension previous()
throws NoSuchElementException
Obtain the next element in the list in the reverse direction. Repeated
calls to previous may be used to iterate backwards over the entire list,
or calls to next and previous may be used together to go forwards and
backwards. Alternating calls to next and previous will return the same
element.
- previous in interface ListIterator<E>
- the next element in the list in the reverse direction
previousIndex
public int previousIndex()
Find the index of the element that would be returned by a call to
previous. If hasPrevious() returns false, this returns -1.
- previousIndex in interface ListIterator<E>
- the index of the element that would be returned by previous()
remove
public void remove()
Remove from the list the element last returned by a call to next or
previous (optional operation). This method may only be called if neither
add nor remove have been called since the last call to next or previous.
- remove in interface ListIterator<E>
- remove in interface Iterator<E>