replicad-pantograph 0.9.0 → 0.9.1

package/dist/es/replicad-pantograph.js

@@ -6,7 +6,7 @@ var Me = (r) => {
 };
 var Be = (r, s, t) => s in r ? Oe(r, s, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[s] = t;
 var q$2 = (r, s, t) => Be(r, typeof s != "symbol" ? s + "" : s, t), oe$1 = (r, s, t) => s.has(r) || Me("Cannot " + t);
-var ht$2 = (r, s, t) => (oe$1(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le$1 = (r, s, t) => s.has(r) ? Me("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt$1 = (r, s, t, e) => (oe$1(r, s, "write to private field"), s.set(r, t), t), he = (r, s, t) => (oe$1(r, s, "access private method"), t);
+var ht$1 = (r, s, t) => (oe$1(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le$1 = (r, s, t) => s.has(r) ? Me("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt$1 = (r, s, t, e) => (oe$1(r, s, "write to private field"), s.set(r, t), t), he = (r, s, t) => (oe$1(r, s, "access private method"), t);
 function zt(r, s, t, e) {
   return r <= e && s >= t;
 }
@@ -85,16 +85,18 @@ function Te(r, s = 1e-9) {
     ).values()
   );
 }
-const fe = Math.PI / 180, Ue = 180 / Math.PI, Z$1 = (r) => `[${r[0]}, ${r[1]}]`, Y$2 = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it$3 = ([r, s], [t, e]) => [r + t, s + e], Q$1 = ([r, s], [t, e]) => [r - t, s - e], It$1 = ([r, s]) => r * r + s * s, an$1 = ([r, s]) => Math.sqrt(It$1([r, s])), nt$2 = ([r, s], t) => [r * t, s * t], Rt$1 = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J$1 = (r, s = [0, 0]) => Math.sqrt(Rt$1(r, s));
-function St$1([r, s], [t, e]) {
+const fe = Math.PI / 180, Ue = 180 / Math.PI, Z$1 = (r) => `[${r[0]}, ${r[1]}]`, Y$1 = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it$3 = ([r, s], [t, e]) => [r + t, s + e], Q$2 = ([r, s], [t, e]) => [r - t, s - e], It$2 = ([r, s]) => r * r + s * s, an$1 = ([r, s]) => Math.sqrt(It$2([r, s])), nt$2 = ([r, s], t) => [r * t, s * t], Rt$1 = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J$2 = (r, s = [0, 0]) => Math.sqrt(Rt$1(r, s));
+function St$2([r, s], [t, e]) {
   return r * e - s * t;
 }
 function Pe([r, s], [t, e]) {
   return r * t + s * e;
 }
-const un$1 = ([r, s], [t, e] = [0, 0]) => Math.atan2(e * r - s * t, r * t + s * e);
+function un$1([r, s], [t, e] = [0, 0]) {
+  return Math.atan2(e * r - s * t, r * t + s * e);
+}
 function H$1([r, s]) {
-  const t = J$1([r, s]);
+  const t = J$2([r, s]);
   return [r / t, s / t];
 }
 function Tt(r, s) {
@@ -105,11 +107,11 @@ function Ye([r, s]) {
   return Math.atan2(s, r);
 }
 function We(r) {
-  const s = J$1(r), t = Ye(r);
+  const s = J$2(r), t = Ye(r);
   return [s, t];
 }
 function Ie(r, s, t = 1e-9) {
-  const e = St$1(r, s), n = It$1(r), i = It$1(s);
+  const e = St$2(r, s), n = It$2(r), i = It$2(s);
   return e * e < n * i * t * t;
 }
 function tt$2(r) {
@@ -119,9 +121,9 @@ function Qt(r) {
   return [r[1], -r[0]];
 }
 function Qe(r, s, t) {
-  return Y$2(t, r) || Ie(Q$1(t, r), s);
+  return Y$1(t, r) || Ie(Q$2(t, r), s);
 }
-const Mt$1 = (r, s) => {
+const Mt$2 = (r, s) => {
   const [t, e, n, i, o, l, h, a, u] = r, [c, g, d, w, p, P, f, M, E] = s;
   return [
     t * c + e * w + n * f,
@@ -166,27 +168,27 @@ let et$3 = class et {
     return this._matrix = Ge(this._matrix), this;
   }
   translate(s, t) {
-    return this._matrix = Mt$1([1, 0, s, 0, 1, t, 0, 0, 1], this._matrix), this;
+    return this._matrix = Mt$2([1, 0, s, 0, 1, t, 0, 0, 1], this._matrix), this;
   }
   rotate(s, t) {
     const e = Math.cos(s), n = Math.sin(s), i = [e, -n, 0, n, e, 0, 0, 0, 1];
-    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$1(i, this._matrix), t && this.translate(t[0], t[1]), this;
+    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$2(i, this._matrix), t && this.translate(t[0], t[1]), this;
   }
   mirrorX() {
-    return this._matrix = Mt$1([1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), this;
+    return this._matrix = Mt$2([1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), this;
   }
   mirrorY() {
-    return this._matrix = Mt$1([-1, 0, 0, 0, 1, 0, 0, 0, 1], this._matrix), this;
+    return this._matrix = Mt$2([-1, 0, 0, 0, 1, 0, 0, 0, 1], this._matrix), this;
   }
   mirrorLine(s, t) {
     const [e, n] = s, i = Math.atan2(n, e);
     return t && this.translate(-t[0], -t[1]), this.rotate(-i), this.mirrorX(), this.rotate(i), t && this.translate(t[0], t[1]), this;
   }
   mirrorCenter(s) {
-    return s && this.translate(-s[0], -s[1]), this._matrix = Mt$1([-1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), s && this.translate(s[0], s[1]), this;
+    return s && this.translate(-s[0], -s[1]), this._matrix = Mt$2([-1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), s && this.translate(s[0], s[1]), this;
   }
   scale(s, t) {
-    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$1([s, 0, 0, 0, s, 0, 0, 0, 1], this._matrix), t && this.translate(t[0], t[1]), this;
+    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$2([s, 0, 0, 0, s, 0, 0, 0, 1], this._matrix), t && this.translate(t[0], t[1]), this;
   }
   transform(s) {
     const [t, e] = s, [n, i, o, l, h, a] = this._matrix;
@@ -260,7 +262,7 @@ let xt$1 = class xt extends Ze {
     return this.repr;
   }
 };
-let at$1 = class at extends xt$1 {
+let at$2 = class at extends xt$1 {
   constructor() {
     super(...arguments);
     q$2(this, "segmentType", "LINE");
@@ -277,13 +279,13 @@ let at$1 = class at extends xt$1 {
     return it$3(this.firstPoint, nt$2(this.V, t));
   }
   get length() {
-    return J$1(this.firstPoint, this.lastPoint);
+    return J$2(this.firstPoint, this.lastPoint);
   }
   get squareLength() {
     return Rt$1(this.firstPoint, this.lastPoint);
   }
   get V() {
-    return this._V === null && (this._V = Q$1(this.lastPoint, this.firstPoint)), this._V;
+    return this._V === null && (this._V = Q$2(this.lastPoint, this.firstPoint)), this._V;
   }
   get slope() {
     if (this._slope === null) {
@@ -299,7 +301,7 @@ let at$1 = class at extends xt$1 {
     return it$3(this.firstPoint, nt$2(this.V, 0.5));
   }
   isSame(t) {
-    return t instanceof at ? Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) || Y$2(this.lastPoint, t.firstPoint) && Y$2(this.firstPoint, t.lastPoint) : !1;
+    return t instanceof at ? Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) || Y$1(this.lastPoint, t.firstPoint) && Y$1(this.firstPoint, t.lastPoint) : !1;
   }
   clone() {
     return new at(this.firstPoint, this.lastPoint);
@@ -316,17 +318,17 @@ let at$1 = class at extends xt$1 {
     )), this._boundingBox;
   }
   distanceFrom(t) {
-    const e = Q$1(t, this.firstPoint), n = Pe(e, this.V) / this.squareLength;
+    const e = Q$2(t, this.firstPoint), n = Pe(e, this.V) / this.squareLength;
     if (n < 0)
-      return J$1(t, this.firstPoint);
+      return J$2(t, this.firstPoint);
     if (n > 1)
-      return J$1(t, this.lastPoint);
+      return J$2(t, this.lastPoint);
     const i = this.paramPoint(n);
-    return J$1(t, i);
+    return J$2(t, i);
   }
   isOnSegment(t) {
-    if (Y$2(t, this.firstPoint, this.precision)) return !0;
-    const e = Q$1(t, this.firstPoint);
+    if (Y$1(t, this.firstPoint, this.precision)) return !0;
+    const e = Q$2(t, this.firstPoint);
     if (!Ie(this.V, e)) return !1;
     const n = Pe(e, this.V) / this.squareLength;
     return this.isValidParameter(n);
@@ -373,7 +375,7 @@ let at$1 = class at extends xt$1 {
 function Je(r) {
   return Array.from(Array(r).keys());
 }
-function Kt$1(r) {
+function Kt(r) {
   const s = Math.min(...r.map((t) => t.length));
   return Je(s).map((t) => r.map((e) => e[t]));
 }
@@ -385,10 +387,10 @@ function Zt(r, s, t, e = 1e-9) {
   return t && (n = -n), n < 0 && (n += 2 * Math.PI), n > 2 * Math.PI - e ? 0 : n;
 }
 const me = (r, s, t) => {
-  const e = St$1(r.V, s.V), n = It$1(r.V), i = It$1(s.V), o = t ? t * t : r.precision * s.precision;
+  const e = St$2(r.V, s.V), n = It$2(r.V), i = It$2(s.V), o = t ? t * t : r.precision * s.precision;
   if (e * e < n * i * o)
     return "parallel";
-  const l = Q$1(s.firstPoint, r.firstPoint), h = St$1(l, s.V) / e, a = St$1(l, r.V) / e;
+  const l = Q$2(s.firstPoint, r.firstPoint), h = St$2(l, s.V) / e, a = St$2(l, r.V) / e;
   return {
     intersectionParam1: h,
     intersectionParam2: a
@@ -409,7 +411,7 @@ function cn$1(r, s, t = !1, e) {
     ).sort((h, a) => h[0] - a[0]);
     if (l.length === 0) return null;
     if (l.length === 1) return null;
-    if (l.length === 2) return new at$1(l[0], l[1]);
+    if (l.length === 2) return new at$2(l[0], l[1]);
     throw console.error(l), new Error(
       "Unexpected number of points while intersecting parallel lines"
     );
@@ -418,10 +420,10 @@ function cn$1(r, s, t = !1, e) {
   return !r.isValidParameter(i) || !s.isValidParameter(o) ? null : r.paramPoint(i);
 }
 const Ot = (r, s) => {
-  const t = Q$1(r, s);
+  const t = Q$2(r, s);
   return We(t);
 };
-let ct$1 = class ct extends xt$1 {
+let ct$2 = class ct extends xt$1 {
   constructor(t, e, n, i = !1, { ignoreChecks: o = !1 } = {}) {
     super(t, e);
     q$2(this, "segmentType", "ARC");
@@ -434,9 +436,9 @@ let ct$1 = class ct extends xt$1 {
     q$2(this, "_lastAngle", null);
     q$2(this, "_boundingBox", null);
     if (this.center = n, this.clockwise = i, !o) {
-      if (Y$2(t, e))
+      if (Y$1(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
-      if (Math.abs(this.radius - J$1(this.lastPoint, this.center)) > this.precision)
+      if (Math.abs(this.radius - J$2(this.lastPoint, this.center)) > this.precision)
         throw new Error(
           `Invalid arc, radius does not match between ${Z$1(
             t
@@ -499,18 +501,18 @@ let ct$1 = class ct extends xt$1 {
     return i;
   }
   get radius() {
-    return this._radius === null && (this._radius = J$1(this.firstPoint, this.center)), this._radius;
+    return this._radius === null && (this._radius = J$2(this.firstPoint, this.center)), this._radius;
   }
   get firstAngle() {
     if (this._firstAngle === null) {
-      const [t, e] = Q$1(this.firstPoint, this.center);
+      const [t, e] = Q$2(this.firstPoint, this.center);
       this._firstAngle = wt$2(Math.atan2(e, t));
     }
     return this._firstAngle;
   }
   get lastAngle() {
     if (this._lastAngle === null) {
-      const [t, e] = Q$1(this.lastPoint, this.center);
+      const [t, e] = Q$2(this.lastPoint, this.center);
       this._lastAngle = wt$2(Math.atan2(e, t));
     }
     return this._lastAngle;
@@ -525,7 +527,7 @@ let ct$1 = class ct extends xt$1 {
     return this.paramPoint(0.5);
   }
   isSame(t) {
-    return !(t instanceof ct) || !Y$2(this.center, t.center) ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y$2(this.lastPoint, t.firstPoint) && Y$2(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
+    return !(t instanceof ct) || !Y$1(this.center, t.center) ? !1 : Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y$1(this.lastPoint, t.firstPoint) && Y$1(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
   }
   clone() {
     return new ct(
@@ -565,7 +567,7 @@ let ct$1 = class ct extends xt$1 {
     );
   }
   isOnSegment(t) {
-    if (Y$2(t, this.firstPoint) || Y$2(t, this.lastPoint))
+    if (Y$1(t, this.firstPoint) || Y$1(t, this.lastPoint))
       return !0;
     const [e, n] = Ot(t, this.center);
     if (Math.abs(e - this.radius) > this.precision) return !1;
@@ -600,7 +602,7 @@ let ct$1 = class ct extends xt$1 {
       return [this];
     Array.isArray(t[0]) ? e = t : e = [t];
     const i = [0, 1, ...e.map((h) => this.pointToParam(h))], o = new Map(
-      Kt$1([i, [this.firstPoint, this.lastPoint, ...e]])
+      Kt([i, [this.firstPoint, this.lastPoint, ...e]])
     );
     i.sort((h, a) => h - a);
     let l = null;
@@ -628,17 +630,17 @@ let ct$1 = class ct extends xt$1 {
   }
 };
 function fn$1(r, s, t) {
-  const e = new at$1(s, r), n = new at$1(s, t), i = tt$2(e.tangentAtFirstPoint), o = tt$2(n.tangentAtLastPoint), l = me(
+  const e = new at$2(s, r), n = new at$2(s, t), i = tt$2(e.tangentAtFirstPoint), o = tt$2(n.tangentAtLastPoint), l = me(
     { firstPoint: e.midPoint, V: i, precision: 1e-9 },
     { firstPoint: n.midPoint, V: o, precision: 1e-9 }
   );
   if (l === "parallel")
     throw new Error("Cannot create an arc from three colinear points");
-  const h = St$1(
-    Q$1(r, s),
-    Q$1(t, s)
+  const h = St$2(
+    Q$2(r, s),
+    Q$2(t, s)
   ) > 0;
-  return new ct$1(
+  return new ct$2(
     r,
     t,
     it$3(e.midPoint, nt$2(i, l.intersectionParam1)),
@@ -646,8 +648,8 @@ function fn$1(r, s, t) {
     { ignoreChecks: !0 }
   );
 }
-function mn$1(r, s, t) {
-  const e = new at$1(r, s), n = tt$2(e.tangentAtFirstPoint), i = me(
+function mn$2(r, s, t) {
+  const e = new at$2(r, s), n = tt$2(e.tangentAtFirstPoint), i = me(
     { firstPoint: e.midPoint, V: n, precision: 1e-9 },
     {
       firstPoint: r,
@@ -660,11 +662,11 @@ function mn$1(r, s, t) {
   const o = it$3(
     e.midPoint,
     nt$2(n, i.intersectionParam1)
-  ), l = St$1(
-    Q$1(o, r),
-    Q$1(o, it$3(r, t))
+  ), l = St$2(
+    Q$2(o, r),
+    Q$2(o, it$3(r, t))
   ) < 0;
-  return new ct$1(r, s, o, l, {
+  return new ct$2(r, s, o, l, {
     ignoreChecks: !0
   });
 }
@@ -779,19 +781,19 @@ function qe(r) {
     });
   }), t;
 }
-var $$1 = {};
+var $ = {};
 const ts = Object.prototype.toString;
-function Ct$1(r) {
+function Ct$2(r) {
   const s = ts.call(r);
   return s.endsWith("Array]") && !s.includes("Big");
 }
 const es = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  isAnyArray: Ct$1
+  isAnyArray: Ct$2
 }, Symbol.toStringTag, { value: "Module" })), ss = /* @__PURE__ */ qe(es);
 function ns(r) {
   var s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  if (!Ct$1(r))
+  if (!Ct$2(r))
     throw new TypeError("input must be an array");
   if (r.length === 0)
     throw new TypeError("input must not be empty");
@@ -806,7 +808,7 @@ function ns(r) {
 }
 function is(r) {
   var s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  if (!Ct$1(r))
+  if (!Ct$2(r))
     throw new TypeError("input must be an array");
   if (r.length === 0)
     throw new TypeError("input must not be empty");
@@ -821,13 +823,13 @@ function is(r) {
 }
 function rs(r) {
   var s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  if (Ct$1(r)) {
+  if (Ct$2(r)) {
     if (r.length === 0)
       throw new TypeError("input must not be empty");
   } else throw new TypeError("input must be an array");
   var t;
   if (s.output !== void 0) {
-    if (!Ct$1(s.output))
+    if (!Ct$2(s.output))
       throw new TypeError("output option must be an array if specified");
     t = s.output;
   } else
@@ -846,7 +848,7 @@ const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   default: rs
 }, Symbol.toStringTag, { value: "Module" })), ls = /* @__PURE__ */ qe(os);
-Object.defineProperty($$1, "__esModule", { value: !0 });
+Object.defineProperty($, "__esModule", { value: !0 });
 var st$3 = ss, je = ls;
 const Ut$1 = " ".repeat(2), Fe = " ".repeat(4);
 function hs() {
@@ -1297,12 +1299,12 @@ function cs(r, s) {
     return this;
   };
 }
-function ot$2(r, s, t) {
+function ot$3(r, s, t) {
   let e = t ? r.rows : r.rows - 1;
   if (s < 0 || s > e)
     throw new RangeError("Row index out of range");
 }
-function lt$2(r, s, t) {
+function lt$1(r, s, t) {
   let e = t ? r.columns : r.columns - 1;
   if (s < 0 || s > e)
     throw new RangeError("Column index out of range");
@@ -1336,7 +1338,7 @@ function we(r, s) {
 function ae$1(r, s, t, e, n) {
   if (arguments.length !== 5)
     throw new RangeError("expected 4 arguments");
-  if (Yt$2("startRow", s), Yt$2("endRow", t), Yt$2("startColumn", e), Yt$2("endColumn", n), s > t || e > n || s < 0 || s >= r.rows || t < 0 || t >= r.rows || e < 0 || e >= r.columns || n < 0 || n >= r.columns)
+  if (Yt$1("startRow", s), Yt$1("endRow", t), Yt$1("startColumn", e), Yt$1("endColumn", n), s > t || e > n || s < 0 || s >= r.rows || t < 0 || t >= r.rows || e < 0 || e >= r.columns || n < 0 || n >= r.columns)
     throw new RangeError("Submatrix indices are out of range");
 }
 function Ht$1(r, s = 0) {
@@ -1345,11 +1347,11 @@ function Ht$1(r, s = 0) {
     t.push(s);
   return t;
 }
-function Yt$2(r, s) {
+function Yt$1(r, s) {
   if (typeof s != "number")
     throw new TypeError(`${r} must be a number`);
 }
-function yt$1(r) {
+function yt$2(r) {
   if (r.isEmpty())
     throw new Error("Empty matrix has no elements to index");
 }
@@ -1481,39 +1483,39 @@ function Ts(r, s) {
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) / s);
 }
-let V$2 = class V {
+let V$1 = class V {
   static from1DArray(s, t, e) {
     if (s * t !== e.length)
       throw new RangeError("data length does not match given dimensions");
-    let i = new _$2(s, t);
+    let i = new _$3(s, t);
     for (let o = 0; o < s; o++)
       for (let l = 0; l < t; l++)
         i.set(o, l, e[o * t + l]);
     return i;
   }
   static rowVector(s) {
-    let t = new _$2(1, s.length);
+    let t = new _$3(1, s.length);
     for (let e = 0; e < s.length; e++)
       t.set(0, e, s[e]);
     return t;
   }
   static columnVector(s) {
-    let t = new _$2(s.length, 1);
+    let t = new _$3(s.length, 1);
     for (let e = 0; e < s.length; e++)
       t.set(e, 0, s[e]);
     return t;
   }
   static zeros(s, t) {
-    return new _$2(s, t);
+    return new _$3(s, t);
   }
   static ones(s, t) {
-    return new _$2(s, t).fill(1);
+    return new _$3(s, t).fill(1);
   }
   static rand(s, t, e = {}) {
     if (typeof e != "object")
       throw new TypeError("options must be an object");
     const { random: n = Math.random } = e;
-    let i = new _$2(s, t);
+    let i = new _$3(s, t);
     for (let o = 0; o < s; o++)
       for (let l = 0; l < t; l++)
         i.set(o, l, n());
@@ -1526,7 +1528,7 @@ let V$2 = class V {
     if (!Number.isInteger(n)) throw new TypeError("min must be an integer");
     if (!Number.isInteger(i)) throw new TypeError("max must be an integer");
     if (n >= i) throw new RangeError("min must be smaller than max");
-    let l = i - n, h = new _$2(s, t);
+    let l = i - n, h = new _$3(s, t);
     for (let a = 0; a < s; a++)
       for (let u = 0; u < t; u++) {
         let c = n + Math.round(o() * l);
@@ -1551,7 +1553,7 @@ let V$2 = class V {
   }
   static min(s, t) {
     s = this.checkMatrix(s), t = this.checkMatrix(t);
-    let e = s.rows, n = s.columns, i = new _$2(e, n);
+    let e = s.rows, n = s.columns, i = new _$3(e, n);
     for (let o = 0; o < e; o++)
       for (let l = 0; l < n; l++)
         i.set(o, l, Math.min(s.get(o, l), t.get(o, l)));
@@ -1566,7 +1568,7 @@ let V$2 = class V {
     return i;
   }
   static checkMatrix(s) {
-    return V.isMatrix(s) ? s : new _$2(s);
+    return V.isMatrix(s) ? s : new _$3(s);
   }
   static isMatrix(s) {
     return s != null && s.klass === "Matrix";
@@ -1710,7 +1712,7 @@ let V$2 = class V {
       throw new TypeError("rows must be a positive integer");
     if (!Number.isInteger(e) || e <= 0)
       throw new TypeError("columns must be a positive integer");
-    let n = new _$2(this.rows * t, this.columns * e);
+    let n = new _$3(this.rows * t, this.columns * e);
     for (let i = 0; i < t; i++)
       for (let o = 0; o < e; o++)
         n.setSubMatrix(this, this.rows * i, this.columns * o);
@@ -1726,23 +1728,23 @@ let V$2 = class V {
     return this.mulS(-1);
   }
   getRow(s) {
-    ot$2(this, s);
+    ot$3(this, s);
     let t = [];
     for (let e = 0; e < this.columns; e++)
       t.push(this.get(s, e));
     return t;
   }
   getRowVector(s) {
-    return _$2.rowVector(this.getRow(s));
+    return _$3.rowVector(this.getRow(s));
   }
   setRow(s, t) {
-    ot$2(this, s), t = Pt$2(this, t);
+    ot$3(this, s), t = Pt$2(this, t);
     for (let e = 0; e < this.columns; e++)
       this.set(s, e, t[e]);
     return this;
   }
   swapRows(s, t) {
-    ot$2(this, s), ot$2(this, t);
+    ot$3(this, s), ot$3(this, t);
     for (let e = 0; e < this.columns; e++) {
       let n = this.get(s, e);
       this.set(s, e, this.get(t, e)), this.set(t, e, n);
@@ -1750,23 +1752,23 @@ let V$2 = class V {
     return this;
   }
   getColumn(s) {
-    lt$2(this, s);
+    lt$1(this, s);
     let t = [];
     for (let e = 0; e < this.rows; e++)
       t.push(this.get(e, s));
     return t;
   }
   getColumnVector(s) {
-    return _$2.columnVector(this.getColumn(s));
+    return _$3.columnVector(this.getColumn(s));
   }
   setColumn(s, t) {
-    lt$2(this, s), t = bt$2(this, t);
+    lt$1(this, s), t = bt$2(this, t);
     for (let e = 0; e < this.rows; e++)
       this.set(e, s, t[e]);
     return this;
   }
   swapColumns(s, t) {
-    lt$2(this, s), lt$2(this, t);
+    lt$1(this, s), lt$1(this, t);
     for (let e = 0; e < this.rows; e++) {
       let n = this.get(e, s);
       this.set(e, s, this.get(e, t)), this.set(e, t, n);
@@ -1830,13 +1832,13 @@ let V$2 = class V {
     return this;
   }
   mulRow(s, t) {
-    ot$2(this, s);
+    ot$3(this, s);
     for (let e = 0; e < this.columns; e++)
       this.set(s, e, this.get(s, e) * t);
     return this;
   }
   mulColumn(s, t) {
-    lt$2(this, s);
+    lt$1(this, s);
     for (let e = 0; e < this.rows; e++)
       this.set(e, s, this.get(e, s) * t);
     return this;
@@ -1871,7 +1873,7 @@ let V$2 = class V {
     }
   }
   maxIndex() {
-    yt$1(this);
+    yt$2(this);
     let s = this.get(0, 0), t = [0, 0];
     for (let e = 0; e < this.rows; e++)
       for (let n = 0; n < this.columns; n++)
@@ -1908,7 +1910,7 @@ let V$2 = class V {
     }
   }
   minIndex() {
-    yt$1(this);
+    yt$2(this);
     let s = this.get(0, 0), t = [0, 0];
     for (let e = 0; e < this.rows; e++)
       for (let n = 0; n < this.columns; n++)
@@ -1916,7 +1918,7 @@ let V$2 = class V {
     return t;
   }
   maxRow(s) {
-    if (ot$2(this, s), this.isEmpty())
+    if (ot$3(this, s), this.isEmpty())
       return NaN;
     let t = this.get(s, 0);
     for (let e = 1; e < this.columns; e++)
@@ -1924,14 +1926,14 @@ let V$2 = class V {
     return t;
   }
   maxRowIndex(s) {
-    ot$2(this, s), yt$1(this);
+    ot$3(this, s), yt$2(this);
     let t = this.get(s, 0), e = [s, 0];
     for (let n = 1; n < this.columns; n++)
       this.get(s, n) > t && (t = this.get(s, n), e[1] = n);
     return e;
   }
   minRow(s) {
-    if (ot$2(this, s), this.isEmpty())
+    if (ot$3(this, s), this.isEmpty())
       return NaN;
     let t = this.get(s, 0);
     for (let e = 1; e < this.columns; e++)
@@ -1939,14 +1941,14 @@ let V$2 = class V {
     return t;
   }
   minRowIndex(s) {
-    ot$2(this, s), yt$1(this);
+    ot$3(this, s), yt$2(this);
     let t = this.get(s, 0), e = [s, 0];
     for (let n = 1; n < this.columns; n++)
       this.get(s, n) < t && (t = this.get(s, n), e[1] = n);
     return e;
   }
   maxColumn(s) {
-    if (lt$2(this, s), this.isEmpty())
+    if (lt$1(this, s), this.isEmpty())
       return NaN;
     let t = this.get(0, s);
     for (let e = 1; e < this.rows; e++)
@@ -1954,14 +1956,14 @@ let V$2 = class V {
     return t;
   }
   maxColumnIndex(s) {
-    lt$2(this, s), yt$1(this);
+    lt$1(this, s), yt$2(this);
     let t = this.get(0, s), e = [0, s];
     for (let n = 1; n < this.rows; n++)
       this.get(n, s) > t && (t = this.get(n, s), e[0] = n);
     return e;
   }
   minColumn(s) {
-    if (lt$2(this, s), this.isEmpty())
+    if (lt$1(this, s), this.isEmpty())
       return NaN;
     let t = this.get(0, s);
     for (let e = 1; e < this.rows; e++)
@@ -1969,7 +1971,7 @@ let V$2 = class V {
     return t;
   }
   minColumnIndex(s) {
-    lt$2(this, s), yt$1(this);
+    lt$1(this, s), yt$2(this);
     let t = this.get(0, s), e = [0, s];
     for (let n = 1; n < this.rows; n++)
       this.get(n, s) < t && (t = this.get(n, s), e[0] = n);
@@ -2009,8 +2011,8 @@ let V$2 = class V {
     return e;
   }
   mmul(s) {
-    s = _$2.checkMatrix(s);
-    let t = this.rows, e = this.columns, n = s.columns, i = new _$2(t, n), o = new Float64Array(e);
+    s = _$3.checkMatrix(s);
+    let t = this.rows, e = this.columns, n = s.columns, i = new _$3(t, n), o = new Float64Array(e);
     for (let l = 0; l < n; l++) {
       for (let h = 0; h < e; h++)
         o[h] = s.get(h, l);
@@ -2028,25 +2030,25 @@ let V$2 = class V {
       throw new RangeError("Matrix must be square");
     if (!Number.isInteger(s) || s < 0)
       throw new RangeError("Exponent must be a non-negative integer");
-    let t = _$2.eye(this.rows), e = this;
+    let t = _$3.eye(this.rows), e = this;
     for (let n = s; n > 1; n /= 2)
       n & 1 && (t = t.mmul(e)), e = e.mmul(e);
     return t;
   }
   strassen2x2(s) {
-    s = _$2.checkMatrix(s);
-    let t = new _$2(2, 2);
+    s = _$3.checkMatrix(s);
+    let t = new _$3(2, 2);
     const e = this.get(0, 0), n = s.get(0, 0), i = this.get(0, 1), o = s.get(0, 1), l = this.get(1, 0), h = s.get(1, 0), a = this.get(1, 1), u = s.get(1, 1), c = (e + a) * (n + u), g = (l + a) * n, d = e * (o - u), w = a * (h - n), p = (e + i) * u, P = (l - e) * (n + o), f = (i - a) * (h + u), M = c + w - p + f, E = d + p, R = g + w, v = c - g + d + P;
     return t.set(0, 0, M), t.set(0, 1, E), t.set(1, 0, R), t.set(1, 1, v), t;
   }
   strassen3x3(s) {
-    s = _$2.checkMatrix(s);
-    let t = new _$2(3, 3);
+    s = _$3.checkMatrix(s);
+    let t = new _$3(3, 3);
     const e = this.get(0, 0), n = this.get(0, 1), i = this.get(0, 2), o = this.get(1, 0), l = this.get(1, 1), h = this.get(1, 2), a = this.get(2, 0), u = this.get(2, 1), c = this.get(2, 2), g = s.get(0, 0), d = s.get(0, 1), w = s.get(0, 2), p = s.get(1, 0), P = s.get(1, 1), f = s.get(1, 2), M = s.get(2, 0), E = s.get(2, 1), R = s.get(2, 2), v = (e + n + i - o - l - u - c) * P, L = (e - o) * (-d + P), S = l * (-g + d + p - P - f - M + R), k = (-e + o + l) * (g - d + P), D = (o + l) * (-g + d), m = e * g, b = (-e + a + u) * (g - w + f), j = (-e + a) * (w - f), y = (a + u) * (-g + w), C = (e + n + i - l - h - a - u) * f, F = u * (-g + w + p - P - f - M + E), I = (-i + u + c) * (P + M - E), B = (i - c) * (P - E), x = i * M, N = (u + c) * (-M + E), A = (-i + l + h) * (f + M - R), O = (i - h) * (f - R), U = (l + h) * (-M + R), T = n * p, z = h * E, X = o * w, G = a * d, W = c * R, se = m + x + T, ne = v + k + D + m + I + x + N, ie = m + b + y + C + x + A + U, re = L + S + k + m + x + A + O, At = L + k + D + m + z, Vt = x + A + O + U + X, Nt = m + b + j + F + I + B + x, $t = I + B + x + N + G, Lt = m + b + j + y + W;
     return t.set(0, 0, se), t.set(0, 1, ne), t.set(0, 2, ie), t.set(1, 0, re), t.set(1, 1, At), t.set(1, 2, Vt), t.set(2, 0, Nt), t.set(2, 1, $t), t.set(2, 2, Lt), t;
   }
   mmulStrassen(s) {
-    s = _$2.checkMatrix(s);
+    s = _$3.checkMatrix(s);
     let t = this.clone(), e = t.rows, n = t.columns, i = s.rows, o = s.columns;
     n !== i && console.warn(
       `Multiplying ${e} x ${n} and ${i} x ${o} matrix: dimensions do not match.`
@@ -2097,7 +2099,7 @@ let V$2 = class V {
     if (!Number.isFinite(t)) throw new TypeError("min must be a number");
     if (!Number.isFinite(e)) throw new TypeError("max must be a number");
     if (t >= e) throw new RangeError("min must be smaller than max");
-    let n = new _$2(this.rows, this.columns);
+    let n = new _$3(this.rows, this.columns);
     for (let i = 0; i < this.rows; i++) {
       const o = this.getRow(i);
       o.length > 0 && je(o, { min: t, max: e, output: o }), n.setRow(i, o);
@@ -2111,7 +2113,7 @@ let V$2 = class V {
     if (!Number.isFinite(t)) throw new TypeError("min must be a number");
     if (!Number.isFinite(e)) throw new TypeError("max must be a number");
     if (t >= e) throw new RangeError("min must be smaller than max");
-    let n = new _$2(this.rows, this.columns);
+    let n = new _$3(this.rows, this.columns);
     for (let i = 0; i < this.columns; i++) {
       const o = this.getColumn(i);
       o.length && je(o, {
@@ -2141,8 +2143,8 @@ let V$2 = class V {
     return this;
   }
   kroneckerProduct(s) {
-    s = _$2.checkMatrix(s);
-    let t = this.rows, e = this.columns, n = s.rows, i = s.columns, o = new _$2(t * n, e * i);
+    s = _$3.checkMatrix(s);
+    let t = this.rows, e = this.columns, n = s.rows, i = s.columns, o = new _$3(t * n, e * i);
     for (let l = 0; l < t; l++)
       for (let h = 0; h < e; h++)
         for (let a = 0; a < n; a++)
@@ -2151,13 +2153,13 @@ let V$2 = class V {
     return o;
   }
   kroneckerSum(s) {
-    if (s = _$2.checkMatrix(s), !this.isSquare() || !s.isSquare())
+    if (s = _$3.checkMatrix(s), !this.isSquare() || !s.isSquare())
       throw new Error("Kronecker Sum needs two Square Matrices");
-    let t = this.rows, e = s.rows, n = this.kroneckerProduct(_$2.eye(e, e)), i = _$2.eye(t, t).kroneckerProduct(s);
+    let t = this.rows, e = s.rows, n = this.kroneckerProduct(_$3.eye(e, e)), i = _$3.eye(t, t).kroneckerProduct(s);
     return n.add(i);
   }
   transpose() {
-    let s = new _$2(this.columns, this.rows);
+    let s = new _$3(this.columns, this.rows);
     for (let t = 0; t < this.rows; t++)
       for (let e = 0; e < this.columns; e++)
         s.set(e, t, this.get(t, e));
@@ -2175,7 +2177,7 @@ let V$2 = class V {
   }
   subMatrix(s, t, e, n) {
     ae$1(this, s, t, e, n);
-    let i = new _$2(
+    let i = new _$3(
       t - s + 1,
       n - e + 1
     );
@@ -2187,7 +2189,7 @@ let V$2 = class V {
   subMatrixRow(s, t, e) {
     if (t === void 0 && (t = 0), e === void 0 && (e = this.columns - 1), t > e || t < 0 || t >= this.columns || e < 0 || e >= this.columns)
       throw new RangeError("Argument out of range");
-    let n = new _$2(s.length, e - t + 1);
+    let n = new _$3(s.length, e - t + 1);
     for (let i = 0; i < s.length; i++)
       for (let o = t; o <= e; o++) {
         if (s[i] < 0 || s[i] >= this.rows)
@@ -2199,7 +2201,7 @@ let V$2 = class V {
   subMatrixColumn(s, t, e) {
     if (t === void 0 && (t = 0), e === void 0 && (e = this.rows - 1), t > e || t < 0 || t >= this.rows || e < 0 || e >= this.rows)
       throw new RangeError("Argument out of range");
-    let n = new _$2(e - t + 1, s.length);
+    let n = new _$3(e - t + 1, s.length);
     for (let i = 0; i < s.length; i++)
       for (let o = t; o <= e; o++) {
         if (s[i] < 0 || s[i] >= this.columns)
@@ -2209,7 +2211,7 @@ let V$2 = class V {
     return n;
   }
   setSubMatrix(s, t, e) {
-    if (s = _$2.checkMatrix(s), s.isEmpty())
+    if (s = _$3.checkMatrix(s), s.isEmpty())
       return this;
     let n = t + s.rows - 1, i = e + s.columns - 1;
     ae$1(this, t, n, e, i);
@@ -2220,7 +2222,7 @@ let V$2 = class V {
   }
   selection(s, t) {
     ge(this, s), we(this, t);
-    let e = new _$2(s.length, t.length);
+    let e = new _$3(s.length, t.length);
     for (let n = 0; n < s.length; n++) {
       let i = s[n];
       for (let o = 0; o < t.length; o++) {
@@ -2237,7 +2239,7 @@ let V$2 = class V {
     return t;
   }
   clone() {
-    return this.constructor.copy(this, new _$2(this.rows, this.columns));
+    return this.constructor.copy(this, new _$3(this.rows, this.columns));
   }
   /**
    * @template {AbstractMatrix} M
@@ -2409,23 +2411,23 @@ let V$2 = class V {
         yield this.get(s, t);
   }
 };
-V$2.prototype.klass = "Matrix";
-typeof Symbol < "u" && (V$2.prototype[Symbol.for("nodejs.util.inspect.custom")] = hs);
+V$1.prototype.klass = "Matrix";
+typeof Symbol < "u" && (V$1.prototype[Symbol.for("nodejs.util.inspect.custom")] = hs);
 function ke(r, s) {
   return r - s;
 }
 function Is(r) {
   return r.every((s) => typeof s == "number");
 }
-V$2.random = V$2.rand;
-V$2.randomInt = V$2.randInt;
-V$2.diagonal = V$2.diag;
-V$2.prototype.diagonal = V$2.prototype.diag;
-V$2.identity = V$2.eye;
-V$2.prototype.negate = V$2.prototype.neg;
-V$2.prototype.tensorProduct = V$2.prototype.kroneckerProduct;
-var Ft$1, ue, dt$1;
-let _$2 = (dt$1 = class extends V$2 {
+V$1.random = V$1.rand;
+V$1.randomInt = V$1.randInt;
+V$1.diagonal = V$1.diag;
+V$1.prototype.diagonal = V$1.prototype.diag;
+V$1.identity = V$1.eye;
+V$1.prototype.negate = V$1.prototype.neg;
+V$1.prototype.tensorProduct = V$1.prototype.kroneckerProduct;
+var Ft$1, ue, dt;
+let _$3 = (dt = class extends V$1 {
   constructor(t, e) {
     super();
     le$1(this, Ft$1);
@@ -2433,8 +2435,8 @@ let _$2 = (dt$1 = class extends V$2 {
      * @type {Float64Array[]}
      */
     q$2(this, "data");
-    if (dt$1.isMatrix(t))
-      he(this, Ft$1, ue).call(this, t.rows, t.columns), dt$1.copy(t, this);
+    if (dt.isMatrix(t))
+      he(this, Ft$1, ue).call(this, t.rows, t.columns), dt.copy(t, this);
     else if (Number.isInteger(t) && t >= 0)
       he(this, Ft$1, ue).call(this, t, e);
     else if (st$3.isAnyArray(t)) {
@@ -2464,13 +2466,13 @@ let _$2 = (dt$1 = class extends V$2 {
     return this.data[t][e];
   }
   removeRow(t) {
-    return ot$2(this, t), this.data.splice(t, 1), this.rows -= 1, this;
+    return ot$3(this, t), this.data.splice(t, 1), this.rows -= 1, this;
   }
   addRow(t, e) {
-    return e === void 0 && (e = t, t = this.rows), ot$2(this, t, !0), e = Float64Array.from(Pt$2(this, e)), this.data.splice(t, 0, e), this.rows += 1, this;
+    return e === void 0 && (e = t, t = this.rows), ot$3(this, t, !0), e = Float64Array.from(Pt$2(this, e)), this.data.splice(t, 0, e), this.rows += 1, this;
   }
   removeColumn(t) {
-    lt$2(this, t);
+    lt$1(this, t);
     for (let e = 0; e < this.rows; e++) {
       const n = new Float64Array(this.columns - 1);
       for (let i = 0; i < t; i++)
@@ -2482,7 +2484,7 @@ let _$2 = (dt$1 = class extends V$2 {
     return this.columns -= 1, this;
   }
   addColumn(t, e) {
-    typeof e > "u" && (e = t, t = this.columns), lt$2(this, t, !0), e = bt$2(this, e);
+    typeof e > "u" && (e = t, t = this.columns), lt$1(this, t, !0), e = bt$2(this, e);
     for (let n = 0; n < this.rows; n++) {
       const i = new Float64Array(this.columns + 1);
       let o = 0;
@@ -2506,10 +2508,10 @@ ue = function(t, e) {
   else
     throw new TypeError("nColumns must be a positive integer");
   this.rows = t, this.columns = e;
-}, dt$1);
-cs(V$2, _$2);
+}, dt);
+cs(V$1, _$3);
 var K$2;
-const Jt = class Jt extends V$2 {
+const Jt = class Jt extends V$1 {
   /**
    * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize
    * @return {this}
@@ -2518,26 +2520,26 @@ const Jt = class Jt extends V$2 {
     super();
     /** @type {Matrix} */
     le$1(this, K$2);
-    if (_$2.isMatrix(t)) {
+    if (_$3.isMatrix(t)) {
       if (!t.isSymmetric())
         throw new TypeError("not symmetric data");
-      Dt$1(this, K$2, _$2.copy(
+      Dt$1(this, K$2, _$3.copy(
         t,
-        new _$2(t.rows, t.rows)
+        new _$3(t.rows, t.rows)
       ));
     } else if (Number.isInteger(t) && t >= 0)
-      Dt$1(this, K$2, new _$2(t, t));
-    else if (Dt$1(this, K$2, new _$2(t)), !this.isSymmetric())
+      Dt$1(this, K$2, new _$3(t, t));
+    else if (Dt$1(this, K$2, new _$3(t)), !this.isSymmetric())
       throw new TypeError("not symmetric data");
   }
   get size() {
-    return ht$2(this, K$2).size;
+    return ht$1(this, K$2).size;
   }
   get rows() {
-    return ht$2(this, K$2).rows;
+    return ht$1(this, K$2).rows;
   }
   get columns() {
-    return ht$2(this, K$2).columns;
+    return ht$1(this, K$2).columns;
   }
   get diagonalSize() {
     return this.rows;
@@ -2550,7 +2552,7 @@ const Jt = class Jt extends V$2 {
    * @returns {boolean}
    */
   static isSymmetricMatrix(t) {
-    return _$2.isMatrix(t) && t.klassType === "SymmetricMatrix";
+    return _$3.isMatrix(t) && t.klassType === "SymmetricMatrix";
   }
   /**
    * @param diagonalSize
@@ -2573,21 +2575,21 @@ const Jt = class Jt extends V$2 {
     return t;
   }
   toMatrix() {
-    return new _$2(this);
+    return new _$3(this);
   }
   get(t, e) {
-    return ht$2(this, K$2).get(t, e);
+    return ht$1(this, K$2).get(t, e);
   }
   set(t, e, n) {
-    return ht$2(this, K$2).set(t, e, n), ht$2(this, K$2).set(e, t, n), this;
+    return ht$1(this, K$2).set(t, e, n), ht$1(this, K$2).set(e, t, n), this;
   }
   removeCross(t) {
-    return ht$2(this, K$2).removeRow(t), ht$2(this, K$2).removeColumn(t), this;
+    return ht$1(this, K$2).removeRow(t), ht$1(this, K$2).removeColumn(t), this;
   }
   addCross(t, e) {
     e === void 0 && (e = t, t = this.diagonalSize);
     const n = e.slice();
-    return n.splice(t, 1), ht$2(this, K$2).addRow(t, n), ht$2(this, K$2).addColumn(t, e), this;
+    return n.splice(t, 1), ht$1(this, K$2).addRow(t, n), ht$1(this, K$2).addColumn(t, e), this;
   }
   /**
    * @param {Mask[]} mask
@@ -2668,9 +2670,9 @@ const Jt = class Jt extends V$2 {
   }
 };
 K$2 = new WeakMap();
-let pt$2 = Jt;
-pt$2.prototype.klassType = "SymmetricMatrix";
-let te$1 = class te extends pt$2 {
+let pt$1 = Jt;
+pt$1.prototype.klassType = "SymmetricMatrix";
+let te$1 = class te extends pt$1 {
   /**
    * not the same as matrix.isSymmetric()
    * Here is to check if it's instanceof SymmetricMatrix without bundling issues
@@ -2679,7 +2681,7 @@ let te$1 = class te extends pt$2 {
    * @returns {boolean}
    */
   static isDistanceMatrix(s) {
-    return pt$2.isSymmetricMatrix(s) && s.klassSubType === "DistanceMatrix";
+    return pt$1.isSymmetricMatrix(s) && s.klassSubType === "DistanceMatrix";
   }
   constructor(s) {
     if (super(s), !this.isDistance())
@@ -2692,7 +2694,7 @@ let te$1 = class te extends pt$2 {
     return t === void 0 && (t = s, s = this.diagonalSize), t = t.slice(), t[s] = 0, super.addCross(s, t);
   }
   toSymmetricMatrix() {
-    return new pt$2(this);
+    return new pt$1(this);
   }
   clone() {
     const s = new te(this.diagonalSize);
@@ -2746,14 +2748,14 @@ let te$1 = class te extends pt$2 {
   }
 };
 te$1.prototype.klassSubType = "DistanceMatrix";
-let ft$1 = class ft extends V$2 {
+let ft$2 = class ft extends V$1 {
   constructor(s, t, e) {
     super(), this.matrix = s, this.rows = t, this.columns = e;
   }
 };
-class Cs extends ft$1 {
+class Cs extends ft$2 {
   constructor(s, t) {
-    lt$2(s, t), super(s, s.rows, 1), this.column = t;
+    lt$1(s, t), super(s, s.rows, 1), this.column = t;
   }
   set(s, t, e) {
     return this.matrix.set(s, this.column, e), this;
@@ -2762,7 +2764,7 @@ class Cs extends ft$1 {
     return this.matrix.get(s, this.column);
   }
 }
-class qs extends ft$1 {
+class qs extends ft$2 {
   constructor(s, t) {
     we(s, t), super(s, s.rows, t.length), this.columnIndices = t;
   }
@@ -2773,7 +2775,7 @@ class qs extends ft$1 {
     return this.matrix.get(s, this.columnIndices[t]);
   }
 }
-class Fs extends ft$1 {
+class Fs extends ft$2 {
   constructor(s) {
     super(s, s.rows, s.columns);
   }
@@ -2784,7 +2786,7 @@ class Fs extends ft$1 {
     return this.matrix.get(s, this.columns - t - 1);
   }
 }
-class xs extends ft$1 {
+class xs extends ft$2 {
   constructor(s) {
     super(s, s.rows, s.columns);
   }
@@ -2795,9 +2797,9 @@ class xs extends ft$1 {
     return this.matrix.get(this.rows - s - 1, t);
   }
 }
-class As extends ft$1 {
+class As extends ft$2 {
   constructor(s, t) {
-    ot$2(s, t), super(s, 1, s.columns), this.row = t;
+    ot$3(s, t), super(s, 1, s.columns), this.row = t;
   }
   set(s, t, e) {
     return this.matrix.set(this.row, t, e), this;
@@ -2806,7 +2808,7 @@ class As extends ft$1 {
     return this.matrix.get(this.row, t);
   }
 }
-class Vs extends ft$1 {
+class Vs extends ft$2 {
   constructor(s, t) {
     ge(s, t), super(s, t.length, s.columns), this.rowIndices = t;
   }
@@ -2817,7 +2819,7 @@ class Vs extends ft$1 {
     return this.matrix.get(this.rowIndices[s], t);
   }
 }
-let Gt$1 = class Gt extends ft$1 {
+let Gt$1 = class Gt extends ft$2 {
   constructor(s, t, e) {
     ge(s, t), we(s, e), super(s, t.length, e.length), this.rowIndices = t, this.columnIndices = e;
   }
@@ -2835,7 +2837,7 @@ let Gt$1 = class Gt extends ft$1 {
     );
   }
 };
-class Ns extends ft$1 {
+class Ns extends ft$2 {
   constructor(s, t, e, n, i) {
     ae$1(s, t, e, n, i), super(s, e - t + 1, i - n + 1), this.startRow = t, this.startColumn = n;
   }
@@ -2853,7 +2855,7 @@ class Ns extends ft$1 {
     );
   }
 }
-class $s extends ft$1 {
+class $s extends ft$2 {
   constructor(s) {
     super(s, s.columns, s.rows);
   }
@@ -2864,7 +2866,7 @@ class $s extends ft$1 {
     return this.matrix.get(t, s);
   }
 }
-class Ae extends V$2 {
+class Ae extends V$1 {
   constructor(s, t = {}) {
     const { rows: e = 1 } = t;
     if (s.length % e !== 0)
@@ -2883,7 +2885,7 @@ class Ae extends V$2 {
     return s * this.columns + t;
   }
 }
-let rt$2 = class rt extends V$2 {
+let rt$3 = class rt extends V$1 {
   constructor(s) {
     super(), this.data = s, this.rows = s.length, this.columns = s[0].length;
   }
@@ -2896,12 +2898,12 @@ let rt$2 = class rt extends V$2 {
 };
 function Ls(r, s) {
   if (st$3.isAnyArray(r))
-    return r[0] && st$3.isAnyArray(r[0]) ? new rt$2(r) : new Ae(r, s);
+    return r[0] && st$3.isAnyArray(r[0]) ? new rt$3(r) : new Ae(r, s);
   throw new Error("the argument is not an array");
 }
 let ee$1 = class ee {
   constructor(s) {
-    s = rt$2.checkMatrix(s);
+    s = rt$3.checkMatrix(s);
     let t = s.clone(), e = t.rows, n = t.columns, i = new Float64Array(e), o = 1, l, h, a, u, c, g, d, w, p;
     for (l = 0; l < e; l++)
       i[l] = l;
@@ -2934,7 +2936,7 @@ let ee$1 = class ee {
     return !1;
   }
   solve(s) {
-    s = _$2.checkMatrix(s);
+    s = _$3.checkMatrix(s);
     let t = this.LU;
     if (t.rows !== s.rows)
       throw new Error("Invalid matrix dimensions");
@@ -2964,14 +2966,14 @@ let ee$1 = class ee {
     return t;
   }
   get lowerTriangularMatrix() {
-    let s = this.LU, t = s.rows, e = s.columns, n = new _$2(t, e);
+    let s = this.LU, t = s.rows, e = s.columns, n = new _$3(t, e);
     for (let i = 0; i < t; i++)
       for (let o = 0; o < e; o++)
         i > o ? n.set(i, o, s.get(i, o)) : i === o ? n.set(i, o, 1) : n.set(i, o, 0);
     return n;
   }
   get upperTriangularMatrix() {
-    let s = this.LU, t = s.rows, e = s.columns, n = new _$2(t, e);
+    let s = this.LU, t = s.rows, e = s.columns, n = new _$3(t, e);
     for (let i = 0; i < t; i++)
       for (let o = 0; o < e; o++)
         i <= o ? n.set(i, o, s.get(i, o)) : n.set(i, o, 0);
@@ -2981,18 +2983,18 @@ let ee$1 = class ee {
     return Array.from(this.pivotVector);
   }
 };
-function ut$2(r, s) {
+function ut$1(r, s) {
   let t = 0;
   return Math.abs(r) > Math.abs(s) ? (t = s / r, Math.abs(r) * Math.sqrt(1 + t * t)) : s !== 0 ? (t = r / s, Math.abs(s) * Math.sqrt(1 + t * t)) : 0;
 }
 class pe {
   constructor(s) {
-    s = rt$2.checkMatrix(s);
+    s = rt$3.checkMatrix(s);
     let t = s.clone(), e = s.rows, n = s.columns, i = new Float64Array(n), o, l, h, a;
     for (h = 0; h < n; h++) {
       let u = 0;
       for (o = h; o < e; o++)
-        u = ut$2(u, t.get(o, h));
+        u = ut$1(u, t.get(o, h));
       if (u !== 0) {
         for (t.get(h, h) < 0 && (u = -u), o = h; o < e; o++)
           t.set(o, h, t.get(o, h) / u);
@@ -3008,7 +3010,7 @@ class pe {
     this.QR = t, this.Rdiag = i;
   }
   solve(s) {
-    s = _$2.checkMatrix(s);
+    s = _$3.checkMatrix(s);
     let t = this.QR, e = t.rows;
     if (s.rows !== e)
       throw new Error("Matrix row dimensions must agree");
@@ -3039,14 +3041,14 @@ class pe {
     return !0;
   }
   get upperTriangularMatrix() {
-    let s = this.QR, t = s.columns, e = new _$2(t, t), n, i;
+    let s = this.QR, t = s.columns, e = new _$3(t, t), n, i;
     for (n = 0; n < t; n++)
       for (i = 0; i < t; i++)
         n < i ? e.set(n, i, s.get(n, i)) : n === i ? e.set(n, i, this.Rdiag[n]) : e.set(n, i, 0);
     return e;
   }
   get orthogonalMatrix() {
-    let s = this.QR, t = s.rows, e = s.columns, n = new _$2(t, e), i, o, l, h;
+    let s = this.QR, t = s.rows, e = s.columns, n = new _$3(t, e), i, o, l, h;
     for (l = e - 1; l >= 0; l--) {
       for (i = 0; i < t; i++)
         n.set(i, l, 0);
@@ -3061,9 +3063,9 @@ class pe {
     return n;
   }
 }
-let vt$1 = class vt {
+let vt$2 = class vt {
   constructor(s, t = {}) {
-    if (s = rt$2.checkMatrix(s), s.isEmpty())
+    if (s = rt$3.checkMatrix(s), s.isEmpty())
       throw new Error("Matrix must be non-empty");
     let e = s.rows, n = s.columns;
     const {
@@ -3084,14 +3086,14 @@ let vt$1 = class vt {
       }
     else
       c = s.clone();
-    let g = Math.min(e, n), d = Math.min(e + 1, n), w = new Float64Array(d), p = new _$2(e, g), P = new _$2(n, n), f = new Float64Array(n), M = new Float64Array(e), E = new Float64Array(d);
+    let g = Math.min(e, n), d = Math.min(e + 1, n), w = new Float64Array(d), p = new _$3(e, g), P = new _$3(n, n), f = new Float64Array(n), M = new Float64Array(e), E = new Float64Array(d);
     for (let m = 0; m < d; m++) E[m] = m;
     let R = Math.min(e - 1, n), v = Math.max(0, Math.min(n - 2, e)), L = Math.max(R, v);
     for (let m = 0; m < L; m++) {
       if (m < R) {
         w[m] = 0;
         for (let b = m; b < e; b++)
-          w[m] = ut$2(w[m], c.get(b, m));
+          w[m] = ut$1(w[m], c.get(b, m));
         if (w[m] !== 0) {
           c.get(m, m) < 0 && (w[m] = -w[m]);
           for (let b = m; b < e; b++)
@@ -3117,7 +3119,7 @@ let vt$1 = class vt {
       if (m < v) {
         f[m] = 0;
         for (let b = m + 1; b < n; b++)
-          f[m] = ut$2(f[m], f[b]);
+          f[m] = ut$1(f[m], f[b]);
         if (f[m] !== 0) {
           f[m + 1] < 0 && (f[m] = 0 - f[m]);
           for (let b = m + 1; b < n; b++)
@@ -3212,7 +3214,7 @@ let vt$1 = class vt {
           let j = f[S - 2];
           f[S - 2] = 0;
           for (let y = S - 2; y >= m; y--) {
-            let C = ut$2(w[y], j), F = w[y] / C, I = j / C;
+            let C = ut$1(w[y], j), F = w[y] / C, I = j / C;
             if (w[y] = C, y !== m && (j = -I * f[y - 1], f[y - 1] = F * f[y - 1]), a)
               for (let B = 0; B < n; B++)
                 C = F * P.get(B, y) + I * P.get(B, S - 1), P.set(B, S - 1, -I * P.get(B, y) + F * P.get(B, S - 1)), P.set(B, y, C);
@@ -3223,7 +3225,7 @@ let vt$1 = class vt {
           let j = f[m - 1];
           f[m - 1] = 0;
           for (let y = m; y < S; y++) {
-            let C = ut$2(w[y], j), F = w[y] / C, I = j / C;
+            let C = ut$1(w[y], j), F = w[y] / C, I = j / C;
             if (w[y] = C, j = -I * f[y], f[y] = F * f[y], h)
               for (let B = 0; B < e; B++)
                 C = F * p.get(B, y) + I * p.get(B, m - 1), p.set(B, m - 1, -I * p.get(B, y) + F * p.get(B, m - 1)), p.set(B, y, C);
@@ -3242,13 +3244,13 @@ let vt$1 = class vt {
           (x !== 0 || N !== 0) && (x < 0 ? A = 0 - Math.sqrt(x * x + N) : A = Math.sqrt(x * x + N), A = N / (x + A));
           let O = (I + y) * (I - y) + A, U = I * B;
           for (let T = m; T < S - 1; T++) {
-            let z = ut$2(O, U);
+            let z = ut$1(O, U);
             z === 0 && (z = Number.MIN_VALUE);
             let X = O / z, G = U / z;
             if (T !== m && (f[T - 1] = z), O = X * w[T] + G * f[T], f[T] = X * f[T] - G * w[T], U = G * w[T + 1], w[T + 1] = X * w[T + 1], a)
               for (let W = 0; W < n; W++)
                 z = X * P.get(W, T) + G * P.get(W, T + 1), P.set(W, T + 1, -G * P.get(W, T) + X * P.get(W, T + 1)), P.set(W, T, z);
-            if (z = ut$2(O, U), z === 0 && (z = Number.MIN_VALUE), X = O / z, G = U / z, w[T] = z, O = X * f[T] + G * w[T + 1], w[T + 1] = -G * f[T] + X * w[T + 1], U = G * f[T + 1], f[T + 1] = X * f[T + 1], h && T < e - 1)
+            if (z = ut$1(O, U), z === 0 && (z = Number.MIN_VALUE), X = O / z, G = U / z, w[T] = z, O = X * f[T] + G * w[T + 1], w[T + 1] = -G * f[T] + X * w[T + 1], U = G * f[T + 1], f[T + 1] = X * f[T + 1], h && T < e - 1)
               for (let W = 0; W < e; W++)
                 z = X * p.get(W, T) + G * p.get(W, T + 1), p.set(W, T + 1, -G * p.get(W, T) + X * p.get(W, T + 1)), p.set(W, T, z);
           }
@@ -3281,10 +3283,10 @@ let vt$1 = class vt {
     this.m = e, this.n = n, this.s = w, this.U = p, this.V = P;
   }
   solve(s) {
-    let t = s, e = this.threshold, n = this.s.length, i = _$2.zeros(n, n);
+    let t = s, e = this.threshold, n = this.s.length, i = _$3.zeros(n, n);
     for (let g = 0; g < n; g++)
       Math.abs(this.s[g]) <= e ? i.set(g, g, 0) : i.set(g, g, 1 / this.s[g]);
-    let o = this.U, l = this.rightSingularVectors, h = l.mmul(i), a = l.rows, u = o.rows, c = _$2.zeros(a, u);
+    let o = this.U, l = this.rightSingularVectors, h = l.mmul(i), a = l.rows, u = o.rows, c = _$3.zeros(a, u);
     for (let g = 0; g < a; g++)
       for (let d = 0; d < u; d++) {
         let w = 0;
@@ -3295,14 +3297,14 @@ let vt$1 = class vt {
     return c.mmul(t);
   }
   solveForDiagonal(s) {
-    return this.solve(_$2.diag(s));
+    return this.solve(_$3.diag(s));
   }
   inverse() {
-    let s = this.V, t = this.threshold, e = s.rows, n = s.columns, i = new _$2(e, this.s.length);
+    let s = this.V, t = this.threshold, e = s.rows, n = s.columns, i = new _$3(e, this.s.length);
     for (let u = 0; u < e; u++)
       for (let c = 0; c < n; c++)
         Math.abs(this.s[c]) > t && i.set(u, c, s.get(u, c) / this.s[c]);
-    let o = this.U, l = o.rows, h = o.columns, a = new _$2(e, l);
+    let o = this.U, l = o.rows, h = o.columns, a = new _$3(e, l);
     for (let u = 0; u < e; u++)
       for (let c = 0; c < l; c++) {
         let g = 0;
@@ -3337,17 +3339,17 @@ let vt$1 = class vt {
     return this.V;
   }
   get diagonalMatrix() {
-    return _$2.diag(this.s);
+    return _$3.diag(this.s);
   }
 };
 function Ds(r, s = !1) {
-  return r = rt$2.checkMatrix(r), s ? new vt$1(r).inverse() : Ve(r, _$2.eye(r.rows));
+  return r = rt$3.checkMatrix(r), s ? new vt$2(r).inverse() : Ve(r, _$3.eye(r.rows));
 }
 function Ve(r, s, t = !1) {
-  return r = rt$2.checkMatrix(r), s = rt$2.checkMatrix(s), t ? new vt$1(r).solve(s) : r.isSquare() ? new ee$1(r).solve(s) : new pe(r).solve(s);
+  return r = rt$3.checkMatrix(r), s = rt$3.checkMatrix(s), t ? new vt$2(r).solve(s) : r.isSquare() ? new ee$1(r).solve(s) : new pe(r).solve(s);
 }
-function Xt$2(r) {
-  if (r = _$2.checkMatrix(r), r.isSquare()) {
+function Xt$1(r) {
+  if (r = _$3.checkMatrix(r), r.isSquare()) {
     if (r.columns === 0)
       return 1;
     let s, t, e, n;
@@ -3355,7 +3357,7 @@ function Xt$2(r) {
       return s = r.get(0, 0), t = r.get(0, 1), e = r.get(1, 0), n = r.get(1, 1), s * n - t * e;
     if (r.columns === 3) {
       let i, o, l;
-      return i = new Gt$1(r, [1, 2], [1, 2]), o = new Gt$1(r, [1, 2], [0, 2]), l = new Gt$1(r, [1, 2], [0, 1]), s = r.get(0, 0), t = r.get(0, 1), e = r.get(0, 2), s * Xt$2(i) - t * Xt$2(o) + e * Xt$2(l);
+      return i = new Gt$1(r, [1, 2], [1, 2]), o = new Gt$1(r, [1, 2], [0, 2]), l = new Gt$1(r, [1, 2], [0, 1]), s = r.get(0, 0), t = r.get(0, 1), e = r.get(0, 2), s * Xt$1(i) - t * Xt$1(o) + e * Xt$1(l);
     } else
       return new ee$1(r).determinant;
   } else
@@ -3379,10 +3381,10 @@ function Os(r, s, t, e = 1e-9, n = 1e-9) {
 }
 function Bs(r, s = {}) {
   const { thresholdValue: t = 1e-9, thresholdError: e = 1e-9 } = s;
-  r = _$2.checkMatrix(r);
-  let n = r.rows, i = new _$2(n, n);
+  r = _$3.checkMatrix(r);
+  let n = r.rows, i = new _$3(n, n);
   for (let o = 0; o < n; o++) {
-    let l = _$2.columnVector(r.getRow(o)), h = r.subMatrixRow(zs(n, o)).transpose(), u = new vt$1(h).solve(l), c = _$2.sub(l, h.mmul(u)).abs().max();
+    let l = _$3.columnVector(r.getRow(o)), h = r.subMatrixRow(zs(n, o)).transpose(), u = new vt$2(h).solve(l), c = _$3.sub(l, h.mmul(u)).abs().max();
     i.setRow(
       o,
       Os(c, u, o, t, e)
@@ -3391,17 +3393,17 @@ function Bs(r, s = {}) {
   return i;
 }
 function Us(r, s = Number.EPSILON) {
-  if (r = _$2.checkMatrix(r), r.isEmpty())
+  if (r = _$3.checkMatrix(r), r.isEmpty())
     return r.transpose();
-  let t = new vt$1(r, { autoTranspose: !0 }), e = t.leftSingularVectors, n = t.rightSingularVectors, i = t.diagonal;
+  let t = new vt$2(r, { autoTranspose: !0 }), e = t.leftSingularVectors, n = t.rightSingularVectors, i = t.diagonal;
   for (let o = 0; o < i.length; o++)
     Math.abs(i[o]) > s ? i[o] = 1 / i[o] : i[o] = 0;
-  return n.mmul(_$2.diag(i).mmul(e.transpose()));
+  return n.mmul(_$3.diag(i).mmul(e.transpose()));
 }
 function Ys(r, s = r, t = {}) {
-  r = new _$2(r);
+  r = new _$3(r);
   let e = !1;
-  if (typeof s == "object" && !_$2.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$2(s), r.rows !== s.rows)
+  if (typeof s == "object" && !_$3.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$3(s), r.rows !== s.rows)
     throw new TypeError("Both matrices must have the same number of rows");
   const { center: n = !0 } = t;
   n && (r = r.center("column"), e || (s = s.center("column")));
@@ -3412,9 +3414,9 @@ function Ys(r, s = r, t = {}) {
   return i;
 }
 function Ws(r, s = r, t = {}) {
-  r = new _$2(r);
+  r = new _$3(r);
   let e = !1;
-  if (typeof s == "object" && !_$2.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$2(s), r.rows !== s.rows)
+  if (typeof s == "object" && !_$3.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$3(s), r.rows !== s.rows)
     throw new TypeError("Both matrices must have the same number of rows");
   const { center: n = !0, scale: i = !0 } = t;
   n && (r.center("column"), e || s.center("column")), i && (r.scale("column"), e || s.scale("column"));
@@ -3431,18 +3433,18 @@ function Ws(r, s = r, t = {}) {
 let Ne = class {
   constructor(s, t = {}) {
     const { assumeSymmetric: e = !1 } = t;
-    if (s = rt$2.checkMatrix(s), !s.isSquare())
+    if (s = rt$3.checkMatrix(s), !s.isSquare())
       throw new Error("Matrix is not a square matrix");
     if (s.isEmpty())
       throw new Error("Matrix must be non-empty");
-    let n = s.columns, i = new _$2(n, n), o = new Float64Array(n), l = new Float64Array(n), h = s, a, u, c = !1;
+    let n = s.columns, i = new _$3(n, n), o = new Float64Array(n), l = new Float64Array(n), h = s, a, u, c = !1;
     if (e ? c = !0 : c = s.isSymmetric(), c) {
       for (a = 0; a < n; a++)
         for (u = 0; u < n; u++)
           i.set(a, u, h.get(a, u));
       Qs(n, l, o, i), Gs(n, l, o, i);
     } else {
-      let g = new _$2(n, n), d = new Float64Array(n);
+      let g = new _$3(n, n), d = new Float64Array(n);
       for (u = 0; u < n; u++)
         for (a = 0; a < n; a++)
           g.set(a, u, h.get(a, u));
@@ -3460,7 +3462,7 @@ let Ne = class {
     return this.V;
   }
   get diagonalMatrix() {
-    let s = this.n, t = this.e, e = this.d, n = new _$2(s, s), i, o;
+    let s = this.n, t = this.e, e = this.d, n = new _$3(s, s), i, o;
     for (i = 0; i < s; i++) {
       for (o = 0; o < s; o++)
         n.set(i, o, 0);
@@ -3530,10 +3532,10 @@ function Gs(r, s, t, e) {
       u++;
     if (u > a)
       do {
-        for (n = t[a], c = (t[a + 1] - n) / (2 * s[a]), g = ut$2(c, 1), c < 0 && (g = -g), t[a] = s[a] / (c + g), t[a + 1] = s[a] * (c + g), d = t[a + 1], i = n - t[a], o = a + 2; o < r; o++)
+        for (n = t[a], c = (t[a + 1] - n) / (2 * s[a]), g = ut$1(c, 1), c < 0 && (g = -g), t[a] = s[a] / (c + g), t[a + 1] = s[a] * (c + g), d = t[a + 1], i = n - t[a], o = a + 2; o < r; o++)
           t[o] -= i;
         for (R = R + i, c = t[u], w = 1, p = w, P = w, f = s[a + 1], M = 0, E = 0, o = u - 1; o >= a; o--)
-          for (P = p, p = w, E = M, n = w * s[o], i = w * c, g = ut$2(c, s[o]), s[o + 1] = M * g, M = s[o] / g, w = c / g, c = w * t[o] - M * n, t[o + 1] = i + M * (w * n + M * t[o]), h = 0; h < r; h++)
+          for (P = p, p = w, E = M, n = w * s[o], i = w * c, g = ut$1(c, s[o]), s[o + 1] = M * g, M = s[o] / g, w = c / g, c = w * t[o] - M * n, t[o + 1] = i + M * (w * n + M * t[o]), h = 0; h < r; h++)
             i = e.get(h, o + 1), e.set(h, o + 1, M * e.get(h, o) + w * i), e.set(h, o, w * e.get(h, o) - M * i);
         c = -M * E * P * f * s[a] / d, s[a] = M * c, t[a] = w * c;
       } while (Math.abs(s[a]) > L * v);
@@ -3649,12 +3651,12 @@ function Zs(r, s, t, e, n) {
               n.set(M, i, n.get(M, i) / L);
         }
       else if (g < 0)
-        for (R = i - 1, Math.abs(n.get(i, i - 1)) > Math.abs(n.get(i - 1, i)) ? (n.set(i - 1, i - 1, g / n.get(i, i - 1)), n.set(i - 1, i, -(n.get(i, i) - c) / n.get(i, i - 1))) : (F = Wt$1(0, -n.get(i - 1, i), n.get(i - 1, i - 1) - c, g), n.set(i - 1, i - 1, F[0]), n.set(i - 1, i, F[1])), n.set(i, i - 1, 0), n.set(i, i, 1), f = i - 2; f >= 0; f--) {
+        for (R = i - 1, Math.abs(n.get(i, i - 1)) > Math.abs(n.get(i - 1, i)) ? (n.set(i - 1, i - 1, g / n.get(i, i - 1)), n.set(i - 1, i, -(n.get(i, i) - c) / n.get(i, i - 1))) : (F = Wt(0, -n.get(i - 1, i), n.get(i - 1, i - 1) - c, g), n.set(i - 1, i - 1, F[0]), n.set(i - 1, i, F[1])), n.set(i, i - 1, 0), n.set(i, i, 1), f = i - 2; f >= 0; f--) {
           for (m = 0, b = 0, M = R; M <= i; M++)
             m = m + n.get(f, M) * n.get(M, i - 1), b = b + n.get(f, M) * n.get(M, i);
           if (S = n.get(f, f) - c, s[f] < 0)
             p = S, d = m, w = b;
-          else if (R = f, s[f] === 0 ? (F = Wt$1(-m, -b, S, g), n.set(f, i - 1, F[0]), n.set(f, i, F[1])) : (k = n.get(f, f + 1), D = n.get(f + 1, f), j = (t[f] - c) * (t[f] - c) + s[f] * s[f] - g * g, y = (t[f] - c) * 2 * g, j === 0 && y === 0 && (j = h * u * (Math.abs(S) + Math.abs(g) + Math.abs(k) + Math.abs(D) + Math.abs(p))), F = Wt$1(
+          else if (R = f, s[f] === 0 ? (F = Wt(-m, -b, S, g), n.set(f, i - 1, F[0]), n.set(f, i, F[1])) : (k = n.get(f, f + 1), D = n.get(f + 1, f), j = (t[f] - c) * (t[f] - c) + s[f] * s[f] - g * g, y = (t[f] - c) * 2 * g, j === 0 && y === 0 && (j = h * u * (Math.abs(S) + Math.abs(g) + Math.abs(k) + Math.abs(D) + Math.abs(p))), F = Wt(
             k * d - p * m + g * b,
             k * w - p * b - g * m,
             j,
@@ -3667,7 +3669,7 @@ function Zs(r, s, t, e, n) {
             f + 1,
             i,
             (-b - S * n.get(f, i) - g * n.get(f, i - 1)) / k
-          )) : (F = Wt$1(
+          )) : (F = Wt(
             -d - D * n.get(f, i - 1),
             -w - D * n.get(f, i),
             p,
@@ -3688,15 +3690,15 @@ function Zs(r, s, t, e, n) {
       }
   }
 }
-function Wt$1(r, s, t, e) {
+function Wt(r, s, t, e) {
   let n, i;
   return Math.abs(t) > Math.abs(e) ? (n = e / t, i = t + n * e, [(r + n * s) / i, (s - n * r) / i]) : (n = t / e, i = e + n * t, [(n * r + s) / i, (n * s - r) / i]);
 }
 class $e {
   constructor(s) {
-    if (s = rt$2.checkMatrix(s), !s.isSymmetric())
+    if (s = rt$3.checkMatrix(s), !s.isSymmetric())
       throw new Error("Matrix is not symmetric");
-    let t = s, e = t.rows, n = new _$2(e, e), i = !0, o, l, h;
+    let t = s, e = t.rows, n = new _$3(e, e), i = !0, o, l, h;
     for (l = 0; l < e; l++) {
       let a = 0;
       for (h = 0; h < l; h++) {
@@ -3714,7 +3716,7 @@ class $e {
     return this.positiveDefinite;
   }
   solve(s) {
-    s = rt$2.checkMatrix(s);
+    s = rt$3.checkMatrix(s);
     let t = this.L, e = t.rows;
     if (s.rows !== e)
       throw new Error("Matrix dimensions do not match");
@@ -3741,7 +3743,7 @@ class $e {
 }
 class Le {
   constructor(s, t = {}) {
-    s = rt$2.checkMatrix(s);
+    s = rt$3.checkMatrix(s);
     let { Y: e } = t;
     const {
       scaleScores: n = !1,
@@ -3750,7 +3752,7 @@ class Le {
     } = t;
     let l;
     if (e) {
-      if (st$3.isAnyArray(e) && typeof e[0] == "number" ? e = _$2.columnVector(e) : e = rt$2.checkMatrix(e), e.rows !== s.rows)
+      if (st$3.isAnyArray(e) && typeof e[0] == "number" ? e = _$3.columnVector(e) : e = rt$3.checkMatrix(e), e.rows !== s.rows)
         throw new Error("Y should have the same number of rows as X");
       l = e.getColumnVector(0);
     } else
@@ -3769,42 +3771,42 @@ class Le {
       this.w = c.transpose(), this.s = a.transpose().mmul(a).sqrt(), n ? this.t = a.clone().div(this.s.get(0, 0)) : this.t = a, this.xResidual = s.sub(a.mmul(c.transpose()));
   }
 }
-$$1.AbstractMatrix = V$2;
-$$1.CHO = $e;
-$$1.CholeskyDecomposition = $e;
-$$1.DistanceMatrix = te$1;
-$$1.EVD = Ne;
-var Js = $$1.EigenvalueDecomposition = Ne;
-$$1.LU = ee$1;
-$$1.LuDecomposition = ee$1;
-var De = $$1.Matrix = _$2;
-$$1.MatrixColumnSelectionView = qs;
-$$1.MatrixColumnView = Cs;
-$$1.MatrixFlipColumnView = Fs;
-$$1.MatrixFlipRowView = xs;
-$$1.MatrixRowSelectionView = Vs;
-$$1.MatrixRowView = As;
-$$1.MatrixSelectionView = Gt$1;
-$$1.MatrixSubView = Ns;
-$$1.MatrixTransposeView = $s;
-$$1.NIPALS = Le;
-$$1.Nipals = Le;
-$$1.QR = pe;
-$$1.QrDecomposition = pe;
-$$1.SVD = vt$1;
-$$1.SingularValueDecomposition = vt$1;
-$$1.SymmetricMatrix = pt$2;
-$$1.WrapperMatrix1D = Ae;
-$$1.WrapperMatrix2D = rt$2;
-$$1.correlation = Ws;
-$$1.covariance = Ys;
-var Re = $$1.default = _$2;
-$$1.determinant = Xt$2;
-$$1.inverse = Ds;
-$$1.linearDependencies = Bs;
-$$1.pseudoInverse = Us;
-$$1.solve = Ve;
-$$1.wrap = Ls;
+$.AbstractMatrix = V$1;
+$.CHO = $e;
+$.CholeskyDecomposition = $e;
+$.DistanceMatrix = te$1;
+$.EVD = Ne;
+var Js = $.EigenvalueDecomposition = Ne;
+$.LU = ee$1;
+$.LuDecomposition = ee$1;
+var De = $.Matrix = _$3;
+$.MatrixColumnSelectionView = qs;
+$.MatrixColumnView = Cs;
+$.MatrixFlipColumnView = Fs;
+$.MatrixFlipRowView = xs;
+$.MatrixRowSelectionView = Vs;
+$.MatrixRowView = As;
+$.MatrixSelectionView = Gt$1;
+$.MatrixSubView = Ns;
+$.MatrixTransposeView = $s;
+$.NIPALS = Le;
+$.Nipals = Le;
+$.QR = pe;
+$.QrDecomposition = pe;
+$.SVD = vt$2;
+$.SingularValueDecomposition = vt$2;
+$.SymmetricMatrix = pt$1;
+$.WrapperMatrix1D = Ae;
+$.WrapperMatrix2D = rt$3;
+$.correlation = Ws;
+$.covariance = Ys;
+var Re = $.default = _$3;
+$.determinant = Xt$1;
+$.inverse = Ds;
+$.linearDependencies = Bs;
+$.pseudoInverse = Us;
+$.solve = Ve;
+$.wrap = Ls;
 const Ks = Js, Hs = De;
 Re.Matrix && Re.Matrix;
 function qt$1(r, s, t) {
@@ -3842,7 +3844,7 @@ function ze(r, s, t, e) {
     return [f * d - n, f * p - n, f * P - n];
   }
 }
-function wn$1(r, s, t, e, n) {
+function wn$2(r, s, t, e, n) {
   if (n == 0)
     return ze(r, s, t, e);
   const i = e / n, o = t / n, l = s / n, h = r / n;
@@ -3864,11 +3866,11 @@ function wn$1(r, s, t, e, n) {
     }
   return [];
 }
-function gt$2(r, s) {
+function gt$1(r, s) {
   return s == 0 ? Math.abs(r) : Math.abs((r - s) / s);
 }
 function ve(r, s, t, e, n) {
-  const i = tn$2(r, s, t, e, n);
+  const i = tn$1(r, s, t, e, n);
   if (i !== null && i.length == 4) {
     let o = [];
     for (let l = 0; l < 2; l++) {
@@ -3879,13 +3881,13 @@ function ve(r, s, t, e, n) {
   }
   return null;
 }
-function tn$2(r, s, t, e, n) {
+function tn$1(r, s, t, e, n) {
   function i(x, N, A, O) {
-    const U = gt$2(x + A, r), T = gt$2(N + x * A + O, s), z = gt$2(N * A + x * O, t);
+    const U = gt$1(x + A, r), T = gt$1(N + x * A + O, s), z = gt$1(N * A + x * O, t);
     return U + T + z;
   }
   function o(x, N, A, O) {
-    return i(x, N, A, O) + gt$2(N * O, e);
+    return i(x, N, A, O) + gt$1(N * O, e);
   }
   const l = 9 * r * r - 24 * s, h = l >= 0 ? -2 * s / (3 * r + kt$1(Math.sqrt(l), r)) : -0.25 * r, a = r + 4 * h, u = s + 3 * h * (r + 2 * h), c = t + h * (2 * s + h * (3 * r + 4 * h)), g = e + h * (t + h * (s + h * (r + h)));
   let d = 0, w = 0;
@@ -3897,12 +3899,12 @@ function tn$2(r, s, t, e, n) {
     d = a * c - 4 * g - 1 / 3 * u * u, w = (a * c + 8 * g - 2 / 9 * u * u) * (1 / 3) * u - c * c - a * a * g;
   if (!isFinite(d) && isFinite(w))
     return null;
-  let P = en$1(d, w);
+  let P = en(d, w);
   n && (P *= p);
   const f = r * 0.5, M = 1 / 6 * s + 0.5 * P, E = t - r * M, R = 2 / 3 * s - P - f * f, v = 0.5 * E / R, L = 2 * (e - M * M) / E, S = 0.5 * E / L;
   let k = 0, D = 0, m = 0;
   for (let x = 0; x < 3; x++) {
-    const N = x == 1 ? S : R, A = x == 0 ? v : L, O = gt$2(N + f * f + 2 * M, s), U = gt$2(2 * (N * A + f * M), t), T = gt$2(N * A * A + M * M, e), z = O + U + T;
+    const N = x == 1 ? S : R, A = x == 0 ? v : L, O = gt$1(N + f * f + 2 * M, s), U = gt$1(2 * (N * A + f * M), t), T = gt$1(N * A * A + M * M, e), z = O + U + T;
     (x == 0 || z < m) && (k = N, D = A, m = z);
   }
   const b = k, j = D;
@@ -3945,7 +3947,7 @@ function tn$2(r, s, t, e, n) {
   }
   return [y, C, F, I];
 }
-function en$1(r, s) {
+function en(r, s) {
   const t = -0.3333333333333333 * r, e = 0.5 * s;
   let n, i = null;
   if ((Math.abs(t) >= 1e102 || Math.abs(e) >= 1e164) && (Math.abs(t) < Math.abs(e) ? i = 1 - t * (t / e) * (t / e) : i = Math.sign(t) * (e / t * (e / t) / t - 1)), i !== null && e == 0)
@@ -3993,7 +3995,7 @@ function sn$1(r, s = 1e-9) {
     (n, i) => Math.abs(e.imaginaryEigenvalues[i]) < s
   );
 }
-const nn$2 = (r, s, t) => [r[0] * (1 - t) + s[0] * t, r[1] * (1 - t) + s[1] * t];
+const nn$1 = (r, s, t) => [r[0] * (1 - t) + s[0] * t, r[1] * (1 - t) + s[1] * t];
 function rn$1(r) {
   const s = [];
   for (let t = 0; t < r.length - 1; t++)
@@ -4001,7 +4003,7 @@ function rn$1(r) {
   return s;
 }
 function de(r, s) {
-  const t = rn$1(r).map(([e, n]) => nn$2(e, n, s));
+  const t = rn$1(r).map(([e, n]) => nn$1(e, n, s));
   return r.length === 2 ? [t] : [...de(t, s), t];
 }
 let Et$1 = class Et extends xt$1 {
@@ -4034,7 +4036,7 @@ let Et$1 = class Et extends xt$1 {
     );
   }
   get alignedCurve() {
-    const t = [-this.firstPoint[0], -this.firstPoint[1]], e = Q$1(this.lastPoint, this.firstPoint), n = Math.atan2(e[1], e[0]), i = new et$3();
+    const t = [-this.firstPoint[0], -this.firstPoint[1]], e = Q$2(this.lastPoint, this.firstPoint), n = Math.atan2(e[1], e[0]), i = new et$3();
     return i.translate(t[0], t[1]), i.rotate(-n), this.transform(i);
   }
   getInflexionParameters() {
@@ -4065,13 +4067,13 @@ let Et$1 = class Et extends xt$1 {
     );
   }
   isSame(t) {
-    return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && Y$2(this.firstControlPoint, t.firstControlPoint) && Y$2(this.lastControlPoint, t.lastControlPoint);
+    return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) && Y$1(this.firstControlPoint, t.firstControlPoint) && Y$1(this.lastControlPoint, t.lastControlPoint);
   }
   distanceFrom(t) {
     const n = Ce((i) => Rt$1(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
-      J$1(this.firstPoint, t),
-      J$1(this.lastPoint, t)
+      J$2(this.firstPoint, t),
+      J$2(this.lastPoint, t)
     ) : Math.sqrt(n.fMin);
   }
   isOnSegment(t) {
@@ -4085,14 +4087,14 @@ let Et$1 = class Et extends xt$1 {
     }
   }
   gradientAt(t) {
-    const e = 1 - t, n = e * e, i = t * t, o = 3 * n, l = 6 * e * t, h = 3 * i, a = Q$1(this.firstControlPoint, this.firstPoint), u = Q$1(this.lastControlPoint, this.firstControlPoint), c = Q$1(this.lastPoint, this.lastControlPoint);
+    const e = 1 - t, n = e * e, i = t * t, o = 3 * n, l = 6 * e * t, h = 3 * i, a = Q$2(this.firstControlPoint, this.firstPoint), u = Q$2(this.lastControlPoint, this.firstControlPoint), c = Q$2(this.lastPoint, this.lastControlPoint);
     return [
       o * a[0] + l * u[0] + h * c[0],
       o * a[1] + l * u[1] + h * c[1]
     ];
   }
   secondDerivativeAt(t) {
-    const e = it$3(this.firstPoint, this.lastControlPoint), n = nt$2(this.firstControlPoint, 2), i = it$3(this.firstControlPoint, this.lastPoint), o = nt$2(this.lastControlPoint, 2), l = nt$2(Q$1(e, n), 6 * (1 - t)), h = nt$2(Q$1(i, o), 6 * t);
+    const e = it$3(this.firstPoint, this.lastControlPoint), n = nt$2(this.firstControlPoint, 2), i = it$3(this.firstControlPoint, this.lastPoint), o = nt$2(this.lastControlPoint, 2), l = nt$2(Q$2(e, n), 6 * (1 - t)), h = nt$2(Q$2(i, o), 6 * t);
     return it$3(l, h);
   }
   tangentAt(t) {
@@ -4100,10 +4102,10 @@ let Et$1 = class Et extends xt$1 {
     return H$1(this.gradientAt(e));
   }
   get tangentAtFirstPoint() {
-    return H$1(Q$1(this.firstControlPoint, this.firstPoint));
+    return H$1(Q$2(this.firstControlPoint, this.firstPoint));
   }
   get tangentAtLastPoint() {
-    return H$1(Q$1(this.lastPoint, this.lastControlPoint));
+    return H$1(Q$2(this.lastPoint, this.lastControlPoint));
   }
   normalAt(t) {
     const e = this.tangentAt(t);
@@ -4167,7 +4169,7 @@ let Et$1 = class Et extends xt$1 {
       return [this];
     Array.isArray(t[0]) ? e = t : e = [t];
     const n = e.map((o) => this.pointToParam(o)), i = new Map(
-      Kt$1([n, e])
+      Kt([n, e])
     );
     return this.splitAtParameters(n, i);
   }
@@ -4201,8 +4203,8 @@ let Et$1 = class Et extends xt$1 {
     return ze(e - t, n, i, o).filter((l) => l >= -this.precision && l <= 1 + this.precision);
   }
   pointToParam(t) {
-    if (Y$2(t, this.firstPoint, this.precision)) return 0;
-    if (Y$2(t, this.lastPoint, this.precision)) return 1;
+    if (Y$1(t, this.firstPoint, this.precision)) return 0;
+    if (Y$1(t, this.lastPoint, this.precision)) return 1;
     const e = this.paramsAtY(t[1]);
     if (e.length === 0)
       throw new Error("Point is not on the curve");
@@ -4212,7 +4214,7 @@ let Et$1 = class Et extends xt$1 {
     return i;
   }
 };
-let jt$2 = class jt extends xt$1 {
+let jt$1 = class jt extends xt$1 {
   constructor(t, e, n, i, o, l, h = !1, {
     ignoreChecks: a = !1,
     angleUnits: u = "deg"
@@ -4245,7 +4247,7 @@ let jt$2 = class jt extends xt$1 {
     if (this.tiltAngle = wt$2(
       c ? g : g + Math.PI / 2
     ), this.clockwise = h, !a) {
-      if (Y$2(t, e))
+      if (Y$1(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (!this.isPointOnEllipse(t))
         throw new Error(
@@ -4368,7 +4370,7 @@ let jt$2 = class jt extends xt$1 {
     return 1 - t >= -this.precision && t >= -this.precision;
   }
   isSame(t) {
-    return Y$2(this.center, t.center) && Math.abs(this.majorRadius - t.majorRadius) < this.precision && Math.abs(this.minorRadius - t.minorRadius) < this.precision && (Math.abs(this.tiltAngle - t.tiltAngle) < this.precision || Math.abs(Math.abs(this.tiltAngle - t.tiltAngle) - Math.PI) < this.precision) && (Y$2(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || Y$2(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
+    return Y$1(this.center, t.center) && Math.abs(this.majorRadius - t.majorRadius) < this.precision && Math.abs(this.minorRadius - t.minorRadius) < this.precision && (Math.abs(this.tiltAngle - t.tiltAngle) < this.precision || Math.abs(Math.abs(this.tiltAngle - t.tiltAngle) - Math.PI) < this.precision) && (Y$1(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || Y$1(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
   }
   pointTheta(t) {
     const e = this.ellipseReferenceFrameTransform.transform(t), n = Math.atan2(
@@ -4381,7 +4383,7 @@ let jt$2 = class jt extends xt$1 {
     return Zt(this.firstAngle, wt$2(t), this.clockwise) / this.deltaAngle;
   }
   isPointOnEllipse(t) {
-    const [e, n] = this.focals, i = J$1(t, e), o = J$1(t, n);
+    const [e, n] = this.focals, i = J$2(t, e), o = J$2(t, n);
     return Math.abs(2 * this.majorRadius - i - o) < this.precision;
   }
   isOnSegment(t) {
@@ -4389,7 +4391,7 @@ let jt$2 = class jt extends xt$1 {
   }
   distanceFrom(t) {
     let e;
-    if (Y$2(t, this.center) ? e = it$3(
+    if (Y$1(t, this.center) ? e = it$3(
       this.center,
       nt$2(tt$2(this.majorAxis), this.minorRadius)
     ) : e = this.reverseEllipseReferenceFrameTransform.transform(
@@ -4399,17 +4401,17 @@ let jt$2 = class jt extends xt$1 {
         this.ellipseReferenceFrameTransform.transform(t)
       )
     ), this.isValidParameter(this.thetaToParam(this.pointTheta(t))))
-      return J$1(t, e);
+      return J$2(t, e);
     if (Qe(t, this.majorAxis, this.center)) {
       const n = wt$2(
         2 * Math.PI - this.pointTheta(t)
       ), i = this.thetaToParam(n);
       if (this.isValidParameter(i))
-        return J$1(t, this.paramPoint(i));
+        return J$2(t, this.paramPoint(i));
     }
     return Math.min(
-      J$1(t, this.firstPoint),
-      J$1(t, this.lastPoint)
+      J$2(t, this.firstPoint),
+      J$2(t, this.lastPoint)
     );
   }
   get ellipseReferenceFrameTransform() {
@@ -4475,7 +4477,7 @@ let jt$2 = class jt extends xt$1 {
       return [this];
     Array.isArray(t[0]) ? e = t : e = [t];
     const i = [0, 1, ...e.map((h) => this.pointToParam(h))], o = new Map(
-      Kt$1([i, [this.firstPoint, this.lastPoint, ...e]])
+      Kt([i, [this.firstPoint, this.lastPoint, ...e]])
     );
     i.sort((h, a) => h - a);
     let l = null;
@@ -4498,7 +4500,7 @@ let jt$2 = class jt extends xt$1 {
     });
   }
 };
-function pn$1(r, s, t, e, n, i, o) {
+function pn$2(r, s, t, e, n, i, o) {
   const { center: l, rx: h, ry: a } = on$1(
     r,
     s,
@@ -4508,7 +4510,7 @@ function pn$1(r, s, t, e, n, i, o) {
     !i,
     o
   );
-  return Math.abs(h - a) < 1e-9 ? new ct$1(r, s, l, o) : new jt$2(r, s, l, h, a, n, o);
+  return Math.abs(h - a) < 1e-9 ? new ct$2(r, s, l, o) : new jt$1(r, s, l, h, a, n, o);
 }
 function on$1([r, s], [t, e], n, i, o, l, h) {
   if (n < 0 && (n = -n), i < 0 && (i = -i), n == 0 || i == 0)
@@ -4590,13 +4592,13 @@ let _t$1 = class _t extends xt$1 {
     );
   }
   isSame(t) {
-    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && Y$2(this.controlPoint, t.controlPoint);
+    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) && Y$1(this.controlPoint, t.controlPoint);
   }
   distanceFrom(t) {
     const n = Ce((i) => Rt$1(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
-      J$1(this.firstPoint, t),
-      J$1(this.lastPoint, t)
+      J$2(this.firstPoint, t),
+      J$2(this.lastPoint, t)
     ) : Math.sqrt(n.fMin);
   }
   isOnSegment(t) {
@@ -4618,7 +4620,7 @@ let _t$1 = class _t extends xt$1 {
   }
   secondDerivativeAt(t) {
     return nt$2(
-      Q$1(
+      Q$2(
         it$3(this.firstPoint, this.lastPoint),
         nt$2(this.controlPoint, 2)
       ),
@@ -4630,10 +4632,10 @@ let _t$1 = class _t extends xt$1 {
     return H$1(this.gradientAt(e));
   }
   get tangentAtFirstPoint() {
-    return H$1(Q$1(this.controlPoint, this.firstPoint));
+    return H$1(Q$2(this.controlPoint, this.firstPoint));
   }
   get tangentAtLastPoint() {
-    return H$1(Q$1(this.lastPoint, this.controlPoint));
+    return H$1(Q$2(this.lastPoint, this.controlPoint));
   }
   normalAt(t) {
     const e = this.tangentAt(t);
@@ -4688,7 +4690,7 @@ let _t$1 = class _t extends xt$1 {
       return [this];
     Array.isArray(t[0]) ? e = t : e = [t];
     const n = e.map((o) => this.pointToParam(o)), i = new Map(
-      Kt$1([n, e])
+      Kt([n, e])
     );
     return this.splitAtParameters(n, i);
   }
@@ -4733,15 +4735,15 @@ let _t$1 = class _t extends xt$1 {
   }
 };
 
-var tn$1 = Object.defineProperty;
-var nn$1 = (t, n, e) => n in t ? tn$1(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var C = (t, n, e) => nn$1(t, typeof n != "symbol" ? n + "" : n, e);
-function pn(t, n) {
-  const e = Q$1(n, t.firstPoint), s = Pe(e, t.V) / t.squareLength;
+var tn = Object.defineProperty;
+var nn = (t, n, e) => n in t ? tn(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
+var C = (t, n, e) => nn(t, typeof n != "symbol" ? n + "" : n, e);
+function pn$1(t, n) {
+  const e = Q$2(n, t.firstPoint), s = Pe(e, t.V) / t.squareLength;
   return t.paramPoint(s);
 }
-function J(t, n, e) {
-  const s = e || t.precision, i = pn(t, n.center), o = J$1(i, n.center);
+function J$1(t, n, e) {
+  const s = e || t.precision, i = pn$1(t, n.center), o = J$2(i, n.center);
   if (o > n.radius + s) return [];
   if (Math.abs(o - n.radius) < s) {
     const u = i;
@@ -4754,12 +4756,12 @@ function J(t, n, e) {
   const f = it$3(i, nt$2(c, -l));
   return t.isOnSegment(f) && n.isOnSegment(f) && r.push(f), r;
 }
-const dn = (t) => {
+const dn$1 = (t) => {
   const { firstPoint: n, lastPoint: e, center: s, clockwise: i } = t;
-  return new ct$1(e, n, s, i, {
+  return new ct$2(e, n, s, i, {
     ignoreChecks: !0
   });
-}, mn = (t, n) => {
+}, mn$1 = (t, n) => {
   if (t.isSame(n))
     return [t];
   const e = Te(
@@ -4775,11 +4777,11 @@ const dn = (t) => {
   if (e.length === 0) return [];
   if (e.length === 1) return [];
   if (e.length === 2)
-    return t.isSame(dn(n)) ? [] : [new ct$1(e[0], e[1], t.center, t.clockwise)];
+    return t.isSame(dn$1(n)) ? [] : [new ct$2(e[0], e[1], t.center, t.clockwise)];
   if (e.length === 3) {
-    const s = Y$2(e[0], n.lastPoint) || Y$2(e[0], n.firstPoint) ? 1 : 0;
+    const s = Y$1(e[0], n.lastPoint) || Y$1(e[0], n.firstPoint) ? 1 : 0;
     return [
-      new ct$1(
+      new ct$2(
         e[0 + s],
         e[1 + s],
         t.center,
@@ -4788,21 +4790,21 @@ const dn = (t) => {
     ];
   } else if (e.length === 4)
     return [
-      new ct$1(e[0], e[1], t.center, t.clockwise),
-      new ct$1(e[2], e[3], t.center, t.clockwise)
+      new ct$2(e[0], e[1], t.center, t.clockwise),
+      new ct$2(e[2], e[3], t.center, t.clockwise)
     ];
   throw new Error("Bug in the arc arc overlap algorithm");
 };
 function qt(t, n, e = !1, s) {
-  const i = s || t.precision, o = J$1(t.center, n.center), r = t.radius + n.radius;
+  const i = s || t.precision, o = J$2(t.center, n.center), r = t.radius + n.radius;
   if (o > r + i)
     return [];
   const l = Math.abs(t.radius - n.radius);
   if (o < l - i)
     return [];
   if (o < i)
-    return l > i ? [] : e ? mn(t, n) : [];
-  const c = H$1(Q$1(n.center, t.center)), a = o > r - i;
+    return l > i ? [] : e ? mn$1(t, n) : [];
+  const c = H$1(Q$2(n.center, t.center)), a = o > r - i;
   if (
     // circles are outside each other
     a || // circles are inside each other
@@ -4889,7 +4891,7 @@ const gn$1 = (t) => {
     tiltAngle: r,
     clockwise: l
   } = t;
-  return new jt$2(
+  return new jt$1(
     e,
     n,
     s,
@@ -4902,10 +4904,10 @@ const gn$1 = (t) => {
       angleUnits: "rad"
     }
   );
-}, Pn = (t, n) => {
+}, Pn$1 = (t, n) => {
   if (t.isSame(n))
     return [t];
-  const e = (i, o) => new jt$2(
+  const e = (i, o) => new jt$1(
     i,
     o,
     t.center,
@@ -4929,27 +4931,27 @@ const gn$1 = (t) => {
   if (s.length === 2)
     return t.isSame(gn$1(n)) ? [] : [e(s[0], s[1])];
   if (s.length === 3) {
-    const i = Y$2(s[0], n.lastPoint) || Y$2(s[0], n.firstPoint) ? 1 : 0;
+    const i = Y$1(s[0], n.lastPoint) || Y$1(s[0], n.firstPoint) ? 1 : 0;
     return [e(s[0 + i], s[1 + i])];
   } else if (s.length === 4)
     return [e(s[0], s[1]), e(s[2], s[3])];
   throw new Error("Bug in the ellipse arc ellipse arc overlap algorithm");
 };
-function wn(t, n, e = !1) {
+function wn$1(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
-  return Y$2(t.center, n.center) && Math.abs(t.majorRadius - n.majorRadius) < s && Math.abs(t.minorRadius - n.minorRadius) < s && (Math.abs(t.tiltAngle - n.tiltAngle) < s || Math.abs(Math.abs(t.tiltAngle - n.tiltAngle) - Math.PI) < s) ? e ? Pn(t, n) : [] : Dt(t, n).filter((r) => t.isOnSegment(r) && n.isOnSegment(r));
+  return Y$1(t.center, n.center) && Math.abs(t.majorRadius - n.majorRadius) < s && Math.abs(t.minorRadius - n.minorRadius) < s && (Math.abs(t.tiltAngle - n.tiltAngle) < s || Math.abs(Math.abs(t.tiltAngle - n.tiltAngle) - Math.PI) < s) ? e ? Pn$1(t, n) : [] : Dt(t, n).filter((r) => t.isOnSegment(r) && n.isOnSegment(r));
 }
-function gt$1(t, n) {
+function gt(t, n) {
   const [e, s] = t.firstPoint, [i, o] = t.lastPoint, r = new et$3().translate(-e, -s).rotate(-Math.atan2(o - s, i - e)), l = r.clone().inverse(), c = n.transform(r);
   return c.paramsAtY(0).map((a) => c.paramPoint(a)).map((a) => l.transform(a)).filter((a) => t.isOnSegment(a));
 }
-const xn = (t, n = 1e-9) => {
+const xn$1 = (t, n = 1e-9) => {
   let e = t;
   return Math.abs(t) < n && (e = 0), e.toFixed(-Math.log10(n));
 };
 function Rt(t, n = 1e-9) {
   return Array.from(
-    new Map(t.map((e) => [xn(e, n), e])).values()
+    new Map(t.map((e) => [xn$1(e, n), e])).values()
   );
 }
 const Sn$1 = (t, n) => {
@@ -4960,30 +4962,30 @@ function Pt$1(t, n) {
   const e = Math.max(t.precision, n.precision), s = Sn$1(t, n), i = sn$1(s, e).filter((o) => o >= -n.precision && o <= 1 + n.precision);
   return Rt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
 }
-const yn = (t, n) => {
+const yn$1 = (t, n) => {
   const [[e, s, i], [o, r, l]] = n.polynomialCoefficients, c = t.coefficients, a = c.x2, f = c.xy, u = c.y2, h = c.x, p = c.y, d = c.c, m = e * e, P = s * s, w = i * i, x = o * o, F = r * r, b = l * l, R = a * m + f * e * o + u * x + h * e + p * o + d, T = 2 * a * e * s + f * e * r + f * s * o + 2 * u * o * r + h * s + p * r, L = 2 * a * e * i + a * P + f * e * l + f * s * r + f * i * o + 2 * u * o * l + u * F + h * i + p * l, j = 2 * a * s * i + f * s * l + f * i * r + 2 * u * r * l, z = a * w + f * i * l + u * b;
   return [R, T, L, j, z];
 };
 function wt$1(t, n) {
-  const e = Math.max(t.precision, n.precision), s = yn(t, n), i = wn$1(...s).filter((o) => o >= -n.precision && o <= 1 + n.precision);
+  const e = Math.max(t.precision, n.precision), s = yn$1(t, n), i = wn$2(...s).filter((o) => o >= -n.precision && o <= 1 + n.precision);
   return Rt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
 }
 function E(t, { firstPoint: n, lastPoint: e }, s = 1e-9) {
-  const i = Q$1(e, n);
-  return Math.abs(i[0]) < s ? i[1] > 0 ? n[0] - t[0] : t[0] - n[0] : Math.abs(i[1]) < s ? i[0] > 0 ? t[1] - n[1] : n[1] - t[1] : St$1(i, Q$1(t, n)) / an$1(i);
+  const i = Q$2(e, n);
+  return Math.abs(i[0]) < s ? i[1] > 0 ? n[0] - t[0] : t[0] - n[0] : Math.abs(i[1]) < s ? i[0] > 0 ? t[1] - n[1] : n[1] - t[1] : St$2(i, Q$2(t, n)) / an$1(i);
 }
-class ct {
+let ct$1 = class ct {
   constructor(n, e, s, i) {
     this.firstPoint = n, this.lastPoint = e, this.negativeThickness = s, this.positiveThickness = i;
   }
   get width() {
     return this.positiveThickness - this.negativeThickness;
   }
-}
-const bn$1 = 3 / 4, Cn = 4 / 9;
+};
+const bn$1 = 3 / 4, Cn$1 = 4 / 9;
 function Mn$1(t) {
-  const n = E(t.firstControlPoint, t), e = E(t.lastControlPoint, t), s = n * e > 0 ? bn$1 : Cn;
-  return new ct(
+  const n = E(t.firstControlPoint, t), e = E(t.lastControlPoint, t), s = n * e > 0 ? bn$1 : Cn$1;
+  return new ct$1(
     t.firstPoint,
     t.lastPoint,
     s * Math.min(0, n, e),
@@ -4992,7 +4994,7 @@ function Mn$1(t) {
 }
 function An$1(t) {
   const n = E(t.controlPoint, t);
-  return new ct(
+  return new ct$1(
     t.firstPoint,
     t.lastPoint,
     Math.min(0, n / 2),
@@ -5006,8 +5008,8 @@ function In$1(t) {
     return An$1(t);
   throw new Error("Not implemented");
 }
-function En$1(t) {
-  const n = t.paramPoint(0.5), e = tt$2(Q$1(n, t.firstPoint)), s = it$3(n, e), i = {
+function En(t) {
+  const n = t.paramPoint(0.5), e = tt$2(Q$2(n, t.firstPoint)), s = it$3(n, e), i = {
     firstPoint: n,
     lastPoint: s
   }, o = [
@@ -5017,7 +5019,7 @@ function En$1(t) {
   return t instanceof Et$1 ? o.push(
     E(t.firstControlPoint, i),
     E(t.lastControlPoint, i)
-  ) : t instanceof _t$1 && o.push(E(t.controlPoint, i)), new ct(
+  ) : t instanceof _t$1 && o.push(E(t.controlPoint, i)), new ct$1(
     n,
     s,
     Math.min(...o),
@@ -5042,7 +5044,7 @@ function xt(t, n) {
   }
   return e;
 }
-let Y$1 = class Y {
+class Y {
   constructor(n, e) {
     this.from = n, this.to = e;
   }
@@ -5052,24 +5054,24 @@ let Y$1 = class Y {
   clipCurve(n) {
     return this.from === "start" ? this.to === "end" ? n : n.splitAtParameters([this.to])[0] : this.to === "end" ? n.splitAtParameters([this.from])[1] : n.splitAtParameters([this.from, this.to])[1];
   }
-};
+}
 function Fn(t, n) {
   if (t instanceof Et$1)
-    return new Bn([
+    return new Bn$1([
       E(t.firstPoint, n),
       E(t.firstControlPoint, n),
       E(t.lastControlPoint, n),
       E(t.lastPoint, n)
     ]);
   if (t instanceof _t$1)
-    return new vn$1([
+    return new vn([
       E(t.firstPoint, n),
       E(t.controlPoint, n),
       E(t.lastPoint, n)
     ]);
   throw new Error("Not implemented");
 }
-let vn$1 = class vn {
+class vn {
   constructor(n) {
     C(this, "topHull", []);
     C(this, "bottomHull", []);
@@ -5083,8 +5085,8 @@ let vn$1 = class vn {
   get endDistance() {
     return this.distances[2];
   }
-};
-class Bn {
+}
+let Bn$1 = class Bn {
   constructor(n) {
     C(this, "topHull", []);
     C(this, "bottomHull", []);
@@ -5105,8 +5107,8 @@ class Bn {
   get endDistance() {
     return this.distances[3];
   }
-}
-function St(t, n) {
+};
+function St$1(t, n) {
   const e = Fn(n, t), s = xt(
     e.topHull,
     t.negativeThickness
@@ -5115,43 +5117,43 @@ function St(t, n) {
     t.positiveThickness
   ), o = e.endDistance >= t.negativeThickness && e.endDistance <= t.positiveThickness;
   if (!s.length && !i.length)
-    return o ? new Y$1("start", "end") : null;
+    return o ? new Y("start", "end") : null;
   if (s.length === 1 && i.length === 1)
-    return new Y$1(s[0], i[0]);
+    return new Y(s[0], i[0]);
   if (s.length === 2 && i.length === 2)
     throw new Error(
       "Bug in the clipping algorithm, unexpected number of crossing points"
     );
   const r = s.length ? s : i;
-  return r.length === 2 ? new Y$1(r[0], r[1]) : o ? new Y$1(r[0], "end") : new Y$1("start", r[0]);
+  return r.length === 2 ? new Y(r[0], r[1]) : o ? new Y(r[0], "end") : new Y("start", r[0]);
 }
-function yt(t, n) {
-  const e = In$1(t), s = St(e, n);
+function yt$1(t, n) {
+  const e = In$1(t), s = St$1(e, n);
   if (!s)
     return null;
-  const i = En$1(t), o = St(
+  const i = En(t), o = St$1(
     i,
     n
   );
   return o ? s.size > o.size ? o.clipCurve(n) : s.clipCurve(n) : null;
 }
-const W$2 = (t) => t instanceof _t$1 ? It$1(Q$1(t.controlPoint, t.firstPoint)) + It$1(Q$1(t.controlPoint, t.lastPoint)) : It$1(Q$1(t.firstControlPoint, t.firstPoint)) + It$1(Q$1(t.lastControlPoint, t.firstControlPoint)) + It$1(Q$1(t.lastControlPoint, t.lastPoint));
+const W$2 = (t) => t instanceof _t$1 ? It$2(Q$2(t.controlPoint, t.firstPoint)) + It$2(Q$2(t.controlPoint, t.lastPoint)) : It$2(Q$2(t.firstControlPoint, t.firstPoint)) + It$2(Q$2(t.lastControlPoint, t.firstControlPoint)) + It$2(Q$2(t.lastControlPoint, t.lastPoint));
 function D$1(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
   const i = Math.max(e * e, Number.EPSILON * 10);
   let o = t, r = n, l = W$2(o), c = W$2(r);
   for (let a = 0; a < s; a++) {
-    const f = l > i ? yt(r, o) : o;
+    const f = l > i ? yt$1(r, o) : o;
     if (!f) return [];
-    const u = W$2(f), h = c > i ? yt(f, r) : r;
+    const u = W$2(f), h = c > i ? yt$1(f, r) : r;
     if (!h) return [];
     const p = W$2(h);
     if (u <= i && p <= i)
       return [
         f.boundingBox.intersection(h.boundingBox).center
       ];
-    if (Y$2(f.firstPoint, f.lastPoint) && h.isOnSegment(f.firstPoint))
+    if (Y$1(f.firstPoint, f.lastPoint) && h.isOnSegment(f.firstPoint))
       return [f.firstPoint];
-    if (Y$2(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
+    if (Y$1(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
       return [h.firstPoint];
     if (u > 0.8 * l && p > 0.8 * c)
       if (u / l > p / c) {
@@ -5189,7 +5191,7 @@ function D$1(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
   }
   throw new Error("Bézier clip: Maximum number of iterations reached");
 }
-function kn$1(t, n) {
+function kn(t, n) {
   const e = [];
   if ([
     [t.firstPoint, n],
@@ -5203,20 +5205,20 @@ function kn$1(t, n) {
   if (e.length === 2)
     return [t.splitAt(e)[1]];
   if (e.length === 3)
-    return Y$2(e[0], t.firstPoint) && Y$2(e[1], t.lastPoint) ? [t] : [n];
+    return Y$1(e[0], t.firstPoint) && Y$1(e[1], t.lastPoint) ? [t] : [n];
   if (e.length === 4)
     return [t];
 }
 function _n(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
   if (e) {
-    const i = kn$1(t, n);
+    const i = kn(t, n);
     if (i)
       return i;
   }
   return D$1(t, n, s);
 }
-function On(t, n) {
+function On$1(t, n) {
   const e = [];
   if ([
     [t.firstPoint, n],
@@ -5230,21 +5232,21 @@ function On(t, n) {
   if (e.length === 2)
     return [t.splitAt(e)[1]];
   if (e.length === 3)
-    return Y$2(e[0], t.firstPoint) && Y$2(e[1], t.lastPoint) ? [t] : [n];
+    return Y$1(e[0], t.firstPoint) && Y$1(e[1], t.lastPoint) ? [t] : [n];
   if (e.length === 4)
     return [t];
 }
-function Tn(t, n, e = !1) {
+function Tn$1(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
   if (e) {
-    const i = On(t, n);
+    const i = On$1(t, n);
     if (i)
       return i;
   }
   return D$1(t, n, s);
 }
 function ae(t, n, e) {
-  if (t instanceof at$1 && n instanceof at$1) {
+  if (t instanceof at$2 && n instanceof at$2) {
     const s = cn$1(
       t,
       n,
@@ -5253,42 +5255,42 @@ function ae(t, n, e) {
     );
     return s === null ? [] : [s];
   }
-  if (t instanceof at$1 && n instanceof ct$1)
-    return J(t, n, e);
-  if (t instanceof ct$1 && n instanceof at$1)
-    return J(n, t, e);
-  if (t instanceof ct$1 && n instanceof ct$1)
+  if (t instanceof at$2 && n instanceof ct$2)
+    return J$1(t, n, e);
+  if (t instanceof ct$2 && n instanceof at$2)
+    return J$1(n, t, e);
+  if (t instanceof ct$2 && n instanceof ct$2)
     return qt(t, n, !1, e);
   throw new Error("Not implemented");
 }
 function K$1(t, n, e) {
-  if (t instanceof at$1 && n instanceof at$1) {
+  if (t instanceof at$2 && n instanceof at$2) {
     const s = cn$1(
       t,
       n,
       !0,
       e
     );
-    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof at$1 ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
+    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof at$2 ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
   }
   if (!t.boundingBox.overlaps(n.boundingBox))
     return { intersections: [], overlaps: [], count: 0 };
-  if (t instanceof at$1 && n instanceof ct$1) {
-    const s = J(t, n, e);
+  if (t instanceof at$2 && n instanceof ct$2) {
+    const s = J$1(t, n, e);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof ct$1 && n instanceof at$1) {
-    const s = J(n, t, e);
+  if (t instanceof ct$2 && n instanceof at$2) {
+    const s = J$1(n, t, e);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof ct$1 && n instanceof ct$1) {
+  if (t instanceof ct$2 && n instanceof ct$2) {
     const s = qt(
       t,
       n,
       !0,
       e
     );
-    return s.length ? s[0] instanceof ct$1 ? {
+    return s.length ? s[0] instanceof ct$2 ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -5298,7 +5300,7 @@ function K$1(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof at$1 && n instanceof jt$2) {
+  if (t instanceof at$2 && n instanceof jt$1) {
     const s = et$2(
       t,
       n,
@@ -5306,7 +5308,7 @@ function K$1(t, n, e) {
     );
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof at$1 && t instanceof jt$2) {
+  if (n instanceof at$2 && t instanceof jt$1) {
     const s = et$2(
       n,
       t,
@@ -5314,21 +5316,21 @@ function K$1(t, n, e) {
     );
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof ct$1 && n instanceof jt$2) {
+  if (t instanceof ct$2 && n instanceof jt$1) {
     const s = mt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof ct$1 && t instanceof jt$2) {
+  if (n instanceof ct$2 && t instanceof jt$1) {
     const s = mt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof jt$2 && n instanceof jt$2) {
-    const s = wn(
+  if (t instanceof jt$1 && n instanceof jt$1) {
+    const s = wn$1(
       t,
       n,
       !0
     );
-    return s.length ? s[0] instanceof jt$2 ? {
+    return s.length ? s[0] instanceof jt$1 ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -5338,32 +5340,32 @@ function K$1(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof at$1 && (n instanceof Et$1 || n instanceof _t$1)) {
-    const s = gt$1(t, n);
+  if (t instanceof at$2 && (n instanceof Et$1 || n instanceof _t$1)) {
+    const s = gt(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof at$1 && (t instanceof Et$1 || t instanceof _t$1)) {
-    const s = gt$1(n, t);
+  if (n instanceof at$2 && (t instanceof Et$1 || t instanceof _t$1)) {
+    const s = gt(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((t instanceof ct$1 || t instanceof jt$2) && n instanceof _t$1) {
+  if ((t instanceof ct$2 || t instanceof jt$1) && n instanceof _t$1) {
     const s = wt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((n instanceof ct$1 || n instanceof jt$2) && t instanceof _t$1) {
+  if ((n instanceof ct$2 || n instanceof jt$1) && t instanceof _t$1) {
     const s = wt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((t instanceof ct$1 || t instanceof jt$2) && n instanceof Et$1) {
+  if ((t instanceof ct$2 || t instanceof jt$1) && n instanceof Et$1) {
     const s = Pt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((n instanceof ct$1 || n instanceof jt$2) && t instanceof Et$1) {
+  if ((n instanceof ct$2 || n instanceof jt$1) && t instanceof Et$1) {
     const s = Pt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (t instanceof _t$1 && n instanceof _t$1) {
-    const s = Tn(
+    const s = Tn$1(
       t,
       n
     );
@@ -5459,7 +5461,7 @@ class Nt extends Ze {
     return this.repr;
   }
 }
-function Ln$1(t, n = "Stroke") {
+function Ln(t, n = "Stroke") {
   Vt(t.length).forEach(
     ([e, s]) => {
       if (e === s) return;
@@ -5467,22 +5469,22 @@ function Ln$1(t, n = "Stroke") {
       if (r.count !== 0) {
         if (r.count === 1 && !r.overlaps.length) {
           const c = e - s, a = r.intersections[0];
-          if (c === 1 && Y$2(i.firstPoint, a, l) || c === -1 && Y$2(i.lastPoint, a, l) || c === t.length - 1 && Y$2(i.lastPoint, a, l) && Y$2(o.firstPoint, a, l) || -c === t.length - 1 && Y$2(i.firstPoint, a, l) && Y$2(o.lastPoint, a, l))
+          if (c === 1 && Y$1(i.firstPoint, a, l) || c === -1 && Y$1(i.lastPoint, a, l) || c === t.length - 1 && Y$1(i.lastPoint, a, l) && Y$1(o.firstPoint, a, l) || -c === t.length - 1 && Y$1(i.firstPoint, a, l) && Y$1(o.lastPoint, a, l))
             return;
         }
-        if (!(r.count === 2 && t.length === 2 && (Y$2(
+        if (!(r.count === 2 && t.length === 2 && (Y$1(
           i.firstPoint,
           r.intersections[0],
           l
-        ) && Y$2(
+        ) && Y$1(
           i.lastPoint,
           r.intersections[1],
           l
-        ) || Y$2(
+        ) || Y$1(
           i.firstPoint,
           r.intersections[1],
           l
-        ) && Y$2(
+        ) && Y$1(
           i.lastPoint,
           r.intersections[0],
           l
@@ -5499,23 +5501,23 @@ function Ln$1(t, n = "Stroke") {
 function Ut(t, n = "Stroke") {
   if (t.length === 0)
     throw new Error(`${n} must have at least one segment`);
-  Kt$1([t.slice(0, -1), t.slice(1)]).forEach(
+  Kt([t.slice(0, -1), t.slice(1)]).forEach(
     ([e, s]) => {
-      if (!Y$2(e.lastPoint, s.firstPoint))
+      if (!Y$1(e.lastPoint, s.firstPoint))
         throw new Error(
           `${n} segments must be connected, but ${e.info} and ${s.info} are not`
         );
     }
-  ), Ln$1(t, n);
+  ), Ln(t, n);
 }
 function bt$1(t, n) {
-  return !!(t instanceof at$1 && n instanceof at$1 && Ie(t.V, n.V) || t instanceof ct$1 && n instanceof ct$1 && Y$2(t.center, n.center) && t.radius - n.radius < t.precision);
+  return !!(t instanceof at$2 && n instanceof at$2 && Ie(t.V, n.V) || t instanceof ct$2 && n instanceof ct$2 && Y$1(t.center, n.center) && t.radius - n.radius < t.precision);
 }
-function Ct(t, n) {
-  if (t instanceof at$1 && n instanceof at$1)
-    return new at$1(t.firstPoint, n.lastPoint);
-  if (t instanceof ct$1 && n instanceof ct$1)
-    return new ct$1(
+function Ct$1(t, n) {
+  if (t instanceof at$2 && n instanceof at$2)
+    return new at$2(t.firstPoint, n.lastPoint);
+  if (t instanceof ct$2 && n instanceof ct$2)
+    return new ct$2(
       t.firstPoint,
       n.lastPoint,
       t.center,
@@ -5523,7 +5525,7 @@ function Ct(t, n) {
     );
   throw new Error("Not implemented");
 }
-function jt$1(t) {
+function jt(t) {
   let n = !1;
   const e = [];
   for (const s of t.segments) {
@@ -5532,19 +5534,19 @@ function jt$1(t) {
       continue;
     }
     const i = e[e.length - 1];
-    bt$1(i, s) ? (n = !0, e.pop(), e.push(Ct(i, s))) : e.push(s);
+    bt$1(i, s) ? (n = !0, e.pop(), e.push(Ct$1(i, s))) : e.push(s);
   }
-  if (Y$2(t.firstPoint, t.lastPoint) && bt$1(
+  if (Y$1(t.firstPoint, t.lastPoint) && bt$1(
     e[0],
     e[e.length - 1]
   )) {
     n = !0;
     const s = e.pop();
-    e[0] = Ct(s, e[0]);
+    e[0] = Ct$1(s, e[0]);
   }
   return n ? e : null;
 }
-let B$1 = class B extends Nt {
+let B$2 = class B extends Nt {
   constructor() {
     super(...arguments);
     C(this, "strokeType", "STRAND");
@@ -5560,12 +5562,12 @@ let B$1 = class B extends Nt {
     );
   }
   extend(e) {
-    if (!Y$2(this.lastPoint, e.firstPoint))
+    if (!Y$1(this.lastPoint, e.firstPoint))
       throw console.error(this.repr, e.repr), new Error("Cannot extend strand: connection point is not the same");
     return new B([...this.segments, ...e.segments]);
   }
   simplify() {
-    const e = jt$1(this);
+    const e = jt(this);
     return e ? new B(e, { ignoreChecks: !0 }) : this;
   }
   transform(e) {
@@ -5575,7 +5577,7 @@ let B$1 = class B extends Nt {
     );
   }
 };
-const zn = (t, n) => {
+const zn$1 = (t, n) => {
   const e = me(n, {
     V: [1, 0],
     firstPoint: t,
@@ -5591,19 +5593,19 @@ const zn = (t, n) => {
   }
   return 1;
 };
-let ut$1 = class ut {
+class ut {
   constructor(n) {
     C(this, "_count", 0);
     C(this, "segment");
     this.segment = n;
   }
   update(n, e = !1) {
-    !e && !this.segment.isOnSegment(n) || (Y$2(n, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : Y$2(n, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
+    !e && !this.segment.isOnSegment(n) || (Y$1(n, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : Y$1(n, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
   }
   get count() {
     return this._count;
   }
-};
+}
 const qn = (t, n) => {
   const e = n.precision, s = Math.abs(t[1] - n.center[1]);
   if (s > n.radius + e) return 0;
@@ -5614,15 +5616,15 @@ const qn = (t, n) => {
   if (l && n.center[0] < t[0]) return 0;
   const c = Math.sqrt(
     n.radius * n.radius - s * s
-  ), a = new ut$1(n);
+  ), a = new ut(n);
   return a.update([n.center[0] + c, t[1]]), l && a.update([n.center[0] - c, t[1]]), a.count;
-}, Dn = (t, n) => {
-  const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new at$1(t, [e, t[1]]), i = new ut$1(n);
+}, Dn$1 = (t, n) => {
+  const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new at$2(t, [e, t[1]]), i = new ut(n);
   return et$2(s, n).forEach((o) => {
     i.update(o, !0);
   }), i.count;
-}, Rn = (t, n) => {
-  const e = new ut$1(n);
+}, Rn$1 = (t, n) => {
+  const e = new ut(n);
   return n.paramsAtY(t[1]).map((s) => {
     try {
       return n.paramPoint(s);
@@ -5637,17 +5639,17 @@ const qn = (t, n) => {
   }), e.count;
 };
 function Vn(t, n) {
-  if (n instanceof at$1)
-    return zn(t, n);
-  if (n instanceof ct$1)
+  if (n instanceof at$2)
+    return zn$1(t, n);
+  if (n instanceof ct$2)
     return qn(t, n);
-  if (n instanceof jt$2)
-    return Dn(t, n);
+  if (n instanceof jt$1)
+    return Dn$1(t, n);
   if (n instanceof Et$1 || n instanceof _t$1)
-    return Rn(t, n);
+    return Rn$1(t, n);
   throw new Error("Not implemented");
 }
-let O$1 = class O extends Nt {
+class O extends Nt {
   constructor(e, { ignoreChecks: s = !1 } = {}) {
     super(e, { ignoreChecks: !0 });
     C(this, "strokeType", "LOOP");
@@ -5656,7 +5658,7 @@ let O$1 = class O extends Nt {
   }
   get clockwise() {
     if (this._clockwise === null) {
-      const e = this.segments.flatMap((i) => i instanceof at$1 ? [i.firstPoint] : [i.firstPoint, i.paramPoint(0.5)]), s = e.map((i, o) => {
+      const e = this.segments.flatMap((i) => i instanceof at$2 ? [i.firstPoint] : [i.firstPoint, i.paramPoint(0.5)]), s = e.map((i, o) => {
         const r = e[(o + 1) % e.length];
         return (r[0] - i[0]) * (r[1] + i[1]);
       }).reduce((i, o) => i + o, 0);
@@ -5684,18 +5686,18 @@ let O$1 = class O extends Nt {
     return this.onStroke(e) || !this.boundingBox.contains(e) ? !1 : this.segments.reduce((i, o) => i + Vn(e, o), 0) % 2 === 1;
   }
   simplify() {
-    const e = jt$1(this);
+    const e = jt(this);
     return e ? new O(e, { ignoreChecks: !0 }) : this;
   }
-};
+}
 function Nn(t) {
-  if (Ut(t, "Loop"), !Y$2(t[0].firstPoint, t[t.length - 1].lastPoint))
+  if (Ut(t, "Loop"), !Y$1(t[0].firstPoint, t[t.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
 const Un = [
-  at$1,
-  ct$1,
-  jt$2,
+  at$2,
+  ct$2,
+  jt$1,
   _t$1,
   Et$1
 ];
@@ -5703,13 +5705,13 @@ function jn(t) {
   return Un.some((n) => t instanceof n);
 }
 function Ht(t) {
-  if (t instanceof at$1)
+  if (t instanceof at$2)
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
       lastPoint: t.lastPoint
     };
-  if (t instanceof ct$1)
+  if (t instanceof ct$2)
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -5717,7 +5719,7 @@ function Ht(t) {
       center: t.center,
       clockwise: t.clockwise
     };
-  if (t instanceof jt$2)
+  if (t instanceof jt$1)
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -5764,18 +5766,18 @@ function Hn(t) {
     figures: t.figures.map($t)
   };
 }
-function Mt(t) {
-  if (t instanceof _$1)
+function Mt$1(t) {
+  if (t instanceof _$2)
     return Hn(t);
-  if (t instanceof v$2)
+  if (t instanceof v$1)
     return $t(t);
-  if (t instanceof O$1)
+  if (t instanceof O)
     return it$2(t);
   if (jn(t))
     return Ht(t);
   throw new Error("Unknown shape type");
 }
-class $n {
+let $n$1 = class $n {
   constructor() {
     this.ids = [], this.values = [], this.length = 0;
   }
@@ -5820,9 +5822,9 @@ class $n {
   shrink() {
     this.ids.length = this.values.length = this.length;
   }
-}
-const At = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], nt$1 = 3;
-class at {
+};
+const At$1 = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], nt$1 = 3;
+let at$1 = class at {
   /**
    * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
    * @param {ArrayBuffer | SharedArrayBuffer} data
@@ -5840,7 +5842,7 @@ class at {
     const o = i >> 4;
     if (o !== nt$1)
       throw new Error(`Got v${o} data when expected v${nt$1}.`);
-    const r = At[i & 15];
+    const r = At$1[i & 15];
     if (!r)
       throw new Error("Unrecognized array type.");
     const [l] = new Uint16Array(n, e + 2, 1), [c] = new Uint32Array(n, e + 4, 1);
@@ -5865,10 +5867,10 @@ class at {
       l = Math.ceil(l / this.nodeSize), c += l, this._levelBounds.push(c * 4);
     while (l !== 1);
     this.ArrayType = s, this.IndexArrayType = c < 16384 ? Uint16Array : Uint32Array;
-    const a = At.indexOf(this.ArrayType), f = c * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    const a = At$1.indexOf(this.ArrayType), f = c * 4 * this.ArrayType.BYTES_PER_ELEMENT;
     if (a < 0)
       throw new Error(`Unexpected typed array class: ${s}.`);
-    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, r + 8, c * 4), this._indices = new this.IndexArrayType(this.data, r + 8 + f, c), this._pos = c * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + f + c * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, c * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, c), this._pos = 0, this.minX = 1 / 0, this.minY = 1 / 0, this.maxX = -1 / 0, this.maxY = -1 / 0, new Uint8Array(this.data, 0, 2).set([251, (nt$1 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new $n();
+    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, r + 8, c * 4), this._indices = new this.IndexArrayType(this.data, r + 8 + f, c), this._pos = c * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + f + c * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, c * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, c), this._pos = 0, this.minX = 1 / 0, this.minY = 1 / 0, this.maxX = -1 / 0, this.maxY = -1 / 0, new Uint8Array(this.data, 0, 2).set([251, (nt$1 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new $n$1();
   }
   /**
    * Add a given rectangle to the index.
@@ -5896,7 +5898,7 @@ class at {
       const c = n[l++], a = n[l++], f = n[l++], u = n[l++], h = Math.floor(o * ((c + f) / 2 - this.minX) / e), p = Math.floor(o * ((a + u) / 2 - this.minY) / s);
       i[r] = Xn(h, p);
     }
-    ot$1(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
+    ot$2(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
     for (let r = 0, l = 0; r < this._levelBounds.length - 1; r++) {
       const c = this._levelBounds[r];
       for (; l < c; ) {
@@ -5950,7 +5952,7 @@ class at {
     t: for (; r !== void 0; ) {
       const f = Math.min(r + this.nodeSize * 4, Et(r, this._levelBounds));
       for (let u = r; u < f; u += 4) {
-        const h = this._indices[u >> 2] | 0, p = It(n, this._boxes[u], this._boxes[u + 2]), d = It(e, this._boxes[u + 1], this._boxes[u + 3]), m = p * p + d * d;
+        const h = this._indices[u >> 2] | 0, p = It$1(n, this._boxes[u], this._boxes[u + 2]), d = It$1(e, this._boxes[u + 1], this._boxes[u + 3]), m = p * p + d * d;
         m > a || (r >= this.numItems * 4 ? l.push(h << 1, m) : (o === void 0 || o(h)) && l.push((h << 1) + 1, m));
       }
       for (; l.length && l.peek() & 1; )
@@ -5959,8 +5961,8 @@ class at {
     }
     return l.clear(), c;
   }
-}
-function It(t, n, e) {
+};
+function It$1(t, n, e) {
   return t < n ? n - t : t <= e ? 0 : t - e;
 }
 function Et(t, n) {
@@ -5971,7 +5973,7 @@ function Et(t, n) {
   }
   return n[e];
 }
-function ot$1(t, n, e, s, i, o) {
+function ot$2(t, n, e, s, i, o) {
   if (Math.floor(s / o) >= Math.floor(i / o)) return;
   const r = t[s + i >> 1];
   let l = s - 1, c = i + 1;
@@ -5985,7 +5987,7 @@ function ot$1(t, n, e, s, i, o) {
     if (l >= c) break;
     Yn(t, n, e, l, c);
   }
-  ot$1(t, n, e, s, c, o), ot$1(t, n, e, c + 1, i, o);
+  ot$2(t, n, e, s, c, o), ot$2(t, n, e, c + 1, i, o);
 }
 function Yn(t, n, e, s, i) {
   const o = t[s];
@@ -6001,10 +6003,10 @@ function Xn(t, n) {
   let f = t ^ n, u = s | 65535 ^ (f | e);
   return f = (f | f << 8) & 16711935, f = (f | f << 4) & 252645135, f = (f | f << 2) & 858993459, f = (f | f << 1) & 1431655765, u = (u | u << 8) & 16711935, u = (u | u << 4) & 252645135, u = (u | u << 2) & 858993459, u = (u | u << 1) & 1431655765, (u << 1 | f) >>> 0;
 }
-function Yt$1(t, n = 1e-7) {
+function Yt(t, n = 1e-7) {
   if (t.length === 0) return [];
   if (t.length === 1) return [t];
-  const e = new at(t.length);
+  const e = new at$1(t.length);
   t.forEach((o) => {
     const [r, l] = o.firstPoint;
     e.add(r - n, l - n, r + n, l + n);
@@ -6038,7 +6040,7 @@ function Yt$1(t, n = 1e-7) {
     }
   }), s;
 }
-let v$2 = class v extends Ze {
+let v$1 = class v extends Ze {
   constructor(e, s = [], { ignoreChecks: i = !1 } = {}) {
     super();
     C(this, "contour");
@@ -6076,7 +6078,7 @@ let v$2 = class v extends Ze {
   }
   overlappingStrands(e) {
     const s = e instanceof v ? e.allLoops : [e], i = this.allLoops.flatMap((o) => s.flatMap((r) => o.overlappingSegments(r)));
-    return Yt$1(i).map((o) => new B$1(o));
+    return Yt(i).map((o) => new B$2(o));
   }
 };
 function Gn(t, n = []) {
@@ -6090,7 +6092,7 @@ function Gn(t, n = []) {
     throw new Error("Holes must be inside the contour");
   for (const [e, s] of st$2(n))
     if (e.contains(s.firstPoint))
-      throw console.error(Mt(e), Mt(s)), new Error("Holes must not be inside other holes");
+      throw console.error(Mt$1(e), Mt$1(s)), new Error("Holes must not be inside other holes");
 }
 const Qn = (t) => {
   const n = t.map((i, o) => t.slice(o + 1).map((r, l) => [l + o + 1, r]).filter(([, r]) => i.boundingBox.overlaps(r.boundingBox)).map(([r]) => r)), e = [], s = Array(n.length);
@@ -6100,32 +6102,32 @@ const Qn = (t) => {
       s[l] = r;
     });
   }), e;
-}, Xt$1 = (t) => t.map((n, e) => {
+}, Xt = (t) => t.map((n, e) => {
   const i = n.segments[0].midPoint, o = t.filter((r, l) => e === l ? !1 : r.contains(i));
   return {
     loop: n,
     isIn: o
   };
-}), Wn = (t, n) => t.flatMap(({ loop: e }) => ft(
+}), Wn = (t, n) => t.flatMap(({ loop: e }) => ft$1(
   n.filter(
     ({ loop: s, isIn: i }) => s === e || i.indexOf(e) !== -1
   )
 )), Jn = (t, n) => {
-  const e = n.filter(({ isIn: i }) => i.length <= 1), s = ft(
-    Xt$1(t.map(({ loop: i }) => i))
+  const e = n.filter(({ isIn: i }) => i.length <= 1), s = ft$1(
+    Xt(t.map(({ loop: i }) => i))
   );
   return [e, ...s];
-}, ft = (t) => {
+}, ft$1 = (t) => {
   if (!t.length) return [];
   const n = t.filter(({ isIn: s }) => !s.length), e = t.filter(({ isIn: s }) => s.length > 1);
   return n.length === 1 && e.length === 0 ? [t] : n.length > 1 ? Wn(n, t) : Jn(e, t);
 };
 function X$1(t) {
-  return Qn(t).map(Xt$1).flatMap(ft).map((e) => {
-    if (e.length === 1) return new v$2(e[0].loop);
+  return Qn(t).map(Xt).flatMap(ft$1).map((e) => {
+    if (e.length === 1) return new v$1(e[0].loop);
     e.sort((o, r) => o.isIn.length - r.isIn.length);
     const [s, ...i] = e.map(({ loop: o }) => o);
-    return new v$2(s, i);
+    return new v$1(s, i);
   });
 }
 function Kn(t, n) {
@@ -6136,18 +6138,18 @@ function Kn(t, n) {
   return e;
 }
 function* Ft(t, n, e) {
-  const s = (r) => n.some((l) => Y$2(l, r.lastPoint)), i = (r) => e.some((l) => r.isSame(l));
+  const s = (r) => n.some((l) => Y$1(l, r.lastPoint)), i = (r) => e.some((l) => r.isSame(l));
   let o = [];
   for (const r of t)
-    s(r) ? (o.push(r), yield new B$1(o, { ignoreChecks: !0 }), o = []) : i(r) ? (o.length && (yield new B$1(o, { ignoreChecks: !0 }), o = []), yield new B$1([r], { ignoreChecks: !0 })) : o.push(r);
-  o.length && (yield new B$1(o, { ignoreChecks: !0 }));
+    s(r) ? (o.push(r), yield new B$2(o, { ignoreChecks: !0 }), o = []) : i(r) ? (o.length && (yield new B$2(o, { ignoreChecks: !0 }), o = []), yield new B$2([r], { ignoreChecks: !0 })) : o.push(r);
+  o.length && (yield new B$2(o, { ignoreChecks: !0 }));
 }
-const vt = (t, n) => {
-  const e = t.findIndex((o) => Y$2(n, o.firstPoint)), s = t.slice(0, e);
+const vt$1 = (t, n) => {
+  const e = t.findIndex((o) => Y$1(n, o.firstPoint)), s = t.slice(0, e);
   return t.slice(e).concat(s);
 }, Bt = (t, n) => {
   let e = t;
-  const s = (l) => Y$2(l.firstPoint, n.firstPoint) && Y$2(l.lastPoint, n.lastPoint);
+  const s = (l) => Y$1(l.firstPoint, n.firstPoint) && Y$1(l.lastPoint, n.lastPoint);
   let i = t.findIndex(s);
   if (i === -1) {
     const l = t.map((c) => c.reverse());
@@ -6163,7 +6165,7 @@ const vt = (t, n) => {
 };
 function Zn(t, n, e) {
   return t.filter((s) => {
-    const i = n.filter((l) => Y$2(l.firstPoint, s) || Y$2(l.lastPoint, s));
+    const i = n.filter((l) => Y$1(l.firstPoint, s) || Y$1(l.lastPoint, s));
     if (i.length % 2)
       throw new Error("Bug in the intersection algo on non crossing point");
     const o = i.map((l) => e.contains(l.midPoint));
@@ -6189,7 +6191,7 @@ function te(t, n, e) {
     });
   }), s = Te(s, e), !s.length || s.length === 1) return null;
   const l = ([h, p]) => p.length ? h.splitAt(p) : [h];
-  let c = Kt$1([t.segments, o]).flatMap(l), a = Kt$1([n.segments, r]).flatMap(l);
+  let c = Kt([t.segments, o]).flatMap(l), a = Kt([n.segments, r]).flatMap(l);
   if (s = Zn(
     s,
     c,
@@ -6206,7 +6208,7 @@ function te(t, n, e) {
     );
   } else {
     const h = s[0];
-    c = vt(c, h), a = vt(a, h);
+    c = vt$1(c, h), a = vt$1(a, h);
   }
   let f = Array.from(
     Ft(
@@ -6221,24 +6223,24 @@ function te(t, n, e) {
       i
     )
   );
-  return (!Y$2(
+  return (!Y$1(
     u[0].lastPoint,
     f[0].lastPoint
-  ) || i.length > 0 && u[0].segmentsCount !== 1) && (u = u.map((h) => h.reverse()).reverse(), Y$2(u[0].lastPoint, f[0].lastPoint) || (f = f.map((h) => h.reverse()).reverse())), Kt$1([f, u]).map(([h, p]) => h.segmentsCount === 1 && i.some((d) => h.segments[0].isSame(d)) ? [h, "same"] : [h, p]);
+  ) || i.length > 0 && u[0].segmentsCount !== 1) && (u = u.map((h) => h.reverse()).reverse(), Y$1(u[0].lastPoint, f[0].lastPoint) || (f = f.map((h) => h.reverse()).reverse())), Kt([f, u]).map(([h, p]) => h.segmentsCount === 1 && i.some((d) => h.segments[0].isSame(d)) ? [h, "same"] : [h, p]);
 }
 function kt(t) {
   let n = t[0];
   for (const e of t.slice(1))
     n = n.extend(e);
-  if (!Y$2(n.firstPoint, n.lastPoint))
+  if (!Y$1(n.firstPoint, n.lastPoint))
     throw console.error(
       Z$1(n.firstPoint),
       Z$1(n.lastPoint)
     ), new Error("Bug in the intersection algo on non closing strand");
-  return new O$1(n.segments);
+  return new O(n.segments);
 }
 function ne(t, n) {
-  const e = Kt$1([
+  const e = Kt([
     n.slice(0, -1),
     n.slice(1)
   ]).map(([i, o]) => kt(t.slice(i, o)));
@@ -6252,21 +6254,21 @@ function ee(t) {
   const n = t.map((i) => i.firstPoint);
   let e = t.map((i) => i.lastPoint);
   e = e.slice(-1).concat(e.slice(0, -1));
-  const s = Kt$1([n, e]).flatMap(
-    ([i, o], r) => Y$2(i, o) ? [] : r
+  const s = Kt([n, e]).flatMap(
+    ([i, o], r) => Y$1(i, o) ? [] : r
   );
   try {
     return ne(t, s);
   } catch {
-    return Yt$1(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => Y$2(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new O$1(o));
+    return Yt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => Y$1(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new O(o));
   }
 }
 const _t = (t, n) => {
   if (t.length === 0) return [n];
   const e = t.at(-1);
-  return Y$2(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : Y$2(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
-}, se = (t, n) => t.length === 0 ? [n] : Y$2(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
-function ht$1(t, n, {
+  return Y$1(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : Y$1(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
+}, se = (t, n) => t.length === 0 ? [n] : Y$1(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
+function ht(t, n, {
   firstInside: e,
   secondInside: s
 }) {
@@ -6298,19 +6300,19 @@ function ht$1(t, n, {
   return ee(l);
 }
 const ie = (t, n) => {
-  const e = ht$1(t, n, {
+  const e = ht(t, n, {
     firstInside: "remove",
     secondInside: "remove"
   });
   return Array.isArray(e) ? e : e.identical ? [t] : e.firstCurveInSecond ? [n] : e.secondCurveInFirst ? [t] : [t, n];
 }, Z = (t, n) => {
-  const e = ht$1(t, n, {
+  const e = ht(t, n, {
     firstInside: "remove",
     secondInside: "keep"
   });
   return Array.isArray(e) ? e : e.identical ? [] : e.firstCurveInSecond ? [] : e.secondCurveInFirst ? [t, n] : [t];
-}, pt$1 = (t, n) => {
-  const e = ht$1(t, n, {
+}, pt = (t, n) => {
+  const e = ht(t, n, {
     firstInside: "keep",
     secondInside: "keep"
   });
@@ -6328,13 +6330,13 @@ function oe(t) {
         (d) => f.some((m) => d.intersects(m))
       )) return;
       let p;
-      c.length > 1 || f.length > 1 ? p = G$1(c, f) : p = Gt(c[0], f[0]), o.fusedWith.add(a), o.current = p, u || n.set(a, o);
+      c.length > 1 || f.length > 1 ? p = G(c, f) : p = Gt(c[0], f[0]), o.fusedWith.add(a), o.current = p, u || n.set(a, o);
     });
   }), e.flatMap(({ current: s }) => s);
 }
 function Gt(t, n) {
   const e = ie(t.contour, n.contour), s = n.holes.flatMap((r) => Z(r, t.contour)), i = t.holes.flatMap((r) => Z(r, n.contour)), o = Kn(t.holes, n.holes).flatMap(
-    ([r, l]) => pt$1(r, l)
+    ([r, l]) => pt(r, l)
   );
   return X$1([
     ...e,
@@ -6348,13 +6350,13 @@ function tt$1(t, n) {
     return X$1(Z(t.contour, n.contour));
   if (t.isFull) {
     const s = Z(t.contour, n.contour), i = n.holes.flatMap(
-      (o) => pt$1(o, t.contour)
+      (o) => pt(o, t.contour)
     );
     return X$1([...s, ...i]);
   } else if (n.isFull && !t.contour.intersects(n.contour))
     if (t.contour.contains(n.contour.firstPoint)) {
-      const s = G$1(
-        t.holes.map((i) => new v$2(i)),
+      const s = G(
+        t.holes.map((i) => new v$1(i)),
         [n]
       );
       return X$1([
@@ -6363,52 +6365,52 @@ function tt$1(t, n) {
       ]);
     } else
       return [t];
-  let e = tt$1(new v$2(t.contour), n);
+  let e = tt$1(new v$1(t.contour), n);
   return t.holes.forEach((s) => {
-    e = e.flatMap((i) => tt$1(i, new v$2(s)));
+    e = e.flatMap((i) => tt$1(i, new v$1(s)));
   }), e;
 }
 function re(t, n) {
-  const e = pt$1(t.contour, n.contour);
+  const e = pt(t.contour, n.contour);
   if (!e.length) return [];
   let s = X$1(e);
-  return s = Q(
+  return s = Q$1(
     s,
-    t.holes.map((i) => new v$2(i))
-  ), Q(
+    t.holes.map((i) => new v$1(i))
+  ), Q$1(
     s,
-    n.holes.map((i) => new v$2(i))
+    n.holes.map((i) => new v$1(i))
   );
 }
-function G$1(t, n) {
+function G(t, n) {
   if (!t.length) return n;
   if (!n.length) return t;
   if (t.length === 1 && n.length > 1 || n.length === 1 && t.length > 1)
     return oe([...t, ...n]);
   if (t.length > 1 && n.length > 1) {
-    let e = G$1([t[0]], n);
+    let e = G([t[0]], n);
     return t.slice(1).forEach((s) => {
-      e = G$1([s], e);
+      e = G([s], e);
     }), e;
   }
   return t.length === 1 && n.length === 1 ? Gt(t[0], n[0]) : [];
 }
-function Q(t, n) {
+function Q$1(t, n) {
   if (!t.length) return [];
   if (!n.length) return t;
   if (t.length === 1 && n.length === 1)
     return tt$1(t[0], n[0]);
   if (t.length > 1)
-    return t.flatMap((s) => Q([s], n));
+    return t.flatMap((s) => Q$1([s], n));
   let e = tt$1(t[0], n[0]);
   return n.slice(1).forEach((s) => {
-    e = Q(e, [s]);
+    e = Q$1(e, [s]);
   }), e;
 }
-function rt$1(t, n) {
-  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? re(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => rt$1([e], n)) : n.flatMap((e) => rt$1(t, [e]));
+function rt$2(t, n) {
+  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? re(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => rt$2([e], n)) : n.flatMap((e) => rt$2(t, [e]));
 }
-let _$1 = class _ extends Ze {
+let _$2 = class _ extends Ze {
   constructor(e = [], { ignoreChecks: s = !1 } = {}) {
     super();
     C(this, "figures");
@@ -6448,13 +6450,13 @@ let _$1 = class _ extends Ze {
     ) : s.overlappingStrands(e));
   }
   fuse(e) {
-    return new _(G$1(this.figures, e.figures));
+    return new _(G(this.figures, e.figures));
   }
   cut(e) {
-    return new _(Q(this.figures, e.figures));
+    return new _(Q$1(this.figures, e.figures));
   }
   intersect(e) {
-    return new _(rt$1(this.figures, e.figures));
+    return new _(rt$2(this.figures, e.figures));
   }
 };
 function le(t) {
@@ -6466,11 +6468,11 @@ function le(t) {
 var W$1 = Object.defineProperty;
 var q$1 = (e, t, n) => t in e ? W$1(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
 var m = (e, t, n) => q$1(e, typeof t != "symbol" ? t + "" : t, n);
-const B = (e, t, n) => {
-  const r = St$1(e.V, t.V), i = e.precision * t.precision;
+const B$1 = (e, t, n) => {
+  const r = St$2(e.V, t.V), i = e.precision * t.precision;
   if (r * r < i)
     return "parallel";
-  const s = Q$1(t.firstPoint, e.firstPoint), o = St$1(s, t.V) / r;
+  const s = Q$2(t.firstPoint, e.firstPoint), o = St$2(s, t.V) / r;
   return it$3(e.firstPoint, nt$2(e.V, o));
 };
 class S {
@@ -6479,22 +6481,22 @@ class S {
   }
 }
 function y(e, t) {
-  if (e instanceof at$1)
+  if (e instanceof at$2)
     return et$1(e, t);
-  if (e instanceof ct$1)
-    return rt(e, t);
+  if (e instanceof ct$2)
+    return rt$1(e, t);
   if (e instanceof _t$1 || e instanceof Et$1)
     return it$1(e, t);
   throw new Error("Not implemented");
 }
 function et$1(e, t) {
   const { firstPoint: n, lastPoint: r } = e, i = e.normalVector;
-  return new at$1(
+  return new at$2(
     it$3(n, nt$2(i, t)),
     it$3(r, nt$2(i, t))
   );
 }
-function rt(e, t) {
+function rt$1(e, t) {
   const n = it$3(
     e.firstPoint,
     nt$2(tt$2(e.tangentAtFirstPoint), t)
@@ -6502,17 +6504,17 @@ function rt(e, t) {
     e.lastPoint,
     nt$2(tt$2(e.tangentAtLastPoint), t)
   ), i = t * (e.clockwise ? 1 : -1);
-  return e.radius + i < e.precision ? new S(n, r) : new ct$1(n, r, e.center, e.clockwise);
+  return e.radius + i < e.precision ? new S(n, r) : new ct$2(n, r, e.center, e.clockwise);
 }
 function b(e, t, n, r, i) {
-  const s = B(
+  const s = B$1(
     {
       V: n,
       firstPoint: r,
       precision: i
     },
     {
-      V: Q$1(t, e),
+      V: Q$2(t, e),
       firstPoint: e,
       precision: i
     }
@@ -6524,7 +6526,7 @@ function b(e, t, n, r, i) {
   return s;
 }
 function it$1(e, t) {
-  const { firstPoint: n, lastPoint: r, normalAtFirstPoint: i, normalAtLastPoint: s } = e, o = B(
+  const { firstPoint: n, lastPoint: r, normalAtFirstPoint: i, normalAtLastPoint: s } = e, o = B$1(
     { V: i, firstPoint: n, precision: e.precision },
     { V: s, firstPoint: r, precision: e.precision }
   ), a = it$3(
@@ -6536,9 +6538,9 @@ function it$1(e, t) {
   );
   if (o === "parallel")
     throw new Error("Parallel lines not expected in safe bezier offset");
-  if (Pe(Q$1(o, n), i) * t > 0 && Math.min(
-    J$1(n, o),
-    J$1(r, o)
+  if (Pe(Q$2(o, n), i) * t > 0 && Math.min(
+    J$2(n, o),
+    J$2(r, o)
   ) < t)
     return new S(a, h);
   if (e instanceof _t$1) {
@@ -6576,7 +6578,7 @@ function it$1(e, t) {
   );
 }
 function M(e, t, n) {
-  const r = St$1(
+  const r = St$2(
     e.tangentAtLastPoint,
     t.tangentAtFirstPoint
   );
@@ -6598,7 +6600,7 @@ function M(e, t, n) {
   }, [f] = p(e, o), [, g] = p(t, a);
   return { first: f, second: g, center: c };
 }
-function V$1(e, t, n) {
+function V(e, t, n) {
   const r = M(e, t, n);
   if (!r)
     return console.warn(
@@ -6609,11 +6611,11 @@ function V$1(e, t, n) {
   const { first: i, second: s } = r;
   return [
     i,
-    mn$1(i.lastPoint, s.firstPoint, i.tangentAtLastPoint),
+    mn$2(i.lastPoint, s.firstPoint, i.tangentAtLastPoint),
     s
   ];
 }
-function _(e, t, n) {
+function _$1(e, t, n) {
   const r = M(e, t, n);
   if (!r)
     return console.warn(
@@ -6622,7 +6624,7 @@ function _(e, t, n) {
       t.repr
     ), [e, t];
   const { first: i, second: s } = r;
-  return [i, new at$1(i.lastPoint, s.firstPoint), s];
+  return [i, new at$2(i.lastPoint, s.firstPoint), s];
 }
 const st$1 = (e) => {
   let t;
@@ -6638,10 +6640,10 @@ const st$1 = (e) => {
   let a;
   return typeof s == "number" ? a = Tt(1, s * fe) : a = s, { endTangent: o, startFactor: r, endFactor: i, startTangent: a };
 };
-function z(e, { ignoreChecks: t = !1 } = {}) {
-  return new _$1([new v$2(new O$1([...e], { ignoreChecks: t }))]);
+function z$1(e, { ignoreChecks: t = !1 } = {}) {
+  return new _$2([new v$1(new O([...e], { ignoreChecks: t }))]);
 }
-class ot {
+let ot$1 = class ot {
   constructor(t = [0, 0]) {
     m(this, "pointer");
     m(this, "firstPoint");
@@ -6657,19 +6659,19 @@ class ot {
     return this.pointer = t, this.firstPoint = t, this;
   }
   saveSegment(t) {
-    if (Y$2(t.firstPoint, t.lastPoint))
+    if (Y$1(t.firstPoint, t.lastPoint))
       throw new Error(`Segment has no length, ${t.repr}`);
     if (!this._nextCorner)
       return this.pendingSegments.push(t), this;
     const n = this.pendingSegments.pop();
     if (!n) throw new Error("bug in the custom corner algorithm");
-    const r = this._nextCorner.mode === "chamfer" ? _ : V$1;
+    const r = this._nextCorner.mode === "chamfer" ? _$1 : V;
     return this.pendingSegments.push(
       ...r(n, t, this._nextCorner.radius)
     ), this._nextCorner = null, this;
   }
   lineTo(t) {
-    const n = new at$1(this.pointer, t);
+    const n = new at$2(this.pointer, t);
     return this.pointer = t, this.saveSegment(n);
   }
   line(t, n) {
@@ -6714,7 +6716,7 @@ class ot {
   }
   sagittaArcTo(t, n) {
     if (!n) return this.lineTo(t);
-    const r = new at$1(this.pointer, t), i = tt$2(r.tangentAtFirstPoint), s = it$3(r.midPoint, nt$2(i, n));
+    const r = new at$2(this.pointer, t), i = tt$2(r.tangentAtFirstPoint), s = it$3(r.midPoint, nt$2(i, n));
     return this.threePointsArcTo(t, s);
   }
   sagittaArc(t, n, r) {
@@ -6731,7 +6733,7 @@ class ot {
   }
   bulgeArcTo(t, n) {
     if (!n) return this.lineTo(t);
-    const r = J$1(this.pointer, t) / 2, i = -n * r;
+    const r = J$2(this.pointer, t) / 2, i = -n * r;
     return this.sagittaArcTo(t, i);
   }
   bulgeArc(t, n, r) {
@@ -6751,7 +6753,7 @@ class ot {
     if (!r)
       throw new Error("You need a previous curve to sketch a tangent arc");
     return this.saveSegment(
-      mn$1(
+      mn$2(
         this.pointer,
         t,
         n ?? r.tangentAtLastPoint
@@ -6764,7 +6766,7 @@ class ot {
   }
   ellipseTo(t, n, r, i, s, o) {
     return this.saveSegment(
-      pn$1(this.pointer, t, n, r, i, s, o)
+      pn$2(this.pointer, t, n, r, i, s, o)
     ), this.pointer = t, this;
   }
   ellipse(t, n, r, i, s, o, a) {
@@ -6778,7 +6780,7 @@ class ot {
     );
   }
   halfEllipseTo(t, n) {
-    const [r, i] = We(Q$1(t, this.pointer));
+    const [r, i] = We(Q$2(t, this.pointer));
     return this.ellipseTo(
       t,
       r / 2,
@@ -6803,7 +6805,7 @@ class ot {
     return this.saveSegment(new _t$1(this.pointer, t, n)), this.pointer = t, this;
   }
   smoothCurveTo(t, n) {
-    const { endTangent: r, startTangent: i, startFactor: s, endFactor: o } = st$1(n), a = this.pendingSegments.length ? this.pendingSegments[this.pendingSegments.length - 1] : null, h = J$1(this.pointer, t) / 3;
+    const { endTangent: r, startTangent: i, startFactor: s, endFactor: o } = st$1(n), a = this.pendingSegments.length ? this.pendingSegments[this.pendingSegments.length - 1] : null, h = J$2(this.pointer, t) / 3;
     let c;
     i ? c = i : a ? c = a.tangentAtLastPoint : c = [1, 0], c = H$1(c);
     const p = [
@@ -6834,20 +6836,20 @@ class ot {
     const r = this.pendingSegments.pop(), i = this.pendingSegments.shift();
     if (!r || !i)
       throw new Error("Not enough curves to close and fillet");
-    const s = n === "chamfer" ? _ : V$1;
+    const s = n === "chamfer" ? _$1 : V;
     this.pendingSegments.push(...s(r, i, t));
   }
   close(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
     const n = this.pendingSegments[0], r = this.pendingSegments.at(-1);
-    return Y$2(n.firstPoint, r.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
+    return Y$1(n.firstPoint, r.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
       this._nextCorner.radius,
       this._nextCorner.mode
-    ), this._nextCorner = null), z(this.pendingSegments, { ignoreChecks: t });
+    ), this._nextCorner = null), z$1(this.pendingSegments, { ignoreChecks: t });
   }
   closeWithMirror(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
-    const n = this.pendingSegments[0], r = this.pendingSegments.at(-1), i = Q$1(
+    const n = this.pendingSegments[0], r = this.pendingSegments.at(-1), i = Q$2(
       r.lastPoint,
       n.firstPoint
     ), s = new et$3().mirrorLine(
@@ -6856,32 +6858,32 @@ class ot {
     ), o = this.pendingSegments.map(
       (a) => a.transform(s).reverse()
     );
-    return o.reverse(), z(
+    return o.reverse(), z$1(
       [...this.pendingSegments, ...o],
       { ignoreChecks: t }
     );
   }
   asStrand() {
-    return new B$1([...this.pendingSegments]);
+    return new B$2([...this.pendingSegments]);
   }
   get isClosed() {
     var t;
-    return Y$2(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
+    return Y$1(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
   }
-}
-function lt$1(e = [0, 0]) {
-  return new ot(e);
+};
+function lt(e = [0, 0]) {
+  return new ot$1(e);
 }
 
-function R(e) {
-  return lt$1([-e, 0]).sagittaArc(2 * e, 0, e).sagittaArc(-2 * e, 0, e).close();
+function R$1(e) {
+  return lt([-e, 0]).sagittaArc(2 * e, 0, e).sagittaArc(-2 * e, 0, e).close();
 }
 function x$1(e, a, f = 0) {
   const { rx: m = 0, ry: p = 0 } = typeof f == "number" ? { ry: f, rx: f } : f;
   let n = Math.min(m ?? f ?? 0, e / 2), t = Math.min(p ?? f ?? 0, a / 2);
   const r = n && t;
   r || (n = 0, t = 0);
-  const u = n === t, c = lt$1([Math.min(0, -(e / 2 - n)), -a / 2]), o = (i, l) => {
+  const u = n === t, c = lt([Math.min(0, -(e / 2 - n)), -a / 2]), o = (i, l) => {
     r && (u ? c.tangentArc(i, l) : c.ellipse(i, l, n, t, 0, !1, !1));
   };
   return n < e / 2 && c.hLine(e - 2 * n), o(n, t), t < a / 2 && c.vLine(a - 2 * t), o(-n, t), n < e / 2 && c.hLine(-(e - 2 * n)), o(-n, -t), t < a / 2 && c.vLine(-(a - 2 * t)), o(n, -t), c.close();
@@ -6889,7 +6891,7 @@ function x$1(e, a, f = 0) {
 
 var drawShape = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  drawCircle: R,
+  drawCircle: R$1,
   drawRect: x$1
 });
 
@@ -6897,11 +6899,11 @@ function i([t, n]) {
   return `${t} ${n}`;
 }
 function s(t) {
-  if (t instanceof at$1)
+  if (t instanceof at$2)
     return `L ${i(t.lastPoint)}`;
-  if (t instanceof ct$1)
+  if (t instanceof ct$2)
     return `A ${t.radius} ${t.radius} 0 ${t.angularLength > Math.PI ? "1" : "0"} ${t.clockwise ? "0" : "1"} ${i(t.lastPoint)}`;
-  if (t instanceof jt$2)
+  if (t instanceof jt$1)
     return `A ${t.majorRadius} ${t.minorRadius} ${t.tiltAngle * Ue} ${t.deltaAngle > Math.PI ? "1" : "0"} ${t.clockwise ? "0" : "1"} ${i(t.lastPoint)}`;
   if (t instanceof _t$1)
     return `Q ${[
@@ -6933,49 +6935,49 @@ function j$1(t) {
   const n = `M ${t.firstPoint.join(" ")}`, o = t.segments.map(s).join(" ");
   return `${n} ${o}`;
 }
-function v$1(t, n = 1) {
+function v(t, n = 1) {
   const o = t.xMin - n, r = t.yMin - n;
   return `${o} ${r} ${t.width + 2 * n} ${t.height + 2 * n}`;
 }
 function A(t, n, o = 1, r) {
-  const a = v$1(n, o), c = r ? `width="${n.width + 2 * o}${r}" height="${n.height + 2 * o}${r}"` : "";
+  const a = v(n, o), c = r ? `width="${n.width + 2 * o}${r}" height="${n.height + 2 * o}${r}"` : "";
   return `<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${a}" fill="none" stroke="black" stroke-width="0.2%" vector-effect="non-scaling-stroke" ${c}>
+<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${a}" fill="none" stroke="grey" stroke-width="0.2%" vector-effect="non-scaling-stroke" ${c}>
     ${t}
 </svg>`;
 }
 
-var bt = Object.defineProperty;
-var Lt = (t, n, e) => n in t ? bt(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var P = (t, n, e) => Lt(t, typeof n != "symbol" ? n + "" : n, e);
-function v(t) {
-  if (t instanceof v$2)
-    return [t];
-  if (t instanceof O$1)
-    return [new v$2(t)];
-  if (t instanceof _$1)
-    return t.figures;
+var yt = Object.defineProperty;
+var Ct = (n, t, e) => t in n ? yt(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
+var P = (n, t, e) => Ct(n, typeof t != "symbol" ? t + "" : t, e);
+function L(n) {
+  if (n instanceof v$1)
+    return [n];
+  if (n instanceof O)
+    return [new v$1(n)];
+  if (n instanceof _$2)
+    return n.figures;
   throw new Error("Unknown shape");
 }
-function lt(t, n, e = 1e-9) {
+function mt(n, t, e = 1e-9) {
   let s = [];
-  const r = [], i = new Array(n.segments.length).fill(0).map(() => []);
-  n.segments.forEach((f, c) => {
-    t.segments.forEach((a) => {
+  const r = [], i = new Array(t.segments.length).fill(0).map(() => []);
+  t.segments.forEach((a, f) => {
+    n.segments.forEach((c) => {
       const { intersections: l, overlaps: p } = K$1(
-        f,
         a,
+        c,
         e
       );
-      s.push(...l), i[c].push(...l), r.push(...p);
-      const h = p.flatMap((d) => [
+      s.push(...l), i[f].push(...l), r.push(...p);
+      const g = p.flatMap((d) => [
         d.firstPoint,
         d.lastPoint
       ]);
-      s.push(...h), i[c].push(...h);
+      s.push(...g), i[f].push(...g);
     });
   }), s = Te(s, e);
-  const o = Kt$1([n.segments, i]).flatMap(([f, c]) => c.length ? f.splitAt(c) : [f]);
+  const o = Kt([t.segments, i]).flatMap(([a, f]) => f.length ? a.splitAt(f) : [a]);
   return Array.from(
     Ft(
       o,
@@ -6984,167 +6986,167 @@ function lt(t, n, e = 1e-9) {
     )
   );
 }
-function V(t, n, e = !1) {
-  return lt(n, t).filter((r) => {
+function J(n, t, e = !1) {
+  return mt(t, n).filter((r) => {
     const i = r.segments[0].midPoint;
-    return n.onStroke(i) ? !e : !n.contains(i);
+    return t.onStroke(i) ? !e : !t.contains(i);
   });
 }
-function q(t, n, e = !1) {
-  return lt(n, t).filter((r) => {
+function Q(n, t, e = !1) {
+  return mt(t, n).filter((r) => {
     const i = r.segments[0].midPoint;
-    return n.onStroke(i) ? !e : n.contains(i);
+    return t.onStroke(i) ? !e : t.contains(i);
   });
 }
-function H(t, n, e = !1) {
-  const s = V(
-    t,
-    n.contour,
+function W(n, t, e = !1) {
+  const s = J(
+    n,
+    t.contour,
     e
-  ), r = n.holes.flatMap(
-    (i) => q(t, i, e)
+  ), r = t.holes.flatMap(
+    (i) => Q(n, i, e)
   );
   return [...s, ...r];
 }
-function W(t, n, e = !1) {
-  let s = q(
-    t,
-    n.contour,
+function j(n, t, e = !1) {
+  let s = Q(
+    n,
+    t.contour,
     e
   );
-  return n.holes.forEach((r) => {
+  return t.holes.forEach((r) => {
     s = s.flatMap(
-      (i) => V(i, r, e)
+      (i) => J(i, r, e)
     );
   }), s;
 }
-function Wt(t, n) {
-  return new _$1(
-    G$1(v(t), v(n))
+function sn(n, t) {
+  return new _$2(
+    G(L(n), L(t))
   );
 }
-function D(t) {
-  return t.reduce(
-    (n, e) => Wt(n, e),
-    new _$1()
+function z(n) {
+  return n.reduce(
+    (t, e) => sn(t, e),
+    new _$2()
   );
 }
-function ut(t, n) {
-  return new _$1(
-    Q(v(t), v(n))
+function Pt(n, t) {
+  return new _$2(
+    Q$1(L(n), L(t))
   );
 }
-function Mn(t, n) {
-  return new _$1(
-    rt$1(v(t), v(n))
+function yn(n, t) {
+  return new _$2(
+    rt$2(L(n), L(t))
   );
 }
-function In(t, n, e = !0) {
-  if (n instanceof O$1)
-    return V(t, n, e);
-  if (n instanceof v$2)
-    return H(t, n, e);
-  let s = [new B$1([...t.segments])];
-  return n.figures.forEach((r) => {
-    s = s.flatMap((i) => H(i, r, e));
+function Cn(n, t, e = !0) {
+  if (t instanceof O)
+    return J(n, t, e);
+  if (t instanceof v$1)
+    return W(n, t, e);
+  let s = [new B$2([...n.segments])];
+  return t.figures.forEach((r) => {
+    s = s.flatMap((i) => W(i, r, e));
   }), s;
 }
-function Sn(t, n, e = !1) {
-  if (n instanceof O$1)
-    return q(t, n, e);
-  if (n instanceof v$2)
-    return W(t, n, e);
-  let s = [new B$1([...t.segments])];
-  return n.figures.forEach((r) => {
-    s = s.flatMap((i) => W(i, r, e));
+function xn(n, t, e = !1) {
+  if (t instanceof O)
+    return Q(n, t, e);
+  if (t instanceof v$1)
+    return j(n, t, e);
+  let s = [new B$2([...n.segments])];
+  return t.figures.forEach((r) => {
+    s = s.flatMap((i) => j(i, r, e));
   }), s;
 }
-function X(t) {
-  return t < 0 ? "before" : t > 1 ? "after" : "between";
+function tt(n) {
+  return n < 0 ? "before" : n > 1 ? "after" : "between";
 }
-const Y = (t, n, e) => {
+const nt = (n, t, e) => {
   if (e === "before")
-    return t.distanceFrom(n.firstPoint);
+    return n.distanceFrom(t.firstPoint);
   if (e === "after")
-    return t.distanceFrom(n.lastPoint);
+    return n.distanceFrom(t.lastPoint);
   throw new Error("Invalid position");
 };
-function Xt(t, n) {
-  const e = me(t, n);
+function rn(n, t) {
+  const e = me(n, t);
   if (e === "parallel")
     return Math.min(
-      t.distanceFrom(n.firstPoint),
-      t.distanceFrom(n.lastPoint)
+      n.distanceFrom(t.firstPoint),
+      n.distanceFrom(t.lastPoint)
     );
-  const { intersectionParam1: s, intersectionParam2: r } = e, i = X(s), o = X(r);
+  const { intersectionParam1: s, intersectionParam2: r } = e, i = tt(s), o = tt(r);
   if (i === "between" && o === "between")
     return 0;
   if (i === "between" && o !== "between")
-    return Y(t, n, o);
+    return nt(n, t, o);
   if (o === "between" && i !== "between")
-    return Y(n, t, i);
+    return nt(t, n, i);
   if (i === "before" && o === "before")
-    return J$1(t.firstPoint, n.firstPoint);
+    return J$2(n.firstPoint, t.firstPoint);
   if (i === "after" && o === "after")
-    return J$1(t.lastPoint, n.lastPoint);
+    return J$2(n.lastPoint, t.lastPoint);
   if (i === "before" && o === "after")
-    return J$1(t.firstPoint, n.lastPoint);
+    return J$2(n.firstPoint, t.lastPoint);
   if (i === "after" && o === "before")
-    return J$1(t.lastPoint, n.firstPoint);
+    return J$2(n.lastPoint, t.firstPoint);
   throw new Error("Invalid position");
 }
-function K(t, n) {
-  if (J(t, n).length > 0)
+function et(n, t) {
+  if (J$1(n, t).length > 0)
     return 0;
-  const e = pn(t, n.center);
-  if (t.isOnSegment(e)) {
-    const s = J$1(e, n.center);
-    if (Math.abs(s - n.radius) < t.precision && n.isOnSegment(e))
+  const e = pn$1(n, t.center);
+  if (n.isOnSegment(e)) {
+    const s = J$2(e, t.center);
+    if (Math.abs(s - t.radius) < n.precision && t.isOnSegment(e))
       return 0;
-    if (s - n.radius > t.precision) {
+    if (s - t.radius > n.precision) {
       const r = H$1(
-        Q$1(e, n.center)
+        Q$2(e, t.center)
       ), i = it$3(
-        n.center,
-        nt$2(r, n.radius)
+        t.center,
+        nt$2(r, t.radius)
       );
-      if (n.isOnSegment(i))
-        return J$1(i, e);
+      if (t.isOnSegment(i))
+        return J$2(i, e);
     }
   }
   return Math.min(
-    n.distanceFrom(t.firstPoint),
-    n.distanceFrom(t.lastPoint),
     t.distanceFrom(n.firstPoint),
-    t.distanceFrom(n.lastPoint)
+    t.distanceFrom(n.lastPoint),
+    n.distanceFrom(t.firstPoint),
+    n.distanceFrom(t.lastPoint)
   );
 }
-const Yt = (t, n) => {
-  const e = t.angleToParam(n.firstAngle);
-  if (t.isValidParameter(e)) return !0;
-  const s = t.angleToParam(n.lastAngle);
-  return !!t.isValidParameter(s);
+const on = (n, t) => {
+  const e = n.angleToParam(t.firstAngle);
+  if (n.isValidParameter(e)) return !0;
+  const s = n.angleToParam(t.lastAngle);
+  return !!n.isValidParameter(s);
 };
-function Kt(t, n) {
-  if (qt(t, n, !0).length > 0) return 0;
-  const e = J$1(t.center, n.center);
-  if (e < t.precision && Yt(t, n))
-    return Math.abs(t.radius - n.radius);
-  const s = H$1(Q$1(n.center, t.center)), r = e - Math.abs(t.radius - n.radius) < t.precision;
+function an(n, t) {
+  if (qt(n, t, !0).length > 0) return 0;
+  const e = J$2(n.center, t.center);
+  if (e < n.precision && on(n, t))
+    return Math.abs(n.radius - t.radius);
+  const s = H$1(Q$2(t.center, n.center)), r = e - Math.abs(n.radius - t.radius) < n.precision;
   let i = Ye(s);
-  r && n.radius > t.radius && (i += Math.PI);
-  const o = r ? i : i + Math.PI, f = t.angleToParam(i), c = n.angleToParam(o);
-  return t.isValidParameter(f) && n.isValidParameter(c) ? J$1(t.paramPoint(f), n.paramPoint(c)) : Math.min(
-    t.distanceFrom(n.firstPoint),
-    t.distanceFrom(n.lastPoint),
+  r && t.radius > n.radius && (i += Math.PI);
+  const o = r ? i : i + Math.PI, a = n.angleToParam(i), f = t.angleToParam(o);
+  return n.isValidParameter(a) && t.isValidParameter(f) ? J$2(n.paramPoint(a), t.paramPoint(f)) : Math.min(
     n.distanceFrom(t.firstPoint),
-    n.distanceFrom(t.lastPoint)
+    n.distanceFrom(t.lastPoint),
+    t.distanceFrom(n.firstPoint),
+    t.distanceFrom(n.lastPoint)
   );
 }
-function jt(t, n, e) {
-  let s = 0, r = t.length - 1;
+function cn(n, t, e) {
+  let s = 0, r = n.length - 1;
   for (; s <= r; ) {
-    const i = Math.floor((s + r) / 2), o = e(t[i], n);
+    const i = Math.floor((s + r) / 2), o = e(n[i], t);
     if (o < 0)
       s = i + 1;
     else if (o > 0)
@@ -7154,486 +7156,681 @@ function jt(t, n, e) {
   }
   return -(s + 1);
 }
-function tn(t, n, e) {
-  const s = jt(t, n, e);
-  s < 0 ? t.splice(-(s + 1), 0, n) : t.splice(s, 0, n);
+function fn(n, t, e) {
+  const s = cn(n, t, e);
+  s < 0 ? n.splice(-(s + 1), 0, t) : n.splice(s, 0, t);
 }
-class nn {
+class ln {
   constructor() {
     P(this, "buckets");
     this.buckets = [];
   }
-  addInterval(n) {
-    const e = this.buckets[n.rectangle.diagonalBucketIndex];
-    e === void 0 ? this.buckets[n.rectangle.diagonalBucketIndex] = [n] : tn(e, n, (s, r) => s.value - r.value);
+  addInterval(t) {
+    const e = this.buckets[t.rectangle.diagonalBucketIndex];
+    e === void 0 ? this.buckets[t.rectangle.diagonalBucketIndex] = [t] : fn(e, t, (s, r) => s.value - r.value);
   }
-  removeInterval(n) {
-    const e = this.buckets[n.rectangle.diagonalBucketIndex];
+  removeInterval(t) {
+    const e = this.buckets[t.rectangle.diagonalBucketIndex];
     if (e === void 0)
       throw new Error("Interval not found");
     e.shift();
   }
   getBottomRightHullIntervals() {
-    const n = [];
+    const t = [];
     for (let e = this.buckets.length - 1; e >= 0; e--) {
       const s = this.buckets[e];
       if (!s === void 0) continue;
       const r = s[0];
       if (r !== void 0) {
-        if (!n.length) {
-          n.push(r);
+        if (!t.length) {
+          t.push(r);
           continue;
         }
-        for (; n.length && n[n.length - 1].value >= r.value; )
-          n.pop();
-        for (; n.length >= 2; ) {
-          const i = n[n.length - 1], o = n[n.length - 2], f = (r.value - o.value) / ((r.rectangle.diagonal - o.rectangle.diagonal) * 2);
-          if (o.value + (i.rectangle.diagonal - o.rectangle.diagonal) / 2 * f < i.value)
-            n.pop();
+        for (; t.length && t[t.length - 1].value >= r.value; )
+          t.pop();
+        for (; t.length >= 2; ) {
+          const i = t[t.length - 1], o = t[t.length - 2], a = (r.value - o.value) / ((r.rectangle.diagonal - o.rectangle.diagonal) * 2);
+          if (o.value + (i.rectangle.diagonal - o.rectangle.diagonal) / 2 * a < i.value)
+            t.pop();
           else
             break;
         }
-        n.push(r);
+        t.push(r);
       }
     }
-    return n;
+    return t;
   }
 }
-class en {
-  constructor(n, e) {
+class un {
+  constructor(t, e) {
     P(this, "diagonal");
     P(this, "diagonalBucketIndex");
     P(this, "xLength");
     P(this, "yLength");
     P(this, "index");
-    this.x = n, this.y = e, this.xLength = Math.pow(3, -n), this.yLength = Math.pow(3, -e), this.diagonal = Math.sqrt(
+    this.x = t, this.y = e, this.xLength = Math.pow(3, -t), this.yLength = Math.pow(3, -e), this.diagonal = Math.sqrt(
       this.xLength * this.xLength + this.yLength * this.yLength
-    ), this.diagonalBucketIndex = n + e, this.index = `${n},${e}`;
+    ), this.diagonalBucketIndex = t + e, this.index = `${t},${e}`;
   }
 }
-class sn {
-  constructor(n, e = 1e-8, s = 1e3, r = 1e-6) {
+class hn {
+  constructor(t, e = 1e-8, s = 1e3, r = 1e-6) {
     P(this, "rectangles");
     P(this, "buckets");
     P(this, "fMin");
     P(this, "argMin");
     P(this, "tol");
-    this.fcn = n, this.endTolerance = e, this.maxIterations = s, this.epsilon = r, this.fcn = n, this.epsilon = r, this.endTolerance = e, this.maxIterations = s, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new nn();
-    const i = [0.5, 0.5], o = this.rect(0, 0), f = this.fcn(i);
-    this.buckets.addInterval(new x(i, f, o)), this.fMin = f, this.argMin = i, this.tol = o.diagonal;
+    this.fcn = t, this.endTolerance = e, this.maxIterations = s, this.epsilon = r, this.fcn = t, this.epsilon = r, this.endTolerance = e, this.maxIterations = s, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new ln();
+    const i = [0.5, 0.5], o = this.rect(0, 0), a = this.fcn(i);
+    this.buckets.addInterval(new D(i, a, o)), this.fMin = a, this.argMin = i, this.tol = o.diagonal;
   }
-  registerInterval(n) {
-    this.buckets.addInterval(n), n.value <= this.fMin && (this.fMin = n.value, this.argMin = n.center, this.tol = n.rectangle.diagonal);
+  registerInterval(t) {
+    this.buckets.addInterval(t), t.value <= this.fMin && (this.fMin = t.value, this.argMin = t.center, this.tol = t.rectangle.diagonal);
   }
-  rect(n, e) {
-    const s = `${n},${e}`;
-    return this.rectangles.has(s) || this.rectangles.set(s, new en(n, e)), this.rectangles.get(s);
+  rect(t, e) {
+    const s = `${t},${e}`;
+    return this.rectangles.has(s) || this.rectangles.set(s, new un(t, e)), this.rectangles.get(s);
   }
-  splitInterval(n) {
+  splitInterval(t) {
     let e, s, r;
-    const [i, o] = n.center;
-    return n.rectangle.x <= n.rectangle.y ? (e = this.rect(n.rectangle.x + 1, n.rectangle.y), s = [i - e.xLength, o], r = [i + e.xLength, o]) : (e = this.rect(n.rectangle.x, n.rectangle.y + 1), s = [i, o - e.yLength], r = [i, o + e.yLength]), [
-      new x(s, this.fcn(s), e),
-      new x(n.center, n.value, e),
-      new x(r, this.fcn(r), e)
+    const [i, o] = t.center;
+    return t.rectangle.x <= t.rectangle.y ? (e = this.rect(t.rectangle.x + 1, t.rectangle.y), s = [i - e.xLength, o], r = [i + e.xLength, o]) : (e = this.rect(t.rectangle.x, t.rectangle.y + 1), s = [i, o - e.yLength], r = [i, o + e.yLength]), [
+      new D(s, this.fcn(s), e),
+      new D(t.center, t.value, e),
+      new D(r, this.fcn(r), e)
     ];
   }
   single_iteration() {
-    const n = this.buckets.getBottomRightHullIntervals();
-    for (; n.length >= 2; ) {
-      const e = n[0], s = n[1], r = (s.value - e.value) / ((s.rectangle.diagonal - e.rectangle.diagonal) / 2), i = e.value - r * s.value / 2;
+    const t = this.buckets.getBottomRightHullIntervals();
+    for (; t.length >= 2; ) {
+      const e = t[0], s = t[1], r = (s.value - e.value) / ((s.rectangle.diagonal - e.rectangle.diagonal) / 2), i = e.value - r * s.value / 2;
       if ((this.fMin - i) / Math.abs(this.fMin) < this.epsilon)
-        n.shift();
+        t.shift();
       else
         break;
     }
-    n.forEach((e) => {
+    t.forEach((e) => {
       this.buckets.removeInterval(e);
     });
-    for (const e of n) {
+    for (const e of t) {
       const [s, r, i] = this.splitInterval(e);
       this.registerInterval(s), this.registerInterval(r), this.registerInterval(i);
     }
   }
   run() {
-    let n = 0;
-    for (; this.tol > this.endTolerance / 2 && (this.single_iteration(), n++, !(n > this.maxIterations)); )
+    let t = 0;
+    for (; this.tol > this.endTolerance / 2 && (this.single_iteration(), t++, !(t > this.maxIterations)); )
       ;
     return {
       fMin: this.fMin,
       argMin: this.argMin,
       tol: this.tol,
-      iterations: n
+      iterations: t
     };
   }
 }
-class x {
-  constructor(n, e, s) {
-    this.center = n, this.value = e, this.rectangle = s;
+class D {
+  constructor(t, e, s) {
+    this.center = t, this.value = e, this.rectangle = s;
   }
 }
-function rn(t, n = 1e-8, e = 1e3, s = 1e-6) {
-  return new sn(
-    t,
+function gn(n, t = 1e-8, e = 1e3, s = 1e-6) {
+  return new hn(
     n,
+    t,
     e,
     s
   ).run();
 }
-function on(t, n, e = 1e-9) {
-  const s = rn((r) => {
-    const i = t.paramPoint(r[0]), o = n.paramPoint(r[1]);
+function pn(n, t, e = 1e-9) {
+  const s = gn((r) => {
+    const i = n.paramPoint(r[0]), o = t.paramPoint(r[1]);
     return Rt$1(i, o);
   }, e);
   return Math.sqrt(s.fMin);
 }
-function an(t, n) {
-  return t instanceof at$1 && n instanceof at$1 ? Xt(t, n) : t instanceof at$1 && n instanceof ct$1 ? K(t, n) : t instanceof ct$1 && n instanceof at$1 ? K(n, t) : t instanceof ct$1 && n instanceof ct$1 ? Kt(t, n) : on(t, n);
+function dn(n, t) {
+  return n instanceof at$2 && t instanceof at$2 ? rn(n, t) : n instanceof at$2 && t instanceof ct$2 ? et(n, t) : n instanceof ct$2 && t instanceof at$2 ? et(t, n) : n instanceof ct$2 && t instanceof ct$2 ? an(n, t) : pn(n, t);
 }
-function ht(t) {
-  if (t instanceof Et$1) {
-    const r = Q$1(t.lastPoint, t.firstPoint), i = Q$1(t.firstControlPoint, t.firstPoint), o = Q$1(t.lastControlPoint, t.firstPoint), f = un$1(r, i), c = un$1(r, o);
-    if (f > 0 && c < 0 || f < 0 && c > 0) return !1;
+function wt(n) {
+  if (n instanceof Et$1) {
+    const r = Q$2(n.lastPoint, n.firstPoint), i = Q$2(n.firstControlPoint, n.firstPoint), o = Q$2(n.lastControlPoint, n.firstPoint), a = un$1(r, i), f = un$1(r, o);
+    if (a > 0 && f < 0 || a < 0 && f > 0) return !1;
   }
-  const n = tt$2(t.tangentAtFirstPoint), e = tt$2(t.tangentAtLastPoint);
-  let s = Pe(n, e);
+  const t = tt$2(n.tangentAtFirstPoint), e = tt$2(n.tangentAtLastPoint);
+  let s = Pe(t, e);
   return Math.abs(Math.acos(s)) < Math.PI / 3;
 }
-function $(t) {
-  if (ht(t)) return [t];
-  const [n, e] = t.splitAtParameters([0.5]);
+function K(n) {
+  if (wt(n)) return [n];
+  const [t, e] = n.splitAtParameters([0.5]);
   return [
-    ...$(n),
-    ...$(e)
+    ...K(t),
+    ...K(e)
   ];
 }
-function j(t) {
-  return ht(t) ? [t] : t.splitAtParameters(t.getParametersOfExtrema()).flatMap($);
+function st(n) {
+  return wt(n) ? [n] : n.splitAtParameters(n.getParametersOfExtrema()).flatMap(K);
 }
-function cn(t) {
-  const n = t.deltaAngle, e = Math.ceil(Math.abs(n) / (Math.PI / 2)), s = n / e, r = 4 * Math.tan(s / 4) / 3, i = t.clockwise ? -1 : 1, o = Array.from(
+function mn(n) {
+  const t = n.deltaAngle, e = Math.ceil(Math.abs(t) / (Math.PI / 2)), s = t / e, r = 4 * Math.tan(s / 4) / 3, i = n.clockwise ? -1 : 1, o = Array.from(
     { length: e + 1 },
-    (c, a) => t.firstAngle + a * s * i
+    (f, c) => n.firstAngle + c * s * i
   );
-  return o.slice(0, -1).map((c, a) => [c, o[a + 1]]).map(([c, a]) => {
-    const l = Math.cos(c), p = Math.sin(c), h = Math.cos(a), d = Math.sin(a), [u, M] = t.center, m = t.minorRadius, b = t.majorRadius, k = new et$3().rotate(
-      t.tiltAngle,
-      t.center
-    ), F = (St) => k.transform(St), C = F([u + b * l, M + m * p]), z = F([
-      u + b * (l - r * p * i),
-      M + m * (p + r * l * i)
-    ]), Mt = F([
-      u + b * (h + r * d * i),
-      M + m * (d - r * h * i)
-    ]), It = F([u + b * h, M + m * d]);
-    return new Et$1(C, It, z, Mt);
+  return o.slice(0, -1).map((f, c) => [f, o[c + 1]]).map(([f, c]) => {
+    const l = Math.cos(f), p = Math.sin(f), g = Math.cos(c), d = Math.sin(c), [u, S] = n.center, M = n.minorRadius, v = n.majorRadius, k = new et$3().rotate(
+      n.tiltAngle,
+      n.center
+    ), C = (Ft) => k.transform(Ft), O = C([u + v * l, S + M * p]), G = C([
+      u + v * (l - r * p * i),
+      S + M * (p + r * l * i)
+    ]), kt = C([
+      u + v * (g + r * d * i),
+      S + M * (d - r * g * i)
+    ]), Et = C([u + v * g, S + M * d]);
+    return new Et$1(O, Et, G, kt);
   });
 }
-const N = 1e-8, gt = (t) => t.flatMap((n) => n instanceof at$1 ? [n] : n instanceof ct$1 ? [n] : n instanceof jt$2 ? cn(n).flatMap(
-  (e) => j(e)
-) : n instanceof _t$1 || n instanceof Et$1 ? j(n) : [new at$1(n.firstPoint, n.lastPoint)]);
-function G(t, n, e = !0) {
-  const s = t.map((a) => ({
-    offset: y(a, n),
-    original: a
+const X = 1e-8, Mt = (n) => n.flatMap((t) => t instanceof at$2 ? [t] : t instanceof ct$2 ? [t] : t instanceof jt$1 ? mn(t).flatMap(
+  (e) => st(e)
+) : t instanceof _t$1 || t instanceof Et$1 ? st(t) : [new at$2(t.firstPoint, t.lastPoint)]);
+function q(n, t, e = !0) {
+  const s = n.map((c) => ({
+    offset: y(c, t),
+    original: c
   })), r = [];
   let i = e ? null : s.at(-1), o = e ? s.at(-1) : null;
   if (r.length === 1) return r;
-  const f = (a) => {
-    i ? a.offset instanceof S ? Y$2(a.offset.firstPoint, a.offset.lastPoint) || r.push(
-      new at$1(a.offset.firstPoint, a.offset.lastPoint)
-    ) : r.push(a.offset) : i = a;
-  }, c = function* () {
-    for (const a of s.slice(0, -1))
-      yield a;
+  const a = (c) => {
+    i ? c.offset instanceof S ? Y$1(c.offset.firstPoint, c.offset.lastPoint) || r.push(
+      new at$2(c.offset.firstPoint, c.offset.lastPoint)
+    ) : r.push(c.offset) : i = c;
+  }, f = function* () {
+    for (const c of s.slice(0, -1))
+      yield c;
     if (!i) throw new Error("Bug in the offset algorithm");
     yield i;
   };
-  for (const a of c()) {
+  for (const c of f()) {
     if (!o) {
-      o = a;
+      o = c;
       continue;
     }
-    const l = o.offset.lastPoint, p = a.offset.firstPoint;
-    if (Y$2(l, p)) {
-      f(o), o = a;
+    const l = o.offset.lastPoint, p = c.offset.firstPoint;
+    if (Y$1(l, p)) {
+      a(o), o = c;
       continue;
     }
-    let h = [];
-    if (!(o.offset instanceof S) && !(a.offset instanceof S)) {
-      const { intersections: m, overlaps: b } = K$1(
+    let g = [];
+    if (!(o.offset instanceof S) && !(c.offset instanceof S)) {
+      const { intersections: M, overlaps: v } = K$1(
         o.offset,
-        a.offset,
-        N / 100
+        c.offset,
+        X / 100
       );
-      h = [
-        ...m,
-        ...b.flatMap((k) => [k.firstPoint, k.lastPoint])
+      g = [
+        ...M,
+        ...v.flatMap((k) => [k.firstPoint, k.lastPoint])
       ];
     }
-    if (h.length > 0) {
-      let m = h[0];
-      if (h.length > 1) {
-        const F = o == null ? void 0 : o.original.lastPoint, C = h.map(
-          (z) => Rt$1(z, F)
+    if (g.length > 0) {
+      let M = g[0];
+      if (g.length > 1) {
+        const C = o == null ? void 0 : o.original.lastPoint, O = g.map(
+          (G) => Rt$1(G, C)
         );
-        m = h[C.indexOf(Math.min(...C))];
+        M = g[O.indexOf(Math.min(...O))];
       }
-      const b = o.offset.splitAt([
-        m
-      ])[0], k = a.offset.splitAt([m]).at(-1);
+      const v = o.offset.splitAt([
+        M
+      ])[0], k = c.offset.splitAt([M]).at(-1);
       if (!k) throw new Error("Bug in the splitting algo in offset");
-      f({
-        offset: b,
+      a({
+        offset: v,
         original: o.original
-      }), o = { offset: k, original: a.original };
+      }), o = { offset: k, original: c.original };
       continue;
     }
-    const d = o.original.lastPoint, u = St$1(
-      Q$1(p, d),
-      Q$1(l, d)
-    ) > 0, M = new ct$1(l, p, d, u);
-    f(o), r.push(M), o = a;
-  }
-  return o && f(o), r;
-}
-function pt(t) {
-  const n = /* @__PURE__ */ new Map(), e = (s, r) => {
-    const i = n.get(s) || [];
-    n.set(s, [...i, ...r]);
+    const d = o.original.lastPoint, u = St$2(
+      Q$2(p, d),
+      Q$2(l, d)
+    ) > 0, S$1 = new ct$2(l, p, d, u);
+    a(o), r.push(S$1), o = c;
+  }
+  return o && a(o), r;
+}
+function It(n) {
+  const t = /* @__PURE__ */ new Map(), e = (s, r) => {
+    const i = t.get(s) || [];
+    t.set(s, [...i, ...r]);
   };
-  return t.forEach((s, r) => {
-    t.slice(r + 1).forEach((i, o) => {
-      const { intersections: f, overlaps: c } = K$1(s, i, N), a = [
-        ...f,
-        ...c.flatMap((l) => [l.firstPoint, l.lastPoint])
+  return n.forEach((s, r) => {
+    n.slice(r + 1).forEach((i, o) => {
+      const { intersections: a, overlaps: f } = K$1(s, i, X), c = [
+        ...a,
+        ...f.flatMap((l) => [l.firstPoint, l.lastPoint])
       ].filter((l) => {
-        const p = Y$2(l, s.firstPoint) || Y$2(l, s.lastPoint), h = Y$2(l, i.firstPoint) || Y$2(l, i.lastPoint);
-        return !(p && h);
+        const p = Y$1(l, s.firstPoint) || Y$1(l, s.lastPoint), g = Y$1(l, i.firstPoint) || Y$1(l, i.lastPoint);
+        return !(p && g);
       });
-      a.length && (e(r, a), e(o + r + 1, a));
+      c.length && (e(r, c), e(o + r + 1, c));
     });
-  }), n;
+  }), t;
 }
-function dt(t, n) {
-  return n.flatMap((e, s) => {
-    if (!t.has(s)) return e;
-    const r = t.get(s);
+function St(n, t) {
+  return t.flatMap((e, s) => {
+    if (!n.has(s)) return e;
+    const r = n.get(s);
     return r ? e.splitAt(r) : e;
   });
 }
-function Pt(t, n, e) {
-  return t.filter((s) => !n.segments.some((i) => an(i, s) < Math.abs(e) - N));
+function bt(n, t, e) {
+  return n.filter((s) => !t.segments.some((i) => dn(i, s) < Math.abs(e) - X));
 }
-function O(t, n) {
-  const e = t.clockwise ? n : -n, s = gt(t.segments), r = G(s, e);
-  if (r.length < 2) return new _$1();
-  const i = pt(r);
+function T(n, t) {
+  const e = n.clockwise ? t : -t, s = Mt(n.segments), r = q(s, e);
+  if (r.length < 2) return new _$2();
+  const i = It(r);
   if (!i.size) {
-    const l = new O$1(r);
-    return new _$1([new v$2(l)]);
+    const l = new O(r);
+    return new _$2([new v$1(l)]);
   }
-  const o = dt(
+  const o = St(
     i,
     r
-  ), f = Pt(o, t, n);
-  if (!f.length) return new _$1();
-  const a = Yt$1(f).filter((l) => l.length > 1).filter((l) => Y$2(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new O$1(l));
-  return a.length ? new _$1(a.map((l) => new v$2(l))) : new _$1();
+  ), a = bt(o, n, t);
+  if (!a.length) return new _$2();
+  const c = Yt(a).filter((l) => l.length > 1).filter((l) => Y$1(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new O(l));
+  return c.length ? new _$2(c.map((l) => new v$1(l))) : new _$2();
 }
-function fn(t, n, e = "round") {
-  const s = n / 2, r = gt(t.segments), i = G(r, s, !1), o = G(
+function Pn(n, t, e = "round") {
+  const s = t / 2, r = Mt(n.segments), i = q(r, s, !1), o = q(
     r,
     -s,
     !1
   ).map((u) => u.reverse());
   o.reverse();
-  const f = (u, M) => e === "round" ? mn$1(
+  const a = (u, S) => e === "round" ? mn$2(
     u.lastPoint,
-    M.firstPoint,
+    S.firstPoint,
     u.tangentAtLastPoint
-  ) : new at$1(u.lastPoint, M.firstPoint), c = [
+  ) : new at$2(u.lastPoint, S.firstPoint), f = [
     ...i,
-    f(
+    a(
       i[i.length - 1],
       o[0]
     ),
     ...o,
-    f(
+    a(
       o[o.length - 1],
       i[0]
     )
-  ], a = pt(c);
-  if (!a.size) {
-    const u = new O$1(c);
-    return new _$1([new v$2(u)]);
+  ], c = It(f);
+  if (!c.size) {
+    const u = new O(f);
+    return new _$2([new v$1(u)]);
   }
-  const l = dt(
-    a,
-    c
-  ), p = Pt(l, t, s);
-  if (!p.length) return new _$1();
-  const d = Yt$1(p).filter((u) => u.length > 1).filter((u) => Y$2(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new O$1(u));
-  return d.length ? new _$1(d.map((u) => new v$2(u))) : new _$1();
-}
-function ln(t, n) {
-  const e = t.map((s) => {
-    const r = D(
-      s.holes.map((i) => O(i, n))
+  const l = St(
+    c,
+    f
+  ), p = bt(l, n, s);
+  if (!p.length) return new _$2();
+  const d = Yt(p).filter((u) => u.length > 1).filter((u) => Y$1(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new O(u));
+  return d.length ? new _$2(d.map((u) => new v$1(u))) : new _$2();
+}
+function wn(n, t) {
+  const e = n.map((s) => {
+    const r = z(
+      s.holes.map((i) => T(i, t))
     );
-    return ut(O(s.contour, n), r);
+    return Pt(T(s.contour, t), r);
   });
-  return D(e);
+  return z(e);
 }
-function un(t, n) {
-  const e = Math.abs(n / 2), s = t.map(
-    (r) => D(
-      r.allLoops.map((i) => ut(O(i, e), O(i, -e)))
+function Mn(n, t) {
+  const e = Math.abs(t / 2), s = n.map(
+    (r) => z(
+      r.allLoops.map((i) => Pt(T(i, e), T(i, -e)))
     )
   );
-  return D(s);
-}
-function bn(t, n) {
-  return ln(v(t), n);
-}
-function Ln(t, n, { endCap: e = "round" } = {}) {
-  return t instanceof B$1 ? fn(t, n, e) : un(v(t), n);
-}
-function tt(t) {
-  if (t instanceof _$1)
-    return d(t);
-  if (t instanceof v$2)
-    return p(t);
-  if (t instanceof O$1)
-    return `<path d="${w(t)}" />`;
-  if (t instanceof B$1)
-    return `<path d="${j$1(t)}" />`;
-  if (jn(t))
-    return `<path d="${`M ${t.firstPoint.join(" ")}`} ${s(
-      t
+  return z(s);
+}
+function On(n, t) {
+  return wn(L(n), t);
+}
+function Dn(n, t, { endCap: e = "round" } = {}) {
+  return n instanceof B$2 ? Pn(n, t, e) : Mn(L(n), t);
+}
+class In {
+  constructor() {
+    P(this, "filters");
+    this.filters = [];
+  }
+  delete() {
+    this.filters = [];
+  }
+  /**
+   * Combine logically a set of filter with an AND operation.
+   *
+   */
+  and(t) {
+    return t.forEach((e) => e(this)), this;
+  }
+  /**
+   * Invert the result of a particular filter
+   *
+   */
+  not(t) {
+    const e = new this.constructor();
+    t(e);
+    const s = ({ element: r }) => !e.shouldKeep(r);
+    return this.filters.push(s), this;
+  }
+  /**
+   * Combine logically a set of filter with an OR operation.
+   *
+   */
+  either(t) {
+    const e = t.map((r) => {
+      const i = new this.constructor();
+      return r(i), i;
+    }), s = ({ element: r }) => e.some((i) => i.shouldKeep(r));
+    return this.filters.push(s), this;
+  }
+}
+const _ = 2 * Math.PI, rt = (n) => {
+  const t = n % _, e = t < 0 ? t + _ : t;
+  return e < Math.PI ? e : e === Math.PI ? 0 : Math.abs(e - _);
+};
+class x extends In {
+  clone() {
+    const t = new x();
+    return t.filters = [...this.filters], t;
+  }
+  /**
+   * Filter to find corner that have their point are in the list.
+   *
+   */
+  inList(t) {
+    const e = ({ element: s }) => !!t.find((r) => Y$1(r, s.point));
+    return this.filters.push(e), this;
+  }
+  /**
+   * Filter to find elements that are at a specified distance from a point.
+   *
+   */
+  atDistance(t, e = [0, 0]) {
+    function s({ element: r }) {
+      return Math.abs(J$2(e, r.point) - t) < 1e-9;
+    }
+    return this.filters.push(s), this;
+  }
+  /**
+   * Filter to find elements that contain a certain point
+   *
+   * @category Filter
+   */
+  atPoint(t) {
+    function e({ element: s }) {
+      return Y$1(t, s.point);
+    }
+    return this.filters.push(e), this;
+  }
+  /**
+   * Filter to find elements that are within a box
+   *
+   * @category Filter
+   */
+  inBox(t, e) {
+    const [s, r] = t, [i, o] = e, a = Math.min(s, i), f = Math.max(s, i), c = Math.min(r, o), l = Math.max(r, o);
+    function p({ element: g }) {
+      const [d, u] = g.point;
+      return d >= a && d <= f && u >= c && u <= l;
+    }
+    return this.filters.push(p), this;
+  }
+  /**
+   * Filter to find corner that a certain angle between them - only between
+   * 0 and 180.
+   *
+   */
+  ofAngle(t) {
+    function e({ element: s }) {
+      const r = s.firstCurve.tangentAtLastPoint, i = s.secondCurve.tangentAtFirstPoint;
+      return Math.abs(
+        rt(un$1(r, i)) - rt(fe * t)
+      ) < 1e-9;
+    }
+    return this.filters.push(e), this;
+  }
+  above(t = 0) {
+    function e({ element: s }) {
+      return s.point[1] > t;
+    }
+    return this.filters.push(e), this;
+  }
+  below(t = 0) {
+    function e({ element: s }) {
+      return s.point[1] < t;
+    }
+    return this.filters.push(e), this;
+  }
+  leftOf(t = 0) {
+    function e({ element: s }) {
+      return s.point[0] < t;
+    }
+    return this.filters.push(e), this;
+  }
+  rightOf(t = 0) {
+    function e({ element: s }) {
+      return s.point[0] > t;
+    }
+    return this.filters.push(e), this;
+  }
+  shouldKeep(t) {
+    return this.filters.every((s) => s({ element: t }));
+  }
+  asFilterFun() {
+    return this.shouldKeep.bind(this);
+  }
+}
+function At(n, t, e, s = () => !0) {
+  const r = [t.segments[0]], i = (a, f) => {
+    s({ firstCurve: a, secondCurve: f, point: a.lastPoint }) ? r.push(...n(a, f, e)) : r.push(a, f);
+  };
+  if (t.segments.slice(1).forEach((a) => {
+    const f = r.pop();
+    if (!f) throw new Error("Bug in the stroke filletting algo");
+    i(f, a);
+  }), !r.at(-1)) throw new Error("Bug in the stroke corner algo");
+  if (t instanceof O) {
+    const a = r.pop(), f = r.shift();
+    if (!a || !f)
+      throw new Error("Bug in the filletting algo");
+    return i(a, f), new O(r, { ignoreChecks: !0 });
+  } else
+    return new B$2(r, { ignoreChecks: !0 });
+}
+function B(n, t, e) {
+  const s = typeof e == "function" ? e(new x()) : e, r = s && s.asFilterFun();
+  if (n instanceof O || n instanceof B$2)
+    return At(V, n, t, r);
+  if (n instanceof v$1) {
+    const i = B(n.contour, t, s), o = n.holes.map((a) => B(a, t, s));
+    return new v$1(i, o, { ignoreChecks: !0 });
+  }
+  if (n instanceof _$2) {
+    const i = n.figures.map((o) => B(o, t, s));
+    return new _$2(i, { ignoreChecks: !0 });
+  }
+  throw new Error("invalid shape to fillet");
+}
+function R(n, t, e) {
+  const s = typeof e == "function" ? e(new x()) : e, r = s && s.asFilterFun();
+  if (n instanceof O || n instanceof B$2)
+    return At(V, n, t, r);
+  if (n instanceof v$1) {
+    const i = R(n.contour, t, s), o = n.holes.map((a) => R(a, t, s));
+    return new v$1(i, o, { ignoreChecks: !0 });
+  }
+  if (n instanceof _$2) {
+    const i = n.figures.map((o) => R(o, t, s));
+    return new _$2(i, { ignoreChecks: !0 });
+  }
+  throw new Error("invalid shape to chamfer");
+}
+class Sn extends x {
+  constructor(t) {
+    super(), this.shape = t;
+  }
+  fillet(t) {
+    return B(this.shape, t, this.clone());
+  }
+  chamfer(t) {
+    return R(this.shape, t, this.clone());
+  }
+}
+function Bn(n) {
+  return new Sn(n);
+}
+function it(n) {
+  if (n instanceof _$2)
+    return d(n);
+  if (n instanceof v$1)
+    return p(n);
+  if (n instanceof O)
+    return `<path d="${w(n)}" />`;
+  if (n instanceof B$2)
+    return `<path d="${j$1(n)}" />`;
+  if (jn(n))
+    return `<path d="${`M ${n.firstPoint.join(" ")}`} ${s(
+      n
     )}" />`;
   throw new Error("Unknown shape type");
 }
-const nt = (t) => "shape" in t ? t.shape : t, et = (t, n) => {
-  if (!("shape" in t)) return n;
-  const { color: e } = t;
-  return e ? `<g stroke="${e}">${n}</g>` : n;
-}, st = (t) => new mt$2(t.xMin, -t.yMax, t.xMax, -t.yMin);
-function An(t, {
-  margin: n = 1,
+const ot = (n) => "shape" in n ? n.shape : n, at = (n, t) => {
+  if (!("shape" in n)) return t;
+  const { color: e } = n;
+  return e ? `<g stroke="${e}">${t}</g>` : t;
+}, ct = (n) => new mt$2(n.xMin, -n.yMax, n.xMax, -n.yMin);
+function Rn(n, {
+  margin: t = 1,
   unit: e = null,
   viewBox: s
 } = {}) {
-  if (Array.isArray(t)) {
-    const i = t.map((c) => nt(c).mirror()), o = i.map((c, a) => et(t[a], tt(c))).join(`
-`), f = i.slice(1).reduce((c, a) => c.merge(a.boundingBox), i[0].boundingBox);
-    return A(o, s ? st(s) : f, n, e);
+  if (Array.isArray(n)) {
+    const i = n.map((f) => ot(f).mirror()), o = i.map((f, c) => at(n[c], it(f))).join(`
+`), a = i.slice(1).reduce((f, c) => f.merge(c.boundingBox), i[0].boundingBox);
+    return A(o, s ? ct(s) : a, t, e);
   }
-  const r = nt(t).mirror();
+  const r = ot(n).mirror();
   return A(
-    et(t, tt(r)),
-    s ? st(s) : r.boundingBox,
-    n,
+    at(n, it(r)),
+    s ? ct(s) : r.boundingBox,
+    t,
     e
   );
 }
-const mt = (t) => {
-  if (t.type === "LINE")
-    return new at$1(t.firstPoint, t.lastPoint);
-  if (t.type === "ARC")
-    return new ct$1(
-      t.firstPoint,
-      t.lastPoint,
-      t.center,
-      t.clockwise
+const vt = (n) => {
+  if (n.type === "LINE")
+    return new at$2(n.firstPoint, n.lastPoint);
+  if (n.type === "ARC")
+    return new ct$2(
+      n.firstPoint,
+      n.lastPoint,
+      n.center,
+      n.clockwise
     );
-  if (t.type === "ELLIPSE_ARC")
-    return new jt$2(
-      t.firstPoint,
-      t.lastPoint,
-      t.center,
-      t.majorRadius,
-      t.minorRadius,
-      t.tiltAngle,
-      t.clockwise,
+  if (n.type === "ELLIPSE_ARC")
+    return new jt$1(
+      n.firstPoint,
+      n.lastPoint,
+      n.center,
+      n.majorRadius,
+      n.minorRadius,
+      n.tiltAngle,
+      n.clockwise,
       { angleUnits: "rad" }
     );
-  if (t.type === "QUADRATIC_BEZIER")
+  if (n.type === "QUADRATIC_BEZIER")
     return new _t$1(
-      t.firstPoint,
-      t.lastPoint,
-      t.controlPoint
+      n.firstPoint,
+      n.lastPoint,
+      n.controlPoint
     );
-  if (t.type === "CUBIC_BEZIER")
+  if (n.type === "CUBIC_BEZIER")
     return new Et$1(
-      t.firstPoint,
-      t.lastPoint,
-      t.firstControlPoint,
-      t.lastControlPoint
+      n.firstPoint,
+      n.lastPoint,
+      n.firstControlPoint,
+      n.lastControlPoint
     );
   throw new Error("Unknown segment type");
-}, U = (t) => {
-  const n = t.segments.map(mt);
-  return new O$1(n);
-}, wt = (t) => {
-  const n = U(t.contour), e = t.holes.map(U);
-  return new v$2(n, e);
-}, hn = (t) => {
-  const n = t.figures.map(wt);
-  return new _$1(n);
+}, H = (n) => {
+  const t = n.segments.map(vt);
+  return new O(t);
+}, Lt = (n) => {
+  const t = H(n.contour), e = n.holes.map(H);
+  return new v$1(t, e);
+}, bn = (n) => {
+  const t = n.figures.map(Lt);
+  return new _$2(t);
 };
-function vn(t) {
-  if (t.type === "DIAGRAM")
-    return hn(t);
-  if (t.type === "FIGURE")
-    return wt(t);
-  if (t.type === "LOOP")
-    return U(t);
-  if (t.type === "LINE" || t.type === "ARC" || t.type === "ELLIPSE_ARC" || t.type === "CUBIC_BEZIER")
-    return mt(t);
+function zn(n) {
+  if (n.type === "DIAGRAM")
+    return bn(n);
+  if (n.type === "FIGURE")
+    return Lt(n);
+  if (n.type === "LOOP")
+    return H(n);
+  if (n.type === "LINE" || n.type === "ARC" || n.type === "ELLIPSE_ARC" || n.type === "CUBIC_BEZIER")
+    return vt(n);
   throw new Error("Unknown shape type");
 }
-const it = Math.PI / 180, gn = 180 / Math.PI;
-function kn(t, n) {
-  const e = Math.cos(n * it) * t, s = Math.sin(n * it) * t;
+const ft = Math.PI / 180, An = 180 / Math.PI;
+function Tn(n, t) {
+  const e = Math.cos(t * ft) * n, s = Math.sin(t * ft) * n;
   return [e, s];
 }
-function En([t, n]) {
-  const e = Math.sqrt(t * t + n * n), s = Math.atan2(n, t) * gn;
+function $n([n, t]) {
+  const e = Math.sqrt(n * n + t * t), s = Math.atan2(t, n) * An;
   return [e, s];
 }
 
 var pantograph = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  DEG2RAD: it,
-  RAD2DEG: gn,
-  cartesianToPolar: En,
-  confineStrand: Sn,
-  cut: ut,
-  draw: lt$1,
-  eraseStrand: In,
-  exportJSON: Mt,
-  exportSVG: An,
-  fuse: Wt,
-  fuseAll: D,
-  importJSON: vn,
-  intersect: Mn,
-  offset: bn,
-  outlineStroke: Ln,
-  polarToCartesian: kn,
-  svgBody: tt
+  DEG2RAD: ft,
+  RAD2DEG: An,
+  cartesianToPolar: $n,
+  chamfer: R,
+  confineStrand: xn,
+  cut: Pt,
+  draw: lt,
+  eraseStrand: Cn,
+  exportJSON: Mt$1,
+  exportSVG: Rn,
+  fillet: B,
+  fuse: sn,
+  fuseAll: z,
+  importJSON: zn,
+  intersect: yn,
+  offset: On,
+  outlineStroke: Dn,
+  polarToCartesian: Tn,
+  selectCorners: Bn,
+  svgBody: it
 });
 
 function sketchSegment(segment, plane) {
-    if (segment instanceof at$1) {
+    if (segment instanceof at$2) {
         const firstPoint = plane.toWorldCoords(segment.firstPoint);
         const lastPoint = plane.toWorldCoords(segment.lastPoint);
         return makeLine(firstPoint, lastPoint);
     }
-    if (segment instanceof ct$1) {
+    if (segment instanceof ct$2) {
         return makeThreePointArc(plane.toWorldCoords(segment.firstPoint), plane.toWorldCoords(segment.midPoint), plane.toWorldCoords(segment.lastPoint));
     }
-    if (segment instanceof jt$2) {
+    if (segment instanceof jt$1) {
         const xDir = new Vector(plane.xDir).rotate(segment.tiltAngle, plane.origin, plane.zDir);
         return makeEllipseArc(segment.majorRadius, segment.minorRadius, segment.clockwise ? segment.firstAngle : segment.lastAngle, segment.clockwise ? segment.lastAngle : segment.firstAngle, plane.toWorldCoords(segment.center), plane.zDir, xDir);
     }
@@ -7685,18 +7882,18 @@ function sketchOnPlane(pantographObject, planeInput = "XY", origin = [0, 0, 0])
     const plane = planeInput instanceof Plane
         ? makePlane(planeInput)
         : makePlane(planeInput, origin);
-    if (pantographObject instanceof _$1) {
+    if (pantographObject instanceof _$2) {
         return sketchDiagram(pantographObject, plane);
     }
-    if (pantographObject instanceof v$2) {
+    if (pantographObject instanceof v$1) {
         return sketchFigure(pantographObject, plane);
     }
-    if (pantographObject instanceof O$1) {
+    if (pantographObject instanceof O) {
         return sketchStroke(pantographObject, plane);
     }
-    if (pantographObject instanceof at$1 ||
-        pantographObject instanceof ct$1 ||
-        pantographObject instanceof jt$2 ||
+    if (pantographObject instanceof at$2 ||
+        pantographObject instanceof ct$2 ||
+        pantographObject instanceof jt$1 ||
         pantographObject instanceof _t$1 ||
         pantographObject instanceof Et$1) {
         return sketchFromSegments([sketchSegment(pantographObject, plane)], plane);
@@ -7704,16 +7901,16 @@ function sketchOnPlane(pantographObject, planeInput = "XY", origin = [0, 0, 0])
     throw new Error(`Unsupported object type "${pantographObject.constructor.name}"`);
 }
 function toSVGPaths(shape) {
-    if (shape instanceof _$1) {
+    if (shape instanceof _$2) {
         return shape.figures.flatMap(toSVGPaths);
     }
-    else if (shape instanceof v$2) {
+    else if (shape instanceof v$1) {
         return shape.allLoops.map((loop) => w(loop));
     }
-    else if (shape instanceof O$1) {
+    else if (shape instanceof O) {
         return [w(shape)];
     }
-    else if (shape instanceof B$1) {
+    else if (shape instanceof B$2) {
         return [j$1(shape)];
     }
     else if (jn(shape)) {
@@ -7723,13 +7920,13 @@ function toSVGPaths(shape) {
 }
 function toSVGViewBox(shape) {
     const boundingBox = shape.boundingBox;
-    return v$1(boundingBox);
+    return v(boundingBox);
 }
 function wrapPantograph(pantographObject) {
     const isPantograph = jn(pantographObject) ||
-        pantographObject instanceof O$1 ||
-        pantographObject instanceof v$2 ||
-        pantographObject instanceof _$1;
+        pantographObject instanceof O ||
+        pantographObject instanceof v$1 ||
+        pantographObject instanceof _$2;
     if (!isPantograph)
         return pantographObject;
     const shape = pantographObject.mirror();