|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Classes who implement this interface can be a
current node list,
also refered to here as a
Method Summary | |
java.lang.Object |
clone()
Get a clone of this iterator. |
NodeIterator |
cloneWithReset()
Get a cloned Iterator that is reset to the start of the iteration. |
Node |
getCurrentNode()
Get the current node. |
int |
getCurrentPos()
Get the current position, which is one less than the next nextNode() call will retrieve. |
int |
getLast()
Get the index of the last node in this list. |
boolean |
isFresh()
Tells if this NodeSetDTM is "fresh", in other words, if the first nextNode() that is called will return the first node in the set. |
void |
reset()
Reset the iterator. |
void |
runTo(int index)
If an index is requested, NodeSetDTM will call this method to run the iterator to the index. |
void |
setCurrentPos(int i)
Set the current position in the node set. |
void |
setLast(int last)
Set the index of the last node in this list. |
void |
setShouldCacheNodes(boolean b)
If setShouldCacheNodes(true) is called, then nodes will be cached. |
int |
size()
Get the length of the list. |
Method Detail |
public Node getCurrentNode()
public int getCurrentPos()
public void reset()
public void setShouldCacheNodes(boolean b)
b
- true if the nodes should be cached.public void runTo(int index)
index
- The index to run to, or -1 if the iterator should be run
to the end.public void setCurrentPos(int i)
i
- Must be a valid index.public int size()
public boolean isFresh()
public NodeIterator cloneWithReset() throws java.lang.CloneNotSupportedException
public java.lang.Object clone() throws java.lang.CloneNotSupportedException
public int getLast()
public void setLast(int last)
last
- the index of the last node in this list.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |