public static class ObjectIterators.EmptyIterator<K> extends AbstractObjectListIterator<K> implements Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific iterator.
| 修飾子 | コンストラクタと説明 |
|---|---|
protected |
EmptyIterator() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
int |
back(int n)
This method just iterates the type-specific version of
BidirectionalIterator.previous() for
at most n times, stopping if BidirectionalIterator.hasPrevious() becomes false. |
Object |
clone() |
boolean |
hasNext() |
boolean |
hasPrevious()
Returns whether there is a previous element.
|
K |
next() |
int |
nextIndex() |
K |
previous()
Returns the previous element from the collection.
|
int |
previousIndex() |
int |
skip(int n)
This method just iterates the type-specific version of
Iterator.next() for at most
n times, stopping if Iterator.hasNext() becomes false. |
add, setremoveequals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitremoveforEachRemainingpublic boolean hasNext()
public boolean hasPrevious()
BidirectionalIteratorhasPrevious インタフェース内 BidirectionalIterator<K>hasPrevious インタフェース内 ListIterator<K>ListIterator.hasPrevious()public K previous()
BidirectionalIteratorprevious インタフェース内 BidirectionalIterator<K>previous インタフェース内 ListIterator<K>ListIterator.previous()public int nextIndex()
nextIndex インタフェース内 ListIterator<K>public int previousIndex()
previousIndex インタフェース内 ListIterator<K>public int skip(int n)
AbstractObjectIteratorIterator.next() for at most
n times, stopping if Iterator.hasNext() becomes false.skip インタフェース内 ObjectIterator<K>skip クラス内 AbstractObjectIterator<K>n - the number of elements to skip.Iterator.next()public int back(int n)
AbstractObjectBidirectionalIteratorBidirectionalIterator.previous() for
at most n times, stopping if BidirectionalIterator.hasPrevious() becomes false.back インタフェース内 ObjectBidirectionalIterator<K>back クラス内 AbstractObjectBidirectionalIterator<K>n - the number of elements to skip back.Iterator.next()Copyright © 2011–2016. All rights reserved.