replicad-pantograph 0.11.1 → 0.11.3

package/dist/es/replicad-pantograph.js

@@ -689,10 +689,10 @@ function Pn$1(r, s, t) {
     ignoreChecks: !0
   });
 }
-const Se = 1e-21, zt$2 = 1.618034;
+const Se = 1e-21, zt$1 = 1.618034;
 function ke(r, s = 0, t = 1, e = 110, n = 1e3) {
   let i, o, l, h, a, u, c, g, d, w, p, P, f;
-  for (o = r(s), l = r(t), o < l && ([s, t] = [t, s], [o, l] = [l, o]), f = t + zt$2 * (t - s), h = r(f), a = 3, c = 0; h < l; ) {
+  for (o = r(s), l = r(t), o < l && ([s, t] = [t, s], [o, l] = [l, o]), f = t + zt$1 * (t - s), h = r(f), a = 3, c = 0; h < l; ) {
     if (g = (t - s) * (l - h), d = (t - f) * (l - o), w = d - g, Math.abs(w) < Se ? i = 2 * Se : i = 2 * w, p = t - ((t - f) * d - (t - s) * g) / i, P = t + e * (f - t), c > n)
       throw new Error("Too many iterations.");
     if (c += 1, (p - f) * (t - p) > 0) {
@@ -700,9 +700,9 @@ function ke(r, s = 0, t = 1, e = 110, n = 1e3) {
         return s = t, t = p, o = l, l = u, [s, t, f, o, l, h, a];
       if (u > l)
         return f = p, h = u, [s, t, f, o, l, h, a];
-      p = f + zt$2 * (f - t), u = r(p), a += 1;
+      p = f + zt$1 * (f - t), u = r(p), a += 1;
     } else
-      (p - P) * (P - f) >= 0 ? (p = P, u = r(p), a += 1) : (p - P) * (f - p) > 0 ? (u = r(p), a += 1, u < h && (t = f, f = p, p = f + zt$2 * (f - t), l = h, h = u, u = r(p), a += 1)) : (p = f + zt$2 * (f - t), u = r(p), a += 1);
+      (p - P) * (P - f) >= 0 ? (p = P, u = r(p), a += 1) : (p - P) * (f - p) > 0 ? (u = r(p), a += 1, u < h && (t = f, f = p, p = f + zt$1 * (f - t), l = h, h = u, u = r(p), a += 1)) : (p = f + zt$1 * (f - t), u = r(p), a += 1);
     s = t, t = f, f = p, o = l, l = h, h = u;
   }
   return [s, t, f, o, l, h, a];
@@ -4026,7 +4026,7 @@ function de$1(r, s) {
   return r.length === 2 ? [t] : [...de$1(t, s), t];
 }
 const Ae = Symbol.for("pantograph:CubicBezier");
-let Et$1 = class Et extends Ft$2 {
+let Et$2 = class Et extends Ft$2 {
   constructor(t, e, n, i) {
     super(t, e);
     q(this, "segmentType", "CUBIC_BEZIER");
@@ -4422,7 +4422,7 @@ let jt$1 = class jt extends Ft$2 {
       this.center,
       nt$2(tt$3(this.majorAxis), this.minorRadius)
     ) : e = this.reverseEllipseReferenceFrameTransform.transform(
-      gn$1(
+      gn(
         this.majorRadius,
         this.minorRadius,
         this.ellipseReferenceFrameTransform.transform(t)
@@ -4556,7 +4556,7 @@ function mn$1([r, s], [t, e], n, i, o, l, h) {
     ry: i
   };
 }
-function gn$1(r, s, t) {
+function gn(r, s, t) {
   const e = Math.abs(t[0]), n = Math.abs(t[1]);
   let i = 0.707, o = 0.707;
   const l = r, h = s;
@@ -5033,7 +5033,7 @@ function Bn$1(t) {
   );
 }
 function kn$1(t) {
-  if (Et$1.isInstance(t))
+  if (Et$2.isInstance(t))
     return vn$1(t);
   if (_t$1.isInstance(t))
     return Bn$1(t);
@@ -5047,7 +5047,7 @@ function On$1(t) {
     E(t.firstPoint, i),
     E(t.lastPoint, i)
   ];
-  return Et$1.isInstance(t) ? r.push(
+  return Et$2.isInstance(t) ? r.push(
     E(t.firstControlPoint, i),
     E(t.lastControlPoint, i)
   ) : _t$1.isInstance(t) && r.push(E(t.controlPoint, i)), new ct$2(
@@ -5087,7 +5087,7 @@ let Y$2 = class Y {
   }
 };
 function _n$1(t, n) {
-  if (Et$1.isInstance(t))
+  if (Et$2.isInstance(t))
     return new Ln$1([
       E(t.firstPoint, n),
       E(t.firstControlPoint, n),
@@ -5371,11 +5371,11 @@ function Z$1(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (at$4.isInstance(t) && (Et$1.isInstance(n) || _t$1.isInstance(n))) {
+  if (at$4.isInstance(t) && (Et$2.isInstance(n) || _t$1.isInstance(n))) {
     const s = Pt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (at$4.isInstance(n) && (Et$1.isInstance(t) || _t$1.isInstance(t))) {
+  if (at$4.isInstance(n) && (Et$2.isInstance(t) || _t$1.isInstance(t))) {
     const s = Pt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
@@ -5387,11 +5387,11 @@ function Z$1(t, n, e) {
     const s = wt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((ct$3.isInstance(t) || jt$1.isInstance(t)) && Et$1.isInstance(n)) {
+  if ((ct$3.isInstance(t) || jt$1.isInstance(t)) && Et$2.isInstance(n)) {
     const s = It(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((ct$3.isInstance(n) || jt$1.isInstance(n)) && Et$1.isInstance(t)) {
+  if ((ct$3.isInstance(n) || jt$1.isInstance(n)) && Et$2.isInstance(t)) {
     const s = It(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
@@ -5410,16 +5410,16 @@ function Z$1(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (_t$1.isInstance(t) && Et$1.isInstance(n) || _t$1.isInstance(n) && Et$1.isInstance(t)) {
+  if (_t$1.isInstance(t) && Et$2.isInstance(n) || _t$1.isInstance(n) && Et$2.isInstance(t)) {
     const s = D(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (Et$1.isInstance(t) && Et$1.isInstance(n)) {
+  if (Et$2.isInstance(t) && Et$2.isInstance(n)) {
     const s = zn$1(
       t,
       n
     );
-    return s.length ? Et$1.isInstance(s[0]) ? {
+    return s.length ? Et$2.isInstance(s[0]) ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -5431,7 +5431,7 @@ function Z$1(t, n, e) {
   }
   throw new Error("Not implemented");
 }
-function $t(t) {
+function $t$1(t) {
   const n = [];
   for (let e = 0; e < t; e++)
     for (let s = 0; s <= e; s++)
@@ -5439,7 +5439,7 @@ function $t(t) {
   return n;
 }
 function* it$1(t) {
-  for (const [n, e] of $t(t.length))
+  for (const [n, e] of $t$1(t.length))
     n !== e && (yield [t[n], t[e]]);
 }
 class Yt extends ns {
@@ -5493,7 +5493,7 @@ class Yt extends ns {
   }
 }
 function Nn(t, n = "Stroke") {
-  $t(t.length).forEach(
+  $t$1(t.length).forEach(
     ([e, s]) => {
       if (e === s) return;
       const i = t[e], r = t[s], l = Z$1(i, r), o = Math.max(i.precision, r.precision);
@@ -5613,7 +5613,7 @@ let B$3 = class B extends Yt {
     );
   }
 };
-const Vn = (t, n) => {
+const Vn$1 = (t, n) => {
   const e = me$1(n, {
     V: [1, 0],
     firstPoint: t,
@@ -5676,12 +5676,12 @@ const jn$1 = (t, n) => {
 };
 function $n$1(t, n) {
   if (at$4.isInstance(n))
-    return Vn(t, n);
+    return Vn$1(t, n);
   if (ct$3.isInstance(n))
     return jn$1(t, n);
   if (jt$1.isInstance(n))
     return Un$1(t, n);
-  if (Et$1.isInstance(n) || _t$1.isInstance(n))
+  if (Et$2.isInstance(n) || _t$1.isInstance(n))
     return Hn(t, n);
   throw new Error("Not implemented");
 }
@@ -5734,15 +5734,15 @@ function Yn$1(t) {
   if (Xt(t, "Loop"), !Y$3(t[0].firstPoint, t[t.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
-const Xn$1 = [
+const Xn = [
   at$4,
   ct$3,
   jt$1,
   _t$1,
-  Et$1
+  Et$2
 ];
 function Gn$1(t) {
-  return Xn$1.some((n) => n.isInstance(t));
+  return Xn.some((n) => n.isInstance(t));
 }
 function Qt(t) {
   if (at$4.isInstance(t))
@@ -5777,7 +5777,7 @@ function Qt(t) {
       lastPoint: t.lastPoint,
       controlPoint: t.controlPoint
     };
-  if (Et$1.isInstance(t))
+  if (Et$2.isInstance(t))
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -5806,7 +5806,7 @@ function Qn$1(t) {
     figures: t.figures.map(Wt)
   };
 }
-function Et(t) {
+function Et$1(t) {
   if (O$2.isInstance(t))
     return Qn$1(t);
   if (v$2.isInstance(t))
@@ -6136,7 +6136,7 @@ function Zn$1(t, n = []) {
     throw new Error("Holes must be inside the contour");
   for (const [e, s] of it$1(n))
     if (e.contains(s.firstPoint))
-      throw console.error(Et(e), Et(s)), new Error("Holes must not be inside other holes");
+      throw console.error(Et$1(e), Et$1(s)), new Error("Holes must not be inside other holes");
 }
 const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, te$1 = (t, n) => {
   const e = t.boundingBox, s = n.boundingBox;
@@ -6159,7 +6159,7 @@ const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, te$1 = (t, n) => {
   return t.forEach((e) => {
     n.some((s) => ne$1(e, s)) || n.push(e);
   }), n;
-}, se = (t) => {
+}, se$1 = (t) => {
   const n = t.map((i, r) => t.slice(r + 1).map((l, o) => [o + r + 1, l]).filter(([, l]) => i.boundingBox.overlaps(l.boundingBox)).map(([l]) => l)), e = [], s = Array(n.length);
   return n.forEach((i, r) => {
     let l = s[r];
@@ -6189,7 +6189,7 @@ const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, te$1 = (t, n) => {
 };
 function X$2(t) {
   const n = ee$1(t);
-  return se(n).map(Kt).flatMap(ht$2).map((s) => {
+  return se$1(n).map(Kt).flatMap(ht$2).map((s) => {
     if (s.length === 1) return new v$2(s[0].loop);
     s.sort((l, o) => l.isIn.length - o.isIn.length);
     const [i, ...r] = s.map(({ loop: l }) => l);
@@ -6407,7 +6407,11 @@ const he = (t, n, e) => {
   return Array.isArray(s) ? s : s.identical ? [] : s.firstCurveInSecond ? [] : s.secondCurveInFirst ? [t, n] : [t];
 }, dt$1 = (t, n, e) => {
   const s = (e == null ? void 0 : e.firstBoundaryInside) ?? !1, i = (e == null ? void 0 : e.secondBoundaryInside) ?? !1, r = s || i, l = (u, a, f) => u.segments.every(
-    (c) => a.contains(c.midPoint, { strokeIsInside: f })
+    (c) => a.contains(c.midPoint, {
+      strokeIsInside: f
+    }) && a.contains(c.firstPoint, {
+      strokeIsInside: f
+    })
   );
   if (r) {
     if (l(t, n, i))
@@ -6514,16 +6518,16 @@ function Q$1(t, n) {
 function lt$2(t, n) {
   return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? de(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => lt$2([e], n)) : n.flatMap((e) => lt$2(t, [e]));
 }
-const zt$1 = Symbol.for("pantograph:Diagram");
+const zt = Symbol.for("pantograph:Diagram");
 let O$2 = class O extends ns {
   constructor(e = [], { ignoreChecks: s = !1 } = {}) {
     super();
     b(this, "figures");
     b(this, "_boundingBox", null);
-    Object.defineProperty(this, zt$1, { value: !0 }), s || me(e), this.figures = e;
+    Object.defineProperty(this, zt, { value: !0 }), s || me(e), this.figures = e;
   }
   static isInstance(e) {
-    return !!e && e[zt$1] === !0;
+    return !!e && e[zt] === !0;
   }
   get isEmpty() {
     return this.figures.length === 0;
@@ -6600,7 +6604,7 @@ function _(e, t) {
     return rt$2(e, t);
   if (ct$3.isInstance(e))
     return it(e, t);
-  if (_t$1.isInstance(e) || Et$1.isInstance(e))
+  if (_t$1.isInstance(e) || Et$2.isInstance(e))
     return st$1(e, t);
   throw new Error("Not implemented");
 }
@@ -6685,7 +6689,7 @@ function st$1(e, t) {
     c,
     e.precision
   );
-  return new Et$1(
+  return new Et$2(
     a,
     c,
     g,
@@ -6913,7 +6917,7 @@ let at$2 = class at {
   }
   cubicBezierCurveTo(t, n, r) {
     return this.saveSegment(
-      new Et$1(this.pointer, t, n, r)
+      new Et$2(this.pointer, t, n, r)
     ), this.pointer = t, this;
   }
   quadraticBezierCurveTo(t, n) {
@@ -7384,7 +7388,7 @@ function r(t) {
       o(t.controlPoint),
       o(t.lastPoint)
     ].join(" ")}`;
-  if (Et$1.isInstance(t))
+  if (Et$2.isInstance(t))
     return `C ${[
       o(t.firstControlPoint),
       o(t.lastControlPoint),
@@ -7421,9 +7425,9 @@ function A(t, n, i = 1, s) {
 </svg>`;
 }
 
-var Ut = Object.defineProperty;
-var Vt = (t, n, e) => n in t ? Ut(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var I = (t, n, e) => Vt(t, typeof n != "symbol" ? n + "" : n, e);
+var $t = Object.defineProperty;
+var Ut = (t, n, e) => n in t ? $t(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
+var I = (t, n, e) => Ut(t, typeof n != "symbol" ? n + "" : n, e);
 function x(t) {
   if (v$2.isInstance(t))
     return [t];
@@ -7433,7 +7437,7 @@ function x(t) {
     return t.figures;
   throw new Error("Unknown shape");
 }
-function kt(t, n, e = 1e-9) {
+function Et(t, n, e = 1e-9) {
   let r = [];
   const s = [], i = new Array(n.segments.length).fill(0).map(() => []);
   n.segments.forEach((c, f) => {
@@ -7461,13 +7465,13 @@ function kt(t, n, e = 1e-9) {
   );
 }
 function tt(t, n, e = !1) {
-  return kt(n, t).filter((s) => {
+  return Et(n, t).filter((s) => {
     const i = s.segments[0].midPoint;
     return n.onStroke(i) ? !e : !n.contains(i);
   });
 }
 function nt(t, n, e = !1) {
-  return kt(n, t).filter((s) => {
+  return Et(n, t).filter((s) => {
     const i = s.segments[0].midPoint;
     return n.onStroke(i) ? !e : n.contains(i);
   });
@@ -7494,28 +7498,28 @@ function at(t, n, e = !1) {
     );
   }), r;
 }
-function gn(t, n) {
+function pn(t, n) {
   return new O$2(
     G$1(x(t), x(n))
   );
 }
 function z(t) {
   return t.reduce(
-    (n, e) => gn(n, e),
+    (n, e) => pn(n, e),
     new O$2()
   );
 }
-function Ft(t, n) {
+function kt(t, n) {
   return new O$2(
     Q$1(x(t), x(n))
   );
 }
-function Xn(t, n) {
+function Jn(t, n) {
   return new O$2(
     lt$2(x(t), x(n))
   );
 }
-function Jn(t, n, e = !0) {
+function Qn(t, n, e = !0) {
   if (_$1.isInstance(n))
     return tt(t, n, e);
   if (v$2.isInstance(n))
@@ -7525,7 +7529,7 @@ function Jn(t, n, e = !0) {
     r = r.flatMap((i) => ct(i, s, e));
   }), r;
 }
-function Qn(t, n, e = !1) {
+function Yn(t, n, e = !1) {
   if (_$1.isInstance(n))
     return nt(t, n, e);
   if (v$2.isInstance(n))
@@ -7545,7 +7549,7 @@ const ut = (t, n, e) => {
     return t.distanceFrom(n.lastPoint);
   throw new Error("Invalid position");
 };
-function pn(t, n) {
+function dn(t, n) {
   const e = me$1(t, n);
   if (e === "parallel")
     return Math.min(
@@ -7595,16 +7599,16 @@ function lt(t, n) {
     t.distanceFrom(n.lastPoint)
   );
 }
-const dn = (t, n) => {
+const mn = (t, n) => {
   const e = t.angleToParam(n.firstAngle);
   if (t.isValidParameter(e)) return !0;
   const r = t.angleToParam(n.lastAngle);
   return !!t.isValidParameter(r);
 };
-function mn(t, n) {
+function Pn(t, n) {
   if (jt(t, n, !0).length > 0) return 0;
   const e = J$3(t.center, n.center);
-  if (e < t.precision && dn(t, n))
+  if (e < t.precision && mn(t, n))
     return Math.abs(t.radius - n.radius);
   const r = H$1(Q$2(n.center, t.center)), s = e - Math.abs(t.radius - n.radius) < t.precision;
   let i = Ke(r);
@@ -7617,7 +7621,7 @@ function mn(t, n) {
     n.distanceFrom(t.lastPoint)
   );
 }
-function Pn(t, n, e) {
+function wn(t, n, e) {
   let r = 0, s = t.length - 1;
   for (; r <= s; ) {
     const i = Math.floor((r + s) / 2), o = e(t[i], n);
@@ -7630,18 +7634,18 @@ function Pn(t, n, e) {
   }
   return -(r + 1);
 }
-function wn(t, n, e) {
-  const r = Pn(t, n, e);
+function In(t, n, e) {
+  const r = wn(t, n, e);
   r < 0 ? t.splice(-(r + 1), 0, n) : t.splice(r, 0, n);
 }
-class In {
+class Mn {
   constructor() {
     I(this, "buckets");
     this.buckets = [];
   }
   addInterval(n) {
     const e = this.buckets[n.rectangle.diagonalBucketIndex];
-    e === void 0 ? this.buckets[n.rectangle.diagonalBucketIndex] = [n] : wn(e, n, (r, s) => r.value - s.value);
+    e === void 0 ? this.buckets[n.rectangle.diagonalBucketIndex] = [n] : In(e, n, (r, s) => r.value - s.value);
   }
   removeInterval(n) {
     const e = this.buckets[n.rectangle.diagonalBucketIndex];
@@ -7675,7 +7679,7 @@ class In {
     return n;
   }
 }
-class Mn {
+class Sn {
   constructor(n, e) {
     I(this, "diagonal");
     I(this, "diagonalBucketIndex");
@@ -7687,14 +7691,14 @@ class Mn {
     ), this.diagonalBucketIndex = n + e, this.index = `${n},${e}`;
   }
 }
-class Sn {
+class An {
   constructor(n, e = 1e-8, r = 1e3, s = 1e-6) {
     I(this, "rectangles");
     I(this, "buckets");
     I(this, "fMin");
     I(this, "argMin");
     I(this, "tol");
-    this.fcn = n, this.endTolerance = e, this.maxIterations = r, this.epsilon = s, this.fcn = n, this.epsilon = s, this.endTolerance = e, this.maxIterations = r, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new In();
+    this.fcn = n, this.endTolerance = e, this.maxIterations = r, this.epsilon = s, this.fcn = n, this.epsilon = s, this.endTolerance = e, this.maxIterations = r, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new Mn();
     const i = [0.5, 0.5], o = this.rect(0, 0), c = this.fcn(i);
     this.buckets.addInterval(new O(i, c, o)), this.fMin = c, this.argMin = i, this.tol = o.diagonal;
   }
@@ -7703,7 +7707,7 @@ class Sn {
   }
   rect(n, e) {
     const r = `${n},${e}`;
-    return this.rectangles.has(r) || this.rectangles.set(r, new Mn(n, e)), this.rectangles.get(r);
+    return this.rectangles.has(r) || this.rectangles.set(r, new Sn(n, e)), this.rectangles.get(r);
   }
   splitInterval(n) {
     let e, r, s;
@@ -7748,26 +7752,26 @@ class O {
     this.center = n, this.value = e, this.rectangle = r;
   }
 }
-function An(t, n = 1e-8, e = 1e3, r = 1e-6) {
-  return new Sn(
+function vn(t, n = 1e-8, e = 1e3, r = 1e-6) {
+  return new An(
     t,
     n,
     e,
     r
   ).run();
 }
-function vn(t, n, e = 1e-9) {
-  const r = An((s) => {
+function bn(t, n, e = 1e-9) {
+  const r = vn((s) => {
     const i = t.paramPoint(s[0]), o = n.paramPoint(s[1]);
     return Rt$1(i, o);
   }, e);
   return Math.sqrt(r.fMin);
 }
-function bn(t, n) {
-  return at$4.isInstance(t) && at$4.isInstance(n) ? pn(t, n) : at$4.isInstance(t) && ct$3.isInstance(n) ? lt(t, n) : ct$3.isInstance(t) && at$4.isInstance(n) ? lt(n, t) : ct$3.isInstance(t) && ct$3.isInstance(n) ? mn(t, n) : vn(t, n);
+function Ln(t, n) {
+  return at$4.isInstance(t) && at$4.isInstance(n) ? dn(t, n) : at$4.isInstance(t) && ct$3.isInstance(n) ? lt(t, n) : ct$3.isInstance(t) && at$4.isInstance(n) ? lt(n, t) : ct$3.isInstance(t) && ct$3.isInstance(n) ? Pn(t, n) : bn(t, n);
 }
-function xt(t) {
-  if (Et$1.isInstance(t)) {
+function Ft(t) {
+  if (Et$2.isInstance(t)) {
     const s = Q$2(t.lastPoint, t.firstPoint), i = Q$2(t.firstControlPoint, t.firstPoint), o = Q$2(t.lastControlPoint, t.firstPoint), c = dn$1(s, i), f = dn$1(s, o);
     if (c > 0 && f < 0 || c < 0 && f > 0) return !1;
   }
@@ -7776,7 +7780,7 @@ function xt(t) {
   return Math.abs(Math.acos(r)) < Math.PI / 3;
 }
 function X(t) {
-  if (xt(t)) return [t];
+  if (Ft(t)) return [t];
   const [n, e] = t.splitAtParameters([0.5]);
   return [
     ...X(n),
@@ -7784,9 +7788,9 @@ function X(t) {
   ];
 }
 function ht(t) {
-  return xt(t) ? [t] : t.splitAtParameters(t.getParametersOfExtrema()).flatMap(X);
+  return Ft(t) ? [t] : t.splitAtParameters(t.getParametersOfExtrema()).flatMap(X);
 }
-function Ln(t) {
+function En(t) {
   const n = t.deltaAngle, e = Math.ceil(Math.abs(n) / (Math.PI / 2)), r = n / e, s = 4 * Math.tan(r / 4) / 3, i = t.clockwise ? -1 : 1, o = Array.from(
     { length: e + 1 },
     (f, a) => t.firstAngle + a * r * i
@@ -7795,19 +7799,19 @@ function Ln(t) {
     const u = Math.cos(f), g = Math.sin(f), p = Math.cos(a), d = Math.sin(a), [l, M] = t.center, w = t.minorRadius, S = t.majorRadius, L = new et$3().rotate(
       t.tiltAngle,
       t.center
-    ), k = ($t) => L.transform($t), D = k([l + S * u, M + w * g]), $ = k([
+    ), k = (_t) => L.transform(_t), D = k([l + S * u, M + w * g]), $ = k([
       l + S * (u - s * g * i),
       M + w * (g + s * u * i)
-    ]), Gt = k([
+    ]), zt = k([
       l + S * (p + s * d * i),
       M + w * (d - s * p * i)
-    ]), _t = k([l + S * p, M + w * d]);
-    return new Et$1(D, _t, $, Gt);
+    ]), Gt = k([l + S * p, M + w * d]);
+    return new Et$2(D, Gt, $, zt);
   });
 }
-const et = 1e-8, yt = (t) => t.flatMap((n) => at$4.isInstance(n) ? [n] : ct$3.isInstance(n) ? [n] : jt$1.isInstance(n) ? Ln(n).flatMap(
+const et = 1e-8, xt = (t) => t.flatMap((n) => at$4.isInstance(n) ? [n] : ct$3.isInstance(n) ? [n] : jt$1.isInstance(n) ? En(n).flatMap(
   (e) => ht(e)
-) : _t$1.isInstance(n) || Et$1.isInstance(n) ? ht(n) : [new at$4(n.firstPoint, n.lastPoint)]);
+) : _t$1.isInstance(n) || Et$2.isInstance(n) ? ht(n) : [new at$4(n.firstPoint, n.lastPoint)]);
 function J(t, n, e = !0) {
   const r = t.map((a) => ({
     offset: _(a, n),
@@ -7873,7 +7877,7 @@ function J(t, n, e = !0) {
   }
   return o && c(o), s;
 }
-function Ct(t) {
+function yt(t) {
   const n = /* @__PURE__ */ new Map(), e = (r, s) => {
     const i = n.get(r) || [];
     n.set(r, [...i, ...s]);
@@ -7891,34 +7895,34 @@ function Ct(t) {
     });
   }), n;
 }
-function Dt(t, n) {
+function Ct(t, n) {
   return n.flatMap((e, r) => {
     if (!t.has(r)) return e;
     const s = t.get(r);
     return s ? e.splitAt(s) : e;
   });
 }
-function Ot(t, n, e) {
-  return t.filter((r) => !n.segments.some((i) => bn(i, r) < Math.abs(e) - et));
+function Dt(t, n, e) {
+  return t.filter((r) => !n.segments.some((i) => Ln(i, r) < Math.abs(e) - et));
 }
 function G(t, n) {
-  const e = t.clockwise ? n : -n, r = yt(t.segments), s = J(r, e);
+  const e = t.clockwise ? n : -n, r = xt(t.segments), s = J(r, e);
   if (s.length < 2) return new O$2();
-  const i = Ct(s);
+  const i = yt(s);
   if (!i.size) {
     const u = new _$1(s);
     return new O$2([new v$2(u)]);
   }
-  const o = Dt(
+  const o = Ct(
     i,
     s
-  ), c = Ot(o, t, n);
+  ), c = Dt(o, t, n);
   if (!c.length) return new O$2();
   const a = Jt(c).filter((u) => u.length > 1).filter((u) => Y$3(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new _$1(u));
   return a.length ? new O$2(a.map((u) => new v$2(u))) : new O$2();
 }
-function En(t, n, e = "round") {
-  const r = n / 2, s = yt(t.segments), i = J(s, r, !1), o = J(
+function kn(t, n, e = "round") {
+  const r = n / 2, s = xt(t.segments), i = J(s, r, !1), o = J(
     s,
     -r,
     !1
@@ -7939,43 +7943,43 @@ function En(t, n, e = "round") {
       o[o.length - 1],
       i[0]
     )
-  ], a = Ct(f);
+  ], a = yt(f);
   if (!a.size) {
     const l = new _$1(f);
     return new O$2([new v$2(l)]);
   }
-  const u = Dt(
+  const u = Ct(
     a,
     f
-  ), g = Ot(u, t, r);
+  ), g = Dt(u, t, r);
   if (!g.length) return new O$2();
   const d = Jt(g).filter((l) => l.length > 1).filter((l) => Y$3(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new _$1(l));
   return d.length ? new O$2(d.map((l) => new v$2(l))) : new O$2();
 }
-function kn(t, n) {
+function Fn(t, n) {
   const e = t.map((r) => {
     const s = z(
       r.holes.map((i) => G(i, n))
     );
-    return Ft(G(r.contour, n), s);
+    return kt(G(r.contour, n), s);
   });
   return z(e);
 }
-function Fn(t, n) {
+function xn(t, n) {
   const e = Math.abs(n / 2), r = t.map(
     (s) => z(
-      s.allLoops.map((i) => Ft(G(i, e), G(i, -e)))
+      s.allLoops.map((i) => kt(G(i, e), G(i, -e)))
     )
   );
   return z(r);
 }
-function Yn(t, n) {
-  return kn(x(t), n);
+function Zn(t, n) {
+  return Fn(x(t), n);
 }
-function Zn(t, n, { endCap: e = "round" } = {}) {
-  return B$3.isInstance(t) ? En(t, n, e) : Fn(x(t), n);
+function Wn(t, n, { endCap: e = "round" } = {}) {
+  return B$3.isInstance(t) ? kn(t, n, e) : xn(x(t), n);
 }
-class xn {
+class yn {
   constructor() {
     I(this, "filters");
     this.filters = [];
@@ -8016,7 +8020,7 @@ const V = 2 * Math.PI, gt = (t) => {
   const n = t % V, e = n < 0 ? n + V : n;
   return e < Math.PI ? e : e === Math.PI ? 0 : Math.abs(e - V);
 };
-class C extends xn {
+class C extends yn {
   clone() {
     const n = new C();
     return n.filters = [...this.filters], n;
@@ -8108,7 +8112,7 @@ class C extends xn {
     return this.shouldKeep.bind(this);
   }
 }
-function Bt(t, n, e, r = () => !0) {
+function Ot(t, n, e, r = () => !0) {
   const s = [n.segments[0]], i = (c, f) => {
     r({ firstCurve: c, secondCurve: f, point: c.lastPoint }) ? s.push(...t(c, f, e)) : s.push(c, f);
   };
@@ -8128,7 +8132,7 @@ function Bt(t, n, e, r = () => !0) {
 function R(t, n, e) {
   const r = typeof e == "function" ? e(new C()) : e, s = r && r.asFilterFun();
   if (_$1.isInstance(t) || B$3.isInstance(t))
-    return Bt(I$1, t, n, s);
+    return Ot(I$1, t, n, s);
   if (v$2.isInstance(t)) {
     const i = R(t.contour, n, r), o = t.holes.map((c) => R(c, n, r));
     return new v$2(i, o, { ignoreChecks: !0 });
@@ -8142,7 +8146,7 @@ function R(t, n, e) {
 function T(t, n, e) {
   const r = typeof e == "function" ? e(new C()) : e, s = r && r.asFilterFun();
   if (_$1.isInstance(t) || B$3.isInstance(t))
-    return Bt(I$1, t, n, s);
+    return Ot(V$1, t, n, s);
   if (v$2.isInstance(t)) {
     const i = T(t.contour, n, r), o = t.holes.map((c) => T(c, n, r));
     return new v$2(i, o, { ignoreChecks: !0 });
@@ -8153,7 +8157,7 @@ function T(t, n, e) {
   }
   throw new Error("invalid shape to chamfer");
 }
-class yn extends C {
+class Cn extends C {
   constructor(n) {
     super(), this.shape = n;
   }
@@ -8164,10 +8168,10 @@ class yn extends C {
     return T(this.shape, n, this.clone());
   }
 }
-function Wn(t) {
-  return new yn(t);
+function jn(t) {
+  return new Cn(t);
 }
-const Cn = 1 * fe$1, Dn = 24;
+const Dn = 1 * fe$1, On = 24;
 function H(t, n, e, r) {
   const s = t.gradientAt(n);
   return pn$1(s) <= r ? e : H$1(s);
@@ -8184,17 +8188,17 @@ function Q(t, n, e, r, s, i) {
 }
 function rt(t, n = {}) {
   const e = {
-    maxAngle: n.maxAngle ?? Cn,
-    maxDepth: n.maxDepth ?? Dn
+    maxAngle: n.maxAngle ?? Dn,
+    maxDepth: n.maxDepth ?? On
   }, r = Math.cos(e.maxAngle);
   return Q(t, 0, 1, e, r, 0);
 }
-function On(t, n) {
+function Bn(t, n) {
   return new O$2(
-    t.figures.map((e) => Rt(e, n))
+    t.figures.map((e) => Bt(e, n))
   );
 }
-function Rt(t, n) {
+function Bt(t, n) {
   return new v$2(
     Y(t.contour, n),
     t.holes.map((e) => Y(e, n))
@@ -8203,34 +8207,34 @@ function Rt(t, n) {
 function Y(t, n) {
   return new _$1(st(t.segments, n));
 }
-function Bn(t, n) {
+function Rn(t, n) {
   return new B$3(st(t.segments, n));
 }
 function st(t, n) {
   return t.flatMap(n);
 }
-function Rn(t, n) {
+function Tn(t, n) {
   if (O$2.isInstance(t))
-    return On(t, n);
+    return Bn(t, n);
   if (v$2.isInstance(t))
-    return Rt(t, n);
+    return Bt(t, n);
   if (_$1.isInstance(t))
     return Y(t, n);
   if (B$3.isInstance(t))
-    return Bn(t, n);
+    return Rn(t, n);
   if (Gn$1(t))
     return st([t], n);
   throw new Error("Unsupported shape type");
 }
-function Tn(t) {
+function zn(t) {
   if (t.length < 2) return [];
   const n = [];
   for (let e = 0; e < t.length - 1; e += 1)
     n.push(new at$4(t[e], t[e + 1]));
   return n;
 }
-function zn(t, n) {
-  return Tn(rt(t, n));
+function Gn(t, n) {
+  return zn(rt(t, n));
 }
 function B(t, n) {
   const e = [];
@@ -8245,21 +8249,21 @@ function B(t, n) {
     }
   }), e.length > 1 && Y$3(e[0], e[e.length - 1]) && e.pop(), e;
 }
-function Gn(t) {
+function _n(t) {
   return t.length < 3 ? !1 : t.map((e, r) => {
     const s = t[(r + 1) % t.length];
     return (s[0] - e[0]) * (s[1] + e[1]);
   }).reduce((e, r) => e + r, 0) > 0;
 }
 function K(t, n) {
-  return t.length < 3 || Gn(t) === n ? t : [...t].reverse();
+  return t.length < 3 || _n(t) === n ? t : [...t].reverse();
 }
-function jn(t, n = {}) {
-  return Rn(t, (r) => zn(r, n));
+function te(t, n = {}) {
+  return Tn(t, (r) => Gn(r, n));
 }
-function _n(t, n = {}) {
+function $n(t, n = {}) {
   if (O$2.isInstance(t))
-    return t.figures.flatMap((e) => _n(e, n));
+    return t.figures.flatMap((e) => $n(e, n));
   if (v$2.isInstance(t)) {
     const e = K(
       B(t.contour.segments, n),
@@ -8291,7 +8295,7 @@ const dt = (t) => "shape" in t ? t.shape : t, mt = (t, n) => {
   const { color: e } = t;
   return e ? `<g stroke="${e}">${n}</g>` : n;
 }, Pt = (t) => new mt$1(t.xMin, -t.yMax, t.xMax, -t.yMin);
-function te(t, {
+function ne(t, {
   margin: n = 1,
   unit: e = null,
   viewBox: r
@@ -8309,7 +8313,7 @@ function te(t, {
     e
   );
 }
-const Tt = (t) => {
+const Rt = (t) => {
   if (t.type === "LINE")
     return new at$4(t.firstPoint, t.lastPoint);
   if (t.type === "ARC")
@@ -8337,7 +8341,7 @@ const Tt = (t) => {
       t.controlPoint
     );
   if (t.type === "CUBIC_BEZIER")
-    return new Et$1(
+    return new Et$2(
       t.firstPoint,
       t.lastPoint,
       t.firstControlPoint,
@@ -8345,33 +8349,33 @@ const Tt = (t) => {
     );
   throw new Error("Unknown segment type");
 }, Z = (t) => {
-  const n = t.segments.map(Tt);
+  const n = t.segments.map(Rt);
   return new _$1(n);
-}, zt = (t) => {
+}, Tt = (t) => {
   const n = Z(t.contour), e = t.holes.map(Z);
   return new v$2(n, e);
-}, $n = (t) => {
-  const n = t.figures.map(zt);
+}, Un = (t) => {
+  const n = t.figures.map(Tt);
   return new O$2(n);
 };
-function ne(t) {
+function ee(t) {
   if (t.type === "DIAGRAM")
-    return $n(t);
+    return Un(t);
   if (t.type === "FIGURE")
-    return zt(t);
+    return Tt(t);
   if (t.type === "LOOP")
     return Z(t);
   if (t.type === "LINE" || t.type === "ARC" || t.type === "ELLIPSE_ARC" || t.type === "CUBIC_BEZIER")
-    return Tt(t);
+    return Rt(t);
   throw new Error("Unknown shape type");
 }
-const wt = Math.PI / 180, Un = 180 / Math.PI;
-function ee(t, n) {
+const wt = Math.PI / 180, Vn = 180 / Math.PI;
+function re(t, n) {
   const e = Math.cos(n * wt) * t, r = Math.sin(n * wt) * t;
   return [e, r];
 }
-function re([t, n]) {
-  const e = Math.sqrt(t * t + n * n), r = Math.atan2(n, t) * Un;
+function se([t, n]) {
+  const e = Math.sqrt(t * t + n * n), r = Math.atan2(n, t) * Vn;
   return [e, r];
 }
 
@@ -8379,27 +8383,27 @@ var pantograph = /*#__PURE__*/Object.freeze({
   __proto__: null,
   DEG2RAD: wt,
   DrawingPen: at$2,
-  RAD2DEG: Un,
-  cartesianToPolar: re,
+  RAD2DEG: Vn,
+  cartesianToPolar: se,
   chamfer: T,
-  confineStrand: Qn,
-  cut: Ft,
+  confineStrand: Yn,
+  cut: kt,
   draw: ut$1,
-  eraseStrand: Jn,
-  exportJSON: Et,
-  exportSVG: te,
+  eraseStrand: Qn,
+  exportJSON: Et$1,
+  exportSVG: ne,
   fillet: R,
-  fuse: gn,
+  fuse: pn,
   fuseAll: z,
-  importJSON: ne,
-  intersect: Xn,
-  offset: Yn,
-  outlineStroke: Zn,
-  polarToCartesian: ee,
-  selectCorners: Wn,
+  importJSON: ee,
+  intersect: Jn,
+  offset: Zn,
+  outlineStroke: Wn,
+  polarToCartesian: re,
+  selectCorners: jn,
   svgBody: pt,
-  tesselate: jn,
-  tesselatePoints: _n
+  tesselate: te,
+  tesselatePoints: $n
 });
 
 function sketchSegment(segment, plane) {
@@ -8422,7 +8426,7 @@ function sketchSegment(segment, plane) {
             plane.toWorldCoords(segment.lastPoint),
         ]);
     }
-    if (segment instanceof Et$1) {
+    if (segment instanceof Et$2) {
         return makeBezierCurve([
             plane.toWorldCoords(segment.firstPoint),
             plane.toWorldCoords(segment.firstControlPoint),
@@ -8476,7 +8480,7 @@ function sketchOnPlane(pantographObject, planeInput = "XY", origin = [0, 0, 0])
         pantographObject instanceof ct$3 ||
         pantographObject instanceof jt$1 ||
         pantographObject instanceof _t$1 ||
-        pantographObject instanceof Et$1) {
+        pantographObject instanceof Et$2) {
         return sketchFromSegments([sketchSegment(pantographObject, plane)], plane);
     }
     throw new Error(`Unsupported object type "${pantographObject.constructor.name}"`);
@@ -8533,13 +8537,13 @@ class Drawing {
         return new Drawing(this.diagram.clone());
     }
     serialize() {
-        return JSON.stringify(Et(this.diagram));
+        return JSON.stringify(Et$1(this.diagram));
     }
     get boundingBox() {
         return this.diagram.boundingBox;
     }
     get repr() {
-        return JSON.stringify(Et(this.diagram));
+        return JSON.stringify(Et$1(this.diagram));
     }
     rotate(angle, center) {
         return new Drawing(this.diagram.rotate(angle, center));
@@ -8565,17 +8569,17 @@ class Drawing {
     cut(other) {
         const base = this.diagram;
         const tool = other.diagram;
-        return new Drawing(Ft(base, tool));
+        return new Drawing(kt(base, tool));
     }
     fuse(other) {
         const base = this.diagram;
         const tool = other.diagram;
-        return new Drawing(gn(base, tool));
+        return new Drawing(pn(base, tool));
     }
     intersect(other) {
         const base = this.diagram;
         const tool = other.diagram;
-        return new Drawing(Xn(base, tool));
+        return new Drawing(Jn(base, tool));
     }
     fillet(radius, filter) {
         return new Drawing(R(this.diagram, radius, filter));
@@ -8590,7 +8594,7 @@ class Drawing {
         return sketchOnPlane(this.diagram, inputPlane, origin);
     }
     toSVG(margin) {
-        return te(this.diagram, { margin });
+        return ne(this.diagram, { margin });
     }
     toSVGViewBox(margin = 1) {
         return v(this.diagram.boundingBox, margin);
@@ -8599,7 +8603,7 @@ class Drawing {
         return svgPathsForShape(this.diagram);
     }
     offset(distance) {
-        return new Drawing(Yn(this.diagram, distance));
+        return new Drawing(Zn(this.diagram, distance));
     }
 }
 class ReDrawingPen extends at$2 {