@Override public FilterResult head(Node node, int depth) { if (node instanceof Element) { Element el = (Element) node; if (eval.matches(root, el)) { match = el; return STOP; } } return CONTINUE; }
public boolean matches(Element root, Element node) { return !evaluator.matches(root, node); }
@Override public boolean matches(Element root, Element node) { for (int i = 0; i < num; i++) { Evaluator s = evaluators.get(i); if (s.matches(root, node)) return true; } return false; }
@Override public boolean matches(Element root, Element node) { for (int i = 0; i < num; i++) { Evaluator s = evaluators.get(i); if (!s.matches(root, node)) return false; } return true; }
public void head(Node node, int depth) { if (node instanceof Element) { Element el = (Element) node; if (eval.matches(root, el)) elements.add(el); } }
public boolean matches(Element root, Element element) { if (root == element) return false; Element prev = element.previousElementSibling(); return prev != null && evaluator.matches(root, prev); }
public boolean matches(Element root, Element element) { for (Element e : element.getAllElements()) { if (e != element && evaluator.matches(root, e)) return true; } return false; }
/** * Check if this element matches the given evaluator. * @param evaluator an element evaluator * @return if this element matches */ public boolean is(Evaluator evaluator) { return evaluator.matches((Element)this.root(), this); }
public boolean matches(Element root, Element element) { if (root == element) return false; Element parent = element.parent(); return parent != null && evaluator.matches(root, parent); }
public boolean matches(Element root, Element element) { if (root == element) return false; Element prev = element.previousElementSibling(); while (prev != null) { if (evaluator.matches(root, prev)) return true; prev = prev.previousElementSibling(); } return false; }
public boolean matches(Element root, Element element) { if (root == element) return false; Element parent = element.parent(); while (true) { if (evaluator.matches(root, parent)) return true; if (parent == root) break; parent = parent.parent(); } return false; }
public boolean matches(Element root, Element node) { return !evaluator.matches(root, node); }
public boolean matches(Element root, Element node) { return !evaluator.matches(root, node); }
Evaluator eval = QueryParser.parse(query); boolean result = eval.matches(element.ownerDocument(), element);
@Override public boolean matches(Element root, Element node) { for (int i = 0; i < evaluators.size(); i++) { Evaluator s = evaluators.get(i); if (s.matches(root, node)) return true; } return false; }
@Override public boolean matches(Element root, Element node) { for (int i = 0; i < evaluators.size(); i++) { Evaluator s = evaluators.get(i); if (!s.matches(root, node)) return false; } return true; }
@Override public boolean matches(Element root, Element node) { for (int i = 0; i < evaluators.size(); i++) { Evaluator s = evaluators.get(i); if (s.matches(root, node)) return true; } return false; }
@Override public boolean matches(Element root, Element node) { for (int i = 0; i < evaluators.size(); i++) { Evaluator s = evaluators.get(i); if (!s.matches(root, node)) return false; } return true; }
public boolean matches(Element root, Element element) { for (Element e : element.getAllElements()) { if (e != element && evaluator.matches(root, e)) return true; } return false; }
public boolean matches(Element root, Element element) { if (root == element) return false; Element prev = element.previousElementSibling(); return prev != null && evaluator.matches(root, prev); }