function listPrev(node, pred) {
  pred = pred || func.fail;

  const nodes = [];
  while (node) {
    if (pred(node)) { break; }
    nodes.push(node);
    node = node.previousSibling;
  }
  return nodes;
}
listing all previous siblings (until predicate hit).

@param {Node} node
@param {Function} [optional] pred - predicate function