| java.lang.Object
 net.sf.saxon.pattern.NodeTest
net.sf.saxon.pattern.NameTest
| NameTest | | public class NameTest extends NodeTest (Code) | | NodeTest is an interface that enables a test of whether a node has a particular
name and type. A NameTest matches the node kind and the namespace URI and the local
name.
author:
Michael H. Kay |
| NameTest | | public NameTest(int nodeType, int nameCode, NamePool namePool)(Code) | | |
| NameTest | | public NameTest(NodeInfo node)(Code) | | Create a NameTest for nodes of the same type and name as a given node
|
| equals | | public boolean equals(Object other)(Code) | | Determines whether two NameTests are equal
|
| getDefaultPriority | | final public double getDefaultPriority()(Code) | | Determine the default priority of this node test when used on its own as a Pattern
|
| getFingerprint | | public int getFingerprint()(Code) | | Get the fingerprint required
|
| getNodeKindMask | | public int getNodeKindMask()(Code) | | Get a mask indicating which kinds of nodes this NodeTest can match. This is a combination
of bits: 1< |
| getPrimitiveType | | public int getPrimitiveType()(Code) | | Determine the types of nodes to which this pattern applies. Used for optimisation.
For patterns that match nodes of several types, return Type.NODE
the type of node matched by this pattern. e.g. Type.ELEMENT or Type.TEXT |
| getRequiredNodeNames | | public IntHashSet getRequiredNodeNames()(Code) | | Get the set of node names allowed by this NodeTest. This is returned as a set of Integer fingerprints.
A null value indicates that all names are permitted (i.e. that there are no constraints on the node name.
The default implementation returns null.
|
| getSuperType | | public ItemType getSuperType(TypeHierarchy th)(Code) | | Get the type from which this item type is derived by restriction. This
is the supertype in the XPath type heirarchy, as distinct from the Schema
base type: this means that the supertype of xs:boolean is xdt:anyAtomicType,
whose supertype is item() (rather than xs:anySimpleType).
In fact the concept of "supertype" is not really well-defined, because the types
form a lattice rather than a hierarchy. The only real requirement on this function
is that it returns a type that strictly subsumes this type, ideally as narrowly
as possible.
the supertype, or null if this type is item()
Parameters:
th - |
| hashCode | | public int hashCode()(Code) | | Returns a hash code value for the object.
|
| matches | | public boolean matches(int nodeKind, int nameCode, int annotation)(Code) | | Test whether this node test is satisfied by a given node
Parameters:
nodeKind - The type of node to be matched
Parameters:
nameCode - identifies the expanded name of the node to be matched |
| matches | | public boolean matches(TinyTree tree, int nodeNr)(Code) | | Test whether this node test is satisfied by a given node on a TinyTree. The node
must be a document, element, text, comment, or processing instruction node.
This method is provided so that when navigating a TinyTree a node can be rejected without
actually instantiating a NodeInfo object.
Parameters:
tree - the TinyTree containing the node
Parameters:
nodeNr - the number of the node within the TinyTree true if the node matches the NodeTest, otherwise false |
| matches | | public boolean matches(NodeInfo node)(Code) | | Test whether this node test is satisfied by a given node. This alternative
method is used in the case of nodes where calculating the fingerprint is expensive,
for example DOM or JDOM nodes.
Parameters:
node - the node to be matched |
|
|