code: function (node, pred) {
              pred = pred || func.ok;
  
              var siblings = [];
              if (node.previousSibling && pred(node.previousSibling)) {
                  siblings.push(node.previousSibling);
              }
              siblings.push(node);
              if (node.nextSibling && pred(node.nextSibling)) {
                  siblings.push(node.nextSibling);
              }
              return siblings;
          }
docs: returns array of closest siblings with node
  
  @param {Node} node
  @param {function} [pred] - predicate function
  @return {Node[]}