| java.lang.Object
 net.sf.saxon.om.AxisIteratorImpl
net.sf.saxon.tinytree.SiblingEnumeration
| SiblingEnumeration | | final class SiblingEnumeration extends AxisIteratorImpl implements LookaheadIterator(Code) | | This class supports both the child:: and following-sibling:: axes, which are
identical except for the route to the first candidate node.
It enumerates either the children or the following siblings of the specified node.
In the case of children, the specified node must always
be a node that has children: to ensure this, construct the enumeration
using NodeInfo#getEnumeration()
|
| SiblingEnumeration | | SiblingEnumeration(TinyTree tree, TinyNodeImpl node, NodeTest nodeTest, boolean getChildren)(Code) | | Return an enumeration over children or siblings of the context node
Parameters:
tree - The TinyTree containing the context node
Parameters:
node - The context node, the start point for the iteration
Parameters:
nodeTest - Test that the selected nodes must satisfy, or null indicatingthat all nodes are selected
Parameters:
getChildren - True if children of the context node are to be returned, falseif following siblings are required |
| getProperties | | public int getProperties()(Code) | | |
| hasNext | | public boolean hasNext()(Code) | | Test whether there are any more nodes to come. This method is used only when testing whether the
current item is the last in the sequence. It's not especially efficient, but is more efficient than
the alternative strategy which involves counting how many nodes there are in the sequence.
true if there are more items in the sequence |
|
|