How to use

selectAndAdd

method

in

jodd.lagarto.dom.NodeSelector

/**
 * Walks over the child notes, maintaining the tree order and not using recursion.
 */
protected void walkDescendantsIteratively(final LinkedList<Node> nodes, final CssSelector cssSelector, final List<Node> result) {
  while (!nodes.isEmpty()) {
    Node node = nodes.removeFirst();
    selectAndAdd(node, cssSelector, result);
    // append children in walking order to be processed right after this node
    int childCount = node.getChildNodesCount();
    for (int i = childCount - 1; i >= 0; i--) {
      nodes.addFirst(node.getChild(i));
    }
  }
}

for (int i = 0; i < childCount; i++) {
  Node node = rootNode.getChild(i);
  selectAndAdd(node, cssSelector, result);
Node node = rootNode.getNextSiblingElement();
if (node != null) {
  selectAndAdd(node, cssSelector, result);
    break;
  selectAndAdd(node, cssSelector, result);

/**
 * Walks over the child notes, maintaining the tree order and not using recursion.
 */
protected void walkDescendantsIteratively(final LinkedList<Node> nodes, final CssSelector cssSelector, final List<Node> result) {
  while (!nodes.isEmpty()) {
    Node node = nodes.removeFirst();
    selectAndAdd(node, cssSelector, result);
    // append children in walking order to be processed right after this node
    int childCount = node.getChildNodesCount();
    for (int i = childCount - 1; i >= 0; i--) {
      nodes.addFirst(node.getChild(i));
    }
  }
}

/**
 * Walks over the child notes, maintaining the tree order and not using recursion.
 */
protected void walkDescendantsIteratively(LinkedList<Node> nodes, CssSelector cssSelector, LinkedList<Node> result) {
  while (!nodes.isEmpty()) {
    Node node = nodes.removeFirst();
    selectAndAdd(node, cssSelector, result);
    // append children in walking order to be processed right after this node
    int childCount = node.getChildNodesCount();
    for (int i = childCount - 1; i >= 0; i--) {
      nodes.addFirst(node.getChild(i));
    }
  }
}

for (int i = 0; i < childCount; i++) {
  Node node = rootNode.getChild(i);
  selectAndAdd(node, cssSelector, result);
Node node = rootNode.getNextSiblingElement();
if (node != null) {
  selectAndAdd(node, cssSelector, result);
    break;
  selectAndAdd(node, cssSelector, result);

for (int i = 0; i < childCount; i++) {
  Node node = rootNode.getChild(i);
  selectAndAdd(node, cssSelector, result);
Node node = rootNode.getNextSiblingElement();
if (node != null) {
  selectAndAdd(node, cssSelector, result);
    break;
  selectAndAdd(node, cssSelector, result);

/**
 * Walks over the child notes, maintaining the tree order and not using recursion.
 */
protected void walkDescendantsIteratively(JoddArrayList<Node> nodes, CssSelector cssSelector, List<Node> result) {
  while (!nodes.isEmpty()) {
    Node node = nodes.removeFirst();
    selectAndAdd(node, cssSelector, result);
    // append children in walking order to be processed right after this node
    int childCount = node.getChildNodesCount();
    for (int i = childCount - 1; i >= 0; i--) {
      nodes.addFirst(node.getChild(i));
    }
  }
}

for (int i = 0; i < childCount; i++) {
  Node node = rootNode.getChild(i);
  selectAndAdd(node, cssSelector, result);
Node node = rootNode.getNextSiblingElement();
if (node != null) {
  selectAndAdd(node, cssSelector, result);
    break;
  selectAndAdd(node, cssSelector, result);