pantograph2d 0.10.1 → 0.11.1

package/dist/{QuadraticBezier-DCa0WGs0.js → QuadraticBezier-BeY2TXKH.js}

@@ -1,11 +1,12 @@
-var Oe = Object.defineProperty;
-var Me = (r) => {
+var Xe = Object.defineProperty;
+var ye = (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 = (r, s, t) => Be(r, typeof s != "symbol" ? s + "" : s, t), oe = (r, s, t) => s.has(r) || Me("Cannot " + t);
-var ht = (r, s, t) => (oe(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le = (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 = (r, s, t, e) => (oe(r, s, "write to private field"), e ? e.call(r, t) : s.set(r, t), t), he = (r, s, t) => (oe(r, s, "access private method"), t);
-function zt(r, s, t, e) {
+var Ze = (r, s, t) => s in r ? Xe(r, s, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[s] = t;
+var q = (r, s, t) => Ze(r, typeof s != "symbol" ? s + "" : s, t), oe = (r, s, t) => s.has(r) || ye("Cannot " + t);
+var ht = (r, s, t) => (oe(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le = (r, s, t) => s.has(r) ? ye("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt = (r, s, t, e) => (oe(r, s, "write to private field"), e ? e.call(r, t) : s.set(r, t), t), he = (r, s, t) => (oe(r, s, "access private method"), t);
+const Me = Symbol.for("pantograph:BoundingBox");
+function Ot(r, s, t, e) {
   return r <= e && s >= t;
 }
 class mt {
@@ -14,7 +15,10 @@ class mt {
     q(this, "yMin");
     q(this, "xMax");
     q(this, "yMax");
-    this.xMin = s, this.yMin = t, this.xMax = e, this.yMax = n;
+    Object.defineProperty(this, Me, { value: !0 }), this.xMin = s, this.yMin = t, this.xMax = e, this.yMax = n;
+  }
+  static isInstance(s) {
+    return !!s && s[Me] === !0;
   }
   get width() {
     return this.xMax - this.xMin;
@@ -35,10 +39,10 @@ class mt {
   }
   contains(s) {
     const [t, e] = s;
-    return zt(this.xMin, this.xMax, t, t) && zt(this.yMin, this.yMax, e, e);
+    return Ot(this.xMin, this.xMax, t, t) && Ot(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 Ot(this.xMin, this.xMax, s.xMin, s.xMax) && Ot(this.yMin, this.yMax, s.yMin, s.yMax);
   }
   addPoint(s) {
     const [t, e] = s;
@@ -69,47 +73,47 @@ class mt {
 function ce(r) {
   return r.reduce((s, t) => s.addPoint(t), new mt());
 }
-const ye = (r, s = 1e-9) => {
+const Pe = (r, s = 1e-9) => {
   let t = r;
   return Math.abs(r) < s && (t = 0), t.toFixed(-Math.log10(s));
 };
-function Te(r, s = 1e-9) {
+function Ne(r, s = 1e-9) {
   return Array.from(
     new Map(
       r.map(([t, e]) => [
-        `[${ye(t, s)},${ye(e, s)}]`,
+        `[${Pe(t, s)},${Pe(e, s)}]`,
         [t, e]
       ])
     ).values()
   );
 }
-const fe = Math.PI / 180, Ue = 180 / Math.PI, Z = (r) => `[${r[0]}, ${r[1]}]`, Y = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it = ([r, s], [t, e]) => [r + t, s + e], Q = ([r, s], [t, e]) => [r - t, s - e], It = ([r, s]) => r * r + s * s, an = ([r, s]) => Math.sqrt(It([r, s])), nt = ([r, s], t) => [r * t, s * t], Rt = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J = (r, s = [0, 0]) => Math.sqrt(Rt(r, s));
+const fe = Math.PI / 180, Je = 180 / Math.PI, Z = (r) => `[${r[0]}, ${r[1]}]`, Y = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it = ([r, s], [t, e]) => [r + t, s + e], Q = ([r, s], [t, e]) => [r - t, s - e], Tt = ([r, s]) => r * r + s * s, pn = ([r, s]) => Math.sqrt(Tt([r, s])), nt = ([r, s], t) => [r * t, s * t], Rt = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J = (r, s = [0, 0]) => Math.sqrt(Rt(r, s));
 function St([r, s], [t, e]) {
   return r * e - s * t;
 }
-function Pe([r, s], [t, e]) {
+function be([r, s], [t, e]) {
   return r * t + s * e;
 }
-function un([r, s], [t, e] = [0, 0]) {
+function dn([r, s], [t, e] = [0, 0]) {
   return Math.atan2(e * r - s * t, r * t + s * e);
 }
 function H([r, s]) {
   const t = J([r, s]);
   return [r / t, s / t];
 }
-function Tt(r, s) {
+function It(r, s) {
   const t = Math.cos(s) * r, e = Math.sin(s) * r;
   return [t, e];
 }
-function Ye([r, s]) {
+function Ke([r, s]) {
   return Math.atan2(s, r);
 }
-function We(r) {
-  const s = J(r), t = Ye(r);
+function He(r) {
+  const s = J(r), t = Ke(r);
   return [s, t];
 }
-function Ie(r, s, t = 1e-9) {
-  const e = St(r, s), n = It(r), i = It(s);
+function Ve(r, s, t = 1e-9) {
+  const e = St(r, s), n = Tt(r), i = Tt(s);
   return e * e < n * i * t * t;
 }
 function tt(r) {
@@ -118,23 +122,25 @@ function tt(r) {
 function Qt(r) {
   return [r[1], -r[0]];
 }
-function Qe(r, s, t) {
-  return Y(t, r) || Ie(Q(t, r), s);
+function ts(r, s, t) {
+  return Y(t, r) || Ve(Q(t, r), s);
 }
-const Mt = (r, s) => {
-  const [t, e, n, i, o, l, h, a, u] = r, [c, g, d, w, p, P, f, M, E] = s;
+const Ee = Symbol.for(
+  "pantograph:TransformationMatrix"
+), yt = (r, s) => {
+  const [t, e, n, i, o, l, h, a, u] = r, [c, g, d, w, p, P, f, y, E] = s;
   return [
     t * c + e * w + n * f,
-    t * g + e * p + n * M,
+    t * g + e * p + n * y,
     t * d + e * P + n * E,
     i * c + o * w + l * f,
-    i * g + o * p + l * M,
+    i * g + o * p + l * y,
     i * d + o * P + l * E,
     h * c + a * w + u * f,
-    h * g + a * p + u * M,
+    h * g + a * p + u * y,
     h * d + a * P + u * E
   ];
-}, Ge = (r) => {
+}, es = (r) => {
   const [s, t, e, n, i, o, l, h, a] = r, u = s * (i * a - o * h) - t * (n * a - o * l) + e * (n * h - i * l);
   return [
     (i * a - o * h) / u,
@@ -147,46 +153,51 @@ const Mt = (r, s) => {
     (t * l - s * h) / u,
     (s * i - t * n) / u
   ];
-}, Xe = (r) => {
+}, ss = (r) => {
   const [s, t, e, n, i, o, l, h, a] = r;
   return [s, n, l, t, i, h, e, o, a];
 };
 class et {
   constructor(s) {
     q(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]);
-    s && (this._matrix = [...s]);
+    Object.defineProperty(this, Ee, {
+      value: !0
+    }), s && (this._matrix = [...s]);
+  }
+  static isInstance(s) {
+    return !!s && s[Ee] === !0;
   }
   clone() {
     return new et(this._matrix);
   }
   transpose() {
-    return this._matrix = Xe(this._matrix), this;
+    return this._matrix = ss(this._matrix), this;
   }
   inverse() {
-    return this._matrix = Ge(this._matrix), this;
+    return this._matrix = es(this._matrix), this;
   }
   translate(s, t) {
-    return this._matrix = Mt([1, 0, s, 0, 1, t, 0, 0, 1], this._matrix), this;
+    return this._matrix = yt([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(i, this._matrix), t && this.translate(t[0], t[1]), this;
+    return t && this.translate(-t[0], -t[1]), this._matrix = yt(i, this._matrix), t && this.translate(t[0], t[1]), this;
   }
   mirrorX() {
-    return this._matrix = Mt([1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), this;
+    return this._matrix = yt([1, 0, 0, 0, -1, 0, 0, 0, 1], this._matrix), this;
   }
   mirrorY() {
-    return this._matrix = Mt([-1, 0, 0, 0, 1, 0, 0, 0, 1], this._matrix), this;
+    return this._matrix = yt([-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([-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 = yt([-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([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 = yt([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;
@@ -205,7 +216,7 @@ class et {
     return Math.sqrt(s * s + t * t);
   }
 }
-class Ze {
+class ns {
   translateX(s) {
     const t = new et().translate(s, 0);
     return this.transform(t);
@@ -242,7 +253,7 @@ class Ze {
     return s === "x" ? e.mirrorX() : s === "y" ? e.mirrorY() : e.mirrorLine(s, t), this.transform(e);
   }
 }
-class xt extends Ze {
+class Ft extends ns {
   constructor(t, e) {
     super();
     q(this, "precision", 1e-9);
@@ -260,14 +271,19 @@ class xt extends Ze {
     return this.repr;
   }
 }
-class at extends xt {
-  constructor() {
-    super(...arguments);
+const _e = Symbol.for("pantograph:Line");
+class at extends Ft {
+  constructor(t, e) {
+    super(t, e);
     q(this, "segmentType", "LINE");
     q(this, "_V", null);
     q(this, "_slope", null);
     q(this, "_yIntercept", null);
     q(this, "_boundingBox", null);
+    Object.defineProperty(this, _e, { value: !0 });
+  }
+  static isInstance(t) {
+    return !!t && t[_e] === !0;
   }
   isValidParameter(t) {
     const e = this.length * this.precision;
@@ -299,7 +315,7 @@ class at extends xt {
     return it(this.firstPoint, nt(this.V, 0.5));
   }
   isSame(t) {
-    return t instanceof at ? Y(this.firstPoint, t.firstPoint) && Y(this.lastPoint, t.lastPoint) || Y(this.lastPoint, t.firstPoint) && Y(this.firstPoint, t.lastPoint) : !1;
+    return at.isInstance(t) ? Y(this.firstPoint, t.firstPoint) && Y(this.lastPoint, t.lastPoint) || Y(this.lastPoint, t.firstPoint) && Y(this.firstPoint, t.lastPoint) : !1;
   }
   clone() {
     return new at(this.firstPoint, this.lastPoint);
@@ -316,7 +332,7 @@ class at extends xt {
     )), this._boundingBox;
   }
   distanceFrom(t) {
-    const e = Q(t, this.firstPoint), n = Pe(e, this.V) / this.squareLength;
+    const e = Q(t, this.firstPoint), n = be(e, this.V) / this.squareLength;
     if (n < 0)
       return J(t, this.firstPoint);
     if (n > 1)
@@ -327,8 +343,8 @@ class at extends xt {
   isOnSegment(t) {
     if (Y(t, this.firstPoint, this.precision)) return !0;
     const e = Q(t, this.firstPoint);
-    if (!Ie(this.V, e)) return !1;
-    const n = Pe(e, this.V) / this.squareLength;
+    if (!Ve(this.V, e)) return !1;
+    const n = be(e, this.V) / this.squareLength;
     return this.isValidParameter(n);
   }
   gradientAt(t) {
@@ -357,7 +373,7 @@ class at extends xt {
           `Point ${Z(a)} is not on segment ${this.repr}`
         );
     });
-    const n = [this.firstPoint, ...e, this.lastPoint], i = Te(n), o = this.lastPoint[0] - this.firstPoint[0];
+    const n = [this.firstPoint, ...e, this.lastPoint], i = Ne(n), o = this.lastPoint[0] - this.firstPoint[0];
     let l = Math.sign(o), h = 0;
     return Math.abs(o) < this.precision && (l = Math.sign(this.lastPoint[1] - this.firstPoint[1]), h = 1), i.sort(
       (a, u) => l * (a[h] - u[h])
@@ -370,12 +386,12 @@ class at extends xt {
     );
   }
 }
-function Je(r) {
+function is(r) {
   return Array.from(Array(r).keys());
 }
 function Kt(r) {
   const s = Math.min(...r.map((t) => t.length));
-  return Je(s).map((t) => r.map((e) => e[t]));
+  return is(s).map((t) => r.map((e) => e[t]));
 }
 function wt(r, s = 1e-9) {
   return r < 0 ? r + 2 * Math.PI : r >= 2 * Math.PI ? r % (2 * Math.PI) : r > 2 * Math.PI - s ? 0 : r;
@@ -385,7 +401,7 @@ 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(r.V, s.V), n = It(r.V), i = It(s.V), o = t ? t * t : r.precision * s.precision;
+  const e = St(r.V, s.V), n = Tt(r.V), i = Tt(s.V), o = t ? t * t : r.precision * s.precision;
   if (e * e < n * i * o)
     return "parallel";
   const l = Q(s.firstPoint, r.firstPoint), h = St(l, s.V) / e, a = St(l, r.V) / e;
@@ -394,12 +410,12 @@ const me = (r, s, t) => {
     intersectionParam2: a
   };
 };
-function cn(r, s, t = !1, e) {
+function yn(r, s, t = !1, e) {
   const n = me(r, s, e);
   if (n === "parallel") {
     if (!t) return null;
     if (r.isSame(s)) return r;
-    const l = Te(
+    const l = Ne(
       [
         s.isOnSegment(r.firstPoint) ? r.firstPoint : null,
         s.isOnSegment(r.lastPoint) ? r.lastPoint : null,
@@ -417,11 +433,11 @@ function cn(r, s, t = !1, e) {
   const { intersectionParam1: i, intersectionParam2: o } = n;
   return !r.isValidParameter(i) || !s.isValidParameter(o) ? null : r.paramPoint(i);
 }
-const Ot = (r, s) => {
+const Bt = (r, s) => {
   const t = Q(r, s);
-  return We(t);
-};
-class ct extends xt {
+  return He(t);
+}, je = Symbol.for("pantograph:Arc");
+class ct extends Ft {
   constructor(t, e, n, i = !1, { ignoreChecks: o = !1 } = {}) {
     super(t, e);
     q(this, "segmentType", "ARC");
@@ -433,7 +449,7 @@ class ct extends xt {
     q(this, "_firstAngle", null);
     q(this, "_lastAngle", null);
     q(this, "_boundingBox", null);
-    if (this.center = n, this.clockwise = i, !o) {
+    if (Object.defineProperty(this, je, { value: !0 }), this.center = n, this.clockwise = i, !o) {
       if (Y(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (Math.abs(this.radius - J(this.lastPoint, this.center)) > this.precision)
@@ -444,6 +460,9 @@ class ct extends xt {
         );
     }
   }
+  static isInstance(t) {
+    return !!t && t[je] === !0;
+  }
   get info() {
     return `ARC(${Z(this.firstPoint)}, ${Z(
       this.lastPoint
@@ -479,14 +498,14 @@ class ct extends xt {
   paramPoint(t) {
     return it(
       this.center,
-      Tt(
+      It(
         this.radius,
         this.firstAngle + t * this.angularLength * (this.clockwise ? -1 : 1)
       )
     );
   }
   pointToParam(t) {
-    const [e, n] = Ot(t, this.center);
+    const [e, n] = Bt(t, this.center);
     if (Math.abs(e - this.radius) > this.precision)
       throw new Error(
         `Point ${Z(t)} is not on segment ${this.repr}`
@@ -525,7 +544,7 @@ class ct extends xt {
     return this.paramPoint(0.5);
   }
   isSame(t) {
-    return !(t instanceof ct) || !Y(this.center, t.center) ? !1 : Y(this.firstPoint, t.firstPoint) && Y(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y(this.lastPoint, t.firstPoint) && Y(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
+    return !ct.isInstance(t) || !Y(this.center, t.center) ? !1 : Y(this.firstPoint, t.firstPoint) && Y(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y(this.lastPoint, t.firstPoint) && Y(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
   }
   clone() {
     return new ct(
@@ -556,7 +575,7 @@ class ct extends xt {
     return this._boundingBox;
   }
   distanceFrom(t) {
-    const [e, n] = Ot(t, this.center);
+    const [e, n] = Bt(t, this.center);
     return this.isValidParameter(this.angleToParam(n)) ? Math.abs(e - this.radius) : Math.sqrt(
       Math.min(
         Rt(t, this.firstPoint),
@@ -567,7 +586,7 @@ class ct extends xt {
   isOnSegment(t) {
     if (Y(t, this.firstPoint) || Y(t, this.lastPoint))
       return !0;
-    const [e, n] = Ot(t, this.center);
+    const [e, n] = Bt(t, this.center);
     if (Math.abs(e - this.radius) > this.precision) return !1;
     const i = this.angleToParam(n);
     return this.isValidParameter(i);
@@ -577,21 +596,21 @@ class ct extends xt {
     return this.clockwise ? [-i, -o] : [i, o];
   }
   tangentAt(t) {
-    const [e, n] = Ot(t, this.center);
+    const [e, n] = Bt(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 = It(1, n);
     return (this.clockwise ? Qt : tt)(H(o));
   }
   get tangentAtFirstPoint() {
-    const t = Tt(1, this.firstAngle);
+    const t = It(1, this.firstAngle);
     return (this.clockwise ? Qt : tt)(H(t));
   }
   get tangentAtLastPoint() {
-    const t = Tt(1, this.lastAngle);
+    const t = It(1, this.lastAngle);
     return (this.clockwise ? Qt : tt)(H(t));
   }
   splitAt(t) {
@@ -627,7 +646,7 @@ class ct extends xt {
     );
   }
 }
-function fn(r, s, t) {
+function Mn(r, s, t) {
   const e = new at(s, r), n = new at(s, t), i = tt(e.tangentAtFirstPoint), o = tt(n.tangentAtLastPoint), l = me(
     { firstPoint: e.midPoint, V: i, precision: 1e-9 },
     { firstPoint: n.midPoint, V: o, precision: 1e-9 }
@@ -646,7 +665,7 @@ function fn(r, s, t) {
     { ignoreChecks: !0 }
   );
 }
-function mn(r, s, t) {
+function Pn(r, s, t) {
   const e = new at(r, s), n = tt(e.tangentAtFirstPoint), i = me(
     { firstPoint: e.midPoint, V: n, precision: 1e-9 },
     {
@@ -668,26 +687,26 @@ function mn(r, s, t) {
     ignoreChecks: !0
   });
 }
-const be = 1e-21, Bt = 1.618034;
-function Ee(r, s = 0, t = 1, e = 110, n = 1e3) {
+const Se = 1e-21, zt = 1.618034;
+function ke(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 * (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)
+  for (o = r(s), l = r(t), o < l && ([s, t] = [t, s], [o, l] = [l, o]), f = t + zt * (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) < Se ? i = 2 * Se : 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) {
       if (u = r(p), a += 1, u < h)
         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 * (f - t), u = r(p), a += 1;
+      p = f + zt * (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 * (f - t), l = h, h = u, u = r(p), a += 1)) : (p = f + Bt * (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 + zt * (f - t), l = h, h = u, u = r(p), a += 1)) : (p = f + zt * (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];
 }
-const _e = 0.381966, Ke = 1e-11;
-class He {
+const Re = 0.381966, rs = 1e-11;
+class os {
   constructor(s, t = 148e-10, e = 500) {
     q(this, "xmin");
     q(this, "fval");
@@ -703,9 +722,9 @@ class He {
     let s, t, e, n, i, o, l;
     const h = this.func, a = this.brack;
     if (a === null)
-      [i, o, l, s, t, e, n] = Ee(h);
+      [i, o, l, s, t, e, n] = ke(h);
     else if (a.length === 2)
-      [i, o, l, s, t, e, n] = Ee(h, a[0], a[1]);
+      [i, o, l, s, t, e, n] = ke(h, a[0], a[1]);
     else if (a.length === 3) {
       if ([i, o, l] = a, i > l && ([l, i] = [i, l]), !(i < o && o < l))
         throw new Error("Not a bracketing interval.");
@@ -726,19 +745,19 @@ class He {
     i = 1;
     let p = 0, P = 0, f;
     for (; p < this.maxiter; ) {
-      const M = this.tol * Math.abs(o) + Ke, E = 2 * M, R = 0.5 * (g + d);
+      const y = this.tol * Math.abs(o) + rs, E = 2 * y, R = 0.5 * (g + d);
       if (Math.abs(o - R) < E - 0.5 * (d - g))
         break;
-      if (Math.abs(w) <= M)
-        o >= R ? w = g - o : w = d - o, P = _e * w;
+      if (Math.abs(w) <= y)
+        o >= R ? w = g - o : w = d - o, P = Re * w;
       else {
         const L = (o - l) * (c - u);
         let S = (o - h) * (c - a), k = (o - h) * S - (o - l) * L;
         S = 2 * (S - L), S > 0 && (k = -k), S = Math.abs(S);
         const D = w;
-        w = P, k > S * (g - o) && k < S * (d - o) && Math.abs(k) < Math.abs(0.5 * S * D) ? (P = k * 1 / S, f = o + P, (f - g < E || d - f < E) && (R - o >= 0 ? P = M : P = -M)) : (o >= R ? w = g - o : w = d - o, P = _e * w);
+        w = P, k > S * (g - o) && k < S * (d - o) && Math.abs(k) < Math.abs(0.5 * S * D) ? (P = k * 1 / S, f = o + P, (f - g < E || d - f < E) && (R - o >= 0 ? P = y : P = -y)) : (o >= R ? w = g - o : w = d - o, P = Re * w);
       }
-      Math.abs(P) < M ? P >= 0 ? f = o + M : f = o - M : f = o + P;
+      Math.abs(P) < y ? P >= 0 ? f = o + y : f = o - y : f = o + P;
       const v = s(f);
       i += 1, v > c ? (f < o ? g = f : d = f, v <= a || l === o ? (h = l, l = f, u = a, a = v) : (v <= u || h === o || h === l) && (h = f, u = v)) : (f >= o ? g = o : d = o, h = l, l = o, o = f, u = a, a = c, c = v), p += 1;
     }
@@ -756,11 +775,11 @@ class He {
     return this.optimize(), this.results();
   }
 }
-function Ce(r, s = 1e-8, t = 1e3) {
-  const e = new He(r, s, t);
+function $e(r, s = 1e-8, t = 1e3) {
+  const e = new os(r, s, t);
   return e.setBracket([0, 1]), e.run();
 }
-function qe(r) {
+function Le(r) {
   if (r.__esModule) return r;
   var s = r.default;
   if (typeof s == "function") {
@@ -780,16 +799,16 @@ function qe(r) {
   }), t;
 }
 var $ = {};
-const ts = Object.prototype.toString;
+const ls = Object.prototype.toString;
 function Ct(r) {
-  const s = ts.call(r);
+  const s = ls.call(r);
   return s.endsWith("Array]") && !s.includes("Big");
 }
-const es = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   isAnyArray: Ct
-}, Symbol.toStringTag, { value: "Module" })), ss = /* @__PURE__ */ qe(es);
-function ns(r) {
+}, Symbol.toStringTag, { value: "Module" })), as = /* @__PURE__ */ Le(hs);
+function us(r) {
   var s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
   if (!Ct(r))
     throw new TypeError("input must be an array");
@@ -804,7 +823,7 @@ function ns(r) {
     r[l] > o && (o = r[l]);
   return o;
 }
-function is(r) {
+function cs(r) {
   var s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
   if (!Ct(r))
     throw new TypeError("input must be an array");
@@ -819,7 +838,7 @@ function is(r) {
     r[l] < o && (o = r[l]);
   return o;
 }
-function rs(r) {
+function fs(r) {
   var s = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
   if (Ct(r)) {
     if (r.length === 0)
@@ -832,7 +851,7 @@ function rs(r) {
     t = s.output;
   } else
     t = new Array(r.length);
-  var e = is(r), n = ns(r);
+  var e = cs(r), n = us(r);
   if (e === n)
     throw new RangeError("minimum and maximum input values are equal. Cannot rescale a constant array");
   var i = s.min, o = i === void 0 ? s.autoMinMax ? e : 0 : i, l = s.max, h = l === void 0 ? s.autoMinMax ? n : 1 : l;
@@ -842,17 +861,17 @@ function rs(r) {
     t[u] = (r[u] - e) * a + o;
   return t;
 }
-const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ms = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  default: rs
-}, Symbol.toStringTag, { value: "Module" })), ls = /* @__PURE__ */ qe(os);
+  default: fs
+}, Symbol.toStringTag, { value: "Module" })), gs = /* @__PURE__ */ Le(ms);
 Object.defineProperty($, "__esModule", { value: !0 });
-var st = ss, je = ls;
-const Ut = " ".repeat(2), Fe = " ".repeat(4);
-function hs() {
-  return xe(this);
+var st = as, ve = gs;
+const Ut = " ".repeat(2), De = " ".repeat(4);
+function ws() {
+  return Oe(this);
 }
-function xe(r, s = {}) {
+function Oe(r, s = {}) {
   const {
     maxRows: t = 15,
     maxColumns: e = 10,
@@ -861,13 +880,13 @@ function xe(r, s = {}) {
   } = s;
   return `${r.constructor.name} {
 ${Ut}[
-${Fe}${as(r, t, e, n, i)}
+${De}${ps(r, t, e, n, i)}
 ${Ut}]
 ${Ut}rows: ${r.rows}
 ${Ut}columns: ${r.columns}
 }`;
 }
-function as(r, s, t, e, n) {
+function ps(r, s, t, e, n) {
   const { rows: i, columns: o } = r, l = Math.min(i, s), h = Math.min(o, t), a = [];
   if (n === "auto") {
     n = !1;
@@ -881,16 +900,16 @@ function as(r, s, t, e, n) {
   for (let u = 0; u < l; u++) {
     let c = [];
     for (let g = 0; g < h; g++)
-      c.push(us(r.get(u, g), e, n));
+      c.push(ds(r.get(u, g), e, n));
     a.push(`${c.join(" ")}`);
   }
   return h !== o && (a[a.length - 1] += ` ... ${o - t} more columns`), l !== i && a.push(`... ${i - s} more rows`), a.join(`
-${Fe}`);
+${De}`);
 }
-function us(r, s, t) {
-  return (r >= 0 && t ? ` ${Se(r, s - 1)}` : Se(r, s)).padEnd(s);
+function ds(r, s, t) {
+  return (r >= 0 && t ? ` ${Ie(r, s - 1)}` : Ie(r, s)).padEnd(s);
 }
-function Se(r, s) {
+function Ie(r, s) {
   let t = r.toString();
   if (t.length <= s) return t;
   let e = r.toFixed(s);
@@ -899,7 +918,7 @@ function Se(r, s) {
   let n = r.toExponential(s);
   return n.length > s && (n = r.toExponential(Math.max(0, s - (n.length - s)))), n.slice(0);
 }
-function cs(r, s) {
+function ys(r, s) {
   r.prototype.add = function(e) {
     return typeof e == "number" ? this.addS(e) : this.addM(e);
   }, r.prototype.addS = function(e) {
@@ -1349,53 +1368,53 @@ function Yt(r, s) {
   if (typeof s != "number")
     throw new TypeError(`${r} must be a number`);
 }
-function yt(r) {
+function Mt(r) {
   if (r.isEmpty())
     throw new Error("Empty matrix has no elements to index");
 }
-function fs(r) {
+function Ms(r) {
   let s = Ht(r.rows);
   for (let t = 0; t < r.rows; ++t)
     for (let e = 0; e < r.columns; ++e)
       s[t] += r.get(t, e);
   return s;
 }
-function ms(r) {
+function Ps(r) {
   let s = Ht(r.columns);
   for (let t = 0; t < r.rows; ++t)
     for (let e = 0; e < r.columns; ++e)
       s[e] += r.get(t, e);
   return s;
 }
-function gs(r) {
+function bs(r) {
   let s = 0;
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       s += r.get(t, e);
   return s;
 }
-function ws(r) {
+function Es(r) {
   let s = Ht(r.rows, 1);
   for (let t = 0; t < r.rows; ++t)
     for (let e = 0; e < r.columns; ++e)
       s[t] *= r.get(t, e);
   return s;
 }
-function ps(r) {
+function _s(r) {
   let s = Ht(r.columns, 1);
   for (let t = 0; t < r.rows; ++t)
     for (let e = 0; e < r.columns; ++e)
       s[e] *= r.get(t, e);
   return s;
 }
-function ds(r) {
+function js(r) {
   let s = 1;
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       s *= r.get(t, e);
   return s;
 }
-function Ms(r, s, t) {
+function Ss(r, s, t) {
   const e = r.rows, n = r.columns, i = [];
   for (let o = 0; o < e; o++) {
     let l = 0, h = 0, a = 0;
@@ -1405,7 +1424,7 @@ function Ms(r, s, t) {
   }
   return i;
 }
-function ys(r, s, t) {
+function ks(r, s, t) {
   const e = r.rows, n = r.columns, i = [];
   for (let o = 0; o < n; o++) {
     let l = 0, h = 0, a = 0;
@@ -1415,7 +1434,7 @@ function ys(r, s, t) {
   }
   return i;
 }
-function Ps(r, s, t) {
+function Rs(r, s, t) {
   const e = r.rows, n = r.columns, i = e * n;
   let o = 0, l = 0, h = 0;
   for (let a = 0; a < e; a++)
@@ -1423,22 +1442,22 @@ function Ps(r, s, t) {
       h = r.get(a, u) - t, o += h, l += h * h;
   return s ? (l - o * o / i) / (i - 1) : (l - o * o / i) / i;
 }
-function bs(r, s) {
+function vs(r, s) {
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) - s[t]);
 }
-function Es(r, s) {
+function Is(r, s) {
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) - s[e]);
 }
-function _s(r, s) {
+function Ts(r, s) {
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) - s);
 }
-function js(r) {
+function Cs(r) {
   const s = [];
   for (let t = 0; t < r.rows; t++) {
     let e = 0;
@@ -1448,12 +1467,12 @@ function js(r) {
   }
   return s;
 }
-function Ss(r, s) {
+function qs(r, s) {
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) / s[t]);
 }
-function ks(r) {
+function As(r) {
   const s = [];
   for (let t = 0; t < r.columns; t++) {
     let e = 0;
@@ -1463,12 +1482,12 @@ function ks(r) {
   }
   return s;
 }
-function Rs(r, s) {
+function Fs(r, s) {
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) / s[e]);
 }
-function vs(r) {
+function xs(r) {
   const s = r.size - 1;
   let t = 0;
   for (let e = 0; e < r.columns; e++)
@@ -1476,12 +1495,12 @@ function vs(r) {
       t += r.get(n, e) ** 2 / s;
   return Math.sqrt(t);
 }
-function Ts(r, s) {
+function Ns(r, s) {
   for (let t = 0; t < r.rows; t++)
     for (let e = 0; e < r.columns; e++)
       r.set(t, e, r.get(t, e) / s);
 }
-class V {
+class N {
   static from1DArray(s, t, e) {
     if (s * t !== e.length)
       throw new RangeError("data length does not match given dimensions");
@@ -1566,7 +1585,7 @@ class V {
     return i;
   }
   static checkMatrix(s) {
-    return V.isMatrix(s) ? s : new _(s);
+    return N.isMatrix(s) ? s : new _(s);
   }
   static isMatrix(s) {
     return s != null && s.klass === "Matrix";
@@ -1871,7 +1890,7 @@ class V {
     }
   }
   maxIndex() {
-    yt(this);
+    Mt(this);
     let s = this.get(0, 0), t = [0, 0];
     for (let e = 0; e < this.rows; e++)
       for (let n = 0; n < this.columns; n++)
@@ -1908,7 +1927,7 @@ class V {
     }
   }
   minIndex() {
-    yt(this);
+    Mt(this);
     let s = this.get(0, 0), t = [0, 0];
     for (let e = 0; e < this.rows; e++)
       for (let n = 0; n < this.columns; n++)
@@ -1924,7 +1943,7 @@ class V {
     return t;
   }
   maxRowIndex(s) {
-    ot(this, s), yt(this);
+    ot(this, s), Mt(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);
@@ -1939,7 +1958,7 @@ class V {
     return t;
   }
   minRowIndex(s) {
-    ot(this, s), yt(this);
+    ot(this, s), Mt(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);
@@ -1954,7 +1973,7 @@ class V {
     return t;
   }
   maxColumnIndex(s) {
-    lt(this, s), yt(this);
+    lt(this, s), Mt(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);
@@ -1969,7 +1988,7 @@ class V {
     return t;
   }
   minColumnIndex(s) {
-    lt(this, s), yt(this);
+    lt(this, s), Mt(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);
@@ -1999,7 +2018,7 @@ class V {
     return this;
   }
   dot(s) {
-    V.isMatrix(s) && (s = s.to1DArray());
+    N.isMatrix(s) && (s = s.to1DArray());
     let t = this.to1DArray();
     if (t.length !== s.length)
       throw new RangeError("vectors do not have the same size");
@@ -2036,14 +2055,14 @@ class V {
   strassen2x2(s) {
     s = _.checkMatrix(s);
     let t = new _(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;
+    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), y = c + w - p + f, E = d + p, R = g + w, v = c - g + d + P;
+    return t.set(0, 0, y), t.set(0, 1, E), t.set(1, 0, R), t.set(1, 1, v), t;
   }
   strassen3x3(s) {
     s = _.checkMatrix(s);
     let t = new _(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;
+    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), y = 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 - y + 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), M = (a + u) * (-g + w), C = (e + n + i - l - h - a - u) * f, A = u * (-g + w + p - P - f - y + E), T = (-i + u + c) * (P + y - E), z = (i - c) * (P - E), F = i * y, V = (u + c) * (-y + E), x = (-i + l + h) * (f + y - R), B = (i - h) * (f - R), U = (l + h) * (-y + R), I = n * p, O = h * E, X = o * w, G = a * d, W = c * R, se = m + F + I, ne = v + k + D + m + T + F + V, ie = m + b + M + C + F + x + U, re = L + S + k + m + F + x + B, xt = L + k + D + m + O, Nt = F + x + B + U + X, Vt = m + b + j + A + T + z + F, $t = T + z + F + V + G, Lt = m + b + j + M + 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, xt), t.set(1, 2, Nt), t.set(2, 0, Vt), t.set(2, 1, $t), t.set(2, 2, Lt), t;
   }
   mmulStrassen(s) {
     s = _.checkMatrix(s);
@@ -2056,7 +2075,7 @@ class V {
       if (w === g && p === d)
         return c;
       {
-        let P = V.zeros(g, d);
+        let P = N.zeros(g, d);
         return P = P.setSubMatrix(c, 0, 0), P;
       }
     }
@@ -2066,27 +2085,27 @@ class V {
       if (d <= 512 || w <= 512)
         return c.mmul(g);
       d % 2 === 1 && w % 2 === 1 ? (c = l(c, d + 1, w + 1), g = l(g, d + 1, w + 1)) : d % 2 === 1 ? (c = l(c, d + 1, w), g = l(g, d + 1, w)) : w % 2 === 1 && (c = l(c, d, w + 1), g = l(g, d, w + 1));
-      let p = parseInt(c.rows / 2, 10), P = parseInt(c.columns / 2, 10), f = c.subMatrix(0, p - 1, 0, P - 1), M = g.subMatrix(0, p - 1, 0, P - 1), E = c.subMatrix(0, p - 1, P, c.columns - 1), R = g.subMatrix(0, p - 1, P, g.columns - 1), v = c.subMatrix(p, c.rows - 1, 0, P - 1), L = g.subMatrix(p, g.rows - 1, 0, P - 1), S = c.subMatrix(p, c.rows - 1, P, c.columns - 1), k = g.subMatrix(p, g.rows - 1, P, g.columns - 1), D = u(
-        V.add(f, S),
-        V.add(M, k),
+      let p = parseInt(c.rows / 2, 10), P = parseInt(c.columns / 2, 10), f = c.subMatrix(0, p - 1, 0, P - 1), y = g.subMatrix(0, p - 1, 0, P - 1), E = c.subMatrix(0, p - 1, P, c.columns - 1), R = g.subMatrix(0, p - 1, P, g.columns - 1), v = c.subMatrix(p, c.rows - 1, 0, P - 1), L = g.subMatrix(p, g.rows - 1, 0, P - 1), S = c.subMatrix(p, c.rows - 1, P, c.columns - 1), k = g.subMatrix(p, g.rows - 1, P, g.columns - 1), D = u(
+        N.add(f, S),
+        N.add(y, k),
         p,
         P
-      ), m = u(V.add(v, S), M, p, P), b = u(f, V.sub(R, k), p, P), j = u(S, V.sub(L, M), p, P), y = u(V.add(f, E), k, p, P), C = u(
-        V.sub(v, f),
-        V.add(M, R),
+      ), m = u(N.add(v, S), y, p, P), b = u(f, N.sub(R, k), p, P), j = u(S, N.sub(L, y), p, P), M = u(N.add(f, E), k, p, P), C = u(
+        N.sub(v, f),
+        N.add(y, R),
         p,
         P
-      ), F = u(
-        V.sub(E, S),
-        V.add(L, k),
+      ), A = u(
+        N.sub(E, S),
+        N.add(L, k),
         p,
         P
-      ), I = V.add(D, j);
-      I.sub(y), I.add(F);
-      let B = V.add(b, y), x = V.add(m, j), N = V.sub(D, m);
-      N.add(b), N.add(C);
-      let A = V.zeros(2 * I.rows, 2 * I.columns);
-      return A = A.setSubMatrix(I, 0, 0), A = A.setSubMatrix(B, I.rows, 0), A = A.setSubMatrix(x, 0, I.columns), A = A.setSubMatrix(N, I.rows, I.columns), A.subMatrix(0, d - 1, 0, w - 1);
+      ), T = N.add(D, j);
+      T.sub(M), T.add(A);
+      let z = N.add(b, M), F = N.add(m, j), V = N.sub(D, m);
+      V.add(b), V.add(C);
+      let x = N.zeros(2 * T.rows, 2 * T.columns);
+      return x = x.setSubMatrix(T, 0, 0), x = x.setSubMatrix(z, T.rows, 0), x = x.setSubMatrix(F, 0, T.columns), x = x.setSubMatrix(V, T.rows, T.columns), x.subMatrix(0, d - 1, 0, w - 1);
     }
     return u(t, s, h, a);
   }
@@ -2100,7 +2119,7 @@ class V {
     let n = new _(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);
+      o.length > 0 && ve(o, { min: t, max: e, output: o }), n.setRow(i, o);
     }
     return n;
   }
@@ -2114,7 +2133,7 @@ class V {
     let n = new _(this.rows, this.columns);
     for (let i = 0; i < this.columns; i++) {
       const o = this.getColumn(i);
-      o.length && je(o, {
+      o.length && ve(o, {
         min: t,
         max: e,
         output: o
@@ -2163,12 +2182,12 @@ class V {
         s.set(e, t, this.get(t, e));
     return s;
   }
-  sortRows(s = ke) {
+  sortRows(s = Te) {
     for (let t = 0; t < this.rows; t++)
       this.setRow(t, this.getRow(t).sort(s));
     return this;
   }
-  sortColumns(s = ke) {
+  sortColumns(s = Te) {
     for (let t = 0; t < this.columns; t++)
       this.setColumn(t, this.getColumn(t).sort(s));
     return this;
@@ -2253,11 +2272,11 @@ class V {
   sum(s) {
     switch (s) {
       case "row":
-        return fs(this);
+        return Ms(this);
       case "column":
-        return ms(this);
+        return Ps(this);
       case void 0:
-        return gs(this);
+        return bs(this);
       default:
         throw new Error(`invalid option: ${s}`);
     }
@@ -2265,11 +2284,11 @@ class V {
   product(s) {
     switch (s) {
       case "row":
-        return ws(this);
+        return Es(this);
       case "column":
-        return ps(this);
+        return _s(this);
       case void 0:
-        return ds(this);
+        return js(this);
       default:
         throw new Error(`invalid option: ${s}`);
     }
@@ -2303,17 +2322,17 @@ class V {
       case "row": {
         if (!st.isAnyArray(n))
           throw new TypeError("mean must be an array");
-        return Ms(this, e, n);
+        return Ss(this, e, n);
       }
       case "column": {
         if (!st.isAnyArray(n))
           throw new TypeError("mean must be an array");
-        return ys(this, e, n);
+        return ks(this, e, n);
       }
       case void 0: {
         if (typeof n != "number")
           throw new TypeError("mean must be a number");
-        return Ps(this, e, n);
+        return Rs(this, e, n);
       }
       default:
         throw new Error(`invalid option: ${s}`);
@@ -2336,17 +2355,17 @@ class V {
       case "row": {
         if (!st.isAnyArray(e))
           throw new TypeError("center must be an array");
-        return bs(this, e), this;
+        return vs(this, e), this;
       }
       case "column": {
         if (!st.isAnyArray(e))
           throw new TypeError("center must be an array");
-        return Es(this, e), this;
+        return Is(this, e), this;
       }
       case void 0: {
         if (typeof e != "number")
           throw new TypeError("center must be a number");
-        return _s(this, e), this;
+        return Ts(this, e), this;
       }
       default:
         throw new Error(`invalid option: ${s}`);
@@ -2359,31 +2378,31 @@ class V {
     switch (s) {
       case "row": {
         if (e === void 0)
-          e = js(this);
+          e = Cs(this);
         else if (!st.isAnyArray(e))
           throw new TypeError("scale must be an array");
-        return Ss(this, e), this;
+        return qs(this, e), this;
       }
       case "column": {
         if (e === void 0)
-          e = ks(this);
+          e = As(this);
         else if (!st.isAnyArray(e))
           throw new TypeError("scale must be an array");
-        return Rs(this, e), this;
+        return Fs(this, e), this;
       }
       case void 0: {
         if (e === void 0)
-          e = vs(this);
+          e = xs(this);
         else if (typeof e != "number")
           throw new TypeError("scale must be a number");
-        return Ts(this, e), this;
+        return Ns(this, e), this;
       }
       default:
         throw new Error(`invalid option: ${s}`);
     }
   }
   toString(s) {
-    return xe(this, s);
+    return Oe(this, s);
   }
   [Symbol.iterator]() {
     return this.entries();
@@ -2409,34 +2428,34 @@ class V {
         yield this.get(s, t);
   }
 }
-V.prototype.klass = "Matrix";
-typeof Symbol < "u" && (V.prototype[Symbol.for("nodejs.util.inspect.custom")] = hs);
-function ke(r, s) {
+N.prototype.klass = "Matrix";
+typeof Symbol < "u" && (N.prototype[Symbol.for("nodejs.util.inspect.custom")] = ws);
+function Te(r, s) {
   return r - s;
 }
-function Is(r) {
+function Vs(r) {
   return r.every((s) => typeof s == "number");
 }
-V.random = V.rand;
-V.randomInt = V.randInt;
-V.diagonal = V.diag;
-V.prototype.diagonal = V.prototype.diag;
-V.identity = V.eye;
-V.prototype.negate = V.prototype.neg;
-V.prototype.tensorProduct = V.prototype.kroneckerProduct;
-var Ft, ue, dt;
-let _ = (dt = class extends V {
+N.random = N.rand;
+N.randomInt = N.randInt;
+N.diagonal = N.diag;
+N.prototype.diagonal = N.prototype.diag;
+N.identity = N.eye;
+N.prototype.negate = N.prototype.neg;
+N.prototype.tensorProduct = N.prototype.kroneckerProduct;
+var At, ue, dt;
+let _ = (dt = class extends N {
   constructor(t, e) {
     super();
-    le(this, Ft);
+    le(this, At);
     /**
      * @type {Float64Array[]}
      */
     q(this, "data");
     if (dt.isMatrix(t))
-      he(this, Ft, ue).call(this, t.rows, t.columns), dt.copy(t, this);
+      he(this, At, ue).call(this, t.rows, t.columns), dt.copy(t, this);
     else if (Number.isInteger(t) && t >= 0)
-      he(this, Ft, ue).call(this, t, e);
+      he(this, At, ue).call(this, t, e);
     else if (st.isAnyArray(t)) {
       const n = t;
       if (t = n.length, e = t ? n[0].length : 0, typeof e != "number")
@@ -2447,7 +2466,7 @@ let _ = (dt = class extends V {
       for (let i = 0; i < t; i++) {
         if (n[i].length !== e)
           throw new RangeError("Inconsistent array dimensions");
-        if (!Is(n[i]))
+        if (!Vs(n[i]))
           throw new TypeError("Input data contains non-numeric values");
         this.data.push(Float64Array.from(n[i]));
       }
@@ -2494,7 +2513,7 @@ let _ = (dt = class extends V {
     }
     return this.columns += 1, this;
   }
-}, Ft = new WeakSet(), /**
+}, At = new WeakSet(), /**
  * Init an empty matrix
  * @param {number} nRows
  * @param {number} nColumns
@@ -2507,9 +2526,9 @@ ue = function(t, e) {
     throw new TypeError("nColumns must be a positive integer");
   this.rows = t, this.columns = e;
 }, dt);
-cs(V, _);
+ys(N, _);
 var K;
-const Jt = class Jt extends V {
+const Jt = class Jt extends N {
   /**
    * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize
    * @return {this}
@@ -2746,12 +2765,12 @@ class te extends pt {
   }
 }
 te.prototype.klassSubType = "DistanceMatrix";
-class ft extends V {
+class ft extends N {
   constructor(s, t, e) {
     super(), this.matrix = s, this.rows = t, this.columns = e;
   }
 }
-class Cs extends ft {
+class $s extends ft {
   constructor(s, t) {
     lt(s, t), super(s, s.rows, 1), this.column = t;
   }
@@ -2762,7 +2781,7 @@ class Cs extends ft {
     return this.matrix.get(s, this.column);
   }
 }
-class qs extends ft {
+class Ls extends ft {
   constructor(s, t) {
     we(s, t), super(s, s.rows, t.length), this.columnIndices = t;
   }
@@ -2773,7 +2792,7 @@ class qs extends ft {
     return this.matrix.get(s, this.columnIndices[t]);
   }
 }
-class Fs extends ft {
+class Ds extends ft {
   constructor(s) {
     super(s, s.rows, s.columns);
   }
@@ -2784,7 +2803,7 @@ class Fs extends ft {
     return this.matrix.get(s, this.columns - t - 1);
   }
 }
-class xs extends ft {
+class Os extends ft {
   constructor(s) {
     super(s, s.rows, s.columns);
   }
@@ -2795,7 +2814,7 @@ class xs extends ft {
     return this.matrix.get(this.rows - s - 1, t);
   }
 }
-class As extends ft {
+class Bs extends ft {
   constructor(s, t) {
     ot(s, t), super(s, 1, s.columns), this.row = t;
   }
@@ -2806,7 +2825,7 @@ class As extends ft {
     return this.matrix.get(this.row, t);
   }
 }
-class Vs extends ft {
+class zs extends ft {
   constructor(s, t) {
     ge(s, t), super(s, t.length, s.columns), this.rowIndices = t;
   }
@@ -2835,7 +2854,7 @@ class Gt extends ft {
     );
   }
 }
-class Ns extends ft {
+class Us extends ft {
   constructor(s, t, e, n, i) {
     ae(s, t, e, n, i), super(s, e - t + 1, i - n + 1), this.startRow = t, this.startColumn = n;
   }
@@ -2853,7 +2872,7 @@ class Ns extends ft {
     );
   }
 }
-class $s extends ft {
+class Ys extends ft {
   constructor(s) {
     super(s, s.columns, s.rows);
   }
@@ -2864,7 +2883,7 @@ class $s extends ft {
     return this.matrix.get(t, s);
   }
 }
-class Ae extends V {
+class Be extends N {
   constructor(s, t = {}) {
     const { rows: e = 1 } = t;
     if (s.length % e !== 0)
@@ -2883,7 +2902,7 @@ class Ae extends V {
     return s * this.columns + t;
   }
 }
-class rt extends V {
+class rt extends N {
   constructor(s) {
     super(), this.data = s, this.rows = s.length, this.columns = s[0].length;
   }
@@ -2894,9 +2913,9 @@ class rt extends V {
     return this.data[s][t];
   }
 }
-function Ls(r, s) {
+function Ws(r, s) {
   if (st.isAnyArray(r))
-    return r[0] && st.isAnyArray(r[0]) ? new rt(r) : new Ae(r, s);
+    return r[0] && st.isAnyArray(r[0]) ? new rt(r) : new Be(r, s);
   throw new Error("the argument is not an array");
 }
 class ee {
@@ -3084,7 +3103,7 @@ class vt {
       }
     else
       c = s.clone();
-    let g = Math.min(e, n), d = Math.min(e + 1, n), w = new Float64Array(d), p = new _(e, g), P = new _(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 _(e, g), P = new _(n, n), f = new Float64Array(n), y = 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++) {
@@ -3103,11 +3122,11 @@ class vt {
       for (let b = m + 1; b < n; b++) {
         if (m < R && w[m] !== 0) {
           let j = 0;
-          for (let y = m; y < e; y++)
-            j += c.get(y, m) * c.get(y, b);
+          for (let M = m; M < e; M++)
+            j += c.get(M, m) * c.get(M, b);
           j = -j / c.get(m, m);
-          for (let y = m; y < e; y++)
-            c.set(y, b, c.get(y, b) + j * c.get(y, m));
+          for (let M = m; M < e; M++)
+            c.set(M, b, c.get(M, b) + j * c.get(M, m));
         }
         f[b] = c.get(m, b);
       }
@@ -3126,14 +3145,14 @@ class vt {
         }
         if (f[m] = -f[m], m + 1 < e && f[m] !== 0) {
           for (let b = m + 1; b < e; b++)
-            M[b] = 0;
+            y[b] = 0;
           for (let b = m + 1; b < e; b++)
             for (let j = m + 1; j < n; j++)
-              M[b] += f[j] * c.get(b, j);
+              y[b] += f[j] * c.get(b, j);
           for (let b = m + 1; b < n; b++) {
             let j = -f[b] / f[m + 1];
-            for (let y = m + 1; y < e; y++)
-              c.set(y, b, c.get(y, b) + j * M[y]);
+            for (let M = m + 1; M < e; M++)
+              c.set(M, b, c.get(M, b) + j * y[M]);
           }
         }
         if (a)
@@ -3152,11 +3171,11 @@ class vt {
         if (w[m] !== 0) {
           for (let b = m + 1; b < g; b++) {
             let j = 0;
-            for (let y = m; y < e; y++)
-              j += p.get(y, m) * p.get(y, b);
+            for (let M = m; M < e; M++)
+              j += p.get(M, m) * p.get(M, b);
             j = -j / p.get(m, m);
-            for (let y = m; y < e; y++)
-              p.set(y, b, p.get(y, b) + j * p.get(y, m));
+            for (let M = m; M < e; M++)
+              p.set(M, b, p.get(M, b) + j * p.get(M, m));
           }
           for (let b = m; b < e; b++)
             p.set(b, m, -p.get(b, m));
@@ -3174,11 +3193,11 @@ class vt {
         if (m < v && f[m] !== 0)
           for (let b = m + 1; b < n; b++) {
             let j = 0;
-            for (let y = m + 1; y < n; y++)
-              j += P.get(y, m) * P.get(y, b);
+            for (let M = m + 1; M < n; M++)
+              j += P.get(M, m) * P.get(M, b);
             j = -j / P.get(m + 1, m);
-            for (let y = m + 1; y < n; y++)
-              P.set(y, b, P.get(y, b) + j * P.get(y, m));
+            for (let M = m + 1; M < n; M++)
+              P.set(M, b, P.get(M, b) + j * P.get(M, m));
           }
         for (let b = 0; b < n; b++)
           P.set(b, m, 0);
@@ -3199,8 +3218,8 @@ class vt {
       else {
         let j;
         for (j = S - 1; j >= m && j !== m; j--) {
-          let y = (j !== S ? Math.abs(f[j]) : 0) + (j !== m + 1 ? Math.abs(f[j - 1]) : 0);
-          if (Math.abs(w[j]) <= D * y) {
+          let M = (j !== S ? Math.abs(f[j]) : 0) + (j !== m + 1 ? Math.abs(f[j - 1]) : 0);
+          if (Math.abs(w[j]) <= D * M) {
             w[j] = 0;
             break;
           }
@@ -3211,22 +3230,22 @@ class vt {
         case 1: {
           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;
-            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);
+          for (let M = S - 2; M >= m; M--) {
+            let C = ut(w[M], j), A = w[M] / C, T = j / C;
+            if (w[M] = C, M !== m && (j = -T * f[M - 1], f[M - 1] = A * f[M - 1]), a)
+              for (let z = 0; z < n; z++)
+                C = A * P.get(z, M) + T * P.get(z, S - 1), P.set(z, S - 1, -T * P.get(z, M) + A * P.get(z, S - 1)), P.set(z, M, C);
           }
           break;
         }
         case 2: {
           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;
-            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);
+          for (let M = m; M < S; M++) {
+            let C = ut(w[M], j), A = w[M] / C, T = j / C;
+            if (w[M] = C, j = -T * f[M], f[M] = A * f[M], h)
+              for (let z = 0; z < e; z++)
+                C = A * p.get(z, M) + T * p.get(z, m - 1), p.set(z, m - 1, -T * p.get(z, M) + A * p.get(z, m - 1)), p.set(z, M, C);
           }
           break;
         }
@@ -3237,22 +3256,22 @@ class vt {
             Math.abs(f[S - 2]),
             Math.abs(w[m]),
             Math.abs(f[m])
-          ), y = w[S - 1] / j, C = w[S - 2] / j, F = f[S - 2] / j, I = w[m] / j, B = f[m] / j, x = ((C + y) * (C - y) + F * F) / 2, N = y * F * (y * F);
-          let A = 0;
-          (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);
-            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)
+          ), M = w[S - 1] / j, C = w[S - 2] / j, A = f[S - 2] / j, T = w[m] / j, z = f[m] / j, F = ((C + M) * (C - M) + A * A) / 2, V = M * A * (M * A);
+          let x = 0;
+          (F !== 0 || V !== 0) && (F < 0 ? x = 0 - Math.sqrt(F * F + V) : x = Math.sqrt(F * F + V), x = V / (F + x));
+          let B = (T + M) * (T - M) + x, U = T * z;
+          for (let I = m; I < S - 1; I++) {
+            let O = ut(B, U);
+            O === 0 && (O = Number.MIN_VALUE);
+            let X = B / O, G = U / O;
+            if (I !== m && (f[I - 1] = O), B = X * w[I] + G * f[I], f[I] = X * f[I] - G * w[I], U = G * w[I + 1], w[I + 1] = X * w[I + 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)
+                O = X * P.get(W, I) + G * P.get(W, I + 1), P.set(W, I + 1, -G * P.get(W, I) + X * P.get(W, I + 1)), P.set(W, I, O);
+            if (O = ut(B, U), O === 0 && (O = Number.MIN_VALUE), X = B / O, G = U / O, w[I] = O, B = X * f[I] + G * w[I + 1], w[I + 1] = -G * f[I] + X * w[I + 1], U = G * f[I + 1], f[I + 1] = X * f[I + 1], h && I < 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);
+                O = X * p.get(W, I) + G * p.get(W, I + 1), p.set(W, I + 1, -G * p.get(W, I) + X * p.get(W, I + 1)), p.set(W, I, O);
           }
-          f[S - 2] = O;
+          f[S - 2] = B;
           break;
         }
         case 4: {
@@ -3262,11 +3281,11 @@ class vt {
           for (; m < k && !(w[m] >= w[m + 1]); ) {
             let j = w[m];
             if (w[m] = w[m + 1], w[m + 1] = j, a && m < n - 1)
-              for (let y = 0; y < n; y++)
-                j = P.get(y, m + 1), P.set(y, m + 1, P.get(y, m)), P.set(y, m, j);
+              for (let M = 0; M < n; M++)
+                j = P.get(M, m + 1), P.set(M, m + 1, P.get(M, m)), P.set(M, m, j);
             if (h && m < e - 1)
-              for (let y = 0; y < e; y++)
-                j = p.get(y, m + 1), p.set(y, m + 1, p.get(y, m)), p.set(y, m, j);
+              for (let M = 0; M < e; M++)
+                j = p.get(M, m + 1), p.set(M, m + 1, p.get(M, m)), p.set(M, m, j);
             m++;
           }
           S--;
@@ -3340,10 +3359,10 @@ class vt {
     return _.diag(this.s);
   }
 }
-function Ds(r, s = !1) {
-  return r = rt.checkMatrix(r), s ? new vt(r).inverse() : Ve(r, _.eye(r.rows));
+function Qs(r, s = !1) {
+  return r = rt.checkMatrix(r), s ? new vt(r).inverse() : ze(r, _.eye(r.rows));
 }
-function Ve(r, s, t = !1) {
+function ze(r, s, t = !1) {
   return r = rt.checkMatrix(r), s = rt.checkMatrix(s), t ? new vt(r).solve(s) : r.isSquare() ? new ee(r).solve(s) : new pe(r).solve(s);
 }
 function Xt(r) {
@@ -3361,13 +3380,13 @@ function Xt(r) {
   } else
     throw Error("determinant can only be calculated for a square matrix");
 }
-function zs(r, s) {
+function Gs(r, s) {
   let t = [];
   for (let e = 0; e < r; e++)
     e !== s && t.push(e);
   return t;
 }
-function Os(r, s, t, e = 1e-9, n = 1e-9) {
+function Xs(r, s, t, e = 1e-9, n = 1e-9) {
   if (r > n)
     return new Array(s.rows + 1).fill(0);
   {
@@ -3377,20 +3396,20 @@ function Os(r, s, t, e = 1e-9, n = 1e-9) {
     return i.to1DArray();
   }
 }
-function Bs(r, s = {}) {
+function Zs(r, s = {}) {
   const { thresholdValue: t = 1e-9, thresholdError: e = 1e-9 } = s;
   r = _.checkMatrix(r);
   let n = r.rows, i = new _(n, n);
   for (let o = 0; o < n; o++) {
-    let l = _.columnVector(r.getRow(o)), h = r.subMatrixRow(zs(n, o)).transpose(), u = new vt(h).solve(l), c = _.sub(l, h.mmul(u)).abs().max();
+    let l = _.columnVector(r.getRow(o)), h = r.subMatrixRow(Gs(n, o)).transpose(), u = new vt(h).solve(l), c = _.sub(l, h.mmul(u)).abs().max();
     i.setRow(
       o,
-      Os(c, u, o, t, e)
+      Xs(c, u, o, t, e)
     );
   }
   return i;
 }
-function Us(r, s = Number.EPSILON) {
+function Js(r, s = Number.EPSILON) {
   if (r = _.checkMatrix(r), r.isEmpty())
     return r.transpose();
   let t = new vt(r, { autoTranspose: !0 }), e = t.leftSingularVectors, n = t.rightSingularVectors, i = t.diagonal;
@@ -3398,7 +3417,7 @@ function Us(r, s = Number.EPSILON) {
     Math.abs(i[o]) > s ? i[o] = 1 / i[o] : i[o] = 0;
   return n.mmul(_.diag(i).mmul(e.transpose()));
 }
-function Ys(r, s = r, t = {}) {
+function Ks(r, s = r, t = {}) {
   r = new _(r);
   let e = !1;
   if (typeof s == "object" && !_.isMatrix(s) && !st.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _(s), r.rows !== s.rows)
@@ -3411,7 +3430,7 @@ function Ys(r, s = r, t = {}) {
       i.set(o, l, i.get(o, l) * (1 / (r.rows - 1)));
   return i;
 }
-function Ws(r, s = r, t = {}) {
+function Hs(r, s = r, t = {}) {
   r = new _(r);
   let e = !1;
   if (typeof s == "object" && !_.isMatrix(s) && !st.isAnyArray(s) ? (t = s, s = r, e = !0) : s = new _(s), r.rows !== s.rows)
@@ -3428,7 +3447,7 @@ function Ws(r, s = r, t = {}) {
       );
   return h;
 }
-let Ne = class {
+let Ue = class {
   constructor(s, t = {}) {
     const { assumeSymmetric: e = !1 } = t;
     if (s = rt.checkMatrix(s), !s.isSquare())
@@ -3440,13 +3459,13 @@ let Ne = class {
       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);
+      tn(n, l, o, i), en(n, l, o, i);
     } else {
       let g = new _(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));
-      Xs(n, g, d, i), Zs(n, l, o, i, g);
+      sn(n, g, d, i), nn(n, l, o, i, g);
     }
     this.n = n, this.e = l, this.d = o, this.V = i;
   }
@@ -3469,7 +3488,7 @@ let Ne = class {
     return n;
   }
 };
-function Qs(r, s, t, e) {
+function tn(r, s, t, e) {
   let n, i, o, l, h, a, u, c;
   for (h = 0; h < r; h++)
     t[h] = e.get(r - 1, h);
@@ -3519,8 +3538,8 @@ function Qs(r, s, t, e) {
     t[h] = e.get(r - 1, h), e.set(r - 1, h, 0);
   e.set(r - 1, r - 1, 1), s[0] = 0;
 }
-function Gs(r, s, t, e) {
-  let n, i, o, l, h, a, u, c, g, d, w, p, P, f, M, E;
+function en(r, s, t, e) {
+  let n, i, o, l, h, a, u, c, g, d, w, p, P, f, y, E;
   for (o = 1; o < r; o++)
     s[o - 1] = s[o];
   s[r - 1] = 0;
@@ -3532,10 +3551,10 @@ function Gs(r, s, t, e) {
       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++)
           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++)
-            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;
+        for (R = R + i, c = t[u], w = 1, p = w, P = w, f = s[a + 1], y = 0, E = 0, o = u - 1; o >= a; o--)
+          for (P = p, p = w, E = y, n = w * s[o], i = w * c, g = ut(c, s[o]), s[o + 1] = y * g, y = s[o] / g, w = c / g, c = w * t[o] - y * n, t[o + 1] = i + y * (w * n + y * t[o]), h = 0; h < r; h++)
+            i = e.get(h, o + 1), e.set(h, o + 1, y * e.get(h, o) + w * i), e.set(h, o, w * e.get(h, o) - y * i);
+        c = -y * E * P * f * s[a] / d, s[a] = y * c, t[a] = w * c;
       } while (Math.abs(s[a]) > L * v);
     t[a] = t[a] + R, s[a] = 0;
   }
@@ -3547,7 +3566,7 @@ function Gs(r, s, t, e) {
         c = e.get(l, o), e.set(l, o, e.get(l, h)), e.set(l, h, c);
   }
 }
-function Xs(r, s, t, e) {
+function sn(r, s, t, e) {
   let n = 0, i = r - 1, o, l, h, a, u, c, g;
   for (c = n + 1; c <= i - 1; c++) {
     for (g = 0, a = c; a <= i; a++)
@@ -3585,11 +3604,11 @@ function Xs(r, s, t, e) {
       }
     }
 }
-function Zs(r, s, t, e, n) {
-  let i = r - 1, o = 0, l = r - 1, h = Number.EPSILON, a = 0, u = 0, c = 0, g = 0, d = 0, w = 0, p = 0, P = 0, f, M, E, R, v, L, S, k, D, m, b, j, y, C, F;
+function nn(r, s, t, e, n) {
+  let i = r - 1, o = 0, l = r - 1, h = Number.EPSILON, a = 0, u = 0, c = 0, g = 0, d = 0, w = 0, p = 0, P = 0, f, y, E, R, v, L, S, k, D, m, b, j, M, C, A;
   for (f = 0; f < r; f++)
-    for ((f < o || f > l) && (t[f] = n.get(f, f), s[f] = 0), M = Math.max(f - 1, 0); M < r; M++)
-      u = u + Math.abs(n.get(f, M));
+    for ((f < o || f > l) && (t[f] = n.get(f, f), s[f] = 0), y = Math.max(f - 1, 0); y < r; y++)
+      u = u + Math.abs(n.get(f, y));
   for (; i >= o; ) {
     for (R = i; R > o && (w = Math.abs(n.get(R - 1, R - 1)) + Math.abs(n.get(R, R)), w === 0 && (w = u), !(Math.abs(n.get(R, R - 1)) < h * w)); )
       R--;
@@ -3597,8 +3616,8 @@ function Zs(r, s, t, e, n) {
       n.set(i, i, n.get(i, i) + a), t[i] = n.get(i, i), s[i] = 0, i--, P = 0;
     else if (R === i - 1) {
       if (S = n.get(i, i - 1) * n.get(i - 1, i), c = (n.get(i - 1, i - 1) - n.get(i, i)) / 2, g = c * c + S, p = Math.sqrt(Math.abs(g)), n.set(i, i, n.get(i, i) + a), n.set(i - 1, i - 1, n.get(i - 1, i - 1) + a), k = n.get(i, i), g >= 0) {
-        for (p = c >= 0 ? c + p : c - p, t[i - 1] = k + p, t[i] = t[i - 1], p !== 0 && (t[i] = k - S / p), s[i - 1] = 0, s[i] = 0, k = n.get(i, i - 1), w = Math.abs(k) + Math.abs(p), c = k / w, g = p / w, d = Math.sqrt(c * c + g * g), c = c / d, g = g / d, M = i - 1; M < r; M++)
-          p = n.get(i - 1, M), n.set(i - 1, M, g * p + c * n.get(i, M)), n.set(i, M, g * n.get(i, M) - c * p);
+        for (p = c >= 0 ? c + p : c - p, t[i - 1] = k + p, t[i] = t[i - 1], p !== 0 && (t[i] = k - S / p), s[i - 1] = 0, s[i] = 0, k = n.get(i, i - 1), w = Math.abs(k) + Math.abs(p), c = k / w, g = p / w, d = Math.sqrt(c * c + g * g), c = c / d, g = g / d, y = i - 1; y < r; y++)
+          p = n.get(i - 1, y), n.set(i - 1, y, g * p + c * n.get(i, y)), n.set(i, y, g * n.get(i, y) - c * p);
         for (f = 0; f <= i; f++)
           p = n.get(f, i - 1), n.set(f, i - 1, g * p + c * n.get(f, i)), n.set(f, i, g * n.get(f, i) - c * p);
         for (f = o; f <= l; f++)
@@ -3623,8 +3642,8 @@ function Zs(r, s, t, e, n) {
         n.set(f, f - 2, 0), f > v + 2 && n.set(f, f - 3, 0);
       for (E = v; E <= i - 1 && (C = E !== i - 1, E !== v && (c = n.get(E, E - 1), g = n.get(E + 1, E - 1), d = C ? n.get(E + 2, E - 1) : 0, k = Math.abs(c) + Math.abs(g) + Math.abs(d), k !== 0 && (c = c / k, g = g / k, d = d / k)), k !== 0); E++)
         if (w = Math.sqrt(c * c + g * g + d * d), c < 0 && (w = -w), w !== 0) {
-          for (E !== v ? n.set(E, E - 1, -w * k) : R !== v && n.set(E, E - 1, -n.get(E, E - 1)), c = c + w, k = c / w, D = g / w, p = d / w, g = g / c, d = d / c, M = E; M < r; M++)
-            c = n.get(E, M) + g * n.get(E + 1, M), C && (c = c + d * n.get(E + 2, M), n.set(E + 2, M, n.get(E + 2, M) - c * p)), n.set(E, M, n.get(E, M) - c * k), n.set(E + 1, M, n.get(E + 1, M) - c * D);
+          for (E !== v ? n.set(E, E - 1, -w * k) : R !== v && n.set(E, E - 1, -n.get(E, E - 1)), c = c + w, k = c / w, D = g / w, p = d / w, g = g / c, d = d / c, y = E; y < r; y++)
+            c = n.get(E, y) + g * n.get(E + 1, y), C && (c = c + d * n.get(E + 2, y), n.set(E + 2, y, n.get(E + 2, y) - c * p)), n.set(E, y, n.get(E, y) - c * k), n.set(E + 1, y, n.get(E + 1, y) - c * D);
           for (f = 0; f <= Math.min(i, E + 3); f++)
             c = k * n.get(f, E) + D * n.get(f, E + 1), C && (c = c + p * n.get(f, E + 2), n.set(f, E + 2, n.get(f, E + 2) - c * d)), n.set(f, E, n.get(f, E) - c), n.set(f, E + 1, n.get(f, E + 1) - c * g);
           for (f = o; f <= l; f++)
@@ -3636,8 +3655,8 @@ function Zs(r, s, t, e, n) {
     for (i = r - 1; i >= 0; i--)
       if (c = t[i], g = s[i], g === 0)
         for (R = i, n.set(i, i, 1), f = i - 1; f >= 0; f--) {
-          for (S = n.get(f, f) - c, d = 0, M = R; M <= i; M++)
-            d = d + n.get(f, M) * n.get(M, i);
+          for (S = n.get(f, f) - c, d = 0, y = R; y <= i; y++)
+            d = d + n.get(f, y) * n.get(y, i);
           if (s[f] < 0)
             p = S, w = d;
           else if (R = f, s[f] === 0 ? n.set(f, i, S !== 0 ? -d / S : -d / (h * u)) : (k = n.get(f, f + 1), D = n.get(f + 1, f), g = (t[f] - c) * (t[f] - c) + s[f] * s[f], L = (k * w - p * d) / g, n.set(f, i, L), n.set(
@@ -3645,21 +3664,21 @@ function Zs(r, s, t, e, n) {
             i,
             Math.abs(k) > Math.abs(p) ? (-d - S * L) / k : (-w - D * L) / p
           )), L = Math.abs(n.get(f, i)), h * L * L > 1)
-            for (M = f; M <= i; M++)
-              n.set(M, i, n.get(M, i) / L);
+            for (y = f; y <= i; y++)
+              n.set(y, i, n.get(y, i) / L);
         }
       else if (g < 0)
-        for (R = i - 1, Math.abs(n.get(i, i - 1)) > Math.abs(n.get(i - 1, i)) ? (n.set(i - 1, i - 1, g / n.get(i, i - 1)), n.set(i - 1, i, -(n.get(i, i) - c) / n.get(i, i - 1))) : (F = Wt(0, -n.get(i - 1, i), n.get(i - 1, i - 1) - c, g), n.set(i - 1, i - 1, F[0]), n.set(i - 1, i, F[1])), n.set(i, i - 1, 0), n.set(i, i, 1), f = i - 2; f >= 0; f--) {
-          for (m = 0, b = 0, M = R; M <= i; M++)
-            m = m + n.get(f, M) * n.get(M, i - 1), b = b + n.get(f, M) * n.get(M, i);
+        for (R = i - 1, Math.abs(n.get(i, i - 1)) > Math.abs(n.get(i - 1, i)) ? (n.set(i - 1, i - 1, g / n.get(i, i - 1)), n.set(i - 1, i, -(n.get(i, i) - c) / n.get(i, i - 1))) : (A = Wt(0, -n.get(i - 1, i), n.get(i - 1, i - 1) - c, g), n.set(i - 1, i - 1, A[0]), n.set(i - 1, i, A[1])), n.set(i, i - 1, 0), n.set(i, i, 1), f = i - 2; f >= 0; f--) {
+          for (m = 0, b = 0, y = R; y <= i; y++)
+            m = m + n.get(f, y) * n.get(y, i - 1), b = b + n.get(f, y) * n.get(y, i);
           if (S = n.get(f, f) - c, s[f] < 0)
             p = S, d = m, w = b;
-          else if (R = f, s[f] === 0 ? (F = Wt(-m, -b, S, g), n.set(f, i - 1, F[0]), n.set(f, i, F[1])) : (k = n.get(f, f + 1), D = n.get(f + 1, f), j = (t[f] - c) * (t[f] - c) + s[f] * s[f] - g * g, y = (t[f] - c) * 2 * g, j === 0 && y === 0 && (j = h * u * (Math.abs(S) + Math.abs(g) + Math.abs(k) + Math.abs(D) + Math.abs(p))), F = Wt(
+          else if (R = f, s[f] === 0 ? (A = Wt(-m, -b, S, g), n.set(f, i - 1, A[0]), n.set(f, i, A[1])) : (k = n.get(f, f + 1), D = n.get(f + 1, f), j = (t[f] - c) * (t[f] - c) + s[f] * s[f] - g * g, M = (t[f] - c) * 2 * g, j === 0 && M === 0 && (j = h * u * (Math.abs(S) + Math.abs(g) + Math.abs(k) + Math.abs(D) + Math.abs(p))), A = Wt(
             k * d - p * m + g * b,
             k * w - p * b - g * m,
             j,
-            y
-          ), n.set(f, i - 1, F[0]), n.set(f, i, F[1]), Math.abs(k) > Math.abs(p) + Math.abs(g) ? (n.set(
+            M
+          ), n.set(f, i - 1, A[0]), n.set(f, i, A[1]), Math.abs(k) > Math.abs(p) + Math.abs(g) ? (n.set(
             f + 1,
             i - 1,
             (-m - S * n.get(f, i - 1) + g * n.get(f, i)) / k
@@ -3667,24 +3686,24 @@ function Zs(r, s, t, e, n) {
             f + 1,
             i,
             (-b - S * n.get(f, i) - g * n.get(f, i - 1)) / k
-          )) : (F = Wt(
+          )) : (A = Wt(
             -d - D * n.get(f, i - 1),
             -w - D * n.get(f, i),
             p,
             g
-          ), n.set(f + 1, i - 1, F[0]), n.set(f + 1, i, F[1]))), L = Math.max(Math.abs(n.get(f, i - 1)), Math.abs(n.get(f, i))), h * L * L > 1)
-            for (M = f; M <= i; M++)
-              n.set(M, i - 1, n.get(M, i - 1) / L), n.set(M, i, n.get(M, i) / L);
+          ), n.set(f + 1, i - 1, A[0]), n.set(f + 1, i, A[1]))), L = Math.max(Math.abs(n.get(f, i - 1)), Math.abs(n.get(f, i))), h * L * L > 1)
+            for (y = f; y <= i; y++)
+              n.set(y, i - 1, n.get(y, i - 1) / L), n.set(y, i, n.get(y, i) / L);
         }
     for (f = 0; f < r; f++)
       if (f < o || f > l)
-        for (M = f; M < r; M++)
-          e.set(f, M, n.get(f, M));
-    for (M = r - 1; M >= o; M--)
+        for (y = f; y < r; y++)
+          e.set(f, y, n.get(f, y));
+    for (y = r - 1; y >= o; y--)
       for (f = o; f <= l; f++) {
-        for (p = 0, E = o; E <= Math.min(M, l); E++)
-          p = p + e.get(f, E) * n.get(E, M);
-        e.set(f, M, p);
+        for (p = 0, E = o; E <= Math.min(y, l); E++)
+          p = p + e.get(f, E) * n.get(E, y);
+        e.set(f, y, p);
       }
   }
 }
@@ -3692,7 +3711,7 @@ function Wt(r, s, t, e) {
   let n, i;
   return Math.abs(t) > Math.abs(e) ? (n = e / t, i = t + n * e, [(r + n * s) / i, (s - n * r) / i]) : (n = t / e, i = e + n * t, [(n * r + s) / i, (n * s - r) / i]);
 }
-class $e {
+class Ye {
   constructor(s) {
     if (s = rt.checkMatrix(s), !s.isSymmetric())
       throw new Error("Matrix is not symmetric");
@@ -3739,7 +3758,7 @@ class $e {
     return this.L;
   }
 }
-class Le {
+class We {
   constructor(s, t = {}) {
     s = rt.checkMatrix(s);
     let { Y: e } = t;
@@ -3769,44 +3788,44 @@ 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()));
   }
 }
-$.AbstractMatrix = V;
-$.CHO = $e;
-$.CholeskyDecomposition = $e;
+$.AbstractMatrix = N;
+$.CHO = Ye;
+$.CholeskyDecomposition = Ye;
 $.DistanceMatrix = te;
-$.EVD = Ne;
-var Js = $.EigenvalueDecomposition = Ne;
+$.EVD = Ue;
+var rn = $.EigenvalueDecomposition = Ue;
 $.LU = ee;
 $.LuDecomposition = ee;
-var De = $.Matrix = _;
-$.MatrixColumnSelectionView = qs;
-$.MatrixColumnView = Cs;
-$.MatrixFlipColumnView = Fs;
-$.MatrixFlipRowView = xs;
-$.MatrixRowSelectionView = Vs;
-$.MatrixRowView = As;
+var Qe = $.Matrix = _;
+$.MatrixColumnSelectionView = Ls;
+$.MatrixColumnView = $s;
+$.MatrixFlipColumnView = Ds;
+$.MatrixFlipRowView = Os;
+$.MatrixRowSelectionView = zs;
+$.MatrixRowView = Bs;
 $.MatrixSelectionView = Gt;
-$.MatrixSubView = Ns;
-$.MatrixTransposeView = $s;
-$.NIPALS = Le;
-$.Nipals = Le;
+$.MatrixSubView = Us;
+$.MatrixTransposeView = Ys;
+$.NIPALS = We;
+$.Nipals = We;
 $.QR = pe;
 $.QrDecomposition = pe;
 $.SVD = vt;
 $.SingularValueDecomposition = vt;
 $.SymmetricMatrix = pt;
-$.WrapperMatrix1D = Ae;
+$.WrapperMatrix1D = Be;
 $.WrapperMatrix2D = rt;
-$.correlation = Ws;
-$.covariance = Ys;
-var Re = $.default = _;
+$.correlation = Hs;
+$.covariance = Ks;
+var Ce = $.default = _;
 $.determinant = Xt;
-$.inverse = Ds;
-$.linearDependencies = Bs;
-$.pseudoInverse = Us;
-$.solve = Ve;
-$.wrap = Ls;
-const Ks = Js, Hs = De;
-Re.Matrix && Re.Matrix;
+$.inverse = Qs;
+$.linearDependencies = Zs;
+$.pseudoInverse = Js;
+$.solve = ze;
+$.wrap = Ws;
+const on = rn, ln = Qe;
+Ce.Matrix && Ce.Matrix;
 function qt(r, s, t) {
   const e = r / t, n = s / t;
   if (!(isFinite(e) && isFinite(n))) {
@@ -3826,7 +3845,7 @@ function qt(r, s, t) {
   const l = e / o;
   return isFinite(l) ? l > o ? [o, l] : [l, o] : [o];
 }
-function ze(r, s, t, e) {
+function Ge(r, s, t, e) {
   const n = t / (3 * e), i = s / (3 * e), o = r / e;
   if (!(isFinite(o) && isFinite(i) && isFinite(n)))
     return qt(r, s, t);
@@ -3842,16 +3861,16 @@ function ze(r, s, t, e) {
     return [f * d - n, f * p - n, f * P - n];
   }
 }
-function wn(r, s, t, e, n) {
+function En(r, s, t, e, n) {
   if (n == 0)
-    return ze(r, s, t, e);
+    return Ge(r, s, t, e);
   const i = e / n, o = t / n, l = s / n, h = r / n;
-  let a = ve(i, o, l, h, !1);
+  let a = qe(i, o, l, h, !1);
   if (a !== null)
     return a;
   const u = 716e74;
   for (let c = 0; c < 2; c++)
-    if (a = ve(
+    if (a = qe(
       i / u,
       o / (u * u),
       l / (u * u * u),
@@ -3867,8 +3886,8 @@ function wn(r, s, t, e, n) {
 function gt(r, s) {
   return s == 0 ? Math.abs(r) : Math.abs((r - s) / s);
 }
-function ve(r, s, t, e, n) {
-  const i = tn(r, s, t, e, n);
+function qe(r, s, t, e, n) {
+  const i = hn(r, s, t, e, n);
   if (i !== null && i.length == 4) {
     let o = [];
     for (let l = 0; l < 2; l++) {
@@ -3879,73 +3898,73 @@ function ve(r, s, t, e, n) {
   }
   return null;
 }
-function tn(r, s, t, e, n) {
-  function i(x, N, A, O) {
-    const U = gt(x + A, r), T = gt(N + x * A + O, s), z = gt(N * A + x * O, t);
-    return U + T + z;
+function hn(r, s, t, e, n) {
+  function i(F, V, x, B) {
+    const U = gt(F + x, r), I = gt(V + F * x + B, s), O = gt(V * x + F * B, t);
+    return U + I + O;
   }
-  function o(x, N, A, O) {
-    return i(x, N, A, O) + gt(N * O, e);
+  function o(F, V, x, B) {
+    return i(F, V, x, B) + gt(V * B, e);
   }
   const l = 9 * r * r - 24 * s, h = l >= 0 ? -2 * s / (3 * r + kt(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) {
-    const x = a / p, N = u / p, A = c / p, O = g / p;
-    d = x * A - 4 / p * O - 1 / 3 * N * N, w = (x * A - 8 / p * O - 2 / 9 * N * N) * (1 / 3) * N - A * (A / p) - x * x * O;
+    const F = a / p, V = u / p, x = c / p, B = g / p;
+    d = F * x - 4 / p * B - 1 / 3 * V * V, w = (F * x - 8 / p * B - 2 / 9 * V * V) * (1 / 3) * V - x * (x / p) - F * F * B;
   } else
     d = a * c - 4 * g - 1 / 3 * u * u, w = (a * c + 8 * g - 2 / 9 * u * u) * (1 / 3) * u - c * c - a * a * g;
   if (!isFinite(d) && isFinite(w))
     return null;
-  let P = en(d, w);
+  let P = an(d, w);
   n && (P *= p);
-  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;
+  const f = r * 0.5, y = 1 / 6 * s + 0.5 * P, E = t - r * y, R = 2 / 3 * s - P - f * f, v = 0.5 * E / R, L = 2 * (e - y * y) / 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(N + f * f + 2 * M, s), U = gt(2 * (N * A + f * M), t), T = gt(N * A * A + M * M, e), z = O + U + T;
-    (x == 0 || z < m) && (k = N, D = A, m = z);
+  for (let F = 0; F < 3; F++) {
+    const V = F == 1 ? S : R, x = F == 0 ? v : L, B = gt(V + f * f + 2 * y, s), U = gt(2 * (V * x + f * y), t), I = gt(V * x * x + y * y, e), O = B + U + I;
+    (F == 0 || O < m) && (k = V, D = x, m = O);
   }
   const b = k, j = D;
-  let y = 0, C = 0, F = 0, I = 0;
+  let M = 0, C = 0, A = 0, T = 0;
   if (b < 0) {
-    const x = Math.sqrt(-b);
-    if (y = f + x, C = M + x * j, F = f - x, I = M - x * j, Math.abs(I) < Math.abs(C) ? I = e / C : Math.abs(I) > Math.abs(C) && (C = e / I), Math.abs(y) != Math.abs(F)) {
-      let N = null, A = null;
-      if (Math.abs(y) < Math.abs(F)) {
-        const U = (t - C * F) / I, T = (s - I - C) / F;
-        N = [r - F, U, T], A = [F, F, F];
+    const F = Math.sqrt(-b);
+    if (M = f + F, C = y + F * j, A = f - F, T = y - F * j, Math.abs(T) < Math.abs(C) ? T = e / C : Math.abs(T) > Math.abs(C) && (C = e / T), Math.abs(M) != Math.abs(A)) {
+      let V = null, x = null;
+      if (Math.abs(M) < Math.abs(A)) {
+        const U = (t - C * A) / T, I = (s - T - C) / A;
+        V = [r - A, U, I], x = [A, A, A];
       } else {
-        const U = (t - y * I) / C, T = (s - I - C) / y, z = r - y;
-        N = [y, y, y], A = [z, U, T];
+        const U = (t - M * T) / C, I = (s - T - C) / M, O = r - M;
+        V = [M, M, M], x = [O, U, I];
       }
-      let O = 0;
+      let B = 0;
       for (let U = 0; U < 3; U++) {
-        const T = N[U], z = A[U];
-        if (isFinite(T) && isFinite(z)) {
-          const X = i(T, C, z, I);
-          (U == 0 || X < O) && (y = T, F = z, O = X);
+        const I = V[U], O = x[U];
+        if (isFinite(I) && isFinite(O)) {
+          const X = i(I, C, O, T);
+          (U == 0 || X < B) && (M = I, A = O, B = X);
         }
       }
     }
   } else if (b == 0) {
-    const x = e - M * M;
-    y = f, C = M + Math.sqrt(-x), F = f, I = M - Math.sqrt(-x), Math.abs(C) > Math.abs(I) ? I = e / C : Math.abs(I) > Math.abs(C) && (C = e / I);
+    const F = e - y * y;
+    M = f, C = y + Math.sqrt(-F), A = f, T = y - Math.sqrt(-F), Math.abs(C) > Math.abs(T) ? T = e / C : Math.abs(T) > Math.abs(C) && (C = e / T);
   } else
     return [];
-  let B = o(y, C, F, I);
-  for (let x = 0; x < 8 && B != 0; x++) {
-    const N = C * I - e, A = C * F + y * I - t, O = C + y * F + I - s, U = y + F - r, T = y - F, z = C * C - C * (F * T + 2 * I) + I * (y * T + I);
-    if (z == 0)
+  let z = o(M, C, A, T);
+  for (let F = 0; F < 8 && z != 0; F++) {
+    const V = C * T - e, x = C * A + M * T - t, B = C + M * A + T - s, U = M + A - r, I = M - A, O = C * C - C * (A * I + 2 * T) + T * (M * I + T);
+    if (O == 0)
       break;
-    const X = 1 / z, G = I - C, W = C * F - y * I, se = T * N + G * A + W * O - (C * G + y * W) * U, ne = (y * T + G) * N - C * (T * A + G * O + W * U), ie = -T * N - G * A - W * O + (F * W + I * G) * U, re = -(F * T + G) * N + I * (T * A + G * O + W * U), At = y - X * se, Vt = C - X * ne, Nt = F - X * ie, $t = I - X * re, Lt = o(At, Vt, Nt, $t);
-    if (Lt < B)
-      y = At, C = Vt, F = Nt, I = $t, B = Lt;
+    const X = 1 / O, G = T - C, W = C * A - M * T, se = I * V + G * x + W * B - (C * G + M * W) * U, ne = (M * I + G) * V - C * (I * x + G * B + W * U), ie = -I * V - G * x - W * B + (A * W + T * G) * U, re = -(A * I + G) * V + T * (I * x + G * B + W * U), xt = M - X * se, Nt = C - X * ne, Vt = A - X * ie, $t = T - X * re, Lt = o(xt, Nt, Vt, $t);
+    if (Lt < z)
+      M = xt, C = Nt, A = Vt, T = $t, z = Lt;
     else
       break;
   }
-  return [y, C, F, I];
+  return [M, C, A, T];
 }
-function en(r, s) {
+function an(r, s) {
   const t = -0.3333333333333333 * r, e = 0.5 * s;
   let n, i = null;
   if ((Math.abs(t) >= 1e102 || Math.abs(e) >= 1e164) && (Math.abs(t) < Math.abs(e) ? i = 1 - t * (t / e) * (t / e) : i = Math.sign(t) * (e / t * (e / t) / t - 1)), i !== null && e == 0)
@@ -3979,32 +3998,33 @@ function kt(r, s) {
   const t = Math.abs(r);
   return s < 0 ? -t : t;
 }
-function sn(r, s = 1e-9) {
+function un(r, s = 1e-9) {
   if (r[r.length - 1] == 0)
-    return sn(r.slice(0, -1), s);
-  const t = new Hs([
+    return un(r.slice(0, -1), s);
+  const t = new ln([
     r.slice(0, -1).reverse().map((n) => -n / r[r.length - 1]),
     ...Array.from({ length: r.length - 2 }, (n, i) => {
       const o = new Array(r.length - 1).fill(0);
       return o[i] = 1, o;
     })
-  ]), e = new Ks(t);
+  ]), e = new on(t);
   return e.realEigenvalues.filter(
     (n, i) => Math.abs(e.imaginaryEigenvalues[i]) < s
   );
 }
-const nn = (r, s, t) => [r[0] * (1 - t) + s[0] * t, r[1] * (1 - t) + s[1] * t];
-function rn(r) {
+const cn = (r, s, t) => [r[0] * (1 - t) + s[0] * t, r[1] * (1 - t) + s[1] * t];
+function fn(r) {
   const s = [];
   for (let t = 0; t < r.length - 1; t++)
     s.push([r[t], r[t + 1]]);
   return s;
 }
 function de(r, s) {
-  const t = rn(r).map(([e, n]) => nn(e, n, s));
+  const t = fn(r).map(([e, n]) => cn(e, n, s));
   return r.length === 2 ? [t] : [...de(t, s), t];
 }
-class Et extends xt {
+const Ae = Symbol.for("pantograph:CubicBezier");
+class Et extends Ft {
   constructor(t, e, n, i) {
     super(t, e);
     q(this, "segmentType", "CUBIC_BEZIER");
@@ -4012,7 +4032,10 @@ class Et extends xt {
     q(this, "lastControlPoint");
     q(this, "_boundingBox", null);
     q(this, "_polynomialCoefficients", null);
-    this.firstControlPoint = n, this.lastControlPoint = i;
+    Object.defineProperty(this, Ae, { value: !0 }), this.firstControlPoint = n, this.lastControlPoint = i;
+  }
+  static isInstance(t) {
+    return !!t && t[Ae] === !0;
   }
   get midPoint() {
     return this.paramPoint(0.5);
@@ -4068,7 +4091,7 @@ class Et extends xt {
     return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y(this.firstPoint, t.firstPoint) && Y(this.lastPoint, t.lastPoint) && Y(this.firstControlPoint, t.firstControlPoint) && Y(this.lastControlPoint, t.lastControlPoint);
   }
   distanceFrom(t) {
-    const n = Ce((i) => Rt(this.paramPoint(i), t), this.precision);
+    const n = $e((i) => Rt(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
       J(this.firstPoint, t),
       J(this.lastPoint, t)
@@ -4198,7 +4221,7 @@ class Et extends xt {
   }
   paramsAtY(t) {
     const [e, n, i, o] = this.polynomialCoefficients[1];
-    return ze(e - t, n, i, o).filter((l) => l >= -this.precision && l <= 1 + this.precision);
+    return Ge(e - t, n, i, o).filter((l) => l >= -this.precision && l <= 1 + this.precision);
   }
   pointToParam(t) {
     if (Y(t, this.firstPoint, this.precision)) return 0;
@@ -4212,7 +4235,8 @@ class Et extends xt {
     return i;
   }
 }
-class jt extends xt {
+const Fe = Symbol.for("pantograph:EllipseArc");
+class jt extends Ft {
   constructor(t, e, n, i, o, l, h = !1, {
     ignoreChecks: a = !1,
     angleUnits: u = "deg"
@@ -4238,7 +4262,7 @@ class jt extends xt {
     q(this, "_firstAngle");
     q(this, "_lastAngle");
     q(this, "_deltaAngle");
-    this.center = n;
+    Object.defineProperty(this, Fe, { value: !0 }), this.center = n;
     const c = i >= o;
     this.majorRadius = c ? i : o, this.minorRadius = c ? o : i;
     const g = u === "deg" ? l * fe : l;
@@ -4263,6 +4287,9 @@ class jt extends xt {
         );
     }
   }
+  static isInstance(t) {
+    return !!t && t[Fe] === !0;
+  }
   get coefficients() {
     if (this._coefficients === null) {
       const [t, e] = this.center, n = this.majorRadius * this.majorRadius, i = this.minorRadius * this.minorRadius, o = Math.cos(this.tiltAngle), l = Math.sin(this.tiltAngle), h = n * l * l + i * o * o, a = 2 * (i - n) * l * o, u = n * o * o + i * l * l;
@@ -4280,7 +4307,7 @@ class jt extends xt {
   get info() {
     return `ELLIPSE_ARC(${Z(this.firstPoint)}, ${Z(
       this.lastPoint
-    )}, ${Z(this.center)}, ${this.majorRadius}, ${this.minorRadius}, ${this.tiltAngle * Ue}, ${this.clockwise ? "CW" : "CCW"})`;
+    )}, ${Z(this.center)}, ${this.majorRadius}, ${this.minorRadius}, ${this.tiltAngle * Je}, ${this.clockwise ? "CW" : "CCW"})`;
   }
   reverse() {
     return new jt(
@@ -4340,7 +4367,7 @@ class jt extends xt {
     return this._focals;
   }
   get majorAxis() {
-    return Tt(1, this.tiltAngle);
+    return It(1, this.tiltAngle);
   }
   paramPoint(t) {
     const e = this.firstAngle + t * this.deltaAngle * (this.clockwise ? -1 : 1);
@@ -4393,14 +4420,14 @@ class jt extends xt {
       this.center,
       nt(tt(this.majorAxis), this.minorRadius)
     ) : e = this.reverseEllipseReferenceFrameTransform.transform(
-      ln(
+      gn(
         this.majorRadius,
         this.minorRadius,
         this.ellipseReferenceFrameTransform.transform(t)
       )
     ), this.isValidParameter(this.thetaToParam(this.pointTheta(t))))
       return J(t, e);
-    if (Qe(t, this.majorAxis, this.center)) {
+    if (ts(t, this.majorAxis, this.center)) {
       const n = wt(
         2 * Math.PI - this.pointTheta(t)
       ), i = this.thetaToParam(n);
@@ -4498,8 +4525,8 @@ class jt extends xt {
     });
   }
 }
-function pn(r, s, t, e, n, i, o) {
-  const { center: l, rx: h, ry: a } = on(
+function _n(r, s, t, e, n, i, o) {
+  const { center: l, rx: h, ry: a } = mn(
     r,
     s,
     t,
@@ -4510,15 +4537,15 @@ function pn(r, s, t, e, n, i, o) {
   );
   return Math.abs(h - a) < 1e-9 ? new ct(r, s, l, o) : new jt(r, s, l, h, a, n, o);
 }
-function on([r, s], [t, e], n, i, o, l, h) {
+function mn([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);
   f > 1 && (n = n * Math.sqrt(f), i = i * Math.sqrt(f));
-  const M = n * i, E = n * P, R = i * p, v = E * E + R * R;
+  const y = n * i, E = n * P, R = i * p, v = E * E + R * R;
   if (!v)
     throw Error("start point can not be same as end point");
-  let L = Math.sqrt(Math.abs((M * M - v) / v));
+  let L = Math.sqrt(Math.abs((y * y - v) / v));
   l == h && (L = -L);
   const S = L * E / i, k = -L * R / n, D = u * S - a * k + d, m = a * S + u * k + w;
   return {
@@ -4527,26 +4554,30 @@ function on([r, s], [t, e], n, i, o, l, h) {
     ry: i
   };
 }
-function ln(r, s, t) {
+function gn(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;
   for (let a = 0; a < 3; a++) {
-    const u = l * i, c = h * o, g = (l * l - h * h) * i ** 3 / l, d = (h * h - l * l) * o ** 3 / h, w = u - g, p = c - d, P = e - g, f = n - d, M = Math.hypot(w, p), E = Math.hypot(P, f);
-    i = Math.min(1, Math.max(0, (P * M / E + g) / l)), o = Math.min(1, Math.max(0, (f * M / E + d) / h));
+    const u = l * i, c = h * o, g = (l * l - h * h) * i ** 3 / l, d = (h * h - l * l) * o ** 3 / h, w = u - g, p = c - d, P = e - g, f = n - d, y = Math.hypot(w, p), E = Math.hypot(P, f);
+    i = Math.min(1, Math.max(0, (P * y / E + g) / l)), o = Math.min(1, Math.max(0, (f * y / E + d) / h));
     const R = Math.hypot(i, o);
     i /= R, o /= R;
   }
   return [l * i * Math.sign(t[0]), h * o * Math.sign(t[1])];
 }
-class _t extends xt {
+const xe = Symbol.for("pantograph:QuadraticBezier");
+class _t extends Ft {
   constructor(t, e, n) {
     super(t, e);
     q(this, "segmentType", "QUADRATIC_BEZIER");
     q(this, "controlPoint");
     q(this, "_boundingBox", null);
     q(this, "_polynomialCoefficients", null);
-    this.controlPoint = n;
+    Object.defineProperty(this, xe, { value: !0 }), this.controlPoint = n;
+  }
+  static isInstance(t) {
+    return !!t && t[xe] === !0;
   }
   get midPoint() {
     return this.paramPoint(0.5);
@@ -4593,7 +4624,7 @@ class _t extends xt {
     return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y(this.firstPoint, t.firstPoint) && Y(this.lastPoint, t.lastPoint) && Y(this.controlPoint, t.controlPoint);
   }
   distanceFrom(t) {
-    const n = Ce((i) => Rt(this.paramPoint(i), t), this.precision);
+    const n = $e((i) => Rt(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
       J(this.firstPoint, t),
       J(this.lastPoint, t)
@@ -4738,39 +4769,39 @@ export {
   Et as C,
   fe as D,
   jt as E,
-  cn as F,
-  Ze as G,
-  Ie as H,
+  yn as F,
+  ns as G,
+  Ve as H,
   Z as I,
   at as L,
   _t as Q,
-  Ue as R,
+  Je as R,
   et as T,
   it as a,
   Q as b,
   St as c,
-  Pe as d,
+  be as d,
   J as e,
   Qt as f,
   Y as g,
-  fn as h,
-  pn as i,
-  We as j,
-  Tt as k,
-  Te as l,
+  Mn as h,
+  _n as i,
+  He as j,
+  It as k,
+  Ne as l,
   me as m,
   H as n,
-  Ye as o,
+  Ke as o,
   tt as p,
   Rt as q,
-  Je as r,
+  is as r,
   nt as s,
-  mn as t,
-  un as u,
-  sn as v,
-  wn as w,
-  It as x,
-  an as y,
+  Pn as t,
+  dn as u,
+  pn as v,
+  un as w,
+  En as x,
+  Tt as y,
   Kt as z
 };
-//# sourceMappingURL=QuadraticBezier-DCa0WGs0.js.map
+//# sourceMappingURL=QuadraticBezier-BeY2TXKH.js.map