pimath 0.1.15 → 0.1.17

package/dist/pimath.js

@@ -5,14 +5,14 @@ var di = (o) => {
 var Pi = (o, e, t) => e in o ? Ii(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
 var a = (o, e, t) => Pi(o, typeof e != "symbol" ? e + "" : e, t), Qt = (o, e, t) => e.has(o) || di("Cannot " + t);
 var s = (o, e, t) => (Qt(o, e, "read from private field"), t ? t.call(o) : e.get(o)), p = (o, e, t) => e.has(o) ? di("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, i) => (Qt(o, e, "write to private field"), i ? i.call(o, t) : e.set(o, t), t), q = (o, e, t) => (Qt(o, e, "access private method"), t);
-function Si(o) {
+function Bi(o) {
   const e = mi(o), t = [];
   let i, n;
   for (; e.length > 0; )
     i = e.shift() ?? 1, n = (e.length > 0 ? e.pop() : +i) ?? 1, t.push([i, n]);
   return t;
 }
-function Bi(...o) {
+function Si(...o) {
   const e = ai(...o);
   return o.map((t) => t / e);
 }
@@ -67,9 +67,9 @@ function Zi(o, e = 2) {
   return +`${Math.round(+`${o}e${e}`)}e-${e}`;
 }
 const G = {
-  decompose: Si,
+  decompose: Bi,
   dividers: mi,
-  divideNumbersByGCD: Bi,
+  divideNumbersByGCD: Si,
   gcd: ai,
   lcm: Ri,
   numberCorrection: zi,
@@ -81,7 +81,6 @@ const G = {
 var lt, b, w, Re;
 const $ = class $ {
   constructor(e, t) {
-    // #region Class fields (2)
     p(this, lt, !1);
     p(this, b, 1);
     p(this, w, 1);
@@ -219,8 +218,6 @@ const $ = class $ {
     });
     a(this, "one", () => (h(this, w, 1), h(this, b, 1), this));
     a(this, "opposite", () => (h(this, w, -s(this, w)), this));
-    // #endregion Properties and methods (55)
-    // #region Getters And Setters (11)
     a(this, "pow", (e) => {
       if (e instanceof $)
         return this.pow(e.value);
@@ -289,7 +286,6 @@ const $ = class $ {
     const e = s(this, w) / s(this, b);
     return e === 0 ? 0 : e;
   }
-  // #endregion Getters And Setters (11)
 };
 lt = new WeakMap(), b = new WeakMap(), w = new WeakMap(), Re = new WeakMap(), a($, "average", (...e) => {
   const t = new $().zero();
@@ -330,7 +326,7 @@ a($, "unique", (e) => {
 });
 let u = $;
 var Z, ee, ie, Ye;
-class wt {
+class yt {
   constructor(...e) {
     p(this, Z);
     p(this, ee);
@@ -406,22 +402,22 @@ var m = /* @__PURE__ */ ((o) => (o.VARIABLE = "variable", o.COEFFICIENT = "coeff
 function Ui(o, e) {
   if (o.length <= 1)
     return o;
-  const t = Object.keys(e).filter((E) => e[E].type === m.FUNCTION).map((E) => E);
-  t.sort((E, L) => L.length - E.length);
+  const t = Object.keys(e).filter((N) => e[N].type === m.FUNCTION).map((N) => N);
+  t.sort((N, L) => L.length - N.length);
   const i = new RegExp(`^(${t.join("|")})\\(`), n = Object.keys(li);
-  n.sort((E, L) => L.length - E.length);
+  n.sort((N, L) => L.length - N.length);
   const r = new RegExp(`^(${n.join("|")})`), l = /^(\d+(\.\d+)?)/;
   let c = "", d, f, g;
   for (; o.length > 0; ) {
     if (d = f, g = void 0, t.length > 0 && i.exec(o)) {
-      const E = t.find((L) => o.startsWith(L));
-      E && (g = E + "(", o = o.slice(E.length + 1), f = m.FUNCTION);
+      const N = t.find((L) => o.startsWith(L));
+      N && (g = N + "(", o = o.slice(N.length + 1), f = m.FUNCTION);
     } else if (n.length > 0 && r.exec(o)) {
-      const E = n.find((L) => o.startsWith(L));
-      E && (g = E, o = o.slice(E.length), f = m.CONSTANT);
+      const N = n.find((L) => o.startsWith(L));
+      N && (g = N, o = o.slice(N.length), f = m.CONSTANT);
     } else if (l.exec(o)) {
-      const E = l.exec(o);
-      E && (g = E[0], o = o.slice(E[0].length), f = m.COEFFICIENT);
+      const N = l.exec(o);
+      N && (g = N[0], o = o.slice(N[0].length), f = m.COEFFICIENT);
     } else
       switch (g = o[0], o = o.slice(1), g) {
         case "(":
@@ -491,10 +487,10 @@ const Wi = {
   "!": { precedence: 4, associative: "right", type: m.OPERATION },
   "-": { precedence: 2, associative: "left", type: m.OPERATION }
 };
-var We, ot, te, vt, De;
+var We, ot, te, wt, De;
 class Xt {
   constructor(e) {
-    rt(this, We), rt(this, ot, []), rt(this, te, {}), rt(this, vt, []), rt(this, De), be(this, We, typeof e > "u" ? Ze.POLYNOM : e), this.tokenConfigInitialization();
+    rt(this, We), rt(this, ot, []), rt(this, te, {}), rt(this, wt, []), rt(this, De), be(this, We, typeof e > "u" ? Ze.POLYNOM : e), this.tokenConfigInitialization();
   }
   // Getter
   get rpn() {
@@ -504,7 +500,7 @@ class Xt {
     return _(this, ot).map((e) => e.token);
   }
   tokenConfigInitialization() {
-    return _(this, We) === Ze.SET ? (be(this, te, Yi), be(this, De, !1)) : _(this, We) === Ze.NUMERIC ? (be(this, te, Xi), be(this, De, !0)) : _(this, We) === Ze.EXPRESSION ? (be(this, te, Hi), be(this, De, !0)) : (be(this, te, Wi), be(this, De, !0)), be(this, vt, Object.keys(_(this, te)).sort((e, t) => t.length - e.length)), _(this, te);
+    return _(this, We) === Ze.SET ? (be(this, te, Yi), be(this, De, !1)) : _(this, We) === Ze.NUMERIC ? (be(this, te, Xi), be(this, De, !0)) : _(this, We) === Ze.EXPRESSION ? (be(this, te, Hi), be(this, De, !0)) : (be(this, te, Wi), be(this, De, !0)), be(this, wt, Object.keys(_(this, te)).sort((e, t) => t.length - e.length)), _(this, te);
   }
   /**
    * Get the next token to analyse.
@@ -520,7 +516,7 @@ class Xt {
     else if (e[t] === ",")
       i = ",", n = m.FUNCTION_ARGUMENT;
     else {
-      for (const r of _(this, vt))
+      for (const r of _(this, wt))
         if (e.substring(t, t + r.length) === r) {
           i += r, n = _(this, te)[r].type;
           break;
@@ -573,17 +569,17 @@ class Xt {
           break;
         case m.OPERATION:
           if (n.length > 0) {
-            let E = n[n.length - 1];
-            for (g = +d; E.token in _(this, te) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
-            (_(this, te)[r].associative === "left" && _(this, te)[r].precedence <= _(this, te)[E.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
-            _(this, te)[r].associative === "right" && _(this, te)[r].precedence < _(this, te)[E.token].precedence); ) {
+            let N = n[n.length - 1];
+            for (g = +d; N.token in _(this, te) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
+            (_(this, te)[r].associative === "left" && _(this, te)[r].precedence <= _(this, te)[N.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
+            _(this, te)[r].associative === "right" && _(this, te)[r].precedence < _(this, te)[N.token].precedence); ) {
               if (g--, g === 0) {
                 console.log("SECURITY LEVEL 2 OPERATION EXIT");
                 break;
               }
               if (i.push(n.pop() ?? { token: "", tokenType: m.OPERATION }), n.length === 0)
                 break;
-              E = n[n.length - 1];
+              N = n[n.length - 1];
             }
           }
           n.push({ token: r, tokenType: c });
@@ -620,7 +616,7 @@ class Xt {
     return be(this, ot, i.concat(n.reverse())), this;
   }
 }
-We = /* @__PURE__ */ new WeakMap(), ot = /* @__PURE__ */ new WeakMap(), te = /* @__PURE__ */ new WeakMap(), vt = /* @__PURE__ */ new WeakMap(), De = /* @__PURE__ */ new WeakMap();
+We = /* @__PURE__ */ new WeakMap(), ot = /* @__PURE__ */ new WeakMap(), te = /* @__PURE__ */ new WeakMap(), wt = /* @__PURE__ */ new WeakMap(), De = /* @__PURE__ */ new WeakMap();
 class Qi {
   constructor(e, t) {
     Kt(this, "_rpn"), Kt(this, "_expression"), Kt(this, "_isValid"), this._expression = e;
@@ -721,7 +717,7 @@ class Qi {
     return +e.toFixed(t);
   }
 }
-var T, v, Qe, bt, ze, At, qt;
+var T, v, Qe, vt, ze, Ot, At;
 const I = class I {
   constructor(e) {
     p(this, Qe);
@@ -744,7 +740,7 @@ const I = class I {
     a(this, "add", (...e) => {
       for (const t of e) {
         const i = t instanceof I ? t : new I(t);
-        this.isSameAs(i) ? (this.isZero() && q(this, Qe, bt).call(this, i), s(this, T).add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
+        this.isSameAs(i) ? (this.isZero() && q(this, Qe, vt).call(this, i), s(this, T).add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
       }
       return this;
     });
@@ -787,7 +783,7 @@ const I = class I {
       if (t === !0) {
         if (e instanceof u)
           return s(this, ze).call(this, e.value);
-        if (e instanceof wt)
+        if (e instanceof yt)
           return new u().invalid();
         if (typeof e == "number")
           return s(this, ze).call(this, e);
@@ -803,7 +799,7 @@ const I = class I {
         const n = {};
         return n[this.variables[0]] = new u(e), this.evaluate(n);
       }
-      if (e instanceof wt)
+      if (e instanceof yt)
         return new u().invalid();
       if (typeof e == "object") {
         if (this.variables.length === 0)
@@ -904,8 +900,6 @@ const I = class I {
         s(this, v)[t].multiply(e);
       return this;
     });
-    // #endregion Properties and methods (31)
-    // #region Getters And Setters (11)
     a(this, "primitive", (e) => {
       e === void 0 && (e = "x");
       const t = this.clone();
@@ -948,7 +942,7 @@ const I = class I {
     a(this, "subtract", (...e) => {
       for (const t of e) {
         const i = t instanceof I ? t : new I(t);
-        this.isSameAs(i) ? (this.isZero() && q(this, Qe, bt).call(this, i), s(this, T).add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
+        this.isSameAs(i) ? (this.isZero() && q(this, Qe, vt).call(this, i), s(this, T).add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
       }
       return this;
     });
@@ -966,7 +960,7 @@ const I = class I {
         const i = {};
         return i[this.variables[0]] = new u(e).value, s(this, ze).call(this, i);
       }
-      if (e instanceof wt)
+      if (e instanceof yt)
         return NaN;
       if (typeof e == "object") {
         if (this.variables.length === 0)
@@ -978,7 +972,7 @@ const I = class I {
       }
       return t;
     });
-    p(this, At, (e) => {
+    p(this, Ot, (e) => {
       const i = new Xt().parse(e).rpn, n = [];
       if (i.length === 0)
         return this.zero(), this;
@@ -987,10 +981,10 @@ const I = class I {
         return this.one(), r.tokenType === m.COEFFICIENT ? this.coefficient = new u(r.token) : r.tokenType === m.VARIABLE && this.setLetter(r.token, 1), this;
       } else
         for (const r of i)
-          s(this, qt).call(this, n, r);
+          s(this, At).call(this, n, r);
       return this.one(), this.multiply(n[0]), this;
     });
-    p(this, qt, (e, t) => {
+    p(this, At, (e, t) => {
       var d;
       let i, n, r, l, c;
       if (t.tokenType === m.COEFFICIENT)
@@ -1023,7 +1017,7 @@ const I = class I {
    * @param inputStr
    */
   parse(e) {
-    return h(this, T, new u()), h(this, v, {}), typeof e == "string" ? s(this, At).call(this, e) : typeof e == "number" ? h(this, T, new u(e)) : e instanceof u ? h(this, T, e.clone()) : e instanceof I && (h(this, T, s(e, T).clone()), q(this, Qe, bt).call(this, e)), this;
+    return h(this, T, new u()), h(this, v, {}), typeof e == "string" ? s(this, Ot).call(this, e) : typeof e == "number" ? h(this, T, new u(e)) : e instanceof u ? h(this, T, e.clone()) : e instanceof I && (h(this, T, s(e, T).clone()), q(this, Qe, vt).call(this, e)), this;
   }
   /**
    * Get the coefficient \\(k\\) of the Monom \\(k\\cdot x^{n}\\)
@@ -1169,12 +1163,11 @@ const I = class I {
         }
     return i;
   }
-  // #endregion Private methods (5)
 };
-T = new WeakMap(), v = new WeakMap(), Qe = new WeakSet(), bt = function(e) {
+T = new WeakMap(), v = new WeakMap(), Qe = new WeakSet(), vt = function(e) {
   for (const t in e.literal)
     s(this, v)[t] = e.literal[t].clone();
-}, ze = new WeakMap(), At = new WeakMap(), qt = new WeakMap(), a(I, "gcd", (...e) => {
+}, ze = new WeakMap(), Ot = new WeakMap(), At = new WeakMap(), a(I, "gcd", (...e) => {
   for (const r of e)
     if (r.containsRationalPower())
       return new I().zero();
@@ -1258,8 +1251,8 @@ ue = new WeakMap(), Fe = new WeakMap(), P = new WeakSet(), ht = function(e, t) {
   const l = G.dividers(n.value), c = G.dividers(r.value);
   for (const f of l)
     for (const g of c) {
-      const E = new u(g, f);
-      e.evaluate(E).isZero() && !t.find((L) => L.value === E.value) && t.push(q(this, P, ye).call(this, E)), E.opposite(), e.evaluate(E).isZero() && !t.find((L) => L.value === E.value) && t.push(q(this, P, ye).call(this, E));
+      const N = new u(g, f);
+      e.evaluate(N).isZero() && !t.find((L) => L.value === N.value) && t.push(q(this, P, ye).call(this, N)), N.opposite(), e.evaluate(N).isZero() && !t.find((L) => L.value === N.value) && t.push(q(this, P, ye).call(this, N));
     }
   for (const f of t) {
     if (f.exact !== !1 && f.exact.isZero())
@@ -1275,7 +1268,7 @@ ue = new WeakMap(), Fe = new WeakMap(), P = new WeakSet(), ht = function(e, t) {
   const d = new ui(e, e.clone().parse("0"), s(this, Fe));
   return t = t.concat(d.solve()), t.sort((f, g) => f.value - g.value);
 }, _t = function() {
-  const e = s(this, ue), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), d = r.clone().divide(t), f = c.clone().subtract(l.clone().pow(2).divide(3)), g = d.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), E = g.clone().opposite(), L = f.clone().opposite().pow(3).divide(27), de = E.clone().pow(2).subtract(L.clone().multiply(4)).opposite();
+  const e = s(this, ue), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), d = r.clone().divide(t), f = c.clone().subtract(l.clone().pow(2).divide(3)), g = d.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), N = g.clone().opposite(), L = f.clone().opposite().pow(3).divide(27), de = N.clone().pow(2).subtract(L.clone().multiply(4)).opposite();
   if (de.isNegative()) {
     const he = g.clone().opposite().add(de.clone().opposite().sqrt()).divide(2).root(3), ae = g.clone().opposite().subtract(de.clone().opposite().sqrt()).divide(2).root(3), ge = he.clone().add(ae).subtract(l.clone().divide(3));
     return [q(this, P, ye).call(this, ge)];
@@ -1312,7 +1305,7 @@ ue = new WeakMap(), Fe = new WeakMap(), P = new WeakSet(), ht = function(e, t) {
   }
   return q(this, P, xi).call(this, t, i, r);
 }, xi = function(e, t, i) {
-  const n = G.dividers(i.value).filter((pe) => Math.sqrt(pe) % 1 === 0).map((pe) => Math.sqrt(pe)).pop() ?? 1, r = G.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), d = i.clone().divide(n ** 2), f = Math.abs(n / r), g = n === 1 ? "-" : `-${f} `, E = n === 1 ? "+" : `+${f} `;
+  const n = G.dividers(i.value).filter((pe) => Math.sqrt(pe) % 1 === 0).map((pe) => Math.sqrt(pe)).pop() ?? 1, r = G.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), d = i.clone().divide(n ** 2), f = Math.abs(n / r), g = n === 1 ? "-" : `-${f} `, N = n === 1 ? "+" : `+${f} `;
   function L(pe, ce, nt, Yt) {
     return `\\frac{ ${ce} ${nt}\\sqrt{ ${Yt} } }{ ${pe} }`;
   }
@@ -1326,29 +1319,26 @@ ue = new WeakMap(), Fe = new WeakMap(), P = new WeakSet(), ht = function(e, t) {
       display: de(c.display, l.display, g.toString(), d.display)
     }),
     q(this, P, ht).call(this, ge, {
-      tex: L(c.tex, l.tex, E.toString(), d.tex),
-      display: de(c.display, l.display, E.toString(), d.display)
+      tex: L(c.tex, l.tex, N.toString(), d.tex),
+      display: de(c.display, l.display, N.toString(), d.display)
     })
   ].sort((pe, ce) => pe.value - ce.value);
 };
-let Et = ui;
+let xt = ui;
 function pi(o, e = !0) {
   return e ? `\\left( ${o} \\right)` : `(${o})`;
 }
-function Be(o, e, t, i, n) {
+function Se(o, e, t, i, n) {
   return o.map((r, l) => i !== void 0 && l < i || n !== void 0 && l > n ? r : r === e ? t : r);
 }
-var je, y, Ke, ct, Je, ut, Mt, kt, Ct, _e, $t, ft, It, Pt, St, dt, Ei, Bt, Rt, Ki;
+var je, y, Ke, ct, Je, ut, qt, Mt, kt, _e, Ct, ft, $t, It, Pt, Bt, Ei, St, Rt;
 const C = class C {
   constructor(e, ...t) {
-    p(this, dt);
-    // #region Class fields (8)
+    p(this, Bt);
     p(this, je);
     p(this, y);
     p(this, Ke);
     p(this, ct, !1);
-    // #endregion Constructors (7)
-    // #region Properties and methods (49)
     /**
      * Parse a string to a polynom.
      * @param inputStr
@@ -1356,7 +1346,7 @@ const C = class C {
      */
     a(this, "parse", (e, ...t) => {
       if (h(this, y, []), h(this, je, []), typeof e == "string")
-        return q(this, dt, Ei).call(this, e, ...t);
+        return q(this, Bt, Ei).call(this, e, ...t);
       if ((typeof e == "number" || e instanceof u || e instanceof k) && t.length === 0)
         s(this, y).push(new k(e));
       else if (e instanceof k && t.length > 0)
@@ -1409,7 +1399,7 @@ const C = class C {
       if (e instanceof u)
         return s(this, ut).call(this, e);
       if (typeof e == "number" && Number.isSafeInteger(e))
-        return s(this, Mt).call(this, e);
+        return s(this, qt).call(this, e);
       if (e instanceof k)
         return this.divide(new C(e));
       if (e instanceof C) {
@@ -1445,7 +1435,7 @@ const C = class C {
     });
     a(this, "evaluate", (e, t) => {
       if (t)
-        return s(this, kt).call(this, e);
+        return s(this, Mt).call(this, e);
       const i = new u().zero();
       return s(this, y).forEach((n) => {
         i.add(n.evaluate(e, t));
@@ -1472,7 +1462,7 @@ const C = class C {
           t.push(i.clone()), i.one();
           break;
         } else {
-          let c = s(this, $t).call(this, i, l, e ?? "x");
+          let c = s(this, Ct).call(this, i, l, e ?? "x");
           for (l = i.degree(e).value; c.length > 0; ) {
             const d = c[0];
             if (!i.isDividableBy(d))
@@ -1480,8 +1470,8 @@ const C = class C {
             else {
               const f = i.euclidean(d);
               t.push(d), i = f.quotient.clone(), c = c.filter((g) => {
-                const E = i.monoms[0], L = i.monoms[i.monoms.length - 1], de = g.monoms[0], he = g.monoms[g.monoms.length - 1];
-                return L.isDivisible(he) ? E.isDivisible(de) : !1;
+                const N = i.monoms[0], L = i.monoms[i.monoms.length - 1], de = g.monoms[0], he = g.monoms[g.monoms.length - 1];
+                return L.isDivisible(he) ? N.isDivisible(de) : !1;
               });
             }
           }
@@ -1503,7 +1493,7 @@ const C = class C {
         e.push(t.coefficient.numerator);
       return e;
     });
-    a(this, "getZeroes", () => this.degree().isZero() ? [] : (this.roots = new Et(this.clone()).solve(), this.roots));
+    a(this, "getZeroes", () => this.degree().isZero() ? [] : (this.roots = new xt(this.clone()).solve(), this.roots));
     a(this, "integrate", (e, t, i = "x") => {
       const n = this.primitive(i), r = {}, l = {};
       return r[i] = new u(e), l[i] = new u(t), n.evaluate(l).subtract(n.evaluate(r));
@@ -1584,7 +1574,7 @@ const C = class C {
         r.degree(t).isEqual(e) && i.push(r.clone());
       return i;
     });
-    a(this, "multiply", (e) => e instanceof C ? s(this, St).call(this, e) : e instanceof u ? s(this, ft).call(this, e) : e instanceof k ? s(this, Pt).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? s(this, It).call(this, e) : this);
+    a(this, "multiply", (e) => e instanceof C ? s(this, Pt).call(this, e) : e instanceof u ? s(this, ft).call(this, e) : e instanceof k ? s(this, It).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? s(this, $t).call(this, e) : this);
     a(this, "one", () => (h(this, y, []), s(this, y).push(new k().one()), this));
     // ------------------------------------------
     a(this, "opposite", () => (h(this, y, s(this, y).map((e) => e.opposite())), this));
@@ -1634,8 +1624,6 @@ const C = class C {
         return 0;
       }), this;
     });
-    // #endregion Properties and methods (49)
-    // #region Getters And Setters (22)
     // ------------------------------------------
     /**
      * Replace a variable (letter) by a polynom.
@@ -1671,27 +1659,25 @@ const C = class C {
           return !1;
       }
     });
-    // #endregion Getters And Setters (22)
-    // #region Private methods (15)
     p(this, ut, (e) => {
       for (const t of s(this, y))
         t.coefficient.divide(e);
       return this;
     });
-    p(this, Mt, (e) => {
+    p(this, qt, (e) => {
       const t = new u(e);
       for (const i of s(this, y))
         i.coefficient.divide(t);
       return this;
     });
-    p(this, kt, (e) => {
+    p(this, Mt, (e) => {
       let t = 0;
       return s(this, y).forEach((i) => {
         t += i.evaluate(e, !0);
       }), t;
     });
-    p(this, Ct, (e) => {
-      var E;
+    p(this, kt, (e) => {
+      var N;
       let t, i, n, r, l, c, d, f, g;
       if (this.numberOfVars === 1)
         return n = this.monomByDegree(2, e).coefficient, r = this.monomByDegree(1, e).coefficient, l = this.monomByDegree(0, e).coefficient, c = r.clone().pow(2).subtract(n.clone().multiply(l).multiply(4)), c.isZero() ? (d = r.clone().opposite().divide(n.clone().multiply(2)), t = new C(e).subtract(d.display).multiply(d.denominator), i = new C(e).subtract(d.display).multiply(d.denominator), g = n.divide(d.denominator).divide(d.denominator), g.isOne() ? [t, i] : [new C(g.display), t, i]) : c.isPositive() && c.isSquare() ? (d = r.clone().opposite().add(c.clone().sqrt()).divide(n.clone().multiply(2)), f = r.clone().opposite().subtract(c.clone().sqrt()).divide(n.clone().multiply(2)), g = n.divide(d.denominator).divide(f.denominator), g.isOne() ? [
@@ -1703,7 +1689,7 @@ const C = class C {
           new C(e).subtract(f.display).multiply(f.denominator)
         ]) : [this.clone()];
       if (n = this.monomByDegree(2, e), r = this.monomByDegree(1, e), l = this.monomByDegree(0, e), n.isLiteralSquare() && l.isLiteralSquare() && r.clone().pow(2).isSameAs(n.clone().multiply(l))) {
-        const L = new C("x", n.coefficient, r.coefficient, l.coefficient), de = s(E = L, Ct).call(E, "x"), he = [];
+        const L = new C("x", n.coefficient, r.coefficient, l.coefficient), de = s(N = L, kt).call(N, "x"), he = [];
         let ae;
         if (de.length >= 2) {
           for (const ge of de)
@@ -1723,7 +1709,7 @@ const C = class C {
       }
       return i === !0 && this.length > 1 && (e === "tex" ? r = `\\left( ${r} \\right)` : r = `(${r})`), r === "" && (r = "0"), r;
     });
-    p(this, $t, (e, t, i) => {
+    p(this, Ct, (e, t, i) => {
       const n = e.monoms[0].dividers, r = e.monoms[e.monoms.length - 1].dividers, l = [];
       return n.forEach((c) => {
         c.degree(i).isLeq(t) && r.forEach((d) => {
@@ -1736,13 +1722,13 @@ const C = class C {
         t.coefficient.multiply(e);
       return this.reduce();
     });
-    p(this, It, (e) => s(this, ft).call(this, new u(e)));
-    p(this, Pt, (e) => {
+    p(this, $t, (e) => s(this, ft).call(this, new u(e)));
+    p(this, It, (e) => {
       for (const t of s(this, y))
         t.multiply(e);
       return this.reduce();
     });
-    p(this, St, (e) => {
+    p(this, Pt, (e) => {
       const t = [];
       for (const i of s(this, y))
         for (const n of e.monoms)
@@ -1753,7 +1739,7 @@ const C = class C {
      * Main parse using a shutting yard class
      * @param inputStr
      */
-    p(this, Bt, (e) => {
+    p(this, St, (e) => {
       const i = new Xt().parse(e).rpn;
       this.zero();
       const n = [];
@@ -1864,23 +1850,23 @@ const C = class C {
       throw new Error("Some roots cannot be found !");
     let n = [""];
     if (t.forEach(() => n.push("t", "")), t.length === 0)
-      n = Be(n, "", this.monomsByDegree()[0].coefficient.isPositive() ? "+" : "-");
+      n = Se(n, "", this.monomsByDegree()[0].coefficient.isPositive() ? "+" : "-");
     else if (this.degree().isOne()) {
       const r = this.monomsByDegree(1)[0].coefficient.sign(), l = t.findIndex((c) => c.value === i[0].value) * 2 + 1;
-      n[l] = "z", n = Be(n, "", r === 1 ? "-" : "+", 0, l), n = Be(n, "", r === 1 ? "+" : "-", l);
+      n[l] = "z", n = Se(n, "", r === 1 ? "-" : "+", 0, l), n = Se(n, "", r === 1 ? "+" : "-", l);
     } else {
       let r = 0, l, c = "+";
       i.forEach((d, f) => {
         const g = t.findIndex((L) => L.value === i[f].value);
-        f === 0 && (l = g * 2 + 1, n[l] = "z", n = Be(
+        f === 0 && (l = g * 2 + 1, n[l] = "z", n = Se(
           n,
           "",
           this.evaluate(d.value - 1, !0) < 0 ? "-" : "+",
           0,
           l
         )), r = g * 2 + 1, l = f === i.length - 1 ? n.length : t.findIndex((L) => L.value === i[f + 1].value) * 2 + 1;
-        const E = f === i.length - 1 ? d.value + 1 : (d.value + i[f + 1].value) / 2;
-        c = this.evaluate(E, !0) < 0 ? "-" : "+", n[r] = "z", n = Be(n, "", c, r, l), r = +l, l = n.length;
+        const N = f === i.length - 1 ? d.value + 1 : (d.value + i[f + 1].value) / 2;
+        c = this.evaluate(N, !0) < 0 ? "-" : "+", n[r] = "z", n = Se(n, "", c, r, l), r = +l, l = n.length;
       });
     }
     return { roots: t, signs: n };
@@ -1897,16 +1883,15 @@ const C = class C {
   get zeroes() {
     return this.getZeroes();
   }
-  // #endregion Private methods (15)
 };
-je = new WeakMap(), y = new WeakMap(), Ke = new WeakMap(), ct = new WeakMap(), Je = new WeakMap(), ut = new WeakMap(), Mt = new WeakMap(), kt = new WeakMap(), Ct = new WeakMap(), _e = new WeakMap(), $t = new WeakMap(), ft = new WeakMap(), It = new WeakMap(), Pt = new WeakMap(), St = new WeakMap(), dt = new WeakSet(), Ei = function(e, ...t) {
+je = new WeakMap(), y = new WeakMap(), Ke = new WeakMap(), ct = new WeakMap(), Je = new WeakMap(), ut = new WeakMap(), qt = new WeakMap(), Mt = new WeakMap(), kt = new WeakMap(), _e = new WeakMap(), Ct = new WeakMap(), ft = new WeakMap(), $t = new WeakMap(), It = new WeakMap(), Pt = new WeakMap(), Bt = new WeakSet(), Ei = function(e, ...t) {
   if (t.length === 0) {
     if (e = "" + e, e !== "" && !isNaN(Number(e))) {
       this.empty();
       const i = new k(e);
       return this.add(i), this;
     }
-    return s(this, Bt).call(this, e);
+    return s(this, St).call(this, e);
   } else if (/^[a-z]+/.test(e)) {
     this.empty();
     const i = t.map((n) => new u(n));
@@ -1927,24 +1912,23 @@ je = new WeakMap(), y = new WeakMap(), Ke = new WeakMap(), ct = new WeakMap(), J
     return this;
   } else
     return this.zero();
-}, Bt = new WeakMap(), Rt = new WeakMap(), Ki = function(e) {
-};
+}, St = new WeakMap(), Rt = new WeakMap();
 let A = C;
-var Te, et, Ee, Ne;
+var Ee, et, Ne, Te;
 const we = class we {
   constructor(e, t) {
-    p(this, Te);
-    p(this, et, !1);
     p(this, Ee);
+    p(this, et, !1);
     p(this, Ne);
+    p(this, Te);
     if (e instanceof we)
-      h(this, Ee, e.polynom.clone()), h(this, Ne, e.power.clone());
+      h(this, Ne, e.polynom.clone()), h(this, Te, e.power.clone());
     else if (typeof e == "string" && t === void 0) {
       const [i, n = "1"] = e.split("^");
-      h(this, Ee, new A(i)), h(this, Ne, new u(n.replace("(", "").replace(")", "")));
+      h(this, Ne, new A(i)), h(this, Te, new u(n.replace("(", "").replace(")", "")));
     } else
-      h(this, Ee, new A(e)), h(this, Ne, new u(t ?? 1));
-    return h(this, Te, 1), this;
+      h(this, Ne, new A(e)), h(this, Te, new u(t ?? 1));
+    return h(this, Ee, 1), this;
   }
   parse() {
     throw new Error("Method not implemented.");
@@ -1956,10 +1940,10 @@ const we = class we {
     throw new Error("Adding two factors is not possible");
   }
   get withPower() {
-    return h(this, Te, 1), this;
+    return h(this, Ee, 1), this;
   }
   get withRoot() {
-    return h(this, Te, 0), this;
+    return h(this, Ee, 0), this;
   }
   get asSingle() {
     return h(this, et, !0), this;
@@ -1982,7 +1966,7 @@ const we = class we {
   get display() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, n;
-    return s(this, Te) === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, n = Math.abs(e) === 1 ? "" : `^(${Math.abs(e)})`) : (i = s(this, et) && this.power.isOne() ? this.polynom.display : pi(this.polynom.display, !1), n = t === 1 && Math.abs(e) === 1 ? "" : `^(${this.power.display})`), i = `${i}${n}`, s(this, Te) === 0 && e < 0 && (i = `1/(${i})`), i;
+    return s(this, Ee) === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, n = Math.abs(e) === 1 ? "" : `^(${Math.abs(e)})`) : (i = s(this, et) && this.power.isOne() ? this.polynom.display : pi(this.polynom.display, !1), n = t === 1 && Math.abs(e) === 1 ? "" : `^(${this.power.display})`), i = `${i}${n}`, s(this, Ee) === 0 && e < 0 && (i = `1/(${i})`), i;
   }
   divide(e) {
     if (e instanceof we && this.isSameAs(e))
@@ -2023,25 +2007,25 @@ const we = class we {
     throw new Error("The two factors must be the same");
   }
   one() {
-    return s(this, Ee).one(), s(this, Ne).one(), this;
+    return s(this, Ne).one(), s(this, Te).one(), this;
   }
   opposite() {
     throw new Error("Method not implemented.");
   }
   get polynom() {
-    return s(this, Ee);
+    return s(this, Ne);
   }
   set polynom(e) {
-    h(this, Ee, e);
+    h(this, Ne, e);
   }
   pow(e) {
     return this.power.multiply(e), this;
   }
   get power() {
-    return s(this, Ne);
+    return s(this, Te);
   }
   set power(e) {
-    h(this, Ne, new u(e));
+    h(this, Te, new u(e));
   }
   primitive() {
     throw new Error("Method not implemented.");
@@ -2061,43 +2045,38 @@ const we = class we {
   get tex() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, n;
-    return s(this, Te) === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, n = Math.abs(e) === 1 ? "" : `^{ ${Math.abs(e)} }`) : (i = s(this, et) && this.power.isOne() ? this.polynom.tex : pi(this.polynom.tex), n = t === 1 && Math.abs(e) === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${n}`, s(this, Te) === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
+    return s(this, Ee) === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, n = Math.abs(e) === 1 ? "" : `^{ ${Math.abs(e)} }`) : (i = s(this, et) && this.power.isOne() ? this.polynom.tex : pi(this.polynom.tex), n = t === 1 && Math.abs(e) === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${n}`, s(this, Ee) === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
   }
   get variables() {
     return this.polynom.variables;
   }
   zero() {
-    return s(this, Ee).zero(), s(this, Ne).one(), this;
+    return s(this, Ne).zero(), s(this, Te).one(), this;
   }
   tableOfSigns(e) {
-    const t = s(this, Ne).clone().reduce(), i = s(this, Ee).tableOfSigns(e);
-    return t.isStrictlyNegative() && (i.signs = Be(i.signs, "z", "d")), t.denominator % 2 === 0 ? i.signs = Be(i.signs, "-", "h") : t.numerator % 2 === 0 && (i.signs = Be(i.signs, "-", "+")), { roots: i.roots, signs: i.signs };
+    const t = this.power.clone().reduce(), i = this.polynom.tableOfSigns(e);
+    return t.isStrictlyNegative() && (i.signs = Se(i.signs, "z", "d")), t.denominator % 2 === 0 ? i.signs = Se(i.signs, "-", "h") : t.numerator % 2 === 0 && (i.signs = Se(i.signs, "-", "+")), { roots: i.roots, signs: i.signs };
   }
 };
-Te = new WeakMap(), et = new WeakMap(), Ee = new WeakMap(), Ne = new WeakMap();
+Ee = new WeakMap(), et = new WeakMap(), Ne = new WeakMap(), Te = new WeakMap();
 let le = we;
-var He = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(He || {}), Ue, N, pt, ti;
+var He = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(He || {}), Ue, E, dt, ti;
 const me = class me {
-  // #endregion Class fields (1)
-  // #region Constructors (1)
   constructor(...e) {
-    // #region Class fields (1)
     p(this, Ue, He.POWER);
-    p(this, N, []);
+    p(this, E, []);
     return this.parse(...e), this;
   }
-  // #endregion Constructors (1)
-  // #region Properties and methods (25)
   parse(...e) {
-    return e.length === 0 ? this : (h(this, N, []), e.forEach((t) => {
+    return e.length === 0 ? this : (h(this, E, []), e.forEach((t) => {
       if (typeof t == "string") {
         const i = t.split(")(").join(")*(").split("*");
-        s(this, N).push(...i.map((n) => new le(n)));
-      } else t instanceof me ? s(this, N).push(...t.factors.map((i) => i.clone())) : s(this, N).push(new le(t));
+        s(this, E).push(...i.map((n) => new le(n)));
+      } else t instanceof me ? s(this, E).push(...t.factors.map((i) => i.clone())) : s(this, E).push(new le(t));
     }), this);
   }
   clone() {
-    return new me(...s(this, N).map((e) => e.clone()));
+    return new me(...s(this, E).map((e) => e.clone()));
   }
   static gcd(...e) {
     var i;
@@ -2106,11 +2085,11 @@ const me = class me {
     if (e.length === 1)
       return e[0];
     if (e.length === 2)
-      return q(i = me, pt, ti).call(i, e[0], e[1]);
+      return q(i = me, dt, ti).call(i, e[0], e[1]);
     let t = e[0];
     return e.shift(), e.forEach((n) => {
       var r;
-      return t = q(r = me, pt, ti).call(r, t, n);
+      return t = q(r = me, dt, ti).call(r, t, n);
     }), t;
   }
   add(...e) {
@@ -2118,7 +2097,7 @@ const me = class me {
     const i = me.gcd(...t);
     t = t.map((r) => r.divide(i).reduce());
     const n = new A("0");
-    return t.forEach((r) => n.add(r.develop())), h(this, N, [
+    return t.forEach((r) => n.add(r.develop())), h(this, E, [
       ...i.factors,
       new le(n)
     ]), this;
@@ -2130,51 +2109,54 @@ const me = class me {
     return h(this, Ue, He.ROOT), this;
   }
   degree(e) {
-    return s(this, N).reduce((t, i) => t.add(i.degree(e)), new u("0"));
+    return s(this, E).reduce((t, i) => t.add(i.degree(e)), new u("0"));
   }
   get denominator() {
-    return s(this, N).filter((e) => e.power.isNegative());
+    return s(this, E).filter((e) => e.power.isNegative());
   }
   derivative() {
-    const e = [], t = s(this, N).length;
+    const e = [], t = s(this, E).length;
     for (let n = 0; n < t; n++) {
-      const r = s(this, N).slice(), l = r.splice(n, 1)[0];
+      const r = s(this, E).slice(), l = r.splice(n, 1)[0];
       e.push(new me(...r).multiply(new me(...l.derivative())));
     }
     e.forEach((n) => n.reduce());
     const i = e.shift();
-    return i !== void 0 && h(this, N, i.factors), this.add(...e);
+    return i !== void 0 && h(this, E, i.factors), this.add(...e);
   }
   develop() {
     const e = new A("1");
-    return s(this, N).forEach((t) => {
+    return s(this, E).forEach((t) => {
       e.multiply(t.develop());
     }), e;
   }
   get display() {
     let e = [], t = [];
-    if (s(this, Ue) === He.ROOT ? (e = this.numerator, t = this.denominator.map((r) => r.clone().inverse())) : e = s(this, N), e.length === 0 && (e = [new le("1")]), t.length === 0)
+    if (s(this, Ue) === He.ROOT ? (e = this.numerator, t = this.denominator.map((r) => r.clone().inverse())) : e = s(this, E), e.length === 0 && (e = [new le("1")]), t.length === 0)
       return e.length === 1 ? e[0].asSingle.display : e.map((r) => r.display).join("");
     const i = e.length === 1 ? e[0].asSingle.display : e.map((r) => r.display).join(""), n = t.length === 1 ? t[0].asSingle.display : t.map((r) => r.display).join("");
     return `(${i})/(${n})`;
   }
   divide(e) {
-    return h(this, N, s(this, N).concat(e.clone().factors.map((t) => t.inverse()))), this;
+    return h(this, E, s(this, E).concat(e.clone().factors.map((t) => t.inverse()))), this;
   }
   evaluate(e, t) {
-    return t ? s(this, N).reduce((i, n) => i * n.evaluate(e, t), 1) : s(this, N).reduce((i, n) => i.multiply(n.evaluate(e)), new u("1"));
+    return t ? s(this, E).reduce((i, n) => i * n.evaluate(e, t), 1) : s(this, E).reduce((i, n) => i.multiply(n.evaluate(e)), new u("1"));
+  }
+  getFactors() {
+    return s(this, E);
   }
   get factors() {
-    return s(this, N);
+    return s(this, E);
   }
   set factors(e) {
-    h(this, N, e);
+    h(this, E, e);
   }
   fromPolynom(e, t) {
-    return h(this, N, new A(e).factorize(t).map((i) => new le(i))), this;
+    return h(this, E, new A(e).factorize(t).map((i) => new le(i))), this;
   }
   getZeroes() {
-    const e = [].concat(...s(this, N).map((t) => t.polynom.getZeroes()));
+    const e = [].concat(...s(this, E).map((t) => t.polynom.getZeroes()));
     return e.sort((t, i) => t.value - i.value), e.filter(
       (t, i, n) => i === n.findIndex(
         (r) => r.value === t.value
@@ -2182,59 +2164,57 @@ const me = class me {
     );
   }
   hasVariable(e) {
-    return s(this, N).some((t) => t.hasVariable(e));
+    return s(this, E).some((t) => t.hasVariable(e));
   }
   inverse() {
-    return h(this, N, s(this, N).map((e) => e.inverse())), this;
+    return h(this, E, s(this, E).map((e) => e.inverse())), this;
   }
   isEqual(e) {
     const t = me.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
     return i.isOne() && n.isOne();
   }
   isOne() {
-    return s(this, N).every((e) => e.isOne());
+    return s(this, E).every((e) => e.isOne());
   }
   isZero() {
-    return s(this, N).every((e) => e.isZero());
+    return s(this, E).every((e) => e.isZero());
   }
   multiply(...e) {
     return e.forEach((t) => {
-      h(this, N, s(this, N).concat(t.clone().factors));
+      h(this, E, s(this, E).concat(t.clone().factors));
     }), this;
   }
   get numerator() {
-    return s(this, N).filter((e) => e.power.isPositive());
+    return s(this, E).filter((e) => e.power.isPositive());
   }
   one() {
-    return h(this, N, [new le("1", "1")]), this;
+    return h(this, E, [new le("1", "1")]), this;
   }
-  // #endregion Properties and methods (25)
-  // #region Getters And Setters (5)
   opposite() {
-    const e = s(this, N).findIndex((t) => t.display === "(-1)");
-    return e >= 0 ? s(this, N).splice(e, 1) : s(this, N).push(new le("-1", "1")), this;
+    const e = s(this, E).findIndex((t) => t.display === "(-1)");
+    return e >= 0 ? s(this, E).splice(e, 1) : s(this, E).push(new le("-1", "1")), this;
   }
   pow(e) {
-    return h(this, N, s(this, N).map((t) => t.pow(e))), this;
+    return h(this, E, s(this, E).map((t) => t.pow(e))), this;
   }
   primitive() {
     throw new Error("Method not implemented.");
   }
   reduce() {
     const e = Jt(this);
-    return h(this, N, Object.values(e).map((t) => {
+    return h(this, E, Object.values(e).map((t) => {
       const i = t[0].polynom, n = t.reduce((r, l) => r.add(l.power), new u("0"));
       return new le(i, n.reduce());
     }).filter((t) => !t.power.isZero())), this;
   }
   root(e) {
-    return h(this, N, s(this, N).map((t) => t.root(e))), this;
+    return h(this, E, s(this, E).map((t) => t.root(e))), this;
   }
   sort() {
-    return h(this, N, s(this, N).sort((e, t) => e.degree().isLeq(t.degree()) ? -1 : 1)), this;
+    return h(this, E, s(this, E).sort((e, t) => e.degree().isLeq(t.degree()) ? -1 : 1)), this;
   }
   sqrt() {
-    return h(this, N, s(this, N).map((e) => e.sqrt())), this;
+    return h(this, E, s(this, E).map((e) => e.sqrt())), this;
   }
   subtract(...e) {
     return this.add(...e.map((t) => t.opposite()));
@@ -2260,28 +2240,25 @@ const me = class me {
   }
   get tex() {
     let e = [], t = [];
-    if (s(this, Ue) === He.ROOT ? (e = this.numerator, t = this.denominator.map((r) => r.clone().inverse())) : e = s(this, N), e.length === 0 && (e = [new le("1")]), t.length === 0)
+    if (s(this, Ue) === He.ROOT ? (e = this.numerator, t = this.denominator.map((r) => r.clone().inverse())) : e = s(this, E), e.length === 0 && (e = [new le("1")]), t.length === 0)
       return e.length === 1 ? e[0].asSingle.tex : e.map((r) => r.tex).join("");
     const i = e.length === 1 ? e[0].asSingle.tex : e.map((r) => r.tex).join(""), n = t.length === 1 ? t[0].asSingle.tex : t.map((r) => r.tex).join("");
     return `\\frac{ ${i} }{ ${n} }`;
   }
   get variables() {
-    return s(this, N).reduce((e, t) => e.concat(t.variables), []);
+    return s(this, E).reduce((e, t) => e.concat(t.variables), []);
   }
-  // #endregion Getters And Setters (5)
-  // #region Private methods (1)
   zero() {
-    return h(this, N, [new le("0", "1")]), this;
+    return h(this, E, [new le("0", "1")]), this;
   }
-  // #endregion Private methods (1)
 };
-Ue = new WeakMap(), N = new WeakMap(), pt = new WeakSet(), ti = function(e, t) {
+Ue = new WeakMap(), E = new WeakMap(), dt = new WeakSet(), ti = function(e, t) {
   const i = Jt(e), n = Jt(t), l = Object.keys(i).filter((c) => Object.hasOwn(n, c)).map((c) => {
-    const d = i[c].reduce((g, E) => g.add(E.power), new u("0")), f = n[c].reduce((g, E) => g.add(E.power), new u("0"));
+    const d = i[c].reduce((g, N) => g.add(N.power), new u("0")), f = n[c].reduce((g, N) => g.add(N.power), new u("0"));
     return new le(c, u.min(d, f));
   });
   return new me(...l);
-}, p(me, pt);
+}, p(me, dt);
 let ei = me;
 function Jt(o) {
   const e = new u().one(), t = o.factors.reduce((i, n) => {
@@ -2301,8 +2278,6 @@ const xe = class xe {
     p(this, M);
     // Signe of the equation
     p(this, se);
-    // #endregion Constructors (3)
-    // #region Properties and methods (26)
     // ------------------------------------------
     a(this, "parse", (e) => {
       const t = s(this, zt).call(this, e);
@@ -2401,10 +2376,8 @@ const xe = class xe {
      */
     a(this, "simplify", () => (this.multiply(G.lcm(...s(this, O).getDenominators(), ...s(this, M).getDenominators())), this.divide(G.gcd(...s(this, O).getNumerators(), ...s(this, M).getNumerators())), this));
     // -----------------------------------------------
-    a(this, "solve", () => new Et(this.clone()).solve());
+    a(this, "solve", () => new xt(this.clone()).solve());
     a(this, "test", (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e)));
-    // #endregion Getters And Setters (13)
-    // #region Private methods (6)
     p(this, zt, (e) => {
       if (e.includes("geq"))
         return e.includes("\\geq") ? "\\geq" : "geq";
@@ -2491,8 +2464,6 @@ const xe = class xe {
     const i = [], n = e.filter((r) => i.includes(r.tex) ? !1 : (i.push(r.tex), !0));
     return t === !0 && n.sort((r, l) => r.value - l.value), n;
   }
-  // #endregion Properties and methods (26)
-  // #region Getters And Setters (13)
   get display() {
     return `${s(this, O).display}${this.signAsTex}${s(this, M).display}`;
   }
@@ -2528,7 +2499,6 @@ const xe = class xe {
   get variables() {
     return [...new Set(s(this, M).variables.concat(s(this, O).variables))];
   }
-  // #endregion Private methods (6)
 };
 O = new WeakMap(), M = new WeakMap(), se = new WeakMap(), zt = new WeakMap(), tt = new WeakMap(), Lt = new WeakMap();
 let H = xe;
@@ -2705,12 +2675,12 @@ const Xe = class Xe {
 };
 z = new WeakMap(), Ce = new WeakMap(), Dt = new WeakMap(), Vt = new WeakMap();
 let ii = Xe;
-function Ji(o, e) {
+function Ki(o, e) {
   return o.dimension === e.dimension && o.array.every(
     (t, i) => e.array[i].isEqual(t)
   );
 }
-function _i(o, e) {
+function Ji(o, e) {
   if (o.dimension !== e.dimension)
     return !1;
   const t = e.array[0].value / o.array[0].value;
@@ -2718,13 +2688,13 @@ function _i(o, e) {
     (i, n) => e.array[n].value === i.value * t
   );
 }
-function es(o, e) {
+function _i(o, e) {
   return o.dimension !== e.dimension ? new u().invalid() : o.array.reduce(
     (t, i, n) => t.add(i.clone().multiply(e.array[n])),
     new u(0)
   );
 }
-function ts(...o) {
+function es(...o) {
   return o.some((e) => e.dimension !== o[0].dimension) ? new u().invalid() : o[0].dimension === 2 && o.length !== 2 ? new u().invalid() : o[0].dimension === 3 && o.length !== 3 ? new u().invalid() : o[0].dimension === 2 ? o[0].array[0].clone().multiply(o[1].array[1]).subtract(o[0].array[1].clone().multiply(o[1].array[0])) : o[0].array[0].clone().multiply(
     o[1].array[1].clone().multiply(o[2].array[2]).subtract(o[1].array[2].clone().multiply(o[2].array[1]))
   ).subtract(
@@ -2734,7 +2704,7 @@ function ts(...o) {
   ).add(o[0].array[2].clone().multiply(o[1].array[0].clone().multiply(o[2].array[1]).subtract(o[1].array[1].clone().multiply(o[2].array[0]))));
 }
 var F, Le;
-const Se = class Se {
+const Be = class Be {
   constructor(...e) {
     p(this, F, []);
     p(this, Le, !1);
@@ -2747,15 +2717,15 @@ const Se = class Se {
       const e = this.norm;
       return e === 0 ? this : this.divideByScalar(e);
     });
-    a(this, "dot", (e) => es(this, e));
+    a(this, "dot", (e) => _i(this, e));
     a(this, "normal", () => {
       if (this.dimension >= 3)
         throw new Error("Normal vector can only be determined in 2D");
       const e = this.x.clone().opposite(), t = this.y.clone();
       return s(this, F)[0] = t, s(this, F)[1] = e, this;
     });
-    a(this, "isEqual", (e) => Ji(this, e));
-    a(this, "isColinearTo", (e) => _i(this, e));
+    a(this, "isEqual", (e) => Ki(this, e));
+    a(this, "isColinearTo", (e) => Ji(this, e));
     a(this, "isNormalTo", (e) => this.dot(e).isZero());
     a(this, "multiplyByScalar", (e) => {
       const t = new u(e);
@@ -2861,7 +2831,7 @@ const Se = class Se {
     if (e.length === 0)
       throw new Error("Invalid value");
     if (e.length === 1) {
-      if (e[0] instanceof Se)
+      if (e[0] instanceof Be)
         return e[0].clone();
       if (typeof e[0] == "string")
         return this.fromString(e[0]);
@@ -2869,7 +2839,7 @@ const Se = class Se {
     }
     if (e.length === 2) {
       const [t, i] = e;
-      if (t instanceof Se && i instanceof Se) {
+      if (t instanceof Be && i instanceof Be) {
         if (t.dimension !== i.dimension)
           throw new Error("Vectors must have the same dimension");
         return h(this, F, i.array.map((n, r) => n.clone().subtract(t.array[r]))), this;
@@ -2878,7 +2848,7 @@ const Se = class Se {
     return h(this, F, e.map((t) => new u(t))), this;
   }
   clone() {
-    const e = new Se();
+    const e = new Be();
     return e.array = this.copy(), e.asPoint = this.asPoint, e;
   }
   copy() {
@@ -2897,7 +2867,7 @@ const Se = class Se {
   cross(e) {
     if (this.dimension !== 3 || e.dimension !== 3)
       throw new Error("Cross product can only be determined in 3D");
-    return new Se(
+    return new Be(
       this.y.clone().multiply(e.z).subtract(this.z.clone().multiply(e.y)),
       this.z.clone().multiply(e.x).subtract(this.x.clone().multiply(e.z)),
       this.x.clone().multiply(e.y).subtract(this.y.clone().multiply(e.x))
@@ -2910,7 +2880,7 @@ const Se = class Se {
     return this.array.every((e, t) => t === 0 ? e.isOne() : e.isZero());
   }
   distanceTo(e) {
-    const t = new Se(this, e);
+    const t = new Be(this, e);
     return {
       value: t.norm,
       fraction: t.normSquare,
@@ -2919,7 +2889,7 @@ const Se = class Se {
   }
 };
 F = new WeakMap(), Le = new WeakMap();
-let x = Se;
+let x = Be;
 function Ni(o = 0.5) {
   return Math.random() < o;
 }
@@ -2940,11 +2910,11 @@ function fe(o, e, t) {
 function Y(o, e) {
   return e === !1 ? Ni() ? fe(1, o) : -fe(1, o) : fe(-o, o);
 }
-function is(o) {
+function ts(o) {
   let e = G.primes();
   return o !== void 0 && (e = e.filter((t) => t < o)), ci(e);
 }
-function ss(o, e) {
+function is(o, e) {
   return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : Ti(o).slice(0, e);
 }
 function ci(o) {
@@ -2984,7 +2954,7 @@ class V extends x {
     return e.array = this.copy(), e.asPoint = !0, e;
   }
 }
-var Oi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(Oi || {}), $e, S, B, U, ne, Q, Ie, ve;
+var Oi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(Oi || {}), $e, B, S, U, ne, Q, Ie, ve;
 const Ve = class Ve {
   /**
    * Value can be a mix of:
@@ -2994,8 +2964,8 @@ const Ve = class Ve {
   constructor(...e) {
     p(this, $e);
     // ax + by + c = 0
-    p(this, S);
     p(this, B);
+    p(this, S);
     p(this, U);
     p(this, ne);
     p(this, Q);
@@ -3081,7 +3051,7 @@ const Ve = class Ve {
         e.left.monomByDegree(0).coefficient
       );
     });
-    a(this, "fromCoefficient", (e, t, i) => (h(this, S, new u(e)), h(this, B, new u(t)), h(this, U, new u(i)), h(this, Q, new x(s(this, B).clone(), s(this, S).clone().opposite())), h(this, ne, new x(new u().zero(), s(this, U).clone())), h(this, Ie, s(this, Q).clone().normal()), this));
+    a(this, "fromCoefficient", (e, t, i) => (h(this, B, new u(e)), h(this, S, new u(t)), h(this, U, new u(i)), h(this, Q, new x(s(this, S).clone(), s(this, B).clone().opposite())), h(this, ne, new x(new u().zero(), s(this, U).clone())), h(this, Ie, s(this, Q).clone().normal()), this));
     a(this, "fromPointAndDirection", (e, t) => (this.fromCoefficient(
       t.y,
       t.x.clone().opposite(),
@@ -3093,22 +3063,22 @@ const Ve = class Ve {
       e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()
     ));
     a(this, "fromPointAndLine", (e, t, i) => (i === void 0 && (i = "parallel"), i === "parallel" ? this.fromPointAndNormal(e, t.normal) : i === "perpendicular" ? this.fromPointAndNormal(e, t.director) : this));
-    a(this, "clone", () => (h(this, S, s(this, S).clone()), h(this, B, s(this, B).clone()), h(this, U, s(this, U).clone()), h(this, Q, s(this, Q).clone()), h(this, ne, s(this, ne).clone()), h(this, Ie, s(this, Ie).clone()), this));
+    a(this, "clone", () => (h(this, B, s(this, B).clone()), h(this, S, s(this, S).clone()), h(this, U, s(this, U).clone()), h(this, Q, s(this, Q).clone()), h(this, ne, s(this, ne).clone()), h(this, Ie, s(this, Ie).clone()), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
-    a(this, "isOnLine", (e) => s(this, S).clone().multiply(e.x).add(
-      s(this, B).clone().multiply(e.y)
+    a(this, "isOnLine", (e) => s(this, B).clone().multiply(e.x).add(
+      s(this, S).clone().multiply(e.y)
     ).add(s(this, U)).isZero());
     a(this, "isParallelTo", (e) => this.slope.isEqual(e.slope) && this.height.isNotEqual(e.height));
     a(this, "isSameAs", (e) => this.slope.isEqual(e.slope) && this.height.isEqual(e.height));
     a(this, "isPerpendicularTo", (e) => this.d.isNormalTo(e.d));
     a(this, "isVertical", () => this.slope.isInfinity());
     a(this, "simplify", () => {
-      const e = G.lcm(s(this, S).denominator, s(this, B).denominator, s(this, U).denominator), t = G.gcd(s(this, S).numerator, s(this, B).numerator, s(this, U).numerator);
+      const e = G.lcm(s(this, B).denominator, s(this, S).denominator, s(this, U).denominator), t = G.gcd(s(this, B).numerator, s(this, S).numerator, s(this, U).numerator);
       return this.fromCoefficient(
-        s(this, S).clone().multiply(e).divide(t),
         s(this, B).clone().multiply(e).divide(t),
+        s(this, S).clone().multiply(e).divide(t),
         s(this, U).clone().multiply(e).divide(t)
       ), this;
     });
@@ -3116,7 +3086,7 @@ const Ve = class Ve {
     a(this, "intersection", (e) => {
       const t = new V();
       let i = !1, n = !1;
-      return s(this, B).isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new u().invalid(), t.y = new u().invalid(), i = !0) : this.isSameAs(e) ? (t.x = new u().invalid(), t.y = new u().invalid(), n = !0) : (t.x = s(this, B).clone().multiply(e.c).subtract(s(this, U).clone().multiply(e.b)).divide(s(this, S).clone().multiply(e.b).subtract(s(this, B).clone().multiply(e.a))), t.y = s(this, S).clone().multiply(e.c).subtract(s(this, U).clone().multiply(e.a)).divide(s(this, B).clone().multiply(e.a).subtract(s(this, S).clone().multiply(e.b)))), {
+      return s(this, S).isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new u().invalid(), t.y = new u().invalid(), i = !0) : this.isSameAs(e) ? (t.x = new u().invalid(), t.y = new u().invalid(), n = !0) : (t.x = s(this, S).clone().multiply(e.c).subtract(s(this, U).clone().multiply(e.b)).divide(s(this, B).clone().multiply(e.b).subtract(s(this, S).clone().multiply(e.a))), t.y = s(this, B).clone().multiply(e.c).subtract(s(this, U).clone().multiply(e.a)).divide(s(this, S).clone().multiply(e.a).subtract(s(this, B).clone().multiply(e.b)))), {
         point: t,
         hasIntersection: !(i || n),
         isParallel: i,
@@ -3131,21 +3101,21 @@ const Ve = class Ve {
       const t = this.getEquation().isolate("x"), i = new u(e);
       return t instanceof H ? t.right.evaluate({ y: i }) : new u().invalid();
     });
-    return h(this, S, new u().zero()), h(this, B, new u().zero()), h(this, U, new u().zero()), h(this, ne, new x()), h(this, Q, new x()), h(this, Ie, new x()), h(this, $e, !0), e.length > 0 && this.parse(...e), this;
+    return h(this, B, new u().zero()), h(this, S, new u().zero()), h(this, U, new u().zero()), h(this, ne, new x()), h(this, Q, new x()), h(this, Ie, new x()), h(this, $e, !0), e.length > 0 && this.parse(...e), this;
   }
   get a() {
-    return s(this, S);
+    return s(this, B);
   }
   // ------------------------------------------
   // Getter and setter
   set a(e) {
-    h(this, S, e);
+    h(this, B, e);
   }
   get b() {
-    return s(this, B);
+    return s(this, S);
   }
   set b(e) {
-    h(this, B, e);
+    h(this, S, e);
   }
   get c() {
     return s(this, U);
@@ -3170,7 +3140,7 @@ const Ve = class Ve {
   }
   // ------------------------------------------
   getEquation() {
-    const e = new H(new A().parse("xy", s(this, S), s(this, B), s(this, U)), new A("0"));
+    const e = new H(new A().parse("xy", s(this, B), s(this, S), s(this, U)), new A("0"));
     return s(this, $e) ? e.simplify() : e;
   }
   // get system(): { x: Equation, y: Equation } {
@@ -3218,7 +3188,7 @@ const Ve = class Ve {
       }
       default: {
         const t = this.getEquation();
-        return s(this, S).isNegative() && t.multiply(-1), t.tex;
+        return s(this, B).isNegative() && t.multiply(-1), t.tex;
       }
     }
   }
@@ -3241,27 +3211,27 @@ const Ve = class Ve {
       }
       default: {
         const t = this.getEquation();
-        return s(this, S).isNegative() && t.multiply(-1), t.display;
+        return s(this, B).isNegative() && t.multiply(-1), t.display;
       }
     }
   }
   get normal() {
-    return new x(s(this, S), s(this, B));
+    return new x(s(this, B), s(this, S));
   }
   get director() {
     return s(this, Q).clone();
   }
   get slope() {
-    return s(this, S).clone().opposite().divide(s(this, B));
+    return s(this, B).clone().opposite().divide(s(this, S));
   }
   get height() {
-    return s(this, U).clone().opposite().divide(s(this, B));
+    return s(this, U).clone().opposite().divide(s(this, S));
   }
   fromPoints(e, t) {
     return this.fromPointAndDirection(e, new x(e, t));
   }
   distanceTo(e) {
-    const t = e.x.clone().multiply(s(this, S)).add(e.y.clone().multiply(s(this, B))).add(s(this, U)).abs(), i = this.normal.normSquare;
+    const t = e.x.clone().multiply(s(this, B)).add(e.y.clone().multiply(s(this, S))).add(s(this, U)).abs(), i = this.normal.normSquare;
     if (i.isZero())
       return {
         value: NaN,
@@ -3291,13 +3261,13 @@ const Ve = class Ve {
   canonicalAsFloatCoefficient(e) {
     e === void 0 && (e = 2);
     let t = "";
-    return s(this, S).isZero() || (s(this, S).isOne() ? t = "x" : s(this, S).clone().opposite().isOne() ? t = "-x" : t = s(this, S).value.toFixed(e) + "x"), s(this, B).isZero() || (s(this, B).isPositive() && (t += "+"), t += s(this, B).value.toFixed(e) + "y"), s(this, U).isZero() || (s(this, U).isPositive() && (t += "+"), t += s(this, U).value.toFixed(e)), t + "=0";
+    return s(this, B).isZero() || (s(this, B).isOne() ? t = "x" : s(this, B).clone().opposite().isOne() ? t = "-x" : t = s(this, B).value.toFixed(e) + "x"), s(this, S).isZero() || (s(this, S).isPositive() && (t += "+"), t += s(this, S).value.toFixed(e) + "y"), s(this, U).isZero() || (s(this, U).isPositive() && (t += "+"), t += s(this, U).value.toFixed(e)), t + "=0";
   }
 };
-$e = new WeakMap(), S = new WeakMap(), B = new WeakMap(), U = new WeakMap(), ne = new WeakMap(), Q = new WeakMap(), Ie = new WeakMap(), ve = new WeakMap(), // A line is defined as the canonical form
+$e = new WeakMap(), B = new WeakMap(), S = new WeakMap(), U = new WeakMap(), ne = new WeakMap(), Q = new WeakMap(), Ie = new WeakMap(), ve = new WeakMap(), // A line is defined as the canonical form
 a(Ve, "PERPENDICULAR", "perpendicular"), a(Ve, "PARALLEL", "parallel");
 let D = Ve;
-var re, j, Oe, Zt, Ft, jt, oe, Ai, xt, qi, Mi, ki, si;
+var re, j, Oe, Zt, Ft, jt, oe, Ai, bt, qi, Mi, ki, si;
 const Ut = class Ut {
   constructor(...e) {
     p(this, oe);
@@ -3398,10 +3368,10 @@ const Ut = class Ut {
     );
   }
   setRadius(e, t) {
-    return t ? h(this, j, new u(e)) : h(this, j, new u(e).pow(2)), q(this, oe, xt).call(this), this;
+    return t ? h(this, j, new u(e)) : h(this, j, new u(e).pow(2)), q(this, oe, bt).call(this), this;
   }
   parse(...e) {
-    return q(this, oe, Ai).call(this), typeof e[0] == "string" ? q(this, oe, si).call(this, new H(e[0])) : e[0] instanceof H ? q(this, oe, si).call(this, e[0]) : e[0] instanceof Ut ? q(this, oe, qi).call(this, e[0]) : e[0] instanceof V && e.length > 1 && (e[1] instanceof V ? e[2] instanceof V || q(this, oe, ki).call(this, e[0], e[1]) : (e[1] instanceof u || typeof e[1] == "number") && q(this, oe, Mi).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), q(this, oe, xt).call(this), this;
+    return q(this, oe, Ai).call(this), typeof e[0] == "string" ? q(this, oe, si).call(this, new H(e[0])) : e[0] instanceof H ? q(this, oe, si).call(this, e[0]) : e[0] instanceof Ut ? q(this, oe, qi).call(this, e[0]) : e[0] instanceof V && e.length > 1 && (e[1] instanceof V ? e[2] instanceof V || q(this, oe, ki).call(this, e[0], e[1]) : (e[1] instanceof u || typeof e[1] == "number") && q(this, oe, Mi).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), q(this, oe, bt).call(this), this;
   }
   // private _parseThroughtThreePoints(A: Point, B: Point, C: Point): this {
   //     const T = new Triangle(A, B, C), mAB = T.remarquables.mediators.AB.clone(),
@@ -3412,13 +3382,13 @@ const Ut = class Ut {
 };
 re = new WeakMap(), j = new WeakMap(), Oe = new WeakMap(), Zt = new WeakMap(), Ft = new WeakMap(), jt = new WeakMap(), oe = new WeakSet(), Ai = function() {
   return h(this, re, void 0), h(this, j, void 0), h(this, Oe, void 0), this;
-}, xt = function() {
+}, bt = function() {
   h(this, Oe, new H(
     new A(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
     new A(this.squareRadius.display)
   ).moveLeft());
 }, qi = function(e) {
-  return h(this, re, e.center.clone()), h(this, j, e.squareRadius.clone()), q(this, oe, xt).call(this), this;
+  return h(this, re, e.center.clone()), h(this, j, e.squareRadius.clone()), q(this, oe, bt).call(this), this;
 }, Mi = function(e, t, i) {
   return h(this, re, e.clone()), i ? h(this, j, new u(t)) : h(this, j, new u(t).pow(2)), this;
 }, ki = function(e, t) {
@@ -3431,8 +3401,8 @@ re = new WeakMap(), j = new WeakMap(), Oe = new WeakMap(), Zt = new WeakMap(), F
   }
   return this;
 };
-let Nt = Ut;
-var X, K, J, it, Ae, mt, Gt, gt, Pe, Wt, st;
+let Et = Ut;
+var X, K, J, it, Ae, pt, Gt, mt, Pe, Wt, st;
 const Ht = class Ht {
   constructor(...e) {
     p(this, X);
@@ -3440,7 +3410,7 @@ const Ht = class Ht {
     p(this, J);
     p(this, it);
     p(this, Ae);
-    p(this, mt);
+    p(this, pt);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
@@ -3510,13 +3480,13 @@ const Ht = class Ht {
         AB: new V().middleOf(s(this, X), s(this, K)),
         AC: new V().middleOf(s(this, X), s(this, J)),
         BC: new V().middleOf(s(this, K), s(this, J))
-      }), h(this, mt, s(this, Wt).call(this));
+      }), h(this, pt, s(this, Wt).call(this));
     });
     /**
      * Get the Vector2D class for the given name
      * @param ptName
      */
-    p(this, gt, (e) => {
+    p(this, mt, (e) => {
       switch (e.toUpperCase()) {
         case "A":
           return s(this, X);
@@ -3533,8 +3503,8 @@ const Ht = class Ht {
      * @param ptName2
      */
     p(this, Pe, (e, t) => new x(
-      s(this, gt).call(this, e),
-      s(this, gt).call(this, t)
+      s(this, mt).call(this, e),
+      s(this, mt).call(this, t)
     ));
     p(this, Wt, () => {
       const e = {
@@ -3624,10 +3594,10 @@ const Ht = class Ht {
     return s(this, it);
   }
   get remarquables() {
-    return s(this, mt);
+    return s(this, pt);
   }
 };
-X = new WeakMap(), K = new WeakMap(), J = new WeakMap(), it = new WeakMap(), Ae = new WeakMap(), mt = new WeakMap(), Gt = new WeakMap(), gt = new WeakMap(), Pe = new WeakMap(), Wt = new WeakMap(), st = new WeakMap();
+X = new WeakMap(), K = new WeakMap(), J = new WeakMap(), it = new WeakMap(), Ae = new WeakMap(), pt = new WeakMap(), Gt = new WeakMap(), mt = new WeakMap(), Pe = new WeakMap(), Wt = new WeakMap(), st = new WeakMap();
 let ni = Ht;
 var R, W;
 const at = class at {
@@ -3738,7 +3708,7 @@ const at = class at {
 };
 R = new WeakMap(), W = new WeakMap(), // A line is defined as the canonical form
 a(at, "PERPENDICULAR", "perpendicular"), a(at, "PARALLEL", "parallel");
-let Tt = at;
+let Nt = at;
 var qe, Ge;
 const fi = class fi {
   constructor(e) {
@@ -3833,7 +3803,7 @@ const fi = class fi {
 qe = new WeakMap(), Ge = new WeakMap();
 let ri = fi;
 var Me;
-class ns {
+class ss {
   constructor(...e) {
     p(this, Me, []);
     return h(this, Me, e), this;
@@ -3853,11 +3823,11 @@ class ns {
   determinant() {
     if (!this.isSquare())
       throw new Error("Matrix is not square");
-    return ts(...this.values);
+    return es(...this.values);
   }
 }
 Me = new WeakMap();
-function Ot(o) {
+function Tt(o) {
   const e = Object.assign(
     {
       negative: !0,
@@ -3887,7 +3857,7 @@ function Ci(o) {
     },
     o
   ), t = new k();
-  if (t.coefficient = Ot({
+  if (t.coefficient = Tt({
     zero: e.zero,
     reduced: !0,
     natural: !e.fraction
@@ -3902,7 +3872,7 @@ function Ci(o) {
     t.setLetter(e.letters, e.degree);
   return t;
 }
-const rs = {
+const ns = {
   letters: "x",
   degree: 2,
   fraction: !1,
@@ -3915,7 +3885,7 @@ const rs = {
 };
 function $i(o) {
   const e = Object.assign(
-    rs,
+    ns,
     o
   ), t = new A().empty();
   let i;
@@ -3933,7 +3903,7 @@ function $i(o) {
     }
   return t;
 }
-function os(o) {
+function rs(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -3975,10 +3945,10 @@ function oi(o) {
       quadrant: null
     },
     o
-  ), t = e.axis === "x", i = e.axis === "y", n = e.fraction ? Ot({ max: e.max, zero: t }) : new u(Y(e.max, t)), r = e.fraction ? Ot({ max: e.max, zero: i }) : new u(Y(e.max, i));
+  ), t = e.axis === "x", i = e.axis === "y", n = e.fraction ? Tt({ max: e.max, zero: t }) : new u(Y(e.max, t)), r = e.fraction ? Tt({ max: e.max, zero: i }) : new u(Y(e.max, i));
   return Number(e.quadrant) === 1 && (n.abs(), r.abs()), Number(e.quadrant) === 2 && (n.isPositive() && n.opposite(), r.isNegative() && r.opposite()), Number(e.quadrant) === 3 && (n.isPositive() && n.opposite(), r.isPositive() && r.opposite()), Number(e.quadrant) === 4 && (n.isNegative() && n.opposite(), r.isPositive() && r.opposite()), new V(n, r);
 }
-function hs(o) {
+function os(o) {
   const e = Object.assign(
     {
       center: {
@@ -3990,9 +3960,9 @@ function hs(o) {
     o
   ), t = oi(e.center);
   let i, n;
-  return e.pointsOnCircle === 8 ? (i = fe(1, 3), n = i ** 2 + (i + 1) ** 2) : n = fe(1, 20), new Nt(t, n, !0);
+  return e.pointsOnCircle === 8 ? (i = fe(1, 3), n = i ** 2 + (i + 1) ** 2) : n = fe(1, 20), new Et(t, n, !0);
 }
-function as(o) {
+function hs(o) {
   const e = Object.assign(
     {
       A: {
@@ -4009,7 +3979,7 @@ function as(o) {
     t.x = Y(10), t.y = Y(10);
   return e.slope === 1 ? t.x.sign() !== t.y.sign() && t.y.opposite() : e.slope === -1 && t.x.sign() !== t.y.sign() && t.y.opposite(), new D(new x(e.A.x, e.A.y), t);
 }
-function ls(o) {
+function as(o) {
   const e = Object.assign(
     {
       A: {
@@ -4025,37 +3995,37 @@ function ls(o) {
     },
     o
   ), t = new V(e.A.x, e.A.y, e.A.z), i = new x(e.direction.x, e.direction.y, e.direction.z);
-  return new Tt(t, i);
+  return new Nt(t, i);
 }
-const cs = {
-  equation: (o) => os(o),
+const ls = {
+  equation: (o) => rs(o),
   polynom: (o) => $i(o),
   monom: (o) => Ci(o),
-  fraction: (o) => Ot(o),
+  fraction: (o) => Tt(o),
   number: (o, e, t) => fe(o, e, t),
   numberSym: (o, e) => Y(o, e),
-  prime: (o) => is(o),
+  prime: (o) => ts(o),
   bool: (o) => Ni(o),
-  array: (o, e) => ss(o, e),
+  array: (o, e) => is(o, e),
   item: (o) => ci(o),
   shuffle: (o) => Ti(o),
-  line: (o) => as(o),
-  line3: (o) => ls(o),
+  line: (o) => hs(o),
+  line3: (o) => as(o),
   vector: (o) => oi(o),
   point: (o) => {
     const e = oi(o);
     return e.asPoint = !0, e;
   },
-  circle: (o) => hs(o)
+  circle: (o) => os(o)
 };
-var ke, yt, hi;
-class us {
+var ke, gt, hi;
+class cs {
   /**
    *
    * @param {string} value (optional) Default polynom to parse on class creation
    */
   constructor(e) {
-    p(this, yt);
+    p(this, gt);
     p(this, ke);
     a(this, "parse", (e) => (h(this, ke, new Xt(Ze.SET).parse(e).rpn), this));
     return h(this, ke, []), e !== void 0 && this.parse(e), this;
@@ -4134,20 +4104,20 @@ class us {
     return s(this, ke).filter((e) => e.tokenType === "variable").map((e) => e.token);
   }
   vennAB() {
-    return q(this, yt, hi).call(this, {
+    return q(this, gt, hi).call(this, {
       A: ["A", "AB"],
       B: ["B", "AB"]
     }, ["A", "B", "AB", "E"]);
   }
   vennABC() {
-    return q(this, yt, hi).call(this, {
+    return q(this, gt, hi).call(this, {
       A: ["A", "AB", "AC", "ABC"],
       B: ["B", "AB", "BC", "ABC"],
       C: ["C", "AC", "BC", "ABC"]
     }, ["A", "B", "C", "AB", "AC", "BC", "ABC", "E"]);
   }
 }
-ke = new WeakMap(), yt = new WeakSet(), hi = function(e, t) {
+ke = new WeakMap(), gt = new WeakSet(), hi = function(e, t) {
   const i = [];
   let n;
   if (t === void 0) {
@@ -4191,30 +4161,30 @@ ke = new WeakMap(), yt = new WeakSet(), hi = function(e, t) {
       }
   return [...i[0]].sort();
 };
-const fs = {
+const us = {
   Vector: x,
   Point: V,
   Line: D,
   Triangle: ni,
-  Circle: Nt,
-  Line3: Tt,
+  Circle: Et,
+  Line3: Nt,
   Plane3: ri
-}, ps = {
+}, ds = {
   Numeric: G,
   Fraction: u,
-  Root: wt,
+  Root: yt,
   Monom: k,
   Polynom: A,
   Equation: H,
-  Matrix: ns,
+  Matrix: ss,
   LinearSystem: ii,
   Factor: le,
   PolyFactor: ei,
-  LogicalSet: us,
-  Random: cs,
-  Geometry: fs,
+  LogicalSet: cs,
+  Random: ls,
+  Geometry: us,
   NumExp: Qi
 };
 export {
-  ps as default
+  ds as default
 };