/** * 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 */ public boolean matchesNode(NodeInfo node) { return node == origin || (node.getNodeKind() == origin.getNodeKind() && Navigator.haveSameName(node, origin)); }
/** * 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 */ public boolean matchesNode(NodeInfo node) { return node == origin || (node.getNodeKind() == origin.getNodeKind() && Navigator.haveSameName(node, origin)); }
while (true) { NodeInfo n = iter.next(); if (n == null || Navigator.haveSameName(this, n)) { index = ix; return ix; while (true) { NodeInfo n = iter.next(); if (n == null || Navigator.haveSameName(this, n)) { index = ix; return ix;
while (true) { NodeInfo n = iter.next(); if (n == null || Navigator.haveSameName(this, n)) { index = ix; return ix; while (true) { NodeInfo n = iter.next(); if (n == null || Navigator.haveSameName(this, n)) { index = ix; return ix;
public IntPredicate getMatcher(final NodeVectorTree tree) { final byte[] nodeKindArray = tree.getNodeKindArray(); final int[] nameCodeArray = tree.getNameCodeArray(); return nodeNr -> { int k = nodeKindArray[nodeNr] & 0x0f; if (k == Type.WHITESPACE_TEXT) { k = Type.TEXT; } if (k != origin.getNodeKind()) { return false; } else if (origin.hasFingerprint()) { return (nameCodeArray[nodeNr] & 0xfffff) == origin.getFingerprint(); } else { return Navigator.haveSameName(tree.getNode(nodeNr), origin); } }; }
public IntPredicate getMatcher(final NodeVectorTree tree) { final byte[] nodeKindArray = tree.getNodeKindArray(); final int[] nameCodeArray = tree.getNameCodeArray(); return nodeNr -> { int k = nodeKindArray[nodeNr] & 0x0f; if (k == Type.WHITESPACE_TEXT) { k = Type.TEXT; } if (k != origin.getNodeKind()) { return false; } else if (origin.hasFingerprint()) { return (nameCodeArray[nodeNr] & 0xfffff) == origin.getFingerprint(); } else { return Navigator.haveSameName(tree.getNode(nodeNr), origin); } }; }
if (!Navigator.haveSameName(n1, n2)) { explain(config, "element names differ: " + NameOfNode.makeName(n1).getStructuredQName().getEQName() + " != " + NameOfNode.makeName(n2).getStructuredQName().getEQName(), flags, n1, n2); if (!Navigator.haveSameName(n1, n2)) { explain(config, "attribute names differ: " + NameOfNode.makeName(n1).getStructuredQName().getEQName() +
if (!Navigator.haveSameName(n1, n2)) { explain(config, "element names differ: " + NameOfNode.makeName(n1).getStructuredQName().getEQName() + " != " + NameOfNode.makeName(n2).getStructuredQName().getEQName(), flags, n1, n2); if (!Navigator.haveSameName(n1, n2)) { explain(config, "attribute names differ: " + NameOfNode.makeName(n1).getStructuredQName().getEQName() +