dielines 0.9.0 → 0.9.1

package/dist/dielines.js

@@ -1,9 +1,9 @@
 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, ii = (i) => {
+var Ui = Object.defineProperty, ni = (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) || ii("Cannot " + e), Mt = (i, t, e) => (tn(i, t, "read from private field"), e ? e.call(i) : t.get(i)), si = (i, t, e) => t.has(i) ? ii("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), Pn = (i, t, e) => (tn(i, t, "access private method"), e);
+}, 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);
 function me(i, t, e, n) {
   return i <= n && t >= e;
 }
@@ -64,7 +64,7 @@ let re = class Qt {
 function en(i) {
   return i.reduce((t, e) => t.addPoint(e), new re());
 }
-const Mn = (i, t = 1e-9) => {
+const Pn = (i, t = 1e-9) => {
   let e = i;
   return Math.abs(i) < t && (e = 0), e.toFixed(-Math.log10(t));
 };
@@ -72,7 +72,7 @@ function At(i, t = 1e-9) {
   return Array.from(
     new Map(
       i.map(([e, n]) => [
-        `[${Mn(e, t)},${Mn(n, t)}]`,
+        `[${Pn(e, t)},${Pn(n, t)}]`,
         [e, n]
       ])
     ).values()
@@ -93,11 +93,11 @@ function vt(i, t) {
   const e = Math.cos(t) * i, n = Math.sin(t) * i;
   return [e, n];
 }
-function Hi([i, t]) {
+function Wi([i, t]) {
   return Math.atan2(t, i);
 }
-function ri(i) {
-  const t = J(i), e = Hi(i);
+function si(i) {
+  const t = J(i), e = Wi(i);
   return [t, e];
 }
 function sn(i, t, e = 1e-9) {
@@ -110,7 +110,7 @@ function nt(i) {
 function Zt(i) {
   return [i[1], -i[0]];
 }
-function Wi(i, t, e) {
+function Hi(i, t, e) {
   return k(e, i) || sn(q(e, i), t);
 }
 const Bt = (i, t) => {
@@ -143,12 +143,12 @@ const Bt = (i, t) => {
   const [t, e, n, s, r, o, a, h, l] = i;
   return [t, s, a, e, r, h, n, o, l];
 };
-let ct = class oi {
+let ct = class ri {
   constructor(t) {
     F(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]), t && (this._matrix = [...t]);
   }
   clone() {
-    return new oi(this._matrix);
+    return new ri(this._matrix);
   }
   transpose() {
     return this._matrix = Gi(this._matrix), this;
@@ -377,7 +377,7 @@ const Ie = (i, t, e) => {
     intersectionParam2: l
   };
 };
-function ai(i, t, e = !1, n) {
+function oi(i, t, e = !1, n) {
   const s = Ie(i, t, n);
   if (s === "parallel") {
     if (!e) return null;
@@ -401,7 +401,7 @@ function ai(i, t, e = !1, n) {
 }
 const ge = (i, t) => {
   const e = q(i, t);
-  return ri(e);
+  return si(e);
 };
 let z = class qt extends oe {
   constructor(t, e, n, s = !1, { ignoreChecks: r = !1 } = {}) {
@@ -618,7 +618,7 @@ function Zi(i, t, e) {
     { ignoreChecks: !0 }
   );
 }
-function hi(i, t, e) {
+function ai(i, t, e) {
   const n = new D(i, t), s = nt(n.tangentAtFirstPoint), r = Ie(
     { firstPoint: n.midPoint, V: s, precision: 1e-9 },
     {
@@ -640,11 +640,11 @@ function hi(i, t, e) {
     ignoreChecks: !0
   });
 }
-const yn = 1e-21, pe = 1.618034;
-function bn(i, t = 0, e = 1, n = 110, s = 1e3) {
+const Mn = 1e-21, pe = 1.618034;
+function yn(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) < yn ? r = 2 * yn : 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) < Mn ? r = 2 * Mn : 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,7 +658,7 @@ function bn(i, t = 0, e = 1, n = 110, s = 1e3) {
   }
   return [t, e, f, o, a, h, l];
 }
-const xn = 0.381966, Ki = 1e-11;
+const bn = 0.381966, Ki = 1e-11;
 class ts {
   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] = bn(h);
+      [r, o, a, t, e, n, s] = yn(h);
     else if (l.length === 2)
-      [r, o, a, t, e, n, s] = bn(h, l[0], l[1]);
+      [r, o, a, t, e, n, s] = yn(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.");
@@ -697,13 +697,13 @@ class ts {
       if (Math.abs(o - R) < b - 0.5 * (w - m))
         break;
       if (Math.abs(g) <= P)
-        o >= R ? g = m - o : g = w - o, M = xn * g;
+        o >= R ? g = m - o : g = w - o, M = bn * 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);
         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 = xn * 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);
       }
       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 li(i, t = 1e-8, e = 1e3) {
+function hi(i, t = 1e-8, e = 1e3) {
   const n = new ts(i, t, e);
   return n.setBracket([0, 1]), n.run();
 }
-function ui(i) {
+function li(i) {
   if (i.__esModule) return i;
   var t = i.default;
   if (typeof t == "function") {
@@ -755,7 +755,7 @@ function ee(i) {
 const ns = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   isAnyArray: ee
-}, Symbol.toStringTag, { value: "Module" })), is = /* @__PURE__ */ ui(ns);
+}, Symbol.toStringTag, { value: "Module" })), is = /* @__PURE__ */ li(ns);
 function ss(i) {
   var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
   if (!ee(i))
@@ -812,14 +812,14 @@ function os(i) {
 const as = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   default: os
-}, Symbol.toStringTag, { value: "Module" })), hs = /* @__PURE__ */ ui(as);
+}, Symbol.toStringTag, { value: "Module" })), hs = /* @__PURE__ */ li(as);
 Object.defineProperty(O, "__esModule", { value: !0 });
-var ft = is, vn = hs;
-const we = " ".repeat(2), ci = " ".repeat(4);
+var ft = is, xn = hs;
+const we = " ".repeat(2), ui = " ".repeat(4);
 function ls() {
-  return fi(this);
+  return ci(this);
 }
-function fi(i, t = {}) {
+function ci(i, t = {}) {
   const {
     maxRows: e = 15,
     maxColumns: n = 10,
@@ -828,7 +828,7 @@ function fi(i, t = {}) {
   } = t;
   return `${i.constructor.name} {
 ${we}[
-${ci}${us(i, e, n, s, r)}
+${ui}${us(i, e, n, s, r)}
 ${we}]
 ${we}rows: ${i.rows}
 ${we}columns: ${i.columns}
@@ -852,12 +852,12 @@ function us(i, t, e, 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(`
-${ci}`);
+${ui}`);
 }
 function cs(i, t, e) {
-  return (i >= 0 && e ? ` ${An(i, t - 1)}` : An(i, t)).padEnd(t);
+  return (i >= 0 && e ? ` ${vn(i, t - 1)}` : vn(i, t)).padEnd(t);
 }
-function An(i, t) {
+function vn(i, t) {
   let e = i.toString();
   if (e.length <= t) return e;
   let n = i.toFixed(t);
@@ -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), 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), H = (r - u) * (M - b), L = r * P, N = (c + u) * (-P + b), B = (-r + a + h) * (f + P - R), Y = (r - h) * (f - R), W = (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 + W, qe = V + v + S + d + L + B + Y, he = V + S + j + d + U, le = L + B + Y + W + tt, ue = d + x + A + I + _ + H + L, ce = _ + H + 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), 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;
   }
   mmulStrassen(t) {
@@ -2050,10 +2050,10 @@ let Z = class st {
         M
       ), _ = st.add(j, A);
       _.sub(y), _.add(I);
-      let H = st.add(x, y), L = st.add(d, A), N = st.sub(j, d);
+      let W = st.add(x, y), L = st.add(d, A), N = st.sub(j, d);
       N.add(x), N.add($);
       let B = st.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(N, _.rows, _.columns), B.subMatrix(0, w - 1, 0, g - 1);
+      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);
     }
     return c(e, t, h, l);
   }
@@ -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 && vn(o, { min: e, max: n, output: o }), s.setRow(r, o);
+      o.length > 0 && xn(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 && vn(o, {
+      o.length && xn(o, {
         min: e,
         max: n,
         output: o
@@ -2130,12 +2130,12 @@ let Z = class st {
         t.set(n, e, this.get(e, n));
     return t;
   }
-  sortRows(t = En) {
+  sortRows(t = An) {
     for (let e = 0; e < this.rows; e++)
       this.setRow(e, this.getRow(e).sort(t));
     return this;
   }
-  sortColumns(t = En) {
+  sortColumns(t = An) {
     for (let e = 0; e < this.columns; e++)
       this.setColumn(e, this.getColumn(e).sort(t));
     return this;
@@ -2350,7 +2350,7 @@ let Z = class st {
     }
   }
   toString(t) {
-    return fi(this, t);
+    return ci(this, t);
   }
   [Symbol.iterator]() {
     return this.entries();
@@ -2378,7 +2378,7 @@ let Z = class st {
 };
 Z.prototype.klass = "Matrix";
 typeof Symbol < "u" && (Z.prototype[Symbol.for("nodejs.util.inspect.custom")] = ls);
-function En(i, t) {
+function An(i, t) {
   return i - t;
 }
 function $s(i) {
@@ -2394,10 +2394,10 @@ Z.prototype.tensorProduct = Z.prototype.kroneckerProduct;
 var Pe, Oe, Me;
 let E = (Me = class extends Z {
   constructor(i, t) {
-    if (super(), si(this, Pe), F(this, "data"), Me.isMatrix(i))
-      Pn(this, Pe, Oe).call(this, i.rows, i.columns), Me.copy(i, this);
+    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);
     else if (Number.isInteger(i) && i >= 0)
-      Pn(this, Pe, Oe).call(this, i, t);
+      dn(this, Pe, Oe).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")
@@ -2476,7 +2476,7 @@ const Is = class Xe extends Z {
    * @return {this}
    */
   constructor(t) {
-    if (super(), si(this, ht), E.isMatrix(t)) {
+    if (super(), ii(this, ht), E.isMatrix(t)) {
       if (!t.isSymmetric())
         throw new TypeError("not symmetric data");
       Ne(this, ht, E.copy(
@@ -2628,7 +2628,7 @@ const Is = class Xe extends Z {
 ht = /* @__PURE__ */ new WeakMap();
 let Kt = Is;
 Kt.prototype.klassType = "SymmetricMatrix";
-let mi = class gi extends Kt {
+let fi = class mi extends Kt {
   /**
    * not the same as matrix.isSymmetric()
    * Here is to check if it's instanceof SymmetricMatrix without bundling issues
@@ -2653,7 +2653,7 @@ let mi = class gi extends Kt {
     return new Kt(this);
   }
   clone() {
-    const t = new gi(this.diagonalSize);
+    const t = new mi(this.diagonalSize);
     for (const [e, n, s] of this.upperRightEntries())
       e !== n && t.set(e, n, s);
     return t;
@@ -2703,7 +2703,7 @@ let mi = class gi extends Kt {
     return s;
   }
 };
-mi.prototype.klassSubType = "DistanceMatrix";
+fi.prototype.klassSubType = "DistanceMatrix";
 let Et = class extends Z {
   constructor(t, e, n) {
     super(), this.matrix = t, this.rows = e, this.columns = n;
@@ -2822,7 +2822,7 @@ class Ns extends Et {
     return this.matrix.get(e, t);
   }
 }
-class pi extends Z {
+class gi extends Z {
   constructor(t, e = {}) {
     const { rows: n = 1 } = e;
     if (t.length % n !== 0)
@@ -2854,7 +2854,7 @@ let gt = class extends Z {
 };
 function Os(i, t) {
   if (ft.isAnyArray(i))
-    return i[0] && ft.isAnyArray(i[0]) ? new gt(i) : new pi(i, t);
+    return i[0] && ft.isAnyArray(i[0]) ? new gt(i) : new gi(i, t);
   throw new Error("the argument is not an array");
 }
 let Fe = class {
@@ -3019,7 +3019,7 @@ class an {
     return s;
   }
 }
-let Ht = class {
+let Wt = class {
   constructor(t, e = {}) {
     if (t = gt.checkMatrix(t), t.isEmpty())
       throw new Error("Matrix must be non-empty");
@@ -3172,8 +3172,8 @@ let Ht = class {
           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)
-              for (let H = 0; H < s; H++)
-                $ = I * M.get(H, y) + _ * M.get(H, v - 1), M.set(H, v - 1, -_ * M.get(H, y) + I * M.get(H, v - 1)), M.set(H, y, $);
+              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, $);
           }
           break;
         }
@@ -3183,8 +3183,8 @@ let Ht = class {
           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)
-              for (let H = 0; H < n; H++)
-                $ = I * p.get(H, y) + _ * p.get(H, d - 1), p.set(H, d - 1, -_ * p.get(H, y) + I * p.get(H, d - 1)), p.set(H, y, $);
+              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, $);
           }
           break;
         }
@@ -3195,18 +3195,18 @@ let Ht = 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, H = f[d] / A, L = (($ + y) * ($ - y) + I * I) / 2, N = y * I * (y * I);
+          ), 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);
           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, W = _ * H;
+          let Y = (_ + y) * (_ - y) + B, H = _ * W;
           for (let T = d; T < v - 1; T++) {
-            let U = xt(Y, W);
+            let U = xt(Y, H);
             U === 0 && (U = Number.MIN_VALUE);
-            let tt = Y / U, K = W / U;
-            if (T !== d && (f[T - 1] = U), Y = tt * g[T] + K * f[T], f[T] = tt * f[T] - K * g[T], W = K * g[T + 1], g[T + 1] = tt * g[T + 1], l)
+            let tt = Y / U, K = H / U;
+            if (T !== d && (f[T - 1] = U), Y = tt * g[T] + K * f[T], f[T] = tt * f[T] - K * g[T], H = K * g[T + 1], g[T + 1] = tt * g[T + 1], l)
               for (let G = 0; G < s; G++)
                 U = tt * M.get(G, T) + K * M.get(G, T + 1), M.set(G, T + 1, -K * M.get(G, T) + tt * M.get(G, T + 1)), M.set(G, T, U);
-            if (U = xt(Y, W), U === 0 && (U = Number.MIN_VALUE), tt = Y / U, K = W / U, g[T] = U, Y = tt * f[T] + K * g[T + 1], g[T + 1] = -K * f[T] + tt * g[T + 1], W = K * f[T + 1], f[T + 1] = tt * f[T + 1], h && T < n - 1)
+            if (U = xt(Y, H), U === 0 && (U = Number.MIN_VALUE), tt = Y / U, K = H / U, g[T] = U, Y = tt * f[T] + K * g[T + 1], g[T + 1] = -K * f[T] + tt * g[T + 1], H = K * f[T + 1], f[T + 1] = tt * f[T + 1], h && T < n - 1)
               for (let G = 0; G < n; G++)
                 U = tt * p.get(G, T) + K * p.get(G, T + 1), p.set(G, T + 1, -K * p.get(G, T) + tt * p.get(G, T + 1)), p.set(G, T, U);
           }
@@ -3299,10 +3299,10 @@ let Ht = class {
   }
 };
 function zs(i, t = !1) {
-  return i = gt.checkMatrix(i), t ? new Ht(i).inverse() : wi(i, E.eye(i.rows));
+  return i = gt.checkMatrix(i), t ? new Wt(i).inverse() : pi(i, E.eye(i.rows));
 }
-function wi(i, t, e = !1) {
-  return i = gt.checkMatrix(i), t = gt.checkMatrix(t), e ? new Ht(i).solve(t) : i.isSquare() ? new Fe(i).solve(t) : new an(i).solve(t);
+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 Ae(i) {
   if (i = E.checkMatrix(i), i.isSquare()) {
@@ -3340,7 +3340,7 @@ function Ys(i, 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 Ht(h).solve(a), c = E.sub(a, h.mmul(l)).abs().max();
+    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();
     r.setRow(
       o,
       Us(c, l, o, e, n)
@@ -3351,12 +3351,12 @@ function Ys(i, t = {}) {
 function Xs(i, t = Number.EPSILON) {
   if (i = E.checkMatrix(i), i.isEmpty())
     return i.transpose();
-  let e = new Ht(i, { autoTranspose: !0 }), n = e.leftSingularVectors, s = e.rightSingularVectors, r = e.diagonal;
+  let e = new Wt(i, { autoTranspose: !0 }), n = e.leftSingularVectors, s = e.rightSingularVectors, r = e.diagonal;
   for (let o = 0; o < r.length; o++)
     Math.abs(r[o]) > t ? r[o] = 1 / r[o] : r[o] = 0;
   return s.mmul(E.diag(r).mmul(n.transpose()));
 }
-function Hs(i, t = i, e = {}) {
+function Ws(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 Hs(i, t = i, e = {}) {
       r.set(o, a, r.get(o, a) * (1 / (i.rows - 1)));
   return r;
 }
-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)
@@ -3386,7 +3386,7 @@ function Ws(i, t = i, e = {}) {
       );
   return h;
 }
-let di = class {
+let wi = class {
   constructor(i, t = {}) {
     const { assumeSymmetric: e = !1 } = t;
     if (i = gt.checkMatrix(i), !i.isSquare())
@@ -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 Pi {
+class di {
   constructor(t) {
     if (t = gt.checkMatrix(t), !t.isSymmetric())
       throw new Error("Matrix is not symmetric");
@@ -3697,7 +3697,7 @@ class Pi {
     return this.L;
   }
 }
-class Mi {
+class Pi {
   constructor(t, e = {}) {
     t = gt.checkMatrix(t);
     let { Y: n } = e;
@@ -3728,11 +3728,11 @@ class Mi {
   }
 }
 O.AbstractMatrix = Z;
-O.CHO = Pi;
-O.CholeskyDecomposition = Pi;
-O.DistanceMatrix = mi;
-O.EVD = di;
-var Ks = O.EigenvalueDecomposition = di;
+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;
@@ -3745,26 +3745,26 @@ O.MatrixRowView = Vs;
 O.MatrixSelectionView = ve;
 O.MatrixSubView = qs;
 O.MatrixTransposeView = Ns;
-O.NIPALS = Mi;
-O.Nipals = Mi;
+O.NIPALS = Pi;
+O.Nipals = Pi;
 O.QR = an;
 O.QrDecomposition = an;
-O.SVD = Ht;
-O.SingularValueDecomposition = Ht;
+O.SVD = Wt;
+O.SingularValueDecomposition = Wt;
 O.SymmetricMatrix = Kt;
-O.WrapperMatrix1D = pi;
+O.WrapperMatrix1D = gi;
 O.WrapperMatrix2D = gt;
-O.correlation = Ws;
-O.covariance = Hs;
-var Sn = O.default = E;
+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 = wi;
+O.solve = pi;
 O.wrap = Os;
 const er = Ks, nr = tr;
-Sn.Matrix && Sn.Matrix;
+En.Matrix && En.Matrix;
 function ne(i, t, e) {
   const n = i / e, s = t / e;
   if (!(isFinite(n) && isFinite(s))) {
@@ -3784,7 +3784,7 @@ function ne(i, t, e) {
   const a = n / o;
   return isFinite(a) ? a > o ? [o, a] : [a, o] : [o];
 }
-function yi(i, t, e, n) {
+function Mi(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);
@@ -3802,14 +3802,14 @@ function yi(i, t, e, n) {
 }
 function ir(i, t, e, n, s) {
   if (s == 0)
-    return yi(i, t, e, n);
+    return Mi(i, t, e, n);
   const r = n / s, o = e / s, a = t / s, h = i / s;
-  let l = kn(r, o, a, h, !1);
+  let l = Sn(r, o, a, h, !1);
   if (l !== null)
     return l;
   const c = 716e74;
   for (let u = 0; u < 2; u++)
-    if (l = kn(
+    if (l = Sn(
       r / c,
       o / (c * c),
       a / (c * c * c),
@@ -3825,7 +3825,7 @@ function ir(i, t, e, n, s) {
 function Ct(i, t) {
   return t == 0 ? Math.abs(i) : Math.abs((i - t) / t);
 }
-function kn(i, t, e, n, s) {
+function Sn(i, t, e, n, s) {
   const r = sr(i, t, e, n, s);
   if (r !== null && r.length == 4) {
     let o = [];
@@ -3839,8 +3839,8 @@ function kn(i, t, e, n, s) {
 }
 function sr(i, t, e, n, s) {
   function r(L, N, B, Y) {
-    const W = Ct(L + B, i), T = Ct(N + L * B + Y, t), U = Ct(N * B + L * Y, e);
-    return W + T + U;
+    const H = Ct(L + B, i), T = Ct(N + L * B + Y, t), U = Ct(N * B + L * Y, e);
+    return H + T + U;
   }
   function o(L, N, B, Y) {
     return r(L, N, B, Y) + Ct(N * Y, n);
@@ -3860,7 +3860,7 @@ function sr(i, t, e, n, s) {
   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;
   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), W = Ct(2 * (N * B + f * P), e), T = Ct(N * B * B + P * P, n), U = Y + W + T;
+    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 x = S, A = j;
@@ -3870,18 +3870,18 @@ function sr(i, t, e, n, s) {
     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)) {
       let N = null, B = null;
       if (Math.abs(y) < Math.abs(I)) {
-        const W = (e - $ * I) / _, T = (t - _ - $) / I;
-        N = [i - I, W, T], B = [I, I, I];
+        const H = (e - $ * I) / _, T = (t - _ - $) / I;
+        N = [i - I, H, T], B = [I, I, I];
       } else {
-        const W = (e - y * _) / $, T = (t - _ - $) / y, U = i - y;
-        N = [y, y, y], B = [U, W, T];
+        const H = (e - y * _) / $, T = (t - _ - $) / y, U = i - y;
+        N = [y, y, y], B = [U, H, T];
       }
       let Y = 0;
-      for (let W = 0; W < 3; W++) {
-        const T = N[W], U = B[W];
+      for (let H = 0; H < 3; H++) {
+        const T = N[H], U = B[H];
         if (isFinite(T) && isFinite(U)) {
           const tt = r(T, $, U, _);
-          (W == 0 || tt < Y) && (y = T, I = U, Y = tt);
+          (H == 0 || tt < Y) && (y = T, I = U, Y = tt);
         }
       }
     }
@@ -3890,14 +3890,14 @@ function sr(i, t, e, n, s) {
     y = f, $ = P + Math.sqrt(-L), I = f, _ = P - Math.sqrt(-L), Math.abs($) > Math.abs(_) ? _ = n / $ : Math.abs(_) > Math.abs($) && ($ = n / _);
   } else
     return [];
-  let H = o(y, $, I, _);
-  for (let L = 0; L < 8 && H != 0; L++) {
-    const N = $ * _ - n, B = $ * I + y * _ - e, Y = $ + y * I + _ - t, W = y + I - i, T = y - I, U = $ * $ - $ * (I * T + 2 * _) + _ * (y * T + _);
+  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 + _);
     if (U == 0)
       break;
-    const tt = 1 / U, K = _ - $, G = $ * I - y * _, Be = T * N + K * B + G * Y - ($ * K + y * G) * W, Ve = (y * T + K) * N - $ * (T * B + K * Y + G * W), je = -T * N - K * B - G * Y + (I * G + _ * K) * W, qe = -(I * T + K) * N + _ * (T * B + K * Y + G * W), he = y - tt * Be, le = $ - tt * Ve, ue = I - tt * je, ce = _ - tt * qe, fe = o(he, le, ue, ce);
-    if (fe < H)
-      y = he, $ = le, I = ue, _ = ce, H = fe;
+    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);
+    if (fe < W)
+      y = he, $ = le, I = ue, _ = ce, W = fe;
     else
       break;
   }
@@ -4020,7 +4020,7 @@ let rt = class zt extends oe {
     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);
   }
   distanceFrom(t) {
-    const e = li((n) => Ft(this.paramPoint(n), t), this.precision);
+    const e = hi((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)
@@ -4150,7 +4150,7 @@ let rt = class zt extends oe {
   }
   paramsAtY(t) {
     const [e, n, s, r] = this.polynomialCoefficients[1];
-    return yi(e - t, n, s, r).filter((o) => o >= -this.precision && o <= 1 + this.precision);
+    return Mi(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;
@@ -4330,7 +4330,7 @@ let rt = class zt extends oe {
       )
     ), this.isValidParameter(this.thetaToParam(this.pointTheta(t))))
       return J(t, e);
-    if (Wi(t, this.majorAxis, this.center)) {
+    if (Hi(t, this.majorAxis, this.center)) {
       const n = $t(
         2 * Math.PI - this.pointTheta(t)
       ), s = this.thetaToParam(n);
@@ -4518,7 +4518,7 @@ let et = class Dt extends oe {
     return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : k(this.firstPoint, t.firstPoint) && k(this.lastPoint, t.lastPoint) && k(this.controlPoint, t.controlPoint);
   }
   distanceFrom(t) {
-    const e = li((n) => Ft(this.paramPoint(n), t), this.precision);
+    const e = hi((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)
@@ -4715,7 +4715,7 @@ const gr = (i) => {
     ];
   throw new Error("Bug in the arc arc overlap algorithm");
 };
-function bi(i, t, e = !1, n) {
+function yi(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 [];
@@ -4744,7 +4744,7 @@ function bi(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 He(i, t, e = 1e-9) {
+function We(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));
@@ -4773,7 +4773,7 @@ function He(i, t, e = 1e-9) {
   ];
   return u([p, M]);
 }
-function xi(i, t) {
+function bi(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,
@@ -4798,8 +4798,8 @@ function xi(i, t) {
   });
   return At(P, e);
 }
-function Rn(i, t) {
-  return xi(i, t).filter((e) => i.isOnSegment(e) && t.isOnSegment(e));
+function kn(i, t) {
+  return bi(i, t).filter((e) => i.isOnSegment(e) && t.isOnSegment(e));
 }
 const wr = (i) => {
   const {
@@ -4859,9 +4859,9 @@ const wr = (i) => {
 };
 function Pr(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) : [] : xi(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 ? dr(i, t) : [] : bi(i, t).filter((s) => i.isOnSegment(s) && t.isOnSegment(s));
 }
-function Cn(i, t) {
+function Rn(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));
 }
@@ -4869,7 +4869,7 @@ const Mr = (i, t = 1e-9) => {
   let e = i;
   return Math.abs(i) < t && (e = 0), e.toFixed(-Math.log10(t));
 };
-function vi(i, t = 1e-9) {
+function xi(i, t = 1e-9) {
   return Array.from(
     new Map(i.map((e) => [Mr(e, t), e])).values()
   );
@@ -4878,30 +4878,30 @@ 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];
 };
-function Tn(i, t) {
+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 vi(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
+  return xi(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];
 };
-function $n(i, t) {
+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 vi(s, e).map((r) => t.paramPoint(r)).filter((r) => i.isOnSegment(r));
+  return xi(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);
 }
-class un {
+let un = class {
   constructor(t, e, n, s) {
     this.firstPoint = t, this.lastPoint = e, this.negativeThickness = n, this.positiveThickness = s;
   }
   get width() {
     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;
@@ -4946,7 +4946,7 @@ function kr(i) {
     Math.max(...r)
   );
 }
-function In(i, t) {
+function $n(i, t) {
   const e = [];
   for (let n = 1; n < i.length; n++) {
     const s = i[n];
@@ -4964,7 +4964,7 @@ function In(i, t) {
   }
   return e;
 }
-class Wt {
+class Ht {
   constructor(t, e) {
     this.from = t, this.to = e;
   }
@@ -5024,30 +5024,30 @@ class Tr {
     return this.distances[3];
   }
 }
-function _n(i, t) {
-  const e = Rr(t, i), n = In(
+function In(i, t) {
+  const e = Rr(t, i), n = $n(
     e.topHull,
     i.negativeThickness
-  ), s = In(
+  ), s = $n(
     e.bottomHull,
     i.positiveThickness
   ), r = e.endDistance >= i.negativeThickness && e.endDistance <= i.positiveThickness;
   if (!n.length && !s.length)
-    return r ? new Wt("start", "end") : null;
+    return r ? new Ht("start", "end") : null;
   if (n.length === 1 && s.length === 1)
-    return new Wt(n[0], s[0]);
+    return new Ht(n[0], s[0]);
   if (n.length === 2 && s.length === 2)
     throw new Error(
       "Bug in the clipping algorithm, unexpected number of crossing points"
     );
   const o = n.length ? n : s;
-  return o.length === 2 ? new Wt(o[0], o[1]) : r ? new Wt(o[0], "end") : new Wt("start", o[0]);
+  return o.length === 2 ? new Ht(o[0], o[1]) : r ? new Ht(o[0], "end") : new Ht("start", o[0]);
 }
-function Fn(i, t) {
-  const e = Sr(i), n = _n(e, t);
+function _n(i, t) {
+  const e = Sr(i), n = In(e, t);
   if (!n)
     return null;
-  const s = kr(i), r = _n(
+  const s = kr(i), r = In(
     s,
     t
   );
@@ -5058,9 +5058,9 @@ 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 ? Fn(o, r) : r;
+    const c = a > s ? _n(o, r) : r;
     if (!c) return [];
-    const u = be(c), m = h > s ? Fn(c, o) : o;
+    const u = be(c), m = h > s ? _n(c, o) : o;
     if (!m) return [];
     const w = be(m);
     if (u <= s && w <= s)
@@ -5163,7 +5163,7 @@ function Fr(i, t, e = !1) {
 }
 function Lr(i, t, e) {
   if (i instanceof D && t instanceof D) {
-    const n = ai(
+    const n = oi(
       i,
       t,
       !1,
@@ -5176,12 +5176,12 @@ function Lr(i, t, e) {
   if (i instanceof z && t instanceof D)
     return Re(t, i, e);
   if (i instanceof z && t instanceof z)
-    return bi(i, t, !1, e);
+    return yi(i, t, !1, e);
   throw new Error("Not implemented");
 }
 function ie(i, t, e) {
   if (i instanceof D && t instanceof D) {
-    const n = ai(
+    const n = oi(
       i,
       t,
       !0,
@@ -5200,7 +5200,7 @@ function ie(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof z && t instanceof z) {
-    const n = bi(
+    const n = yi(
       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 = He(
+    const n = We(
       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 = He(
+    const n = We(
       t,
       i,
       e
@@ -5233,11 +5233,11 @@ function ie(i, t, e) {
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof z && t instanceof at) {
-    const n = Rn(i, t);
+    const n = kn(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (t instanceof z && i instanceof at) {
-    const n = Rn(t, i);
+    const n = kn(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof at && t instanceof at) {
@@ -5257,27 +5257,27 @@ function ie(i, t, e) {
     } : { intersections: [], overlaps: [], count: 0 };
   }
   if (i instanceof D && (t instanceof rt || t instanceof et)) {
-    const n = Cn(i, t);
+    const n = Rn(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (t instanceof D && (i instanceof rt || i instanceof et)) {
-    const n = Cn(t, i);
+    const n = Rn(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((i instanceof z || i instanceof at) && t instanceof et) {
-    const n = $n(i, t);
+    const n = Tn(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((t instanceof z || t instanceof at) && i instanceof et) {
-    const n = $n(t, i);
+    const n = Tn(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((i instanceof z || i instanceof at) && t instanceof rt) {
-    const n = Tn(i, t);
+    const n = Cn(i, t);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if ((t instanceof z || t instanceof at) && i instanceof rt) {
-    const n = Tn(t, i);
+    const n = Cn(t, i);
     return { intersections: n, overlaps: [], count: n.length };
   }
   if (i instanceof et && t instanceof et) {
@@ -5316,20 +5316,20 @@ function ie(i, t, e) {
   }
   throw new Error("Not implemented");
 }
-function Ai(i) {
+function vi(i) {
   const t = [];
   for (let e = 0; e < i; e++)
     for (let n = 0; n <= e; n++)
       t.push([e, n]);
   return t;
 }
-function* We(i) {
-  for (const [t, e] of Ai(i.length))
+function* He(i) {
+  for (const [t, e] of vi(i.length))
     t !== e && (yield [i[t], i[e]]);
 }
-class Ei extends Lt {
+class Ai extends Lt {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
-    super(), ut(this, "segments"), ut(this, "_boundingBox", null), e || Si(t), this.segments = t;
+    super(), ut(this, "segments"), ut(this, "_boundingBox", null), e || Ei(t), this.segments = t;
   }
   get repr() {
     return this.segments.map((t) => t.repr).join(`
@@ -5375,7 +5375,7 @@ class Ei extends Lt {
   }
 }
 function Br(i, t = "Stroke") {
-  Ai(i.length).forEach(
+  vi(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);
@@ -5411,7 +5411,7 @@ function Br(i, t = "Stroke") {
     }
   );
 }
-function Si(i, t = "Stroke") {
+function Ei(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(
@@ -5423,10 +5423,10 @@ function Si(i, t = "Stroke") {
     }
   ), Br(i, t);
 }
-function Ln(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) {
+function Ln(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 Bn(i, t) {
     );
   throw new Error("Not implemented");
 }
-function ki(i) {
+function Si(i) {
   let t = !1;
   const e = [];
   for (const n of i.segments) {
@@ -5447,19 +5447,19 @@ function ki(i) {
       continue;
     }
     const s = e[e.length - 1];
-    Ln(s, n) ? (t = !0, e.pop(), e.push(Bn(s, n))) : e.push(n);
+    Fn(s, n) ? (t = !0, e.pop(), e.push(Ln(s, n))) : e.push(n);
   }
-  if (k(i.firstPoint, i.lastPoint) && Ln(
+  if (k(i.firstPoint, i.lastPoint) && Fn(
     e[0],
     e[e.length - 1]
   )) {
     t = !0;
     const n = e.pop();
-    e[0] = Bn(n, e[0]);
+    e[0] = Ln(n, e[0]);
   }
   return t ? e : null;
 }
-let Rt = class Ut extends Ei {
+let Rt = class Ut extends Ai {
   constructor() {
     super(...arguments), ut(this, "strokeType", "STRAND");
   }
@@ -5479,7 +5479,7 @@ let Rt = class Ut extends Ei {
     return new Ut([...this.segments, ...t.segments]);
   }
   simplify() {
-    const t = ki(this);
+    const t = Si(this);
     return t ? new Ut(t, { ignoreChecks: !0 }) : this;
   }
   transform(t) {
@@ -5505,7 +5505,7 @@ const Vr = (i, t) => {
   }
   return 1;
 };
-let cn = class {
+class cn {
   constructor(t) {
     ut(this, "_count", 0), ut(this, "segment"), this.segment = t;
   }
@@ -5515,7 +5515,7 @@ let cn = class {
   get count() {
     return this._count;
   }
-};
+}
 const jr = (i, t) => {
   const e = t.precision, n = Math.abs(i[1] - t.center[1]);
   if (n > t.radius + e) return 0;
@@ -5530,7 +5530,7 @@ const jr = (i, 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 He(n, t).forEach((r) => {
+  return We(n, t).forEach((r) => {
     s.update(r, !0);
   }), s.count;
 }, Nr = (i, t) => {
@@ -5559,7 +5559,7 @@ function Or(i, t) {
     return Nr(i, t);
   throw new Error("Not implemented");
 }
-class dt extends Ei {
+class dt extends Ai {
   constructor(t, { ignoreChecks: e = !1 } = {}) {
     super(t, { ignoreChecks: !0 }), ut(this, "strokeType", "LOOP"), ut(this, "_clockwise", null), e || zr(t);
   }
@@ -5593,12 +5593,12 @@ class dt extends Ei {
     return this.onStroke(t) || !this.boundingBox.contains(t) ? !1 : this.segments.reduce((e, n) => e + Or(t, n), 0) % 2 === 1;
   }
   simplify() {
-    const t = ki(this);
+    const t = Si(this);
     return t ? new dt(t, { ignoreChecks: !0 }) : this;
   }
 }
 function zr(i) {
-  if (Si(i, "Loop"), !k(i[0].firstPoint, i[i.length - 1].lastPoint))
+  if (Ei(i, "Loop"), !k(i[0].firstPoint, i[i.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
 const Dr = [
@@ -5608,10 +5608,10 @@ const Dr = [
   et,
   rt
 ];
-function Ri(i) {
+function ki(i) {
   return Dr.some((t) => i instanceof t);
 }
-function Ci(i) {
+function Ri(i) {
   if (i instanceof D)
     return {
       type: i.segmentType,
@@ -5657,10 +5657,10 @@ function Ci(i) {
 function Qe(i) {
   return {
     type: "LOOP",
-    segments: i.segments.map(Ci)
+    segments: i.segments.map(Ri)
   };
 }
-function Ti(i) {
+function Ci(i) {
   return {
     type: "FIGURE",
     contour: Qe(i.contour),
@@ -5670,18 +5670,18 @@ function Ti(i) {
 function Ur(i) {
   return {
     type: "DIAGRAM",
-    figures: i.figures.map(Ti)
+    figures: i.figures.map(Ci)
   };
 }
-function Vn(i) {
+function Bn(i) {
   if (i instanceof ae)
     return Ur(i);
   if (i instanceof mt)
-    return Ti(i);
+    return Ci(i);
   if (i instanceof dt)
     return Qe(i);
-  if (Ri(i))
-    return Ci(i);
+  if (ki(i))
+    return Ri(i);
   throw new Error("Unknown shape type");
 }
 class Yr {
@@ -5730,8 +5730,8 @@ class Yr {
     this.ids.length = this.values.length = this.length;
   }
 }
-const jn = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], ze = 3;
-class fn {
+const Vn = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], ze = 3;
+let Xr = class Ti {
   /**
    * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
    * @param {ArrayBuffer | SharedArrayBuffer} data
@@ -5749,11 +5749,11 @@ class fn {
     const r = s >> 4;
     if (r !== ze)
       throw new Error(`Got v${r} data when expected v${ze}.`);
-    const o = jn[s & 15];
+    const o = Vn[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 fn(h, a, o, void 0, t, e);
+    return new Ti(h, a, o, void 0, t, e);
   }
   /**
    * Create a Flatbush index that will hold a given number of items.
@@ -5774,7 +5774,7 @@ class fn {
       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 = jn.indexOf(this.ArrayType), c = h * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    const l = Vn.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();
@@ -5832,7 +5832,7 @@ class fn {
     let o = this._boxes.length - 4;
     const a = [], h = [];
     for (; o !== void 0; ) {
-      const l = Math.min(o + this.nodeSize * 4, Nn(o, this._levelBounds));
+      const l = Math.min(o + this.nodeSize * 4, qn(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 @@ class fn {
     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, Nn(o, this._levelBounds));
+      const c = Math.min(o + this.nodeSize * 4, qn(o, this._levelBounds));
       for (let u = o; u < c; u += 4) {
-        const m = this._indices[u >> 2] | 0, w = qn(t, this._boxes[u], this._boxes[u + 2]), g = qn(e, this._boxes[u + 1], this._boxes[u + 3]), p = w * w + g * g;
+        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;
         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 @@ class fn {
     }
     return a.clear(), h;
   }
-}
-function qn(i, t, e) {
+};
+function jn(i, t, e) {
   return i < t ? t - i : i <= e ? 0 : i - e;
 }
-function Nn(i, t) {
+function qn(i, t) {
   let e = 0, n = t.length - 1;
   for (; e < n; ) {
     const s = e + n >> 1;
@@ -5892,11 +5892,11 @@ function Ge(i, t, e, n, s, r) {
       h--;
     while (i[h] > o);
     if (a >= h) break;
-    Xr(i, t, e, a, h);
+    Wr(i, t, e, a, h);
   }
   Ge(i, t, e, n, h, r), Ge(i, t, e, h + 1, s, r);
 }
-function Xr(i, t, e, n, s) {
+function Wr(i, t, e, n, s) {
   const r = i[n];
   i[n] = i[s], i[s] = r;
   const o = 4 * n, a = 4 * s, h = t[o], l = t[o + 1], c = t[o + 2], u = t[o + 3];
@@ -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 fn(i.length);
+  const e = new Xr(i.length);
   i.forEach((r) => {
     const [o, a] = r.firstPoint;
     e.add(o - t, a - t, o + t, a + t);
@@ -5949,7 +5949,7 @@ function $i(i, t = 1e-7) {
 }
 let mt = class Ee extends Lt {
   constructor(t, e = [], { ignoreChecks: n = !1 } = {}) {
-    super(), ut(this, "contour"), ut(this, "holes"), n || Wr(t, e), this.contour = t, this.holes = e;
+    super(), ut(this, "contour"), ut(this, "holes"), n || Qr(t, e), this.contour = t, this.holes = e;
   }
   get boundingBox() {
     return this.contour.boundingBox;
@@ -5985,20 +5985,20 @@ let mt = class Ee extends Lt {
     return $i(n).map((s) => new Rt(s));
   }
 };
-function Wr(i, t = []) {
+function Qr(i, t = []) {
   if (!i) throw new Error("Figure must have a contour");
-  for (const [e, n] of We([i, ...t]))
+  for (const [e, n] of He([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 We(t))
+  for (const [e, n] of He(t))
     if (e.contains(n.firstPoint))
-      throw console.error(Vn(e), Vn(n)), new Error("Holes must not be inside other holes");
+      throw console.error(Bn(e), Bn(n)), new Error("Holes must not be inside other holes");
 }
-const Qr = (i) => {
+const Gr = (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];
@@ -6012,29 +6012,29 @@ const Qr = (i) => {
     loop: t,
     isIn: s
   };
-}), Gr = (i, t) => i.flatMap(({ loop: e }) => mn(
+}), Jr = (i, t) => i.flatMap(({ loop: e }) => fn(
   t.filter(
     ({ loop: n, isIn: s }) => n === e || s.indexOf(e) !== -1
   )
-)), Jr = (i, t) => {
-  const e = t.filter(({ isIn: s }) => s.length <= 1), n = mn(
+)), Zr = (i, t) => {
+  const e = t.filter(({ isIn: s }) => s.length <= 1), n = fn(
     Ii(i.map(({ loop: s }) => s))
   );
   return [e, ...n];
-}, mn = (i) => {
+}, fn = (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 ? Gr(t, i) : Jr(e, i);
+  return t.length === 1 && e.length === 0 ? [i] : t.length > 1 ? Jr(t, i) : Zr(e, i);
 };
 function te(i) {
-  return Qr(i).map(Ii).flatMap(mn).map((t) => {
+  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 Zr(i, t) {
+function Kr(i, t) {
   const e = [];
   for (const n of i)
     for (const s of t)
@@ -6048,10 +6048,10 @@ function* Je(i, t, e) {
     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 }));
 }
-const On = (i, t) => {
+const Nn = (i, t) => {
   const e = i.findIndex((s) => k(t, s.firstPoint)), n = i.slice(0, e);
   return i.slice(e).concat(n);
-}, zn = (i, t) => {
+}, On = (i, t) => {
   let e = i;
   const n = (o) => k(o.firstPoint, t.firstPoint) && k(o.lastPoint, t.lastPoint);
   let s = i.findIndex(n);
@@ -6067,7 +6067,7 @@ const On = (i, t) => {
   const r = e.slice(0, s);
   return e.slice(s).concat(r);
 };
-function Kr(i, t, e) {
+function to(i, t, e) {
   return i.filter((n) => {
     const s = t.filter((o) => k(o.firstPoint, n) || k(o.lastPoint, n));
     if (s.length % 2)
@@ -6076,7 +6076,7 @@ function Kr(i, t, e) {
     return !(r.every((o) => o) || !r.some((o) => o));
   });
 }
-function to(i, t, e) {
+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) => {
@@ -6096,23 +6096,23 @@ function to(i, t, e) {
   }), 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 = Kr(
+  if (n = to(
     n,
     h,
     t
   ), !n.length && !s.length) return null;
   if (s.length) {
     const m = s[0];
-    h = zn(
+    h = On(
       h,
       m
-    ), l = zn(
+    ), l = On(
       l,
       m
     );
   } else {
     const m = n[0];
-    h = On(h, m), l = On(l, m);
+    h = Nn(h, m), l = Nn(l, m);
   }
   let c = Array.from(
     Je(
@@ -6132,7 +6132,7 @@ function to(i, t, e) {
     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]);
 }
-function Dn(i) {
+function zn(i) {
   let t = i[0];
   for (const e of i.slice(1))
     t = t.extend(e);
@@ -6143,17 +6143,17 @@ function Dn(i) {
     ), new Error("Bug in the intersection algo on non closing strand");
   return new dt(t.segments);
 }
-function eo(i, t) {
+function no(i, t) {
   const e = Pt([
     t.slice(0, -1),
     t.slice(1)
-  ]).map(([s, r]) => Dn(i.slice(s, r)));
+  ]).map(([s, r]) => zn(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(Dn(n)), e;
+  return t[0] !== 0 && (n = n.concat(i.slice(0, t[0]))), e.push(zn(n)), e;
 }
-function no(i) {
+function io(i) {
   if (!i.length) return [];
   const t = i.map((s) => s.firstPoint);
   let e = i.map((s) => s.lastPoint);
@@ -6162,21 +6162,21 @@ function no(i) {
     ([s, r], o) => k(s, r) ? [] : o
   );
   try {
-    return eo(i, n);
+    return no(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));
   }
 }
-const Un = (i, t) => {
+const Dn = (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]);
-}, io = (i, t) => i.length === 0 ? [t] : k(i[0].firstPoint, t.lastPoint) ? [t.extend(i[0])].concat(i.slice(1)) : [t].concat(i);
-function gn(i, 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, {
   firstInside: e,
   secondInside: n
 }) {
-  const s = to(i, t);
+  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);
     return {
@@ -6193,36 +6193,36 @@ function gn(i, t, {
     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 = Un(c, h));
+    (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 = Un(c, M), r = null) : c = [M];
+      u += 1, u === 2 && c.length ? (c = Dn(c, M), r = null) : c = [M];
     }
-    return o === null && u === 1 && r && (c = io(c, r)), u === 1 && (o = u, r = null), c.length ? c : (r = null, []);
+    return o === null && u === 1 && r && (c = so(c, r)), u === 1 && (o = u, r = null), c.length ? c : (r = null, []);
   });
-  return no(a);
+  return io(a);
 }
-const so = (i, t) => {
-  const e = gn(i, t, {
+const ro = (i, t) => {
+  const e = mn(i, t, {
     firstInside: "remove",
     secondInside: "remove"
   });
   return Array.isArray(e) ? e : e.identical ? [i] : e.firstCurveInSecond ? [t] : e.secondCurveInFirst ? [i] : [i, t];
 }, Ce = (i, t) => {
-  const e = gn(i, t, {
+  const e = mn(i, t, {
     firstInside: "remove",
     secondInside: "keep"
   });
   return Array.isArray(e) ? e : e.identical ? [] : e.firstCurveInSecond ? [] : e.secondCurveInFirst ? [i, t] : [i];
-}, pn = (i, t) => {
-  const e = gn(i, t, {
+}, gn = (i, t) => {
+  const e = mn(i, t, {
     firstInside: "keep",
     secondInside: "keep"
   });
   return Array.isArray(e) ? e : e.identical ? [i] : e.firstCurveInSecond ? [i] : e.secondCurveInFirst ? [t] : [];
 };
-function ro(i) {
+function oo(i) {
   const t = /* @__PURE__ */ new Map(), e = [];
   return i.forEach((n, s) => {
     let r;
@@ -6239,8 +6239,8 @@ function ro(i) {
   }), e.flatMap(({ current: n }) => n);
 }
 function _i(i, t) {
-  const e = so(i.contour, t.contour), n = t.holes.flatMap((o) => Ce(o, i.contour)), s = i.holes.flatMap((o) => Ce(o, t.contour)), r = Zr(i.holes, t.holes).flatMap(
-    ([o, a]) => pn(o, a)
+  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)
   );
   return te([
     ...e,
@@ -6254,7 +6254,7 @@ function Te(i, t) {
     return te(Ce(i.contour, t.contour));
   if (i.isFull) {
     const n = Ce(i.contour, t.contour), s = t.holes.flatMap(
-      (r) => pn(r, i.contour)
+      (r) => gn(r, i.contour)
     );
     return te([...n, ...s]);
   } else if (t.isFull && !i.contour.intersects(t.contour))
@@ -6274,8 +6274,8 @@ function Te(i, t) {
     e = e.flatMap((s) => Te(s, new mt(n)));
   }), e;
 }
-function oo(i, t) {
-  const e = pn(i.contour, t.contour);
+function ao(i, t) {
+  const e = gn(i.contour, t.contour);
   if (!e.length) return [];
   let n = te(e);
   return n = Xt(
@@ -6290,7 +6290,7 @@ function se(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 ro([...i, ...t]);
+    return oo([...i, ...t]);
   if (i.length > 1 && t.length > 1) {
     let e = se([i[0]], t);
     return i.slice(1).forEach((n) => {
@@ -6312,11 +6312,11 @@ function Xt(i, t) {
   }), e;
 }
 function Ze(i, t) {
-  return !i.length || !t.length ? [] : i.length === 1 && t.length === 1 ? oo(i[0], t[0]) : i.length > 1 ? i.flatMap((e) => Ze([e], t)) : t.flatMap((e) => Ze(i, [e]));
+  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]));
 }
 let ae = class Tt extends Lt {
   constructor(t = [], { ignoreChecks: e = !1 } = {}) {
-    super(), ut(this, "figures"), ut(this, "_boundingBox", null), e || ao(t), this.figures = t;
+    super(), ut(this, "figures"), ut(this, "_boundingBox", null), e || ho(t), this.figures = t;
   }
   get isEmpty() {
     return this.figures.length === 0;
@@ -6360,12 +6360,12 @@ let ae = class Tt extends Lt {
     return new Tt(Ze(this.figures, t.figures));
   }
 };
-function ao(i) {
-  for (const [t, e] of We(i))
+function ho(i) {
+  for (const [t, e] of He(i))
     if (t.intersects(e))
       throw new Error("Diagram figures must not intersect");
 }
-var ho = Object.defineProperty, lo = (i, t, e) => t in i ? ho(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e, xe = (i, t, e) => lo(i, typeof t != "symbol" ? t + "" : t, e);
+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) => {
   const n = bt(i.V, t.V), s = i.precision * t.precision;
   if (n * n < s)
@@ -6378,23 +6378,23 @@ class $e {
     this.firstPoint = t, this.lastPoint = e;
   }
 }
-function Yn(i, t) {
+function Un(i, t) {
   if (i instanceof D)
-    return uo(i, t);
-  if (i instanceof z)
     return co(i, t);
-  if (i instanceof et || i instanceof rt)
+  if (i instanceof z)
     return fo(i, t);
+  if (i instanceof et || i instanceof rt)
+    return mo(i, t);
   throw new Error("Not implemented");
 }
-function uo(i, t) {
+function co(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 co(i, t) {
+function fo(i, t) {
   const e = X(
     i.firstPoint,
     Q(nt(i.tangentAtFirstPoint), t)
@@ -6423,7 +6423,7 @@ function De(i, t, e, n, s) {
     );
   return r;
 }
-function fo(i, t) {
+function mo(i, t) {
   const { firstPoint: e, lastPoint: n, normalAtFirstPoint: s, normalAtLastPoint: r } = i, o = Fi(
     { V: s, firstPoint: e, precision: i.precision },
     { V: r, firstPoint: n, precision: i.precision }
@@ -6481,7 +6481,7 @@ function Li(i, t, e) {
     t.tangentAtFirstPoint
   );
   if (Math.abs(n) < 1e-10) return null;
-  const s = n > 0 ? 1 : -1, r = Math.abs(e) * s, o = Yn(i, r), a = Yn(t, r);
+  const s = n > 0 ? 1 : -1, r = Math.abs(e) * s, o = Un(i, r), a = Un(t, r);
   if (o instanceof $e || a instanceof $e)
     return null;
   let h;
@@ -6498,7 +6498,7 @@ function Li(i, t, e) {
   }, [u] = c(i, o), [, m] = c(t, a);
   return { first: u, second: m, center: l };
 }
-function Xn(i, t, e) {
+function Yn(i, t, e) {
   const n = Li(i, t, e);
   if (!n)
     return console.warn(
@@ -6509,11 +6509,11 @@ function Xn(i, t, e) {
   const { first: s, second: r } = n;
   return [
     s,
-    hi(s.lastPoint, r.firstPoint, s.tangentAtLastPoint),
+    ai(s.lastPoint, r.firstPoint, s.tangentAtLastPoint),
     r
   ];
 }
-function Hn(i, t, e) {
+function Xn(i, t, e) {
   const n = Li(i, t, e);
   if (!n)
     return console.warn(
@@ -6524,7 +6524,7 @@ function Hn(i, t, e) {
   const { first: s, second: r } = n;
   return [s, new D(s.lastPoint, r.firstPoint), r];
 }
-const mo = (i) => {
+const go = (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 {
@@ -6541,7 +6541,7 @@ const mo = (i) => {
 function Wn(i, { ignoreChecks: t = !1 } = {}) {
   return new ae([new mt(new dt([...i], { ignoreChecks: t }))]);
 }
-class go {
+let po = 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;
   }
@@ -6559,7 +6559,7 @@ class go {
       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" ? Hn : Xn;
+    const n = this._nextCorner.mode === "chamfer" ? Xn : Yn;
     return this.pendingSegments.push(
       ...n(e, t, this._nextCorner.radius)
     ), this._nextCorner = null, this;
@@ -6647,7 +6647,7 @@ class go {
     if (!n)
       throw new Error("You need a previous curve to sketch a tangent arc");
     return this.saveSegment(
-      hi(
+      ai(
         this.pointer,
         t,
         e ?? n.tangentAtLastPoint
@@ -6674,7 +6674,7 @@ class go {
     );
   }
   halfEllipseTo(t, e) {
-    const [n, s] = ri(q(t, this.pointer));
+    const [n, s] = si(q(t, this.pointer));
     return this.ellipseTo(
       t,
       n / 2,
@@ -6699,7 +6699,7 @@ class go {
     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 } = mo(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 } = go(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,7 +6730,7 @@ class go {
     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" ? Hn : Xn;
+    const r = e === "chamfer" ? Xn : Yn;
     this.pendingSegments.push(...r(n, s, t));
   }
   close(t = !1) {
@@ -6764,14 +6764,14 @@ class go {
     var t;
     return k(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
   }
-}
+};
 function Bi(i = [0, 0]) {
-  return new go(i);
+  return new po(i);
 }
 function kt([i, t]) {
   return `${i} ${t}`;
 }
-function wn(i) {
+function pn(i) {
   if (i instanceof D)
     return `L ${kt(i.lastPoint)}`;
   if (i instanceof z)
@@ -6792,34 +6792,34 @@ function wn(i) {
   throw new Error("Unknown segment type");
 }
 function Vi(i) {
-  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(wn).join(" ");
+  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(pn).join(" ");
   return `${t} ${e} Z`;
 }
 function ji(i) {
   return `<path d="${i.allLoops.map(Vi).join(" ")}" />`;
 }
-function po(i) {
+function wo(i) {
   return `<g>
   ${i.figures.map(ji).join(`
 `)}
 </g>`;
 }
-function wo(i) {
-  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(wn).join(" ");
+function Po(i) {
+  const t = `M ${i.firstPoint.join(" ")}`, e = i.segments.map(pn).join(" ");
   return `${t} ${e}`;
 }
-function Po(i, t = 1) {
+function Mo(i, t = 1) {
   const e = i.xMin - t, n = i.yMin - t;
   return `${e} ${n} ${i.width + 2 * t} ${i.height + 2 * t}`;
 }
-function Qn(i, t, e = 1, n) {
-  const s = Po(t, e), r = n ? `width="${t.width + 2 * e}${n}" height="${t.height + 2 * e}${n}"` : "";
+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}"` : "";
   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="black" stroke-width="0.2%" vector-effect="non-scaling-stroke" ${r}>
+<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 Gn(i) {
+function Qn(i) {
   if (i instanceof mt)
     return [i];
   if (i instanceof dt)
@@ -6861,71 +6861,71 @@ function Ni(i, t, e = !1) {
     return t.onStroke(s) ? !e : !t.contains(s);
   });
 }
-function Mo(i, t, e = !1) {
+function yo(i, t, e = !1) {
   return qi(t, i).filter((n) => {
     const s = n.segments[0].midPoint;
     return t.onStroke(s) ? !e : t.contains(s);
   });
 }
-function Jn(i, t, e = !1) {
+function Gn(i, t, e = !1) {
   const n = Ni(
     i,
     t.contour,
     e
   ), s = t.holes.flatMap(
-    (r) => Mo(i, r, e)
+    (r) => yo(i, r, e)
   );
   return [...n, ...s];
 }
-function yo(i, t) {
+function bo(i, t) {
   return new ae(
-    Xt(Gn(i), Gn(t))
+    Xt(Qn(i), Qn(t))
   );
 }
 function Ue(i, t, e = !0) {
   if (t instanceof dt)
     return Ni(i, t, e);
   if (t instanceof mt)
-    return Jn(i, t, e);
+    return Gn(i, t, e);
   let n = [new Rt([...i.segments])];
   return t.figures.forEach((s) => {
-    n = n.flatMap((r) => Jn(r, s, e));
+    n = n.flatMap((r) => Gn(r, s, e));
   }), n;
 }
-function Zn(i) {
+function Jn(i) {
   if (i instanceof ae)
-    return po(i);
+    return wo(i);
   if (i instanceof mt)
     return ji(i);
   if (i instanceof dt)
     return `<path d="${Vi(i)}" />`;
   if (i instanceof Rt)
-    return `<path d="${wo(i)}" />`;
-  if (Ri(i))
-    return `<path d="${`M ${i.firstPoint.join(" ")}`} ${wn(
+    return `<path d="${Po(i)}" />`;
+  if (ki(i))
+    return `<path d="${`M ${i.firstPoint.join(" ")}`} ${pn(
       i
     )}" />`;
   throw new Error("Unknown shape type");
 }
-const Kn = (i) => "shape" in i ? i.shape : i, ti = (i, t) => {
+const Zn = (i) => "shape" in i ? i.shape : i, Kn = (i, t) => {
   if (!("shape" in i)) return t;
   const { color: e } = i;
   return e ? `<g stroke="${e}">${t}</g>` : t;
-}, ei = (i) => new re(i.xMin, -i.yMax, i.xMax, -i.yMin);
-function bo(i, {
+}, ti = (i) => new re(i.xMin, -i.yMax, i.xMax, -i.yMin);
+function xo(i, {
   margin: t = 1,
   unit: e = null,
   viewBox: n
 } = {}) {
   if (Array.isArray(i)) {
-    const r = i.map((h) => Kn(h).mirror()), o = r.map((h, l) => ti(i[l], Zn(h))).join(`
+    const r = i.map((h) => Zn(h).mirror()), o = r.map((h, l) => Kn(i[l], Jn(h))).join(`
 `), a = r.slice(1).reduce((h, l) => h.merge(l.boundingBox), r[0].boundingBox);
-    return Qn(o, n ? ei(n) : a, t, e);
+    return Hn(o, n ? ti(n) : a, t, e);
   }
-  const s = Kn(i).mirror();
-  return Qn(
-    ti(i, Zn(s)),
-    n ? ei(n) : s.boundingBox,
+  const s = Zn(i).mirror();
+  return Hn(
+    Kn(i, Jn(s)),
+    n ? ti(n) : s.boundingBox,
     t,
     e
   );
@@ -6969,7 +6969,7 @@ class Jt extends Lt {
     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;
   }
   cutShape(e) {
-    return this.body = yo(this.body, e), this.cutLines = this.cutLines.flatMap(
+    return this.body = bo(this.body, e), this.cutLines = this.cutLines.flatMap(
       (n) => Ue(n, e, !0)
     ), this.eraseFolds(e), this;
   }
@@ -6997,10 +6997,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" })
-    ), bo(e, { unit: "mm" });
+    ), xo(e, { unit: "mm" });
   }
 }
-function dn(i, t, {
+function wn(i, t, {
   fillet: e = 1,
   contraction: n = 1,
   contractionMode: s = "rounded",
@@ -7012,11 +7012,11 @@ function dn(i, t, {
   const l = r ?? n, c = o ?? n, u = Bi([-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 xo(i, t, e = {}) {
-  return dn(i, t, e);
-}
 function vo(i, t, e = {}) {
-  return dn(i, t, e).mirror("x");
+  return wn(i, t, e);
+}
+function Ao(i, t, e = {}) {
+  return wn(i, t, e).mirror("x");
 }
 function Oi(i, t, {
   contractionTop: e,
@@ -7025,7 +7025,7 @@ function Oi(i, t, {
   bottomContractionMode: r,
   ...o
 } = {}) {
-  return dn(i, t, {
+  return wn(i, t, {
     contractionLeft: e,
     contractionRight: n,
     leftContractionMode: s,
@@ -7033,15 +7033,15 @@ function Oi(i, t, {
     ...o
   }).rotate(90);
 }
-function Ao(i, t, e = {}) {
+function Eo(i, t, e = {}) {
   return Oi(i, t, e).mirror("y");
 }
-const _o = {
-  right: Ao,
+const Lo = {
+  right: Eo,
   left: Oi,
-  top: xo,
-  bottom: vo
-}, ni = (i, t) => Bi([-i / 2, 0]).line(t, -t).hLine(i - 2 * t).line(t, t);
+  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 {
   constructor(e, n = 0.2) {
     super();
@@ -7052,8 +7052,8 @@ class Ke extends Lt {
       this.cut = e.cut, this.unfold = e.unfold, this.bump = e.bump;
       return;
     }
-    const s = ni(e, n * 2.5);
-    this.cut = s.asStrand(), this.unfold = s.close(), this.bump = ni(e - 5 * n, 5 * n).close().mirror("x");
+    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");
   }
   clone() {
     return new Ke(this);
@@ -7086,7 +7086,7 @@ class Le extends Lt {
     return this.points.map((e) => t.clone().translateTo(e));
   }
 }
-function Fo(i, t, e = 3, n = 0) {
+function Bo(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(
@@ -7099,7 +7099,7 @@ function Fo(i, t, e = 3, n = 0) {
     );
   return new Le(a.map((h) => [h, 0]));
 }
-function Lo(i, t, e = "x") {
+function Vo(i, t, e = "x") {
   const n = i * (t - 1), s = [];
   for (let r = 0; r < t; r++)
     s.push(r * i - n / 2);
@@ -7110,12 +7110,12 @@ function Lo(i, t, e = "x") {
 export {
   Jt as Dieline,
   Ke as FoldLockBump,
-  vo as bottomFlap,
-  _o as drawFlaps,
+  Ao as bottomFlap,
+  Lo as drawFlaps,
   Oi as leftFlap,
-  Fo as linearDistribution,
-  Lo as linearSpread,
-  Ao as rightFlap,
-  xo as topFlap
+  Bo as linearDistribution,
+  Vo as linearSpread,
+  Eo as rightFlap,
+  vo as topFlap
 };
 //# sourceMappingURL=dielines.js.map