| java.lang.Object
 net.sf.saxon.tree.TreeEnumeration
All known Subclasses: net.sf.saxon.tree.FollowingEnumeration, net.sf.saxon.tree.PrecedingOrAncestorEnumeration, net.sf.saxon.tree.AncestorEnumeration, net.sf.saxon.tree.PrecedingEnumeration, net.sf.saxon.tree.ChildEnumeration, net.sf.saxon.tree.PrecedingSiblingEnumeration, net.sf.saxon.tree.FollowingSiblingEnumeration, net.sf.saxon.tree.DescendantEnumeration,
| Method Summary | |
| final protected void | advance()
| | protected boolean | conforms(NodeImpl node)
Test whether a node conforms to the node type and name constraints. | | final public Item | current()
| | public int | getProperties()
Get properties of this iterator, as a bit-significant integer.
the properties of this iterator. | | public boolean | hasNext()
Determine whether there are more items to come. | | final public Item | next()
| | final public int | position()
| | abstract protected void | step()
|
| position | | protected int position(Code) | | |
| TreeEnumeration | | public TreeEnumeration(NodeImpl origin, NodeTest nodeTest)(Code) | | Create an axis enumeration for a given type and name of node, from a given
origin node
Parameters:
origin - the node from which the axis originates
Parameters:
nodeTest - test to be satisfied by the returned nodes, or null if all nodesare to be returned. |
| advance | | final protected void advance()(Code) | | Advance along the axis until a node is found that matches the required criteria
|
| conforms | | protected boolean conforms(NodeImpl node)(Code) | | Test whether a node conforms to the node type and name constraints.
Note that this returns true if the supplied node is null, this is a way of
terminating a loop.
|
| current | | final public Item current()(Code) | | Return the current Item
|
| getProperties | | public int getProperties()(Code) | | Get properties of this iterator, as a bit-significant integer.
the properties of this iterator. This will be some combination ofproperties such as GROUNDED, LAST_POSITION_FINDER,and LOOKAHEAD. It is alwaysacceptable to return the value zero, indicating that there are no known special properties.It is acceptable for the properties of the iterator to change depending on its state. |
| 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 |
| next | | final public Item next()(Code) | | Return the next node in the enumeration
|
| position | | final public int position()(Code) | | Return the current position
|
| step | | abstract protected void step()(Code) | | Advance one step along the axis: the resulting node might not meet the required
criteria for inclusion
|
|
|