| net.sf.saxon.om.LookaheadIterator
All known Subclasses: net.sf.saxon.tree.TreeEnumeration, net.sf.saxon.expr.UnionEnumeration, net.sf.saxon.om.SingletonIterator, net.sf.saxon.om.ListIterator, net.sf.saxon.expr.PositionIterator, net.sf.saxon.sort.GroupAdjacentIterator, net.sf.saxon.sort.GroupByIterator, net.sf.saxon.om.ReverseArrayIterator, net.sf.saxon.om.ArrayIterator, net.sf.saxon.tinytree.SiblingEnumeration, net.sf.saxon.tree.AttributeEnumeration, net.sf.saxon.om.EmptyIterator,
| LookaheadIterator | | public interface LookaheadIterator extends SequenceIterator(Code) | | A SequenceIterator is used to iterate over a sequence. A LookaheadIterator
is one that supports a hasNext() method to determine if there are more nodes
after the current node.
|
| Method Summary | |
| public boolean | hasNext()
Determine whether there are more items to come. |
| hasNext | | public boolean hasNext()(Code) | | Determine whether there are more items to come. Note that this operation
is stateless and it is not necessary (or usual) to call it before calling
next(). It is used only when there is an explicit need to tell if we
are at the last element.
true if there are more items in the sequence |
|
|