?????? |
---|
NameTest(int nodeKind,
int nameCode,
NamePool namePool)
Create a NameTest to match nodes by their nameCode allocated from the NamePool
|
NameTest(int nodeKind,
java.lang.String uri,
java.lang.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
|
?????? | ????? |
---|---|
boolean |
equals(java.lang.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(NodeInfo node)
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.
|
java.lang.String |
toString() |
java.lang.String |
toString(NamePool pool)
Display the type descriptor for diagnostics
|
getAtomizedItemType, getContentType, getPrimitiveItemType, isAtomicType, isNillable, matchesItem
public NameTest(int nodeKind, java.lang.String uri, java.lang.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 NameTestpublic boolean matches(int nodeKind, int nameCode, int annotation)
public boolean matches(TinyTree tree, int nodeNr)
public boolean matches(NodeInfo node)
public final double getDefaultPriority()
getDefaultPriority
??? NodeTest
public int getFingerprint()
getFingerprint
??? NodeTest
public int getPrimitiveType()
getPrimitiveType
???? ItemType
getPrimitiveType
??? 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
???? ItemType
getSuperType
??? NodeTest
th
- the type hierarchy cachepublic int getNodeKindMask()
getNodeKindMask
??? NodeTest
public IntHashSet getRequiredNodeNames()
getRequiredNodeNames
??? NodeTest
public java.lang.String toString()
toString
??? java.lang.Object
public java.lang.String toString(NamePool pool)
NodeTest
public int hashCode()
hashCode
??? java.lang.Object
public boolean equals(java.lang.Object other)
equals
??? java.lang.Object