dielines 0.10.1 → 0.11.0

package/dist/dielines.js

@@ -3,13 +3,13 @@ var Ui = (i, t, e) => t in i ? Di(i, t, { enumerable: !0, configurable: !0, writ
 var St = (i, t, e) => Ui(i, typeof t != "symbol" ? t + "" : t, e);
 var Yi = Object.defineProperty, si = (i) => {
   throw TypeError(i);
-}, 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);
+}, Xi = (i, t, e) => t in i ? Yi(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, _ = (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 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;
+    _(this, "xMin"), _(this, "yMin"), _(this, "xMax"), _(this, "yMax"), this.xMin = t, this.yMin = e, this.xMax = n, this.yMax = s;
   }
   get width() {
     return this.xMax - this.xMin;
@@ -78,7 +78,7 @@ function At(i, t = 1e-9) {
     ).values()
   );
 }
-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));
+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], Ft = ([i, t], [e, n] = [0, 0]) => (i - e) ** 2 + (t - n) ** 2, J = (i, t = [0, 0]) => Math.sqrt(Ft(i, t));
 function bt([i, t], [e, n]) {
   return i * n - t * e;
 }
@@ -145,7 +145,7 @@ const Bt = (i, t) => {
 };
 let ct = class ai {
   constructor(t) {
-    F(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]), t && (this._matrix = [...t]);
+    _(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]), t && (this._matrix = [...t]);
   }
   clone() {
     return new ai(this._matrix);
@@ -196,7 +196,7 @@ let ct = class ai {
     return Math.sqrt(t * t + e * e);
   }
 };
