dielines 0.11.1 → 0.11.2

package/dist/dielines.js

@@ -3,14 +3,14 @@ var es = (i, t, e) => t in i ? ts(i, t, { enumerable: !0, configurable: !0, writ
 var Et = (i, t, e) => es(i, typeof t != "symbol" ? t + "" : t, e);
 var ns = Object.defineProperty, pi = (i) => {
   throw TypeError(i);
-}, is = (i, t, e) => t in i ? ns(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, _ = (i, t, e) => is(i, typeof t != "symbol" ? t + "" : t, e), tn = (i, t, e) => t.has(i) || pi("Cannot " + e), Pt = (i, t, e) => (tn(i, t, "read from private field"), e ? e.call(i) : t.get(i)), wi = (i, t, e) => t.has(i) ? pi("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(i) : t.set(i, e), qe = (i, t, e, n) => (tn(i, t, "write to private field"), t.set(i, e), e), Pn = (i, t, e) => (tn(i, t, "access private method"), e);
+}, is = (i, t, e) => t in i ? ns(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, F = (i, t, e) => is(i, typeof t != "symbol" ? t + "" : t, e), tn = (i, t, e) => t.has(i) || pi("Cannot " + e), Pt = (i, t, e) => (tn(i, t, "read from private field"), e ? e.call(i) : t.get(i)), wi = (i, t, e) => t.has(i) ? pi("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(i) : t.set(i, e), qe = (i, t, e, n) => (tn(i, t, "write to private field"), t.set(i, e), e), Pn = (i, t, e) => (tn(i, t, "access private method"), e);
 const Mn = Symbol.for("pantograph:BoundingBox");
 function fe(i, t, e, n) {
   return i <= n && t >= e;
 }
 let re = class Ht {
   constructor(t = 1 / 0, e = 1 / 0, n = -1 / 0, s = -1 / 0) {
-    _(this, "xMin"), _(this, "yMin"), _(this, "xMax"), _(this, "yMax"), Object.defineProperty(this, Mn, { value: !0 }), this.xMin = t, this.yMin = e, this.xMax = n, this.yMax = s;
+    F(this, "xMin"), F(this, "yMin"), F(this, "xMax"), F(this, "yMax"), Object.defineProperty(this, Mn, { value: !0 }), this.xMin = t, this.yMin = e, this.xMax = n, this.yMax = s;
   }
   static isInstance(t) {
     return !!t && t[Mn] === !0;
@@ -151,7 +151,7 @@ const bn = Symbol.for(
 };
 let ut = class Pi {
   constructor(t) {
-    _(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]), Object.defineProperty(this, bn, {
+    F(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]), Object.defineProperty(this, bn, {
       value: !0
     }), t && (this._matrix = [...t]);
   }
@@ -207,7 +207,7 @@ let ut = class Pi {
     return Math.sqrt(t * t + e * e);
   }
 };
-class Ft {
+class _t {
   translateX(t) {
     const e = new ut().translate(t, 0);
     return this.transform(e);
@@ -244,9 +244,9 @@ class Ft {
     return t === "x" ? n.mirrorX() : t === "y" ? n.mirrorY() : n.mirrorLine(t, e), this.transform(n);
   }
 }
-let oe = class extends Ft {
+let oe = class extends _t {
   constructor(t, e) {
-    super(), _(this, "precision", 1e-9), this.firstPoint = t, this.lastPoint = e, this.firstPoint = t, this.lastPoint = e;
+    super(), F(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(
@@ -263,7 +263,7 @@ let oe = class extends Ft {
 const xn = Symbol.for("pantograph:Line");
 let U = class Vt extends oe {
   constructor(t, e) {
-    super(t, e), _(this, "segmentType", "LINE"), _(this, "_V", null), _(this, "_slope", null), _(this, "_yIntercept", null), _(this, "_boundingBox", null), Object.defineProperty(this, xn, { value: !0 });
+    super(t, e), F(this, "segmentType", "LINE"), F(this, "_V", null), F(this, "_slope", null), F(this, "_yIntercept", null), F(this, "_boundingBox", null), Object.defineProperty(this, xn, { value: !0 });
   }
   static isInstance(t) {
     return !!t && t[xn] === !0;
@@ -421,7 +421,7 @@ const me = (i, t) => {
 }, vn = Symbol.for("pantograph:Arc");
 let D = class jt extends oe {
   constructor(t, e, n, s = !1, { ignoreChecks: r = !1 } = {}) {
-    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), Object.defineProperty(this, vn, { value: !0 }), this.center = n, this.clockwise = s, !r) {
+    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), Object.defineProperty(this, vn, { value: !0 }), this.center = n, this.clockwise = s, !r) {
       if (k(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (Math.abs(this.radius - Z(this.lastPoint, this.center)) > this.precision)
@@ -680,7 +680,7 @@ function En(i, t = 0, e = 1, n = 110, s = 1e3) {
 const In = 0.381966, cs = 1e-11;
 class fs {
   constructor(t, e = 148e-10, n = 500) {
-    _(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;
+    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;
   }
   setBracket(t = null) {
     this.brack = t;
@@ -1325,7 +1325,7 @@ function Ye(i, t, e, n, s) {
   if (we("startRow", t), we("endRow", e), we("startColumn", n), we("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);
@@ -1340,14 +1340,14 @@ function Bt(i) {
     throw new Error("Empty matrix has no elements to index");
 }
 function Es(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 Is(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);
@@ -1361,14 +1361,14 @@ function Ss(i) {
   return t;
 }
 function ks(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 Cs(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);
@@ -1401,7 +1401,7 @@ function $s(i, t, e) {
   }
   return r;
 }
-function Fs(i, t, e) {
+function _s(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++)
@@ -1409,7 +1409,7 @@ function Fs(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 _s(i, t) {
+function Fs(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]);
@@ -2028,7 +2028,7 @@ class j {
   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), I = 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 + I), S = (-n + o + a) * (m - w + M), O = (o + a) * (-m + w), d = n * m, x = (-n + l + c) * (m - g + f), A = (-n + l) * (g - f), y = (l + c) * (-m + g), T = (n + s + r - a - h - l - c) * f, $ = c * (-m + g + p - M - f - P + b), F = (-r + c + u) * (M + P - b), H = (r - u) * (M - b), L = r * P, z = (c + u) * (-P + b), B = (-r + a + h) * (f + P - I), X = (r - h) * (f - I), Q = (a + h) * (-P + I), R = s * p, Y = h * b, tt = o * g, K = l * w, J = u * I, Be = d + L + R, Ve = C + S + O + d + F + L + z, je = d + x + y + T + L + B + Q, Oe = V + v + S + d + L + B + X, ae = V + S + O + d + Y, he = L + B + X + Q + tt, le = d + x + A + $ + F + H + L, ue = F + H + L + z + K, ce = d + x + A + y + J;
+    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), I = 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 + I), S = (-n + o + a) * (m - w + M), O = (o + a) * (-m + w), d = n * m, x = (-n + l + c) * (m - g + f), A = (-n + l) * (g - f), y = (l + c) * (-m + g), T = (n + s + r - a - h - l - c) * f, $ = c * (-m + g + p - M - f - P + b), _ = (-r + c + u) * (M + P - b), H = (r - u) * (M - b), L = r * P, z = (c + u) * (-P + b), B = (-r + a + h) * (f + P - I), X = (r - h) * (f - I), Q = (a + h) * (-P + I), R = s * p, Y = h * b, tt = o * g, K = l * w, J = u * I, Be = d + L + R, Ve = C + S + O + d + _ + L + z, je = d + x + y + T + L + B + Q, Oe = V + v + S + d + L + B + X, ae = V + S + O + d + Y, he = L + B + X + Q + tt, le = d + x + A + $ + _ + H + L, ue = _ + H + L + z + K, ce = d + x + A + y + J;
     return e.set(0, 0, Be), e.set(0, 1, Ve), e.set(0, 2, je), e.set(1, 0, Oe), e.set(1, 1, ae), e.set(1, 2, he), e.set(2, 0, le), e.set(2, 1, ue), e.set(2, 2, ce), e;
   }
   mmulStrassen(t) {
@@ -2067,12 +2067,12 @@ class j {
         j.add(V, S),
         p,
         M
-      ), F = j.add(O, A);
-      F.sub(y), F.add($);
+      ), _ = j.add(O, A);
+      _.sub(y), _.add($);
       let H = j.add(x, y), L = j.add(d, A), z = j.sub(O, d);
       z.add(x), z.add(T);
-      let B = j.zeros(2 * F.rows, 2 * F.columns);
-      return B = B.setSubMatrix(F, 0, 0), B = B.setSubMatrix(H, F.rows, 0), B = B.setSubMatrix(L, 0, F.columns), B = B.setSubMatrix(z, F.rows, F.columns), B.subMatrix(0, w - 1, 0, g - 1);
+      let B = j.zeros(2 * _.rows, 2 * _.columns);
+      return B = B.setSubMatrix(_, 0, 0), B = B.setSubMatrix(H, _.rows, 0), B = B.setSubMatrix(L, 0, _.columns), B = B.setSubMatrix(z, _.rows, _.columns), B.subMatrix(0, w - 1, 0, g - 1);
     }
     return c(e, t, h, l);
   }
@@ -2299,7 +2299,7 @@ class j {
       case void 0: {
         if (typeof s != "number")
           throw new TypeError("mean must be a number");
-        return Fs(this, n, s);
+        return _s(this, n, s);
       }
       default:
         throw new Error(`invalid option: ${t}`);
@@ -2322,7 +2322,7 @@ class j {
       case "row": {
         if (!ct.isAnyArray(n))
           throw new TypeError("center must be an array");
-        return _s(this, n), this;
+        return Fs(this, n), this;
       }
       case "column": {
         if (!ct.isAnyArray(n))
@@ -2413,7 +2413,7 @@ j.prototype.tensorProduct = j.prototype.kroneckerProduct;
 var de, ze, Pe;
 let E = (Pe = class extends j {
   constructor(i, t) {
-    if (super(), wi(this, de), _(this, "data"), Pe.isMatrix(i))
+    if (super(), wi(this, de), F(this, "data"), Pe.isMatrix(i))
       Pn(this, de, ze).call(this, i.rows, i.columns), Pe.copy(i, this);
     else if (Number.isInteger(i) && i >= 0)
       Pn(this, de, ze).call(this, i, t);
@@ -2876,7 +2876,7 @@ function Ks(i, t) {
     return i[0] && ct.isAnyArray(i[0]) ? new mt(i) : new Si(i, t);
   throw new Error("the argument is not an array");
 }
-let _e = class {
+let Fe = class {
   constructor(t) {
     t = mt.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;
@@ -3188,10 +3188,10 @@ let an = class {
           let A = f[v - 2];
           f[v - 2] = 0;
           for (let y = v - 2; y >= d; y--) {
-            let T = bt(g[y], A), $ = g[y] / T, F = A / T;
-            if (g[y] = T, y !== d && (A = -F * f[y - 1], f[y - 1] = $ * f[y - 1]), l)
+            let T = bt(g[y], A), $ = g[y] / T, _ = A / T;
+            if (g[y] = T, y !== d && (A = -_ * f[y - 1], f[y - 1] = $ * f[y - 1]), l)
               for (let H = 0; H < s; H++)
-                T = $ * M.get(H, y) + F * M.get(H, v - 1), M.set(H, v - 1, -F * M.get(H, y) + $ * M.get(H, v - 1)), M.set(H, y, T);
+                T = $ * M.get(H, y) + _ * M.get(H, v - 1), M.set(H, v - 1, -_ * M.get(H, y) + $ * M.get(H, v - 1)), M.set(H, y, T);
           }
           break;
         }
@@ -3199,10 +3199,10 @@ let an = class {
           let A = f[d - 1];
           f[d - 1] = 0;
           for (let y = d; y < v; y++) {
-            let T = bt(g[y], A), $ = g[y] / T, F = A / T;
-            if (g[y] = T, A = -F * f[y], f[y] = $ * f[y], h)
+            let T = bt(g[y], A), $ = g[y] / T, _ = A / T;
+            if (g[y] = T, A = -_ * f[y], f[y] = $ * f[y], h)
               for (let H = 0; H < n; H++)
-                T = $ * p.get(H, y) + F * p.get(H, d - 1), p.set(H, d - 1, -F * p.get(H, y) + $ * p.get(H, d - 1)), p.set(H, y, T);
+                T = $ * p.get(H, y) + _ * p.get(H, d - 1), p.set(H, d - 1, -_ * p.get(H, y) + $ * p.get(H, d - 1)), p.set(H, y, T);
           }
           break;
         }
@@ -3213,10 +3213,10 @@ let an = class {
             Math.abs(f[v - 2]),
             Math.abs(g[d]),
             Math.abs(f[d])
-          ), y = g[v - 1] / A, T = g[v - 2] / A, $ = f[v - 2] / A, F = g[d] / A, H = f[d] / A, L = ((T + y) * (T - y) + $ * $) / 2, z = y * $ * (y * $);
+          ), y = g[v - 1] / A, T = g[v - 2] / A, $ = f[v - 2] / A, _ = g[d] / A, H = f[d] / A, L = ((T + y) * (T - y) + $ * $) / 2, z = y * $ * (y * $);
           let B = 0;
           (L !== 0 || z !== 0) && (L < 0 ? B = 0 - Math.sqrt(L * L + z) : B = Math.sqrt(L * L + z), B = z / (L + B));
-          let X = (F + y) * (F - y) + B, Q = F * H;
+          let X = (_ + y) * (_ - y) + B, Q = _ * H;
           for (let R = d; R < v - 1; R++) {
             let Y = bt(X, Q);
             Y === 0 && (Y = Number.MIN_VALUE);
@@ -3320,7 +3320,7 @@ function tr(i, t = !1) {
   return i = mt.checkMatrix(i), t ? new Xt(i).inverse() : ki(i, E.eye(i.rows));
 }
 function ki(i, t, e = !1) {
-  return i = mt.checkMatrix(i), t = mt.checkMatrix(t), e ? new Xt(i).solve(t) : i.isSquare() ? new _e(i).solve(t) : new an(i).solve(t);
+  return i = mt.checkMatrix(i), t = mt.checkMatrix(t), e ? new Xt(i).solve(t) : i.isSquare() ? new Fe(i).solve(t) : new an(i).solve(t);
 }
 function Ae(i) {
   if (i = E.checkMatrix(i), i.isSquare()) {
@@ -3333,7 +3333,7 @@ function Ae(i) {
       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);
     } else
-      return new _e(i).determinant;
+      return new Fe(i).determinant;
   } else
     throw Error("determinant can only be calculated for a square matrix");
 }
@@ -3751,8 +3751,8 @@ N.CholeskyDecomposition = Ri;
 N.DistanceMatrix = Ei;
 N.EVD = Ci;
 var cr = N.EigenvalueDecomposition = Ci;
-N.LU = _e;
-N.LuDecomposition = _e;
+N.LU = Fe;
+N.LuDecomposition = Fe;
 var fr = N.Matrix = E;
 N.MatrixColumnSelectionView = Xs;
 N.MatrixColumnView = Ys;
@@ -3882,44 +3882,44 @@ function wr(i, t, e, n, s) {
     (L == 0 || Y < d) && (S = z, O = B, d = Y);
   }
   const x = S, A = O;
-  let y = 0, T = 0, $ = 0, F = 0;
+  let y = 0, T = 0, $ = 0, _ = 0;
   if (x < 0) {
     const L = Math.sqrt(-x);
-    if (y = f + L, T = P + L * A, $ = f - L, F = P - L * A, Math.abs(F) < Math.abs(T) ? F = n / T : Math.abs(F) > Math.abs(T) && (T = n / F), Math.abs(y) != Math.abs($)) {
+    if (y = f + L, T = P + L * A, $ = f - L, _ = P - L * A, Math.abs(_) < Math.abs(T) ? _ = n / T : Math.abs(_) > Math.abs(T) && (T = n / _), Math.abs(y) != Math.abs($)) {
       let z = null, B = null;
       if (Math.abs(y) < Math.abs($)) {
-        const Q = (e - T * $) / F, R = (t - F - T) / $;
+        const Q = (e - T * $) / _, R = (t - _ - T) / $;
         z = [i - $, Q, R], B = [$, $, $];
       } else {
-        const Q = (e - y * F) / T, R = (t - F - T) / y, Y = i - y;
+        const Q = (e - y * _) / T, R = (t - _ - T) / y, Y = i - y;
         z = [y, y, y], B = [Y, Q, R];
       }
       let X = 0;
       for (let Q = 0; Q < 3; Q++) {
         const R = z[Q], Y = B[Q];
         if (isFinite(R) && isFinite(Y)) {
-          const tt = r(R, T, Y, F);
+          const tt = r(R, T, Y, _);
           (Q == 0 || tt < X) && (y = R, $ = Y, X = tt);
         }
       }
     }
   } else if (x == 0) {
     const L = n - P * P;
-    y = f, T = P + Math.sqrt(-L), $ = f, F = P - Math.sqrt(-L), Math.abs(T) > Math.abs(F) ? F = n / T : Math.abs(F) > Math.abs(T) && (T = n / F);
+    y = f, T = P + Math.sqrt(-L), $ = f, _ = P - Math.sqrt(-L), Math.abs(T) > Math.abs(_) ? _ = n / T : Math.abs(_) > Math.abs(T) && (T = n / _);
   } else
     return [];
-  let H = o(y, T, $, F);
+  let H = o(y, T, $, _);
   for (let L = 0; L < 8 && H != 0; L++) {
-    const z = T * F - n, B = T * $ + y * F - e, X = T + y * $ + F - t, Q = y + $ - i, R = y - $, Y = T * T - T * ($ * R + 2 * F) + F * (y * R + F);
+    const z = T * _ - n, B = T * $ + y * _ - e, X = T + y * $ + _ - t, Q = y + $ - i, R = y - $, Y = T * T - T * ($ * R + 2 * _) + _ * (y * R + _);
     if (Y == 0)
       break;
-    const tt = 1 / Y, K = F - T, J = T * $ - y * F, Be = R * z + K * B + J * X - (T * K + y * J) * Q, Ve = (y * R + K) * z - T * (R * B + K * X + J * Q), je = -R * z - K * B - J * X + ($ * J + F * K) * Q, Oe = -($ * R + K) * z + F * (R * B + K * X + J * Q), ae = y - tt * Be, he = T - tt * Ve, le = $ - tt * je, ue = F - tt * Oe, ce = o(ae, he, le, ue);
+    const tt = 1 / Y, K = _ - T, J = T * $ - y * _, Be = R * z + K * B + J * X - (T * K + y * J) * Q, Ve = (y * R + K) * z - T * (R * B + K * X + J * Q), je = -R * z - K * B - J * X + ($ * J + _ * K) * Q, Oe = -($ * R + K) * z + _ * (R * B + K * X + J * Q), ae = y - tt * Be, he = T - tt * Ve, le = $ - tt * je, ue = _ - tt * Oe, ce = o(ae, he, le, ue);
     if (ce < H)
-      y = ae, T = he, $ = le, F = ue, H = ce;
+      y = ae, T = he, $ = le, _ = ue, H = ce;
     else
       break;
   }
-  return [y, T, $, F];
+  return [y, T, $, _];
 }
 function dr(i, t) {
   const e = -0.3333333333333333 * i, n = 0.5 * t;
@@ -3983,7 +3983,7 @@ function ln(i, t) {
 const $n = Symbol.for("pantograph:CubicBezier");
 let st = class zt extends oe {
   constructor(t, e, n, s) {
-    super(t, e), _(this, "segmentType", "CUBIC_BEZIER"), _(this, "firstControlPoint"), _(this, "lastControlPoint"), _(this, "_boundingBox", null), _(this, "_polynomialCoefficients", null), Object.defineProperty(this, $n, { value: !0 }), this.firstControlPoint = n, this.lastControlPoint = s;
+    super(t, e), F(this, "segmentType", "CUBIC_BEZIER"), F(this, "firstControlPoint"), F(this, "lastControlPoint"), F(this, "_boundingBox", null), F(this, "_polynomialCoefficients", null), Object.defineProperty(this, $n, { value: !0 }), this.firstControlPoint = n, this.lastControlPoint = s;
   }
   static isInstance(t) {
     return !!t && t[$n] === !0;
@@ -4186,13 +4186,13 @@ let st = class zt extends oe {
     return s;
   }
 };
-const Fn = Symbol.for("pantograph:EllipseArc");
+const _n = Symbol.for("pantograph:EllipseArc");
 let ot = class Qt extends oe {
   constructor(t, e, n, s, r, o, a = !1, {
     ignoreChecks: h = !1,
     angleUnits: l = "deg"
   } = {}) {
-    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"), Object.defineProperty(this, Fn, { value: !0 }), this.center = n;
+    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"), Object.defineProperty(this, _n, { value: !0 }), this.center = n;
     const c = s >= r;
     this.majorRadius = c ? s : r, this.minorRadius = c ? r : s;
     const u = l === "deg" ? o * Tt : o;
@@ -4218,7 +4218,7 @@ let ot = class Qt extends oe {
     }
   }
   static isInstance(t) {
-    return !!t && t[Fn] === !0;
+    return !!t && t[_n] === !0;
   }
   get coefficients() {
     if (this._coefficients === null) {
@@ -4496,13 +4496,13 @@ function xr(i, t, e) {
   }
   return [a * r * Math.sign(e[0]), h * o * Math.sign(e[1])];
 }
-const _n = Symbol.for("pantograph:QuadraticBezier");
+const Fn = Symbol.for("pantograph:QuadraticBezier");
 let et = class Nt extends oe {
   constructor(t, e, n) {
-    super(t, e), _(this, "segmentType", "QUADRATIC_BEZIER"), _(this, "controlPoint"), _(this, "_boundingBox", null), _(this, "_polynomialCoefficients", null), Object.defineProperty(this, _n, { value: !0 }), this.controlPoint = n;
+    super(t, e), F(this, "segmentType", "QUADRATIC_BEZIER"), F(this, "controlPoint"), F(this, "_boundingBox", null), F(this, "_polynomialCoefficients", null), Object.defineProperty(this, Fn, { value: !0 }), this.controlPoint = n;
   }
   static isInstance(t) {
-    return !!t && t[_n] === !0;
+    return !!t && t[Fn] === !0;
   }
   get midPoint() {
     return this.paramPoint(0.5);
@@ -4746,7 +4746,7 @@ const Ir = (i) => {
     ];
   throw new Error("Bug in the arc arc overlap algorithm");
 };
-function Fi(i, t, e = !1, n) {
+function _i(i, t, e = !1, n) {
   const s = n || i.precision, r = Z(i.center, t.center), o = i.radius + t.radius;
   if (r > o + s)
     return [];
@@ -4804,7 +4804,7 @@ function We(i, t, e = 1e-9) {
   ];
   return u([p, M]);
 }
-function _i(i, t) {
+function Fi(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,
@@ -4830,7 +4830,7 @@ function _i(i, t) {
   return vt(P, e);
 }
 function Ln(i, t) {
-  return _i(i, t).filter((e) => i.isOnSegment(e) && t.isOnSegment(e));
+  return Fi(i, t).filter((e) => i.isOnSegment(e) && t.isOnSegment(e));
 }
 const kr = (i) => {
   const {
@@ -4890,7 +4890,7 @@ const kr = (i) => {
 };
 function Rr(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 ? Cr(i, t) : [] : _i(i, t).filter((s) => i.isOnSegment(s) && t.isOnSegment(s));
+  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 ? Cr(i, t) : [] : Fi(i, t).filter((s) => i.isOnSegment(s) && t.isOnSegment(s));
 }
 function Bn(i, t) {
   const [e, n] = i.firstPoint, [s, r] = i.lastPoint, o = new ut().translate(-e, -n).rotate(-Math.atan2(r - n, s - e)), a = o.clone().inverse(), h = t.transform(o);
@@ -4913,12 +4913,12 @@ function Vn(i, t) {
   const e = Math.max(i.precision, t.precision), n = $r(i, t), s = hn(n, e).filter((r) => r >= -t.precision && r <= 1 + t.precision);
   return Li(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
 }
-const Fr = (i, t) => {
+const _r = (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, I = 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, O = l * f + c * s * a + u * I;
   return [C, V, v, S, O];
 };
 function jn(i, t) {
-  const e = Math.max(i.precision, t.precision), n = Fr(i, t), s = pr(...n).filter((r) => r >= -t.precision && r <= 1 + t.precision);
+  const e = Math.max(i.precision, t.precision), n = _r(i, t), s = pr(...n).filter((r) => r >= -t.precision && r <= 1 + t.precision);
   return Li(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
 }
 function ht(i, { firstPoint: t, lastPoint: e }, n = 1e-9) {
@@ -4933,9 +4933,9 @@ let un = class {
     return this.positiveThickness - this.negativeThickness;
   }
 };
-const _r = 3 / 4, Lr = 4 / 9;
+const Fr = 3 / 4, Lr = 4 / 9;
 function Br(i) {
-  const t = ht(i.firstControlPoint, i), e = ht(i.lastControlPoint, i), n = t * e > 0 ? _r : Lr;
+  const t = ht(i.firstControlPoint, i), e = ht(i.lastControlPoint, i), n = t * e > 0 ? Fr : Lr;
   return new un(
     i.firstPoint,
     i.lastPoint,
@@ -5207,7 +5207,7 @@ function Wr(i, t, e) {
   if (D.isInstance(i) && U.isInstance(t))
     return ke(t, i, e);
   if (D.isInstance(i) && D.isInstance(t))
-    return Fi(i, t, !1, e);
+    return _i(i, t, !1, e);
   throw new Error("Not implemented");
 }
 function ie(i, t, e) {
@@ -5231,7 +5231,7 @@ function ie(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (D.isInstance(i) && D.isInstance(t)) {
-    const n = Fi(
+    const n = _i(
       i,
       t,
       !0,
@@ -5358,7 +5358,7 @@ function* He(i) {
   for (const [t, e] of Bi(i.length))
     t !== e && (yield [i[t], i[e]]);
 }
-class Vi extends Ft {
+class Vi extends _t {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
     super(), lt(this, "segments"), lt(this, "_boundingBox", null), e || ji(t), this.segments = t;
   }
@@ -5595,7 +5595,7 @@ function Kr(i, t) {
   throw new Error("Not implemented");
 }
 const Yn = Symbol.for("pantograph:Loop");
-let _t = class Gt extends Vi {
+let Ft = class Gt extends Vi {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
     super(t, { ignoreChecks: !0 }), lt(this, "strokeType", "LOOP"), lt(this, "_clockwise", null), Object.defineProperty(this, Yn, { value: !0 }), e || to(t);
   }
@@ -5717,7 +5717,7 @@ function Xn(i) {
     return no(i);
   if (ft.isInstance(i))
     return Ni(i);
-  if (_t.isInstance(i))
+  if (Ft.isInstance(i))
     return Qe(i);
   if (qi(i))
     return zi(i);
@@ -5987,7 +5987,7 @@ function Di(i, t = 1e-7) {
   }), n;
 }
 const Gn = Symbol.for("pantograph:Figure");
-let ft = class Ee extends Ft {
+let ft = class Ee extends _t {
   constructor(t, e = [], { ignoreChecks: n = !1 } = {}) {
     super(), lt(this, "contour"), lt(this, "holes"), Object.defineProperty(this, Gn, { value: !0 }), n || oo(t, e), this.contour = t, this.holes = e;
   }
@@ -6217,7 +6217,7 @@ function Kn(i) {
       it(t.firstPoint),
       it(t.lastPoint)
     ), new Error("Bug in the intersection algo on non closing strand");
-  return new _t(t.segments);
+  return new Ft(t.segments);
 }
 function wo(i, t) {
   const e = dt([
@@ -6240,7 +6240,7 @@ function Po(i) {
   try {
     return wo(i, n);
   } catch {
-    return Di(i.flatMap((s) => s.segments)).filter((s) => s.length > 1).filter((s) => k(s[0].firstPoint, s.at(-1).lastPoint)).map((s) => new _t(s));
+    return Di(i.flatMap((s) => s.segments)).filter((s) => s.length > 1).filter((s) => k(s[0].firstPoint, s.at(-1).lastPoint)).map((s) => new Ft(s));
   }
 }
 const ti = (i, t) => {
@@ -6418,7 +6418,7 @@ function Ze(i, t) {
   return !i.length || !t.length ? [] : i.length === 1 && t.length === 1 ? xo(i[0], t[0]) : i.length > 1 ? i.flatMap((e) => Ze([e], t)) : t.flatMap((e) => Ze(i, [e]));
 }
 const ei = Symbol.for("pantograph:Diagram");
-class wt extends Ft {
+class wt extends _t {
   constructor(t = [], { ignoreChecks: e = !1 } = {}) {
     super(), lt(this, "figures"), lt(this, "_boundingBox", null), Object.defineProperty(this, ei, { value: !0 }), e || vo(t), this.figures = t;
   }
@@ -6653,7 +6653,7 @@ const Co = (i) => {
   return typeof r == "number" ? a = xt(1, r * Tt) : a = r, { endTangent: o, startFactor: n, endFactor: s, startTangent: a };
 };
 function oi(i, { ignoreChecks: t = !1 } = {}) {
-  return new wt([new ft(new _t([...i], { ignoreChecks: t }))]);
+  return new wt([new ft(new Ft([...i], { ignoreChecks: t }))]);
 }
 class Ro {
   constructor(t = [0, 0]) {
@@ -6922,12 +6922,12 @@ function $o(i) {
   const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(wn).join(" ");
   return `${t} ${e}`;
 }
-function Fo(i, t = 1) {
+function _o(i, t = 1) {
   const e = i.xMin - t, n = i.yMin - t;
   return `${e} ${n} ${i.width + 2 * t} ${i.height + 2 * t}`;
 }
 function ai(i, t, e = 1, n) {
-  const s = Fo(t, e), r = n ? `width="${t.width + 2 * e}${n}" height="${t.height + 2 * e}${n}"` : "";
+  const s = _o(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}
@@ -6936,7 +6936,7 @@ function ai(i, t, e = 1, n) {
 function hi(i) {
   if (ft.isInstance(i))
     return [i];
-  if (_t.isInstance(i))
+  if (Ft.isInstance(i))
     return [new ft(i)];
   if (wt.isInstance(i))
     return i.figures;
@@ -6975,7 +6975,7 @@ function Zi(i, t, e = !1) {
     return t.onStroke(s) ? !e : !t.contains(s);
   });
 }
-function _o(i, t, e = !1) {
+function Fo(i, t, e = !1) {
   return Ji(t, i).filter((n) => {
     const s = n.segments[0].midPoint;
     return t.onStroke(s) ? !e : t.contains(s);
@@ -6987,7 +6987,7 @@ function li(i, t, e = !1) {
     t.contour,
     e
   ), s = t.holes.flatMap(
-    (r) => _o(i, r, e)
+    (r) => Fo(i, r, e)
   );
   return [...n, ...s];
 }
@@ -6997,7 +6997,7 @@ function Lo(i, t) {
   );
 }
 function Ue(i, t, e = !0) {
-  if (_t.isInstance(t))
+  if (Ft.isInstance(t))
     return Zi(i, t, e);
   if (ft.isInstance(t))
     return li(i, t, e);
@@ -7011,7 +7011,7 @@ function ui(i) {
     return To(i);
   if (ft.isInstance(i))
     return Gi(i);
-  if (_t.isInstance(i))
+  if (Ft.isInstance(i))
     return `<path d="${Qi(i)}" />`;
   if (St.isInstance(i))
     return `<path d="${$o(i)}" />`;
@@ -7044,7 +7044,7 @@ function Bo(i, {
     e
   );
 }
-class Jt extends Ft {
+class Jt extends _t {
   constructor(e, {
     cutLines: n = [],
     foldLines: s = [],
@@ -7156,7 +7156,7 @@ const Go = {
   top: Vo,
   bottom: jo
 }, gi = (i, t) => Hi([-i / 2, 0]).line(t, -t).hLine(i - 2 * t).line(t, t);
-class Ke extends Ft {
+class Ke extends _t {
   constructor(e, n = 0.2) {
     super();
     Et(this, "cut");
@@ -7186,7 +7186,7 @@ class Ke extends Ft {
     e.fuseBody(this.bump);
   }
 }
-class Le extends Ft {
+class Le extends _t {
   constructor(t) {
     super(), this.points = t, this.points = t;
   }