import I from "./_SetCache.js";
import d from "./_arrayIncludes.js";
import x from "./_cacheHas.js";
var p = Math.min;
function b(e, v, u) {
  for (var s = d, c = e[0].length, l = e.length, n = l, g = Array(l), r = 1 / 0, f = []; n--; ) {
    var t = e[n];
    r = p(t.length, r), g[n] = c >= 120 && t.length >= 120 ? new I(n && t) : void 0;
  }
  t = e[0];
  var m = -1, o = g[0];
  n:
    for (; ++m < c && f.length < r; ) {
      var i = t[m], h = i;
      if (i = i !== 0 ? i : 0, !(o ? x(o, h) : s(f, h))) {
        for (n = l; --n; ) {
          var w = g[n];
          if (!(w ? x(w, h) : s(e[n], h)))
            continue n;
        }
        o && o.push(h), f.push(i);
      }
    }
  return f;
}
export {
  b as default
};
//# sourceMappingURL=_baseIntersection.js.map