-class Ft {
+class _t {
   translateX(t) {
     const e = new ct().translate(t, 0);
     return this.transform(e);
@@ -233,9 +233,9 @@ class Ft {
     return t === "x" ? n.mirrorX() : t === "y" ? n.mirrorY() : n.mirrorLine(t, e), this.transform(n);
   }
 }
-let ae = class extends Ft {
+let ae = class extends _t {
   constructor(t, e) {
-    super(), F(this, "precision", 1e-9), this.firstPoint = t, this.lastPoint = e, this.firstPoint = t, this.lastPoint = e;
+    super(), _(this, "precision", 1e-9), this.firstPoint = t, this.lastPoint = e, this.firstPoint = t, this.lastPoint = e;
   }
   get repr() {
     return `${this.segmentType} ${it(this.firstPoint)} - ${it(
@@ -250,7 +250,7 @@ let ae = class extends Ft {
   }
 }, 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);
+    super(...arguments), _(this, "segmentType", "LINE"), _(this, "_V", null), _(this, "_slope", null), _(this, "_yIntercept", null), _(this, "_boundingBox", null);
   }
   isValidParameter(t) {
     const e = this.length * this.precision;
@@ -263,7 +263,7 @@ let ae = class extends Ft {
     return J(this.firstPoint, this.lastPoint);
   }
   get squareLength() {
-    return _t(this.firstPoint, this.lastPoint);
+    return Ft(this.firstPoint, this.lastPoint);
   }
   get V() {
     return this._V === null && (this._V = q(this.lastPoint, this.firstPoint)), this._V;
@@ -367,7 +367,7 @@ 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 _e = (i, t, e) => {
+const Fe = (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";
@@ -378,7 +378,7 @@ const _e = (i, t, e) => {
   };
 };
 function hi(i, t, e = !1, n) {
-  const s = _e(i, t, n);
+  const s = Fe(i, t, n);
   if (s === "parallel") {
     if (!e) return null;
     if (i.isSame(t)) return i;
@@ -405,7 +405,7 @@ const ge = (i, t) => {
 };
 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 (super(t, e), _(this, "segmentType", "ARC"), _(this, "center"), _(this, "clockwise"), _(this, "_coefficients", null), _(this, "_angularLength", null), _(this, "_radius", null), _(this, "_firstAngle", null), _(this, "_lastAngle", null), _(this, "_boundingBox", null), this.center = n, this.clockwise = s, !r) {
       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)
@@ -531,8 +531,8 @@ let z = class qt extends ae {
     const [e, n] = ge(t, this.center);
     return this.isValidParameter(this.angleToParam(n)) ? Math.abs(e - this.radius) : Math.sqrt(
       Math.min(
-        _t(t, this.firstPoint),
-        _t(t, this.lastPoint)
+        Ft(t, this.firstPoint),
+        Ft(t, this.lastPoint)
       )
     );
   }
@@ -600,7 +600,7 @@ let z = class qt extends ae {
   }
 };
 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(
+  const n = new D(t, i), s = new D(t, e), r = nt(n.tangentAtFirstPoint), o = nt(s.tangentAtLastPoint), a = Fe(
     { firstPoint: n.midPoint, V: r, precision: 1e-9 },
     { firstPoint: s.midPoint, V: o, precision: 1e-9 }
   );
@@ -619,7 +619,7 @@ function Ki(i, t, e) {
   );
 }
 function li(i, t, e) {
-  const n = new D(i, t), s = nt(n.tangentAtFirstPoint), r = _e(
+  const n = new D(i, t), s = nt(n.tangentAtFirstPoint), r = Fe(
     { firstPoint: n.midPoint, V: s, precision: 1e-9 },
     {
       firstPoint: i,
@@ -661,7 +661,7 @@ function xn(i, t = 0, e = 1, n = 110, s = 1e3) {
 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;
+    _(this, "xmin"), _(this, "fval"), _(this, "iter"), _(this, "funcalls"), _(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;
   }
   setBracket(t = null) {
     this.brack = t;
@@ -1306,7 +1306,7 @@ function Xe(i, t, e, n, s) {
   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 Fe(i, t = 0) {
+function _e(i, t = 0) {
   let e = [];
   for (let n = 0; n < i; n++)
     e.push(t);
@@ -1321,14 +1321,14 @@ function Vt(i) {
     throw new Error("Empty matrix has no elements to index");
 }
 function gs(i) {
-  let t = Fe(i.rows);
+  let t = _e(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 ps(i) {
-  let t = Fe(i.columns);
+  let t = _e(i.columns);
   for (let e = 0; e < i.rows; ++e)
     for (let n = 0; n < i.columns; ++n)
       t[n] += i.get(e, n);
@@ -1342,14 +1342,14 @@ function ws(i) {
   return t;
 }
 function ds(i) {
-  let t = Fe(i.rows, 1);
+  let t = _e(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 Ps(i) {
-  let t = Fe(i.columns, 1);
+  let t = _e(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);
@@ -2009,7 +2009,7 @@ let Z = class st {
   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), 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;
+    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), F = (-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 + F + 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 + $ + F + W + L, ce = F + 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) {
@@ -2048,12 +2048,12 @@ let Z = class st {
         st.add(V, k),
         p,
         M
-      ), _ = st.add(j, A);
-      _.sub(y), _.add($);
+      ), F = st.add(j, A);
+      F.sub(y), F.add($);
       let W = st.add(x, y), L = st.add(d, A), N = st.sub(j, d);
       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);
+      let B = st.zeros(2 * F.rows, 2 * F.columns);
+      return B = B.setSubMatrix(F, 0, 0), B = B.setSubMatrix(W, F.rows, 0), B = B.setSubMatrix(L, 0, F.columns), B = B.setSubMatrix(N, F.rows, F.columns), B.subMatrix(0, w - 1, 0, g - 1);
     }
     return c(e, t, h, l);
   }
@@ -2394,7 +2394,7 @@ Z.prototype.tensorProduct = Z.prototype.kroneckerProduct;
 var Pe, ze, Me;
 let E = (Me = class extends Z {
   constructor(i, t) {
-    if (super(), ri(this, Pe), F(this, "data"), Me.isMatrix(i))
+    if (super(), ri(this, Pe), _(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)
       Mn(this, Pe, ze).call(this, i, t);
@@ -2470,7 +2470,7 @@ ze = function(i, t) {
 }, Me);
 ms(Z, E);
 var ht;
-const _s = class We extends Z {
+const Fs = class We extends Z {
   /**
    * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize
    * @return {this}
@@ -2626,7 +2626,7 @@ const _s = class We extends Z {
   }
 };
 ht = /* @__PURE__ */ new WeakMap();
-let te = _s;
+let te = Fs;
 te.prototype.klassType = "SymmetricMatrix";
 let gi = class pi extends te {
   /**
@@ -2709,7 +2709,7 @@ let Et = class extends Z {
     super(), this.matrix = t, this.rows = e, this.columns = n;
   }
 };
-class Fs extends Et {
+class _s extends Et {
   constructor(t, e) {
     wt(t, e), super(t, t.rows, 1), this.column = e;
   }
@@ -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 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)
+            let I = xt(g[y], A), $ = g[y] / I, F = A / I;
+            if (g[y] = I, y !== d && (A = -F * 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) + $ * M.get(W, v - 1)), M.set(W, y, I);
+                I = $ * M.get(W, y) + F * M.get(W, v - 1), M.set(W, v - 1, -F * 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 I = xt(g[y], A), $ = g[y] / I, _ = A / I;
-            if (g[y] = I, A = -_ * f[y], f[y] = $ * f[y], h)
+            let I = xt(g[y], A), $ = g[y] / I, F = A / I;
+            if (g[y] = I, A = -F * 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) + $ * p.get(W, d - 1)), p.set(W, y, I);
+                I = $ * p.get(W, y) + F * p.get(W, d - 1), p.set(W, d - 1, -F * p.get(W, y) + $ * p.get(W, d - 1)), p.set(W, y, I);
           }
           break;
         }
@@ -3195,10 +3195,10 @@ let Wt = class {
             Math.abs(f[v - 2]),
             Math.abs(g[d]),
             Math.abs(f[d])
-          ), 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 * $);
+          ), y = g[v - 1] / A, I = g[v - 2] / A, $ = f[v - 2] / A, F = 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;
+          let Y = (F + y) * (F - y) + B, H = F * W;
           for (let T = d; T < v - 1; T++) {
             let U = xt(Y, H);
             U === 0 && (U = Number.MIN_VALUE);
@@ -3737,7 +3737,7 @@ O.LU = Le;
 O.LuDecomposition = Le;
 var er = O.Matrix = E;
 O.MatrixColumnSelectionView = Ls;
-O.MatrixColumnView = Fs;
+O.MatrixColumnView = _s;
 O.MatrixFlipColumnView = Bs;
 O.MatrixFlipRowView = Vs;
 O.MatrixRowSelectionView = qs;
@@ -3864,44 +3864,44 @@ function rr(i, t, e, n, s) {
     (L == 0 || U < d) && (k = N, j = B, d = U);
   }
   const x = k, A = j;
-  let y = 0, I = 0, $ = 0, _ = 0;
+  let y = 0, I = 0, $ = 0, F = 0;
   if (x < 0) {
     const L = Math.sqrt(-x);
-    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($)) {
+    if (y = f + L, I = P + L * A, $ = f - L, F = P - L * A, Math.abs(F) < Math.abs(I) ? F = n / I : Math.abs(F) > Math.abs(I) && (I = n / F), Math.abs(y) != Math.abs($)) {
       let N = null, B = null;
       if (Math.abs(y) < Math.abs($)) {
-        const H = (e - I * $) / _, T = (t - _ - I) / $;
+        const H = (e - I * $) / F, T = (t - F - I) / $;
         N = [i - $, H, T], B = [$, $, $];
       } else {
-        const H = (e - y * _) / I, T = (t - _ - I) / y, U = i - y;
+        const H = (e - y * F) / I, T = (t - F - 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, I, U, _);
+          const tt = r(T, I, U, F);
           (H == 0 || tt < Y) && (y = T, $ = U, Y = tt);
         }
       }
     }
   } else if (x == 0) {
     const L = n - P * P;
-    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 / _);
+    y = f, I = P + Math.sqrt(-L), $ = f, F = P - Math.sqrt(-L), Math.abs(I) > Math.abs(F) ? F = n / I : Math.abs(F) > Math.abs(I) && (I = n / F);
   } else
     return [];
-  let W = o(y, I, $, _);
+  let W = o(y, I, $, F);
   for (let L = 0; L < 8 && W != 0; L++) {
-    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 + _);
+    const N = I * F - n, B = I * $ + y * F - e, Y = I + y * $ + F - t, H = y + $ - i, T = y - $, U = I * I - I * ($ * T + 2 * F) + F * (y * T + F);
     if (U == 0)
       break;
-    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);
+    const tt = 1 / U, K = F - I, G = I * $ - y * F, 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 + F * K) * H, Ne = -($ * T + K) * N + F * (T * B + K * Y + G * H), he = y - tt * Ve, le = I - tt * je, ue = $ - tt * qe, ce = F - tt * Ne, fe = o(he, le, ue, ce);
     if (fe < W)
-      y = he, I = le, $ = ue, _ = ce, W = fe;
+      y = he, I = le, $ = ue, F = ce, W = fe;
     else
       break;
   }
-  return [y, I, $, _];
+  return [y, I, $, F];
 }
 function or(i, t) {
   const e = -0.3333333333333333 * i, n = 0.5 * t;
@@ -3964,7 +3964,7 @@ function un(i, t) {
 }
 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;
+    super(t, e), _(this, "segmentType", "CUBIC_BEZIER"), _(this, "firstControlPoint"), _(this, "lastControlPoint"), _(this, "_boundingBox", null), _(this, "_polynomialCoefficients", null), this.firstControlPoint = n, this.lastControlPoint = s;
   }
   get midPoint() {
     return this.paramPoint(0.5);
@@ -4020,7 +4020,7 @@ let rt = class zt extends ae {
     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 = ui((n) => _t(this.paramPoint(n), t), this.precision);
+    const e = ui((n) => Ft(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)
@@ -4168,7 +4168,7 @@ let rt = class zt extends ae {
     ignoreChecks: h = !1,
     angleUnits: l = "deg"
   } = {}) {
-    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;
+    super(t, e), _(this, "segmentType", "ELLIPSE_ARC"), _(this, "precision", 1e-6), _(this, "majorRadius"), _(this, "minorRadius"), _(this, "center"), _(this, "tiltAngle"), _(this, "clockwise"), _(this, "_coefficients", null), _(this, "_boundingBox"), _(this, "_linearExentricity"), _(this, "_exentricity"), _(this, "_focals"), _(this, "_ellipseReferenceFrameTransform"), _(this, "_reverseEllipseReferenceFrameTransform"), _(this, "_rotateFromEllipseReferenceFrame"), _(this, "_firstAngle"), _(this, "_lastAngle"), _(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;
@@ -4471,7 +4471,7 @@ function cr(i, t, e) {
 }
 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;
+    super(t, e), _(this, "segmentType", "QUADRATIC_BEZIER"), _(this, "controlPoint"), _(this, "_boundingBox", null), _(this, "_polynomialCoefficients", null), this.controlPoint = n;
   }
   get midPoint() {
     return this.paramPoint(0.5);
@@ -4518,7 +4518,7 @@ let et = class Dt extends ae {
     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 = ui((n) => _t(this.paramPoint(n), t), this.precision);
+    const e = ui((n) => Ft(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)
@@ -4946,7 +4946,7 @@ function Rr(i) {
     Math.max(...r)
   );
 }
-function _n(i, t) {
+function Fn(i, t) {
   const e = [];
   for (let n = 1; n < i.length; n++) {
     const s = i[n];
@@ -5024,11 +5024,11 @@ class Ir {
     return this.distances[3];
   }
 }
-function Fn(i, t) {
-  const e = Cr(t, i), n = _n(
+function _n(i, t) {
+  const e = Cr(t, i), n = Fn(
     e.topHull,
     i.negativeThickness
-  ), s = _n(
+  ), s = Fn(
     e.bottomHull,
     i.positiveThickness
   ), r = e.endDistance >= i.negativeThickness && e.endDistance <= i.positiveThickness;
@@ -5044,10 +5044,10 @@ function Fn(i, t) {
   return o.length === 2 ? new Ht(o[0], o[1]) : r ? new Ht(o[0], "end") : new Ht("start", o[0]);
 }
 function Ln(i, t) {
-  const e = kr(i), n = Fn(e, t);
+  const e = kr(i), n = _n(e, t);
   if (!n)
     return null;
-  const s = Rr(i), r = Fn(
+  const s = Rr(i), r = _n(
     s,
     t
   );
@@ -5125,7 +5125,7 @@ function $r(i, t) {
   if (e.length === 4)
     return [i];
 }
-function _r(i, t, e = !1) {
+function Fr(i, t, e = !1) {
   const n = Math.max(i.precision, t.precision);
   if (e) {
     const s = $r(i, t);
@@ -5134,7 +5134,7 @@ function _r(i, t, e = !1) {
   }
   return It(i, t, n);
 }
-function Fr(i, t) {
+function _r(i, t) {
   const e = [];
   if ([
     [i.firstPoint, t],
@@ -5155,7 +5155,7 @@ function Fr(i, t) {
 function Lr(i, t, e = !1) {
   const n = Math.max(i.precision, t.precision);
   if (e) {
-    const s = Fr(i, t);
+    const s = _r(i, t);
     if (s)
       return s;
   }
@@ -5300,7 +5300,7 @@ function se(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof rt && t instanceof rt) {
-    const n = _r(
+    const n = Fr(
       i,
       t
     );
@@ -5327,7 +5327,7 @@ function* Qe(i) {
   for (const [t, e] of Ei(i.length))
     t !== e && (yield [i[t], i[e]]);
 }
-class Si extends Ft {
+class Si extends _t {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
     super(), ut(this, "segments"), ut(this, "_boundingBox", null), e || ki(t), this.segments = t;
   }
@@ -5490,7 +5490,7 @@ let Rt = class Ut extends Si {
   }
 };
 const jr = (i, t) => {
-  const e = _e(t, {
+  const e = Fe(t, {
     V: [1, 0],
     firstPoint: i,
     precision: t.precision
@@ -5505,7 +5505,7 @@ const jr = (i, t) => {
   }
   return 1;
 };
-let fn = class {
+class fn {
   constructor(t) {
     ut(this, "_count", 0), ut(this, "segment"), this.segment = t;
   }
@@ -5515,11 +5515,11 @@ let fn = class {
   get count() {
     return this._count;
   }
-};
+}
 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 = _t(i, t.center), r = t.radius * t.radius, o = e * e;
+  const s = Ft(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;
@@ -5947,7 +5947,7 @@ function $i(i, t = 1e-7) {
     }
   }), n;
 }
-let mt = class Se extends Ft {
+let mt = class Se extends _t {
   constructor(t, e = [], { ignoreChecks: n = !1 } = {}) {
     super(), ut(this, "contour"), ut(this, "holes"), n || Qr(t, e), this.contour = t, this.holes = e;
   }
@@ -6027,7 +6027,7 @@ const xe = (i, t, e = 1e-7) => Math.abs(i - t) <= e, Gr = (i, t) => {
       n[a] = o;
     });
   }), e;
-}, _i = (i) => i.map((t, e) => {
+}, Fi = (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,
@@ -6039,7 +6039,7 @@ const xe = (i, t, e = 1e-7) => Math.abs(i - t) <= e, Gr = (i, t) => {
   )
 )), eo = (i, t) => {
   const e = t.filter(({ isIn: s }) => s.length <= 1), n = gn(
-    _i(i.map(({ loop: s }) => s))
+    Fi(i.map(({ loop: s }) => s))
   );
   return [e, ...n];
 }, gn = (i) => {
@@ -6049,7 +6049,7 @@ const xe = (i, t, e = 1e-7) => Math.abs(i - t) <= e, Gr = (i, t) => {
 };
 function ee(i) {
   const t = Zr(i);
-  return Kr(t).map(_i).flatMap(gn).map((e) => {
+  return Kr(t).map(Fi).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);
@@ -6294,11 +6294,11 @@ function lo(i) {
         (w) => c.some((g) => w.intersects(g))
       )) return;
       let m;
-      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);
+      h.length > 1 || c.length > 1 ? m = re(h, c) : m = _i(h[0], c[0]), r.fusedWith.add(l), r.current = m, u || t.set(l, r);
     });
   }), e.flatMap(({ current: n }) => n);
 }
-function Fi(i, t) {
+function _i(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)
   );
@@ -6357,7 +6357,7 @@ function re(i, t) {
       e = re([n], e);
     }), e;
   }
-  return i.length === 1 && t.length === 1 ? Fi(i[0], t[0]) : [];
+  return i.length === 1 && t.length === 1 ? _i(i[0], t[0]) : [];
 }
 function Xt(i, t) {
   if (!i.length) return [];
@@ -6374,7 +6374,7 @@ function Xt(i, t) {
 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]));
 }
-class dt extends Ft {
+class dt extends _t {
   constructor(t = [], { ignoreChecks: e = !1 } = {}) {
     super(), ut(this, "figures"), ut(this, "_boundingBox", null), e || co(t), this.figures = t;
   }
@@ -6603,7 +6603,7 @@ const Po = (i) => {
 function Qn(i, { ignoreChecks: t = !1 } = {}) {
   return new dt([new mt(new Lt([...i], { ignoreChecks: t }))]);
 }
-let Mo = class {
+class Mo {
   constructor(t = [0, 0]) {
     ve(this, "pointer"), ve(this, "firstPoint"), ve(this, "pendingSegments"), ve(this, "_nextCorner"), this.pointer = t, this.firstPoint = t, this.pendingSegments = [], this._nextCorner = null;
   }
@@ -6826,7 +6826,7 @@ let Mo = class {
     var t;
     return R(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
   }
-};
+}
 function Vi(i = [0, 0]) {
   return new Mo(i);
 }
@@ -6992,7 +6992,7 @@ function Eo(i, {
     e
   );
 }
-class Zt extends Ft {
+class Zt extends _t {
   constructor(e, {
     cutLines: n = [],
     foldLines: s = [],
@@ -7098,13 +7098,13 @@ function zi(i, t, {
 function Ro(i, t, e = {}) {
   return zi(i, t, e).mirror("y");
 }
-const qo = {
+const Vo = {
   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 {
+class tn extends _t {
   constructor(e, n = 0.2) {
     super();
     St(this, "cut");
@@ -7134,7 +7134,7 @@ class tn extends Ft {
     e.fuseBody(this.bump);
   }
 }
-class Be extends Ft {
+class Be extends _t {
   constructor(t) {
     super(), this.points = t, this.points = t;
   }
@@ -7148,7 +7148,7 @@ class Be extends Ft {
     return this.points.map((e) => t.clone().translateTo(e));
   }
 }
-function No(i, t, e = 3, n = 0) {
+function jo(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(
@@ -7161,7 +7161,7 @@ function No(i, t, e = 3, n = 0) {
     );
   return new Be(a.map((h) => [h, 0]));
 }
-function Oo(i, t, e = "x") {
+function qo(i, t, e = "x") {
   const n = i * (t - 1), s = [];
   for (let r = 0; r < t; r++)
     s.push(r * i - n / 2);
@@ -7173,10 +7173,10 @@ export {
   Zt as Dieline,
   tn as FoldLockBump,
   ko as bottomFlap,
-  qo as drawFlaps,
+  Vo as drawFlaps,
   zi as leftFlap,
-  No as linearDistribution,
-  Oo as linearSpread,
+  jo as linearDistribution,
+  qo as linearSpread,
   Ro as rightFlap,
   So as topFlap
 };