public class NameTest extends NodeTest implements QNameTest
Constructor and Description |
---|
NameTest(int nodeKind,
int nameCode,
NamePool namePool)
Create a NameTest to match nodes by their nameCode allocated from the NamePool
|
NameTest(int nodeKind,
NodeName name,
NamePool pool)
Create a NameTest to match nodes by name
|
NameTest(int nodeKind,
String uri,
String localName,
NamePool namePool)
Create a NameTest to match nodes by name
|
NameTest(NodeInfo node)
Create a NameTest for nodes of the same type and name as a given node
|
Modifier and Type | Method and Description |
---|---|
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
|
String |
getLocalPart()
Get the local name matched by this nametest
|
NamePool |
getNamePool()
Get the NamePool associated with this NameTest
|
String |
getNamespaceURI()
Get the namespace URI matched by this nametest
|
int |
getNodeKind()
Get the node kind that this name test matches
|
int |
getNodeKindMask()
Get a mask indicating which kinds of nodes this NodeTest can match.
|
NodeName |
getNodeName()
Get the name of the nodes that this name test matches
|
int |
getPrimitiveType()
Determine the types of nodes to which this pattern applies.
|
IntSet |
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,
NodeName name,
int annotation)
Test whether this node test is satisfied by a given node.
|
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
|
boolean |
matches(TinyTree tree,
int nodeNr)
Test whether this node test is satisfied by a given node on a TinyTree.
|
String |
toString() |
getAtomizedItemType, getContentType, getPrimitiveItemType, isAtomicType, isAtomizable, isNillable, isPlainType, matches, matchesItem, visitNamedSchemaComponents
public NameTest(int nodeKind, String uri, String localName, NamePool namePool)
nodeKind
- the kind of node, for example Type.ELEMENT
uri
- the namespace URI of the required nodes. Supply "" to match nodes that are in
no namespacelocalName
- the local name of the required nodes. Supply "" to match unnamed nodesnamePool
- the namePool holding the name codespublic NameTest(int nodeKind, int nameCode, NamePool namePool)
nodeKind
- the kind of node, for example Type.ELEMENT
nameCode
- the nameCode representing the name of the nodenamePool
- the namePool holding the name codespublic NameTest(int nodeKind, NodeName name, NamePool pool)
nodeKind
- the kind of node, for example Type.ELEMENT
name
- the name of the nodes that this NameTest will matchpool
- the namePool holding the name codespublic NameTest(NodeInfo node)
node
- the node whose node kind and node name will form the basis of the NameTestpublic NamePool getNamePool()
public int getNodeKind()
public NodeName getNodeName()
public boolean matches(int nodeKind, NodeName name, int annotation)
public boolean matches(TinyTree tree, int nodeNr)
public boolean matches(NodeInfo node)
public boolean matches(StructuredQName qname)
public final double getDefaultPriority()
getDefaultPriority
in class NodeTest
public int getFingerprint()
getFingerprint
in class NodeTest
public int getPrimitiveType()
getPrimitiveType
in interface ItemType
getPrimitiveType
in class NodeTest
public ItemType getSuperType(TypeHierarchy th)
getSuperType
in interface ItemType
getSuperType
in class NodeTest
th
- the type hierarchy cachepublic int getNodeKindMask()
getNodeKindMask
in class NodeTest
public IntSet getRequiredNodeNames()
getRequiredNodeNames
in class NodeTest
public String getNamespaceURI()
public String getLocalPart()
public int hashCode()
Copyright (c) 2004-2014 Saxonica Limited. All rights reserved.