pimath 0.1.0 → 0.1.3

package/dist/pimath.js

@@ -1,22 +1,22 @@
-var mi = Object.defineProperty;
-var Ht = (o) => {
+var Ti = Object.defineProperty;
+var ri = (o) => {
   throw TypeError(o);
 };
-var yi = (o, e, t) => e in o ? mi(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
-var a = (o, e, t) => yi(o, typeof e != "symbol" ? e + "" : e, t), zt = (o, e, t) => e.has(o) || Ht("Cannot " + t);
-var i = (o, e, t) => (zt(o, e, "read from private field"), t ? t.call(o) : e.get(o)), d = (o, e, t) => e.has(o) ? Ht("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, s) => (zt(o, e, "write to private field"), s ? s.call(o, t) : e.set(o, t), t), q = (o, e, t) => (zt(o, e, "access private method"), t);
-function gi(o) {
-  const e = Yt(o), t = [];
+var Ai = (o, e, t) => e in o ? Ti(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
+var a = (o, e, t) => Ai(o, typeof e != "symbol" ? e + "" : e, t), Gt = (o, e, t) => e.has(o) || ri("Cannot " + t);
+var i = (o, e, t) => (Gt(o, e, "read from private field"), t ? t.call(o) : e.get(o)), f = (o, e, t) => e.has(o) ? ri("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, s) => (Gt(o, e, "write to private field"), s ? s.call(o, t) : e.set(o, t), t), M = (o, e, t) => (Gt(o, e, "access private method"), t);
+function Mi(o) {
+  const e = oi(o), t = [];
   let s, r;
   for (; e.length > 0; )
     s = e.shift() ?? 1, r = (e.length > 0 ? e.pop() : +s) ?? 1, t.push([s, r]);
   return t;
 }
-function wi(...o) {
-  const e = Ut(...o);
+function Ii(...o) {
+  const e = ei(...o);
   return o.map((t) => t / e);
 }
-function Yt(o) {
+function oi(o) {
   const e = Math.abs(o), t = Math.sqrt(e), s = [];
   for (let r = 1; r <= t; r++)
     o % r === 0 && (s.push(r), s.push(e / r));
@@ -24,7 +24,7 @@ function Yt(o) {
     return r - n;
   }), [...new Set(s)];
 }
-function Ut(...o) {
+function ei(...o) {
   const e = function(r, n) {
     return n === 0 ? r : e(n, r % n);
   };
@@ -39,53 +39,53 @@ function Ut(...o) {
     ;
   return Math.abs(t);
 }
-function vi(...o) {
+function Ci(...o) {
   return o.reduce(function(e, t) {
-    return Math.abs(e * t / Ut(e, t));
+    return Math.abs(e * t / ei(e, t));
   });
 }
-function bi(o, e = 3) {
+function $i(o, e = 3) {
   return +o.toFixed(e);
 }
-function xi(o) {
+function Pi(o) {
   if (Number.isSafeInteger(o) || o.toString().split(".")[0].length < 10)
     return 0;
   throw new Error("Periodic value: Not implemented yet");
 }
-function Ei(o) {
+function Si(o) {
   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 o === void 0 ? e : e.slice(0, Math.min(e.length, o));
 }
-function Ni(o, e) {
+function Bi(o, e) {
   const t = [], s = e === !0 ? +o : o ** 2;
   for (let r = 0; r <= o; r++)
     for (let n = 0; n <= o; n++)
       r ** 2 + n ** 2 === s && t.push([r, n, o]);
   return t;
 }
-function Oi(o, e = 2) {
+function Ri(o, e = 2) {
   return +`${Math.round(+`${o}e${e}`)}e-${e}`;
 }
-const j = {
-  decompose: gi,
-  dividers: Yt,
-  divideNumbersByGCD: wi,
-  gcd: Ut,
-  lcm: vi,
-  numberCorrection: bi,
-  periodic: xi,
-  primes: Ei,
-  pythagoreanTripletsWithTarget: Ni,
-  round: Oi
+const G = {
+  decompose: Mi,
+  dividers: oi,
+  divideNumbersByGCD: Ii,
+  gcd: ei,
+  lcm: Ci,
+  numberCorrection: $i,
+  periodic: Pi,
+  primes: Si,
+  pythagoreanTripletsWithTarget: Bi,
+  round: Ri
 };
-var g, v, et, Ce;
+var w, b, ot, Be;
 const $ = class $ {
   constructor(e, t) {
     // #region Class fields (2)
-    d(this, g, 1);
-    d(this, v, 1);
-    d(this, et, !1);
-    d(this, Ce, "frac");
+    f(this, w, 1);
+    f(this, b, 1);
+    f(this, ot, !1);
+    f(this, Be, "frac");
     // ------------------------------------------
     /**
      * Parse the value to get the numerator and denominator
@@ -95,7 +95,7 @@ const $ = class $ {
     a(this, "parse", (e, t) => {
       let s;
       if (e === "")
-        return h(this, g, 0), h(this, v, 1), this;
+        return h(this, w, 0), h(this, b, 1), this;
       switch (typeof e) {
         case "string":
           if (s = e.split("/"), s.length > 2)
@@ -104,36 +104,36 @@ const $ = class $ {
             throw new Error(`The given value is not a valid fraction (${e})`);
           if (s.length === 1)
             return this.parse(+s[0]);
-          s.length === 2 ? s[1] === "0" ? (h(this, g, NaN), h(this, v, 1)) : (h(this, g, +s[0]), h(this, v, +s[1])) : (h(this, g, NaN), h(this, v, 1));
+          s.length === 2 ? s[1] === "0" ? (h(this, w, NaN), h(this, b, 1)) : (h(this, w, +s[0]), h(this, b, +s[1])) : (h(this, w, NaN), h(this, b, 1));
           break;
         case "number":
           if (Number.isSafeInteger(e))
-            h(this, g, +e), t === void 0 || !Number.isSafeInteger(t) ? h(this, v, 1) : h(this, v, +t);
+            h(this, w, +e), t === void 0 || !Number.isSafeInteger(t) ? h(this, b, 1) : h(this, b, +t);
           else {
             const [, r] = e.toString().split("."), n = r ? r.length : 0;
-            t === void 0 ? (h(this, g, e * Math.pow(10, n)), h(this, v, Math.pow(10, n))) : Number.isSafeInteger(t) && (h(this, g, e * Math.pow(10, n) - Math.floor(e * Math.pow(10, n - t))), this.denominator = Math.pow(10, n) - Math.pow(10, n - t)), this.reduce();
+            t === void 0 ? (h(this, w, e * Math.pow(10, n)), h(this, b, Math.pow(10, n))) : Number.isSafeInteger(t) && (h(this, w, e * Math.pow(10, n) - Math.floor(e * Math.pow(10, n - t))), this.denominator = Math.pow(10, n) - Math.pow(10, n - t)), this.reduce();
           }
           break;
         case "object":
-          e instanceof $ && (h(this, g, +e.numerator), h(this, v, +e.denominator));
+          e instanceof $ && (h(this, w, +e.numerator), h(this, b, +e.denominator));
           break;
       }
       return this;
     });
     a(this, "clone", () => {
       const e = new $();
-      return e.numerator = +i(this, g), e.denominator = +i(this, v), e;
+      return e.numerator = +i(this, w), e.denominator = +i(this, b), e;
     });
-    a(this, "abs", () => (h(this, g, Math.abs(i(this, g))), h(this, v, Math.abs(i(this, v))), this));
+    a(this, "abs", () => (h(this, w, Math.abs(i(this, w))), h(this, b, Math.abs(i(this, b))), this));
     a(this, "add", (e) => {
       if (e instanceof $) {
-        const t = i(this, g), s = i(this, v);
-        h(this, g, t * e.denominator + e.numerator * s), h(this, v, s * e.denominator);
+        const t = i(this, w), s = i(this, b);
+        h(this, w, t * e.denominator + e.numerator * s), h(this, b, s * e.denominator);
       } else
         return this.add(new $(e));
       return this.reduce();
     });
-    a(this, "amplify", (e) => (Number.isSafeInteger(e) && (h(this, g, i(this, g) * e), h(this, v, i(this, v) * e)), this));
+    a(this, "amplify", (e) => (Number.isSafeInteger(e) && (h(this, w, i(this, w) * e), h(this, b, i(this, b) * e)), this));
     // TODO: The rest of the functions are not used or unnecessary ?
     /**
      * Simple function to determine if it's a fraction
@@ -175,63 +175,63 @@ const $ = class $ {
       const t = new $(e);
       if (t.numerator === 0)
         return new $().infinite();
-      const s = +i(this, g), r = +i(this, v);
-      return h(this, g, s * t.denominator), h(this, v, r * t.numerator), this.reduce();
+      const s = +i(this, w), r = +i(this, b);
+      return h(this, w, s * t.denominator), h(this, b, r * t.numerator), this.reduce();
     });
-    a(this, "infinite", () => (h(this, g, 1 / 0), h(this, v, 1), this));
-    a(this, "invalid", () => (h(this, g, NaN), h(this, v, 1), this));
+    a(this, "infinite", () => (h(this, w, 1 / 0), h(this, b, 1), this));
+    a(this, "invalid", () => (h(this, w, NaN), h(this, b, 1), this));
     a(this, "inverse", () => {
-      const e = +i(this, g);
-      return h(this, g, +i(this, v)), h(this, v, e), this;
+      const e = +i(this, w);
+      return h(this, w, +i(this, b)), h(this, b, e), this;
     });
-    a(this, "isApproximative", () => i(this, et) || i(this, g).toString().length >= 15 && i(this, v).toString().length >= 15);
+    a(this, "isApproximative", () => i(this, ot) || i(this, w).toString().length >= 15 && i(this, b).toString().length >= 15);
     a(this, "isEqual", (e) => this.compare(e, "="));
     a(this, "isEven", () => this.isRelative() && this.value % 2 === 0);
     a(this, "isExact", () => !this.isApproximative());
     a(this, "isFinite", () => !this.isInfinity() && !this.isNaN());
     a(this, "isGeq", (e) => this.compare(e, ">="));
     a(this, "isGreater", (e) => this.compare(e, ">"));
-    a(this, "isInfinity", () => Math.abs(i(this, g)) === 1 / 0);
+    a(this, "isInfinity", () => Math.abs(i(this, w)) === 1 / 0);
     a(this, "isInverted", (e) => this.isEqual(new $().one().divide(e.clone())));
     a(this, "isLeq", (e) => this.compare(e, "<="));
     /* Compare shortcuts */
     a(this, "isLesser", (e) => this.compare(e, "<"));
-    a(this, "isNaN", () => isNaN(i(this, g)));
+    a(this, "isNaN", () => isNaN(i(this, w)));
     a(this, "isNatural", () => this.isRelative() && this.isPositive());
     a(this, "isNegative", () => this.sign() === -1);
-    a(this, "isNegativeOne", () => i(this, g) === -1 && i(this, v) === 1);
+    a(this, "isNegativeOne", () => i(this, w) === -1 && i(this, b) === 1);
     a(this, "isNotEqual", (e) => this.compare(e, "<>"));
-    a(this, "isNotZero", () => i(this, g) !== 0);
+    a(this, "isNotZero", () => i(this, w) !== 0);
     a(this, "isOdd", () => this.isRelative() && this.value % 2 === 1);
-    a(this, "isOne", () => i(this, g) === 1 && i(this, v) === 1);
+    a(this, "isOne", () => i(this, w) === 1 && i(this, b) === 1);
     a(this, "isOpposite", (e) => this.isEqual(e.clone().opposite()));
     a(this, "isPositive", () => this.sign() === 1);
     a(this, "isRational", () => !this.isRelative());
-    a(this, "isReduced", () => Math.abs(j.gcd(i(this, g), i(this, v))) === 1);
+    a(this, "isReduced", () => Math.abs(G.gcd(i(this, w), i(this, b))) === 1);
     a(this, "isRelative", () => this.clone().reduce().denominator === 1);
-    a(this, "isSquare", () => Math.sqrt(i(this, g)) % 1 === 0 && Math.sqrt(i(this, v)) % 1 === 0);
+    a(this, "isSquare", () => Math.sqrt(i(this, w)) % 1 === 0 && Math.sqrt(i(this, b)) % 1 === 0);
     a(this, "isStrictlyNegative", () => this.value < 0);
     a(this, "isStrictlyPositive", () => this.value > 0);
     // ------------------------------------------
     // Mathematical operations specific to fractions
-    a(this, "isZero", () => i(this, g) === 0);
+    a(this, "isZero", () => i(this, w) === 0);
     a(this, "multiply", (e) => {
       const t = new $(e);
-      return h(this, g, i(this, g) * t.numerator), h(this, v, i(this, v) * t.denominator), this.reduce();
+      return h(this, w, i(this, w) * t.numerator), h(this, b, i(this, b) * t.denominator), this.reduce();
     });
-    a(this, "one", () => (h(this, g, 1), h(this, v, 1), this));
-    a(this, "opposite", () => (h(this, g, -i(this, g)), this));
+    a(this, "one", () => (h(this, w, 1), h(this, b, 1), this));
+    a(this, "opposite", () => (h(this, w, -i(this, w)), this));
     a(this, "pow", (e) => {
       if (e instanceof $)
         return this.pow(e.value);
       this.reduce(), e < 0 && this.inverse();
-      const t = Math.floor(Math.pow(i(this, g), Math.abs(e))), s = Math.floor(Math.pow(i(this, v), Math.abs(e)));
-      return t ** Math.abs(e) === i(this, g) && s ** Math.abs(e) === i(this, v) ? (h(this, g, i(this, g) ** Math.abs(e)), h(this, v, i(this, v) ** Math.abs(e))) : (h(this, g, i(this, g) ** Math.abs(e)), h(this, v, i(this, v) ** Math.abs(e))), this;
+      const t = Math.floor(Math.pow(i(this, w), Math.abs(e))), s = Math.floor(Math.pow(i(this, b), Math.abs(e)));
+      return t ** Math.abs(e) === i(this, w) && s ** Math.abs(e) === i(this, b) ? (h(this, w, i(this, w) ** Math.abs(e)), h(this, b, i(this, b) ** Math.abs(e))) : (h(this, w, i(this, w) ** Math.abs(e)), h(this, b, i(this, b) ** Math.abs(e))), this;
     });
     // ------------------------------------------
     a(this, "reduce", () => {
-      const e = j.gcd(i(this, g), i(this, v));
-      return h(this, g, i(this, g) / e), h(this, v, i(this, v) / e), i(this, v) < 0 && (h(this, v, -i(this, v)), h(this, g, -i(this, g))), this;
+      const e = G.gcd(i(this, w), i(this, b));
+      return h(this, w, i(this, w) / e), h(this, b, i(this, b) / e), i(this, b) < 0 && (h(this, b, -i(this, b)), h(this, w, -i(this, w))), this;
     });
     a(this, "root", (e) => {
       if (e === 0)
@@ -242,57 +242,57 @@ const $ = class $ {
         throw new Error("The root of a negative number must be odd.");
       const t = this.sign();
       this.abs(), this.reduce();
-      const s = Math.floor(Math.pow(i(this, g), Math.abs(1 / e))), r = Math.floor(Math.pow(i(this, v), Math.abs(1 / e)));
-      return h(this, g, Math.pow(i(this, g), Math.abs(1 / e))), h(this, v, Math.pow(i(this, v), Math.abs(1 / e))), (s !== i(this, g) || r !== i(this, v)) && (h(this, g, i(this, g) / i(this, v)), h(this, v, 1), h(this, et, !0)), this.multiply(t), this;
+      const s = Math.floor(Math.pow(i(this, w), Math.abs(1 / e))), r = Math.floor(Math.pow(i(this, b), Math.abs(1 / e)));
+      return h(this, w, Math.pow(i(this, w), Math.abs(1 / e))), h(this, b, Math.pow(i(this, b), Math.abs(1 / e))), (s !== i(this, w) || r !== i(this, b)) && (h(this, w, i(this, w) / i(this, b)), h(this, b, 1), h(this, ot, !0)), this.multiply(t), this;
     });
-    a(this, "sign", () => i(this, g) * i(this, v) >= 0 ? 1 : -1);
+    a(this, "sign", () => i(this, w) * i(this, b) >= 0 ? 1 : -1);
     a(this, "sqrt", () => this.root(2));
     a(this, "subtract", (e) => e instanceof $ ? this.add(e.clone().opposite()) : this.add(-e));
-    a(this, "zero", () => (h(this, g, 0), h(this, v, 1), this));
+    a(this, "zero", () => (h(this, w, 0), h(this, b, 1), this));
     return e !== void 0 && this.parse(e, t), this;
   }
   // #endregion Properties and methods (55)
   // #region Getters And Setters (11)
   get denominator() {
-    return i(this, v);
+    return i(this, b);
   }
   set denominator(e) {
-    h(this, v, e);
+    h(this, b, e);
   }
   get display() {
-    return this.isExact() ? i(this, v) === 1 ? `${i(this, g)}` : `${i(this, g)}/${i(this, v)}` : this.value.toFixed(3);
+    return this.isExact() ? i(this, b) === 1 ? `${i(this, w)}` : `${i(this, w)}/${i(this, b)}` : this.value.toFixed(3);
   }
   // ------------------------------------------
   // Getter and setter
   // ------------------------------------------
   get numerator() {
-    return i(this, g);
+    return i(this, w);
   }
   set numerator(e) {
-    h(this, g, e);
+    h(this, w, e);
   }
   get tfrac() {
-    return h(this, Ce, "tfrac"), this;
+    return h(this, Be, "tfrac"), this;
   }
   get dfrac() {
-    return h(this, Ce, "dfrac"), this;
+    return h(this, Be, "dfrac"), this;
   }
   get frac() {
-    return h(this, Ce, "frac"), this;
+    return h(this, Be, "frac"), this;
   }
   // Display getter
   get tex() {
-    return this.isInfinity() ? `${this.sign() === 1 ? "+" : "-"}\\infty` : this.isExact() ? i(this, v) === 1 ? `${i(this, g)}` : i(this, g) < 0 ? `-\\${i(this, Ce)}{ ${-i(this, g)} }{ ${i(this, v)} }` : `\\${i(this, Ce)}{ ${i(this, g)} }{ ${i(this, v)} }` : this.value.toFixed(3);
+    return this.isInfinity() ? `${this.sign() === 1 ? "+" : "-"}\\infty` : this.isExact() ? i(this, b) === 1 ? `${i(this, w)}` : i(this, w) < 0 ? `-\\${i(this, Be)}{ ${-i(this, w)} }{ ${i(this, b)} }` : `\\${i(this, Be)}{ ${i(this, w)} }{ ${i(this, b)} }` : this.value.toFixed(3);
   }
   get texWithSign() {
     return this.isPositive() ? `+${this.tex}` : this.tex;
   }
   get value() {
-    return i(this, g) / i(this, v);
+    return i(this, w) / i(this, b);
   }
   // #endregion Getters And Setters (11)
 };
-g = new WeakMap(), v = new WeakMap(), et = new WeakMap(), Ce = new WeakMap(), a($, "average", (...e) => {
+w = new WeakMap(), b = new WeakMap(), ot = new WeakMap(), Be = new WeakMap(), a($, "average", (...e) => {
   const t = new $().zero();
   for (const s of e)
     t.add(s);
@@ -328,318 +328,182 @@ g = new WeakMap(), v = new WeakMap(), et = new WeakMap(), Ce = new WeakMap(), a(
   return t;
 });
 let c = $;
-var le, Se, P, ye, Qe, Qt, Kt, Jt, Lt, _t;
-const Wt = class Wt {
-  constructor(e, t, s = "x") {
-    d(this, P);
-    d(this, le);
-    d(this, Se);
-    if (h(this, Se, s), Object.hasOwn(e, "moveLeft")) {
-      const r = e;
-      h(this, le, r.left.clone().subtract(r.right));
-    } else
-      h(this, le, e.clone().subtract(t ?? 0));
-  }
-  solve() {
-    if (i(this, le).degree().isOne())
-      return q(this, P, Qt).call(this);
-    if (i(this, le).degree().value === 2)
-      return q(this, P, Kt).call(this);
-    const e = q(this, P, _t).call(this);
-    if (e.length > 0)
-      return e;
-    if (i(this, le).degree().value === 3)
-      return q(this, P, Lt).call(this);
-    throw new Error("The equation degree is too high.");
-  }
-  solveAsCardan() {
-    if (i(this, le).degree().value !== 3)
-      throw new Error("The equation is not cubic.");
-    return q(this, P, Lt).call(this);
-  }
-};
-le = new WeakMap(), Se = new WeakMap(), P = new WeakSet(), ye = function(e) {
-  if (e instanceof c && e.isApproximative())
-    return q(this, P, Qe).call(this, e.value);
-  const t = new c(e);
-  return {
-    variable: i(this, Se),
-    exact: t,
-    value: t.value,
-    tex: t.tex,
-    display: t.display
-  };
-}, Qe = function(e, t) {
-  return {
-    variable: i(this, Se),
-    exact: !1,
-    value: +e.toFixed(10),
-    tex: (t == null ? void 0 : t.tex) ?? "",
-    display: (t == null ? void 0 : t.display) ?? ""
-  };
-}, Qt = function() {
-  const e = i(this, le).monomByDegree(0).coefficient.clone().opposite().divide(i(this, le).monomByDegree(1).coefficient);
-  return [
-    q(this, P, ye).call(this, e)
-  ];
-}, Kt = function() {
-  const e = i(this, le), t = e.monomByDegree(2).coefficient, s = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, n = s.clone().pow(2).subtract(t.clone().multiply(r).multiply(4));
-  if (n.isNegative())
-    return [];
-  if (n.isSquare()) {
-    const l = n.sqrt(), u = s.clone().opposite().add(l).divide(t.clone().multiply(2)), b = s.clone().opposite().subtract(l).divide(t.clone().multiply(2));
-    return l.isZero() ? [q(this, P, ye).call(this, u)] : [
-      q(this, P, ye).call(this, u),
-      q(this, P, ye).call(this, b)
-    ].sort((p, m) => p.value - m.value);
-  }
-  return q(this, P, Jt).call(this, t, s, n);
-}, Jt = function(e, t, s) {
-  const r = j.dividers(s.value).filter((de) => Math.sqrt(de) % 1 === 0).map((de) => Math.sqrt(de)).pop() ?? 1, n = j.gcd(2 * e.value, t.value, r) * (e.isNegative() ? -1 : 1), l = t.clone().divide(n).opposite(), u = e.clone().divide(n).multiply(2), b = s.clone().divide(r ** 2), p = Math.abs(r / n), m = r === 1 ? "-" : `-${p} `, x = r === 1 ? "+" : `+${p} `;
-  function k(de, ae, Xe, St) {
-    return `\\frac{ ${ae} ${Xe}\\sqrt{ ${St} } }{ ${de} }`;
-  }
-  function _(de, ae, Xe, St) {
-    return `(${ae}${Xe}sqrt(${St}))/${de}`;
-  }
-  const oe = s.value ** 0.5, he = (-t.value - oe) / (2 * e.value), me = (-t.value + oe) / (2 * e.value);
-  return [
-    q(this, P, Qe).call(this, he, {
-      tex: k(u.tex, l.tex, m.toString(), b.tex),
-      display: _(u.display, l.display, m.toString(), b.display)
-    }),
-    q(this, P, Qe).call(this, me, {
-      tex: k(u.tex, l.tex, x.toString(), b.tex),
-      display: _(u.display, l.display, x.toString(), b.display)
-    })
-  ].sort((de, ae) => de.value - ae.value);
-}, Lt = function() {
-  const e = i(this, le), t = e.monomByDegree(3).coefficient, s = e.monomByDegree(2).coefficient, r = e.monomByDegree(1).coefficient, n = e.monomByDegree(0).coefficient, l = s.clone().divide(t), u = r.clone().divide(t), b = n.clone().divide(t), p = u.clone().subtract(l.clone().pow(2).divide(3)), m = b.clone().subtract(l.clone().multiply(u).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), x = m.clone().opposite(), k = p.clone().opposite().pow(3).divide(27), _ = x.clone().pow(2).subtract(k.clone().multiply(4)).opposite();
-  if (_.isNegative()) {
-    const oe = m.clone().opposite().add(_.clone().opposite().sqrt()).divide(2).root(3), he = m.clone().opposite().subtract(_.clone().opposite().sqrt()).divide(2).root(3), me = oe.clone().add(he).subtract(l.clone().divide(3));
-    return [q(this, P, ye).call(this, me)];
-  }
-  if (_.isZero()) {
-    const oe = m.clone().opposite().divide(2).root(3), he = oe.clone().opposite().subtract(l.clone().divide(3)), me = oe.clone().multiply(2).subtract(l.clone().divide(3));
-    return he.isEqual(me) ? [q(this, P, ye).call(this, he)] : [
-      q(this, P, ye).call(this, me),
-      q(this, P, ye).call(this, he)
-    ].sort((de, ae) => de.value - ae.value);
-  }
-  if (_.isPositive()) {
-    const oe = [], he = p.value, me = m.value, de = l.value;
-    for (let ae = 0; ae < 3; ae++)
-      oe.push(2 * Math.sqrt(-he / 3) * Math.cos(Math.acos(3 * me / (2 * he) * Math.sqrt(-3 / he)) / 3 + 2 * Math.PI * ae / 3) - de / 3);
-    return oe.map((ae) => q(this, P, Qe).call(this, ae)).sort((ae, Xe) => ae.value - Xe.value);
-  }
-  return [];
-}, _t = function() {
-  let e = i(this, le).clone(), t = [];
-  const s = e.lcmDenominator();
-  s !== 1 && e.multiply(s);
-  const r = e.monomByDegree().coefficient;
-  let n = e.monomByDegree(0).coefficient;
-  for (; n.isZero(); )
-    t.length === 0 && t.push(q(this, P, ye).call(this, 0)), e = e.divide("x"), n = e.monomByDegree(0).coefficient;
-  const l = j.dividers(r.value), u = j.dividers(n.value);
-  for (const m of l)
-    for (const x of u) {
-      const k = new c(x, m);
-      e.evaluate(k).isZero() && !t.find((_) => _.value === k.value) && t.push(q(this, P, ye).call(this, k)), k.opposite(), e.evaluate(k).isZero() && !t.find((_) => _.value === k.value) && t.push(q(this, P, ye).call(this, k));
-    }
-  for (const m of t) {
-    if (m.exact !== !1 && m.exact.isZero())
-      continue;
-    const x = i(this, le).clone().parse("x", m.exact.denominator, -m.exact.numerator);
-    for (; e.isDividableBy(x); )
-      console.log(e.display, x.display), e = e.divide(x);
-  }
-  if (e.degree().isZero())
-    return t.sort((m, x) => m.value - x.value);
-  if (e.degree().value > 3)
-    return [];
-  const b = e.clone().parse("0");
-  console.log(e.display), console.log(b.display);
-  const p = new Wt(e, e.clone().parse("0"), i(this, Se));
-  return t = t.concat(p.solve()), t.sort((m, x) => m.value - x.value);
-};
-let ct = Wt;
-var L, Q, te, Ze;
-class ot {
+var Z, J, se, We;
+class ft {
   constructor(...e) {
-    d(this, L);
-    d(this, Q);
-    d(this, te);
-    d(this, Ze);
+    f(this, Z);
+    f(this, J);
+    f(this, se);
+    f(this, We);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
-    a(this, "parse", (e, t, s) => (h(this, te, s ?? 1), h(this, Q, t ?? 2), h(this, L, e), i(this, Q) % 2 === 0 && i(this, L) < 0 && h(this, Ze, !1), this));
+    a(this, "parse", (e, t, s) => (h(this, se, s ?? 1), h(this, J, t ?? 2), h(this, Z, e), i(this, J) % 2 === 0 && i(this, Z) < 0 && h(this, We, !1), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
     a(this, "reduce", () => {
-      let e = Math.floor(Math.pow(i(this, L), 1 / i(this, Q)));
+      let e = Math.floor(Math.pow(i(this, Z), 1 / i(this, J)));
       for (; e > 1; ) {
-        if (i(this, L) % Math.pow(e, i(this, Q)) === 0) {
-          h(this, te, i(this, te) * e), h(this, L, i(this, L) / Math.pow(e, i(this, Q))), e = Math.floor(Math.pow(i(this, L), 1 / i(this, Q)));
+        if (i(this, Z) % Math.pow(e, i(this, J)) === 0) {
+          h(this, se, i(this, se) * e), h(this, Z, i(this, Z) / Math.pow(e, i(this, J))), e = Math.floor(Math.pow(i(this, Z), 1 / i(this, J)));
           continue;
         }
         e--;
       }
       return this;
     });
-    a(this, "multiply", (e) => (h(this, L, i(this, L) * e.radical), this.reduce()));
+    a(this, "multiply", (e) => (h(this, Z, i(this, Z) * e.radical), this.reduce()));
     // ------------------------------------------
     // Help functions
     // ------------------------------------------
-    a(this, "hasRadical", () => !(i(this, L) === 1 || i(this, L) === 0 || !i(this, Ze)));
-    h(this, L, 1), h(this, te, 1), h(this, Q, 2), h(this, Ze, !0), e.length > 0 && this.parse(e[0], e[1], e[2]);
+    a(this, "hasRadical", () => !(i(this, Z) === 1 || i(this, Z) === 0 || !i(this, We)));
+    h(this, Z, 1), h(this, se, 1), h(this, J, 2), h(this, We, !0), e.length > 0 && this.parse(e[0], e[1], e[2]);
   }
   // ------------------------------------------
   // Getter and setter
   // ------------------------------------------
   get radical() {
-    return i(this, L);
+    return i(this, Z);
   }
   set radical(e) {
-    h(this, L, e);
+    h(this, Z, e);
   }
   get nth() {
-    return i(this, Q);
+    return i(this, J);
   }
   set nth(e) {
-    Number.isSafeInteger(e) && e >= 2 ? h(this, Q, e) : (console.log("Error setting the nth root"), h(this, Q, 2));
+    Number.isSafeInteger(e) && e >= 2 ? h(this, J, e) : (console.log("Error setting the nth root"), h(this, J, 2));
   }
   get coefficient() {
-    return i(this, te);
+    return i(this, se);
   }
   set coefficient(e) {
-    h(this, te, e);
+    h(this, se, e);
   }
   get tex() {
     let e;
-    return i(this, te) === 1 ? e = "" : i(this, te) === -1 ? e = "-" : e = i(this, te).toString(), i(this, L) === 1 ? `${i(this, te)}` : i(this, Q) === 2 ? `${e}\\sqrt{${i(this, L)}}` : `${e}\\sqrt[${i(this, Q)}]{${i(this, L)}}`;
+    return i(this, se) === 1 ? e = "" : i(this, se) === -1 ? e = "-" : e = i(this, se).toString(), i(this, Z) === 1 ? `${i(this, se)}` : i(this, J) === 2 ? `${e}\\sqrt{${i(this, Z)}}` : `${e}\\sqrt[${i(this, J)}]{${i(this, Z)}}`;
   }
   get display() {
     let e;
-    return i(this, te) === 1 ? e = "" : i(this, te) === -1 ? e = "-" : e = i(this, te).toString(), i(this, L) === 1 ? `${i(this, te)}` : i(this, Q) === 2 ? `${e}sqrt{${i(this, L)}}` : `${e}root(${i(this, Q)}){${i(this, L)}}`;
+    return i(this, se) === 1 ? e = "" : i(this, se) === -1 ? e = "-" : e = i(this, se).toString(), i(this, Z) === 1 ? `${i(this, se)}` : i(this, J) === 2 ? `${e}sqrt{${i(this, Z)}}` : `${e}root(${i(this, J)}){${i(this, Z)}}`;
   }
   get value() {
-    return i(this, te) * Math.pow(i(this, L), 1 / i(this, Q));
+    return i(this, se) * Math.pow(i(this, Z), 1 / i(this, J));
   }
 }
-L = new WeakMap(), Q = new WeakMap(), te = new WeakMap(), Ze = new WeakMap();
-var ei = (o) => {
+Z = new WeakMap(), J = new WeakMap(), se = new WeakMap(), We = new WeakMap();
+var hi = (o) => {
   throw TypeError(o);
-}, ti = (o, e, t) => e.has(o) || ei("Cannot " + t), Y = (o, e, t) => (ti(o, e, "read from private field"), t ? t.call(o) : e.get(o)), Ye = (o, e, t) => e.has(o) ? ei("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), ve = (o, e, t, s) => (ti(o, e, "write to private field"), e.set(o, t), t);
-const ii = {
+}, ai = (o, e, t) => e.has(o) || hi("Cannot " + t), K = (o, e, t) => (ai(o, e, "read from private field"), t ? t.call(o) : e.get(o)), tt = (o, e, t) => e.has(o) ? hi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), be = (o, e, t, s) => (ai(o, e, "write to private field"), e.set(o, t), t);
+const li = {
   pi: Math.PI,
   e: Math.exp(1)
 };
-var f = /* @__PURE__ */ ((o) => (o.VARIABLE = "variable", o.COEFFICIENT = "coefficient", o.OPERATION = "operation", o.CONSTANT = "constant", o.FUNCTION = "function", o.FUNCTION_ARGUMENT = "function-argument", o.MONOM = "monom", o.LEFT_PARENTHESIS = "(", o.RIGHT_PARENTHESIS = ")", o))(f || {}), Ke = /* @__PURE__ */ ((o) => (o.EXPRESSION = "expression", o.POLYNOM = "polynom", o.SET = "set", o.NUMERIC = "numeric", o))(Ke || {});
-function Ti(o, e) {
+var d = /* @__PURE__ */ ((o) => (o.VARIABLE = "variable", o.COEFFICIENT = "coefficient", o.OPERATION = "operation", o.CONSTANT = "constant", o.FUNCTION = "function", o.FUNCTION_ARGUMENT = "function-argument", o.MONOM = "monom", o.LEFT_PARENTHESIS = "(", o.RIGHT_PARENTHESIS = ")", o))(d || {}), it = /* @__PURE__ */ ((o) => (o.EXPRESSION = "expression", o.POLYNOM = "polynom", o.SET = "set", o.NUMERIC = "numeric", o))(it || {});
+function zi(o, e) {
   if (o.length <= 1)
     return o;
-  const t = Object.keys(e).filter((x) => e[x].type === f.FUNCTION).map((x) => x);
-  t.sort((x, k) => k.length - x.length);
-  const s = new RegExp(`^(${t.join("|")})\\(`), r = Object.keys(ii);
-  r.sort((x, k) => k.length - x.length);
+  const t = Object.keys(e).filter((E) => e[E].type === d.FUNCTION).map((E) => E);
+  t.sort((E, L) => L.length - E.length);
+  const s = new RegExp(`^(${t.join("|")})\\(`), r = Object.keys(li);
+  r.sort((E, L) => L.length - E.length);
   const n = new RegExp(`^(${r.join("|")})`), l = /^(\d+(\.\d+)?)/;
-  let u = "", b, p, m;
+  let u = "", p, m, g;
   for (; o.length > 0; ) {
-    if (b = p, m = void 0, t.length > 0 && s.exec(o)) {
-      const x = t.find((k) => o.startsWith(k));
-      x && (m = x + "(", o = o.slice(x.length + 1), p = f.FUNCTION);
+    if (p = m, g = void 0, t.length > 0 && s.exec(o)) {
+      const E = t.find((L) => o.startsWith(L));
+      E && (g = E + "(", o = o.slice(E.length + 1), m = d.FUNCTION);
     } else if (r.length > 0 && n.exec(o)) {
-      const x = r.find((k) => o.startsWith(k));
-      x && (m = x, o = o.slice(x.length), p = f.CONSTANT);
+      const E = r.find((L) => o.startsWith(L));
+      E && (g = E, o = o.slice(E.length), m = d.CONSTANT);
     } else if (l.exec(o)) {
-      const x = l.exec(o);
-      x && (m = x[0], o = o.slice(x[0].length), p = f.COEFFICIENT);
+      const E = l.exec(o);
+      E && (g = E[0], o = o.slice(E[0].length), m = d.COEFFICIENT);
     } else
-      switch (m = o[0], o = o.slice(1), m) {
+      switch (g = o[0], o = o.slice(1), g) {
         case "(":
-          p = f.LEFT_PARENTHESIS;
+          m = d.LEFT_PARENTHESIS;
           break;
         case ")":
-          p = f.RIGHT_PARENTHESIS;
+          m = d.RIGHT_PARENTHESIS;
           break;
         case ",":
-          p = f.FUNCTION_ARGUMENT;
+          m = d.FUNCTION_ARGUMENT;
           break;
         case "+":
         case "-":
         case "*":
         case "/":
         case "^":
-          p = f.OPERATION;
+          m = d.OPERATION;
           break;
         default:
-          p = f.VARIABLE;
+          m = d.VARIABLE;
       }
-    if (m === void 0 || p === void 0)
+    if (g === void 0 || m === void 0)
       throw new Error("The token is undefined");
-    u += Ai(b, p), u += m;
+    u += ki(p, m), u += g;
   }
   return u;
 }
-function Ai(o, e) {
-  return o === void 0 || o === f.OPERATION || e === f.OPERATION || o === f.LEFT_PARENTHESIS || o === f.FUNCTION || o === f.FUNCTION_ARGUMENT || e === f.RIGHT_PARENTHESIS || e === f.FUNCTION_ARGUMENT ? "" : "*";
+function ki(o, e) {
+  return o === void 0 || o === d.OPERATION || e === d.OPERATION || o === d.LEFT_PARENTHESIS || o === d.FUNCTION || o === d.FUNCTION_ARGUMENT || e === d.RIGHT_PARENTHESIS || e === d.FUNCTION_ARGUMENT ? "" : "*";
 }
-const qi = {
-  "^": { 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 }
-}, Mi = {
-  "^": { 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 },
-  "%": { precedence: 3, associative: "right", type: f.OPERATION },
-  sin: { precedence: 4, associative: "right", type: f.FUNCTION },
-  cos: { precedence: 4, associative: "right", type: f.FUNCTION },
-  tan: { precedence: 4, associative: "right", type: f.FUNCTION },
-  sqrt: { precedence: 4, associative: "right", type: f.FUNCTION },
-  nthrt: { precedence: 4, associative: "right", type: f.FUNCTION },
-  ",": { precedence: 2, associative: "left", type: f.FUNCTION_ARGUMENT }
-}, Ii = {
-  "^": { 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 },
-  "%": { precedence: 3, associative: "right", type: f.OPERATION },
-  sin: { precedence: 4, associative: "right", type: f.FUNCTION },
-  cos: { precedence: 4, associative: "right", type: f.FUNCTION },
-  tan: { precedence: 4, associative: "right", type: f.FUNCTION },
-  sqrt: { precedence: 4, associative: "right", type: f.FUNCTION },
-  nthrt: { precedence: 4, associative: "right", type: f.FUNCTION },
-  ln: { precedence: 4, associative: "right", type: f.FUNCTION },
-  log: { precedence: 4, associative: "right", type: f.FUNCTION }
-}, Ci = {
-  "&": { 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 }
+const Li = {
+  "^": { precedence: 4, associative: "right", type: d.OPERATION },
+  "*": { precedence: 3, associative: "left", type: d.OPERATION },
+  "/": { precedence: 3, associative: "left", type: d.OPERATION },
+  "+": { precedence: 2, associative: "left", type: d.OPERATION },
+  "-": { precedence: 2, associative: "left", type: d.OPERATION }
+}, Di = {
+  "^": { precedence: 4, associative: "right", type: d.OPERATION },
+  "*": { precedence: 3, associative: "left", type: d.OPERATION },
+  "/": { precedence: 3, associative: "left", type: d.OPERATION },
+  "+": { precedence: 2, associative: "left", type: d.OPERATION },
+  "-": { precedence: 2, associative: "left", type: d.OPERATION },
+  "%": { precedence: 3, associative: "right", type: d.OPERATION },
+  sin: { precedence: 4, associative: "right", type: d.FUNCTION },
+  cos: { precedence: 4, associative: "right", type: d.FUNCTION },
+  tan: { precedence: 4, associative: "right", type: d.FUNCTION },
+  sqrt: { precedence: 4, associative: "right", type: d.FUNCTION },
+  nthrt: { precedence: 4, associative: "right", type: d.FUNCTION },
+  ",": { precedence: 2, associative: "left", type: d.FUNCTION_ARGUMENT }
+}, Zi = {
+  "^": { precedence: 4, associative: "right", type: d.OPERATION },
+  "*": { precedence: 3, associative: "left", type: d.OPERATION },
+  "/": { precedence: 3, associative: "left", type: d.OPERATION },
+  "+": { precedence: 2, associative: "left", type: d.OPERATION },
+  "-": { precedence: 2, associative: "left", type: d.OPERATION },
+  "%": { precedence: 3, associative: "right", type: d.OPERATION },
+  sin: { precedence: 4, associative: "right", type: d.FUNCTION },
+  cos: { precedence: 4, associative: "right", type: d.FUNCTION },
+  tan: { precedence: 4, associative: "right", type: d.FUNCTION },
+  sqrt: { precedence: 4, associative: "right", type: d.FUNCTION },
+  nthrt: { precedence: 4, associative: "right", type: d.FUNCTION },
+  ln: { precedence: 4, associative: "right", type: d.FUNCTION },
+  log: { precedence: 4, associative: "right", type: d.FUNCTION }
+}, Vi = {
+  "&": { precedence: 3, associative: "left", type: d.OPERATION },
+  "|": { precedence: 3, associative: "left", type: d.OPERATION },
+  "!": { precedence: 4, associative: "right", type: d.OPERATION },
+  "-": { precedence: 2, associative: "left", type: d.OPERATION }
 };
-var Le, Je, ee, ht, Pe;
-class si {
+var je, st, ie, dt, ke;
+class ci {
   constructor(e) {
-    Ye(this, Le), Ye(this, Je, []), Ye(this, ee, {}), Ye(this, ht, []), Ye(this, Pe), ve(this, Le, typeof e > "u" ? Ke.POLYNOM : e), this.tokenConfigInitialization();
+    tt(this, je), tt(this, st, []), tt(this, ie, {}), tt(this, dt, []), tt(this, ke), be(this, je, typeof e > "u" ? it.POLYNOM : e), this.tokenConfigInitialization();
   }
   // Getter
   get rpn() {
-    return Y(this, Je);
+    return K(this, st);
   }
   get rpnToken() {
-    return Y(this, Je).map((e) => e.token);
+    return K(this, st).map((e) => e.token);
   }
   tokenConfigInitialization() {
-    return Y(this, Le) === Ke.SET ? (ve(this, ee, Ci), ve(this, Pe, !1)) : Y(this, Le) === Ke.NUMERIC ? (ve(this, ee, Ii), ve(this, Pe, !0)) : Y(this, Le) === Ke.EXPRESSION ? (ve(this, ee, Mi), ve(this, Pe, !0)) : (ve(this, ee, qi), ve(this, Pe, !0)), ve(this, ht, Object.keys(Y(this, ee)).sort((e, t) => t.length - e.length)), Y(this, ee);
+    return K(this, je) === it.SET ? (be(this, ie, Vi), be(this, ke, !1)) : K(this, je) === it.NUMERIC ? (be(this, ie, Zi), be(this, ke, !0)) : K(this, je) === it.EXPRESSION ? (be(this, ie, Di), be(this, ke, !0)) : (be(this, ie, Li), be(this, ke, !0)), be(this, dt, Object.keys(K(this, ie)).sort((e, t) => t.length - e.length)), K(this, ie);
   }
   /**
    * Get the next token to analyse.
@@ -649,31 +513,31 @@ class si {
   NextToken(e, t) {
     let s, r;
     if (s = "", r = void 0, e[t] === "(")
-      s = "(", r = f.LEFT_PARENTHESIS;
+      s = "(", r = d.LEFT_PARENTHESIS;
     else if (e[t] === ")")
-      s = ")", r = f.RIGHT_PARENTHESIS;
+      s = ")", r = d.RIGHT_PARENTHESIS;
     else if (e[t] === ",")
-      s = ",", r = f.FUNCTION_ARGUMENT;
+      s = ",", r = d.FUNCTION_ARGUMENT;
     else {
-      for (const n of Y(this, ht))
+      for (const n of K(this, dt))
         if (e.substring(t, t + n.length) === n) {
-          s += n, r = Y(this, ee)[n].type;
+          s += n, r = K(this, ie)[n].type;
           break;
         }
-      for (const n in ii)
+      for (const n in li)
         if (e.substring(t, t + n.length) === n) {
-          s += n, r = f.CONSTANT;
+          s += n, r = d.CONSTANT;
           break;
         }
       if (s === "")
         if (/[0-9.]/.exec(e[t])) {
           const n = /^([0-9.]+)/.exec(e.substring(t));
-          s = n ? n[0] : "", r = f.COEFFICIENT;
+          s = n ? n[0] : "", r = d.COEFFICIENT;
         } else if (/[a-zA-Z]/.exec(e[t])) {
           const n = /^([a-zA-Z])/.exec(e.substring(t));
-          s = n ? n[0] : "", r = f.VARIABLE;
+          s = n ? n[0] : "", r = d.VARIABLE;
         } else
-          console.log("Unidentified token", e[t], e, t), s = e[t], r = f.MONOM;
+          console.log("Unidentified token", e[t], e, t), s = e[t], r = d.MONOM;
     }
     if (r === void 0)
       throw new Error(`Token type is undefined for token ${s}`);
@@ -688,56 +552,56 @@ class si {
   parse(e, t) {
     const s = [], r = [];
     let n = "", l = 0, u;
-    (t ?? Y(this, Pe)) && (e = Ti(e, Y(this, ee)));
-    const b = 50;
-    let p = 50, m;
+    (t ?? K(this, ke)) && (e = zi(e, K(this, ie)));
+    const p = 50;
+    let m = 50, g;
     for (; l < e.length; ) {
-      if (p--, p === 0) {
+      if (m--, m === 0) {
         console.log("SECURITY LEVEL 1 EXIT");
         break;
       }
       switch ([n, l, u] = this.NextToken(e, l), u) {
-        case f.MONOM:
-        case f.COEFFICIENT:
-        case f.VARIABLE:
-        case f.CONSTANT:
+        case d.MONOM:
+        case d.COEFFICIENT:
+        case d.VARIABLE:
+        case d.CONSTANT:
           s.push({
             token: n,
             tokenType: u
           });
           break;
-        case f.OPERATION:
+        case d.OPERATION:
           if (r.length > 0) {
-            let x = r[r.length - 1];
-            for (m = +b; x.token in Y(this, ee) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
-            (Y(this, ee)[n].associative === "left" && Y(this, ee)[n].precedence <= Y(this, ee)[x.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
-            Y(this, ee)[n].associative === "right" && Y(this, ee)[n].precedence < Y(this, ee)[x.token].precedence); ) {
-              if (m--, m === 0) {
+            let E = r[r.length - 1];
+            for (g = +p; E.token in K(this, ie) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
+            (K(this, ie)[n].associative === "left" && K(this, ie)[n].precedence <= K(this, ie)[E.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
+            K(this, ie)[n].associative === "right" && K(this, ie)[n].precedence < K(this, ie)[E.token].precedence); ) {
+              if (g--, g === 0) {
                 console.log("SECURITY LEVEL 2 OPERATION EXIT");
                 break;
               }
-              if (s.push(r.pop() ?? { token: "", tokenType: f.OPERATION }), r.length === 0)
+              if (s.push(r.pop() ?? { token: "", tokenType: d.OPERATION }), r.length === 0)
                 break;
-              x = r[r.length - 1];
+              E = r[r.length - 1];
             }
           }
           r.push({ token: n, tokenType: u });
           break;
-        case f.FUNCTION_ARGUMENT:
-          for (m = +b; r[r.length - 1].token !== "(" && r.length > 0; ) {
-            if (m--, m === 0) {
+        case d.FUNCTION_ARGUMENT:
+          for (g = +p; r[r.length - 1].token !== "(" && r.length > 0; ) {
+            if (g--, g === 0) {
               console.log("SECURITY LEVEL 2 FUNCTION ARGUMENT EXIT");
               break;
             }
             s.push(r.pop() ?? { token: n, tokenType: u });
           }
           break;
-        case f.LEFT_PARENTHESIS:
-          r.push({ token: n, tokenType: u }), e[l] === "-" && s.push({ token: "0", tokenType: f.COEFFICIENT });
+        case d.LEFT_PARENTHESIS:
+          r.push({ token: n, tokenType: u }), e[l] === "-" && s.push({ token: "0", tokenType: d.COEFFICIENT });
           break;
-        case f.RIGHT_PARENTHESIS:
-          for (m = +b; r[r.length - 1].token !== "(" && r.length > 1; ) {
-            if (m--, m === 0) {
+        case d.RIGHT_PARENTHESIS:
+          for (g = +p; r[r.length - 1].token !== "(" && r.length > 1; ) {
+            if (g--, g === 0) {
               console.log("SECURITY LEVEL 2 CLOSING PARENTHESIS EXIT");
               break;
             }
@@ -745,31 +609,31 @@ class si {
           }
           r.pop();
           break;
-        case f.FUNCTION:
+        case d.FUNCTION:
           r.push({ token: n, tokenType: u });
           break;
         default:
           throw new Error(`Token type ${n} is not handled`);
       }
     }
-    return ve(this, Je, s.concat(r.reverse())), this;
+    return be(this, st, s.concat(r.reverse())), this;
   }
 }
-Le = /* @__PURE__ */ new WeakMap(), Je = /* @__PURE__ */ new WeakMap(), ee = /* @__PURE__ */ new WeakMap(), ht = /* @__PURE__ */ new WeakMap(), Pe = /* @__PURE__ */ new WeakMap();
-var N, w, Ve, at, $e, dt, pt;
-const B = class B {
+je = /* @__PURE__ */ new WeakMap(), st = /* @__PURE__ */ new WeakMap(), ie = /* @__PURE__ */ new WeakMap(), dt = /* @__PURE__ */ new WeakMap(), ke = /* @__PURE__ */ new WeakMap();
+var O, v, He, pt, Re, bt, xt;
+const P = class P {
   constructor(e) {
-    d(this, Ve);
-    d(this, N);
-    d(this, w);
+    f(this, He);
+    f(this, O);
+    f(this, v);
     /**
      * Clone the current Monom.
      */
     a(this, "clone", () => {
-      const e = new B();
-      e.coefficient = i(this, N).clone();
-      for (const t in i(this, w))
-        e.setLetter(t, i(this, w)[t].clone());
+      const e = new P();
+      e.coefficient = i(this, O).clone();
+      for (const t in i(this, v))
+        e.setLetter(t, i(this, v)[t].clone());
       return e;
     });
     /**
@@ -778,27 +642,27 @@ const B = class B {
      */
     a(this, "add", (...e) => {
       for (const t of e) {
-        const s = t instanceof B ? t : new B(t);
-        this.isSameAs(s) ? (this.isZero() && q(this, Ve, at).call(this, s), i(this, N).add(s.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", s.display);
+        const s = t instanceof P ? t : new P(t);
+        this.isSameAs(s) ? (this.isZero() && M(this, He, pt).call(this, s), i(this, O).add(s.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", s.display);
       }
       return this;
     });
-    a(this, "containsRationalPower", () => Object.values(i(this, w)).some((e) => e.isRational()));
+    a(this, "containsRationalPower", () => Object.values(i(this, v)).some((e) => e.isRational()));
     /**
      * Get the degree of a monom. If no setLetter is given, the result will be the global degree.
      * @param letter (string) Letter to get to degree (power)
      */
-    a(this, "degree", (e) => this.variables.length === 0 ? new c().zero() : e === void 0 ? Object.values(i(this, w)).reduce((t, s) => t.clone().add(s)) : this.hasVariable(e) ? i(this, w)[e].clone() : new c().zero());
+    a(this, "degree", (e) => this.variables.length === 0 ? new c().zero() : e === void 0 ? Object.values(i(this, v)).reduce((t, s) => t.clone().add(s)) : this.hasVariable(e) ? i(this, v)[e].clone() : new c().zero());
     /**
      * Derivative the monom
      * @param letter
      */
     a(this, "derivative", (e) => {
       if (e === void 0 && (e = "x"), this.hasVariable(e)) {
-        const t = i(this, w)[e].clone(), s = this.clone();
-        return i(s, w)[e].subtract(1), i(s, N).multiply(new c(t.clone())), s;
+        const t = i(this, v)[e].clone(), s = this.clone();
+        return i(s, v)[e].subtract(1), i(s, O).multiply(new c(t.clone())), s;
       } else
-        return new B().zero();
+        return new P().zero();
     });
     /**
      * Divide the current monoms by multiple monoms
@@ -806,10 +670,10 @@ const B = class B {
      */
     a(this, "divide", (...e) => {
       for (const t of e) {
-        const s = t instanceof B ? t : new B(t);
-        i(this, N).divide(s.coefficient);
+        const s = t instanceof P ? t : new P(t);
+        i(this, O).divide(s.coefficient);
         for (const r in s.literal)
-          i(this, w)[r] = this.hasVariable(r) ? i(this, w)[r].subtract(s.literal[r]) : s.literal[r].clone().opposite(), i(this, w)[r].isZero() && this.removeVariable(r);
+          i(this, v)[r] = this.hasVariable(r) ? i(this, v)[r].subtract(s.literal[r]) : s.literal[r].clone().opposite(), i(this, v)[r].isZero() && this.removeVariable(r);
       }
       return this;
     });
@@ -821,16 +685,16 @@ const B = class B {
     a(this, "evaluate", (e, t) => {
       if (t === !0) {
         if (e instanceof c)
-          return i(this, $e).call(this, e.value);
-        if (e instanceof ot)
+          return i(this, Re).call(this, e.value);
+        if (e instanceof ft)
           return new c().invalid();
         if (typeof e == "number")
-          return i(this, $e).call(this, e);
+          return i(this, Re).call(this, e);
         if (typeof e == "object") {
           const r = {};
           for (const n in e)
             r[n] = new c(e[n]).value;
-          return i(this, $e).call(this, r);
+          return i(this, Re).call(this, r);
         }
       }
       const s = this.coefficient.clone();
@@ -838,14 +702,14 @@ const B = class B {
         const r = {};
         return r[this.variables[0]] = new c(e), this.evaluate(r);
       }
-      if (e instanceof ot)
+      if (e instanceof ft)
         return new c().invalid();
       if (typeof e == "object") {
         if (this.variables.length === 0)
           return this.coefficient;
-        for (const r in i(this, w)) {
+        for (const r in i(this, v)) {
           const n = new c(e[r]);
-          s.multiply(n.pow(i(this, w)[r]));
+          s.multiply(n.pow(i(this, v)[r]));
         }
       }
       return s;
@@ -855,11 +719,11 @@ const B = class B {
      * Determine if a monom contains a setLetter in it's literal part
      * @param letter
      */
-    a(this, "hasVariable", (e) => Object.hasOwn(i(this, w), e ?? "x"));
+    a(this, "hasVariable", (e) => Object.hasOwn(i(this, v), e ?? "x"));
     a(this, "inverse", () => {
-      i(this, N).opposite();
-      for (const e in i(this, w))
-        i(this, w)[e].opposite();
+      i(this, O).opposite();
+      for (const e in i(this, v))
+        i(this, v)[e].opposite();
       return this;
     });
     a(this, "isDivisible", (e) => {
@@ -874,7 +738,7 @@ const B = class B {
      * Determine if two monoms are equals
      * @param M
      */
-    a(this, "isEqual", (e) => this.isSameAs(e) && i(this, N).isEqual(e.coefficient));
+    a(this, "isEqual", (e) => this.isSameAs(e) && i(this, O).isEqual(e.coefficient));
     a(this, "isLiteralSquare", () => {
       for (const e in this.literal)
         if (this.literal[e].isRational() || this.literal[e].isEven())
@@ -884,7 +748,7 @@ const B = class B {
     /**
      * Determine if the monom is one
      */
-    a(this, "isOne", () => i(this, N).value === 1 && this.variables.length === 0);
+    a(this, "isOne", () => i(this, O).value === 1 && this.variables.length === 0);
     /**
      * Determine if two monoms are similar
      * @param M
@@ -897,7 +761,7 @@ const B = class B {
         return !1;
       if (!this.isZero() && !e.isZero()) {
         for (const n of r)
-          if (!this.hasVariable(n) || !e.hasVariable(n) || !i(this, w)[n].isEqual(e.literal[n]))
+          if (!this.hasVariable(n) || !e.hasVariable(n) || !i(this, v)[n].isEqual(e.literal[n]))
             return !1;
       }
       return !0;
@@ -906,37 +770,37 @@ const B = class B {
     /**
      * Determine if the monom is null
      */
-    a(this, "isZero", () => i(this, N).value === 0);
+    a(this, "isZero", () => i(this, O).value === 0);
     /**
      * Multiple multiple monoms to the current monom
      * @param M (Monom[]) The monoms to multiply to.
      */
     a(this, "multiply", (...e) => {
       for (const t of e) {
-        const s = t instanceof B ? t : new B(t);
-        i(this, N).multiply(s.coefficient);
+        const s = t instanceof P ? t : new P(t);
+        i(this, O).multiply(s.coefficient);
         for (const r in s.literal)
-          this.hasVariable(r) ? i(this, w)[r].add(s.literal[r]) : i(this, w)[r] = s.literal[r].clone();
+          this.hasVariable(r) ? i(this, v)[r].add(s.literal[r]) : i(this, v)[r] = s.literal[r].clone();
       }
       return this;
     });
     /**
      * Create a one value monom
      */
-    a(this, "one", () => (h(this, N, new c().one()), h(this, w, {}), this));
+    a(this, "one", () => (h(this, O, new c().one()), h(this, v, {}), this));
     /**
      * Get the opposite
      * Returns a monom.
      */
-    a(this, "opposite", () => (i(this, N).opposite(), this));
+    a(this, "opposite", () => (i(this, O).opposite(), this));
     /**
      * Get the pow of a monom.
      * @param nb (number) : Mathematical pow
      */
     a(this, "pow", (e) => {
-      i(this, N).pow(e);
-      for (const t in i(this, w))
-        i(this, w)[t].multiply(e);
+      i(this, O).pow(e);
+      for (const t in i(this, v))
+        i(this, v)[t].multiply(e);
       return this;
     });
     // #endregion Properties and methods (31)
@@ -949,8 +813,8 @@ const B = class B {
     });
     a(this, "reduce", () => {
       this.coefficient.reduce();
-      for (const e in i(this, w))
-        i(this, w)[e].isZero() && this.removeVariable(e);
+      for (const e in i(this, v))
+        i(this, v)[e].isZero() && this.removeVariable(e);
       return this;
     });
     /**
@@ -964,15 +828,15 @@ const B = class B {
      * @param letter (string) Letter to change
      * @param pow (number) Power of the setLetter (must be positive integer.
      */
-    a(this, "setLetter", (e, t) => t instanceof c ? (this.hasVariable(e) && t.isZero() && this.removeVariable(e), i(this, w)[e] = t.clone(), this) : this.setLetter(e, new c(t)));
+    a(this, "setLetter", (e, t) => t instanceof c ? (this.hasVariable(e) && t.isZero() && this.removeVariable(e), i(this, v)[e] = t.clone(), this) : this.setLetter(e, new c(t)));
     /**
      * Return the square root of a monom
      */
     a(this, "sqrt", () => {
       if (this.isSquare()) {
-        i(this, N).sqrt();
-        for (const e in i(this, w))
-          i(this, w)[e].clone().divide(2);
+        i(this, O).sqrt();
+        for (const e in i(this, v))
+          i(this, v)[e].clone().divide(2);
       }
       return this;
     });
@@ -982,75 +846,75 @@ const B = class B {
      */
     a(this, "subtract", (...e) => {
       for (const t of e) {
-        const s = t instanceof B ? t : new B(t);
-        this.isSameAs(s) ? (this.isZero() && q(this, Ve, at).call(this, s), i(this, N).add(s.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", s.display);
+        const s = t instanceof P ? t : new P(t);
+        this.isSameAs(s) ? (this.isZero() && M(this, He, pt).call(this, s), i(this, O).add(s.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", s.display);
       }
       return this;
     });
     /**
      * Create a zero value monom
      */
-    a(this, "zero", () => (h(this, N, new c().zero()), h(this, w, {}), this));
-    d(this, $e, (e) => {
+    a(this, "zero", () => (h(this, O, new c().zero()), h(this, v, {}), this));
+    f(this, Re, (e) => {
       let t = this.coefficient.value;
       if (typeof e == "number") {
         const s = {}, r = this.variables[0];
-        return s[r] = e, i(this, $e).call(this, s);
+        return s[r] = e, i(this, Re).call(this, s);
       }
       if (e instanceof c) {
         const s = {};
-        return s[this.variables[0]] = new c(e).value, i(this, $e).call(this, s);
+        return s[this.variables[0]] = new c(e).value, i(this, Re).call(this, s);
       }
-      if (e instanceof ot)
+      if (e instanceof ft)
         return NaN;
       if (typeof e == "object") {
         if (this.variables.length === 0)
           return this.coefficient.value;
-        for (const s in i(this, w)) {
+        for (const s in i(this, v)) {
           const r = e[s];
-          r instanceof c ? t *= r.value ** i(this, w)[s].value : t *= r ** i(this, w)[s].value;
+          r instanceof c ? t *= r.value ** i(this, v)[s].value : t *= r ** i(this, v)[s].value;
         }
       }
       return t;
     });
-    d(this, dt, (e) => {
-      const s = new si().parse(e).rpn, r = [];
+    f(this, bt, (e) => {
+      const s = new ci().parse(e).rpn, r = [];
       if (s.length === 0)
         return this.zero(), this;
       if (s.length === 1) {
         const n = s[0];
-        return this.one(), n.tokenType === f.COEFFICIENT ? this.coefficient = new c(n.token) : n.tokenType === f.VARIABLE && this.setLetter(n.token, 1), this;
+        return this.one(), n.tokenType === d.COEFFICIENT ? this.coefficient = new c(n.token) : n.tokenType === d.VARIABLE && this.setLetter(n.token, 1), this;
       } else
         for (const n of s)
-          i(this, pt).call(this, r, n);
+          i(this, xt).call(this, r, n);
       return this.one(), this.multiply(r[0]), this;
     });
-    d(this, pt, (e, t) => {
-      var b;
+    f(this, xt, (e, t) => {
+      var p;
       let s, r, n, l, u;
-      if (t.tokenType === f.COEFFICIENT)
-        e.push(new B(new c(t.token)));
-      else if (t.tokenType === f.VARIABLE) {
-        const p = new B().one();
-        p.setLetter(t.token, 1), e.push(p.clone());
-      } else if (t.tokenType === f.OPERATION)
+      if (t.tokenType === d.COEFFICIENT)
+        e.push(new P(new c(t.token)));
+      else if (t.tokenType === d.VARIABLE) {
+        const m = new P().one();
+        m.setLetter(t.token, 1), e.push(m.clone());
+      } else if (t.tokenType === d.OPERATION)
         switch (t.token) {
           case "-":
-            r = e.pop() ?? new B().zero(), s = e.pop() ?? new B().zero(), e.push(s.subtract(r));
+            r = e.pop() ?? new P().zero(), s = e.pop() ?? new P().zero(), e.push(s.subtract(r));
             break;
           case "*":
-            r = e.pop() ?? new B().one(), s = e.pop() ?? new B().one(), e.push(s.multiply(r));
+            r = e.pop() ?? new P().one(), s = e.pop() ?? new P().one(), e.push(s.multiply(r));
             break;
           case "/":
-            r = e.pop() ?? new B().one(), s = e.pop() ?? new B().one(), e.push(s.divide(r));
+            r = e.pop() ?? new P().one(), s = e.pop() ?? new P().one(), e.push(s.divide(r));
             break;
           case "^": {
-            u = ((b = e.pop()) == null ? void 0 : b.coefficient) ?? new c().one(), n = e.pop() ?? new B().one(), l = n.variables[0], l && n.setLetter(l, u), e.push(n);
+            u = ((p = e.pop()) == null ? void 0 : p.coefficient) ?? new c().one(), n = e.pop() ?? new P().one(), l = n.variables[0], l && n.setLetter(l, u), e.push(n);
             break;
           }
         }
     });
-    return h(this, N, new c().zero()), h(this, w, {}), e !== void 0 && this.parse(e), this;
+    return h(this, O, new c().zero()), h(this, v, {}), e !== void 0 && this.parse(e), this;
   }
   // -----------------------------------------
   /**
@@ -1058,21 +922,21 @@ const B = class B {
    * @param inputStr
    */
   parse(e) {
-    return h(this, N, new c()), h(this, w, {}), typeof e == "string" ? i(this, dt).call(this, e) : typeof e == "number" ? h(this, N, new c(e)) : e instanceof c ? h(this, N, e.clone()) : e instanceof B && (h(this, N, i(e, N).clone()), q(this, Ve, at).call(this, e)), this;
+    return h(this, O, new c()), h(this, v, {}), typeof e == "string" ? i(this, bt).call(this, e) : typeof e == "number" ? h(this, O, new c(e)) : e instanceof c ? h(this, O, e.clone()) : e instanceof P && (h(this, O, i(e, O).clone()), M(this, He, pt).call(this, e)), this;
   }
   /**
    * Get the coefficient \\(k\\) of the Monom \\(k\\cdot x^{n}\\)
    * @returns {Fraction}
    */
   get coefficient() {
-    return i(this, N);
+    return i(this, O);
   }
   /**
    * Set the coefficient \\(k\\) value of the monom
    * @param {Fraction | number | string} F
    */
   set coefficient(e) {
-    h(this, N, new c(e));
+    h(this, O, new c(e));
   }
   // Display getter
   /**
@@ -1080,10 +944,10 @@ const B = class B {
    */
   get display() {
     let e = "";
-    const t = Object.keys(i(this, w)).sort();
+    const t = Object.keys(i(this, v)).sort();
     for (const s of t)
-      i(this, w)[s].isNotZero() && (e += s, i(this, w)[s].isNotEqual(1) && (e += `^(${i(this, w)[s].display})`));
-    return e === "" ? i(this, N).value != 0 ? i(this, N).display : "" : i(this, N).value === 1 ? e : i(this, N).value === -1 ? `-${e}` : i(this, N).value === 0 ? "0" : `${i(this, N).display}${e}`;
+      i(this, v)[s].isNotZero() && (e += s, i(this, v)[s].isNotEqual(1) && (e += `^(${i(this, v)[s].display})`));
+    return e === "" ? i(this, O).value != 0 ? i(this, O).display : "" : i(this, O).value === 1 ? e : i(this, O).value === -1 ? `-${e}` : i(this, O).value === 0 ? "0" : `${i(this, O).display}${e}`;
   }
   get dividers() {
     if (!this.coefficient.isRelative())
@@ -1092,7 +956,7 @@ const B = class B {
       return [this.clone()];
     if (this.coefficient.numerator > 1e6)
       return [this.clone()];
-    const e = j.dividers(Math.abs(this.coefficient.numerator));
+    const e = G.dividers(Math.abs(this.coefficient.numerator));
     let t = [];
     for (const r in this.literal)
       t = this._getLiteralDividers(t, r);
@@ -1100,20 +964,20 @@ const B = class B {
     if (t.length > 0 && e.length > 0)
       for (const r of e)
         for (const n of t) {
-          const l = new B();
+          const l = new P();
           l.coefficient = new c(r), l.literal = n, s.push(l);
         }
     else if (e.length === 0)
       for (const r of t) {
-        const n = new B();
+        const n = new P();
         n.coefficient = new c().one(), n.literal = r, s.push(n);
       }
     else
       for (const r of e) {
-        const n = new B();
+        const n = new P();
         n.coefficient = new c(r), s.push(n);
       }
-    return s.length === 0 ? [new B().one()] : s;
+    return s.length === 0 ? [new P().one()] : s;
   }
   integrate(e, t, s) {
     const r = this.primitive(s);
@@ -1124,14 +988,14 @@ const B = class B {
    * @returns {literalType}
    */
   get literal() {
-    return i(this, w);
+    return i(this, v);
   }
   /**
    * Set the literal part of the monom. Must be a dictionary {x: Fraction, y: Fraction, ...}
    * @param {literalType<Fraction>} L
    */
   set literal(e) {
-    h(this, w, e);
+    h(this, v, e);
   }
   /**
    * Get the literal square roots of the Monom.
@@ -1141,11 +1005,11 @@ const B = class B {
   get literalSqrt() {
     if (this.isLiteralSquare()) {
       const e = {};
-      for (const t in i(this, w))
-        e[t] = i(this, w)[t].clone().sqrt();
+      for (const t in i(this, v))
+        e[t] = i(this, v)[t].clone().sqrt();
       return e;
     } else
-      return i(this, w);
+      return i(this, v);
   }
   /**
    * Set the literal part of the monom from a string
@@ -1153,29 +1017,29 @@ const B = class B {
    */
   set literalStr(e) {
     for (const t of [...e.matchAll(/([a-z])\^([+-]?[0-9]+)/g)])
-      t[1] in i(this, w) || (i(this, w)[t[1]] = new c().zero()), i(this, w)[t[1]].add(+t[2]);
+      t[1] in i(this, v) || (i(this, v)[t[1]] = new c().zero()), i(this, v)[t[1]].add(+t[2]);
     for (const t of [...e.matchAll(/([a-z](?!\^))/g)])
-      t[1] in i(this, w) || (i(this, w)[t[1]] = new c().zero()), i(this, w)[t[1]].add(1);
+      t[1] in i(this, v) || (i(this, v)[t[1]] = new c().zero()), i(this, v)[t[1]].add(1);
   }
   get plotFunction() {
     let e = "";
-    const t = Object.keys(i(this, w)).sort();
+    const t = Object.keys(i(this, v)).sort();
     for (const s of t)
-      i(this, w)[s].isNotZero() && (e += (e === "" ? "" : "*") + s, i(this, w)[s].isNotEqual(1) && (e += `^(${i(this, w)[s].display})`));
-    return e === "" ? i(this, N).value != 0 ? i(this, N).display : "" : i(this, N).value === 1 ? e : i(this, N).value === -1 ? `-${e}` : i(this, N).value === 0 ? "0" : `${i(this, N).display}*${e}`;
+      i(this, v)[s].isNotZero() && (e += (e === "" ? "" : "*") + s, i(this, v)[s].isNotEqual(1) && (e += `^(${i(this, v)[s].display})`));
+    return e === "" ? i(this, O).value != 0 ? i(this, O).display : "" : i(this, O).value === 1 ? e : i(this, O).value === -1 ? `-${e}` : i(this, O).value === 0 ? "0" : `${i(this, O).display}*${e}`;
   }
   removeVariable(e) {
-    delete i(this, w)[e];
+    delete i(this, v)[e];
   }
   /**
    * Get the tex output of the monom
    */
   get tex() {
     let e = "";
-    const t = Object.keys(i(this, w)).sort();
+    const t = Object.keys(i(this, v)).sort();
     for (const s of t)
-      i(this, w)[s].isNotZero() && (e += s, i(this, w)[s].isNotEqual(1) && (e += `^{ ${i(this, w)[s].tfrac.tex} }`));
-    return e === "" ? i(this, N).value != 0 ? i(this, N).frac.tex : "0" : i(this, N).value === 1 ? e : i(this, N).value === -1 ? `-${e}` : i(this, N).value === 0 ? "0" : `${i(this, N).frac}${e}`;
+      i(this, v)[s].isNotZero() && (e += s, i(this, v)[s].isNotEqual(1) && (e += `^{ ${i(this, v)[s].tfrac.tex} }`));
+    return e === "" ? i(this, O).value != 0 ? i(this, O).frac.tex : "0" : i(this, O).value === 1 ? e : i(this, O).value === -1 ? `-${e}` : i(this, O).value === 0 ? "0" : `${i(this, O).frac.tex}${e}`;
   }
   // Getter helpers.
   /**
@@ -1206,14 +1070,14 @@ const B = class B {
   }
   // #endregion Private methods (5)
 };
-N = new WeakMap(), w = new WeakMap(), Ve = new WeakSet(), at = function(e) {
+O = new WeakMap(), v = new WeakMap(), He = new WeakSet(), pt = function(e) {
   for (const t in e.literal)
-    i(this, w)[t] = e.literal[t].clone();
-}, $e = new WeakMap(), dt = new WeakMap(), pt = new WeakMap(), a(B, "gcd", (...e) => {
+    i(this, v)[t] = e.literal[t].clone();
+}, Re = new WeakMap(), bt = new WeakMap(), xt = new WeakMap(), a(P, "gcd", (...e) => {
   for (const n of e)
     if (n.containsRationalPower())
-      return new B().zero();
-  const t = new B(), s = j.gcd(...e.map((n) => n.coefficient.numerator)), r = j.lcm(...e.map((n) => n.coefficient.denominator));
+      return new P().zero();
+  const t = new P(), s = G.gcd(...e.map((n) => n.coefficient.numerator)), r = G.lcm(...e.map((n) => n.coefficient.denominator));
   t.coefficient = new c(s, r).reduce();
   for (const n of e) {
     for (const l in t.literal)
@@ -1226,20 +1090,156 @@ N = new WeakMap(), w = new WeakMap(), Ve = new WeakSet(), at = function(e) {
  * Multiply two monoms and return a NEW monom.
  * @param monoms
  */
-a(B, "xMultiply", (...e) => {
-  const t = new B().one();
+a(P, "xMultiply", (...e) => {
+  const t = new P().one();
   for (const s of e)
     t.multiply(s);
   return t;
 });
-let M = B;
-var ze, y, Fe, tt, mt, yt, gt, wt, it, vt, bt, xt, Et, ri, Nt, je, Ot;
+let I = P;
+var ue, De, S, ye, rt, ui, fi, di, Ht, pi;
+const ii = class ii {
+  constructor(e, t, s = "x") {
+    f(this, S);
+    f(this, ue);
+    f(this, De);
+    if (h(this, De, s), Object.hasOwn(e, "moveLeft")) {
+      const r = e;
+      h(this, ue, r.left.clone().subtract(r.right));
+    } else
+      h(this, ue, e.clone().subtract(t ?? 0));
+  }
+  solve() {
+    if (i(this, ue).degree().isOne())
+      return M(this, S, ui).call(this);
+    if (i(this, ue).degree().value === 2)
+      return M(this, S, fi).call(this);
+    const e = M(this, S, pi).call(this);
+    if (e.length > 0)
+      return e;
+    if (i(this, ue).degree().value === 3)
+      return M(this, S, Ht).call(this);
+    throw new Error("The equation degree is too high.");
+  }
+  solveAsCardan() {
+    if (i(this, ue).degree().value !== 3)
+      throw new Error("The equation is not cubic.");
+    return M(this, S, Ht).call(this);
+  }
+};
+ue = new WeakMap(), De = new WeakMap(), S = new WeakSet(), ye = function(e) {
+  if (e instanceof c && e.isApproximative())
+    return M(this, S, rt).call(this, e.value);
+  const t = new c(e);
+  return {
+    variable: i(this, De),
+    exact: t,
+    value: t.value,
+    tex: t.tex,
+    display: t.display
+  };
+}, rt = function(e, t) {
+  return {
+    variable: i(this, De),
+    exact: !1,
+    value: +e.toFixed(10),
+    tex: (t == null ? void 0 : t.tex) ?? "",
+    display: (t == null ? void 0 : t.display) ?? ""
+  };
+}, ui = function() {
+  const e = i(this, ue).monomByDegree(0).coefficient.clone().opposite().divide(i(this, ue).monomByDegree(1).coefficient);
+  return [
+    M(this, S, ye).call(this, e)
+  ];
+}, fi = function() {
+  const e = i(this, ue), t = e.monomByDegree(2).coefficient, s = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, n = s.clone().pow(2).subtract(t.clone().multiply(r).multiply(4));
+  if (n.isNegative())
+    return [];
+  if (n.isSquare()) {
+    const l = n.sqrt(), u = s.clone().opposite().add(l).divide(t.clone().multiply(2)), p = s.clone().opposite().subtract(l).divide(t.clone().multiply(2));
+    return l.isZero() ? [M(this, S, ye).call(this, u)] : [
+      M(this, S, ye).call(this, u),
+      M(this, S, ye).call(this, p)
+    ].sort((m, g) => m.value - g.value);
+  }
+  return M(this, S, di).call(this, t, s, n);
+}, di = function(e, t, s) {
+  const r = G.dividers(s.value).filter((pe) => Math.sqrt(pe) % 1 === 0).map((pe) => Math.sqrt(pe)).pop() ?? 1, n = G.gcd(2 * e.value, t.value, r) * (e.isNegative() ? -1 : 1), l = t.clone().divide(n).opposite(), u = e.clone().divide(n).multiply(2), p = s.clone().divide(r ** 2), m = Math.abs(r / n), g = r === 1 ? "-" : `-${m} `, E = r === 1 ? "+" : `+${m} `;
+  function L(pe, ce, et, Ut) {
+    return `\\frac{ ${ce} ${et}\\sqrt{ ${Ut} } }{ ${pe} }`;
+  }
+  function te(pe, ce, et, Ut) {
+    return `(${ce}${et}sqrt(${Ut}))/${pe}`;
+  }
+  const ae = s.value ** 0.5, le = (-t.value - ae) / (2 * e.value), ge = (-t.value + ae) / (2 * e.value);
+  return [
+    M(this, S, rt).call(this, le, {
+      tex: L(u.tex, l.tex, g.toString(), p.tex),
+      display: te(u.display, l.display, g.toString(), p.display)
+    }),
+    M(this, S, rt).call(this, ge, {
+      tex: L(u.tex, l.tex, E.toString(), p.tex),
+      display: te(u.display, l.display, E.toString(), p.display)
+    })
+  ].sort((pe, ce) => pe.value - ce.value);
+}, Ht = function() {
+  const e = i(this, ue), t = e.monomByDegree(3).coefficient, s = e.monomByDegree(2).coefficient, r = e.monomByDegree(1).coefficient, n = e.monomByDegree(0).coefficient, l = s.clone().divide(t), u = r.clone().divide(t), p = n.clone().divide(t), m = u.clone().subtract(l.clone().pow(2).divide(3)), g = p.clone().subtract(l.clone().multiply(u).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), E = g.clone().opposite(), L = m.clone().opposite().pow(3).divide(27), te = E.clone().pow(2).subtract(L.clone().multiply(4)).opposite();
+  if (te.isNegative()) {
+    const ae = g.clone().opposite().add(te.clone().opposite().sqrt()).divide(2).root(3), le = g.clone().opposite().subtract(te.clone().opposite().sqrt()).divide(2).root(3), ge = ae.clone().add(le).subtract(l.clone().divide(3));
+    return [M(this, S, ye).call(this, ge)];
+  }
+  if (te.isZero()) {
+    const ae = g.clone().opposite().divide(2).root(3), le = ae.clone().opposite().subtract(l.clone().divide(3)), ge = ae.clone().multiply(2).subtract(l.clone().divide(3));
+    return le.isEqual(ge) ? [M(this, S, ye).call(this, le)] : [
+      M(this, S, ye).call(this, ge),
+      M(this, S, ye).call(this, le)
+    ].sort((pe, ce) => pe.value - ce.value);
+  }
+  if (te.isPositive()) {
+    const ae = [], le = m.value, ge = g.value, pe = l.value;
+    for (let ce = 0; ce < 3; ce++)
+      ae.push(2 * Math.sqrt(-le / 3) * Math.cos(Math.acos(3 * ge / (2 * le) * Math.sqrt(-3 / le)) / 3 + 2 * Math.PI * ce / 3) - pe / 3);
+    return ae.map((ce) => M(this, S, rt).call(this, ce)).sort((ce, et) => ce.value - et.value);
+  }
+  return [];
+}, pi = function() {
+  let e = i(this, ue).clone(), t = [];
+  const s = e.lcmDenominator();
+  s !== 1 && e.multiply(s);
+  const r = e.monomByDegree().coefficient;
+  let n = e.monomByDegree(0).coefficient;
+  for (; n.isZero(); )
+    t.length === 0 && t.push(M(this, S, ye).call(this, 0)), e = e.divide("x"), n = e.monomByDegree(0).coefficient;
+  const l = G.dividers(r.value), u = G.dividers(n.value);
+  for (const g of l)
+    for (const E of u) {
+      const L = new c(E, g);
+      e.evaluate(L).isZero() && !t.find((te) => te.value === L.value) && t.push(M(this, S, ye).call(this, L)), L.opposite(), e.evaluate(L).isZero() && !t.find((te) => te.value === L.value) && t.push(M(this, S, ye).call(this, L));
+    }
+  for (const g of t) {
+    if (g.exact !== !1 && g.exact.isZero())
+      continue;
+    const E = i(this, ue).clone().parse("x", g.exact.denominator, -g.exact.numerator);
+    for (; e.isDividableBy(E); )
+      console.log(e.display, E.display), e = e.divide(E);
+  }
+  if (e.degree().isZero())
+    return t.sort((g, E) => g.value - E.value);
+  if (e.degree().value > 3)
+    return [];
+  const p = e.clone().parse("0");
+  console.log(e.display), console.log(p.display);
+  const m = new ii(e, e.clone().parse("0"), i(this, De));
+  return t = t.concat(m.solve()), t.sort((g, E) => g.value - E.value);
+};
+let gt = ii;
+var Ze, y, Xe, ht, Et, Nt, Ot, qt, at, Tt, At, Mt, It, mi, Ct, Ye, $t;
 const C = class C {
   constructor(e, ...t) {
-    d(this, Et);
+    f(this, It);
     // #region Class fields (8)
-    d(this, ze);
-    d(this, y);
+    f(this, Ze);
+    f(this, y);
     // #endregion Constructors (7)
     // #region Properties and methods (49)
     /**
@@ -1248,13 +1248,13 @@ const C = class C {
      * @param values
      */
     a(this, "parse", (e, ...t) => {
-      if (h(this, y, []), h(this, ze, []), typeof e == "string")
-        return q(this, Et, ri).call(this, e, ...t);
-      if ((typeof e == "number" || e instanceof c || e instanceof M) && t.length === 0)
-        i(this, y).push(new M(e));
-      else if (e instanceof M && t.length > 0)
-        i(this, y).push(new M(e)), t.forEach((s) => {
-          i(this, y).push(new M(s));
+      if (h(this, y, []), h(this, Ze, []), typeof e == "string")
+        return M(this, It, mi).call(this, e, ...t);
+      if ((typeof e == "number" || e instanceof c || e instanceof I) && t.length === 0)
+        i(this, y).push(new I(e));
+      else if (e instanceof I && t.length > 0)
+        i(this, y).push(new I(e)), t.forEach((s) => {
+          i(this, y).push(new I(s));
         });
       else if (e instanceof C)
         for (const s of e.monoms)
@@ -1272,11 +1272,11 @@ const C = class C {
     });
     a(this, "add", (...e) => {
       for (const t of e)
-        t instanceof C ? h(this, y, i(this, y).concat(t.monoms)) : t instanceof M ? i(this, y).push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? i(this, y).push(new M(t.toString())) : i(this, y).push(new M(t));
+        t instanceof C ? h(this, y, i(this, y).concat(t.monoms)) : t instanceof I ? i(this, y).push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? i(this, y).push(new I(t.toString())) : i(this, y).push(new I(t));
       return this.reduce();
     });
     a(this, "commonMonom", () => {
-      const e = new M().one(), t = this.gcdNumerator(), s = this.gcdDenominator(), r = this.degree();
+      const e = new I().one(), t = this.gcdNumerator(), s = this.gcdDenominator(), r = this.degree();
       e.coefficient = new c(t, s);
       for (const n of this.variables) {
         e.setLetter(n, r);
@@ -1300,18 +1300,18 @@ const C = class C {
     });
     a(this, "divide", (e) => {
       if (e instanceof c)
-        return i(this, tt).call(this, e);
+        return i(this, ht).call(this, e);
       if (typeof e == "number" && Number.isSafeInteger(e))
-        return i(this, mt).call(this, e);
-      if (e instanceof M)
+        return i(this, Et).call(this, e);
+      if (e instanceof I)
         return this.divide(new C(e));
       if (e instanceof C) {
         if (e.monoms.length === 1 && e.variables.length === 0)
-          return i(this, tt).call(this, e.monoms[0].coefficient);
+          return i(this, ht).call(this, e.monoms[0].coefficient);
         {
           const { quotient: t, reminder: s } = this.euclidean(e);
           if (s.isZero())
-            return t;
+            return h(this, y, t.monoms), this;
         }
       } else if (typeof e == "string")
         return this.divide(new C(e));
@@ -1331,14 +1331,14 @@ const C = class C {
           reminder: new C().zero()
         };
       const n = e.monomByDegree(void 0, t), l = e.degree(t);
-      let u, b = this.degree(t).value * 2;
-      for (; r.degree(t).isGeq(l) && b > 0 && (b--, u = r.monomByDegree(void 0, t).clone().divide(n), !(!u.isZero() && (s.add(u), r.subtract(e.clone().multiply(u)).reduce(), u.degree(t).isZero()))); )
+      let u, p = this.degree(t).value * 2;
+      for (; r.degree(t).isGeq(l) && p > 0 && (p--, u = r.monomByDegree(void 0, t).clone().divide(n), !(!u.isZero() && (s.add(u), r.subtract(e.clone().multiply(u)).reduce(), u.degree(t).isZero()))); )
         ;
       return s.reduce(), r.reduce(), { quotient: s, reminder: r };
     });
     a(this, "evaluate", (e, t) => {
       if (t)
-        return i(this, yt).call(this, e);
+        return i(this, Nt).call(this, e);
       const s = new c().zero();
       return i(this, y).forEach((r) => {
         s.add(r.evaluate(e, t));
@@ -1365,24 +1365,24 @@ const C = class C {
           t.push(s.clone()), s.one();
           break;
         } else {
-          let u = i(this, wt).call(this, s, l, e ?? "x");
+          let u = i(this, qt).call(this, s, l, e ?? "x");
           for (l = s.degree(e).value; u.length > 0; ) {
-            const b = u[0];
-            if (!s.isDividableBy(b))
+            const p = u[0];
+            if (!s.isDividableBy(p))
               u.shift();
             else {
-              const p = s.euclidean(b);
-              t.push(b), s = p.quotient.clone(), u = u.filter((m) => {
-                const x = s.monoms[0], k = s.monoms[s.monoms.length - 1], _ = m.monoms[0], oe = m.monoms[m.monoms.length - 1];
-                return k.isDivisible(oe) ? x.isDivisible(_) : !1;
+              const m = s.euclidean(p);
+              t.push(p), s = m.quotient.clone(), u = u.filter((g) => {
+                const E = s.monoms[0], L = s.monoms[s.monoms.length - 1], te = g.monoms[0], ae = g.monoms[g.monoms.length - 1];
+                return L.isDivisible(ae) ? E.isDivisible(te) : !1;
               });
             }
           }
         }
-      return s.isOne() || t.push(s.clone()), h(this, ze, t), i(this, ze);
+      return s.isOne() || t.push(s.clone()), h(this, Ze, t), i(this, Ze);
     });
-    a(this, "gcdDenominator", () => j.gcd(...this.getDenominators()));
-    a(this, "gcdNumerator", () => j.gcd(...this.getNumerators()));
+    a(this, "gcdDenominator", () => G.gcd(...this.getDenominators()));
+    a(this, "gcdNumerator", () => G.gcd(...this.getNumerators()));
     // Next functions are used for for commonMonom, which is used in the factorize method.
     a(this, "getDenominators", () => {
       const e = [];
@@ -1396,7 +1396,7 @@ const C = class C {
         e.push(t.coefficient.numerator);
       return e;
     });
-    a(this, "getZeroes", () => new ct(this.clone()).solve());
+    a(this, "getZeroes", () => new gt(this.clone()).solve());
     a(this, "integrate", (e, t, s = "x") => {
       const r = this.primitive(s), n = {}, l = {};
       return n[s] = new c(e), l[s] = new c(t), r.evaluate(l).subtract(r.evaluate(n));
@@ -1422,8 +1422,8 @@ const C = class C {
         return t.isZero();
       }
     });
-    a(this, "isEqual", (e) => i(this, Fe).call(this, e, "="));
-    a(this, "isOppositeAt", (e) => i(this, Fe).call(this, e.clone().opposite(), "="));
+    a(this, "isEqual", (e) => i(this, Xe).call(this, e, "="));
+    a(this, "isOppositeAt", (e) => i(this, Xe).call(this, e.clone().opposite(), "="));
     a(this, "isReduced", (e) => {
       if (!this.isDeveloped(e))
         return !1;
@@ -1435,9 +1435,9 @@ const C = class C {
           return !1;
       return !1;
     });
-    a(this, "isSameAs", (e) => i(this, Fe).call(this, e, "same"));
-    a(this, "lcmDenominator", () => j.lcm(...this.getDenominators()));
-    a(this, "lcmNumerator", () => j.lcm(...this.getNumerators()));
+    a(this, "isSameAs", (e) => i(this, Xe).call(this, e, "same"));
+    a(this, "lcmDenominator", () => G.lcm(...this.getDenominators()));
+    a(this, "lcmNumerator", () => G.lcm(...this.getNumerators()));
     a(this, "letters", () => {
       let e = /* @__PURE__ */ new Set();
       for (const t of i(this, y))
@@ -1459,7 +1459,7 @@ const C = class C {
       for (const r of i(s, y))
         if (r.degree(t).isEqual(e))
           return r.clone();
-      return new M().zero();
+      return new I().zero();
     });
     // Used in LinearSystem.tex
     a(this, "monomByLetter", (e) => {
@@ -1467,7 +1467,7 @@ const C = class C {
       for (const s of i(t, y))
         if (s.hasVariable(e))
           return s.clone();
-      return new M().zero();
+      return new I().zero();
     });
     a(this, "monomsByDegree", (e, t) => {
       if (e === void 0)
@@ -1477,8 +1477,8 @@ const C = class C {
         n.degree(t) === e && s.push(n.clone());
       return s;
     });
-    a(this, "multiply", (e) => e instanceof C ? i(this, xt).call(this, e) : e instanceof c ? i(this, it).call(this, e) : e instanceof M ? i(this, bt).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? i(this, vt).call(this, e) : this);
-    a(this, "one", () => (h(this, y, []), i(this, y).push(new M().one()), this));
+    a(this, "multiply", (e) => e instanceof C ? i(this, Mt).call(this, e) : e instanceof c ? i(this, at).call(this, e) : e instanceof I ? i(this, At).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? i(this, Tt).call(this, e) : this);
+    a(this, "one", () => (h(this, y, []), i(this, y).push(new I().one()), this));
     // ------------------------------------------
     a(this, "opposite", () => (h(this, y, i(this, y).map((e) => e.opposite())), this));
     a(this, "pow", (e) => {
@@ -1503,7 +1503,7 @@ const C = class C {
       let e = 0;
       for (; e < i(this, y).length; ) {
         for (let t = e + 1; t < i(this, y).length; t++)
-          i(this, y)[e].isSameAs(i(this, y)[t]) && (i(this, y)[e].add(i(this, y)[t]), i(this, y).splice(t, 1), i(this, y)[e].isZero() && (i(this, y)[e] = new M().zero()), t--);
+          i(this, y)[e].isSameAs(i(this, y)[t]) && (i(this, y)[e].add(i(this, y)[t]), i(this, y).splice(t, 1), i(this, y)[e].isZero() && (i(this, y)[e] = new I().zero()), t--);
         e++;
       }
       h(this, y, i(this, y).filter((t) => !t.coefficient.isZero()));
@@ -1519,10 +1519,10 @@ const C = class C {
         if (l !== u)
           return t ? l - u : u - l;
         if (s.length > 0)
-          for (const b of s) {
-            const p = r.degree(b).value, m = n.degree(b).value;
-            if (p !== m)
-              return t ? p - m : m - p;
+          for (const p of s) {
+            const m = r.degree(p).value, g = n.degree(p).value;
+            if (m !== g)
+              return t ? m - g : g - m;
           }
         return 0;
       }), this;
@@ -1541,106 +1541,106 @@ const C = class C {
     });
     a(this, "subtract", (...e) => {
       for (const t of e)
-        t instanceof C ? this.add(t.clone().opposite()) : t instanceof M ? i(this, y).push(t.clone().opposite()) : i(this, y).push(new M(t).opposite());
+        t instanceof C ? this.add(t.clone().opposite()) : t instanceof I ? i(this, y).push(t.clone().opposite()) : i(this, y).push(new I(t).opposite());
       return this.reduce();
     });
     /**
      * Set the polynom to zero.
      * @returns {this}
      */
-    a(this, "zero", () => (h(this, y, []), i(this, y).push(new M().zero()), this));
+    a(this, "zero", () => (h(this, y, []), i(this, y).push(new I().zero()), this));
     // #endregion Getters And Setters (22)
     // #region Private methods (15)
-    d(this, Fe, (e, t) => {
+    f(this, Xe, (e, t) => {
       t === void 0 && (t = "=");
-      const s = this.clone().reduce(), r = e.clone().reduce();
+      const s = this.clone().reduce().reorder(), r = e.clone().reduce().reorder();
       switch (t) {
         case "=":
-          return s.length !== r.length || s.degree().isNotEqual(r.degree()) ? !1 : s.monoms.every((n, l) => n.isEqual(r.monoms[l]));
+          return s.length !== r.length || !s.degree().isEqual(r.degree()) ? !1 : s.monoms.every((n, l) => n.isEqual(r.monoms[l]));
         case "same":
           return s.length !== r.length || !s.degree().isEqual(r.degree()) ? !1 : s.monoms.every((n, l) => n.isSameAs(r.monoms[l]));
         default:
           return !1;
       }
     });
-    d(this, tt, (e) => {
+    f(this, ht, (e) => {
       for (const t of i(this, y))
         t.coefficient.divide(e);
       return this;
     });
-    d(this, mt, (e) => {
+    f(this, Et, (e) => {
       const t = new c(e);
       for (const s of i(this, y))
         s.coefficient.divide(t);
       return this;
     });
-    d(this, yt, (e) => {
+    f(this, Nt, (e) => {
       let t = 0;
       return i(this, y).forEach((s) => {
         t += s.evaluate(e, !0);
       }), t;
     });
-    d(this, gt, (e) => {
-      var x;
-      let t, s, r, n, l, u, b, p, m;
+    f(this, Ot, (e) => {
+      var E;
+      let t, s, r, n, l, u, p, m, g;
       if (this.numberOfVars === 1)
-        return r = this.monomByDegree(2, e).coefficient, n = this.monomByDegree(1, e).coefficient, l = this.monomByDegree(0, e).coefficient, u = n.clone().pow(2).subtract(r.clone().multiply(l).multiply(4)), u.isZero() ? (b = n.clone().opposite().divide(r.clone().multiply(2)), t = new C(e).subtract(b.display).multiply(b.denominator), s = new C(e).subtract(b.display).multiply(b.denominator), m = r.divide(b.denominator).divide(b.denominator), m.isOne() ? [t, s] : [new C(m.display), t, s]) : u.isPositive() && u.isSquare() ? (b = n.clone().opposite().add(u.clone().sqrt()).divide(r.clone().multiply(2)), p = n.clone().opposite().subtract(u.clone().sqrt()).divide(r.clone().multiply(2)), m = r.divide(b.denominator).divide(p.denominator), m.isOne() ? [
-          new C(e).subtract(b.display).multiply(b.denominator),
-          new C(e).subtract(p.display).multiply(p.denominator)
+        return r = this.monomByDegree(2, e).coefficient, n = this.monomByDegree(1, e).coefficient, l = this.monomByDegree(0, e).coefficient, u = n.clone().pow(2).subtract(r.clone().multiply(l).multiply(4)), u.isZero() ? (p = n.clone().opposite().divide(r.clone().multiply(2)), t = new C(e).subtract(p.display).multiply(p.denominator), s = new C(e).subtract(p.display).multiply(p.denominator), g = r.divide(p.denominator).divide(p.denominator), g.isOne() ? [t, s] : [new C(g.display), t, s]) : u.isPositive() && u.isSquare() ? (p = n.clone().opposite().add(u.clone().sqrt()).divide(r.clone().multiply(2)), m = n.clone().opposite().subtract(u.clone().sqrt()).divide(r.clone().multiply(2)), g = r.divide(p.denominator).divide(m.denominator), g.isOne() ? [
+          new C(e).subtract(p.display).multiply(p.denominator),
+          new C(e).subtract(m.display).multiply(m.denominator)
         ] : [
-          new C(m.display),
-          new C(e).subtract(b.display).multiply(b.denominator),
-          new C(e).subtract(p.display).multiply(p.denominator)
+          new C(g.display),
+          new C(e).subtract(p.display).multiply(p.denominator),
+          new C(e).subtract(m.display).multiply(m.denominator)
         ]) : [this.clone()];
       if (r = this.monomByDegree(2, e), n = this.monomByDegree(1, e), l = this.monomByDegree(0, e), r.isLiteralSquare() && l.isLiteralSquare() && n.clone().pow(2).isSameAs(r.clone().multiply(l))) {
-        const k = new C("x", r.coefficient, n.coefficient, l.coefficient), _ = i(x = k, gt).call(x, "x"), oe = [];
-        let he;
-        if (_.length >= 2) {
-          for (const me of _)
-            me.degree().isZero() ? oe.push(me.clone()) : (he = me.clone(), he.monoms[0].literal = r.literalSqrt, he.monoms[1].literal = l.literalSqrt, oe.push(he.clone()));
-          return oe;
+        const L = new C("x", r.coefficient, n.coefficient, l.coefficient), te = i(E = L, Ot).call(E, "x"), ae = [];
+        let le;
+        if (te.length >= 2) {
+          for (const ge of te)
+            ge.degree().isZero() ? ae.push(ge.clone()) : (le = ge.clone(), le.monoms[0].literal = r.literalSqrt, le.monoms[1].literal = l.literalSqrt, ae.push(le.clone()));
+          return ae;
         }
       }
       return [this.clone()];
     });
-    d(this, wt, (e, t, s) => {
+    f(this, qt, (e, t, s) => {
       const r = e.monoms[0].dividers, n = e.monoms[e.monoms.length - 1].dividers, l = [];
       return r.forEach((u) => {
-        u.degree(s).isLeq(t) && n.forEach((b) => {
-          u.degree(s).isNotEqual(b.degree(s)) && (l.push(new C(u, b)), l.push(new C(u, b.clone().opposite())));
+        u.degree(s).isLeq(t) && n.forEach((p) => {
+          u.degree(s).isNotEqual(p.degree(s)) && (l.push(new C(u, p)), l.push(new C(u, p.clone().opposite())));
         });
       }), l;
     });
-    d(this, it, (e) => {
+    f(this, at, (e) => {
       for (const t of i(this, y))
         t.coefficient.multiply(e);
       return this.reduce();
     });
-    d(this, vt, (e) => i(this, it).call(this, new c(e)));
-    d(this, bt, (e) => {
+    f(this, Tt, (e) => i(this, at).call(this, new c(e)));
+    f(this, At, (e) => {
       for (const t of i(this, y))
         t.multiply(e);
       return this.reduce();
     });
-    d(this, xt, (e) => {
+    f(this, Mt, (e) => {
       const t = [];
       for (const s of i(this, y))
         for (const r of e.monoms)
-          t.push(M.xMultiply(s, r));
+          t.push(I.xMultiply(s, r));
       return h(this, y, t), this.reduce();
     });
-    d(this, Nt, (e, t) => {
+    f(this, Ct, (e, t) => {
       switch (t.tokenType) {
-        case f.COEFFICIENT:
+        case d.COEFFICIENT:
           e.push(new C(t.token));
           break;
-        case f.VARIABLE:
-          e.push(new C().add(new M(t.token)));
+        case d.VARIABLE:
+          e.push(new C().add(new I(t.token)));
           break;
-        case f.CONSTANT:
+        case d.CONSTANT:
           console.log("Actually, not supported - will be added later !");
           break;
-        case f.OPERATION:
+        case d.OPERATION:
           if (e.length >= 2) {
             const s = e.pop(), r = e.pop();
             if (r === void 0 || s === void 0)
@@ -1670,15 +1670,15 @@ const C = class C {
           } else
             throw new Error("Error parsing the polynom");
           break;
-        case f.MONOM:
+        case d.MONOM:
           console.error("The monom token should not appear here");
           break;
-        case f.FUNCTION:
+        case d.FUNCTION:
           console.error("The function token should not appear here - might be introduced later.");
           break;
       }
     });
-    d(this, je, (e, t, s, r) => {
+    f(this, Ye, (e, t, s, r) => {
       let n = "";
       for (const l of i(this, y)) {
         if (l.coefficient.value === 0)
@@ -1692,15 +1692,15 @@ const C = class C {
      * Main parse using a shutting yard class
      * @param inputStr
      */
-    d(this, Ot, (e) => {
-      const s = new si().parse(e).rpn;
+    f(this, $t, (e) => {
+      const s = new ci().parse(e).rpn;
       this.zero();
       const r = [];
       for (const n of s)
-        i(this, Nt).call(this, r, n);
+        i(this, Ct).call(this, r, n);
       return r.length === 1 && this.add(r[0]), this.reorder();
     });
-    return h(this, y, []), h(this, ze, []), e !== void 0 && this.parse(e, ...t), this;
+    return h(this, y, []), h(this, Ze, []), e !== void 0 && this.parse(e, ...t), this;
   }
   hasVariable(e) {
     return this.variables.includes(e);
@@ -1708,7 +1708,7 @@ const C = class C {
   inverse() {
   }
   isOne() {
-    return i(this, y).length === 1 && i(this, y)[0].coefficient.isOne();
+    return i(this, y).length === 1 && i(this, y)[0].coefficient.isOne() && this.degree().isZero();
   }
   isZero() {
     return i(this, y).length === 1 && i(this, y)[0].coefficient.isZero() || i(this, y).length === 0;
@@ -1723,7 +1723,7 @@ const C = class C {
   // #region Getters And Setters (22)
   // ------------------------------------------
   get display() {
-    return i(this, je).call(this);
+    return i(this, Ye).call(this);
   }
   get isMultiVariable() {
     return i(this, y).some((e) => e.variables.length > 1);
@@ -1742,10 +1742,10 @@ const C = class C {
     return this.variables.length;
   }
   get plotFunction() {
-    return i(this, je).call(this, "tex", !1, !1, !0);
+    return i(this, Ye).call(this, "tex", !1, !1, !0);
   }
   get tex() {
-    return i(this, je).call(this, "tex");
+    return i(this, Ye).call(this, "tex");
   }
   get variables() {
     let e = [];
@@ -1758,14 +1758,14 @@ const C = class C {
   }
   // #endregion Private methods (15)
 };
-ze = new WeakMap(), y = new WeakMap(), Fe = new WeakMap(), tt = new WeakMap(), mt = new WeakMap(), yt = new WeakMap(), gt = new WeakMap(), wt = new WeakMap(), it = new WeakMap(), vt = new WeakMap(), bt = new WeakMap(), xt = new WeakMap(), Et = new WeakSet(), ri = function(e, ...t) {
+Ze = new WeakMap(), y = new WeakMap(), Xe = new WeakMap(), ht = new WeakMap(), Et = new WeakMap(), Nt = new WeakMap(), Ot = new WeakMap(), qt = new WeakMap(), at = new WeakMap(), Tt = new WeakMap(), At = new WeakMap(), Mt = new WeakMap(), It = new WeakSet(), mi = function(e, ...t) {
   if (t.length === 0) {
     if (e = "" + e, e !== "" && !isNaN(Number(e))) {
       this.empty();
-      const s = new M(e);
+      const s = new I(e);
       return this.add(s), this;
     }
-    return i(this, Ot).call(this, e);
+    return i(this, $t).call(this, e);
   } else if (/^[a-z]+/.test(e)) {
     this.empty();
     const s = t.map((r) => new c(r));
@@ -1773,306 +1773,66 @@ ze = new WeakMap(), y = new WeakMap(), Fe = new WeakMap(), tt = new WeakMap(), m
       const r = e.split("");
       let n = 0;
       for (const l of s) {
-        const u = new M();
+        const u = new I();
         u.coefficient = l.clone(), u.literalStr = r[n] || "", this.add(u), n++;
       }
     } else {
       let r = s.length - 1;
       for (const n of s) {
-        const l = new M();
+        const l = new I();
         l.coefficient = n.clone(), l.literalStr = `${e}^${r}`, this.add(l), r--;
       }
     }
     return this;
   } else
     return this.zero();
-}, Nt = new WeakMap(), je = new WeakMap(), Ot = new WeakMap();
-let I = C;
-var T, A, ie, Tt, Ue, At;
-const be = class be {
-  constructor(e, t, s) {
-    // Left part of the equation
-    d(this, T);
-    // Right part of the equation
-    d(this, A);
-    // Signe of the equation
-    d(this, ie);
-    // #endregion Constructors (3)
-    // #region Properties and methods (26)
-    // ------------------------------------------
-    a(this, "parse", (e) => {
-      const t = i(this, Tt).call(this, e);
-      if (t === !1)
-        throw new Error("The equation is not valid (no sign found)");
-      const s = e.split(t);
-      return this.create(new I(s[0]), new I(s[1]), i(this, Ue).call(this, t));
-    });
-    a(this, "create", (e, t, s) => (h(this, T, e), h(this, A, t), h(this, ie, i(this, Ue).call(this, s ?? "=")), this));
-    a(this, "clone", () => new be(i(this, T).clone(), i(this, A).clone(), i(this, ie)));
-    /**
-     * Get the degree of the equation
-     * @param letter
-     */
-    a(this, "degree", (e) => c.max(i(this, T).degree(e), i(this, A).degree(e)));
-    /**
-     * divide an equation by a given value (transformed as a fraction)
-     *
-     * ```
-     * 8x+10=6x \vert 2
-     * 4x+5=3x
-     * ```
-     *
-     * |>Alternatively with $3x-4$ maybe it's working ?
-     * $$\frac{3x}{5}$$
-     *
-     * @param value
-     * @returns {Equation}
-     */
-    a(this, "divide", (e) => {
-      const t = new c(e);
-      return t.isZero() ? this : this.multiply(t.inverse());
-    });
-    /**
-     * Determine if the equation contains a variable.
-     * @param letter
-     */
-    a(this, "hasVariable", (e) => this.variables.includes(e));
-    a(this, "isLinearTo", (e) => {
-      const t = e.clone().moveLeft().simplify().left, s = this.clone().moveLeft().simplify().left;
-      return t.isEqual(s) || t.isOppositeAt(s);
-    });
-    /**
-     * Determine if the equation contains more than one letter/variable.
-     */
-    a(this, "isMultiVariable", () => i(this, T).isMultiVariable || i(this, A).isMultiVariable);
-    // -----------------------------------------------
-    // Equations helpers
-    a(this, "isEqualTo", (e) => {
-      const t = e.clone().moveLeft().left, s = this.clone().moveLeft().left;
-      return t.isEqual(s) || t.isOppositeAt(s);
-    });
-    /**
-     * Reorder the polynom to have only one letter on the left, the rest on the right.
-     * @param letter
-     */
-    a(this, "isolate", (e) => {
-      if (!this.degree(e).isOne() || this.isMultiVariable())
-        return !1;
-      let t;
-      i(this, T).subtract(i(this, A)), i(this, A).zero();
-      const s = [...i(this, T).monoms];
-      for (const n of s)
-        n.hasVariable(e) || (t = n.clone(), i(this, T).subtract(t), i(this, A).subtract(t));
-      if (i(this, T).length !== 1)
-        return !1;
-      const r = i(this, T).monoms[0].coefficient.clone();
-      return i(this, T).divide(r), i(this, A).divide(r), this;
-    });
-    // -----------------------------------------------
-    // Equations operations
-    // -----------------------------------------------
-    a(this, "letters", () => [.../* @__PURE__ */ new Set([...i(this, T).letters(), ...i(this, A).letters()])]);
-    // -----------------------------------------------
-    /**
-     * Reorder will move all monoms containing a letter on the left, all the other on the right.
-     */
-    a(this, "moveLeft", () => (i(this, T).subtract(i(this, A)), i(this, A).zero(), this));
-    /**
-     * Multiple an equation by a fraction value.
-     * @param value
-     */
-    a(this, "multiply", (e) => {
-      const t = new c(e);
-      return i(this, T).multiply(t), i(this, A).multiply(t), i(this, ie) !== "=" && t.sign() === -1 && i(this, At).call(this), this;
-    });
-    a(this, "opposite", () => (h(this, T, i(this, T).opposite()), h(this, A, i(this, A).opposite()), this));
-    a(this, "reorder", (e) => (i(this, T).subtract(i(this, A)), i(this, A).zero(), i(this, T).reorder(), e ? this : (i(this, T).monoms.filter((t) => t.degree().isZero()).forEach((t) => {
-      const s = t.clone();
-      i(this, T).subtract(s), i(this, A).subtract(s);
-    }), i(this, T).reorder(), i(this, A).reorder(), this)));
-    // ------------------------------------------
-    a(this, "replaceBy", (e, t) => (i(this, T).replaceBy(e, t), i(this, A).replaceBy(e, t), this));
-    /**
-     * Multiply by the lcm denominator and divide by the gcm numerators.
-     */
-    a(this, "simplify", () => (this.multiply(j.lcm(...i(this, T).getDenominators(), ...i(this, A).getDenominators())), this.divide(j.gcd(...i(this, T).getNumerators(), ...i(this, A).getNumerators())), this));
-    // -----------------------------------------------
-    a(this, "solve", () => new ct(this.clone()).solve());
-    a(this, "test", (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e)));
-    // #endregion Getters And Setters (13)
-    // #region Private methods (6)
-    d(this, Tt, (e) => {
-      if (e.includes("geq"))
-        return e.includes("\\geq") ? "\\geq" : "geq";
-      if (e.includes("leq"))
-        return e.includes("\\leq") ? "\\leq" : "leq";
-      if (e.includes(">="))
-        return ">=";
-      if (e.includes("=>"))
-        return "=>";
-      if (e.includes(">"))
-        return ">";
-      if (e.includes("<="))
-        return "<=";
-      if (e.includes("=<"))
-        return "=<";
-      if (e.includes("<"))
-        return "<";
-      if (e.includes("="))
-        return "=";
-      throw new Error("The equation is not valid (no sign found)");
-    });
-    // -----------------------------------------------
-    // Equations solving algorithms
-    d(this, Ue, (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=");
-    d(this, At, () => i(this, ie) === "=" ? this : i(this, ie).includes("<") ? (i(this, ie).replace("<", ">"), this) : i(this, ie).includes(">") ? (i(this, ie).replace(">", "<"), this) : this);
-    if (h(this, T, new I().zero()), h(this, A, new I().zero()), h(this, ie, "="), e !== void 0 && t === void 0) {
-      if (e instanceof be)
-        return e.clone();
-      typeof e == "string" && this.parse(e);
-    } else e !== void 0 && t !== void 0 && (this.left = new I(e), this.right = new I(t));
-    return s !== void 0 && (this.sign = s), this;
+}, Ct = new WeakMap(), Ye = new WeakMap(), $t = new WeakMap();
+let T = C;
+function ni(o, e = !0) {
+  return e ? `\\left( ${o} \\right)` : `(${o})`;
+}
+var Ee, Qe, Ne, Oe;
+const we = class we {
+  constructor(e, t) {
+    f(this, Ee);
+    f(this, Qe, !1);
+    f(this, Ne);
+    f(this, Oe);
+    if (e instanceof we)
+      h(this, Ne, e.polynom.clone()), h(this, Oe, e.power.clone());
+    else if (typeof e == "string" && t === void 0) {
+      const [s, r = "1"] = e.split("^");
+      h(this, Ne, new T(s)), h(this, Oe, new c(r.replace("(", "").replace(")", "")));
+    } else
+      h(this, Ne, new T(e)), h(this, Oe, new c(t ?? 1));
+    return h(this, Ee, 1), this;
   }
-  /**
-   * Add a value to the equation
-   * if value is an equation, add the left part to the left part of the equation
-   * and the right part to the right part of the equation
-   * if value is a string, try to create an equation
-   * if it fails, create a polynom and add it to the left and right part of the equation
-   * @param value | Polynom | Monom | Fraction | string | monom
-   */
-  add(e) {
-    if (e instanceof be)
-      return i(this, T).add(e.left), i(this, A).add(e.right), this;
-    if (typeof e == "string" && !be.isEquationString(e))
-      return this.add(new be(e));
-    const t = new I(e);
-    return i(this, T).add(t), i(this, A).add(t), this;
+  parse() {
+    throw new Error("Method not implemented.");
   }
-  /**
-   * Create an Equation using two polynoms.
-   * Markdown *support* is cool
-   * @param values
-   * @param asNumeric
-   */
-  evaluate(e, t) {
-    const s = i(this, T).evaluate(e, t), r = i(this, A).evaluate(e, t);
-    return t ? s === r : s.isEqual(r);
+  clone() {
+    return new we(this);
   }
-  isEqual(e) {
-    const t = new be(e);
-    return t.left.isEqual(i(this, T)) && t.right.isEqual(i(this, A));
+  add() {
+    throw new Error("Adding two factors is not possible");
   }
-  pow(e) {
-    return i(this, T).pow(e), i(this, A).pow(e), this;
-  }
-  reduce() {
-    return this.moveLeft(), i(this, T).reduce(), this.simplify(), i(this, T).monoms[0].coefficient.isNegative() && this.multiply(-1), this;
-  }
-  split() {
-    return [i(this, T).clone(), i(this, A).clone()];
-  }
-  subtract(e) {
-    if (e instanceof be)
-      return i(this, T).subtract(e.left), i(this, A).subtract(e.right), this;
-    if (typeof e == "string" && !be.isEquationString(e))
-      return this.subtract(new be(e));
-    const t = new I(e);
-    return i(this, T).subtract(t), i(this, A).subtract(t), this;
-  }
-  static isEquationString(e) {
-    return e.includes("=") || e.includes("<") || e.includes(">") || e.includes("<=") || e.includes(">=");
-  }
-  static makeSolutionsUnique(e, t) {
-    const s = [], r = e.filter((n) => s.includes(n.tex) ? !1 : (s.push(n.tex), !0));
-    return t === !0 && r.sort((n, l) => n.value - l.value), r;
-  }
-  // #endregion Properties and methods (26)
-  // #region Getters And Setters (13)
-  get display() {
-    return `${i(this, T).display}${this.signAsTex}${i(this, A).display}`;
-  }
-  // Getter and setter
-  get left() {
-    return i(this, T);
-  }
-  set left(e) {
-    h(this, T, e);
-  }
-  get numberOfVars() {
-    return this.variables.length;
-  }
-  get right() {
-    return i(this, A);
-  }
-  set right(e) {
-    h(this, A, e);
-  }
-  // ------------------------------------------
-  get sign() {
-    return i(this, ie);
-  }
-  set sign(e) {
-    h(this, ie, i(this, Ue).call(this, e));
-  }
-  get signAsTex() {
-    return i(this, ie) === ">=" ? "\\geq" : i(this, ie) === "<=" ? "\\leq" : i(this, ie);
-  }
-  get tex() {
-    return `${i(this, T).tex}${this.signAsTex}${i(this, A).tex}`;
-  }
-  get variables() {
-    return [...new Set(i(this, A).variables.concat(i(this, T).variables))];
-  }
-  // #endregion Private methods (6)
-};
-T = new WeakMap(), A = new WeakMap(), ie = new WeakMap(), Tt = new WeakMap(), Ue = new WeakMap(), At = new WeakMap();
-let ce = be;
-function Xt(o, e = !0) {
-  return e ? `\\left( ${o} \\right)` : `(${o})`;
-}
-var xe, Ge, Ee, Ne;
-const ge = class ge {
-  constructor(e, t) {
-    d(this, xe);
-    d(this, Ge, !1);
-    d(this, Ee);
-    d(this, Ne);
-    if (e instanceof ge)
-      h(this, Ee, e.polynom.clone()), h(this, Ne, e.power.clone());
-    else if (typeof e == "string" && t === void 0) {
-      const [s, r = "1"] = e.split("^");
-      h(this, Ee, new I(s)), h(this, Ne, new c(r.replace("(", "").replace(")", "")));
-    } else
-      h(this, Ee, new I(e)), h(this, Ne, new c(t ?? 1));
-    return h(this, xe, 1), this;
-  }
-  parse() {
-    throw new Error("Method not implemented.");
-  }
-  clone() {
-    return new ge(this);
-  }
-  add() {
-    throw new Error("Adding two factors is not possible");
-  }
-  get withPower() {
-    return h(this, xe, 1), this;
+  get withPower() {
+    return h(this, Ee, 1), this;
   }
   get withRoot() {
-    return h(this, xe, 0), this;
+    return h(this, Ee, 0), this;
   }
   get asSingle() {
-    return h(this, Ge, !0), this;
+    return h(this, Qe, !0), this;
   }
   degree(e) {
     return this.polynom.degree(e).multiply(this.power);
   }
   derivative() {
-    return this.power.isZero() ? [new ge("0", "1")] : this.power.isOne() ? [new ge(this.polynom.clone().derivative())] : [
-      new ge(this.power.clone()),
-      new ge(this.polynom.clone().derivative()),
-      new ge(this.polynom.clone(), this.power.clone().subtract(1))
+    return this.power.isZero() ? [new we("0", "1")] : this.power.isOne() ? [new we(this.polynom.clone().derivative())] : [
+      new we(this.power.clone()),
+      new we(this.polynom.clone().derivative()),
+      new we(this.polynom.clone(), this.power.clone().subtract(1))
     ];
   }
   develop() {
@@ -2083,12 +1843,12 @@ const ge = class ge {
   get display() {
     const e = this.power.numerator, t = this.power.denominator;
     let s, r;
-    return i(this, xe) === 0 && t > 1 ? (s = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, r = Math.abs(e) === 1 ? "" : `^(${Math.abs(e)})`) : (s = i(this, Ge) && this.power.isOne() ? this.polynom.display : Xt(this.polynom.display, !1), r = t === 1 && Math.abs(e) === 1 ? "" : `^(${this.power.display})`), s = `${s}${r}`, i(this, xe) === 0 && e < 0 && (s = `1/(${s})`), s;
+    return i(this, Ee) === 0 && t > 1 ? (s = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, r = Math.abs(e) === 1 ? "" : `^(${Math.abs(e)})`) : (s = i(this, Qe) && this.power.isOne() ? this.polynom.display : ni(this.polynom.display, !1), r = t === 1 && Math.abs(e) === 1 ? "" : `^(${this.power.display})`), s = `${s}${r}`, i(this, Ee) === 0 && e < 0 && (s = `1/(${s})`), s;
   }
   divide(e) {
-    if (e instanceof ge && this.isSameAs(e))
+    if (e instanceof we && this.isSameAs(e))
       return this.power.subtract(e.power), this;
-    const t = new I(e);
+    const t = new T(e);
     if (this.isSameAs(t))
       return this.power.subtract(1), this;
     throw new Error("The two factors must be the same");
@@ -2110,39 +1870,39 @@ const ge = class ge {
   }
   isSameAs(e) {
     let t;
-    return e instanceof ge ? t = e.polynom : e instanceof I ? t = e : t = new I(e), this.polynom.isEqual(t);
+    return e instanceof we ? t = e.polynom : e instanceof T ? t = e : t = new T(e), this.polynom.isEqual(t);
   }
   isZero() {
     return this.polynom.isZero();
   }
   multiply(e) {
-    if (e instanceof ge && this.isSameAs(e))
+    if (e instanceof we && this.isSameAs(e))
       return this.power.add(e.power), this;
-    const t = new I(e);
+    const t = new T(e);
     if (this.isSameAs(t))
       return this.power.add(1), this;
     throw new Error("The two factors must be the same");
   }
   one() {
-    return i(this, Ee).one(), i(this, Ne).one(), this;
+    return i(this, Ne).one(), i(this, Oe).one(), this;
   }
   opposite() {
     throw new Error("Method not implemented.");
   }
   get polynom() {
-    return i(this, Ee);
+    return i(this, Ne);
   }
   set polynom(e) {
-    h(this, Ee, e);
+    h(this, Ne, e);
   }
   pow(e) {
     return this.power.multiply(e), this;
   }
   get power() {
-    return i(this, Ne);
+    return i(this, Oe);
   }
   set power(e) {
-    h(this, Ne, new c(e));
+    h(this, Oe, new c(e));
   }
   primitive() {
     throw new Error("Method not implemented.");
@@ -2162,207 +1922,620 @@ const ge = class ge {
   get tex() {
     const e = this.power.numerator, t = this.power.denominator;
     let s, r;
-    return i(this, xe) === 0 && t > 1 ? (s = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, r = Math.abs(e) === 1 ? "" : `^{ ${Math.abs(e)} }`) : (s = i(this, Ge) && this.power.isOne() ? this.polynom.tex : Xt(this.polynom.tex), r = t === 1 && Math.abs(e) === 1 ? "" : `^{ ${this.power.tex} }`), s = `${s}${r}`, i(this, xe) === 0 && e < 0 && (s = `\\frac{ 1 }{ ${s} }`), s;
+    return i(this, Ee) === 0 && t > 1 ? (s = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, r = Math.abs(e) === 1 ? "" : `^{ ${Math.abs(e)} }`) : (s = i(this, Qe) && this.power.isOne() ? this.polynom.tex : ni(this.polynom.tex), r = t === 1 && Math.abs(e) === 1 ? "" : `^{ ${this.power.tex} }`), s = `${s}${r}`, i(this, Ee) === 0 && e < 0 && (s = `\\frac{ 1 }{ ${s} }`), s;
   }
   get variables() {
     return this.polynom.variables;
   }
   zero() {
-    return i(this, Ee).zero(), i(this, Ne).one(), this;
+    return i(this, Ne).zero(), i(this, Oe).one(), this;
   }
 };
-xe = new WeakMap(), Ge = new WeakMap(), Ee = new WeakMap(), Ne = new WeakMap();
-let ue = ge;
-var De = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(De || {}), E, ke, st, Zt;
-const pe = class pe {
+Ee = new WeakMap(), Qe = new WeakMap(), Ne = new WeakMap(), Oe = new WeakMap();
+let fe = we;
+var Ue = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(Ue || {}), N, Ve, lt, Yt;
+const me = class me {
   // #endregion Class fields (1)
   // #region Constructors (1)
   constructor(...e) {
     // #region Class fields (1)
-    d(this, E, []);
-    d(this, ke, De.POWER);
+    f(this, N, []);
+    f(this, Ve, Ue.POWER);
     return this.parse(...e), this;
   }
   // #endregion Constructors (1)
   // #region Properties and methods (25)
   parse(...e) {
-    return e.length === 0 ? this : (h(this, E, []), e.forEach((t) => {
+    return e.length === 0 ? this : (h(this, N, []), e.forEach((t) => {
       if (typeof t == "string") {
         const s = t.split(")(").join(")*(").split("*");
-        i(this, E).push(...s.map((r) => new ue(r)));
-      } else t instanceof pe ? i(this, E).push(...t.factors.map((s) => s.clone())) : i(this, E).push(new ue(t));
+        i(this, N).push(...s.map((r) => new fe(r)));
+      } else t instanceof me ? i(this, N).push(...t.factors.map((s) => s.clone())) : i(this, N).push(new fe(t));
     }), this);
   }
   clone() {
-    return new pe(...i(this, E).map((e) => e.clone()));
+    return new me(...i(this, N).map((e) => e.clone()));
   }
   add(...e) {
     let t = [this, ...e];
-    const s = pe.gcd(...t);
+    const s = me.gcd(...t);
     t = t.map((n) => n.divide(s).reduce());
-    const r = new I("0");
-    return t.forEach((n) => r.add(n.develop())), h(this, E, [
+    const r = new T("0");
+    return t.forEach((n) => r.add(n.develop())), h(this, N, [
       ...s.factors,
-      new ue(r)
+      new fe(r)
     ]), this;
   }
   degree(e) {
-    return i(this, E).reduce((t, s) => t.add(s.degree(e)), new c("0"));
+    return i(this, N).reduce((t, s) => t.add(s.degree(e)), new c("0"));
   }
   derivative() {
-    const e = [], t = i(this, E).length;
+    const e = [], t = i(this, N).length;
     for (let r = 0; r < t; r++) {
-      const n = i(this, E).slice(), l = n.splice(r, 1)[0];
-      e.push(new pe(...n).multiply(new pe(...l.derivative())));
+      const n = i(this, N).slice(), l = n.splice(r, 1)[0];
+      e.push(new me(...n).multiply(new me(...l.derivative())));
     }
     e.forEach((r) => r.reduce());
     const s = e.shift();
-    return s !== void 0 && h(this, E, s.factors), this.add(...e);
+    return s !== void 0 && h(this, N, s.factors), this.add(...e);
   }
   develop() {
-    const e = new I("1");
-    return i(this, E).forEach((t) => {
+    const e = new T("1");
+    return i(this, N).forEach((t) => {
       e.multiply(t.develop());
     }), e;
   }
   divide(e) {
-    return h(this, E, i(this, E).concat(e.clone().factors.map((t) => t.inverse()))), this;
+    return h(this, N, i(this, N).concat(e.clone().factors.map((t) => t.inverse()))), this;
   }
   evaluate(e, t) {
-    return t ? i(this, E).reduce((s, r) => s * r.evaluate(e, t), 1) : i(this, E).reduce((s, r) => s.multiply(r.evaluate(e)), new c("1"));
+    return t ? i(this, N).reduce((s, r) => s * r.evaluate(e, t), 1) : i(this, N).reduce((s, r) => s.multiply(r.evaluate(e)), new c("1"));
   }
   hasVariable(e) {
-    return i(this, E).some((t) => t.hasVariable(e));
+    return i(this, N).some((t) => t.hasVariable(e));
   }
   inverse() {
-    return h(this, E, i(this, E).map((e) => e.inverse())), this;
+    return h(this, N, i(this, N).map((e) => e.inverse())), this;
   }
   isEqual(e) {
-    const t = pe.gcd(this, e), s = this.clone().divide(t).reduce(), r = e.clone().divide(t).reduce();
+    const t = me.gcd(this, e), s = this.clone().divide(t).reduce(), r = e.clone().divide(t).reduce();
     return s.isOne() && r.isOne();
   }
   isOne() {
-    return i(this, E).every((e) => e.isOne());
+    return i(this, N).every((e) => e.isOne());
   }
   isZero() {
-    return i(this, E).every((e) => e.isZero());
+    return i(this, N).every((e) => e.isZero());
   }
   multiply(...e) {
     return e.forEach((t) => {
-      h(this, E, i(this, E).concat(t.clone().factors));
+      h(this, N, i(this, N).concat(t.clone().factors));
     }), this;
   }
   one() {
-    return h(this, E, [new ue("1", "1")]), this;
+    return h(this, N, [new fe("1", "1")]), this;
   }
   opposite() {
-    const e = i(this, E).findIndex((t) => t.display === "(-1)");
-    return e >= 0 ? i(this, E).splice(e, 1) : i(this, E).push(new ue("-1", "1")), this;
+    const e = i(this, N).findIndex((t) => t.display === "(-1)");
+    return e >= 0 ? i(this, N).splice(e, 1) : i(this, N).push(new fe("-1", "1")), this;
   }
   pow(e) {
-    return h(this, E, i(this, E).map((t) => t.pow(e))), this;
+    return h(this, N, i(this, N).map((t) => t.pow(e))), this;
   }
   primitive() {
     throw new Error("Method not implemented.");
   }
   reduce() {
-    const e = kt(this);
-    return h(this, E, Object.values(e).map((t) => {
+    const e = Wt(this);
+    return h(this, N, Object.values(e).map((t) => {
       const s = t[0].polynom, r = t.reduce((n, l) => n.add(l.power), new c("0"));
-      return new ue(s, r.reduce());
+      return new fe(s, r.reduce());
     }).filter((t) => !t.power.isZero())), this;
   }
   root(e) {
-    return h(this, E, i(this, E).map((t) => t.root(e))), this;
+    return h(this, N, i(this, N).map((t) => t.root(e))), this;
   }
   sort() {
-    return h(this, E, i(this, E).sort((e, t) => e.degree().isLeq(t.degree()) ? -1 : 1)), this;
+    return h(this, N, i(this, N).sort((e, t) => e.degree().isLeq(t.degree()) ? -1 : 1)), this;
   }
   sqrt() {
-    return h(this, E, i(this, E).map((e) => e.sqrt())), this;
+    return h(this, N, i(this, N).map((e) => e.sqrt())), this;
   }
   subtract(...e) {
     return this.add(...e.map((t) => t.opposite()));
   }
   zero() {
-    return h(this, E, [new ue("0", "1")]), this;
+    return h(this, N, [new fe("0", "1")]), this;
   }
   static gcd(...e) {
     var s;
     if (e.length === 0)
-      return new pe().one();
+      return new me().one();
     if (e.length === 1)
       return e[0];
     if (e.length === 2)
-      return q(s = pe, st, Zt).call(s, e[0], e[1]);
+      return M(s = me, lt, Yt).call(s, e[0], e[1]);
     let t = e[0];
     return e.shift(), e.forEach((r) => {
       var n;
-      return t = q(n = pe, st, Zt).call(n, t, r);
+      return t = M(n = me, lt, Yt).call(n, t, r);
     }), t;
   }
   // #endregion Properties and methods (25)
   // #region Getters And Setters (5)
   get factors() {
-    return i(this, E);
+    return i(this, N);
   }
   set factors(e) {
-    h(this, E, e);
+    h(this, N, e);
   }
   get variables() {
-    return i(this, E).reduce((e, t) => e.concat(t.variables), []);
+    return i(this, N).reduce((e, t) => e.concat(t.variables), []);
   }
   get asRoot() {
-    return h(this, ke, De.ROOT), this;
+    return h(this, Ve, Ue.ROOT), this;
   }
   get asPower() {
-    return h(this, ke, De.POWER), this;
+    return h(this, Ve, Ue.POWER), this;
   }
   get numerator() {
-    return i(this, E).filter((e) => e.power.isPositive());
+    return i(this, N).filter((e) => e.power.isPositive());
   }
   get denominator() {
-    return i(this, E).filter((e) => e.power.isNegative());
+    return i(this, N).filter((e) => e.power.isNegative());
   }
   get display() {
     let e = [], t = [];
-    if (i(this, ke) === De.ROOT ? (e = this.numerator, t = this.denominator.map((n) => n.clone().inverse())) : e = i(this, E), e.length === 0 && (e = [new ue("1")]), t.length === 0)
+    if (i(this, Ve) === Ue.ROOT ? (e = this.numerator, t = this.denominator.map((n) => n.clone().inverse())) : e = i(this, N), e.length === 0 && (e = [new fe("1")]), t.length === 0)
       return e.length === 1 ? e[0].asSingle.display : e.map((n) => n.display).join("");
     const s = e.length === 1 ? e[0].asSingle.display : e.map((n) => n.display).join(""), r = t.length === 1 ? t[0].asSingle.display : t.map((n) => n.display).join("");
     return `(${s})/(${r})`;
   }
   get tex() {
-    let e = [], t = [];
-    if (i(this, ke) === De.ROOT ? (e = this.numerator, t = this.denominator.map((n) => n.clone().inverse())) : e = i(this, E), e.length === 0 && (e = [new ue("1")]), t.length === 0)
-      return e.length === 1 ? e[0].asSingle.tex : e.map((n) => n.tex).join("");
-    const s = e.length === 1 ? e[0].asSingle.tex : e.map((n) => n.tex).join(""), r = t.length === 1 ? t[0].asSingle.tex : t.map((n) => n.tex).join("");
-    return `\\frac{ ${s} }{ ${r} }`;
+    let e = [], t = [];
+    if (i(this, Ve) === Ue.ROOT ? (e = this.numerator, t = this.denominator.map((n) => n.clone().inverse())) : e = i(this, N), e.length === 0 && (e = [new fe("1")]), t.length === 0)
+      return e.length === 1 ? e[0].asSingle.tex : e.map((n) => n.tex).join("");
+    const s = e.length === 1 ? e[0].asSingle.tex : e.map((n) => n.tex).join(""), r = t.length === 1 ? t[0].asSingle.tex : t.map((n) => n.tex).join("");
+    return `\\frac{ ${s} }{ ${r} }`;
+  }
+  // #endregion Private methods (1)
+};
+N = new WeakMap(), Ve = new WeakMap(), lt = new WeakSet(), Yt = function(e, t) {
+  const s = Wt(e), r = Wt(t), l = Object.keys(s).filter((u) => Object.hasOwn(r, u)).map((u) => {
+    const p = s[u].reduce((g, E) => g.add(E.power), new c("0")), m = r[u].reduce((g, E) => g.add(E.power), new c("0"));
+    return new fe(u, c.min(p, m));
+  });
+  return new me(...l);
+}, f(me, lt);
+let Xt = me;
+function Wt(o) {
+  const e = new c().one(), t = o.factors.reduce((s, r) => {
+    if (r.polynom.degree().isZero())
+      return r.polynom.monoms.length > 0 && e.multiply(r.polynom.monoms[0].coefficient), s;
+    const n = r.polynom.display;
+    return Object.hasOwn(s, n) ? s[n].push(r) : s[n] = [r], s;
+  }, {});
+  return e.isOne() || (t[e.display] = [new fe(e.display, 1)]), t;
+}
+var q, A, re, Pt, Ke, St;
+const xe = class xe {
+  constructor(e, t, s) {
+    // Left part of the equation
+    f(this, q);
+    // Right part of the equation
+    f(this, A);
+    // Signe of the equation
+    f(this, re);
+    // #endregion Constructors (3)
+    // #region Properties and methods (26)
+    // ------------------------------------------
+    a(this, "parse", (e) => {
+      const t = i(this, Pt).call(this, e);
+      if (t === !1)
+        throw new Error("The equation is not valid (no sign found)");
+      const s = e.split(t);
+      return this.create(new T(s[0]), new T(s[1]), i(this, Ke).call(this, t));
+    });
+    a(this, "create", (e, t, s) => (h(this, q, e), h(this, A, t), h(this, re, i(this, Ke).call(this, s ?? "=")), this));
+    a(this, "clone", () => new xe(i(this, q).clone(), i(this, A).clone(), i(this, re)));
+    /**
+     * Get the degree of the equation
+     * @param letter
+     */
+    a(this, "degree", (e) => c.max(i(this, q).degree(e), i(this, A).degree(e)));
+    /**
+     * divide an equation by a given value (transformed as a fraction)
+     *
+     * ```
+     * 8x+10=6x \vert 2
+     * 4x+5=3x
+     * ```
+     *
+     * |>Alternatively with $3x-4$ maybe it's working ?
+     * $$\frac{3x}{5}$$
+     *
+     * @param value
+     * @returns {Equation}
+     */
+    a(this, "divide", (e) => {
+      const t = new c(e);
+      return t.isZero() ? this : this.multiply(t.inverse());
+    });
+    /**
+     * Determine if the equation contains a variable.
+     * @param letter
+     */
+    a(this, "hasVariable", (e) => this.variables.includes(e));
+    a(this, "isLinearTo", (e) => {
+      const t = e.clone().moveLeft().simplify().left, s = this.clone().moveLeft().simplify().left;
+      return t.isEqual(s) || t.isOppositeAt(s);
+    });
+    /**
+     * Determine if the equation contains more than one letter/variable.
+     */
+    a(this, "isMultiVariable", () => i(this, q).isMultiVariable || i(this, A).isMultiVariable);
+    // -----------------------------------------------
+    // Equations helpers
+    a(this, "isEqualTo", (e) => {
+      const t = e.clone().moveLeft().left, s = this.clone().moveLeft().left;
+      return t.isEqual(s) || t.isOppositeAt(s);
+    });
+    /**
+     * Reorder the polynom to have only one letter on the left, the rest on the right.
+     * @param letter
+     */
+    a(this, "isolate", (e) => {
+      if (!this.degree(e).isOne() || this.isMultiVariable())
+        return !1;
+      let t;
+      i(this, q).subtract(i(this, A)), i(this, A).zero();
+      const s = [...i(this, q).monoms];
+      for (const n of s)
+        n.hasVariable(e) || (t = n.clone(), i(this, q).subtract(t), i(this, A).subtract(t));
+      if (i(this, q).length !== 1)
+        return !1;
+      const r = i(this, q).monoms[0].coefficient.clone();
+      return i(this, q).divide(r), i(this, A).divide(r), this;
+    });
+    // -----------------------------------------------
+    // Equations operations
+    // -----------------------------------------------
+    a(this, "letters", () => [.../* @__PURE__ */ new Set([...i(this, q).letters(), ...i(this, A).letters()])]);
+    // -----------------------------------------------
+    /**
+     * Reorder will move all monoms containing a letter on the left, all the other on the right.
+     */
+    a(this, "moveLeft", () => (i(this, q).subtract(i(this, A)), i(this, A).zero(), this));
+    /**
+     * Multiple an equation by a fraction value.
+     * @param value
+     */
+    a(this, "multiply", (e) => {
+      const t = new c(e);
+      return i(this, q).multiply(t), i(this, A).multiply(t), i(this, re) !== "=" && t.sign() === -1 && i(this, St).call(this), this;
+    });
+    a(this, "opposite", () => (h(this, q, i(this, q).opposite()), h(this, A, i(this, A).opposite()), this));
+    a(this, "reorder", (e) => (i(this, q).subtract(i(this, A)), i(this, A).zero(), i(this, q).reorder(), e ? this : (i(this, q).monoms.filter((t) => t.degree().isZero()).forEach((t) => {
+      const s = t.clone();
+      i(this, q).subtract(s), i(this, A).subtract(s);
+    }), i(this, q).reorder(), i(this, A).reorder(), this)));
+    // ------------------------------------------
+    a(this, "replaceBy", (e, t) => (i(this, q).replaceBy(e, t), i(this, A).replaceBy(e, t), this));
+    /**
+     * Multiply by the lcm denominator and divide by the gcm numerators.
+     */
+    a(this, "simplify", () => (this.multiply(G.lcm(...i(this, q).getDenominators(), ...i(this, A).getDenominators())), this.divide(G.gcd(...i(this, q).getNumerators(), ...i(this, A).getNumerators())), this));
+    // -----------------------------------------------
+    a(this, "solve", () => new gt(this.clone()).solve());
+    a(this, "test", (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e)));
+    // #endregion Getters And Setters (13)
+    // #region Private methods (6)
+    f(this, Pt, (e) => {
+      if (e.includes("geq"))
+        return e.includes("\\geq") ? "\\geq" : "geq";
+      if (e.includes("leq"))
+        return e.includes("\\leq") ? "\\leq" : "leq";
+      if (e.includes(">="))
+        return ">=";
+      if (e.includes("=>"))
+        return "=>";
+      if (e.includes(">"))
+        return ">";
+      if (e.includes("<="))
+        return "<=";
+      if (e.includes("=<"))
+        return "=<";
+      if (e.includes("<"))
+        return "<";
+      if (e.includes("="))
+        return "=";
+      throw new Error("The equation is not valid (no sign found)");
+    });
+    // -----------------------------------------------
+    // Equations solving algorithms
+    f(this, Ke, (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=");
+    f(this, St, () => i(this, re) === "=" ? this : i(this, re).includes("<") ? (i(this, re).replace("<", ">"), this) : i(this, re).includes(">") ? (i(this, re).replace(">", "<"), this) : this);
+    if (h(this, q, new T().zero()), h(this, A, new T().zero()), h(this, re, "="), e !== void 0 && t === void 0) {
+      if (e instanceof xe)
+        return e.clone();
+      typeof e == "string" && this.parse(e);
+    } else e !== void 0 && t !== void 0 && (this.left = new T(e), this.right = new T(t));
+    return s !== void 0 && (this.sign = s), this;
+  }
+  /**
+   * Add a value to the equation
+   * if value is an equation, add the left part to the left part of the equation
+   * and the right part to the right part of the equation
+   * if value is a string, try to create an equation
+   * if it fails, create a polynom and add it to the left and right part of the equation
+   * @param value | Polynom | Monom | Fraction | string | monom
+   */
+  add(e) {
+    if (e instanceof xe)
+      return i(this, q).add(e.left), i(this, A).add(e.right), this;
+    if (typeof e == "string" && !xe.isEquationString(e))
+      return this.add(new xe(e));
+    const t = new T(e);
+    return i(this, q).add(t), i(this, A).add(t), this;
+  }
+  /**
+   * Create an Equation using two polynoms.
+   * Markdown *support* is cool
+   * @param values
+   * @param asNumeric
+   */
+  evaluate(e, t) {
+    const s = i(this, q).evaluate(e, t), r = i(this, A).evaluate(e, t);
+    return t ? s === r : s.isEqual(r);
+  }
+  isEqual(e) {
+    const t = new xe(e);
+    return t.left.isEqual(i(this, q)) && t.right.isEqual(i(this, A));
+  }
+  pow(e) {
+    return i(this, q).pow(e), i(this, A).pow(e), this;
+  }
+  reduce() {
+    return this.moveLeft(), i(this, q).reduce(), this.simplify(), i(this, q).monoms[0].coefficient.isNegative() && this.multiply(-1), this;
+  }
+  split() {
+    return [i(this, q).clone(), i(this, A).clone()];
+  }
+  subtract(e) {
+    if (e instanceof xe)
+      return i(this, q).subtract(e.left), i(this, A).subtract(e.right), this;
+    if (typeof e == "string" && !xe.isEquationString(e))
+      return this.subtract(new xe(e));
+    const t = new T(e);
+    return i(this, q).subtract(t), i(this, A).subtract(t), this;
+  }
+  static isEquationString(e) {
+    return e.includes("=") || e.includes("<") || e.includes(">") || e.includes("<=") || e.includes(">=");
+  }
+  static makeSolutionsUnique(e, t) {
+    const s = [], r = e.filter((n) => s.includes(n.tex) ? !1 : (s.push(n.tex), !0));
+    return t === !0 && r.sort((n, l) => n.value - l.value), r;
+  }
+  // #endregion Properties and methods (26)
+  // #region Getters And Setters (13)
+  get display() {
+    return `${i(this, q).display}${this.signAsTex}${i(this, A).display}`;
+  }
+  // Getter and setter
+  get left() {
+    return i(this, q);
+  }
+  set left(e) {
+    h(this, q, e);
+  }
+  get numberOfVars() {
+    return this.variables.length;
+  }
+  get right() {
+    return i(this, A);
+  }
+  set right(e) {
+    h(this, A, e);
+  }
+  // ------------------------------------------
+  get sign() {
+    return i(this, re);
+  }
+  set sign(e) {
+    h(this, re, i(this, Ke).call(this, e));
+  }
+  get signAsTex() {
+    return i(this, re) === ">=" ? "\\geq" : i(this, re) === "<=" ? "\\leq" : i(this, re);
+  }
+  get tex() {
+    return `${i(this, q).tex}${this.signAsTex}${i(this, A).tex}`;
+  }
+  get variables() {
+    return [...new Set(i(this, A).variables.concat(i(this, q).variables))];
+  }
+  // #endregion Private methods (6)
+};
+q = new WeakMap(), A = new WeakMap(), re = new WeakMap(), Pt = new WeakMap(), Ke = new WeakMap(), St = new WeakMap();
+let H = xe;
+var k, Ie, Bt, Rt;
+const Ge = class Ge {
+  constructor(...e) {
+    f(this, k);
+    // Determine the letters in the linear system, usually ['x', 'y']
+    f(this, Ie);
+    a(this, "parse", (...e) => (h(this, k, e.map((t) => new H(t))), i(this, Bt).call(this), this));
+    a(this, "clone", () => new Ge().parse(...i(this, k).map((e) => e.clone())));
+    a(this, "buildTex", (e, t) => {
+      let s, r, n = [];
+      const l = [];
+      for (const p of e)
+        n = n.concat(p.letters());
+      n = [...new Set(n)], n.sort();
+      for (let p = 0; p < e.length; p++) {
+        const m = e[p];
+        s = [];
+        for (const g of n)
+          r = m.left.monomByLetter(g), s.length === 0 ? s.push(r.isZero() ? "" : r.tex) : s.push(r.isZero() ? "" : (r.coefficient.sign() === 1 ? "+" : "") + r.tex);
+        if (s.push("="), s.push(m.right.tex), (t == null ? void 0 : t[p]) !== void 0) {
+          s[s.length - 1] = s[s.length - 1] + " \\phantom{\\quad}";
+          for (const g of t[p])
+            s.push(`\\ \\cdot\\ ${g.startsWith("-") ? "\\left(" + g + "\\right)" : g}`);
+        }
+        l.push(s.join("&"));
+      }
+      let u = 0;
+      return t !== void 0 && t.length > 0 && (u = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(n.length)}cl ${"|l".repeat(u)}}${l.join("\\\\ ")}\\end{array}\\right.`;
+    });
+    a(this, "mergeEquations", (e, t, s, r) => {
+      const n = e.clone().multiply(new c(s)), l = t.clone().multiply(new c(r));
+      return n.left.add(l.left), n.right.add(l.right), n;
+    });
+    // ------------------------------------------
+    a(this, "reorder", () => {
+      for (const e of i(this, k))
+        e.reorder();
+      return this;
+    });
+    a(this, "solveMatrix", () => {
+      const [e, t] = this.matrix, s = e.map((r, n) => [...r, t[n]]);
+      for (let r = 0; r < e.length; r++) {
+        const n = s[r][r].clone();
+        s[r] = s[r].map((l) => l.divide(n));
+        for (let l = 0; l < e.length; l++) {
+          if (l === r)
+            continue;
+          const u = s[l][r].clone().opposite();
+          for (let p = 0; p < s[l].length; p++)
+            s[l][p].add(s[r][p].clone().multiply(u));
+          if (s[l].slice(0, s[l].length - 1).every((p) => p.isZero()))
+            return s[l][s[l].length - 1].isZero() ? [new c().infinite()] : [];
+        }
+      }
+      return s.map((r) => r[r.length - 1]);
+    });
+    f(this, Bt, () => (h(this, Ie, i(this, k).reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], [])), i(this, Ie).sort(), this));
+    f(this, Rt, () => {
+      const e = [], t = [];
+      for (const s of i(this, k)) {
+        const r = [], n = s.clone().reorder();
+        for (const l of this.variables) {
+          const u = n.left.monomByLetter(l);
+          r.push(u.coefficient);
+        }
+        t.push(n.right.monoms[0].coefficient), e.push(r);
+      }
+      return [e, t];
+    });
+    return h(this, k, []), h(this, Ie, []), e.length > 0 && this.parse(...e), this;
+  }
+  static fromMatrix(e, t = "xyz") {
+    const s = e[0].length;
+    if (e.some((n) => n.length !== s))
+      throw new Error("All rows must have the same number of columns");
+    const r = t.split("").splice(0, s - 1);
+    return new Ge(
+      ...e.map((n) => {
+        const l = new T(r.join(""), ...n);
+        return new H(l, 0);
+      })
+    );
+  }
+  add(e, t) {
+    if (e instanceof Ge) {
+      const s = e.equations.length;
+      if (s !== i(this, k).length)
+        throw new Error("The number of equations must be the same");
+      for (let r = 0; r < s; r++)
+        i(this, k)[r].add(e.equations[r]);
+    } else {
+      if (t === void 0 || t < 0 || t >= i(this, k).length)
+        throw new Error("Index out of range");
+      const s = new H(e);
+      i(this, k)[t].add(s);
+    }
+    return this;
+  }
+  degree(e) {
+    return c.max(...i(this, k).map((t) => t.degree(e)));
+  }
+  get display() {
+    return this.tex + "as display";
+  }
+  // ------------------------------------------
+  get equations() {
+    return i(this, k);
+  }
+  set equations(e) {
+    h(this, k, e);
+  }
+  evaluate(e, t) {
+    throw new Error("Method not implemented.");
+  }
+  hasVariable(e) {
+    return i(this, Ie).includes(e);
+  }
+  isEqual(e) {
+    return this.equations.every((t, s) => t.isEqual(e.equations[s]));
+  }
+  get isSolvable() {
+    return this.variables.length === i(this, k).length;
+  }
+  get matrix() {
+    return i(this, Rt).call(this);
+  }
+  multiply(e, t) {
+    if (Array.isArray(e)) {
+      if (e.length !== i(this, k).length)
+        throw new Error("The number of values must be the same as the number of equations");
+      for (let s = 0; s < e.length; s++)
+        i(this, k)[s].multiply(e[s]);
+      return this;
+    }
+    if (t === void 0 || t < 0 || t >= i(this, k).length)
+      throw new Error("Index out of range");
+    return i(this, k)[t].multiply(e), this;
+  }
+  reduce() {
+    throw new Error("Method not implemented.");
+  }
+  solve() {
+    return [];
+  }
+  subtract(e, t) {
+    if (e instanceof Ge) {
+      const s = e.equations.length;
+      if (s !== i(this, k).length)
+        throw new Error("The number of equations must be the same");
+      for (let r = 0; r < s; r++)
+        i(this, k)[r].subtract(e.equations[r]);
+    } else {
+      if (t === void 0 || t < 0 || t >= i(this, k).length)
+        throw new Error("Index out of range");
+      const s = new H(e);
+      i(this, k)[t].subtract(s);
+    }
+    return this;
+  }
+  get tex() {
+    const e = this.clone().reorder();
+    return this.buildTex(e.equations);
+  }
+  get variables() {
+    return i(this, Ie);
+  }
+  set variables(e) {
+    const t = typeof e == "string" ? e.split("") : [...e];
+    t.sort(), h(this, Ie, t);
   }
-  // #endregion Private methods (1)
 };
-E = new WeakMap(), ke = new WeakMap(), st = new WeakSet(), Zt = function(e, t) {
-  const s = kt(e), r = kt(t), l = Object.keys(s).filter((u) => Object.hasOwn(r, u)).map((u) => {
-    const b = s[u].reduce((m, x) => m.add(x.power), new c("0")), p = r[u].reduce((m, x) => m.add(x.power), new c("0"));
-    return new ue(u, c.min(b, p));
-  });
-  return new pe(...l);
-}, d(pe, st);
-let Dt = pe;
-function kt(o) {
-  const e = new c().one(), t = o.factors.reduce((s, r) => {
-    if (r.polynom.degree().isZero())
-      return r.polynom.monoms.length > 0 && e.multiply(r.polynom.monoms[0].coefficient), s;
-    const n = r.polynom.display;
-    return Object.hasOwn(s, n) ? s[n].push(r) : s[n] = [r], s;
-  }, {});
-  return e.isOne() || (t[e.display] = [new ue(e.display, 1)]), t;
-}
-function $i(o, e) {
+k = new WeakMap(), Ie = new WeakMap(), Bt = new WeakMap(), Rt = new WeakMap();
+let Qt = Ge;
+function Fi(o, e) {
   return o.dimension === e.dimension && o.array.every(
     (t, s) => e.array[s].isEqual(t)
   );
 }
-function Bi(o, e) {
+function ji(o, e) {
   if (o.dimension !== e.dimension)
     return !1;
   const t = e.array[0].value / o.array[0].value;
@@ -2370,35 +2543,44 @@ function Bi(o, e) {
     (s, r) => e.array[r].value === s.value * t
   );
 }
-function Pi(o, e) {
+function Ui(o, e) {
   return o.dimension !== e.dimension ? new c().invalid() : o.array.reduce(
     (t, s, r) => t.add(s.clone().multiply(e.array[r])),
     new c(0)
   );
 }
-var D, Be, qt;
-const Ie = class Ie {
+function Gi(...o) {
+  return o.some((e) => e.dimension !== o[0].dimension) ? new c().invalid() : o[0].dimension === 2 && o.length !== 2 ? new c().invalid() : o[0].dimension === 3 && o.length !== 3 ? new c().invalid() : o[0].dimension === 2 ? o[0].array[0].clone().multiply(o[1].array[1]).subtract(o[0].array[1].clone().multiply(o[1].array[0])) : o[0].array[0].clone().multiply(
+    o[1].array[1].clone().multiply(o[2].array[2]).subtract(o[1].array[2].clone().multiply(o[2].array[1]))
+  ).subtract(
+    o[0].array[1].clone().multiply(
+      o[1].array[0].clone().multiply(o[2].array[2]).subtract(o[1].array[2].clone().multiply(o[2].array[0]))
+    )
+  ).add(o[0].array[2].clone().multiply(o[1].array[0].clone().multiply(o[2].array[1]).subtract(o[1].array[1].clone().multiply(o[2].array[0]))));
+}
+var V, ze, zt;
+const Se = class Se {
   constructor(...e) {
-    d(this, D, []);
-    d(this, Be, !1);
-    a(this, "zero", () => (i(this, D).forEach((e) => e.zero()), this));
+    f(this, V, []);
+    f(this, ze, !1);
+    a(this, "zero", () => (i(this, V).forEach((e) => e.zero()), this));
     a(this, "one", () => (this.zero(), this.x.one(), this));
-    a(this, "opposite", () => (i(this, D).forEach((e) => e.opposite()), this));
-    a(this, "add", (e) => (i(this, D).forEach((t, s) => t.add(e.array[s])), this));
+    a(this, "opposite", () => (i(this, V).forEach((e) => e.opposite()), this));
+    a(this, "add", (e) => (i(this, V).forEach((t, s) => t.add(e.array[s])), this));
     a(this, "subtract", (e) => this.add(e.clone().opposite()));
     a(this, "unit", () => {
       const e = this.norm;
       return e === 0 ? this : this.divideByScalar(e);
     });
-    a(this, "dot", (e) => Pi(this, e));
+    a(this, "dot", (e) => Ui(this, e));
     a(this, "normal", () => {
       if (this.dimension >= 3)
         throw new Error("Normal vector can only be determined in 2D");
       const e = this.x.clone().opposite(), t = this.y.clone();
-      return i(this, D)[0] = t, i(this, D)[1] = e, this;
+      return i(this, V)[0] = t, i(this, V)[1] = e, this;
     });
-    a(this, "isEqual", (e) => $i(this, e));
-    a(this, "isColinearTo", (e) => Bi(this, e));
+    a(this, "isEqual", (e) => Fi(this, e));
+    a(this, "isColinearTo", (e) => ji(this, e));
     a(this, "isNormalTo", (e) => this.dot(e).isZero());
     a(this, "multiplyByScalar", (e) => {
       const t = new c(e);
@@ -2406,9 +2588,9 @@ const Ie = class Ie {
     });
     a(this, "divideByScalar", (e) => this.multiplyByScalar(new c(e).inverse()));
     a(this, "simplify", () => this.multiplyByScalar(
-      j.lcm(...this.array.map((e) => e.denominator))
+      G.lcm(...this.array.map((e) => e.denominator))
     ).divideByScalar(
-      j.gcd(...this.array.map((e) => e.numerator))
+      G.gcd(...this.array.map((e) => e.numerator))
     ).multiplyByScalar(
       this.x.isNegative() ? -1 : 1
     ));
@@ -2416,10 +2598,10 @@ const Ie = class Ie {
       let r = this.dot(e).value;
       return t && (r = Math.abs(r)), (s ? 1 : 180 / Math.PI) * Math.acos(r / (this.norm * e.norm));
     });
-    d(this, qt, (e) => {
+    f(this, zt, (e) => {
       e.startsWith("(") && (e = e.substring(1)), e.endsWith(")") && (e = e.substring(0, e.length - 1));
       const t = e.split(/[,;\s]/g).filter((s) => s.trim() !== "");
-      return t.length < 2 ? this : (h(this, D, t.map((s) => new c(s))), this);
+      return t.length < 2 ? this : (h(this, V, t.map((s) => new c(s))), this);
     });
     e.length > 0 && this.parse(...e);
   }
@@ -2427,38 +2609,38 @@ const Ie = class Ie {
   // Getter and setter
   // ------------------------------------------
   get array() {
-    return i(this, D);
+    return i(this, V);
   }
   set array(e) {
-    h(this, D, e);
+    h(this, V, e);
   }
   get x() {
-    return i(this, D)[0];
+    return i(this, V)[0];
   }
   set x(e) {
-    i(this, D)[0] = new c(e);
+    i(this, V)[0] = new c(e);
   }
   get y() {
-    return i(this, D)[1];
+    return i(this, V)[1];
   }
   set y(e) {
-    i(this, D)[1] = new c(e);
+    i(this, V)[1] = new c(e);
   }
   get z() {
     if (this.dimension < 3)
       throw new Error("Vector is not 3D");
-    return i(this, D)[2];
+    return i(this, V)[2];
   }
   set z(e) {
     if (this.dimension < 3)
       throw new Error("Vector is not 3D");
-    i(this, D)[2] = new c(e);
+    i(this, V)[2] = new c(e);
   }
   get asPoint() {
-    return i(this, Be);
+    return i(this, ze);
   }
   set asPoint(e) {
-    h(this, Be, e);
+    h(this, ze, e);
   }
   get normSquare() {
     return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new c(0));
@@ -2467,19 +2649,19 @@ const Ie = class Ie {
     return Math.sqrt(this.normSquare.value);
   }
   get tex() {
-    return i(this, Be) ? `\\left(${this.array.map((e) => e.tex).join(";")}\\right)` : `\\begin{pmatrix} ${this.array.map((e) => e.tex).join(" \\\\ ")} \\end{pmatrix}`;
+    return i(this, ze) ? `\\left(${this.array.map((e) => e.tex).join(";")}\\right)` : `\\begin{pmatrix} ${this.array.map((e) => e.tex).join(" \\\\ ")} \\end{pmatrix}`;
   }
   get display() {
-    return i(this, Be) ? `(${this.array.map((e) => e.display).join(";")})` : `((${this.array.map((e) => e.display).join(",")}))`;
+    return i(this, ze) ? `(${this.array.map((e) => e.display).join(";")})` : `((${this.array.map((e) => e.display).join(",")}))`;
   }
   setDimension(e = 2) {
     if (e < 2)
       throw new Error("Dimension must be at least 2");
     if (e < this.dimension)
-      h(this, D, i(this, D).slice(0, e));
+      h(this, V, i(this, V).slice(0, e));
     else if (e > this.dimension)
       for (let t = this.dimension; t < e; t++)
-        i(this, D).push(new c(0));
+        i(this, V).push(new c(0));
     return this;
   }
   get dimension() {
@@ -2498,34 +2680,34 @@ const Ie = class Ie {
     return `((${e.join(",")}))`;
   }
   defineAsPoint(e) {
-    return h(this, Be, e !== !1), this;
+    return h(this, ze, e !== !1), this;
   }
   parse(...e) {
     if (e.length === 0)
       throw new Error("Invalid value");
     if (e.length === 1) {
-      if (e[0] instanceof Ie)
+      if (e[0] instanceof Se)
         return e[0].clone();
       if (typeof e[0] == "string")
-        return i(this, qt).call(this, e[0]);
+        return i(this, zt).call(this, e[0]);
       throw new Error("Invalid value");
     }
     if (e.length === 2) {
       const [t, s] = e;
-      if (t instanceof Ie && s instanceof Ie) {
+      if (t instanceof Se && s instanceof Se) {
         if (t.dimension !== s.dimension)
           throw new Error("Vectors must have the same dimension");
-        return h(this, D, s.array.map((r, n) => r.clone().subtract(t.array[n]))), this;
+        return h(this, V, s.array.map((r, n) => r.clone().subtract(t.array[n]))), this;
       }
     }
-    return h(this, D, e.map((t) => new c(t))), this;
+    return h(this, V, e.map((t) => new c(t))), this;
   }
   clone() {
-    const e = new Ie();
+    const e = new Se();
     return e.array = this.copy(), e.asPoint = this.asPoint, e;
   }
   copy() {
-    return i(this, D).map((e) => e.clone());
+    return i(this, V).map((e) => e.clone());
   }
   middleOf(e, t) {
     if (e.dimension !== t.dimension)
@@ -2540,7 +2722,7 @@ const Ie = class Ie {
   cross(e) {
     if (this.dimension !== 3 || e.dimension !== 3)
       throw new Error("Cross product can only be determined in 3D");
-    return new Ie(
+    return new Se(
       this.y.clone().multiply(e.z).subtract(this.z.clone().multiply(e.y)),
       this.z.clone().multiply(e.x).subtract(this.x.clone().multiply(e.z)),
       this.x.clone().multiply(e.y).subtract(this.y.clone().multiply(e.x))
@@ -2553,7 +2735,7 @@ const Ie = class Ie {
     return this.array.every((e, t) => t === 0 ? e.isOne() : e.isZero());
   }
   distanceTo(e) {
-    const t = new Ie(this, e);
+    const t = new Se(this, e);
     return {
       value: t.norm,
       fraction: t.normSquare,
@@ -2561,39 +2743,39 @@ const Ie = class Ie {
     };
   }
 };
-D = new WeakMap(), Be = new WeakMap(), qt = new WeakMap();
-let O = Ie;
-function ni(o = 0.5) {
+V = new WeakMap(), ze = new WeakMap(), zt = new WeakMap();
+let x = Se;
+function gi(o = 0.5) {
   return Math.random() < o;
 }
-function fe(o, e, t) {
+function de(o, e, t) {
   if (e === void 0)
-    return o >= 0 ? fe(0, o) : fe(o, 0);
+    return o >= 0 ? de(0, o) : de(o, 0);
   if (o === e)
     return o;
   if (t === void 0)
     return Math.floor(Math.random() * (e - o + 1) + o);
   if (Math.abs(e - o) <= t.length)
     throw new Error("The number of excluded values is too high.");
-  let s = fe(o, e);
+  let s = de(o, e);
   for (; t.includes(s); )
-    s = fe(o, e);
+    s = de(o, e);
   return s;
 }
-function W(o, e) {
-  return e === !1 ? ni() ? fe(1, o) : -fe(1, o) : fe(-o, o);
+function X(o, e) {
+  return e === !1 ? gi() ? de(1, o) : -de(1, o) : de(-o, o);
 }
-function Ri(o) {
-  let e = j.primes();
-  return o !== void 0 && (e = e.filter((t) => t < o)), Gt(e);
+function Wi(o) {
+  let e = G.primes();
+  return o !== void 0 && (e = e.filter((t) => t < o)), ti(e);
 }
-function Si(o, e) {
-  return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : oi(o).slice(0, e);
+function Hi(o, e) {
+  return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : yi(o).slice(0, e);
 }
-function Gt(o) {
-  return o.length === 0 ? null : o[fe(0, o.length - 1)];
+function ti(o) {
+  return o.length === 0 ? null : o[de(0, o.length - 1)];
 }
-function oi(o) {
+function yi(o) {
   const e = Object.values(o);
   for (let t = e.length - 1; t > 0; t--) {
     const s = Math.floor(Math.random() * (t + 1)), r = e[t];
@@ -2601,13 +2783,13 @@ function oi(o) {
   }
   return e;
 }
-class G extends O {
+class D extends x {
   constructor(...e) {
     super(), e.length > 0 && this.parse(...e);
   }
   parse(...e) {
     if (this.asPoint = !0, e.length === 0) {
-      if (e[0] instanceof O)
+      if (e[0] instanceof x)
         return this.array = e[0].copy(), this;
       if (typeof e[0] == "string") {
         const t = e[0].replaceAll("(", "").replaceAll(")", "").split(",").map((s) => new c(s));
@@ -2617,7 +2799,7 @@ class G extends O {
       }
     }
     if (e.length > 1) {
-      if (e.some((s) => s instanceof O))
+      if (e.some((s) => s instanceof x))
         throw new Error("Creating a point with  multiple argument requires an input fraction");
       const t = e.map((s) => new c(s));
       if (t.some((s) => s.isNaN()))
@@ -2627,33 +2809,33 @@ class G extends O {
     return this;
   }
   clone() {
-    const e = new G();
+    const e = new D();
     return e.array = this.copy(), e.asPoint = !0, e;
   }
 }
-var hi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(hi || {}), Ae, R, S, F, se, H, qe, we;
-const Re = class Re {
+var wi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(wi || {}), Ce, B, R, U, ne, Y, $e, ve;
+const Le = class Le {
   /**
    * Value can be a mix of:
    *
    * @param values
    */
   constructor(...e) {
-    d(this, Ae);
+    f(this, Ce);
     // ax + by + c = 0
-    d(this, R);
-    d(this, S);
-    d(this, F);
-    d(this, se);
-    d(this, H);
-    d(this, qe);
-    d(this, we, "canonical");
-    a(this, "randomPoint", (e) => i(this, H).clone().multiplyByScalar(W(e === void 0 || e <= 1 ? 3 : e, !1)).add(i(this, se)));
+    f(this, B);
+    f(this, R);
+    f(this, U);
+    f(this, ne);
+    f(this, Y);
+    f(this, $e);
+    f(this, ve, "canonical");
+    a(this, "randomPoint", (e) => i(this, Y).clone().multiplyByScalar(X(e === void 0 || e <= 1 ? 3 : e, !1)).add(i(this, ne)));
     a(this, "randomNearPoint", (e) => {
       const t = this.randomPoint(e);
       let s = 10;
       for (; this.isOnLine(t) && s > 0; )
-        t.x.add(W(1, !1)), t.y.add(W(1, !1)), s--;
+        t.x.add(X(1, !1)), t.y.add(X(1, !1)), s--;
       return t;
     });
     // ------------------------------------------
@@ -2668,42 +2850,43 @@ const Re = class Re {
       if (e.length === 0)
         return this;
       if (e.length === 1) {
-        if (e[0] instanceof Re)
+        if (e[0] instanceof Le)
           return e[0].clone();
-        if (e[0] instanceof ce)
-          return this.parseEquation(e[0]);
+        if (e[0] instanceof H)
+          return this.fromEquation(e[0]);
         if (typeof e[0] == "string")
           try {
-            const t = new ce(e[0]);
+            const t = new H(e[0]);
             return this.parse(t);
           } catch {
             return this;
           }
       }
-      if (e.length === 2) {
-        if (e[0] instanceof G && e[1] instanceof O)
-          return this.parseByPointAndVector(e[0], e[1]);
-        if (e[0] instanceof G && e[1] instanceof G)
-          return this.parseByPointAndVector(e[0], new O(e[0], e[1]));
+      if (e.length === 2 && e.every((t) => t instanceof x)) {
+        const t = e;
+        if (t[0].asPoint && t[1].asPoint)
+          return this.fromPointAndDirection(t[0], new x(t[0], t[1]));
+        if (t[0].asPoint && !t[1].asPoint)
+          return this.fromPointAndDirection(t[0], t[1]);
       }
       if (e.length === 3) {
-        if (e[0] instanceof O && e[1] instanceof O) {
+        if (e[0] instanceof x && e[1] instanceof x) {
           if (e[2] === "perpendicular")
-            return this.parseByPointAndNormal(e[0], e[1]);
+            return this.fromPointAndNormal(e[0], e[1]);
           if (e[2] === "parallel")
-            return this.parseByPointAndVector(e[0], e[1]);
+            return this.fromPointAndDirection(e[0], e[1]);
         }
-        return e[0] instanceof O && e[1] instanceof Re ? e[2] === "parallel" || e[2] === null ? this.parseByPointAndLine(
+        return e[0] instanceof x && e[1] instanceof Le ? e[2] === "parallel" || e[2] === null ? this.fromPointAndLine(
           e[0],
           e[1],
           "parallel"
           /* Parallel */
-        ) : this.parseByPointAndLine(
+        ) : this.fromPointAndLine(
           e[0],
           e[1],
           "perpendicular"
           /* Perpendicular */
-        ) : this.parseByCoefficient(
+        ) : this.fromCoefficient(
           e[0],
           e[1],
           e[2]
@@ -2711,51 +2894,51 @@ const Re = class Re {
       }
       return console.log("Something wrong happened while creating the line"), this;
     });
-    a(this, "parseEquation", (e) => {
+    a(this, "fromEquation", (e) => {
       e.reorder(!0);
       const t = new Set(e.letters());
       if (!(t.has("x") || t.has("y")))
         return this;
       for (const s of ["x", "y"])
         t.has(s) && t.delete(s);
-      return t.size > 0 ? this : this.parseByCoefficient(e.left.monomByLetter("x").coefficient, e.left.monomByLetter("y").coefficient, e.left.monomByDegree(0).coefficient);
+      return t.size > 0 ? this : this.fromCoefficient(e.left.monomByLetter("x").coefficient, e.left.monomByLetter("y").coefficient, e.left.monomByDegree(0).coefficient);
     });
-    a(this, "parseByCoefficient", (e, t, s) => (h(this, R, new c(e)), h(this, S, new c(t)), h(this, F, new c(s)), h(this, H, new O(i(this, S).clone(), i(this, R).clone().opposite())), h(this, se, new O(new c().zero(), i(this, F).clone())), h(this, qe, i(this, H).clone().normal()), this));
-    a(this, "parseByPointAndVector", (e, t) => (this.parseByCoefficient(
+    a(this, "fromCoefficient", (e, t, s) => (h(this, B, new c(e)), h(this, R, new c(t)), h(this, U, new c(s)), h(this, Y, new x(i(this, R).clone(), i(this, B).clone().opposite())), h(this, ne, new x(new c().zero(), i(this, U).clone())), h(this, $e, i(this, Y).clone().normal()), this));
+    a(this, "fromPointAndDirection", (e, t) => (this.fromCoefficient(
       t.y,
       t.x.clone().opposite(),
       e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)).opposite()
-    ), h(this, se, e.clone()), h(this, H, t.clone()), h(this, qe, i(this, H).clone().normal()), this));
-    a(this, "parseByPointAndNormal", (e, t) => this.parseByCoefficient(
+    ), h(this, ne, e.clone()), h(this, Y, t.clone()), h(this, $e, i(this, Y).clone().normal()), this));
+    a(this, "fromPointAndNormal", (e, t) => this.fromCoefficient(
       t.x,
       t.y,
       e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposite()
     ));
-    a(this, "parseByPointAndLine", (e, t, s) => (s === void 0 && (s = "parallel"), s === "parallel" ? this.parseByPointAndNormal(e, t.normal) : s === "perpendicular" ? this.parseByPointAndNormal(e, t.director) : this));
-    a(this, "clone", () => (h(this, R, i(this, R).clone()), h(this, S, i(this, S).clone()), h(this, F, i(this, F).clone()), h(this, H, i(this, H).clone()), h(this, se, i(this, se).clone()), h(this, qe, i(this, qe).clone()), this));
+    a(this, "fromPointAndLine", (e, t, s) => (s === void 0 && (s = "parallel"), s === "parallel" ? this.fromPointAndNormal(e, t.normal) : s === "perpendicular" ? this.fromPointAndNormal(e, t.director) : this));
+    a(this, "clone", () => (h(this, B, i(this, B).clone()), h(this, R, i(this, R).clone()), h(this, U, i(this, U).clone()), h(this, Y, i(this, Y).clone()), h(this, ne, i(this, ne).clone()), h(this, $e, i(this, $e).clone()), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
-    a(this, "isOnLine", (e) => i(this, R).clone().multiply(e.x).add(
-      i(this, S).clone().multiply(e.y)
-    ).add(i(this, F)).isZero());
+    a(this, "isOnLine", (e) => i(this, B).clone().multiply(e.x).add(
+      i(this, R).clone().multiply(e.y)
+    ).add(i(this, U)).isZero());
     a(this, "isParallelTo", (e) => this.slope.isEqual(e.slope) && this.height.isNotEqual(e.height));
     a(this, "isSameAs", (e) => this.slope.isEqual(e.slope) && this.height.isEqual(e.height));
     a(this, "isPerpendicularTo", (e) => this.d.isNormalTo(e.d));
     a(this, "isVertical", () => this.slope.isInfinity());
     a(this, "simplify", () => {
-      const e = j.lcm(i(this, R).denominator, i(this, S).denominator, i(this, F).denominator), t = j.gcd(i(this, R).numerator, i(this, S).numerator, i(this, F).numerator);
-      return this.parseByCoefficient(
+      const e = G.lcm(i(this, B).denominator, i(this, R).denominator, i(this, U).denominator), t = G.gcd(i(this, B).numerator, i(this, R).numerator, i(this, U).numerator);
+      return this.fromCoefficient(
+        i(this, B).clone().multiply(e).divide(t),
         i(this, R).clone().multiply(e).divide(t),
-        i(this, S).clone().multiply(e).divide(t),
-        i(this, F).clone().multiply(e).divide(t)
+        i(this, U).clone().multiply(e).divide(t)
       ), this;
     });
-    a(this, "simplifyDirection", () => (i(this, H).simplify(), this));
+    a(this, "simplifyDirection", () => (i(this, Y).simplify(), this));
     a(this, "intersection", (e) => {
-      const t = new O();
+      const t = new x();
       let s = !1, r = !1;
-      return i(this, S).isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new c().invalid(), t.y = new c().invalid(), s = !0) : this.isSameAs(e) ? (t.x = new c().invalid(), t.y = new c().invalid(), r = !0) : (t.x = i(this, S).clone().multiply(e.c).subtract(i(this, F).clone().multiply(e.b)).divide(i(this, R).clone().multiply(e.b).subtract(i(this, S).clone().multiply(e.a))), t.y = i(this, R).clone().multiply(e.c).subtract(i(this, F).clone().multiply(e.a)).divide(i(this, S).clone().multiply(e.a).subtract(i(this, R).clone().multiply(e.b)))), {
+      return i(this, R).isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new c().invalid(), t.y = new c().invalid(), s = !0) : this.isSameAs(e) ? (t.x = new c().invalid(), t.y = new c().invalid(), r = !0) : (t.x = i(this, R).clone().multiply(e.c).subtract(i(this, U).clone().multiply(e.b)).divide(i(this, B).clone().multiply(e.b).subtract(i(this, R).clone().multiply(e.a))), t.y = i(this, B).clone().multiply(e.c).subtract(i(this, U).clone().multiply(e.a)).divide(i(this, R).clone().multiply(e.a).subtract(i(this, B).clone().multiply(e.b)))), {
         point: t,
         hasIntersection: !(s || r),
         isParallel: s,
@@ -2764,53 +2947,53 @@ const Re = class Re {
     });
     a(this, "getValueAtX", (e) => {
       const t = this.getEquation().isolate("y"), s = new c(e);
-      return t instanceof ce ? t.right.evaluate({ x: s }) : new c().invalid();
+      return t instanceof H ? t.right.evaluate({ x: s }) : new c().invalid();
     });
     a(this, "getValueAtY", (e) => {
       const t = this.getEquation().isolate("x"), s = new c(e);
-      return t instanceof ce ? t.right.evaluate({ y: s }) : new c().invalid();
+      return t instanceof H ? t.right.evaluate({ y: s }) : new c().invalid();
     });
-    return h(this, R, new c().zero()), h(this, S, new c().zero()), h(this, F, new c().zero()), h(this, se, new O()), h(this, H, new O()), h(this, qe, new O()), h(this, Ae, !0), e.length > 0 && this.parse(...e), this;
+    return h(this, B, new c().zero()), h(this, R, new c().zero()), h(this, U, new c().zero()), h(this, ne, new x()), h(this, Y, new x()), h(this, $e, new x()), h(this, Ce, !0), e.length > 0 && this.parse(...e), this;
   }
   get a() {
-    return i(this, R);
+    return i(this, B);
   }
   // ------------------------------------------
   // Getter and setter
   set a(e) {
-    h(this, R, e);
+    h(this, B, e);
   }
   get b() {
-    return i(this, S);
+    return i(this, R);
   }
   set b(e) {
-    h(this, S, e);
+    h(this, R, e);
   }
   get c() {
-    return i(this, F);
+    return i(this, U);
   }
   set c(e) {
-    h(this, F, e);
+    h(this, U, e);
   }
   get OA() {
-    return i(this, se);
+    return i(this, ne);
   }
   set OA(e) {
-    h(this, se, e);
+    h(this, ne, e);
   }
   get d() {
-    return i(this, H);
+    return i(this, Y);
   }
   set d(e) {
-    h(this, H, e);
+    h(this, Y, e);
   }
   get n() {
-    return i(this, qe);
+    return i(this, $e);
   }
   // ------------------------------------------
   getEquation() {
-    const e = new ce(new I().parse("xy", i(this, R), i(this, S), i(this, F)), new I("0"));
-    return i(this, Ae) ? e.simplify() : e;
+    const e = new H(new T().parse("xy", i(this, B), i(this, R), i(this, U)), new T("0"));
+    return i(this, Ce) ? e.simplify() : e;
   }
   // get system(): { x: Equation, y: Equation } {
   //     const e1 = new Equation(
@@ -2826,78 +3009,81 @@ const Re = class Re {
   //     return { x: e1, y: e2 }
   // }
   get canonical() {
-    return h(this, we, "canonical"), this;
+    return h(this, ve, "canonical"), this;
   }
   get equation() {
-    return h(this, we, "equation"), this;
+    return h(this, ve, "equation"), this;
   }
   get mxh() {
-    return h(this, we, "mxh"), this;
+    return h(this, ve, "mxh"), this;
   }
   get parametric() {
-    return h(this, we, "parametric"), this;
+    return h(this, ve, "parametric"), this;
   }
   get system() {
-    return h(this, we, "system"), this;
+    return h(this, ve, "system"), this;
   }
   get tex() {
-    const e = i(this, we);
-    switch (h(this, we, "canonical"), e) {
+    const e = i(this, ve);
+    switch (h(this, ve, "canonical"), e) {
       case "equation":
         return this.getEquation().reorder().tex;
       case "mxh":
-        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new I().parse("x", this.slope, this.height).tex;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new T().parse("x", this.slope, this.height).tex;
       case "parametric":
       case "system": {
-        const t = i(this, H).clone();
-        return i(this, Ae) && t.simplify(), e === "parametric" ? `${O.asTex("x", "y")} = ${O.asTex(i(this, se).x.tex, i(this, se).y.tex)} + k\\cdot ${O.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
-            x &= ${new I(i(this, se).x).add(new M(i(this, H).x).multiply(new M("k"))).reorder("k", !0).tex}\\\\ 
-            y &= ${new I(i(this, se).y).add(new M(i(this, H).y).multiply(new M("k"))).reorder("k", !0).tex}
+        const t = i(this, Y).clone();
+        return i(this, Ce) && t.simplify(), e === "parametric" ? `${x.asTex("x", "y")} = ${x.asTex(i(this, ne).x.tex, i(this, ne).y.tex)} + k\\cdot ${x.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
+            x &= ${new T(i(this, ne).x).add(new I(i(this, Y).x).multiply(new I("k"))).reorder("k", !0).tex}\\\\ 
+            y &= ${new T(i(this, ne).y).add(new I(i(this, Y).y).multiply(new I("k"))).reorder("k", !0).tex}
             \\end{aligned}\\right.`;
       }
       default: {
         const t = this.getEquation();
-        return i(this, R).isNegative() && t.multiply(-1), t.tex;
+        return i(this, B).isNegative() && t.multiply(-1), t.tex;
       }
     }
   }
   get reduceBeforeDisplay() {
-    return i(this, Ae);
+    return i(this, Ce);
   }
   set reduceBeforeDisplay(e) {
-    h(this, Ae, e);
+    h(this, Ce, e);
   }
   get display() {
-    const e = i(this, we);
-    switch (h(this, we, "canonical"), e) {
+    const e = i(this, ve);
+    switch (h(this, ve, "canonical"), e) {
       case "equation":
         return this.getEquation().reorder().display;
       case "mxh":
-        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new I().parse("x", this.slope, this.height).display;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new T().parse("x", this.slope, this.height).display;
       case "parametric": {
-        const t = i(this, H).clone();
-        return i(this, Ae) && t.simplify(), `((x,y))=((${i(this, se).x.display},${i(this, se).y.display}))+k((${t.x.display},${t.y.display}))`;
+        const t = i(this, Y).clone();
+        return i(this, Ce) && t.simplify(), `((x,y))=((${i(this, ne).x.display},${i(this, ne).y.display}))+k((${t.x.display},${t.y.display}))`;
       }
       default: {
         const t = this.getEquation();
-        return i(this, R).isNegative() && t.multiply(-1), t.display;
+        return i(this, B).isNegative() && t.multiply(-1), t.display;
       }
     }
   }
   get normal() {
-    return new O(i(this, R), i(this, S));
+    return new x(i(this, B), i(this, R));
   }
   get director() {
-    return i(this, H).clone();
+    return i(this, Y).clone();
   }
   get slope() {
-    return i(this, R).clone().opposite().divide(i(this, S));
+    return i(this, B).clone().opposite().divide(i(this, R));
   }
   get height() {
-    return i(this, F).clone().opposite().divide(i(this, S));
+    return i(this, U).clone().opposite().divide(i(this, R));
+  }
+  fromPoints(e, t) {
+    return this.fromPointAndDirection(e, new x(e, t));
   }
   distanceTo(e) {
-    const t = e.x.clone().multiply(i(this, R)).add(e.y.clone().multiply(i(this, S))).add(i(this, F)).abs(), s = this.normal.normSquare;
+    const t = e.x.clone().multiply(i(this, B)).add(e.y.clone().multiply(i(this, R))).add(i(this, U)).abs(), s = this.normal.normSquare;
     if (s.isZero())
       return {
         value: NaN,
@@ -2917,7 +3103,7 @@ const Re = class Re {
   }
   hitSegment(e, t) {
     const s = this.intersection(
-      new Re(e, t)
+      new Le(e, t)
     );
     return s.hasIntersection ? s.point.x.value >= Math.min(e.x.value, t.x.value) && s.point.x.value <= Math.max(e.x.value, t.x.value) && s.point.y.value >= Math.min(e.y.value, t.y.value) && s.point.y.value <= Math.max(e.y.value, t.y.value) : !1;
   }
@@ -2927,88 +3113,88 @@ const Re = class Re {
   canonicalAsFloatCoefficient(e) {
     e === void 0 && (e = 2);
     let t = "";
-    return i(this, R).isZero() || (i(this, R).isOne() ? t = "x" : i(this, R).clone().opposite().isOne() ? t = "-x" : t = i(this, R).value.toFixed(e) + "x"), i(this, S).isZero() || (i(this, S).isPositive() && (t += "+"), t += i(this, S).value.toFixed(e) + "y"), i(this, F).isZero() || (i(this, F).isPositive() && (t += "+"), t += i(this, F).value.toFixed(e)), t + "=0";
+    return i(this, B).isZero() || (i(this, B).isOne() ? t = "x" : i(this, B).clone().opposite().isOne() ? t = "-x" : t = i(this, B).value.toFixed(e) + "x"), i(this, R).isZero() || (i(this, R).isPositive() && (t += "+"), t += i(this, R).value.toFixed(e) + "y"), i(this, U).isZero() || (i(this, U).isPositive() && (t += "+"), t += i(this, U).value.toFixed(e)), t + "=0";
   }
 };
-Ae = new WeakMap(), R = new WeakMap(), S = new WeakMap(), F = new WeakMap(), se = new WeakMap(), H = new WeakMap(), qe = new WeakMap(), we = new WeakMap(), // A line is defined as the canonical form
-a(Re, "PERPENDICULAR", "perpendicular"), a(Re, "PARALLEL", "parallel");
-let V = Re;
-var re, Z, Oe, Mt, It, Ct, ne, ai, lt, li, ci, ui, Vt;
-const $t = class $t {
+Ce = new WeakMap(), B = new WeakMap(), R = new WeakMap(), U = new WeakMap(), ne = new WeakMap(), Y = new WeakMap(), $e = new WeakMap(), ve = new WeakMap(), // A line is defined as the canonical form
+a(Le, "PERPENDICULAR", "perpendicular"), a(Le, "PARALLEL", "parallel");
+let j = Le;
+var oe, F, qe, kt, Lt, Dt, he, vi, mt, bi, xi, Ei, Kt;
+const Zt = class Zt {
   constructor(...e) {
-    d(this, ne);
-    d(this, re);
-    d(this, Z);
-    d(this, Oe);
+    f(this, he);
+    f(this, oe);
+    f(this, F);
+    f(this, qe);
     /**
      * Get the relative position between circle and line. It corresponds to the number of intersection.
      * @param {Line} L
      * @returns {number}
      */
     a(this, "relativePosition", (e) => {
-      if (i(this, re) === void 0 || i(this, Z) === void 0)
+      if (i(this, oe) === void 0 || i(this, F) === void 0)
         throw new Error("Circle not defined");
-      const t = e.distanceTo(i(this, re)), s = Math.sqrt(i(this, Z).value);
+      const t = e.distanceTo(i(this, oe)), s = Math.sqrt(i(this, F).value);
       return t.value - s > 1e-10 ? 0 : Math.abs(t.value - s) < 1e-10 ? 1 : 2;
     });
     a(this, "lineIntersection", (e) => {
       const t = [];
-      if (i(this, Oe) === void 0)
+      if (i(this, qe) === void 0)
         return [];
-      const s = i(this, Oe).clone(), r = e.getEquation().clone().isolate("x"), n = e.getEquation().clone().isolate("y");
-      return r instanceof ce && n instanceof ce && (s.replaceBy("y", n.right).simplify(), s.solve()), t;
+      const s = i(this, qe).clone(), r = e.getEquation().clone().isolate("x"), n = e.getEquation().clone().isolate("y");
+      return r instanceof H && n instanceof H && (s.replaceBy("y", n.right).simplify(), s.solve()), t;
     });
-    a(this, "tangents", (e) => e instanceof c ? i(this, Ct).call(this, e) : this.isPointOnCircle(e) ? i(this, Mt).call(this, e) : i(this, re) !== void 0 && i(this, re).distanceTo(e).value > this.radius.value ? (i(this, It).call(this, e), []) : (console.log("No tangents as the point is inside !"), []));
+    a(this, "tangents", (e) => e instanceof c ? i(this, Dt).call(this, e) : this.isPointOnCircle(e) ? i(this, kt).call(this, e) : i(this, oe) !== void 0 && i(this, oe).distanceTo(e).value > this.radius.value ? (i(this, Lt).call(this, e), []) : (console.log("No tangents as the point is inside !"), []));
     a(this, "isPointOnCircle", (e) => {
       var t;
-      return ((t = i(this, Oe)) == null ? void 0 : t.test({ x: e.x, y: e.y })) ?? !1;
+      return ((t = i(this, qe)) == null ? void 0 : t.test({ x: e.x, y: e.y })) ?? !1;
     });
     a(this, "getPointsOnCircle", (e) => {
-      const t = j.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), s = [];
+      const t = G.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), s = [];
       return t.forEach((r) => {
         for (const n of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
           s.push(
-            new G(
+            new D(
               this.center.x.clone().add(n[0] * r[0]),
               this.center.y.clone().add(n[1] * r[1])
             )
           );
       }), s;
     });
-    d(this, Mt, (e) => {
-      const t = new G(this.center, e);
-      return [new V(e, t, hi.Perpendicular)];
+    f(this, kt, (e) => {
+      const t = new D(this.center, e);
+      return [new j(e, t, wi.Perpendicular)];
     });
-    d(this, It, (e) => {
-      const t = this.center.x.clone().subtract(e.x), s = this.center.y.clone().subtract(e.y), r = new I("x"), n = new I("x^2+1");
-      r.multiply(t).subtract(s).pow(2), n.multiply(this.squareRadius), new ce(r, n).moveLeft().simplify().solve();
+    f(this, Lt, (e) => {
+      const t = this.center.x.clone().subtract(e.x), s = this.center.y.clone().subtract(e.y), r = new T("x"), n = new T("x^2+1");
+      r.multiply(t).subtract(s).pow(2), n.multiply(this.squareRadius), new H(r, n).moveLeft().simplify().solve();
     });
-    d(this, Ct, (e) => {
-      const t = e.numerator, s = -e.denominator, r = this.center.x.clone(), n = this.center.y.clone(), l = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), u = r.clone().multiply(t).opposite().subtract(n.clone().multiply(s)).add(l.clone().sqrt()), b = r.clone().multiply(t).opposite().subtract(n.clone().multiply(s)).subtract(l.clone().sqrt());
-      return [new V(t, s, u), new V(t, s, b)];
+    f(this, Dt, (e) => {
+      const t = e.numerator, s = -e.denominator, r = this.center.x.clone(), n = this.center.y.clone(), l = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), u = r.clone().multiply(t).opposite().subtract(n.clone().multiply(s)).add(l.clone().sqrt()), p = r.clone().multiply(t).opposite().subtract(n.clone().multiply(s)).subtract(l.clone().sqrt());
+      return [new j(t, s, u), new j(t, s, p)];
     });
     e.length > 0 && this.parse(...e);
   }
   get center() {
-    return i(this, re) ?? new G();
+    return i(this, oe) ?? new D();
   }
   get squareRadius() {
-    return i(this, Z) ?? new c(0);
+    return i(this, F) ?? new c(0);
   }
   get cartesian() {
-    if (i(this, Oe) === void 0)
+    if (i(this, qe) === void 0)
       throw new Error("Cartesian equation not defined");
-    return i(this, Oe);
+    return i(this, qe);
   }
   get radius() {
-    return i(this, Z) === void 0 ? { tex: "", display: "", value: 0 } : i(this, Z).isSquare() ? {
-      tex: i(this, Z).clone().sqrt().tex,
-      display: i(this, Z).clone().sqrt().display,
-      value: i(this, Z).clone().sqrt().value
+    return i(this, F) === void 0 ? { tex: "", display: "", value: 0 } : i(this, F).isSquare() ? {
+      tex: i(this, F).clone().sqrt().tex,
+      display: i(this, F).clone().sqrt().display,
+      value: i(this, F).clone().sqrt().value
     } : {
-      tex: `\\sqrt{${i(this, Z).tex}}`,
-      display: `sqrt(${i(this, Z).display})`,
-      value: i(this, Z).clone().sqrt().value
+      tex: `\\sqrt{${i(this, F).tex}}`,
+      display: `sqrt(${i(this, F).display})`,
+      value: i(this, F).clone().sqrt().value
     };
   }
   get tex() {
@@ -3023,17 +3209,17 @@ const $t = class $t {
     return this.center.x.isZero() ? e = "x^2" : e = `(x${this.center.x.isNegative() ? "+" : "-"}${this.center.x.clone().abs().tex})^2`, this.center.y.isZero() ? t = "y^2" : t = `(y${this.center.y.isNegative() ? "+" : "-"}${this.center.y.clone().abs().tex})^2`, `${e}+${t}=${this.squareRadius.display}`;
   }
   clone() {
-    return new $t(
+    return new Zt(
       this.center.clone(),
       this.squareRadius.clone(),
       !0
     );
   }
   setRadius(e, t) {
-    return t ? h(this, Z, new c(e)) : h(this, Z, new c(e).pow(2)), q(this, ne, lt).call(this), this;
+    return t ? h(this, F, new c(e)) : h(this, F, new c(e).pow(2)), M(this, he, mt).call(this), this;
   }
   parse(...e) {
-    return q(this, ne, ai).call(this), typeof e[0] == "string" ? q(this, ne, Vt).call(this, new ce(e[0])) : e[0] instanceof ce ? q(this, ne, Vt).call(this, e[0]) : e[0] instanceof $t ? q(this, ne, li).call(this, e[0]) : e[0] instanceof G && e.length > 1 && (e[1] instanceof G ? e[2] instanceof G || q(this, ne, ui).call(this, e[0], e[1]) : (e[1] instanceof c || typeof e[1] == "number") && q(this, ne, ci).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), q(this, ne, lt).call(this), this;
+    return M(this, he, vi).call(this), typeof e[0] == "string" ? M(this, he, Kt).call(this, new H(e[0])) : e[0] instanceof H ? M(this, he, Kt).call(this, e[0]) : e[0] instanceof Zt ? M(this, he, bi).call(this, e[0]) : e[0] instanceof D && e.length > 1 && (e[1] instanceof D ? e[2] instanceof D || M(this, he, Ei).call(this, e[0], e[1]) : (e[1] instanceof c || typeof e[1] == "number") && M(this, he, xi).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), M(this, he, mt).call(this), this;
   }
   // private _parseThroughtThreePoints(A: Point, B: Point, C: Point): this {
   //     const T = new Triangle(A, B, C), mAB = T.remarquables.mediators.AB.clone(),
@@ -3042,37 +3228,37 @@ const $t = class $t {
   //     return this
   // }
 };
-re = new WeakMap(), Z = new WeakMap(), Oe = new WeakMap(), Mt = new WeakMap(), It = new WeakMap(), Ct = new WeakMap(), ne = new WeakSet(), ai = function() {
-  return h(this, re, void 0), h(this, Z, void 0), h(this, Oe, void 0), this;
-}, lt = function() {
-  h(this, Oe, new ce(
-    new I(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
-    new I(this.squareRadius.display)
+oe = new WeakMap(), F = new WeakMap(), qe = new WeakMap(), kt = new WeakMap(), Lt = new WeakMap(), Dt = new WeakMap(), he = new WeakSet(), vi = function() {
+  return h(this, oe, void 0), h(this, F, void 0), h(this, qe, void 0), this;
+}, mt = function() {
+  h(this, qe, new H(
+    new T(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
+    new T(this.squareRadius.display)
   ).moveLeft());
-}, li = function(e) {
-  return h(this, re, e.center.clone()), h(this, Z, e.squareRadius.clone()), q(this, ne, lt).call(this), this;
-}, ci = function(e, t, s) {
-  return h(this, re, e.clone()), s ? h(this, Z, new c(t)) : h(this, Z, new c(t).pow(2)), this;
-}, ui = function(e, t) {
-  return h(this, re, e.clone()), h(this, Z, new O(i(this, re), t).normSquare), this;
-}, Vt = function(e) {
+}, bi = function(e) {
+  return h(this, oe, e.center.clone()), h(this, F, e.squareRadius.clone()), M(this, he, mt).call(this), this;
+}, xi = function(e, t, s) {
+  return h(this, oe, e.clone()), s ? h(this, F, new c(t)) : h(this, F, new c(t).pow(2)), this;
+}, Ei = function(e, t) {
+  return h(this, oe, e.clone()), h(this, F, new x(i(this, oe), t).normSquare), this;
+}, Kt = function(e) {
   if (e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
     const t = e.left.monomByDegree(2, "x"), s = e.left.monomByDegree(2, "y");
     let r, n, l;
-    t.coefficient.isEqual(s.coefficient) ? (e.divide(t.coefficient), r = e.left.monomByDegree(1, "x"), n = e.left.monomByDegree(1, "y"), l = e.left.monomByDegree(0), h(this, re, new G(r.coefficient.clone().divide(2).opposite(), n.coefficient.clone().divide(2).opposite())), h(this, Z, l.coefficient.clone().opposite().add(i(this, re).x.clone().pow(2)).add(i(this, re).y.clone().pow(2)))) : (h(this, re, void 0), h(this, Z, void 0));
+    t.coefficient.isEqual(s.coefficient) ? (e.divide(t.coefficient), r = e.left.monomByDegree(1, "x"), n = e.left.monomByDegree(1, "y"), l = e.left.monomByDegree(0), h(this, oe, new D(r.coefficient.clone().divide(2).opposite(), n.coefficient.clone().divide(2).opposite())), h(this, F, l.coefficient.clone().opposite().add(i(this, oe).x.clone().pow(2)).add(i(this, oe).y.clone().pow(2)))) : (h(this, oe, void 0), h(this, F, void 0));
   }
   return this;
 };
-let ut = $t;
-var X, K, J, We, Te, rt, Bt, nt, Me, Pt, He;
-const Rt = class Rt {
+let yt = Zt;
+var Q, _, ee, Je, Te, ct, Vt, ut, Pe, Ft, _e;
+const jt = class jt {
   constructor(...e) {
-    d(this, X);
-    d(this, K);
-    d(this, J);
-    d(this, We);
-    d(this, Te);
-    d(this, rt);
+    f(this, Q);
+    f(this, _);
+    f(this, ee);
+    f(this, Je);
+    f(this, Te);
+    f(this, ct);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
@@ -3089,45 +3275,45 @@ const Rt = class Rt {
         if (t.some((s) => s.isNaN()))
           throw new Error("One of the values is not a valid number");
         return this.parse(
-          new O(t[0], t[1]),
-          new O(t[2], t[3]),
-          new O(t[4], t[5])
+          new x(t[0], t[1]),
+          new x(t[2], t[3]),
+          new x(t[4], t[5])
         );
       } else if (e.length === 3) {
         if (e.every((t) => typeof t == "string"))
-          return this.parse(...e.map((t) => new V(t)));
-        if (e.every((t) => t instanceof V)) {
+          return this.parse(...e.map((t) => new j(t)));
+        if (e.every((t) => t instanceof j)) {
           const t = e[0].clone(), s = e[1].clone(), r = e[2].clone();
-          h(this, We, { AB: t, BC: s, AC: r });
+          h(this, Je, { AB: t, BC: s, AC: r });
           let n = t.intersection(s);
           if (n.hasIntersection)
-            h(this, K, n.point.clone());
+            h(this, _, n.point.clone());
           else
             throw new Error("Lines do not intersect !");
           if (n = s.intersection(r), n.hasIntersection)
-            h(this, J, n.point.clone());
+            h(this, ee, n.point.clone());
           else
             throw new Error("Lines do not intersect !");
           if (n = r.intersection(t), n.hasIntersection)
-            h(this, X, n.point.clone());
+            h(this, Q, n.point.clone());
           else
             throw new Error("Lines do not intersect !");
-        } else e.every((t) => t instanceof G) && (h(this, X, e[0].clone()), h(this, K, e[1].clone()), h(this, J, e[2].clone()), h(this, We, {
-          AB: new V(i(this, X), i(this, K)),
-          BC: new V(i(this, K), i(this, J)),
-          AC: new V(i(this, X), i(this, J))
+        } else e.every((t) => t instanceof D) && (h(this, Q, e[0].clone()), h(this, _, e[1].clone()), h(this, ee, e[2].clone()), h(this, Je, {
+          AB: new j(i(this, Q), i(this, _)),
+          BC: new j(i(this, _), i(this, ee)),
+          AC: new j(i(this, Q), i(this, ee))
         }));
-      } else if (e.length === 1 && e[0] instanceof Rt)
+      } else if (e.length === 1 && e[0] instanceof jt)
         return e[0].clone();
-      return i(this, Bt).call(this), this;
+      return i(this, Vt).call(this), this;
     });
     /**
      * Clone the Triangle class
      */
-    a(this, "clone", () => new Rt(
-      i(this, X).clone(),
-      i(this, K).clone(),
-      i(this, J).clone()
+    a(this, "clone", () => new jt(
+      i(this, Q).clone(),
+      i(this, _).clone(),
+      i(this, ee).clone()
     ));
     // ------------------------------------------
     // Triangle operations and properties
@@ -3135,79 +3321,79 @@ const Rt = class Rt {
     /**
      * Generate the Line object for the three segments of the triangle
      */
-    d(this, Bt, () => {
+    f(this, Vt, () => {
       h(this, Te, {
-        AB: new G().middleOf(i(this, X), i(this, K)),
-        AC: new G().middleOf(i(this, X), i(this, J)),
-        BC: new G().middleOf(i(this, K), i(this, J))
-      }), h(this, rt, i(this, Pt).call(this));
+        AB: new D().middleOf(i(this, Q), i(this, _)),
+        AC: new D().middleOf(i(this, Q), i(this, ee)),
+        BC: new D().middleOf(i(this, _), i(this, ee))
+      }), h(this, ct, i(this, Ft).call(this));
     });
     /**
      * Get the Vector2D class for the given name
      * @param ptName
      */
-    d(this, nt, (e) => {
+    f(this, ut, (e) => {
       switch (e.toUpperCase()) {
         case "A":
-          return i(this, X);
+          return i(this, Q);
         case "B":
-          return i(this, K);
+          return i(this, _);
         case "C":
-          return i(this, J);
+          return i(this, ee);
       }
-      return i(this, X);
+      return i(this, Q);
     });
     /**
      * Get the vector for the segment given by name.
      * @param ptName1
      * @param ptName2
      */
-    d(this, Me, (e, t) => new O(
-      i(this, nt).call(this, e),
-      i(this, nt).call(this, t)
+    f(this, Pe, (e, t) => new x(
+      i(this, ut).call(this, e),
+      i(this, ut).call(this, t)
     ));
-    d(this, Pt, () => {
+    f(this, Ft, () => {
       const e = {
-        A: new V(i(this, X), i(this, Te).BC),
-        B: new V(i(this, K), i(this, Te).AC),
-        C: new V(i(this, J), i(this, Te).AB),
+        A: new j(i(this, Q), i(this, Te).BC),
+        B: new j(i(this, _), i(this, Te).AC),
+        C: new j(i(this, ee), i(this, Te).AB),
         intersection: null
       }, t = {
-        AB: new V(i(this, Te).AB, new O(i(this, X), i(this, K)).normal()),
-        AC: new V(i(this, Te).AC, new O(i(this, X), i(this, J)).normal()),
-        BC: new V(i(this, Te).BC, new O(i(this, K), i(this, J)).normal()),
+        AB: new j(i(this, Te).AB, new x(i(this, Q), i(this, _)).normal()),
+        AC: new j(i(this, Te).AC, new x(i(this, Q), i(this, ee)).normal()),
+        BC: new j(i(this, Te).BC, new x(i(this, _), i(this, ee)).normal()),
         intersection: null
       }, s = {
-        A: new V(i(this, X), new O(i(this, K), i(this, J)).normal()),
-        B: new V(i(this, K), new O(i(this, X), i(this, J)).normal()),
-        C: new V(i(this, J), new O(i(this, X), i(this, K)).normal()),
+        A: new j(i(this, Q), new x(i(this, _), i(this, ee)).normal()),
+        B: new j(i(this, _), new x(i(this, Q), i(this, ee)).normal()),
+        C: new j(i(this, ee), new x(i(this, Q), i(this, _)).normal()),
         intersection: null
-      }, r = i(this, He).call(this, "A"), n = i(this, He).call(this, "B"), l = i(this, He).call(this, "C"), u = {
+      }, r = i(this, _e).call(this, "A"), n = i(this, _e).call(this, "B"), l = i(this, _e).call(this, "C"), u = {
         A: r.internal,
         B: n.internal,
         C: n.internal,
         intersection: null
-      }, b = {
+      }, p = {
         A: r.external,
         B: n.external,
         C: l.external,
         intersection: null
-      }, p = {
+      }, m = {
         medians: e,
         mediators: t,
         heights: s,
         bisectors: u,
-        externalBisectors: b
+        externalBisectors: p
       };
-      return p.medians.intersection = p.medians.A.intersection(p.medians.B).point, p.mediators.intersection = p.mediators.AB.intersection(p.mediators.BC).point, p.heights.intersection = p.heights.A.intersection(p.heights.B).point, p.bisectors.intersection = p.bisectors.A.intersection(p.bisectors.B).point, p;
+      return m.medians.intersection = m.medians.A.intersection(m.medians.B).point, m.mediators.intersection = m.mediators.AB.intersection(m.mediators.BC).point, m.heights.intersection = m.heights.A.intersection(m.heights.B).point, m.bisectors.intersection = m.bisectors.A.intersection(m.bisectors.B).point, m;
     });
-    d(this, He, (e) => {
+    f(this, _e, (e) => {
       const t = this.lines;
       let s, r;
       if (e === "A" ? (s = t.AB, r = t.AC) : e === "B" ? (s = t.AB, r = t.BC) : e === "C" && (s = t.BC, r = t.AC), s === void 0 || r === void 0)
         throw new Error(`The point ${e} does not exist`);
-      const n = s.n.simplify().norm, l = r.n.simplify().norm, u = s.getEquation().multiply(l), b = r.getEquation().multiply(n), p = new V(u.clone().subtract(b).simplify()), m = new V(b.clone().subtract(u).simplify());
-      return e === "A" ? p.hitSegment(this.B, this.C) ? { internal: p, external: m } : { internal: m, external: p } : e === "B" ? p.hitSegment(this.A, this.C) ? { internal: p, external: m } : { internal: m, external: p } : e === "C" ? p.hitSegment(this.B, this.A) ? { internal: p, external: m } : { internal: m, external: p } : { internal: p, external: m };
+      const n = s.n.simplify().norm, l = r.n.simplify().norm, u = s.getEquation().multiply(l), p = r.getEquation().multiply(n), m = new j(u.clone().subtract(p).simplify()), g = new j(p.clone().subtract(u).simplify());
+      return e === "A" ? m.hitSegment(this.B, this.C) ? { internal: m, external: g } : { internal: g, external: m } : e === "B" ? m.hitSegment(this.A, this.C) ? { internal: m, external: g } : { internal: g, external: m } : e === "C" ? m.hitSegment(this.B, this.A) ? { internal: m, external: g } : { internal: g, external: m } : { internal: m, external: g };
     });
     return e.length > 0 && this.parse(...e), this;
   }
@@ -3215,31 +3401,31 @@ const Rt = class Rt {
   // Getter and setters
   // ------------------------------------------
   get A() {
-    return i(this, X);
+    return i(this, Q);
   }
   get B() {
-    return i(this, K);
+    return i(this, _);
   }
   get C() {
-    return i(this, J);
+    return i(this, ee);
   }
   get AB() {
-    return i(this, Me).call(this, "A", "B");
+    return i(this, Pe).call(this, "A", "B");
   }
   get BA() {
-    return i(this, Me).call(this, "B", "A");
+    return i(this, Pe).call(this, "B", "A");
   }
   get BC() {
-    return i(this, Me).call(this, "B", "C");
+    return i(this, Pe).call(this, "B", "C");
   }
   get CB() {
-    return i(this, Me).call(this, "C", "B");
+    return i(this, Pe).call(this, "C", "B");
   }
   get AC() {
-    return i(this, Me).call(this, "A", "C");
+    return i(this, Pe).call(this, "A", "C");
   }
   get CA() {
-    return i(this, Me).call(this, "C", "A");
+    return i(this, Pe).call(this, "C", "A");
   }
   get isRectangle() {
     return !!(this.AB.isNormalTo(this.BC) || this.AB.isNormalTo(this.AC) || this.BC.isNormalTo(this.AC));
@@ -3251,15 +3437,243 @@ const Rt = class Rt {
     return this.AB.normSquare.isEqual(this.BC.normSquare) || this.AB.normSquare.isEqual(this.AC.normSquare) || this.BC.normSquare.isEqual(this.AC.normSquare);
   }
   get lines() {
-    return i(this, We);
+    return i(this, Je);
   }
   get remarquables() {
-    return i(this, rt);
+    return i(this, ct);
+  }
+};
+Q = new WeakMap(), _ = new WeakMap(), ee = new WeakMap(), Je = new WeakMap(), Te = new WeakMap(), ct = new WeakMap(), Vt = new WeakMap(), ut = new WeakMap(), Pe = new WeakMap(), Ft = new WeakMap(), _e = new WeakMap();
+let Jt = jt;
+var z, W;
+const nt = class nt {
+  constructor(e, t) {
+    // ax + by + c = 0
+    f(this, z, new D());
+    f(this, W, new x());
+    a(this, "clone", () => (h(this, W, i(this, W).clone()), h(this, z, i(this, z).clone()), this));
+    // ------------------------------------------
+    // Mathematical operations
+    // ------------------------------------------
+    a(this, "isOnLine", (e) => !1);
+    a(this, "isParallelTo", (e) => {
+      throw new Error("Method not implemented.");
+    });
+    a(this, "isSameAs", (e) => {
+      throw new Error("Method not implemented.");
+    });
+    a(this, "isPerpendicularTo", (e) => {
+      throw new Error("Method not implemented.");
+    });
+    a(this, "isVertical", () => {
+      throw new Error("Method not implemented.");
+    });
+    a(this, "simplify", () => {
+      throw new Error("Method not implemented.");
+    });
+    a(this, "intersection", (e) => {
+      throw new Error("Method not implemented.");
+    });
+    // getValueAtX = (value: Fraction | number): Fraction => {
+    //     const equ = this.equation.clone().isolate('y'),
+    //         F = new Fraction(value)
+    //     if (equ instanceof Equation) {
+    //         return equ.right.evaluate({ x: F }) as Fraction
+    //     }
+    //     return new Fraction().invalid()
+    // }
+    // getValueAtY = (value: Fraction | number): Fraction => {
+    //     const equ = this.equation.clone().isolate('x'),
+    //         F = new Fraction(value)
+    //     if (equ instanceof Equation) {
+    //         return equ.right.evaluate({ y: F }) as Fraction
+    //     }
+    //     return new Fraction().invalid()
+    // }
+    a(this, "randomPoint", (e = 5) => {
+      const t = i(this, z).clone(), s = new c(X(e, !1));
+      return new D(
+        t.x.clone().add(i(this, W).x.clone().multiply(s)),
+        t.y.clone().add(i(this, W).y.clone().multiply(s)),
+        t.z.clone().add(i(this, W).z.clone().multiply(s))
+      );
+    });
+    return h(this, z, e.clone()), h(this, W, t.asPoint ? new x(e, t) : t.clone()), this;
+  }
+  get OA() {
+    return i(this, z);
+  }
+  set OA(e) {
+    h(this, z, e);
+  }
+  get point() {
+    return i(this, z).clone();
+  }
+  get d() {
+    return i(this, W);
+  }
+  set d(e) {
+    h(this, W, e);
+  }
+  get tex() {
+    return {
+      parametric: `${x.asTex("x", "y", "z")} = ${x.asTex(i(this, z).x.tex, i(this, z).y.tex, i(this, z).z.tex)} + k\\cdot ${x.asTex(i(this, W).x.tex, i(this, W).y.tex, i(this, W).z.tex)}`,
+      system: `\\left\\{\\begin{aligned}
+    x &= ${new T(i(this, z).x).add(new I(i(this, W).x).multiply(new I("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new T(i(this, z).y).add(new I(i(this, W).y).multiply(new I("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new T(i(this, z).z).add(new I(i(this, W).z).multiply(new I("k"))).reorder("k", !0).tex}
+\\end{aligned}\\right.`,
+      cartesian: `\\frac{ ${new T("x", 1, i(this, z).x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new T("y", 1, i(this, z).y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new T("z", 1, i(this, z).z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+    };
+  }
+  get display() {
+    const e = i(this, z).x.display, t = i(this, z).y.display, s = i(this, z).z.display, r = this.direction.simplify(), n = r.x.display, l = r.y.display, u = r.z.display;
+    return {
+      parametric: `${x.asDisplay("x", "y", "z")} = ${x.asDisplay(i(this, z).x.display, i(this, z).y.display, i(this, z).z.display)} + k\\cdot ${x.asDisplay(i(this, W).x.display, i(this, W).y.display, i(this, W).z.display)}`,
+      system: "",
+      cartesian: `(x-${e})/${n} = (y-${t})/${l} = (z-${s})/${u}`
+    };
+  }
+  get direction() {
+    return i(this, W).clone();
+  }
+  distanceTo(e) {
+    const t = new x(i(this, z), e), s = this.direction, r = this.direction.normSquare, n = t.cross(s).normSquare, l = n.clone().divide(r), u = l.clone().sqrt();
+    return console.log("CROSS", t.cross(s).display), {
+      value: Math.sqrt(l.value),
+      fraction: l.clone().sqrt(),
+      tex: u.isExact() ? u.tex : `\\sqrt{${l.tex}}`
+    };
+  }
+  hitSegment(e, t) {
+    const s = this.intersection(
+      new nt(e, t)
+    );
+    return s.hasIntersection ? s.point.x.value >= Math.min(e.x.value, t.x.value) && s.point.x.value <= Math.max(e.x.value, t.x.value) && s.point.y.value >= Math.min(e.y.value, t.y.value) && s.point.y.value <= Math.max(e.y.value, t.y.value) && s.point.z.value >= Math.min(e.z.value, t.z.value) && s.point.z.value <= Math.max(e.z.value, t.z.value) : !1;
+  }
+};
+z = new WeakMap(), W = new WeakMap(), // A line is defined as the canonical form
+a(nt, "PERPENDICULAR", "perpendicular"), a(nt, "PARALLEL", "parallel");
+let wt = nt;
+var Ae, Fe;
+const si = class si {
+  constructor(e) {
+    f(this, Ae, new x(0, 0, 1));
+    f(this, Fe, new D(0, 0, 0));
+    return e && this.parse(e), this;
+  }
+  get normal() {
+    return i(this, Ae);
+  }
+  set normal(e) {
+    h(this, Ae, e), i(this, Ae).asPoint = !1;
+  }
+  get point() {
+    return i(this, Fe);
+  }
+  set point(e) {
+    h(this, Fe, e), i(this, Fe).asPoint = !0;
+  }
+  get a() {
+    return i(this, Ae).x;
+  }
+  get b() {
+    return i(this, Ae).y;
+  }
+  get c() {
+    return i(this, Ae).z;
+  }
+  get d() {
+    return i(this, Ae).dot(i(this, Fe)).opposite();
+  }
+  get tex() {
+    return new H(
+      new T("xyz", this.a, this.b, this.c, this.d),
+      new T(0)
+    ).reduce().tex;
+  }
+  parse(e) {
+    var t, s, r;
+    if (e.point && e.normal) {
+      this.point = e.point, this.normal = e.normal;
+      return;
+    }
+    if (e.point && ((t = e.directions) == null ? void 0 : t.length) === 2) {
+      this.point = e.point;
+      const [n, l] = e.directions;
+      this.normal = n.cross(l);
+      return;
+    }
+    if (e.equation) {
+      const n = e.equation.moveLeft().reduce().left, l = n.monomByLetter("x").coefficient, u = n.monomByLetter("y").coefficient, p = n.monomByLetter("z").coefficient, m = n.monomByDegree(0).coefficient;
+      this.normal = new x(l, u, p), l.isNotZero() ? this.point = new D(m.clone().divide(l).opposite(), 0, 0) : u.isNotZero() ? this.point = new D(0, m.clone().divide(u).opposite(), 0) : this.point = new D(0, 0, m.clone().divide(p).opposite());
+      return;
+    }
+    if (((s = e.points) == null ? void 0 : s.length) === 3 && e.points.every((n) => n instanceof x)) {
+      const n = e.points[0], l = e.points[1], u = e.points[2], p = new x(n, l), m = new x(n, u);
+      this.normal = p.cross(m), this.point = n;
+      return;
+    }
+    if (((r = e.coefficients) == null ? void 0 : r.length) === 4) {
+      const [n, l, u, p] = e.coefficients;
+      this.normal = new x(n, l, u), this.point = new D(0, 0, -p);
+      return;
+    }
+  }
+  angle(e, t, s) {
+    if (e instanceof si)
+      return this.normal.angle(e.normal, t, s);
+    let r;
+    if (e instanceof x) {
+      if (e.dimension !== 3)
+        throw new Error("Vector is not 3D");
+      r = e;
+    } else
+      r = e.direction;
+    return (s ? Math.PI / 2 : 90) - this.normal.angle(r, !0, s);
+  }
+  distanceTo(e) {
+    return this.normal.dot(e).add(this.d).abs().value / this.normal.norm;
+  }
+  intersectWithLine(e) {
+    const { point: t, direction: s } = e, r = this.normal.dot(t).add(this.d).divide(this.normal.dot(s).opposite());
+    return t.clone().add(s.clone().multiplyByScalar(r));
+  }
+  intersectWithPlane(e) {
+    throw this.normal.cross(e.normal), new D(0, 0, 0), new Error("Intersection with plane  not yet implemented !");
+  }
+  isPointOnPlane(e) {
+    return this.normal.dot(e).add(this.d).isZero();
   }
 };
-X = new WeakMap(), K = new WeakMap(), J = new WeakMap(), We = new WeakMap(), Te = new WeakMap(), rt = new WeakMap(), Bt = new WeakMap(), nt = new WeakMap(), Me = new WeakMap(), Pt = new WeakMap(), He = new WeakMap();
-let Ft = Rt;
-function ft(o) {
+Ae = new WeakMap(), Fe = new WeakMap();
+let _t = si;
+var Me;
+class Xi {
+  constructor(...e) {
+    f(this, Me, []);
+    return h(this, Me, e), this;
+  }
+  get values() {
+    return i(this, Me);
+  }
+  get array() {
+    return i(this, Me).map((e) => e.array);
+  }
+  get dimension() {
+    return [i(this, Me).length, i(this, Me)[0].dimension];
+  }
+  isSquare() {
+    return i(this, Me).length === i(this, Me)[0].dimension;
+  }
+  determinant() {
+    if (!this.isSquare())
+      throw new Error("Matrix is not square");
+    return Gi(...this.values);
+  }
+}
+Me = new WeakMap();
+function vt(o) {
   const e = Object.assign(
     {
       negative: !0,
@@ -3270,16 +3684,16 @@ function ft(o) {
     },
     o
   ), t = new c();
-  if (e.negative ? t.numerator = W(e.max, e.zero) : t.numerator = fe(e.zero ? 0 : 1, e.max), e.natural)
+  if (e.negative ? t.numerator = X(e.max, e.zero) : t.numerator = de(e.zero ? 0 : 1, e.max), e.natural)
     t.denominator = 1;
   else {
     let s = 0;
     for (; t.isRelative() && s < 10; )
-      t.denominator = fe(1, e.max), s++;
+      t.denominator = de(1, e.max), s++;
   }
   return e.reduced ? t.reduce() : t;
 }
-function fi(o) {
+function Ni(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -3288,8 +3702,8 @@ function fi(o) {
       zero: !1
     },
     o
-  ), t = new M();
-  if (t.coefficient = ft({
+  ), t = new I();
+  if (t.coefficient = vt({
     zero: e.zero,
     reduced: !0,
     natural: !e.fraction
@@ -3297,14 +3711,14 @@ function fi(o) {
     for (const s of e.letters.split(""))
       t.setLetter(s, 0);
     for (let s = 0; s < e.degree; s++) {
-      const r = Gt(e.letters.split(""));
+      const r = ti(e.letters.split(""));
       t.setLetter(r, t.degree(r).clone().add(1));
     }
   } else
     t.setLetter(e.letters, e.degree);
   return t;
 }
-const zi = {
+const Yi = {
   letters: "x",
   degree: 2,
   fraction: !1,
@@ -3315,14 +3729,14 @@ const zi = {
   numberOfMonoms: 0,
   positive: !0
 };
-function di(o) {
+function Oi(o) {
   const e = Object.assign(
-    zi,
+    Yi,
     o
-  ), t = new I().empty();
+  ), t = new T().empty();
   let s;
   for (let r = e.degree; r >= 0; r--)
-    s = fi({
+    s = Ni({
       letters: e.letters,
       degree: r,
       fraction: e.fraction,
@@ -3330,12 +3744,12 @@ function di(o) {
     }), e.unit && e.degree === r && s.coefficient.one(), t.add(s);
   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 r = fe(1, t.length - 1);
+      const r = de(1, t.length - 1);
       t.monoms.splice(r, 1);
     }
   return t;
 }
-function ki(o) {
+function Qi(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -3355,9 +3769,9 @@ function ki(o) {
       }
     },
     o
-  ), t = new I().one();
+  ), t = new T().one();
   for (let s = 0; s < e.degree; s++) {
-    const r = di({
+    const r = Oi({
       degree: 1,
       unit: e.unit,
       fraction: e.fraction,
@@ -3366,9 +3780,9 @@ function ki(o) {
     });
     t.multiply(r);
   }
-  return new ce(t, 0);
+  return new H(t, 0);
 }
-function pi(o) {
+function qi(o) {
   const e = Object.assign(
     {
       axis: !0,
@@ -3377,10 +3791,10 @@ function pi(o) {
       quadrant: null
     },
     o
-  ), t = e.axis === "x", s = e.axis === "y", r = e.fraction ? ft({ max: e.max, zero: t }) : new c(W(e.max, t)), n = e.fraction ? ft({ max: e.max, zero: s }) : new c(W(e.max, s));
-  return Number(e.quadrant) === 1 && (r.abs(), n.abs()), Number(e.quadrant) === 2 && (r.isPositive() && r.opposite(), n.isNegative() && n.opposite()), Number(e.quadrant) === 3 && (r.isPositive() && r.opposite(), n.isPositive() && n.opposite()), Number(e.quadrant) === 4 && (r.isNegative() && r.opposite(), n.isPositive() && n.opposite()), new G(r, n);
+  ), t = e.axis === "x", s = e.axis === "y", r = e.fraction ? vt({ max: e.max, zero: t }) : new c(X(e.max, t)), n = e.fraction ? vt({ max: e.max, zero: s }) : new c(X(e.max, s));
+  return Number(e.quadrant) === 1 && (r.abs(), n.abs()), Number(e.quadrant) === 2 && (r.isPositive() && r.opposite(), n.isNegative() && n.opposite()), Number(e.quadrant) === 3 && (r.isPositive() && r.opposite(), n.isPositive() && n.opposite()), Number(e.quadrant) === 4 && (r.isNegative() && r.opposite(), n.isPositive() && n.opposite()), new D(r, n);
 }
-function Li(o) {
+function Ki(o) {
   const e = Object.assign(
     {
       center: {
@@ -3390,191 +3804,84 @@ function Li(o) {
       pointsOnCircle: 8
     },
     o
-  ), t = pi(e.center);
+  ), t = qi(e.center);
   let s, r;
-  return e.pointsOnCircle === 8 ? (s = fe(1, 3), r = s ** 2 + (s + 1) ** 2) : r = fe(1, 20), new ut(t, r, !0);
+  return e.pointsOnCircle === 8 ? (s = de(1, 3), r = s ** 2 + (s + 1) ** 2) : r = de(1, 20), new yt(t, r, !0);
 }
-function Di(o) {
+function Ji(o) {
   const e = Object.assign(
     {
       A: {
-        x: W(10),
-        y: W(10)
+        x: X(10),
+        y: X(10)
       }
     },
     o
-  ), t = new O(
-    W(10),
-    W(10)
+  ), t = new x(
+    X(10),
+    X(10)
   );
   for (; t.isNull; )
-    t.x = W(10), t.y = W(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 V(new O(e.A.x, e.A.y), t);
+    t.x = X(10), t.y = X(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 j(new x(e.A.x, e.A.y), t);
 }
-var z, U;
-const _e = class _e {
-  constructor(e, t) {
-    // ax + by + c = 0
-    d(this, z, new G());
-    d(this, U, new O());
-    a(this, "clone", () => (h(this, U, i(this, U).clone()), h(this, z, i(this, z).clone()), this));
-    // ------------------------------------------
-    // Mathematical operations
-    // ------------------------------------------
-    a(this, "isOnLine", (e) => !1);
-    a(this, "isParallelTo", (e) => {
-      throw new Error("Method not implemented.");
-    });
-    a(this, "isSameAs", (e) => {
-      throw new Error("Method not implemented.");
-    });
-    a(this, "isPerpendicularTo", (e) => {
-      throw new Error("Method not implemented.");
-    });
-    a(this, "isVertical", () => {
-      throw new Error("Method not implemented.");
-    });
-    a(this, "simplify", () => {
-      throw new Error("Method not implemented.");
-    });
-    a(this, "intersection", (e) => {
-      throw new Error("Method not implemented.");
-    });
-    // getValueAtX = (value: Fraction | number): Fraction => {
-    //     const equ = this.equation.clone().isolate('y'),
-    //         F = new Fraction(value)
-    //     if (equ instanceof Equation) {
-    //         return equ.right.evaluate({ x: F }) as Fraction
-    //     }
-    //     return new Fraction().invalid()
-    // }
-    // getValueAtY = (value: Fraction | number): Fraction => {
-    //     const equ = this.equation.clone().isolate('x'),
-    //         F = new Fraction(value)
-    //     if (equ instanceof Equation) {
-    //         return equ.right.evaluate({ y: F }) as Fraction
-    //     }
-    //     return new Fraction().invalid()
-    // }
-    a(this, "randomPoint", (e = 5) => {
-      const t = i(this, z).clone(), s = new c(W(e, !1));
-      return new G(
-        t.x.clone().add(i(this, U).x.clone().multiply(s)),
-        t.y.clone().add(i(this, U).y.clone().multiply(s)),
-        t.z.clone().add(i(this, U).z.clone().multiply(s))
-      );
-    });
-    return h(this, z, e.clone()), h(this, U, t.asPoint ? new O(e, t) : t.clone()), this;
-  }
-  get OA() {
-    return i(this, z);
-  }
-  set OA(e) {
-    h(this, z, e);
-  }
-  get point() {
-    return i(this, z).clone();
-  }
-  get d() {
-    return i(this, U);
-  }
-  set d(e) {
-    h(this, U, e);
-  }
-  get tex() {
-    return {
-      parametric: `${O.asTex("x", "y", "z")} = ${O.asTex(i(this, z).x.tex, i(this, z).y.tex, i(this, z).z.tex)} + k\\cdot ${O.asTex(i(this, U).x.tex, i(this, U).y.tex, i(this, U).z.tex)}`,
-      system: `\\left\\{\\begin{aligned}
-    x &= ${new I(i(this, z).x).add(new M(i(this, U).x).multiply(new M("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new I(i(this, z).y).add(new M(i(this, U).y).multiply(new M("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new I(i(this, z).z).add(new M(i(this, U).z).multiply(new M("k"))).reorder("k", !0).tex}
-\\end{aligned}\\right.`,
-      cartesian: `\\frac{ ${new I("x", 1, i(this, z).x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new I("y", 1, i(this, z).y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new I("z", 1, i(this, z).z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
-    };
-  }
-  get display() {
-    const e = i(this, z).x.display, t = i(this, z).y.display, s = i(this, z).z.display, r = this.direction.simplify(), n = r.x.display, l = r.y.display, u = r.z.display;
-    return {
-      parametric: `${O.asDisplay("x", "y", "z")} = ${O.asDisplay(i(this, z).x.display, i(this, z).y.display, i(this, z).z.display)} + k\\cdot ${O.asDisplay(i(this, U).x.display, i(this, U).y.display, i(this, U).z.display)}`,
-      system: "",
-      cartesian: `(x-${e})/${n} = (y-${t})/${l} = (z-${s})/${u}`
-    };
-  }
-  get direction() {
-    return i(this, U).clone();
-  }
-  distanceTo(e) {
-    const t = new O(i(this, z), e), s = this.direction, r = this.direction.normSquare, n = t.cross(s).normSquare, l = n.clone().divide(r), u = l.clone().sqrt();
-    return console.log("CROSS", t.cross(s).display), {
-      value: Math.sqrt(l.value),
-      fraction: l.clone().sqrt(),
-      tex: u.isExact() ? u.tex : `\\sqrt{${l.tex}}`
-    };
-  }
-  hitSegment(e, t) {
-    const s = this.intersection(
-      new _e(e, t)
-    );
-    return s.hasIntersection ? s.point.x.value >= Math.min(e.x.value, t.x.value) && s.point.x.value <= Math.max(e.x.value, t.x.value) && s.point.y.value >= Math.min(e.y.value, t.y.value) && s.point.y.value <= Math.max(e.y.value, t.y.value) && s.point.z.value >= Math.min(e.z.value, t.z.value) && s.point.z.value <= Math.max(e.z.value, t.z.value) : !1;
-  }
-};
-z = new WeakMap(), U = new WeakMap(), // A line is defined as the canonical form
-a(_e, "PERPENDICULAR", "perpendicular"), a(_e, "PARALLEL", "parallel");
-let jt = _e;
-function Zi(o) {
+function _i(o) {
   const e = Object.assign(
     {
       A: {
-        x: W(10),
-        y: W(10),
-        z: W(10)
+        x: X(10),
+        y: X(10),
+        z: X(10)
       },
       direction: {
-        x: W(10),
-        y: W(10),
-        z: W(10)
+        x: X(10),
+        y: X(10),
+        z: X(10)
       }
     },
     o
-  ), t = new G(e.A.x, e.A.y, e.A.z), s = new O(e.direction.x, e.direction.y, e.direction.z);
-  return new jt(t, s);
+  ), t = new D(e.A.x, e.A.y, e.A.z), s = new x(e.direction.x, e.direction.y, e.direction.z);
+  return new wt(t, s);
 }
-const Vi = {
-  equation: (o) => ki(o),
-  polynom: (o) => di(o),
-  monom: (o) => fi(o),
-  fraction: (o) => ft(o),
-  number: (o, e, t) => fe(o, e, t),
-  numberSym: (o, e) => W(o, e),
-  prime: (o) => Ri(o),
-  bool: (o) => ni(o),
-  array: (o, e) => Si(o, e),
-  item: (o) => Gt(o),
-  shuffle: (o) => oi(o),
-  line: (o) => Di(o),
-  line3: (o) => Zi(o),
-  point: (o) => pi(o),
-  circle: (o) => Li(o)
-}, Fi = {
-  Vector: O,
-  Point: G,
-  Line: V,
-  Triangle: Ft,
-  Circle: ut
-}, Ui = {
-  Numeric: j,
+const es = {
+  equation: (o) => Qi(o),
+  polynom: (o) => Oi(o),
+  monom: (o) => Ni(o),
+  fraction: (o) => vt(o),
+  number: (o, e, t) => de(o, e, t),
+  numberSym: (o, e) => X(o, e),
+  prime: (o) => Wi(o),
+  bool: (o) => gi(o),
+  array: (o, e) => Hi(o, e),
+  item: (o) => ti(o),
+  shuffle: (o) => yi(o),
+  line: (o) => Ji(o),
+  line3: (o) => _i(o),
+  point: (o) => qi(o),
+  circle: (o) => Ki(o)
+}, ts = {
+  Vector: x,
+  Point: D,
+  Line: j,
+  Triangle: Jt,
+  Circle: yt,
+  Line3: wt,
+  Plane3: _t
+}, ss = {
+  Numeric: G,
   Fraction: c,
-  Root: ot,
-  Monom: M,
-  Polynom: I,
-  Equation: ce,
-  // LinearSystem,s
-  Factor: ue,
-  PolyFactor: Dt,
+  Root: ft,
+  Monom: I,
+  Polynom: T,
+  Equation: H,
+  Matrix: Xi,
+  LinearSystem: Qt,
+  Factor: fe,
+  PolyFactor: Xt,
   // LogicalSet,
-  Random: Vi,
-  Geometry: Fi
+  Random: es,
+  Geometry: ts
 };
 export {
-  Ui as default
+  ss as default
 };