pimath 0.1.36 → 0.1.38

package/dist/pimath.js

@@ -1,81 +1,81 @@
-function ve(n) {
-  const e = ce(n), t = [];
+function le(r) {
+  const e = ie(r), t = [];
   let i, s;
   for (; e.length > 0; )
     i = e.shift() ?? 1, s = (e.length > 0 ? e.pop() : +i) ?? 1, t.push([i, s]);
   return t;
 }
-function be(...n) {
-  const e = ne(...n);
-  return n.map((t) => t / e);
+function ce(...r) {
+  const e = K(...r);
+  return r.map((t) => t / e);
 }
-function ce(n) {
-  const e = Math.abs(n), t = Math.sqrt(e), i = [];
+function ie(r) {
+  const e = Math.abs(r), t = Math.sqrt(e), i = [];
   for (let s = 1; s <= t; s++)
-    n % s === 0 && (i.push(s), i.push(e / s));
-  return i.sort(function(s, r) {
-    return s - r;
+    r % s === 0 && (i.push(s), i.push(e / s));
+  return i.sort(function(s, n) {
+    return s - n;
   }), [...new Set(i)];
 }
-function ne(...n) {
-  const e = function(s, r) {
-    return r === 0 ? s : e(r, s % r);
+function K(...r) {
+  const e = function(s, n) {
+    return n === 0 ? s : e(n, s % n);
   };
   let t = 1, i = 2;
-  if (n.length === 0)
+  if (r.length === 0)
     return 1;
-  if (n.length === 1)
-    return n[0] === 0 ? 1 : n[0];
-  if (t = e(n[0], n[1]), t === 1)
+  if (r.length === 1)
+    return r[0] === 0 ? 1 : r[0];
+  if (t = e(r[0], r[1]), t === 1)
     return 1;
-  for (i = 2; i < n.length && (t = e(t, n[i]), t !== 1); i++)
+  for (i = 2; i < r.length && (t = e(t, r[i]), t !== 1); i++)
     ;
   return Math.abs(t);
 }
-function xe(...n) {
-  return n.reduce(function(e, t) {
-    return Math.abs(e * t / ne(e, t));
+function ue(...r) {
+  return r.reduce(function(e, t) {
+    return Math.abs(e * t / K(e, t));
   });
 }
-function Ee(n, e = 3) {
-  return +n.toFixed(e);
+function fe(r, e = 3) {
+  return +r.toFixed(e);
 }
-function Ne(n) {
-  if (Number.isSafeInteger(n) || n.toString().split(".")[0].length < 10)
+function de(r) {
+  if (Number.isSafeInteger(r) || r.toString().split(".")[0].length < 10)
     return 0;
   throw new Error("Periodic value: Not implemented yet");
 }
-function Ae(n) {
+function pe(r) {
   const e = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973];
-  return n === void 0 ? e : e.slice(0, Math.min(e.length, n));
+  return r === void 0 ? e : e.slice(0, Math.min(e.length, r));
 }
-function qe(n, e) {
-  const t = [], i = e === !0 ? +n : n ** 2;
-  for (let s = 0; s <= n; s++)
-    for (let r = 0; r <= n; r++)
-      s ** 2 + r ** 2 === i && t.push([s, r, n]);
+function me(r, e) {
+  const t = [], i = e === !0 ? +r : r ** 2;
+  for (let s = 0; s <= r; s++)
+    for (let n = 0; n <= r; n++)
+      s ** 2 + n ** 2 === i && t.push([s, n, r]);
   return t;
 }
-function Te(n, e = 2) {
-  return +`${Math.round(+`${n}e${e}`)}e-${e}`;
+function ge(r, e = 2) {
+  return +`${Math.round(+`${r}e${e}`)}e-${e}`;
 }
 const E = {
-  decompose: ve,
-  dividers: ce,
-  divideNumbersByGCD: be,
-  gcd: ne,
-  lcm: xe,
-  numberCorrection: Ee,
-  periodic: Ne,
-  primes: Ae,
-  pythagoreanTripletsWithTarget: qe,
-  round: Te
+  decompose: le,
+  dividers: ie,
+  divideNumbersByGCD: ce,
+  gcd: K,
+  lcm: ue,
+  numberCorrection: fe,
+  periodic: de,
+  primes: pe,
+  pythagoreanTripletsWithTarget: me,
+  round: ge
 };
-var Oe = /* @__PURE__ */ ((n) => (n.frac = "frac", n.dfrac = "dfrac", n.tfrac = "tfrac", n))(Oe || {});
+var we = /* @__PURE__ */ ((r) => (r.frac = "frac", r.dfrac = "dfrac", r.tfrac = "tfrac", r))(we || {});
 class a {
-  #t = !1;
+  #i = !1;
   #e = 1;
-  #i = 1;
+  #t = 1;
   #s = "frac";
   constructor(e, t) {
     return e !== void 0 && this.parse(e, t), this;
@@ -89,37 +89,37 @@ class a {
   parse = (e, t) => {
     let i;
     if (e === "")
-      return this.#i = 0, this.#e = 1, this;
+      return this.#t = 0, this.#e = 1, this;
     switch (typeof e) {
       case "string":
-        if (i = e.split("/"), i.length > 2 && (this.#i = NaN), i.map((s) => s === "" || isNaN(Number(s))).includes(!0) && (this.#i = NaN), i.length === 1)
+        if (i = e.split("/"), i.length > 2 && (this.#t = NaN), i.map((s) => s === "" || isNaN(Number(s))).includes(!0) && (this.#t = NaN), i.length === 1)
           return this.parse(+i[0]);
-        i.length === 2 ? i[1] === "0" ? (this.#i = NaN, this.#e = 1) : (this.#i = +i[0], this.#e = +i[1]) : (this.#i = NaN, this.#e = 1);
+        i.length === 2 ? i[1] === "0" ? (this.#t = NaN, this.#e = 1) : (this.#t = +i[0], this.#e = +i[1]) : (this.#t = NaN, this.#e = 1);
         break;
       case "number":
         if (Number.isSafeInteger(e))
-          this.#i = +e, t === void 0 || !Number.isSafeInteger(t) ? this.#e = 1 : this.#e = +t;
+          this.#t = +e, t === void 0 || !Number.isSafeInteger(t) ? this.#e = 1 : this.#e = +t;
         else {
-          const [, s] = e.toString().split("."), r = s ? s.length : 0, o = Math.pow(10, r);
-          t === void 0 ? (this.#i = e * o, this.#e = o) : Number.isSafeInteger(t) && (this.#i = e * o - Math.floor(e * Math.pow(10, r - t)), this.denominator = o - Math.pow(10, r - t)), this.#i = E.numberCorrection(this.#i), this.#e = E.numberCorrection(this.#e), this.reduce();
+          const [, s] = e.toString().split("."), n = s ? s.length : 0, o = Math.pow(10, n);
+          t === void 0 ? (this.#t = e * o, this.#e = o) : Number.isSafeInteger(t) && (this.#t = e * o - Math.floor(e * Math.pow(10, n - t)), this.denominator = o - Math.pow(10, n - t)), this.#t = E.numberCorrection(this.#t), this.#e = E.numberCorrection(this.#e), this.reduce();
         }
         break;
       case "object":
-        e instanceof a && (this.#i = +e.numerator, this.#e = +e.denominator);
+        e instanceof a && (this.#t = +e.numerator, this.#e = +e.denominator);
         break;
     }
     return this;
   };
   clone = () => {
     const e = new a();
-    return e.numerator = +this.#i, e.denominator = +this.#e, e;
+    return e.numerator = +this.#t, e.denominator = +this.#e, e;
   };
   // Display getter
   get tex() {
-    return this.isInfinity() ? `${this.sign() === 1 ? "+" : "-"}\\infty` : this.isExact() ? this.#e === 1 ? `${this.#i}` : this.#i < 0 ? `-\\${this.#s}{ ${-this.#i} }{ ${this.#e} }` : `\\${this.#s}{ ${this.#i} }{ ${this.#e} }` : this.value.toFixed(3);
+    return this.isInfinity() ? `${this.sign() === 1 ? "+" : "-"}\\infty` : this.isExact() ? this.#e === 1 ? `${this.#t}` : this.#t < 0 ? `-\\${this.#s}{ ${-this.#t} }{ ${this.#e} }` : `\\${this.#s}{ ${this.#t} }{ ${this.#e} }` : this.value.toFixed(3);
   }
   get display() {
-    return this.isExact() ? this.#e === 1 ? `${this.#i}` : `${this.#i}/${this.#e}` : this.value.toFixed(3);
+    return this.isExact() ? this.#e === 1 ? `${this.#t}` : `${this.#t}/${this.#e}` : this.value.toFixed(3);
   }
   static average = (...e) => {
     const t = new a().zero();
@@ -128,11 +128,11 @@ class a {
     return t.divide(e.length), t;
   };
   static isFraction(e) {
-    if (e instanceof a || typeof e == "number" && !isNaN(e))
+    if (e instanceof a || typeof e == "number" && !isNaN(+e))
       return !0;
     if (typeof e == "string") {
       const [t, i] = e.split("/");
-      return !isNaN(+t) && (i === void 0 || !isNaN(+i));
+      return !isNaN(+t) && !isNaN(+i);
     }
     return !1;
   }
@@ -155,7 +155,7 @@ class a {
     return t;
   };
   static sort = (e, t) => {
-    const s = e.map((r) => r instanceof a ? r : new a(r)).sort((r, o) => r.value - o.value);
+    const s = e.map((n) => n instanceof a ? n : new a(n)).sort((n, o) => n.value - o.value);
     return t && s.reverse(), s;
   };
   static unique = (e) => {
@@ -172,16 +172,16 @@ class a {
     }
     return t;
   };
-  abs = () => (this.#i = Math.abs(this.#i), this.#e = Math.abs(this.#e), this);
+  abs = () => (this.#t = Math.abs(this.#t), this.#e = Math.abs(this.#e), this);
   add = (e) => {
     if (e instanceof a) {
-      const t = this.#i, i = this.#e;
-      this.#i = t * e.denominator + e.numerator * i, this.#e = i * e.denominator;
+      const t = this.#t, i = this.#e;
+      this.#t = t * e.denominator + e.numerator * i, this.#e = i * e.denominator;
     } else
       return this.add(new a(e));
     return this.reduce();
   };
-  amplify = (e) => (Number.isSafeInteger(e) && (this.#i *= e, this.#e *= e), this);
+  amplify = (e) => (Number.isSafeInteger(e) && (this.#t *= e, this.#e *= e), this);
   /**
    * Simple function to determine if it's a fraction
    */
@@ -229,73 +229,73 @@ class a {
     const t = new a(e);
     if (t.numerator === 0)
       return new a().infinite();
-    const i = this.#i, s = this.#e;
-    return this.#i = i * t.denominator, this.#e = s * t.numerator, this.reduce();
+    const i = this.#t, s = this.#e;
+    return this.#t = i * t.denominator, this.#e = s * t.numerator, this.reduce();
   };
   get frac() {
     return this.#s = "frac", this;
   }
-  infinite = () => (this.#i = 1 / 0, this.#e = 1, this);
-  invalid = () => (this.#i = NaN, this.#e = 1, this);
+  infinite = () => (this.#t = 1 / 0, this.#e = 1, this);
+  invalid = () => (this.#t = NaN, this.#e = 1, this);
   inverse = () => {
-    const e = +this.#i;
-    return this.#i = +this.#e, this.#e = e, this;
+    const e = +this.#t;
+    return this.#t = +this.#e, this.#e = e, this;
   };
-  isApproximative = () => this.#t || this.#i.toString().length >= 15 && this.#e.toString().length >= 15;
+  isApproximative = () => this.#i || this.#t.toString().length >= 15 && this.#e.toString().length >= 15;
   isEqual = (e) => this.compare(e, "=");
   isEven = () => this.isRelative() && this.value % 2 === 0;
   isExact = () => !this.isApproximative();
   isFinite = () => !this.isInfinity() && !this.isNaN();
   isGeq = (e) => this.compare(e, ">=");
   isGreater = (e) => this.compare(e, ">");
-  isInfinity = () => Math.abs(this.#i) === 1 / 0;
+  isInfinity = () => Math.abs(this.#t) === 1 / 0;
   isInverted = (e) => this.isEqual(new a().one().divide(e.clone()));
   isLeq = (e) => this.compare(e, "<=");
   /* Compare shortcuts */
   isLesser = (e) => this.compare(e, "<");
-  isNaN = () => isNaN(this.#i);
+  isNaN = () => isNaN(this.#t);
   isNatural = () => this.isRelative() && this.isPositive();
   isNegative = () => this.sign() === -1;
-  isNegativeOne = () => this.#i === -1 && this.#e === 1;
+  isNegativeOne = () => this.#t === -1 && this.#e === 1;
   // ------------------------------------------
   isNotEqual = (e) => this.compare(e, "<>");
-  isNotZero = () => this.#i !== 0;
+  isNotZero = () => this.#t !== 0;
   isOdd = () => this.isRelative() && this.value % 2 === 1;
-  isOne = () => this.#i === 1 && this.#e === 1;
+  isOne = () => this.#t === 1 && this.#e === 1;
   isOpposite = (e) => this.isEqual(e.clone().opposite());
   isPositive = () => this.sign() === 1;
   isRational = () => !this.isRelative();
-  isReduced = () => Math.abs(E.gcd(this.#i, this.#e)) === 1;
+  isReduced = () => Math.abs(E.gcd(this.#t, this.#e)) === 1;
   isRelative = () => this.clone().reduce().denominator === 1;
-  isSquare = () => Math.sqrt(this.#i) % 1 === 0 && Math.sqrt(this.#e) % 1 === 0;
+  isSquare = () => Math.sqrt(this.#t) % 1 === 0 && Math.sqrt(this.#e) % 1 === 0;
   isStrictlyNegative = () => this.value < 0;
   isStrictlyPositive = () => this.value > 0;
   // Mathematical operations specific to fractions
-  isZero = () => this.#i === 0;
+  isZero = () => this.#t === 0;
   multiply = (e) => {
     const t = new a(e);
-    return this.#i = this.#i * t.numerator, this.#e = this.#e * t.denominator, this.reduce();
+    return this.#t = this.#t * t.numerator, this.#e = this.#e * t.denominator, this.reduce();
   };
   // ------------------------------------------
   get numerator() {
-    return this.#i;
+    return this.#t;
   }
   set numerator(e) {
-    this.#i = e;
+    this.#t = e;
   }
-  one = () => (this.#i = 1, this.#e = 1, this);
-  opposite = () => (this.#i = -this.#i, this);
+  one = () => (this.#t = 1, this.#e = 1, this);
+  opposite = () => (this.#t = -this.#t, this);
   pow = (e) => {
     if (e instanceof a)
       return this.pow(e.value);
     this.reduce(), e < 0 && this.inverse();
-    const t = Math.floor(Math.pow(this.#i, Math.abs(e))), i = Math.floor(Math.pow(this.#e, Math.abs(e)));
-    return t ** Math.abs(e) === this.#i && i ** Math.abs(e) === this.#e ? (this.#i = this.#i ** Math.abs(e), this.#e = this.#e ** Math.abs(e)) : (this.#i = this.#i ** Math.abs(e), this.#e = this.#e ** Math.abs(e)), this;
+    const t = Math.floor(Math.pow(this.#t, Math.abs(e))), i = Math.floor(Math.pow(this.#e, Math.abs(e)));
+    return t ** Math.abs(e) === this.#t && i ** Math.abs(e) === this.#e ? (this.#t = this.#t ** Math.abs(e), this.#e = this.#e ** Math.abs(e)) : (this.#t = this.#t ** Math.abs(e), this.#e = this.#e ** Math.abs(e)), this;
   };
   // ------------------------------------------
   reduce = () => {
-    const e = E.gcd(this.#i, this.#e);
-    return this.#i = this.#i / e, this.#e = this.#e / e, this.#e < 0 && (this.#e = -this.#e, this.#i = -this.#i), this;
+    const e = E.gcd(this.#t, this.#e);
+    return this.#t = this.#t / e, this.#e = this.#e / e, this.#e < 0 && (this.#e = -this.#e, this.#t = -this.#t), this;
   };
   // ------------------------------------------
   // Getter and setter
@@ -308,10 +308,10 @@ class a {
       throw new Error("The root of a negative number must be odd.");
     const t = this.sign();
     this.abs(), this.reduce();
-    const i = Math.floor(Math.pow(this.#i, Math.abs(1 / e))), s = Math.floor(Math.pow(this.#e, Math.abs(1 / e)));
-    return this.#i = Math.pow(this.#i, Math.abs(1 / e)), this.#e = Math.pow(this.#e, Math.abs(1 / e)), (i !== this.#i || s !== this.#e) && (this.#i = this.#i / this.#e, this.#e = 1, this.#t = !0), this.multiply(t), this;
+    const i = Math.floor(Math.pow(this.#t, Math.abs(1 / e))), s = Math.floor(Math.pow(this.#e, Math.abs(1 / e)));
+    return this.#t = Math.pow(this.#t, Math.abs(1 / e)), this.#e = Math.pow(this.#e, Math.abs(1 / e)), (i !== this.#t || s !== this.#e) && (this.#t = this.#t / this.#e, this.#e = 1, this.#i = !0), this.multiply(t), this;
   };
-  sign = () => this.#i * this.#e >= 0 ? 1 : -1;
+  sign = () => this.#t * this.#e >= 0 ? 1 : -1;
   sqrt = () => this.root(2);
   subtract = (e) => e instanceof a ? this.add(e.clone().opposite()) : this.add(-e);
   get texWithSign() {
@@ -321,27 +321,27 @@ class a {
     return this.#s = "tfrac", this;
   }
   get value() {
-    const e = this.#i / this.#e;
+    const e = this.#t / this.#e;
     return e === 0 ? 0 : e;
   }
-  zero = () => (this.#i = 0, this.#e = 1, this);
+  zero = () => (this.#t = 0, this.#e = 1, this);
 }
-class X {
-  #t;
-  #e;
+class j {
   #i;
+  #e;
+  #t;
   #s;
   constructor(...e) {
-    this.#t = 1, this.#i = 1, this.#e = 2, this.#s = !0, e.length > 0 && this.parse(e[0], e[1], e[2]);
+    this.#i = 1, this.#t = 1, this.#e = 2, this.#s = !0, e.length > 0 && this.parse(e[0], e[1], e[2]);
   }
   // ------------------------------------------
   // Getter and setter
   // ------------------------------------------
   get radical() {
-    return this.#t;
+    return this.#i;
   }
   set radical(e) {
-    this.#t = e;
+    this.#i = e;
   }
   get nth() {
     return this.#e;
@@ -350,58 +350,58 @@ class X {
     Number.isSafeInteger(e) && e >= 2 ? this.#e = e : (console.log("Error setting the nth root"), this.#e = 2);
   }
   get coefficient() {
-    return this.#i;
+    return this.#t;
   }
   set coefficient(e) {
-    this.#i = e;
+    this.#t = e;
   }
   get tex() {
     let e;
-    return this.#i === 1 ? e = "" : this.#i === -1 ? e = "-" : e = this.#i.toString(), this.#t === 1 ? `${this.#i}` : this.#e === 2 ? `${e}\\sqrt{${this.#t}}` : `${e}\\sqrt[${this.#e}]{${this.#t}}`;
+    return this.#t === 1 ? e = "" : this.#t === -1 ? e = "-" : e = this.#t.toString(), this.#i === 1 ? `${this.#t}` : this.#e === 2 ? `${e}\\sqrt{${this.#i}}` : `${e}\\sqrt[${this.#e}]{${this.#i}}`;
   }
   get display() {
     let e;
-    return this.#i === 1 ? e = "" : this.#i === -1 ? e = "-" : e = this.#i.toString(), this.#t === 1 ? `${this.#i}` : this.#e === 2 ? `${e}sqrt{${this.#t}}` : `${e}root(${this.#e}){${this.#t}}`;
+    return this.#t === 1 ? e = "" : this.#t === -1 ? e = "-" : e = this.#t.toString(), this.#i === 1 ? `${this.#t}` : this.#e === 2 ? `${e}sqrt{${this.#i}}` : `${e}root(${this.#e}){${this.#i}}`;
   }
   get value() {
-    return this.#i * Math.pow(this.#t, 1 / this.#e);
+    return this.#t * Math.pow(this.#i, 1 / this.#e);
   }
   // ------------------------------------------
   // Creation / parsing functions
   // ------------------------------------------
-  parse = (e, t, i) => (this.#i = i ?? 1, this.#e = t ?? 2, this.#t = e, this.#e % 2 === 0 && this.#t < 0 && (this.#s = !1), this);
+  parse = (e, t, i) => (this.#t = i ?? 1, this.#e = t ?? 2, this.#i = e, this.#e % 2 === 0 && this.#i < 0 && (this.#s = !1), this);
   // ------------------------------------------
   // Mathematical operations
   // ------------------------------------------
   reduce = () => {
-    let e = Math.floor(Math.pow(this.#t, 1 / this.#e));
+    let e = Math.floor(Math.pow(this.#i, 1 / this.#e));
     for (; e > 1; ) {
-      if (this.#t % Math.pow(e, this.#e) === 0) {
-        this.#i *= e, this.#t = this.#t / Math.pow(e, this.#e), e = Math.floor(Math.pow(this.#t, 1 / this.#e));
+      if (this.#i % Math.pow(e, this.#e) === 0) {
+        this.#t *= e, this.#i = this.#i / Math.pow(e, this.#e), e = Math.floor(Math.pow(this.#i, 1 / this.#e));
         continue;
       }
       e--;
     }
     return this;
   };
-  multiply = (e) => (this.#t *= e.radical, this.reduce());
+  multiply = (e) => (this.#i *= e.radical, this.reduce());
   // ------------------------------------------
   // Help functions
   // ------------------------------------------
-  hasRadical = () => !(this.#t === 1 || this.#t === 0 || !this.#s);
+  hasRadical = () => !(this.#i === 1 || this.#i === 0 || !this.#s);
 }
-class J {
-  #t;
+class W {
+  #i;
   #e;
   constructor(e, t, i = "x") {
     if (this.#e = i, Object.hasOwn(e, "moveLeft")) {
       const s = e;
-      this.#t = s.left.clone().subtract(s.right);
+      this.#i = s.left.clone().subtract(s.right);
     } else
-      this.#t = e.clone().subtract(t ?? 0);
+      this.#i = e.clone().subtract(t ?? 0);
   }
   solve() {
-    const e = this.#t.degree().value;
+    const e = this.#i.degree().value;
     if (e === 0)
       return [];
     if (e === 1)
@@ -410,15 +410,15 @@ class J {
       return this.#u();
     const { solutions: t, polynom: i } = this.#a();
     return i.degree().isZero() ? t : t.concat(
-      this.#r(i)
-    ).sort((s, r) => s.value - r.value);
+      this.#n(i)
+    ).sort((s, n) => s.value - n.value);
   }
   solveAsCardan() {
-    if (this.#t.degree().value !== 3)
+    if (this.#i.degree().value !== 3)
       throw new Error("The equation is not cubic.");
     return this.#c();
   }
-  #i(e, t) {
+  #t(e, t) {
     return {
       variable: this.#e,
       exact: !1,
@@ -429,7 +429,7 @@ class J {
   }
   #s(e) {
     if (e instanceof a && e.isApproximative())
-      return this.#i(e.value);
+      return this.#t(e.value);
     const t = new a(e);
     return {
       variable: this.#e,
@@ -439,24 +439,24 @@ class J {
       display: t.display
     };
   }
-  #r(e) {
-    const t = [], i = e.degree().value, s = e.getCoefficients().map((d) => d.value), [r, ...o] = e.getCoefficients(), h = 2 + Math.max(...o.map((d) => d.value / r.value)), l = this.#o(e, h, 100);
+  #n(e) {
+    const t = [], i = e.degree().value, s = e.getCoefficients().map((d) => d.value), [n, ...o] = e.getCoefficients(), h = 2 + Math.max(...o.map((d) => d.value / n.value)), l = this.#o(e, h, 100);
     return this.#h(l, i).forEach((d) => {
       const [m, w] = d;
       if (m === w)
         t.push(this.#s(m));
       else {
-        const N = this.#n(e, s, m, w);
-        N !== null && t.push(this.#i(N));
+        const N = this.#r(e, s, m, w);
+        N !== null && t.push(this.#t(N));
       }
     }), t;
   }
-  #n(e, t, i, s, r = 1e-10) {
+  #r(e, t, i, s, n = 1e-10) {
     let o = e.evaluate(i, !0), h = e.evaluate(s, !0);
     if (o * h > 0)
       return console.log("Pas de racine dans l'intervalle donné"), null;
     let l;
-    for (; (s - i) / 2 > r; ) {
+    for (; (s - i) / 2 > n; ) {
       l = (i + s) / 2;
       const c = e.evaluate(l, !0);
       if (c === 0)
@@ -466,8 +466,8 @@ class J {
     return (i + s) / 2;
   }
   #o(e, t, i) {
-    const s = [], r = 2 * t / i;
-    for (let o = -t; o <= t; o += r) {
+    const s = [], n = 2 * t / i;
+    for (let o = -t; o <= t; o += n) {
       const h = E.numberCorrection(o);
       s.push(
         {
@@ -481,22 +481,22 @@ class J {
   #h(e, t) {
     const i = [];
     for (let s = 1; s < e.length; s++) {
-      const r = e[s], o = e[s - 1];
-      if (r.fx === 0 ? i.push([r.x, r.x]) : r.fx * o.fx < 0 && i.push([o.x, r.x]), i.length === t)
+      const n = e[s], o = e[s - 1];
+      if (n.fx === 0 ? i.push([n.x, n.x]) : n.fx * o.fx < 0 && i.push([o.x, n.x]), i.length === t)
         return i;
     }
     return i;
   }
   #a() {
-    const e = this.#t.clone(), t = [], i = e.lcmDenominator();
+    const e = this.#i.clone(), t = [], i = e.lcmDenominator();
     i !== 1 && e.multiply(i);
-    const s = e.monomByDegree().coefficient, r = e.monomByDegree(0).coefficient;
-    if (r.isZero()) {
+    const s = e.monomByDegree().coefficient, n = e.monomByDegree(0).coefficient;
+    if (n.isZero()) {
       t.push(this.#s(0));
       const m = e.monoms.reduce((N, A) => A.degree().value < N.degree().value ? A : N), w = m.coefficient;
       m.clone().divide(w), e.divide(m);
     }
-    const o = E.dividers(s.value), h = E.dividers(r.value), l = [];
+    const o = E.dividers(s.value), h = E.dividers(n.value), l = [];
     for (const m of o)
       for (const w of h) {
         const N = new a(w, m);
@@ -517,110 +517,114 @@ class J {
     }
     if (e.degree().isZero() || e.degree().value > 3)
       return t.sort((m, w) => m.value - w.value), { solutions: t, polynom: e };
-    const c = e.clone().zero(), d = new J(e, c, this.#e);
+    const c = e.clone().zero(), d = new W(e, c, this.#e);
     return {
       solutions: t.concat(d.solve()).sort((m, w) => m.value - w.value),
       polynom: c
     };
   }
   #c() {
-    const e = this.#t, t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, s = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, o = i.clone().divide(t), h = s.clone().divide(t), l = r.clone().divide(t), c = h.clone().subtract(o.clone().pow(2).divide(3)), d = l.clone().subtract(o.clone().multiply(h).divide(3)).add(o.clone().pow(3).multiply(2).divide(27)), m = d.clone().opposite(), w = c.clone().opposite().pow(3).divide(27), N = m.clone().pow(2).subtract(w.clone().multiply(4)).opposite();
+    const e = this.#i, t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, s = e.monomByDegree(1).coefficient, n = e.monomByDegree(0).coefficient, o = i.clone().divide(t), h = s.clone().divide(t), l = n.clone().divide(t), c = h.clone().subtract(o.clone().pow(2).divide(3)), d = l.clone().subtract(o.clone().multiply(h).divide(3)).add(o.clone().pow(3).multiply(2).divide(27)), m = d.clone().opposite(), w = c.clone().opposite().pow(3).divide(27), N = m.clone().pow(2).subtract(w.clone().multiply(4)).opposite();
     if (N.isNegative()) {
-      const A = d.clone().opposite().add(N.clone().opposite().sqrt()).divide(2).root(3), k = d.clone().opposite().subtract(N.clone().opposite().sqrt()).divide(2).root(3), z = A.clone().add(k).subtract(o.clone().divide(3));
-      return [this.#s(z)];
+      const A = d.clone().opposite().add(N.clone().opposite().sqrt()).divide(2).root(3), C = d.clone().opposite().subtract(N.clone().opposite().sqrt()).divide(2).root(3), O = A.clone().add(C).subtract(o.clone().divide(3));
+      return [this.#s(O)];
     }
     if (N.isZero()) {
-      const A = d.clone().opposite().divide(2).root(3), k = A.clone().opposite().subtract(o.clone().divide(3)), z = A.clone().multiply(2).subtract(o.clone().divide(3));
-      return k.isEqual(z) ? [this.#s(k)] : [
-        this.#s(z),
-        this.#s(k)
+      const A = d.clone().opposite().divide(2).root(3), C = A.clone().opposite().subtract(o.clone().divide(3)), O = A.clone().multiply(2).subtract(o.clone().divide(3));
+      return C.isEqual(O) ? [this.#s(C)] : [
+        this.#s(O),
+        this.#s(C)
       ].sort((M, $) => M.value - $.value);
     }
     if (N.isPositive()) {
-      const A = [], k = c.value, z = d.value, M = o.value;
+      const A = [], C = c.value, O = d.value, M = o.value;
       for (let $ = 0; $ < 3; $++)
-        A.push(2 * Math.sqrt(-k / 3) * Math.cos(Math.acos(3 * z / (2 * k) * Math.sqrt(-3 / k)) / 3 + 2 * Math.PI * $ / 3) - M / 3);
-      return A.map(($) => this.#i($)).sort(($, V) => $.value - V.value);
+        A.push(2 * Math.sqrt(-C / 3) * Math.cos(Math.acos(3 * O / (2 * C) * Math.sqrt(-3 / C)) / 3 + 2 * Math.PI * $ / 3) - M / 3);
+      return A.map(($) => this.#t($)).sort(($, S) => $.value - S.value);
     }
     return [];
   }
   #l() {
-    const [e, t] = this.#t.getCoefficients(), i = t.opposite().divide(e);
+    const [e, t] = this.#i.getCoefficients(), i = t.opposite().divide(e);
     return [
       this.#s(i)
     ];
   }
   #u() {
-    const e = this.#t;
+    const e = this.#i;
     e.monomByDegree().coefficient.isNegative() && e.opposite();
-    const [t, i, s] = e.getCoefficients(), r = i.clone().pow(2).subtract(t.clone().multiply(s).multiply(4));
-    if (r.isNegative())
+    const [t, i, s] = e.getCoefficients(), n = i.clone().pow(2).subtract(t.clone().multiply(s).multiply(4));
+    if (n.isNegative())
       return [];
-    if (r.isSquare()) {
-      const o = r.sqrt(), h = i.clone().opposite().subtract(o).divide(t.clone().multiply(2)), l = i.clone().opposite().add(o).divide(t.clone().multiply(2));
+    if (n.isSquare()) {
+      const o = n.sqrt(), h = i.clone().opposite().subtract(o).divide(t.clone().multiply(2)), l = i.clone().opposite().add(o).divide(t.clone().multiply(2));
       return o.isZero() ? [this.#s(h)] : [
         this.#s(h),
         this.#s(l)
       ].sort((c, d) => c.value - d.value);
     }
-    return this.#f(t, i, r);
+    return this.#f(t, i, n);
   }
   #f(e, t, i) {
-    const s = E.dividers(i.value).filter((M) => Math.sqrt(M) % 1 === 0).map((M) => Math.sqrt(M)).pop() ?? 1, r = E.gcd(2 * e.value, t.value, s) * (e.isNegative() ? -1 : 1), o = t.clone().divide(r).opposite(), h = e.clone().divide(r).multiply(2), l = i.clone().divide(s ** 2), c = Math.abs(s / r), d = s === 1 ? "-" : `-${c} `, m = s === 1 ? "+" : `+${c} `;
-    function w(M, $, V, te) {
-      return `\\frac{ ${$} ${V}\\sqrt{ ${te} } }{ ${M} }`;
+    const s = E.dividers(i.value).filter((O) => Math.sqrt(O) % 1 === 0).map((O) => Math.sqrt(O)).pop() ?? 1, n = E.gcd(2 * e.value, t.value, s) * (e.isNegative() ? -1 : 1), o = t.clone().divide(n).opposite(), h = e.clone().divide(n).multiply(2), l = Math.abs(s / n), c = `${s === 1 ? "" : l + " "}\\sqrt{ ${i.clone().divide(s ** 2).tex} }`, d = `${s === 1 ? "" : l}sqrt(${i.clone().divide(s ** 2).display})`;
+    function m(O, M, $, S) {
+      const R = M === "0" ? "" : M, P = $ === "-" || R !== "" ? ` ${$} ` : "";
+      return O === "1" ? `${R}${P}${S}` : `\\frac{ ${P}${P}${S} }{ ${O} }`;
     }
-    function N(M, $, V, te) {
-      return `(${$}${V}sqrt(${te}))/${M}`;
+    function w(O, M, $, S) {
+      const R = M === "0" ? "" : M, P = $ === "-" || R !== "" ? $ : "";
+      return O === "1" ? `${R}${P}${S}` : `(${R}${P}${S})/${O}`;
     }
-    const A = i.value ** 0.5, k = (-t.value - A) / (2 * e.value), z = (-t.value + A) / (2 * e.value);
+    const N = i.value ** 0.5, A = (-t.value - N) / (2 * e.value), C = (-t.value + N) / (2 * e.value);
     return [
-      this.#i(
-        k,
+      this.#t(
+        A,
         {
-          tex: w(h.tex, o.tex, d, l.tex),
-          display: N(h.display, o.display, d, l.display)
+          tex: m(h.tex, o.tex, "-", c),
+          display: w(h.display, o.display, "-", d)
         }
       ),
-      this.#i(
-        z,
+      this.#t(
+        C,
         {
-          tex: w(h.tex, o.tex, m, l.tex),
-          display: N(h.display, o.display, m, l.display)
+          tex: m(h.tex, o.tex, "+", c),
+          display: w(h.display, o.display, "+", d)
         }
       )
-    ].sort((M, $) => M.value - $.value);
+    ].sort((O, M) => O.value - M.value);
   }
 }
-var Ce = Object.defineProperty, ue = (n) => {
-  throw TypeError(n);
-}, ke = (n, e, t) => e in n ? Ce(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t, ie = (n, e, t) => ke(n, typeof e != "symbol" ? e + "" : e, t), fe = (n, e, t) => e.has(n) || ue("Cannot " + t), O = (n, e, t) => (fe(n, e, "read from private field"), t ? t.call(n) : e.get(n)), j = (n, e, t) => e.has(n) ? ue("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(n) : e.set(n, t), S = (n, e, t, i) => (fe(n, e, "write to private field"), e.set(n, t), t);
-const oe = {
+const J = {
   pi: Math.PI,
   e: Math.exp(1)
 };
-var f = /* @__PURE__ */ ((n) => (n.VARIABLE = "variable", n.COEFFICIENT = "coefficient", n.OPERATION = "operation", n.CONSTANT = "constant", n.FUNCTION = "function", n.FUNCTION_ARGUMENT = "function-argument", n.MONOM = "monom", n.LEFT_PARENTHESIS = "(", n.RIGHT_PARENTHESIS = ")", n))(f || {}), D = /* @__PURE__ */ ((n) => (n.EXPRESSION = "expression", n.POLYNOM = "polynom", n.SET = "set", n.NUMERIC = "numeric", n))(D || {});
-function $e(n, e) {
-  if (n.length <= 1)
-    return n;
+var f = /* @__PURE__ */ ((r) => (r.VARIABLE = "variable", r.COEFFICIENT = "coefficient", r.OPERATION = "operation", r.CONSTANT = "constant", r.FUNCTION = "function", r.FUNCTION_ARGUMENT = "function-argument", r.MONOM = "monom", r.LEFT_PARENTHESIS = "(", r.RIGHT_PARENTHESIS = ")", r))(f || {}), z = /* @__PURE__ */ ((r) => (r.EXPRESSION = "expression", r.POLYNOM = "polynom", r.SET = "set", r.NUMERIC = "numeric", r))(z || {});
+function ye(r, e) {
+  if (r.length <= 1)
+    return r;
   const t = Object.keys(e).filter((m) => e[m].type === f.FUNCTION).map((m) => m);
   t.sort((m, w) => w.length - m.length);
-  const i = new RegExp(`^(${t.join("|")})\\(`), s = Object.keys(oe);
+  const i = new RegExp(`^(${t.join("|")})\\(`), s = Object.keys(J);
   s.sort((m, w) => w.length - m.length);
-  const r = new RegExp(`^(${s.join("|")})`), o = /^(\d+(\.\d+)?)/;
+  const n = new RegExp(`^(${s.join("|")})`), o = /^(\d+(\.\d+)?)/;
   let h = "", l, c, d;
-  for (; n.length > 0; ) {
-    if (l = c, d = void 0, t.length > 0 && i.exec(n)) {
-      const m = t.find((w) => n.startsWith(w));
-      m && (d = m + "(", n = n.slice(m.length + 1), c = f.FUNCTION);
-    } else if (s.length > 0 && r.exec(n)) {
-      const m = s.find((w) => n.startsWith(w));
-      m && (d = m, n = n.slice(m.length), c = f.CONSTANT);
-    } else if (o.exec(n)) {
-      const m = o.exec(n);
-      m && (d = m[0], n = n.slice(m[0].length), c = f.COEFFICIENT);
+  for (t.forEach((m) => {
+    if (r.includes(m)) {
+      const w = new RegExp(`${m}([0-9.]+)`, "g");
+      r = r.replaceAll(w, `${m}($1)`);
+    }
+  }); r.length > 0; ) {
+    if (l = c, d = void 0, t.length > 0 && i.exec(r)) {
+      const m = t.find((w) => r.startsWith(w));
+      m && (d = m + "(", r = r.slice(m.length + 1), c = f.FUNCTION);
+    } else if (s.length > 0 && n.exec(r)) {
+      const m = s.find((w) => r.startsWith(w));
+      m && (d = m, r = r.slice(m.length), c = f.CONSTANT);
+    } else if (o.exec(r)) {
+      const m = o.exec(r);
+      m && (d = m[0], r = r.slice(m[0].length), c = f.COEFFICIENT);
     } else
-      switch (d = n[0], n = n.slice(1), d) {
+      switch (d = r[0], r = r.slice(1), d) {
         case "(":
           c = f.LEFT_PARENTHESIS;
           break;
@@ -642,20 +646,20 @@ function $e(n, e) {
       }
     if (d === void 0 || c === void 0)
       throw new Error("The token is undefined");
-    h += Be(l, c), h += d;
+    h += ve(l, c), h += d;
   }
   return h;
 }
-function Be(n, e) {
-  return n === void 0 || n === f.OPERATION || e === f.OPERATION || n === f.LEFT_PARENTHESIS || n === f.FUNCTION || n === f.FUNCTION_ARGUMENT || e === f.RIGHT_PARENTHESIS || e === f.FUNCTION_ARGUMENT ? "" : "*";
+function ve(r, e) {
+  return r === void 0 || r === f.OPERATION || e === f.OPERATION || r === f.LEFT_PARENTHESIS || r === f.FUNCTION || r === f.FUNCTION_ARGUMENT || e === f.RIGHT_PARENTHESIS || e === f.FUNCTION_ARGUMENT ? "" : "*";
 }
-const Me = {
+const be = {
   "^": { precedence: 4, associative: "right", type: f.OPERATION },
   "*": { precedence: 3, associative: "left", type: f.OPERATION },
   "/": { precedence: 3, associative: "left", type: f.OPERATION },
   "+": { precedence: 2, associative: "left", type: f.OPERATION },
   "-": { precedence: 2, associative: "left", type: f.OPERATION }
-}, Ie = {
+}, xe = {
   "^": { precedence: 4, associative: "right", type: f.OPERATION },
   "*": { precedence: 3, associative: "left", type: f.OPERATION },
   "/": { precedence: 3, associative: "left", type: f.OPERATION },
@@ -668,7 +672,7 @@ const Me = {
   sqrt: { precedence: 4, associative: "right", type: f.FUNCTION },
   nthrt: { precedence: 4, associative: "right", type: f.FUNCTION },
   ",": { precedence: 2, associative: "left", type: f.FUNCTION_ARGUMENT }
-}, Se = {
+}, Ee = {
   "^": { precedence: 4, associative: "right", type: f.OPERATION },
   "*": { precedence: 3, associative: "left", type: f.OPERATION },
   "/": { precedence: 3, associative: "left", type: f.OPERATION },
@@ -682,26 +686,30 @@ const Me = {
   nthrt: { precedence: 4, associative: "right", type: f.FUNCTION },
   ln: { precedence: 4, associative: "right", type: f.FUNCTION },
   log: { precedence: 4, associative: "right", type: f.FUNCTION }
-}, ze = {
+}, Ne = {
   "&": { precedence: 3, associative: "left", type: f.OPERATION },
   "|": { precedence: 3, associative: "left", type: f.OPERATION },
   "!": { precedence: 4, associative: "right", type: f.OPERATION },
   "-": { precedence: 2, associative: "left", type: f.OPERATION }
 };
-var L, F, C, Y, R;
-class _ {
+class X {
+  #i;
+  #e = [];
+  #t = {};
+  #s = [];
+  #n;
   constructor(e) {
-    j(this, L), j(this, F, []), j(this, C, {}), j(this, Y, []), j(this, R), S(this, L, typeof e > "u" ? D.POLYNOM : e), this.tokenConfigInitialization();
+    this.#i = typeof e > "u" ? z.POLYNOM : e, this.tokenConfigInitialization();
   }
   // Getter
   get rpn() {
-    return O(this, F);
+    return this.#e;
   }
   get rpnToken() {
-    return O(this, F).map((e) => e.token);
+    return this.#e.map((e) => e.token);
   }
   tokenConfigInitialization() {
-    return O(this, L) === D.SET ? (S(this, C, ze), S(this, R, !1)) : O(this, L) === D.NUMERIC ? (S(this, C, Se), S(this, R, !0)) : O(this, L) === D.EXPRESSION ? (S(this, C, Ie), S(this, R, !0)) : (S(this, C, Me), S(this, R, !0)), S(this, Y, Object.keys(O(this, C)).sort((e, t) => t.length - e.length)), O(this, C);
+    return this.#i === z.SET ? (this.#t = Ne, this.#n = !1) : this.#i === z.NUMERIC ? (this.#t = Ee, this.#n = !0) : this.#i === z.EXPRESSION ? (this.#t = xe, this.#n = !0) : (this.#t = be, this.#n = !0), this.#s = Object.keys(this.#t).sort((e, t) => t.length - e.length), this.#t;
   }
   /**
    * Get the next token to analyse.
@@ -717,23 +725,23 @@ class _ {
     else if (e[t] === ",")
       i = ",", s = f.FUNCTION_ARGUMENT;
     else {
-      for (const r of O(this, Y))
-        if (e.substring(t, t + r.length) === r) {
-          i += r, s = O(this, C)[r].type;
+      for (const n of this.#s)
+        if (e.substring(t, t + n.length) === n) {
+          i += n, s = this.#t[n].type;
           break;
         }
-      for (const r in oe)
-        if (e.substring(t, t + r.length) === r) {
-          i += r, s = f.CONSTANT;
+      for (const n in J)
+        if (e.substring(t, t + n.length) === n) {
+          i += n, s = f.CONSTANT;
           break;
         }
       if (i === "")
         if (/[0-9.]/.exec(e[t])) {
-          const r = /^([0-9.]+)/.exec(e.substring(t));
-          i = r ? r[0] : "", s = f.COEFFICIENT;
+          const n = /^([0-9.]+)/.exec(e.substring(t));
+          i = n ? n[0] : "", s = f.COEFFICIENT;
         } else if (/[a-zA-Z]/.exec(e[t])) {
-          const r = /^([a-zA-Z])/.exec(e.substring(t));
-          i = r ? r[0] : "", s = f.VARIABLE;
+          const n = /^([a-zA-Z])/.exec(e.substring(t));
+          i = n ? n[0] : "", s = f.VARIABLE;
         } else
           console.log("Unidentified token", e[t], e, t), i = e[t], s = f.MONOM;
     }
@@ -749,30 +757,30 @@ class _ {
    */
   parse(e, t) {
     const i = [], s = [];
-    let r = "", o = 0, h;
-    (t ?? O(this, R)) && (e = $e(e, O(this, C)));
+    let n = "", o = 0, h;
+    (t ?? this.#n) && (e = ye(e, this.#t));
     let l = 50, c;
     for (; o < e.length; ) {
       if (l--, l === 0) {
         console.log("SECURITY LEVEL 1 EXIT");
         break;
       }
-      switch ([r, o, h] = this.NextToken(e, o), h) {
+      switch ([n, o, h] = this.NextToken(e, o), h) {
         case f.MONOM:
         case f.COEFFICIENT:
         case f.VARIABLE:
         case f.CONSTANT:
           i.push({
-            token: r,
+            token: n,
             tokenType: h
           });
           break;
         case f.OPERATION:
           if (s.length > 0) {
             let d = s[s.length - 1];
-            for (c = 50; d.token in O(this, C) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
-            (O(this, C)[r].associative === "left" && O(this, C)[r].precedence <= O(this, C)[d.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
-            O(this, C)[r].associative === "right" && O(this, C)[r].precedence < O(this, C)[d.token].precedence); ) {
+            for (c = 50; d.token in this.#t && //either o1 is left-associative and its precedence is less than or equal to that of o2,
+            (this.#t[n].associative === "left" && this.#t[n].precedence <= this.#t[d.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
+            this.#t[n].associative === "right" && this.#t[n].precedence < this.#t[d.token].precedence); ) {
               if (c--, c === 0) {
                 console.log("SECURITY LEVEL 2 OPERATION EXIT");
                 break;
@@ -782,7 +790,7 @@ class _ {
               d = s[s.length - 1];
             }
           }
-          s.push({ token: r, tokenType: h });
+          s.push({ token: n, tokenType: h });
           break;
         case f.FUNCTION_ARGUMENT:
           for (c = 50; s[s.length - 1].token !== "(" && s.length > 0; ) {
@@ -790,11 +798,11 @@ class _ {
               console.log("SECURITY LEVEL 2 FUNCTION ARGUMENT EXIT");
               break;
             }
-            i.push(s.pop() ?? { token: r, tokenType: h });
+            i.push(s.pop() ?? { token: n, tokenType: h });
           }
           break;
         case f.LEFT_PARENTHESIS:
-          s.push({ token: r, tokenType: h }), e[o] === "-" && i.push({ token: "0", tokenType: f.COEFFICIENT });
+          s.push({ token: n, tokenType: h }), e[o] === "-" && i.push({ token: "0", tokenType: f.COEFFICIENT });
           break;
         case f.RIGHT_PARENTHESIS:
           for (c = 50; s[s.length - 1].token !== "(" && s.length > 1; ) {
@@ -802,28 +810,30 @@ class _ {
               console.log("SECURITY LEVEL 2 CLOSING PARENTHESIS EXIT");
               break;
             }
-            i.push(s.pop() ?? { token: r, tokenType: h });
+            i.push(s.pop() ?? { token: n, tokenType: h });
           }
           s.pop();
           break;
         case f.FUNCTION:
-          s.push({ token: r, tokenType: h });
+          s.push({ token: n, tokenType: h });
           break;
         default:
-          throw new Error(`Token type ${r} is not handled`);
+          throw new Error(`Token type ${n} is not handled`);
       }
     }
-    return S(this, F, i.concat(s.reverse())), this;
+    return this.#e = i.concat(s.reverse()), this;
   }
 }
-L = /* @__PURE__ */ new WeakMap(), F = /* @__PURE__ */ new WeakMap(), C = /* @__PURE__ */ new WeakMap(), Y = /* @__PURE__ */ new WeakMap(), R = /* @__PURE__ */ new WeakMap();
-class Re {
+class Ae {
+  _rpn;
+  _expression;
+  _isValid;
   constructor(e, t) {
-    ie(this, "_rpn"), ie(this, "_expression"), ie(this, "_isValid"), this._expression = e;
+    this._expression = e;
     try {
-      this._rpn = new _(D.NUMERIC).parse(e, t).rpn;
-    } catch {
-      throw this._rpn = null, this._isValid = !1, new Error(`There was a problem parsing: ${e}`);
+      this._rpn = new X(z.NUMERIC).parse(e, t).rpn;
+    } catch (i) {
+      throw this._rpn = null, this._isValid = !1, console.warn(i), new Error(`There was a problem parsing: ${e}`);
     }
   }
   get rpn() {
@@ -862,33 +872,33 @@ class Re {
       else if (i.tokenType === f.VARIABLE && e !== void 0)
         Object.hasOwn(e, i.token) && t.push(+e[i.token]);
       else if (i.tokenType === f.CONSTANT)
-        t.push(oe[i.token]);
+        t.push(J[i.token]);
       else if (i.tokenType === f.OPERATION) {
         if (i.token === "*") {
-          const s = t.pop(), r = t.pop();
-          if (r === void 0 || s === void 0)
-            throw this._isValid = !1, new Error(`The multiplication factors ${r ?? "a"} or ${s ?? "b"} are not defined`);
-          t.push(r * s);
+          const s = t.pop(), n = t.pop();
+          if (n === void 0 || s === void 0)
+            throw this._isValid = !1, new Error(`The multiplication factors ${n ?? "a"} or ${s ?? "b"} are not defined`);
+          t.push(n * s);
         } else if (i.token === "/") {
-          const s = t.pop(), r = t.pop();
-          if (r === void 0 || s === void 0)
-            throw this._isValid = !1, new Error(`The division values ${r ?? "a"} or ${s ?? "b"} are not defined`);
-          t.push(r / s);
+          const s = t.pop(), n = t.pop();
+          if (n === void 0 || s === void 0)
+            throw this._isValid = !1, new Error(`The division values ${n ?? "a"} or ${s ?? "b"} are not defined`);
+          t.push(n / s);
         } else if (i.token === "+") {
-          const s = t.pop(), r = t.pop();
-          if (r === void 0 || s === void 0)
-            throw this._isValid = !1, new Error(`The addition values ${r ?? "a"} or ${s ?? "b"} are not defined`);
-          t.push(+r + +s);
+          const s = t.pop(), n = t.pop();
+          if (n === void 0 || s === void 0)
+            throw this._isValid = !1, new Error(`The addition values ${n ?? "a"} or ${s ?? "b"} are not defined`);
+          t.push(+n + +s);
         } else if (i.token === "-") {
-          const s = t.pop(), r = t.pop() ?? 0;
+          const s = t.pop(), n = t.pop() ?? 0;
           if (s === void 0)
             throw this._isValid = !1, new Error("The subtraction value b is  not defined");
-          t.push(r - s);
+          t.push(n - s);
         } else if (i.token === "^") {
-          const s = t.pop(), r = t.pop();
-          if (r === void 0 || s === void 0)
-            throw this._isValid = !1, new Error(`The base value ${r ?? "a"} or exponent ${s ?? "b"} are not defined`);
-          t.push(Math.pow(r, s));
+          const s = t.pop(), n = t.pop();
+          if (n === void 0 || s === void 0)
+            throw this._isValid = !1, new Error(`The base value ${n ?? "a"} or exponent ${s ?? "b"} are not defined`);
+          t.push(Math.pow(n, s));
         }
       } else if (i.tokenType === f.FUNCTION) {
         const s = t.pop();
@@ -903,10 +913,10 @@ class Re {
         else if (i.token === "sqrt")
           t.push(Math.sqrt(s));
         else if (i.token === "nthrt") {
-          const r = t.pop();
-          if (r === void 0)
+          const n = t.pop();
+          if (n === void 0)
             throw this._isValid = !1, new Error("The nthrt function requires two parameters");
-          s % 2 === 0 && r < 0 ? t.push(NaN) : t.push((r < 0 ? -1 : 1) * Math.pow(Math.abs(r), 1 / s));
+          s % 2 === 0 && n < 0 ? t.push(NaN) : t.push((n < 0 ? -1 : 1) * Math.pow(Math.abs(n), 1 / s));
         } else i.token === "ln" ? t.push(Math.log(s)) : i.token === "log" && t.push(Math.log10(s));
       }
     if (t.length === 1)
@@ -918,10 +928,10 @@ class Re {
   }
 }
 class p {
-  #t;
+  #i;
   #e;
   constructor(e) {
-    return this.#t = new a().zero(), this.#e = {}, e !== void 0 && this.parse(e), this;
+    return this.#i = new a().zero(), this.#e = {}, e !== void 0 && this.parse(e), this;
   }
   // -----------------------------------------
   /**
@@ -929,14 +939,14 @@ class p {
    * @param inputStr
    */
   parse(e) {
-    return this.#t = new a(), this.#e = {}, typeof e == "string" ? isNaN(Number(e)) ? this.#r(e) : this.#t = new a(Number(e)) : typeof e == "number" ? this.#t = new a(e) : e instanceof a ? this.#t = e.clone() : e instanceof p && (this.#t = e.#t.clone(), this.#i(e)), this;
+    return this.#i = new a(), this.#e = {}, typeof e == "string" ? isNaN(Number(e)) ? this.#n(e) : this.#i = new a(Number(e)) : typeof e == "number" ? this.#i = new a(e) : e instanceof a ? this.#i = e.clone() : e instanceof p && (this.#i = e.#i.clone(), this.#t(e)), this;
   }
   /**
    * Clone the current Monom.
    */
   clone = () => {
     const e = new p();
-    e.coefficient = this.#t.clone();
+    e.coefficient = this.#i.clone();
     for (const t in this.#e)
       e.setLetter(t, this.#e[t].clone());
     return e;
@@ -949,7 +959,7 @@ class p {
     const t = Object.keys(this.#e).sort();
     for (const i of t)
       this.#e[i].isNotZero() && (e += i, this.#e[i].isNotEqual(1) && (e += `^{ ${this.#e[i].tfrac.tex} }`));
-    return e === "" ? this.#t.value != 0 ? this.#t.frac.tex : "0" : this.#t.value === 1 ? e : this.#t.value === -1 ? `-${e}` : this.#t.value === 0 ? "0" : `${this.#t.frac.tex}${e}`;
+    return e === "" ? this.#i.value != 0 ? this.#i.frac.tex : "0" : this.#i.value === 1 ? e : this.#i.value === -1 ? `-${e}` : this.#i.value === 0 ? "0" : `${this.#i.frac.tex}${e}`;
   }
   // Display getter
   /**
@@ -960,19 +970,19 @@ class p {
     const t = Object.keys(this.#e).sort();
     for (const i of t)
       this.#e[i].isNotZero() && (e += i, this.#e[i].isNotEqual(1) && (e += `^(${this.#e[i].display})`));
-    return e === "" ? this.#t.value != 0 ? this.#t.display : "" : this.#t.value === 1 ? e : this.#t.value === -1 ? `-${e}` : this.#t.value === 0 ? "0" : `${this.#t.display}${e}`;
+    return e === "" ? this.#i.value != 0 ? this.#i.display : "" : this.#i.value === 1 ? e : this.#i.value === -1 ? `-${e}` : this.#i.value === 0 ? "0" : `${this.#i.display}${e}`;
   }
   static gcd = (...e) => {
-    for (const r of e)
-      if (r.containsRationalPower())
+    for (const n of e)
+      if (n.containsRationalPower())
         return new p().zero();
-    const t = new p(), i = E.gcd(...e.map((r) => r.coefficient.numerator)), s = E.lcm(...e.map((r) => r.coefficient.denominator));
+    const t = new p(), i = E.gcd(...e.map((n) => n.coefficient.numerator)), s = E.lcm(...e.map((n) => n.coefficient.denominator));
     t.coefficient = new a(i, s).reduce();
-    for (const r of e) {
+    for (const n of e) {
       for (const o in t.literal)
-        o in r.literal || t.literal[o].zero();
-      for (const o in r.literal)
-        !t.hasVariable(o) && r.literal[o].isStrictlyPositive() ? t.literal[o] = r.literal[o].clone() : t.literal[o] = new a(Math.min(r.literal[o].value, t.literal[o].value));
+        o in n.literal || t.literal[o].zero();
+      for (const o in n.literal)
+        !t.hasVariable(o) && n.literal[o].isStrictlyPositive() ? t.literal[o] = n.literal[o].clone() : t.literal[o] = new a(Math.min(n.literal[o].value, t.literal[o].value));
     }
     return t;
   };
@@ -993,7 +1003,7 @@ class p {
   add = (...e) => {
     for (const t of e) {
       const i = t instanceof p ? t : new p(t);
-      this.isSameAs(i) ? (this.isZero() && this.#i(i), this.#t.add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
+      this.isSameAs(i) ? (this.isZero() && this.#t(i), this.#i.add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
     }
     return this;
   };
@@ -1002,14 +1012,14 @@ class p {
    * @returns {Fraction}
    */
   get coefficient() {
-    return this.#t;
+    return this.#i;
   }
   /**
    * Set the coefficient \\(k\\) value of the monom
    * @param {Fraction | number | string} F
    */
   set coefficient(e) {
-    this.#t = new a(e);
+    this.#i = new a(e);
   }
   containsRationalPower = () => Object.values(this.#e).some((e) => e.isRational());
   /**
@@ -1024,7 +1034,7 @@ class p {
   derivative = (e) => {
     if (e === void 0 && (e = "x"), this.hasVariable(e)) {
       const t = this.#e[e].clone(), i = this.clone();
-      return i.#e[e].subtract(1), i.#t.multiply(new a(t.clone())), i;
+      return i.#e[e].subtract(1), i.#i.multiply(new a(t.clone())), i;
     } else
       return new p().zero();
   };
@@ -1035,7 +1045,7 @@ class p {
   divide = (...e) => {
     for (const t of e) {
       const i = t instanceof p ? t : new p(t);
-      this.#t.divide(i.coefficient);
+      this.#i.divide(i.coefficient);
       for (const s in i.literal)
         this.#e[s] = this.hasVariable(s) ? this.#e[s].subtract(i.literal[s]) : i.literal[s].clone().opposite(), this.#e[s].isZero() && this.removeVariable(s);
     }
@@ -1055,19 +1065,19 @@ class p {
     const i = [];
     if (t.length > 0 && e.length > 0)
       for (const s of e)
-        for (const r of t) {
+        for (const n of t) {
           const o = new p();
-          o.coefficient = new a(s), o.literal = r, i.push(o);
+          o.coefficient = new a(s), o.literal = n, i.push(o);
         }
     else if (e.length === 0)
       for (const s of t) {
-        const r = new p();
-        r.coefficient = new a().one(), r.literal = s, i.push(r);
+        const n = new p();
+        n.coefficient = new a().one(), n.literal = s, i.push(n);
       }
     else
       for (const s of e) {
-        const r = new p();
-        r.coefficient = new a(s), i.push(r);
+        const n = new p();
+        n.coefficient = new a(s), i.push(n);
       }
     return i.length === 0 ? [new p().one()] : i;
   }
@@ -1080,14 +1090,14 @@ class p {
     if (t === !0) {
       if (e instanceof a)
         return this.#s(e.value);
-      if (e instanceof X)
+      if (e instanceof j)
         return new a().invalid();
       if (typeof e == "number")
         return this.#s(e);
       if (typeof e == "object") {
         const s = {};
-        for (const r in e)
-          s[r] = new a(e[r]).value;
+        for (const n in e)
+          s[n] = new a(e[n]).value;
         return this.#s(s);
       }
     }
@@ -1096,14 +1106,14 @@ class p {
       const s = {};
       return s[this.variables[0]] = new a(e), this.evaluate(s);
     }
-    if (e instanceof X)
+    if (e instanceof j)
       return new a().invalid();
     if (typeof e == "object") {
       if (this.variables.length === 0)
         return this.coefficient;
       for (const s in this.#e) {
-        const r = new a(e[s]);
-        i.multiply(r.pow(this.#e[s]));
+        const n = new a(e[s]);
+        i.multiply(n.pow(this.#e[s]));
       }
     }
     return i;
@@ -1119,7 +1129,7 @@ class p {
     return s.evaluate(t).subtract(s.evaluate(e));
   }
   inverse = () => {
-    this.#t.opposite();
+    this.#i.opposite();
     for (const e in this.#e)
       this.#e[e].opposite();
     return this;
@@ -1136,7 +1146,7 @@ class p {
    * Determine if two monoms are equals
    * @param M
    */
-  isEqual = (e) => this.isSameAs(e) && this.#t.isEqual(e.coefficient);
+  isEqual = (e) => this.isSameAs(e) && this.#i.isEqual(e.coefficient);
   isLiteralSquare = () => {
     for (const e in this.literal)
       if (this.literal[e].isRational() || this.literal[e].isEven())
@@ -1146,20 +1156,20 @@ class p {
   /**
    * Determine if the monom is one
    */
-  isOne = () => this.#t.value === 1 && this.variables.length === 0;
+  isOne = () => this.#i.value === 1 && this.variables.length === 0;
   /**
    * Determine if two monoms are similar
    * @param M
    */
   isSameAs = (e) => {
-    const t = this.variables, i = e.variables, s = t.concat(i.filter((r) => !t.includes(r)));
+    const t = this.variables, i = e.variables, s = t.concat(i.filter((n) => !t.includes(n)));
     if (this.isZero() || e.isZero() || t.length === 0 && i.length === 0)
       return !0;
     if (t.length !== i.length)
       return !1;
     if (!this.isZero() && !e.isZero()) {
-      for (const r of s)
-        if (!this.hasVariable(r) || !e.hasVariable(r) || !this.#e[r].isEqual(e.literal[r]))
+      for (const n of s)
+        if (!this.hasVariable(n) || !e.hasVariable(n) || !this.#e[n].isEqual(e.literal[n]))
           return !1;
     }
     return !0;
@@ -1168,7 +1178,7 @@ class p {
   /**
    * Determine if the monom is null
    */
-  isZero = () => this.#t.value === 0;
+  isZero = () => this.#i.value === 0;
   /**
    * Get the literal part of \\(x^{n_1}y^{n_2}\\) as dictionary \\[\\begin{array}{ll}x&=n_1\\\\y&=n_2\\end{array}\\]
    * @returns {literalType}
@@ -1213,7 +1223,7 @@ class p {
   multiply = (...e) => {
     for (const t of e) {
       const i = t instanceof p ? t : new p(t);
-      this.#t.multiply(i.coefficient);
+      this.#i.multiply(i.coefficient);
       for (const s in i.literal)
         this.hasVariable(s) ? this.#e[s].add(i.literal[s]) : this.#e[s] = i.literal[s].clone();
     }
@@ -1222,25 +1232,25 @@ class p {
   /**
    * Create a one value monom
    */
-  one = () => (this.#t = new a().one(), this.#e = {}, this);
+  one = () => (this.#i = new a().one(), this.#e = {}, this);
   /**
    * Get the opposite
    * Returns a monom.
    */
-  opposite = () => (this.#t.opposite(), this);
+  opposite = () => (this.#i.opposite(), this);
   get plotFunction() {
     let e = "";
     const t = Object.keys(this.#e).sort();
     for (const i of t)
       this.#e[i].isNotZero() && (e += (e === "" ? "" : "*") + i, this.#e[i].isNotEqual(1) && (e += `^(${this.#e[i].display})`));
-    return e === "" ? this.#t.value != 0 ? this.#t.display : "" : this.#t.value === 1 ? e : this.#t.value === -1 ? `-${e}` : this.#t.value === 0 ? "0" : `${this.#t.display}*${e}`;
+    return e === "" ? this.#i.value != 0 ? this.#i.display : "" : this.#i.value === 1 ? e : this.#i.value === -1 ? `-${e}` : this.#i.value === 0 ? "0" : `${this.#i.display}*${e}`;
   }
   /**
    * Get the pow of a monom.
    * @param nb (number) : Mathematical pow
    */
   pow = (e) => {
-    this.#t.pow(e);
+    this.#i.pow(e);
     for (const t in this.#e)
       this.#e[t].multiply(e);
     return this;
@@ -1277,7 +1287,7 @@ class p {
    */
   sqrt = () => {
     if (this.isSquare()) {
-      this.#t.sqrt();
+      this.#i.sqrt();
       for (const e in this.#e)
         this.#e[e].clone().divide(2);
     }
@@ -1290,7 +1300,7 @@ class p {
   subtract = (...e) => {
     for (const t of e) {
       const i = t instanceof p ? t : new p(t);
-      this.isSameAs(i) ? (this.isZero() && this.#i(i), this.#t.add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
+      this.isSameAs(i) ? (this.isZero() && this.#t(i), this.#i.add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
     }
     return this;
   };
@@ -1309,8 +1319,8 @@ class p {
   /**
    * Create a zero value monom
    */
-  zero = () => (this.#t = new a().zero(), this.#e = {}, this);
-  #i(e) {
+  zero = () => (this.#i = new a().zero(), this.#e = {}, this);
+  #t(e) {
     for (const t in e.literal)
       this.#e[t] = e.literal[t].clone();
   }
@@ -1324,7 +1334,7 @@ class p {
       const i = {};
       return i[this.variables[0]] = new a(e).value, this.#s(i);
     }
-    if (e instanceof X)
+    if (e instanceof j)
       return NaN;
     if (typeof e == "object") {
       if (this.variables.length === 0)
@@ -1336,20 +1346,20 @@ class p {
     }
     return t;
   };
-  #r = (e) => {
-    const i = new _().parse(e).rpn, s = [];
+  #n = (e) => {
+    const i = new X().parse(e).rpn, s = [];
     if (i.length === 0)
       return this.zero(), this;
     if (i.length === 1) {
-      const r = i[0];
-      return this.one(), r.tokenType === f.COEFFICIENT ? this.coefficient = new a(r.token) : r.tokenType === f.VARIABLE && this.setLetter(r.token, 1), this;
+      const n = i[0];
+      return this.one(), n.tokenType === f.COEFFICIENT ? this.coefficient = new a(n.token) : n.tokenType === f.VARIABLE && this.setLetter(n.token, 1), this;
     } else
-      for (const r of i)
-        this.#n(s, r);
+      for (const n of i)
+        this.#r(s, n);
     return this.one(), this.multiply(s[0]), this;
   };
-  #n = (e, t) => {
-    let i, s, r, o, h;
+  #r = (e, t) => {
+    let i, s, n, o, h;
     if (t.tokenType === f.COEFFICIENT)
       e.push(new p(new a(t.token)));
     else if (t.tokenType === f.VARIABLE) {
@@ -1367,7 +1377,7 @@ class p {
           s = e.pop() ?? new p().one(), i = e.pop() ?? new p().one(), e.push(i.divide(s));
           break;
         case "^": {
-          h = e.pop()?.coefficient ?? new a().one(), r = e.pop() ?? new p().one(), o = r.variables[0], o && r.setLetter(o, h), e.push(r);
+          h = e.pop()?.coefficient ?? new a().one(), n = e.pop() ?? new p().one(), o = n.variables[0], o && n.setLetter(o, h), e.push(n);
           break;
         }
       }
@@ -1376,44 +1386,44 @@ class p {
     const i = [];
     for (let s = 0; s <= this.literal[t].value; s++)
       if (e.length === 0) {
-        const r = {};
-        r[t] = new a(s), i.push(r);
+        const n = {};
+        n[t] = new a(s), i.push(n);
       } else
-        for (const r of e) {
+        for (const n of e) {
           const o = {};
-          for (const h in r)
-            o[h] = r[h];
+          for (const h in n)
+            o[h] = n[h];
           o[t] = new a(s), i.push(o);
         }
     return i;
   }
 }
-function le(n, e = !0) {
-  return e ? `\\left( ${n} \\right)` : `(${n})`;
+function te(r, e = !0) {
+  return e ? `\\left( ${r} \\right)` : `(${r})`;
 }
-function Q(n, e, t, i, s) {
-  return n.map((r, o) => r === e ? t : r);
+function U(r, e, t, i, s) {
+  return r.map((n, o) => n === e ? t : n);
 }
-function de(n, e) {
+function se(r, e) {
   if (!Number.isSafeInteger(e))
     throw new Error("Can only raise item by an integer");
   if (e < 0)
     throw new Error("Can only raise item by a positive integer");
   if (e === 0)
-    return n.one();
-  const t = n.clone();
+    return r.one();
+  const t = r.clone();
   for (let i = 1; i < e; i++)
-    n.multiply(t);
-  return n;
+    r.multiply(t);
+  return r;
 }
 class u {
-  #t = "x";
+  #i = "x";
   #e;
-  #i;
+  #t;
   #s;
-  #r = !1;
+  #n = !1;
   constructor(e, ...t) {
-    return this.#i = [], this.#e = [], this.#s = [], e !== void 0 && this.parse(e, ...t), this;
+    return this.#t = [], this.#e = [], this.#s = [], e !== void 0 && this.parse(e, ...t), this;
   }
   /**
    * Parse a string to a polynom.
@@ -1421,17 +1431,17 @@ class u {
    * @param values
    */
   parse = (e, ...t) => {
-    if (this.#i = [], this.#e = [], typeof e == "string")
+    if (this.#t = [], this.#e = [], typeof e == "string")
       return this.#g(e, ...t);
     if ((typeof e == "number" || e instanceof a || e instanceof p) && t.length === 0)
-      this.#i.push(new p(e));
+      this.#t.push(new p(e));
     else if (e instanceof p && t.length > 0)
-      this.#i.push(new p(e)), t.forEach((i) => {
-        this.#i.push(new p(i));
+      this.#t.push(new p(e)), t.forEach((i) => {
+        this.#t.push(new p(i));
       });
     else if (e instanceof u)
       for (const i of e.monoms)
-        this.#i.push(i.clone());
+        this.#t.push(i.clone());
     return this;
   };
   /**
@@ -1439,7 +1449,7 @@ class u {
    */
   clone = () => {
     const e = new u(), t = [];
-    for (const i of this.#i)
+    for (const i of this.#t)
       t.push(i.clone());
     return e.monoms = t, e;
   };
@@ -1451,29 +1461,29 @@ class u {
   }
   add = (...e) => {
     for (const t of e)
-      t instanceof u ? this.#i = this.#i.concat(t.monoms) : t instanceof p ? this.#i.push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? this.#i.push(new p(t.toString())) : this.#i.push(new p(t));
+      t instanceof u ? this.#t = this.#t.concat(t.monoms) : t instanceof p ? this.#t.push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? this.#t.push(new p(t.toString())) : this.#t.push(new p(t));
     return this.reduce();
   };
   commonMonom = () => {
     const e = new p().one(), t = this.gcdNumerator(), i = this.gcdDenominator(), s = this.degree();
     e.coefficient = new a(t, i);
-    for (const r of this.variables) {
-      e.setLetter(r, s);
-      for (const o of this.#i)
-        if (e.setLetter(r, a.min(o.degree(r), e.degree(r))), e.degree(r).isZero())
+    for (const n of this.variables) {
+      e.setLetter(n, s);
+      for (const o of this.#t)
+        if (e.setLetter(n, a.min(o.degree(n), e.degree(n))), e.degree(n).isZero())
           break;
     }
     return e;
   };
   degree = (e) => {
     let t = new a().zero();
-    for (const i of this.#i)
+    for (const i of this.#t)
       t = a.max(i.degree(e).value, t);
     return t;
   };
   derivative = (e) => {
     const t = new u();
-    for (const i of this.#i)
+    for (const i of this.#t)
       t.add(i.derivative(e));
     return t.reduce();
   };
@@ -1490,13 +1500,13 @@ class u {
       {
         const { quotient: t, reminder: i } = this.euclidean(e);
         if (i.isZero())
-          return this.#i = t.monoms, this;
+          return this.#t = t.monoms, this;
       }
     } else if (typeof e == "string")
       return this.divide(new u(e));
     throw new Error(`Cannot divide by ${e}`);
   };
-  empty = () => (this.#i = [], this);
+  empty = () => (this.#t = [], this);
   /**
    * Divide the current polynom by another polynom.
    * @param P
@@ -1509,9 +1519,9 @@ class u {
         quotient: this.clone().divide(e).reduce(),
         reminder: new u().zero()
       };
-    const r = e.monomByDegree(void 0, t), o = e.degree(t);
+    const n = e.monomByDegree(void 0, t), o = e.degree(t);
     let h, l = this.degree(t).value * 2;
-    for (; s.degree(t).isGeq(o) && l > 0 && (l--, h = s.monomByDegree(void 0, t).clone().divide(r), !(!h.isZero() && (i.add(h), s.subtract(e.clone().multiply(h)).reduce(), h.degree(t).isZero()))); )
+    for (; s.degree(t).isGeq(o) && l > 0 && (l--, h = s.monomByDegree(void 0, t).clone().divide(n), !(!h.isZero() && (i.add(h), s.subtract(e.clone().multiply(h)).reduce(), h.degree(t).isZero()))); )
       ;
     return i.reduce(), s.reduce(), { quotient: i, reminder: s };
   };
@@ -1519,7 +1529,7 @@ class u {
     if (t)
       return this.#a(e);
     const i = new a().zero();
-    return this.#i.forEach((s) => {
+    return this.#t.forEach((s) => {
       i.add(s.evaluate(e, t));
     }), i;
   };
@@ -1536,9 +1546,9 @@ class u {
       const h = new u(s);
       t = [h.clone()], i = i.euclidean(h).quotient;
     }
-    let r = i.degree().clone().multiply(2).value, o = 1;
-    for (; r >= 0; )
-      if (r--, i.monoms.length < 2) {
+    let n = i.degree().clone().multiply(2).value, o = 1;
+    for (; n >= 0; )
+      if (n--, i.monoms.length < 2) {
         i.isOne() || (t.push(i.clone()), i.one());
         break;
       } else if (i.degree(e).isOne()) {
@@ -1562,11 +1572,11 @@ class u {
     return i.isOne() || t.push(i.clone()), this.#e = t, this.#e;
   };
   fromCoefficients(...e) {
-    this.#i = [];
-    const t = this.#t ?? "x";
+    this.#t = [];
+    const t = this.#i ?? "x";
     return e.reverse().forEach((i, s) => {
-      const r = new p();
-      r.coefficient = new a(i), r.setLetter(t, s), this.#i.push(r);
+      const n = new p();
+      n.coefficient = new a(i), n.setLetter(t, s), this.#t.push(n);
     }), this.reorder();
   }
   gcdDenominator = () => E.gcd(...this.getDenominators());
@@ -1574,30 +1584,30 @@ class u {
   getCoefficients() {
     const e = this.clone().reorder(), t = this.degree().value + 1, i = new Array(t).fill(new a(0));
     return e.monoms.forEach((s) => {
-      const r = t - s.degree().value - 1;
-      i[r] = s.coefficient.clone();
+      const n = t - s.degree().value - 1;
+      i[n] = s.coefficient.clone();
     }), i;
   }
   // Next functions are used for for commonMonom, which is used in the factorize method.
   getDenominators = () => {
     const e = [];
-    for (const t of this.#i)
+    for (const t of this.#t)
       e.push(t.coefficient.denominator);
     return e;
   };
   getNumerators = () => {
     const e = [];
-    for (const t of this.#i)
+    for (const t of this.#t)
       e.push(t.coefficient.numerator);
     return e;
   };
-  getZeroes = () => this.degree().isZero() ? [] : (this.roots = new J(this.clone()).solve(), this.roots);
+  getZeroes = () => this.degree().isZero() ? [] : (this.roots = new W(this.clone()).solve(), this.roots);
   hasVariable(e) {
     return this.variables.includes(e);
   }
   integrate = (e, t, i = "x") => {
-    const s = this.primitive(i), r = {}, o = {};
-    return r[i] = new a(e), o[i] = new a(t), s.evaluate(o).subtract(s.evaluate(r));
+    const s = this.primitive(i), n = {}, o = {};
+    return n[i] = new a(e), o[i] = new a(t), s.evaluate(o).subtract(s.evaluate(n));
   };
   inverse() {
   }
@@ -1622,14 +1632,14 @@ class u {
       return t.isZero();
     }
   };
-  isEqual = (e) => this.#n(e, "=");
+  isEqual = (e) => this.#r(e, "=");
   get isMultiVariable() {
-    return this.#i.some((e) => e.variables.length > 1);
+    return this.#t.some((e) => e.variables.length > 1);
   }
   isOne() {
-    return this.#i.length === 1 && this.#i[0].coefficient.isOne() && this.degree().isZero();
+    return this.#t.length === 1 && this.#t[0].coefficient.isOne() && this.degree().isZero();
   }
-  isOppositeAt = (e) => this.#n(e.clone().opposite(), "=");
+  isOppositeAt = (e) => this.#r(e.clone().opposite(), "=");
   isReduced = (e) => {
     if (!this.isDeveloped(e))
       return !1;
@@ -1641,18 +1651,18 @@ class u {
         return !1;
     return !1;
   };
-  isSameAs = (e) => this.#n(e, "same");
+  isSameAs = (e) => this.#r(e, "same");
   isZero() {
-    return this.#i.length === 1 && this.#i[0].coefficient.isZero() || this.#i.length === 0;
+    return this.#t.length === 1 && this.#t[0].coefficient.isZero() || this.#t.length === 0;
   }
   lcmDenominator = () => E.lcm(...this.getDenominators());
   lcmNumerator = () => E.lcm(...this.getNumerators());
   get length() {
-    return this.#i.length;
+    return this.#t.length;
   }
   letters = () => {
     let e = /* @__PURE__ */ new Set();
-    for (const t of this.#i)
+    for (const t of this.#t)
       e = /* @__PURE__ */ new Set([...e, ...t.variables]);
     return [...e];
   };
@@ -1668,7 +1678,7 @@ class u {
     if (e === void 0)
       return this.monomByDegree(this.degree(t), t);
     const i = this.clone().reduce();
-    for (const s of i.#i)
+    for (const s of i.#t)
       if (s.degree(t).isEqual(e))
         return s.clone();
     return new p().zero();
@@ -1676,24 +1686,24 @@ class u {
   // Used in LinearSystem.tex
   monomByLetter = (e) => {
     const t = this.clone().reduce();
-    for (const i of t.#i)
+    for (const i of t.#t)
       if (i.hasVariable(e))
         return i.clone();
     return new p().zero();
   };
   // ------------------------------------------
   get monoms() {
-    return this.#i;
+    return this.#t;
   }
   set monoms(e) {
-    this.#i = e;
+    this.#t = e;
   }
   monomsByDegree = (e, t) => {
     if (e === void 0)
       return this.monomsByDegree(this.degree(t));
     const i = [], s = this.clone().reduce();
-    for (const r of s.#i)
-      r.degree(t).isEqual(e) && i.push(r.clone());
+    for (const n of s.#t)
+      n.degree(t).isEqual(e) && i.push(n.clone());
     return i;
   };
   multiply = (e) => {
@@ -1717,40 +1727,40 @@ class u {
   get numberOfVars() {
     return this.variables.length;
   }
-  one = () => (this.#i = [], this.#i.push(new p().one()), this);
+  one = () => (this.#t = [], this.#t.push(new p().one()), this);
   // ------------------------------------------
-  opposite = () => (this.#i = this.#i.map((e) => e.opposite()), this);
+  opposite = () => (this.#t = this.#t.map((e) => e.opposite()), this);
   get plotFunction() {
     return this.#l("tex", !1, !1, !0);
   }
-  pow = (e) => de(this, e).reduce();
+  pow = (e) => se(this, e).reduce();
   primitive = (e) => {
     const t = new u();
-    for (const i of this.#i)
+    for (const i of this.#t)
       t.add(i.primitive(e));
     return t;
   };
   reduce = () => {
     let e = 0;
-    for (; e < this.#i.length; ) {
-      for (let t = e + 1; t < this.#i.length; t++)
-        this.#i[e].isSameAs(this.#i[t]) && (this.#i[e].add(this.#i[t]), this.#i.splice(t, 1), this.#i[e].isZero() && (this.#i[e] = new p().zero()), t--);
+    for (; e < this.#t.length; ) {
+      for (let t = e + 1; t < this.#t.length; t++)
+        this.#t[e].isSameAs(this.#t[t]) && (this.#t[e].add(this.#t[t]), this.#t.splice(t, 1), this.#t[e].isZero() && (this.#t[e] = new p().zero()), t--);
       e++;
     }
-    this.#i = this.#i.filter((t) => !t.coefficient.isZero());
-    for (const t of this.#i)
+    this.#t = this.#t.filter((t) => !t.coefficient.isZero());
+    for (const t of this.#t)
       t.coefficient.reduce();
     return this.length === 0 ? new u().zero() : this.reorder();
   };
   reorder = (e = "x", t = !1) => {
     const i = this.variables.filter((s) => s !== e);
-    return this.#i.sort(function(s, r) {
-      const o = s.degree(e).value, h = r.degree(e).value;
+    return this.#t.sort(function(s, n) {
+      const o = s.degree(e).value, h = n.degree(e).value;
       if (o !== h)
         return t ? o - h : h - o;
       if (i.length > 0)
         for (const l of i) {
-          const c = s.degree(l).value, d = r.degree(l).value;
+          const c = s.degree(l).value, d = n.degree(l).value;
           if (c !== d)
             return t ? c - d : d - c;
         }
@@ -1765,29 +1775,29 @@ class u {
   replaceBy = (e, t) => {
     let i;
     const s = new u().zero();
-    for (const r of this.monoms)
-      !r.hasVariable(e) || r.literal[e].isZero() ? s.add(r.clone()) : (i = r.literal[e].clone(), r.removeVariable(e), s.add(t.clone().pow(Math.abs(i.numerator)).multiply(r)));
-    return this.#i = s.reduce().monoms, this;
+    for (const n of this.monoms)
+      !n.hasVariable(e) || n.literal[e].isZero() ? s.add(n.clone()) : (i = n.literal[e].clone(), n.removeVariable(e), s.add(t.clone().pow(Math.abs(i.numerator)).multiply(n)));
+    return this.#t = s.reduce().monoms, this;
   };
   // ------------------------------------------
   root() {
     throw new Error("Cannot take the root from a polynom");
   }
   get roots() {
-    return this.#r ? this.#s : this.getZeroes();
+    return this.#n ? this.#s : this.getZeroes();
   }
   set roots(e) {
-    this.#r = !0, this.#s = e;
+    this.#n = !0, this.#s = e;
   }
   setVariable(e) {
-    return this.#t = e, this;
+    return this.#i = e, this;
   }
   sqrt() {
     throw new Error("Cannot take the square root from a polynom");
   }
   subtract = (...e) => {
     for (const t of e)
-      t instanceof u ? this.add(t.clone().opposite()) : t instanceof p ? this.#i.push(t.clone().opposite()) : this.#i.push(new p(t).opposite());
+      t instanceof u ? this.add(t.clone().opposite()) : t instanceof p ? this.#t.push(t.clone().opposite()) : this.#t.push(new p(t).opposite());
     return this.reduce();
   };
   tableOfSigns() {
@@ -1795,17 +1805,17 @@ class u {
     let t = new Array(2 * e.length + 1).fill("").map((i, s) => s % 2 === 0 ? "" : "z");
     if (t.length === 1) {
       const [i] = this.getCoefficients().map((s) => s.value);
-      t = Q(t, "", i > 0 ? "+" : "-");
+      t = U(t, "", i > 0 ? "+" : "-");
     } else if (this.degree().isOne()) {
       const [i] = this.getCoefficients().map((s) => s.value);
       t[0] = i > 0 ? "-" : "+", t[1] = "z", t[2] = i > 0 ? "+" : "-";
     } else
       [
         e[0].value - 1,
-        ...e.map((s, r) => r === e.length - 1 ? e[r].value + 1 : (e[r].value + e[r + 1].value) / 2)
-      ].forEach((s, r) => {
+        ...e.map((s, n) => n === e.length - 1 ? e[n].value + 1 : (e[n].value + e[n + 1].value) / 2)
+      ].forEach((s, n) => {
         const o = this.evaluate({ x: s }, !0);
-        t[r * 2] = o > 0 ? "+" : "-";
+        t[n * 2] = o > 0 ? "+" : "-";
       });
     return { roots: e, signs: t };
   }
@@ -1815,7 +1825,7 @@ class u {
   }
   get variables() {
     let e = [];
-    for (const t of this.#i)
+    for (const t of this.#t)
       e = e.concat(t.variables);
     return e = [...new Set(e)], e.sort(), e;
   }
@@ -1823,43 +1833,43 @@ class u {
    * Set the polynom to zero.
    * @returns {this}
    */
-  zero = () => (this.#i = [], this.#i.push(new p().zero()), this);
+  zero = () => (this.#t = [], this.#t.push(new p().zero()), this);
   get zeroes() {
     return this.getZeroes();
   }
-  #n = (e, t) => {
+  #r = (e, t) => {
     t ??= "=";
     const i = this.clone().reduce().reorder(), s = e.clone().reduce().reorder();
     switch (t) {
       case "=":
-        return i.length !== s.length || !i.degree().isEqual(s.degree()) ? !1 : i.monoms.every((r, o) => r.isEqual(s.monoms[o]));
+        return i.length !== s.length || !i.degree().isEqual(s.degree()) ? !1 : i.monoms.every((n, o) => n.isEqual(s.monoms[o]));
       case "same":
-        return i.length !== s.length || !i.degree().isEqual(s.degree()) ? !1 : i.monoms.every((r, o) => r.isSameAs(s.monoms[o]));
+        return i.length !== s.length || !i.degree().isEqual(s.degree()) ? !1 : i.monoms.every((n, o) => n.isSameAs(s.monoms[o]));
       default:
         return !1;
     }
   };
   #o = (e) => {
-    for (const t of this.#i)
+    for (const t of this.#t)
       t.coefficient.divide(e);
     return this;
   };
   #h = (e) => {
     const t = new a(e);
-    for (const i of this.#i)
+    for (const i of this.#t)
       i.coefficient.divide(t);
     return this;
   };
   #a = (e) => {
     let t = 0;
-    return this.#i.forEach((i) => {
+    return this.#t.forEach((i) => {
       t += i.evaluate(e, !0);
     }), t;
   };
   #c = (e) => {
-    let t, i, s, r, o, h, l, c, d;
+    let t, i, s, n, o, h, l, c, d;
     if (this.numberOfVars === 1)
-      return s = this.monomByDegree(2, e).coefficient, r = this.monomByDegree(1, e).coefficient, o = this.monomByDegree(0, e).coefficient, h = r.clone().pow(2).subtract(s.clone().multiply(o).multiply(4)), h.isZero() ? (l = r.clone().opposite().divide(s.clone().multiply(2)), t = new u(e).subtract(l.display).multiply(l.denominator), i = new u(e).subtract(l.display).multiply(l.denominator), d = s.divide(l.denominator).divide(l.denominator), d.isOne() ? [t, i] : [new u(d.display), t, i]) : h.isPositive() && h.isSquare() ? (l = r.clone().opposite().add(h.clone().sqrt()).divide(s.clone().multiply(2)), c = r.clone().opposite().subtract(h.clone().sqrt()).divide(s.clone().multiply(2)), d = s.divide(l.denominator).divide(c.denominator), d.isOne() ? [
+      return s = this.monomByDegree(2, e).coefficient, n = this.monomByDegree(1, e).coefficient, o = this.monomByDegree(0, e).coefficient, h = n.clone().pow(2).subtract(s.clone().multiply(o).multiply(4)), h.isZero() ? (l = n.clone().opposite().divide(s.clone().multiply(2)), t = new u(e).subtract(l.display).multiply(l.denominator), i = new u(e).subtract(l.display).multiply(l.denominator), d = s.divide(l.denominator).divide(l.denominator), d.isOne() ? [t, i] : [new u(d.display), t, i]) : h.isPositive() && h.isSquare() ? (l = n.clone().opposite().add(h.clone().sqrt()).divide(s.clone().multiply(2)), c = n.clone().opposite().subtract(h.clone().sqrt()).divide(s.clone().multiply(2)), d = s.divide(l.denominator).divide(c.denominator), d.isOne() ? [
         new u(e).subtract(l.display).multiply(l.denominator),
         new u(e).subtract(c.display).multiply(c.denominator)
       ] : [
@@ -1867,56 +1877,56 @@ class u {
         new u(e).subtract(l.display).multiply(l.denominator),
         new u(e).subtract(c.display).multiply(c.denominator)
       ]) : [this.clone()];
-    if (s = this.monomByDegree(2, e), r = this.monomByDegree(1, e), o = this.monomByDegree(0, e), s.isLiteralSquare() && o.isLiteralSquare() && r.clone().pow(2).isSameAs(s.clone().multiply(o))) {
-      const w = new u("x", s.coefficient, r.coefficient, o.coefficient).#c("x"), N = [];
+    if (s = this.monomByDegree(2, e), n = this.monomByDegree(1, e), o = this.monomByDegree(0, e), s.isLiteralSquare() && o.isLiteralSquare() && n.clone().pow(2).isSameAs(s.clone().multiply(o))) {
+      const w = new u("x", s.coefficient, n.coefficient, o.coefficient).#c("x"), N = [];
       let A;
       if (w.length >= 2) {
-        for (const k of w)
-          k.degree().isZero() ? N.push(k.clone()) : (A = k.clone(), A.monoms[0].literal = s.literalSqrt, A.monoms[1].literal = o.literalSqrt, N.push(A.clone()));
+        for (const C of w)
+          C.degree().isZero() ? N.push(C.clone()) : (A = C.clone(), A.monoms[0].literal = s.literalSqrt, A.monoms[1].literal = o.literalSqrt, N.push(A.clone()));
         return N;
       }
     }
     return [this.clone()];
   };
   #l = (e, t, i, s) => {
-    let r = "";
-    for (const o of this.#i) {
+    let n = "";
+    for (const o of this.#t) {
       if (o.coefficient.value === 0)
         continue;
       let h;
-      s ? h = o.plotFunction : h = e === "tex" ? o.tex : o.display, r += `${o.coefficient.sign() === 1 && (r !== "" || t === !0) ? "+" : ""}${h}`;
+      s ? h = o.plotFunction : h = e === "tex" ? o.tex : o.display, n += `${o.coefficient.sign() === 1 && (n !== "" || t === !0) ? "+" : ""}${h}`;
     }
-    return i === !0 && this.length > 1 && (e === "tex" ? r = `\\left( ${r} \\right)` : r = `(${r})`), r === "" && (r = "0"), r;
+    return i === !0 && this.length > 1 && (e === "tex" ? n = `\\left( ${n} \\right)` : n = `(${n})`), n === "" && (n = "0"), n;
   };
   #u = (e, t, i) => {
-    const s = e.monoms[0].dividers, r = e.monoms[e.monoms.length - 1].dividers, o = [];
+    const s = e.monoms[0].dividers, n = e.monoms[e.monoms.length - 1].dividers, o = [];
     return s.forEach((h) => {
-      h.degree(i).isLeq(t) && r.forEach((l) => {
+      h.degree(i).isLeq(t) && n.forEach((l) => {
         h.degree(i).isNotEqual(l.degree(i)) && (o.push(new u(h, l)), o.push(new u(h, l.clone().opposite())));
       });
     }), o;
   };
   #f = (e) => {
-    for (const t of this.#i)
+    for (const t of this.#t)
       t.coefficient.multiply(e);
     return this.reduce();
   };
   #d = (e) => this.#f(new a(e));
   #p = (e) => {
-    for (const t of this.#i)
+    for (const t of this.#t)
       t.multiply(e);
     return this.reduce();
   };
   #m = (e) => {
     const t = [];
-    for (const i of this.#i)
+    for (const i of this.#t)
       for (const s of e.monoms)
         t.push(p.xMultiply(i, s));
-    return this.#i = t, this.reduce();
+    return this.#t = t, this.reduce();
   };
   #g(e, ...t) {
     if (t.length === 0) {
-      if (console.log(e, Number(e)), e !== "" && !isNaN(Number(e))) {
+      if (e !== "" && !isNaN(Number(e))) {
         this.empty();
         const i = new p(Number(e));
         return this.add(i), this;
@@ -1929,16 +1939,16 @@ class u {
         const s = e.split("");
         if (s.length < t.length - 2)
           throw new Error("Too many factors for too few variables !");
-        let r = 0;
+        let n = 0;
         for (const o of i) {
           const h = new p();
-          h.coefficient = o.clone(), h.literalStr = s[r] || "", this.add(h), r++;
+          h.coefficient = o.clone(), h.literalStr = s[n] || "", this.add(h), n++;
         }
       } else {
         let s = i.length - 1;
-        for (const r of i) {
+        for (const n of i) {
           const o = new p();
-          o.coefficient = r.clone(), o.literalStr = `${e}^${s}`, this.add(o), s--;
+          o.coefficient = n.clone(), o.literalStr = `${e}^${s}`, this.add(o), s--;
         }
       }
       return this;
@@ -1950,11 +1960,11 @@ class u {
    * @param inputStr
    */
   #w = (e) => {
-    const i = new _().parse(e).rpn;
+    const i = new X().parse(e).rpn;
     this.zero();
     const s = [];
-    for (const r of i)
-      this.#y(s, r);
+    for (const n of i)
+      this.#y(s, n);
     return s.length === 1 && this.add(s[0]), this.reorder();
   };
   #y = (e, t) => {
@@ -1987,8 +1997,8 @@ class u {
             if (i.monoms[0].coefficient.isRelative())
               e.push(s.pow(i.monoms[0].coefficient.value));
             else if (s.monoms.length === 1 && s.monoms[0].coefficient.isOne()) {
-              for (const r in s.monoms[0].literal)
-                s.monoms[0].literal[r].multiply(i.monoms[0].coefficient);
+              for (const n in s.monoms[0].literal)
+                s.monoms[0].literal[n].multiply(i.monoms[0].coefficient);
               e.push(s);
             } else
               console.error("Cannot have power with fraction");
@@ -2010,13 +2020,13 @@ class u {
 }
 class y {
   // Left part of the equation
-  #t;
+  #i;
   // Right part of the equation
   #e;
   // Signe of the equation
-  #i;
+  #t;
   constructor(e, t, i) {
-    if (this.#t = new u().zero(), this.#e = new u().zero(), this.#i = "=", e !== void 0 && t === void 0) {
+    if (this.#i = new u().zero(), this.#e = new u().zero(), this.#t = "=", e !== void 0 && t === void 0) {
       if (e instanceof y)
         return e.clone();
       typeof e == "string" && this.parse(e);
@@ -2029,10 +2039,10 @@ class y {
     if (t === !1)
       throw new Error("The equation is not valid (no sign found)");
     const i = e.split(t);
-    return this.create(new u(i[0]), new u(i[1]), this.#r(t));
+    return this.create(new u(i[0]), new u(i[1]), this.#n(t));
   };
-  create = (e, t, i) => (this.#t = e, this.#e = t, this.#i = this.#r(i ?? "="), this);
-  clone = () => new y(this.#t.clone(), this.#e.clone(), this.#i);
+  create = (e, t, i) => (this.#i = e, this.#e = t, this.#t = this.#n(i ?? "="), this);
+  clone = () => new y(this.#i.clone(), this.#e.clone(), this.#t);
   /**
    * Add a value to the equation
    * if value is an equation, add the left part to the left part of the equation
@@ -2043,17 +2053,17 @@ class y {
    */
   add(e) {
     if (e instanceof y)
-      return this.#t.add(e.left), this.#e.add(e.right), this;
+      return this.#i.add(e.left), this.#e.add(e.right), this;
     if (typeof e == "string" && !y.isEquationString(e))
       return this.add(new y(e));
     const t = new u(e);
-    return this.#t.add(t), this.#e.add(t), this;
+    return this.#i.add(t), this.#e.add(t), this;
   }
   /**
    * Get the degree of the equation
    * @param letter
    */
-  degree = (e) => a.max(this.#t.degree(e), this.#e.degree(e));
+  degree = (e) => a.max(this.#i.degree(e), this.#e.degree(e));
   /**
    * divide an equation by a given value (transformed as a fraction)
    *
@@ -2079,7 +2089,7 @@ class y {
    * @param asNumeric
    */
   evaluate(e, t) {
-    const i = this.#t.evaluate(e, t), s = this.#e.evaluate(e, t);
+    const i = this.#i.evaluate(e, t), s = this.#e.evaluate(e, t);
     return t ? i === s : i.isEqual(s);
   }
   /**
@@ -2089,7 +2099,7 @@ class y {
   hasVariable = (e) => this.variables.includes(e);
   isEqual(e) {
     const t = new y(e);
-    return t.left.isEqual(this.#t) && t.right.isEqual(this.#e);
+    return t.left.isEqual(this.#i) && t.right.isEqual(this.#e);
   }
   isLinearTo = (e) => {
     const t = e.clone().moveLeft().simplify().left, i = this.clone().moveLeft().simplify().left;
@@ -2098,7 +2108,7 @@ class y {
   /**
    * Determine if the equation contains more than one letter/variable.
    */
-  isMultiVariable = () => this.#t.isMultiVariable || this.#e.isMultiVariable;
+  isMultiVariable = () => this.#i.isMultiVariable || this.#e.isMultiVariable;
   // -----------------------------------------------
   // Equations helpers
   isEqualTo = (e) => {
@@ -2113,79 +2123,79 @@ class y {
     if (!this.degree(e).isOne() || this.isMultiVariable())
       return !1;
     let t;
-    this.#t.subtract(this.#e), this.#e.zero();
-    const i = [...this.#t.monoms];
-    for (const r of i)
-      r.hasVariable(e) || (t = r.clone(), this.#t.subtract(t), this.#e.subtract(t));
-    if (this.#t.length !== 1)
+    this.#i.subtract(this.#e), this.#e.zero();
+    const i = [...this.#i.monoms];
+    for (const n of i)
+      n.hasVariable(e) || (t = n.clone(), this.#i.subtract(t), this.#e.subtract(t));
+    if (this.#i.length !== 1)
       return !1;
-    const s = this.#t.monoms[0].coefficient.clone();
-    return this.#t.divide(s), this.#e.divide(s), this;
+    const s = this.#i.monoms[0].coefficient.clone();
+    return this.#i.divide(s), this.#e.divide(s), this;
   };
   // -----------------------------------------------
   // Equations operations
   // -----------------------------------------------
-  letters = () => [.../* @__PURE__ */ new Set([...this.#t.letters(), ...this.#e.letters()])];
+  letters = () => [.../* @__PURE__ */ new Set([...this.#i.letters(), ...this.#e.letters()])];
   // -----------------------------------------------
   /**
    * Reorder will move all monoms containing a letter on the left, all the other on the right.
    */
-  moveLeft = () => (this.#t.subtract(this.#e), this.#e.zero(), this);
+  moveLeft = () => (this.#i.subtract(this.#e), this.#e.zero(), this);
   /**
    * Multiple an equation by a fraction value.
    * @param value
    */
   multiply = (e) => {
     const t = new a(e);
-    return this.#t.multiply(t), this.#e.multiply(t), this.#i !== "=" && t.sign() === -1 && this.#n(), this;
+    return this.#i.multiply(t), this.#e.multiply(t), this.#t !== "=" && t.sign() === -1 && this.#r(), this;
   };
   pow(e) {
-    return this.#t.pow(e), this.#e.pow(e), this;
+    return this.#i.pow(e), this.#e.pow(e), this;
   }
-  opposite = () => (this.#t = this.#t.opposite(), this.#e = this.#e.opposite(), this);
+  opposite = () => (this.#i = this.#i.opposite(), this.#e = this.#e.opposite(), this);
   reduce() {
-    return this.moveLeft(), this.#t.reduce(), this.simplify(), this.#t.monoms[0].coefficient.isNegative() && this.multiply(-1), this;
+    return this.moveLeft(), this.#i.reduce(), this.simplify(), this.#i.monoms[0].coefficient.isNegative() && this.multiply(-1), this;
   }
-  reorder = (e) => (this.#t.subtract(this.#e), this.#e.zero(), this.#t.reorder(), e ? this : (this.#t.monoms.filter((t) => t.degree().isZero()).forEach((t) => {
+  reorder = (e) => (this.#i.subtract(this.#e), this.#e.zero(), this.#i.reorder(), e ? this : (this.#i.monoms.filter((t) => t.degree().isZero()).forEach((t) => {
     const i = t.clone();
-    this.#t.subtract(i), this.#e.subtract(i);
-  }), this.#t.reorder(), this.#e.reorder(), this));
+    this.#i.subtract(i), this.#e.subtract(i);
+  }), this.#i.reorder(), this.#e.reorder(), this));
   // ------------------------------------------
-  replaceBy = (e, t) => (this.#t.replaceBy(e, t), this.#e.replaceBy(e, t), this);
+  replaceBy = (e, t) => (this.#i.replaceBy(e, t), this.#e.replaceBy(e, t), this);
   /**
    * Multiply by the lcm denominator and divide by the gcm numerators.
    */
-  simplify = () => (this.multiply(E.lcm(...this.#t.getDenominators(), ...this.#e.getDenominators())), this.divide(E.gcd(...this.#t.getNumerators(), ...this.#e.getNumerators())), this);
+  simplify = () => (this.multiply(E.lcm(...this.#i.getDenominators(), ...this.#e.getDenominators())), this.divide(E.gcd(...this.#i.getNumerators(), ...this.#e.getNumerators())), this);
   // -----------------------------------------------
-  solve = () => new J(this.clone()).solve();
+  solve = () => new W(this.clone()).solve();
   split() {
-    return [this.#t.clone(), this.#e.clone()];
+    return [this.#i.clone(), this.#e.clone()];
   }
   subtract(e) {
     if (e instanceof y)
-      return this.#t.subtract(e.left), this.#e.subtract(e.right), this;
+      return this.#i.subtract(e.left), this.#e.subtract(e.right), this;
     if (typeof e == "string" && !y.isEquationString(e))
       return this.subtract(new y(e));
     const t = new u(e);
-    return this.#t.subtract(t), this.#e.subtract(t), this;
+    return this.#i.subtract(t), this.#e.subtract(t), this;
   }
   test = (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e));
   static isEquationString(e) {
     return e.includes("=") || e.includes("<") || e.includes(">") || e.includes("<=") || e.includes(">=");
   }
   static makeSolutionsUnique(e, t) {
-    const i = [], s = e.filter((r) => i.includes(r.tex) ? !1 : (i.push(r.tex), !0));
-    return t === !0 && s.sort((r, o) => r.value - o.value), s;
+    const i = [], s = e.filter((n) => i.includes(n.tex) ? !1 : (i.push(n.tex), !0));
+    return t === !0 && s.sort((n, o) => n.value - o.value), s;
   }
   get display() {
-    return `${this.#t.display}${this.signAsTex}${this.#e.display}`;
+    return `${this.#i.display}${this.signAsTex}${this.#e.display}`;
   }
   // Getter and setter
   get left() {
-    return this.#t;
+    return this.#i;
   }
   set left(e) {
-    this.#t = e;
+    this.#i = e;
   }
   get numberOfVars() {
     return this.variables.length;
@@ -2198,19 +2208,19 @@ class y {
   }
   // ------------------------------------------
   get sign() {
-    return this.#i;
+    return this.#t;
   }
   set sign(e) {
-    this.#i = this.#r(e);
+    this.#t = this.#n(e);
   }
   get signAsTex() {
-    return this.#i === ">=" ? "\\geq" : this.#i === "<=" ? "\\leq" : this.#i;
+    return this.#t === ">=" ? "\\geq" : this.#t === "<=" ? "\\leq" : this.#t;
   }
   get tex() {
-    return `${this.#t.tex}${this.signAsTex}${this.#e.tex}`;
+    return `${this.#i.tex}${this.signAsTex}${this.#e.tex}`;
   }
   get variables() {
-    return [...new Set(this.#e.variables.concat(this.#t.variables))];
+    return [...new Set(this.#e.variables.concat(this.#i.variables))];
   }
   #s = (e) => {
     if (e.includes("geq"))
@@ -2235,16 +2245,16 @@ class y {
   };
   // -----------------------------------------------
   // Equations solving algorithms
-  #r = (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=";
-  #n = () => this.#i === "=" ? this : this.#i.includes("<") ? (this.#i.replace("<", ">"), this) : this.#i.includes(">") ? (this.#i.replace(">", "<"), this) : this;
+  #n = (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=";
+  #r = () => this.#t === "=" ? this : this.#t.includes("<") ? (this.#t.replace("<", ">"), this) : this.#t.includes(">") ? (this.#t.replace(">", "<"), this) : this;
 }
 class x {
-  #t;
-  #e;
   #i;
+  #e;
+  #t;
   #s = !1;
   constructor(e, t) {
-    return e instanceof x ? (this.#e = e.polynom.clone(), this.#i = e.power.clone(), t !== void 0 && this.#i.multiply(new a(t))) : e !== void 0 ? (this.#e = new u(e), this.#i = new a(t ?? 1)) : (this.#e = new u(), this.#i = new a(1)), this.#t = 1, this;
+    return e instanceof x ? (this.#e = e.polynom.clone(), this.#t = e.power.clone(), t !== void 0 && this.#t.multiply(new a(t))) : e !== void 0 ? (this.#e = new u(e), this.#t = new a(t ?? 1)) : (this.#e = new u(), this.#t = new a(1)), this.#i = 1, this;
   }
   parse() {
     throw new Error("Method not implemented.");
@@ -2253,17 +2263,17 @@ class x {
     return new x(this);
   }
   fromPolynom(e) {
-    return this.#e = new u(e), this.#i = new a(1), this;
+    return this.#e = new u(e), this.#t = new a(1), this;
   }
   get tex() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, s;
-    return this.#t === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, s = e === 1 ? "" : `^{ ${e} }`) : (i = this.#s && this.power.isOne() ? this.polynom.tex : le(this.polynom.tex), s = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${s}`, this.#t === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
+    return this.#i === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, s = e === 1 ? "" : `^{ ${e} }`) : (i = this.#s && this.power.isOne() ? this.polynom.tex : te(this.polynom.tex), s = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${s}`, this.#i === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
   }
   get display() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, s;
-    return this.#t === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, s = e === 1 ? "" : `^(${e})`) : (i = this.#s && this.power.isOne() ? this.polynom.display : le(this.polynom.display, !1), s = t === 1 && e === 1 ? "" : `^(${this.power.display})`), i = `${i}${s}`, this.#t === 0 && e < 0 && (i = `1/(${i})`), i;
+    return this.#i === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, s = e === 1 ? "" : `^(${e})`) : (i = this.#s && this.power.isOne() ? this.polynom.display : te(this.polynom.display, !1), s = t === 1 && e === 1 ? "" : `^(${this.power.display})`), i = `${i}${s}`, this.#i === 0 && e < 0 && (i = `1/(${i})`), i;
   }
   add() {
     throw new Error("Adding two factors is not possible");
@@ -2325,7 +2335,7 @@ class x {
     throw new Error("The two factors must be the same");
   }
   one() {
-    return this.#e.one(), this.#i.one(), this;
+    return this.#e.one(), this.#t.one(), this;
   }
   opposite() {
     throw new Error("Method not implemented.");
@@ -2340,10 +2350,10 @@ class x {
     return this.power.multiply(e), this;
   }
   get power() {
-    return this.#i;
+    return this.#t;
   }
   set power(e) {
-    this.#i = new a(e);
+    this.#t = new a(e);
   }
   primitive() {
     throw new Error("Method not implemented.");
@@ -2362,68 +2372,68 @@ class x {
   }
   tableOfSigns() {
     const e = this.power.clone().reduce(), t = this.polynom.tableOfSigns();
-    return e.isStrictlyNegative() && (t.signs = Q(t.signs, "z", "d")), e.denominator % 2 === 0 ? t.signs = Q(t.signs, "-", "h") : e.numerator % 2 === 0 && (t.signs = Q(t.signs, "-", "+")), { roots: t.roots, signs: t.signs };
+    return e.isStrictlyNegative() && (t.signs = U(t.signs, "z", "d")), e.denominator % 2 === 0 ? t.signs = U(t.signs, "-", "h") : e.numerator % 2 === 0 && (t.signs = U(t.signs, "-", "+")), { roots: t.roots, signs: t.signs };
   }
   get variables() {
     return this.polynom.variables;
   }
   get withPower() {
-    return this.#t = 1, this;
+    return this.#i = 1, this;
   }
   get withRoot() {
-    return this.#t = 0, this;
+    return this.#i = 0, this;
   }
   zero() {
-    return this.#e.zero(), this.#i.one(), this;
+    return this.#e.zero(), this.#t.one(), this;
   }
 }
-var G = /* @__PURE__ */ ((n) => (n[n.ROOT = 0] = "ROOT", n[n.POWER = 1] = "POWER", n))(G || {});
-class Z {
-  #t;
+var Z = /* @__PURE__ */ ((r) => (r[r.ROOT = 0] = "ROOT", r[r.POWER = 1] = "POWER", r))(Z || {});
+class D {
+  #i;
   // Determine the letters in the linear system, usually ['x', 'y']
   #e;
   constructor(...e) {
-    return this.#t = [], this.#e = [], e.length > 0 && this.parse(...e), this;
+    return this.#i = [], this.#e = [], e.length > 0 && this.parse(...e), this;
   }
-  parse = (...e) => (this.#t = e.map((t) => new y(t)), this.#i(), this);
-  clone = () => new Z().parse(...this.#t.map((e) => e.clone()));
+  parse = (...e) => (this.#i = e.map((t) => new y(t)), this.#t(), this);
+  clone = () => new D().parse(...this.#i.map((e) => e.clone()));
   static fromMatrix(e, t = "xyz") {
     const i = e[0].length;
-    if (e.some((r) => r.length !== i))
+    if (e.some((n) => n.length !== i))
       throw new Error("All rows must have the same number of columns");
     const s = t.split("").splice(0, i - 1);
-    return new Z(
-      ...e.map((r) => {
-        const o = new u(s.join(""), ...r);
+    return new D(
+      ...e.map((n) => {
+        const o = new u(s.join(""), ...n);
         return new y(o, 0);
       })
     );
   }
   add(e, t) {
-    if (e instanceof Z) {
+    if (e instanceof D) {
       const i = e.equations.length;
-      if (i !== this.#t.length)
+      if (i !== this.#i.length)
         throw new Error("The number of equations must be the same");
       for (let s = 0; s < i; s++)
-        this.#t[s].add(e.equations[s]);
+        this.#i[s].add(e.equations[s]);
     } else {
-      if (t === void 0 || t < 0 || t >= this.#t.length)
+      if (t === void 0 || t < 0 || t >= this.#i.length)
         throw new Error("Index out of range");
       const i = new y(e);
-      this.#t[t].add(i);
+      this.#i[t].add(i);
     }
     return this;
   }
   buildTex = (e, t) => {
-    let i, s, r = [];
+    let i, s, n = [];
     const o = [];
     for (const l of e)
-      r = r.concat(l.letters());
-    r = [...new Set(r)], r.sort();
+      n = n.concat(l.letters());
+    n = [...new Set(n)], n.sort();
     for (let l = 0; l < e.length; l++) {
       const c = e[l];
       i = [];
-      for (const d of r)
+      for (const d of n)
         s = c.left.monomByLetter(d), i.length === 0 ? i.push(s.isZero() ? "" : s.tex) : i.push(s.isZero() ? "" : (s.coefficient.sign() === 1 ? "+" : "") + s.tex);
       if (i.push("="), i.push(c.right.tex), t?.[l] !== void 0) {
         i[i.length - 1] = i[i.length - 1] + " \\phantom{\\quad}";
@@ -2433,20 +2443,20 @@ class Z {
       o.push(i.join("&"));
     }
     let h = 0;
-    return t !== void 0 && t.length > 0 && (h = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(r.length)}cl ${"|l".repeat(h)}}${o.join("\\\\ ")}\\end{array}\\right.`;
+    return t !== void 0 && t.length > 0 && (h = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(n.length)}cl ${"|l".repeat(h)}}${o.join("\\\\ ")}\\end{array}\\right.`;
   };
   degree(e) {
-    return a.max(...this.#t.map((t) => t.degree(e)));
+    return a.max(...this.#i.map((t) => t.degree(e)));
   }
   get display() {
     return this.tex + "as display";
   }
   // ------------------------------------------
   get equations() {
-    return this.#t;
+    return this.#i;
   }
   set equations(e) {
-    this.#t = e;
+    this.#i = e;
   }
   evaluate(e, t) {
     throw new Error("Method not implemented.");
@@ -2458,33 +2468,33 @@ class Z {
     return this.equations.every((t, i) => t.isEqual(e.equations[i]));
   }
   get isSolvable() {
-    return this.variables.length === this.#t.length;
+    return this.variables.length === this.#i.length;
   }
   get matrix() {
     return this.#s();
   }
   mergeEquations = (e, t, i, s) => {
-    const r = e.clone().multiply(new a(i)), o = t.clone().multiply(new a(s));
-    return r.left.add(o.left), r.right.add(o.right), r;
+    const n = e.clone().multiply(new a(i)), o = t.clone().multiply(new a(s));
+    return n.left.add(o.left), n.right.add(o.right), n;
   };
   multiply(e, t) {
     if (Array.isArray(e)) {
-      if (e.length !== this.#t.length)
+      if (e.length !== this.#i.length)
         throw new Error("The number of values must be the same as the number of equations");
       for (let i = 0; i < e.length; i++)
-        this.#t[i].multiply(e[i]);
+        this.#i[i].multiply(e[i]);
       return this;
     }
-    if (t === void 0 || t < 0 || t >= this.#t.length)
+    if (t === void 0 || t < 0 || t >= this.#i.length)
       throw new Error("Index out of range");
-    return this.#t[t].multiply(e), this;
+    return this.#i[t].multiply(e), this;
   }
   reduce() {
     throw new Error("Method not implemented.");
   }
   // ------------------------------------------
   reorder = () => {
-    for (const e of this.#t)
+    for (const e of this.#i)
       e.reorder();
     return this;
   };
@@ -2492,17 +2502,17 @@ class Z {
     return [];
   }
   solveMatrix = () => {
-    const [e, t] = this.matrix, i = e.map((s, r) => [...s, t[r]]);
+    const [e, t] = this.matrix, i = e.map((s, n) => [...s, t[n]]);
     for (let s = 0; s < e.length; s++) {
-      let r = i[s][s].clone();
-      if (r.isZero()) {
+      let n = i[s][s].clone();
+      if (n.isZero()) {
         const o = i.find((h, l) => l > s && !h[s].isZero());
         if (o)
-          i[s].forEach((h, l) => h.add(o[l])), r = i[s][s].clone();
+          i[s].forEach((h, l) => h.add(o[l])), n = i[s][s].clone();
         else
           throw new Error("Unsolvable...");
       }
-      i[s] = i[s].map((o) => o.divide(r));
+      i[s] = i[s].map((o) => o.divide(n));
       for (let o = 0; o < e.length; o++) {
         if (o === s)
           continue;
@@ -2516,17 +2526,17 @@ class Z {
     return i.map((s) => s[s.length - 1]);
   };
   subtract(e, t) {
-    if (e instanceof Z) {
+    if (e instanceof D) {
       const i = e.equations.length;
-      if (i !== this.#t.length)
+      if (i !== this.#i.length)
         throw new Error("The number of equations must be the same");
       for (let s = 0; s < i; s++)
-        this.#t[s].subtract(e.equations[s]);
+        this.#i[s].subtract(e.equations[s]);
     } else {
-      if (t === void 0 || t < 0 || t >= this.#t.length)
+      if (t === void 0 || t < 0 || t >= this.#i.length)
         throw new Error("Index out of range");
       const i = new y(e);
-      this.#t[t].subtract(i);
+      this.#i[t].subtract(i);
     }
     return this;
   }
@@ -2541,36 +2551,36 @@ class Z {
     const t = typeof e == "string" ? e.split("") : [...e];
     t.sort(), this.#e = t;
   }
-  #i = () => (this.#e = this.#t.reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], []), this.#e.sort(), this);
+  #t = () => (this.#e = this.#i.reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], []), this.#e.sort(), this);
   #s = () => {
     const e = [], t = [];
-    for (const i of this.#t) {
-      const s = [], r = i.clone().reorder();
+    for (const i of this.#i) {
+      const s = [], n = i.clone().reorder();
       for (const o of this.variables) {
-        const h = r.left.monomByLetter(o);
+        const h = n.left.monomByLetter(o);
         s.push(h.coefficient);
       }
-      t.push(r.right.monoms[0].coefficient), e.push(s);
+      t.push(n.right.monoms[0].coefficient), e.push(s);
     }
     return [e, t];
   };
 }
-class Pe {
-  #t;
+class qe {
+  #i;
   /**
    *
    * @param {string} value (optional) Default polynom to parse on class creation
    */
   constructor(e) {
-    return this.#t = [], e !== void 0 && this.parse(e), this;
+    return this.#i = [], e !== void 0 && this.parse(e), this;
   }
-  parse = (e) => (this.#t = new _(D.SET).parse(e).rpn, this);
+  parse = (e) => (this.#i = new X(z.SET).parse(e).rpn, this);
   evaluate(e) {
     this.variables.forEach((i) => {
       Object.hasOwn(e, i) || (e[i] = !1);
     });
     const t = [];
-    for (const i of this.#t)
+    for (const i of this.#i)
       if (console.log(i), i.tokenType === "variable")
         t.push(e[i.token]);
       else if (i.tokenType === "operation")
@@ -2581,14 +2591,14 @@ class Pe {
           } else
             return !1;
         else {
-          const s = t.pop(), r = t.pop();
-          if (s !== void 0 && r !== void 0)
+          const s = t.pop(), n = t.pop();
+          if (s !== void 0 && n !== void 0)
             switch (i.token) {
               case "&":
-                t.push(s && r);
+                t.push(s && n);
                 break;
               case "|":
-                t.push(s || r);
+                t.push(s || n);
                 break;
               case "-":
                 return !1;
@@ -2599,11 +2609,11 @@ class Pe {
     return t.length === 1 && t[0];
   }
   get rpn() {
-    return this.#t;
+    return this.#i;
   }
   get tex() {
     const e = [];
-    for (const t of this.#t)
+    for (const t of this.#i)
       if (t.tokenType === "variable")
         e.push(t);
       else
@@ -2636,7 +2646,7 @@ class Pe {
     return e[0].token;
   }
   get variables() {
-    return this.#t.filter((e) => e.tokenType === "variable").map((e) => e.token);
+    return this.#i.filter((e) => e.tokenType === "variable").map((e) => e.token);
   }
   vennAB() {
     return this.#e(
@@ -2662,18 +2672,18 @@ class Pe {
     let s;
     if (t === void 0) {
       s = /* @__PURE__ */ new Set();
-      for (const r in e)
+      for (const n in e)
         s = /* @__PURE__ */ new Set([
           ...s,
-          ...e[r] ?? []
+          ...e[n] ?? []
         ]);
     } else
       s = new Set(t);
-    for (const r of this.#t)
-      if (r.tokenType === "variable")
-        e[r.token] === void 0 ? i.push(/* @__PURE__ */ new Set()) : i.push(new Set(e[r.token]));
+    for (const n of this.#i)
+      if (n.tokenType === "variable")
+        e[n.token] === void 0 ? i.push(/* @__PURE__ */ new Set()) : i.push(new Set(e[n.token]));
       else
-        switch (r.token) {
+        switch (n.token) {
           case "&":
             if (i.length >= 2) {
               const o = i.pop(), h = i.pop();
@@ -2703,7 +2713,7 @@ class Pe {
   }
 }
 class T {
-  #t = G.POWER;
+  #i = Z.POWER;
   #e = [];
   constructor(...e) {
     return this.parse(...e), this;
@@ -2717,30 +2727,30 @@ class T {
     return new T(...this.#e.map((e) => e.clone()));
   }
   get tex() {
-    const { num: e, den: t } = this.#r();
+    const { num: e, den: t } = this.#n();
     if (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(""), s = t.length === 1 ? t[0].asSingle.tex : t.map((r) => r.tex).join("");
+      return e.length === 1 ? e[0].asSingle.tex : e.map((n) => n.tex).join("");
+    const i = e.length === 1 ? e[0].asSingle.tex : e.map((n) => n.tex).join(""), s = t.length === 1 ? t[0].asSingle.tex : t.map((n) => n.tex).join("");
     return `\\frac{ ${i} }{ ${s} }`;
   }
   get display() {
-    const { num: e, den: t } = this.#r();
+    const { num: e, den: t } = this.#n();
     if (t.length === 0)
       return e.length === 1 ? e[0].asSingle.display : e.map(
-        (r, o) => o === 0 && r.polynom.monoms.length === 1 ? r.asSingle.display : r.display
+        (n, o) => o === 0 && n.polynom.monoms.length === 1 ? n.asSingle.display : n.display
       ).join("");
-    const i = e.length === 1 ? e[0].asSingle.display : e.map((r) => r.display).join(""), s = t.length === 1 ? t[0].asSingle.display : t.map((r) => r.display).join("");
+    const i = e.length === 1 ? e[0].asSingle.display : e.map((n) => n.display).join(""), s = t.length === 1 ? t[0].asSingle.display : t.map((n) => n.display).join("");
     return `(${i})/(${s})`;
   }
-  static #i(e, t) {
-    const i = U(e), s = U(t), o = Object.keys(i).filter((h) => Object.hasOwn(s, h)).map((h) => {
+  static #t(e, t) {
+    const i = L(e), s = L(t), o = Object.keys(i).filter((h) => Object.hasOwn(s, h)).map((h) => {
       const l = i[h].reduce((d, m) => d.add(m.power), new a("0")), c = s[h].reduce((d, m) => d.add(m.power), new a("0"));
       return new x(h, a.min(l, c));
     });
     return new T(...o);
   }
   static #s(e, t) {
-    const i = U(e), s = U(t), o = [.../* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(s)])].map((h) => {
+    const i = L(e), s = L(t), o = [.../* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(s)])].map((h) => {
       const l = Object.hasOwn(i, h) ? i[h].reduce((d, m) => d.add(m.power), new a("0")) : new a(0), c = Object.hasOwn(s, h) ? s[h].reduce((d, m) => d.add(m.power), new a("0")) : new a(0);
       return new x(h, a.max(l, c));
     });
@@ -2752,9 +2762,9 @@ class T {
     if (e.length === 1)
       return e[0];
     if (e.length === 2)
-      return T.#i(e[0], e[1]);
+      return T.#t(e[0], e[1]);
     let t = e[0];
-    return e.shift(), e.forEach((i) => t = T.#i(t, i)), t;
+    return e.shift(), e.forEach((i) => t = T.#t(t, i)), t;
   }
   static lcm(...e) {
     if (e.length === 0)
@@ -2773,19 +2783,19 @@ class T {
         l.multiply(h.clone().divide(i[c]));
       }), s = h;
     }
-    const r = T.gcd(...t), o = new u(0).add(
-      ...t.map((h) => h.divide(r).reduce().develop().factors[0].polynom)
+    const n = T.gcd(...t), o = new u(0).add(
+      ...t.map((h) => h.divide(n).reduce().develop().factors[0].polynom)
     ).reduce();
     return this.#e = [
-      ...r.factors,
+      ...n.factors,
       new x(o)
     ], s && this.divide(s), this.#e = this.#e.filter((h) => !h.power.isZero()), this;
   }
   get asPower() {
-    return this.#t = G.POWER, this;
+    return this.#i = Z.POWER, this;
   }
   get asRoot() {
-    return this.#t = G.ROOT, this;
+    return this.#i = Z.ROOT, this;
   }
   degree(e) {
     return this.#e.reduce((t, i) => t.add(i.degree(e)), new a("0"));
@@ -2798,9 +2808,9 @@ class T {
   derivative() {
     const e = [], t = this.#e.length;
     for (let s = 0; s < t; s++) {
-      const r = this.#e.slice(), o = r.splice(s, 1)[0].derivative();
+      const n = this.#e.slice(), o = n.splice(s, 1)[0].derivative();
       e.push(
-        new T(...r, ...o)
+        new T(...n, ...o)
       );
     }
     e.forEach((s) => s.reduce());
@@ -2831,8 +2841,8 @@ class T {
       } else
         t.push(o.clone());
     });
-    const i = new T(...t), s = i.numerator.reduce(), r = i.denominator.reduce();
-    return s.divide(r);
+    const i = new T(...t), s = i.numerator.reduce(), n = i.denominator.reduce();
+    return s.divide(n);
   }
   get factors() {
     return this.#e;
@@ -2855,7 +2865,7 @@ class T {
     const e = [].concat(...this.#e.map((t) => t.polynom.getZeroes()));
     return e.sort((t, i) => t.value - i.value), e.filter(
       (t, i, s) => i === s.findIndex(
-        (r) => r.value === t.value
+        (n) => n.value === t.value
       )
     );
   }
@@ -2897,9 +2907,9 @@ class T {
     throw new Error("Method not implemented.");
   }
   reduce() {
-    const e = U(this);
+    const e = L(this);
     return this.#e = Object.values(e).map((t) => {
-      const i = t[0].polynom, s = t.reduce((r, o) => r.add(o.power), new a("0"));
+      const i = t[0].polynom, s = t.reduce((n, o) => n.add(o.power), new a("0"));
       return new x(i, s.reduce());
     }).filter((t) => !t.power.isZero()), this;
   }
@@ -2914,14 +2924,14 @@ class T {
    */
   sort(e) {
     return this.#e.sort((t, i) => {
-      const s = t.power.value, r = i.power.value;
-      if (s * r < 0)
+      const s = t.power.value, n = i.power.value;
+      if (s * n < 0)
         return -s;
       const o = t.polynom.monoms.length, h = i.polynom.monoms.length;
       if (o !== h)
         return o - h;
       const l = t.polynom.degree(e).value, c = i.polynom.degree(e).value;
-      return l !== c ? l - c : s !== r ? s - r : t.degree().isLeq(i.degree()) ? -1 : 1;
+      return l !== c ? l - c : s !== n ? s - n : t.degree().isLeq(i.degree()) ? -1 : 1;
     }), this;
   }
   sqrt() {
@@ -2931,35 +2941,35 @@ class T {
     return this.add(...e.map((t) => t.opposite()));
   }
   tableOfSigns() {
-    const e = this.getZeroes(), t = e.map((r) => r.value), i = this.factorize().factors.map((r) => ({ factor: new x(r), ...r.tableOfSigns() }));
-    return i.forEach((r) => {
+    const e = this.getZeroes(), t = e.map((n) => n.value), i = this.factorize().factors.map((n) => ({ factor: new x(n), ...n.tableOfSigns() }));
+    return i.forEach((n) => {
       const o = new Array(2 * e.length + 1).fill("");
-      let h = r.signs.shift(), l = r.roots.shift();
+      let h = n.signs.shift(), l = n.roots.shift();
       const c = o.map((d, m) => {
         if (m % 2 === 0)
           return h;
         if (l === void 0 || l.value !== t[(m - 1) / 2])
           return "t";
-        const w = r.signs.shift();
-        return h = r.signs.shift(), l = r.roots.shift(), w;
+        const w = n.signs.shift();
+        return h = n.signs.shift(), l = n.roots.shift(), w;
       });
-      r.roots = e, r.signs = c;
-    }), { signs: i.map((r) => [...r.signs]).reduce((r, o) => r.length === 0 ? o : (o.forEach((h, l) => {
+      n.roots = e, n.signs = c;
+    }), { signs: i.map((n) => [...n.signs]).reduce((n, o) => n.length === 0 ? o : (o.forEach((h, l) => {
       switch (h) {
         case "d":
-          r[l] = "d";
+          n[l] = "d";
           break;
         case "z":
-          r[l] = r[l] === "d" ? "d" : "z";
+          n[l] = n[l] === "d" ? "d" : "z";
           break;
         case "h":
-          r[l] = "h";
+          n[l] = "h";
           break;
         case "-":
-          r[l] = r[l] === "h" ? "h" : r[l] === "-" ? "+" : "-";
+          n[l] = n[l] === "h" ? "h" : n[l] === "-" ? "+" : "-";
           break;
       }
-    }), r), []), roots: e, factors: i };
+    }), n), []), roots: e, factors: i };
   }
   get variables() {
     return this.#e.reduce((e, t) => e.concat(t.variables), []);
@@ -2967,24 +2977,24 @@ class T {
   zero() {
     return this.#e = [new x("0", "1")], this;
   }
-  #r() {
+  #n() {
     let e, t = [];
-    return this.#t === G.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = this.#e, e.length === 0 && (e = [new x("1")]), { num: e, den: t };
+    return this.#i === Z.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = this.#e, e.length === 0 && (e = [new x("1")]), { num: e, den: t };
   }
 }
-function U(n) {
-  const e = new a().one(), t = new a().one(), i = n.factors.reduce((o, h) => {
+function L(r) {
+  const e = new a().one(), t = new a().one(), i = r.factors.reduce((o, h) => {
     if (h.polynom.degree().isZero())
       return h.power.isPositive() ? e.multiply(h.polynom.monoms[0].coefficient) : t.multiply(h.polynom.monoms[0].coefficient), o;
     const l = h.polynom.display;
     return Object.hasOwn(o, l) ? o[l].push(h) : o[l] = [h], o;
-  }, {}), { numerator: s, denominator: r } = e.divide(t).reduce();
-  return s !== 1 && (i[s.toString()] = [new x(s, 1)]), r !== 1 && (i[r.toString()] = [new x(r, -1)]), i;
+  }, {}), { numerator: s, denominator: n } = e.divide(t).reduce();
+  return s !== 1 && (i[s.toString()] = [new x(s, 1)]), n !== 1 && (i[n.toString()] = [new x(n, -1)]), i;
 }
-class P {
-  #t = null;
+class I {
+  #i = null;
   #e = !0;
-  #i = [];
+  #t = [];
   constructor(e, t) {
     return e && (t = t ?? e, this.fromDimensions(e, t)), this;
   }
@@ -2993,31 +3003,31 @@ class P {
   }
   clone() {
     const e = [];
-    return this.#i.forEach((t) => {
+    return this.#t.forEach((t) => {
       const i = [];
       t.forEach((s) => {
         i.push(s.clone());
       }), e.push(i);
-    }), new P().fromValues(e);
+    }), new I().fromValues(e);
   }
   get tex() {
-    if (this.#i.length === 0)
+    if (this.#t.length === 0)
       return "";
     const e = this.#e ? "pmatrix" : "bmatrix", t = [
       `\\begin{${e}}`,
       ...this.rows.map(
-        (i) => "	" + i.map((s) => this.#t !== null && s.value ? +s.value.toFixed(this.#t) : s.tex).join(" & ") + "\\\\"
+        (i) => "	" + i.map((s) => this.#i !== null && s.value ? +s.value.toFixed(this.#i) : s.tex).join(" & ") + "\\\\"
       ),
       `\\end{${e}}`
     ].join(`
 `);
-    return this.#t = null, t;
+    return this.#i = null, t;
   }
   get display() {
-    if (this.#i.length === 0)
+    if (this.#t.length === 0)
       return "";
-    const e = this.#e ? ["(", ")"] : ["[", "]"], t = e[0] + this.map((i) => this.#t !== null && i.value ? +i.value.toFixed(this.#t) : i.display).map((i) => `(${i.join(",")})`).join(",") + e[1];
-    return this.#t = null, t;
+    const e = this.#e ? ["(", ")"] : ["[", "]"], t = e[0] + this.map((i) => this.#i !== null && i.value ? +i.value.toFixed(this.#i) : i.display).map((i) => `(${i.join(",")})`).join(",") + e[1];
+    return this.#i = null, t;
   }
   add(e) {
     if (!this.canBeAdded(e))
@@ -3027,14 +3037,14 @@ class P {
     }), this;
   }
   aij(e, t) {
-    return e < 0 || e > this.dimension.rows || t < 0 || t > this.dimension.cols ? null : this.#i[e][t];
+    return e < 0 || e > this.dimension.rows || t < 0 || t > this.dimension.cols ? null : this.#t[e][t];
   }
   get bmatrix() {
     return this.#e = !1, this;
   }
   canBeAdded(e) {
-    const { rows: t, cols: i } = this.dimension, { rows: s, cols: r } = e.dimension;
-    return t === s && i === r;
+    const { rows: t, cols: i } = this.dimension, { rows: s, cols: n } = e.dimension;
+    return t === s && i === n;
   }
   canBeInverted() {
     return !(!this.isSquare() || this.determinant().isZero());
@@ -3044,7 +3054,7 @@ class P {
   }
   characteristic_polynom(e) {
     return e ??= "k", this.clone().subtract(
-      new P(this.dimension.rows).one().multiply(new u(e))
+      new I(this.dimension.rows).one().multiply(new u(e))
     ).determinant();
   }
   cofactor(e, t) {
@@ -3063,83 +3073,83 @@ class P {
     if (!this.isSquare())
       throw new Error("Matrix is not square");
     const e = new u();
-    return this.#i.length === 1 ? this.#i[0][0].clone() : (this.values[0].forEach((t, i) => {
+    return this.#t.length === 1 ? this.#t[0][0].clone() : (this.values[0].forEach((t, i) => {
       const s = this.cofactor(0, i);
       e.add(t.clone().multiply(s));
     }), e);
   }
   get dimension() {
     return {
-      rows: this.#i.length,
-      cols: this.#i[0].length
+      rows: this.#t.length,
+      cols: this.#t[0].length
     };
   }
   flat() {
-    return this.#i.flat();
+    return this.#t.flat();
   }
   forEach(e) {
-    this.#i.forEach((t, i) => {
-      t.forEach((s, r) => {
-        e(s, i, r);
+    this.#t.forEach((t, i) => {
+      t.forEach((s, n) => {
+        e(s, i, n);
       });
     });
   }
   fromDimensions(e, t) {
-    return this.#i = Array.from({ length: e }, () => Array.from({ length: t }, () => new u())), this;
+    return this.#t = Array.from({ length: e }, () => Array.from({ length: t }, () => new u())), this;
   }
   fromString(e) {
     if (e.startsWith("((") && e.endsWith("))"))
       return this.fromString(e.substring(1, e.length - 1));
     const t = e.split("),(");
-    return this.#i = t.map((i, s) => s === 0 ? i.substring(1).split(",") : s === t.length - 1 ? i.substring(0, i.length - 1).split(",") : i.split(",")).map(
+    return this.#t = t.map((i, s) => s === 0 ? i.substring(1).split(",") : s === t.length - 1 ? i.substring(0, i.length - 1).split(",") : i.split(",")).map(
       (i) => i.map((s) => new u(s))
     ), this;
   }
   fromValues(e) {
-    this.#i = [];
+    this.#t = [];
     const t = e[0].length;
     if (e.some((i) => i.length !== t))
       throw new Error("Each line must be the same length");
     return e.forEach((i) => {
       const s = [];
-      i.forEach((r) => {
-        s.push(new u(r));
-      }), this.#i.push(s);
+      i.forEach((n) => {
+        s.push(new u(n));
+      }), this.#t.push(s);
     }), this;
   }
   fromVectors(...e) {
-    this.#i = [];
+    this.#t = [];
     const t = e[0].dimension;
     if (e.some((i) => i.dimension !== t))
       throw new Error("Each vectors must be the same dimension");
     return this.fromDimensions(e[0].dimension, e.length), e.forEach((i, s) => {
-      i.array.forEach((r, o) => {
-        this.#i[o][s] = new u(r);
+      i.array.forEach((n, o) => {
+        this.#t[o][s] = new u(n);
       });
     }), this;
   }
   inverse() {
     if (!this.canBeInverted())
       throw new Error("The matrix cannot be inverted.");
-    const e = new P().fromDimensions(this.dimension.rows, this.dimension.cols);
-    e.forEach((i, s, r) => {
-      e.setValue(s, r, this.cofactor(s, r));
+    const e = new I().fromDimensions(this.dimension.rows, this.dimension.cols);
+    e.forEach((i, s, n) => {
+      e.setValue(s, n, this.cofactor(s, n));
     }), e.transpose();
     const t = this.determinant();
-    return e.forEach((i, s, r) => this.setValue(s, r, i.divide(t).reduce())), this;
+    return e.forEach((i, s, n) => this.setValue(s, n, i.divide(t).reduce())), this;
   }
   isEqual(e) {
     if (!this.canBeAdded(e))
       return !1;
     let t = !0;
-    return this.forEach((i, s, r) => {
-      t &&= i.isEqual(e.values[s][r]);
+    return this.forEach((i, s, n) => {
+      t &&= i.isEqual(e.values[s][n]);
     }), t;
   }
   isOne() {
-    for (let e = 0; e < this.#i.length; e++)
-      for (let t = 0; t < this.#i[e].length; t++)
-        if (t === e && !this.#i[e][t].isOne() || t !== e && !this.#i[e][t].isZero())
+    for (let e = 0; e < this.#t.length; e++)
+      for (let t = 0; t < this.#t[e].length; t++)
+        if (t === e && !this.#t[e][t].isOne() || t !== e && !this.#t[e][t].isZero())
           return !1;
     return !0;
   }
@@ -3152,23 +3162,23 @@ class P {
   map(e) {
     const { rows: t, cols: i } = this.dimension, s = Array.from({ length: t }, () => Array.from({ length: i }, () => {
     }));
-    return this.#i.forEach((r, o) => {
-      r.forEach((h, l) => {
+    return this.#t.forEach((n, o) => {
+      n.forEach((h, l) => {
         s[o][l] = e(h, o, l);
       });
     }), s;
   }
   multiply(e) {
-    if (e instanceof P) {
+    if (e instanceof I) {
       if (!this.canBeMultiplied(e))
         throw new Error("Cannot multiply a matrix with incompatibles dimensions");
-      const t = new P(this.dimension.rows, e.dimension.cols);
-      return t.forEach((i, s, r) => {
-        const o = this.rows[s], h = e.cols[r], l = new u();
+      const t = new I(this.dimension.rows, e.dimension.cols);
+      return t.forEach((i, s, n) => {
+        const o = this.rows[s], h = e.cols[n], l = new u();
         o.forEach((c, d) => {
           l.add(c.clone().multiply(h[d]));
-        }), t.setValue(s, r, l);
-      }), this.#i = t.values, this;
+        }), t.setValue(s, n, l);
+      }), this.#t = t.values, this;
     }
     return this.forEach((t, i, s) => {
       this.setValue(i, s, t.multiply(e));
@@ -3188,19 +3198,19 @@ class P {
     return this.#e = !0, this;
   }
   pow(e) {
-    return de(this, e);
+    return se(this, e);
   }
   reduce() {
     throw new Error("Not yet implemented");
   }
   get rows() {
-    return this.#i;
+    return this.#t;
   }
   setValue(e, t, i) {
-    const { rows: s, cols: r } = this.dimension;
-    if (e < 0 || e >= s || t < 0 || t >= r)
-      throw new Error(`${e}x${t} is out of range (${s}x${r})`);
-    return this.#i[e][t] = new u(i), this;
+    const { rows: s, cols: n } = this.dimension;
+    if (e < 0 || e >= s || t < 0 || t >= n)
+      throw new Error(`${e}x${t} is out of range (${s}x${n})`);
+    return this.#t[e][t] = new u(i), this;
   }
   subtract(e) {
     if (!this.canBeAdded(e))
@@ -3210,7 +3220,7 @@ class P {
     }), this;
   }
   toFixed(e) {
-    return this.#t = e, this;
+    return this.#i = e, this;
   }
   transpose() {
     return this.clone().forEach((t, i, s) => {
@@ -3218,46 +3228,46 @@ class P {
     }), this;
   }
   get values() {
-    return this.#i;
+    return this.#t;
   }
   zero() {
     return this.forEach((e) => e.zero()), this;
   }
 }
-function De(n, e) {
-  return n.dimension === e.dimension && n.array.every(
+function Te(r, e) {
+  return r.dimension === e.dimension && r.array.every(
     (t, i) => e.array[i].isEqual(t)
   );
 }
-function Le(n, e) {
-  if (n.dimension !== e.dimension)
+function Oe(r, e) {
+  if (r.dimension !== e.dimension)
     return !1;
-  const t = e.array[0].value / n.array[0].value;
-  return n.array.every(
+  const t = e.array[0].value / r.array[0].value;
+  return r.array.every(
     (i, s) => e.array[s].value === i.value * t
   );
 }
-function Ze(n, e) {
-  return n.dimension !== e.dimension ? new a().invalid() : n.array.reduce(
+function Ce(r, e) {
+  return r.dimension !== e.dimension ? new a().invalid() : r.array.reduce(
     (t, i, s) => t.add(i.clone().multiply(e.array[s])),
     new a(0)
   );
 }
-function He(...n) {
-  if (n.some((e) => e.dimension !== n[0].dimension))
+function De(...r) {
+  if (r.some((e) => e.dimension !== r[0].dimension))
     throw new Error("All vectors must have the same dimension");
-  if (n[0].dimension !== n.length)
-    throw new Error(`The determinant of dimension ${n[0].dimension} must have the same number of vectors (${n.length} given)`);
-  return n[0].dimension === 2 ? n[0].array[0].clone().multiply(n[1].array[1]).subtract(n[0].array[1].clone().multiply(n[1].array[0])) : n[0].array[0].clone().multiply(
-    n[1].array[1].clone().multiply(n[2].array[2]).subtract(n[1].array[2].clone().multiply(n[2].array[1]))
+  if (r[0].dimension !== r.length)
+    throw new Error(`The determinant of dimension ${r[0].dimension} must have the same number of vectors (${r.length} given)`);
+  return r[0].dimension === 2 ? r[0].array[0].clone().multiply(r[1].array[1]).subtract(r[0].array[1].clone().multiply(r[1].array[0])) : r[0].array[0].clone().multiply(
+    r[1].array[1].clone().multiply(r[2].array[2]).subtract(r[1].array[2].clone().multiply(r[2].array[1]))
   ).subtract(
-    n[0].array[1].clone().multiply(
-      n[1].array[0].clone().multiply(n[2].array[2]).subtract(n[1].array[2].clone().multiply(n[2].array[0]))
+    r[0].array[1].clone().multiply(
+      r[1].array[0].clone().multiply(r[2].array[2]).subtract(r[1].array[2].clone().multiply(r[2].array[0]))
     )
-  ).add(n[0].array[2].clone().multiply(n[1].array[0].clone().multiply(n[2].array[1]).subtract(n[1].array[1].clone().multiply(n[2].array[0]))));
+  ).add(r[0].array[2].clone().multiply(r[1].array[0].clone().multiply(r[2].array[1]).subtract(r[1].array[1].clone().multiply(r[2].array[0]))));
 }
 class g {
-  #t = [];
+  #i = [];
   #e = !1;
   constructor(...e) {
     e.length > 0 && this.parse(...e);
@@ -3266,32 +3276,32 @@ class g {
   // Getter and setter
   // ------------------------------------------
   get array() {
-    return this.#t;
+    return this.#i;
   }
   set array(e) {
-    this.#t = e;
+    this.#i = e;
   }
   get x() {
-    return this.#t[0];
+    return this.#i[0];
   }
   set x(e) {
-    this.#t[0] = new a(e);
+    this.#i[0] = new a(e);
   }
   get y() {
-    return this.#t[1];
+    return this.#i[1];
   }
   set y(e) {
-    this.#t[1] = new a(e);
+    this.#i[1] = new a(e);
   }
   get z() {
     if (this.dimension < 3)
       throw new Error("Vector is not 3D");
-    return this.#t[2];
+    return this.#i[2];
   }
   set z(e) {
     if (this.dimension < 3)
       throw new Error("Vector is not 3D");
-    this.#t[2] = new a(e);
+    this.#i[2] = new a(e);
   }
   get asPoint() {
     return this.#e;
@@ -3315,10 +3325,10 @@ class g {
     if (e < 2)
       throw new Error("Dimension must be at least 2");
     if (e < this.dimension)
-      this.#t = this.#t.slice(0, e);
+      this.#i = this.#i.slice(0, e);
     else if (e > this.dimension)
       for (let t = this.dimension; t < e; t++)
-        this.#t.push(new a(0));
+        this.#i.push(new a(0));
     return this;
   }
   get dimension() {
@@ -3354,22 +3364,22 @@ class g {
       if (t instanceof g && i instanceof g) {
         if (t.dimension !== i.dimension)
           throw new Error("Vectors must have the same dimension");
-        return this.#t = i.array.map((s, r) => s.clone().subtract(t.array[r])), this;
+        return this.#i = i.array.map((s, n) => s.clone().subtract(t.array[n])), this;
       }
     }
-    return this.#t = e.map((t) => new a(t)), this;
+    return this.#i = e.map((t) => new a(t)), this;
   }
   clone() {
     const e = new g();
     return e.array = this.copy(), e.asPoint = this.asPoint, e;
   }
   copy() {
-    return this.#t.map((e) => e.clone());
+    return this.#i.map((e) => e.clone());
   }
-  zero = () => (this.#t.forEach((e) => e.zero()), this);
+  zero = () => (this.#i.forEach((e) => e.zero()), this);
   one = () => (this.zero(), this.x.one(), this);
-  opposite = () => (this.#t.forEach((e) => e.opposite()), this);
-  add = (e) => (this.#t.forEach((t, i) => t.add(e.array[i])), this);
+  opposite = () => (this.#i.forEach((e) => e.opposite()), this);
+  add = (e) => (this.#i.forEach((t, i) => t.add(e.array[i])), this);
   subtract = (e) => this.add(e.clone().opposite());
   unit = () => {
     const e = this.norm;
@@ -3385,7 +3395,7 @@ class g {
   translate(...e) {
     return this.array.forEach((t, i) => t.add(e[i])), this;
   }
-  dot = (e) => Ze(this, e);
+  dot = (e) => Ce(this, e);
   cross(e) {
     if (this.dimension !== 3 || e.dimension !== 3)
       throw new Error("Cross product can only be determined in 3D");
@@ -3399,7 +3409,7 @@ class g {
     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 this.#t[0] = t, this.#t[1] = e, this;
+    return this.#i[0] = t, this.#i[1] = e, this;
   };
   isZero() {
     return this.array.every((e) => e.isZero());
@@ -3407,8 +3417,8 @@ class g {
   isOne() {
     return this.array.every((e, t) => t === 0 ? e.isOne() : e.isZero());
   }
-  isEqual = (e) => De(this, e);
-  isColinearTo = (e) => Le(this, e);
+  isEqual = (e) => Te(this, e);
+  isColinearTo = (e) => Oe(this, e);
   isNormalTo = (e) => this.dot(e).isZero();
   multiplyByScalar = (e) => {
     const t = new a(e);
@@ -3429,7 +3439,7 @@ class g {
   fromString = (e) => {
     e.startsWith("(") && (e = e.substring(1)), e.endsWith(")") && (e = e.substring(0, e.length - 1));
     const t = e.split(/[,;\s]/g).filter((i) => i.trim() !== "");
-    return t.length < 2 ? this : (this.#t = t.map((i) => new a(i)), this);
+    return t.length < 2 ? this : (this.#i = t.map((i) => new a(i)), this);
   };
   distanceTo(e) {
     const t = new g(this, e);
@@ -3440,39 +3450,39 @@ class g {
     };
   }
 }
-var I = /* @__PURE__ */ ((n) => (n.None = "none", n.Parallel = "parallel", n.Perpendicular = "perpendicular", n.Tangent = "tangent", n))(I || {}), se = /* @__PURE__ */ ((n) => (n.None = "none", n.Parallel = "parallel", n.Perpendicular = "perpendicular", n.Tangent = "tangent", n))(se || {});
-function pe(n = 0.5) {
-  return Math.random() < n;
+var B = /* @__PURE__ */ ((r) => (r.None = "none", r.Parallel = "parallel", r.Perpendicular = "perpendicular", r.Tangent = "tangent", r))(B || {}), Q = /* @__PURE__ */ ((r) => (r.None = "none", r.Parallel = "parallel", r.Perpendicular = "perpendicular", r.Tangent = "tangent", r))(Q || {});
+function ne(r = 0.5) {
+  return Math.random() < r;
 }
-function B(n, e, t) {
+function k(r, e, t) {
   if (e === void 0)
-    return n >= 0 ? B(0, n) : B(n, 0);
-  if (n === e)
-    return n;
+    return r >= 0 ? k(0, r) : k(r, 0);
+  if (r === e)
+    return r;
   if (t === void 0)
-    return Math.floor(Math.random() * (e - n + 1) + n);
-  if (Math.abs(e - n) <= t.length)
+    return Math.floor(Math.random() * (e - r + 1) + r);
+  if (Math.abs(e - r) <= t.length)
     throw new Error("The number of excluded values is too high.");
-  let i = B(n, e);
+  let i = k(r, e);
   for (; t.includes(i); )
-    i = B(n, e);
+    i = k(r, e);
   return i;
 }
-function q(n, e) {
-  return e === !1 ? pe() ? B(1, n) : -B(1, n) : B(-n, n);
+function q(r, e) {
+  return e === !1 ? ne() ? k(1, r) : -k(1, r) : k(-r, r);
 }
-function Ve(n) {
+function $e(r) {
   let e = E.primes();
-  return n !== void 0 && (e = e.filter((t) => t < n)), he(e);
+  return r !== void 0 && (e = e.filter((t) => t < r)), _(e);
 }
-function je(n, e) {
-  return e === void 0 && (e = 1), n.length <= 0 ? Object.values(n) : me(n).slice(0, e);
+function ke(r, e) {
+  return e === void 0 && (e = 1), r.length <= 0 ? Object.values(r) : re(r).slice(0, e);
 }
-function he(n) {
-  return n.length === 0 ? null : n[B(0, n.length - 1)];
+function _(r) {
+  return r.length === 0 ? null : r[k(0, r.length - 1)];
 }
-function me(n) {
-  const e = Object.values(n);
+function re(r) {
+  const e = Object.values(r);
   for (let t = e.length - 1; t > 0; t--) {
     const i = Math.floor(Math.random() * (t + 1)), s = e[t];
     e[t] = e[i], e[i] = s;
@@ -3506,16 +3516,16 @@ class v extends g {
   }
 }
 class b {
-  static PARALLEL = I.Parallel;
+  static PARALLEL = B.Parallel;
   // A line is defined as the canonical form
-  static PERPENDICULAR = I.Perpendicular;
-  #t;
+  static PERPENDICULAR = B.Perpendicular;
+  #i;
   // ax + by + c = 0
   #e;
-  #i;
+  #t;
   #s;
-  #r;
   #n;
+  #r;
   #o = "canonical";
   #h;
   /**
@@ -3524,7 +3534,7 @@ class b {
    * @param values
    */
   constructor(...e) {
-    return this.#e = new a().zero(), this.#i = new a().zero(), this.#s = new a().zero(), this.#t = new g(), this.#r = new g(), this.#n = new g(), this.#h = !0, e.length > 0 && this.parse(...e), this;
+    return this.#e = new a().zero(), this.#t = new a().zero(), this.#s = new a().zero(), this.#i = new g(), this.#n = new g(), this.#r = new g(), this.#h = !0, e.length > 0 && this.parse(...e), this;
   }
   // ------------------------------------------
   /**
@@ -3557,12 +3567,12 @@ class b {
     }
     if (e.length === 3) {
       if (e[0] instanceof g && e[1] instanceof g) {
-        if (e[2] === I.Perpendicular)
+        if (e[2] === B.Perpendicular)
           return this.fromPointAndNormal(e[0], e[1]);
-        if (e[2] === I.Parallel)
+        if (e[2] === B.Parallel)
           return this.fromPointAndDirection(e[0], e[1]);
       }
-      return e[0] instanceof g && e[1] instanceof b ? e[2] === I.Parallel || e[2] === null ? this.fromPointAndLine(e[0], e[1], I.Parallel) : this.fromPointAndLine(e[0], e[1], I.Perpendicular) : this.fromCoefficient(
+      return e[0] instanceof g && e[1] instanceof b ? e[2] === B.Parallel || e[2] === null ? this.fromPointAndLine(e[0], e[1], B.Parallel) : this.fromPointAndLine(e[0], e[1], B.Perpendicular) : this.fromCoefficient(
         e[0],
         e[1],
         e[2]
@@ -3572,7 +3582,7 @@ class b {
   };
   // ------------------------------------------
   // Getter and setter
-  clone = () => (this.#e = this.#e.clone(), this.#i = this.#i.clone(), this.#s = this.#s.clone(), this.#r = this.#r.clone(), this.#t = this.#t.clone(), this.#n = this.#n.clone(), this);
+  clone = () => (this.#e = this.#e.clone(), this.#t = this.#t.clone(), this.#s = this.#s.clone(), this.#n = this.#n.clone(), this.#i = this.#i.clone(), this.#r = this.#r.clone(), this);
   get tex() {
     const e = this.#o;
     switch (this.#o = "canonical", e) {
@@ -3582,10 +3592,10 @@ class b {
         return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new u().parse("x", this.slope, this.height).tex;
       case "parametric":
       case "system": {
-        const t = this.#r.clone();
-        return this.#h && t.simplify(), e === "parametric" ? `${g.asTex("x", "y")} = ${g.asTex(this.#t.x.tex, this.#t.y.tex)} + k\\cdot ${g.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
-            x &= ${new u(this.#t.x).add(new p(this.#r.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\ 
-            y &= ${new u(this.#t.y).add(new p(this.#r.y).multiply(new p("k"))).reorder("k", !0).tex}
+        const t = this.#n.clone();
+        return this.#h && t.simplify(), e === "parametric" ? `${g.asTex("x", "y")} = ${g.asTex(this.#i.x.tex, this.#i.y.tex)} + k\\cdot ${g.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
+            x &= ${new u(this.#i.x).add(new p(this.#n.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\ 
+            y &= ${new u(this.#i.y).add(new p(this.#n.y).multiply(new p("k"))).reorder("k", !0).tex}
             \\end{aligned}\\right.`;
       }
       default: {
@@ -3602,8 +3612,8 @@ class b {
       case "mxh":
         return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new u().parse("x", this.slope, this.height).display;
       case "parametric": {
-        const t = this.#r.clone();
-        return this.#h && t.simplify(), `((x,y))=((${this.#t.x.display},${this.#t.y.display}))+k((${t.x.display},${t.y.display}))`;
+        const t = this.#n.clone();
+        return this.#h && t.simplify(), `((x,y))=((${this.#i.x.display},${this.#i.y.display}))+k((${t.x.display},${t.y.display}))`;
       }
       default: {
         const t = this.getEquation();
@@ -3612,10 +3622,10 @@ class b {
     }
   }
   get OA() {
-    return this.#t;
+    return this.#i;
   }
   set OA(e) {
-    this.#t = e;
+    this.#i = e;
   }
   get a() {
     return this.#e;
@@ -3624,10 +3634,10 @@ class b {
     this.#e = e;
   }
   get b() {
-    return this.#i;
+    return this.#t;
   }
   set b(e) {
-    this.#i = e;
+    this.#t = e;
   }
   get c() {
     return this.#s;
@@ -3655,40 +3665,40 @@ class b {
   canonicalAsFloatCoefficient(e) {
     e === void 0 && (e = 2);
     let t = "";
-    return this.#e.isZero() || (this.#e.isOne() ? t = "x" : this.#e.clone().opposite().isOne() ? t = "-x" : t = this.#e.value.toFixed(e) + "x"), this.#i.isZero() || (this.#i.isPositive() && (t += "+"), t += this.#i.value.toFixed(e) + "y"), this.#s.isZero() || (this.#s.isPositive() && (t += "+"), t += this.#s.value.toFixed(e)), t + "=0";
+    return this.#e.isZero() || (this.#e.isOne() ? t = "x" : this.#e.clone().opposite().isOne() ? t = "-x" : t = this.#e.value.toFixed(e) + "x"), this.#t.isZero() || (this.#t.isPositive() && (t += "+"), t += this.#t.value.toFixed(e) + "y"), this.#s.isZero() || (this.#s.isPositive() && (t += "+"), t += this.#s.value.toFixed(e)), t + "=0";
   }
   get d() {
-    return this.#r;
+    return this.#n;
   }
   set d(e) {
-    this.#r = e;
+    this.#n = e;
   }
   get director() {
-    return this.#r.clone();
+    return this.#n.clone();
   }
   distanceTo(e) {
-    const t = e.x.clone().multiply(this.#e).add(e.y.clone().multiply(this.#i)).add(this.#s).abs(), i = this.normal.normSquare;
+    const t = e.x.clone().multiply(this.#e).add(e.y.clone().multiply(this.#t)).add(this.#s).abs(), i = this.normal.normSquare;
     if (i.isZero())
       return {
         value: NaN,
         tex: "Not a line",
         fraction: new a().infinite()
       };
-    const s = t.value / Math.sqrt(i.value), r = t.clone().divide(i.clone().sqrt());
+    const s = t.value / Math.sqrt(i.value), n = t.clone().divide(i.clone().sqrt());
     return i.isSquare() ? {
       value: s,
-      tex: r.tex,
-      fraction: r
+      tex: n.tex,
+      fraction: n
     } : {
       value: s,
       tex: `\\frac{${t.tex}}{\\sqrt{${i.tex}}}`,
-      fraction: r
+      fraction: n
     };
   }
   get equation() {
     return this.#o = "equation", this;
   }
-  fromCoefficient = (e, t, i) => (this.#e = new a(e), this.#i = new a(t), this.#s = new a(i), this.#r = new g(this.#i.clone(), this.#e.clone().opposite()), this.#t = new g(new a().zero(), this.#s.clone()), this.#n = this.#r.clone().normal(), this);
+  fromCoefficient = (e, t, i) => (this.#e = new a(e), this.#t = new a(t), this.#s = new a(i), this.#n = new g(this.#t.clone(), this.#e.clone().opposite()), this.#i = new g(new a().zero(), this.#s.clone()), this.#r = this.#n.clone().normal(), this);
   fromEquation = (e) => {
     e.reorder(!0);
     const t = new Set(e.letters());
@@ -3706,8 +3716,8 @@ class b {
     t.y,
     t.x.clone().opposite(),
     e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)).opposite()
-  ), this.#t = e.clone(), this.#r = t.clone(), this.#n = this.#r.clone().normal(), this);
-  fromPointAndLine = (e, t, i) => (i === void 0 && (i = I.Parallel), i === I.Parallel ? this.fromPointAndNormal(e, t.normal) : i === I.Perpendicular ? this.fromPointAndNormal(e, t.director) : this);
+  ), this.#i = e.clone(), this.#n = t.clone(), this.#r = this.#n.clone().normal(), this);
+  fromPointAndLine = (e, t, i) => (i === void 0 && (i = B.Parallel), i === B.Parallel ? this.fromPointAndNormal(e, t.normal) : i === B.Perpendicular ? this.fromPointAndNormal(e, t.director) : this);
   fromPointAndNormal = (e, t) => this.fromCoefficient(
     t.x,
     t.y,
@@ -3718,7 +3728,7 @@ class b {
   }
   // ------------------------------------------
   getEquation() {
-    const e = new y(new u().parse("xy", this.#e, this.#i, this.#s), new u("0"));
+    const e = new y(new u().parse("xy", this.#e, this.#t, this.#s), new u("0"));
     return this.#h ? e.simplify() : e;
   }
   getValueAtX = (e) => {
@@ -3732,7 +3742,7 @@ class b {
     return t instanceof y ? t.right.evaluate({ y: i }) : new a().invalid();
   };
   get height() {
-    return this.#s.clone().opposite().divide(this.#i);
+    return this.#s.clone().opposite().divide(this.#t);
   }
   hitSegment(e, t) {
     const i = this.intersection(
@@ -3743,7 +3753,7 @@ class b {
   intersection = (e) => {
     const t = new v();
     let i = !1, s = !1;
-    return this.#i.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new a().invalid(), t.y = new a().invalid(), i = !0) : this.isSameAs(e) ? (t.x = new a().invalid(), t.y = new a().invalid(), s = !0) : (t.x = this.#i.clone().multiply(e.c).subtract(this.#s.clone().multiply(e.b)).divide(this.#e.clone().multiply(e.b).subtract(this.#i.clone().multiply(e.a))), t.y = this.#e.clone().multiply(e.c).subtract(this.#s.clone().multiply(e.a)).divide(this.#i.clone().multiply(e.a).subtract(this.#e.clone().multiply(e.b)))), {
+    return this.#t.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new a().invalid(), t.y = new a().invalid(), i = !0) : this.isSameAs(e) ? (t.x = new a().invalid(), t.y = new a().invalid(), s = !0) : (t.x = this.#t.clone().multiply(e.c).subtract(this.#s.clone().multiply(e.b)).divide(this.#e.clone().multiply(e.b).subtract(this.#t.clone().multiply(e.a))), t.y = this.#e.clone().multiply(e.c).subtract(this.#s.clone().multiply(e.a)).divide(this.#t.clone().multiply(e.a).subtract(this.#e.clone().multiply(e.b)))), {
       point: t,
       hasIntersection: !(i || s),
       isParallel: i,
@@ -3752,7 +3762,7 @@ class b {
   };
   // ------------------------------------------
   isOnLine = (e) => this.#e.clone().multiply(e.x).add(
-    this.#i.clone().multiply(e.y)
+    this.#t.clone().multiply(e.y)
   ).add(this.#s).isZero();
   isParallelTo = (e) => this.slope.isEqual(e.slope) && this.height.isNotEqual(e.height);
   isPerpendicularTo = (e) => this.d.isNormalTo(e.d);
@@ -3764,10 +3774,10 @@ class b {
     return this.#o = "mxh", this;
   }
   get n() {
-    return this.#n;
+    return this.#r;
   }
   get normal() {
-    return new g(this.#e, this.#i);
+    return new g(this.#e, this.#t);
   }
   get parametric() {
     return this.#o = "parametric", this;
@@ -3780,7 +3790,7 @@ class b {
     return t;
   };
   randomPoint = (e) => {
-    const t = this.#r.clone().multiplyByScalar(q(e === void 0 || e <= 1 ? 3 : e, !1)).add(this.#t);
+    const t = this.#n.clone().multiplyByScalar(q(e === void 0 || e <= 1 ? 3 : e, !1)).add(this.#i);
     return t.asPoint = !0, t;
   };
   get reduceBeforeDisplay() {
@@ -3790,16 +3800,16 @@ class b {
     this.#h = e;
   }
   simplify = () => {
-    const e = E.lcm(this.#e.denominator, this.#i.denominator, this.#s.denominator), t = E.gcd(this.#e.numerator, this.#i.numerator, this.#s.numerator);
+    const e = E.lcm(this.#e.denominator, this.#t.denominator, this.#s.denominator), t = E.gcd(this.#e.numerator, this.#t.numerator, this.#s.numerator);
     return this.fromCoefficient(
       this.#e.clone().multiply(e).divide(t),
-      this.#i.clone().multiply(e).divide(t),
+      this.#t.clone().multiply(e).divide(t),
       this.#s.clone().multiply(e).divide(t)
     ), this;
   };
-  simplifyDirection = () => (this.#r.simplify(), this);
+  simplifyDirection = () => (this.#n.simplify(), this);
   get slope() {
-    return this.#e.clone().opposite().divide(this.#i);
+    return this.#e.clone().opposite().divide(this.#t);
   }
   // ------------------------------------------
   // Special functions
@@ -3807,23 +3817,23 @@ class b {
     return this.#o = "system", this;
   }
 }
-class W {
-  #t = void 0;
-  #e = void 0;
+class V {
   #i = void 0;
+  #e = void 0;
+  #t = void 0;
   constructor(...e) {
     e.length > 0 && this.parse(...e);
   }
   get center() {
-    return this.#t ?? new v();
+    return this.#i ?? new v();
   }
   get squareRadius() {
     return this.#e ?? new a(0);
   }
   get cartesian() {
-    if (this.#i === void 0)
+    if (this.#t === void 0)
       throw new Error("Cartesian equation not defined");
-    return this.#i;
+    return this.#t;
   }
   get radius() {
     return this.#e === void 0 ? { tex: "", display: "", value: 0 } : this.#e.isSquare() ? {
@@ -3853,34 +3863,34 @@ class W {
    * @returns {number}
    */
   relativePosition = (e) => {
-    if (this.#t === void 0 || this.#e === void 0)
+    if (this.#i === void 0 || this.#e === void 0)
       throw new Error("Circle not defined");
-    const t = e.distanceTo(this.#t), i = Math.sqrt(this.#e.value);
+    const t = e.distanceTo(this.#i), i = Math.sqrt(this.#e.value);
     return t.value - i > 1e-10 ? 0 : Math.abs(t.value - i) < 1e-10 ? 1 : 2;
   };
   lineIntersection = (e) => {
     const t = [];
-    if (this.#i === void 0)
+    if (this.#t === void 0)
       return [];
-    const i = this.#i.clone(), s = e.getEquation().clone().isolate("x"), r = e.getEquation().clone().isolate("y");
-    return s instanceof y && r instanceof y && (i.replaceBy("y", r.right).simplify(), i.solve()), t;
+    const i = this.#t.clone(), s = e.getEquation().clone().isolate("x"), n = e.getEquation().clone().isolate("y");
+    return s instanceof y && n instanceof y && (i.replaceBy("y", n.right).simplify(), i.solve()), t;
   };
-  tangents = (e) => e instanceof a ? this.#n(e) : this.isPointOnCircle(e) ? this.#s(e) : this.#t !== void 0 && this.#t.distanceTo(e).value > this.radius.value ? this.#r(e) : (console.log("No tangents as the point is inside !"), []);
-  isPointOnCircle = (e) => this.#i?.test({ x: e.x, y: e.y }) ?? !1;
+  tangents = (e) => e instanceof a ? this.#r(e) : this.isPointOnCircle(e) ? this.#s(e) : this.#i !== void 0 && this.#i.distanceTo(e).value > this.radius.value ? this.#n(e) : (console.log("No tangents as the point is inside !"), []);
+  isPointOnCircle = (e) => this.#t?.test({ x: e.x, y: e.y }) ?? !1;
   getPointsOnCircle = (e) => {
     const t = E.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), i = [];
     return t.forEach((s) => {
-      for (const r of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
+      for (const n of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
         i.push(
           new v(
-            this.center.x.clone().add(r[0] * s[0]),
-            this.center.y.clone().add(r[1] * s[1])
+            this.center.x.clone().add(n[0] * s[0]),
+            this.center.y.clone().add(n[1] * s[1])
           )
         );
     }), i;
   };
   clone() {
-    return new W(
+    return new V(
       this.center.clone(),
       this.squareRadius.clone(),
       !0
@@ -3891,46 +3901,46 @@ class W {
   }
   #s = (e) => {
     const t = new g(this.center, e);
-    return [new b(e, t, I.Perpendicular)];
+    return [new b(e, t, B.Perpendicular)];
   };
-  #r = (e) => {
-    const t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), s = new u("x"), r = new u("x^2+1");
-    return s.multiply(t).subtract(i).pow(2), r.multiply(this.squareRadius), new y(s, r).solve().map((l) => {
+  #n = (e) => {
+    const t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), s = new u("x"), n = new u("x^2+1");
+    return s.multiply(t).subtract(i).pow(2), n.multiply(this.squareRadius), new y(s, n).solve().map((l) => {
       let c;
       const d = new y("y", "x");
       return l.exact instanceof a ? (c = e.x.clone().opposite().multiply(l.exact).add(e.y), d.right.multiply(l.exact).add(c)) : (c = e.x.clone().opposite().multiply(l.value).add(e.y), d.right.multiply(l.value).add(c)), new b(d);
     });
   };
-  #n = (e) => {
-    const t = e.numerator, i = -e.denominator, s = this.center.x.clone(), r = this.center.y.clone(), o = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), h = s.clone().multiply(t).opposite().subtract(r.clone().multiply(i)).add(o.clone().sqrt()), l = s.clone().multiply(t).opposite().subtract(r.clone().multiply(i)).subtract(o.clone().sqrt());
+  #r = (e) => {
+    const t = e.numerator, i = -e.denominator, s = this.center.x.clone(), n = this.center.y.clone(), o = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), h = s.clone().multiply(t).opposite().subtract(n.clone().multiply(i)).add(o.clone().sqrt()), l = s.clone().multiply(t).opposite().subtract(n.clone().multiply(i)).subtract(o.clone().sqrt());
     return [new b(t, i, h), new b(t, i, l)];
   };
   #o() {
-    return this.#t = void 0, this.#e = void 0, this.#i = void 0, this;
+    return this.#i = void 0, this.#e = void 0, this.#t = void 0, this;
   }
   parse(...e) {
-    return this.#o(), typeof e[0] == "string" ? this.#u(new y(e[0])) : e[0] instanceof y ? this.#u(e[0]) : e[0] instanceof W ? this.#a(e[0]) : e[0] instanceof v && e.length > 1 && (e[1] instanceof v ? e[2] instanceof v || this.#l(e[0], e[1]) : (e[1] instanceof a || typeof e[1] == "number") && this.#c(e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), this.#h(), this;
+    return this.#o(), typeof e[0] == "string" ? this.#u(new y(e[0])) : e[0] instanceof y ? this.#u(e[0]) : e[0] instanceof V ? this.#a(e[0]) : e[0] instanceof v && e.length > 1 && (e[1] instanceof v ? e[2] instanceof v || this.#l(e[0], e[1]) : (e[1] instanceof a || typeof e[1] == "number") && this.#c(e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), this.#h(), this;
   }
   #h() {
-    this.#i = new y(
+    this.#t = new y(
       new u(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
       new u(this.squareRadius.display)
     ).moveLeft();
   }
   #a(e) {
-    return this.#t = e.center.clone(), this.#e = e.squareRadius.clone(), this.#h(), this;
+    return this.#i = e.center.clone(), this.#e = e.squareRadius.clone(), this.#h(), this;
   }
   #c(e, t, i) {
-    return this.#t = e.clone(), i ? this.#e = new a(t) : this.#e = new a(t).pow(2), this;
+    return this.#i = e.clone(), i ? this.#e = new a(t) : this.#e = new a(t).pow(2), this;
   }
   #l(e, t) {
-    return this.#t = e.clone(), this.#e = new g(this.#t, t).normSquare, this;
+    return this.#i = e.clone(), this.#e = new g(this.#i, t).normSquare, this;
   }
   #u(e) {
     if (e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
       const t = e.left.monomByDegree(2, "x"), i = e.left.monomByDegree(2, "y");
-      let s, r, o;
-      t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), s = e.left.monomByDegree(1, "x"), r = e.left.monomByDegree(1, "y"), o = e.left.monomByDegree(0), this.#t = new v(s.coefficient.clone().divide(2).opposite(), r.coefficient.clone().divide(2).opposite()), this.#e = o.coefficient.clone().opposite().add(this.#t.x.clone().pow(2)).add(this.#t.y.clone().pow(2))) : (this.#t = void 0, this.#e = void 0);
+      let s, n, o;
+      t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), s = e.left.monomByDegree(1, "x"), n = e.left.monomByDegree(1, "y"), o = e.left.monomByDegree(0), this.#i = new v(s.coefficient.clone().divide(2).opposite(), n.coefficient.clone().divide(2).opposite()), this.#e = o.coefficient.clone().opposite().add(this.#i.x.clone().pow(2)).add(this.#i.y.clone().pow(2))) : (this.#i = void 0, this.#e = void 0);
     }
     return this;
   }
@@ -3941,24 +3951,24 @@ class W {
   //     return this
   // }
 }
-class ee {
+class Y {
   // A line is defined as the canonical form
-  static PERPENDICULAR = se.Perpendicular;
-  static PARALLEL = se.Parallel;
+  static PERPENDICULAR = Q.Perpendicular;
+  static PARALLEL = Q.Parallel;
   // ax + by + c = 0
-  #t = new v();
+  #i = new v();
   #e = new g();
   constructor(e, t) {
-    return this.#t = e.clone(), this.#e = t.asPoint ? new g(e, t) : t.clone(), this;
+    return this.#i = e.clone(), this.#e = t.asPoint ? new g(e, t) : t.clone(), this;
   }
   get OA() {
-    return this.#t;
+    return this.#i;
   }
   set OA(e) {
-    this.#t = e;
+    this.#i = e;
   }
   get point() {
-    return this.#t.clone();
+    return this.#i.clone();
   }
   get d() {
     return this.#e;
@@ -3968,27 +3978,27 @@ class ee {
   }
   get tex() {
     return {
-      parametric: `${g.asTex("x", "y", "z")} = ${g.asTex(this.#t.x.tex, this.#t.y.tex, this.#t.z.tex)} + k\\cdot ${g.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)}`,
+      parametric: `${g.asTex("x", "y", "z")} = ${g.asTex(this.#i.x.tex, this.#i.y.tex, this.#i.z.tex)} + k\\cdot ${g.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)}`,
       system: `\\left\\{\\begin{aligned}
-    x &= ${new u(this.#t.x).add(new p(this.#e.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new u(this.#t.y).add(new p(this.#e.y).multiply(new p("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new u(this.#t.z).add(new p(this.#e.z).multiply(new p("k"))).reorder("k", !0).tex}
+    x &= ${new u(this.#i.x).add(new p(this.#e.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new u(this.#i.y).add(new p(this.#e.y).multiply(new p("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new u(this.#i.z).add(new p(this.#e.z).multiply(new p("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`,
-      cartesian: `\\frac{ ${new u("x", 1, this.#t.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new u("y", 1, this.#t.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new u("z", 1, this.#t.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+      cartesian: `\\frac{ ${new u("x", 1, this.#i.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new u("y", 1, this.#i.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new u("z", 1, this.#i.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
     };
   }
   get display() {
-    const e = this.#t.x.display, t = this.#t.y.display, i = this.#t.z.display, s = this.direction.simplify(), r = s.x.display, o = s.y.display, h = s.z.display;
+    const e = this.#i.x.display, t = this.#i.y.display, i = this.#i.z.display, s = this.direction.simplify(), n = s.x.display, o = s.y.display, h = s.z.display;
     return {
-      parametric: `${g.asDisplay("x", "y", "z")} = ${g.asDisplay(this.#t.x.display, this.#t.y.display, this.#t.z.display)} + k\\cdot ${g.asDisplay(this.#e.x.display, this.#e.y.display, this.#e.z.display)}`,
+      parametric: `${g.asDisplay("x", "y", "z")} = ${g.asDisplay(this.#i.x.display, this.#i.y.display, this.#i.z.display)} + k\\cdot ${g.asDisplay(this.#e.x.display, this.#e.y.display, this.#e.z.display)}`,
       system: "",
-      cartesian: `(x-${e})/${r} = (y-${t})/${o} = (z-${i})/${h}`
+      cartesian: `(x-${e})/${n} = (y-${t})/${o} = (z-${i})/${h}`
     };
   }
   get direction() {
     return this.#e.clone();
   }
-  clone = () => (this.#e = this.#e.clone(), this.#t = this.#t.clone(), this);
+  clone = () => (this.#e = this.#e.clone(), this.#i = this.#i.clone(), this);
   // ------------------------------------------
   // Mathematical operations
   // ------------------------------------------
@@ -4012,7 +4022,7 @@ class ee {
     throw new Error("Method not implemented.");
   };
   distanceTo(e) {
-    const t = new g(this.#t, e), i = this.direction, s = this.direction.normSquare, r = t.cross(i).normSquare, o = r.clone().divide(s), h = o.clone().sqrt();
+    const t = new g(this.#i, e), i = this.direction, s = this.direction.normSquare, n = t.cross(i).normSquare, o = n.clone().divide(s), h = o.clone().sqrt();
     return console.log("CROSS", t.cross(i).display), {
       value: Math.sqrt(o.value),
       fraction: o.clone().sqrt(),
@@ -4021,7 +4031,7 @@ class ee {
   }
   hitSegment(e, t) {
     const i = this.intersection(
-      new ee(e, t)
+      new Y(e, t)
     );
     return i.hasIntersection ? i.point.x.value >= Math.min(e.x.value, t.x.value) && i.point.x.value <= Math.max(e.x.value, t.x.value) && i.point.y.value >= Math.min(e.y.value, t.y.value) && i.point.y.value <= Math.max(e.y.value, t.y.value) && i.point.z.value >= Math.min(e.z.value, t.z.value) && i.point.z.value <= Math.max(e.z.value, t.z.value) : !1;
   }
@@ -4042,7 +4052,7 @@ class ee {
   //     return new Fraction().invalid()
   // }
   randomPoint = (e = 5) => {
-    const t = this.#t.clone(), i = new a(q(e, !1));
+    const t = this.#i.clone(), i = new a(q(e, !1));
     return new v(
       t.x.clone().add(this.#e.x.clone().multiply(i)),
       t.y.clone().add(this.#e.y.clone().multiply(i)),
@@ -4050,17 +4060,17 @@ class ee {
     );
   };
 }
-class ae {
-  #t = new g(0, 0, 1);
+class ee {
+  #i = new g(0, 0, 1);
   #e = new v(0, 0, 0);
   constructor(e) {
     return e && this.parse(e), this;
   }
   get normal() {
-    return this.#t;
+    return this.#i;
   }
   set normal(e) {
-    this.#t = e, this.#t.asPoint = !1;
+    this.#i = e, this.#i.asPoint = !1;
   }
   get point() {
     return this.#e;
@@ -4069,16 +4079,16 @@ class ae {
     this.#e = e, this.#e.asPoint = !0;
   }
   get a() {
-    return this.#t.x;
+    return this.#i.x;
   }
   get b() {
-    return this.#t.y;
+    return this.#i.y;
   }
   get c() {
-    return this.#t.z;
+    return this.#i.z;
   }
   get d() {
-    return this.#t.dot(this.#e).opposite();
+    return this.#i.dot(this.#e).opposite();
   }
   get tex() {
     return new y(
@@ -4104,23 +4114,23 @@ class ae {
       return;
     }
     if (e.equation) {
-      const t = e.equation.moveLeft().reduce().left, i = t.monomByLetter("x").coefficient, s = t.monomByLetter("y").coefficient, r = t.monomByLetter("z").coefficient, o = t.monomByDegree(0).coefficient;
-      this.normal = new g(i, s, r), i.isNotZero() ? this.point = new v(o.clone().divide(i).opposite(), 0, 0) : s.isNotZero() ? this.point = new v(0, o.clone().divide(s).opposite(), 0) : this.point = new v(0, 0, o.clone().divide(r).opposite());
+      const t = e.equation.moveLeft().reduce().left, i = t.monomByLetter("x").coefficient, s = t.monomByLetter("y").coefficient, n = t.monomByLetter("z").coefficient, o = t.monomByDegree(0).coefficient;
+      this.normal = new g(i, s, n), i.isNotZero() ? this.point = new v(o.clone().divide(i).opposite(), 0, 0) : s.isNotZero() ? this.point = new v(0, o.clone().divide(s).opposite(), 0) : this.point = new v(0, 0, o.clone().divide(n).opposite());
       return;
     }
     if (e.points?.length === 3 && e.points.every((t) => t instanceof g)) {
-      const t = e.points[0], i = e.points[1], s = e.points[2], r = new g(t, i), o = new g(t, s);
-      this.normal = r.cross(o), this.point = t;
+      const t = e.points[0], i = e.points[1], s = e.points[2], n = new g(t, i), o = new g(t, s);
+      this.normal = n.cross(o), this.point = t;
       return;
     }
     if (e.coefficients?.length === 4) {
-      const [t, i, s, r] = e.coefficients;
-      this.normal = new g(t, i, s), this.point = new v(0, 0, -r);
+      const [t, i, s, n] = e.coefficients;
+      this.normal = new g(t, i, s), this.point = new v(0, 0, -n);
       return;
     }
   }
   angle(e, t, i) {
-    if (e instanceof ae)
+    if (e instanceof ee)
       return this.normal.angle(e.normal, t, i);
     let s;
     if (e instanceof g) {
@@ -4145,21 +4155,21 @@ class ae {
     return this.normal.dot(e).add(this.d).isZero();
   }
 }
-class H {
-  #t = new v();
-  #e = new v();
+class F {
   #i = new v();
+  #e = new v();
+  #t = new v();
   #s = {
     AB: new b(),
     AC: new b(),
     BC: new b()
   };
-  #r = {
+  #n = {
     AB: new v(),
     AC: new v(),
     BC: new v()
   };
-  #n = null;
+  #r = null;
   constructor(...e) {
     return e.length > 0 && this.parse(...e), this;
   }
@@ -4167,13 +4177,13 @@ class H {
   // Getter and setters
   // ------------------------------------------
   get A() {
-    return this.#t;
+    return this.#i;
   }
   get B() {
     return this.#e;
   }
   get C() {
-    return this.#i;
+    return this.#t;
   }
   get AB() {
     return this.#a("A", "B");
@@ -4206,7 +4216,7 @@ class H {
     return this.#s;
   }
   get remarquables() {
-    return this.#n;
+    return this.#r;
   }
   // ------------------------------------------
   // Creation / parsing functions
@@ -4235,35 +4245,35 @@ class H {
       if (e.every((t) => t instanceof b)) {
         const t = e[0].clone(), i = e[1].clone(), s = e[2].clone();
         this.#s = { AB: t, BC: i, AC: s };
-        let r = t.intersection(i);
-        if (r.hasIntersection)
-          this.#e = r.point.clone();
+        let n = t.intersection(i);
+        if (n.hasIntersection)
+          this.#e = n.point.clone();
         else
           throw new Error("Lines do not intersect !");
-        if (r = i.intersection(s), r.hasIntersection)
-          this.#i = r.point.clone();
+        if (n = i.intersection(s), n.hasIntersection)
+          this.#t = n.point.clone();
         else
           throw new Error("Lines do not intersect !");
-        if (r = s.intersection(t), r.hasIntersection)
-          this.#t = r.point.clone();
+        if (n = s.intersection(t), n.hasIntersection)
+          this.#i = n.point.clone();
         else
           throw new Error("Lines do not intersect !");
-      } else e.every((t) => t instanceof v) && (this.#t = e[0].clone(), this.#e = e[1].clone(), this.#i = e[2].clone(), this.#s = {
-        AB: new b(this.#t, this.#e),
-        BC: new b(this.#e, this.#i),
-        AC: new b(this.#t, this.#i)
+      } else e.every((t) => t instanceof v) && (this.#i = e[0].clone(), this.#e = e[1].clone(), this.#t = e[2].clone(), this.#s = {
+        AB: new b(this.#i, this.#e),
+        BC: new b(this.#e, this.#t),
+        AC: new b(this.#i, this.#t)
       });
-    } else if (e.length === 1 && e[0] instanceof H)
+    } else if (e.length === 1 && e[0] instanceof F)
       return e[0].clone();
     return this.#o(), this;
   };
   /**
    * Clone the Triangle class
    */
-  clone = () => new H(
-    this.#t.clone(),
+  clone = () => new F(
+    this.#i.clone(),
     this.#e.clone(),
-    this.#i.clone()
+    this.#t.clone()
   );
   // ------------------------------------------
   // Triangle operations and properties
@@ -4272,11 +4282,11 @@ class H {
    * Generate the Line object for the three segments of the triangle
    */
   #o = () => {
-    this.#t.asPoint = !0, this.#e.asPoint = !0, this.#i.asPoint = !0, this.#r = {
-      AB: new v().middleOf(this.#t, this.#e),
-      AC: new v().middleOf(this.#t, this.#i),
-      BC: new v().middleOf(this.#e, this.#i)
-    }, this.#n = this.#c();
+    this.#i.asPoint = !0, this.#e.asPoint = !0, this.#t.asPoint = !0, this.#n = {
+      AB: new v().middleOf(this.#i, this.#e),
+      AC: new v().middleOf(this.#i, this.#t),
+      BC: new v().middleOf(this.#e, this.#t)
+    }, this.#r = this.#c();
   };
   /**
    * Get the Vector2D class for the given name
@@ -4285,13 +4295,13 @@ class H {
   #h = (e) => {
     switch (e.toUpperCase()) {
       case "A":
-        return this.#t;
+        return this.#i;
       case "B":
         return this.#e;
       case "C":
-        return this.#i;
+        return this.#t;
     }
-    return this.#t;
+    return this.#i;
   };
   /**
    * Get the vector for the segment given by name.
@@ -4304,28 +4314,28 @@ class H {
   );
   #c = () => {
     const e = {
-      A: new b().fromPoints(this.#t, this.#r.BC),
-      B: new b().fromPoints(this.#e, this.#r.AC),
-      C: new b().fromPoints(this.#i, this.#r.AB),
+      A: new b().fromPoints(this.#i, this.#n.BC),
+      B: new b().fromPoints(this.#e, this.#n.AC),
+      C: new b().fromPoints(this.#t, this.#n.AB),
       intersection: null
     }, t = {
-      AB: new b().fromPointAndNormal(this.#r.AB, new g(this.#t, this.#e).normal()),
-      AC: new b().fromPointAndNormal(this.#r.AC, new g(this.#t, this.#i).normal()),
-      BC: new b().fromPointAndNormal(this.#r.BC, new g(this.#e, this.#i).normal()),
+      AB: new b().fromPointAndNormal(this.#n.AB, new g(this.#i, this.#e).normal()),
+      AC: new b().fromPointAndNormal(this.#n.AC, new g(this.#i, this.#t).normal()),
+      BC: new b().fromPointAndNormal(this.#n.BC, new g(this.#e, this.#t).normal()),
       intersection: null
     }, i = {
-      A: new b().fromPointAndNormal(this.#t, new g(this.#e, this.#i).normal()),
-      B: new b().fromPointAndNormal(this.#e, new g(this.#t, this.#i).normal()),
-      C: new b().fromPointAndNormal(this.#i, new g(this.#t, this.#e).normal()),
+      A: new b().fromPointAndNormal(this.#i, new g(this.#e, this.#t).normal()),
+      B: new b().fromPointAndNormal(this.#e, new g(this.#i, this.#t).normal()),
+      C: new b().fromPointAndNormal(this.#t, new g(this.#i, this.#e).normal()),
       intersection: null
-    }, s = this.#l("A"), r = this.#l("B"), o = this.#l("C"), h = {
+    }, s = this.#l("A"), n = this.#l("B"), o = this.#l("C"), h = {
       A: s.internal,
-      B: r.internal,
-      C: r.internal,
+      B: n.internal,
+      C: n.internal,
       intersection: null
     }, l = {
       A: s.external,
-      B: r.external,
+      B: n.external,
       C: o.external,
       intersection: null
     }, c = {
@@ -4342,34 +4352,34 @@ class H {
     let i, s;
     if (e === "A" ? (i = t.AB, s = t.AC) : e === "B" ? (i = t.AB, s = t.BC) : e === "C" && (i = t.BC, s = t.AC), i === void 0 || s === void 0)
       throw new Error(`The point ${e} does not exist`);
-    const r = i.n.simplify().norm, o = s.n.simplify().norm, h = i.getEquation().multiply(o), l = s.getEquation().multiply(r), c = new b(h.clone().subtract(l).simplify()), d = new b(l.clone().subtract(h).simplify());
+    const n = i.n.simplify().norm, o = s.n.simplify().norm, h = i.getEquation().multiply(o), l = s.getEquation().multiply(n), c = new b(h.clone().subtract(l).simplify()), d = new b(l.clone().subtract(h).simplify());
     return e === "A" ? c.hitSegment(this.B, this.C) ? { internal: c, external: d } : { internal: d, external: c } : e === "B" ? c.hitSegment(this.A, this.C) ? { internal: c, external: d } : { internal: d, external: c } : e === "C" ? c.hitSegment(this.B, this.A) ? { internal: c, external: d } : { internal: d, external: c } : { internal: c, external: d };
   };
 }
-var ge = /* @__PURE__ */ ((n) => (n[n.INTERIOR = 0] = "INTERIOR", n[n.EXTERIOR = 1] = "EXTERIOR", n[n.SECANT = 2] = "SECANT", n[n.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", n[n.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", n[n.SUPERPOSED = 5] = "SUPERPOSED", n[n.CONCENTRIC = 6] = "CONCENTRIC", n))(ge || {});
-class Ue {
-  #t = void 0;
-  #e = void 0;
+var oe = /* @__PURE__ */ ((r) => (r[r.INTERIOR = 0] = "INTERIOR", r[r.EXTERIOR = 1] = "EXTERIOR", r[r.SECANT = 2] = "SECANT", r[r.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", r[r.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", r[r.SUPERPOSED = 5] = "SUPERPOSED", r[r.CONCENTRIC = 6] = "CONCENTRIC", r))(oe || {});
+class Be {
   #i = void 0;
+  #e = void 0;
+  #t = void 0;
   #s = 1;
   constructor(e, t) {
-    return e && t && (this.#t = e, this.#e = new a(t).clone().pow(2), this.#n()), this;
+    return e && t && (this.#i = e, this.#e = new a(t).clone().pow(2), this.#r()), this;
   }
   fromEquation(e) {
     const t = new y(e).moveLeft().reduce(), i = ["x", "y", "z"];
-    if (i.some((r) => t.degree(r).value !== 2))
+    if (i.some((n) => t.degree(n).value !== 2))
       return this.makeUndefined();
     const s = t.left.monomByDegree(2, "x").coefficient;
-    return i.some((r) => t.left.monomByDegree(2, r).coefficient.isNotEqual(s)) ? this.makeUndefined() : (this.#t = new v(
+    return i.some((n) => t.left.monomByDegree(2, n).coefficient.isNotEqual(s)) ? this.makeUndefined() : (this.#i = new v(
       t.left.monomByDegree(1, "x").coefficient.clone().opposite().divide(2),
       t.left.monomByDegree(1, "y").coefficient.clone().opposite().divide(2),
       t.left.monomByDegree(1, "z").coefficient.clone().opposite().divide(2)
-    ), this.#e = t.left.monomByDegree(0).coefficient.clone().opposite().add(this.#t.x.clone().pow(2)).add(this.#t.y.clone().pow(2)).add(this.#t.z.clone().pow(2)), this.#n(), this);
+    ), this.#e = t.left.monomByDegree(0).coefficient.clone().opposite().add(this.#i.x.clone().pow(2)).add(this.#i.y.clone().pow(2)).add(this.#i.z.clone().pow(2)), this.#r(), this);
   }
   get center() {
-    if (this.#t === void 0)
+    if (this.#i === void 0)
       throw new Error("Sphere3 is undefined");
-    return this.#t;
+    return this.#i;
   }
   get squareRadius() {
     if (this.#e === void 0)
@@ -4390,12 +4400,12 @@ class Ue {
     };
   }
   get equation() {
-    if (this.#i === void 0)
+    if (this.#t === void 0)
       throw new Error("Sphere3 is undefined");
-    return this.#i;
+    return this.#t;
   }
   makeUndefined() {
-    return this.#t = void 0, this.#e = void 0, this.#i = void 0, this;
+    return this.#i = void 0, this.#e = void 0, this.#t = void 0, this;
   }
   get centerRadius() {
     return this.#s = 1, this;
@@ -4404,30 +4414,30 @@ class Ue {
     return this.#s = 0, this;
   }
   get tex() {
-    return this.#r(!0);
+    return this.#n(!0);
   }
   get display() {
-    return this.#r(!1);
+    return this.#n(!1);
   }
-  #r = (e) => {
-    if (this.#i === void 0)
+  #n = (e) => {
+    if (this.#t === void 0)
       throw new Error("Sphere3 is undefined");
     if (this.#s === 0)
-      return e ? this.#i.tex : this.#i.display;
+      return e ? this.#t.tex : this.#t.display;
     const t = [];
     return ["x", "y", "z"].forEach((s) => {
       if (this.center[s].isZero())
         t.push(`${s}^2`);
       else {
-        const r = new u(s).subtract(this.center[s]);
+        const n = new u(s).subtract(this.center[s]);
         t.push(
-          e ? `\\(${r.tex}\\)^2` : `(${r.display})^2`
+          e ? `\\(${n.tex}\\)^2` : `(${n.display})^2`
         );
       }
     }), t.join("+") + "=" + (e ? this.squareRadius.tex : this.squareRadius.display);
   };
-  #n() {
-    this.#i = new y(
+  #r() {
+    this.#t = new y(
       new u("x").subtract(this.center.x).pow(2).add(
         new u("y").subtract(this.center.y).pow(2)
       ).add(
@@ -4436,18 +4446,18 @@ class Ue {
       new u(this.squareRadius)
     ).reduce();
   }
-  static RELATIVE_POSITION = ge;
+  static RELATIVE_POSITION = oe;
   relativePosition = (e) => {
     const t = this.center.distanceTo(e.center).value, i = this.radius.value, s = e.radius.value;
     return t > i + s ? 1 : t === i + s ? 4 : t === 0 ? i === s ? 5 : 6 : t === Math.abs(i - s) ? 3 : t < Math.abs(i - s) ? 0 : 2;
   };
-  isPointOnSphere = (e) => this.#i?.test({
+  isPointOnSphere = (e) => this.#t?.test({
     x: e.x,
     y: e.y,
     z: e.z
   }) ?? !1;
 }
-function K(n) {
+function G(r) {
   const e = Object.assign(
     {
       negative: !0,
@@ -4456,18 +4466,18 @@ function K(n) {
       zero: !0,
       natural: !1
     },
-    n
+    r
   ), t = new a();
-  if (e.negative ? t.numerator = q(e.max, e.zero) : t.numerator = B(e.zero ? 0 : 1, e.max), e.natural)
+  if (e.negative ? t.numerator = q(e.max, e.zero) : t.numerator = k(e.zero ? 0 : 1, e.max), e.natural)
     t.denominator = 1;
   else {
     let i = 0;
     for (; t.isRelative() && i < 10; )
-      t.denominator = B(1, e.max), i++;
+      t.denominator = k(1, e.max), i++;
   }
   return e.reduced ? t.reduce() : t;
 }
-function we(n) {
+function he(r) {
   const e = Object.assign(
     {
       letters: "x",
@@ -4475,9 +4485,9 @@ function we(n) {
       fraction: !0,
       zero: !1
     },
-    n
+    r
   ), t = new p();
-  if (t.coefficient = K({
+  if (t.coefficient = G({
     zero: e.zero,
     reduced: !0,
     natural: !e.fraction
@@ -4485,14 +4495,14 @@ function we(n) {
     for (const i of e.letters.split(""))
       t.setLetter(i, 0);
     for (let i = 0; i < e.degree; i++) {
-      const s = he(e.letters.split(""));
+      const s = _(e.letters.split(""));
       t.setLetter(s, t.degree(s).clone().add(1));
     }
   } else
     t.setLetter(e.letters, e.degree);
   return t;
 }
-const Fe = {
+const Me = {
   letters: "x",
   degree: 2,
   fraction: !1,
@@ -4503,14 +4513,14 @@ const Fe = {
   numberOfMonoms: 0,
   positive: !0
 };
-function ye(n) {
+function ae(r) {
   const e = Object.assign(
-    Fe,
-    n
+    Me,
+    r
   ), t = new u().empty();
   let i;
   for (let s = e.degree; s >= 0; s--)
-    i = we({
+    i = he({
       letters: e.letters,
       degree: s,
       fraction: e.fraction,
@@ -4518,12 +4528,12 @@ function ye(n) {
     }), e.unit && e.degree === s && i.coefficient.one(), t.add(i);
   if (e.positive && t.monomByDegree().coefficient.isNegative() && t.monomByDegree().coefficient.opposite(), e.numberOfMonoms && e.numberOfMonoms > 0 && e.numberOfMonoms < t.length)
     for (; t.length > e.numberOfMonoms; ) {
-      const s = B(1, t.length - 1);
+      const s = k(1, t.length - 1);
       t.monoms.splice(s, 1);
     }
   return t.reduce();
 }
-function Ge(n) {
+function Se(r) {
   const e = Object.assign(
     {
       letters: "x",
@@ -4542,10 +4552,10 @@ function Ge(n) {
         everything: !1
       }
     },
-    n
+    r
   ), t = new u().one();
   for (let i = 0; i < e.degree; i++) {
-    const s = ye({
+    const s = ae({
       degree: 1,
       unit: e.unit,
       fraction: e.fraction,
@@ -4556,7 +4566,7 @@ function Ge(n) {
   }
   return new y(t, 0);
 }
-function re(n) {
+function H(r) {
   const e = Object.assign(
     {
       axis: !0,
@@ -4564,11 +4574,11 @@ function re(n) {
       max: 10,
       quadrant: null
     },
-    n
-  ), t = e.axis === "x", i = e.axis === "y", s = e.fraction ? K({ max: e.max, zero: t }) : new a(q(e.max, t)), r = e.fraction ? K({ max: e.max, zero: i }) : new a(q(e.max, i));
-  return Number(e.quadrant) === 1 && (s.abs(), r.abs()), Number(e.quadrant) === 2 && (s.isPositive() && s.opposite(), r.isNegative() && r.opposite()), Number(e.quadrant) === 3 && (s.isPositive() && s.opposite(), r.isPositive() && r.opposite()), Number(e.quadrant) === 4 && (s.isNegative() && s.opposite(), r.isPositive() && r.opposite()), new v(s, r);
+    r
+  ), t = e.axis === "x", i = e.axis === "y", s = e.fraction ? G({ max: e.max, zero: t }) : new a(q(e.max, t)), n = e.fraction ? G({ max: e.max, zero: i }) : new a(q(e.max, i));
+  return Number(e.quadrant) === 1 && (s.abs(), n.abs()), Number(e.quadrant) === 2 && (s.isPositive() && s.opposite(), n.isNegative() && n.opposite()), Number(e.quadrant) === 3 && (s.isPositive() && s.opposite(), n.isPositive() && n.opposite()), Number(e.quadrant) === 4 && (s.isNegative() && s.opposite(), n.isPositive() && n.opposite()), new v(s, n);
 }
-function We(n) {
+function Ie(r) {
   const e = Object.assign(
     {
       center: {
@@ -4577,12 +4587,12 @@ function We(n) {
       },
       pointsOnCircle: 8
     },
-    n
-  ), t = re(e.center);
+    r
+  ), t = H(e.center);
   let i, s;
-  return e.pointsOnCircle === 8 ? (i = B(1, 3), s = i ** 2 + (i + 1) ** 2) : s = B(1, 20), new W(t, s, !0);
+  return e.pointsOnCircle === 8 ? (i = k(1, 3), s = i ** 2 + (i + 1) ** 2) : s = k(1, 20), new V(t, s, !0);
 }
-function Xe(n) {
+function ze(r) {
   const e = Object.assign(
     {
       A: {
@@ -4590,7 +4600,7 @@ function Xe(n) {
         y: q(10)
       }
     },
-    n
+    r
   ), t = new g(
     q(10),
     q(10)
@@ -4599,7 +4609,7 @@ function Xe(n) {
     t.x = q(10), t.y = q(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 b().fromPointAndDirection(new g(e.A.x, e.A.y), t);
 }
-function Ye(n) {
+function Re(r) {
   const e = Object.assign(
     {
       A: {
@@ -4613,85 +4623,85 @@ function Ye(n) {
         z: q(10)
       }
     },
-    n
+    r
   ), t = new v(e.A.x, e.A.y, e.A.z), i = new g(e.direction.x, e.direction.y, e.direction.z);
-  return new ee(t, i);
+  return new Y(t, i);
 }
-const Qe = {
-  equation: (n) => Ge(n),
-  polynom: (n) => ye(n),
-  monom: (n) => we(n),
-  fraction: (n) => K(n),
-  number: (n, e, t) => B(n, e, t),
-  numberSym: (n, e) => q(n, e),
-  prime: (n) => Ve(n),
-  bool: (n) => pe(n),
-  array: (n, e) => je(n, e),
-  item: (n) => he(n),
-  shuffle: (n) => me(n),
-  line: (n) => Xe(n),
-  line3: (n) => Ye(n),
-  vector: (n) => re(n),
-  point: (n) => {
-    const e = re(n);
+const Pe = {
+  equation: (r) => Se(r),
+  polynom: (r) => ae(r),
+  monom: (r) => he(r),
+  fraction: (r) => G(r),
+  number: (r, e, t) => k(r, e, t),
+  numberSym: (r, e) => q(r, e),
+  prime: (r) => $e(r),
+  bool: (r) => ne(r),
+  array: (r, e) => ke(r, e),
+  item: (r) => _(r),
+  shuffle: (r) => re(r),
+  line: (r) => ze(r),
+  line3: (r) => Re(r),
+  vector: (r) => H(r),
+  point: (r) => {
+    const e = H(r);
     return e.asPoint = !0, e;
   },
-  circle: (n) => We(n)
-}, Ke = {
+  circle: (r) => Ie(r)
+}, Le = {
   Numeric: E,
   Fraction: a,
-  Root: X,
+  Root: j,
   Monom: p,
   Polynom: u,
   Equation: y,
-  Matrix: P,
-  LinearSystem: Z,
+  Matrix: I,
+  LinearSystem: D,
   Factor: x,
   PolyFactor: T,
-  LogicalSet: Pe,
-  Random: Qe,
+  LogicalSet: qe,
+  Random: Pe,
   Geometry: {
     Vector: g,
     Point: v,
     Line: b,
-    Triangle: H,
-    Circle: W,
-    Line3: ee,
-    Plane3: ae,
-    Sphere3: Ue
+    Triangle: F,
+    Circle: V,
+    Line3: Y,
+    Plane3: ee,
+    Sphere3: Be
   },
-  NumExp: Re
+  NumExp: Ae
 };
 export {
-  W as Circle,
+  V as Circle,
   y as Equation,
-  J as EquationSolver,
-  G as FACTOR_DISPLAY,
-  Oe as FRAC_TYPE,
+  W as EquationSolver,
+  Z as FACTOR_DISPLAY,
+  we as FRAC_TYPE,
   x as Factor,
   a as Fraction,
   b as Line,
-  ee as Line3,
-  Z as LinearSystem,
-  Pe as LogicalSet,
-  P as Matrix,
+  Y as Line3,
+  D as LinearSystem,
+  qe as LogicalSet,
+  I as Matrix,
   p as Monom,
-  X as NthRoot,
-  Re as NumExp,
+  j as NthRoot,
+  Ae as NumExp,
   E as Numeric,
-  ae as Plane3,
+  ee as Plane3,
   v as Point,
   T as PolyFactor,
   u as Polynom,
-  Qe as Random,
-  ge as SPHERE3_RELATIVE_POSITION,
-  Ue as Sphere3,
-  H as Triangle,
+  Pe as Random,
+  oe as SPHERE3_RELATIVE_POSITION,
+  Be as Sphere3,
+  F as Triangle,
   g as Vector,
-  Le as areVectorsColinears,
-  De as areVectorsEquals,
-  Ke as default,
-  He as determinantFromVectors,
-  Ze as dotProduct
+  Oe as areVectorsColinears,
+  Te as areVectorsEquals,
+  Le as default,
+  De as determinantFromVectors,
+  Ce as dotProduct
 };
 //# sourceMappingURL=pimath.js.map