@Override public boolean match(final Node node) { return node.getSiblingElementIndex() == node.getParentNode().getChildElementsCount() - 1; } }
@Override public boolean match(final Node node) { return (node.getSiblingElementIndex() == 0) && (node.getParentNode().getChildElementsCount() == 1); } }
@Override public boolean match(final Node node, final PseudoFunctionExpression expression) { int value = node.getParentNode().getChildElementsCount() - node.getSiblingElementIndex(); return expression.match(value); }
@Override public boolean match(Node node) { return (node.getSiblingElementIndex() == 0) && (node.getParentNode().getChildElementsCount() == 1); } }
@Override public boolean match(Node node) { return (node.getSiblingElementIndex() == 0) && (node.getParentNode().getChildElementsCount() == 1); } }
@Override public boolean match(final Node node) { return (node.getSiblingElementIndex() == 0) && (node.getParentNode().getChildElementsCount() == 1); } }
@Override public boolean match(final Node node) { return node.getSiblingElementIndex() == node.getParentNode().getChildElementsCount() - 1; } }
@Override public boolean match(Node node) { return node.getSiblingElementIndex() == node.getParentNode().getChildElementsCount() - 1; } }
@Override public boolean match(Node node) { return node.getSiblingElementIndex() == node.getParentNode().getChildElementsCount() - 1; } }
@Override public boolean match(Node node, PseudoFunctionExpression expression) { int value = node.getParentNode().getChildElementsCount() - node.getSiblingElementIndex(); return expression.match(value); }
@Override public boolean match(final Node node, final PseudoFunctionExpression expression) { int value = node.getParentNode().getChildElementsCount() - node.getSiblingElementIndex(); return expression.match(value); }
@Override public boolean match(Node node, PseudoFunctionExpression expression) { int value = node.getParentNode().getChildElementsCount() - node.getSiblingElementIndex(); return expression.match(value); }
/** * Reduces the set of matched elements to the last in the set. */ public Jerry last() { List<Node> result = new NodeList(nodes.length); for (Node node : nodes) { int elementsLastIndex = node.getParentNode().getChildElementsCount() - 1; if (node.getSiblingElementIndex() == elementsLastIndex) { result.add(node); } } return new Jerry(this, result); }