|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object net.sf.saxon.pattern.NodeTest net.sf.saxon.pattern.NameTest
public class NameTest
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.
Constructor Summary | |
---|---|
NameTest(int nodeKind,
int nameCode,
NamePool namePool)
Create a NameTest to match nodes by their nameCode allocated from the NamePool |
|
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 |
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. |
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,
int nameCode,
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()
|
String |
toString(NamePool pool)
Display the type descriptor for diagnostics |
Methods inherited from class net.sf.saxon.pattern.NodeTest |
---|
getAtomizedItemType, getContentType, getPrimitiveItemType, isAtomicType, isAtomizable, isNillable, matchesItem, visitNamedSchemaComponents |
Methods inherited from class java.lang.Object |
---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
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(NodeInfo node)
node
- the node whose node kind and node name will form the basis of the NameTestMethod Detail |
---|
public boolean matches(int nodeKind, int nameCode, int annotation)
matches
in class NodeTest
nodeKind
- The type of node to be matchednameCode
- identifies the expanded name of the node to be matchedannotation
- The actual content type of the nodepublic boolean matches(TinyTree tree, int nodeNr)
matches
in class NodeTest
tree
- the TinyTree containing the nodenodeNr
- the number of the node within the TinyTree
public boolean matches(NodeInfo node)
matches
in class NodeTest
node
- the node to be matchedpublic boolean matches(StructuredQName qname)
matches
in interface QNameTest
qname
- the QName to be matched
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)
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.
getSuperType
in interface ItemType
getSuperType
in class NodeTest
th
- the type hierarchy cache
public int getNodeKindMask()
getNodeKindMask
in class NodeTest
public IntSet getRequiredNodeNames()
getRequiredNodeNames
in class NodeTest
public String toString()
toString
in class Object
public String toString(NamePool pool)
NodeTest
toString
in interface ItemType
toString
in class NodeTest
pool
- the name pool
public int hashCode()
hashCode
in class Object
public boolean equals(Object other)
equals
in class Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |