@pixerate/editor 0.73.0 → 0.75.0

package/dist/{chunk-MLREO6J3.cjs → chunk-JEYDXRWQ.cjs}

@@ -16,7 +16,7 @@
 
 
 
-var _chunkO2UH7LZEcjs = require('./chunk-O2UH7LZE.cjs');
+var _chunkXGD3FSNCcjs = require('./chunk-XGD3FSNC.cjs');
 
 // src/canvas/pathops/planar.ts
 var twin = (h) => h ^ 1;
@@ -65,11 +65,11 @@ function pinEnds(pts, a, b) {
   return out;
 }
 function interiorPoint(path) {
-  const chains = Array.isArray(path) && path.length > 0 && Array.isArray(path[0]) && Array.isArray(_optionalChain([path, 'access', _2 => _2[0], 'access', _3 => _3[0], 'optionalAccess', _4 => _4[0]])) ? path : _chunkO2UH7LZEcjs.pathToContours.call(void 0, path).map((c) => _chunkO2UH7LZEcjs.closeContour.call(void 0, c, true));
+  const chains = Array.isArray(path) && path.length > 0 && Array.isArray(path[0]) && Array.isArray(_optionalChain([path, 'access', _2 => _2[0], 'access', _3 => _3[0], 'optionalAccess', _4 => _4[0]])) ? path : _chunkXGD3FSNCcjs.pathToContours.call(void 0, path).map((c) => _chunkXGD3FSNCcjs.closeContour.call(void 0, c, true));
   const b = boundsOf(chains.flat());
   if (!(b.maxX > b.minX) || !(b.maxY > b.minY)) return null;
   const tol = Math.max(b.maxX - b.minX, b.maxY - b.minY) * 1e-3;
-  const rings = chains.filter((c) => c.length).map((c) => _chunkO2UH7LZEcjs.flattenChain.call(void 0, c, tol));
+  const rings = chains.filter((c) => c.length).map((c) => _chunkXGD3FSNCcjs.flattenChain.call(void 0, c, tol));
   let best = null;
   for (const f of [0.5, 0.25, 0.75, 0.125, 0.375, 0.625, 0.875, 0.0625, 0.9375]) {
     const y = b.minY + (b.maxY - b.minY) * (f + 61803e-7);
@@ -86,7 +86,7 @@ function interiorPoint(path) {
       const width = xs[i + 1] - xs[i];
       if (!(width > (_nullishCoalesce(_optionalChain([best, 'optionalAccess', _5 => _5.width]), () => ( 0))))) continue;
       const m = [(xs[i] + xs[i + 1]) / 2, y];
-      if (_chunkO2UH7LZEcjs.windingNumber.call(void 0, chains, m) !== 0) best = { width, p: m };
+      if (_chunkXGD3FSNCcjs.windingNumber.call(void 0, chains, m) !== 0) best = { width, p: m };
     }
   }
   return _nullishCoalesce(_optionalChain([best, 'optionalAccess', _6 => _6.p]), () => ( null));
@@ -99,7 +99,7 @@ var PlanarMap = (_class = class _PlanarMap {
     this.eps = eps;
     this.inputCount = inputCount;
     this.fills = inputs.map((input) => {
-      const chains = input.fills === false ? [] : _chunkO2UH7LZEcjs.pathToContours.call(void 0, input.path).filter((c) => c.closed).map((c) => _chunkO2UH7LZEcjs.closeContour.call(void 0, c));
+      const chains = input.fills === false ? [] : _chunkXGD3FSNCcjs.pathToContours.call(void 0, input.path).filter((c) => c.closed).map((c) => _chunkXGD3FSNCcjs.closeContour.call(void 0, c));
       return { chains, fillRule: _nullishCoalesce(input.fillRule, () => ( "nonzero")), bounds: boundsOf(chains.flat()) };
     });
     const nv = vertices.length;
@@ -110,7 +110,7 @@ var PlanarMap = (_class = class _PlanarMap {
       if (list.length === 0) return;
       const at = vertices[v];
       let r = Infinity;
-      for (const h of list) r = Math.min(r, _chunkO2UH7LZEcjs.dist.call(void 0, at, vertices[this.origin(twin(h))]));
+      for (const h of list) r = Math.min(r, _chunkXGD3FSNCcjs.dist.call(void 0, at, vertices[this.origin(twin(h))]));
       r *= 0.5;
       const keyed = list.map((h) => ({ h, angle: this.leavingAngle(h, at, r) }));
       keyed.sort((a, b) => a.angle - b.angle);
@@ -148,12 +148,12 @@ var PlanarMap = (_class = class _PlanarMap {
    * not settle) or have no edges.
    */
   static build(inputs, options = {}) {
-    const chains = inputs.map((input) => _chunkO2UH7LZEcjs.pathToContours.call(void 0, input.path).map((c) => _chunkO2UH7LZEcjs.closeContour.call(void 0, c)).filter((c) => c.length));
+    const chains = inputs.map((input) => _chunkXGD3FSNCcjs.pathToContours.call(void 0, input.path).map((c) => _chunkXGD3FSNCcjs.closeContour.call(void 0, c)).filter((c) => c.length));
     const count = chains.reduce((n, cs) => n + cs.reduce((m, c) => m + c.length, 0), 0);
     if (count === 0 || count > (_nullishCoalesce(options.maxSegments, () => ( 4096)))) return null;
     let split;
     try {
-      split = _chunkO2UH7LZEcjs.planarSplit.call(void 0, chains, options);
+      split = _chunkXGD3FSNCcjs.planarSplit.call(void 0, chains, options);
     } catch (e2) {
       return null;
     }
@@ -181,7 +181,7 @@ var PlanarMap = (_class = class _PlanarMap {
   /** Direction (angle) in which half-edge `h`, leaving `at`, first gets `r` away from it. */
   leavingAngle(h, at, r) {
     const pts = this.halfPts(h);
-    const d = (t2) => _chunkO2UH7LZEcjs.dist.call(void 0, _chunkO2UH7LZEcjs.segmentPoint.call(void 0, pts, t2), at);
+    const d = (t2) => _chunkXGD3FSNCcjs.dist.call(void 0, _chunkXGD3FSNCcjs.segmentPoint.call(void 0, pts, t2), at);
     let lo = 0;
     let hi = 1;
     const steps = pts.length === 2 ? 1 : 16;
@@ -197,9 +197,9 @@ var PlanarMap = (_class = class _PlanarMap {
       if (d(m) >= r) hi = m;
       else lo = m;
     }
-    const p = _chunkO2UH7LZEcjs.segmentPoint.call(void 0, pts, hi);
-    if (_chunkO2UH7LZEcjs.dist.call(void 0, p, at) > 0) return Math.atan2(p[1] - at[1], p[0] - at[0]);
-    const t = _chunkO2UH7LZEcjs.segmentTangent.call(void 0, pts, 0);
+    const p = _chunkXGD3FSNCcjs.segmentPoint.call(void 0, pts, hi);
+    if (_chunkXGD3FSNCcjs.dist.call(void 0, p, at) > 0) return Math.atan2(p[1] - at[1], p[0] - at[0]);
+    const t = _chunkXGD3FSNCcjs.segmentTangent.call(void 0, pts, 0);
     return Math.atan2(t[1], t[0]);
   }
   /** Segments of a run of half-edges (a loop unless `closed` is false), pieces of one input segment joined again. */
@@ -230,7 +230,7 @@ var PlanarMap = (_class = class _PlanarMap {
         const a = this.vertices[this.origin(first.h)];
         const b = this.vertices[this.origin(twin(last.h))];
         const seg = this.sources[first.src];
-        out.push(seg.length === 2 ? [a, b] : pinEnds(_chunkO2UH7LZEcjs.subSegment.call(void 0, seg, first.from, last.to), a, b));
+        out.push(seg.length === 2 ? [a, b] : pinEnds(_chunkXGD3FSNCcjs.subSegment.call(void 0, seg, first.from, last.to), a, b));
       }
       i = j;
     }
@@ -255,9 +255,9 @@ var PlanarMap = (_class = class _PlanarMap {
       const cycle = withoutSpurs(walk);
       if (!cycle.length) continue;
       const segments = this.cycleSegments(cycle);
-      const area = _chunkO2UH7LZEcjs.contourSignedArea.call(void 0, segments);
+      const area = _chunkXGD3FSNCcjs.contourSignedArea.call(void 0, segments);
       let perimeter = 0;
-      for (const s of segments) perimeter += s.length === 2 ? _chunkO2UH7LZEcjs.dist.call(void 0, s[0], s[1]) : _chunkO2UH7LZEcjs.segmentLength.call(void 0, s, 0, 1, 1e-6);
+      for (const s of segments) perimeter += s.length === 2 ? _chunkXGD3FSNCcjs.dist.call(void 0, s[0], s[1]) : _chunkXGD3FSNCcjs.segmentLength.call(void 0, s, 0, 1, 1e-6);
       if (!(perimeter > 0)) continue;
       const entry = { halves: cycle, segments, area, bounds: boundsOf(segments) };
       if (area > 0 && 2 * area / perimeter >= sliver) faces.push(entry);
@@ -272,7 +272,7 @@ var PlanarMap = (_class = class _PlanarMap {
       faces.forEach((face, i) => {
         if (this.component[this.origin(face.halves[0])] === own || !inBounds(face.bounds, p)) return;
         if (best >= 0 && faces[best].area <= face.area) return;
-        if (_chunkO2UH7LZEcjs.windingNumber.call(void 0, [face.segments], p) !== 0) best = i;
+        if (_chunkXGD3FSNCcjs.windingNumber.call(void 0, [face.segments], p) !== 0) best = i;
       });
       if (best >= 0) faceHoles[best].push(k);
     });
@@ -295,7 +295,7 @@ var PlanarMap = (_class = class _PlanarMap {
     return faces.map((f, i) => {
       const chains = this.faceChains(i);
       const area = f.area + faceHoles[i].reduce((sum, k) => sum + holes[k].area, 0);
-      return { path: _chunkO2UH7LZEcjs.contoursToPath.call(void 0, chains.map((segments) => ({ segments, closed: true }))), area, bounds: f.bounds };
+      return { path: _chunkXGD3FSNCcjs.contoursToPath.call(void 0, chains.map((segments) => ({ segments, closed: true }))), area, bounds: f.bounds };
     });
   }
   /** The inputs whose fill covers face `i`, ascending (empty for an area only outlines enclose). */
@@ -308,7 +308,7 @@ var PlanarMap = (_class = class _PlanarMap {
     if (p) {
       this.fills.forEach((fill, k) => {
         if (!fill.chains.length || !inBounds(fill.bounds, p)) return;
-        const w = _chunkO2UH7LZEcjs.windingNumber.call(void 0, fill.chains, p);
+        const w = _chunkXGD3FSNCcjs.windingNumber.call(void 0, fill.chains, p);
         if (fill.fillRule === "evenodd" ? (w & 1) === 1 : w !== 0) out.push(k);
       });
     }
@@ -325,7 +325,7 @@ var PlanarMap = (_class = class _PlanarMap {
     let best = -1;
     faces.forEach((face, i) => {
       if (!inBounds(face.bounds, p) || best >= 0 && faces[best].area <= face.area) return;
-      if (_chunkO2UH7LZEcjs.windingNumber.call(void 0, this.faceChains(i), p) !== 0) best = i;
+      if (_chunkXGD3FSNCcjs.windingNumber.call(void 0, this.faceChains(i), p) !== 0) best = i;
     });
     return best;
   }
@@ -370,7 +370,7 @@ var PlanarMap = (_class = class _PlanarMap {
       if (!ok || h !== start) continue;
       contours.push({ segments: this.cycleSegments(cycle), closed: true });
     }
-    return _chunkO2UH7LZEcjs.contoursToPath.call(void 0, contours);
+    return _chunkXGD3FSNCcjs.contoursToPath.call(void 0, contours);
   }
   /**
    * The edges joined into runs between junctions: vertices where other than two edges meet, or
@@ -429,8 +429,8 @@ var PlanarMap = (_class = class _PlanarMap {
       const ay = this.vertices[e.a][1];
       const by = this.vertices[e.b][1];
       if (ay > p[1] === by > p[1]) return;
-      const t = _chunkO2UH7LZEcjs.solveMonotone.call(void 0, e.pts, 1, p[1]);
-      const x = _chunkO2UH7LZEcjs.segmentPoint.call(void 0, e.pts, t)[0];
+      const t = _chunkXGD3FSNCcjs.solveMonotone.call(void 0, e.pts, 1, p[1]);
+      const x = _chunkXGD3FSNCcjs.segmentPoint.call(void 0, e.pts, t)[0];
       if (x > p[0]) hits.push({ x, e: i });
     });
     hits.sort((a, b) => a.x - b.x);
@@ -450,12 +450,12 @@ var PlanarMap = (_class = class _PlanarMap {
       const cycle = withoutSpurs(walk);
       if (!cycle.length) continue;
       const segments = this.cycleSegments(cycle);
-      if (!(_chunkO2UH7LZEcjs.contourSignedArea.call(void 0, segments) > 0) || _chunkO2UH7LZEcjs.windingNumber.call(void 0, [segments], p) === 0) continue;
+      if (!(_chunkXGD3FSNCcjs.contourSignedArea.call(void 0, segments) > 0) || _chunkXGD3FSNCcjs.windingNumber.call(void 0, [segments], p) === 0) continue;
       const face = faceOf[cycle[0]];
       if (face >= 0 && faces[face].halves.includes(cycle[0])) {
-        return _chunkO2UH7LZEcjs.contoursToPath.call(void 0, this.faceChains(face).map((s) => ({ segments: s, closed: true })));
+        return _chunkXGD3FSNCcjs.contoursToPath.call(void 0, this.faceChains(face).map((s) => ({ segments: s, closed: true })));
       }
-      return _chunkO2UH7LZEcjs.contoursToPath.call(void 0, [{ segments, closed: true }]);
+      return _chunkXGD3FSNCcjs.contoursToPath.call(void 0, [{ segments, closed: true }]);
     }
     return null;
   }
@@ -483,7 +483,7 @@ function closeGaps(vertices, edges, gap) {
       const pv = vertices[v];
       if (pv[0] > pu[0] + gap) break;
       if (v === u || joined.has(v) || linked.has(`${Math.min(u, v)},${Math.max(u, v)}`)) continue;
-      const d = _chunkO2UH7LZEcjs.dist.call(void 0, pu, pv);
+      const d = _chunkXGD3FSNCcjs.dist.call(void 0, pu, pv);
       if (d <= gap && d < bestD) {
         best = v;
         bestD = d;
@@ -498,17 +498,17 @@ function closeGaps(vertices, edges, gap) {
   }
 }
 function contourEnclosesArea(contour) {
-  const segs = _chunkO2UH7LZEcjs.closeContour.call(void 0, contour, true);
+  const segs = _chunkXGD3FSNCcjs.closeContour.call(void 0, contour, true);
   if (!segs.length) return false;
   const b = boundsOf(segs);
   const w = b.maxX - b.minX;
   const h = b.maxY - b.minY;
-  return Math.abs(_chunkO2UH7LZEcjs.contourSignedArea.call(void 0, segs)) > 1e-9 * (w * w + h * h);
+  return Math.abs(_chunkXGD3FSNCcjs.contourSignedArea.call(void 0, segs)) > 1e-9 * (w * w + h * h);
 }
 function nearestU(segs, p) {
   let best = null;
   segs.forEach((seg, k) => {
-    const n = _chunkO2UH7LZEcjs.segmentNearest.call(void 0, seg, p);
+    const n = _chunkXGD3FSNCcjs.segmentNearest.call(void 0, seg, p);
     if (!best || n.distance < best.d) best = { u: k + n.t, d: n.distance };
   });
   return best;
@@ -522,7 +522,7 @@ function span(segs, u0, u1) {
   for (let k = first; k < last; k++) {
     const t0 = Math.min(1, Math.max(0, u0 - k));
     const t1 = Math.min(1, Math.max(0, u1 - k));
-    if (t1 - t0 > 1e-12) out.push(_chunkO2UH7LZEcjs.subSegment.call(void 0, segs[k % n], t0, t1));
+    if (t1 - t0 > 1e-12) out.push(_chunkXGD3FSNCcjs.subSegment.call(void 0, segs[k % n], t0, t1));
   }
   return out;
 }
@@ -530,7 +530,7 @@ function snapEnds(segs, to, tol) {
   if (!segs.length) return segs;
   const out = segs.map((s) => [...s]);
   const move = (seg, end, handle) => {
-    const q = to.find((t) => _chunkO2UH7LZEcjs.dist.call(void 0, t, seg[end]) <= tol);
+    const q = to.find((t) => _chunkXGD3FSNCcjs.dist.call(void 0, t, seg[end]) <= tol);
     if (!q) return;
     const d = [q[0] - seg[end][0], q[1] - seg[end][1]];
     seg[end] = q;
@@ -548,31 +548,31 @@ function cutOutPiece(path, piece, fillCloses, tol) {
   let longest = -1;
   let perimeter = 0;
   for (const seg of segs) {
-    const len2 = _chunkO2UH7LZEcjs.segmentLength.call(void 0, seg);
+    const len2 = _chunkXGD3FSNCcjs.segmentLength.call(void 0, seg);
     perimeter += len2;
     if (len2 > longest) {
       longest = len2;
-      mid = _chunkO2UH7LZEcjs.segmentPoint.call(void 0, seg, 0.5);
+      mid = _chunkXGD3FSNCcjs.segmentPoint.call(void 0, seg, 0.5);
     }
   }
   if (!mid || perimeter <= tol) return null;
   const a = segs[0][0];
   const lastSeg = segs[segs.length - 1];
   const b = lastSeg[lastSeg.length - 1];
-  const whole = !!piece.closed || _chunkO2UH7LZEcjs.dist.call(void 0, a, b) <= tol;
-  const contours = _chunkO2UH7LZEcjs.pathToContours.call(void 0, path);
+  const whole = !!piece.closed || _chunkXGD3FSNCcjs.dist.call(void 0, a, b) <= tol;
+  const contours = _chunkXGD3FSNCcjs.pathToContours.call(void 0, path);
   let found = null;
   contours.forEach((c, index2) => {
     if (!c.segments.length) return;
     const closed2 = c.closed || fillCloses && contourEnclosesArea(c);
-    const ring2 = _chunkO2UH7LZEcjs.closeContour.call(void 0, c, closed2);
+    const ring2 = _chunkXGD3FSNCcjs.closeContour.call(void 0, c, closed2);
     const n = nearestU(ring2, mid);
     if (n && n.d <= tol && (!found || n.d < found.d)) found = { index: index2, ring: ring2, closed: closed2, um: n.u, d: n.d };
   });
   if (!found) return null;
   const { index, ring, closed, um } = found;
   const len = ring.length;
-  const real = _chunkO2UH7LZEcjs.closeContour.call(void 0, contours[index]).length;
+  const real = _chunkXGD3FSNCcjs.closeContour.call(void 0, contours[index]).length;
   const at = (p) => {
     const n = nearestU(ring, p);
     return n && n.d <= tol ? n.u : null;
@@ -603,21 +603,21 @@ function cutOutPiece(path, piece, fillCloses, tol) {
     if (run.length) out.push({ segments: snapEnds(run, [a, b], tol), closed: false });
   }
   out.push(...contours.slice(index + 1));
-  return _chunkO2UH7LZEcjs.contoursToPath.call(void 0, out);
+  return _chunkXGD3FSNCcjs.contoursToPath.call(void 0, out);
 }
 
 // src/canvas/pathops/hatch.ts
 function hatchPath(path, options = {}) {
   const out = [];
-  const b = _chunkO2UH7LZEcjs.bezierPathBounds.call(void 0, path);
+  const b = _chunkXGD3FSNCcjs.bezierPathBounds.call(void 0, path);
   if (!b || b.maxX - b.minX <= 0 || b.maxY - b.minY <= 0) return out;
   const want = Math.max(_nullishCoalesce(options.gap, () => ( 4)), 1e-3);
   const s = Math.SQRT1_2;
   const rot = (p) => [(p[0] + p[1]) * s, (p[1] - p[0]) * s];
   const unrot = (x, y) => ({ x: (x - y) * s, y: (x + y) * s });
   const edges = [];
-  for (const contour of _chunkO2UH7LZEcjs.pathToContours.call(void 0, path)) {
-    const pts = _chunkO2UH7LZEcjs.flattenChain.call(void 0, _chunkO2UH7LZEcjs.closeContour.call(void 0, contour, true), want * 0.1).map(rot);
+  for (const contour of _chunkXGD3FSNCcjs.pathToContours.call(void 0, path)) {
+    const pts = _chunkXGD3FSNCcjs.flattenChain.call(void 0, _chunkXGD3FSNCcjs.closeContour.call(void 0, contour, true), want * 0.1).map(rot);
     for (let i = 0; i < pts.length; i++) {
       const p = pts[i];
       const q = pts[(i + 1) % pts.length];
@@ -658,7 +658,7 @@ function pathfinder(op, shapes, options = {}) {
       options
     );
     if (!map) return { pieces: [], engine: "curve", error: "could not map the outlines" };
-    const pieces = map.chains().map((c) => ({ path: _chunkO2UH7LZEcjs.contoursToPath.call(void 0, [{ segments: c.segments, closed: c.closed }]), source: c.source, open: !c.closed }));
+    const pieces = map.chains().map((c) => ({ path: _chunkXGD3FSNCcjs.contoursToPath.call(void 0, [{ segments: c.segments, closed: c.closed }]), source: c.source, open: !c.closed }));
     return { pieces, engine: "curve" };
   }
   if (op === "divide") {
@@ -672,7 +672,7 @@ function pathfinder(op, shapes, options = {}) {
       });
       return { pieces, engine: "curve" };
     }
-    const result = _chunkO2UH7LZEcjs.dividePaths.call(void 0, operands, options);
+    const result = _chunkXGD3FSNCcjs.dividePaths.call(void 0, operands, options);
     return { ...report(result), pieces: result.pieces.map((p) => ({ path: p.path, source: top(p.operands) })) };
   }
   const index = shapes.flatMap((s, i) => s.line ? [] : [i]);
@@ -680,7 +680,7 @@ function pathfinder(op, shapes, options = {}) {
   if (m === 0) return { pieces: [], engine: "curve" };
   const ops = index.map((i) => operands[i]);
   const key = (k) => _nullishCoalesce(shapes[index[k]].key, () => ( index[k]));
-  const select = (selectors) => _chunkO2UH7LZEcjs.pathBooleanSelect.call(void 0, ops, selectors, options);
+  const select = (selectors) => _chunkXGD3FSNCcjs.pathBooleanSelect.call(void 0, ops, selectors, options);
   const joined = (parts) => parts.flat();
   switch (op) {
     case "trim": {
@@ -722,7 +722,7 @@ function report(r) {
   return { engine: r.engine, ...r.fallbackReason ? { fallbackReason: r.fallbackReason } : {}, ...r.error ? { error: r.error } : {} };
 }
 function closeAll(path) {
-  return _chunkO2UH7LZEcjs.contoursToPath.call(void 0, _chunkO2UH7LZEcjs.pathToContours.call(void 0, path).map((c) => ({ segments: c.segments, closed: true })));
+  return _chunkXGD3FSNCcjs.contoursToPath.call(void 0, _chunkXGD3FSNCcjs.pathToContours.call(void 0, path).map((c) => ({ segments: c.segments, closed: true })));
 }
 
 
@@ -734,4 +734,4 @@ function closeAll(path) {
 
 
 exports.interiorPoint = interiorPoint; exports.PlanarMap = PlanarMap; exports.contourEnclosesArea = contourEnclosesArea; exports.cutOutPiece = cutOutPiece; exports.hatchPath = hatchPath; exports.PATHFINDER_OPERATIONS = PATHFINDER_OPERATIONS; exports.pathfinder = pathfinder;
-//# sourceMappingURL=chunk-MLREO6J3.cjs.map
+//# sourceMappingURL=chunk-JEYDXRWQ.cjs.map