net.sf.saxon.pattern
public class NameTest extends NodeTest implements QNameTest
Constructor Summary | |
---|---|
NameTest(int nodeKind, String uri, String localName, NamePool namePool)
Create a NameTest to match nodes by name | |
NameTest(int nodeKind, int nameCode, NamePool namePool)
Create a NameTest to match nodes by their nameCode allocated from the NamePool | |
NameTest(NodeInfo node)
Create a NameTest for nodes of the same type and name as a given node |
Method Summary | |
---|---|
boolean | equals(Object other)
Determines whether two NameTests are equal |
double | getDefaultPriority()
Determine the default priority of this node test when used on its own as a Pattern |
int | getFingerprint()
Get the fingerprint required |
int | getNodeKindMask()
Get a mask indicating which kinds of nodes this NodeTest can match. |
int | getPrimitiveType()
Determine the types of nodes to which this pattern applies. |
IntHashSet | getRequiredNodeNames()
Get the set of node names allowed by this NodeTest. |
ItemType | getSuperType(TypeHierarchy th)
Get the type from which this item type is derived by restriction. |
int | hashCode()
Returns a hash code value for the object. |
boolean | matches(int nodeKind, int nameCode, int annotation)
Test whether this node test is satisfied by a given node |
boolean | matches(TinyTree tree, int nodeNr)
Test whether this node test is satisfied by a given node on a TinyTree. |
boolean | matches(NodeInfo node)
Test whether this node test is satisfied by a given node. |
boolean | matches(StructuredQName qname)
Test whether the NameTest matches a given QName |
String | toString() |
String | toString(NamePool pool) |
Parameters: nodeKind the kind of node, for example ELEMENT uri the namespace URI of the required nodes. Supply "" to match nodes that are in no namespace localName the local name of the required nodes. Supply "" to match unnamed nodes namePool the namePool holding the name codes
Since: 9.0
Parameters: nodeKind the kind of node, for example ELEMENT nameCode the nameCode representing the name of the node namePool the namePool holding the name codes
Since: 8.4
Parameters: node the node whose node kind and node name will form the basis of the NameTest
Returns: the type of node matched by this pattern. e.g. Type.ELEMENT or Type.TEXT
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.
Parameters: th the type hierarchy cache
Returns: the supertype, or null if this type is item()
Parameters: nodeKind The type of node to be matched nameCode identifies the expanded name of the node to be matched
Parameters: tree the TinyTree containing the node nodeNr the number of the node within the TinyTree
Returns: true if the node matches the NodeTest, otherwise false
Parameters: node the node to be matched
Parameters: qname the QName to be matched
Returns: true if the name matches