@equinor/esv-intersection 3.0.6 → 3.0.7

package/dist/index.mjs

@@ -5049,27 +5049,31 @@ class q0 extends Ct {
   }
 }
 function Or(e, t) {
-  let n = 0, i = e.length - 1;
-  const r = 20;
-  let s = e[n][0], o = e[i][0];
-  for (; i - n > r; ) {
-    const c = Math.floor((i + n) / 2), h = e[c][0];
-    if (t >= s && t < h)
-      i = c, o = e[i][0];
-    else if (t >= h && t <= o)
-      n = c, s = e[n][0];
-    else if (t <= s && t > h)
-      i = c, o = e[i][0];
-    else if (t <= h && t >= o)
-      n = c, s = e[n][0];
+  var c, h, l, u, f, p, d, g, y;
+  if (e.length < 2)
+    return -1;
+  const n = 20;
+  let i = 0, r = e.length - 1, s = (c = e[i]) == null ? void 0 : c[0], o = (h = e[r]) == null ? void 0 : h[0];
+  for (; r - i > n; ) {
+    const _ = Math.floor((r + i) / 2), x = (l = e[_]) == null ? void 0 : l[0];
+    if (s == null || o == null || x == null)
+      return -1;
+    if (t >= s && t < x)
+      r = _, o = (u = e[r]) == null ? void 0 : u[0];
+    else if (t >= x && t <= o)
+      i = _, s = (f = e[i]) == null ? void 0 : f[0];
+    else if (t <= s && t > x)
+      r = _, o = (p = e[r]) == null ? void 0 : p[0];
+    else if (t <= x && t >= o)
+      i = _, s = (d = e[i]) == null ? void 0 : d[0];
     else
       return -1;
   }
   let a = -1;
-  for (let c = n; c < i; c++) {
-    const h = e[c][0], l = e[c + 1][0];
-    if (Math.min(h, l) <= t && t <= Math.max(h, l)) {
-      a = c;
+  for (let _ = i; _ < r; _++) {
+    const x = (g = e[_]) == null ? void 0 : g[0], v = (y = e[_ + 1]) == null ? void 0 : y[0];
+    if (x != null && v != null && Math.min(x, v) <= t && t <= Math.max(x, v)) {
+      a = _;
       break;
     }
   }