Interface LookaheadIterator

All Superinterfaces:
All Known Implementing Classes:
AdjacentTextNodeMerger.AdjacentTextNodeMergingIterator, ArrayIterator, EmptyIterator, GroupAdjacentIterator, GroupByIterator, GroupBySingletonIterator, GroupEndingIterator, GroupStartingIterator, ItemMappingIterator, ListIterator, LookaheadIteratorImpl, ManualIterator, NodeArrayIterator, NodeListIterator, OneItemGoneIterator, RangeIterator, ReverseArrayIterator, ReverseNodeArrayIterator, ReverseRangeIterator, SingleNodeIterator, SingletonIterator, SortedGroupIterator, SortedIterator, SortedTupleIterator, SubsequenceIterator, TailIterator, UnionEnumeration, ValueTailIterator

public interface LookaheadIterator
extends SequenceIterator

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.

Field Summary
Fields inherited from interface
Method Summary
 boolean hasNext()
          Determine whether there are more items to come.
Methods inherited from interface
close, current, getAnother, getProperties, next, position

Method Detail


boolean hasNext()
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.

This method must not be called unless the result of getProperties() on the iterator includes the bit setting SequenceIterator.LOOKAHEAD

true if there are more items in the sequence

Copyright (c) 2004-2010 Saxonica Limited. All rights reserved.