| Constructor and description |
|---|
ArrayIterator(T[] array)Creates an iterator that traverses the supplied array in index order. |
| Type Params | Return Type | Name and description |
|---|---|---|
|
public boolean |
hasNext()Returns true if the iteration has more elements.
(In other words, returns true if next would
return an element rather than throwing an exception.)
|
|
public T |
next()Returns the next element in the iteration.
|
|
public void |
remove()Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next. The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy. The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.
|
Creates an iterator that traverses the supplied array in index order.
array - the backing array to iterate Returns true if the iteration has more elements.
(In other words, returns true if next would
return an element rather than throwing an exception.)
true if the iteration has more elementsReturns the next element in the iteration.
Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.
The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.
The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.
remove
operation is not supported by this iteratornext method has not
yet been called, or the remove method has already
been called after the last call to the next
methodCopyright © 2003-2026 The Apache Software Foundation. All rights reserved.