replicad-pantograph 0.10.2 → 0.11.0

package/dist/studio/replicad-pantograph.js

@@ -5,17 +5,17 @@ var Me = (r) => {
   throw TypeError(r);
 };
 var Be = (r, s, t) => s in r ? Oe(r, s, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[s] = t;
-var q$2 = (r, s, t) => Be(r, typeof s != "symbol" ? s + "" : s, t), oe$1 = (r, s, t) => s.has(r) || Me("Cannot " + t);
-var ht$2 = (r, s, t) => (oe$1(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le$1 = (r, s, t) => s.has(r) ? Me("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt$1 = (r, s, t, e) => (oe$1(r, s, "write to private field"), s.set(r, t), t), he = (r, s, t) => (oe$1(r, s, "access private method"), t);
-function zt(r, s, t, e) {
+var q$1 = (r, s, t) => Be(r, typeof s != "symbol" ? s + "" : s, t), oe$1 = (r, s, t) => s.has(r) || Me("Cannot " + t);
+var ht$3 = (r, s, t) => (oe$1(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le$1 = (r, s, t) => s.has(r) ? Me("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt$2 = (r, s, t, e) => (oe$1(r, s, "write to private field"), s.set(r, t), t), he = (r, s, t) => (oe$1(r, s, "access private method"), t);
+function zt$1(r, s, t, e) {
   return r <= e && s >= t;
 }
 let mt$1 = class mt {
   constructor(s = 1 / 0, t = 1 / 0, e = -1 / 0, n = -1 / 0) {
-    q$2(this, "xMin");
-    q$2(this, "yMin");
-    q$2(this, "xMax");
-    q$2(this, "yMax");
+    q$1(this, "xMin");
+    q$1(this, "yMin");
+    q$1(this, "xMax");
+    q$1(this, "yMax");
     this.xMin = s, this.yMin = t, this.xMax = e, this.yMax = n;
   }
   get width() {
@@ -37,10 +37,10 @@ let mt$1 = class mt {
   }
   contains(s) {
     const [t, e] = s;
-    return zt(this.xMin, this.xMax, t, t) && zt(this.yMin, this.yMax, e, e);
+    return zt$1(this.xMin, this.xMax, t, t) && zt$1(this.yMin, this.yMax, e, e);
   }
   overlaps(s) {
-    return zt(this.xMin, this.xMax, s.xMin, s.xMax) && zt(this.yMin, this.yMax, s.yMin, s.yMax);
+    return zt$1(this.xMin, this.xMax, s.xMin, s.xMax) && zt$1(this.yMin, this.yMax, s.yMin, s.yMax);
   }
   addPoint(s) {
     const [t, e] = s;
@@ -85,21 +85,21 @@ function Te(r, s = 1e-9) {
     ).values()
   );
 }
-const fe$1 = Math.PI / 180, Ue = 180 / Math.PI, Z$1 = (r) => `[${r[0]}, ${r[1]}]`, Y$2 = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it$3 = ([r, s], [t, e]) => [r + t, s + e], Q$2 = ([r, s], [t, e]) => [r - t, s - e], It$2 = ([r, s]) => r * r + s * s, an$1 = ([r, s]) => Math.sqrt(It$2([r, s])), nt$2 = ([r, s], t) => [r * t, s * t], Rt$1 = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J$3 = (r, s = [0, 0]) => Math.sqrt(Rt$1(r, s));
-function St$2([r, s], [t, e]) {
+const fe$1 = Math.PI / 180, Ue = 180 / Math.PI, Z$2 = (r) => `[${r[0]}, ${r[1]}]`, Y$3 = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it$2 = ([r, s], [t, e]) => [r + t, s + e], Q$2 = ([r, s], [t, e]) => [r - t, s - e], It$1 = ([r, s]) => r * r + s * s, an = ([r, s]) => Math.sqrt(It$1([r, s])), nt$2 = ([r, s], t) => [r * t, s * t], Rt$2 = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J$3 = (r, s = [0, 0]) => Math.sqrt(Rt$2(r, s));
+function St$1([r, s], [t, e]) {
   return r * e - s * t;
 }
 function Pe([r, s], [t, e]) {
   return r * t + s * e;
 }
-function un$1([r, s], [t, e] = [0, 0]) {
+function un([r, s], [t, e] = [0, 0]) {
   return Math.atan2(e * r - s * t, r * t + s * e);
 }
 function H$1([r, s]) {
   const t = J$3([r, s]);
   return [r / t, s / t];
 }
-function Tt(r, s) {
+function Tt$1(r, s) {
   const t = Math.cos(s) * r, e = Math.sin(s) * r;
   return [t, e];
 }
@@ -111,7 +111,7 @@ function We(r) {
   return [s, t];
 }
 function Ie(r, s, t = 1e-9) {
-  const e = St$2(r, s), n = It$2(r), i = It$2(s);
+  const e = St$1(r, s), n = It$1(r), i = It$1(s);
   return e * e < n * i * t * t;
 }
 function tt$3(r) {
@@ -121,9 +121,9 @@ function Qt$1(r) {
   return [r[1], -r[0]];
 }
 function Qe(r, s, t) {
-  return Y$2(t, r) || Ie(Q$2(t, r), s);
+  return Y$3(t, r) || Ie(Q$2(t, r), s);
 }
-const Mt$2 = (r, s) => {
+const Mt$1 = (r, s) => {
   const [t, e, n, i, o, l, h, a, u] = r, [c, g, d, w, p, P, f, M, E] = s;
   return [
     t * c + e * w + n * f,
@@ -155,7 +155,7 @@ const Mt$2 = (r, s) => {
 };
 let et$4 = class et {
   constructor(s) {
-    q$2(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]);
+    q$1(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]);
     s && (this._matrix = [...s]);
   }
   clone() {
@@ -168,27 +168,27 @@ let et$4 = class et {
     return this._matrix = Ge(this._matrix), this;
   }
   translate(s, t) {
-    return this._matrix = Mt$2([1, 0, s, 0, 1, t, 0, 0, 1], this._matrix), this;
+    return this._matrix = Mt$1([1, 0, s, 0, 1, t, 0, 0, 1], this._matrix), this;
   }
   rotate(s, t) {
     const e = Math.cos(s), n = Math.sin(s), i = [e, -n, 0, n, e, 0, 0, 0, 1];
-    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$2(i, this._matrix), t && this.translate(t[0], t[1]), this;
+    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$1(i, this._matrix), t && this.translate(t[0], t[1]), this;
   }
   mirrorX() {
-    return this._matrix = Mt$2([1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), this;
+    return this._matrix = Mt$1([1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), this;
   }
   mirrorY() {
-    return this._matrix = Mt$2([-1, 0, 0, 0, 1, 0, 0, 0, 1], this._matrix), this;
+    return this._matrix = Mt$1([-1, 0, 0, 0, 1, 0, 0, 0, 1], this._matrix), this;
   }
   mirrorLine(s, t) {
     const [e, n] = s, i = Math.atan2(n, e);
     return t && this.translate(-t[0], -t[1]), this.rotate(-i), this.mirrorX(), this.rotate(i), t && this.translate(t[0], t[1]), this;
   }
   mirrorCenter(s) {
-    return s && this.translate(-s[0], -s[1]), this._matrix = Mt$2([-1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), s && this.translate(s[0], s[1]), this;
+    return s && this.translate(-s[0], -s[1]), this._matrix = Mt$1([-1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), s && this.translate(s[0], s[1]), this;
   }
   scale(s, t) {
-    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$2([s, 0, 0, 0, s, 0, 0, 0, 1], this._matrix), t && this.translate(t[0], t[1]), this;
+    return t && this.translate(-t[0], -t[1]), this._matrix = Mt$1([s, 0, 0, 0, s, 0, 0, 0, 1], this._matrix), t && this.translate(t[0], t[1]), this;
   }
   transform(s) {
     const [t, e] = s, [n, i, o, l, h, a] = this._matrix;
@@ -244,14 +244,14 @@ class Ze {
     return s === "x" ? e.mirrorX() : s === "y" ? e.mirrorY() : e.mirrorLine(s, t), this.transform(e);
   }
 }
-let xt$1 = class xt extends Ze {
+let xt$2 = class xt extends Ze {
   constructor(t, e) {
     super();
-    q$2(this, "precision", 1e-9);
+    q$1(this, "precision", 1e-9);
     this.firstPoint = t, this.lastPoint = e, this.firstPoint = t, this.lastPoint = e;
   }
   get repr() {
-    return `${this.segmentType} ${Z$1(this.firstPoint)} - ${Z$1(
+    return `${this.segmentType} ${Z$2(this.firstPoint)} - ${Z$2(
       this.lastPoint
     )}`;
   }
@@ -262,27 +262,27 @@ let xt$1 = class xt extends Ze {
     return this.repr;
   }
 };
-let at$3 = class at extends xt$1 {
+let at$3 = class at extends xt$2 {
   constructor() {
     super(...arguments);
-    q$2(this, "segmentType", "LINE");
-    q$2(this, "_V", null);
-    q$2(this, "_slope", null);
-    q$2(this, "_yIntercept", null);
-    q$2(this, "_boundingBox", null);
+    q$1(this, "segmentType", "LINE");
+    q$1(this, "_V", null);
+    q$1(this, "_slope", null);
+    q$1(this, "_yIntercept", null);
+    q$1(this, "_boundingBox", null);
   }
   isValidParameter(t) {
     const e = this.length * this.precision;
     return t >= -e && 1 - t >= -e;
   }
   paramPoint(t) {
-    return it$3(this.firstPoint, nt$2(this.V, t));
+    return it$2(this.firstPoint, nt$2(this.V, t));
   }
   get length() {
     return J$3(this.firstPoint, this.lastPoint);
   }
   get squareLength() {
-    return Rt$1(this.firstPoint, this.lastPoint);
+    return Rt$2(this.firstPoint, this.lastPoint);
   }
   get V() {
     return this._V === null && (this._V = Q$2(this.lastPoint, this.firstPoint)), this._V;
@@ -298,10 +298,10 @@ let at$3 = class at extends xt$1 {
     return this._yIntercept === null && (this._yIntercept = this.firstPoint[1] - this.slope * this.firstPoint[0]), this._yIntercept;
   }
   get midPoint() {
-    return it$3(this.firstPoint, nt$2(this.V, 0.5));
+    return it$2(this.firstPoint, nt$2(this.V, 0.5));
   }
   isSame(t) {
-    return t instanceof at ? Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) || Y$2(this.lastPoint, t.firstPoint) && Y$2(this.firstPoint, t.lastPoint) : !1;
+    return t instanceof at ? Y$3(this.firstPoint, t.firstPoint) && Y$3(this.lastPoint, t.lastPoint) || Y$3(this.lastPoint, t.firstPoint) && Y$3(this.firstPoint, t.lastPoint) : !1;
   }
   clone() {
     return new at(this.firstPoint, this.lastPoint);
@@ -327,7 +327,7 @@ let at$3 = class at extends xt$1 {
     return J$3(t, i);
   }
   isOnSegment(t) {
-    if (Y$2(t, this.firstPoint, this.precision)) return !0;
+    if (Y$3(t, this.firstPoint, this.precision)) return !0;
     const e = Q$2(t, this.firstPoint);
     if (!Ie(this.V, e)) return !1;
     const n = Pe(e, this.V) / this.squareLength;
@@ -356,7 +356,7 @@ let at$3 = class at extends xt$1 {
     Array.isArray(t[0]) ? e = t : e = [t], e.forEach((a) => {
       if (!this.isOnSegment(a))
         throw new Error(
-          `Point ${Z$1(a)} is not on segment ${this.repr}`
+          `Point ${Z$2(a)} is not on segment ${this.repr}`
         );
     });
     const n = [this.firstPoint, ...e, this.lastPoint], i = Te(n), o = this.lastPoint[0] - this.firstPoint[0];
@@ -387,16 +387,16 @@ function Zt(r, s, t, e = 1e-9) {
   return t && (n = -n), n < 0 && (n += 2 * Math.PI), n > 2 * Math.PI - e ? 0 : n;
 }
 const me = (r, s, t) => {
-  const e = St$2(r.V, s.V), n = It$2(r.V), i = It$2(s.V), o = t ? t * t : r.precision * s.precision;
+  const e = St$1(r.V, s.V), n = It$1(r.V), i = It$1(s.V), o = t ? t * t : r.precision * s.precision;
   if (e * e < n * i * o)
     return "parallel";
-  const l = Q$2(s.firstPoint, r.firstPoint), h = St$2(l, s.V) / e, a = St$2(l, r.V) / e;
+  const l = Q$2(s.firstPoint, r.firstPoint), h = St$1(l, s.V) / e, a = St$1(l, r.V) / e;
   return {
     intersectionParam1: h,
     intersectionParam2: a
   };
 };
-function cn$1(r, s, t = !1, e) {
+function cn(r, s, t = !1, e) {
   const n = me(r, s, e);
   if (n === "parallel") {
     if (!t) return null;
@@ -419,37 +419,37 @@ function cn$1(r, s, t = !1, e) {
   const { intersectionParam1: i, intersectionParam2: o } = n;
   return !r.isValidParameter(i) || !s.isValidParameter(o) ? null : r.paramPoint(i);
 }
-const Ot$1 = (r, s) => {
+const Ot$2 = (r, s) => {
   const t = Q$2(r, s);
   return We(t);
 };
-let ct$3 = class ct extends xt$1 {
+let ct$3 = class ct extends xt$2 {
   constructor(t, e, n, i = !1, { ignoreChecks: o = !1 } = {}) {
     super(t, e);
-    q$2(this, "segmentType", "ARC");
-    q$2(this, "center");
-    q$2(this, "clockwise");
-    q$2(this, "_coefficients", null);
-    q$2(this, "_angularLength", null);
-    q$2(this, "_radius", null);
-    q$2(this, "_firstAngle", null);
-    q$2(this, "_lastAngle", null);
-    q$2(this, "_boundingBox", null);
+    q$1(this, "segmentType", "ARC");
+    q$1(this, "center");
+    q$1(this, "clockwise");
+    q$1(this, "_coefficients", null);
+    q$1(this, "_angularLength", null);
+    q$1(this, "_radius", null);
+    q$1(this, "_firstAngle", null);
+    q$1(this, "_lastAngle", null);
+    q$1(this, "_boundingBox", null);
     if (this.center = n, this.clockwise = i, !o) {
-      if (Y$2(t, e))
+      if (Y$3(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (Math.abs(this.radius - J$3(this.lastPoint, this.center)) > this.precision)
         throw new Error(
-          `Invalid arc, radius does not match between ${Z$1(
+          `Invalid arc, radius does not match between ${Z$2(
             t
-          )} and ${Z$1(e)}} (center ${Z$1(n)})`
+          )} and ${Z$2(e)}} (center ${Z$2(n)})`
         );
     }
   }
   get info() {
-    return `ARC(${Z$1(this.firstPoint)}, ${Z$1(
+    return `ARC(${Z$2(this.firstPoint)}, ${Z$2(
       this.lastPoint
-    )}, ${Z$1(this.center)}, ${this.clockwise ? "CW" : "CCW"})`;
+    )}, ${Z$2(this.center)}, ${this.clockwise ? "CW" : "CCW"})`;
   }
   get coefficients() {
     if (this._coefficients === null) {
@@ -479,24 +479,24 @@ let ct$3 = class ct extends xt$1 {
     )), this._angularLength;
   }
   paramPoint(t) {
-    return it$3(
+    return it$2(
       this.center,
-      Tt(
+      Tt$1(
         this.radius,
         this.firstAngle + t * this.angularLength * (this.clockwise ? -1 : 1)
       )
     );
   }
   pointToParam(t) {
-    const [e, n] = Ot$1(t, this.center);
+    const [e, n] = Ot$2(t, this.center);
     if (Math.abs(e - this.radius) > this.precision)
       throw new Error(
-        `Point ${Z$1(t)} is not on segment ${this.repr}`
+        `Point ${Z$2(t)} is not on segment ${this.repr}`
       );
     const i = this.angleToParam(n);
     if (!this.isValidParameter(i))
       throw new Error(
-        `Point ${Z$1(t)} is not on segment ${this.repr}`
+        `Point ${Z$2(t)} is not on segment ${this.repr}`
       );
     return i;
   }
@@ -527,7 +527,7 @@ let ct$3 = class ct extends xt$1 {
     return this.paramPoint(0.5);
   }
   isSame(t) {
-    return !(t instanceof ct) || !Y$2(this.center, t.center) ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y$2(this.lastPoint, t.firstPoint) && Y$2(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
+    return !(t instanceof ct) || !Y$3(this.center, t.center) ? !1 : Y$3(this.firstPoint, t.firstPoint) && Y$3(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y$3(this.lastPoint, t.firstPoint) && Y$3(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
   }
   clone() {
     return new ct(
@@ -558,18 +558,18 @@ let ct$3 = class ct extends xt$1 {
     return this._boundingBox;
   }
   distanceFrom(t) {
-    const [e, n] = Ot$1(t, this.center);
+    const [e, n] = Ot$2(t, this.center);
     return this.isValidParameter(this.angleToParam(n)) ? Math.abs(e - this.radius) : Math.sqrt(
       Math.min(
-        Rt$1(t, this.firstPoint),
-        Rt$1(t, this.lastPoint)
+        Rt$2(t, this.firstPoint),
+        Rt$2(t, this.lastPoint)
       )
     );
   }
   isOnSegment(t) {
-    if (Y$2(t, this.firstPoint) || Y$2(t, this.lastPoint))
+    if (Y$3(t, this.firstPoint) || Y$3(t, this.lastPoint))
       return !0;
-    const [e, n] = Ot$1(t, this.center);
+    const [e, n] = Ot$2(t, this.center);
     if (Math.abs(e - this.radius) > this.precision) return !1;
     const i = this.angleToParam(n);
     return this.isValidParameter(i);
@@ -579,21 +579,21 @@ let ct$3 = class ct extends xt$1 {
     return this.clockwise ? [-i, -o] : [i, o];
   }
   tangentAt(t) {
-    const [e, n] = Ot$1(t, this.center);
+    const [e, n] = Ot$2(t, this.center);
     if (Math.abs(e - this.radius) > this.precision)
       throw new Error("Point is not on the arc");
     const i = this.angleToParam(n);
     if (!this.isValidParameter(i))
       throw new Error("Point is not on the arc");
-    const o = Tt(1, n);
+    const o = Tt$1(1, n);
     return (this.clockwise ? Qt$1 : tt$3)(H$1(o));
   }
   get tangentAtFirstPoint() {
-    const t = Tt(1, this.firstAngle);
+    const t = Tt$1(1, this.firstAngle);
     return (this.clockwise ? Qt$1 : tt$3)(H$1(t));
   }
   get tangentAtLastPoint() {
-    const t = Tt(1, this.lastAngle);
+    const t = Tt$1(1, this.lastAngle);
     return (this.clockwise ? Qt$1 : tt$3)(H$1(t));
   }
   splitAt(t) {
@@ -629,21 +629,21 @@ let ct$3 = class ct extends xt$1 {
     );
   }
 };
-function fn$1(r, s, t) {
+function fn(r, s, t) {
   const e = new at$3(s, r), n = new at$3(s, t), i = tt$3(e.tangentAtFirstPoint), o = tt$3(n.tangentAtLastPoint), l = me(
     { firstPoint: e.midPoint, V: i, precision: 1e-9 },
     { firstPoint: n.midPoint, V: o, precision: 1e-9 }
   );
   if (l === "parallel")
     throw new Error("Cannot create an arc from three colinear points");
-  const h = St$2(
+  const h = St$1(
     Q$2(r, s),
     Q$2(t, s)
   ) > 0;
   return new ct$3(
     r,
     t,
-    it$3(e.midPoint, nt$2(i, l.intersectionParam1)),
+    it$2(e.midPoint, nt$2(i, l.intersectionParam1)),
     h,
     { ignoreChecks: !0 }
   );
@@ -659,21 +659,21 @@ function mn$2(r, s, t) {
   );
   if (i === "parallel")
     throw new Error("Cannot create an arc from three colinear points");
-  const o = it$3(
+  const o = it$2(
     e.midPoint,
     nt$2(n, i.intersectionParam1)
-  ), l = St$2(
+  ), l = St$1(
     Q$2(o, r),
-    Q$2(o, it$3(r, t))
+    Q$2(o, it$2(r, t))
   ) < 0;
   return new ct$3(r, s, o, l, {
     ignoreChecks: !0
   });
 }
-const be = 1e-21, Bt$1 = 1.618034;
+const be = 1e-21, Bt$2 = 1.618034;
 function Ee(r, s = 0, t = 1, e = 110, n = 1e3) {
   let i, o, l, h, a, u, c, g, d, w, p, P, f;
-  for (o = r(s), l = r(t), o < l && ([s, t] = [t, s], [o, l] = [l, o]), f = t + Bt$1 * (t - s), h = r(f), a = 3, c = 0; h < l; ) {
+  for (o = r(s), l = r(t), o < l && ([s, t] = [t, s], [o, l] = [l, o]), f = t + Bt$2 * (t - s), h = r(f), a = 3, c = 0; h < l; ) {
     if (g = (t - s) * (l - h), d = (t - f) * (l - o), w = d - g, Math.abs(w) < be ? i = 2 * be : i = 2 * w, p = t - ((t - f) * d - (t - s) * g) / i, P = t + e * (f - t), c > n)
       throw new Error("Too many iterations.");
     if (c += 1, (p - f) * (t - p) > 0) {
@@ -681,9 +681,9 @@ function Ee(r, s = 0, t = 1, e = 110, n = 1e3) {
         return s = t, t = p, o = l, l = u, [s, t, f, o, l, h, a];
       if (u > l)
         return f = p, h = u, [s, t, f, o, l, h, a];
-      p = f + Bt$1 * (f - t), u = r(p), a += 1;
+      p = f + Bt$2 * (f - t), u = r(p), a += 1;
     } else
-      (p - P) * (P - f) >= 0 ? (p = P, u = r(p), a += 1) : (p - P) * (f - p) > 0 ? (u = r(p), a += 1, u < h && (t = f, f = p, p = f + Bt$1 * (f - t), l = h, h = u, u = r(p), a += 1)) : (p = f + Bt$1 * (f - t), u = r(p), a += 1);
+      (p - P) * (P - f) >= 0 ? (p = P, u = r(p), a += 1) : (p - P) * (f - p) > 0 ? (u = r(p), a += 1, u < h && (t = f, f = p, p = f + Bt$2 * (f - t), l = h, h = u, u = r(p), a += 1)) : (p = f + Bt$2 * (f - t), u = r(p), a += 1);
     s = t, t = f, f = p, o = l, l = h, h = u;
   }
   return [s, t, f, o, l, h, a];
@@ -691,11 +691,11 @@ function Ee(r, s = 0, t = 1, e = 110, n = 1e3) {
 const _e = 0.381966, Ke = 1e-11;
 class He {
   constructor(s, t = 148e-10, e = 500) {
-    q$2(this, "xmin");
-    q$2(this, "fval");
-    q$2(this, "iter");
-    q$2(this, "funcalls");
-    q$2(this, "brack");
+    q$1(this, "xmin");
+    q$1(this, "fval");
+    q$1(this, "iter");
+    q$1(this, "funcalls");
+    q$1(this, "brack");
     this.func = s, this.tol = t, this.maxiter = e, this.func = s, this.tol = t, this.maxiter = e, this.xmin = 1 / 0, this.fval = 1 / 0, this.iter = 0, this.funcalls = 0, this.brack = null;
   }
   setBracket(s = null) {
@@ -850,7 +850,7 @@ const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
 }, Symbol.toStringTag, { value: "Module" })), ls = /* @__PURE__ */ qe(os);
 Object.defineProperty($$1, "__esModule", { value: !0 });
 var st$3 = ss, je = ls;
-const Ut$1 = " ".repeat(2), Fe = " ".repeat(4);
+const Ut$2 = " ".repeat(2), Fe = " ".repeat(4);
 function hs() {
   return xe(this);
 }
@@ -862,11 +862,11 @@ function xe(r, s = {}) {
     padMinus: i = "auto"
   } = s;
   return `${r.constructor.name} {
-${Ut$1}[
+${Ut$2}[
 ${Fe}${as(r, t, e, n, i)}
-${Ut$1}]
-${Ut$1}rows: ${r.rows}
-${Ut$1}columns: ${r.columns}
+${Ut$2}]
+${Ut$2}rows: ${r.rows}
+${Ut$2}columns: ${r.columns}
 }`;
 }
 function as(r, s, t, e, n) {
@@ -1299,12 +1299,12 @@ function cs(r, s) {
     return this;
   };
 }
-function ot$4(r, s, t) {
+function ot$3(r, s, t) {
   let e = t ? r.rows : r.rows - 1;
   if (s < 0 || s > e)
     throw new RangeError("Row index out of range");
 }
-function lt$3(r, s, t) {
+function lt$4(r, s, t) {
   let e = t ? r.columns : r.columns - 1;
   if (s < 0 || s > e)
     throw new RangeError("Column index out of range");
@@ -1316,7 +1316,7 @@ function Pt$2(r, s) {
     );
   return s;
 }
-function bt$2(r, s) {
+function bt$1(r, s) {
   if (s.to1DArray && (s = s.to1DArray()), s.length !== r.rows)
     throw new RangeError("vector size must be the same as the number of rows");
   return s;
@@ -1483,39 +1483,39 @@ function Ts(r, s) {
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) / s);
 }
-let V$1 = class V {
+let V$2 = class V {
   static from1DArray(s, t, e) {
     if (s * t !== e.length)
       throw new RangeError("data length does not match given dimensions");
-    let i = new _$3(s, t);
+    let i = new _$2(s, t);
     for (let o = 0; o < s; o++)
       for (let l = 0; l < t; l++)
         i.set(o, l, e[o * t + l]);
     return i;
   }
   static rowVector(s) {
-    let t = new _$3(1, s.length);
+    let t = new _$2(1, s.length);
     for (let e = 0; e < s.length; e++)
       t.set(0, e, s[e]);
     return t;
   }
   static columnVector(s) {
-    let t = new _$3(s.length, 1);
+    let t = new _$2(s.length, 1);
     for (let e = 0; e < s.length; e++)
       t.set(e, 0, s[e]);
     return t;
   }
   static zeros(s, t) {
-    return new _$3(s, t);
+    return new _$2(s, t);
   }
   static ones(s, t) {
-    return new _$3(s, t).fill(1);
+    return new _$2(s, t).fill(1);
   }
   static rand(s, t, e = {}) {
     if (typeof e != "object")
       throw new TypeError("options must be an object");
     const { random: n = Math.random } = e;
-    let i = new _$3(s, t);
+    let i = new _$2(s, t);
     for (let o = 0; o < s; o++)
       for (let l = 0; l < t; l++)
         i.set(o, l, n());
@@ -1528,7 +1528,7 @@ let V$1 = class V {
     if (!Number.isInteger(n)) throw new TypeError("min must be an integer");
     if (!Number.isInteger(i)) throw new TypeError("max must be an integer");
     if (n >= i) throw new RangeError("min must be smaller than max");
-    let l = i - n, h = new _$3(s, t);
+    let l = i - n, h = new _$2(s, t);
     for (let a = 0; a < s; a++)
       for (let u = 0; u < t; u++) {
         let c = n + Math.round(o() * l);
@@ -1553,7 +1553,7 @@ let V$1 = class V {
   }
   static min(s, t) {
     s = this.checkMatrix(s), t = this.checkMatrix(t);
-    let e = s.rows, n = s.columns, i = new _$3(e, n);
+    let e = s.rows, n = s.columns, i = new _$2(e, n);
     for (let o = 0; o < e; o++)
       for (let l = 0; l < n; l++)
         i.set(o, l, Math.min(s.get(o, l), t.get(o, l)));
@@ -1568,7 +1568,7 @@ let V$1 = class V {
     return i;
   }
   static checkMatrix(s) {
-    return V.isMatrix(s) ? s : new _$3(s);
+    return V.isMatrix(s) ? s : new _$2(s);
   }
   static isMatrix(s) {
     return s != null && s.klass === "Matrix";
@@ -1712,7 +1712,7 @@ let V$1 = class V {
       throw new TypeError("rows must be a positive integer");
     if (!Number.isInteger(e) || e <= 0)
       throw new TypeError("columns must be a positive integer");
-    let n = new _$3(this.rows * t, this.columns * e);
+    let n = new _$2(this.rows * t, this.columns * e);
     for (let i = 0; i < t; i++)
       for (let o = 0; o < e; o++)
         n.setSubMatrix(this, this.rows * i, this.columns * o);
@@ -1728,23 +1728,23 @@ let V$1 = class V {
     return this.mulS(-1);
   }
   getRow(s) {
-    ot$4(this, s);
+    ot$3(this, s);
     let t = [];
     for (let e = 0; e < this.columns; e++)
       t.push(this.get(s, e));
     return t;
   }
   getRowVector(s) {
-    return _$3.rowVector(this.getRow(s));
+    return _$2.rowVector(this.getRow(s));
   }
   setRow(s, t) {
-    ot$4(this, s), t = Pt$2(this, t);
+    ot$3(this, s), t = Pt$2(this, t);
     for (let e = 0; e < this.columns; e++)
       this.set(s, e, t[e]);
     return this;
   }
   swapRows(s, t) {
-    ot$4(this, s), ot$4(this, t);
+    ot$3(this, s), ot$3(this, t);
     for (let e = 0; e < this.columns; e++) {
       let n = this.get(s, e);
       this.set(s, e, this.get(t, e)), this.set(t, e, n);
@@ -1752,23 +1752,23 @@ let V$1 = class V {
     return this;
   }
   getColumn(s) {
-    lt$3(this, s);
+    lt$4(this, s);
     let t = [];
     for (let e = 0; e < this.rows; e++)
       t.push(this.get(e, s));
     return t;
   }
   getColumnVector(s) {
-    return _$3.columnVector(this.getColumn(s));
+    return _$2.columnVector(this.getColumn(s));
   }
   setColumn(s, t) {
-    lt$3(this, s), t = bt$2(this, t);
+    lt$4(this, s), t = bt$1(this, t);
     for (let e = 0; e < this.rows; e++)
       this.set(e, s, t[e]);
     return this;
   }
   swapColumns(s, t) {
-    lt$3(this, s), lt$3(this, t);
+    lt$4(this, s), lt$4(this, t);
     for (let e = 0; e < this.rows; e++) {
       let n = this.get(e, s);
       this.set(e, s, this.get(e, t)), this.set(e, t, n);
@@ -1804,41 +1804,41 @@ let V$1 = class V {
     return this;
   }
   addColumnVector(s) {
-    s = bt$2(this, s);
+    s = bt$1(this, s);
     for (let t = 0; t < this.rows; t++)
       for (let e = 0; e < this.columns; e++)
         this.set(t, e, this.get(t, e) + s[t]);
     return this;
   }
   subColumnVector(s) {
-    s = bt$2(this, s);
+    s = bt$1(this, s);
     for (let t = 0; t < this.rows; t++)
       for (let e = 0; e < this.columns; e++)
         this.set(t, e, this.get(t, e) - s[t]);
     return this;
   }
   mulColumnVector(s) {
-    s = bt$2(this, s);
+    s = bt$1(this, s);
     for (let t = 0; t < this.rows; t++)
       for (let e = 0; e < this.columns; e++)
         this.set(t, e, this.get(t, e) * s[t]);
     return this;
   }
   divColumnVector(s) {
-    s = bt$2(this, s);
+    s = bt$1(this, s);
     for (let t = 0; t < this.rows; t++)
       for (let e = 0; e < this.columns; e++)
         this.set(t, e, this.get(t, e) / s[t]);
     return this;
   }
   mulRow(s, t) {
-    ot$4(this, s);
+    ot$3(this, s);
     for (let e = 0; e < this.columns; e++)
       this.set(s, e, this.get(s, e) * t);
     return this;
   }
   mulColumn(s, t) {
-    lt$3(this, s);
+    lt$4(this, s);
     for (let e = 0; e < this.rows; e++)
       this.set(e, s, this.get(e, s) * t);
     return this;
@@ -1918,7 +1918,7 @@ let V$1 = class V {
     return t;
   }
   maxRow(s) {
-    if (ot$4(this, s), this.isEmpty())
+    if (ot$3(this, s), this.isEmpty())
       return NaN;
     let t = this.get(s, 0);
     for (let e = 1; e < this.columns; e++)
@@ -1926,14 +1926,14 @@ let V$1 = class V {
     return t;
   }
   maxRowIndex(s) {
-    ot$4(this, s), yt$2(this);
+    ot$3(this, s), yt$2(this);
     let t = this.get(s, 0), e = [s, 0];
     for (let n = 1; n < this.columns; n++)
       this.get(s, n) > t && (t = this.get(s, n), e[1] = n);
     return e;
   }
   minRow(s) {
-    if (ot$4(this, s), this.isEmpty())
+    if (ot$3(this, s), this.isEmpty())
       return NaN;
     let t = this.get(s, 0);
     for (let e = 1; e < this.columns; e++)
@@ -1941,14 +1941,14 @@ let V$1 = class V {
     return t;
   }
   minRowIndex(s) {
-    ot$4(this, s), yt$2(this);
+    ot$3(this, s), yt$2(this);
     let t = this.get(s, 0), e = [s, 0];
     for (let n = 1; n < this.columns; n++)
       this.get(s, n) < t && (t = this.get(s, n), e[1] = n);
     return e;
   }
   maxColumn(s) {
-    if (lt$3(this, s), this.isEmpty())
+    if (lt$4(this, s), this.isEmpty())
       return NaN;
     let t = this.get(0, s);
     for (let e = 1; e < this.rows; e++)
@@ -1956,14 +1956,14 @@ let V$1 = class V {
     return t;
   }
   maxColumnIndex(s) {
-    lt$3(this, s), yt$2(this);
+    lt$4(this, s), yt$2(this);
     let t = this.get(0, s), e = [0, s];
     for (let n = 1; n < this.rows; n++)
       this.get(n, s) > t && (t = this.get(n, s), e[0] = n);
     return e;
   }
   minColumn(s) {
-    if (lt$3(this, s), this.isEmpty())
+    if (lt$4(this, s), this.isEmpty())
       return NaN;
     let t = this.get(0, s);
     for (let e = 1; e < this.rows; e++)
@@ -1971,7 +1971,7 @@ let V$1 = class V {
     return t;
   }
   minColumnIndex(s) {
-    lt$3(this, s), yt$2(this);
+    lt$4(this, s), yt$2(this);
     let t = this.get(0, s), e = [0, s];
     for (let n = 1; n < this.rows; n++)
       this.get(n, s) < t && (t = this.get(n, s), e[0] = n);
@@ -2011,8 +2011,8 @@ let V$1 = class V {
     return e;
   }
   mmul(s) {
-    s = _$3.checkMatrix(s);
-    let t = this.rows, e = this.columns, n = s.columns, i = new _$3(t, n), o = new Float64Array(e);
+    s = _$2.checkMatrix(s);
+    let t = this.rows, e = this.columns, n = s.columns, i = new _$2(t, n), o = new Float64Array(e);
     for (let l = 0; l < n; l++) {
       for (let h = 0; h < e; h++)
         o[h] = s.get(h, l);
@@ -2030,25 +2030,25 @@ let V$1 = class V {
       throw new RangeError("Matrix must be square");
     if (!Number.isInteger(s) || s < 0)
       throw new RangeError("Exponent must be a non-negative integer");
-    let t = _$3.eye(this.rows), e = this;
+    let t = _$2.eye(this.rows), e = this;
     for (let n = s; n > 1; n /= 2)
       n & 1 && (t = t.mmul(e)), e = e.mmul(e);
     return t;
   }
   strassen2x2(s) {
-    s = _$3.checkMatrix(s);
-    let t = new _$3(2, 2);
+    s = _$2.checkMatrix(s);
+    let t = new _$2(2, 2);
     const e = this.get(0, 0), n = s.get(0, 0), i = this.get(0, 1), o = s.get(0, 1), l = this.get(1, 0), h = s.get(1, 0), a = this.get(1, 1), u = s.get(1, 1), c = (e + a) * (n + u), g = (l + a) * n, d = e * (o - u), w = a * (h - n), p = (e + i) * u, P = (l - e) * (n + o), f = (i - a) * (h + u), M = c + w - p + f, E = d + p, R = g + w, v = c - g + d + P;
     return t.set(0, 0, M), t.set(0, 1, E), t.set(1, 0, R), t.set(1, 1, v), t;
   }
   strassen3x3(s) {
-    s = _$3.checkMatrix(s);
-    let t = new _$3(3, 3);
+    s = _$2.checkMatrix(s);
+    let t = new _$2(3, 3);
     const e = this.get(0, 0), n = this.get(0, 1), i = this.get(0, 2), o = this.get(1, 0), l = this.get(1, 1), h = this.get(1, 2), a = this.get(2, 0), u = this.get(2, 1), c = this.get(2, 2), g = s.get(0, 0), d = s.get(0, 1), w = s.get(0, 2), p = s.get(1, 0), P = s.get(1, 1), f = s.get(1, 2), M = s.get(2, 0), E = s.get(2, 1), R = s.get(2, 2), v = (e + n + i - o - l - u - c) * P, L = (e - o) * (-d + P), S = l * (-g + d + p - P - f - M + R), k = (-e + o + l) * (g - d + P), D = (o + l) * (-g + d), m = e * g, b = (-e + a + u) * (g - w + f), j = (-e + a) * (w - f), y = (a + u) * (-g + w), C = (e + n + i - l - h - a - u) * f, F = u * (-g + w + p - P - f - M + E), I = (-i + u + c) * (P + M - E), B = (i - c) * (P - E), x = i * M, N = (u + c) * (-M + E), A = (-i + l + h) * (f + M - R), O = (i - h) * (f - R), U = (l + h) * (-M + R), T = n * p, z = h * E, X = o * w, G = a * d, W = c * R, se = m + x + T, ne = v + k + D + m + I + x + N, ie = m + b + y + C + x + A + U, re = L + S + k + m + x + A + O, At = L + k + D + m + z, Vt = x + A + O + U + X, Nt = m + b + j + F + I + B + x, $t = I + B + x + N + G, Lt = m + b + j + y + W;
     return t.set(0, 0, se), t.set(0, 1, ne), t.set(0, 2, ie), t.set(1, 0, re), t.set(1, 1, At), t.set(1, 2, Vt), t.set(2, 0, Nt), t.set(2, 1, $t), t.set(2, 2, Lt), t;
   }
   mmulStrassen(s) {
-    s = _$3.checkMatrix(s);
+    s = _$2.checkMatrix(s);
     let t = this.clone(), e = t.rows, n = t.columns, i = s.rows, o = s.columns;
     n !== i && console.warn(
       `Multiplying ${e} x ${n} and ${i} x ${o} matrix: dimensions do not match.`
@@ -2099,7 +2099,7 @@ let V$1 = class V {
     if (!Number.isFinite(t)) throw new TypeError("min must be a number");
     if (!Number.isFinite(e)) throw new TypeError("max must be a number");
     if (t >= e) throw new RangeError("min must be smaller than max");
-    let n = new _$3(this.rows, this.columns);
+    let n = new _$2(this.rows, this.columns);
     for (let i = 0; i < this.rows; i++) {
       const o = this.getRow(i);
       o.length > 0 && je(o, { min: t, max: e, output: o }), n.setRow(i, o);
@@ -2113,7 +2113,7 @@ let V$1 = class V {
     if (!Number.isFinite(t)) throw new TypeError("min must be a number");
     if (!Number.isFinite(e)) throw new TypeError("max must be a number");
     if (t >= e) throw new RangeError("min must be smaller than max");
-    let n = new _$3(this.rows, this.columns);
+    let n = new _$2(this.rows, this.columns);
     for (let i = 0; i < this.columns; i++) {
       const o = this.getColumn(i);
       o.length && je(o, {
@@ -2143,8 +2143,8 @@ let V$1 = class V {
     return this;
   }
   kroneckerProduct(s) {
-    s = _$3.checkMatrix(s);
-    let t = this.rows, e = this.columns, n = s.rows, i = s.columns, o = new _$3(t * n, e * i);
+    s = _$2.checkMatrix(s);
+    let t = this.rows, e = this.columns, n = s.rows, i = s.columns, o = new _$2(t * n, e * i);
     for (let l = 0; l < t; l++)
       for (let h = 0; h < e; h++)
         for (let a = 0; a < n; a++)
@@ -2153,13 +2153,13 @@ let V$1 = class V {
     return o;
   }
   kroneckerSum(s) {
-    if (s = _$3.checkMatrix(s), !this.isSquare() || !s.isSquare())
+    if (s = _$2.checkMatrix(s), !this.isSquare() || !s.isSquare())
       throw new Error("Kronecker Sum needs two Square Matrices");
-    let t = this.rows, e = s.rows, n = this.kroneckerProduct(_$3.eye(e, e)), i = _$3.eye(t, t).kroneckerProduct(s);
+    let t = this.rows, e = s.rows, n = this.kroneckerProduct(_$2.eye(e, e)), i = _$2.eye(t, t).kroneckerProduct(s);
     return n.add(i);
   }
   transpose() {
-    let s = new _$3(this.columns, this.rows);
+    let s = new _$2(this.columns, this.rows);
     for (let t = 0; t < this.rows; t++)
       for (let e = 0; e < this.columns; e++)
         s.set(e, t, this.get(t, e));
@@ -2177,7 +2177,7 @@ let V$1 = class V {
   }
   subMatrix(s, t, e, n) {
     ae$1(this, s, t, e, n);
-    let i = new _$3(
+    let i = new _$2(
       t - s + 1,
       n - e + 1
     );
@@ -2189,7 +2189,7 @@ let V$1 = class V {
   subMatrixRow(s, t, e) {
     if (t === void 0 && (t = 0), e === void 0 && (e = this.columns - 1), t > e || t < 0 || t >= this.columns || e < 0 || e >= this.columns)
       throw new RangeError("Argument out of range");
-    let n = new _$3(s.length, e - t + 1);
+    let n = new _$2(s.length, e - t + 1);
     for (let i = 0; i < s.length; i++)
       for (let o = t; o <= e; o++) {
         if (s[i] < 0 || s[i] >= this.rows)
@@ -2201,7 +2201,7 @@ let V$1 = class V {
   subMatrixColumn(s, t, e) {
     if (t === void 0 && (t = 0), e === void 0 && (e = this.rows - 1), t > e || t < 0 || t >= this.rows || e < 0 || e >= this.rows)
       throw new RangeError("Argument out of range");
-    let n = new _$3(e - t + 1, s.length);
+    let n = new _$2(e - t + 1, s.length);
     for (let i = 0; i < s.length; i++)
       for (let o = t; o <= e; o++) {
         if (s[i] < 0 || s[i] >= this.columns)
@@ -2211,7 +2211,7 @@ let V$1 = class V {
     return n;
   }
   setSubMatrix(s, t, e) {
-    if (s = _$3.checkMatrix(s), s.isEmpty())
+    if (s = _$2.checkMatrix(s), s.isEmpty())
       return this;
     let n = t + s.rows - 1, i = e + s.columns - 1;
     ae$1(this, t, n, e, i);
@@ -2222,7 +2222,7 @@ let V$1 = class V {
   }
   selection(s, t) {
     ge(this, s), we(this, t);
-    let e = new _$3(s.length, t.length);
+    let e = new _$2(s.length, t.length);
     for (let n = 0; n < s.length; n++) {
       let i = s[n];
       for (let o = 0; o < t.length; o++) {
@@ -2239,7 +2239,7 @@ let V$1 = class V {
     return t;
   }
   clone() {
-    return this.constructor.copy(this, new _$3(this.rows, this.columns));
+    return this.constructor.copy(this, new _$2(this.rows, this.columns));
   }
   /**
    * @template {AbstractMatrix} M
@@ -2411,34 +2411,34 @@ let V$1 = class V {
         yield this.get(s, t);
   }
 };
-V$1.prototype.klass = "Matrix";
-typeof Symbol < "u" && (V$1.prototype[Symbol.for("nodejs.util.inspect.custom")] = hs);
+V$2.prototype.klass = "Matrix";
+typeof Symbol < "u" && (V$2.prototype[Symbol.for("nodejs.util.inspect.custom")] = hs);
 function ke(r, s) {
   return r - s;
 }
 function Is(r) {
   return r.every((s) => typeof s == "number");
 }
-V$1.random = V$1.rand;
-V$1.randomInt = V$1.randInt;
-V$1.diagonal = V$1.diag;
-V$1.prototype.diagonal = V$1.prototype.diag;
-V$1.identity = V$1.eye;
-V$1.prototype.negate = V$1.prototype.neg;
-V$1.prototype.tensorProduct = V$1.prototype.kroneckerProduct;
-var Ft$1, ue$1, dt$1;
-let _$3 = (dt$1 = class extends V$1 {
+V$2.random = V$2.rand;
+V$2.randomInt = V$2.randInt;
+V$2.diagonal = V$2.diag;
+V$2.prototype.diagonal = V$2.prototype.diag;
+V$2.identity = V$2.eye;
+V$2.prototype.negate = V$2.prototype.neg;
+V$2.prototype.tensorProduct = V$2.prototype.kroneckerProduct;
+var Ft$2, ue$1, dt$2;
+let _$2 = (dt$2 = class extends V$2 {
   constructor(t, e) {
     super();
-    le$1(this, Ft$1);
+    le$1(this, Ft$2);
     /**
      * @type {Float64Array[]}
      */
-    q$2(this, "data");
-    if (dt$1.isMatrix(t))
-      he(this, Ft$1, ue$1).call(this, t.rows, t.columns), dt$1.copy(t, this);
+    q$1(this, "data");
+    if (dt$2.isMatrix(t))
+      he(this, Ft$2, ue$1).call(this, t.rows, t.columns), dt$2.copy(t, this);
     else if (Number.isInteger(t) && t >= 0)
-      he(this, Ft$1, ue$1).call(this, t, e);
+      he(this, Ft$2, ue$1).call(this, t, e);
     else if (st$3.isAnyArray(t)) {
       const n = t;
       if (t = n.length, e = t ? n[0].length : 0, typeof e != "number")
@@ -2466,13 +2466,13 @@ let _$3 = (dt$1 = class extends V$1 {
     return this.data[t][e];
   }
   removeRow(t) {
-    return ot$4(this, t), this.data.splice(t, 1), this.rows -= 1, this;
+    return ot$3(this, t), this.data.splice(t, 1), this.rows -= 1, this;
   }
   addRow(t, e) {
-    return e === void 0 && (e = t, t = this.rows), ot$4(this, t, !0), e = Float64Array.from(Pt$2(this, e)), this.data.splice(t, 0, e), this.rows += 1, this;
+    return e === void 0 && (e = t, t = this.rows), ot$3(this, t, !0), e = Float64Array.from(Pt$2(this, e)), this.data.splice(t, 0, e), this.rows += 1, this;
   }
   removeColumn(t) {
-    lt$3(this, t);
+    lt$4(this, t);
     for (let e = 0; e < this.rows; e++) {
       const n = new Float64Array(this.columns - 1);
       for (let i = 0; i < t; i++)
@@ -2484,7 +2484,7 @@ let _$3 = (dt$1 = class extends V$1 {
     return this.columns -= 1, this;
   }
   addColumn(t, e) {
-    typeof e > "u" && (e = t, t = this.columns), lt$3(this, t, !0), e = bt$2(this, e);
+    typeof e > "u" && (e = t, t = this.columns), lt$4(this, t, !0), e = bt$1(this, e);
     for (let n = 0; n < this.rows; n++) {
       const i = new Float64Array(this.columns + 1);
       let o = 0;
@@ -2496,7 +2496,7 @@ let _$3 = (dt$1 = class extends V$1 {
     }
     return this.columns += 1, this;
   }
-}, Ft$1 = new WeakSet(), /**
+}, Ft$2 = new WeakSet(), /**
  * Init an empty matrix
  * @param {number} nRows
  * @param {number} nColumns
@@ -2508,10 +2508,10 @@ ue$1 = function(t, e) {
   else
     throw new TypeError("nColumns must be a positive integer");
   this.rows = t, this.columns = e;
-}, dt$1);
-cs(V$1, _$3);
+}, dt$2);
+cs(V$2, _$2);
 var K$3;
-const Jt = class Jt extends V$1 {
+const Jt = class Jt extends V$2 {
   /**
    * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize
    * @return {this}
@@ -2520,26 +2520,26 @@ const Jt = class Jt extends V$1 {
     super();
     /** @type {Matrix} */
     le$1(this, K$3);
-    if (_$3.isMatrix(t)) {
+    if (_$2.isMatrix(t)) {
       if (!t.isSymmetric())
         throw new TypeError("not symmetric data");
-      Dt$1(this, K$3, _$3.copy(
+      Dt$2(this, K$3, _$2.copy(
         t,
-        new _$3(t.rows, t.rows)
+        new _$2(t.rows, t.rows)
       ));
     } else if (Number.isInteger(t) && t >= 0)
-      Dt$1(this, K$3, new _$3(t, t));
-    else if (Dt$1(this, K$3, new _$3(t)), !this.isSymmetric())
+      Dt$2(this, K$3, new _$2(t, t));
+    else if (Dt$2(this, K$3, new _$2(t)), !this.isSymmetric())
       throw new TypeError("not symmetric data");
   }
   get size() {
-    return ht$2(this, K$3).size;
+    return ht$3(this, K$3).size;
   }
   get rows() {
-    return ht$2(this, K$3).rows;
+    return ht$3(this, K$3).rows;
   }
   get columns() {
-    return ht$2(this, K$3).columns;
+    return ht$3(this, K$3).columns;
   }
   get diagonalSize() {
     return this.rows;
@@ -2552,7 +2552,7 @@ const Jt = class Jt extends V$1 {
    * @returns {boolean}
    */
   static isSymmetricMatrix(t) {
-    return _$3.isMatrix(t) && t.klassType === "SymmetricMatrix";
+    return _$2.isMatrix(t) && t.klassType === "SymmetricMatrix";
   }
   /**
    * @param diagonalSize
@@ -2575,21 +2575,21 @@ const Jt = class Jt extends V$1 {
     return t;
   }
   toMatrix() {
-    return new _$3(this);
+    return new _$2(this);
   }
   get(t, e) {
-    return ht$2(this, K$3).get(t, e);
+    return ht$3(this, K$3).get(t, e);
   }
   set(t, e, n) {
-    return ht$2(this, K$3).set(t, e, n), ht$2(this, K$3).set(e, t, n), this;
+    return ht$3(this, K$3).set(t, e, n), ht$3(this, K$3).set(e, t, n), this;
   }
   removeCross(t) {
-    return ht$2(this, K$3).removeRow(t), ht$2(this, K$3).removeColumn(t), this;
+    return ht$3(this, K$3).removeRow(t), ht$3(this, K$3).removeColumn(t), this;
   }
   addCross(t, e) {
     e === void 0 && (e = t, t = this.diagonalSize);
     const n = e.slice();
-    return n.splice(t, 1), ht$2(this, K$3).addRow(t, n), ht$2(this, K$3).addColumn(t, e), this;
+    return n.splice(t, 1), ht$3(this, K$3).addRow(t, n), ht$3(this, K$3).addColumn(t, e), this;
   }
   /**
    * @param {Mask[]} mask
@@ -2670,9 +2670,9 @@ const Jt = class Jt extends V$1 {
   }
 };
 K$3 = new WeakMap();
-let pt$1 = Jt;
-pt$1.prototype.klassType = "SymmetricMatrix";
-let te$1 = class te extends pt$1 {
+let pt$2 = Jt;
+pt$2.prototype.klassType = "SymmetricMatrix";
+let te$2 = class te extends pt$2 {
   /**
    * not the same as matrix.isSymmetric()
    * Here is to check if it's instanceof SymmetricMatrix without bundling issues
@@ -2681,7 +2681,7 @@ let te$1 = class te extends pt$1 {
    * @returns {boolean}
    */
   static isDistanceMatrix(s) {
-    return pt$1.isSymmetricMatrix(s) && s.klassSubType === "DistanceMatrix";
+    return pt$2.isSymmetricMatrix(s) && s.klassSubType === "DistanceMatrix";
   }
   constructor(s) {
     if (super(s), !this.isDistance())
@@ -2694,7 +2694,7 @@ let te$1 = class te extends pt$1 {
     return t === void 0 && (t = s, s = this.diagonalSize), t = t.slice(), t[s] = 0, super.addCross(s, t);
   }
   toSymmetricMatrix() {
-    return new pt$1(this);
+    return new pt$2(this);
   }
   clone() {
     const s = new te(this.diagonalSize);
@@ -2747,15 +2747,15 @@ let te$1 = class te extends pt$1 {
     return n;
   }
 };
-te$1.prototype.klassSubType = "DistanceMatrix";
-let ft$2 = class ft extends V$1 {
+te$2.prototype.klassSubType = "DistanceMatrix";
+let ft$2 = class ft extends V$2 {
   constructor(s, t, e) {
     super(), this.matrix = s, this.rows = t, this.columns = e;
   }
 };
 class Cs extends ft$2 {
   constructor(s, t) {
-    lt$3(s, t), super(s, s.rows, 1), this.column = t;
+    lt$4(s, t), super(s, s.rows, 1), this.column = t;
   }
   set(s, t, e) {
     return this.matrix.set(s, this.column, e), this;
@@ -2799,7 +2799,7 @@ class xs extends ft$2 {
 }
 class As extends ft$2 {
   constructor(s, t) {
-    ot$4(s, t), super(s, 1, s.columns), this.row = t;
+    ot$3(s, t), super(s, 1, s.columns), this.row = t;
   }
   set(s, t, e) {
     return this.matrix.set(this.row, t, e), this;
@@ -2866,7 +2866,7 @@ class $s extends ft$2 {
     return this.matrix.get(t, s);
   }
 }
-class Ae extends V$1 {
+class Ae extends V$2 {
   constructor(s, t = {}) {
     const { rows: e = 1 } = t;
     if (s.length % e !== 0)
@@ -2885,7 +2885,7 @@ class Ae extends V$1 {
     return s * this.columns + t;
   }
 }
-let rt$4 = class rt extends V$1 {
+let rt$4 = class rt extends V$2 {
   constructor(s) {
     super(), this.data = s, this.rows = s.length, this.columns = s[0].length;
   }
@@ -2901,7 +2901,7 @@ function Ls(r, s) {
     return r[0] && st$3.isAnyArray(r[0]) ? new rt$4(r) : new Ae(r, s);
   throw new Error("the argument is not an array");
 }
-let ee$1 = class ee {
+let ee$2 = class ee {
   constructor(s) {
     s = rt$4.checkMatrix(s);
     let t = s.clone(), e = t.rows, n = t.columns, i = new Float64Array(e), o = 1, l, h, a, u, c, g, d, w, p;
@@ -2936,7 +2936,7 @@ let ee$1 = class ee {
     return !1;
   }
   solve(s) {
-    s = _$3.checkMatrix(s);
+    s = _$2.checkMatrix(s);
     let t = this.LU;
     if (t.rows !== s.rows)
       throw new Error("Invalid matrix dimensions");
@@ -2966,14 +2966,14 @@ let ee$1 = class ee {
     return t;
   }
   get lowerTriangularMatrix() {
-    let s = this.LU, t = s.rows, e = s.columns, n = new _$3(t, e);
+    let s = this.LU, t = s.rows, e = s.columns, n = new _$2(t, e);
     for (let i = 0; i < t; i++)
       for (let o = 0; o < e; o++)
         i > o ? n.set(i, o, s.get(i, o)) : i === o ? n.set(i, o, 1) : n.set(i, o, 0);
     return n;
   }
   get upperTriangularMatrix() {
-    let s = this.LU, t = s.rows, e = s.columns, n = new _$3(t, e);
+    let s = this.LU, t = s.rows, e = s.columns, n = new _$2(t, e);
     for (let i = 0; i < t; i++)
       for (let o = 0; o < e; o++)
         i <= o ? n.set(i, o, s.get(i, o)) : n.set(i, o, 0);
@@ -2983,7 +2983,7 @@ let ee$1 = class ee {
     return Array.from(this.pivotVector);
   }
 };
-function ut(r, s) {
+function ut$1(r, s) {
   let t = 0;
   return Math.abs(r) > Math.abs(s) ? (t = s / r, Math.abs(r) * Math.sqrt(1 + t * t)) : s !== 0 ? (t = r / s, Math.abs(s) * Math.sqrt(1 + t * t)) : 0;
 }
@@ -2994,7 +2994,7 @@ class pe {
     for (h = 0; h < n; h++) {
       let u = 0;
       for (o = h; o < e; o++)
-        u = ut(u, t.get(o, h));
+        u = ut$1(u, t.get(o, h));
       if (u !== 0) {
         for (t.get(h, h) < 0 && (u = -u), o = h; o < e; o++)
           t.set(o, h, t.get(o, h) / u);
@@ -3010,7 +3010,7 @@ class pe {
     this.QR = t, this.Rdiag = i;
   }
   solve(s) {
-    s = _$3.checkMatrix(s);
+    s = _$2.checkMatrix(s);
     let t = this.QR, e = t.rows;
     if (s.rows !== e)
       throw new Error("Matrix row dimensions must agree");
@@ -3041,14 +3041,14 @@ class pe {
     return !0;
   }
   get upperTriangularMatrix() {
-    let s = this.QR, t = s.columns, e = new _$3(t, t), n, i;
+    let s = this.QR, t = s.columns, e = new _$2(t, t), n, i;
     for (n = 0; n < t; n++)
       for (i = 0; i < t; i++)
         n < i ? e.set(n, i, s.get(n, i)) : n === i ? e.set(n, i, this.Rdiag[n]) : e.set(n, i, 0);
     return e;
   }
   get orthogonalMatrix() {
-    let s = this.QR, t = s.rows, e = s.columns, n = new _$3(t, e), i, o, l, h;
+    let s = this.QR, t = s.rows, e = s.columns, n = new _$2(t, e), i, o, l, h;
     for (l = e - 1; l >= 0; l--) {
       for (i = 0; i < t; i++)
         n.set(i, l, 0);
@@ -3063,7 +3063,7 @@ class pe {
     return n;
   }
 }
-let vt$2 = class vt {
+let vt$1 = class vt {
   constructor(s, t = {}) {
     if (s = rt$4.checkMatrix(s), s.isEmpty())
       throw new Error("Matrix must be non-empty");
@@ -3086,14 +3086,14 @@ let vt$2 = class vt {
       }
     else
       c = s.clone();
-    let g = Math.min(e, n), d = Math.min(e + 1, n), w = new Float64Array(d), p = new _$3(e, g), P = new _$3(n, n), f = new Float64Array(n), M = new Float64Array(e), E = new Float64Array(d);
+    let g = Math.min(e, n), d = Math.min(e + 1, n), w = new Float64Array(d), p = new _$2(e, g), P = new _$2(n, n), f = new Float64Array(n), M = new Float64Array(e), E = new Float64Array(d);
     for (let m = 0; m < d; m++) E[m] = m;
     let R = Math.min(e - 1, n), v = Math.max(0, Math.min(n - 2, e)), L = Math.max(R, v);
     for (let m = 0; m < L; m++) {
       if (m < R) {
         w[m] = 0;
         for (let b = m; b < e; b++)
-          w[m] = ut(w[m], c.get(b, m));
+          w[m] = ut$1(w[m], c.get(b, m));
         if (w[m] !== 0) {
           c.get(m, m) < 0 && (w[m] = -w[m]);
           for (let b = m; b < e; b++)
@@ -3119,7 +3119,7 @@ let vt$2 = class vt {
       if (m < v) {
         f[m] = 0;
         for (let b = m + 1; b < n; b++)
-          f[m] = ut(f[m], f[b]);
+          f[m] = ut$1(f[m], f[b]);
         if (f[m] !== 0) {
           f[m + 1] < 0 && (f[m] = 0 - f[m]);
           for (let b = m + 1; b < n; b++)
@@ -3214,7 +3214,7 @@ let vt$2 = class vt {
           let j = f[S - 2];
           f[S - 2] = 0;
           for (let y = S - 2; y >= m; y--) {
-            let C = ut(w[y], j), F = w[y] / C, I = j / C;
+            let C = ut$1(w[y], j), F = w[y] / C, I = j / C;
             if (w[y] = C, y !== m && (j = -I * f[y - 1], f[y - 1] = F * f[y - 1]), a)
               for (let B = 0; B < n; B++)
                 C = F * P.get(B, y) + I * P.get(B, S - 1), P.set(B, S - 1, -I * P.get(B, y) + F * P.get(B, S - 1)), P.set(B, y, C);
@@ -3225,7 +3225,7 @@ let vt$2 = class vt {
           let j = f[m - 1];
           f[m - 1] = 0;
           for (let y = m; y < S; y++) {
-            let C = ut(w[y], j), F = w[y] / C, I = j / C;
+            let C = ut$1(w[y], j), F = w[y] / C, I = j / C;
             if (w[y] = C, j = -I * f[y], f[y] = F * f[y], h)
               for (let B = 0; B < e; B++)
                 C = F * p.get(B, y) + I * p.get(B, m - 1), p.set(B, m - 1, -I * p.get(B, y) + F * p.get(B, m - 1)), p.set(B, y, C);
@@ -3244,13 +3244,13 @@ let vt$2 = class vt {
           (x !== 0 || N !== 0) && (x < 0 ? A = 0 - Math.sqrt(x * x + N) : A = Math.sqrt(x * x + N), A = N / (x + A));
           let O = (I + y) * (I - y) + A, U = I * B;
           for (let T = m; T < S - 1; T++) {
-            let z = ut(O, U);
+            let z = ut$1(O, U);
             z === 0 && (z = Number.MIN_VALUE);
             let X = O / z, G = U / z;
             if (T !== m && (f[T - 1] = z), O = X * w[T] + G * f[T], f[T] = X * f[T] - G * w[T], U = G * w[T + 1], w[T + 1] = X * w[T + 1], a)
               for (let W = 0; W < n; W++)
                 z = X * P.get(W, T) + G * P.get(W, T + 1), P.set(W, T + 1, -G * P.get(W, T) + X * P.get(W, T + 1)), P.set(W, T, z);
-            if (z = ut(O, U), z === 0 && (z = Number.MIN_VALUE), X = O / z, G = U / z, w[T] = z, O = X * f[T] + G * w[T + 1], w[T + 1] = -G * f[T] + X * w[T + 1], U = G * f[T + 1], f[T + 1] = X * f[T + 1], h && T < e - 1)
+            if (z = ut$1(O, U), z === 0 && (z = Number.MIN_VALUE), X = O / z, G = U / z, w[T] = z, O = X * f[T] + G * w[T + 1], w[T + 1] = -G * f[T] + X * w[T + 1], U = G * f[T + 1], f[T + 1] = X * f[T + 1], h && T < e - 1)
               for (let W = 0; W < e; W++)
                 z = X * p.get(W, T) + G * p.get(W, T + 1), p.set(W, T + 1, -G * p.get(W, T) + X * p.get(W, T + 1)), p.set(W, T, z);
           }
@@ -3283,10 +3283,10 @@ let vt$2 = class vt {
     this.m = e, this.n = n, this.s = w, this.U = p, this.V = P;
   }
   solve(s) {
-    let t = s, e = this.threshold, n = this.s.length, i = _$3.zeros(n, n);
+    let t = s, e = this.threshold, n = this.s.length, i = _$2.zeros(n, n);
     for (let g = 0; g < n; g++)
       Math.abs(this.s[g]) <= e ? i.set(g, g, 0) : i.set(g, g, 1 / this.s[g]);
-    let o = this.U, l = this.rightSingularVectors, h = l.mmul(i), a = l.rows, u = o.rows, c = _$3.zeros(a, u);
+    let o = this.U, l = this.rightSingularVectors, h = l.mmul(i), a = l.rows, u = o.rows, c = _$2.zeros(a, u);
     for (let g = 0; g < a; g++)
       for (let d = 0; d < u; d++) {
         let w = 0;
@@ -3297,14 +3297,14 @@ let vt$2 = class vt {
     return c.mmul(t);
   }
   solveForDiagonal(s) {
-    return this.solve(_$3.diag(s));
+    return this.solve(_$2.diag(s));
   }
   inverse() {
-    let s = this.V, t = this.threshold, e = s.rows, n = s.columns, i = new _$3(e, this.s.length);
+    let s = this.V, t = this.threshold, e = s.rows, n = s.columns, i = new _$2(e, this.s.length);
     for (let u = 0; u < e; u++)
       for (let c = 0; c < n; c++)
         Math.abs(this.s[c]) > t && i.set(u, c, s.get(u, c) / this.s[c]);
-    let o = this.U, l = o.rows, h = o.columns, a = new _$3(e, l);
+    let o = this.U, l = o.rows, h = o.columns, a = new _$2(e, l);
     for (let u = 0; u < e; u++)
       for (let c = 0; c < l; c++) {
         let g = 0;
@@ -3339,17 +3339,17 @@ let vt$2 = class vt {
     return this.V;
   }
   get diagonalMatrix() {
-    return _$3.diag(this.s);
+    return _$2.diag(this.s);
   }
 };
 function Ds(r, s = !1) {
-  return r = rt$4.checkMatrix(r), s ? new vt$2(r).inverse() : Ve(r, _$3.eye(r.rows));
+  return r = rt$4.checkMatrix(r), s ? new vt$1(r).inverse() : Ve(r, _$2.eye(r.rows));
 }
 function Ve(r, s, t = !1) {
-  return r = rt$4.checkMatrix(r), s = rt$4.checkMatrix(s), t ? new vt$2(r).solve(s) : r.isSquare() ? new ee$1(r).solve(s) : new pe(r).solve(s);
+  return r = rt$4.checkMatrix(r), s = rt$4.checkMatrix(s), t ? new vt$1(r).solve(s) : r.isSquare() ? new ee$2(r).solve(s) : new pe(r).solve(s);
 }
 function Xt$1(r) {
-  if (r = _$3.checkMatrix(r), r.isSquare()) {
+  if (r = _$2.checkMatrix(r), r.isSquare()) {
     if (r.columns === 0)
       return 1;
     let s, t, e, n;
@@ -3359,7 +3359,7 @@ function Xt$1(r) {
       let i, o, l;
       return i = new Gt$1(r, [1, 2], [1, 2]), o = new Gt$1(r, [1, 2], [0, 2]), l = new Gt$1(r, [1, 2], [0, 1]), s = r.get(0, 0), t = r.get(0, 1), e = r.get(0, 2), s * Xt$1(i) - t * Xt$1(o) + e * Xt$1(l);
     } else
-      return new ee$1(r).determinant;
+      return new ee$2(r).determinant;
   } else
     throw Error("determinant can only be calculated for a square matrix");
 }
@@ -3381,10 +3381,10 @@ function Os(r, s, t, e = 1e-9, n = 1e-9) {
 }
 function Bs(r, s = {}) {
   const { thresholdValue: t = 1e-9, thresholdError: e = 1e-9 } = s;
-  r = _$3.checkMatrix(r);
-  let n = r.rows, i = new _$3(n, n);
+  r = _$2.checkMatrix(r);
+  let n = r.rows, i = new _$2(n, n);
   for (let o = 0; o < n; o++) {
-    let l = _$3.columnVector(r.getRow(o)), h = r.subMatrixRow(zs(n, o)).transpose(), u = new vt$2(h).solve(l), c = _$3.sub(l, h.mmul(u)).abs().max();
+    let l = _$2.columnVector(r.getRow(o)), h = r.subMatrixRow(zs(n, o)).transpose(), u = new vt$1(h).solve(l), c = _$2.sub(l, h.mmul(u)).abs().max();
     i.setRow(
       o,
       Os(c, u, o, t, e)
@@ -3393,17 +3393,17 @@ function Bs(r, s = {}) {
   return i;
 }
 function Us(r, s = Number.EPSILON) {
-  if (r = _$3.checkMatrix(r), r.isEmpty())
+  if (r = _$2.checkMatrix(r), r.isEmpty())
     return r.transpose();
-  let t = new vt$2(r, { autoTranspose: !0 }), e = t.leftSingularVectors, n = t.rightSingularVectors, i = t.diagonal;
+  let t = new vt$1(r, { autoTranspose: !0 }), e = t.leftSingularVectors, n = t.rightSingularVectors, i = t.diagonal;
   for (let o = 0; o < i.length; o++)
     Math.abs(i[o]) > s ? i[o] = 1 / i[o] : i[o] = 0;
-  return n.mmul(_$3.diag(i).mmul(e.transpose()));
+  return n.mmul(_$2.diag(i).mmul(e.transpose()));
 }
 function Ys(r, s = r, t = {}) {
-  r = new _$3(r);
+  r = new _$2(r);
   let e = !1;
-  if (typeof s == "object" && !_$3.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$3(s), r.rows !== s.rows)
+  if (typeof s == "object" && !_$2.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$2(s), r.rows !== s.rows)
     throw new TypeError("Both matrices must have the same number of rows");
   const { center: n = !0 } = t;
   n && (r = r.center("column"), e || (s = s.center("column")));
@@ -3414,9 +3414,9 @@ function Ys(r, s = r, t = {}) {
   return i;
 }
 function Ws(r, s = r, t = {}) {
-  r = new _$3(r);
+  r = new _$2(r);
   let e = !1;
-  if (typeof s == "object" && !_$3.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$3(s), r.rows !== s.rows)
+  if (typeof s == "object" && !_$2.isMatrix(s) && !st$3.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _$2(s), r.rows !== s.rows)
     throw new TypeError("Both matrices must have the same number of rows");
   const { center: n = !0, scale: i = !0 } = t;
   n && (r.center("column"), e || s.center("column")), i && (r.scale("column"), e || s.scale("column"));
@@ -3437,14 +3437,14 @@ let Ne = class {
       throw new Error("Matrix is not a square matrix");
     if (s.isEmpty())
       throw new Error("Matrix must be non-empty");
-    let n = s.columns, i = new _$3(n, n), o = new Float64Array(n), l = new Float64Array(n), h = s, a, u, c = !1;
+    let n = s.columns, i = new _$2(n, n), o = new Float64Array(n), l = new Float64Array(n), h = s, a, u, c = !1;
     if (e ? c = !0 : c = s.isSymmetric(), c) {
       for (a = 0; a < n; a++)
         for (u = 0; u < n; u++)
           i.set(a, u, h.get(a, u));
       Qs(n, l, o, i), Gs(n, l, o, i);
     } else {
-      let g = new _$3(n, n), d = new Float64Array(n);
+      let g = new _$2(n, n), d = new Float64Array(n);
       for (u = 0; u < n; u++)
         for (a = 0; a < n; a++)
           g.set(a, u, h.get(a, u));
@@ -3462,7 +3462,7 @@ let Ne = class {
     return this.V;
   }
   get diagonalMatrix() {
-    let s = this.n, t = this.e, e = this.d, n = new _$3(s, s), i, o;
+    let s = this.n, t = this.e, e = this.d, n = new _$2(s, s), i, o;
     for (i = 0; i < s; i++) {
       for (o = 0; o < s; o++)
         n.set(i, o, 0);
@@ -3532,10 +3532,10 @@ function Gs(r, s, t, e) {
       u++;
     if (u > a)
       do {
-        for (n = t[a], c = (t[a + 1] - n) / (2 * s[a]), g = ut(c, 1), c < 0 && (g = -g), t[a] = s[a] / (c + g), t[a + 1] = s[a] * (c + g), d = t[a + 1], i = n - t[a], o = a + 2; o < r; o++)
+        for (n = t[a], c = (t[a + 1] - n) / (2 * s[a]), g = ut$1(c, 1), c < 0 && (g = -g), t[a] = s[a] / (c + g), t[a + 1] = s[a] * (c + g), d = t[a + 1], i = n - t[a], o = a + 2; o < r; o++)
           t[o] -= i;
         for (R = R + i, c = t[u], w = 1, p = w, P = w, f = s[a + 1], M = 0, E = 0, o = u - 1; o >= a; o--)
-          for (P = p, p = w, E = M, n = w * s[o], i = w * c, g = ut(c, s[o]), s[o + 1] = M * g, M = s[o] / g, w = c / g, c = w * t[o] - M * n, t[o + 1] = i + M * (w * n + M * t[o]), h = 0; h < r; h++)
+          for (P = p, p = w, E = M, n = w * s[o], i = w * c, g = ut$1(c, s[o]), s[o + 1] = M * g, M = s[o] / g, w = c / g, c = w * t[o] - M * n, t[o + 1] = i + M * (w * n + M * t[o]), h = 0; h < r; h++)
             i = e.get(h, o + 1), e.set(h, o + 1, M * e.get(h, o) + w * i), e.set(h, o, w * e.get(h, o) - M * i);
         c = -M * E * P * f * s[a] / d, s[a] = M * c, t[a] = w * c;
       } while (Math.abs(s[a]) > L * v);
@@ -3698,7 +3698,7 @@ class $e {
   constructor(s) {
     if (s = rt$4.checkMatrix(s), !s.isSymmetric())
       throw new Error("Matrix is not symmetric");
-    let t = s, e = t.rows, n = new _$3(e, e), i = !0, o, l, h;
+    let t = s, e = t.rows, n = new _$2(e, e), i = !0, o, l, h;
     for (l = 0; l < e; l++) {
       let a = 0;
       for (h = 0; h < l; h++) {
@@ -3752,7 +3752,7 @@ class Le {
     } = t;
     let l;
     if (e) {
-      if (st$3.isAnyArray(e) && typeof e[0] == "number" ? e = _$3.columnVector(e) : e = rt$4.checkMatrix(e), e.rows !== s.rows)
+      if (st$3.isAnyArray(e) && typeof e[0] == "number" ? e = _$2.columnVector(e) : e = rt$4.checkMatrix(e), e.rows !== s.rows)
         throw new Error("Y should have the same number of rows as X");
       l = e.getColumnVector(0);
     } else
@@ -3771,15 +3771,15 @@ class Le {
       this.w = c.transpose(), this.s = a.transpose().mmul(a).sqrt(), n ? this.t = a.clone().div(this.s.get(0, 0)) : this.t = a, this.xResidual = s.sub(a.mmul(c.transpose()));
   }
 }
-$$1.AbstractMatrix = V$1;
+$$1.AbstractMatrix = V$2;
 $$1.CHO = $e;
 $$1.CholeskyDecomposition = $e;
-$$1.DistanceMatrix = te$1;
+$$1.DistanceMatrix = te$2;
 $$1.EVD = Ne;
 var Js = $$1.EigenvalueDecomposition = Ne;
-$$1.LU = ee$1;
-$$1.LuDecomposition = ee$1;
-var De = $$1.Matrix = _$3;
+$$1.LU = ee$2;
+$$1.LuDecomposition = ee$2;
+var De = $$1.Matrix = _$2;
 $$1.MatrixColumnSelectionView = qs;
 $$1.MatrixColumnView = Cs;
 $$1.MatrixFlipColumnView = Fs;
@@ -3793,14 +3793,14 @@ $$1.NIPALS = Le;
 $$1.Nipals = Le;
 $$1.QR = pe;
 $$1.QrDecomposition = pe;
-$$1.SVD = vt$2;
-$$1.SingularValueDecomposition = vt$2;
-$$1.SymmetricMatrix = pt$1;
+$$1.SVD = vt$1;
+$$1.SingularValueDecomposition = vt$1;
+$$1.SymmetricMatrix = pt$2;
 $$1.WrapperMatrix1D = Ae;
 $$1.WrapperMatrix2D = rt$4;
 $$1.correlation = Ws;
 $$1.covariance = Ys;
-var Re = $$1.default = _$3;
+var Re = $$1.default = _$2;
 $$1.determinant = Xt$1;
 $$1.inverse = Ds;
 $$1.linearDependencies = Bs;
@@ -3822,7 +3822,7 @@ function qt(r, s, t) {
       return [];
     if (i == 0)
       return [-0.5 * n];
-    o = -0.5 * (n + kt$1(Math.sqrt(i), n));
+    o = -0.5 * (n + kt$2(Math.sqrt(i), n));
   } else
     o = -n;
   const l = e / o;
@@ -3837,7 +3837,7 @@ function ze(r, s, t, e) {
     const g = Math.sqrt(-0.25 * u), d = -0.5 * c;
     return [Math.cbrt(d + g) + Math.cbrt(d - g) - n];
   } else if (u == 0) {
-    const g = kt$1(Math.sqrt(-l), c);
+    const g = kt$2(Math.sqrt(-l), c);
     return [g - n, -2 * g - n];
   } else {
     const g = Math.atan2(Math.sqrt(u), -c) / 3, d = Math.cos(g), w = Math.sin(g) * Math.sqrt(3), p = 0.5 * (-d + w), P = 0.5 * (-d - w), f = 2 * Math.sqrt(-l);
@@ -3866,7 +3866,7 @@ function wn$2(r, s, t, e, n) {
     }
   return [];
 }
-function gt$1(r, s) {
+function gt$2(r, s) {
   return s == 0 ? Math.abs(r) : Math.abs((r - s) / s);
 }
 function ve(r, s, t, e, n) {
@@ -3883,13 +3883,13 @@ function ve(r, s, t, e, n) {
 }
 function tn(r, s, t, e, n) {
   function i(x, N, A, O) {
-    const U = gt$1(x + A, r), T = gt$1(N + x * A + O, s), z = gt$1(N * A + x * O, t);
+    const U = gt$2(x + A, r), T = gt$2(N + x * A + O, s), z = gt$2(N * A + x * O, t);
     return U + T + z;
   }
   function o(x, N, A, O) {
-    return i(x, N, A, O) + gt$1(N * O, e);
+    return i(x, N, A, O) + gt$2(N * O, e);
   }
-  const l = 9 * r * r - 24 * s, h = l >= 0 ? -2 * s / (3 * r + kt$1(Math.sqrt(l), r)) : -0.25 * r, a = r + 4 * h, u = s + 3 * h * (r + 2 * h), c = t + h * (2 * s + h * (3 * r + 4 * h)), g = e + h * (t + h * (s + h * (r + h)));
+  const l = 9 * r * r - 24 * s, h = l >= 0 ? -2 * s / (3 * r + kt$2(Math.sqrt(l), r)) : -0.25 * r, a = r + 4 * h, u = s + 3 * h * (r + 2 * h), c = t + h * (2 * s + h * (3 * r + 4 * h)), g = e + h * (t + h * (s + h * (r + h)));
   let d = 0, w = 0;
   const p = 349e100;
   if (n) {
@@ -3904,7 +3904,7 @@ function tn(r, s, t, e, n) {
   const f = r * 0.5, M = 1 / 6 * s + 0.5 * P, E = t - r * M, R = 2 / 3 * s - P - f * f, v = 0.5 * E / R, L = 2 * (e - M * M) / E, S = 0.5 * E / L;
   let k = 0, D = 0, m = 0;
   for (let x = 0; x < 3; x++) {
-    const N = x == 1 ? S : R, A = x == 0 ? v : L, O = gt$1(N + f * f + 2 * M, s), U = gt$1(2 * (N * A + f * M), t), T = gt$1(N * A * A + M * M, e), z = O + U + T;
+    const N = x == 1 ? S : R, A = x == 0 ? v : L, O = gt$2(N + f * f + 2 * M, s), U = gt$2(2 * (N * A + f * M), t), T = gt$2(N * A * A + M * M, e), z = O + U + T;
     (x == 0 || z < m) && (k = N, D = A, m = z);
   }
   const b = k, j = D;
@@ -3954,10 +3954,10 @@ function en$1(r, s) {
     r > 0 ? n = 0 : n = Math.sqrt(-r);
   else if (i !== null ? i < 0 : e * e < t * t * t) {
     const a = i !== null ? e / t / Math.sqrt(t) : e / Math.sqrt(t * t * t);
-    n = -2 * Math.sqrt(t) * kt$1(Math.cos(Math.acos(Math.abs(a)) * (1 / 3)), a);
+    n = -2 * Math.sqrt(t) * kt$2(Math.cos(Math.acos(Math.abs(a)) * (1 / 3)), a);
   } else {
     let a;
-    i !== null ? Math.abs(t) < Math.abs(e) ? a = -e * (1 + Math.sqrt(i)) : a = -e - kt$1(Math.sqrt(Math.abs(t)) * t * Math.sqrt(i), e) : a = Math.cbrt(-e - kt$1(Math.sqrt(e * e - t * t * t), e));
+    i !== null ? Math.abs(t) < Math.abs(e) ? a = -e * (1 + Math.sqrt(i)) : a = -e - kt$2(Math.sqrt(Math.abs(t)) * t * Math.sqrt(i), e) : a = Math.cbrt(-e - kt$2(Math.sqrt(e * e - t * t * t), e));
     const u = a == 0 ? 0 : t / a;
     n = a + u;
   }
@@ -3977,13 +3977,13 @@ function en$1(r, s) {
   }
   return o;
 }
-function kt$1(r, s) {
+function kt$2(r, s) {
   const t = Math.abs(r);
   return s < 0 ? -t : t;
 }
-function sn$1(r, s = 1e-9) {
+function sn(r, s = 1e-9) {
   if (r[r.length - 1] == 0)
-    return sn$1(r.slice(0, -1), s);
+    return sn(r.slice(0, -1), s);
   const t = new Hs([
     r.slice(0, -1).reverse().map((n) => -n / r[r.length - 1]),
     ...Array.from({ length: r.length - 2 }, (n, i) => {
@@ -3996,24 +3996,24 @@ function sn$1(r, s = 1e-9) {
   );
 }
 const nn$1 = (r, s, t) => [r[0] * (1 - t) + s[0] * t, r[1] * (1 - t) + s[1] * t];
-function rn$1(r) {
+function rn(r) {
   const s = [];
   for (let t = 0; t < r.length - 1; t++)
     s.push([r[t], r[t + 1]]);
   return s;
 }
 function de$1(r, s) {
-  const t = rn$1(r).map(([e, n]) => nn$1(e, n, s));
+  const t = rn(r).map(([e, n]) => nn$1(e, n, s));
   return r.length === 2 ? [t] : [...de$1(t, s), t];
 }
-let Et$1 = class Et extends xt$1 {
+let Et$1 = class Et extends xt$2 {
   constructor(t, e, n, i) {
     super(t, e);
-    q$2(this, "segmentType", "CUBIC_BEZIER");
-    q$2(this, "firstControlPoint");
-    q$2(this, "lastControlPoint");
-    q$2(this, "_boundingBox", null);
-    q$2(this, "_polynomialCoefficients", null);
+    q$1(this, "segmentType", "CUBIC_BEZIER");
+    q$1(this, "firstControlPoint");
+    q$1(this, "lastControlPoint");
+    q$1(this, "_boundingBox", null);
+    q$1(this, "_polynomialCoefficients", null);
     this.firstControlPoint = n, this.lastControlPoint = i;
   }
   get midPoint() {
@@ -4067,10 +4067,10 @@ let Et$1 = class Et extends xt$1 {
     );
   }
   isSame(t) {
-    return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && Y$2(this.firstControlPoint, t.firstControlPoint) && Y$2(this.lastControlPoint, t.lastControlPoint);
+    return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y$3(this.firstPoint, t.firstPoint) && Y$3(this.lastPoint, t.lastPoint) && Y$3(this.firstControlPoint, t.firstControlPoint) && Y$3(this.lastControlPoint, t.lastControlPoint);
   }
   distanceFrom(t) {
-    const n = Ce((i) => Rt$1(this.paramPoint(i), t), this.precision);
+    const n = Ce((i) => Rt$2(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
       J$3(this.firstPoint, t),
       J$3(this.lastPoint, t)
@@ -4094,8 +4094,8 @@ let Et$1 = class Et extends xt$1 {
     ];
   }
   secondDerivativeAt(t) {
-    const e = it$3(this.firstPoint, this.lastControlPoint), n = nt$2(this.firstControlPoint, 2), i = it$3(this.firstControlPoint, this.lastPoint), o = nt$2(this.lastControlPoint, 2), l = nt$2(Q$2(e, n), 6 * (1 - t)), h = nt$2(Q$2(i, o), 6 * t);
-    return it$3(l, h);
+    const e = it$2(this.firstPoint, this.lastControlPoint), n = nt$2(this.firstControlPoint, 2), i = it$2(this.firstControlPoint, this.lastPoint), o = nt$2(this.lastControlPoint, 2), l = nt$2(Q$2(e, n), 6 * (1 - t)), h = nt$2(Q$2(i, o), 6 * t);
+    return it$2(l, h);
   }
   tangentAt(t) {
     const e = this.pointToParam(t);
@@ -4203,8 +4203,8 @@ let Et$1 = class Et extends xt$1 {
     return ze(e - t, n, i, o).filter((l) => l >= -this.precision && l <= 1 + this.precision);
   }
   pointToParam(t) {
-    if (Y$2(t, this.firstPoint, this.precision)) return 0;
-    if (Y$2(t, this.lastPoint, this.precision)) return 1;
+    if (Y$3(t, this.firstPoint, this.precision)) return 0;
+    if (Y$3(t, this.lastPoint, this.precision)) return 1;
     const e = this.paramsAtY(t[1]);
     if (e.length === 0)
       throw new Error("Point is not on the curve");
@@ -4214,32 +4214,32 @@ let Et$1 = class Et extends xt$1 {
     return i;
   }
 };
-let jt$1 = class jt extends xt$1 {
+let jt$1 = class jt extends xt$2 {
   constructor(t, e, n, i, o, l, h = !1, {
     ignoreChecks: a = !1,
     angleUnits: u = "deg"
   } = {}) {
     super(t, e);
-    q$2(this, "segmentType", "ELLIPSE_ARC");
+    q$1(this, "segmentType", "ELLIPSE_ARC");
     // I would need to do some more work to improve the precision that I can have
     // on an ellipse with intersection algorithms
-    q$2(this, "precision", 1e-6);
-    q$2(this, "majorRadius");
-    q$2(this, "minorRadius");
-    q$2(this, "center");
-    q$2(this, "tiltAngle");
-    q$2(this, "clockwise");
-    q$2(this, "_coefficients", null);
-    q$2(this, "_boundingBox");
-    q$2(this, "_linearExentricity");
-    q$2(this, "_exentricity");
-    q$2(this, "_focals");
-    q$2(this, "_ellipseReferenceFrameTransform");
-    q$2(this, "_reverseEllipseReferenceFrameTransform");
-    q$2(this, "_rotateFromEllipseReferenceFrame");
-    q$2(this, "_firstAngle");
-    q$2(this, "_lastAngle");
-    q$2(this, "_deltaAngle");
+    q$1(this, "precision", 1e-6);
+    q$1(this, "majorRadius");
+    q$1(this, "minorRadius");
+    q$1(this, "center");
+    q$1(this, "tiltAngle");
+    q$1(this, "clockwise");
+    q$1(this, "_coefficients", null);
+    q$1(this, "_boundingBox");
+    q$1(this, "_linearExentricity");
+    q$1(this, "_exentricity");
+    q$1(this, "_focals");
+    q$1(this, "_ellipseReferenceFrameTransform");
+    q$1(this, "_reverseEllipseReferenceFrameTransform");
+    q$1(this, "_rotateFromEllipseReferenceFrame");
+    q$1(this, "_firstAngle");
+    q$1(this, "_lastAngle");
+    q$1(this, "_deltaAngle");
     this.center = n;
     const c = i >= o;
     this.majorRadius = c ? i : o, this.minorRadius = c ? o : i;
@@ -4247,17 +4247,17 @@ let jt$1 = class jt extends xt$1 {
     if (this.tiltAngle = wt$2(
       c ? g : g + Math.PI / 2
     ), this.clockwise = h, !a) {
-      if (Y$2(t, e))
+      if (Y$3(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (!this.isPointOnEllipse(t))
         throw new Error(
-          `First point ${Z$1(
+          `First point ${Z$2(
             t
           )} not on the ellipse defined by ${this.info}`
         );
       if (!this.isPointOnEllipse(e))
         throw new Error(
-          `Last point ${Z$1(e)} not on the ellipse defined by ${this.info}`
+          `Last point ${Z$2(e)} not on the ellipse defined by ${this.info}`
         );
       if (Math.abs(this.majorRadius - this.minorRadius) < this.precision)
         throw new Error(
@@ -4280,9 +4280,9 @@ let jt$1 = class jt extends xt$1 {
     return this._coefficients;
   }
   get info() {
-    return `ELLIPSE_ARC(${Z$1(this.firstPoint)}, ${Z$1(
+    return `ELLIPSE_ARC(${Z$2(this.firstPoint)}, ${Z$2(
       this.lastPoint
-    )}, ${Z$1(this.center)}, ${this.majorRadius}, ${this.minorRadius}, ${this.tiltAngle * Ue}, ${this.clockwise ? "CW" : "CCW"})`;
+    )}, ${Z$2(this.center)}, ${this.majorRadius}, ${this.minorRadius}, ${this.tiltAngle * Ue}, ${this.clockwise ? "CW" : "CCW"})`;
   }
   reverse() {
     return new jt(
@@ -4335,14 +4335,14 @@ let jt$1 = class jt extends xt$1 {
     if (this._focals === void 0) {
       const t = this.majorAxis;
       this._focals = [
-        it$3(this.center, nt$2(t, this.linearExentricity)),
-        it$3(this.center, nt$2(t, -this.linearExentricity))
+        it$2(this.center, nt$2(t, this.linearExentricity)),
+        it$2(this.center, nt$2(t, -this.linearExentricity))
       ];
     }
     return this._focals;
   }
   get majorAxis() {
-    return Tt(1, this.tiltAngle);
+    return Tt$1(1, this.tiltAngle);
   }
   paramPoint(t) {
     const e = this.firstAngle + t * this.deltaAngle * (this.clockwise ? -1 : 1);
@@ -4354,12 +4354,12 @@ let jt$1 = class jt extends xt$1 {
   pointToParam(t) {
     if (!this.isPointOnEllipse(t))
       throw new Error(
-        `Point ${Z$1(t)} not on the ellipse defined by ${this.repr}`
+        `Point ${Z$2(t)} not on the ellipse defined by ${this.repr}`
       );
     const e = this.thetaToParam(this.pointTheta(t));
     if (!this.isValidParameter(e))
       throw new Error(
-        `Point ${Z$1(t)} is not on segment ${this.repr}`
+        `Point ${Z$2(t)} is not on segment ${this.repr}`
       );
     return e;
   }
@@ -4370,7 +4370,7 @@ let jt$1 = class jt extends xt$1 {
     return 1 - t >= -this.precision && t >= -this.precision;
   }
   isSame(t) {
-    return Y$2(this.center, t.center) && Math.abs(this.majorRadius - t.majorRadius) < this.precision && Math.abs(this.minorRadius - t.minorRadius) < this.precision && (Math.abs(this.tiltAngle - t.tiltAngle) < this.precision || Math.abs(Math.abs(this.tiltAngle - t.tiltAngle) - Math.PI) < this.precision) && (Y$2(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || Y$2(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
+    return Y$3(this.center, t.center) && Math.abs(this.majorRadius - t.majorRadius) < this.precision && Math.abs(this.minorRadius - t.minorRadius) < this.precision && (Math.abs(this.tiltAngle - t.tiltAngle) < this.precision || Math.abs(Math.abs(this.tiltAngle - t.tiltAngle) - Math.PI) < this.precision) && (Y$3(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || Y$3(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
   }
   pointTheta(t) {
     const e = this.ellipseReferenceFrameTransform.transform(t), n = Math.atan2(
@@ -4391,11 +4391,11 @@ let jt$1 = class jt extends xt$1 {
   }
   distanceFrom(t) {
     let e;
-    if (Y$2(t, this.center) ? e = it$3(
+    if (Y$3(t, this.center) ? e = it$2(
       this.center,
       nt$2(tt$3(this.majorAxis), this.minorRadius)
     ) : e = this.reverseEllipseReferenceFrameTransform.transform(
-      ln$1(
+      ln(
         this.majorRadius,
         this.minorRadius,
         this.ellipseReferenceFrameTransform.transform(t)
@@ -4501,7 +4501,7 @@ let jt$1 = class jt extends xt$1 {
   }
 };
 function pn$1(r, s, t, e, n, i, o) {
-  const { center: l, rx: h, ry: a } = on$1(
+  const { center: l, rx: h, ry: a } = on(
     r,
     s,
     t,
@@ -4512,7 +4512,7 @@ function pn$1(r, s, t, e, n, i, o) {
   );
   return Math.abs(h - a) < 1e-9 ? new ct$3(r, s, l, o) : new jt$1(r, s, l, h, a, n, o);
 }
-function on$1([r, s], [t, e], n, i, o, l, h) {
+function on([r, s], [t, e], n, i, o, l, h) {
   if (n < 0 && (n = -n), i < 0 && (i = -i), n == 0 || i == 0)
     throw Error("rx and ry can not be 0");
   const a = Math.sin(o), u = Math.cos(o), c = (r - t) / 2, g = (s - e) / 2, d = (r + t) / 2, w = (s + e) / 2, p = u * c + a * g, P = u * g - a * c, f = p * p / (n * n) + P * P / (i * i);
@@ -4529,7 +4529,7 @@ function on$1([r, s], [t, e], n, i, o, l, h) {
     ry: i
   };
 }
-function ln$1(r, s, t) {
+function ln(r, s, t) {
   const e = Math.abs(t[0]), n = Math.abs(t[1]);
   let i = 0.707, o = 0.707;
   const l = r, h = s;
@@ -4541,13 +4541,13 @@ function ln$1(r, s, t) {
   }
   return [l * i * Math.sign(t[0]), h * o * Math.sign(t[1])];
 }
-let _t$1 = class _t extends xt$1 {
+let _t$1 = class _t extends xt$2 {
   constructor(t, e, n) {
     super(t, e);
-    q$2(this, "segmentType", "QUADRATIC_BEZIER");
-    q$2(this, "controlPoint");
-    q$2(this, "_boundingBox", null);
-    q$2(this, "_polynomialCoefficients", null);
+    q$1(this, "segmentType", "QUADRATIC_BEZIER");
+    q$1(this, "controlPoint");
+    q$1(this, "_boundingBox", null);
+    q$1(this, "_polynomialCoefficients", null);
     this.controlPoint = n;
   }
   get midPoint() {
@@ -4592,10 +4592,10 @@ let _t$1 = class _t extends xt$1 {
     );
   }
   isSame(t) {
-    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && Y$2(this.controlPoint, t.controlPoint);
+    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y$3(this.firstPoint, t.firstPoint) && Y$3(this.lastPoint, t.lastPoint) && Y$3(this.controlPoint, t.controlPoint);
   }
   distanceFrom(t) {
-    const n = Ce((i) => Rt$1(this.paramPoint(i), t), this.precision);
+    const n = Ce((i) => Rt$2(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
       J$3(this.firstPoint, t),
       J$3(this.lastPoint, t)
@@ -4621,7 +4621,7 @@ let _t$1 = class _t extends xt$1 {
   secondDerivativeAt(t) {
     return nt$2(
       Q$2(
-        it$3(this.firstPoint, this.lastPoint),
+        it$2(this.firstPoint, this.lastPoint),
         nt$2(this.controlPoint, 2)
       ),
       2
@@ -4737,7 +4737,7 @@ let _t$1 = class _t extends xt$1 {
 
 var nn = Object.defineProperty;
 var en = (t, n, e) => n in t ? nn(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var C = (t, n, e) => en(t, typeof n != "symbol" ? n + "" : n, e);
+var C$1 = (t, n, e) => en(t, typeof n != "symbol" ? n + "" : n, e);
 function dn$1(t, n) {
   const e = Q$2(n, t.firstPoint), s = Pe(e, t.V) / t.squareLength;
   return t.paramPoint(s);
@@ -4751,9 +4751,9 @@ function K$2(t, n, e) {
   }
   const l = [], r = Math.sqrt(
     n.radius * n.radius - o * o
-  ), u = t.tangentAtFirstPoint, a = it$3(i, nt$2(u, r));
+  ), u = t.tangentAtFirstPoint, a = it$2(i, nt$2(u, r));
   t.isOnSegment(a) && n.isOnSegment(a) && l.push(a);
-  const f = it$3(i, nt$2(u, -r));
+  const f = it$2(i, nt$2(u, -r));
   return t.isOnSegment(f) && n.isOnSegment(f) && l.push(f), l;
 }
 const mn$1 = (t) => {
@@ -4779,7 +4779,7 @@ const mn$1 = (t) => {
   if (e.length === 2)
     return t.isSame(mn$1(n)) ? [] : [new ct$3(e[0], e[1], t.center, t.clockwise)];
   if (e.length === 3) {
-    const s = Y$2(e[0], n.lastPoint) || Y$2(e[0], n.firstPoint) ? 1 : 0;
+    const s = Y$3(e[0], n.lastPoint) || Y$3(e[0], n.firstPoint) ? 1 : 0;
     return [
       new ct$3(
         e[0 + s],
@@ -4795,7 +4795,7 @@ const mn$1 = (t) => {
     ];
   throw new Error("Bug in the arc arc overlap algorithm");
 };
-function Dt(t, n, e = !1, s) {
+function Dt$1(t, n, e = !1, s) {
   const i = s || t.precision, o = J$3(t.center, n.center), l = t.radius + n.radius;
   if (o > l + i)
     return [];
@@ -4810,18 +4810,18 @@ function Dt(t, n, e = !1, s) {
     a || // circles are inside each other
     Math.abs(o - r) < i
   ) {
-    const g = a || t.radius > n.radius ? 1 : -1, w = it$3(
+    const g = a || t.radius > n.radius ? 1 : -1, w = it$2(
       t.center,
       nt$2(u, g * t.radius)
     );
     return t.isOnSegment(w) && n.isOnSegment(w) ? [w] : [];
   }
-  const f = t.radius * t.radius / (2 * o) - n.radius * n.radius / (2 * o) + o / 2, c = it$3(
+  const f = t.radius * t.radius / (2 * o) - n.radius * n.radius / (2 * o) + o / 2, c = it$2(
     t.center,
     nt$2(u, f)
   ), h = Math.sqrt(
     t.radius * t.radius - f * f
-  ), p = tt$3(u), d = it$3(c, nt$2(p, h)), m = it$3(c, nt$2(p, -h)), x = [];
+  ), p = tt$3(u), d = it$2(c, nt$2(p, h)), m = it$2(c, nt$2(p, -h)), x = [];
   return t.isOnSegment(d) && n.isOnSegment(d) && x.push(d), t.isOnSegment(m) && n.isOnSegment(m) && x.push(m), x;
 }
 function st$2(t, n, e = 1e-9) {
@@ -4853,14 +4853,14 @@ function st$2(t, n, e = 1e-9) {
   ];
   return c([m, x]);
 }
-function Rt(t, n) {
+function Rt$1(t, n) {
   const e = Math.max(t.precision, n.precision), s = t.coefficients, i = s.x2, o = s.xy, l = s.y2, r = s.x, u = s.y, a = s.c, f = n.coefficients, c = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, x = f.c, g = {
     z0: a * i * d * d + i * i * x * x - r * i * d * x + c * c * a * a - 2 * i * x * c * a - r * d * c * a + c * r * r * x,
     z1: m * r * r * c - x * d * i * o - 2 * i * x * c * u - a * c * h * r + 2 * d * h * i * a + 2 * m * x * i * i + d * d * i * u - m * d * i * r - 2 * i * m * c * a - a * c * d * o + 2 * a * u * c * c - x * h * i * r - u * c * d * r + 2 * x * o * c * r,
     z2: m * m * i * i + 2 * p * x * i * i - u * c * d * o + x * c * o * o - u * c * h * r - x * h * i * o - 2 * i * m * c * u + 2 * d * h * i * u - p * d * i * r - 2 * i * p * c * a + h * h * i * a + 2 * m * o * c * r + u * u * c * c - l * c * d * r - m * h * i * r + 2 * a * l * c * c - a * c * h * o + p * r * r * c + d * d * i * l - m * d * i * o - 2 * i * x * c * l,
     z3: -2 * i * c * l * m + m * c * o * o + 2 * p * o * c * r - l * c * h * r + h * h * i * u - m * h * i * o - 2 * i * p * c * u - u * c * h * o - p * h * i * r + 2 * m * p * i * i + 2 * u * l * c * c - l * c * d * o + 2 * d * h * i * l - p * d * i * o,
     z4: i * i * p * p - 2 * i * p * c * l + c * c * l * l - o * i * h * p - o * h * c * l + o * o * c * p + l * i * h * h
-  }, F = sn$1(
+  }, F = sn(
     [g.z0, g.z1, g.z2, g.z3, g.z4],
     e
   ).flatMap((y) => {
@@ -4878,8 +4878,8 @@ function Rt(t, n) {
   });
   return Te(F, e);
 }
-function gt(t, n) {
-  return Rt(t, n).filter((s) => t.isOnSegment(s) && n.isOnSegment(s));
+function gt$1(t, n) {
+  return Rt$1(t, n).filter((s) => t.isOnSegment(s) && n.isOnSegment(s));
 }
 const Pn$1 = (t) => {
   const {
@@ -4931,7 +4931,7 @@ const Pn$1 = (t) => {
   if (s.length === 2)
     return t.isSame(Pn$1(n)) ? [] : [e(s[0], s[1])];
   if (s.length === 3) {
-    const i = Y$2(s[0], n.lastPoint) || Y$2(s[0], n.firstPoint) ? 1 : 0;
+    const i = Y$3(s[0], n.lastPoint) || Y$3(s[0], n.firstPoint) ? 1 : 0;
     return [e(s[0 + i], s[1 + i])];
   } else if (s.length === 4)
     return [e(s[0], s[1]), e(s[2], s[3])];
@@ -4939,7 +4939,7 @@ const Pn$1 = (t) => {
 };
 function xn$1(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
-  return Y$2(t.center, n.center) && Math.abs(t.majorRadius - n.majorRadius) < s && Math.abs(t.minorRadius - n.minorRadius) < s && (Math.abs(t.tiltAngle - n.tiltAngle) < s || Math.abs(Math.abs(t.tiltAngle - n.tiltAngle) - Math.PI) < s) ? e ? wn$1(t, n) : [] : Rt(t, n).filter((l) => t.isOnSegment(l) && n.isOnSegment(l));
+  return Y$3(t.center, n.center) && Math.abs(t.majorRadius - n.majorRadius) < s && Math.abs(t.minorRadius - n.minorRadius) < s && (Math.abs(t.tiltAngle - n.tiltAngle) < s || Math.abs(Math.abs(t.tiltAngle - n.tiltAngle) - Math.PI) < s) ? e ? wn$1(t, n) : [] : Rt$1(t, n).filter((l) => t.isOnSegment(l) && n.isOnSegment(l));
 }
 function Pt$1(t, n) {
   const [e, s] = t.firstPoint, [i, o] = t.lastPoint, l = new et$4().translate(-e, -s).rotate(-Math.atan2(o - s, i - e)), r = l.clone().inverse(), u = n.transform(l);
@@ -4949,7 +4949,7 @@ const Sn$1 = (t, n = 1e-9) => {
   let e = t;
   return Math.abs(t) < n && (e = 0), e.toFixed(-Math.log10(n));
 };
-function Vt(t, n = 1e-9) {
+function Vt$1(t, n = 1e-9) {
   return Array.from(
     new Map(t.map((e) => [Sn$1(e, n), e])).values()
   );
@@ -4959,20 +4959,20 @@ const yn$1 = (t, n) => {
   return [q, H, Wt, Jt, Kt, Zt, tn];
 };
 function wt$1(t, n) {
-  const e = Math.max(t.precision, n.precision), s = yn$1(t, n), i = sn$1(s, e).filter((o) => o >= -n.precision && o <= 1 + n.precision);
-  return Vt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
+  const e = Math.max(t.precision, n.precision), s = yn$1(t, n), i = sn(s, e).filter((o) => o >= -n.precision && o <= 1 + n.precision);
+  return Vt$1(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
 }
 const bn$1 = (t, n) => {
   const [[e, s, i], [o, l, r]] = n.polynomialCoefficients, u = t.coefficients, a = u.x2, f = u.xy, c = u.y2, h = u.x, p = u.y, d = u.c, m = e * e, x = s * s, g = i * i, w = o * o, F = l * l, y = r * r, R = a * m + f * e * o + c * w + h * e + p * o + d, T = 2 * a * e * s + f * e * l + f * s * o + 2 * c * o * l + h * s + p * l, L = 2 * a * e * i + a * x + f * e * r + f * s * l + f * i * o + 2 * c * o * r + c * F + h * i + p * r, j = 2 * a * s * i + f * s * r + f * i * l + 2 * c * l * r, q = a * g + f * i * r + c * y;
   return [R, T, L, j, q];
 };
-function xt(t, n) {
+function xt$1(t, n) {
   const e = Math.max(t.precision, n.precision), s = bn$1(t, n), i = wn$2(...s).filter((o) => o >= -n.precision && o <= 1 + n.precision);
-  return Vt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
+  return Vt$1(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
 }
 function E(t, { firstPoint: n, lastPoint: e }, s = 1e-9) {
   const i = Q$2(e, n);
-  return Math.abs(i[0]) < s ? i[1] > 0 ? n[0] - t[0] : t[0] - n[0] : Math.abs(i[1]) < s ? i[0] > 0 ? t[1] - n[1] : n[1] - t[1] : St$2(i, Q$2(t, n)) / an$1(i);
+  return Math.abs(i[0]) < s ? i[1] > 0 ? n[0] - t[0] : t[0] - n[0] : Math.abs(i[1]) < s ? i[0] > 0 ? t[1] - n[1] : n[1] - t[1] : St$1(i, Q$2(t, n)) / an(i);
 }
 let ct$2 = class ct {
   constructor(n, e, s, i) {
@@ -5001,15 +5001,15 @@ function An$1(t) {
     Math.max(0, n / 2)
   );
 }
-function En(t) {
+function En$1(t) {
   if (t instanceof Et$1)
     return In$1(t);
   if (t instanceof _t$1)
     return An$1(t);
   throw new Error("Not implemented");
 }
-function Fn(t) {
-  const n = t.paramPoint(0.5), e = tt$3(Q$2(n, t.firstPoint)), s = it$3(n, e), i = {
+function Fn$1(t) {
+  const n = t.paramPoint(0.5), e = tt$3(Q$2(n, t.firstPoint)), s = it$2(n, e), i = {
     firstPoint: n,
     lastPoint: s
   }, o = [
@@ -5026,7 +5026,7 @@ function Fn(t) {
     Math.max(...o)
   );
 }
-function St$1(t, n) {
+function St(t, n) {
   const e = [];
   for (let s = 1; s < t.length; s++) {
     const i = t[s];
@@ -5044,7 +5044,7 @@ function St$1(t, n) {
   }
   return e;
 }
-let Y$1 = class Y {
+let Y$2 = class Y {
   constructor(n, e) {
     this.from = n, this.to = e;
   }
@@ -5055,9 +5055,9 @@ let Y$1 = class Y {
     return this.from === "start" ? this.to === "end" ? n : n.splitAtParameters([this.to])[0] : this.to === "end" ? n.splitAtParameters([this.from])[1] : n.splitAtParameters([this.from, this.to])[1];
   }
 };
-function vn(t, n) {
+function vn$1(t, n) {
   if (t instanceof Et$1)
-    return new kn([
+    return new kn$1([
       E(t.firstPoint, n),
       E(t.firstControlPoint, n),
       E(t.lastControlPoint, n),
@@ -5073,8 +5073,8 @@ function vn(t, n) {
 }
 let Bn$1 = class Bn {
   constructor(n) {
-    C(this, "topHull", []);
-    C(this, "bottomHull", []);
+    C$1(this, "topHull", []);
+    C$1(this, "bottomHull", []);
     this.distances = n;
     const [e, s, i] = n, o = [0, e], l = [1 / 2, s], r = [1, i], u = i - e, a = e;
     s - (u * (1 / 2) + a) > 0 ? (this.topHull = [o, l, r], this.bottomHull = [o, r]) : (this.topHull = [o, r], this.bottomHull = [o, l, r]);
@@ -5086,10 +5086,10 @@ let Bn$1 = class Bn {
     return this.distances[2];
   }
 };
-class kn {
+let kn$1 = class kn {
   constructor(n) {
-    C(this, "topHull", []);
-    C(this, "bottomHull", []);
+    C$1(this, "topHull", []);
+    C$1(this, "bottomHull", []);
     this.distances = n;
     const [e, s, i, o] = n, l = [0, e], r = [1 / 3, s], u = [2 / 3, i], a = [1, o], f = o - e, c = e, h = s - (f * (1 / 3) + c), p = i - (f * (2 / 3) + c);
     let d = null, m = null;
@@ -5107,53 +5107,53 @@ class kn {
   get endDistance() {
     return this.distances[3];
   }
-}
+};
 function yt$1(t, n) {
-  const e = vn(n, t), s = St$1(
+  const e = vn$1(n, t), s = St(
     e.topHull,
     t.negativeThickness
-  ), i = St$1(
+  ), i = St(
     e.bottomHull,
     t.positiveThickness
   ), o = e.endDistance >= t.negativeThickness && e.endDistance <= t.positiveThickness;
   if (!s.length && !i.length)
-    return o ? new Y$1("start", "end") : null;
+    return o ? new Y$2("start", "end") : null;
   if (s.length === 1 && i.length === 1)
-    return new Y$1(s[0], i[0]);
+    return new Y$2(s[0], i[0]);
   if (s.length === 2 && i.length === 2)
     throw new Error(
       "Bug in the clipping algorithm, unexpected number of crossing points"
     );
   const l = s.length ? s : i;
-  return l.length === 2 ? new Y$1(l[0], l[1]) : o ? new Y$1(l[0], "end") : new Y$1("start", l[0]);
+  return l.length === 2 ? new Y$2(l[0], l[1]) : o ? new Y$2(l[0], "end") : new Y$2("start", l[0]);
 }
-function bt$1(t, n) {
-  const e = En(t), s = yt$1(e, n);
+function bt(t, n) {
+  const e = En$1(t), s = yt$1(e, n);
   if (!s)
     return null;
-  const i = Fn(t), o = yt$1(
+  const i = Fn$1(t), o = yt$1(
     i,
     n
   );
   return o ? s.size > o.size ? o.clipCurve(n) : s.clipCurve(n) : null;
 }
-const W$3 = (t) => t instanceof _t$1 ? It$2(Q$2(t.controlPoint, t.firstPoint)) + It$2(Q$2(t.controlPoint, t.lastPoint)) : It$2(Q$2(t.firstControlPoint, t.firstPoint)) + It$2(Q$2(t.lastControlPoint, t.firstControlPoint)) + It$2(Q$2(t.lastControlPoint, t.lastPoint));
+const W$2 = (t) => t instanceof _t$1 ? It$1(Q$2(t.controlPoint, t.firstPoint)) + It$1(Q$2(t.controlPoint, t.lastPoint)) : It$1(Q$2(t.firstControlPoint, t.firstPoint)) + It$1(Q$2(t.lastControlPoint, t.firstControlPoint)) + It$1(Q$2(t.lastControlPoint, t.lastPoint));
 function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
   const i = Math.max(e * e, Number.EPSILON * 10);
-  let o = t, l = n, r = W$3(o), u = W$3(l);
+  let o = t, l = n, r = W$2(o), u = W$2(l);
   for (let a = 0; a < s; a++) {
-    const f = r > i ? bt$1(l, o) : o;
+    const f = r > i ? bt(l, o) : o;
     if (!f) return [];
-    const c = W$3(f), h = u > i ? bt$1(f, l) : l;
+    const c = W$2(f), h = u > i ? bt(f, l) : l;
     if (!h) return [];
-    const p = W$3(h);
+    const p = W$2(h);
     if (c <= i && p <= i)
       return [
         f.boundingBox.intersection(h.boundingBox).center
       ];
-    if (Y$2(f.firstPoint, f.lastPoint) && h.isOnSegment(f.firstPoint))
+    if (Y$3(f.firstPoint, f.lastPoint) && h.isOnSegment(f.firstPoint))
       return [f.firstPoint];
-    if (Y$2(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
+    if (Y$3(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
       return [h.firstPoint];
     if (c > 0.8 * r && p > 0.8 * u)
       if (c / r > p / u) {
@@ -5205,11 +5205,11 @@ function On$1(t, n) {
   if (e.length === 2)
     return [t.splitAt(e)[1]];
   if (e.length === 3)
-    return Y$2(e[0], t.firstPoint) && Y$2(e[1], t.lastPoint) ? [t] : [n];
+    return Y$3(e[0], t.firstPoint) && Y$3(e[1], t.lastPoint) ? [t] : [n];
   if (e.length === 4)
     return [t];
 }
-function _n(t, n, e = !1) {
+function _n$1(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
   if (e) {
     const i = On$1(t, n);
@@ -5232,11 +5232,11 @@ function Tn$1(t, n) {
   if (e.length === 2)
     return [t.splitAt(e)[1]];
   if (e.length === 3)
-    return Y$2(e[0], t.firstPoint) && Y$2(e[1], t.lastPoint) ? [t] : [n];
+    return Y$3(e[0], t.firstPoint) && Y$3(e[1], t.lastPoint) ? [t] : [n];
   if (e.length === 4)
     return [t];
 }
-function Ln(t, n, e = !1) {
+function Ln$1(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
   if (e) {
     const i = Tn$1(t, n);
@@ -5247,7 +5247,7 @@ function Ln(t, n, e = !1) {
 }
 function de(t, n, e) {
   if (t instanceof at$3 && n instanceof at$3) {
-    const s = cn$1(
+    const s = cn(
       t,
       n,
       !1,
@@ -5260,12 +5260,12 @@ function de(t, n, e) {
   if (t instanceof ct$3 && n instanceof at$3)
     return K$2(n, t, e);
   if (t instanceof ct$3 && n instanceof ct$3)
-    return Dt(t, n, !1, e);
+    return Dt$1(t, n, !1, e);
   throw new Error("Not implemented");
 }
-function Z(t, n, e) {
+function Z$1(t, n, e) {
   if (t instanceof at$3 && n instanceof at$3) {
-    const s = cn$1(
+    const s = cn(
       t,
       n,
       !0,
@@ -5284,7 +5284,7 @@ function Z(t, n, e) {
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (t instanceof ct$3 && n instanceof ct$3) {
-    const s = Dt(
+    const s = Dt$1(
       t,
       n,
       !0,
@@ -5317,11 +5317,11 @@ function Z(t, n, e) {
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (t instanceof ct$3 && n instanceof jt$1) {
-    const s = gt(t, n);
+    const s = gt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (n instanceof ct$3 && t instanceof jt$1) {
-    const s = gt(n, t);
+    const s = gt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (t instanceof jt$1 && n instanceof jt$1) {
@@ -5349,11 +5349,11 @@ function Z(t, n, e) {
     return { intersections: s, overlaps: [], count: s.length };
   }
   if ((t instanceof ct$3 || t instanceof jt$1) && n instanceof _t$1) {
-    const s = xt(t, n);
+    const s = xt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
   if ((n instanceof ct$3 || n instanceof jt$1) && t instanceof _t$1) {
-    const s = xt(n, t);
+    const s = xt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
   if ((t instanceof ct$3 || t instanceof jt$1) && n instanceof Et$1) {
@@ -5365,7 +5365,7 @@ function Z(t, n, e) {
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (t instanceof _t$1 && n instanceof _t$1) {
-    const s = Ln(
+    const s = Ln$1(
       t,
       n
     );
@@ -5384,7 +5384,7 @@ function Z(t, n, e) {
     return { intersections: s, overlaps: [], count: s.length };
   }
   if (t instanceof Et$1 && n instanceof Et$1) {
-    const s = _n(
+    const s = _n$1(
       t,
       n
     );
@@ -5407,15 +5407,15 @@ function Nt(t) {
       n.push([e, s]);
   return n;
 }
-function* it$2(t) {
+function* it$1(t) {
   for (const [n, e] of Nt(t.length))
     n !== e && (yield [t[n], t[e]]);
 }
-class Ut extends Ze {
+let Ut$1 = class Ut extends Ze {
   constructor(e, { ignoreChecks: s = !1 } = {}) {
     super();
-    C(this, "segments");
-    C(this, "_boundingBox", null);
+    C$1(this, "segments");
+    C$1(this, "_boundingBox", null);
     s || jt(e), this.segments = e;
   }
   get repr() {
@@ -5441,12 +5441,12 @@ class Ut extends Ze {
   intersects(e) {
     return this.boundingBox.overlaps(e.boundingBox) ? this.segments.some(
       (s) => e.segments.some(
-        (i) => Z(s, i).count > 0
+        (i) => Z$1(s, i).count > 0
       )
     ) : !1;
   }
   overlappingSegments(e) {
-    return this.segments.flatMap((s) => e.segments.flatMap((i) => s.boundingBox.overlaps(i.boundingBox) ? Z(s, i).overlaps : []));
+    return this.segments.flatMap((s) => e.segments.flatMap((i) => s.boundingBox.overlaps(i.boundingBox) ? Z$1(s, i).overlaps : []));
   }
   get boundingBox() {
     if (this._boundingBox === null) {
@@ -5460,31 +5460,31 @@ class Ut extends Ze {
   [Symbol.for("nodejs.util.inspect.custom")]() {
     return this.repr;
   }
-}
+};
 function qn(t, n = "Stroke") {
   Nt(t.length).forEach(
     ([e, s]) => {
       if (e === s) return;
-      const i = t[e], o = t[s], l = Z(i, o), r = Math.max(i.precision, o.precision);
+      const i = t[e], o = t[s], l = Z$1(i, o), r = Math.max(i.precision, o.precision);
       if (l.count !== 0) {
         if (l.count === 1 && !l.overlaps.length) {
           const u = e - s, a = l.intersections[0];
-          if (u === 1 && Y$2(i.firstPoint, a, r) || u === -1 && Y$2(i.lastPoint, a, r) || u === t.length - 1 && Y$2(i.lastPoint, a, r) && Y$2(o.firstPoint, a, r) || -u === t.length - 1 && Y$2(i.firstPoint, a, r) && Y$2(o.lastPoint, a, r))
+          if (u === 1 && Y$3(i.firstPoint, a, r) || u === -1 && Y$3(i.lastPoint, a, r) || u === t.length - 1 && Y$3(i.lastPoint, a, r) && Y$3(o.firstPoint, a, r) || -u === t.length - 1 && Y$3(i.firstPoint, a, r) && Y$3(o.lastPoint, a, r))
             return;
         }
-        if (!(l.count === 2 && t.length === 2 && (Y$2(
+        if (!(l.count === 2 && t.length === 2 && (Y$3(
           i.firstPoint,
           l.intersections[0],
           r
-        ) && Y$2(
+        ) && Y$3(
           i.lastPoint,
           l.intersections[1],
           r
-        ) || Y$2(
+        ) || Y$3(
           i.firstPoint,
           l.intersections[1],
           r
-        ) && Y$2(
+        ) && Y$3(
           i.lastPoint,
           l.intersections[0],
           r
@@ -5503,7 +5503,7 @@ function jt(t, n = "Stroke") {
     throw new Error(`${n} must have at least one segment`);
   Kt([t.slice(0, -1), t.slice(1)]).forEach(
     ([e, s]) => {
-      if (!Y$2(e.lastPoint, s.firstPoint))
+      if (!Y$3(e.lastPoint, s.firstPoint))
         throw new Error(
           `${n} segments must be connected, but ${e.info} and ${s.info} are not`
         );
@@ -5511,9 +5511,9 @@ function jt(t, n = "Stroke") {
   ), qn(t, n);
 }
 function Ct$1(t, n) {
-  return !!(t instanceof at$3 && n instanceof at$3 && Ie(t.V, n.V) || t instanceof ct$3 && n instanceof ct$3 && Y$2(t.center, n.center) && t.radius - n.radius < t.precision);
+  return !!(t instanceof at$3 && n instanceof at$3 && Ie(t.V, n.V) || t instanceof ct$3 && n instanceof ct$3 && Y$3(t.center, n.center) && t.radius - n.radius < t.precision);
 }
-function Mt$1(t, n) {
+function Mt(t, n) {
   if (t instanceof at$3 && n instanceof at$3)
     return new at$3(t.firstPoint, n.lastPoint);
   if (t instanceof ct$3 && n instanceof ct$3)
@@ -5534,22 +5534,22 @@ function Ht(t) {
       continue;
     }
     const i = e[e.length - 1];
-    Ct$1(i, s) ? (n = !0, e.pop(), e.push(Mt$1(i, s))) : e.push(s);
+    Ct$1(i, s) ? (n = !0, e.pop(), e.push(Mt(i, s))) : e.push(s);
   }
-  if (Y$2(t.firstPoint, t.lastPoint) && Ct$1(
+  if (Y$3(t.firstPoint, t.lastPoint) && Ct$1(
     e[0],
     e[e.length - 1]
   )) {
     n = !0;
     const s = e.pop();
-    e[0] = Mt$1(s, e[0]);
+    e[0] = Mt(s, e[0]);
   }
   return n ? e : null;
 }
-let B$3 = class B extends Ut {
+let B$3 = class B extends Ut$1 {
   constructor() {
     super(...arguments);
-    C(this, "strokeType", "STRAND");
+    C$1(this, "strokeType", "STRAND");
   }
   reverse() {
     const e = this.segments.map((s) => s.reverse());
@@ -5562,7 +5562,7 @@ let B$3 = class B extends Ut {
     );
   }
   extend(e) {
-    if (!Y$2(this.lastPoint, e.firstPoint))
+    if (!Y$3(this.lastPoint, e.firstPoint))
       throw console.error(this.repr, e.repr), new Error("Cannot extend strand: connection point is not the same");
     return new B([...this.segments, ...e.segments]);
   }
@@ -5595,12 +5595,12 @@ const zn$1 = (t, n) => {
 };
 let at$2 = class at {
   constructor(n) {
-    C(this, "_count", 0);
-    C(this, "segment");
+    C$1(this, "_count", 0);
+    C$1(this, "segment");
     this.segment = n;
   }
   update(n, e = !1) {
-    !e && !this.segment.isOnSegment(n) || (Y$2(n, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : Y$2(n, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
+    !e && !this.segment.isOnSegment(n) || (Y$3(n, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : Y$3(n, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
   }
   get count() {
     return this._count;
@@ -5609,7 +5609,7 @@ let at$2 = class at {
 const Dn$1 = (t, n) => {
   const e = n.precision, s = Math.abs(t[1] - n.center[1]);
   if (s > n.radius + e) return 0;
-  const i = Rt$1(t, n.center), o = n.radius * n.radius, l = e * e;
+  const i = Rt$2(t, n.center), o = n.radius * n.radius, l = e * e;
   if (Math.abs(i - o) < l && n.isOnSegment(t))
     return 0;
   const r = i - o > l;
@@ -5649,12 +5649,12 @@ function Nn(t, n) {
     return Vn(t, n);
   throw new Error("Not implemented");
 }
-let _$2 = class _ extends Ut {
+let _$1 = class _ extends Ut$1 {
   constructor(e, { ignoreChecks: s = !1 } = {}) {
     super(e, { ignoreChecks: !0 });
-    C(this, "strokeType", "LOOP");
-    C(this, "_clockwise", null);
-    s || Un(e);
+    C$1(this, "strokeType", "LOOP");
+    C$1(this, "_clockwise", null);
+    s || Un$1(e);
   }
   get clockwise() {
     if (this._clockwise === null) {
@@ -5690,11 +5690,11 @@ let _$2 = class _ extends Ut {
     return e ? new _(e, { ignoreChecks: !0 }) : this;
   }
 };
-function Un(t) {
-  if (jt(t, "Loop"), !Y$2(t[0].firstPoint, t[t.length - 1].lastPoint))
+function Un$1(t) {
+  if (jt(t, "Loop"), !Y$3(t[0].firstPoint, t[t.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
-const jn = [
+const jn$1 = [
   at$3,
   ct$3,
   jt$1,
@@ -5702,7 +5702,7 @@ const jn = [
   Et$1
 ];
 function Hn(t) {
-  return jn.some((n) => t instanceof n);
+  return jn$1.some((n) => t instanceof n);
 }
 function $t(t) {
   if (t instanceof at$3)
@@ -5747,7 +5747,7 @@ function $t(t) {
     };
   throw new Error("Unknown segment type");
 }
-function ot$3(t) {
+function ot$2(t) {
   return {
     type: "LOOP",
     segments: t.segments.map($t)
@@ -5756,8 +5756,8 @@ function ot$3(t) {
 function Yt(t) {
   return {
     type: "FIGURE",
-    contour: ot$3(t.contour),
-    holes: t.holes.map(ot$3)
+    contour: ot$2(t.contour),
+    holes: t.holes.map(ot$2)
   };
 }
 function $n$1(t) {
@@ -5766,18 +5766,18 @@ function $n$1(t) {
     figures: t.figures.map(Yt)
   };
 }
-function It$1(t) {
+function It(t) {
   if (t instanceof O$2)
     return $n$1(t);
   if (t instanceof v$2)
     return Yt(t);
-  if (t instanceof _$2)
-    return ot$3(t);
+  if (t instanceof _$1)
+    return ot$2(t);
   if (Hn(t))
     return $t(t);
   throw new Error("Unknown shape type");
 }
-class Yn {
+let Yn$1 = class Yn {
   constructor() {
     this.ids = [], this.values = [], this.length = 0;
   }
@@ -5822,8 +5822,8 @@ class Yn {
   shrink() {
     this.ids.length = this.values.length = this.length;
   }
-}
-const At$1 = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], et$3 = 3;
+};
+const At = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], et$3 = 3;
 let ft$1 = class ft {
   /**
    * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
@@ -5842,7 +5842,7 @@ let ft$1 = class ft {
     const o = i >> 4;
     if (o !== et$3)
       throw new Error(`Got v${o} data when expected v${et$3}.`);
-    const l = At$1[i & 15];
+    const l = At[i & 15];
     if (!l)
       throw new Error("Unrecognized array type.");
     const [r] = new Uint16Array(n, e + 2, 1), [u] = new Uint32Array(n, e + 4, 1);
@@ -5867,10 +5867,10 @@ let ft$1 = class ft {
       r = Math.ceil(r / this.nodeSize), u += r, this._levelBounds.push(u * 4);
     while (r !== 1);
     this.ArrayType = s, this.IndexArrayType = u < 16384 ? Uint16Array : Uint32Array;
-    const a = At$1.indexOf(this.ArrayType), f = u * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    const a = At.indexOf(this.ArrayType), f = u * 4 * this.ArrayType.BYTES_PER_ELEMENT;
     if (a < 0)
       throw new Error(`Unexpected typed array class: ${s}.`);
-    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, l + 8, u * 4), this._indices = new this.IndexArrayType(this.data, l + 8 + f, u), this._pos = u * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + f + u * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, u * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, u), 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, (et$3 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new Yn();
+    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, l + 8, u * 4), this._indices = new this.IndexArrayType(this.data, l + 8 + f, u), this._pos = u * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + f + u * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, u * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, u), 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, (et$3 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new Yn$1();
   }
   /**
    * Add a given rectangle to the index.
@@ -5896,7 +5896,7 @@ let ft$1 = class ft {
     const e = this.maxX - this.minX || 1, s = this.maxY - this.minY || 1, i = new Uint32Array(this.numItems), o = 65535;
     for (let l = 0, r = 0; l < this.numItems; l++) {
       const u = n[r++], a = n[r++], f = n[r++], c = n[r++], h = Math.floor(o * ((u + f) / 2 - this.minX) / e), p = Math.floor(o * ((a + c) / 2 - this.minY) / s);
-      i[l] = Gn(h, p);
+      i[l] = Gn$1(h, p);
     }
     rt$3(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
     for (let l = 0, r = 0; l < this._levelBounds.length - 1; l++) {
@@ -5925,7 +5925,7 @@ let ft$1 = class ft {
     let l = this._boxes.length - 4;
     const r = [], u = [];
     for (; l !== void 0; ) {
-      const a = Math.min(l + this.nodeSize * 4, Ft(l, this._levelBounds));
+      const a = Math.min(l + this.nodeSize * 4, Ft$1(l, this._levelBounds));
       for (let f = l; f < a; f += 4) {
         if (s < this._boxes[f] || i < this._boxes[f + 1] || n > this._boxes[f + 2] || e > this._boxes[f + 3]) continue;
         const c = this._indices[f >> 2] | 0;
@@ -5950,7 +5950,7 @@ let ft$1 = class ft {
     let l = this._boxes.length - 4;
     const r = this._queue, u = [], a = i * i;
     t: for (; l !== void 0; ) {
-      const f = Math.min(l + this.nodeSize * 4, Ft(l, this._levelBounds));
+      const f = Math.min(l + this.nodeSize * 4, Ft$1(l, this._levelBounds));
       for (let c = l; c < f; c += 4) {
         const h = this._indices[c >> 2] | 0, p = Et(n, this._boxes[c], this._boxes[c + 2]), d = Et(e, this._boxes[c + 1], this._boxes[c + 3]), m = p * p + d * d;
         m > a || (l >= this.numItems * 4 ? r.push(h << 1, m) : (o === void 0 || o(h)) && r.push((h << 1) + 1, m));
@@ -5965,7 +5965,7 @@ let ft$1 = class ft {
 function Et(t, n, e) {
   return t < n ? n - t : t <= e ? 0 : t - e;
 }
-function Ft(t, n) {
+function Ft$1(t, n) {
   let e = 0, s = n.length - 1;
   for (; e < s; ) {
     const i = e + s >> 1;
@@ -5985,11 +5985,11 @@ function rt$3(t, n, e, s, i, o) {
       u--;
     while (t[u] > l);
     if (r >= u) break;
-    Xn(t, n, e, r, u);
+    Xn$1(t, n, e, r, u);
   }
   rt$3(t, n, e, s, u, o), rt$3(t, n, e, u + 1, i, o);
 }
-function Xn(t, n, e, s, i) {
+function Xn$1(t, n, e, s, i) {
   const o = t[s];
   t[s] = t[i], t[i] = o;
   const l = 4 * s, r = 4 * i, u = n[l], a = n[l + 1], f = n[l + 2], c = n[l + 3];
@@ -5997,7 +5997,7 @@ function Xn(t, n, e, s, i) {
   const h = e[s];
   e[s] = e[i], e[i] = h;
 }
-function Gn(t, n) {
+function Gn$1(t, n) {
   let e = t ^ n, s = 65535 ^ e, i = 65535 ^ (t | n), o = t & (n ^ 65535), l = e | s >> 1, r = e >> 1 ^ e, u = i >> 1 ^ s & o >> 1 ^ i, a = e & i >> 1 ^ o >> 1 ^ o;
   e = l, s = r, i = u, o = a, l = e & e >> 2 ^ s & s >> 2, r = e & s >> 2 ^ s & (e ^ s) >> 2, u ^= e & i >> 2 ^ s & o >> 2, a ^= s & i >> 2 ^ (e ^ s) & o >> 2, e = l, s = r, i = u, o = a, l = e & e >> 4 ^ s & s >> 4, r = e & s >> 4 ^ s & (e ^ s) >> 4, u ^= e & i >> 4 ^ s & o >> 4, a ^= s & i >> 4 ^ (e ^ s) & o >> 4, e = l, s = r, i = u, o = a, u ^= e & i >> 8 ^ s & o >> 8, a ^= s & i >> 8 ^ (e ^ s) & o >> 8, e = u ^ u >> 1, s = a ^ a >> 1;
   let f = t ^ n, c = s | 65535 ^ (f | e);
@@ -6043,9 +6043,9 @@ function Xt(t, n = 1e-7) {
 let v$2 = class v extends Ze {
   constructor(e, s = [], { ignoreChecks: i = !1 } = {}) {
     super();
-    C(this, "contour");
-    C(this, "holes");
-    i || Qn(e, s), this.contour = e, this.holes = s;
+    C$1(this, "contour");
+    C$1(this, "holes");
+    i || Qn$1(e, s), this.contour = e, this.holes = s;
   }
   get boundingBox() {
     return this.contour.boundingBox;
@@ -6081,24 +6081,24 @@ let v$2 = class v extends Ze {
     return Xt(i).map((o) => new B$3(o));
   }
 };
-function Qn(t, n = []) {
+function Qn$1(t, n = []) {
   if (!t) throw new Error("Figure must have a contour");
-  for (const [e, s] of it$2([t, ...n]))
+  for (const [e, s] of it$1([t, ...n]))
     if (e.intersects(s))
       throw new Error("Loops in a figure must not intersect");
   if (n.some(
     (e) => !t.contains(e.firstPoint) && !t.onStroke(e.firstPoint)
   ))
     throw new Error("Holes must be inside the contour");
-  for (const [e, s] of it$2(n))
+  for (const [e, s] of it$1(n))
     if (e.contains(s.firstPoint))
-      throw console.error(It$1(e), It$1(s)), new Error("Holes must not be inside other holes");
+      throw console.error(It(e), It(s)), new Error("Holes must not be inside other holes");
 }
-const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
+const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn$1 = (t, n) => {
   const e = t.boundingBox, s = n.boundingBox;
   return J$2(e.xMin, s.xMin) && J$2(e.yMin, s.yMin) && J$2(e.xMax, s.xMax) && J$2(e.yMax, s.yMax);
-}, Jn = (t, n) => {
-  if (t.segmentsCount !== n.segmentsCount || !Wn(t, n)) return !1;
+}, Jn$1 = (t, n) => {
+  if (t.segmentsCount !== n.segmentsCount || !Wn$1(t, n)) return !1;
   const e = t.segments, s = n.segments, i = e.length, o = (l, r) => {
     for (let u = 0; u < i; u += 1) {
       const a = (l + r * u + i) % i;
@@ -6113,9 +6113,9 @@ const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
 }, Kn = (t) => {
   const n = [];
   return t.forEach((e) => {
-    n.some((s) => Jn(e, s)) || n.push(e);
+    n.some((s) => Jn$1(e, s)) || n.push(e);
   }), n;
-}, Zn = (t) => {
+}, Zn$1 = (t) => {
   const n = t.map((i, o) => t.slice(o + 1).map((l, r) => [r + o + 1, l]).filter(([, l]) => i.boundingBox.overlaps(l.boundingBox)).map(([l]) => l)), e = [], s = Array(n.length);
   return n.forEach((i, o) => {
     let l = s[o];
@@ -6129,49 +6129,49 @@ const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
     loop: n,
     isIn: o
   };
-}), te = (t, n) => t.flatMap(({ loop: e }) => ht$1(
+}), te$1 = (t, n) => t.flatMap(({ loop: e }) => ht$2(
   n.filter(
     ({ loop: s, isIn: i }) => s === e || i.indexOf(e) !== -1
   )
-)), ne = (t, n) => {
-  const e = n.filter(({ isIn: i }) => i.length <= 1), s = ht$1(
+)), ne$1 = (t, n) => {
+  const e = n.filter(({ isIn: i }) => i.length <= 1), s = ht$2(
     Gt(t.map(({ loop: i }) => i))
   );
   return [e, ...s];
-}, ht$1 = (t) => {
+}, ht$2 = (t) => {
   if (!t.length) return [];
   const n = t.filter(({ isIn: s }) => !s.length), e = t.filter(({ isIn: s }) => s.length > 1);
-  return n.length === 1 && e.length === 0 ? [t] : n.length > 1 ? te(n, t) : ne(e, t);
+  return n.length === 1 && e.length === 0 ? [t] : n.length > 1 ? te$1(n, t) : ne$1(e, t);
 };
 function X$2(t) {
   const n = Kn(t);
-  return Zn(n).map(Gt).flatMap(ht$1).map((s) => {
+  return Zn$1(n).map(Gt).flatMap(ht$2).map((s) => {
     if (s.length === 1) return new v$2(s[0].loop);
     s.sort((l, r) => l.isIn.length - r.isIn.length);
     const [i, ...o] = s.map(({ loop: l }) => l);
     return new v$2(i, o);
   });
 }
-function ee(t, n) {
+function ee$1(t, n) {
   const e = [];
   for (const s of t)
     for (const i of n)
       e.push([s, i]);
   return e;
 }
-function* vt$1(t, n, e) {
-  const s = (r) => n.some((u) => Y$2(u, r.lastPoint)), i = (r, u) => r.segmentType !== u.segmentType || !u.isOnSegment(r.firstPoint) || !u.isOnSegment(r.lastPoint) ? !1 : r.segmentType !== "LINE" ? u.isOnSegment(r.midPoint) : !0, o = (r) => e.some((u) => r.isSame(u) || i(r, u));
+function* vt(t, n, e) {
+  const s = (r) => n.some((u) => Y$3(u, r.lastPoint)), i = (r, u) => r.segmentType !== u.segmentType || !u.isOnSegment(r.firstPoint) || !u.isOnSegment(r.lastPoint) ? !1 : r.segmentType !== "LINE" ? u.isOnSegment(r.midPoint) : !0, o = (r) => e.some((u) => r.isSame(u) || i(r, u));
   let l = [];
   for (const r of t)
     s(r) ? (l.push(r), yield new B$3(l, { ignoreChecks: !0 }), l = []) : o(r) ? (l.length && (yield new B$3(l, { ignoreChecks: !0 }), l = []), yield new B$3([r], { ignoreChecks: !0 })) : l.push(r);
   l.length && (yield new B$3(l, { ignoreChecks: !0 }));
 }
-const Bt = (t, n) => {
-  const e = t.findIndex((o) => Y$2(n, o.firstPoint)), s = t.slice(0, e);
+const Bt$1 = (t, n) => {
+  const e = t.findIndex((o) => Y$3(n, o.firstPoint)), s = t.slice(0, e);
   return t.slice(e).concat(s);
-}, kt = (t, n) => {
+}, kt$1 = (t, n) => {
   let e = t;
-  const s = (r) => Y$2(r.firstPoint, n.firstPoint) && Y$2(r.lastPoint, n.lastPoint);
+  const s = (r) => Y$3(r.firstPoint, n.firstPoint) && Y$3(r.lastPoint, n.lastPoint);
   let i = t.findIndex(s);
   if (i === -1) {
     const r = t.map((u) => u.reverse());
@@ -6187,7 +6187,7 @@ const Bt = (t, n) => {
 };
 function se(t, n, e) {
   return t.filter((s) => {
-    const i = n.filter((r) => Y$2(r.firstPoint, s) || Y$2(r.lastPoint, s));
+    const i = n.filter((r) => Y$3(r.firstPoint, s) || Y$3(r.lastPoint, s));
     if (i.length % 2)
       throw new Error("Bug in the intersection algo on non crossing point");
     const o = i.map((r) => e.contains(r.midPoint));
@@ -6199,7 +6199,7 @@ function ie(t, n, e, s = !1) {
   const o = [], l = new Array(t.segments.length).fill(0).map(() => []), r = new Array(n.segments.length).fill(0).map(() => []);
   if (t.segments.forEach((p, d) => {
     n.segments.forEach((m, x) => {
-      const { intersections: g, overlaps: w } = Z(
+      const { intersections: g, overlaps: w } = Z$1(
         p,
         m,
         e
@@ -6221,34 +6221,34 @@ function ie(t, n, e, s = !1) {
   ), !i.length && !o.length) return null;
   if (o.length) {
     const p = o[0];
-    a = kt(
+    a = kt$1(
       a,
       p
-    ), f = kt(
+    ), f = kt$1(
       f,
       p
     );
   } else {
     const p = i[0];
-    a = Bt(a, p), f = Bt(f, p);
+    a = Bt$1(a, p), f = Bt$1(f, p);
   }
   let c = Array.from(
-    vt$1(
+    vt(
       a,
       i,
       o
     )
   ), h = Array.from(
-    vt$1(
+    vt(
       f,
       i,
       o
     )
   );
-  return (!Y$2(
+  return (!Y$3(
     h[0].lastPoint,
     c[0].lastPoint
-  ) || o.length > 0 && h[0].segmentsCount !== 1) && (h = h.map((p) => p.reverse()).reverse(), Y$2(h[0].lastPoint, c[0].lastPoint) || (c = c.map((p) => p.reverse()).reverse())), Kt([c, h]).map(([p, d]) => {
+  ) || o.length > 0 && h[0].segmentsCount !== 1) && (h = h.map((p) => p.reverse()).reverse(), Y$3(h[0].lastPoint, c[0].lastPoint) || (c = c.map((p) => p.reverse()).reverse())), Kt([c, h]).map(([p, d]) => {
     if (s) {
       if (((x) => x.segments.every(
         (g) => o.some(
@@ -6261,47 +6261,47 @@ function ie(t, n, e, s = !1) {
     return [p, d];
   });
 }
-function Ot(t) {
+function Ot$1(t) {
   let n = t[0];
   for (const e of t.slice(1))
     n = n.extend(e);
-  if (!Y$2(n.firstPoint, n.lastPoint))
+  if (!Y$3(n.firstPoint, n.lastPoint))
     throw console.error(
-      Z$1(n.firstPoint),
-      Z$1(n.lastPoint)
+      Z$2(n.firstPoint),
+      Z$2(n.lastPoint)
     ), new Error("Bug in the intersection algo on non closing strand");
-  return new _$2(n.segments);
+  return new _$1(n.segments);
 }
 function oe(t, n) {
   const e = Kt([
     n.slice(0, -1),
     n.slice(1)
-  ]).map(([i, o]) => Ot(t.slice(i, o)));
+  ]).map(([i, o]) => Ot$1(t.slice(i, o)));
   let s = t.slice(
     n[n.length - 1]
   );
-  return n[0] !== 0 && (s = s.concat(t.slice(0, n[0]))), e.push(Ot(s)), e;
+  return n[0] !== 0 && (s = s.concat(t.slice(0, n[0]))), e.push(Ot$1(s)), e;
 }
-function re(t) {
+function re$1(t) {
   if (!t.length) return [];
   const n = t.map((i) => i.firstPoint);
   let e = t.map((i) => i.lastPoint);
   e = e.slice(-1).concat(e.slice(0, -1));
   const s = Kt([n, e]).flatMap(
-    ([i, o], l) => Y$2(i, o) ? [] : l
+    ([i, o], l) => Y$3(i, o) ? [] : l
   );
   try {
     return oe(t, s);
   } catch {
-    return Xt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => Y$2(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new _$2(o));
+    return Xt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => Y$3(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new _$1(o));
   }
 }
 const _t = (t, n) => {
   if (t.length === 0) return [n];
   const e = t.at(-1);
-  return Y$2(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : Y$2(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
-}, le = (t, n) => t.length === 0 ? [n] : Y$2(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
-function pt(t, n, {
+  return Y$3(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : Y$3(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
+}, le = (t, n) => t.length === 0 ? [n] : Y$3(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
+function pt$1(t, n, {
   firstInside: e,
   secondInside: s,
   firstBoundaryInside: i = !1,
@@ -6345,23 +6345,23 @@ function pt(t, n, {
     }
     return u === null && p === 1 && r && (h = le(h, r)), p === 1 && (u = p, r = null), h.length ? h : (r = null, []);
   });
-  return re(a);
+  return re$1(a);
 }
 const ue = (t, n, e) => {
-  const s = pt(t, n, {
+  const s = pt$1(t, n, {
     firstInside: "remove",
     secondInside: "remove",
     ...e
   });
   return Array.isArray(s) ? s : s.identical ? [t] : s.firstCurveInSecond ? [n] : s.secondCurveInFirst ? [t] : [t, n];
 }, tt$2 = (t, n, e) => {
-  const s = pt(t, n, {
+  const s = pt$1(t, n, {
     firstInside: "remove",
     secondInside: "keep",
     ...e
   });
   return Array.isArray(s) ? s : s.identical ? [] : s.firstCurveInSecond ? [] : s.secondCurveInFirst ? [t, n] : [t];
-}, dt = (t, n, e) => {
+}, dt$1 = (t, n, e) => {
   const s = (e == null ? void 0 : e.firstBoundaryInside) ?? !1, i = (e == null ? void 0 : e.secondBoundaryInside) ?? !1, o = s || i, l = (u, a, f) => u.segments.every(
     (c) => a.contains(c.midPoint, { strokeIsInside: f })
   );
@@ -6371,7 +6371,7 @@ const ue = (t, n, e) => {
     if (l(n, t, s))
       return [n];
   }
-  const r = pt(t, n, {
+  const r = pt$1(t, n, {
     firstInside: "keep",
     secondInside: "keep",
     ...e
@@ -6390,13 +6390,13 @@ function ce(t) {
         (d) => f.some((m) => d.intersects(m))
       )) return;
       let p;
-      u.length > 1 || f.length > 1 ? p = G(u, f) : p = Qt(u[0], f[0]), o.fusedWith.add(a), o.current = p, c || n.set(a, o);
+      u.length > 1 || f.length > 1 ? p = G$1(u, f) : p = Qt(u[0], f[0]), o.fusedWith.add(a), o.current = p, c || n.set(a, o);
     });
   }), e.flatMap(({ current: s }) => s);
 }
 function Qt(t, n) {
-  const e = ue(t.contour, n.contour), s = n.holes.flatMap((l) => tt$2(l, t.contour)), i = t.holes.flatMap((l) => tt$2(l, n.contour)), o = ee(t.holes, n.holes).flatMap(
-    ([l, r]) => dt(l, r)
+  const e = ue(t.contour, n.contour), s = n.holes.flatMap((l) => tt$2(l, t.contour)), i = t.holes.flatMap((l) => tt$2(l, n.contour)), o = ee$1(t.holes, n.holes).flatMap(
+    ([l, r]) => dt$1(l, r)
   );
   return X$2([
     ...e,
@@ -6410,12 +6410,12 @@ function nt$1(t, n) {
     return X$2(tt$2(t.contour, n.contour));
   if (t.isFull) {
     const s = tt$2(t.contour, n.contour), i = n.holes.flatMap(
-      (o) => dt(o, t.contour, { firstBoundaryInside: !0 })
+      (o) => dt$1(o, t.contour, { firstBoundaryInside: !0 })
     );
     return X$2([...s, ...i]);
   } else if (n.isFull && !t.contour.intersects(n.contour))
     if (t.contour.contains(n.contour.firstPoint)) {
-      const s = G(
+      const s = G$1(
         t.holes.map((i) => new v$2(i)),
         [n]
       );
@@ -6431,7 +6431,7 @@ function nt$1(t, n) {
   }), e;
 }
 function ae(t, n) {
-  const e = dt(t.contour, n.contour);
+  const e = dt$1(t.contour, n.contour);
   if (!e.length) return [];
   let s = X$2(e);
   return s = Q$1(
@@ -6442,15 +6442,15 @@ function ae(t, n) {
     n.holes.map((i) => new v$2(i))
   );
 }
-function G(t, n) {
+function G$1(t, n) {
   if (!t.length) return n;
   if (!n.length) return t;
   if (t.length === 1 && n.length > 1 || n.length === 1 && t.length > 1)
     return ce([...t, ...n]);
   if (t.length > 1 && n.length > 1) {
-    let e = G([t[0]], n);
+    let e = G$1([t[0]], n);
     return t.slice(1).forEach((s) => {
-      e = G([s], e);
+      e = G$1([s], e);
     }), e;
   }
   return t.length === 1 && n.length === 1 ? Qt(t[0], n[0]) : [];
@@ -6467,14 +6467,14 @@ function Q$1(t, n) {
     e = Q$1(e, [s]);
   }), e;
 }
-function lt$2(t, n) {
-  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? ae(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => lt$2([e], n)) : n.flatMap((e) => lt$2(t, [e]));
+function lt$3(t, n) {
+  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? ae(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => lt$3([e], n)) : n.flatMap((e) => lt$3(t, [e]));
 }
 let O$2 = class O extends Ze {
   constructor(e = [], { ignoreChecks: s = !1 } = {}) {
     super();
-    C(this, "figures");
-    C(this, "_boundingBox", null);
+    C$1(this, "figures");
+    C$1(this, "_boundingBox", null);
     s || fe(e), this.figures = e;
   }
   get isEmpty() {
@@ -6512,30 +6512,30 @@ let O$2 = class O extends Ze {
     ) : s.overlappingStrands(e));
   }
   fuse(e) {
-    return new O(G(this.figures, e.figures));
+    return new O(G$1(this.figures, e.figures));
   }
   cut(e) {
     return new O(Q$1(this.figures, e.figures));
   }
   intersect(e) {
-    return new O(lt$2(this.figures, e.figures));
+    return new O(lt$3(this.figures, e.figures));
   }
 };
 function fe(t) {
-  for (const [n, e] of it$2(t))
+  for (const [n, e] of it$1(t))
     if (n.intersects(e))
       throw new Error("Diagram figures must not intersect");
 }
 
-var W$2 = Object.defineProperty;
-var q$1 = (e, t, n) => t in e ? W$2(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var m$1 = (e, t, n) => q$1(e, typeof t != "symbol" ? t + "" : t, n);
+var W$1 = Object.defineProperty;
+var q = (e, t, n) => t in e ? W$1(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var m$1 = (e, t, n) => q(e, typeof t != "symbol" ? t + "" : t, n);
 const B$2 = (e, t, n) => {
-  const r = St$2(e.V, t.V), i = e.precision * t.precision;
+  const r = St$1(e.V, t.V), i = e.precision * t.precision;
   if (r * r < i)
     return "parallel";
-  const s = Q$2(t.firstPoint, e.firstPoint), o = St$2(s, t.V) / r;
-  return it$3(e.firstPoint, nt$2(e.V, o));
+  const s = Q$2(t.firstPoint, e.firstPoint), o = St$1(s, t.V) / r;
+  return it$2(e.firstPoint, nt$2(e.V, o));
 };
 class S {
   constructor(t, n) {
@@ -6548,21 +6548,21 @@ function y(e, t) {
   if (e instanceof ct$3)
     return rt$2(e, t);
   if (e instanceof _t$1 || e instanceof Et$1)
-    return it$1(e, t);
+    return it(e, t);
   throw new Error("Not implemented");
 }
 function et$2(e, t) {
   const { firstPoint: n, lastPoint: r } = e, i = e.normalVector;
   return new at$3(
-    it$3(n, nt$2(i, t)),
-    it$3(r, nt$2(i, t))
+    it$2(n, nt$2(i, t)),
+    it$2(r, nt$2(i, t))
   );
 }
 function rt$2(e, t) {
-  const n = it$3(
+  const n = it$2(
     e.firstPoint,
     nt$2(tt$3(e.tangentAtFirstPoint), t)
-  ), r = it$3(
+  ), r = it$2(
     e.lastPoint,
     nt$2(tt$3(e.tangentAtLastPoint), t)
   ), i = t * (e.clockwise ? 1 : -1);
@@ -6587,14 +6587,14 @@ function b(e, t, n, r, i) {
     );
   return s;
 }
-function it$1(e, t) {
+function it(e, t) {
   const { firstPoint: n, lastPoint: r, normalAtFirstPoint: i, normalAtLastPoint: s } = e, o = B$2(
     { V: i, firstPoint: n, precision: e.precision },
     { V: s, firstPoint: r, precision: e.precision }
-  ), a = it$3(
+  ), a = it$2(
     n,
     nt$2(i, t)
-  ), h = it$3(
+  ), h = it$2(
     r,
     nt$2(s, t)
   );
@@ -6639,8 +6639,8 @@ function it$1(e, t) {
     f
   );
 }
-function M(e, t, n) {
-  const r = St$2(
+function M$1(e, t, n) {
+  const r = St$1(
     e.tangentAtLastPoint,
     t.tangentAtFirstPoint
   );
@@ -6657,13 +6657,13 @@ function M(e, t, n) {
   if (!h)
     return null;
   const c = h, p = (v, O) => {
-    const I = O.tangentAt(c), N = Qt$1(I), Y = it$3(c, nt$2(N, s));
+    const I = O.tangentAt(c), N = Qt$1(I), Y = it$2(c, nt$2(N, s));
     return v.splitAt(Y);
   }, [f] = p(e, o), [, g] = p(t, a);
   return { first: f, second: g, center: c };
 }
-function V(e, t, n) {
-  const r = M(e, t, n);
+function V$1(e, t, n) {
+  const r = M$1(e, t, n);
   if (!r)
     return console.warn(
       "Cannot fillet between segments",
@@ -6677,8 +6677,8 @@ function V(e, t, n) {
     s
   ];
 }
-function _$1(e, t, n) {
-  const r = M(e, t, n);
+function _(e, t, n) {
+  const r = M$1(e, t, n);
   if (!r)
     return console.warn(
       "Cannot chamfer between segments",
@@ -6698,14 +6698,14 @@ const st$1 = (e) => {
     startTangent: s
   } = t;
   let o;
-  typeof n == "number" ? o = Tt(1, n * fe$1) : o = n;
+  typeof n == "number" ? o = Tt$1(1, n * fe$1) : o = n;
   let a;
-  return typeof s == "number" ? a = Tt(1, s * fe$1) : a = s, { endTangent: o, startFactor: r, endFactor: i, startTangent: a };
+  return typeof s == "number" ? a = Tt$1(1, s * fe$1) : a = s, { endTangent: o, startFactor: r, endFactor: i, startTangent: a };
 };
 function z$2(e, { ignoreChecks: t = !1 } = {}) {
-  return new O$2([new v$2(new _$2([...e], { ignoreChecks: t }))]);
+  return new O$2([new v$2(new _$1([...e], { ignoreChecks: t }))]);
 }
-let ot$2 = class ot {
+let ot$1 = class ot {
   constructor(t = [0, 0]) {
     m$1(this, "pointer");
     m$1(this, "firstPoint");
@@ -6721,13 +6721,13 @@ let ot$2 = class ot {
     return this.pointer = t, this.firstPoint = t, this;
   }
   saveSegment(t) {
-    if (Y$2(t.firstPoint, t.lastPoint))
+    if (Y$3(t.firstPoint, t.lastPoint))
       throw new Error(`Segment has no length, ${t.repr}`);
     if (!this._nextCorner)
       return this.pendingSegments.push(t), this;
     const n = this.pendingSegments.pop();
     if (!n) throw new Error("bug in the custom corner algorithm");
-    const r = this._nextCorner.mode === "chamfer" ? _$1 : V;
+    const r = this._nextCorner.mode === "chamfer" ? _ : V$1;
     return this.pendingSegments.push(
       ...r(n, t, this._nextCorner.radius)
     ), this._nextCorner = null, this;
@@ -6752,11 +6752,11 @@ let ot$2 = class ot {
     return this.lineTo([t, this.pointer[1]]);
   }
   polarLineTo([t, n]) {
-    const r = n * fe$1, i = Tt(t, r);
+    const r = n * fe$1, i = Tt$1(t, r);
     return this.lineTo(i);
   }
   polarLine(t, n) {
-    const r = n * fe$1, [i, s] = Tt(t, r);
+    const r = n * fe$1, [i, s] = Tt$1(t, r);
     return this.line(i, s);
   }
   tangentLine(t) {
@@ -6767,7 +6767,7 @@ let ot$2 = class ot {
     return this.line(r * t, i * t);
   }
   threePointsArcTo(t, n) {
-    return this.saveSegment(fn$1(this.pointer, n, t)), this.pointer = t, this;
+    return this.saveSegment(fn(this.pointer, n, t)), this.pointer = t, this;
   }
   threePointsArc(t, n, r, i) {
     const [s, o] = this.pointer;
@@ -6778,7 +6778,7 @@ let ot$2 = class ot {
   }
   sagittaArcTo(t, n) {
     if (!n) return this.lineTo(t);
-    const r = new at$3(this.pointer, t), i = tt$3(r.tangentAtFirstPoint), s = it$3(r.midPoint, nt$2(i, n));
+    const r = new at$3(this.pointer, t), i = tt$3(r.tangentAtFirstPoint), s = it$2(r.midPoint, nt$2(i, n));
     return this.threePointsArcTo(t, s);
   }
   sagittaArc(t, n, r) {
@@ -6898,13 +6898,13 @@ let ot$2 = class ot {
     const r = this.pendingSegments.pop(), i = this.pendingSegments.shift();
     if (!r || !i)
       throw new Error("Not enough curves to close and fillet");
-    const s = n === "chamfer" ? _$1 : V;
+    const s = n === "chamfer" ? _ : V$1;
     this.pendingSegments.push(...s(r, i, t));
   }
   close(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
     const n = this.pendingSegments[0], r = this.pendingSegments.at(-1);
-    return Y$2(n.firstPoint, r.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
+    return Y$3(n.firstPoint, r.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
       this._nextCorner.radius,
       this._nextCorner.mode
     ), this._nextCorner = null), z$2(this.pendingSegments, { ignoreChecks: t });
@@ -6930,36 +6930,36 @@ let ot$2 = class ot {
   }
   get isClosed() {
     var t;
-    return Y$2(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
+    return Y$3(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
   }
 };
-function lt$1(e = [0, 0]) {
-  return new ot$2(e);
+function lt$2(e = [0, 0]) {
+  return new ot$1(e);
 }
 
 function ct$1(c) {
-  return lt$1([-c, 0]).sagittaArc(2 * c, 0, c).sagittaArc(-2 * c, 0, c).close();
+  return lt$2([-c, 0]).sagittaArc(2 * c, 0, c).sagittaArc(-2 * c, 0, c).close();
 }
-function ot$1(c, e, t = 0) {
+function ot(c, e, t = 0) {
   const { rx: a = 0, ry: o = 0 } = typeof t == "number" ? { ry: t, rx: t } : t;
   let n = Math.min(a ?? t ?? 0, c / 2), r = Math.min(o ?? t ?? 0, e / 2);
   const s = n && r;
   s || (n = 0, r = 0);
-  const h = n === r, f = lt$1([Math.min(0, -(c / 2 - n)), -e / 2]), l = (k, i) => {
+  const h = n === r, f = lt$2([Math.min(0, -(c / 2 - n)), -e / 2]), l = (k, i) => {
     s && (h ? f.tangentArc(k, i) : f.ellipse(k, i, n, r, 0, !1, !1));
   };
   return n < c / 2 && f.hLine(c - 2 * n), l(n, r), r < e / 2 && f.vLine(e - 2 * r), l(-n, r), n < c / 2 && f.hLine(-(c - 2 * n)), l(-n, -r), r < e / 2 && f.vLine(-(e - 2 * r)), l(n, -r), f.close();
 }
 function rt$1(c, e) {
-  const t = lt$1([-c, 0]);
+  const t = lt$2([-c, 0]);
   return t.halfEllipse(2 * c, 0, e), t.halfEllipse(-2 * c, 0, e), t.close();
 }
-function lt(c, e, t) {
+function lt$1(c, e, t) {
   const a = Je(e).map((n) => {
     const r = -(Math.PI * 2 / e) * n;
     return [c * Math.sin(r), c * Math.cos(r)];
   });
-  let o = lt$1(a[a.length - 1]);
+  let o = lt$2(a[a.length - 1]);
   for (const n of a)
     t ? o = o.sagittaArcTo(n, t) : o = o.lineTo(n);
   return o.close();
@@ -7031,7 +7031,7 @@ function X$1(c) {
     }
   return e.join(" ");
 }
-function Y(c) {
+function Y$1(c) {
   let e = 0, t = 0, a = 0, o = 0;
   const n = [];
   for (const { key: r, data: s } of c)
@@ -7195,13 +7195,13 @@ function F(c, e, t, a, o, n, r, s, h, f) {
     return x;
   }
 }
-const W$1 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const W = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  absolutize: Y,
+  absolutize: Y$1,
   normalize: J$1,
   parsePath: O$1,
   serialize: X$1
-}, Symbol.toStringTag, { value: "Module" })), { parsePath: v$1, absolutize: tt$1 } = W$1, et$1 = (c, e, t) => {
+}, Symbol.toStringTag, { value: "Module" })), { parsePath: v$1, absolutize: tt$1 } = W, et$1 = (c, e, t) => {
   let a, o = null, n = null;
   if (c.key === "M") {
     const [r, s] = c.data;
@@ -7292,7 +7292,7 @@ function* at$1(c) {
     }
     const r = et$1(n, a, o), s = r.p, h = "control1" in r ? r.control1 : null, f = "control1" in r ? r.control2 : null, l = "arcConfig" in r ? r.arcConfig : null;
     if (n.key === "M") {
-      t && (yield t.isClosed ? t.close() : t.asStrand()), t = lt$1(s), a = s;
+      t && (yield t.isClosed ? t.close() : t.asStrand()), t = lt$2(s), a = s;
       continue;
     }
     if (a && Math.abs(s[0] - a[0]) < 1e-9 && Math.abs(s[1] - a[1]) < 1e-9) {
@@ -7303,7 +7303,7 @@ function* at$1(c) {
   }
   t && (yield t.isClosed ? t.close() : t.asStrand());
 }
-function ht(c) {
+function ht$1(c) {
   return Array.from(at$1(c));
 }
 
@@ -7311,9 +7311,9 @@ var drawShape = /*#__PURE__*/Object.freeze({
   __proto__: null,
   drawCircle: ct$1,
   drawEllipse: rt$1,
-  drawPolysides: lt,
-  drawRect: ot$1,
-  drawSVGPath: ht
+  drawPolysides: lt$1,
+  drawRect: ot,
+  drawSVGPath: ht$1
 });
 
 function i([t, n]) {
@@ -7352,7 +7352,7 @@ function d(t) {
 `)}
 </g>`;
 }
-function j$1(t) {
+function j(t) {
   const n = `M ${t.firstPoint.join(" ")}`, o = t.segments.map(s).join(" ");
   return `${n} ${o}`;
 }
@@ -7368,563 +7368,563 @@ function A(t, n, o = 1, r) {
 </svg>`;
 }
 
-var yt = Object.defineProperty;
-var Ct = (n, t, e) => t in n ? yt(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
-var P = (n, t, e) => Ct(n, typeof t != "symbol" ? t + "" : t, e);
-function L(n) {
-  if (n instanceof v$2)
-    return [n];
-  if (n instanceof _$2)
-    return [new v$2(n)];
-  if (n instanceof O$2)
-    return n.figures;
+var Ut = Object.defineProperty;
+var Vt = (t, n, e) => n in t ? Ut(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
+var M = (t, n, e) => Vt(t, typeof n != "symbol" ? n + "" : n, e);
+function x(t) {
+  if (t instanceof v$2)
+    return [t];
+  if (t instanceof _$1)
+    return [new v$2(t)];
+  if (t instanceof O$2)
+    return t.figures;
   throw new Error("Unknown shape");
 }
-function mt(n, t, e = 1e-9) {
-  let s = [];
-  const r = [], i = new Array(t.segments.length).fill(0).map(() => []);
-  t.segments.forEach((a, f) => {
-    n.segments.forEach((c) => {
-      const { intersections: l, overlaps: p } = Z(
-        a,
+function kt(t, n, e = 1e-9) {
+  let r = [];
+  const s = [], i = new Array(n.segments.length).fill(0).map(() => []);
+  n.segments.forEach((c, f) => {
+    t.segments.forEach((a) => {
+      const { intersections: u, overlaps: g } = Z$1(
         c,
+        a,
         e
       );
-      s.push(...l), i[f].push(...l), r.push(...p);
-      const g = p.flatMap((d) => [
+      r.push(...u), i[f].push(...u), s.push(...g);
+      const p = g.flatMap((d) => [
         d.firstPoint,
         d.lastPoint
       ]);
-      s.push(...g), i[f].push(...g);
+      r.push(...p), i[f].push(...p);
     });
-  }), s = Te(s, e);
-  const o = Kt([t.segments, i]).flatMap(([a, f]) => f.length ? a.splitAt(f) : [a]);
+  }), r = Te(r, e);
+  const o = Kt([n.segments, i]).flatMap(([c, f]) => f.length ? c.splitAt(f) : [c]);
   return Array.from(
-    vt$1(
+    vt(
       o,
-      s,
-      r
+      r,
+      s
     )
   );
 }
-function J(n, t, e = !1) {
-  return mt(t, n).filter((r) => {
-    const i = r.segments[0].midPoint;
-    return t.onStroke(i) ? !e : !t.contains(i);
+function tt(t, n, e = !1) {
+  return kt(n, t).filter((s) => {
+    const i = s.segments[0].midPoint;
+    return n.onStroke(i) ? !e : !n.contains(i);
   });
 }
-function Q(n, t, e = !1) {
-  return mt(t, n).filter((r) => {
-    const i = r.segments[0].midPoint;
-    return t.onStroke(i) ? !e : t.contains(i);
+function nt(t, n, e = !1) {
+  return kt(n, t).filter((s) => {
+    const i = s.segments[0].midPoint;
+    return n.onStroke(i) ? !e : n.contains(i);
   });
 }
-function W(n, t, e = !1) {
-  const s = J(
-    n,
-    t.contour,
+function ct(t, n, e = !1) {
+  const r = tt(
+    t,
+    n.contour,
     e
-  ), r = t.holes.flatMap(
-    (i) => Q(n, i, e)
+  ), s = n.holes.flatMap(
+    (i) => nt(t, i, e)
   );
-  return [...s, ...r];
+  return [...r, ...s];
 }
-function j(n, t, e = !1) {
-  let s = Q(
-    n,
-    t.contour,
+function at(t, n, e = !1) {
+  let r = nt(
+    t,
+    n.contour,
     e
   );
-  return t.holes.forEach((r) => {
-    s = s.flatMap(
-      (i) => J(i, r, e)
+  return n.holes.forEach((s) => {
+    r = r.flatMap(
+      (i) => tt(i, s, e)
     );
-  }), s;
+  }), r;
 }
-function sn(n, t) {
+function gn(t, n) {
   return new O$2(
-    G(L(n), L(t))
+    G$1(x(t), x(n))
   );
 }
-function z(n) {
-  return n.reduce(
-    (t, e) => sn(t, e),
+function z(t) {
+  return t.reduce(
+    (n, e) => gn(n, e),
     new O$2()
   );
 }
-function Pt(n, t) {
+function Ft(t, n) {
   return new O$2(
-    Q$1(L(n), L(t))
+    Q$1(x(t), x(n))
   );
 }
-function yn(n, t) {
+function Xn(t, n) {
   return new O$2(
-    lt$2(L(n), L(t))
+    lt$3(x(t), x(n))
   );
 }
-function Cn(n, t, e = !0) {
-  if (t instanceof _$2)
-    return J(n, t, e);
-  if (t instanceof v$2)
-    return W(n, t, e);
-  let s = [new B$3([...n.segments])];
-  return t.figures.forEach((r) => {
-    s = s.flatMap((i) => W(i, r, e));
-  }), s;
-}
-function xn(n, t, e = !1) {
-  if (t instanceof _$2)
-    return Q(n, t, e);
-  if (t instanceof v$2)
-    return j(n, t, e);
-  let s = [new B$3([...n.segments])];
-  return t.figures.forEach((r) => {
-    s = s.flatMap((i) => j(i, r, e));
-  }), s;
+function Jn(t, n, e = !0) {
+  if (n instanceof _$1)
+    return tt(t, n, e);
+  if (n instanceof v$2)
+    return ct(t, n, e);
+  let r = [new B$3([...t.segments])];
+  return n.figures.forEach((s) => {
+    r = r.flatMap((i) => ct(i, s, e));
+  }), r;
+}
+function Qn(t, n, e = !1) {
+  if (n instanceof _$1)
+    return nt(t, n, e);
+  if (n instanceof v$2)
+    return at(t, n, e);
+  let r = [new B$3([...t.segments])];
+  return n.figures.forEach((s) => {
+    r = r.flatMap((i) => at(i, s, e));
+  }), r;
 }
-function tt(n) {
-  return n < 0 ? "before" : n > 1 ? "after" : "between";
+function ft(t) {
+  return t < 0 ? "before" : t > 1 ? "after" : "between";
 }
-const nt = (n, t, e) => {
+const ut = (t, n, e) => {
   if (e === "before")
-    return n.distanceFrom(t.firstPoint);
+    return t.distanceFrom(n.firstPoint);
   if (e === "after")
-    return n.distanceFrom(t.lastPoint);
+    return t.distanceFrom(n.lastPoint);
   throw new Error("Invalid position");
 };
-function rn(n, t) {
-  const e = me(n, t);
+function pn(t, n) {
+  const e = me(t, n);
   if (e === "parallel")
     return Math.min(
-      n.distanceFrom(t.firstPoint),
-      n.distanceFrom(t.lastPoint)
+      t.distanceFrom(n.firstPoint),
+      t.distanceFrom(n.lastPoint)
     );
-  const { intersectionParam1: s, intersectionParam2: r } = e, i = tt(s), o = tt(r);
+  const { intersectionParam1: r, intersectionParam2: s } = e, i = ft(r), o = ft(s);
   if (i === "between" && o === "between")
     return 0;
   if (i === "between" && o !== "between")
-    return nt(n, t, o);
+    return ut(t, n, o);
   if (o === "between" && i !== "between")
-    return nt(t, n, i);
+    return ut(n, t, i);
   if (i === "before" && o === "before")
-    return J$3(n.firstPoint, t.firstPoint);
+    return J$3(t.firstPoint, n.firstPoint);
   if (i === "after" && o === "after")
-    return J$3(n.lastPoint, t.lastPoint);
+    return J$3(t.lastPoint, n.lastPoint);
   if (i === "before" && o === "after")
-    return J$3(n.firstPoint, t.lastPoint);
+    return J$3(t.firstPoint, n.lastPoint);
   if (i === "after" && o === "before")
-    return J$3(n.lastPoint, t.firstPoint);
+    return J$3(t.lastPoint, n.firstPoint);
   throw new Error("Invalid position");
 }
-function et(n, t) {
-  if (K$2(n, t).length > 0)
+function lt(t, n) {
+  if (K$2(t, n).length > 0)
     return 0;
-  const e = dn$1(n, t.center);
-  if (n.isOnSegment(e)) {
-    const s = J$3(e, t.center);
-    if (Math.abs(s - t.radius) < n.precision && t.isOnSegment(e))
+  const e = dn$1(t, n.center);
+  if (t.isOnSegment(e)) {
+    const r = J$3(e, n.center);
+    if (Math.abs(r - n.radius) < t.precision && n.isOnSegment(e))
       return 0;
-    if (s - t.radius > n.precision) {
-      const r = H$1(
-        Q$2(e, t.center)
-      ), i = it$3(
-        t.center,
-        nt$2(r, t.radius)
+    if (r - n.radius > t.precision) {
+      const s = H$1(
+        Q$2(e, n.center)
+      ), i = it$2(
+        n.center,
+        nt$2(s, n.radius)
       );
-      if (t.isOnSegment(i))
+      if (n.isOnSegment(i))
         return J$3(i, e);
     }
   }
   return Math.min(
-    t.distanceFrom(n.firstPoint),
-    t.distanceFrom(n.lastPoint),
     n.distanceFrom(t.firstPoint),
-    n.distanceFrom(t.lastPoint)
+    n.distanceFrom(t.lastPoint),
+    t.distanceFrom(n.firstPoint),
+    t.distanceFrom(n.lastPoint)
   );
 }
-const on = (n, t) => {
-  const e = n.angleToParam(t.firstAngle);
-  if (n.isValidParameter(e)) return !0;
-  const s = n.angleToParam(t.lastAngle);
-  return !!n.isValidParameter(s);
+const dn = (t, n) => {
+  const e = t.angleToParam(n.firstAngle);
+  if (t.isValidParameter(e)) return !0;
+  const r = t.angleToParam(n.lastAngle);
+  return !!t.isValidParameter(r);
 };
-function an(n, t) {
-  if (Dt(n, t, !0).length > 0) return 0;
-  const e = J$3(n.center, t.center);
-  if (e < n.precision && on(n, t))
-    return Math.abs(n.radius - t.radius);
-  const s = H$1(Q$2(t.center, n.center)), r = e - Math.abs(n.radius - t.radius) < n.precision;
-  let i = Ye(s);
-  r && t.radius > n.radius && (i += Math.PI);
-  const o = r ? i : i + Math.PI, a = n.angleToParam(i), f = t.angleToParam(o);
-  return n.isValidParameter(a) && t.isValidParameter(f) ? J$3(n.paramPoint(a), t.paramPoint(f)) : Math.min(
-    n.distanceFrom(t.firstPoint),
-    n.distanceFrom(t.lastPoint),
+function mn(t, n) {
+  if (Dt$1(t, n, !0).length > 0) return 0;
+  const e = J$3(t.center, n.center);
+  if (e < t.precision && dn(t, n))
+    return Math.abs(t.radius - n.radius);
+  const r = H$1(Q$2(n.center, t.center)), s = e - Math.abs(t.radius - n.radius) < t.precision;
+  let i = Ye(r);
+  s && n.radius > t.radius && (i += Math.PI);
+  const o = s ? i : i + Math.PI, c = t.angleToParam(i), f = n.angleToParam(o);
+  return t.isValidParameter(c) && n.isValidParameter(f) ? J$3(t.paramPoint(c), n.paramPoint(f)) : Math.min(
     t.distanceFrom(n.firstPoint),
-    t.distanceFrom(n.lastPoint)
+    t.distanceFrom(n.lastPoint),
+    n.distanceFrom(t.firstPoint),
+    n.distanceFrom(t.lastPoint)
   );
 }
-function cn(n, t, e) {
-  let s = 0, r = n.length - 1;
-  for (; s <= r; ) {
-    const i = Math.floor((s + r) / 2), o = e(n[i], t);
+function Pn(t, n, e) {
+  let r = 0, s = t.length - 1;
+  for (; r <= s; ) {
+    const i = Math.floor((r + s) / 2), o = e(t[i], n);
     if (o < 0)
-      s = i + 1;
+      r = i + 1;
     else if (o > 0)
-      r = i - 1;
+      s = i - 1;
     else
       return i;
   }
-  return -(s + 1);
+  return -(r + 1);
 }
-function fn(n, t, e) {
-  const s = cn(n, t, e);
-  s < 0 ? n.splice(-(s + 1), 0, t) : n.splice(s, 0, t);
+function wn(t, n, e) {
+  const r = Pn(t, n, e);
+  r < 0 ? t.splice(-(r + 1), 0, n) : t.splice(r, 0, n);
 }
-class ln {
+class Mn {
   constructor() {
-    P(this, "buckets");
+    M(this, "buckets");
     this.buckets = [];
   }
-  addInterval(t) {
-    const e = this.buckets[t.rectangle.diagonalBucketIndex];
-    e === void 0 ? this.buckets[t.rectangle.diagonalBucketIndex] = [t] : fn(e, t, (s, r) => s.value - r.value);
+  addInterval(n) {
+    const e = this.buckets[n.rectangle.diagonalBucketIndex];
+    e === void 0 ? this.buckets[n.rectangle.diagonalBucketIndex] = [n] : wn(e, n, (r, s) => r.value - s.value);
   }
-  removeInterval(t) {
-    const e = this.buckets[t.rectangle.diagonalBucketIndex];
+  removeInterval(n) {
+    const e = this.buckets[n.rectangle.diagonalBucketIndex];
     if (e === void 0)
       throw new Error("Interval not found");
     e.shift();
   }
   getBottomRightHullIntervals() {
-    const t = [];
+    const n = [];
     for (let e = this.buckets.length - 1; e >= 0; e--) {
-      const s = this.buckets[e];
-      if (!s === void 0) continue;
-      const r = s[0];
-      if (r !== void 0) {
-        if (!t.length) {
-          t.push(r);
+      const r = this.buckets[e];
+      if (!r === void 0) continue;
+      const s = r[0];
+      if (s !== void 0) {
+        if (!n.length) {
+          n.push(s);
           continue;
         }
-        for (; t.length && t[t.length - 1].value >= r.value; )
-          t.pop();
-        for (; t.length >= 2; ) {
-          const i = t[t.length - 1], o = t[t.length - 2], a = (r.value - o.value) / ((r.rectangle.diagonal - o.rectangle.diagonal) * 2);
-          if (o.value + (i.rectangle.diagonal - o.rectangle.diagonal) / 2 * a < i.value)
-            t.pop();
+        for (; n.length && n[n.length - 1].value >= s.value; )
+          n.pop();
+        for (; n.length >= 2; ) {
+          const i = n[n.length - 1], o = n[n.length - 2], c = (s.value - o.value) / ((s.rectangle.diagonal - o.rectangle.diagonal) * 2);
+          if (o.value + (i.rectangle.diagonal - o.rectangle.diagonal) / 2 * c < i.value)
+            n.pop();
           else
             break;
         }
-        t.push(r);
+        n.push(s);
       }
     }
-    return t;
+    return n;
   }
 }
-class un {
-  constructor(t, e) {
-    P(this, "diagonal");
-    P(this, "diagonalBucketIndex");
-    P(this, "xLength");
-    P(this, "yLength");
-    P(this, "index");
-    this.x = t, this.y = e, this.xLength = Math.pow(3, -t), this.yLength = Math.pow(3, -e), this.diagonal = Math.sqrt(
+class Sn {
+  constructor(n, e) {
+    M(this, "diagonal");
+    M(this, "diagonalBucketIndex");
+    M(this, "xLength");
+    M(this, "yLength");
+    M(this, "index");
+    this.x = n, this.y = e, this.xLength = Math.pow(3, -n), this.yLength = Math.pow(3, -e), this.diagonal = Math.sqrt(
       this.xLength * this.xLength + this.yLength * this.yLength
-    ), this.diagonalBucketIndex = t + e, this.index = `${t},${e}`;
-  }
-}
-class hn {
-  constructor(t, e = 1e-8, s = 1e3, r = 1e-6) {
-    P(this, "rectangles");
-    P(this, "buckets");
-    P(this, "fMin");
-    P(this, "argMin");
-    P(this, "tol");
-    this.fcn = t, this.endTolerance = e, this.maxIterations = s, this.epsilon = r, this.fcn = t, this.epsilon = r, this.endTolerance = e, this.maxIterations = s, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new ln();
-    const i = [0.5, 0.5], o = this.rect(0, 0), a = this.fcn(i);
-    this.buckets.addInterval(new O(i, a, o)), this.fMin = a, this.argMin = i, this.tol = o.diagonal;
-  }
-  registerInterval(t) {
-    this.buckets.addInterval(t), t.value <= this.fMin && (this.fMin = t.value, this.argMin = t.center, this.tol = t.rectangle.diagonal);
-  }
-  rect(t, e) {
-    const s = `${t},${e}`;
-    return this.rectangles.has(s) || this.rectangles.set(s, new un(t, e)), this.rectangles.get(s);
-  }
-  splitInterval(t) {
-    let e, s, r;
-    const [i, o] = t.center;
-    return t.rectangle.x <= t.rectangle.y ? (e = this.rect(t.rectangle.x + 1, t.rectangle.y), s = [i - e.xLength, o], r = [i + e.xLength, o]) : (e = this.rect(t.rectangle.x, t.rectangle.y + 1), s = [i, o - e.yLength], r = [i, o + e.yLength]), [
-      new O(s, this.fcn(s), e),
-      new O(t.center, t.value, e),
-      new O(r, this.fcn(r), e)
+    ), this.diagonalBucketIndex = n + e, this.index = `${n},${e}`;
+  }
+}
+class In {
+  constructor(n, e = 1e-8, r = 1e3, s = 1e-6) {
+    M(this, "rectangles");
+    M(this, "buckets");
+    M(this, "fMin");
+    M(this, "argMin");
+    M(this, "tol");
+    this.fcn = n, this.endTolerance = e, this.maxIterations = r, this.epsilon = s, this.fcn = n, this.epsilon = s, this.endTolerance = e, this.maxIterations = r, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new Mn();
+    const i = [0.5, 0.5], o = this.rect(0, 0), c = this.fcn(i);
+    this.buckets.addInterval(new O(i, c, o)), this.fMin = c, this.argMin = i, this.tol = o.diagonal;
+  }
+  registerInterval(n) {
+    this.buckets.addInterval(n), n.value <= this.fMin && (this.fMin = n.value, this.argMin = n.center, this.tol = n.rectangle.diagonal);
+  }
+  rect(n, e) {
+    const r = `${n},${e}`;
+    return this.rectangles.has(r) || this.rectangles.set(r, new Sn(n, e)), this.rectangles.get(r);
+  }
+  splitInterval(n) {
+    let e, r, s;
+    const [i, o] = n.center;
+    return n.rectangle.x <= n.rectangle.y ? (e = this.rect(n.rectangle.x + 1, n.rectangle.y), r = [i - e.xLength, o], s = [i + e.xLength, o]) : (e = this.rect(n.rectangle.x, n.rectangle.y + 1), r = [i, o - e.yLength], s = [i, o + e.yLength]), [
+      new O(r, this.fcn(r), e),
+      new O(n.center, n.value, e),
+      new O(s, this.fcn(s), e)
     ];
   }
   single_iteration() {
-    const t = this.buckets.getBottomRightHullIntervals();
-    for (; t.length >= 2; ) {
-      const e = t[0], s = t[1], r = (s.value - e.value) / ((s.rectangle.diagonal - e.rectangle.diagonal) / 2), i = e.value - r * s.value / 2;
+    const n = this.buckets.getBottomRightHullIntervals();
+    for (; n.length >= 2; ) {
+      const e = n[0], r = n[1], s = (r.value - e.value) / ((r.rectangle.diagonal - e.rectangle.diagonal) / 2), i = e.value - s * r.value / 2;
       if ((this.fMin - i) / Math.abs(this.fMin) < this.epsilon)
-        t.shift();
+        n.shift();
       else
         break;
     }
-    t.forEach((e) => {
+    n.forEach((e) => {
       this.buckets.removeInterval(e);
     });
-    for (const e of t) {
-      const [s, r, i] = this.splitInterval(e);
-      this.registerInterval(s), this.registerInterval(r), this.registerInterval(i);
+    for (const e of n) {
+      const [r, s, i] = this.splitInterval(e);
+      this.registerInterval(r), this.registerInterval(s), this.registerInterval(i);
     }
   }
   run() {
-    let t = 0;
-    for (; this.tol > this.endTolerance / 2 && (this.single_iteration(), t++, !(t > this.maxIterations)); )
+    let n = 0;
+    for (; this.tol > this.endTolerance / 2 && (this.single_iteration(), n++, !(n > this.maxIterations)); )
       ;
     return {
       fMin: this.fMin,
       argMin: this.argMin,
       tol: this.tol,
-      iterations: t
+      iterations: n
     };
   }
 }
 class O {
-  constructor(t, e, s) {
-    this.center = t, this.value = e, this.rectangle = s;
+  constructor(n, e, r) {
+    this.center = n, this.value = e, this.rectangle = r;
   }
 }
-function gn(n, t = 1e-8, e = 1e3, s = 1e-6) {
-  return new hn(
-    n,
+function An(t, n = 1e-8, e = 1e3, r = 1e-6) {
+  return new In(
     t,
+    n,
     e,
-    s
+    r
   ).run();
 }
-function pn(n, t, e = 1e-9) {
-  const s = gn((r) => {
-    const i = n.paramPoint(r[0]), o = t.paramPoint(r[1]);
-    return Rt$1(i, o);
+function vn(t, n, e = 1e-9) {
+  const r = An((s) => {
+    const i = t.paramPoint(s[0]), o = n.paramPoint(s[1]);
+    return Rt$2(i, o);
   }, e);
-  return Math.sqrt(s.fMin);
+  return Math.sqrt(r.fMin);
 }
-function dn(n, t) {
-  return n instanceof at$3 && t instanceof at$3 ? rn(n, t) : n instanceof at$3 && t instanceof ct$3 ? et(n, t) : n instanceof ct$3 && t instanceof at$3 ? et(t, n) : n instanceof ct$3 && t instanceof ct$3 ? an(n, t) : pn(n, t);
+function bn(t, n) {
+  return t instanceof at$3 && n instanceof at$3 ? pn(t, n) : t instanceof at$3 && n instanceof ct$3 ? lt(t, n) : t instanceof ct$3 && n instanceof at$3 ? lt(n, t) : t instanceof ct$3 && n instanceof ct$3 ? mn(t, n) : vn(t, n);
 }
-function wt(n) {
-  if (n instanceof Et$1) {
-    const r = Q$2(n.lastPoint, n.firstPoint), i = Q$2(n.firstControlPoint, n.firstPoint), o = Q$2(n.lastControlPoint, n.firstPoint), a = un$1(r, i), f = un$1(r, o);
-    if (a > 0 && f < 0 || a < 0 && f > 0) return !1;
+function xt(t) {
+  if (t instanceof Et$1) {
+    const s = Q$2(t.lastPoint, t.firstPoint), i = Q$2(t.firstControlPoint, t.firstPoint), o = Q$2(t.lastControlPoint, t.firstPoint), c = un(s, i), f = un(s, o);
+    if (c > 0 && f < 0 || c < 0 && f > 0) return !1;
   }
-  const t = tt$3(n.tangentAtFirstPoint), e = tt$3(n.tangentAtLastPoint);
-  let s = Pe(t, e);
-  return Math.abs(Math.acos(s)) < Math.PI / 3;
+  const n = tt$3(t.tangentAtFirstPoint), e = tt$3(t.tangentAtLastPoint);
+  let r = Pe(n, e);
+  return Math.abs(Math.acos(r)) < Math.PI / 3;
 }
-function K(n) {
-  if (wt(n)) return [n];
-  const [t, e] = n.splitAtParameters([0.5]);
+function X(t) {
+  if (xt(t)) return [t];
+  const [n, e] = t.splitAtParameters([0.5]);
   return [
-    ...K(t),
-    ...K(e)
+    ...X(n),
+    ...X(e)
   ];
 }
-function st(n) {
-  return wt(n) ? [n] : n.splitAtParameters(n.getParametersOfExtrema()).flatMap(K);
+function ht(t) {
+  return xt(t) ? [t] : t.splitAtParameters(t.getParametersOfExtrema()).flatMap(X);
 }
-function mn(n) {
-  const t = n.deltaAngle, e = Math.ceil(Math.abs(t) / (Math.PI / 2)), s = t / e, r = 4 * Math.tan(s / 4) / 3, i = n.clockwise ? -1 : 1, o = Array.from(
+function Ln(t) {
+  const n = t.deltaAngle, e = Math.ceil(Math.abs(n) / (Math.PI / 2)), r = n / e, s = 4 * Math.tan(r / 4) / 3, i = t.clockwise ? -1 : 1, o = Array.from(
     { length: e + 1 },
-    (f, c) => n.firstAngle + c * s * i
+    (f, a) => t.firstAngle + a * r * i
   );
-  return o.slice(0, -1).map((f, c) => [f, o[c + 1]]).map(([f, c]) => {
-    const l = Math.cos(f), p = Math.sin(f), g = Math.cos(c), d = Math.sin(c), [u, S] = n.center, M = n.minorRadius, v = n.majorRadius, k = new et$4().rotate(
-      n.tiltAngle,
-      n.center
-    ), C = (Ft) => k.transform(Ft), D = C([u + v * l, S + M * p]), G = C([
-      u + v * (l - r * p * i),
-      S + M * (p + r * l * i)
-    ]), kt = C([
-      u + v * (g + r * d * i),
-      S + M * (d - r * g * i)
-    ]), Et = C([u + v * g, S + M * d]);
-    return new Et$1(D, Et, G, kt);
+  return o.slice(0, -1).map((f, a) => [f, o[a + 1]]).map(([f, a]) => {
+    const u = Math.cos(f), g = Math.sin(f), p = Math.cos(a), d = Math.sin(a), [l, S] = t.center, w = t.minorRadius, I = t.majorRadius, L = new et$4().rotate(
+      t.tiltAngle,
+      t.center
+    ), k = ($t) => L.transform($t), D = k([l + I * u, S + w * g]), $ = k([
+      l + I * (u - s * g * i),
+      S + w * (g + s * u * i)
+    ]), Gt = k([
+      l + I * (p + s * d * i),
+      S + w * (d - s * p * i)
+    ]), _t = k([l + I * p, S + w * d]);
+    return new Et$1(D, _t, $, Gt);
   });
 }
-const X = 1e-8, Mt = (n) => n.flatMap((t) => t instanceof at$3 ? [t] : t instanceof ct$3 ? [t] : t instanceof jt$1 ? mn(t).flatMap(
-  (e) => st(e)
-) : t instanceof _t$1 || t instanceof Et$1 ? st(t) : [new at$3(t.firstPoint, t.lastPoint)]);
-function q(n, t, e = !0) {
-  const s = n.map((c) => ({
-    offset: y(c, t),
-    original: c
-  })), r = [];
-  let i = e ? null : s.at(-1), o = e ? s.at(-1) : null;
-  if (r.length === 1) return r;
-  const a = (c) => {
-    i ? c.offset instanceof S ? Y$2(c.offset.firstPoint, c.offset.lastPoint) || r.push(
-      new at$3(c.offset.firstPoint, c.offset.lastPoint)
-    ) : r.push(c.offset) : i = c;
+const et = 1e-8, yt = (t) => t.flatMap((n) => n instanceof at$3 ? [n] : n instanceof ct$3 ? [n] : n instanceof jt$1 ? Ln(n).flatMap(
+  (e) => ht(e)
+) : n instanceof _t$1 || n instanceof Et$1 ? ht(n) : [new at$3(n.firstPoint, n.lastPoint)]);
+function J(t, n, e = !0) {
+  const r = t.map((a) => ({
+    offset: y(a, n),
+    original: a
+  })), s = [];
+  let i = e ? null : r.at(-1), o = e ? r.at(-1) : null;
+  if (s.length === 1) return s;
+  const c = (a) => {
+    i ? a.offset instanceof S ? Y$3(a.offset.firstPoint, a.offset.lastPoint) || s.push(
+      new at$3(a.offset.firstPoint, a.offset.lastPoint)
+    ) : s.push(a.offset) : i = a;
   }, f = function* () {
-    for (const c of s.slice(0, -1))
-      yield c;
+    for (const a of r.slice(0, -1))
+      yield a;
     if (!i) throw new Error("Bug in the offset algorithm");
     yield i;
   };
-  for (const c of f()) {
+  for (const a of f()) {
     if (!o) {
-      o = c;
+      o = a;
       continue;
     }
-    const l = o.offset.lastPoint, p = c.offset.firstPoint;
-    if (Y$2(l, p)) {
-      a(o), o = c;
+    const u = o.offset.lastPoint, g = a.offset.firstPoint;
+    if (Y$3(u, g)) {
+      c(o), o = a;
       continue;
     }
-    let g = [];
-    if (!(o.offset instanceof S) && !(c.offset instanceof S)) {
-      const { intersections: M, overlaps: v } = Z(
+    let p = [];
+    if (!(o.offset instanceof S) && !(a.offset instanceof S)) {
+      const { intersections: w, overlaps: I } = Z$1(
         o.offset,
-        c.offset,
-        X / 100
+        a.offset,
+        et / 100
       );
-      g = [
-        ...M,
-        ...v.flatMap((k) => [k.firstPoint, k.lastPoint])
+      p = [
+        ...w,
+        ...I.flatMap((L) => [L.firstPoint, L.lastPoint])
       ];
     }
-    if (g.length > 0) {
-      let M = g[0];
-      if (g.length > 1) {
-        const C = o == null ? void 0 : o.original.lastPoint, D = g.map(
-          (G) => Rt$1(G, C)
+    if (p.length > 0) {
+      let w = p[0];
+      if (p.length > 1) {
+        const k = o == null ? void 0 : o.original.lastPoint, D = p.map(
+          ($) => Rt$2($, k)
         );
-        M = g[D.indexOf(Math.min(...D))];
+        w = p[D.indexOf(Math.min(...D))];
       }
-      const v = o.offset.splitAt([
-        M
-      ])[0], k = c.offset.splitAt([M]).at(-1);
-      if (!k) throw new Error("Bug in the splitting algo in offset");
-      a({
-        offset: v,
+      const I = o.offset.splitAt([
+        w
+      ])[0], L = a.offset.splitAt([w]).at(-1);
+      if (!L) throw new Error("Bug in the splitting algo in offset");
+      c({
+        offset: I,
         original: o.original
-      }), o = { offset: k, original: c.original };
+      }), o = { offset: L, original: a.original };
       continue;
     }
-    const d = o.original.lastPoint, u = St$2(
-      Q$2(p, d),
-      Q$2(l, d)
-    ) > 0, S$1 = new ct$3(l, p, d, u);
-    a(o), r.push(S$1), o = c;
+    const d = o.original.lastPoint, l = St$1(
+      Q$2(g, d),
+      Q$2(u, d)
+    ) > 0, S$1 = new ct$3(u, g, d, l);
+    c(o), s.push(S$1), o = a;
   }
-  return o && a(o), r;
+  return o && c(o), s;
 }
-function It(n) {
-  const t = /* @__PURE__ */ new Map(), e = (s, r) => {
-    const i = t.get(s) || [];
-    t.set(s, [...i, ...r]);
+function Ct(t) {
+  const n = /* @__PURE__ */ new Map(), e = (r, s) => {
+    const i = n.get(r) || [];
+    n.set(r, [...i, ...s]);
   };
-  return n.forEach((s, r) => {
-    n.slice(r + 1).forEach((i, o) => {
-      const { intersections: a, overlaps: f } = Z(s, i, X), c = [
-        ...a,
-        ...f.flatMap((l) => [l.firstPoint, l.lastPoint])
-      ].filter((l) => {
-        const p = Y$2(l, s.firstPoint) || Y$2(l, s.lastPoint), g = Y$2(l, i.firstPoint) || Y$2(l, i.lastPoint);
-        return !(p && g);
+  return t.forEach((r, s) => {
+    t.slice(s + 1).forEach((i, o) => {
+      const { intersections: c, overlaps: f } = Z$1(r, i, et), a = [
+        ...c,
+        ...f.flatMap((u) => [u.firstPoint, u.lastPoint])
+      ].filter((u) => {
+        const g = Y$3(u, r.firstPoint) || Y$3(u, r.lastPoint), p = Y$3(u, i.firstPoint) || Y$3(u, i.lastPoint);
+        return !(g && p);
       });
-      c.length && (e(r, c), e(o + r + 1, c));
+      a.length && (e(s, a), e(o + s + 1, a));
     });
-  }), t;
+  }), n;
 }
-function St(n, t) {
-  return t.flatMap((e, s) => {
-    if (!n.has(s)) return e;
-    const r = n.get(s);
-    return r ? e.splitAt(r) : e;
+function Dt(t, n) {
+  return n.flatMap((e, r) => {
+    if (!t.has(r)) return e;
+    const s = t.get(r);
+    return s ? e.splitAt(s) : e;
   });
 }
-function bt(n, t, e) {
-  return n.filter((s) => !t.segments.some((i) => dn(i, s) < Math.abs(e) - X));
+function Ot(t, n, e) {
+  return t.filter((r) => !n.segments.some((i) => bn(i, r) < Math.abs(e) - et));
 }
-function T(n, t) {
-  const e = n.clockwise ? t : -t, s = Mt(n.segments), r = q(s, e);
-  if (r.length < 2) return new O$2();
-  const i = It(r);
+function G(t, n) {
+  const e = t.clockwise ? n : -n, r = yt(t.segments), s = J(r, e);
+  if (s.length < 2) return new O$2();
+  const i = Ct(s);
   if (!i.size) {
-    const l = new _$2(r);
-    return new O$2([new v$2(l)]);
+    const u = new _$1(s);
+    return new O$2([new v$2(u)]);
   }
-  const o = St(
+  const o = Dt(
     i,
-    r
-  ), a = bt(o, n, t);
-  if (!a.length) return new O$2();
-  const c = Xt(a).filter((l) => l.length > 1).filter((l) => Y$2(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new _$2(l));
-  return c.length ? new O$2(c.map((l) => new v$2(l))) : new O$2();
+    s
+  ), c = Ot(o, t, n);
+  if (!c.length) return new O$2();
+  const a = Xt(c).filter((u) => u.length > 1).filter((u) => Y$3(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new _$1(u));
+  return a.length ? new O$2(a.map((u) => new v$2(u))) : new O$2();
 }
-function Pn(n, t, e = "round") {
-  const s = t / 2, r = Mt(n.segments), i = q(r, s, !1), o = q(
-    r,
-    -s,
+function En(t, n, e = "round") {
+  const r = n / 2, s = yt(t.segments), i = J(s, r, !1), o = J(
+    s,
+    -r,
     !1
-  ).map((u) => u.reverse());
+  ).map((l) => l.reverse());
   o.reverse();
-  const a = (u, S) => e === "round" ? mn$2(
-    u.lastPoint,
+  const c = (l, S) => e === "round" ? mn$2(
+    l.lastPoint,
     S.firstPoint,
-    u.tangentAtLastPoint
-  ) : new at$3(u.lastPoint, S.firstPoint), f = [
+    l.tangentAtLastPoint
+  ) : new at$3(l.lastPoint, S.firstPoint), f = [
     ...i,
-    a(
+    c(
       i[i.length - 1],
       o[0]
     ),
     ...o,
-    a(
+    c(
       o[o.length - 1],
       i[0]
     )
-  ], c = It(f);
-  if (!c.size) {
-    const u = new _$2(f);
-    return new O$2([new v$2(u)]);
+  ], a = Ct(f);
+  if (!a.size) {
+    const l = new _$1(f);
+    return new O$2([new v$2(l)]);
   }
-  const l = St(
-    c,
+  const u = Dt(
+    a,
     f
-  ), p = bt(l, n, s);
-  if (!p.length) return new O$2();
-  const d = Xt(p).filter((u) => u.length > 1).filter((u) => Y$2(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new _$2(u));
-  return d.length ? new O$2(d.map((u) => new v$2(u))) : new O$2();
-}
-function wn(n, t) {
-  const e = n.map((s) => {
-    const r = z(
-      s.holes.map((i) => T(i, t))
+  ), g = Ot(u, t, r);
+  if (!g.length) return new O$2();
+  const d = Xt(g).filter((l) => l.length > 1).filter((l) => Y$3(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new _$1(l));
+  return d.length ? new O$2(d.map((l) => new v$2(l))) : new O$2();
+}
+function kn(t, n) {
+  const e = t.map((r) => {
+    const s = z(
+      r.holes.map((i) => G(i, n))
     );
-    return Pt(T(s.contour, t), r);
+    return Ft(G(r.contour, n), s);
   });
   return z(e);
 }
-function Mn(n, t) {
-  const e = Math.abs(t / 2), s = n.map(
-    (r) => z(
-      r.allLoops.map((i) => Pt(T(i, e), T(i, -e)))
+function Fn(t, n) {
+  const e = Math.abs(n / 2), r = t.map(
+    (s) => z(
+      s.allLoops.map((i) => Ft(G(i, e), G(i, -e)))
     )
   );
-  return z(s);
+  return z(r);
 }
-function Dn(n, t) {
-  return wn(L(n), t);
+function Yn(t, n) {
+  return kn(x(t), n);
 }
-function On(n, t, { endCap: e = "round" } = {}) {
-  return n instanceof B$3 ? Pn(n, t, e) : Mn(L(n), t);
+function Zn(t, n, { endCap: e = "round" } = {}) {
+  return t instanceof B$3 ? En(t, n, e) : Fn(x(t), n);
 }
-class In {
+class xn {
   constructor() {
-    P(this, "filters");
+    M(this, "filters");
     this.filters = [];
   }
   delete() {
@@ -7934,66 +7934,66 @@ class In {
    * Combine logically a set of filter with an AND operation.
    *
    */
-  and(t) {
-    return t.forEach((e) => e(this)), this;
+  and(n) {
+    return n.forEach((e) => e(this)), this;
   }
   /**
    * Invert the result of a particular filter
    *
    */
-  not(t) {
+  not(n) {
     const e = new this.constructor();
-    t(e);
-    const s = ({ element: r }) => !e.shouldKeep(r);
-    return this.filters.push(s), this;
+    n(e);
+    const r = ({ element: s }) => !e.shouldKeep(s);
+    return this.filters.push(r), this;
   }
   /**
    * Combine logically a set of filter with an OR operation.
    *
    */
-  either(t) {
-    const e = t.map((r) => {
+  either(n) {
+    const e = n.map((s) => {
       const i = new this.constructor();
-      return r(i), i;
-    }), s = ({ element: r }) => e.some((i) => i.shouldKeep(r));
-    return this.filters.push(s), this;
+      return s(i), i;
+    }), r = ({ element: s }) => e.some((i) => i.shouldKeep(s));
+    return this.filters.push(r), this;
   }
 }
-const _ = 2 * Math.PI, rt = (n) => {
-  const t = n % _, e = t < 0 ? t + _ : t;
-  return e < Math.PI ? e : e === Math.PI ? 0 : Math.abs(e - _);
+const V = 2 * Math.PI, gt = (t) => {
+  const n = t % V, e = n < 0 ? n + V : n;
+  return e < Math.PI ? e : e === Math.PI ? 0 : Math.abs(e - V);
 };
-class x extends In {
+class C extends xn {
   clone() {
-    const t = new x();
-    return t.filters = [...this.filters], t;
+    const n = new C();
+    return n.filters = [...this.filters], n;
   }
   /**
    * Filter to find corner that have their point are in the list.
    *
    */
-  inList(t) {
-    const e = ({ element: s }) => !!t.find((r) => Y$2(r, s.point));
+  inList(n) {
+    const e = ({ element: r }) => !!n.find((s) => Y$3(s, r.point));
     return this.filters.push(e), this;
   }
   /**
    * Filter to find elements that are at a specified distance from a point.
    *
    */
-  atDistance(t, e = [0, 0]) {
-    function s({ element: r }) {
-      return Math.abs(J$3(e, r.point) - t) < 1e-9;
+  atDistance(n, e = [0, 0]) {
+    function r({ element: s }) {
+      return Math.abs(J$3(e, s.point) - n) < 1e-9;
     }
-    return this.filters.push(s), this;
+    return this.filters.push(r), this;
   }
   /**
    * Filter to find elements that contain a certain point
    *
    * @category Filter
    */
-  atPoint(t) {
-    function e({ element: s }) {
-      return Y$2(t, s.point);
+  atPoint(n) {
+    function e({ element: r }) {
+      return Y$3(n, r.point);
     }
     return this.filters.push(e), this;
   }
@@ -8002,245 +8002,351 @@ class x extends In {
    *
    * @category Filter
    */
-  inBox(t, e) {
-    const [s, r] = t, [i, o] = e, a = Math.min(s, i), f = Math.max(s, i), c = Math.min(r, o), l = Math.max(r, o);
-    function p({ element: g }) {
-      const [d, u] = g.point;
-      return d >= a && d <= f && u >= c && u <= l;
+  inBox(n, e) {
+    const [r, s] = n, [i, o] = e, c = Math.min(r, i), f = Math.max(r, i), a = Math.min(s, o), u = Math.max(s, o);
+    function g({ element: p }) {
+      const [d, l] = p.point;
+      return d >= c && d <= f && l >= a && l <= u;
     }
-    return this.filters.push(p), this;
+    return this.filters.push(g), this;
   }
   /**
    * Filter to find corner that a certain angle between them - only between
    * 0 and 180.
    *
    */
-  ofAngle(t) {
-    function e({ element: s }) {
-      const r = s.firstCurve.tangentAtLastPoint, i = s.secondCurve.tangentAtFirstPoint;
+  ofAngle(n) {
+    function e({ element: r }) {
+      const s = r.firstCurve.tangentAtLastPoint, i = r.secondCurve.tangentAtFirstPoint;
       return Math.abs(
-        rt(un$1(r, i)) - rt(fe$1 * t)
+        gt(un(s, i)) - gt(fe$1 * n)
       ) < 1e-9;
     }
     return this.filters.push(e), this;
   }
-  above(t = 0) {
-    function e({ element: s }) {
-      return s.point[1] > t;
+  above(n = 0) {
+    function e({ element: r }) {
+      return r.point[1] > n;
     }
     return this.filters.push(e), this;
   }
-  below(t = 0) {
-    function e({ element: s }) {
-      return s.point[1] < t;
+  below(n = 0) {
+    function e({ element: r }) {
+      return r.point[1] < n;
     }
     return this.filters.push(e), this;
   }
-  leftOf(t = 0) {
-    function e({ element: s }) {
-      return s.point[0] < t;
+  leftOf(n = 0) {
+    function e({ element: r }) {
+      return r.point[0] < n;
     }
     return this.filters.push(e), this;
   }
-  rightOf(t = 0) {
-    function e({ element: s }) {
-      return s.point[0] > t;
+  rightOf(n = 0) {
+    function e({ element: r }) {
+      return r.point[0] > n;
     }
     return this.filters.push(e), this;
   }
-  shouldKeep(t) {
-    return this.filters.every((s) => s({ element: t }));
+  shouldKeep(n) {
+    return this.filters.every((r) => r({ element: n }));
   }
   asFilterFun() {
     return this.shouldKeep.bind(this);
   }
 }
-function At(n, t, e, s = () => !0) {
-  const r = [t.segments[0]], i = (a, f) => {
-    s({ firstCurve: a, secondCurve: f, point: a.lastPoint }) ? r.push(...n(a, f, e)) : r.push(a, f);
+function Bt(t, n, e, r = () => !0) {
+  const s = [n.segments[0]], i = (c, f) => {
+    r({ firstCurve: c, secondCurve: f, point: c.lastPoint }) ? s.push(...t(c, f, e)) : s.push(c, f);
   };
-  if (t.segments.slice(1).forEach((a) => {
-    const f = r.pop();
+  if (n.segments.slice(1).forEach((c) => {
+    const f = s.pop();
     if (!f) throw new Error("Bug in the stroke filletting algo");
-    i(f, a);
-  }), !r.at(-1)) throw new Error("Bug in the stroke corner algo");
-  if (t instanceof _$2) {
-    const a = r.pop(), f = r.shift();
-    if (!a || !f)
+    i(f, c);
+  }), !s.at(-1)) throw new Error("Bug in the stroke corner algo");
+  if (n instanceof _$1) {
+    const c = s.pop(), f = s.shift();
+    if (!c || !f)
       throw new Error("Bug in the filletting algo");
-    return i(a, f), new _$2(r, { ignoreChecks: !0 });
+    return i(c, f), new _$1(s, { ignoreChecks: !0 });
   } else
-    return new B$3(r, { ignoreChecks: !0 });
-}
-function B(n, t, e) {
-  const s = typeof e == "function" ? e(new x()) : e, r = s && s.asFilterFun();
-  if (n instanceof _$2 || n instanceof B$3)
-    return At(V, n, t, r);
-  if (n instanceof v$2) {
-    const i = B(n.contour, t, s), o = n.holes.map((a) => B(a, t, s));
+    return new B$3(s, { ignoreChecks: !0 });
+}
+function R(t, n, e) {
+  const r = typeof e == "function" ? e(new C()) : e, s = r && r.asFilterFun();
+  if (t instanceof _$1 || t instanceof B$3)
+    return Bt(V$1, t, n, s);
+  if (t instanceof v$2) {
+    const i = R(t.contour, n, r), o = t.holes.map((c) => R(c, n, r));
     return new v$2(i, o, { ignoreChecks: !0 });
   }
-  if (n instanceof O$2) {
-    const i = n.figures.map((o) => B(o, t, s));
+  if (t instanceof O$2) {
+    const i = t.figures.map((o) => R(o, n, r));
     return new O$2(i, { ignoreChecks: !0 });
   }
   throw new Error("invalid shape to fillet");
 }
-function R(n, t, e) {
-  const s = typeof e == "function" ? e(new x()) : e, r = s && s.asFilterFun();
-  if (n instanceof _$2 || n instanceof B$3)
-    return At(V, n, t, r);
-  if (n instanceof v$2) {
-    const i = R(n.contour, t, s), o = n.holes.map((a) => R(a, t, s));
+function T(t, n, e) {
+  const r = typeof e == "function" ? e(new C()) : e, s = r && r.asFilterFun();
+  if (t instanceof _$1 || t instanceof B$3)
+    return Bt(V$1, t, n, s);
+  if (t instanceof v$2) {
+    const i = T(t.contour, n, r), o = t.holes.map((c) => T(c, n, r));
     return new v$2(i, o, { ignoreChecks: !0 });
   }
-  if (n instanceof O$2) {
-    const i = n.figures.map((o) => R(o, t, s));
+  if (t instanceof O$2) {
+    const i = t.figures.map((o) => T(o, n, r));
     return new O$2(i, { ignoreChecks: !0 });
   }
   throw new Error("invalid shape to chamfer");
 }
-class Sn extends x {
-  constructor(t) {
-    super(), this.shape = t;
+class yn extends C {
+  constructor(n) {
+    super(), this.shape = n;
   }
-  fillet(t) {
-    return B(this.shape, t, this.clone());
+  fillet(n) {
+    return R(this.shape, n, this.clone());
   }
-  chamfer(t) {
-    return R(this.shape, t, this.clone());
+  chamfer(n) {
+    return T(this.shape, n, this.clone());
   }
 }
-function Bn(n) {
-  return new Sn(n);
+function Wn(t) {
+  return new yn(t);
 }
-function it(n) {
-  if (n instanceof O$2)
-    return d(n);
-  if (n instanceof v$2)
-    return p(n);
-  if (n instanceof _$2)
-    return `<path d="${w(n)}" />`;
-  if (n instanceof B$3)
-    return `<path d="${j$1(n)}" />`;
-  if (Hn(n))
-    return `<path d="${`M ${n.firstPoint.join(" ")}`} ${s(
-      n
+const Cn = 1 * fe$1, Dn = 24;
+function H(t, n, e, r) {
+  const s = t.gradientAt(n);
+  return an(s) <= r ? e : H$1(s);
+}
+function Q(t, n, e, r, s, i) {
+  const o = t.paramPoint(n), c = t.paramPoint(e), f = Q$2(c, o), a = an(f);
+  if (a <= t.precision || i >= r.maxDepth)
+    return [o, c];
+  const u = [f[0] / a, f[1] / a], g = (n + e) * 0.5, p = H(t, n, u, t.precision), d = H(t, g, u, t.precision), l = H(t, e, u, t.precision), S = Pe(p, d), w = Pe(d, l);
+  if (S >= s && w >= s)
+    return [o, c];
+  const I = t.paramPoint(g), L = S >= s ? [o, I] : Q(t, n, g, r, s, i + 1), k = w >= s ? [I, c] : Q(t, g, e, r, s, i + 1);
+  return [...L.slice(0, -1), ...k];
+}
+function rt(t, n = {}) {
+  const e = {
+    maxAngle: n.maxAngle ?? Cn,
+    maxDepth: n.maxDepth ?? Dn
+  }, r = Math.cos(e.maxAngle);
+  return Q(t, 0, 1, e, r, 0);
+}
+function On(t, n) {
+  return new O$2(
+    t.figures.map((e) => Rt(e, n))
+  );
+}
+function Rt(t, n) {
+  return new v$2(
+    Y(t.contour, n),
+    t.holes.map((e) => Y(e, n))
+  );
+}
+function Y(t, n) {
+  return new _$1(st(t.segments, n));
+}
+function Bn(t, n) {
+  return new B$3(st(t.segments, n));
+}
+function st(t, n) {
+  return t.flatMap(n);
+}
+function Rn(t, n) {
+  if (t instanceof O$2)
+    return On(t, n);
+  if (t instanceof v$2)
+    return Rt(t, n);
+  if (t instanceof _$1)
+    return Y(t, n);
+  if (t instanceof B$3)
+    return Bn(t, n);
+  if (Hn(t))
+    return st([t], n);
+  throw new Error("Unsupported shape type");
+}
+function Tn(t) {
+  if (t.length < 2) return [];
+  const n = [];
+  for (let e = 0; e < t.length - 1; e += 1)
+    n.push(new at$3(t[e], t[e + 1]));
+  return n;
+}
+function zn(t, n) {
+  return Tn(rt(t, n));
+}
+function B(t, n) {
+  const e = [];
+  return t.forEach((r, s) => {
+    const i = rt(r, n);
+    if (i.length !== 0) {
+      if (s === 0) {
+        e.push(...i);
+        return;
+      }
+      e.push(...i.slice(1));
+    }
+  }), e.length > 1 && Y$3(e[0], e[e.length - 1]) && e.pop(), e;
+}
+function Gn(t) {
+  return t.length < 3 ? !1 : t.map((e, r) => {
+    const s = t[(r + 1) % t.length];
+    return (s[0] - e[0]) * (s[1] + e[1]);
+  }).reduce((e, r) => e + r, 0) > 0;
+}
+function K(t, n) {
+  return t.length < 3 || Gn(t) === n ? t : [...t].reverse();
+}
+function jn(t, n = {}) {
+  return Rn(t, (r) => zn(r, n));
+}
+function _n(t, n = {}) {
+  if (t instanceof O$2)
+    return t.figures.map((e) => _n(e, n));
+  if (t instanceof v$2) {
+    const e = K(
+      B(t.contour.segments, n),
+      !1
+    ), r = t.holes.map(
+      (s) => K(B(s.segments, n), !0)
+    );
+    return [e, ...r];
+  }
+  return t instanceof _$1 ? K(B(t.segments, n), !1) : t instanceof B$3 ? B(t.segments, n) : rt(t, n);
+}
+function pt(t) {
+  if (t instanceof O$2)
+    return d(t);
+  if (t instanceof v$2)
+    return p(t);
+  if (t instanceof _$1)
+    return `<path d="${w(t)}" />`;
+  if (t instanceof B$3)
+    return `<path d="${j(t)}" />`;
+  if (Hn(t))
+    return `<path d="${`M ${t.firstPoint.join(" ")}`} ${s(
+      t
     )}" />`;
   throw new Error("Unknown shape type");
 }
-const ot = (n) => "shape" in n ? n.shape : n, at = (n, t) => {
-  if (!("shape" in n)) return t;
-  const { color: e } = n;
-  return e ? `<g stroke="${e}">${t}</g>` : t;
-}, ct = (n) => new mt$1(n.xMin, -n.yMax, n.xMax, -n.yMin);
-function Rn(n, {
-  margin: t = 1,
+const dt = (t) => "shape" in t ? t.shape : t, mt = (t, n) => {
+  if (!("shape" in t)) return n;
+  const { color: e } = t;
+  return e ? `<g stroke="${e}">${n}</g>` : n;
+}, Pt = (t) => new mt$1(t.xMin, -t.yMax, t.xMax, -t.yMin);
+function te(t, {
+  margin: n = 1,
   unit: e = null,
-  viewBox: s
+  viewBox: r
 } = {}) {
-  if (Array.isArray(n)) {
-    const i = n.map((f) => ot(f).mirror()), o = i.map((f, c) => at(n[c], it(f))).join(`
-`), a = i.slice(1).reduce((f, c) => f.merge(c.boundingBox), i[0].boundingBox);
-    return A(o, s ? ct(s) : a, t, e);
+  if (Array.isArray(t)) {
+    const i = t.map((f) => dt(f).mirror()), o = i.map((f, a) => mt(t[a], pt(f))).join(`
+`), c = i.slice(1).reduce((f, a) => f.merge(a.boundingBox), i[0].boundingBox);
+    return A(o, r ? Pt(r) : c, n, e);
   }
-  const r = ot(n).mirror();
+  const s = dt(t).mirror();
   return A(
-    at(n, it(r)),
-    s ? ct(s) : r.boundingBox,
-    t,
+    mt(t, pt(s)),
+    r ? Pt(r) : s.boundingBox,
+    n,
     e
   );
 }
-const vt = (n) => {
-  if (n.type === "LINE")
-    return new at$3(n.firstPoint, n.lastPoint);
-  if (n.type === "ARC")
+const Tt = (t) => {
+  if (t.type === "LINE")
+    return new at$3(t.firstPoint, t.lastPoint);
+  if (t.type === "ARC")
     return new ct$3(
-      n.firstPoint,
-      n.lastPoint,
-      n.center,
-      n.clockwise
+      t.firstPoint,
+      t.lastPoint,
+      t.center,
+      t.clockwise
     );
-  if (n.type === "ELLIPSE_ARC")
+  if (t.type === "ELLIPSE_ARC")
     return new jt$1(
-      n.firstPoint,
-      n.lastPoint,
-      n.center,
-      n.majorRadius,
-      n.minorRadius,
-      n.tiltAngle,
-      n.clockwise,
+      t.firstPoint,
+      t.lastPoint,
+      t.center,
+      t.majorRadius,
+      t.minorRadius,
+      t.tiltAngle,
+      t.clockwise,
       { angleUnits: "rad" }
     );
-  if (n.type === "QUADRATIC_BEZIER")
+  if (t.type === "QUADRATIC_BEZIER")
     return new _t$1(
-      n.firstPoint,
-      n.lastPoint,
-      n.controlPoint
+      t.firstPoint,
+      t.lastPoint,
+      t.controlPoint
     );
-  if (n.type === "CUBIC_BEZIER")
+  if (t.type === "CUBIC_BEZIER")
     return new Et$1(
-      n.firstPoint,
-      n.lastPoint,
-      n.firstControlPoint,
-      n.lastControlPoint
+      t.firstPoint,
+      t.lastPoint,
+      t.firstControlPoint,
+      t.lastControlPoint
     );
   throw new Error("Unknown segment type");
-}, H = (n) => {
-  const t = n.segments.map(vt);
-  return new _$2(t);
-}, Lt = (n) => {
-  const t = H(n.contour), e = n.holes.map(H);
-  return new v$2(t, e);
-}, bn = (n) => {
-  const t = n.figures.map(Lt);
-  return new O$2(t);
+}, Z = (t) => {
+  const n = t.segments.map(Tt);
+  return new _$1(n);
+}, zt = (t) => {
+  const n = Z(t.contour), e = t.holes.map(Z);
+  return new v$2(n, e);
+}, $n = (t) => {
+  const n = t.figures.map(zt);
+  return new O$2(n);
 };
-function zn(n) {
-  if (n.type === "DIAGRAM")
-    return bn(n);
-  if (n.type === "FIGURE")
-    return Lt(n);
-  if (n.type === "LOOP")
-    return H(n);
-  if (n.type === "LINE" || n.type === "ARC" || n.type === "ELLIPSE_ARC" || n.type === "CUBIC_BEZIER")
-    return vt(n);
+function ne(t) {
+  if (t.type === "DIAGRAM")
+    return $n(t);
+  if (t.type === "FIGURE")
+    return zt(t);
+  if (t.type === "LOOP")
+    return Z(t);
+  if (t.type === "LINE" || t.type === "ARC" || t.type === "ELLIPSE_ARC" || t.type === "CUBIC_BEZIER")
+    return Tt(t);
   throw new Error("Unknown shape type");
 }
-const ft = Math.PI / 180, An = 180 / Math.PI;
-function Tn(n, t) {
-  const e = Math.cos(t * ft) * n, s = Math.sin(t * ft) * n;
-  return [e, s];
+const wt = Math.PI / 180, Un = 180 / Math.PI;
+function ee(t, n) {
+  const e = Math.cos(n * wt) * t, r = Math.sin(n * wt) * t;
+  return [e, r];
 }
-function $n([n, t]) {
-  const e = Math.sqrt(n * n + t * t), s = Math.atan2(t, n) * An;
-  return [e, s];
+function re([t, n]) {
+  const e = Math.sqrt(t * t + n * n), r = Math.atan2(n, t) * Un;
+  return [e, r];
 }
 
 var pantograph = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  DEG2RAD: ft,
-  DrawingPen: ot$2,
-  RAD2DEG: An,
-  cartesianToPolar: $n,
-  chamfer: R,
-  confineStrand: xn,
-  cut: Pt,
-  draw: lt$1,
-  eraseStrand: Cn,
-  exportJSON: It$1,
-  exportSVG: Rn,
-  fillet: B,
-  fuse: sn,
+  DEG2RAD: wt,
+  DrawingPen: ot$1,
+  RAD2DEG: Un,
+  cartesianToPolar: re,
+  chamfer: T,
+  confineStrand: Qn,
+  cut: Ft,
+  draw: lt$2,
+  eraseStrand: Jn,
+  exportJSON: It,
+  exportSVG: te,
+  fillet: R,
+  fuse: gn,
   fuseAll: z,
-  importJSON: zn,
-  intersect: yn,
-  offset: Dn,
-  outlineStroke: On,
-  polarToCartesian: Tn,
-  selectCorners: Bn,
-  svgBody: it
+  importJSON: ne,
+  intersect: Xn,
+  offset: Yn,
+  outlineStroke: Zn,
+  polarToCartesian: ee,
+  selectCorners: Wn,
+  svgBody: pt,
+  tesselate: jn,
+  tesselatePoints: _n
 });
 
 function sketchSegment(segment, plane) {
@@ -8310,7 +8416,7 @@ function sketchOnPlane(pantographObject, planeInput = "XY", origin = [0, 0, 0])
     if (pantographObject instanceof v$2) {
         return sketchFigure(pantographObject, plane);
     }
-    if (pantographObject instanceof _$2) {
+    if (pantographObject instanceof _$1) {
         return sketchStroke(pantographObject, plane);
     }
     if (pantographObject instanceof at$3 ||
@@ -8329,11 +8435,11 @@ function svgPathsForShape(shape) {
     else if (shape instanceof v$2) {
         return shape.allLoops.map((loop) => w(loop));
     }
-    else if (shape instanceof _$2) {
+    else if (shape instanceof _$1) {
         return [w(shape)];
     }
     else if (shape instanceof B$3) {
-        return [j$1(shape)];
+        return [j(shape)];
     }
     else if (Hn(shape)) {
         return [`M ${shape.firstPoint.join(" ")} ${s(shape)}`];
@@ -8346,7 +8452,7 @@ function toSVGViewBox(shape) {
 }
 function wrapPantograph(pantographObject) {
     const isPantograph = Hn(pantographObject) ||
-        pantographObject instanceof _$2 ||
+        pantographObject instanceof _$1 ||
         pantographObject instanceof v$2 ||
         pantographObject instanceof O$2 ||
         pantographObject instanceof Drawing;
@@ -8374,13 +8480,13 @@ class Drawing {
         return new Drawing(this.diagram.clone());
     }
     serialize() {
-        return JSON.stringify(It$1(this.diagram));
+        return JSON.stringify(It(this.diagram));
     }
     get boundingBox() {
         return this.diagram.boundingBox;
     }
     get repr() {
-        return JSON.stringify(It$1(this.diagram));
+        return JSON.stringify(It(this.diagram));
     }
     rotate(angle, center) {
         return new Drawing(this.diagram.rotate(angle, center));
@@ -8406,23 +8512,23 @@ class Drawing {
     cut(other) {
         const base = this.diagram;
         const tool = other.diagram;
-        return new Drawing(Pt(base, tool));
+        return new Drawing(Ft(base, tool));
     }
     fuse(other) {
         const base = this.diagram;
         const tool = other.diagram;
-        return new Drawing(sn(base, tool));
+        return new Drawing(gn(base, tool));
     }
     intersect(other) {
         const base = this.diagram;
         const tool = other.diagram;
-        return new Drawing(yn(base, tool));
+        return new Drawing(Xn(base, tool));
     }
     fillet(radius, filter) {
-        return new Drawing(B(this.diagram, radius, filter));
+        return new Drawing(R(this.diagram, radius, filter));
     }
     chamfer(radius, filter) {
-        return new Drawing(R(this.diagram, radius, filter));
+        return new Drawing(T(this.diagram, radius, filter));
     }
     sketchOnPlane(inputPlane = "XY", origin = [0, 0, 0]) {
         if (typeof inputPlane !== "string") {
@@ -8431,7 +8537,7 @@ class Drawing {
         return sketchOnPlane(this.diagram, inputPlane, origin);
     }
     toSVG(margin) {
-        return Rn(this.diagram, { margin });
+        return te(this.diagram, { margin });
     }
     toSVGViewBox(margin = 1) {
         return v(this.diagram.boundingBox, margin);
@@ -8440,17 +8546,17 @@ class Drawing {
         return svgPathsForShape(this.diagram);
     }
     offset(distance) {
-        return new Drawing(Dn(this.diagram, distance));
+        return new Drawing(Yn(this.diagram, distance));
     }
 }
-class ReDrawingPen extends ot$2 {
+class ReDrawingPen extends ot$1 {
     // @ts-expect-error forcing a different type
     close() {
         return new Drawing(super.close());
     }
     // @ts-expect-error forcing a different type
     closeWithMirror() {
-        return new Drawing(super.close());
+        return new Drawing(super.closeWithMirror());
     }
 }
 function redraw(p) {
@@ -8462,8 +8568,8 @@ function wrapDrawing(fn) {
     };
 }
 const drawCircle = wrapDrawing(ct$1);
-const drawRect = wrapDrawing(ot$1);
+const drawRect = wrapDrawing(ot);
 const drawEllipse = wrapDrawing(rt$1);
-const drawPolysides = wrapDrawing(lt);
+const drawPolysides = wrapDrawing(lt$1);
 
 export { Drawing, ReDrawingPen, drawCircle, drawEllipse, drawPolysides, drawRect, drawShape, initStudioIntegration, pantograph, redraw, sketchDiagram, sketchFigure, sketchOnPlane, sketchSegment, sketchStroke, wrapDrawing };