net.sf.saxon.pattern.MultipleNodeKindTest Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of Saxon-HE Show documentation
Show all versions of Saxon-HE Show documentation
The XSLT and XQuery Processor
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2013-2022 Saxonica Limited
// This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0.
// If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
// This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0.
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
package net.sf.saxon.pattern;
import net.sf.saxon.om.NodeInfo;
import net.sf.saxon.om.NodeName;
import net.sf.saxon.tree.tiny.NodeVectorTree;
import net.sf.saxon.type.*;
import net.sf.saxon.z.IntPredicateLambda;
import net.sf.saxon.z.IntPredicateProxy;
import java.util.LinkedList;
import java.util.function.Function;
/**
* An MultipleNodeKindTest is a nodetest that matches nodes belonging to any subset of possible
* node kinds, for example element and document nodes, or attribute and namespace nodes
*/
public final class MultipleNodeKindTest extends NodeTest {
public final static MultipleNodeKindTest PARENT_NODE =
new MultipleNodeKindTest(UType.DOCUMENT.union(UType.ELEMENT));
public final static MultipleNodeKindTest DOC_ELEM_ATTR =
new MultipleNodeKindTest(UType.DOCUMENT.union(UType.ELEMENT).union(UType.ATTRIBUTE));
public final static MultipleNodeKindTest LEAF =
new MultipleNodeKindTest(UType.TEXT.union(UType.COMMENT).union(UType.PI).union(UType.NAMESPACE).union(UType.ATTRIBUTE));
public final static MultipleNodeKindTest CHILD_NODE =
new MultipleNodeKindTest(UType.ELEMENT.union(UType.TEXT).union(UType.COMMENT).union(UType.PI));
UType uType;
int nodeKindMask;
public MultipleNodeKindTest(UType u) {
this.uType = u;
if (UType.DOCUMENT.overlaps(u)) {
nodeKindMask |= 1 << Type.DOCUMENT;
}
if (UType.ELEMENT.overlaps(u)) {
nodeKindMask |= 1 << Type.ELEMENT;
}
if (UType.ATTRIBUTE.overlaps(u)) {
nodeKindMask |= 1 << Type.ATTRIBUTE;
}
if (UType.TEXT.overlaps(u)) {
nodeKindMask |= 1 << Type.TEXT;
}
if (UType.COMMENT.overlaps(u)) {
nodeKindMask |= 1 << Type.COMMENT;
}
if (UType.PI.overlaps(u)) {
nodeKindMask |= 1 << Type.PROCESSING_INSTRUCTION;
}
if (UType.NAMESPACE.overlaps(u)) {
nodeKindMask |= 1 << Type.NAMESPACE;
}
}
/**
* Get the corresponding {@link net.sf.saxon.type.UType}. A UType is a union of primitive item
* types.
*
* @return the smallest UType that subsumes this item type
*/
@Override
public UType getUType() {
return uType;
}
/**
* Test whether this node test is satisfied by a given node. This method is only
* fully supported for a subset of NodeTests, because it doesn't provide all the information
* needed to evaluate all node tests. In particular (a) it can't be used to evaluate a node
* test of the form element(N,T) or schema-element(E) where it is necessary to know whether the
* node is nilled, and (b) it can't be used to evaluate a node test of the form
* document-node(element(X)). This in practice means that it is used (a) to evaluate the
* simple node tests found in the XPath 1.0 subset used in XML Schema, and (b) to evaluate
* node tests where the node kind is known to be an attribute.
*
* @param nodeKind The kind of node to be matched
* @param name identifies the expanded name of the node to be matched.
* The value should be null for a node with no name.
* @param annotation The actual content type of the node
*/
@Override
public boolean matches(int nodeKind, NodeName name, SchemaType annotation) {
return (nodeKindMask & (1< {
int nodeKind = nodeKindArray[nodeNr] & 0x0f;
if (nodeKind == Type.WHITESPACE_TEXT) {
nodeKind = Type.TEXT;
}
return (nodeKindMask & (1 << nodeKind)) != 0;
});
}
/**
* 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.
*
* @param node the node to be matched
*/
@Override
public boolean test(NodeInfo node) {
int nodeKind = node.getNodeKind();
return (nodeKindMask & (1< types = new LinkedList<>(uType.decompose());
format(types, fsb, ItemType::toString);
return fsb.toString();
}
/*@NotNull*/
public String toShortString() {
if (nodeKindMask == CHILD_NODE.nodeKindMask) {
return "node()";
}
StringBuilder fsb = new StringBuilder(64);
LinkedList types = new LinkedList<>(uType.decompose());
format(types, fsb, it -> ((NodeKindTest)it).toShortString());
return fsb.toString();
}
@Override
public String toExportString() {
StringBuilder fsb = new StringBuilder(64);
LinkedList types = new LinkedList<>(uType.decompose());
format(types, fsb, ItemType::toExportString);
return fsb.toString();
}
private void format(LinkedList list, StringBuilder fsb, Function show) {
if (list.size() == 1) {
fsb.append(show.apply(list.getFirst().toItemType()));
} else {
boolean first = true;
for (PrimitiveUType pu : list) {
fsb.append(first ? '(' : '|');
first = false;
fsb.append(show.apply(pu.toItemType()));
}
fsb.append(')');
}
}
/**
* Returns a hash code value for the object.
*/
public int hashCode() {
return uType.hashCode();
}
@Override
public boolean equals(Object obj) {
return obj instanceof MultipleNodeKindTest && uType.equals(((MultipleNodeKindTest)obj).uType);
}
}