@pixerate/editor 0.33.0 → 0.34.0

package/dist/{chunk-GQTXV2EQ.js → chunk-RK6HUKDI.js}

@@ -2651,6 +2651,24 @@ function intersectSubdivided(P, p0, p1, Q, q0, q1, fullP, fullQ, ctx, out, depth
     intersectSubdivided(P, p0, p1, qb, qm, q1, fullP, fullQ, ctx, out, depth + 1);
   }
 }
+function segmentIntersections(a, b, options = {}) {
+  let size = 1;
+  for (const [x, y] of [...a, ...b]) size = Math.max(size, Math.abs(x), Math.abs(y));
+  const eps = options.epsilon ?? size * 1e-9;
+  const found = [];
+  const ctx = { eps, leaves: 0, budget: options.budget ?? 4096 };
+  try {
+    intersectSubdivided(a.slice(), 0, 1, b.slice(), 0, 1, a, b, ctx, found, 0);
+  } catch (error) {
+    if (!(error instanceof PathOpsError)) throw error;
+  }
+  const out = [];
+  for (const ev of found.sort((x, y) => x.tp - y.tp)) {
+    if (out.some((o) => dist2(o.point, ev.point) <= eps * 4)) continue;
+    out.push({ ta: ev.tp, tb: ev.tq, point: ev.point });
+  }
+  return out;
+}
 function nearestOn(piece, p, eps) {
   if (p[0] < piece.minX - eps || p[0] > piece.maxX + eps || p[1] < piece.minY - eps || p[1] > piece.maxY + eps) return null;
   return segmentNearest(piece.pts, p);
@@ -3321,6 +3339,7 @@ export {
   distanceToBezierPath,
   flattenChain,
   PathOpsError,
+  segmentIntersections,
   pathBoolean,
   unitePaths,
   intersectPaths,
@@ -3332,4 +3351,4 @@ export {
   pathBooleanRings,
   nestedRingsToPath
 };
-//# sourceMappingURL=chunk-GQTXV2EQ.js.map
+//# sourceMappingURL=chunk-RK6HUKDI.js.map