|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
The Reiterator
interface abstracts traversal over a
list of nodes where each node has an int
key and a
IntSet
value. Additionally, the "cursor" remains over
the same node until the next()
method is called. This
implies that one can access the IntSet
value or
int
key multiple times at the same node (and hence the
"re" in "re" + "iterator")
Method Summary | |
boolean |
hasNext()
Returns true if there is at least one more element in the list. |
int |
key()
Returns the key of the current element. |
void |
next()
Advances the pointer to the next element in the list. |
IntSet |
values()
Returns a set view of the current element's values. |
Method Detail |
public boolean hasNext()
public void next()
public int key()
public IntSet values()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |