dielines 0.9.1 → 0.10.1

package/dist/dielines.js

@@ -1,13 +1,13 @@
-var zi = Object.defineProperty;
-var Di = (i, t, e) => t in i ? zi(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e;
-var St = (i, t, e) => Di(i, typeof t != "symbol" ? t + "" : t, e);
-var Ui = Object.defineProperty, ni = (i) => {
+var Di = Object.defineProperty;
+var Ui = (i, t, e) => t in i ? Di(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e;
+var St = (i, t, e) => Ui(i, typeof t != "symbol" ? t + "" : t, e);
+var Yi = Object.defineProperty, si = (i) => {
   throw TypeError(i);
-}, Yi = (i, t, e) => t in i ? Ui(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, F = (i, t, e) => Yi(i, typeof t != "symbol" ? t + "" : t, e), tn = (i, t, e) => t.has(i) || ni("Cannot " + e), Mt = (i, t, e) => (tn(i, t, "read from private field"), e ? e.call(i) : t.get(i)), ii = (i, t, e) => t.has(i) ? ni("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(i) : t.set(i, e), Ne = (i, t, e, n) => (tn(i, t, "write to private field"), t.set(i, e), e), dn = (i, t, e) => (tn(i, t, "access private method"), e);
+}, Xi = (i, t, e) => t in i ? Yi(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, F = (i, t, e) => Xi(i, typeof t != "symbol" ? t + "" : t, e), en = (i, t, e) => t.has(i) || si("Cannot " + e), Mt = (i, t, e) => (en(i, t, "read from private field"), e ? e.call(i) : t.get(i)), ri = (i, t, e) => t.has(i) ? si("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(i) : t.set(i, e), Oe = (i, t, e, n) => (en(i, t, "write to private field"), t.set(i, e), e), Mn = (i, t, e) => (en(i, t, "access private method"), e);
 function me(i, t, e, n) {
   return i <= n && t >= e;
 }
-let re = class Qt {
+let oe = class Qt {
   constructor(t = 1 / 0, e = 1 / 0, n = -1 / 0, s = -1 / 0) {
     F(this, "xMin"), F(this, "yMin"), F(this, "xMax"), F(this, "yMax"), this.xMin = t, this.yMin = e, this.xMax = n, this.yMax = s;
   }
@@ -61,10 +61,10 @@ let re = class Qt {
     );
   }
 };
-function en(i) {
-  return i.reduce((t, e) => t.addPoint(e), new re());
+function nn(i) {
+  return i.reduce((t, e) => t.addPoint(e), new oe());
 }
-const Pn = (i, t = 1e-9) => {
+const yn = (i, t = 1e-9) => {
   let e = i;
   return Math.abs(i) < t && (e = 0), e.toFixed(-Math.log10(t));
 };
@@ -72,17 +72,17 @@ function At(i, t = 1e-9) {
   return Array.from(
     new Map(
       i.map(([e, n]) => [
-        `[${Pn(e, t)},${Pn(n, t)}]`,
+        `[${yn(e, t)},${yn(n, t)}]`,
         [e, n]
       ])
     ).values()
   );
 }
-const _t = Math.PI / 180, nn = 180 / Math.PI, it = (i) => `[${i[0]}, ${i[1]}]`, k = ([i, t], [e, n], s = 1e-9) => Math.abs(i - e) <= s && Math.abs(t - n) <= s, X = ([i, t], [e, n]) => [i + e, t + n], q = ([i, t], [e, n]) => [i - e, t - n], yt = ([i, t]) => i * i + t * t, Xi = ([i, t]) => Math.sqrt(yt([i, t])), Q = ([i, t], e) => [i * e, t * e], Ft = ([i, t], [e, n] = [0, 0]) => (i - e) ** 2 + (t - n) ** 2, J = (i, t = [0, 0]) => Math.sqrt(Ft(i, t));
+const $t = Math.PI / 180, sn = 180 / Math.PI, it = (i) => `[${i[0]}, ${i[1]}]`, R = ([i, t], [e, n], s = 1e-9) => Math.abs(i - e) <= s && Math.abs(t - n) <= s, X = ([i, t], [e, n]) => [i + e, t + n], q = ([i, t], [e, n]) => [i - e, t - n], yt = ([i, t]) => i * i + t * t, Wi = ([i, t]) => Math.sqrt(yt([i, t])), Q = ([i, t], e) => [i * e, t * e], _t = ([i, t], [e, n] = [0, 0]) => (i - e) ** 2 + (t - n) ** 2, J = (i, t = [0, 0]) => Math.sqrt(_t(i, t));
 function bt([i, t], [e, n]) {
   return i * n - t * e;
 }
-function Se([i, t], [e, n]) {
+function ke([i, t], [e, n]) {
   return i * e + t * n;
 }
 function ot([i, t]) {
@@ -93,25 +93,25 @@ function vt(i, t) {
   const e = Math.cos(t) * i, n = Math.sin(t) * i;
   return [e, n];
 }
-function Wi([i, t]) {
+function Hi([i, t]) {
   return Math.atan2(t, i);
 }
-function si(i) {
-  const t = J(i), e = Wi(i);
+function oi(i) {
+  const t = J(i), e = Hi(i);
   return [t, e];
 }
-function sn(i, t, e = 1e-9) {
+function rn(i, t, e = 1e-9) {
   const n = bt(i, t), s = yt(i), r = yt(t);
   return n * n < s * r * e * e;
 }
 function nt(i) {
   return [-i[1], i[0]];
 }
-function Zt(i) {
+function Kt(i) {
   return [i[1], -i[0]];
 }
-function Hi(i, t, e) {
-  return k(e, i) || sn(q(e, i), t);
+function Qi(i, t, e) {
+  return R(e, i) || rn(q(e, i), t);
 }
 const Bt = (i, t) => {
   const [e, n, s, r, o, a, h, l, c] = i, [u, m, w, g, p, M, f, P, b] = t;
@@ -126,7 +126,7 @@ const Bt = (i, t) => {
     h * m + l * p + c * P,
     h * w + l * M + c * b
   ];
-}, Qi = (i) => {
+}, Gi = (i) => {
   const [t, e, n, s, r, o, a, h, l] = i, c = t * (r * l - o * h) - e * (s * l - o * a) + n * (s * h - r * a);
   return [
     (r * l - o * h) / c,
@@ -139,22 +139,22 @@ const Bt = (i, t) => {
     (e * a - t * h) / c,
     (t * r - e * s) / c
   ];
-}, Gi = (i) => {
+}, Ji = (i) => {
   const [t, e, n, s, r, o, a, h, l] = i;
   return [t, s, a, e, r, h, n, o, l];
 };
-let ct = class ri {
+let ct = class ai {
   constructor(t) {
     F(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]), t && (this._matrix = [...t]);
   }
   clone() {
-    return new ri(this._matrix);
+    return new ai(this._matrix);
   }
   transpose() {
-    return this._matrix = Gi(this._matrix), this;
+    return this._matrix = Ji(this._matrix), this;
   }
   inverse() {
-    return this._matrix = Qi(this._matrix), this;
+    return this._matrix = Gi(this._matrix), this;
   }
   translate(t, e) {
     return this._matrix = Bt([1, 0, t, 0, 1, e, 0, 0, 1], this._matrix), this;
@@ -196,7 +196,7 @@ let ct = class ri {
     return Math.sqrt(t * t + e * e);
   }
 };
-class Lt {
+class Ft {
   translateX(t) {
     const e = new ct().translate(t, 0);
     return this.transform(e);
@@ -215,7 +215,7 @@ class Lt {
   }
   rotate(t, e) {
     const n = new ct().rotate(
-      t * _t,
+      t * $t,
       e
     );
     return this.transform(n);
@@ -233,7 +233,7 @@ class Lt {
     return t === "x" ? n.mirrorX() : t === "y" ? n.mirrorY() : n.mirrorLine(t, e), this.transform(n);
   }
 }
-let oe = class extends Lt {
+let ae = class extends Ft {
   constructor(t, e) {
     super(), F(this, "precision", 1e-9), this.firstPoint = t, this.lastPoint = e, this.firstPoint = t, this.lastPoint = e;
   }
@@ -248,7 +248,7 @@ let oe = class extends Lt {
   [Symbol.for("nodejs.util.inspect.custom")]() {
     return this.repr;
   }
-}, D = class jt extends oe {
+}, D = class jt extends ae {
   constructor() {
     super(...arguments), F(this, "segmentType", "LINE"), F(this, "_V", null), F(this, "_slope", null), F(this, "_yIntercept", null), F(this, "_boundingBox", null);
   }
@@ -263,7 +263,7 @@ let oe = class extends Lt {
     return J(this.firstPoint, this.lastPoint);
   }
   get squareLength() {
-    return Ft(this.firstPoint, this.lastPoint);
+    return _t(this.firstPoint, this.lastPoint);
   }
   get V() {
     return this._V === null && (this._V = q(this.lastPoint, this.firstPoint)), this._V;
@@ -282,7 +282,7 @@ let oe = class extends Lt {
     return X(this.firstPoint, Q(this.V, 0.5));
   }
   isSame(t) {
-    return t instanceof jt ? k(this.firstPoint, t.firstPoint) && k(this.lastPoint, t.lastPoint) || k(this.lastPoint, t.firstPoint) && k(this.firstPoint, t.lastPoint) : !1;
+    return t instanceof jt ? R(this.firstPoint, t.firstPoint) && R(this.lastPoint, t.lastPoint) || R(this.lastPoint, t.firstPoint) && R(this.firstPoint, t.lastPoint) : !1;
   }
   clone() {
     return new jt(this.firstPoint, this.lastPoint);
@@ -291,7 +291,7 @@ let oe = class extends Lt {
     return new jt(this.lastPoint, this.firstPoint);
   }
   get boundingBox() {
-    return this._boundingBox === null && (this._boundingBox = new re(
+    return this._boundingBox === null && (this._boundingBox = new oe(
       Math.min(this.firstPoint[0], this.lastPoint[0]) - this.precision,
       Math.min(this.firstPoint[1], this.lastPoint[1]) - this.precision,
       Math.max(this.firstPoint[0], this.lastPoint[0]) + this.precision,
@@ -299,7 +299,7 @@ let oe = class extends Lt {
     )), this._boundingBox;
   }
   distanceFrom(t) {
-    const e = q(t, this.firstPoint), n = Se(e, this.V) / this.squareLength;
+    const e = q(t, this.firstPoint), n = ke(e, this.V) / this.squareLength;
     if (n < 0)
       return J(t, this.firstPoint);
     if (n > 1)
@@ -308,10 +308,10 @@ let oe = class extends Lt {
     return J(t, s);
   }
   isOnSegment(t) {
-    if (k(t, this.firstPoint, this.precision)) return !0;
+    if (R(t, this.firstPoint, this.precision)) return !0;
     const e = q(t, this.firstPoint);
-    if (!sn(this.V, e)) return !1;
-    const n = Se(e, this.V) / this.squareLength;
+    if (!rn(this.V, e)) return !1;
+    const n = ke(e, this.V) / this.squareLength;
     return this.isValidParameter(n);
   }
   gradientAt(t) {
@@ -353,21 +353,21 @@ let oe = class extends Lt {
     );
   }
 };
-function Ji(i) {
+function Zi(i) {
   return Array.from(Array(i).keys());
 }
 function Pt(i) {
   const t = Math.min(...i.map((e) => e.length));
-  return Ji(t).map((e) => i.map((n) => n[e]));
+  return Zi(t).map((e) => i.map((n) => n[e]));
 }
-function $t(i, t = 1e-9) {
+function Tt(i, t = 1e-9) {
   return i < 0 ? i + 2 * Math.PI : i >= 2 * Math.PI ? i % (2 * Math.PI) : i > 2 * Math.PI - t ? 0 : i;
 }
-function ke(i, t, e, n = 1e-9) {
+function Re(i, t, e, n = 1e-9) {
   let s = t - i;
   return e && (s = -s), s < 0 && (s += 2 * Math.PI), s > 2 * Math.PI - n ? 0 : s;
 }
-const Ie = (i, t, e) => {
+const _e = (i, t, e) => {
   const n = bt(i.V, t.V), s = yt(i.V), r = yt(t.V), o = e ? e * e : i.precision * t.precision;
   if (n * n < s * r * o)
     return "parallel";
@@ -377,8 +377,8 @@ const Ie = (i, t, e) => {
     intersectionParam2: l
   };
 };
-function oi(i, t, e = !1, n) {
-  const s = Ie(i, t, n);
+function hi(i, t, e = !1, n) {
+  const s = _e(i, t, n);
   if (s === "parallel") {
     if (!e) return null;
     if (i.isSame(t)) return i;
@@ -401,12 +401,12 @@ function oi(i, t, e = !1, n) {
 }
 const ge = (i, t) => {
   const e = q(i, t);
-  return si(e);
+  return oi(e);
 };
-let z = class qt extends oe {
+let z = class qt extends ae {
   constructor(t, e, n, s = !1, { ignoreChecks: r = !1 } = {}) {
     if (super(t, e), F(this, "segmentType", "ARC"), F(this, "center"), F(this, "clockwise"), F(this, "_coefficients", null), F(this, "_angularLength", null), F(this, "_radius", null), F(this, "_firstAngle", null), F(this, "_lastAngle", null), F(this, "_boundingBox", null), this.center = n, this.clockwise = s, !r) {
-      if (k(t, e))
+      if (R(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (Math.abs(this.radius - J(this.lastPoint, this.center)) > this.precision)
         throw new Error(
@@ -439,10 +439,10 @@ let z = class qt extends oe {
     return 1 - t >= -this.precision && t >= -this.precision;
   }
   angleToParam(t) {
-    return ke(this.firstAngle, $t(t), this.clockwise) / this.angularLength;
+    return Re(this.firstAngle, Tt(t), this.clockwise) / this.angularLength;
   }
   get angularLength() {
-    return this._angularLength || (this._angularLength = ke(
+    return this._angularLength || (this._angularLength = Re(
       this.firstAngle,
       this.lastAngle,
       this.clockwise
@@ -476,14 +476,14 @@ let z = class qt extends oe {
   get firstAngle() {
     if (this._firstAngle === null) {
       const [t, e] = q(this.firstPoint, this.center);
-      this._firstAngle = $t(Math.atan2(e, t));
+      this._firstAngle = Tt(Math.atan2(e, t));
     }
     return this._firstAngle;
   }
   get lastAngle() {
     if (this._lastAngle === null) {
       const [t, e] = q(this.lastPoint, this.center);
-      this._lastAngle = $t(Math.atan2(e, t));
+      this._lastAngle = Tt(Math.atan2(e, t));
     }
     return this._lastAngle;
   }
@@ -497,7 +497,7 @@ let z = class qt extends oe {
     return this.paramPoint(0.5);
   }
   isSame(t) {
-    return !(t instanceof qt) || !k(this.center, t.center) ? !1 : k(this.firstPoint, t.firstPoint) && k(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || k(this.lastPoint, t.firstPoint) && k(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
+    return !(t instanceof qt) || !R(this.center, t.center) ? !1 : R(this.firstPoint, t.firstPoint) && R(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || R(this.lastPoint, t.firstPoint) && R(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
   }
   clone() {
     return new qt(
@@ -518,7 +518,7 @@ let z = class qt extends oe {
   get boundingBox() {
     if (this._boundingBox === null) {
       const t = this.radius + this.precision, e = (n) => this.isValidParameter(this.angleToParam(n));
-      this._boundingBox = new re(
+      this._boundingBox = new oe(
         e(Math.PI) ? this.center[0] - t : Math.min(this.firstPoint[0], this.lastPoint[0]) - this.precision,
         e(Math.PI * 1.5) ? this.center[1] - t : Math.min(this.firstPoint[1], this.lastPoint[1]) - this.precision,
         e(0) ? this.center[0] + t : Math.max(this.firstPoint[0], this.lastPoint[0]) + this.precision,
@@ -531,13 +531,13 @@ let z = class qt extends oe {
     const [e, n] = ge(t, this.center);
     return this.isValidParameter(this.angleToParam(n)) ? Math.abs(e - this.radius) : Math.sqrt(
       Math.min(
-        Ft(t, this.firstPoint),
-        Ft(t, this.lastPoint)
+        _t(t, this.firstPoint),
+        _t(t, this.lastPoint)
       )
     );
   }
   isOnSegment(t) {
-    if (k(t, this.firstPoint) || k(t, this.lastPoint))
+    if (R(t, this.firstPoint) || R(t, this.lastPoint))
       return !0;
     const [e, n] = ge(t, this.center);
     if (Math.abs(e - this.radius) > this.precision) return !1;
@@ -556,15 +556,15 @@ let z = class qt extends oe {
     if (!this.isValidParameter(s))
       throw new Error("Point is not on the arc");
     const r = vt(1, n);
-    return (this.clockwise ? Zt : nt)(ot(r));
+    return (this.clockwise ? Kt : nt)(ot(r));
   }
   get tangentAtFirstPoint() {
     const t = vt(1, this.firstAngle);
-    return (this.clockwise ? Zt : nt)(ot(t));
+    return (this.clockwise ? Kt : nt)(ot(t));
   }
   get tangentAtLastPoint() {
     const t = vt(1, this.lastAngle);
-    return (this.clockwise ? Zt : nt)(ot(t));
+    return (this.clockwise ? Kt : nt)(ot(t));
   }
   splitAt(t) {
     let e;
@@ -599,8 +599,8 @@ let z = class qt extends oe {
     );
   }
 };
-function Zi(i, t, e) {
-  const n = new D(t, i), s = new D(t, e), r = nt(n.tangentAtFirstPoint), o = nt(s.tangentAtLastPoint), a = Ie(
+function Ki(i, t, e) {
+  const n = new D(t, i), s = new D(t, e), r = nt(n.tangentAtFirstPoint), o = nt(s.tangentAtLastPoint), a = _e(
     { firstPoint: n.midPoint, V: r, precision: 1e-9 },
     { firstPoint: s.midPoint, V: o, precision: 1e-9 }
   );
@@ -618,8 +618,8 @@ function Zi(i, t, e) {
     { ignoreChecks: !0 }
   );
 }
-function ai(i, t, e) {
-  const n = new D(i, t), s = nt(n.tangentAtFirstPoint), r = Ie(
+function li(i, t, e) {
+  const n = new D(i, t), s = nt(n.tangentAtFirstPoint), r = _e(
     { firstPoint: n.midPoint, V: s, precision: 1e-9 },
     {
       firstPoint: i,
@@ -640,11 +640,11 @@ function ai(i, t, e) {
     ignoreChecks: !0
   });
 }
-const Mn = 1e-21, pe = 1.618034;
-function yn(i, t = 0, e = 1, n = 110, s = 1e3) {
+const bn = 1e-21, pe = 1.618034;
+function xn(i, t = 0, e = 1, n = 110, s = 1e3) {
   let r, o, a, h, l, c, u, m, w, g, p, M, f;
   for (o = i(t), a = i(e), o < a && ([t, e] = [e, t], [o, a] = [a, o]), f = e + pe * (e - t), h = i(f), l = 3, u = 0; h < a; ) {
-    if (m = (e - t) * (a - h), w = (e - f) * (a - o), g = w - m, Math.abs(g) < Mn ? r = 2 * Mn : r = 2 * g, p = e - ((e - f) * w - (e - t) * m) / r, M = e + n * (f - e), u > s)
+    if (m = (e - t) * (a - h), w = (e - f) * (a - o), g = w - m, Math.abs(g) < bn ? r = 2 * bn : r = 2 * g, p = e - ((e - f) * w - (e - t) * m) / r, M = e + n * (f - e), u > s)
       throw new Error("Too many iterations.");
     if (u += 1, (p - f) * (e - p) > 0) {
       if (c = i(p), l += 1, c < h)
@@ -658,8 +658,8 @@ function yn(i, t = 0, e = 1, n = 110, s = 1e3) {
   }
   return [t, e, f, o, a, h, l];
 }
-const bn = 0.381966, Ki = 1e-11;
-class ts {
+const vn = 0.381966, ts = 1e-11;
+class es {
   constructor(t, e = 148e-10, n = 500) {
     F(this, "xmin"), F(this, "fval"), F(this, "iter"), F(this, "funcalls"), F(this, "brack"), this.func = t, this.tol = e, this.maxiter = n, this.func = t, this.tol = e, this.maxiter = n, this.xmin = 1 / 0, this.fval = 1 / 0, this.iter = 0, this.funcalls = 0, this.brack = null;
   }
@@ -670,9 +670,9 @@ class ts {
     let t, e, n, s, r, o, a;
     const h = this.func, l = this.brack;
     if (l === null)
-      [r, o, a, t, e, n, s] = yn(h);
+      [r, o, a, t, e, n, s] = xn(h);
     else if (l.length === 2)
-      [r, o, a, t, e, n, s] = yn(h, l[0], l[1]);
+      [r, o, a, t, e, n, s] = xn(h, l[0], l[1]);
     else if (l.length === 3) {
       if ([r, o, a] = l, r > a && ([a, r] = [r, a]), !(r < o && o < a))
         throw new Error("Not a bracketing interval.");
@@ -693,17 +693,17 @@ class ts {
     r = 1;
     let p = 0, M = 0, f;
     for (; p < this.maxiter; ) {
-      const P = this.tol * Math.abs(o) + Ki, b = 2 * P, R = 0.5 * (m + w);
-      if (Math.abs(o - R) < b - 0.5 * (w - m))
+      const P = this.tol * Math.abs(o) + ts, b = 2 * P, S = 0.5 * (m + w);
+      if (Math.abs(o - S) < b - 0.5 * (w - m))
         break;
       if (Math.abs(g) <= P)
-        o >= R ? g = m - o : g = w - o, M = bn * g;
+        o >= S ? g = m - o : g = w - o, M = vn * g;
       else {
         const V = (o - a) * (u - c);
-        let v = (o - h) * (u - l), S = (o - h) * v - (o - a) * V;
-        v = 2 * (v - V), v > 0 && (S = -S), v = Math.abs(v);
+        let v = (o - h) * (u - l), k = (o - h) * v - (o - a) * V;
+        v = 2 * (v - V), v > 0 && (k = -k), v = Math.abs(v);
         const j = g;
-        g = M, S > v * (m - o) && S < v * (w - o) && Math.abs(S) < Math.abs(0.5 * v * j) ? (M = S * 1 / v, f = o + M, (f - m < b || w - f < b) && (R - o >= 0 ? M = P : M = -P)) : (o >= R ? g = m - o : g = w - o, M = bn * g);
+        g = M, k > v * (m - o) && k < v * (w - o) && Math.abs(k) < Math.abs(0.5 * v * j) ? (M = k * 1 / v, f = o + M, (f - m < b || w - f < b) && (S - o >= 0 ? M = P : M = -P)) : (o >= S ? g = m - o : g = w - o, M = vn * g);
       }
       Math.abs(M) < P ? M >= 0 ? f = o + P : f = o - P : f = o + M;
       const C = t(f);
@@ -723,11 +723,11 @@ class ts {
     return this.optimize(), this.results();
   }
 }
-function hi(i, t = 1e-8, e = 1e3) {
-  const n = new ts(i, t, e);
+function ui(i, t = 1e-8, e = 1e3) {
+  const n = new es(i, t, e);
   return n.setBracket([0, 1]), n.run();
 }
-function li(i) {
+function ci(i) {
   if (i.__esModule) return i;
   var t = i.default;
   if (typeof t == "function") {
@@ -747,18 +747,18 @@ function li(i) {
   }), e;
 }
 var O = {};
-const es = Object.prototype.toString;
-function ee(i) {
-  const t = es.call(i);
+const ns = Object.prototype.toString;
+function ne(i) {
+  const t = ns.call(i);
   return t.endsWith("Array]") && !t.includes("Big");
 }
-const ns = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const is = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  isAnyArray: ee
-}, Symbol.toStringTag, { value: "Module" })), is = /* @__PURE__ */ li(ns);
-function ss(i) {
+  isAnyArray: ne
+}, Symbol.toStringTag, { value: "Module" })), ss = /* @__PURE__ */ ci(is);
+function rs(i) {
   var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  if (!ee(i))
+  if (!ne(i))
     throw new TypeError("input must be an array");
   if (i.length === 0)
     throw new TypeError("input must not be empty");
@@ -771,9 +771,9 @@ function ss(i) {
     i[a] > o && (o = i[a]);
   return o;
 }
-function rs(i) {
+function os(i) {
   var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  if (!ee(i))
+  if (!ne(i))
     throw new TypeError("input must be an array");
   if (i.length === 0)
     throw new TypeError("input must not be empty");
@@ -786,20 +786,20 @@ function rs(i) {
     i[a] < o && (o = i[a]);
   return o;
 }
-function os(i) {
+function as(i) {
   var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  if (ee(i)) {
+  if (ne(i)) {
     if (i.length === 0)
       throw new TypeError("input must not be empty");
   } else throw new TypeError("input must be an array");
   var e;
   if (t.output !== void 0) {
-    if (!ee(t.output))
+    if (!ne(t.output))
       throw new TypeError("output option must be an array if specified");
     e = t.output;
   } else
     e = new Array(i.length);
-  var n = rs(i), s = ss(i);
+  var n = os(i), s = rs(i);
   if (n === s)
     throw new RangeError("minimum and maximum input values are equal. Cannot rescale a constant array");
   var r = t.min, o = r === void 0 ? t.autoMinMax ? n : 0 : r, a = t.max, h = a === void 0 ? t.autoMinMax ? s : 1 : a;
@@ -809,17 +809,17 @@ function os(i) {
     e[c] = (i[c] - n) * l + o;
   return e;
 }
-const as = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  default: os
-}, Symbol.toStringTag, { value: "Module" })), hs = /* @__PURE__ */ li(as);
+  default: as
+}, Symbol.toStringTag, { value: "Module" })), ls = /* @__PURE__ */ ci(hs);
 Object.defineProperty(O, "__esModule", { value: !0 });
-var ft = is, xn = hs;
-const we = " ".repeat(2), ui = " ".repeat(4);
-function ls() {
-  return ci(this);
+var ft = ss, An = ls;
+const we = " ".repeat(2), fi = " ".repeat(4);
+function us() {
+  return mi(this);
 }
-function ci(i, t = {}) {
+function mi(i, t = {}) {
   const {
     maxRows: e = 15,
     maxColumns: n = 10,
@@ -828,13 +828,13 @@ function ci(i, t = {}) {
   } = t;
   return `${i.constructor.name} {
 ${we}[
-${ui}${us(i, e, n, s, r)}
+${fi}${cs(i, e, n, s, r)}
 ${we}]
 ${we}rows: ${i.rows}
 ${we}columns: ${i.columns}
 }`;
 }
-function us(i, t, e, n, s) {
+function cs(i, t, e, n, s) {
   const { rows: r, columns: o } = i, a = Math.min(r, t), h = Math.min(o, e), l = [];
   if (s === "auto") {
     s = !1;
@@ -848,16 +848,16 @@ function us(i, t, e, n, s) {
   for (let c = 0; c < a; c++) {
     let u = [];
     for (let m = 0; m < h; m++)
-      u.push(cs(i.get(c, m), n, s));
+      u.push(fs(i.get(c, m), n, s));
     l.push(`${u.join(" ")}`);
   }
   return h !== o && (l[l.length - 1] += ` ... ${o - e} more columns`), a !== r && l.push(`... ${r - t} more rows`), l.join(`
-${ui}`);
+${fi}`);
 }
-function cs(i, t, e) {
-  return (i >= 0 && e ? ` ${vn(i, t - 1)}` : vn(i, t)).padEnd(t);
+function fs(i, t, e) {
+  return (i >= 0 && e ? ` ${En(i, t - 1)}` : En(i, t)).padEnd(t);
 }
-function vn(i, t) {
+function En(i, t) {
   let e = i.toString();
   if (e.length <= t) return e;
   let n = i.toFixed(t);
@@ -866,7 +866,7 @@ function vn(i, t) {
   let s = i.toExponential(t);
   return s.length > t && (s = i.toExponential(Math.max(0, t - (s.length - t)))), s.slice(0);
 }
-function fs(i, t) {
+function ms(i, t) {
   i.prototype.add = function(e) {
     return typeof e == "number" ? this.addS(e) : this.addM(e);
   }, i.prototype.addS = function(e) {
@@ -1286,27 +1286,27 @@ function Ot(i, t) {
     throw new RangeError("vector size must be the same as the number of rows");
   return t;
 }
-function rn(i, t) {
+function on(i, t) {
   if (!ft.isAnyArray(t))
     throw new TypeError("row indices must be an array");
   for (let e = 0; e < t.length; e++)
     if (t[e] < 0 || t[e] >= i.rows)
       throw new RangeError("row indices are out of range");
 }
-function on(i, t) {
+function an(i, t) {
   if (!ft.isAnyArray(t))
     throw new TypeError("column indices must be an array");
   for (let e = 0; e < t.length; e++)
     if (t[e] < 0 || t[e] >= i.columns)
       throw new RangeError("column indices are out of range");
 }
-function Ye(i, t, e, n, s) {
+function Xe(i, t, e, n, s) {
   if (arguments.length !== 5)
     throw new RangeError("expected 4 arguments");
   if (de("startRow", t), de("endRow", e), de("startColumn", n), de("endColumn", s), t > e || n > s || t < 0 || t >= i.rows || e < 0 || e >= i.rows || n < 0 || n >= i.columns || s < 0 || s >= i.columns)
     throw new RangeError("Submatrix indices are out of range");
 }
-function _e(i, t = 0) {
+function Fe(i, t = 0) {
   let e = [];
   for (let n = 0; n < i; n++)
     e.push(t);
@@ -1320,49 +1320,49 @@ function Vt(i) {
   if (i.isEmpty())
     throw new Error("Empty matrix has no elements to index");
 }
-function ms(i) {
-  let t = _e(i.rows);
+function gs(i) {
+  let t = Fe(i.rows);
   for (let e = 0; e < i.rows; ++e)
     for (let n = 0; n < i.columns; ++n)
       t[e] += i.get(e, n);
   return t;
 }
-function gs(i) {
-  let t = _e(i.columns);
+function ps(i) {
+  let t = Fe(i.columns);
   for (let e = 0; e < i.rows; ++e)
     for (let n = 0; n < i.columns; ++n)
       t[n] += i.get(e, n);
   return t;
 }
-function ps(i) {
+function ws(i) {
   let t = 0;
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       t += i.get(e, n);
   return t;
 }
-function ws(i) {
-  let t = _e(i.rows, 1);
+function ds(i) {
+  let t = Fe(i.rows, 1);
   for (let e = 0; e < i.rows; ++e)
     for (let n = 0; n < i.columns; ++n)
       t[e] *= i.get(e, n);
   return t;
 }
-function ds(i) {
-  let t = _e(i.columns, 1);
+function Ps(i) {
+  let t = Fe(i.columns, 1);
   for (let e = 0; e < i.rows; ++e)
     for (let n = 0; n < i.columns; ++n)
       t[n] *= i.get(e, n);
   return t;
 }
-function Ps(i) {
+function Ms(i) {
   let t = 1;
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       t *= i.get(e, n);
   return t;
 }
-function Ms(i, t, e) {
+function ys(i, t, e) {
   const n = i.rows, s = i.columns, r = [];
   for (let o = 0; o < n; o++) {
     let a = 0, h = 0, l = 0;
@@ -1372,7 +1372,7 @@ function Ms(i, t, e) {
   }
   return r;
 }
-function ys(i, t, e) {
+function bs(i, t, e) {
   const n = i.rows, s = i.columns, r = [];
   for (let o = 0; o < s; o++) {
     let a = 0, h = 0, l = 0;
@@ -1382,7 +1382,7 @@ function ys(i, t, e) {
   }
   return r;
 }
-function bs(i, t, e) {
+function xs(i, t, e) {
   const n = i.rows, s = i.columns, r = n * s;
   let o = 0, a = 0, h = 0;
   for (let l = 0; l < n; l++)
@@ -1390,22 +1390,22 @@ function bs(i, t, e) {
       h = i.get(l, c) - e, o += h, a += h * h;
   return t ? (a - o * o / r) / (r - 1) : (a - o * o / r) / r;
 }
-function xs(i, t) {
+function vs(i, t) {
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       i.set(e, n, i.get(e, n) - t[e]);
 }
-function vs(i, t) {
+function As(i, t) {
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       i.set(e, n, i.get(e, n) - t[n]);
 }
-function As(i, t) {
+function Es(i, t) {
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       i.set(e, n, i.get(e, n) - t);
 }
-function Es(i) {
+function Ss(i) {
   const t = [];
   for (let e = 0; e < i.rows; e++) {
     let n = 0;
@@ -1415,12 +1415,12 @@ function Es(i) {
   }
   return t;
 }
-function Ss(i, t) {
+function ks(i, t) {
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       i.set(e, n, i.get(e, n) / t[e]);
 }
-function ks(i) {
+function Rs(i) {
   const t = [];
   for (let e = 0; e < i.columns; e++) {
     let n = 0;
@@ -1430,12 +1430,12 @@ function ks(i) {
   }
   return t;
 }
-function Rs(i, t) {
+function Cs(i, t) {
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       i.set(e, n, i.get(e, n) / t[n]);
 }
-function Cs(i) {
+function Ts(i) {
   const t = i.size - 1;
   let e = 0;
   for (let n = 0; n < i.columns; n++)
@@ -1443,7 +1443,7 @@ function Cs(i) {
       e += i.get(s, n) ** 2 / t;
   return Math.sqrt(e);
 }
-function Ts(i, t) {
+function Is(i, t) {
   for (let e = 0; e < i.rows; e++)
     for (let n = 0; n < i.columns; n++)
       i.set(e, n, i.get(e, n) / t);
@@ -2003,14 +2003,14 @@ let Z = class st {
   strassen2x2(t) {
     t = E.checkMatrix(t);
     let e = new E(2, 2);
-    const n = this.get(0, 0), s = t.get(0, 0), r = this.get(0, 1), o = t.get(0, 1), a = this.get(1, 0), h = t.get(1, 0), l = this.get(1, 1), c = t.get(1, 1), u = (n + l) * (s + c), m = (a + l) * s, w = n * (o - c), g = l * (h - s), p = (n + r) * c, M = (a - n) * (s + o), f = (r - l) * (h + c), P = u + g - p + f, b = w + p, R = m + g, C = u - m + w + M;
-    return e.set(0, 0, P), e.set(0, 1, b), e.set(1, 0, R), e.set(1, 1, C), e;
+    const n = this.get(0, 0), s = t.get(0, 0), r = this.get(0, 1), o = t.get(0, 1), a = this.get(1, 0), h = t.get(1, 0), l = this.get(1, 1), c = t.get(1, 1), u = (n + l) * (s + c), m = (a + l) * s, w = n * (o - c), g = l * (h - s), p = (n + r) * c, M = (a - n) * (s + o), f = (r - l) * (h + c), P = u + g - p + f, b = w + p, S = m + g, C = u - m + w + M;
+    return e.set(0, 0, P), e.set(0, 1, b), e.set(1, 0, S), e.set(1, 1, C), e;
   }
   strassen3x3(t) {
     t = E.checkMatrix(t);
     let e = new E(3, 3);
-    const n = this.get(0, 0), s = this.get(0, 1), r = this.get(0, 2), o = this.get(1, 0), a = this.get(1, 1), h = this.get(1, 2), l = this.get(2, 0), c = this.get(2, 1), u = this.get(2, 2), m = t.get(0, 0), w = t.get(0, 1), g = t.get(0, 2), p = t.get(1, 0), M = t.get(1, 1), f = t.get(1, 2), P = t.get(2, 0), b = t.get(2, 1), R = t.get(2, 2), C = (n + s + r - o - a - c - u) * M, V = (n - o) * (-w + M), v = a * (-m + w + p - M - f - P + R), S = (-n + o + a) * (m - w + M), j = (o + a) * (-m + w), d = n * m, x = (-n + l + c) * (m - g + f), A = (-n + l) * (g - f), y = (l + c) * (-m + g), $ = (n + s + r - a - h - l - c) * f, I = c * (-m + g + p - M - f - P + b), _ = (-r + c + u) * (M + P - b), W = (r - u) * (M - b), L = r * P, N = (c + u) * (-P + b), B = (-r + a + h) * (f + P - R), Y = (r - h) * (f - R), H = (a + h) * (-P + R), T = s * p, U = h * b, tt = o * g, K = l * w, G = u * R, Be = d + L + T, Ve = C + S + j + d + _ + L + N, je = d + x + y + $ + L + B + H, qe = V + v + S + d + L + B + Y, he = V + S + j + d + U, le = L + B + Y + H + tt, ue = d + x + A + I + _ + W + L, ce = _ + W + L + N + K, fe = d + x + A + y + G;
-    return e.set(0, 0, Be), e.set(0, 1, Ve), e.set(0, 2, je), e.set(1, 0, qe), e.set(1, 1, he), e.set(1, 2, le), e.set(2, 0, ue), e.set(2, 1, ce), e.set(2, 2, fe), e;
+    const n = this.get(0, 0), s = this.get(0, 1), r = this.get(0, 2), o = this.get(1, 0), a = this.get(1, 1), h = this.get(1, 2), l = this.get(2, 0), c = this.get(2, 1), u = this.get(2, 2), m = t.get(0, 0), w = t.get(0, 1), g = t.get(0, 2), p = t.get(1, 0), M = t.get(1, 1), f = t.get(1, 2), P = t.get(2, 0), b = t.get(2, 1), S = t.get(2, 2), C = (n + s + r - o - a - c - u) * M, V = (n - o) * (-w + M), v = a * (-m + w + p - M - f - P + S), k = (-n + o + a) * (m - w + M), j = (o + a) * (-m + w), d = n * m, x = (-n + l + c) * (m - g + f), A = (-n + l) * (g - f), y = (l + c) * (-m + g), I = (n + s + r - a - h - l - c) * f, $ = c * (-m + g + p - M - f - P + b), _ = (-r + c + u) * (M + P - b), W = (r - u) * (M - b), L = r * P, N = (c + u) * (-P + b), B = (-r + a + h) * (f + P - S), Y = (r - h) * (f - S), H = (a + h) * (-P + S), T = s * p, U = h * b, tt = o * g, K = l * w, G = u * S, Ve = d + L + T, je = C + k + j + d + _ + L + N, qe = d + x + y + I + L + B + H, Ne = V + v + k + d + L + B + Y, he = V + k + j + d + U, le = L + B + Y + H + tt, ue = d + x + A + $ + _ + W + L, ce = _ + W + L + N + K, fe = d + x + A + y + G;
+    return e.set(0, 0, Ve), e.set(0, 1, je), e.set(0, 2, qe), e.set(1, 0, Ne), e.set(1, 1, he), e.set(1, 2, le), e.set(2, 0, ue), e.set(2, 1, ce), e.set(2, 2, fe), e;
   }
   mmulStrassen(t) {
     t = E.checkMatrix(t);
@@ -2033,25 +2033,25 @@ let Z = class st {
       if (w <= 512 || g <= 512)
         return u.mmul(m);
       w % 2 === 1 && g % 2 === 1 ? (u = a(u, w + 1, g + 1), m = a(m, w + 1, g + 1)) : w % 2 === 1 ? (u = a(u, w + 1, g), m = a(m, w + 1, g)) : g % 2 === 1 && (u = a(u, w, g + 1), m = a(m, w, g + 1));
-      let p = parseInt(u.rows / 2, 10), M = parseInt(u.columns / 2, 10), f = u.subMatrix(0, p - 1, 0, M - 1), P = m.subMatrix(0, p - 1, 0, M - 1), b = u.subMatrix(0, p - 1, M, u.columns - 1), R = m.subMatrix(0, p - 1, M, m.columns - 1), C = u.subMatrix(p, u.rows - 1, 0, M - 1), V = m.subMatrix(p, m.rows - 1, 0, M - 1), v = u.subMatrix(p, u.rows - 1, M, u.columns - 1), S = m.subMatrix(p, m.rows - 1, M, m.columns - 1), j = c(
+      let p = parseInt(u.rows / 2, 10), M = parseInt(u.columns / 2, 10), f = u.subMatrix(0, p - 1, 0, M - 1), P = m.subMatrix(0, p - 1, 0, M - 1), b = u.subMatrix(0, p - 1, M, u.columns - 1), S = m.subMatrix(0, p - 1, M, m.columns - 1), C = u.subMatrix(p, u.rows - 1, 0, M - 1), V = m.subMatrix(p, m.rows - 1, 0, M - 1), v = u.subMatrix(p, u.rows - 1, M, u.columns - 1), k = m.subMatrix(p, m.rows - 1, M, m.columns - 1), j = c(
         st.add(f, v),
-        st.add(P, S),
+        st.add(P, k),
         p,
         M
-      ), d = c(st.add(C, v), P, p, M), x = c(f, st.sub(R, S), p, M), A = c(v, st.sub(V, P), p, M), y = c(st.add(f, b), S, p, M), $ = c(
+      ), d = c(st.add(C, v), P, p, M), x = c(f, st.sub(S, k), p, M), A = c(v, st.sub(V, P), p, M), y = c(st.add(f, b), k, p, M), I = c(
         st.sub(C, f),
-        st.add(P, R),
+        st.add(P, S),
         p,
         M
-      ), I = c(
+      ), $ = c(
         st.sub(b, v),
-        st.add(V, S),
+        st.add(V, k),
         p,
         M
       ), _ = st.add(j, A);
-      _.sub(y), _.add(I);
+      _.sub(y), _.add($);
       let W = st.add(x, y), L = st.add(d, A), N = st.sub(j, d);
-      N.add(x), N.add($);
+      N.add(x), N.add(I);
       let B = st.zeros(2 * _.rows, 2 * _.columns);
       return B = B.setSubMatrix(_, 0, 0), B = B.setSubMatrix(W, _.rows, 0), B = B.setSubMatrix(L, 0, _.columns), B = B.setSubMatrix(N, _.rows, _.columns), B.subMatrix(0, w - 1, 0, g - 1);
     }
@@ -2067,7 +2067,7 @@ let Z = class st {
     let s = new E(this.rows, this.columns);
     for (let r = 0; r < this.rows; r++) {
       const o = this.getRow(r);
-      o.length > 0 && xn(o, { min: e, max: n, output: o }), s.setRow(r, o);
+      o.length > 0 && An(o, { min: e, max: n, output: o }), s.setRow(r, o);
     }
     return s;
   }
@@ -2081,7 +2081,7 @@ let Z = class st {
     let s = new E(this.rows, this.columns);
     for (let r = 0; r < this.columns; r++) {
       const o = this.getColumn(r);
-      o.length && xn(o, {
+      o.length && An(o, {
         min: e,
         max: n,
         output: o
@@ -2130,18 +2130,18 @@ let Z = class st {
         t.set(n, e, this.get(e, n));
     return t;
   }
-  sortRows(t = An) {
+  sortRows(t = Sn) {
     for (let e = 0; e < this.rows; e++)
       this.setRow(e, this.getRow(e).sort(t));
     return this;
   }
-  sortColumns(t = An) {
+  sortColumns(t = Sn) {
     for (let e = 0; e < this.columns; e++)
       this.setColumn(e, this.getColumn(e).sort(t));
     return this;
   }
   subMatrix(t, e, n, s) {
-    Ye(this, t, e, n, s);
+    Xe(this, t, e, n, s);
     let r = new E(
       e - t + 1,
       s - n + 1
@@ -2179,14 +2179,14 @@ let Z = class st {
     if (t = E.checkMatrix(t), t.isEmpty())
       return this;
     let s = e + t.rows - 1, r = n + t.columns - 1;
-    Ye(this, e, s, n, r);
+    Xe(this, e, s, n, r);
     for (let o = 0; o < t.rows; o++)
       for (let a = 0; a < t.columns; a++)
         this.set(e + o, n + a, t.get(o, a));
     return this;
   }
   selection(t, e) {
-    rn(this, t), on(this, e);
+    on(this, t), an(this, e);
     let n = new E(t.length, e.length);
     for (let s = 0; s < t.length; s++) {
       let r = t[s];
@@ -2220,11 +2220,11 @@ let Z = class st {
   sum(t) {
     switch (t) {
       case "row":
-        return ms(this);
-      case "column":
         return gs(this);
-      case void 0:
+      case "column":
         return ps(this);
+      case void 0:
+        return ws(this);
       default:
         throw new Error(`invalid option: ${t}`);
     }
@@ -2232,11 +2232,11 @@ let Z = class st {
   product(t) {
     switch (t) {
       case "row":
-        return ws(this);
-      case "column":
         return ds(this);
-      case void 0:
+      case "column":
         return Ps(this);
+      case void 0:
+        return Ms(this);
       default:
         throw new Error(`invalid option: ${t}`);
     }
@@ -2270,17 +2270,17 @@ let Z = class st {
       case "row": {
         if (!ft.isAnyArray(s))
           throw new TypeError("mean must be an array");
-        return Ms(this, n, s);
+        return ys(this, n, s);
       }
       case "column": {
         if (!ft.isAnyArray(s))
           throw new TypeError("mean must be an array");
-        return ys(this, n, s);
+        return bs(this, n, s);
       }
       case void 0: {
         if (typeof s != "number")
           throw new TypeError("mean must be a number");
-        return bs(this, n, s);
+        return xs(this, n, s);
       }
       default:
         throw new Error(`invalid option: ${t}`);
@@ -2303,17 +2303,17 @@ let Z = class st {
       case "row": {
         if (!ft.isAnyArray(n))
           throw new TypeError("center must be an array");
-        return xs(this, n), this;
+        return vs(this, n), this;
       }
       case "column": {
         if (!ft.isAnyArray(n))
           throw new TypeError("center must be an array");
-        return vs(this, n), this;
+        return As(this, n), this;
       }
       case void 0: {
         if (typeof n != "number")
           throw new TypeError("center must be a number");
-        return As(this, n), this;
+        return Es(this, n), this;
       }
       default:
         throw new Error(`invalid option: ${t}`);
@@ -2326,31 +2326,31 @@ let Z = class st {
     switch (t) {
       case "row": {
         if (n === void 0)
-          n = Es(this);
+          n = Ss(this);
         else if (!ft.isAnyArray(n))
           throw new TypeError("scale must be an array");
-        return Ss(this, n), this;
+        return ks(this, n), this;
       }
       case "column": {
         if (n === void 0)
-          n = ks(this);
+          n = Rs(this);
         else if (!ft.isAnyArray(n))
           throw new TypeError("scale must be an array");
-        return Rs(this, n), this;
+        return Cs(this, n), this;
       }
       case void 0: {
         if (n === void 0)
-          n = Cs(this);
+          n = Ts(this);
         else if (typeof n != "number")
           throw new TypeError("scale must be a number");
-        return Ts(this, n), this;
+        return Is(this, n), this;
       }
       default:
         throw new Error(`invalid option: ${t}`);
     }
   }
   toString(t) {
-    return ci(this, t);
+    return mi(this, t);
   }
   [Symbol.iterator]() {
     return this.entries();
@@ -2377,8 +2377,8 @@ let Z = class st {
   }
 };
 Z.prototype.klass = "Matrix";
-typeof Symbol < "u" && (Z.prototype[Symbol.for("nodejs.util.inspect.custom")] = ls);
-function An(i, t) {
+typeof Symbol < "u" && (Z.prototype[Symbol.for("nodejs.util.inspect.custom")] = us);
+function Sn(i, t) {
   return i - t;
 }
 function $s(i) {
@@ -2391,13 +2391,13 @@ Z.prototype.diagonal = Z.prototype.diag;
 Z.identity = Z.eye;
 Z.prototype.negate = Z.prototype.neg;
 Z.prototype.tensorProduct = Z.prototype.kroneckerProduct;
-var Pe, Oe, Me;
+var Pe, ze, Me;
 let E = (Me = class extends Z {
   constructor(i, t) {
-    if (super(), ii(this, Pe), F(this, "data"), Me.isMatrix(i))
-      dn(this, Pe, Oe).call(this, i.rows, i.columns), Me.copy(i, this);
+    if (super(), ri(this, Pe), F(this, "data"), Me.isMatrix(i))
+      Mn(this, Pe, ze).call(this, i.rows, i.columns), Me.copy(i, this);
     else if (Number.isInteger(i) && i >= 0)
-      dn(this, Pe, Oe).call(this, i, t);
+      Mn(this, Pe, ze).call(this, i, t);
     else if (ft.isAnyArray(i)) {
       const e = i;
       if (i = e.length, t = i ? e[0].length : 0, typeof t != "number")
@@ -2460,7 +2460,7 @@ let E = (Me = class extends Z {
 * @param {number} nRows
 * @param {number} nColumns
 */
-Oe = function(i, t) {
+ze = function(i, t) {
   if (this.data = [], Number.isInteger(t) && t >= 0)
     for (let e = 0; e < i; e++)
       this.data.push(new Float64Array(t));
@@ -2468,24 +2468,24 @@ Oe = function(i, t) {
     throw new TypeError("nColumns must be a positive integer");
   this.rows = i, this.columns = t;
 }, Me);
-fs(Z, E);
+ms(Z, E);
 var ht;
-const Is = class Xe extends Z {
+const _s = class We extends Z {
   /**
    * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize
    * @return {this}
    */
   constructor(t) {
-    if (super(), ii(this, ht), E.isMatrix(t)) {
+    if (super(), ri(this, ht), E.isMatrix(t)) {
       if (!t.isSymmetric())
         throw new TypeError("not symmetric data");
-      Ne(this, ht, E.copy(
+      Oe(this, ht, E.copy(
         t,
         new E(t.rows, t.rows)
       ));
     } else if (Number.isInteger(t) && t >= 0)
-      Ne(this, ht, new E(t, t));
-    else if (Ne(this, ht, new E(t)), !this.isSymmetric())
+      Oe(this, ht, new E(t, t));
+    else if (Oe(this, ht, new E(t)), !this.isSymmetric())
       throw new TypeError("not symmetric data");
   }
   get size() {
@@ -2525,7 +2525,7 @@ const Is = class Xe extends Z {
     return new this(t).fill(1);
   }
   clone() {
-    const t = new Xe(this.diagonalSize);
+    const t = new We(this.diagonalSize);
     for (const [e, n, s] of this.upperRightEntries())
       t.set(e, n, s);
     return t;
@@ -2597,7 +2597,7 @@ const Is = class Xe extends Z {
           t
         )}`
       );
-    const s = new Xe(n);
+    const s = new We(n);
     for (let r = 0, o = 0, a = 0; a < e; a++)
       s.set(r, o, t[a]), ++r >= n && (r = ++o);
     return s;
@@ -2626,9 +2626,9 @@ const Is = class Xe extends Z {
   }
 };
 ht = /* @__PURE__ */ new WeakMap();
-let Kt = Is;
-Kt.prototype.klassType = "SymmetricMatrix";
-let fi = class mi extends Kt {
+let te = _s;
+te.prototype.klassType = "SymmetricMatrix";
+let gi = class pi extends te {
   /**
    * not the same as matrix.isSymmetric()
    * Here is to check if it's instanceof SymmetricMatrix without bundling issues
@@ -2637,7 +2637,7 @@ let fi = class mi extends Kt {
    * @returns {boolean}
    */
   static isDistanceMatrix(t) {
-    return Kt.isSymmetricMatrix(t) && t.klassSubType === "DistanceMatrix";
+    return te.isSymmetricMatrix(t) && t.klassSubType === "DistanceMatrix";
   }
   constructor(t) {
     if (super(t), !this.isDistance())
@@ -2650,10 +2650,10 @@ let fi = class mi extends Kt {
     return e === void 0 && (e = t, t = this.diagonalSize), e = e.slice(), e[t] = 0, super.addCross(t, e);
   }
   toSymmetricMatrix() {
-    return new Kt(this);
+    return new te(this);
   }
   clone() {
-    const t = new mi(this.diagonalSize);
+    const t = new pi(this.diagonalSize);
     for (const [e, n, s] of this.upperRightEntries())
       e !== n && t.set(e, n, s);
     return t;
@@ -2703,13 +2703,13 @@ let fi = class mi extends Kt {
     return s;
   }
 };
-fi.prototype.klassSubType = "DistanceMatrix";
+gi.prototype.klassSubType = "DistanceMatrix";
 let Et = class extends Z {
   constructor(t, e, n) {
     super(), this.matrix = t, this.rows = e, this.columns = n;
   }
 };
-class _s extends Et {
+class Fs extends Et {
   constructor(t, e) {
     wt(t, e), super(t, t.rows, 1), this.column = e;
   }
@@ -2720,9 +2720,9 @@ class _s extends Et {
     return this.matrix.get(t, this.column);
   }
 }
-class Fs extends Et {
+class Ls extends Et {
   constructor(t, e) {
-    on(t, e), super(t, t.rows, e.length), this.columnIndices = e;
+    an(t, e), super(t, t.rows, e.length), this.columnIndices = e;
   }
   set(t, e, n) {
     return this.matrix.set(t, this.columnIndices[e], n), this;
@@ -2731,7 +2731,7 @@ class Fs extends Et {
     return this.matrix.get(t, this.columnIndices[e]);
   }
 }
-class Ls extends Et {
+class Bs extends Et {
   constructor(t) {
     super(t, t.rows, t.columns);
   }
@@ -2742,7 +2742,7 @@ class Ls extends Et {
     return this.matrix.get(t, this.columns - e - 1);
   }
 }
-class Bs extends Et {
+class Vs extends Et {
   constructor(t) {
     super(t, t.rows, t.columns);
   }
@@ -2753,7 +2753,7 @@ class Bs extends Et {
     return this.matrix.get(this.rows - t - 1, e);
   }
 }
-class Vs extends Et {
+class js extends Et {
   constructor(t, e) {
     pt(t, e), super(t, 1, t.columns), this.row = e;
   }
@@ -2764,9 +2764,9 @@ class Vs extends Et {
     return this.matrix.get(this.row, e);
   }
 }
-class js extends Et {
+class qs extends Et {
   constructor(t, e) {
-    rn(t, e), super(t, e.length, t.columns), this.rowIndices = e;
+    on(t, e), super(t, e.length, t.columns), this.rowIndices = e;
   }
   set(t, e, n) {
     return this.matrix.set(this.rowIndices[t], e, n), this;
@@ -2775,9 +2775,9 @@ class js extends Et {
     return this.matrix.get(this.rowIndices[t], e);
   }
 }
-let ve = class extends Et {
+let Ae = class extends Et {
   constructor(t, e, n) {
-    rn(t, e), on(t, n), super(t, e.length, n.length), this.rowIndices = e, this.columnIndices = n;
+    on(t, e), an(t, n), super(t, e.length, n.length), this.rowIndices = e, this.columnIndices = n;
   }
   set(t, e, n) {
     return this.matrix.set(
@@ -2793,9 +2793,9 @@ let ve = class extends Et {
     );
   }
 };
-class qs extends Et {
+class Ns extends Et {
   constructor(t, e, n, s, r) {
-    Ye(t, e, n, s, r), super(t, n - e + 1, r - s + 1), this.startRow = e, this.startColumn = s;
+    Xe(t, e, n, s, r), super(t, n - e + 1, r - s + 1), this.startRow = e, this.startColumn = s;
   }
   set(t, e, n) {
     return this.matrix.set(
@@ -2811,7 +2811,7 @@ class qs extends Et {
     );
   }
 }
-class Ns extends Et {
+class Os extends Et {
   constructor(t) {
     super(t, t.columns, t.rows);
   }
@@ -2822,7 +2822,7 @@ class Ns extends Et {
     return this.matrix.get(e, t);
   }
 }
-class gi extends Z {
+class wi extends Z {
   constructor(t, e = {}) {
     const { rows: n = 1 } = e;
     if (t.length % n !== 0)
@@ -2852,12 +2852,12 @@ let gt = class extends Z {
     return this.data[t][e];
   }
 };
-function Os(i, t) {
+function zs(i, t) {
   if (ft.isAnyArray(i))
-    return i[0] && ft.isAnyArray(i[0]) ? new gt(i) : new gi(i, t);
+    return i[0] && ft.isAnyArray(i[0]) ? new gt(i) : new wi(i, t);
   throw new Error("the argument is not an array");
 }
-let Fe = class {
+let Le = class {
   constructor(t) {
     t = gt.checkMatrix(t);
     let e = t.clone(), n = e.rows, s = e.columns, r = new Float64Array(n), o = 1, a, h, l, c, u, m, w, g, p;
@@ -2943,7 +2943,7 @@ function xt(i, t) {
   let e = 0;
   return Math.abs(i) > Math.abs(t) ? (e = t / i, Math.abs(i) * Math.sqrt(1 + e * e)) : t !== 0 ? (e = i / t, Math.abs(t) * Math.sqrt(1 + e * e)) : 0;
 }
-class an {
+class hn {
   constructor(t) {
     t = gt.checkMatrix(t);
     let e = t.clone(), n = t.rows, s = t.columns, r = new Float64Array(s), o, a, h, l;
@@ -3044,9 +3044,9 @@ let Wt = class {
       u = t.clone();
     let m = Math.min(n, s), w = Math.min(n + 1, s), g = new Float64Array(w), p = new E(n, m), M = new E(s, s), f = new Float64Array(s), P = new Float64Array(n), b = new Float64Array(w);
     for (let d = 0; d < w; d++) b[d] = d;
-    let R = Math.min(n - 1, s), C = Math.max(0, Math.min(s - 2, n)), V = Math.max(R, C);
+    let S = Math.min(n - 1, s), C = Math.max(0, Math.min(s - 2, n)), V = Math.max(S, C);
     for (let d = 0; d < V; d++) {
-      if (d < R) {
+      if (d < S) {
         g[d] = 0;
         for (let x = d; x < n; x++)
           g[d] = xt(g[d], u.get(x, d));
@@ -3059,7 +3059,7 @@ let Wt = class {
         g[d] = -g[d];
       }
       for (let x = d + 1; x < s; x++) {
-        if (d < R && g[d] !== 0) {
+        if (d < S && g[d] !== 0) {
           let A = 0;
           for (let y = d; y < n; y++)
             A += u.get(y, d) * u.get(y, x);
@@ -3069,7 +3069,7 @@ let Wt = class {
         }
         f[x] = u.get(d, x);
       }
-      if (h && d < R)
+      if (h && d < S)
         for (let x = d; x < n; x++)
           p.set(x, d, u.get(x, d));
       if (d < C) {
@@ -3100,13 +3100,13 @@ let Wt = class {
       }
     }
     let v = Math.min(s, n + 1);
-    if (R < s && (g[R] = u.get(R, R)), n < v && (g[v - 1] = 0), C + 1 < v && (f[C] = u.get(C, v - 1)), f[v - 1] = 0, h) {
-      for (let d = R; d < m; d++) {
+    if (S < s && (g[S] = u.get(S, S)), n < v && (g[v - 1] = 0), C + 1 < v && (f[C] = u.get(C, v - 1)), f[v - 1] = 0, h) {
+      for (let d = S; d < m; d++) {
         for (let x = 0; x < n; x++)
           p.set(x, d, 0);
         p.set(d, d, 1);
       }
-      for (let d = R - 1; d >= 0; d--)
+      for (let d = S - 1; d >= 0; d--)
         if (g[d] !== 0) {
           for (let x = d + 1; x < m; x++) {
             let A = 0;
@@ -3142,7 +3142,7 @@ let Wt = class {
           M.set(x, d, 0);
         M.set(d, d, 1);
       }
-    let S = v - 1, j = Number.EPSILON;
+    let k = v - 1, j = Number.EPSILON;
     for (; v > 0; ) {
       let d, x;
       for (d = v - 2; d >= -1 && d !== -1; d--) {
@@ -3170,10 +3170,10 @@ let Wt = class {
           let A = f[v - 2];
           f[v - 2] = 0;
           for (let y = v - 2; y >= d; y--) {
-            let $ = xt(g[y], A), I = g[y] / $, _ = A / $;
-            if (g[y] = $, y !== d && (A = -_ * f[y - 1], f[y - 1] = I * f[y - 1]), l)
+            let I = xt(g[y], A), $ = g[y] / I, _ = A / I;
+            if (g[y] = I, y !== d && (A = -_ * f[y - 1], f[y - 1] = $ * f[y - 1]), l)
               for (let W = 0; W < s; W++)
-                $ = I * M.get(W, y) + _ * M.get(W, v - 1), M.set(W, v - 1, -_ * M.get(W, y) + I * M.get(W, v - 1)), M.set(W, y, $);
+                I = $ * M.get(W, y) + _ * M.get(W, v - 1), M.set(W, v - 1, -_ * M.get(W, y) + $ * M.get(W, v - 1)), M.set(W, y, I);
           }
           break;
         }
@@ -3181,10 +3181,10 @@ let Wt = class {
           let A = f[d - 1];
           f[d - 1] = 0;
           for (let y = d; y < v; y++) {
-            let $ = xt(g[y], A), I = g[y] / $, _ = A / $;
-            if (g[y] = $, A = -_ * f[y], f[y] = I * f[y], h)
+            let I = xt(g[y], A), $ = g[y] / I, _ = A / I;
+            if (g[y] = I, A = -_ * f[y], f[y] = $ * f[y], h)
               for (let W = 0; W < n; W++)
-                $ = I * p.get(W, y) + _ * p.get(W, d - 1), p.set(W, d - 1, -_ * p.get(W, y) + I * p.get(W, d - 1)), p.set(W, y, $);
+                I = $ * p.get(W, y) + _ * p.get(W, d - 1), p.set(W, d - 1, -_ * p.get(W, y) + $ * p.get(W, d - 1)), p.set(W, y, I);
           }
           break;
         }
@@ -3195,7 +3195,7 @@ let Wt = class {
             Math.abs(f[v - 2]),
             Math.abs(g[d]),
             Math.abs(f[d])
-          ), y = g[v - 1] / A, $ = g[v - 2] / A, I = f[v - 2] / A, _ = g[d] / A, W = f[d] / A, L = (($ + y) * ($ - y) + I * I) / 2, N = y * I * (y * I);
+          ), y = g[v - 1] / A, I = g[v - 2] / A, $ = f[v - 2] / A, _ = g[d] / A, W = f[d] / A, L = ((I + y) * (I - y) + $ * $) / 2, N = y * $ * (y * $);
           let B = 0;
           (L !== 0 || N !== 0) && (L < 0 ? B = 0 - Math.sqrt(L * L + N) : B = Math.sqrt(L * L + N), B = N / (L + B));
           let Y = (_ + y) * (_ - y) + B, H = _ * W;
@@ -3215,9 +3215,9 @@ let Wt = class {
         }
         case 4: {
           if (g[d] <= 0 && (g[d] = g[d] < 0 ? -g[d] : 0, l))
-            for (let A = 0; A <= S; A++)
+            for (let A = 0; A <= k; A++)
               M.set(A, d, -M.get(A, d));
-          for (; d < S && !(g[d] >= g[d + 1]); ) {
+          for (; d < k && !(g[d] >= g[d + 1]); ) {
             let A = g[d];
             if (g[d] = g[d + 1], g[d + 1] = A, l && d < s - 1)
               for (let y = 0; y < s; y++)
@@ -3298,13 +3298,13 @@ let Wt = class {
     return E.diag(this.s);
   }
 };
-function zs(i, t = !1) {
-  return i = gt.checkMatrix(i), t ? new Wt(i).inverse() : pi(i, E.eye(i.rows));
+function Ds(i, t = !1) {
+  return i = gt.checkMatrix(i), t ? new Wt(i).inverse() : di(i, E.eye(i.rows));
 }
-function pi(i, t, e = !1) {
-  return i = gt.checkMatrix(i), t = gt.checkMatrix(t), e ? new Wt(i).solve(t) : i.isSquare() ? new Fe(i).solve(t) : new an(i).solve(t);
+function di(i, t, e = !1) {
+  return i = gt.checkMatrix(i), t = gt.checkMatrix(t), e ? new Wt(i).solve(t) : i.isSquare() ? new Le(i).solve(t) : new hn(i).solve(t);
 }
-function Ae(i) {
+function Ee(i) {
   if (i = E.checkMatrix(i), i.isSquare()) {
     if (i.columns === 0)
       return 1;
@@ -3313,19 +3313,19 @@ function Ae(i) {
       return t = i.get(0, 0), e = i.get(0, 1), n = i.get(1, 0), s = i.get(1, 1), t * s - e * n;
     if (i.columns === 3) {
       let r, o, a;
-      return r = new ve(i, [1, 2], [1, 2]), o = new ve(i, [1, 2], [0, 2]), a = new ve(i, [1, 2], [0, 1]), t = i.get(0, 0), e = i.get(0, 1), n = i.get(0, 2), t * Ae(r) - e * Ae(o) + n * Ae(a);
+      return r = new Ae(i, [1, 2], [1, 2]), o = new Ae(i, [1, 2], [0, 2]), a = new Ae(i, [1, 2], [0, 1]), t = i.get(0, 0), e = i.get(0, 1), n = i.get(0, 2), t * Ee(r) - e * Ee(o) + n * Ee(a);
     } else
-      return new Fe(i).determinant;
+      return new Le(i).determinant;
   } else
     throw Error("determinant can only be calculated for a square matrix");
 }
-function Ds(i, t) {
+function Us(i, t) {
   let e = [];
   for (let n = 0; n < i; n++)
     n !== t && e.push(n);
   return e;
 }
-function Us(i, t, e, n = 1e-9, s = 1e-9) {
+function Ys(i, t, e, n = 1e-9, s = 1e-9) {
   if (i > s)
     return new Array(t.rows + 1).fill(0);
   {
@@ -3335,20 +3335,20 @@ function Us(i, t, e, n = 1e-9, s = 1e-9) {
     return r.to1DArray();
   }
 }
-function Ys(i, t = {}) {
+function Xs(i, t = {}) {
   const { thresholdValue: e = 1e-9, thresholdError: n = 1e-9 } = t;
   i = E.checkMatrix(i);
   let s = i.rows, r = new E(s, s);
   for (let o = 0; o < s; o++) {
-    let a = E.columnVector(i.getRow(o)), h = i.subMatrixRow(Ds(s, o)).transpose(), l = new Wt(h).solve(a), c = E.sub(a, h.mmul(l)).abs().max();
+    let a = E.columnVector(i.getRow(o)), h = i.subMatrixRow(Us(s, o)).transpose(), l = new Wt(h).solve(a), c = E.sub(a, h.mmul(l)).abs().max();
     r.setRow(
       o,
-      Us(c, l, o, e, n)
+      Ys(c, l, o, e, n)
     );
   }
   return r;
 }
-function Xs(i, t = Number.EPSILON) {
+function Ws(i, t = Number.EPSILON) {
   if (i = E.checkMatrix(i), i.isEmpty())
     return i.transpose();
   let e = new Wt(i, { autoTranspose: !0 }), n = e.leftSingularVectors, s = e.rightSingularVectors, r = e.diagonal;
@@ -3356,7 +3356,7 @@ function Xs(i, t = Number.EPSILON) {
     Math.abs(r[o]) > t ? r[o] = 1 / r[o] : r[o] = 0;
   return s.mmul(E.diag(r).mmul(n.transpose()));
 }
-function Ws(i, t = i, e = {}) {
+function Hs(i, t = i, e = {}) {
   i = new E(i);
   let n = !1;
   if (typeof t == "object" && !E.isMatrix(t) && !ft.isAnyArray(t) ? (e = t, t = i, n = !0) : t = new E(t), i.rows !== t.rows)
@@ -3369,7 +3369,7 @@ function Ws(i, t = i, e = {}) {
       r.set(o, a, r.get(o, a) * (1 / (i.rows - 1)));
   return r;
 }
-function Hs(i, t = i, e = {}) {
+function Qs(i, t = i, e = {}) {
   i = new E(i);
   let n = !1;
   if (typeof t == "object" && !E.isMatrix(t) && !ft.isAnyArray(t) ? (e = t, t = i, n = !0) : t = new E(t), i.rows !== t.rows)
@@ -3386,7 +3386,7 @@ function Hs(i, t = i, e = {}) {
       );
   return h;
 }
-let wi = class {
+let Pi = class {
   constructor(i, t = {}) {
     const { assumeSymmetric: e = !1 } = t;
     if (i = gt.checkMatrix(i), !i.isSquare())
@@ -3398,13 +3398,13 @@ let wi = class {
       for (h = 0; h < n; h++)
         for (l = 0; l < n; l++)
           s.set(h, l, a.get(h, l));
-      Qs(n, o, r, s), Gs(n, o, r, s);
+      Gs(n, o, r, s), Js(n, o, r, s);
     } else {
       let u = new E(n, n), m = new Float64Array(n);
       for (l = 0; l < n; l++)
         for (h = 0; h < n; h++)
           u.set(h, l, a.get(h, l));
-      Js(n, u, m, s), Zs(n, o, r, s, u);
+      Zs(n, u, m, s), Ks(n, o, r, s, u);
     }
     this.n = n, this.e = o, this.d = r, this.V = s;
   }
@@ -3427,7 +3427,7 @@ let wi = class {
     return n;
   }
 };
-function Qs(i, t, e, n) {
+function Gs(i, t, e, n) {
   let s, r, o, a, h, l, c, u;
   for (h = 0; h < i; h++)
     e[h] = n.get(i - 1, h);
@@ -3477,12 +3477,12 @@ function Qs(i, t, e, n) {
     e[h] = n.get(i - 1, h), n.set(i - 1, h, 0);
   n.set(i - 1, i - 1, 1), t[0] = 0;
 }
-function Gs(i, t, e, n) {
+function Js(i, t, e, n) {
   let s, r, o, a, h, l, c, u, m, w, g, p, M, f, P, b;
   for (o = 1; o < i; o++)
     t[o - 1] = t[o];
   t[i - 1] = 0;
-  let R = 0, C = 0, V = Number.EPSILON;
+  let S = 0, C = 0, V = Number.EPSILON;
   for (l = 0; l < i; l++) {
     for (C = Math.max(C, Math.abs(e[l]) + Math.abs(t[l])), c = l; c < i && !(Math.abs(t[c]) <= V * C); )
       c++;
@@ -3490,12 +3490,12 @@ function Gs(i, t, e, n) {
       do {
         for (s = e[l], u = (e[l + 1] - s) / (2 * t[l]), m = xt(u, 1), u < 0 && (m = -m), e[l] = t[l] / (u + m), e[l + 1] = t[l] * (u + m), w = e[l + 1], r = s - e[l], o = l + 2; o < i; o++)
           e[o] -= r;
-        for (R = R + r, u = e[c], g = 1, p = g, M = g, f = t[l + 1], P = 0, b = 0, o = c - 1; o >= l; o--)
+        for (S = S + r, u = e[c], g = 1, p = g, M = g, f = t[l + 1], P = 0, b = 0, o = c - 1; o >= l; o--)
           for (M = p, p = g, b = P, s = g * t[o], r = g * u, m = xt(u, t[o]), t[o + 1] = P * m, P = t[o] / m, g = u / m, u = g * e[o] - P * s, e[o + 1] = r + P * (g * s + P * e[o]), h = 0; h < i; h++)
             r = n.get(h, o + 1), n.set(h, o + 1, P * n.get(h, o) + g * r), n.set(h, o, g * n.get(h, o) - P * r);
         u = -P * b * M * f * t[l] / w, t[l] = P * u, e[l] = g * u;
       } while (Math.abs(t[l]) > V * C);
-    e[l] = e[l] + R, t[l] = 0;
+    e[l] = e[l] + S, t[l] = 0;
   }
   for (o = 0; o < i - 1; o++) {
     for (h = o, u = e[o], a = o + 1; a < i; a++)
@@ -3505,7 +3505,7 @@ function Gs(i, t, e, n) {
         u = n.get(a, o), n.set(a, o, n.get(a, h)), n.set(a, h, u);
   }
 }
-function Js(i, t, e, n) {
+function Zs(i, t, e, n) {
   let s = 0, r = i - 1, o, a, h, l, c, u, m;
   for (u = s + 1; u <= r - 1; u++) {
     for (m = 0, l = u; l <= r; l++)
@@ -3543,94 +3543,94 @@ function Js(i, t, e, n) {
       }
     }
 }
-function Zs(i, t, e, n, s) {
-  let r = i - 1, o = 0, a = i - 1, h = Number.EPSILON, l = 0, c = 0, u = 0, m = 0, w = 0, g = 0, p = 0, M = 0, f, P, b, R, C, V, v, S, j, d, x, A, y, $, I;
+function Ks(i, t, e, n, s) {
+  let r = i - 1, o = 0, a = i - 1, h = Number.EPSILON, l = 0, c = 0, u = 0, m = 0, w = 0, g = 0, p = 0, M = 0, f, P, b, S, C, V, v, k, j, d, x, A, y, I, $;
   for (f = 0; f < i; f++)
     for ((f < o || f > a) && (e[f] = s.get(f, f), t[f] = 0), P = Math.max(f - 1, 0); P < i; P++)
       c = c + Math.abs(s.get(f, P));
   for (; r >= o; ) {
-    for (R = r; R > o && (g = Math.abs(s.get(R - 1, R - 1)) + Math.abs(s.get(R, R)), g === 0 && (g = c), !(Math.abs(s.get(R, R - 1)) < h * g)); )
-      R--;
-    if (R === r)
+    for (S = r; S > o && (g = Math.abs(s.get(S - 1, S - 1)) + Math.abs(s.get(S, S)), g === 0 && (g = c), !(Math.abs(s.get(S, S - 1)) < h * g)); )
+      S--;
+    if (S === r)
       s.set(r, r, s.get(r, r) + l), e[r] = s.get(r, r), t[r] = 0, r--, M = 0;
-    else if (R === r - 1) {
-      if (v = s.get(r, r - 1) * s.get(r - 1, r), u = (s.get(r - 1, r - 1) - s.get(r, r)) / 2, m = u * u + v, p = Math.sqrt(Math.abs(m)), s.set(r, r, s.get(r, r) + l), s.set(r - 1, r - 1, s.get(r - 1, r - 1) + l), S = s.get(r, r), m >= 0) {
-        for (p = u >= 0 ? u + p : u - p, e[r - 1] = S + p, e[r] = e[r - 1], p !== 0 && (e[r] = S - v / p), t[r - 1] = 0, t[r] = 0, S = s.get(r, r - 1), g = Math.abs(S) + Math.abs(p), u = S / g, m = p / g, w = Math.sqrt(u * u + m * m), u = u / w, m = m / w, P = r - 1; P < i; P++)
+    else if (S === r - 1) {
+      if (v = s.get(r, r - 1) * s.get(r - 1, r), u = (s.get(r - 1, r - 1) - s.get(r, r)) / 2, m = u * u + v, p = Math.sqrt(Math.abs(m)), s.set(r, r, s.get(r, r) + l), s.set(r - 1, r - 1, s.get(r - 1, r - 1) + l), k = s.get(r, r), m >= 0) {
+        for (p = u >= 0 ? u + p : u - p, e[r - 1] = k + p, e[r] = e[r - 1], p !== 0 && (e[r] = k - v / p), t[r - 1] = 0, t[r] = 0, k = s.get(r, r - 1), g = Math.abs(k) + Math.abs(p), u = k / g, m = p / g, w = Math.sqrt(u * u + m * m), u = u / w, m = m / w, P = r - 1; P < i; P++)
           p = s.get(r - 1, P), s.set(r - 1, P, m * p + u * s.get(r, P)), s.set(r, P, m * s.get(r, P) - u * p);
         for (f = 0; f <= r; f++)
           p = s.get(f, r - 1), s.set(f, r - 1, m * p + u * s.get(f, r)), s.set(f, r, m * s.get(f, r) - u * p);
         for (f = o; f <= a; f++)
           p = n.get(f, r - 1), n.set(f, r - 1, m * p + u * n.get(f, r)), n.set(f, r, m * n.get(f, r) - u * p);
       } else
-        e[r - 1] = S + u, e[r] = S + u, t[r - 1] = p, t[r] = -p;
+        e[r - 1] = k + u, e[r] = k + u, t[r - 1] = p, t[r] = -p;
       r = r - 2, M = 0;
     } else {
-      if (S = s.get(r, r), j = 0, v = 0, R < r && (j = s.get(r - 1, r - 1), v = s.get(r, r - 1) * s.get(r - 1, r)), M === 10) {
-        for (l += S, f = o; f <= r; f++)
-          s.set(f, f, s.get(f, f) - S);
-        g = Math.abs(s.get(r, r - 1)) + Math.abs(s.get(r - 1, r - 2)), S = j = 0.75 * g, v = -0.4375 * g * g;
+      if (k = s.get(r, r), j = 0, v = 0, S < r && (j = s.get(r - 1, r - 1), v = s.get(r, r - 1) * s.get(r - 1, r)), M === 10) {
+        for (l += k, f = o; f <= r; f++)
+          s.set(f, f, s.get(f, f) - k);
+        g = Math.abs(s.get(r, r - 1)) + Math.abs(s.get(r - 1, r - 2)), k = j = 0.75 * g, v = -0.4375 * g * g;
       }
-      if (M === 30 && (g = (j - S) / 2, g = g * g + v, g > 0)) {
-        for (g = Math.sqrt(g), j < S && (g = -g), g = S - v / ((j - S) / 2 + g), f = o; f <= r; f++)
+      if (M === 30 && (g = (j - k) / 2, g = g * g + v, g > 0)) {
+        for (g = Math.sqrt(g), j < k && (g = -g), g = k - v / ((j - k) / 2 + g), f = o; f <= r; f++)
           s.set(f, f, s.get(f, f) - g);
-        l += g, S = j = v = 0.964;
+        l += g, k = j = v = 0.964;
       }
-      for (M = M + 1, C = r - 2; C >= R && (p = s.get(C, C), w = S - p, g = j - p, u = (w * g - v) / s.get(C + 1, C) + s.get(C, C + 1), m = s.get(C + 1, C + 1) - p - w - g, w = s.get(C + 2, C + 1), g = Math.abs(u) + Math.abs(m) + Math.abs(w), u = u / g, m = m / g, w = w / g, !(C === R || Math.abs(s.get(C, C - 1)) * (Math.abs(m) + Math.abs(w)) < h * (Math.abs(u) * (Math.abs(s.get(C - 1, C - 1)) + Math.abs(p) + Math.abs(s.get(C + 1, C + 1)))))); )
+      for (M = M + 1, C = r - 2; C >= S && (p = s.get(C, C), w = k - p, g = j - p, u = (w * g - v) / s.get(C + 1, C) + s.get(C, C + 1), m = s.get(C + 1, C + 1) - p - w - g, w = s.get(C + 2, C + 1), g = Math.abs(u) + Math.abs(m) + Math.abs(w), u = u / g, m = m / g, w = w / g, !(C === S || Math.abs(s.get(C, C - 1)) * (Math.abs(m) + Math.abs(w)) < h * (Math.abs(u) * (Math.abs(s.get(C - 1, C - 1)) + Math.abs(p) + Math.abs(s.get(C + 1, C + 1)))))); )
         C--;
       for (f = C + 2; f <= r; f++)
         s.set(f, f - 2, 0), f > C + 2 && s.set(f, f - 3, 0);
-      for (b = C; b <= r - 1 && ($ = b !== r - 1, b !== C && (u = s.get(b, b - 1), m = s.get(b + 1, b - 1), w = $ ? s.get(b + 2, b - 1) : 0, S = Math.abs(u) + Math.abs(m) + Math.abs(w), S !== 0 && (u = u / S, m = m / S, w = w / S)), S !== 0); b++)
+      for (b = C; b <= r - 1 && (I = b !== r - 1, b !== C && (u = s.get(b, b - 1), m = s.get(b + 1, b - 1), w = I ? s.get(b + 2, b - 1) : 0, k = Math.abs(u) + Math.abs(m) + Math.abs(w), k !== 0 && (u = u / k, m = m / k, w = w / k)), k !== 0); b++)
         if (g = Math.sqrt(u * u + m * m + w * w), u < 0 && (g = -g), g !== 0) {
-          for (b !== C ? s.set(b, b - 1, -g * S) : R !== C && s.set(b, b - 1, -s.get(b, b - 1)), u = u + g, S = u / g, j = m / g, p = w / g, m = m / u, w = w / u, P = b; P < i; P++)
-            u = s.get(b, P) + m * s.get(b + 1, P), $ && (u = u + w * s.get(b + 2, P), s.set(b + 2, P, s.get(b + 2, P) - u * p)), s.set(b, P, s.get(b, P) - u * S), s.set(b + 1, P, s.get(b + 1, P) - u * j);
+          for (b !== C ? s.set(b, b - 1, -g * k) : S !== C && s.set(b, b - 1, -s.get(b, b - 1)), u = u + g, k = u / g, j = m / g, p = w / g, m = m / u, w = w / u, P = b; P < i; P++)
+            u = s.get(b, P) + m * s.get(b + 1, P), I && (u = u + w * s.get(b + 2, P), s.set(b + 2, P, s.get(b + 2, P) - u * p)), s.set(b, P, s.get(b, P) - u * k), s.set(b + 1, P, s.get(b + 1, P) - u * j);
           for (f = 0; f <= Math.min(r, b + 3); f++)
-            u = S * s.get(f, b) + j * s.get(f, b + 1), $ && (u = u + p * s.get(f, b + 2), s.set(f, b + 2, s.get(f, b + 2) - u * w)), s.set(f, b, s.get(f, b) - u), s.set(f, b + 1, s.get(f, b + 1) - u * m);
+            u = k * s.get(f, b) + j * s.get(f, b + 1), I && (u = u + p * s.get(f, b + 2), s.set(f, b + 2, s.get(f, b + 2) - u * w)), s.set(f, b, s.get(f, b) - u), s.set(f, b + 1, s.get(f, b + 1) - u * m);
           for (f = o; f <= a; f++)
-            u = S * n.get(f, b) + j * n.get(f, b + 1), $ && (u = u + p * n.get(f, b + 2), n.set(f, b + 2, n.get(f, b + 2) - u * w)), n.set(f, b, n.get(f, b) - u), n.set(f, b + 1, n.get(f, b + 1) - u * m);
+            u = k * n.get(f, b) + j * n.get(f, b + 1), I && (u = u + p * n.get(f, b + 2), n.set(f, b + 2, n.get(f, b + 2) - u * w)), n.set(f, b, n.get(f, b) - u), n.set(f, b + 1, n.get(f, b + 1) - u * m);
         }
     }
   }
   if (c !== 0) {
     for (r = i - 1; r >= 0; r--)
       if (u = e[r], m = t[r], m === 0)
-        for (R = r, s.set(r, r, 1), f = r - 1; f >= 0; f--) {
-          for (v = s.get(f, f) - u, w = 0, P = R; P <= r; P++)
+        for (S = r, s.set(r, r, 1), f = r - 1; f >= 0; f--) {
+          for (v = s.get(f, f) - u, w = 0, P = S; P <= r; P++)
             w = w + s.get(f, P) * s.get(P, r);
           if (t[f] < 0)
             p = v, g = w;
-          else if (R = f, t[f] === 0 ? s.set(f, r, v !== 0 ? -w / v : -w / (h * c)) : (S = s.get(f, f + 1), j = s.get(f + 1, f), m = (e[f] - u) * (e[f] - u) + t[f] * t[f], V = (S * g - p * w) / m, s.set(f, r, V), s.set(
+          else if (S = f, t[f] === 0 ? s.set(f, r, v !== 0 ? -w / v : -w / (h * c)) : (k = s.get(f, f + 1), j = s.get(f + 1, f), m = (e[f] - u) * (e[f] - u) + t[f] * t[f], V = (k * g - p * w) / m, s.set(f, r, V), s.set(
             f + 1,
             r,
-            Math.abs(S) > Math.abs(p) ? (-w - v * V) / S : (-g - j * V) / p
+            Math.abs(k) > Math.abs(p) ? (-w - v * V) / k : (-g - j * V) / p
           )), V = Math.abs(s.get(f, r)), h * V * V > 1)
             for (P = f; P <= r; P++)
               s.set(P, r, s.get(P, r) / V);
         }
       else if (m < 0)
-        for (R = r - 1, Math.abs(s.get(r, r - 1)) > Math.abs(s.get(r - 1, r)) ? (s.set(r - 1, r - 1, m / s.get(r, r - 1)), s.set(r - 1, r, -(s.get(r, r) - u) / s.get(r, r - 1))) : (I = ye(0, -s.get(r - 1, r), s.get(r - 1, r - 1) - u, m), s.set(r - 1, r - 1, I[0]), s.set(r - 1, r, I[1])), s.set(r, r - 1, 0), s.set(r, r, 1), f = r - 2; f >= 0; f--) {
-          for (d = 0, x = 0, P = R; P <= r; P++)
+        for (S = r - 1, Math.abs(s.get(r, r - 1)) > Math.abs(s.get(r - 1, r)) ? (s.set(r - 1, r - 1, m / s.get(r, r - 1)), s.set(r - 1, r, -(s.get(r, r) - u) / s.get(r, r - 1))) : ($ = ye(0, -s.get(r - 1, r), s.get(r - 1, r - 1) - u, m), s.set(r - 1, r - 1, $[0]), s.set(r - 1, r, $[1])), s.set(r, r - 1, 0), s.set(r, r, 1), f = r - 2; f >= 0; f--) {
+          for (d = 0, x = 0, P = S; P <= r; P++)
             d = d + s.get(f, P) * s.get(P, r - 1), x = x + s.get(f, P) * s.get(P, r);
           if (v = s.get(f, f) - u, t[f] < 0)
             p = v, w = d, g = x;
-          else if (R = f, t[f] === 0 ? (I = ye(-d, -x, v, m), s.set(f, r - 1, I[0]), s.set(f, r, I[1])) : (S = s.get(f, f + 1), j = s.get(f + 1, f), A = (e[f] - u) * (e[f] - u) + t[f] * t[f] - m * m, y = (e[f] - u) * 2 * m, A === 0 && y === 0 && (A = h * c * (Math.abs(v) + Math.abs(m) + Math.abs(S) + Math.abs(j) + Math.abs(p))), I = ye(
-            S * w - p * d + m * x,
-            S * g - p * x - m * d,
+          else if (S = f, t[f] === 0 ? ($ = ye(-d, -x, v, m), s.set(f, r - 1, $[0]), s.set(f, r, $[1])) : (k = s.get(f, f + 1), j = s.get(f + 1, f), A = (e[f] - u) * (e[f] - u) + t[f] * t[f] - m * m, y = (e[f] - u) * 2 * m, A === 0 && y === 0 && (A = h * c * (Math.abs(v) + Math.abs(m) + Math.abs(k) + Math.abs(j) + Math.abs(p))), $ = ye(
+            k * w - p * d + m * x,
+            k * g - p * x - m * d,
             A,
             y
-          ), s.set(f, r - 1, I[0]), s.set(f, r, I[1]), Math.abs(S) > Math.abs(p) + Math.abs(m) ? (s.set(
+          ), s.set(f, r - 1, $[0]), s.set(f, r, $[1]), Math.abs(k) > Math.abs(p) + Math.abs(m) ? (s.set(
             f + 1,
             r - 1,
-            (-d - v * s.get(f, r - 1) + m * s.get(f, r)) / S
+            (-d - v * s.get(f, r - 1) + m * s.get(f, r)) / k
           ), s.set(
             f + 1,
             r,
-            (-x - v * s.get(f, r) - m * s.get(f, r - 1)) / S
-          )) : (I = ye(
+            (-x - v * s.get(f, r) - m * s.get(f, r - 1)) / k
+          )) : ($ = ye(
             -w - j * s.get(f, r - 1),
             -g - j * s.get(f, r),
             p,
             m
-          ), s.set(f + 1, r - 1, I[0]), s.set(f + 1, r, I[1]))), V = Math.max(Math.abs(s.get(f, r - 1)), Math.abs(s.get(f, r))), h * V * V > 1)
+          ), s.set(f + 1, r - 1, $[0]), s.set(f + 1, r, $[1]))), V = Math.max(Math.abs(s.get(f, r - 1)), Math.abs(s.get(f, r))), h * V * V > 1)
             for (P = f; P <= r; P++)
               s.set(P, r - 1, s.get(P, r - 1) / V), s.set(P, r, s.get(P, r) / V);
         }
@@ -3650,7 +3650,7 @@ function ye(i, t, e, n) {
   let s, r;
   return Math.abs(e) > Math.abs(n) ? (s = n / e, r = e + s * n, [(i + s * t) / r, (t - s * i) / r]) : (s = e / n, r = n + s * e, [(s * i + t) / r, (s * t - i) / r]);
 }
-class di {
+class Mi {
   constructor(t) {
     if (t = gt.checkMatrix(t), !t.isSymmetric())
       throw new Error("Matrix is not symmetric");
@@ -3697,7 +3697,7 @@ class di {
     return this.L;
   }
 }
-class Pi {
+class yi {
   constructor(t, e = {}) {
     t = gt.checkMatrix(t);
     let { Y: n } = e;
@@ -3728,44 +3728,44 @@ class Pi {
   }
 }
 O.AbstractMatrix = Z;
-O.CHO = di;
-O.CholeskyDecomposition = di;
-O.DistanceMatrix = fi;
-O.EVD = wi;
-var Ks = O.EigenvalueDecomposition = wi;
-O.LU = Fe;
-O.LuDecomposition = Fe;
-var tr = O.Matrix = E;
-O.MatrixColumnSelectionView = Fs;
-O.MatrixColumnView = _s;
-O.MatrixFlipColumnView = Ls;
-O.MatrixFlipRowView = Bs;
-O.MatrixRowSelectionView = js;
-O.MatrixRowView = Vs;
-O.MatrixSelectionView = ve;
-O.MatrixSubView = qs;
-O.MatrixTransposeView = Ns;
-O.NIPALS = Pi;
-O.Nipals = Pi;
-O.QR = an;
-O.QrDecomposition = an;
+O.CHO = Mi;
+O.CholeskyDecomposition = Mi;
+O.DistanceMatrix = gi;
+O.EVD = Pi;
+var tr = O.EigenvalueDecomposition = Pi;
+O.LU = Le;
+O.LuDecomposition = Le;
+var er = O.Matrix = E;
+O.MatrixColumnSelectionView = Ls;
+O.MatrixColumnView = Fs;
+O.MatrixFlipColumnView = Bs;
+O.MatrixFlipRowView = Vs;
+O.MatrixRowSelectionView = qs;
+O.MatrixRowView = js;
+O.MatrixSelectionView = Ae;
+O.MatrixSubView = Ns;
+O.MatrixTransposeView = Os;
+O.NIPALS = yi;
+O.Nipals = yi;
+O.QR = hn;
+O.QrDecomposition = hn;
 O.SVD = Wt;
 O.SingularValueDecomposition = Wt;
-O.SymmetricMatrix = Kt;
-O.WrapperMatrix1D = gi;
+O.SymmetricMatrix = te;
+O.WrapperMatrix1D = wi;
 O.WrapperMatrix2D = gt;
-O.correlation = Hs;
-O.covariance = Ws;
-var En = O.default = E;
-O.determinant = Ae;
-O.inverse = zs;
-O.linearDependencies = Ys;
-O.pseudoInverse = Xs;
-O.solve = pi;
-O.wrap = Os;
-const er = Ks, nr = tr;
-En.Matrix && En.Matrix;
-function ne(i, t, e) {
+O.correlation = Qs;
+O.covariance = Hs;
+var kn = O.default = E;
+O.determinant = Ee;
+O.inverse = Ds;
+O.linearDependencies = Xs;
+O.pseudoInverse = Ws;
+O.solve = di;
+O.wrap = zs;
+const nr = tr, ir = er;
+kn.Matrix && kn.Matrix;
+function ie(i, t, e) {
   const n = i / e, s = t / e;
   if (!(isFinite(n) && isFinite(s))) {
     const h = -i / t;
@@ -3784,10 +3784,10 @@ function ne(i, t, e) {
   const a = n / o;
   return isFinite(a) ? a > o ? [o, a] : [a, o] : [o];
 }
-function Mi(i, t, e, n) {
+function bi(i, t, e, n) {
   const s = e / (3 * n), r = t / (3 * n), o = i / n;
   if (!(isFinite(o) && isFinite(r) && isFinite(s)))
-    return ne(i, t, e);
+    return ie(i, t, e);
   const a = -s * s + r, h = -r * s + o, l = s * o - r * r, c = 4 * a * l - h * h, u = -2 * s * a + h;
   if (c < 0) {
     const m = Math.sqrt(-0.25 * c), w = -0.5 * u;
@@ -3800,16 +3800,16 @@ function Mi(i, t, e, n) {
     return [f * w - s, f * p - s, f * M - s];
   }
 }
-function ir(i, t, e, n, s) {
+function sr(i, t, e, n, s) {
   if (s == 0)
-    return Mi(i, t, e, n);
+    return bi(i, t, e, n);
   const r = n / s, o = e / s, a = t / s, h = i / s;
-  let l = Sn(r, o, a, h, !1);
+  let l = Rn(r, o, a, h, !1);
   if (l !== null)
     return l;
   const c = 716e74;
   for (let u = 0; u < 2; u++)
-    if (l = Sn(
+    if (l = Rn(
       r / c,
       o / (c * c),
       a / (c * c * c),
@@ -3825,19 +3825,19 @@ function ir(i, t, e, n, s) {
 function Ct(i, t) {
   return t == 0 ? Math.abs(i) : Math.abs((i - t) / t);
 }
-function Sn(i, t, e, n, s) {
-  const r = sr(i, t, e, n, s);
+function Rn(i, t, e, n, s) {
+  const r = rr(i, t, e, n, s);
   if (r !== null && r.length == 4) {
     let o = [];
     for (let a = 0; a < 2; a++) {
       const h = r[a * 2], l = r[a * 2 + 1];
-      o = o.concat(ne(l, h, 1));
+      o = o.concat(ie(l, h, 1));
     }
     return o;
   }
   return null;
 }
-function sr(i, t, e, n, s) {
+function rr(i, t, e, n, s) {
   function r(L, N, B, Y) {
     const H = Ct(L + B, i), T = Ct(N + L * B + Y, t), U = Ct(N * B + L * Y, e);
     return H + T + U;
@@ -3855,55 +3855,55 @@ function sr(i, t, e, n, s) {
     w = l * u - 4 * m - 1 / 3 * c * c, g = (l * u + 8 * m - 2 / 9 * c * c) * (1 / 3) * c - u * u - l * l * m;
   if (!isFinite(w) && isFinite(g))
     return null;
-  let M = rr(w, g);
+  let M = or(w, g);
   s && (M *= p);
-  const f = i * 0.5, P = 1 / 6 * t + 0.5 * M, b = e - i * P, R = 2 / 3 * t - M - f * f, C = 0.5 * b / R, V = 2 * (n - P * P) / b, v = 0.5 * b / V;
-  let S = 0, j = 0, d = 0;
+  const f = i * 0.5, P = 1 / 6 * t + 0.5 * M, b = e - i * P, S = 2 / 3 * t - M - f * f, C = 0.5 * b / S, V = 2 * (n - P * P) / b, v = 0.5 * b / V;
+  let k = 0, j = 0, d = 0;
   for (let L = 0; L < 3; L++) {
-    const N = L == 1 ? v : R, B = L == 0 ? C : V, Y = Ct(N + f * f + 2 * P, t), H = Ct(2 * (N * B + f * P), e), T = Ct(N * B * B + P * P, n), U = Y + H + T;
-    (L == 0 || U < d) && (S = N, j = B, d = U);
+    const N = L == 1 ? v : S, B = L == 0 ? C : V, Y = Ct(N + f * f + 2 * P, t), H = Ct(2 * (N * B + f * P), e), T = Ct(N * B * B + P * P, n), U = Y + H + T;
+    (L == 0 || U < d) && (k = N, j = B, d = U);
   }
-  const x = S, A = j;
-  let y = 0, $ = 0, I = 0, _ = 0;
+  const x = k, A = j;
+  let y = 0, I = 0, $ = 0, _ = 0;
   if (x < 0) {
     const L = Math.sqrt(-x);
-    if (y = f + L, $ = P + L * A, I = f - L, _ = P - L * A, Math.abs(_) < Math.abs($) ? _ = n / $ : Math.abs(_) > Math.abs($) && ($ = n / _), Math.abs(y) != Math.abs(I)) {
+    if (y = f + L, I = P + L * A, $ = f - L, _ = P - L * A, Math.abs(_) < Math.abs(I) ? _ = n / I : Math.abs(_) > Math.abs(I) && (I = n / _), Math.abs(y) != Math.abs($)) {
       let N = null, B = null;
-      if (Math.abs(y) < Math.abs(I)) {
-        const H = (e - $ * I) / _, T = (t - _ - $) / I;
-        N = [i - I, H, T], B = [I, I, I];
+      if (Math.abs(y) < Math.abs($)) {
+        const H = (e - I * $) / _, T = (t - _ - I) / $;
+        N = [i - $, H, T], B = [$, $, $];
       } else {
-        const H = (e - y * _) / $, T = (t - _ - $) / y, U = i - y;
+        const H = (e - y * _) / I, T = (t - _ - I) / y, U = i - y;
         N = [y, y, y], B = [U, H, T];
       }
       let Y = 0;
       for (let H = 0; H < 3; H++) {
         const T = N[H], U = B[H];
         if (isFinite(T) && isFinite(U)) {
-          const tt = r(T, $, U, _);
-          (H == 0 || tt < Y) && (y = T, I = U, Y = tt);
+          const tt = r(T, I, U, _);
+          (H == 0 || tt < Y) && (y = T, $ = U, Y = tt);
         }
       }
     }
   } else if (x == 0) {
     const L = n - P * P;
-    y = f, $ = P + Math.sqrt(-L), I = f, _ = P - Math.sqrt(-L), Math.abs($) > Math.abs(_) ? _ = n / $ : Math.abs(_) > Math.abs($) && ($ = n / _);
+    y = f, I = P + Math.sqrt(-L), $ = f, _ = P - Math.sqrt(-L), Math.abs(I) > Math.abs(_) ? _ = n / I : Math.abs(_) > Math.abs(I) && (I = n / _);
   } else
     return [];
-  let W = o(y, $, I, _);
+  let W = o(y, I, $, _);
   for (let L = 0; L < 8 && W != 0; L++) {
-    const N = $ * _ - n, B = $ * I + y * _ - e, Y = $ + y * I + _ - t, H = y + I - i, T = y - I, U = $ * $ - $ * (I * T + 2 * _) + _ * (y * T + _);
+    const N = I * _ - n, B = I * $ + y * _ - e, Y = I + y * $ + _ - t, H = y + $ - i, T = y - $, U = I * I - I * ($ * T + 2 * _) + _ * (y * T + _);
     if (U == 0)
       break;
-    const tt = 1 / U, K = _ - $, G = $ * I - y * _, Be = T * N + K * B + G * Y - ($ * K + y * G) * H, Ve = (y * T + K) * N - $ * (T * B + K * Y + G * H), je = -T * N - K * B - G * Y + (I * G + _ * K) * H, qe = -(I * T + K) * N + _ * (T * B + K * Y + G * H), he = y - tt * Be, le = $ - tt * Ve, ue = I - tt * je, ce = _ - tt * qe, fe = o(he, le, ue, ce);
+    const tt = 1 / U, K = _ - I, G = I * $ - y * _, Ve = T * N + K * B + G * Y - (I * K + y * G) * H, je = (y * T + K) * N - I * (T * B + K * Y + G * H), qe = -T * N - K * B - G * Y + ($ * G + _ * K) * H, Ne = -($ * T + K) * N + _ * (T * B + K * Y + G * H), he = y - tt * Ve, le = I - tt * je, ue = $ - tt * qe, ce = _ - tt * Ne, fe = o(he, le, ue, ce);
     if (fe < W)
-      y = he, $ = le, I = ue, _ = ce, W = fe;
+      y = he, I = le, $ = ue, _ = ce, W = fe;
     else
       break;
   }
-  return [y, $, I, _];
+  return [y, I, $, _];
 }
-function rr(i, t) {
+function or(i, t) {
   const e = -0.3333333333333333 * i, n = 0.5 * t;
   let s, r = null;
   if ((Math.abs(e) >= 1e102 || Math.abs(n) >= 1e164) && (Math.abs(e) < Math.abs(n) ? r = 1 - e * (e / n) * (e / n) : r = Math.sign(e) * (n / e * (n / e) / e - 1)), r !== null && n == 0)
@@ -3937,32 +3937,32 @@ function Yt(i, t) {
   const e = Math.abs(i);
   return t < 0 ? -e : e;
 }
-function hn(i, t = 1e-9) {
+function ln(i, t = 1e-9) {
   if (i[i.length - 1] == 0)
-    return hn(i.slice(0, -1), t);
-  const e = new nr([
+    return ln(i.slice(0, -1), t);
+  const e = new ir([
     i.slice(0, -1).reverse().map((s) => -s / i[i.length - 1]),
     ...Array.from({ length: i.length - 2 }, (s, r) => {
       const o = new Array(i.length - 1).fill(0);
       return o[r] = 1, o;
     })
-  ]), n = new er(e);
+  ]), n = new nr(e);
   return n.realEigenvalues.filter(
     (s, r) => Math.abs(n.imaginaryEigenvalues[r]) < t
   );
 }
-const or = (i, t, e) => [i[0] * (1 - e) + t[0] * e, i[1] * (1 - e) + t[1] * e];
-function ar(i) {
+const ar = (i, t, e) => [i[0] * (1 - e) + t[0] * e, i[1] * (1 - e) + t[1] * e];
+function hr(i) {
   const t = [];
   for (let e = 0; e < i.length - 1; e++)
     t.push([i[e], i[e + 1]]);
   return t;
 }
-function ln(i, t) {
-  const e = ar(i).map(([n, s]) => or(n, s, t));
-  return i.length === 2 ? [e] : [...ln(e, t), e];
+function un(i, t) {
+  const e = hr(i).map(([n, s]) => ar(n, s, t));
+  return i.length === 2 ? [e] : [...un(e, t), e];
 }
-let rt = class zt extends oe {
+let rt = class zt extends ae {
   constructor(t, e, n, s) {
     super(t, e), F(this, "segmentType", "CUBIC_BEZIER"), F(this, "firstControlPoint"), F(this, "lastControlPoint"), F(this, "_boundingBox", null), F(this, "_polynomialCoefficients", null), this.firstControlPoint = n, this.lastControlPoint = s;
   }
@@ -3976,7 +3976,7 @@ let rt = class zt extends oe {
       this.lastControlPoint[t],
       this.lastPoint[t]
     ], o = -e + 3 * n - 3 * s + r, a = 2 * e - 4 * n + 2 * s, h = -e + n;
-    return ne(h, a, o).filter(
+    return ie(h, a, o).filter(
       (l) => l >= -this.precision && l <= 1 + this.precision
     );
   }
@@ -3991,10 +3991,10 @@ let rt = class zt extends oe {
   }
   getInflexionParameters() {
     const t = this.alignedCurve, [e, n] = t.firstControlPoint, [s, r] = t.lastControlPoint, [o, a] = t.lastPoint, h = s * n, l = o * n, c = e * r, u = o * r, m = -3 * h + 2 * l + 3 * c - u, w = 3 * h - l - 3 * c, g = c - h;
-    return ne(g, w, m).filter((p) => p >= 0 && p <= 1);
+    return ie(g, w, m).filter((p) => p >= 0 && p <= 1);
   }
   get boundingBox() {
-    return this._boundingBox === null && (this._boundingBox = en([
+    return this._boundingBox === null && (this._boundingBox = nn([
       this.firstPoint,
       ...this.getParametersOfExtrema().map((t) => this.paramPoint(t)),
       this.lastPoint
@@ -4017,10 +4017,10 @@ let rt = class zt extends oe {
     );
   }
   isSame(t) {
-    return t.segmentType !== "CUBIC_BEZIER" ? !1 : k(this.firstPoint, t.firstPoint) && k(this.lastPoint, t.lastPoint) && k(this.firstControlPoint, t.firstControlPoint) && k(this.lastControlPoint, t.lastControlPoint);
+    return t.segmentType !== "CUBIC_BEZIER" ? !1 : R(this.firstPoint, t.firstPoint) && R(this.lastPoint, t.lastPoint) && R(this.firstControlPoint, t.firstControlPoint) && R(this.lastControlPoint, t.lastControlPoint);
   }
   distanceFrom(t) {
-    const e = hi((n) => Ft(this.paramPoint(n), t), this.precision);
+    const e = ui((n) => _t(this.paramPoint(n), t), this.precision);
     return e.argMin < -this.precision || e.argMin > 1 + this.precision ? Math.min(
       J(this.firstPoint, t),
       J(this.lastPoint, t)
@@ -4082,7 +4082,7 @@ let rt = class zt extends oe {
         return [];
       let a = !1;
       r > 1 - this.precision && (a = !0);
-      const h = (r - s.originalParam) / (1 - s.originalParam), l = ln(
+      const h = (r - s.originalParam) / (1 - s.originalParam), l = un(
         [
           s.p0,
           s.p1,
@@ -4150,11 +4150,11 @@ let rt = class zt extends oe {
   }
   paramsAtY(t) {
     const [e, n, s, r] = this.polynomialCoefficients[1];
-    return Mi(e - t, n, s, r).filter((o) => o >= -this.precision && o <= 1 + this.precision);
+    return bi(e - t, n, s, r).filter((o) => o >= -this.precision && o <= 1 + this.precision);
   }
   pointToParam(t) {
-    if (k(t, this.firstPoint, this.precision)) return 0;
-    if (k(t, this.lastPoint, this.precision)) return 1;
+    if (R(t, this.firstPoint, this.precision)) return 0;
+    if (R(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");
@@ -4163,7 +4163,7 @@ let rt = class zt extends oe {
       throw new Error("Point is not on the curve");
     return s;
   }
-}, at = class Gt extends oe {
+}, at = class Gt extends ae {
   constructor(t, e, n, s, r, o, a = !1, {
     ignoreChecks: h = !1,
     angleUnits: l = "deg"
@@ -4171,11 +4171,11 @@ let rt = class zt extends oe {
     super(t, e), F(this, "segmentType", "ELLIPSE_ARC"), F(this, "precision", 1e-6), F(this, "majorRadius"), F(this, "minorRadius"), F(this, "center"), F(this, "tiltAngle"), F(this, "clockwise"), F(this, "_coefficients", null), F(this, "_boundingBox"), F(this, "_linearExentricity"), F(this, "_exentricity"), F(this, "_focals"), F(this, "_ellipseReferenceFrameTransform"), F(this, "_reverseEllipseReferenceFrameTransform"), F(this, "_rotateFromEllipseReferenceFrame"), F(this, "_firstAngle"), F(this, "_lastAngle"), F(this, "_deltaAngle"), this.center = n;
     const c = s >= r;
     this.majorRadius = c ? s : r, this.minorRadius = c ? r : s;
-    const u = l === "deg" ? o * _t : o;
-    if (this.tiltAngle = $t(
+    const u = l === "deg" ? o * $t : o;
+    if (this.tiltAngle = Tt(
       c ? u : u + Math.PI / 2
     ), this.clockwise = a, !h) {
-      if (k(t, e))
+      if (R(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (!this.isPointOnEllipse(t))
         throw new Error(
@@ -4210,7 +4210,7 @@ let rt = class zt extends oe {
   get info() {
     return `ELLIPSE_ARC(${it(this.firstPoint)}, ${it(
       this.lastPoint
-    )}, ${it(this.center)}, ${this.majorRadius}, ${this.minorRadius}, ${this.tiltAngle * nn}, ${this.clockwise ? "CW" : "CCW"})`;
+    )}, ${it(this.center)}, ${this.majorRadius}, ${this.minorRadius}, ${this.tiltAngle * sn}, ${this.clockwise ? "CW" : "CCW"})`;
   }
   reverse() {
     return new Gt(
@@ -4247,7 +4247,7 @@ let rt = class zt extends oe {
         this.lastPoint,
         ...t
       ];
-      this._boundingBox = en(e).grow(this.precision);
+      this._boundingBox = nn(e).grow(this.precision);
     }
     return this._boundingBox;
   }
@@ -4298,17 +4298,17 @@ let rt = class zt extends oe {
     return 1 - t >= -this.precision && t >= -this.precision;
   }
   isSame(t) {
-    return k(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) && (k(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || k(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
+    return R(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) && (R(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || R(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
   }
   pointTheta(t) {
     const e = this.ellipseReferenceFrameTransform.transform(t), n = Math.atan2(
       e[1] / this.minorRadius,
       e[0] / this.majorRadius
     );
-    return $t(n);
+    return Tt(n);
   }
   thetaToParam(t) {
-    return ke(this.firstAngle, $t(t), this.clockwise) / this.deltaAngle;
+    return Re(this.firstAngle, Tt(t), this.clockwise) / this.deltaAngle;
   }
   isPointOnEllipse(t) {
     const [e, n] = this.focals, s = J(t, e), r = J(t, n);
@@ -4319,19 +4319,19 @@ let rt = class zt extends oe {
   }
   distanceFrom(t) {
     let e;
-    if (k(t, this.center) ? e = X(
+    if (R(t, this.center) ? e = X(
       this.center,
       Q(nt(this.majorAxis), this.minorRadius)
     ) : e = this.reverseEllipseReferenceFrameTransform.transform(
-      ur(
+      cr(
         this.majorRadius,
         this.minorRadius,
         this.ellipseReferenceFrameTransform.transform(t)
       )
     ), this.isValidParameter(this.thetaToParam(this.pointTheta(t))))
       return J(t, e);
-    if (Hi(t, this.majorAxis, this.center)) {
-      const n = $t(
+    if (Qi(t, this.majorAxis, this.center)) {
+      const n = Tt(
         2 * Math.PI - this.pointTheta(t)
       ), s = this.thetaToParam(n);
       if (this.isValidParameter(s))
@@ -4360,7 +4360,7 @@ let rt = class zt extends oe {
     return this._lastAngle === void 0 && (this._lastAngle = this.pointTheta(this.lastPoint)), this._lastAngle;
   }
   get deltaAngle() {
-    return this._deltaAngle === void 0 && (this._deltaAngle = ke(
+    return this._deltaAngle === void 0 && (this._deltaAngle = Re(
       this.firstAngle,
       this.lastAngle,
       this.clockwise
@@ -4368,7 +4368,7 @@ let rt = class zt extends oe {
   }
   normalAt(t) {
     const e = this.tangentAt(t);
-    return this.clockwise ? nt(e) : Zt(e);
+    return this.clockwise ? nt(e) : Kt(e);
   }
   gradientAt(t) {
     const e = this.firstAngle + t * this.deltaAngle * (this.clockwise ? -1 : 1), n = -this.majorRadius * this.deltaAngle * Math.sin(e), s = this.minorRadius * this.deltaAngle * Math.cos(e), r = this.clockwise ? [-n, -s] : [n, s];
@@ -4428,48 +4428,48 @@ let rt = class zt extends oe {
     });
   }
 };
-function hr(i, t, e, n, s, r, o) {
-  const { center: a, rx: h, ry: l } = lr(
+function lr(i, t, e, n, s, r, o) {
+  const { center: a, rx: h, ry: l } = ur(
     i,
     t,
     e,
     n,
-    s * _t,
+    s * $t,
     !r,
     o
   );
   return Math.abs(h - l) < 1e-9 ? new z(i, t, a, o) : new at(i, t, a, h, l, s, o);
 }
-function lr([i, t], [e, n], s, r, o, a, h) {
+function ur([i, t], [e, n], s, r, o, a, h) {
   if (s < 0 && (s = -s), r < 0 && (r = -r), s == 0 || r == 0)
     throw Error("rx and ry can not be 0");
   const l = Math.sin(o), c = Math.cos(o), u = (i - e) / 2, m = (t - n) / 2, w = (i + e) / 2, g = (t + n) / 2, p = c * u + l * m, M = c * m - l * u, f = p * p / (s * s) + M * M / (r * r);
   f > 1 && (s = s * Math.sqrt(f), r = r * Math.sqrt(f));
-  const P = s * r, b = s * M, R = r * p, C = b * b + R * R;
+  const P = s * r, b = s * M, S = r * p, C = b * b + S * S;
   if (!C)
     throw Error("start point can not be same as end point");
   let V = Math.sqrt(Math.abs((P * P - C) / C));
   a == h && (V = -V);
-  const v = V * b / r, S = -V * R / s, j = c * v - l * S + w, d = l * v + c * S + g;
+  const v = V * b / r, k = -V * S / s, j = c * v - l * k + w, d = l * v + c * k + g;
   return {
     center: [j, d],
     rx: s,
     ry: r
   };
 }
-function ur(i, t, e) {
+function cr(i, t, e) {
   const n = Math.abs(e[0]), s = Math.abs(e[1]);
   let r = 0.707, o = 0.707;
   const a = i, h = t;
   for (let l = 0; l < 3; l++) {
     const c = a * r, u = h * o, m = (a * a - h * h) * r ** 3 / a, w = (h * h - a * a) * o ** 3 / h, g = c - m, p = u - w, M = n - m, f = s - w, P = Math.hypot(g, p), b = Math.hypot(M, f);
     r = Math.min(1, Math.max(0, (M * P / b + m) / a)), o = Math.min(1, Math.max(0, (f * P / b + w) / h));
-    const R = Math.hypot(r, o);
-    r /= R, o /= R;
+    const S = Math.hypot(r, o);
+    r /= S, o /= S;
   }
   return [a * r * Math.sign(e[0]), h * o * Math.sign(e[1])];
 }
-let et = class Dt extends oe {
+let et = class Dt extends ae {
   constructor(t, e, n) {
     super(t, e), F(this, "segmentType", "QUADRATIC_BEZIER"), F(this, "controlPoint"), F(this, "_boundingBox", null), F(this, "_polynomialCoefficients", null), this.controlPoint = n;
   }
@@ -4493,7 +4493,7 @@ let et = class Dt extends oe {
     );
   }
   get boundingBox() {
-    return this._boundingBox === null && (this._boundingBox = en([
+    return this._boundingBox === null && (this._boundingBox = nn([
       this.firstPoint,
       // There is either one or zero extrema in each direction
       ...this.getParametersOfExtrema().map((t) => this.paramPoint(t)),
@@ -4515,10 +4515,10 @@ let et = class Dt extends oe {
     );
   }
   isSame(t) {
-    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : k(this.firstPoint, t.firstPoint) && k(this.lastPoint, t.lastPoint) && k(this.controlPoint, t.controlPoint);
+    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : R(this.firstPoint, t.firstPoint) && R(this.lastPoint, t.lastPoint) && R(this.controlPoint, t.controlPoint);
   }
   distanceFrom(t) {
-    const e = hi((n) => Ft(this.paramPoint(n), t), this.precision);
+    const e = ui((n) => _t(this.paramPoint(n), t), this.precision);
     return e.argMin < -this.precision || e.argMin > 1 + this.precision ? Math.min(
       J(this.firstPoint, t),
       J(this.lastPoint, t)
@@ -4584,7 +4584,7 @@ let et = class Dt extends oe {
         return [];
       let a = !1;
       r > 1 - this.precision && (a = !0);
-      const h = (r - s.originalParam) / (1 - s.originalParam), l = ln(
+      const h = (r - s.originalParam) / (1 - s.originalParam), l = un(
         [s.p0, s.p1, this.lastPoint],
         a ? 1 : h
       ), c = a ? this.lastPoint : (e == null ? void 0 : e.get(r)) ?? l[0][0], u = l[1][0], m = l[1][1], w = new Dt(
@@ -4643,7 +4643,7 @@ let et = class Dt extends oe {
   }
   paramsAtY(t) {
     const [e, n, s] = this.polynomialCoefficients[1];
-    return ne(e - t, n, s).filter(
+    return ie(e - t, n, s).filter(
       (r) => r >= -this.precision && r <= 1 + this.precision
     );
   }
@@ -4657,13 +4657,13 @@ let et = class Dt extends oe {
     return s;
   }
 };
-var cr = Object.defineProperty, fr = (i, t, e) => t in i ? cr(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, ut = (i, t, e) => fr(i, typeof t != "symbol" ? t + "" : t, e);
-function mr(i, t) {
-  const e = q(t, i.firstPoint), n = Se(e, i.V) / i.squareLength;
+var fr = Object.defineProperty, mr = (i, t, e) => t in i ? fr(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, ut = (i, t, e) => mr(i, typeof t != "symbol" ? t + "" : t, e);
+function gr(i, t) {
+  const e = q(t, i.firstPoint), n = ke(e, i.V) / i.squareLength;
   return i.paramPoint(n);
 }
-function Re(i, t, e) {
-  const n = e || i.precision, s = mr(i, t.center), r = J(s, t.center);
+function Ce(i, t, e) {
+  const n = e || i.precision, s = gr(i, t.center), r = J(s, t.center);
   if (r > t.radius + n) return [];
   if (Math.abs(r - t.radius) < n) {
     const u = s;
@@ -4676,12 +4676,12 @@ function Re(i, t, e) {
   const c = X(s, Q(h, -a));
   return i.isOnSegment(c) && t.isOnSegment(c) && o.push(c), o;
 }
-const gr = (i) => {
+const pr = (i) => {
   const { firstPoint: t, lastPoint: e, center: n, clockwise: s } = i;
   return new z(e, t, n, s, {
     ignoreChecks: !0
   });
-}, pr = (i, t) => {
+}, wr = (i, t) => {
   if (i.isSame(t))
     return [i];
   const e = At(
@@ -4697,9 +4697,9 @@ const gr = (i) => {
   if (e.length === 0) return [];
   if (e.length === 1) return [];
   if (e.length === 2)
-    return i.isSame(gr(t)) ? [] : [new z(e[0], e[1], i.center, i.clockwise)];
+    return i.isSame(pr(t)) ? [] : [new z(e[0], e[1], i.center, i.clockwise)];
   if (e.length === 3) {
-    const n = k(e[0], t.lastPoint) || k(e[0], t.firstPoint) ? 1 : 0;
+    const n = R(e[0], t.lastPoint) || R(e[0], t.firstPoint) ? 1 : 0;
     return [
       new z(
         e[0 + n],
@@ -4715,7 +4715,7 @@ const gr = (i) => {
     ];
   throw new Error("Bug in the arc arc overlap algorithm");
 };
-function yi(i, t, e = !1, n) {
+function xi(i, t, e = !1, n) {
   const s = n || i.precision, r = J(i.center, t.center), o = i.radius + t.radius;
   if (r > o + s)
     return [];
@@ -4723,7 +4723,7 @@ function yi(i, t, e = !1, n) {
   if (r < a - s)
     return [];
   if (r < s)
-    return a > s ? [] : e ? pr(i, t) : [];
+    return a > s ? [] : e ? wr(i, t) : [];
   const h = ot(q(t.center, i.center)), l = r > o - s;
   if (
     // circles are outside each other
@@ -4744,7 +4744,7 @@ function yi(i, t, e = !1, n) {
   ), w = nt(h), g = X(u, Q(w, m)), p = X(u, Q(w, -m)), M = [];
   return i.isOnSegment(g) && t.isOnSegment(g) && M.push(g), i.isOnSegment(p) && t.isOnSegment(p) && M.push(p), M;
 }
-function We(i, t, e = 1e-9) {
+function He(i, t, e = 1e-9) {
   const n = i.transform(t.ellipseReferenceFrameTransform), s = n.slope, r = n.yIntercept, o = t.majorRadius * t.majorRadius, a = t.minorRadius * t.minorRadius, h = t.majorRadius * t.minorRadius, l = n.slope * n.slope, c = n.yIntercept * n.yIntercept, u = (f) => f.map(
     (P) => t.reverseEllipseReferenceFrameTransform.transform(P)
   ).filter((P) => i.isOnSegment(P) && t.isOnSegment(P));
@@ -4753,8 +4753,8 @@ function We(i, t, e = 1e-9) {
     if (Math.abs(f) - t.majorRadius > e) return [];
     if (Math.abs(Math.abs(f) - t.majorRadius) < e)
       return u([[f, 0]]);
-    const P = t.minorRadius * Math.sqrt(1 - f * f / o), b = [f, P], R = [f, -P];
-    return u([b, R]);
+    const P = t.minorRadius * Math.sqrt(1 - f * f / o), b = [f, P], S = [f, -P];
+    return u([b, S]);
   }
   const m = o * l + a - c;
   if (m < -e)
@@ -4773,35 +4773,35 @@ function We(i, t, e = 1e-9) {
   ];
   return u([p, M]);
 }
-function bi(i, t) {
+function vi(i, t) {
   const e = Math.max(i.precision, t.precision), n = i.coefficients, s = n.x2, r = n.xy, o = n.y2, a = n.x, h = n.y, l = n.c, c = t.coefficients, u = c.x2, m = c.xy, w = c.y2, g = c.x, p = c.y, M = c.c, f = {
     z0: l * s * g * g + s * s * M * M - a * s * g * M + u * u * l * l - 2 * s * M * u * l - a * g * u * l + u * a * a * M,
     z1: p * a * a * u - M * g * s * r - 2 * s * M * u * h - l * u * m * a + 2 * g * m * s * l + 2 * p * M * s * s + g * g * s * h - p * g * s * a - 2 * s * p * u * l - l * u * g * r + 2 * l * h * u * u - M * m * s * a - h * u * g * a + 2 * M * r * u * a,
     z2: p * p * s * s + 2 * w * M * s * s - h * u * g * r + M * u * r * r - h * u * m * a - M * m * s * r - 2 * s * p * u * h + 2 * g * m * s * h - w * g * s * a - 2 * s * w * u * l + m * m * s * l + 2 * p * r * u * a + h * h * u * u - o * u * g * a - p * m * s * a + 2 * l * o * u * u - l * u * m * r + w * a * a * u + g * g * s * o - p * g * s * r - 2 * s * M * u * o,
     z3: -2 * s * u * o * p + p * u * r * r + 2 * w * r * u * a - o * u * m * a + m * m * s * h - p * m * s * r - 2 * s * w * u * h - h * u * m * r - w * m * s * a + 2 * p * w * s * s + 2 * h * o * u * u - o * u * g * r + 2 * g * m * s * o - w * g * s * r,
     z4: s * s * w * w - 2 * s * w * u * o + u * u * o * o - r * s * m * w - r * m * u * o + r * r * u * w + o * s * m * m
-  }, P = hn(
+  }, P = ln(
     [f.z0, f.z1, f.z2, f.z3, f.z4],
     e
   ).flatMap((b) => {
-    const R = s * m * b + s * g - u * r * b - u * a;
-    if (R)
-      return [[-(s * M + s * w * b * b - u * o * b * b + s * p * b - u * h * b - u * l) / R, b]];
-    const C = r * b + a, V = -C / (2 * s), v = o * b * b + h * b + l, S = C * C / (4 * s * s) - v / s;
-    if (Math.abs(S) < e)
+    const S = s * m * b + s * g - u * r * b - u * a;
+    if (S)
+      return [[-(s * M + s * w * b * b - u * o * b * b + s * p * b - u * h * b - u * l) / S, b]];
+    const C = r * b + a, V = -C / (2 * s), v = o * b * b + h * b + l, k = C * C / (4 * s * s) - v / s;
+    if (Math.abs(k) < e)
       return [[V, b]];
-    if (S > 0) {
-      const j = Math.sqrt(S);
+    if (k > 0) {
+      const j = Math.sqrt(k);
       return [[V + j, b], [V - j, b]];
     }
     return [];
   });
   return At(P, e);
 }
-function kn(i, t) {
-  return bi(i, t).filter((e) => i.isOnSegment(e) && t.isOnSegment(e));
+function Cn(i, t) {
+  return vi(i, t).filter((e) => i.isOnSegment(e) && t.isOnSegment(e));
 }
-const wr = (i) => {
+const dr = (i) => {
   const {
     firstPoint: t,
     lastPoint: e,
@@ -4824,7 +4824,7 @@ const wr = (i) => {
       angleUnits: "rad"
     }
   );
-}, dr = (i, t) => {
+}, Pr = (i, t) => {
   if (i.isSame(t))
     return [i];
   const e = (s, r) => new at(
@@ -4849,52 +4849,52 @@ const wr = (i) => {
   if (n.length === 0) return [];
   if (n.length === 1) return [];
   if (n.length === 2)
-    return i.isSame(wr(t)) ? [] : [e(n[0], n[1])];
+    return i.isSame(dr(t)) ? [] : [e(n[0], n[1])];
   if (n.length === 3) {
-    const s = k(n[0], t.lastPoint) || k(n[0], t.firstPoint) ? 1 : 0;
+    const s = R(n[0], t.lastPoint) || R(n[0], t.firstPoint) ? 1 : 0;
     return [e(n[0 + s], n[1 + s])];
   } else if (n.length === 4)
     return [e(n[0], n[1]), e(n[2], n[3])];
   throw new Error("Bug in the ellipse arc ellipse arc overlap algorithm");
 };
-function Pr(i, t, e = !1) {
+function Mr(i, t, e = !1) {
   const n = Math.max(i.precision, t.precision);
-  return k(i.center, t.center) && Math.abs(i.majorRadius - t.majorRadius) < n && Math.abs(i.minorRadius - t.minorRadius) < n && (Math.abs(i.tiltAngle - t.tiltAngle) < n || Math.abs(Math.abs(i.tiltAngle - t.tiltAngle) - Math.PI) < n) ? e ? dr(i, t) : [] : bi(i, t).filter((s) => i.isOnSegment(s) && t.isOnSegment(s));
+  return R(i.center, t.center) && Math.abs(i.majorRadius - t.majorRadius) < n && Math.abs(i.minorRadius - t.minorRadius) < n && (Math.abs(i.tiltAngle - t.tiltAngle) < n || Math.abs(Math.abs(i.tiltAngle - t.tiltAngle) - Math.PI) < n) ? e ? Pr(i, t) : [] : vi(i, t).filter((s) => i.isOnSegment(s) && t.isOnSegment(s));
 }
-function Rn(i, t) {
+function Tn(i, t) {
   const [e, n] = i.firstPoint, [s, r] = i.lastPoint, o = new ct().translate(-e, -n).rotate(-Math.atan2(r - n, s - e)), a = o.clone().inverse(), h = t.transform(o);
   return h.paramsAtY(0).map((l) => h.paramPoint(l)).map((l) => a.transform(l)).filter((l) => i.isOnSegment(l));
 }
-const Mr = (i, t = 1e-9) => {
+const yr = (i, t = 1e-9) => {
   let e = i;
   return Math.abs(i) < t && (e = 0), e.toFixed(-Math.log10(t));
 };
-function xi(i, t = 1e-9) {
+function Ai(i, t = 1e-9) {
   return Array.from(
-    new Map(i.map((e) => [Mr(e, t), e])).values()
+    new Map(i.map((e) => [yr(e, t), e])).values()
   );
 }
-const yr = (i, t) => {
-  const [[e, n, s, r], [o, a, h, l]] = t.polynomialCoefficients, c = i.coefficients, u = c.x2, m = c.xy, w = c.y2, g = c.x, p = c.y, M = c.c, f = e * e, P = n * n, b = s * s, R = r * r, C = o * o, V = a * a, v = h * h, S = l * l, j = M + g * e + u * f + p * o + m * e * o + w * C, d = g * n + 2 * u * e * n + m * n * o + p * a + m * e * a + 2 * w * o * a, x = u * P + g * s + 2 * u * e * s + m * s * o + m * n * a + w * V + p * h + m * e * h + 2 * w * o * h, A = 2 * u * n * s + g * r + 2 * u * e * r + m * r * o + m * s * a + m * n * h + 2 * w * a * h + p * l + m * e * l + 2 * w * o * l, y = u * b + 2 * u * n * r + m * r * a + m * s * h + w * v + m * n * l + 2 * w * a * l, $ = 2 * u * s * r + m * r * h + m * s * l + 2 * w * h * l, I = u * R + m * r * l + w * S;
-  return [j, d, x, A, y, $, I];
+const br = (i, t) => {
+  const [[e, n, s, r], [o, a, h, l]] = t.polynomialCoefficients, c = i.coefficients, u = c.x2, m = c.xy, w = c.y2, g = c.x, p = c.y, M = c.c, f = e * e, P = n * n, b = s * s, S = r * r, C = o * o, V = a * a, v = h * h, k = l * l, j = M + g * e + u * f + p * o + m * e * o + w * C, d = g * n + 2 * u * e * n + m * n * o + p * a + m * e * a + 2 * w * o * a, x = u * P + g * s + 2 * u * e * s + m * s * o + m * n * a + w * V + p * h + m * e * h + 2 * w * o * h, A = 2 * u * n * s + g * r + 2 * u * e * r + m * r * o + m * s * a + m * n * h + 2 * w * a * h + p * l + m * e * l + 2 * w * o * l, y = u * b + 2 * u * n * r + m * r * a + m * s * h + w * v + m * n * l + 2 * w * a * l, I = 2 * u * s * r + m * r * h + m * s * l + 2 * w * h * l, $ = u * S + m * r * l + w * k;
+  return [j, d, x, A, y, I, $];
 };
-function Cn(i, t) {
-  const e = Math.max(i.precision, t.precision), n = yr(i, t), s = hn(n, e).filter((r) => r >= -t.precision && r <= 1 + t.precision);
-  return xi(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
+function In(i, t) {
+  const e = Math.max(i.precision, t.precision), n = br(i, t), s = ln(n, e).filter((r) => r >= -t.precision && r <= 1 + t.precision);
+  return Ai(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
 }
-const br = (i, t) => {
-  const [[e, n, s], [r, o, a]] = t.polynomialCoefficients, h = i.coefficients, l = h.x2, c = h.xy, u = h.y2, m = h.x, w = h.y, g = h.c, p = e * e, M = n * n, f = s * s, P = r * r, b = o * o, R = a * a, C = l * p + c * e * r + u * P + m * e + w * r + g, V = 2 * l * e * n + c * e * o + c * n * r + 2 * u * r * o + m * n + w * o, v = 2 * l * e * s + l * M + c * e * a + c * n * o + c * s * r + 2 * u * r * a + u * b + m * s + w * a, S = 2 * l * n * s + c * n * a + c * s * o + 2 * u * o * a, j = l * f + c * s * a + u * R;
-  return [C, V, v, S, j];
+const xr = (i, t) => {
+  const [[e, n, s], [r, o, a]] = t.polynomialCoefficients, h = i.coefficients, l = h.x2, c = h.xy, u = h.y2, m = h.x, w = h.y, g = h.c, p = e * e, M = n * n, f = s * s, P = r * r, b = o * o, S = a * a, C = l * p + c * e * r + u * P + m * e + w * r + g, V = 2 * l * e * n + c * e * o + c * n * r + 2 * u * r * o + m * n + w * o, v = 2 * l * e * s + l * M + c * e * a + c * n * o + c * s * r + 2 * u * r * a + u * b + m * s + w * a, k = 2 * l * n * s + c * n * a + c * s * o + 2 * u * o * a, j = l * f + c * s * a + u * S;
+  return [C, V, v, k, j];
 };
-function Tn(i, t) {
-  const e = Math.max(i.precision, t.precision), n = br(i, t), s = ir(...n).filter((r) => r >= -t.precision && r <= 1 + t.precision);
-  return xi(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
+function $n(i, t) {
+  const e = Math.max(i.precision, t.precision), n = xr(i, t), s = sr(...n).filter((r) => r >= -t.precision && r <= 1 + t.precision);
+  return Ai(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
 }
 function lt(i, { firstPoint: t, lastPoint: e }, n = 1e-9) {
   const s = q(e, t);
-  return Math.abs(s[0]) < n ? s[1] > 0 ? t[0] - i[0] : i[0] - t[0] : Math.abs(s[1]) < n ? s[0] > 0 ? i[1] - t[1] : t[1] - i[1] : bt(s, q(i, t)) / Xi(s);
+  return Math.abs(s[0]) < n ? s[1] > 0 ? t[0] - i[0] : i[0] - t[0] : Math.abs(s[1]) < n ? s[0] > 0 ? i[1] - t[1] : t[1] - i[1] : bt(s, q(i, t)) / Wi(s);
 }
-let un = class {
+let cn = class {
   constructor(t, e, n, s) {
     this.firstPoint = t, this.lastPoint = e, this.negativeThickness = n, this.positiveThickness = s;
   }
@@ -4902,33 +4902,33 @@ let un = class {
     return this.positiveThickness - this.negativeThickness;
   }
 };
-const xr = 3 / 4, vr = 4 / 9;
-function Ar(i) {
-  const t = lt(i.firstControlPoint, i), e = lt(i.lastControlPoint, i), n = t * e > 0 ? xr : vr;
-  return new un(
+const vr = 3 / 4, Ar = 4 / 9;
+function Er(i) {
+  const t = lt(i.firstControlPoint, i), e = lt(i.lastControlPoint, i), n = t * e > 0 ? vr : Ar;
+  return new cn(
     i.firstPoint,
     i.lastPoint,
     n * Math.min(0, t, e),
     n * Math.max(0, t, e)
   );
 }
-function Er(i) {
+function Sr(i) {
   const t = lt(i.controlPoint, i);
-  return new un(
+  return new cn(
     i.firstPoint,
     i.lastPoint,
     Math.min(0, t / 2),
     Math.max(0, t / 2)
   );
 }
-function Sr(i) {
+function kr(i) {
   if (i instanceof rt)
-    return Ar(i);
-  if (i instanceof et)
     return Er(i);
+  if (i instanceof et)
+    return Sr(i);
   throw new Error("Not implemented");
 }
-function kr(i) {
+function Rr(i) {
   const t = i.paramPoint(0.5), e = nt(q(t, i.firstPoint)), n = X(t, e), s = {
     firstPoint: t,
     lastPoint: n
@@ -4939,14 +4939,14 @@ function kr(i) {
   return i instanceof rt ? r.push(
     lt(i.firstControlPoint, s),
     lt(i.lastControlPoint, s)
-  ) : i instanceof et && r.push(lt(i.controlPoint, s)), new un(
+  ) : i instanceof et && r.push(lt(i.controlPoint, s)), new cn(
     t,
     n,
     Math.min(...r),
     Math.max(...r)
   );
 }
-function $n(i, t) {
+function _n(i, t) {
   const e = [];
   for (let n = 1; n < i.length; n++) {
     const s = i[n];
@@ -4975,23 +4975,23 @@ class Ht {
     return this.from === "start" ? this.to === "end" ? t : t.splitAtParameters([this.to])[0] : this.to === "end" ? t.splitAtParameters([this.from])[1] : t.splitAtParameters([this.from, this.to])[1];
   }
 }
-function Rr(i, t) {
+function Cr(i, t) {
   if (i instanceof rt)
-    return new Tr([
+    return new Ir([
       lt(i.firstPoint, t),
       lt(i.firstControlPoint, t),
       lt(i.lastControlPoint, t),
       lt(i.lastPoint, t)
     ]);
   if (i instanceof et)
-    return new Cr([
+    return new Tr([
       lt(i.firstPoint, t),
       lt(i.controlPoint, t),
       lt(i.lastPoint, t)
     ]);
   throw new Error("Not implemented");
 }
-class Cr {
+class Tr {
   constructor(t) {
     ut(this, "topHull", []), ut(this, "bottomHull", []), this.distances = t;
     const [e, n, s] = t, r = [0, e], o = [1 / 2, n], a = [1, s], h = s - e, l = e;
@@ -5004,7 +5004,7 @@ class Cr {
     return this.distances[2];
   }
 }
-class Tr {
+class Ir {
   constructor(t) {
     ut(this, "topHull", []), ut(this, "bottomHull", []), this.distances = t;
     const [e, n, s, r] = t, o = [0, e], a = [1 / 3, n], h = [2 / 3, s], l = [1, r], c = r - e, u = e, m = n - (c * (1 / 3) + u), w = s - (c * (2 / 3) + u);
@@ -5024,11 +5024,11 @@ class Tr {
     return this.distances[3];
   }
 }
-function In(i, t) {
-  const e = Rr(t, i), n = $n(
+function Fn(i, t) {
+  const e = Cr(t, i), n = _n(
     e.topHull,
     i.negativeThickness
-  ), s = $n(
+  ), s = _n(
     e.bottomHull,
     i.positiveThickness
   ), r = e.endDistance >= i.negativeThickness && e.endDistance <= i.positiveThickness;
@@ -5043,11 +5043,11 @@ function In(i, t) {
   const o = n.length ? n : s;
   return o.length === 2 ? new Ht(o[0], o[1]) : r ? new Ht(o[0], "end") : new Ht("start", o[0]);
 }
-function _n(i, t) {
-  const e = Sr(i), n = In(e, t);
+function Ln(i, t) {
+  const e = kr(i), n = Fn(e, t);
   if (!n)
     return null;
-  const s = kr(i), r = In(
+  const s = Rr(i), r = Fn(
     s,
     t
   );
@@ -5058,18 +5058,18 @@ function It(i, t, e = 1e-9, { maxIterations: n = 100 } = {}) {
   const s = Math.max(e * e, Number.EPSILON * 10);
   let r = i, o = t, a = be(r), h = be(o);
   for (let l = 0; l < n; l++) {
-    const c = a > s ? _n(o, r) : r;
+    const c = a > s ? Ln(o, r) : r;
     if (!c) return [];
-    const u = be(c), m = h > s ? _n(c, o) : o;
+    const u = be(c), m = h > s ? Ln(c, o) : o;
     if (!m) return [];
     const w = be(m);
     if (u <= s && w <= s)
       return [
         c.boundingBox.intersection(m.boundingBox).center
       ];
-    if (k(c.firstPoint, c.lastPoint) && m.isOnSegment(c.firstPoint))
+    if (R(c.firstPoint, c.lastPoint) && m.isOnSegment(c.firstPoint))
       return [c.firstPoint];
-    if (k(m.firstPoint, m.lastPoint) && c.isOnSegment(m.firstPoint))
+    if (R(m.firstPoint, m.lastPoint) && c.isOnSegment(m.firstPoint))
       return [m.firstPoint];
     if (u > 0.8 * a && w > 0.8 * h)
       if (u / a > w / h) {
@@ -5121,11 +5121,11 @@ function $r(i, t) {
   if (e.length === 2)
     return [i.splitAt(e)[1]];
   if (e.length === 3)
-    return k(e[0], i.firstPoint) && k(e[1], i.lastPoint) ? [i] : [t];
+    return R(e[0], i.firstPoint) && R(e[1], i.lastPoint) ? [i] : [t];
   if (e.length === 4)
     return [i];
 }
-function Ir(i, t, e = !1) {
+function _r(i, t, e = !1) {
   const n = Math.max(i.precision, t.precision);
   if (e) {
     const s = $r(i, t);
@@ -5134,7 +5134,7 @@ function Ir(i, t, e = !1) {
   }
   return It(i, t, n);
 }
-function _r(i, t) {
+function Fr(i, t) {
   const e = [];
   if ([
     [i.firstPoint, t],
@@ -5148,22 +5148,22 @@ function _r(i, t) {
   if (e.length === 2)
     return [i.splitAt(e)[1]];
   if (e.length === 3)
-    return k(e[0], i.firstPoint) && k(e[1], i.lastPoint) ? [i] : [t];
+    return R(e[0], i.firstPoint) && R(e[1], i.lastPoint) ? [i] : [t];
   if (e.length === 4)
     return [i];
 }
-function Fr(i, t, e = !1) {
+function Lr(i, t, e = !1) {
   const n = Math.max(i.precision, t.precision);
   if (e) {
-    const s = _r(i, t);
+    const s = Fr(i, t);
     if (s)
       return s;
   }
   return It(i, t, n);
 }
-function Lr(i, t, e) {
+function Br(i, t, e) {
   if (i instanceof D && t instanceof D) {
-    const n = oi(
+    const n = hi(
       i,
       t,
       !1,
@@ -5172,16 +5172,16 @@ function Lr(i, t, e) {
     return n === null ? [] : [n];
   }
   if (i instanceof D && t instanceof z)
-    return Re(i, t, e);
+    return Ce(i, t, e);
   if (i instanceof z && t instanceof D)
-    return Re(t, i, e);
+    return Ce(t, i, e);
   if (i instanceof z && t instanceof z)
-    return yi(i, t, !1, e);
+    return xi(i, t, !1, e);
   throw new Error("Not implemented");
 }
-function ie(i, t, e) {
+function se(i, t, e) {
   if (i instanceof D && t instanceof D) {
-    const n = oi(
+    const n = hi(
       i,
       t,
       !0,
@@ -5192,15 +5192,15 @@ function ie(i, t, e) {
   if (!i.boundingBox.overlaps(t.boundingBox))
     return { intersections: [], overlaps: [], count: 0 };
   if (i instanceof D && t instanceof z) {
-    const n = Re(i, t, e);
+    const n = Ce(i, t, e);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof z && t instanceof D) {
-    const n = Re(t, i, e);
+    const n = Ce(t, i, e);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof z && t instanceof z) {
-    const n = yi(
+    const n = xi(
       i,
       t,
       !0,
@@ -5217,7 +5217,7 @@ function ie(i, t, e) {
     } : { intersections: [], overlaps: [], count: 0 };
   }
   if (i instanceof D && t instanceof at) {
-    const n = We(
+    const n = He(
       i,
       t,
       e
@@ -5225,7 +5225,7 @@ function ie(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (t instanceof D && i instanceof at) {
-    const n = We(
+    const n = He(
       t,
       i,
       e
@@ -5233,15 +5233,15 @@ function ie(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof z && t instanceof at) {
-    const n = kn(i, t);
+    const n = Cn(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (t instanceof z && i instanceof at) {
-    const n = kn(t, i);
+    const n = Cn(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof at && t instanceof at) {
-    const n = Pr(
+    const n = Mr(
       i,
       t,
       !0
@@ -5257,31 +5257,31 @@ function ie(i, t, e) {
     } : { intersections: [], overlaps: [], count: 0 };
   }
   if (i instanceof D && (t instanceof rt || t instanceof et)) {
-    const n = Rn(i, t);
+    const n = Tn(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (t instanceof D && (i instanceof rt || i instanceof et)) {
-    const n = Rn(t, i);
+    const n = Tn(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((i instanceof z || i instanceof at) && t instanceof et) {
-    const n = Tn(i, t);
+    const n = $n(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((t instanceof z || t instanceof at) && i instanceof et) {
-    const n = Tn(t, i);
+    const n = $n(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((i instanceof z || i instanceof at) && t instanceof rt) {
-    const n = Cn(i, t);
+    const n = In(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((t instanceof z || t instanceof at) && i instanceof rt) {
-    const n = Cn(t, i);
+    const n = In(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof et && t instanceof et) {
-    const n = Fr(
+    const n = Lr(
       i,
       t
     );
@@ -5300,7 +5300,7 @@ function ie(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof rt && t instanceof rt) {
-    const n = Ir(
+    const n = _r(
       i,
       t
     );
@@ -5316,20 +5316,20 @@ function ie(i, t, e) {
   }
   throw new Error("Not implemented");
 }
-function vi(i) {
+function Ei(i) {
   const t = [];
   for (let e = 0; e < i; e++)
     for (let n = 0; n <= e; n++)
       t.push([e, n]);
   return t;
 }
-function* He(i) {
-  for (const [t, e] of vi(i.length))
+function* Qe(i) {
+  for (const [t, e] of Ei(i.length))
     t !== e && (yield [i[t], i[e]]);
 }
-class Ai extends Lt {
+class Si extends Ft {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
-    super(), ut(this, "segments"), ut(this, "_boundingBox", null), e || Ei(t), this.segments = t;
+    super(), ut(this, "segments"), ut(this, "_boundingBox", null), e || ki(t), this.segments = t;
   }
   get repr() {
     return this.segments.map((t) => t.repr).join(`
@@ -5354,12 +5354,12 @@ class Ai extends Lt {
   intersects(t) {
     return this.boundingBox.overlaps(t.boundingBox) ? this.segments.some(
       (e) => t.segments.some(
-        (n) => ie(e, n).count > 0
+        (n) => se(e, n).count > 0
       )
     ) : !1;
   }
   overlappingSegments(t) {
-    return this.segments.flatMap((e) => t.segments.flatMap((n) => e.boundingBox.overlaps(n.boundingBox) ? ie(e, n).overlaps : []));
+    return this.segments.flatMap((e) => t.segments.flatMap((n) => e.boundingBox.overlaps(n.boundingBox) ? se(e, n).overlaps : []));
   }
   get boundingBox() {
     if (this._boundingBox === null) {
@@ -5374,30 +5374,30 @@ class Ai extends Lt {
     return this.repr;
   }
 }
-function Br(i, t = "Stroke") {
-  vi(i.length).forEach(
+function Vr(i, t = "Stroke") {
+  Ei(i.length).forEach(
     ([e, n]) => {
       if (e === n) return;
-      const s = i[e], r = i[n], o = ie(s, r), a = Math.max(s.precision, r.precision);
+      const s = i[e], r = i[n], o = se(s, r), a = Math.max(s.precision, r.precision);
       if (o.count !== 0) {
         if (o.count === 1 && !o.overlaps.length) {
           const h = e - n, l = o.intersections[0];
-          if (h === 1 && k(s.firstPoint, l, a) || h === -1 && k(s.lastPoint, l, a) || h === i.length - 1 && k(s.lastPoint, l, a) && k(r.firstPoint, l, a) || -h === i.length - 1 && k(s.firstPoint, l, a) && k(r.lastPoint, l, a))
+          if (h === 1 && R(s.firstPoint, l, a) || h === -1 && R(s.lastPoint, l, a) || h === i.length - 1 && R(s.lastPoint, l, a) && R(r.firstPoint, l, a) || -h === i.length - 1 && R(s.firstPoint, l, a) && R(r.lastPoint, l, a))
             return;
         }
-        if (!(o.count === 2 && i.length === 2 && (k(
+        if (!(o.count === 2 && i.length === 2 && (R(
           s.firstPoint,
           o.intersections[0],
           a
-        ) && k(
+        ) && R(
           s.lastPoint,
           o.intersections[1],
           a
-        ) || k(
+        ) || R(
           s.firstPoint,
           o.intersections[1],
           a
-        ) && k(
+        ) && R(
           s.lastPoint,
           o.intersections[0],
           a
@@ -5411,22 +5411,22 @@ function Br(i, t = "Stroke") {
     }
   );
 }
-function Ei(i, t = "Stroke") {
+function ki(i, t = "Stroke") {
   if (i.length === 0)
     throw new Error(`${t} must have at least one segment`);
   Pt([i.slice(0, -1), i.slice(1)]).forEach(
     ([e, n]) => {
-      if (!k(e.lastPoint, n.firstPoint))
+      if (!R(e.lastPoint, n.firstPoint))
         throw new Error(
           `${t} segments must be connected, but ${e.info} and ${n.info} are not`
         );
     }
-  ), Br(i, t);
+  ), Vr(i, t);
 }
-function Fn(i, t) {
-  return !!(i instanceof D && t instanceof D && sn(i.V, t.V) || i instanceof z && t instanceof z && k(i.center, t.center) && i.radius - t.radius < i.precision);
+function Bn(i, t) {
+  return !!(i instanceof D && t instanceof D && rn(i.V, t.V) || i instanceof z && t instanceof z && R(i.center, t.center) && i.radius - t.radius < i.precision);
 }
-function Ln(i, t) {
+function Vn(i, t) {
   if (i instanceof D && t instanceof D)
     return new D(i.firstPoint, t.lastPoint);
   if (i instanceof z && t instanceof z)
@@ -5438,7 +5438,7 @@ function Ln(i, t) {
     );
   throw new Error("Not implemented");
 }
-function Si(i) {
+function Ri(i) {
   let t = !1;
   const e = [];
   for (const n of i.segments) {
@@ -5447,19 +5447,19 @@ function Si(i) {
       continue;
     }
     const s = e[e.length - 1];
-    Fn(s, n) ? (t = !0, e.pop(), e.push(Ln(s, n))) : e.push(n);
+    Bn(s, n) ? (t = !0, e.pop(), e.push(Vn(s, n))) : e.push(n);
   }
-  if (k(i.firstPoint, i.lastPoint) && Fn(
+  if (R(i.firstPoint, i.lastPoint) && Bn(
     e[0],
     e[e.length - 1]
   )) {
     t = !0;
     const n = e.pop();
-    e[0] = Ln(n, e[0]);
+    e[0] = Vn(n, e[0]);
   }
   return t ? e : null;
 }
-let Rt = class Ut extends Ai {
+let Rt = class Ut extends Si {
   constructor() {
     super(...arguments), ut(this, "strokeType", "STRAND");
   }
@@ -5474,12 +5474,12 @@ let Rt = class Ut extends Ai {
     );
   }
   extend(t) {
-    if (!k(this.lastPoint, t.firstPoint))
+    if (!R(this.lastPoint, t.firstPoint))
       throw console.error(this.repr, t.repr), new Error("Cannot extend strand: connection point is not the same");
     return new Ut([...this.segments, ...t.segments]);
   }
   simplify() {
-    const t = Si(this);
+    const t = Ri(this);
     return t ? new Ut(t, { ignoreChecks: !0 }) : this;
   }
   transform(t) {
@@ -5489,8 +5489,8 @@ let Rt = class Ut extends Ai {
     );
   }
 };
-const Vr = (i, t) => {
-  const e = Ie(t, {
+const jr = (i, t) => {
+  const e = _e(t, {
     V: [1, 0],
     firstPoint: i,
     precision: t.precision
@@ -5505,36 +5505,36 @@ const Vr = (i, t) => {
   }
   return 1;
 };
-class cn {
+let fn = class {
   constructor(t) {
     ut(this, "_count", 0), ut(this, "segment"), this.segment = t;
   }
   update(t, e = !1) {
-    !e && !this.segment.isOnSegment(t) || (k(t, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : k(t, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
+    !e && !this.segment.isOnSegment(t) || (R(t, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : R(t, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
   }
   get count() {
     return this._count;
   }
-}
-const jr = (i, t) => {
+};
+const qr = (i, t) => {
   const e = t.precision, n = Math.abs(i[1] - t.center[1]);
   if (n > t.radius + e) return 0;
-  const s = Ft(i, t.center), r = t.radius * t.radius, o = e * e;
+  const s = _t(i, t.center), r = t.radius * t.radius, o = e * e;
   if (Math.abs(s - r) < o && t.isOnSegment(i))
     return 0;
   const a = s - r > o;
   if (a && t.center[0] < i[0]) return 0;
   const h = Math.sqrt(
     t.radius * t.radius - n * n
-  ), l = new cn(t);
+  ), l = new fn(t);
   return l.update([t.center[0] + h, i[1]]), a && l.update([t.center[0] - h, i[1]]), l.count;
-}, qr = (i, t) => {
-  const e = t.boundingBox.xMax + t.boundingBox.width / 2, n = new D(i, [e, i[1]]), s = new cn(t);
-  return We(n, t).forEach((r) => {
+}, Nr = (i, t) => {
+  const e = t.boundingBox.xMax + t.boundingBox.width / 2, n = new D(i, [e, i[1]]), s = new fn(t);
+  return He(n, t).forEach((r) => {
     s.update(r, !0);
   }), s.count;
-}, Nr = (i, t) => {
-  const e = new cn(t);
+}, Or = (i, t) => {
+  const e = new fn(t);
   return t.paramsAtY(i[1]).map((n) => {
     try {
       return t.paramPoint(n);
@@ -5548,20 +5548,20 @@ const jr = (i, t) => {
     e.update(n, !0);
   }), e.count;
 };
-function Or(i, t) {
+function zr(i, t) {
   if (t instanceof D)
-    return Vr(i, t);
-  if (t instanceof z)
     return jr(i, t);
-  if (t instanceof at)
+  if (t instanceof z)
     return qr(i, t);
-  if (t instanceof rt || t instanceof et)
+  if (t instanceof at)
     return Nr(i, t);
+  if (t instanceof rt || t instanceof et)
+    return Or(i, t);
   throw new Error("Not implemented");
 }
-class dt extends Ai {
+let Lt = class Jt extends Si {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
-    super(t, { ignoreChecks: !0 }), ut(this, "strokeType", "LOOP"), ut(this, "_clockwise", null), e || zr(t);
+    super(t, { ignoreChecks: !0 }), ut(this, "strokeType", "LOOP"), ut(this, "_clockwise", null), e || Dr(t);
   }
   get clockwise() {
     if (this._clockwise === null) {
@@ -5574,44 +5574,44 @@ class dt extends Ai {
     return this._clockwise;
   }
   clone() {
-    return new dt(
+    return new Jt(
       this.segments.map((t) => t.clone()),
       { ignoreChecks: !0 }
     );
   }
   reverse() {
     const t = this.segments.map((e) => e.reverse());
-    return t.reverse(), new dt(t, { ignoreChecks: !0 });
+    return t.reverse(), new Jt(t, { ignoreChecks: !0 });
   }
   transform(t) {
-    return new dt(
+    return new Jt(
       this.segments.map((e) => e.transform(t)),
       { ignoreChecks: !0 }
     );
   }
-  contains(t) {
-    return this.onStroke(t) || !this.boundingBox.contains(t) ? !1 : this.segments.reduce((e, n) => e + Or(t, n), 0) % 2 === 1;
+  contains(t, { strokeIsInside: e = !1 } = {}) {
+    return this.onStroke(t) ? e : this.boundingBox.contains(t) ? this.segments.reduce((n, s) => n + zr(t, s), 0) % 2 === 1 : !1;
   }
   simplify() {
-    const t = Si(this);
-    return t ? new dt(t, { ignoreChecks: !0 }) : this;
+    const t = Ri(this);
+    return t ? new Jt(t, { ignoreChecks: !0 }) : this;
   }
-}
-function zr(i) {
-  if (Ei(i, "Loop"), !k(i[0].firstPoint, i[i.length - 1].lastPoint))
+};
+function Dr(i) {
+  if (ki(i, "Loop"), !R(i[0].firstPoint, i[i.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
-const Dr = [
+const Ur = [
   D,
   z,
   at,
   et,
   rt
 ];
-function ki(i) {
-  return Dr.some((t) => i instanceof t);
+function Ci(i) {
+  return Ur.some((t) => i instanceof t);
 }
-function Ri(i) {
+function Ti(i) {
   if (i instanceof D)
     return {
       type: i.segmentType,
@@ -5654,37 +5654,37 @@ function Ri(i) {
     };
   throw new Error("Unknown segment type");
 }
-function Qe(i) {
+function Ge(i) {
   return {
     type: "LOOP",
-    segments: i.segments.map(Ri)
+    segments: i.segments.map(Ti)
   };
 }
-function Ci(i) {
+function Ii(i) {
   return {
     type: "FIGURE",
-    contour: Qe(i.contour),
-    holes: i.holes.map(Qe)
+    contour: Ge(i.contour),
+    holes: i.holes.map(Ge)
   };
 }
-function Ur(i) {
+function Yr(i) {
   return {
     type: "DIAGRAM",
-    figures: i.figures.map(Ci)
+    figures: i.figures.map(Ii)
   };
 }
-function Bn(i) {
-  if (i instanceof ae)
-    return Ur(i);
-  if (i instanceof mt)
-    return Ci(i);
+function jn(i) {
   if (i instanceof dt)
-    return Qe(i);
-  if (ki(i))
-    return Ri(i);
+    return Yr(i);
+  if (i instanceof mt)
+    return Ii(i);
+  if (i instanceof Lt)
+    return Ge(i);
+  if (Ci(i))
+    return Ti(i);
   throw new Error("Unknown shape type");
 }
-class Yr {
+class Xr {
   constructor() {
     this.ids = [], this.values = [], this.length = 0;
   }
@@ -5730,8 +5730,8 @@ class Yr {
     this.ids.length = this.values.length = this.length;
   }
 }
-const Vn = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], ze = 3;
-let Xr = class Ti {
+const qn = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], De = 3;
+class mn {
   /**
    * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
    * @param {ArrayBuffer | SharedArrayBuffer} data
@@ -5747,13 +5747,13 @@ let Xr = class Ti {
     if (n !== 251)
       throw new Error("Data does not appear to be in a Flatbush format.");
     const r = s >> 4;
-    if (r !== ze)
-      throw new Error(`Got v${r} data when expected v${ze}.`);
-    const o = Vn[s & 15];
+    if (r !== De)
+      throw new Error(`Got v${r} data when expected v${De}.`);
+    const o = qn[s & 15];
     if (!o)
       throw new Error("Unrecognized array type.");
     const [a] = new Uint16Array(t, e + 2, 1), [h] = new Uint32Array(t, e + 4, 1);
-    return new Ti(h, a, o, void 0, t, e);
+    return new mn(h, a, o, void 0, t, e);
   }
   /**
    * Create a Flatbush index that will hold a given number of items.
@@ -5774,10 +5774,10 @@ let Xr = class Ti {
       a = Math.ceil(a / this.nodeSize), h += a, this._levelBounds.push(h * 4);
     while (a !== 1);
     this.ArrayType = n, this.IndexArrayType = h < 16384 ? Uint16Array : Uint32Array;
-    const l = Vn.indexOf(this.ArrayType), c = h * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    const l = qn.indexOf(this.ArrayType), c = h * 4 * this.ArrayType.BYTES_PER_ELEMENT;
     if (l < 0)
       throw new Error(`Unexpected typed array class: ${n}.`);
-    r && r.byteLength !== void 0 && !r.buffer ? (this.data = r, this._boxes = new this.ArrayType(this.data, o + 8, h * 4), this._indices = new this.IndexArrayType(this.data, o + 8 + c, h), this._pos = h * 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 s(8 + c + h * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, h * 4), this._indices = new this.IndexArrayType(this.data, 8 + c, h), 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, (ze << 4) + l]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t), this._queue = new Yr();
+    r && r.byteLength !== void 0 && !r.buffer ? (this.data = r, this._boxes = new this.ArrayType(this.data, o + 8, h * 4), this._indices = new this.IndexArrayType(this.data, o + 8 + c, h), this._pos = h * 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 s(8 + c + h * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, h * 4), this._indices = new this.IndexArrayType(this.data, 8 + c, h), 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, (De << 4) + l]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t), this._queue = new Xr();
   }
   /**
    * Add a given rectangle to the index.
@@ -5805,7 +5805,7 @@ let Xr = class Ti {
       const h = t[a++], l = t[a++], c = t[a++], u = t[a++], m = Math.floor(r * ((h + c) / 2 - this.minX) / e), w = Math.floor(r * ((l + u) / 2 - this.minY) / n);
       s[o] = Hr(m, w);
     }
-    Ge(s, t, this._indices, 0, this.numItems - 1, this.nodeSize);
+    Je(s, t, this._indices, 0, this.numItems - 1, this.nodeSize);
     for (let o = 0, a = 0; o < this._levelBounds.length - 1; o++) {
       const h = this._levelBounds[o];
       for (; a < h; ) {
@@ -5832,7 +5832,7 @@ let Xr = class Ti {
     let o = this._boxes.length - 4;
     const a = [], h = [];
     for (; o !== void 0; ) {
-      const l = Math.min(o + this.nodeSize * 4, qn(o, this._levelBounds));
+      const l = Math.min(o + this.nodeSize * 4, On(o, this._levelBounds));
       for (let c = o; c < l; c += 4) {
         if (n < this._boxes[c] || s < this._boxes[c + 1] || t > this._boxes[c + 2] || e > this._boxes[c + 3]) continue;
         const u = this._indices[c >> 2] | 0;
@@ -5857,9 +5857,9 @@ let Xr = class Ti {
     let o = this._boxes.length - 4;
     const a = this._queue, h = [], l = s * s;
     t: for (; o !== void 0; ) {
-      const c = Math.min(o + this.nodeSize * 4, qn(o, this._levelBounds));
+      const c = Math.min(o + this.nodeSize * 4, On(o, this._levelBounds));
       for (let u = o; u < c; u += 4) {
-        const m = this._indices[u >> 2] | 0, w = jn(t, this._boxes[u], this._boxes[u + 2]), g = jn(e, this._boxes[u + 1], this._boxes[u + 3]), p = w * w + g * g;
+        const m = this._indices[u >> 2] | 0, w = Nn(t, this._boxes[u], this._boxes[u + 2]), g = Nn(e, this._boxes[u + 1], this._boxes[u + 3]), p = w * w + g * g;
         p > l || (o >= this.numItems * 4 ? a.push(m << 1, p) : (r === void 0 || r(m)) && a.push((m << 1) + 1, p));
       }
       for (; a.length && a.peek() & 1; )
@@ -5868,11 +5868,11 @@ let Xr = class Ti {
     }
     return a.clear(), h;
   }
-};
-function jn(i, t, e) {
+}
+function Nn(i, t, e) {
   return i < t ? t - i : i <= e ? 0 : i - e;
 }
-function qn(i, t) {
+function On(i, t) {
   let e = 0, n = t.length - 1;
   for (; e < n; ) {
     const s = e + n >> 1;
@@ -5880,7 +5880,7 @@ function qn(i, t) {
   }
   return t[e];
 }
-function Ge(i, t, e, n, s, r) {
+function Je(i, t, e, n, s, r) {
   if (Math.floor(n / r) >= Math.floor(s / r)) return;
   const o = i[n + s >> 1];
   let a = n - 1, h = s + 1;
@@ -5894,7 +5894,7 @@ function Ge(i, t, e, n, s, r) {
     if (a >= h) break;
     Wr(i, t, e, a, h);
   }
-  Ge(i, t, e, n, h, r), Ge(i, t, e, h + 1, s, r);
+  Je(i, t, e, n, h, r), Je(i, t, e, h + 1, s, r);
 }
 function Wr(i, t, e, n, s) {
   const r = i[n];
@@ -5913,7 +5913,7 @@ function Hr(i, t) {
 function $i(i, t = 1e-7) {
   if (i.length === 0) return [];
   if (i.length === 1) return [i];
-  const e = new Xr(i.length);
+  const e = new mn(i.length);
   i.forEach((r) => {
     const [o, a] = r.firstPoint;
     e.add(o - t, a - t, o + t, a + t);
@@ -5947,7 +5947,7 @@ function $i(i, t = 1e-7) {
     }
   }), n;
 }
-let mt = class Ee extends Lt {
+let mt = class Se extends Ft {
   constructor(t, e = [], { ignoreChecks: n = !1 } = {}) {
     super(), ut(this, "contour"), ut(this, "holes"), n || Qr(t, e), this.contour = t, this.holes = e;
   }
@@ -5961,19 +5961,19 @@ let mt = class Ee extends Lt {
     return [this.contour, ...this.holes];
   }
   clone() {
-    return new Ee(
+    return new Se(
       this.contour.clone(),
       this.holes.map((t) => t.clone())
     );
   }
   transform(t) {
-    return new Ee(
+    return new Se(
       this.contour.transform(t),
       this.holes.map((e) => e.transform(t))
     );
   }
-  contains(t) {
-    return this.contour.contains(t) && !this.holes.some((e) => e.contains(t));
+  contains(t, { strokeIsInside: e = !1 } = {}) {
+    return this.contour.contains(t, { strokeIsInside: e }) && !this.holes.some((n) => n.contains(t, { strokeIsInside: e }));
   }
   intersects(t) {
     return this.allLoops.some(
@@ -5981,24 +5981,45 @@ let mt = class Ee extends Lt {
     );
   }
   overlappingStrands(t) {
-    const e = t instanceof Ee ? t.allLoops : [t], n = this.allLoops.flatMap((s) => e.flatMap((r) => s.overlappingSegments(r)));
+    const e = t instanceof Se ? t.allLoops : [t], n = this.allLoops.flatMap((s) => e.flatMap((r) => s.overlappingSegments(r)));
     return $i(n).map((s) => new Rt(s));
   }
 };
 function Qr(i, t = []) {
   if (!i) throw new Error("Figure must have a contour");
-  for (const [e, n] of He([i, ...t]))
+  for (const [e, n] of Qe([i, ...t]))
     if (e.intersects(n))
       throw new Error("Loops in a figure must not intersect");
   if (t.some(
     (e) => !i.contains(e.firstPoint) && !i.onStroke(e.firstPoint)
   ))
     throw new Error("Holes must be inside the contour");
-  for (const [e, n] of He(t))
+  for (const [e, n] of Qe(t))
     if (e.contains(n.firstPoint))
-      throw console.error(Bn(e), Bn(n)), new Error("Holes must not be inside other holes");
-}
-const Gr = (i) => {
+      throw console.error(jn(e), jn(n)), new Error("Holes must not be inside other holes");
+}
+const xe = (i, t, e = 1e-7) => Math.abs(i - t) <= e, Gr = (i, t) => {
+  const e = i.boundingBox, n = t.boundingBox;
+  return xe(e.xMin, n.xMin) && xe(e.yMin, n.yMin) && xe(e.xMax, n.xMax) && xe(e.yMax, n.yMax);
+}, Jr = (i, t) => {
+  if (i.segmentsCount !== t.segmentsCount || !Gr(i, t)) return !1;
+  const e = i.segments, n = t.segments, s = e.length, r = (o, a) => {
+    for (let h = 0; h < s; h += 1) {
+      const l = (o + a * h + s) % s;
+      if (!e[h].isSame(n[l])) return !1;
+    }
+    return !0;
+  };
+  for (let o = 0; o < s; o += 1)
+    if (e[0].isSame(n[o]) && (r(o, 1) || r(o, -1)))
+      return !0;
+  return !1;
+}, Zr = (i) => {
+  const t = [];
+  return i.forEach((e) => {
+    t.some((n) => Jr(e, n)) || t.push(e);
+  }), t;
+}, Kr = (i) => {
   const t = i.map((s, r) => i.slice(r + 1).map((o, a) => [a + r + 1, o]).filter(([, o]) => s.boundingBox.overlaps(o.boundingBox)).map(([o]) => o)), e = [], n = Array(t.length);
   return t.forEach((s, r) => {
     let o = n[r];
@@ -6006,54 +6027,55 @@ const Gr = (i) => {
       n[a] = o;
     });
   }), e;
-}, Ii = (i) => i.map((t, e) => {
+}, _i = (i) => i.map((t, e) => {
   const n = t.segments[0].midPoint, s = i.filter((r, o) => e === o ? !1 : r.contains(n));
   return {
     loop: t,
     isIn: s
   };
-}), Jr = (i, t) => i.flatMap(({ loop: e }) => fn(
+}), to = (i, t) => i.flatMap(({ loop: e }) => gn(
   t.filter(
     ({ loop: n, isIn: s }) => n === e || s.indexOf(e) !== -1
   )
-)), Zr = (i, t) => {
-  const e = t.filter(({ isIn: s }) => s.length <= 1), n = fn(
-    Ii(i.map(({ loop: s }) => s))
+)), eo = (i, t) => {
+  const e = t.filter(({ isIn: s }) => s.length <= 1), n = gn(
+    _i(i.map(({ loop: s }) => s))
   );
   return [e, ...n];
-}, fn = (i) => {
+}, gn = (i) => {
   if (!i.length) return [];
   const t = i.filter(({ isIn: n }) => !n.length), e = i.filter(({ isIn: n }) => n.length > 1);
-  return t.length === 1 && e.length === 0 ? [i] : t.length > 1 ? Jr(t, i) : Zr(e, i);
+  return t.length === 1 && e.length === 0 ? [i] : t.length > 1 ? to(t, i) : eo(e, i);
 };
-function te(i) {
-  return Gr(i).map(Ii).flatMap(fn).map((t) => {
-    if (t.length === 1) return new mt(t[0].loop);
-    t.sort((s, r) => s.isIn.length - r.isIn.length);
-    const [e, ...n] = t.map(({ loop: s }) => s);
-    return new mt(e, n);
+function ee(i) {
+  const t = Zr(i);
+  return Kr(t).map(_i).flatMap(gn).map((e) => {
+    if (e.length === 1) return new mt(e[0].loop);
+    e.sort((r, o) => r.isIn.length - o.isIn.length);
+    const [n, ...s] = e.map(({ loop: r }) => r);
+    return new mt(n, s);
   });
 }
-function Kr(i, t) {
+function no(i, t) {
   const e = [];
   for (const n of i)
     for (const s of t)
       e.push([n, s]);
   return e;
 }
-function* Je(i, t, e) {
-  const n = (o) => t.some((a) => k(a, o.lastPoint)), s = (o) => e.some((a) => o.isSame(a));
-  let r = [];
-  for (const o of i)
-    n(o) ? (r.push(o), yield new Rt(r, { ignoreChecks: !0 }), r = []) : s(o) ? (r.length && (yield new Rt(r, { ignoreChecks: !0 }), r = []), yield new Rt([o], { ignoreChecks: !0 })) : r.push(o);
-  r.length && (yield new Rt(r, { ignoreChecks: !0 }));
+function* Ze(i, t, e) {
+  const n = (a) => t.some((h) => R(h, a.lastPoint)), s = (a, h) => a.segmentType !== h.segmentType || !h.isOnSegment(a.firstPoint) || !h.isOnSegment(a.lastPoint) ? !1 : a.segmentType !== "LINE" ? h.isOnSegment(a.midPoint) : !0, r = (a) => e.some((h) => a.isSame(h) || s(a, h));
+  let o = [];
+  for (const a of i)
+    n(a) ? (o.push(a), yield new Rt(o, { ignoreChecks: !0 }), o = []) : r(a) ? (o.length && (yield new Rt(o, { ignoreChecks: !0 }), o = []), yield new Rt([a], { ignoreChecks: !0 })) : o.push(a);
+  o.length && (yield new Rt(o, { ignoreChecks: !0 }));
 }
-const Nn = (i, t) => {
-  const e = i.findIndex((s) => k(t, s.firstPoint)), n = i.slice(0, e);
+const zn = (i, t) => {
+  const e = i.findIndex((s) => R(t, s.firstPoint)), n = i.slice(0, e);
   return i.slice(e).concat(n);
-}, On = (i, t) => {
+}, Dn = (i, t) => {
   let e = i;
-  const n = (o) => k(o.firstPoint, t.firstPoint) && k(o.lastPoint, t.lastPoint);
+  const n = (o) => R(o.firstPoint, t.firstPoint) && R(o.lastPoint, t.lastPoint);
   let s = i.findIndex(n);
   if (s === -1) {
     const o = i.map((a) => a.reverse());
@@ -6067,162 +6089,200 @@ const Nn = (i, t) => {
   const r = e.slice(0, s);
   return e.slice(s).concat(r);
 };
-function to(i, t, e) {
+function io(i, t, e) {
   return i.filter((n) => {
-    const s = t.filter((o) => k(o.firstPoint, n) || k(o.lastPoint, n));
+    const s = t.filter((o) => R(o.firstPoint, n) || R(o.lastPoint, n));
     if (s.length % 2)
       throw new Error("Bug in the intersection algo on non crossing point");
     const r = s.map((o) => e.contains(o.midPoint));
     return !(r.every((o) => o) || !r.some((o) => o));
   });
 }
-function eo(i, t, e) {
-  let n = [];
-  const s = [], r = new Array(i.segments.length).fill(0).map(() => []), o = new Array(t.segments.length).fill(0).map(() => []);
-  if (i.segments.forEach((m, w) => {
-    t.segments.forEach((g, p) => {
-      const { intersections: M, overlaps: f } = ie(
-        m,
-        g,
+function so(i, t, e, n = !1) {
+  let s = [];
+  const r = [], o = new Array(i.segments.length).fill(0).map(() => []), a = new Array(t.segments.length).fill(0).map(() => []);
+  if (i.segments.forEach((w, g) => {
+    t.segments.forEach((p, M) => {
+      const { intersections: f, overlaps: P } = se(
+        w,
+        p,
         e
       );
-      n.push(...M), r[w].push(...M), o[p].push(...M), s.push(...f);
-      const P = f.flatMap((b) => [
-        b.firstPoint,
-        b.lastPoint
+      s.push(...f), o[g].push(...f), a[M].push(...f), r.push(...P);
+      const b = P.flatMap((S) => [
+        S.firstPoint,
+        S.lastPoint
       ]);
-      n.push(...P), r[w].push(...P), o[p].push(...P);
+      s.push(...b), o[g].push(...b), a[M].push(...b);
     });
-  }), n = At(n, e), !n.length || n.length === 1) return null;
-  const a = ([m, w]) => w.length ? m.splitAt(w) : [m];
-  let h = Pt([i.segments, r]).flatMap(a), l = Pt([t.segments, o]).flatMap(a);
-  if (n = to(
-    n,
-    h,
+  }), s = At(s, e), !s.length || s.length === 1) return null;
+  const h = ([w, g]) => g.length ? w.splitAt(g) : [w];
+  let l = Pt([i.segments, o]).flatMap(h), c = Pt([t.segments, a]).flatMap(h);
+  if (s = io(
+    s,
+    l,
     t
-  ), !n.length && !s.length) return null;
-  if (s.length) {
-    const m = s[0];
-    h = On(
-      h,
-      m
-    ), l = On(
+  ), !s.length && !r.length) return null;
+  if (r.length) {
+    const w = r[0];
+    l = Dn(
       l,
-      m
+      w
+    ), c = Dn(
+      c,
+      w
     );
   } else {
-    const m = n[0];
-    h = Nn(h, m), l = Nn(l, m);
+    const w = s[0];
+    l = zn(l, w), c = zn(c, w);
   }
-  let c = Array.from(
-    Je(
-      h,
-      n,
-      s
-    )
-  ), u = Array.from(
-    Je(
+  let u = Array.from(
+    Ze(
       l,
-      n,
-      s
+      s,
+      r
+    )
+  ), m = Array.from(
+    Ze(
+      c,
+      s,
+      r
     )
   );
-  return (!k(
-    u[0].lastPoint,
-    c[0].lastPoint
-  ) || s.length > 0 && u[0].segmentsCount !== 1) && (u = u.map((m) => m.reverse()).reverse(), k(u[0].lastPoint, c[0].lastPoint) || (c = c.map((m) => m.reverse()).reverse())), Pt([c, u]).map(([m, w]) => m.segmentsCount === 1 && s.some((g) => m.segments[0].isSame(g)) ? [m, "same"] : [m, w]);
+  return (!R(
+    m[0].lastPoint,
+    u[0].lastPoint
+  ) || r.length > 0 && m[0].segmentsCount !== 1) && (m = m.map((w) => w.reverse()).reverse(), R(m[0].lastPoint, u[0].lastPoint) || (u = u.map((w) => w.reverse()).reverse())), Pt([u, m]).map(([w, g]) => {
+    if (n) {
+      if (((p) => p.segments.every(
+        (M) => r.some(
+          (f) => M.isSame(f) || M.segmentType === f.segmentType && f.isOnSegment(M.firstPoint) && f.isOnSegment(M.lastPoint) && (M.segmentType === "LINE" || f.isOnSegment(M.midPoint))
+        )
+      ))(w))
+        return [w, "same"];
+    } else if (w.segmentsCount === 1 && r.some((p) => w.segments[0].isSame(p)))
+      return [w, "same"];
+    return [w, g];
+  });
 }
-function zn(i) {
+function Un(i) {
   let t = i[0];
   for (const e of i.slice(1))
     t = t.extend(e);
-  if (!k(t.firstPoint, t.lastPoint))
+  if (!R(t.firstPoint, t.lastPoint))
     throw console.error(
       it(t.firstPoint),
       it(t.lastPoint)
     ), new Error("Bug in the intersection algo on non closing strand");
-  return new dt(t.segments);
+  return new Lt(t.segments);
 }
-function no(i, t) {
+function ro(i, t) {
   const e = Pt([
     t.slice(0, -1),
     t.slice(1)
-  ]).map(([s, r]) => zn(i.slice(s, r)));
+  ]).map(([s, r]) => Un(i.slice(s, r)));
   let n = i.slice(
     t[t.length - 1]
   );
-  return t[0] !== 0 && (n = n.concat(i.slice(0, t[0]))), e.push(zn(n)), e;
+  return t[0] !== 0 && (n = n.concat(i.slice(0, t[0]))), e.push(Un(n)), e;
 }
-function io(i) {
+function oo(i) {
   if (!i.length) return [];
   const t = i.map((s) => s.firstPoint);
   let e = i.map((s) => s.lastPoint);
   e = e.slice(-1).concat(e.slice(0, -1));
   const n = Pt([t, e]).flatMap(
-    ([s, r], o) => k(s, r) ? [] : o
+    ([s, r], o) => R(s, r) ? [] : o
   );
   try {
-    return no(i, n);
+    return ro(i, n);
   } catch {
-    return $i(i.flatMap((s) => s.segments)).filter((s) => s.length > 1).filter((s) => k(s[0].firstPoint, s.at(-1).lastPoint)).map((s) => new dt(s));
+    return $i(i.flatMap((s) => s.segments)).filter((s) => s.length > 1).filter((s) => R(s[0].firstPoint, s.at(-1).lastPoint)).map((s) => new Lt(s));
   }
 }
-const Dn = (i, t) => {
+const Yn = (i, t) => {
   if (i.length === 0) return [t];
   const e = i.at(-1);
-  return k(e.lastPoint, t.firstPoint) ? i.slice(0, -1).concat([e.extend(t)]) : k(e.lastPoint, t.lastPoint) ? i.slice(0, -1).concat([e.extend(t.reverse())]) : i.concat([t]);
-}, so = (i, t) => i.length === 0 ? [t] : k(i[0].firstPoint, t.lastPoint) ? [t.extend(i[0])].concat(i.slice(1)) : [t].concat(i);
-function mn(i, t, {
+  return R(e.lastPoint, t.firstPoint) ? i.slice(0, -1).concat([e.extend(t)]) : R(e.lastPoint, t.lastPoint) ? i.slice(0, -1).concat([e.extend(t.reverse())]) : i.concat([t]);
+}, ao = (i, t) => i.length === 0 ? [t] : R(i[0].firstPoint, t.lastPoint) ? [t.extend(i[0])].concat(i.slice(1)) : [t].concat(i);
+function pn(i, t, {
   firstInside: e,
-  secondInside: n
+  secondInside: n,
+  firstBoundaryInside: s = !1,
+  secondBoundaryInside: r = !1
 }) {
-  const s = eo(i, t);
-  if (!s) {
-    const h = i.segments[0].midPoint, l = t.contains(h), c = t.segments[0].midPoint, u = i.contains(c);
+  const o = so(
+    i,
+    t,
+    void 0,
+    s || r
+  );
+  if (!o) {
+    const c = i.segments[0].midPoint, u = t.contains(c, {
+      strokeIsInside: r
+    }), m = t.segments[0].midPoint, w = i.contains(m, {
+      strokeIsInside: s
+    });
     return {
       identical: !1,
-      firstCurveInSecond: l,
-      secondCurveInFirst: u
+      firstCurveInSecond: u,
+      secondCurveInFirst: w
     };
   }
-  if (s.every(([, h]) => h === "same"))
+  if (o.every(([, c]) => c === "same"))
     return { identical: !0 };
-  let r = null, o = null;
-  const a = s.flatMap(([h, l]) => {
-    let c = [], u = 0;
-    if (l === "same")
-      return o === 1 ? (o = 1, h) : o === 2 || o === 0 ? (o = null, []) : o === null ? (r ? r = r.extend(h) : r = h, []) : (console.error("weird situation"), []);
-    const m = h.segments[0].midPoint, w = t.contains(m);
-    (e === "keep" && w || e === "remove" && !w) && (u += 1, c = Dn(c, h));
-    const g = l.segments[0].midPoint, p = i.contains(g);
-    if (n === "keep" && p || n === "remove" && !p) {
-      const M = l;
-      u += 1, u === 2 && c.length ? (c = Dn(c, M), r = null) : c = [M];
+  let a = null, h = null;
+  const l = o.flatMap(([c, u]) => {
+    let m = [], w = 0;
+    if (u === "same")
+      return h === 1 ? (h = 1, c) : h === 2 || h === 0 ? (h = null, []) : h === null ? (a ? a = a.extend(c) : a = c, []) : (console.error("weird situation"), []);
+    const g = c.segments[0].midPoint, p = t.contains(g, {
+      strokeIsInside: r
+    });
+    (e === "keep" && p || e === "remove" && !p) && (w += 1, m = Yn(m, c));
+    const M = u.segments[0].midPoint, f = i.contains(M, {
+      strokeIsInside: s
+    });
+    if (n === "keep" && f || n === "remove" && !f) {
+      const P = u;
+      w += 1, w === 2 && m.length ? (m = Yn(m, P), a = null) : m = [P];
     }
-    return o === null && u === 1 && r && (c = so(c, r)), u === 1 && (o = u, r = null), c.length ? c : (r = null, []);
+    return h === null && w === 1 && a && (m = ao(m, a)), w === 1 && (h = w, a = null), m.length ? m : (a = null, []);
   });
-  return io(a);
+  return oo(l);
 }
-const ro = (i, t) => {
-  const e = mn(i, t, {
+const ho = (i, t, e) => {
+  const n = pn(i, t, {
     firstInside: "remove",
-    secondInside: "remove"
+    secondInside: "remove",
+    ...e
   });
-  return Array.isArray(e) ? e : e.identical ? [i] : e.firstCurveInSecond ? [t] : e.secondCurveInFirst ? [i] : [i, t];
-}, Ce = (i, t) => {
-  const e = mn(i, t, {
+  return Array.isArray(n) ? n : n.identical ? [i] : n.firstCurveInSecond ? [t] : n.secondCurveInFirst ? [i] : [i, t];
+}, Te = (i, t, e) => {
+  const n = pn(i, t, {
     firstInside: "remove",
-    secondInside: "keep"
+    secondInside: "keep",
+    ...e
   });
-  return Array.isArray(e) ? e : e.identical ? [] : e.firstCurveInSecond ? [] : e.secondCurveInFirst ? [i, t] : [i];
-}, gn = (i, t) => {
-  const e = mn(i, t, {
+  return Array.isArray(n) ? n : n.identical ? [] : n.firstCurveInSecond ? [] : n.secondCurveInFirst ? [i, t] : [i];
+}, wn = (i, t, e) => {
+  const n = (e == null ? void 0 : e.firstBoundaryInside) ?? !1, s = (e == null ? void 0 : e.secondBoundaryInside) ?? !1, r = n || s, o = (h, l, c) => h.segments.every(
+    (u) => l.contains(u.midPoint, { strokeIsInside: c })
+  );
+  if (r) {
+    if (o(i, t, s))
+      return [i];
+    if (o(t, i, n))
+      return [t];
+  }
+  const a = pn(i, t, {
     firstInside: "keep",
-    secondInside: "keep"
+    secondInside: "keep",
+    ...e
   });
-  return Array.isArray(e) ? e : e.identical ? [i] : e.firstCurveInSecond ? [i] : e.secondCurveInFirst ? [t] : [];
+  return Array.isArray(a) ? a : a.identical ? [i] : a.firstCurveInSecond ? [i] : a.secondCurveInFirst ? [t] : [];
 };
-function oo(i) {
+function lo(i) {
   const t = /* @__PURE__ */ new Map(), e = [];
   return i.forEach((n, s) => {
     let r;
@@ -6234,50 +6294,50 @@ function oo(i) {
         (w) => c.some((g) => w.intersects(g))
       )) return;
       let m;
-      h.length > 1 || c.length > 1 ? m = se(h, c) : m = _i(h[0], c[0]), r.fusedWith.add(l), r.current = m, u || t.set(l, r);
+      h.length > 1 || c.length > 1 ? m = re(h, c) : m = Fi(h[0], c[0]), r.fusedWith.add(l), r.current = m, u || t.set(l, r);
     });
   }), e.flatMap(({ current: n }) => n);
 }
-function _i(i, t) {
-  const e = ro(i.contour, t.contour), n = t.holes.flatMap((o) => Ce(o, i.contour)), s = i.holes.flatMap((o) => Ce(o, t.contour)), r = Kr(i.holes, t.holes).flatMap(
-    ([o, a]) => gn(o, a)
+function Fi(i, t) {
+  const e = ho(i.contour, t.contour), n = t.holes.flatMap((o) => Te(o, i.contour)), s = i.holes.flatMap((o) => Te(o, t.contour)), r = no(i.holes, t.holes).flatMap(
+    ([o, a]) => wn(o, a)
   );
-  return te([
+  return ee([
     ...e,
     ...n,
     ...s,
     ...r
   ]);
 }
-function Te(i, t) {
+function Ie(i, t) {
   if (i.isFull && t.isFull)
-    return te(Ce(i.contour, t.contour));
+    return ee(Te(i.contour, t.contour));
   if (i.isFull) {
-    const n = Ce(i.contour, t.contour), s = t.holes.flatMap(
-      (r) => gn(r, i.contour)
+    const n = Te(i.contour, t.contour), s = t.holes.flatMap(
+      (r) => wn(r, i.contour, { firstBoundaryInside: !0 })
     );
-    return te([...n, ...s]);
+    return ee([...n, ...s]);
   } else if (t.isFull && !i.contour.intersects(t.contour))
     if (i.contour.contains(t.contour.firstPoint)) {
-      const n = se(
+      const n = re(
         i.holes.map((s) => new mt(s)),
         [t]
       );
-      return te([
+      return ee([
         i.contour,
         ...n.flatMap((s) => s.allLoops)
       ]);
     } else
       return [i];
-  let e = Te(new mt(i.contour), t);
+  let e = Ie(new mt(i.contour), t);
   return i.holes.forEach((n) => {
-    e = e.flatMap((s) => Te(s, new mt(n)));
+    e = e.flatMap((s) => Ie(s, new mt(n)));
   }), e;
 }
-function ao(i, t) {
-  const e = gn(i.contour, t.contour);
+function uo(i, t) {
+  const e = wn(i.contour, t.contour);
   if (!e.length) return [];
-  let n = te(e);
+  let n = ee(e);
   return n = Xt(
     n,
     i.holes.map((s) => new mt(s))
@@ -6286,43 +6346,43 @@ function ao(i, t) {
     t.holes.map((s) => new mt(s))
   );
 }
-function se(i, t) {
+function re(i, t) {
   if (!i.length) return t;
   if (!t.length) return i;
   if (i.length === 1 && t.length > 1 || t.length === 1 && i.length > 1)
-    return oo([...i, ...t]);
+    return lo([...i, ...t]);
   if (i.length > 1 && t.length > 1) {
-    let e = se([i[0]], t);
+    let e = re([i[0]], t);
     return i.slice(1).forEach((n) => {
-      e = se([n], e);
+      e = re([n], e);
     }), e;
   }
-  return i.length === 1 && t.length === 1 ? _i(i[0], t[0]) : [];
+  return i.length === 1 && t.length === 1 ? Fi(i[0], t[0]) : [];
 }
 function Xt(i, t) {
   if (!i.length) return [];
   if (!t.length) return i;
   if (i.length === 1 && t.length === 1)
-    return Te(i[0], t[0]);
+    return Ie(i[0], t[0]);
   if (i.length > 1)
     return i.flatMap((n) => Xt([n], t));
-  let e = Te(i[0], t[0]);
+  let e = Ie(i[0], t[0]);
   return t.slice(1).forEach((n) => {
     e = Xt(e, [n]);
   }), e;
 }
-function Ze(i, t) {
-  return !i.length || !t.length ? [] : i.length === 1 && t.length === 1 ? ao(i[0], t[0]) : i.length > 1 ? i.flatMap((e) => Ze([e], t)) : t.flatMap((e) => Ze(i, [e]));
+function Ke(i, t) {
+  return !i.length || !t.length ? [] : i.length === 1 && t.length === 1 ? uo(i[0], t[0]) : i.length > 1 ? i.flatMap((e) => Ke([e], t)) : t.flatMap((e) => Ke(i, [e]));
 }
-let ae = class Tt extends Lt {
+class dt extends Ft {
   constructor(t = [], { ignoreChecks: e = !1 } = {}) {
-    super(), ut(this, "figures"), ut(this, "_boundingBox", null), e || ho(t), this.figures = t;
+    super(), ut(this, "figures"), ut(this, "_boundingBox", null), e || co(t), this.figures = t;
   }
   get isEmpty() {
     return this.figures.length === 0;
   }
   get boundingBox() {
-    if (this.isEmpty) return new re();
+    if (this.isEmpty) return new oe();
     if (this._boundingBox === null) {
       let t = this.figures[0].boundingBox;
       for (const e of this.figures.slice(1))
@@ -6332,13 +6392,15 @@ let ae = class Tt extends Lt {
     return this._boundingBox;
   }
   clone() {
-    return new Tt(this.figures.map((t) => t.clone()));
+    return new dt(this.figures.map((t) => t.clone()));
   }
   transform(t) {
-    return new Tt(this.figures.map((e) => e.transform(t)));
+    return new dt(this.figures.map((e) => e.transform(t)));
   }
-  contains(t) {
-    return this.figures.some((e) => e.contains(t));
+  contains(t, { strokeIsInside: e = !1 } = {}) {
+    return this.figures.some(
+      (n) => n.contains(t, { strokeIsInside: e })
+    );
   }
   intersects(t) {
     return this.figures.some(
@@ -6346,27 +6408,27 @@ let ae = class Tt extends Lt {
     );
   }
   overlappingStrands(t) {
-    return this.figures.flatMap((e) => t instanceof Tt ? t.figures.flatMap(
+    return this.figures.flatMap((e) => t instanceof dt ? t.figures.flatMap(
       (n) => e.overlappingStrands(n)
     ) : e.overlappingStrands(t));
   }
   fuse(t) {
-    return new Tt(se(this.figures, t.figures));
+    return new dt(re(this.figures, t.figures));
   }
   cut(t) {
-    return new Tt(Xt(this.figures, t.figures));
+    return new dt(Xt(this.figures, t.figures));
   }
   intersect(t) {
-    return new Tt(Ze(this.figures, t.figures));
+    return new dt(Ke(this.figures, t.figures));
   }
-};
-function ho(i) {
-  for (const [t, e] of He(i))
+}
+function co(i) {
+  for (const [t, e] of Qe(i))
     if (t.intersects(e))
       throw new Error("Diagram figures must not intersect");
 }
-var lo = Object.defineProperty, uo = (i, t, e) => t in i ? lo(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, xe = (i, t, e) => uo(i, typeof t != "symbol" ? t + "" : t, e);
-const Fi = (i, t, e) => {
+var fo = Object.defineProperty, mo = (i, t, e) => t in i ? fo(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, ve = (i, t, e) => mo(i, typeof t != "symbol" ? t + "" : t, e);
+const Li = (i, t, e) => {
   const n = bt(i.V, t.V), s = i.precision * t.precision;
   if (n * n < s)
     return "parallel";
@@ -6378,23 +6440,23 @@ class $e {
     this.firstPoint = t, this.lastPoint = e;
   }
 }
-function Un(i, t) {
+function Xn(i, t) {
   if (i instanceof D)
-    return co(i, t);
+    return go(i, t);
   if (i instanceof z)
-    return fo(i, t);
+    return po(i, t);
   if (i instanceof et || i instanceof rt)
-    return mo(i, t);
+    return wo(i, t);
   throw new Error("Not implemented");
 }
-function co(i, t) {
+function go(i, t) {
   const { firstPoint: e, lastPoint: n } = i, s = i.normalVector;
   return new D(
     X(e, Q(s, t)),
     X(n, Q(s, t))
   );
 }
-function fo(i, t) {
+function po(i, t) {
   const e = X(
     i.firstPoint,
     Q(nt(i.tangentAtFirstPoint), t)
@@ -6404,8 +6466,8 @@ function fo(i, t) {
   ), s = t * (i.clockwise ? 1 : -1);
   return i.radius + s < i.precision ? new $e(e, n) : new z(e, n, i.center, i.clockwise);
 }
-function De(i, t, e, n, s) {
-  const r = Fi(
+function Ue(i, t, e, n, s) {
+  const r = Li(
     {
       V: e,
       firstPoint: n,
@@ -6423,8 +6485,8 @@ function De(i, t, e, n, s) {
     );
   return r;
 }
-function mo(i, t) {
-  const { firstPoint: e, lastPoint: n, normalAtFirstPoint: s, normalAtLastPoint: r } = i, o = Fi(
+function wo(i, t) {
+  const { firstPoint: e, lastPoint: n, normalAtFirstPoint: s, normalAtLastPoint: r } = i, o = Li(
     { V: s, firstPoint: e, precision: i.precision },
     { V: r, firstPoint: n, precision: i.precision }
   ), a = X(
@@ -6436,13 +6498,13 @@ function mo(i, t) {
   );
   if (o === "parallel")
     throw new Error("Parallel lines not expected in safe bezier offset");
-  if (Se(q(o, e), s) * t > 0 && Math.min(
+  if (ke(q(o, e), s) * t > 0 && Math.min(
     J(e, o),
     J(n, o)
   ) < t)
     return new $e(a, h);
   if (i instanceof et) {
-    const u = De(
+    const u = Ue(
       o,
       i.controlPoint,
       i.tangentAtFirstPoint,
@@ -6455,13 +6517,13 @@ function mo(i, t) {
       u
     );
   }
-  const l = De(
+  const l = Ue(
     o,
     i.firstControlPoint,
     i.tangentAtFirstPoint,
     a,
     i.precision
-  ), c = De(
+  ), c = Ue(
     o,
     i.lastControlPoint,
     i.tangentAtLastPoint,
@@ -6475,31 +6537,31 @@ function mo(i, t) {
     c
   );
 }
-function Li(i, t, e) {
+function Bi(i, t, e) {
   const n = bt(
     i.tangentAtLastPoint,
     t.tangentAtFirstPoint
   );
   if (Math.abs(n) < 1e-10) return null;
-  const s = n > 0 ? 1 : -1, r = Math.abs(e) * s, o = Un(i, r), a = Un(t, r);
+  const s = n > 0 ? 1 : -1, r = Math.abs(e) * s, o = Xn(i, r), a = Xn(t, r);
   if (o instanceof $e || a instanceof $e)
     return null;
   let h;
   try {
-    h = Lr(o, a, 1e-9).at(-1);
+    h = Br(o, a, 1e-9).at(-1);
   } catch {
     return null;
   }
   if (!h)
     return null;
   const l = h, c = (w, g) => {
-    const p = g.tangentAt(l), M = Zt(p), f = X(l, Q(M, r));
+    const p = g.tangentAt(l), M = Kt(p), f = X(l, Q(M, r));
     return w.splitAt(f);
   }, [u] = c(i, o), [, m] = c(t, a);
   return { first: u, second: m, center: l };
 }
-function Yn(i, t, e) {
-  const n = Li(i, t, e);
+function Wn(i, t, e) {
+  const n = Bi(i, t, e);
   if (!n)
     return console.warn(
       "Cannot fillet between segments",
@@ -6509,12 +6571,12 @@ function Yn(i, t, e) {
   const { first: s, second: r } = n;
   return [
     s,
-    ai(s.lastPoint, r.firstPoint, s.tangentAtLastPoint),
+    li(s.lastPoint, r.firstPoint, s.tangentAtLastPoint),
     r
   ];
 }
-function Xn(i, t, e) {
-  const n = Li(i, t, e);
+function Hn(i, t, e) {
+  const n = Bi(i, t, e);
   if (!n)
     return console.warn(
       "Cannot chamfer between segments",
@@ -6524,7 +6586,7 @@ function Xn(i, t, e) {
   const { first: s, second: r } = n;
   return [s, new D(s.lastPoint, r.firstPoint), r];
 }
-const go = (i) => {
+const Po = (i) => {
   let t;
   i ? typeof i == "number" || Array.isArray(i) && i.length === 2 ? t = { endTangent: i } : t = { endTangent: 0, ...i } : t = { endTangent: [1, 0] };
   const {
@@ -6534,16 +6596,16 @@ const go = (i) => {
     startTangent: r
   } = t;
   let o;
-  typeof e == "number" ? o = vt(1, e * _t) : o = e;
+  typeof e == "number" ? o = vt(1, e * $t) : o = e;
   let a;
-  return typeof r == "number" ? a = vt(1, r * _t) : a = r, { endTangent: o, startFactor: n, endFactor: s, startTangent: a };
+  return typeof r == "number" ? a = vt(1, r * $t) : a = r, { endTangent: o, startFactor: n, endFactor: s, startTangent: a };
 };
-function Wn(i, { ignoreChecks: t = !1 } = {}) {
-  return new ae([new mt(new dt([...i], { ignoreChecks: t }))]);
+function Qn(i, { ignoreChecks: t = !1 } = {}) {
+  return new dt([new mt(new Lt([...i], { ignoreChecks: t }))]);
 }
-let po = class {
+let Mo = class {
   constructor(t = [0, 0]) {
-    xe(this, "pointer"), xe(this, "firstPoint"), xe(this, "pendingSegments"), xe(this, "_nextCorner"), this.pointer = t, this.firstPoint = t, this.pendingSegments = [], this._nextCorner = null;
+    ve(this, "pointer"), ve(this, "firstPoint"), ve(this, "pendingSegments"), ve(this, "_nextCorner"), this.pointer = t, this.firstPoint = t, this.pendingSegments = [], this._nextCorner = null;
   }
   movePointerTo(t) {
     if (this.pendingSegments.length)
@@ -6553,13 +6615,13 @@ let po = class {
     return this.pointer = t, this.firstPoint = t, this;
   }
   saveSegment(t) {
-    if (k(t.firstPoint, t.lastPoint))
+    if (R(t.firstPoint, t.lastPoint))
       throw new Error(`Segment has no length, ${t.repr}`);
     if (!this._nextCorner)
       return this.pendingSegments.push(t), this;
     const e = this.pendingSegments.pop();
     if (!e) throw new Error("bug in the custom corner algorithm");
-    const n = this._nextCorner.mode === "chamfer" ? Xn : Yn;
+    const n = this._nextCorner.mode === "chamfer" ? Hn : Wn;
     return this.pendingSegments.push(
       ...n(e, t, this._nextCorner.radius)
     ), this._nextCorner = null, this;
@@ -6584,11 +6646,11 @@ let po = class {
     return this.lineTo([t, this.pointer[1]]);
   }
   polarLineTo([t, e]) {
-    const n = e * _t, s = vt(t, n);
+    const n = e * $t, s = vt(t, n);
     return this.lineTo(s);
   }
   polarLine(t, e) {
-    const n = e * _t, [s, r] = vt(t, n);
+    const n = e * $t, [s, r] = vt(t, n);
     return this.line(s, r);
   }
   tangentLine(t) {
@@ -6599,7 +6661,7 @@ let po = class {
     return this.line(n * t, s * t);
   }
   threePointsArcTo(t, e) {
-    return this.saveSegment(Zi(this.pointer, e, t)), this.pointer = t, this;
+    return this.saveSegment(Ki(this.pointer, e, t)), this.pointer = t, this;
   }
   threePointsArc(t, e, n, s) {
     const [r, o] = this.pointer;
@@ -6647,7 +6709,7 @@ let po = class {
     if (!n)
       throw new Error("You need a previous curve to sketch a tangent arc");
     return this.saveSegment(
-      ai(
+      li(
         this.pointer,
         t,
         e ?? n.tangentAtLastPoint
@@ -6660,7 +6722,7 @@ let po = class {
   }
   ellipseTo(t, e, n, s, r, o) {
     return this.saveSegment(
-      hr(this.pointer, t, e, n, s, r, o)
+      lr(this.pointer, t, e, n, s, r, o)
     ), this.pointer = t, this;
   }
   ellipse(t, e, n, s, r, o, a) {
@@ -6674,12 +6736,12 @@ let po = class {
     );
   }
   halfEllipseTo(t, e) {
-    const [n, s] = si(q(t, this.pointer));
+    const [n, s] = oi(q(t, this.pointer));
     return this.ellipseTo(
       t,
       n / 2,
       Math.abs(e),
-      s * nn,
+      s * sn,
       !0,
       e > 0
     );
@@ -6699,7 +6761,7 @@ let po = class {
     return this.saveSegment(new et(this.pointer, t, e)), this.pointer = t, this;
   }
   smoothCurveTo(t, e) {
-    const { endTangent: n, startTangent: s, startFactor: r, endFactor: o } = go(e), a = this.pendingSegments.length ? this.pendingSegments[this.pendingSegments.length - 1] : null, h = J(this.pointer, t) / 3;
+    const { endTangent: n, startTangent: s, startFactor: r, endFactor: o } = Po(e), a = this.pendingSegments.length ? this.pendingSegments[this.pendingSegments.length - 1] : null, h = J(this.pointer, t) / 3;
     let l;
     s ? l = s : a ? l = a.tangentAtLastPoint : l = [1, 0], l = ot(l);
     const c = [
@@ -6730,16 +6792,16 @@ let po = class {
     const n = this.pendingSegments.pop(), s = this.pendingSegments.shift();
     if (!n || !s)
       throw new Error("Not enough curves to close and fillet");
-    const r = e === "chamfer" ? Xn : Yn;
+    const r = e === "chamfer" ? Hn : Wn;
     this.pendingSegments.push(...r(n, s, t));
   }
   close(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
     const e = this.pendingSegments[0], n = this.pendingSegments.at(-1);
-    return k(e.firstPoint, n.lastPoint) || this.lineTo(e.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
+    return R(e.firstPoint, n.lastPoint) || this.lineTo(e.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
       this._nextCorner.radius,
       this._nextCorner.mode
-    ), this._nextCorner = null), Wn(this.pendingSegments, { ignoreChecks: t });
+    ), this._nextCorner = null), Qn(this.pendingSegments, { ignoreChecks: t });
   }
   closeWithMirror(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
@@ -6752,7 +6814,7 @@ let po = class {
     ), o = this.pendingSegments.map(
       (a) => a.transform(r).reverse()
     );
-    return o.reverse(), Wn(
+    return o.reverse(), Qn(
       [...this.pendingSegments, ...o],
       { ignoreChecks: t }
     );
@@ -6762,22 +6824,22 @@ let po = class {
   }
   get isClosed() {
     var t;
-    return k(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
+    return R(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
   }
 };
-function Bi(i = [0, 0]) {
-  return new po(i);
+function Vi(i = [0, 0]) {
+  return new Mo(i);
 }
 function kt([i, t]) {
   return `${i} ${t}`;
 }
-function pn(i) {
+function dn(i) {
   if (i instanceof D)
     return `L ${kt(i.lastPoint)}`;
   if (i instanceof z)
     return `A ${i.radius} ${i.radius} 0 ${i.angularLength > Math.PI ? "1" : "0"} ${i.clockwise ? "0" : "1"} ${kt(i.lastPoint)}`;
   if (i instanceof at)
-    return `A ${i.majorRadius} ${i.minorRadius} ${i.tiltAngle * nn} ${i.deltaAngle > Math.PI ? "1" : "0"} ${i.clockwise ? "0" : "1"} ${kt(i.lastPoint)}`;
+    return `A ${i.majorRadius} ${i.minorRadius} ${i.tiltAngle * sn} ${i.deltaAngle > Math.PI ? "1" : "0"} ${i.clockwise ? "0" : "1"} ${kt(i.lastPoint)}`;
   if (i instanceof et)
     return `Q ${[
       kt(i.controlPoint),
@@ -6791,49 +6853,49 @@ function pn(i) {
     ].join(" ")}`;
   throw new Error("Unknown segment type");
 }
-function Vi(i) {
-  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(pn).join(" ");
+function ji(i) {
+  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(dn).join(" ");
   return `${t} ${e} Z`;
 }
-function ji(i) {
-  return `<path d="${i.allLoops.map(Vi).join(" ")}" />`;
+function qi(i) {
+  return `<path d="${i.allLoops.map(ji).join(" ")}" />`;
 }
-function wo(i) {
+function yo(i) {
   return `<g>
-  ${i.figures.map(ji).join(`
+  ${i.figures.map(qi).join(`
 `)}
 </g>`;
 }
-function Po(i) {
-  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(pn).join(" ");
+function bo(i) {
+  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(dn).join(" ");
   return `${t} ${e}`;
 }
-function Mo(i, t = 1) {
+function xo(i, t = 1) {
   const e = i.xMin - t, n = i.yMin - t;
   return `${e} ${n} ${i.width + 2 * t} ${i.height + 2 * t}`;
 }
-function Hn(i, t, e = 1, n) {
-  const s = Mo(t, e), r = n ? `width="${t.width + 2 * e}${n}" height="${t.height + 2 * e}${n}"` : "";
+function Gn(i, t, e = 1, n) {
+  const s = xo(t, e), r = n ? `width="${t.width + 2 * e}${n}" height="${t.height + 2 * e}${n}"` : "";
   return `<?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${s}" fill="none" stroke="grey" stroke-width="0.2%" vector-effect="non-scaling-stroke" ${r}>
     ${i}
 </svg>`;
 }
-function Qn(i) {
+function Jn(i) {
   if (i instanceof mt)
     return [i];
-  if (i instanceof dt)
+  if (i instanceof Lt)
     return [new mt(i)];
-  if (i instanceof ae)
+  if (i instanceof dt)
     return i.figures;
   throw new Error("Unknown shape");
 }
-function qi(i, t, e = 1e-9) {
+function Ni(i, t, e = 1e-9) {
   let n = [];
   const s = [], r = new Array(t.segments.length).fill(0).map(() => []);
   t.segments.forEach((a, h) => {
     i.segments.forEach((l) => {
-      const { intersections: c, overlaps: u } = ie(
+      const { intersections: c, overlaps: u } = se(
         a,
         l,
         e
@@ -6848,89 +6910,89 @@ function qi(i, t, e = 1e-9) {
   }), n = At(n, e);
   const o = Pt([t.segments, r]).flatMap(([a, h]) => h.length ? a.splitAt(h) : [a]);
   return Array.from(
-    Je(
+    Ze(
       o,
       n,
       s
     )
   );
 }
-function Ni(i, t, e = !1) {
-  return qi(t, i).filter((n) => {
+function Oi(i, t, e = !1) {
+  return Ni(t, i).filter((n) => {
     const s = n.segments[0].midPoint;
     return t.onStroke(s) ? !e : !t.contains(s);
   });
 }
-function yo(i, t, e = !1) {
-  return qi(t, i).filter((n) => {
+function vo(i, t, e = !1) {
+  return Ni(t, i).filter((n) => {
     const s = n.segments[0].midPoint;
     return t.onStroke(s) ? !e : t.contains(s);
   });
 }
-function Gn(i, t, e = !1) {
-  const n = Ni(
+function Zn(i, t, e = !1) {
+  const n = Oi(
     i,
     t.contour,
     e
   ), s = t.holes.flatMap(
-    (r) => yo(i, r, e)
+    (r) => vo(i, r, e)
   );
   return [...n, ...s];
 }
-function bo(i, t) {
-  return new ae(
-    Xt(Qn(i), Qn(t))
+function Ao(i, t) {
+  return new dt(
+    Xt(Jn(i), Jn(t))
   );
 }
-function Ue(i, t, e = !0) {
-  if (t instanceof dt)
-    return Ni(i, t, e);
+function Ye(i, t, e = !0) {
+  if (t instanceof Lt)
+    return Oi(i, t, e);
   if (t instanceof mt)
-    return Gn(i, t, e);
+    return Zn(i, t, e);
   let n = [new Rt([...i.segments])];
   return t.figures.forEach((s) => {
-    n = n.flatMap((r) => Gn(r, s, e));
+    n = n.flatMap((r) => Zn(r, s, e));
   }), n;
 }
-function Jn(i) {
-  if (i instanceof ae)
-    return wo(i);
-  if (i instanceof mt)
-    return ji(i);
+function Kn(i) {
   if (i instanceof dt)
-    return `<path d="${Vi(i)}" />`;
+    return yo(i);
+  if (i instanceof mt)
+    return qi(i);
+  if (i instanceof Lt)
+    return `<path d="${ji(i)}" />`;
   if (i instanceof Rt)
-    return `<path d="${Po(i)}" />`;
-  if (ki(i))
-    return `<path d="${`M ${i.firstPoint.join(" ")}`} ${pn(
+    return `<path d="${bo(i)}" />`;
+  if (Ci(i))
+    return `<path d="${`M ${i.firstPoint.join(" ")}`} ${dn(
       i
     )}" />`;
   throw new Error("Unknown shape type");
 }
-const Zn = (i) => "shape" in i ? i.shape : i, Kn = (i, t) => {
+const ti = (i) => "shape" in i ? i.shape : i, ei = (i, t) => {
   if (!("shape" in i)) return t;
   const { color: e } = i;
   return e ? `<g stroke="${e}">${t}</g>` : t;
-}, ti = (i) => new re(i.xMin, -i.yMax, i.xMax, -i.yMin);
-function xo(i, {
+}, ni = (i) => new oe(i.xMin, -i.yMax, i.xMax, -i.yMin);
+function Eo(i, {
   margin: t = 1,
   unit: e = null,
   viewBox: n
 } = {}) {
   if (Array.isArray(i)) {
-    const r = i.map((h) => Zn(h).mirror()), o = r.map((h, l) => Kn(i[l], Jn(h))).join(`
+    const r = i.map((h) => ti(h).mirror()), o = r.map((h, l) => ei(i[l], Kn(h))).join(`
 `), a = r.slice(1).reduce((h, l) => h.merge(l.boundingBox), r[0].boundingBox);
-    return Hn(o, n ? ti(n) : a, t, e);
+    return Gn(o, n ? ni(n) : a, t, e);
   }
-  const s = Zn(i).mirror();
-  return Hn(
-    Kn(i, Jn(s)),
-    n ? ti(n) : s.boundingBox,
+  const s = ti(i).mirror();
+  return Gn(
+    ei(i, Kn(s)),
+    n ? ni(n) : s.boundingBox,
     t,
     e
   );
 }
-class Jt extends Lt {
+class Zt extends Ft {
   constructor(e, {
     cutLines: n = [],
     foldLines: s = [],
@@ -6948,7 +7010,7 @@ class Jt extends Lt {
     return [...this.foldLinesForwards, ...this.foldLinesBackwards];
   }
   clone() {
-    return new Jt(this.body, {
+    return new Zt(this.body, {
       cutLines: [...this.cutLines],
       foldLinesForwards: [...this.foldLinesForwards],
       foldLinesBackwards: [...this.foldLinesBackwards]
@@ -6961,27 +7023,27 @@ class Jt extends Lt {
     n === "forwards" ? this.foldLinesForwards.push(e) : this.foldLinesBackwards.push(e);
   }
   fuseFold(e, n = "backwards") {
-    const s = e instanceof Jt ? e.body : e, r = this.body.overlappingStrands(s);
+    const s = e instanceof Zt ? e.body : e, r = this.body.overlappingStrands(s);
     return n === "forwards" ? this.foldLinesForwards.push(...r) : this.foldLinesBackwards.push(...r), this.fuseBody(e), this;
   }
   fuseBody(e) {
     let n;
-    return e instanceof Jt ? (n = e.body, this.cutLines.push(...e.cutLines), this.foldLinesForwards.push(...e.foldLinesForwards), this.foldLinesBackwards.push(...e.foldLinesBackwards)) : n = e, this.body = this.body.fuse(n), this;
+    return e instanceof Zt ? (n = e.body, this.cutLines.push(...e.cutLines), this.foldLinesForwards.push(...e.foldLinesForwards), this.foldLinesBackwards.push(...e.foldLinesBackwards)) : n = e, this.body = this.body.fuse(n), this;
   }
   cutShape(e) {
-    return this.body = bo(this.body, e), this.cutLines = this.cutLines.flatMap(
-      (n) => Ue(n, e, !0)
+    return this.body = Ao(this.body, e), this.cutLines = this.cutLines.flatMap(
+      (n) => Ye(n, e, !0)
     ), this.eraseFolds(e), this;
   }
   eraseFolds(e) {
     this.foldLinesBackwards = this.foldLinesBackwards.flatMap(
-      (n) => Ue(n, e, !0)
+      (n) => Ye(n, e, !0)
     ), this.foldLinesForwards = this.foldLinesForwards.flatMap(
-      (n) => Ue(n, e, !0)
+      (n) => Ye(n, e, !0)
     );
   }
   transform(e) {
-    return new Jt(this.body.transform(e), {
+    return new Zt(this.body.transform(e), {
       cutLines: this.cutLines.map((s) => s.transform(e)),
       foldLinesForwards: this.foldLinesForwards.map(
         (s) => s.transform(e)
@@ -6997,10 +7059,10 @@ class Jt extends Lt {
       (n) => e.push({ shape: n, color: "green" })
     ), this.foldLinesForwards.length && this.foldLinesForwards.map(
       (n) => e.push({ shape: n, color: "blue" })
-    ), xo(e, { unit: "mm" });
+    ), Eo(e, { unit: "mm" });
   }
 }
-function wn(i, t, {
+function Pn(i, t, {
   fillet: e = 1,
   contraction: n = 1,
   contractionMode: s = "rounded",
@@ -7009,23 +7071,23 @@ function wn(i, t, {
   leftContractionMode: a,
   rightContractionMode: h
 } = {}) {
-  const l = r ?? n, c = o ?? n, u = Bi([-i / 2, 0]).hLine(i);
+  const l = r ?? n, c = o ?? n, u = Vi([-i / 2, 0]).hLine(i);
   return c ? (h ?? s) === "rounded" ? (u.tangentArc(-c, c, [-1, 0]), u.vLine(t - c)) : u.line(-c, t) : u.vLine(t), u.customCorner(e), u.hLine(-i + l + c), u.customCorner(e), l ? (a ?? s) === "rounded" ? (u.vLine(-t + l), u.tangentArcTo([-i / 2, 0])) : u.lineTo([-i / 2, 0]) : u.vLine(-t), u.close();
 }
-function vo(i, t, e = {}) {
-  return wn(i, t, e);
+function So(i, t, e = {}) {
+  return Pn(i, t, e);
 }
-function Ao(i, t, e = {}) {
-  return wn(i, t, e).mirror("x");
+function ko(i, t, e = {}) {
+  return Pn(i, t, e).mirror("x");
 }
-function Oi(i, t, {
+function zi(i, t, {
   contractionTop: e,
   contractionBottom: n,
   topContractionMode: s,
   bottomContractionMode: r,
   ...o
 } = {}) {
-  return wn(i, t, {
+  return Pn(i, t, {
     contractionLeft: e,
     contractionRight: n,
     leftContractionMode: s,
@@ -7033,16 +7095,16 @@ function Oi(i, t, {
     ...o
   }).rotate(90);
 }
-function Eo(i, t, e = {}) {
-  return Oi(i, t, e).mirror("y");
+function Ro(i, t, e = {}) {
+  return zi(i, t, e).mirror("y");
 }
-const Lo = {
-  right: Eo,
-  left: Oi,
-  top: vo,
-  bottom: Ao
-}, ei = (i, t) => Bi([-i / 2, 0]).line(t, -t).hLine(i - 2 * t).line(t, t);
-class Ke extends Lt {
+const qo = {
+  right: Ro,
+  left: zi,
+  top: So,
+  bottom: ko
+}, ii = (i, t) => Vi([-i / 2, 0]).line(t, -t).hLine(i - 2 * t).line(t, t);
+class tn extends Ft {
   constructor(e, n = 0.2) {
     super();
     St(this, "cut");
@@ -7052,14 +7114,14 @@ class Ke extends Lt {
       this.cut = e.cut, this.unfold = e.unfold, this.bump = e.bump;
       return;
     }
-    const s = ei(e, n * 2.5);
-    this.cut = s.asStrand(), this.unfold = s.close(), this.bump = ei(e - 5 * n, 5 * n).close().mirror("x");
+    const s = ii(e, n * 2.5);
+    this.cut = s.asStrand(), this.unfold = s.close(), this.bump = ii(e - 5 * n, 5 * n).close().mirror("x");
   }
   clone() {
-    return new Ke(this);
+    return new tn(this);
   }
   transform(e) {
-    return new Ke({
+    return new tn({
       cut: this.cut.transform(e),
       unfold: this.unfold.transform(e),
       bump: this.bump.transform(e)
@@ -7072,12 +7134,12 @@ class Ke extends Lt {
     e.fuseBody(this.bump);
   }
 }
-class Le extends Lt {
+class Be extends Ft {
   constructor(t) {
     super(), this.points = t, this.points = t;
   }
   transform(t) {
-    return new Le(this.points.map(t.transform));
+    return new Be(this.points.map(t.transform));
   }
   distribute(t) {
     return this.points.map((e) => t.translateTo(e));
@@ -7086,7 +7148,7 @@ class Le extends Lt {
     return this.points.map((e) => t.clone().translateTo(e));
   }
 }
-function Bo(i, t, e = 3, n = 0) {
+function No(i, t, e = 3, n = 0) {
   if (i <= t * 2)
     throw new Error("totalWidth must be greater than twice the objectWidth");
   const s = Math.max(
@@ -7097,25 +7159,25 @@ function Bo(i, t, e = 3, n = 0) {
     a.push(
       n + h * (t + o) - i / 2 + t / 2
     );
-  return new Le(a.map((h) => [h, 0]));
+  return new Be(a.map((h) => [h, 0]));
 }
-function Vo(i, t, e = "x") {
+function Oo(i, t, e = "x") {
   const n = i * (t - 1), s = [];
   for (let r = 0; r < t; r++)
     s.push(r * i - n / 2);
-  return new Le(
+  return new Be(
     s.map((r) => e.toLowerCase() === "x" ? [r, 0] : [0, r])
   );
 }
 export {
-  Jt as Dieline,
-  Ke as FoldLockBump,
-  Ao as bottomFlap,
-  Lo as drawFlaps,
-  Oi as leftFlap,
-  Bo as linearDistribution,
-  Vo as linearSpread,
-  Eo as rightFlap,
-  vo as topFlap
+  Zt as Dieline,
+  tn as FoldLockBump,
+  ko as bottomFlap,
+  qo as drawFlaps,
+  zi as leftFlap,
+  No as linearDistribution,
+  Oo as linearSpread,
+  Ro as rightFlap,
+  So as topFlap
 };
 //# sourceMappingURL=dielines.js.map