pimath 0.1.28 → 0.1.31

package/dist/pimath.js

@@ -1,22 +1,22 @@
-var Li = Object.defineProperty;
-var gi = (o) => {
+var Xi = Object.defineProperty;
+var Ni = (o) => {
   throw TypeError(o);
 };
-var Vi = (o, e, t) => e in o ? Li(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
-var a = (o, e, t) => Vi(o, typeof e != "symbol" ? e + "" : e, t), _t = (o, e, t) => e.has(o) || gi("Cannot " + t);
-var s = (o, e, t) => (_t(o, e, "read from private field"), t ? t.call(o) : e.get(o)), m = (o, e, t) => e.has(o) ? gi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, i) => (_t(o, e, "write to private field"), i ? i.call(o, t) : e.set(o, t), t), A = (o, e, t) => (_t(o, e, "access private method"), t);
-function Di(o) {
-  const e = wi(o), t = [];
+var Yi = (o, e, t) => e in o ? Xi(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), ri = (o, e, t) => e.has(o) || Ni("Cannot " + t);
+var s = (o, e, t) => (ri(o, e, "read from private field"), t ? t.call(o) : e.get(o)), m = (o, e, t) => e.has(o) ? Ni("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), h = (o, e, t, i) => (ri(o, e, "write to private field"), i ? i.call(o, t) : e.set(o, t), t), A = (o, e, t) => (ri(o, e, "access private method"), t);
+function Qi(o) {
+  const e = Ai(o), t = [];
   let i, n;
   for (; e.length > 0; )
     i = e.shift() ?? 1, n = (e.length > 0 ? e.pop() : +i) ?? 1, t.push([i, n]);
   return t;
 }
-function Zi(...o) {
-  const e = ui(...o);
+function Hi(...o) {
+  const e = wi(...o);
   return o.map((t) => t / e);
 }
-function wi(o) {
+function Ai(o) {
   const e = Math.abs(o), t = Math.sqrt(e), i = [];
   for (let n = 1; n <= t; n++)
     o % n === 0 && (i.push(n), i.push(e / n));
@@ -24,7 +24,7 @@ function wi(o) {
     return n - r;
   }), [...new Set(i)];
 }
-function ui(...o) {
+function wi(...o) {
   const e = function(n, r) {
     return r === 0 ? n : e(r, n % r);
   };
@@ -39,52 +39,52 @@ function ui(...o) {
     ;
   return Math.abs(t);
 }
-function Fi(...o) {
+function Ki(...o) {
   return o.reduce(function(e, t) {
-    return Math.abs(e * t / ui(e, t));
+    return Math.abs(e * t / wi(e, t));
   });
 }
-function ji(o, e = 3) {
+function Ji(o, e = 3) {
   return +o.toFixed(e);
 }
-function Ui(o) {
+function _i(o) {
   if (Number.isSafeInteger(o) || o.toString().split(".")[0].length < 10)
     return 0;
   throw new Error("Periodic value: Not implemented yet");
 }
-function Wi(o) {
+function es(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 Gi(o, e) {
+function ts(o, e) {
   const t = [], i = e === !0 ? +o : o ** 2;
   for (let n = 0; n <= o; n++)
     for (let r = 0; r <= o; r++)
       n ** 2 + r ** 2 === i && t.push([n, r, o]);
   return t;
 }
-function Hi(o, e = 2) {
+function is(o, e = 2) {
   return +`${Math.round(+`${o}e${e}`)}e-${e}`;
 }
-const U = {
-  decompose: Di,
-  dividers: wi,
-  divideNumbersByGCD: Zi,
-  gcd: ui,
-  lcm: Fi,
-  numberCorrection: ji,
-  periodic: Ui,
-  primes: Wi,
-  pythagoreanTripletsWithTarget: Gi,
-  round: Hi
+const G = {
+  decompose: Qi,
+  dividers: Ai,
+  divideNumbersByGCD: Hi,
+  gcd: wi,
+  lcm: Ki,
+  numberCorrection: Ji,
+  periodic: _i,
+  primes: es,
+  pythagoreanTripletsWithTarget: ts,
+  round: is
 };
-var ut, x, v, Re;
-const $ = class $ {
+var mt, x, v, Le;
+const B = class B {
   constructor(e, t) {
-    m(this, ut, !1);
+    m(this, mt, !1);
     m(this, x, 1);
     m(this, v, 1);
-    m(this, Re, "frac");
+    m(this, Le, "frac");
     // ------------------------------------------
     /**
      * Parse the value to get the numerator and denominator
@@ -114,22 +114,22 @@ const $ = class $ {
           }
           break;
         case "object":
-          e instanceof $ && (h(this, v, +e.numerator), h(this, x, +e.denominator));
+          e instanceof B && (h(this, v, +e.numerator), h(this, x, +e.denominator));
           break;
       }
       return this;
     });
     a(this, "clone", () => {
-      const e = new $();
+      const e = new B();
       return e.numerator = +s(this, v), e.denominator = +s(this, x), e;
     });
     a(this, "abs", () => (h(this, v, Math.abs(s(this, v))), h(this, x, Math.abs(s(this, x))), this));
     a(this, "add", (e) => {
-      if (e instanceof $) {
+      if (e instanceof B) {
         const t = s(this, v), i = s(this, x);
         h(this, v, t * e.denominator + e.numerator * i), h(this, x, i * e.denominator);
       } else
-        return this.add(new $(e));
+        return this.add(new B(e));
       return this.reduce();
     });
     a(this, "amplify", (e) => (Number.isSafeInteger(e) && (h(this, v, s(this, v) * e), h(this, x, s(this, x) * e)), this));
@@ -146,7 +146,7 @@ const $ = class $ {
     a(this, "compare", (e, t) => {
       t === void 0 && (t = "=");
       let i;
-      switch (e instanceof $ ? i = e.clone() : i = new $(e), t) {
+      switch (e instanceof B ? i = e.clone() : i = new B(e), t) {
         case ">":
           return this.value > i.value;
         case ">=":
@@ -168,9 +168,9 @@ const $ = class $ {
       }
     });
     a(this, "divide", (e) => {
-      const t = new $(e);
+      const t = new B(e);
       if (t.numerator === 0)
-        return new $().infinite();
+        return new B().infinite();
       const i = +s(this, v), n = +s(this, x);
       return h(this, v, i * t.denominator), h(this, x, n * t.numerator), this.reduce();
     });
@@ -180,7 +180,7 @@ const $ = class $ {
       const e = +s(this, v);
       return h(this, v, +s(this, x)), h(this, x, e), this;
     });
-    a(this, "isApproximative", () => s(this, ut) || s(this, v).toString().length >= 15 && s(this, x).toString().length >= 15);
+    a(this, "isApproximative", () => s(this, mt) || s(this, v).toString().length >= 15 && s(this, x).toString().length >= 15);
     a(this, "isEqual", (e) => this.compare(e, "="));
     a(this, "isEven", () => this.isRelative() && this.value % 2 === 0);
     a(this, "isExact", () => !this.isApproximative());
@@ -188,7 +188,7 @@ const $ = class $ {
     a(this, "isGeq", (e) => this.compare(e, ">="));
     a(this, "isGreater", (e) => this.compare(e, ">"));
     a(this, "isInfinity", () => Math.abs(s(this, v)) === 1 / 0);
-    a(this, "isInverted", (e) => this.isEqual(new $().one().divide(e.clone())));
+    a(this, "isInverted", (e) => this.isEqual(new B().one().divide(e.clone())));
     a(this, "isLeq", (e) => this.compare(e, "<="));
     /* Compare shortcuts */
     a(this, "isLesser", (e) => this.compare(e, "<"));
@@ -204,7 +204,7 @@ const $ = class $ {
     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(U.gcd(s(this, v), s(this, x))) === 1);
+    a(this, "isReduced", () => Math.abs(G.gcd(s(this, v), s(this, x))) === 1);
     a(this, "isRelative", () => this.clone().reduce().denominator === 1);
     a(this, "isSquare", () => Math.sqrt(s(this, v)) % 1 === 0 && Math.sqrt(s(this, x)) % 1 === 0);
     a(this, "isStrictlyNegative", () => this.value < 0);
@@ -212,13 +212,13 @@ const $ = class $ {
     // Mathematical operations specific to fractions
     a(this, "isZero", () => s(this, v) === 0);
     a(this, "multiply", (e) => {
-      const t = new $(e);
+      const t = new B(e);
       return h(this, v, s(this, v) * t.numerator), h(this, x, s(this, x) * t.denominator), this.reduce();
     });
     a(this, "one", () => (h(this, v, 1), h(this, x, 1), this));
     a(this, "opposite", () => (h(this, v, -s(this, v)), this));
     a(this, "pow", (e) => {
-      if (e instanceof $)
+      if (e instanceof B)
         return this.pow(e.value);
       this.reduce(), e < 0 && this.inverse();
       const t = Math.floor(Math.pow(s(this, v), Math.abs(e))), i = Math.floor(Math.pow(s(this, x), Math.abs(e)));
@@ -226,7 +226,7 @@ const $ = class $ {
     });
     // ------------------------------------------
     a(this, "reduce", () => {
-      const e = U.gcd(s(this, v), s(this, x));
+      const e = G.gcd(s(this, v), s(this, x));
       return h(this, v, s(this, v) / e), h(this, x, s(this, x) / e), s(this, x) < 0 && (h(this, x, -s(this, x)), h(this, v, -s(this, v))), this;
     });
     a(this, "root", (e) => {
@@ -239,13 +239,13 @@ const $ = class $ {
       const t = this.sign();
       this.abs(), this.reduce();
       const i = Math.floor(Math.pow(s(this, v), Math.abs(1 / e))), n = Math.floor(Math.pow(s(this, x), Math.abs(1 / e)));
-      return h(this, v, Math.pow(s(this, v), Math.abs(1 / e))), h(this, x, Math.pow(s(this, x), Math.abs(1 / e))), (i !== s(this, v) || n !== s(this, x)) && (h(this, v, s(this, v) / s(this, x)), h(this, x, 1), h(this, ut, !0)), this.multiply(t), this;
+      return h(this, v, Math.pow(s(this, v), Math.abs(1 / e))), h(this, x, Math.pow(s(this, x), Math.abs(1 / e))), (i !== s(this, v) || n !== s(this, x)) && (h(this, v, s(this, v) / s(this, x)), h(this, x, 1), h(this, mt, !0)), this.multiply(t), this;
     });
     // ------------------------------------------
     // Getter and setter
     a(this, "sign", () => s(this, v) * s(this, x) >= 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, "subtract", (e) => e instanceof B ? this.add(e.clone().opposite()) : this.add(-e));
     a(this, "zero", () => (h(this, v, 0), h(this, x, 1), this));
     return e !== void 0 && this.parse(e, t), this;
   }
@@ -256,13 +256,13 @@ const $ = class $ {
     h(this, x, e);
   }
   get dfrac() {
-    return h(this, Re, "dfrac"), this;
+    return h(this, Le, "dfrac"), this;
   }
   get display() {
     return this.isExact() ? s(this, x) === 1 ? `${s(this, v)}` : `${s(this, v)}/${s(this, x)}` : this.value.toFixed(3);
   }
   get frac() {
-    return h(this, Re, "frac"), this;
+    return h(this, Le, "frac"), this;
   }
   // ------------------------------------------
   get numerator() {
@@ -273,97 +273,97 @@ const $ = class $ {
   }
   // Display getter
   get tex() {
-    return this.isInfinity() ? `${this.sign() === 1 ? "+" : "-"}\\infty` : this.isExact() ? s(this, x) === 1 ? `${s(this, v)}` : s(this, v) < 0 ? `-\\${s(this, Re)}{ ${-s(this, v)} }{ ${s(this, x)} }` : `\\${s(this, Re)}{ ${s(this, v)} }{ ${s(this, x)} }` : this.value.toFixed(3);
+    return this.isInfinity() ? `${this.sign() === 1 ? "+" : "-"}\\infty` : this.isExact() ? s(this, x) === 1 ? `${s(this, v)}` : s(this, v) < 0 ? `-\\${s(this, Le)}{ ${-s(this, v)} }{ ${s(this, x)} }` : `\\${s(this, Le)}{ ${s(this, v)} }{ ${s(this, x)} }` : this.value.toFixed(3);
   }
   get texWithSign() {
     return this.isPositive() ? `+${this.tex}` : this.tex;
   }
   get tfrac() {
-    return h(this, Re, "tfrac"), this;
+    return h(this, Le, "tfrac"), this;
   }
   get value() {
     const e = s(this, v) / s(this, x);
     return e === 0 ? 0 : e;
   }
 };
-ut = new WeakMap(), x = new WeakMap(), v = new WeakMap(), Re = new WeakMap(), a($, "average", (...e) => {
-  const t = new $().zero();
+mt = new WeakMap(), x = new WeakMap(), v = new WeakMap(), Le = new WeakMap(), a(B, "average", (...e) => {
+  const t = new B().zero();
   for (const i of e)
     t.add(i);
   return t.divide(e.length), t;
-}), a($, "max", (...e) => {
-  let t = new $(e[0]);
+}), a(B, "max", (...e) => {
+  let t = new B(e[0]);
   for (const i of e) {
-    const n = new $(i);
+    const n = new B(i);
     n.isGreater(t) && (t = n.clone());
   }
   return t;
-}), a($, "min", (...e) => {
-  let t = new $(e[0]);
+}), a(B, "min", (...e) => {
+  let t = new B(e[0]);
   for (const i of e) {
-    const n = new $(i);
+    const n = new B(i);
     n.isLesser(t) && (t = n.clone());
   }
   return t;
-}), a($, "sort", (e, t) => {
-  const n = e.map((r) => r instanceof $ ? r : new $(r)).sort((r, l) => r.value - l.value);
+}), a(B, "sort", (e, t) => {
+  const n = e.map((r) => r instanceof B ? r : new B(r)).sort((r, l) => r.value - l.value);
   return t && n.reverse(), n;
 }), // ------------------------------------------
 // Compare functions
-a($, "unique", (e) => {
+a(B, "unique", (e) => {
   const t = {}, i = [];
   return e.forEach((n) => {
-    n instanceof $ || (n = new $(n)), t[n.clone().reduce().tex] || (i.push(n.clone()), t[n.tex] = !0);
+    n instanceof B || (n = new B(n)), t[n.clone().reduce().tex] || (i.push(n.clone()), t[n.tex] = !0);
   }), i;
-}), a($, "xMultiply", (...e) => {
-  const t = new $();
+}), a(B, "xMultiply", (...e) => {
+  const t = new B();
   for (const i of e) {
-    const n = new $(i);
+    const n = new B(i);
     t.numerator = t.numerator * n.numerator, t.denominator = t.denominator * n.denominator;
   }
   return t;
 });
-let f = $;
-var Z, ie, re, Ye;
-class vt {
+let u = B;
+var F, ie, re, Je;
+class At {
   constructor(...e) {
-    m(this, Z);
+    m(this, F);
     m(this, ie);
     m(this, re);
-    m(this, Ye);
+    m(this, Je);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
-    a(this, "parse", (e, t, i) => (h(this, re, i ?? 1), h(this, ie, t ?? 2), h(this, Z, e), s(this, ie) % 2 === 0 && s(this, Z) < 0 && h(this, Ye, !1), this));
+    a(this, "parse", (e, t, i) => (h(this, re, i ?? 1), h(this, ie, t ?? 2), h(this, F, e), s(this, ie) % 2 === 0 && s(this, F) < 0 && h(this, Je, !1), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
     a(this, "reduce", () => {
-      let e = Math.floor(Math.pow(s(this, Z), 1 / s(this, ie)));
+      let e = Math.floor(Math.pow(s(this, F), 1 / s(this, ie)));
       for (; e > 1; ) {
-        if (s(this, Z) % Math.pow(e, s(this, ie)) === 0) {
-          h(this, re, s(this, re) * e), h(this, Z, s(this, Z) / Math.pow(e, s(this, ie))), e = Math.floor(Math.pow(s(this, Z), 1 / s(this, ie)));
+        if (s(this, F) % Math.pow(e, s(this, ie)) === 0) {
+          h(this, re, s(this, re) * e), h(this, F, s(this, F) / Math.pow(e, s(this, ie))), e = Math.floor(Math.pow(s(this, F), 1 / s(this, ie)));
           continue;
         }
         e--;
       }
       return this;
     });
-    a(this, "multiply", (e) => (h(this, Z, s(this, Z) * e.radical), this.reduce()));
+    a(this, "multiply", (e) => (h(this, F, s(this, F) * e.radical), this.reduce()));
     // ------------------------------------------
     // Help functions
     // ------------------------------------------
-    a(this, "hasRadical", () => !(s(this, Z) === 1 || s(this, Z) === 0 || !s(this, Ye)));
-    h(this, Z, 1), h(this, re, 1), h(this, ie, 2), h(this, Ye, !0), e.length > 0 && this.parse(e[0], e[1], e[2]);
+    a(this, "hasRadical", () => !(s(this, F) === 1 || s(this, F) === 0 || !s(this, Je)));
+    h(this, F, 1), h(this, re, 1), h(this, ie, 2), h(this, Je, !0), e.length > 0 && this.parse(e[0], e[1], e[2]);
   }
   // ------------------------------------------
   // Getter and setter
   // ------------------------------------------
   get radical() {
-    return s(this, Z);
+    return s(this, F);
   }
   set radical(e) {
-    h(this, Z, e);
+    h(this, F, e);
   }
   get nth() {
     return s(this, ie);
@@ -379,24 +379,24 @@ class vt {
   }
   get tex() {
     let e;
-    return s(this, re) === 1 ? e = "" : s(this, re) === -1 ? e = "-" : e = s(this, re).toString(), s(this, Z) === 1 ? `${s(this, re)}` : s(this, ie) === 2 ? `${e}\\sqrt{${s(this, Z)}}` : `${e}\\sqrt[${s(this, ie)}]{${s(this, Z)}}`;
+    return s(this, re) === 1 ? e = "" : s(this, re) === -1 ? e = "-" : e = s(this, re).toString(), s(this, F) === 1 ? `${s(this, re)}` : s(this, ie) === 2 ? `${e}\\sqrt{${s(this, F)}}` : `${e}\\sqrt[${s(this, ie)}]{${s(this, F)}}`;
   }
   get display() {
     let e;
-    return s(this, re) === 1 ? e = "" : s(this, re) === -1 ? e = "-" : e = s(this, re).toString(), s(this, Z) === 1 ? `${s(this, re)}` : s(this, ie) === 2 ? `${e}sqrt{${s(this, Z)}}` : `${e}root(${s(this, ie)}){${s(this, Z)}}`;
+    return s(this, re) === 1 ? e = "" : s(this, re) === -1 ? e = "-" : e = s(this, re).toString(), s(this, F) === 1 ? `${s(this, re)}` : s(this, ie) === 2 ? `${e}sqrt{${s(this, F)}}` : `${e}root(${s(this, ie)}){${s(this, F)}}`;
   }
   get value() {
-    return s(this, re) * Math.pow(s(this, Z), 1 / s(this, ie));
+    return s(this, re) * Math.pow(s(this, F), 1 / s(this, ie));
   }
 }
-Z = new WeakMap(), ie = new WeakMap(), re = new WeakMap(), Ye = new WeakMap();
-var K, Fe, C, Ge, ge, vi, bi, xi, Ei, Ni, Ai, Ti;
-const pi = class pi {
+F = new WeakMap(), ie = new WeakMap(), re = new WeakMap(), Je = new WeakMap();
+var K, Ge, M, Qe, ye, Ti, Oi, Ci, ki, Mi, $i, Bi;
+const xi = class xi {
   constructor(e, t, i = "x") {
-    m(this, C);
+    m(this, M);
     m(this, K);
-    m(this, Fe);
-    if (h(this, Fe, i), Object.hasOwn(e, "moveLeft")) {
+    m(this, Ge);
+    if (h(this, Ge, i), Object.hasOwn(e, "moveLeft")) {
       const n = e;
       h(this, K, n.left.clone().subtract(n.right));
     } else
@@ -407,92 +407,92 @@ const pi = class pi {
     if (e === 0)
       return [];
     if (e === 1)
-      return A(this, C, Ni).call(this);
+      return A(this, M, Mi).call(this);
     if (e === 2)
-      return A(this, C, Ai).call(this);
-    const t = A(this, C, xi).call(this);
-    return t.length > 0 ? t : A(this, C, vi).call(this);
+      return A(this, M, $i).call(this);
+    const t = A(this, M, Ci).call(this);
+    return t.length > 0 ? t : A(this, M, Ti).call(this);
   }
   solveAsCardan() {
     if (s(this, K).degree().value !== 3)
       throw new Error("The equation is not cubic.");
-    return A(this, C, Ei).call(this);
+    return A(this, M, ki).call(this);
   }
 };
-K = new WeakMap(), Fe = new WeakMap(), C = new WeakSet(), Ge = function(e, t) {
+K = new WeakMap(), Ge = new WeakMap(), M = new WeakSet(), Qe = function(e, t) {
   return {
-    variable: s(this, Fe),
+    variable: s(this, Ge),
     exact: !1,
     value: +e.toFixed(10),
     tex: (t == null ? void 0 : t.tex) ?? "",
     display: (t == null ? void 0 : t.display) ?? ""
   };
-}, ge = function(e) {
-  if (e instanceof f && e.isApproximative())
-    return A(this, C, Ge).call(this, e.value);
-  const t = new f(e);
+}, ye = function(e) {
+  if (e instanceof u && e.isApproximative())
+    return A(this, M, Qe).call(this, e.value);
+  const t = new u(e);
   return {
-    variable: s(this, Fe),
+    variable: s(this, Ge),
     exact: t,
     value: t.value,
     tex: t.tex,
     display: t.display
   };
-}, vi = function() {
+}, Ti = function() {
   const e = [];
   s(this, K).degree().value;
-  const t = s(this, K).getCoefficients().map((p) => p.value), [i, ...n] = s(this, K).getCoefficients(), r = 1 + Math.max(...n.map((p) => p.value / i.value)), c = 2 * r / 100, u = [];
+  const t = s(this, K).getCoefficients().map((p) => p.value), [i, ...n] = s(this, K).getCoefficients(), r = 1 + Math.max(...n.map((p) => p.value / i.value)), c = 2 * r / 100, f = [];
   for (let p = -r; p <= r; p += c) {
-    const w = U.numberCorrection(p);
-    u.push(
+    const w = G.numberCorrection(p);
+    f.push(
       {
         x: w,
         fx: s(this, K).evaluate(w, !0)
       }
     );
   }
-  u.sort((p, w) => p.x - w.x);
+  f.sort((p, w) => p.x - w.x);
   const d = [];
-  return u.forEach((p, w) => {
-    w > 0 && (p.fx === 0 ? d.push([p.x, p.x]) : u[w - 1].fx * p.fx < 0 && d.push([
-      u[w - 1].x,
+  return f.forEach((p, w) => {
+    w > 0 && (p.fx === 0 ? d.push([p.x, p.x]) : f[w - 1].fx * p.fx < 0 && d.push([
+      f[w - 1].x,
       p.x
     ]));
   }), d.forEach((p) => {
-    const [w, V] = p;
-    if (w === V)
-      e.push(A(this, C, ge).call(this, w));
+    const [w, L] = p;
+    if (w === L)
+      e.push(A(this, M, ye).call(this, w));
     else {
-      const ce = A(this, C, bi).call(this, t, w, V);
-      ce !== null && e.push(A(this, C, Ge).call(this, ce));
+      const ce = A(this, M, Oi).call(this, t, w, L);
+      ce !== null && e.push(A(this, M, Qe).call(this, ce));
     }
   }), e;
-}, bi = function(e, t, i, n = 1e-10) {
+}, Oi = function(e, t, i, n = 1e-10) {
   let r = s(this, K).evaluate(t, !0), l = s(this, K).evaluate(i, !0);
   if (r * l > 0)
     return console.log("Pas de racine dans l'intervalle donné"), null;
   let c;
   for (; (i - t) / 2 > n; ) {
     c = (t + i) / 2;
-    const u = s(this, K).evaluate(c, !0);
-    if (u === 0)
+    const f = s(this, K).evaluate(c, !0);
+    if (f === 0)
       return c;
-    r * u < 0 ? (i = c, l = u) : (t = c, r = u);
+    r * f < 0 ? (i = c, l = f) : (t = c, r = f);
   }
   return (t + i) / 2;
-}, xi = function() {
+}, Ci = function() {
   let e = s(this, K).clone(), t = [];
   const i = e.lcmDenominator();
   i !== 1 && e.multiply(i);
   const n = e.monomByDegree().coefficient;
   let r = e.monomByDegree(0).coefficient;
   for (; r.isZero(); )
-    t.length === 0 && t.push(A(this, C, ge).call(this, 0)), e = e.divide("x"), r = e.monomByDegree(0).coefficient;
-  const l = U.dividers(n.value), c = U.dividers(r.value);
+    t.length === 0 && t.push(A(this, M, ye).call(this, 0)), e = e.divide("x"), r = e.monomByDegree(0).coefficient;
+  const l = G.dividers(n.value), c = G.dividers(r.value);
   for (const d of l)
     for (const p of c) {
-      const w = new f(p, d);
-      e.evaluate(w).isZero() && !t.find((V) => V.value === w.value) && t.push(A(this, C, ge).call(this, w)), w.opposite(), e.evaluate(w).isZero() && !t.find((V) => V.value === w.value) && t.push(A(this, C, ge).call(this, w));
+      const w = new u(p, d);
+      e.evaluate(w).isZero() && !t.find((L) => L.value === w.value) && t.push(A(this, M, ye).call(this, w)), w.opposite(), e.evaluate(w).isZero() && !t.find((L) => L.value === w.value) && t.push(A(this, M, ye).call(this, w));
     }
   for (const d of t) {
     if (d.exact !== !1 && d.exact.isZero())
@@ -505,89 +505,89 @@ K = new WeakMap(), Fe = new WeakMap(), C = new WeakSet(), Ge = function(e, t) {
     return t.sort((d, p) => d.value - p.value);
   if (e.degree().value > 3)
     return [];
-  const u = new pi(e, e.clone().parse("0"), s(this, Fe));
-  return t = t.concat(u.solve()), t.sort((d, p) => d.value - p.value);
-}, Ei = function() {
-  const e = s(this, K), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), u = r.clone().divide(t), d = c.clone().subtract(l.clone().pow(2).divide(3)), p = u.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), w = p.clone().opposite(), V = d.clone().opposite().pow(3).divide(27), ce = w.clone().pow(2).subtract(V.clone().multiply(4)).opposite();
+  const f = new xi(e, e.clone().parse("0"), s(this, Ge));
+  return t = t.concat(f.solve()), t.sort((d, p) => d.value - p.value);
+}, ki = function() {
+  const e = s(this, K), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), f = r.clone().divide(t), d = c.clone().subtract(l.clone().pow(2).divide(3)), p = f.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), w = p.clone().opposite(), L = d.clone().opposite().pow(3).divide(27), ce = w.clone().pow(2).subtract(L.clone().multiply(4)).opposite();
   if (ce.isNegative()) {
-    const ue = p.clone().opposite().add(ce.clone().opposite().sqrt()).divide(2).root(3), fe = p.clone().opposite().subtract(ce.clone().opposite().sqrt()).divide(2).root(3), ye = ue.clone().add(fe).subtract(l.clone().divide(3));
-    return [A(this, C, ge).call(this, ye)];
+    const ue = p.clone().opposite().add(ce.clone().opposite().sqrt()).divide(2).root(3), fe = p.clone().opposite().subtract(ce.clone().opposite().sqrt()).divide(2).root(3), we = ue.clone().add(fe).subtract(l.clone().divide(3));
+    return [A(this, M, ye).call(this, we)];
   }
   if (ce.isZero()) {
-    const ue = p.clone().opposite().divide(2).root(3), fe = ue.clone().opposite().subtract(l.clone().divide(3)), ye = ue.clone().multiply(2).subtract(l.clone().divide(3));
-    return fe.isEqual(ye) ? [A(this, C, ge).call(this, fe)] : [
-      A(this, C, ge).call(this, ye),
-      A(this, C, ge).call(this, fe)
-    ].sort((me, de) => me.value - de.value);
+    const ue = p.clone().opposite().divide(2).root(3), fe = ue.clone().opposite().subtract(l.clone().divide(3)), we = ue.clone().multiply(2).subtract(l.clone().divide(3));
+    return fe.isEqual(we) ? [A(this, M, ye).call(this, fe)] : [
+      A(this, M, ye).call(this, we),
+      A(this, M, ye).call(this, fe)
+    ].sort((ge, pe) => ge.value - pe.value);
   }
   if (ce.isPositive()) {
-    const ue = [], fe = d.value, ye = p.value, me = l.value;
-    for (let de = 0; de < 3; de++)
-      ue.push(2 * Math.sqrt(-fe / 3) * Math.cos(Math.acos(3 * ye / (2 * fe) * Math.sqrt(-3 / fe)) / 3 + 2 * Math.PI * de / 3) - me / 3);
-    return ue.map((de) => A(this, C, Ge).call(this, de)).sort((de, rt) => de.value - rt.value);
+    const ue = [], fe = d.value, we = p.value, ge = l.value;
+    for (let pe = 0; pe < 3; pe++)
+      ue.push(2 * Math.sqrt(-fe / 3) * Math.cos(Math.acos(3 * we / (2 * fe) * Math.sqrt(-3 / fe)) / 3 + 2 * Math.PI * pe / 3) - ge / 3);
+    return ue.map((pe) => A(this, M, Qe).call(this, pe)).sort((pe, lt) => pe.value - lt.value);
   }
   return [];
-}, Ni = function() {
+}, Mi = function() {
   const [e, t] = s(this, K).getCoefficients(), i = t.opposite().divide(e);
   return [
-    A(this, C, ge).call(this, i)
+    A(this, M, ye).call(this, i)
   ];
-}, Ai = function() {
+}, $i = function() {
   const e = s(this, K), [t, i, n] = e.getCoefficients(), r = i.clone().pow(2).subtract(t.clone().multiply(n).multiply(4));
   if (r.isNegative())
     return [];
   if (r.isSquare()) {
-    const l = r.sqrt(), c = i.clone().opposite().add(l).divide(t.clone().multiply(2)), u = i.clone().opposite().subtract(l).divide(t.clone().multiply(2));
-    return l.isZero() ? [A(this, C, ge).call(this, c)] : [
-      A(this, C, ge).call(this, c),
-      A(this, C, ge).call(this, u)
+    const l = r.sqrt(), c = i.clone().opposite().add(l).divide(t.clone().multiply(2)), f = i.clone().opposite().subtract(l).divide(t.clone().multiply(2));
+    return l.isZero() ? [A(this, M, ye).call(this, c)] : [
+      A(this, M, ye).call(this, c),
+      A(this, M, ye).call(this, f)
     ].sort((d, p) => d.value - p.value);
   }
-  return A(this, C, Ti).call(this, t, i, r);
-}, Ti = function(e, t, i) {
-  const n = U.dividers(i.value).filter((me) => Math.sqrt(me) % 1 === 0).map((me) => Math.sqrt(me)).pop() ?? 1, r = U.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), u = i.clone().divide(n ** 2), d = Math.abs(n / r), p = n === 1 ? "-" : `-${d} `, w = n === 1 ? "+" : `+${d} `;
-  function V(me, de, rt, Jt) {
-    return `\\frac{ ${de} ${rt}\\sqrt{ ${Jt} } }{ ${me} }`;
+  return A(this, M, Bi).call(this, t, i, r);
+}, Bi = function(e, t, i) {
+  const n = G.dividers(i.value).filter((ge) => Math.sqrt(ge) % 1 === 0).map((ge) => Math.sqrt(ge)).pop() ?? 1, r = G.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), f = i.clone().divide(n ** 2), d = Math.abs(n / r), p = n === 1 ? "-" : `-${d} `, w = n === 1 ? "+" : `+${d} `;
+  function L(ge, pe, lt, ni) {
+    return `\\frac{ ${pe} ${lt}\\sqrt{ ${ni} } }{ ${ge} }`;
   }
-  function ce(me, de, rt, Jt) {
-    return `(${de}${rt}sqrt(${Jt}))/${me}`;
+  function ce(ge, pe, lt, ni) {
+    return `(${pe}${lt}sqrt(${ni}))/${ge}`;
   }
-  const ue = i.value ** 0.5, fe = (-t.value - ue) / (2 * e.value), ye = (-t.value + ue) / (2 * e.value);
+  const ue = i.value ** 0.5, fe = (-t.value - ue) / (2 * e.value), we = (-t.value + ue) / (2 * e.value);
   return [
-    A(this, C, Ge).call(this, fe, {
-      tex: V(c.tex, l.tex, p.toString(), u.tex),
-      display: ce(c.display, l.display, p.toString(), u.display)
+    A(this, M, Qe).call(this, fe, {
+      tex: L(c.tex, l.tex, p.toString(), f.tex),
+      display: ce(c.display, l.display, p.toString(), f.display)
     }),
-    A(this, C, Ge).call(this, ye, {
-      tex: V(c.tex, l.tex, w.toString(), u.tex),
-      display: ce(c.display, l.display, w.toString(), u.display)
+    A(this, M, Qe).call(this, we, {
+      tex: L(c.tex, l.tex, w.toString(), f.tex),
+      display: ce(c.display, l.display, w.toString(), f.display)
     })
-  ].sort((me, de) => me.value - de.value);
+  ].sort((ge, pe) => ge.value - pe.value);
 };
-let At = pi;
-var Xi = Object.defineProperty, Oi = (o) => {
+let Mt = xi;
+var ss = Object.defineProperty, Pi = (o) => {
   throw TypeError(o);
-}, Yi = (o, e, t) => e in o ? Xi(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t, ei = (o, e, t) => Yi(o, typeof e != "symbol" ? e + "" : e, t), qi = (o, e, t) => e.has(o) || Oi("Cannot " + t), te = (o, e, t) => (qi(o, e, "read from private field"), t ? t.call(o) : e.get(o)), ot = (o, e, t) => e.has(o) ? Oi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), Ee = (o, e, t, i) => (qi(o, e, "write to private field"), e.set(o, t), t);
-const fi = {
+}, ns = (o, e, t) => e in o ? ss(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t, oi = (o, e, t) => ns(o, typeof e != "symbol" ? e + "" : e, t), Si = (o, e, t) => e.has(o) || Pi("Cannot " + t), te = (o, e, t) => (Si(o, e, "read from private field"), t ? t.call(o) : e.get(o)), ct = (o, e, t) => e.has(o) ? Pi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, t), Ne = (o, e, t, i) => (Si(o, e, "write to private field"), e.set(o, t), t);
+const vi = {
   pi: Math.PI,
   e: Math.exp(1)
 };
-var g = /* @__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))(g || {}), Ze = /* @__PURE__ */ ((o) => (o.EXPRESSION = "expression", o.POLYNOM = "polynom", o.SET = "set", o.NUMERIC = "numeric", o))(Ze || {});
-function Qi(o, e) {
+var g = /* @__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))(g || {}), Ue = /* @__PURE__ */ ((o) => (o.EXPRESSION = "expression", o.POLYNOM = "polynom", o.SET = "set", o.NUMERIC = "numeric", o))(Ue || {});
+function rs(o, e) {
   if (o.length <= 1)
     return o;
   const t = Object.keys(e).filter((w) => e[w].type === g.FUNCTION).map((w) => w);
-  t.sort((w, V) => V.length - w.length);
-  const i = new RegExp(`^(${t.join("|")})\\(`), n = Object.keys(fi);
-  n.sort((w, V) => V.length - w.length);
+  t.sort((w, L) => L.length - w.length);
+  const i = new RegExp(`^(${t.join("|")})\\(`), n = Object.keys(vi);
+  n.sort((w, L) => L.length - w.length);
   const r = new RegExp(`^(${n.join("|")})`), l = /^(\d+(\.\d+)?)/;
-  let c = "", u, d, p;
+  let c = "", f, d, p;
   for (; o.length > 0; ) {
-    if (u = d, p = void 0, t.length > 0 && i.exec(o)) {
-      const w = t.find((V) => o.startsWith(V));
+    if (f = d, p = void 0, t.length > 0 && i.exec(o)) {
+      const w = t.find((L) => o.startsWith(L));
       w && (p = w + "(", o = o.slice(w.length + 1), d = g.FUNCTION);
     } else if (n.length > 0 && r.exec(o)) {
-      const w = n.find((V) => o.startsWith(V));
+      const w = n.find((L) => o.startsWith(L));
       w && (p = w, o = o.slice(w.length), d = g.CONSTANT);
     } else if (l.exec(o)) {
       const w = l.exec(o);
@@ -615,20 +615,20 @@ function Qi(o, e) {
       }
     if (p === void 0 || d === void 0)
       throw new Error("The token is undefined");
-    c += Ki(u, d), c += p;
+    c += os(f, d), c += p;
   }
   return c;
 }
-function Ki(o, e) {
+function os(o, e) {
   return o === void 0 || o === g.OPERATION || e === g.OPERATION || o === g.LEFT_PARENTHESIS || o === g.FUNCTION || o === g.FUNCTION_ARGUMENT || e === g.RIGHT_PARENTHESIS || e === g.FUNCTION_ARGUMENT ? "" : "*";
 }
-const Ji = {
+const hs = {
   "^": { precedence: 4, associative: "right", type: g.OPERATION },
   "*": { precedence: 3, associative: "left", type: g.OPERATION },
   "/": { precedence: 3, associative: "left", type: g.OPERATION },
   "+": { precedence: 2, associative: "left", type: g.OPERATION },
   "-": { precedence: 2, associative: "left", type: g.OPERATION }
-}, _i = {
+}, as = {
   "^": { precedence: 4, associative: "right", type: g.OPERATION },
   "*": { precedence: 3, associative: "left", type: g.OPERATION },
   "/": { precedence: 3, associative: "left", type: g.OPERATION },
@@ -641,7 +641,7 @@ const Ji = {
   sqrt: { precedence: 4, associative: "right", type: g.FUNCTION },
   nthrt: { precedence: 4, associative: "right", type: g.FUNCTION },
   ",": { precedence: 2, associative: "left", type: g.FUNCTION_ARGUMENT }
-}, es = {
+}, ls = {
   "^": { precedence: 4, associative: "right", type: g.OPERATION },
   "*": { precedence: 3, associative: "left", type: g.OPERATION },
   "/": { precedence: 3, associative: "left", type: g.OPERATION },
@@ -655,26 +655,26 @@ const Ji = {
   nthrt: { precedence: 4, associative: "right", type: g.FUNCTION },
   ln: { precedence: 4, associative: "right", type: g.FUNCTION },
   log: { precedence: 4, associative: "right", type: g.FUNCTION }
-}, ts = {
+}, cs = {
   "&": { precedence: 3, associative: "left", type: g.OPERATION },
   "|": { precedence: 3, associative: "left", type: g.OPERATION },
   "!": { precedence: 4, associative: "right", type: g.OPERATION },
   "-": { precedence: 2, associative: "left", type: g.OPERATION }
 };
-var He, at, ne, bt, Ve;
-class Kt {
+var He, ft, ne, Tt, Fe;
+class si {
   constructor(e) {
-    ot(this, He), ot(this, at, []), ot(this, ne, {}), ot(this, bt, []), ot(this, Ve), Ee(this, He, typeof e > "u" ? Ze.POLYNOM : e), this.tokenConfigInitialization();
+    ct(this, He), ct(this, ft, []), ct(this, ne, {}), ct(this, Tt, []), ct(this, Fe), Ne(this, He, typeof e > "u" ? Ue.POLYNOM : e), this.tokenConfigInitialization();
   }
   // Getter
   get rpn() {
-    return te(this, at);
+    return te(this, ft);
   }
   get rpnToken() {
-    return te(this, at).map((e) => e.token);
+    return te(this, ft).map((e) => e.token);
   }
   tokenConfigInitialization() {
-    return te(this, He) === Ze.SET ? (Ee(this, ne, ts), Ee(this, Ve, !1)) : te(this, He) === Ze.NUMERIC ? (Ee(this, ne, es), Ee(this, Ve, !0)) : te(this, He) === Ze.EXPRESSION ? (Ee(this, ne, _i), Ee(this, Ve, !0)) : (Ee(this, ne, Ji), Ee(this, Ve, !0)), Ee(this, bt, Object.keys(te(this, ne)).sort((e, t) => t.length - e.length)), te(this, ne);
+    return te(this, He) === Ue.SET ? (Ne(this, ne, cs), Ne(this, Fe, !1)) : te(this, He) === Ue.NUMERIC ? (Ne(this, ne, ls), Ne(this, Fe, !0)) : te(this, He) === Ue.EXPRESSION ? (Ne(this, ne, as), Ne(this, Fe, !0)) : (Ne(this, ne, hs), Ne(this, Fe, !0)), Ne(this, Tt, Object.keys(te(this, ne)).sort((e, t) => t.length - e.length)), te(this, ne);
   }
   /**
    * Get the next token to analyse.
@@ -690,12 +690,12 @@ class Kt {
     else if (e[t] === ",")
       i = ",", n = g.FUNCTION_ARGUMENT;
     else {
-      for (const r of te(this, bt))
+      for (const r of te(this, Tt))
         if (e.substring(t, t + r.length) === r) {
           i += r, n = te(this, ne)[r].type;
           break;
         }
-      for (const r in fi)
+      for (const r in vi)
         if (e.substring(t, t + r.length) === r) {
           i += r, n = g.CONSTANT;
           break;
@@ -723,8 +723,8 @@ class Kt {
   parse(e, t) {
     const i = [], n = [];
     let r = "", l = 0, c;
-    (t ?? te(this, Ve)) && (e = Qi(e, te(this, ne)));
-    const u = 50;
+    (t ?? te(this, Fe)) && (e = rs(e, te(this, ne)));
+    const f = 50;
     let d = 50, p;
     for (; l < e.length; ) {
       if (d--, d === 0) {
@@ -744,7 +744,7 @@ class Kt {
         case g.OPERATION:
           if (n.length > 0) {
             let w = n[n.length - 1];
-            for (p = +u; w.token in te(this, ne) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
+            for (p = +f; w.token in te(this, ne) && //either o1 is left-associative and its precedence is less than or equal to that of o2,
             (te(this, ne)[r].associative === "left" && te(this, ne)[r].precedence <= te(this, ne)[w.token].precedence || //or o1 is right associative, and has precedence less than that of o2,
             te(this, ne)[r].associative === "right" && te(this, ne)[r].precedence < te(this, ne)[w.token].precedence); ) {
               if (p--, p === 0) {
@@ -759,7 +759,7 @@ class Kt {
           n.push({ token: r, tokenType: c });
           break;
         case g.FUNCTION_ARGUMENT:
-          for (p = +u; n[n.length - 1].token !== "(" && n.length > 0; ) {
+          for (p = +f; n[n.length - 1].token !== "(" && n.length > 0; ) {
             if (p--, p === 0) {
               console.log("SECURITY LEVEL 2 FUNCTION ARGUMENT EXIT");
               break;
@@ -771,7 +771,7 @@ class Kt {
           n.push({ token: r, tokenType: c }), e[l] === "-" && i.push({ token: "0", tokenType: g.COEFFICIENT });
           break;
         case g.RIGHT_PARENTHESIS:
-          for (p = +u; n[n.length - 1].token !== "(" && n.length > 1; ) {
+          for (p = +f; n[n.length - 1].token !== "(" && n.length > 1; ) {
             if (p--, p === 0) {
               console.log("SECURITY LEVEL 2 CLOSING PARENTHESIS EXIT");
               break;
@@ -787,15 +787,15 @@ class Kt {
           throw new Error(`Token type ${r} is not handled`);
       }
     }
-    return Ee(this, at, i.concat(n.reverse())), this;
+    return Ne(this, ft, i.concat(n.reverse())), this;
   }
 }
-He = /* @__PURE__ */ new WeakMap(), at = /* @__PURE__ */ new WeakMap(), ne = /* @__PURE__ */ new WeakMap(), bt = /* @__PURE__ */ new WeakMap(), Ve = /* @__PURE__ */ new WeakMap();
-class is {
+He = /* @__PURE__ */ new WeakMap(), ft = /* @__PURE__ */ new WeakMap(), ne = /* @__PURE__ */ new WeakMap(), Tt = /* @__PURE__ */ new WeakMap(), Fe = /* @__PURE__ */ new WeakMap();
+class us {
   constructor(e, t) {
-    ei(this, "_rpn"), ei(this, "_expression"), ei(this, "_isValid"), this._expression = e;
+    oi(this, "_rpn"), oi(this, "_expression"), oi(this, "_isValid"), this._expression = e;
     try {
-      this._rpn = new Kt(Ze.NUMERIC).parse(e, t).rpn;
+      this._rpn = new si(Ue.NUMERIC).parse(e, t).rpn;
     } catch {
       throw this._rpn = null, this._isValid = !1, new Error(`There was a problem parsing: ${e}`);
     }
@@ -836,7 +836,7 @@ class is {
       else if (i.tokenType === g.VARIABLE && e !== void 0)
         Object.hasOwn(e, i.token) && t.push(+e[i.token]);
       else if (i.tokenType === g.CONSTANT)
-        t.push(fi[i.token]);
+        t.push(vi[i.token]);
       else if (i.tokenType === g.OPERATION) {
         if (i.token === "*") {
           const n = t.pop(), r = t.pop();
@@ -891,17 +891,17 @@ class is {
     return +e.toFixed(t);
   }
 }
-var T, b, Qe, xt, ze, kt, Mt;
-const I = class I {
+var T, b, _e, Ot, Ze, St, It;
+const P = class P {
   constructor(e) {
-    m(this, Qe);
+    m(this, _e);
     m(this, T);
     m(this, b);
     /**
      * Clone the current Monom.
      */
     a(this, "clone", () => {
-      const e = new I();
+      const e = new P();
       e.coefficient = s(this, T).clone();
       for (const t in s(this, b))
         e.setLetter(t, s(this, b)[t].clone());
@@ -913,8 +913,8 @@ const I = class I {
      */
     a(this, "add", (...e) => {
       for (const t of e) {
-        const i = t instanceof I ? t : new I(t);
-        this.isSameAs(i) ? (this.isZero() && A(this, Qe, xt).call(this, i), s(this, T).add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
+        const i = t instanceof P ? t : new P(t);
+        this.isSameAs(i) ? (this.isZero() && A(this, _e, Ot).call(this, i), s(this, T).add(i.coefficient)) : console.log("Add monom: " + this.display + " is not similar with ", i.display);
       }
       return this;
     });
@@ -923,7 +923,7 @@ const I = class I {
      * 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 f().zero() : e === void 0 ? Object.values(s(this, b)).reduce((t, i) => t.clone().add(i)) : this.hasVariable(e) ? s(this, b)[e].clone() : new f().zero());
+    a(this, "degree", (e) => this.variables.length === 0 ? new u().zero() : e === void 0 ? Object.values(s(this, b)).reduce((t, i) => t.clone().add(i)) : this.hasVariable(e) ? s(this, b)[e].clone() : new u().zero());
     /**
      * Derivative the monom
      * @param letter
@@ -931,9 +931,9 @@ const I = class I {
     a(this, "derivative", (e) => {
       if (e === void 0 && (e = "x"), this.hasVariable(e)) {
         const t = s(this, b)[e].clone(), i = this.clone();
-        return s(i, b)[e].subtract(1), s(i, T).multiply(new f(t.clone())), i;
+        return s(i, b)[e].subtract(1), s(i, T).multiply(new u(t.clone())), i;
       } else
-        return new I().zero();
+        return new P().zero();
     });
     /**
      * Divide the current monoms by multiple monoms
@@ -941,7 +941,7 @@ const I = class I {
      */
     a(this, "divide", (...e) => {
       for (const t of e) {
-        const i = t instanceof I ? t : new I(t);
+        const i = t instanceof P ? t : new P(t);
         s(this, T).divide(i.coefficient);
         for (const n in i.literal)
           s(this, b)[n] = this.hasVariable(n) ? s(this, b)[n].subtract(i.literal[n]) : i.literal[n].clone().opposite(), s(this, b)[n].isZero() && this.removeVariable(n);
@@ -955,31 +955,31 @@ const I = class I {
      */
     a(this, "evaluate", (e, t) => {
       if (t === !0) {
-        if (e instanceof f)
-          return s(this, ze).call(this, e.value);
-        if (e instanceof vt)
-          return new f().invalid();
+        if (e instanceof u)
+          return s(this, Ze).call(this, e.value);
+        if (e instanceof At)
+          return new u().invalid();
         if (typeof e == "number")
-          return s(this, ze).call(this, e);
+          return s(this, Ze).call(this, e);
         if (typeof e == "object") {
           const n = {};
           for (const r in e)
-            n[r] = new f(e[r]).value;
-          return s(this, ze).call(this, n);
+            n[r] = new u(e[r]).value;
+          return s(this, Ze).call(this, n);
         }
       }
       const i = this.coefficient.clone();
-      if (typeof e == "number" || e instanceof f) {
+      if (typeof e == "number" || e instanceof u) {
         const n = {};
-        return n[this.variables[0]] = new f(e), this.evaluate(n);
+        return n[this.variables[0]] = new u(e), this.evaluate(n);
       }
-      if (e instanceof vt)
-        return new f().invalid();
+      if (e instanceof At)
+        return new u().invalid();
       if (typeof e == "object") {
         if (this.variables.length === 0)
           return this.coefficient;
         for (const n in s(this, b)) {
-          const r = new f(e[n]);
+          const r = new u(e[n]);
           i.multiply(r.pow(s(this, b)[n]));
         }
       }
@@ -1048,7 +1048,7 @@ const I = class I {
      */
     a(this, "multiply", (...e) => {
       for (const t of e) {
-        const i = t instanceof I ? t : new I(t);
+        const i = t instanceof P ? t : new P(t);
         s(this, T).multiply(i.coefficient);
         for (const n in i.literal)
           this.hasVariable(n) ? s(this, b)[n].add(i.literal[n]) : s(this, b)[n] = i.literal[n].clone();
@@ -1058,7 +1058,7 @@ const I = class I {
     /**
      * Create a one value monom
      */
-    a(this, "one", () => (h(this, T, new f().one()), h(this, b, {}), this));
+    a(this, "one", () => (h(this, T, new u().one()), h(this, b, {}), this));
     /**
      * Get the opposite
      * Returns a monom.
@@ -1078,7 +1078,7 @@ const I = class I {
       e === void 0 && (e = "x");
       const t = this.clone();
       let i;
-      return t.hasVariable(e) ? (i = t.degree(e).clone().add(1), t.coefficient = t.coefficient.clone().divide(i), t.setLetter(e, i)) : (t.coefficient.isZero() && (t.coefficient = new f().one()), t.setLetter(e, 1)), t;
+      return t.hasVariable(e) ? (i = t.degree(e).clone().add(1), t.coefficient = t.coefficient.clone().divide(i), t.setLetter(e, i)) : (t.coefficient.isZero() && (t.coefficient = new u().one()), t.setLetter(e, 1)), t;
     });
     a(this, "reduce", () => {
       this.coefficient.reduce();
@@ -1097,7 +1097,7 @@ const I = class I {
      * @param letter (string) Letter to change
      * @param pow (number) Power of the setLetter (must be positive integer.
      */
-    a(this, "setLetter", (e, t) => t instanceof f ? (this.hasVariable(e) && t.isZero() && this.removeVariable(e), s(this, b)[e] = t.clone(), this) : this.setLetter(e, new f(t)));
+    a(this, "setLetter", (e, t) => t instanceof u ? (this.hasVariable(e) && t.isZero() && this.removeVariable(e), s(this, b)[e] = t.clone(), this) : this.setLetter(e, new u(t)));
     /**
      * Return the square root of a monom
      */
@@ -1115,75 +1115,75 @@ const I = class I {
      */
     a(this, "subtract", (...e) => {
       for (const t of e) {
-        const i = t instanceof I ? t : new I(t);
-        this.isSameAs(i) ? (this.isZero() && A(this, Qe, xt).call(this, i), s(this, T).add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
+        const i = t instanceof P ? t : new P(t);
+        this.isSameAs(i) ? (this.isZero() && A(this, _e, Ot).call(this, i), s(this, T).add(i.clone().coefficient.opposite())) : console.log("Subtract: Is not similar: ", i.display);
       }
       return this;
     });
     /**
      * Create a zero value monom
      */
-    a(this, "zero", () => (h(this, T, new f().zero()), h(this, b, {}), this));
-    m(this, ze, (e) => {
+    a(this, "zero", () => (h(this, T, new u().zero()), h(this, b, {}), this));
+    m(this, Ze, (e) => {
       let t = this.coefficient.value;
       if (typeof e == "number") {
         const i = {}, n = this.variables[0];
-        return i[n] = e, s(this, ze).call(this, i);
+        return i[n] = e, s(this, Ze).call(this, i);
       }
-      if (e instanceof f) {
+      if (e instanceof u) {
         const i = {};
-        return i[this.variables[0]] = new f(e).value, s(this, ze).call(this, i);
+        return i[this.variables[0]] = new u(e).value, s(this, Ze).call(this, i);
       }
-      if (e instanceof vt)
+      if (e instanceof At)
         return NaN;
       if (typeof e == "object") {
         if (this.variables.length === 0)
           return this.coefficient.value;
         for (const i in s(this, b)) {
           const n = e[i];
-          n instanceof f ? t *= n.value ** s(this, b)[i].value : t *= n ** s(this, b)[i].value;
+          n instanceof u ? t *= n.value ** s(this, b)[i].value : t *= n ** s(this, b)[i].value;
         }
       }
       return t;
     });
-    m(this, kt, (e) => {
-      const i = new Kt().parse(e).rpn, n = [];
+    m(this, St, (e) => {
+      const i = new si().parse(e).rpn, n = [];
       if (i.length === 0)
         return this.zero(), this;
       if (i.length === 1) {
         const r = i[0];
-        return this.one(), r.tokenType === g.COEFFICIENT ? this.coefficient = new f(r.token) : r.tokenType === g.VARIABLE && this.setLetter(r.token, 1), this;
+        return this.one(), r.tokenType === g.COEFFICIENT ? this.coefficient = new u(r.token) : r.tokenType === g.VARIABLE && this.setLetter(r.token, 1), this;
       } else
         for (const r of i)
-          s(this, Mt).call(this, n, r);
+          s(this, It).call(this, n, r);
       return this.one(), this.multiply(n[0]), this;
     });
-    m(this, Mt, (e, t) => {
-      var u;
+    m(this, It, (e, t) => {
+      var f;
       let i, n, r, l, c;
       if (t.tokenType === g.COEFFICIENT)
-        e.push(new I(new f(t.token)));
+        e.push(new P(new u(t.token)));
       else if (t.tokenType === g.VARIABLE) {
-        const d = new I().one();
+        const d = new P().one();
         d.setLetter(t.token, 1), e.push(d.clone());
       } else if (t.tokenType === g.OPERATION)
         switch (t.token) {
           case "-":
-            n = e.pop() ?? new I().zero(), i = e.pop() ?? new I().zero(), e.push(i.subtract(n));
+            n = e.pop() ?? new P().zero(), i = e.pop() ?? new P().zero(), e.push(i.subtract(n));
             break;
           case "*":
-            n = e.pop() ?? new I().one(), i = e.pop() ?? new I().one(), e.push(i.multiply(n));
+            n = e.pop() ?? new P().one(), i = e.pop() ?? new P().one(), e.push(i.multiply(n));
             break;
           case "/":
-            n = e.pop() ?? new I().one(), i = e.pop() ?? new I().one(), e.push(i.divide(n));
+            n = e.pop() ?? new P().one(), i = e.pop() ?? new P().one(), e.push(i.divide(n));
             break;
           case "^": {
-            c = ((u = e.pop()) == null ? void 0 : u.coefficient) ?? new f().one(), r = e.pop() ?? new I().one(), l = r.variables[0], l && r.setLetter(l, c), e.push(r);
+            c = ((f = e.pop()) == null ? void 0 : f.coefficient) ?? new u().one(), r = e.pop() ?? new P().one(), l = r.variables[0], l && r.setLetter(l, c), e.push(r);
             break;
           }
         }
     });
-    return h(this, T, new f().zero()), h(this, b, {}), e !== void 0 && this.parse(e), this;
+    return h(this, T, new u().zero()), h(this, b, {}), e !== void 0 && this.parse(e), this;
   }
   // -----------------------------------------
   /**
@@ -1191,7 +1191,7 @@ const I = class I {
    * @param inputStr
    */
   parse(e) {
-    return h(this, T, new f()), h(this, b, {}), typeof e == "string" ? s(this, kt).call(this, e) : typeof e == "number" ? h(this, T, new f(e)) : e instanceof f ? h(this, T, e.clone()) : e instanceof I && (h(this, T, s(e, T).clone()), A(this, Qe, xt).call(this, e)), this;
+    return h(this, T, new u()), h(this, b, {}), typeof e == "string" ? s(this, St).call(this, e) : typeof e == "number" ? h(this, T, new u(e)) : e instanceof u ? h(this, T, e.clone()) : e instanceof P && (h(this, T, s(e, T).clone()), A(this, _e, Ot).call(this, e)), this;
   }
   /**
    * Get the coefficient \\(k\\) of the Monom \\(k\\cdot x^{n}\\)
@@ -1205,7 +1205,7 @@ const I = class I {
    * @param {Fraction | number | string} F
    */
   set coefficient(e) {
-    h(this, T, new f(e));
+    h(this, T, new u(e));
   }
   // Display getter
   /**
@@ -1225,7 +1225,7 @@ const I = class I {
       return [this.clone()];
     if (this.coefficient.numerator > 1e6)
       return [this.clone()];
-    const e = U.dividers(Math.abs(this.coefficient.numerator));
+    const e = G.dividers(Math.abs(this.coefficient.numerator));
     let t = [];
     for (const n in this.literal)
       t = this._getLiteralDividers(t, n);
@@ -1233,20 +1233,20 @@ const I = class I {
     if (t.length > 0 && e.length > 0)
       for (const n of e)
         for (const r of t) {
-          const l = new I();
-          l.coefficient = new f(n), l.literal = r, i.push(l);
+          const l = new P();
+          l.coefficient = new u(n), l.literal = r, i.push(l);
         }
     else if (e.length === 0)
       for (const n of t) {
-        const r = new I();
-        r.coefficient = new f().one(), r.literal = n, i.push(r);
+        const r = new P();
+        r.coefficient = new u().one(), r.literal = n, i.push(r);
       }
     else
       for (const n of e) {
-        const r = new I();
-        r.coefficient = new f(n), i.push(r);
+        const r = new P();
+        r.coefficient = new u(n), i.push(r);
       }
-    return i.length === 0 ? [new I().one()] : i;
+    return i.length === 0 ? [new P().one()] : i;
   }
   integrate(e, t, i) {
     const n = this.primitive(i);
@@ -1285,9 +1285,9 @@ const I = class I {
    */
   set literalStr(e) {
     for (const t of [...e.matchAll(/([a-z])\^([+-]?[0-9]+)/g)])
-      t[1] in s(this, b) || (s(this, b)[t[1]] = new f().zero()), s(this, b)[t[1]].add(+t[2]);
+      t[1] in s(this, b) || (s(this, b)[t[1]] = new u().zero()), s(this, b)[t[1]].add(+t[2]);
     for (const t of [...e.matchAll(/([a-z](?!\^))/g)])
-      t[1] in s(this, b) || (s(this, b)[t[1]] = new f().zero()), s(this, b)[t[1]].add(1);
+      t[1] in s(this, b) || (s(this, b)[t[1]] = new u().zero()), s(this, b)[t[1]].add(1);
   }
   get plotFunction() {
     let e = "";
@@ -1326,73 +1326,73 @@ const I = class I {
     for (let n = 0; n <= this.literal[t].value; n++)
       if (e.length === 0) {
         const r = {};
-        r[t] = new f(n), i.push(r);
+        r[t] = new u(n), i.push(r);
       } else
         for (const r of e) {
           const l = {};
           for (const c in r)
             l[c] = r[c];
-          l[t] = new f(n), i.push(l);
+          l[t] = new u(n), i.push(l);
         }
     return i;
   }
 };
-T = new WeakMap(), b = new WeakMap(), Qe = new WeakSet(), xt = function(e) {
+T = new WeakMap(), b = new WeakMap(), _e = new WeakSet(), Ot = function(e) {
   for (const t in e.literal)
     s(this, b)[t] = e.literal[t].clone();
-}, ze = new WeakMap(), kt = new WeakMap(), Mt = new WeakMap(), a(I, "gcd", (...e) => {
+}, Ze = new WeakMap(), St = new WeakMap(), It = new WeakMap(), a(P, "gcd", (...e) => {
   for (const r of e)
     if (r.containsRationalPower())
-      return new I().zero();
-  const t = new I(), i = U.gcd(...e.map((r) => r.coefficient.numerator)), n = U.lcm(...e.map((r) => r.coefficient.denominator));
-  t.coefficient = new f(i, n).reduce();
+      return new P().zero();
+  const t = new P(), i = G.gcd(...e.map((r) => r.coefficient.numerator)), n = G.lcm(...e.map((r) => r.coefficient.denominator));
+  t.coefficient = new u(i, n).reduce();
   for (const r of e) {
     for (const l in t.literal)
       l in r.literal || t.literal[l].zero();
     for (const l in r.literal)
-      !t.hasVariable(l) && r.literal[l].isStrictlyPositive() ? t.literal[l] = r.literal[l].clone() : t.literal[l] = new f(Math.min(r.literal[l].value, t.literal[l].value));
+      !t.hasVariable(l) && r.literal[l].isStrictlyPositive() ? t.literal[l] = r.literal[l].clone() : t.literal[l] = new u(Math.min(r.literal[l].value, t.literal[l].value));
   }
   return t;
 }), /**
  * Multiply two monoms and return a NEW monom.
  * @param monoms
  */
-a(I, "xMultiply", (...e) => {
-  const t = new I().one();
+a(P, "xMultiply", (...e) => {
+  const t = new P().one();
   for (const i of e)
     t.multiply(i);
   return t;
 });
-let M = I;
-function yi(o, e = !0) {
+let k = P;
+function qi(o, e = !0) {
   return e ? `\\left( ${o} \\right)` : `(${o})`;
 }
-function Et(o, e, t, i, n) {
+function Ct(o, e, t, i, n) {
   return o.map((r, l) => r === e ? t : r);
 }
-var je, y, Ke, ft, Je, dt, Ct, Pt, $t, _e, It, pt, St, Bt, Rt, zt, ki, Lt, Vt;
-const P = class P {
+var We, y, et, gt, tt, yt, zt, Rt, Dt, it, Lt, wt, Zt, Vt, Ft, jt, Ii, Ut, Gt;
+const $ = class $ {
   constructor(e, ...t) {
-    m(this, zt);
-    m(this, je);
+    m(this, jt);
+    m(this, We);
     m(this, y);
-    m(this, Ke);
-    m(this, ft, !1);
+    m(this, et);
+    m(this, gt, !1);
     /**
      * Parse a string to a polynom.
      * @param inputStr
      * @param values
      */
     a(this, "parse", (e, ...t) => {
-      if (h(this, y, []), h(this, je, []), typeof e == "string")
-        return A(this, zt, ki).call(this, e, ...t);
-      if ((typeof e == "number" || e instanceof f || e instanceof M) && t.length === 0)
-        s(this, y).push(new M(e));
-      else if (e instanceof M && t.length > 0)
-        s(this, y).push(new M(e)), t.forEach((i) => {
-          s(this, y).push(new M(i));
+      if (h(this, y, []), h(this, We, []), typeof e == "string")
+        return A(this, jt, Ii).call(this, e, ...t);
+      if ((typeof e == "number" || e instanceof u || e instanceof k) && t.length === 0)
+        s(this, y).push(new k(e));
+      else if (e instanceof k && t.length > 0)
+        s(this, y).push(new k(e)), t.forEach((i) => {
+          s(this, y).push(new k(i));
         });
-      else if (e instanceof P)
+      else if (e instanceof $)
         for (const i of e.monoms)
           s(this, y).push(i.clone());
       return this;
@@ -1401,56 +1401,56 @@ const P = class P {
      * Clone the polynom
      */
     a(this, "clone", () => {
-      const e = new P(), t = [];
+      const e = new $(), t = [];
       for (const i of s(this, y))
         t.push(i.clone());
       return e.monoms = t, e;
     });
     a(this, "add", (...e) => {
       for (const t of e)
-        t instanceof P ? h(this, y, s(this, y).concat(t.monoms)) : t instanceof M ? s(this, y).push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? s(this, y).push(new M(t.toString())) : s(this, y).push(new M(t));
+        t instanceof $ ? h(this, y, s(this, y).concat(t.monoms)) : t instanceof k ? s(this, y).push(t.clone()) : typeof t == "number" && Number.isSafeInteger(t) ? s(this, y).push(new k(t.toString())) : s(this, y).push(new k(t));
       return this.reduce();
     });
     a(this, "commonMonom", () => {
-      const e = new M().one(), t = this.gcdNumerator(), i = this.gcdDenominator(), n = this.degree();
-      e.coefficient = new f(t, i);
+      const e = new k().one(), t = this.gcdNumerator(), i = this.gcdDenominator(), n = this.degree();
+      e.coefficient = new u(t, i);
       for (const r of this.variables) {
         e.setLetter(r, n);
         for (const l of s(this, y))
-          if (e.setLetter(r, f.min(l.degree(r), e.degree(r))), e.degree(r).isZero())
+          if (e.setLetter(r, u.min(l.degree(r), e.degree(r))), e.degree(r).isZero())
             break;
       }
       return e;
     });
     a(this, "degree", (e) => {
-      let t = new f().zero();
+      let t = new u().zero();
       for (const i of s(this, y))
-        t = f.max(i.degree(e).value, t);
+        t = u.max(i.degree(e).value, t);
       return t;
     });
     a(this, "derivative", (e) => {
-      const t = new P();
+      const t = new $();
       for (const i of s(this, y))
         t.add(i.derivative(e));
       return t.reduce();
     });
     a(this, "divide", (e) => {
-      if (e instanceof f)
-        return s(this, dt).call(this, e);
+      if (e instanceof u)
+        return s(this, yt).call(this, e);
       if (typeof e == "number" && Number.isSafeInteger(e))
-        return s(this, Ct).call(this, e);
-      if (e instanceof M)
-        return this.divide(new P(e));
-      if (e instanceof P) {
+        return s(this, zt).call(this, e);
+      if (e instanceof k)
+        return this.divide(new $(e));
+      if (e instanceof $) {
         if (e.monoms.length === 1 && e.variables.length === 0)
-          return s(this, dt).call(this, e.monoms[0].coefficient);
+          return s(this, yt).call(this, e.monoms[0].coefficient);
         {
           const { quotient: t, reminder: i } = this.euclidean(e);
           if (i.isZero())
             return h(this, y, t.monoms), this;
         }
       } else if (typeof e == "string")
-        return this.divide(new P(e));
+        return this.divide(new $(e));
       throw new Error(`Cannot divide by ${e}`);
     });
     a(this, "empty", () => (h(this, y, []), this));
@@ -1460,22 +1460,22 @@ const P = class P {
      * returns {quotient: Polynom, reminder: Polynom}
      */
     a(this, "euclidean", (e) => {
-      const t = e.variables[0], i = new P().zero(), n = this.clone().reorder(t);
+      const t = e.variables[0], i = new $().zero(), n = this.clone().reorder(t);
       if (e.variables.length === 0)
         return {
           quotient: this.clone().divide(e).reduce(),
-          reminder: new P().zero()
+          reminder: new $().zero()
         };
       const r = e.monomByDegree(void 0, t), l = e.degree(t);
-      let c, u = this.degree(t).value * 2;
-      for (; n.degree(t).isGeq(l) && u > 0 && (u--, c = n.monomByDegree(void 0, t).clone().divide(r), !(!c.isZero() && (i.add(c), n.subtract(e.clone().multiply(c)).reduce(), c.degree(t).isZero()))); )
+      let c, f = this.degree(t).value * 2;
+      for (; n.degree(t).isGeq(l) && f > 0 && (f--, c = n.monomByDegree(void 0, t).clone().divide(r), !(!c.isZero() && (i.add(c), n.subtract(e.clone().multiply(c)).reduce(), c.degree(t).isZero()))); )
         ;
       return i.reduce(), n.reduce(), { quotient: i, reminder: n };
     });
     a(this, "evaluate", (e, t) => {
       if (t)
-        return s(this, Pt).call(this, e);
-      const i = new f().zero();
+        return s(this, Rt).call(this, e);
+      const i = new u().zero();
       return s(this, y).forEach((n) => {
         i.add(n.evaluate(e, t));
       }), i;
@@ -1489,7 +1489,7 @@ const P = class P {
       let t = [], i = this.clone().reorder();
       const n = i.commonMonom();
       if (i.monomByDegree().coefficient.isStrictlyNegative() && n.coefficient.isStrictlyPositive() && !n.isOne() && n.opposite(), !n.isOne()) {
-        const c = new P(n);
+        const c = new $(n);
         t = [c.clone()], i = i.euclidean(c).quotient;
       }
       let r = i.degree().clone().multiply(2).value, l = 1;
@@ -1501,24 +1501,24 @@ const P = class P {
           t.push(i.clone()), i.one();
           break;
         } else {
-          let c = s(this, It).call(this, i, l, e ?? "x");
+          let c = s(this, Lt).call(this, i, l, e ?? "x");
           for (l = i.degree(e).value; c.length > 0; ) {
-            const u = c[0];
-            if (!i.isDividableBy(u))
+            const f = c[0];
+            if (!i.isDividableBy(f))
               c.shift();
             else {
-              const d = i.euclidean(u);
-              t.push(u), i = d.quotient.clone(), c = c.filter((p) => {
-                const w = i.monoms[0], V = i.monoms[i.monoms.length - 1], ce = p.monoms[0], ue = p.monoms[p.monoms.length - 1];
-                return V.isDivisible(ue) ? w.isDivisible(ce) : !1;
+              const d = i.euclidean(f);
+              t.push(f), i = d.quotient.clone(), c = c.filter((p) => {
+                const w = i.monoms[0], L = i.monoms[i.monoms.length - 1], ce = p.monoms[0], ue = p.monoms[p.monoms.length - 1];
+                return L.isDivisible(ue) ? w.isDivisible(ce) : !1;
               });
             }
           }
         }
-      return i.isOne() || t.push(i.clone()), h(this, je, t), s(this, je);
+      return i.isOne() || t.push(i.clone()), h(this, We, t), s(this, We);
     });
-    a(this, "gcdDenominator", () => U.gcd(...this.getDenominators()));
-    a(this, "gcdNumerator", () => U.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 = [];
@@ -1532,10 +1532,10 @@ const P = class P {
         e.push(t.coefficient.numerator);
       return e;
     });
-    a(this, "getZeroes", () => this.degree().isZero() ? [] : (this.roots = new At(this.clone()).solve(), this.roots));
+    a(this, "getZeroes", () => this.degree().isZero() ? [] : (this.roots = new Mt(this.clone()).solve(), this.roots));
     a(this, "integrate", (e, t, i = "x") => {
       const n = this.primitive(i), r = {}, l = {};
-      return r[i] = new f(e), l[i] = new f(t), n.evaluate(l).subtract(n.evaluate(r));
+      return r[i] = new u(e), l[i] = new u(t), n.evaluate(l).subtract(n.evaluate(r));
     });
     a(this, "isDeveloped", (e) => {
       let t;
@@ -1543,7 +1543,7 @@ const P = class P {
       if (i.includes("(") || i.includes(")"))
         return !1;
       try {
-        t = new P(e);
+        t = new $(e);
       } catch {
         return !1;
       }
@@ -1552,18 +1552,18 @@ const P = class P {
     a(this, "isDividableBy", (e) => {
       if (e.degree().isOne()) {
         const t = e.getZeroes()[0];
-        return t.exact instanceof f ? this.evaluate(t.exact).isZero() : !1;
+        return t.exact instanceof u ? this.evaluate(t.exact).isZero() : !1;
       } else {
         const { reminder: t } = this.euclidean(e);
         return t.isZero();
       }
     });
-    a(this, "isEqual", (e) => s(this, Je).call(this, e, "="));
-    a(this, "isOppositeAt", (e) => s(this, Je).call(this, e.clone().opposite(), "="));
+    a(this, "isEqual", (e) => s(this, tt).call(this, e, "="));
+    a(this, "isOppositeAt", (e) => s(this, tt).call(this, e.clone().opposite(), "="));
     a(this, "isReduced", (e) => {
       if (!this.isDeveloped(e))
         return !1;
-      const t = new P(e);
+      const t = new $(e);
       if (t.monoms.length > this.monoms.length)
         return !1;
       for (const i of t.monoms)
@@ -1571,9 +1571,9 @@ const P = class P {
           return !1;
       return !1;
     });
-    a(this, "isSameAs", (e) => s(this, Je).call(this, e, "same"));
-    a(this, "lcmDenominator", () => U.lcm(...this.getDenominators()));
-    a(this, "lcmNumerator", () => U.lcm(...this.getNumerators()));
+    a(this, "isSameAs", (e) => s(this, tt).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 s(this, y))
@@ -1582,11 +1582,11 @@ const P = class P {
     });
     a(this, "limitToInfinity", (e) => {
       const t = this.monomByDegree(void 0, e), i = t.coefficient.sign(), n = t.degree(e);
-      return n.isStrictlyPositive() ? i === 1 ? new f().infinite() : new f().infinite().opposite() : n.isZero() ? t.coefficient : new f().zero();
+      return n.isStrictlyPositive() ? i === 1 ? new u().infinite() : new u().infinite().opposite() : n.isZero() ? t.coefficient : new u().zero();
     });
     a(this, "limitToNegativeInfinity", (e) => {
       const t = this.monomByDegree(void 0, e), i = t.coefficient.sign(), n = t.degree(e);
-      return n.isStrictlyPositive() ? i === -1 ? new f().infinite() : new f().infinite().opposite() : n.isZero() ? t.coefficient : new f().zero();
+      return n.isStrictlyPositive() ? i === -1 ? new u().infinite() : new u().infinite().opposite() : n.isZero() ? t.coefficient : new u().zero();
     });
     a(this, "monomByDegree", (e, t) => {
       if (e === void 0)
@@ -1595,7 +1595,7 @@ const P = class P {
       for (const n of s(i, y))
         if (n.degree(t).isEqual(e))
           return n.clone();
-      return new M().zero();
+      return new k().zero();
     });
     // Used in LinearSystem.tex
     a(this, "monomByLetter", (e) => {
@@ -1603,7 +1603,7 @@ const P = class P {
       for (const i of s(t, y))
         if (i.hasVariable(e))
           return i.clone();
-      return new M().zero();
+      return new k().zero();
     });
     a(this, "monomsByDegree", (e, t) => {
       if (e === void 0)
@@ -1613,8 +1613,8 @@ const P = class P {
         r.degree(t).isEqual(e) && i.push(r.clone());
       return i;
     });
-    a(this, "multiply", (e) => e instanceof P ? s(this, Rt).call(this, e) : e instanceof f ? s(this, pt).call(this, e) : e instanceof M ? s(this, Bt).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? s(this, St).call(this, e) : this);
-    a(this, "one", () => (h(this, y, []), s(this, y).push(new M().one()), this));
+    a(this, "multiply", (e) => e instanceof $ ? s(this, Ft).call(this, e) : e instanceof u ? s(this, wt).call(this, e) : e instanceof k ? s(this, Vt).call(this, e) : Number.isSafeInteger(e) && typeof e == "number" ? s(this, Zt).call(this, e) : this);
+    a(this, "one", () => (h(this, y, []), s(this, y).push(new k().one()), this));
     // ------------------------------------------
     a(this, "opposite", () => (h(this, y, s(this, y).map((e) => e.opposite())), this));
     a(this, "pow", (e) => {
@@ -1623,14 +1623,14 @@ const P = class P {
       if (e < 0)
         return this.zero();
       if (e === 0)
-        return new P();
+        return new $();
       const t = this.clone();
       for (let i = 1; i < e; i++)
         this.multiply(t);
       return this.reduce();
     });
     a(this, "primitive", (e) => {
-      const t = new P();
+      const t = new $();
       for (const i of s(this, y))
         t.add(i.primitive(e));
       return t;
@@ -1639,13 +1639,13 @@ const P = class P {
       let e = 0;
       for (; e < s(this, y).length; ) {
         for (let t = e + 1; t < s(this, y).length; t++)
-          s(this, y)[e].isSameAs(s(this, y)[t]) && (s(this, y)[e].add(s(this, y)[t]), s(this, y).splice(t, 1), s(this, y)[e].isZero() && (s(this, y)[e] = new M().zero()), t--);
+          s(this, y)[e].isSameAs(s(this, y)[t]) && (s(this, y)[e].add(s(this, y)[t]), s(this, y).splice(t, 1), s(this, y)[e].isZero() && (s(this, y)[e] = new k().zero()), t--);
         e++;
       }
       h(this, y, s(this, y).filter((t) => !t.coefficient.isZero()));
       for (const t of s(this, y))
         t.coefficient.reduce();
-      return this.length === 0 ? new P().zero() : this.reorder();
+      return this.length === 0 ? new $().zero() : this.reorder();
     });
     // ------------------------------------------
     a(this, "reorder", (e = "x", t) => {
@@ -1656,8 +1656,8 @@ const P = class P {
         if (l !== c)
           return t ? l - c : c - l;
         if (i.length > 0)
-          for (const u of i) {
-            const d = n.degree(u).value, p = r.degree(u).value;
+          for (const f of i) {
+            const d = n.degree(f).value, p = r.degree(f).value;
             if (d !== p)
               return t ? d - p : p - d;
           }
@@ -1671,22 +1671,22 @@ const P = class P {
      */
     a(this, "replaceBy", (e, t) => {
       let i;
-      const n = new P().zero();
+      const n = new $().zero();
       for (const r of this.monoms)
         !r.hasVariable(e) || r.literal[e].isZero() ? n.add(r.clone()) : (i = r.literal[e].clone(), r.removeVariable(e), n.add(t.clone().pow(Math.abs(i.numerator)).multiply(r)));
       return h(this, y, n.reduce().monoms), this;
     });
     a(this, "subtract", (...e) => {
       for (const t of e)
-        t instanceof P ? this.add(t.clone().opposite()) : t instanceof M ? s(this, y).push(t.clone().opposite()) : s(this, y).push(new M(t).opposite());
+        t instanceof $ ? this.add(t.clone().opposite()) : t instanceof k ? s(this, y).push(t.clone().opposite()) : s(this, y).push(new k(t).opposite());
       return this.reduce();
     });
     /**
      * Set the polynom to zero.
      * @returns {this}
      */
-    a(this, "zero", () => (h(this, y, []), s(this, y).push(new M().zero()), this));
-    m(this, Je, (e, t) => {
+    a(this, "zero", () => (h(this, y, []), s(this, y).push(new k().zero()), this));
+    m(this, tt, (e, t) => {
       t === void 0 && (t = "=");
       const i = this.clone().reduce().reorder(), n = e.clone().reduce().reorder();
       switch (t) {
@@ -1698,47 +1698,47 @@ const P = class P {
           return !1;
       }
     });
-    m(this, dt, (e) => {
+    m(this, yt, (e) => {
       for (const t of s(this, y))
         t.coefficient.divide(e);
       return this;
     });
-    m(this, Ct, (e) => {
-      const t = new f(e);
+    m(this, zt, (e) => {
+      const t = new u(e);
       for (const i of s(this, y))
         i.coefficient.divide(t);
       return this;
     });
-    m(this, Pt, (e) => {
+    m(this, Rt, (e) => {
       let t = 0;
       return s(this, y).forEach((i) => {
         t += i.evaluate(e, !0);
       }), t;
     });
-    m(this, $t, (e) => {
+    m(this, Dt, (e) => {
       var w;
-      let t, i, n, r, l, c, u, d, p;
+      let t, i, n, r, l, c, f, d, p;
       if (this.numberOfVars === 1)
-        return n = this.monomByDegree(2, e).coefficient, r = this.monomByDegree(1, e).coefficient, l = this.monomByDegree(0, e).coefficient, c = r.clone().pow(2).subtract(n.clone().multiply(l).multiply(4)), c.isZero() ? (u = r.clone().opposite().divide(n.clone().multiply(2)), t = new P(e).subtract(u.display).multiply(u.denominator), i = new P(e).subtract(u.display).multiply(u.denominator), p = n.divide(u.denominator).divide(u.denominator), p.isOne() ? [t, i] : [new P(p.display), t, i]) : c.isPositive() && c.isSquare() ? (u = r.clone().opposite().add(c.clone().sqrt()).divide(n.clone().multiply(2)), d = r.clone().opposite().subtract(c.clone().sqrt()).divide(n.clone().multiply(2)), p = n.divide(u.denominator).divide(d.denominator), p.isOne() ? [
-          new P(e).subtract(u.display).multiply(u.denominator),
-          new P(e).subtract(d.display).multiply(d.denominator)
+        return n = this.monomByDegree(2, e).coefficient, r = this.monomByDegree(1, e).coefficient, l = this.monomByDegree(0, e).coefficient, c = r.clone().pow(2).subtract(n.clone().multiply(l).multiply(4)), c.isZero() ? (f = r.clone().opposite().divide(n.clone().multiply(2)), t = new $(e).subtract(f.display).multiply(f.denominator), i = new $(e).subtract(f.display).multiply(f.denominator), p = n.divide(f.denominator).divide(f.denominator), p.isOne() ? [t, i] : [new $(p.display), t, i]) : c.isPositive() && c.isSquare() ? (f = r.clone().opposite().add(c.clone().sqrt()).divide(n.clone().multiply(2)), d = r.clone().opposite().subtract(c.clone().sqrt()).divide(n.clone().multiply(2)), p = n.divide(f.denominator).divide(d.denominator), p.isOne() ? [
+          new $(e).subtract(f.display).multiply(f.denominator),
+          new $(e).subtract(d.display).multiply(d.denominator)
         ] : [
-          new P(p.display),
-          new P(e).subtract(u.display).multiply(u.denominator),
-          new P(e).subtract(d.display).multiply(d.denominator)
+          new $(p.display),
+          new $(e).subtract(f.display).multiply(f.denominator),
+          new $(e).subtract(d.display).multiply(d.denominator)
         ]) : [this.clone()];
       if (n = this.monomByDegree(2, e), r = this.monomByDegree(1, e), l = this.monomByDegree(0, e), n.isLiteralSquare() && l.isLiteralSquare() && r.clone().pow(2).isSameAs(n.clone().multiply(l))) {
-        const V = new P("x", n.coefficient, r.coefficient, l.coefficient), ce = s(w = V, $t).call(w, "x"), ue = [];
+        const L = new $("x", n.coefficient, r.coefficient, l.coefficient), ce = s(w = L, Dt).call(w, "x"), ue = [];
         let fe;
         if (ce.length >= 2) {
-          for (const ye of ce)
-            ye.degree().isZero() ? ue.push(ye.clone()) : (fe = ye.clone(), fe.monoms[0].literal = n.literalSqrt, fe.monoms[1].literal = l.literalSqrt, ue.push(fe.clone()));
+          for (const we of ce)
+            we.degree().isZero() ? ue.push(we.clone()) : (fe = we.clone(), fe.monoms[0].literal = n.literalSqrt, fe.monoms[1].literal = l.literalSqrt, ue.push(fe.clone()));
           return ue;
         }
       }
       return [this.clone()];
     });
-    m(this, _e, (e, t, i, n) => {
+    m(this, it, (e, t, i, n) => {
       let r = "";
       for (const l of s(this, y)) {
         if (l.coefficient.value === 0)
@@ -1748,51 +1748,51 @@ const P = class P {
       }
       return i === !0 && this.length > 1 && (e === "tex" ? r = `\\left( ${r} \\right)` : r = `(${r})`), r === "" && (r = "0"), r;
     });
-    m(this, It, (e, t, i) => {
+    m(this, Lt, (e, t, i) => {
       const n = e.monoms[0].dividers, r = e.monoms[e.monoms.length - 1].dividers, l = [];
       return n.forEach((c) => {
-        c.degree(i).isLeq(t) && r.forEach((u) => {
-          c.degree(i).isNotEqual(u.degree(i)) && (l.push(new P(c, u)), l.push(new P(c, u.clone().opposite())));
+        c.degree(i).isLeq(t) && r.forEach((f) => {
+          c.degree(i).isNotEqual(f.degree(i)) && (l.push(new $(c, f)), l.push(new $(c, f.clone().opposite())));
         });
       }), l;
     });
-    m(this, pt, (e) => {
+    m(this, wt, (e) => {
       for (const t of s(this, y))
         t.coefficient.multiply(e);
       return this.reduce();
     });
-    m(this, St, (e) => s(this, pt).call(this, new f(e)));
-    m(this, Bt, (e) => {
+    m(this, Zt, (e) => s(this, wt).call(this, new u(e)));
+    m(this, Vt, (e) => {
       for (const t of s(this, y))
         t.multiply(e);
       return this.reduce();
     });
-    m(this, Rt, (e) => {
+    m(this, Ft, (e) => {
       const t = [];
       for (const i of s(this, y))
         for (const n of e.monoms)
-          t.push(M.xMultiply(i, n));
+          t.push(k.xMultiply(i, n));
       return h(this, y, t), this.reduce();
     });
     /**
      * Main parse using a shutting yard class
      * @param inputStr
      */
-    m(this, Lt, (e) => {
-      const i = new Kt().parse(e).rpn;
+    m(this, Ut, (e) => {
+      const i = new si().parse(e).rpn;
       this.zero();
       const n = [];
       for (const r of i)
-        s(this, Vt).call(this, n, r);
+        s(this, Gt).call(this, n, r);
       return n.length === 1 && this.add(n[0]), this.reorder();
     });
-    m(this, Vt, (e, t) => {
+    m(this, Gt, (e, t) => {
       switch (t.tokenType) {
         case g.COEFFICIENT:
-          e.push(new P(t.token));
+          e.push(new $(t.token));
           break;
         case g.VARIABLE:
-          e.push(new P().add(new M(t.token)));
+          e.push(new $().add(new k(t.token)));
           break;
         case g.CONSTANT:
           console.log("Actually, not supported - will be added later !");
@@ -1836,24 +1836,24 @@ const P = class P {
           break;
       }
     });
-    return h(this, y, []), h(this, je, []), h(this, Ke, []), e !== void 0 && this.parse(e, ...t), this;
+    return h(this, y, []), h(this, We, []), h(this, et, []), e !== void 0 && this.parse(e, ...t), this;
   }
   get tex() {
-    return s(this, _e).call(this, "tex");
+    return s(this, it).call(this, "tex");
   }
   get display() {
-    return s(this, _e).call(this);
+    return s(this, it).call(this);
   }
   fromCoefficients(...e) {
     h(this, y, []);
     const t = "x";
     return e.reverse().forEach((i, n) => {
-      const r = new M();
-      r.coefficient = new f(i), r.setLetter(t, n), s(this, y).push(r);
+      const r = new k();
+      r.coefficient = new u(i), r.setLetter(t, n), s(this, y).push(r);
     }), this;
   }
   getCoefficients() {
-    const e = this.clone().reorder(), t = this.degree().value + 1, i = new Array(t).fill(new f(0));
+    const e = this.clone().reorder(), t = this.degree().value + 1, i = new Array(t).fill(new u(0));
     return e.monoms.forEach((n) => {
       const r = t - n.degree().value - 1;
       i[r] = n.coefficient.clone();
@@ -1887,16 +1887,16 @@ const P = class P {
     return this.variables.length;
   }
   get plotFunction() {
-    return s(this, _e).call(this, "tex", !1, !1, !0);
+    return s(this, it).call(this, "tex", !1, !1, !0);
   }
   root() {
     throw new Error("Cannot take the root from a polynom");
   }
   get roots() {
-    return s(this, ft) ? s(this, Ke) : this.getZeroes();
+    return s(this, gt) ? s(this, et) : this.getZeroes();
   }
   set roots(e) {
-    h(this, ft, !0), h(this, Ke, e);
+    h(this, gt, !0), h(this, et, e);
   }
   sqrt() {
     throw new Error("Cannot take the square root from a polynom");
@@ -1906,7 +1906,7 @@ const P = class P {
     let t = new Array(2 * e.length + 1).fill("").map((i, n) => n % 2 === 0 ? "" : "z");
     if (t.length === 1) {
       const [i] = this.getCoefficients().map((n) => n.value);
-      t = Et(t, "", i > 0 ? "+" : "-");
+      t = Ct(t, "", i > 0 ? "+" : "-");
     } else if (this.degree().isOne()) {
       const [i] = this.getCoefficients().map((n) => n.value);
       t[0] = i > 0 ? "-" : "+", t[1] = "z", t[2] = i > 0 ? "+" : "-";
@@ -1930,62 +1930,62 @@ const P = class P {
     return this.getZeroes();
   }
 };
-je = new WeakMap(), y = new WeakMap(), Ke = new WeakMap(), ft = new WeakMap(), Je = new WeakMap(), dt = new WeakMap(), Ct = new WeakMap(), Pt = new WeakMap(), $t = new WeakMap(), _e = new WeakMap(), It = new WeakMap(), pt = new WeakMap(), St = new WeakMap(), Bt = new WeakMap(), Rt = new WeakMap(), zt = new WeakSet(), ki = function(e, ...t) {
+We = new WeakMap(), y = new WeakMap(), et = new WeakMap(), gt = new WeakMap(), tt = new WeakMap(), yt = new WeakMap(), zt = new WeakMap(), Rt = new WeakMap(), Dt = new WeakMap(), it = new WeakMap(), Lt = new WeakMap(), wt = new WeakMap(), Zt = new WeakMap(), Vt = new WeakMap(), Ft = new WeakMap(), jt = new WeakSet(), Ii = function(e, ...t) {
   if (t.length === 0) {
     if (e = "" + e, e !== "" && !isNaN(Number(e))) {
       this.empty();
-      const i = new M(e);
+      const i = new k(e);
       return this.add(i), this;
     }
-    return s(this, Lt).call(this, e);
+    return s(this, Ut).call(this, e);
   } else if (/^[a-z]+/.test(e)) {
     this.empty();
-    const i = t.map((n) => new f(n));
+    const i = t.map((n) => new u(n));
     if (e.length > 1) {
       const n = e.split("");
       if (n.length < t.length - 2)
         throw new Error("Too many factors for too few variables !");
       let r = 0;
       for (const l of i) {
-        const c = new M();
+        const c = new k();
         c.coefficient = l.clone(), c.literalStr = n[r] || "", this.add(c), r++;
       }
     } else {
       let n = i.length - 1;
       for (const r of i) {
-        const l = new M();
+        const l = new k();
         l.coefficient = r.clone(), l.literalStr = `${e}^${n}`, this.add(l), n--;
       }
     }
     return this;
   } else
     return this.zero();
-}, Lt = new WeakMap(), Vt = new WeakMap();
-let O = P;
-var q, k, oe, Dt, et, Zt;
-const Ne = class Ne {
+}, Ut = new WeakMap(), Gt = new WeakMap();
+let N = $;
+var O, C, oe, Wt, st, Xt;
+const qe = class qe {
   constructor(e, t, i) {
     // Left part of the equation
-    m(this, q);
+    m(this, O);
     // Right part of the equation
-    m(this, k);
+    m(this, C);
     // Signe of the equation
     m(this, oe);
     // ------------------------------------------
     a(this, "parse", (e) => {
-      const t = s(this, Dt).call(this, e);
+      const t = s(this, Wt).call(this, e);
       if (t === !1)
         throw new Error("The equation is not valid (no sign found)");
       const i = e.split(t);
-      return this.create(new O(i[0]), new O(i[1]), s(this, et).call(this, t));
+      return this.create(new N(i[0]), new N(i[1]), s(this, st).call(this, t));
     });
-    a(this, "create", (e, t, i) => (h(this, q, e), h(this, k, t), h(this, oe, s(this, et).call(this, i ?? "=")), this));
-    a(this, "clone", () => new Ne(s(this, q).clone(), s(this, k).clone(), s(this, oe)));
+    a(this, "create", (e, t, i) => (h(this, O, e), h(this, C, t), h(this, oe, s(this, st).call(this, i ?? "=")), this));
+    a(this, "clone", () => new qe(s(this, O).clone(), s(this, C).clone(), s(this, oe)));
     /**
      * Get the degree of the equation
      * @param letter
      */
-    a(this, "degree", (e) => f.max(s(this, q).degree(e), s(this, k).degree(e)));
+    a(this, "degree", (e) => u.max(s(this, O).degree(e), s(this, C).degree(e)));
     /**
      * divide an equation by a given value (transformed as a fraction)
      *
@@ -2001,7 +2001,7 @@ const Ne = class Ne {
      * @returns {Equation}
      */
     a(this, "divide", (e) => {
-      const t = new f(e);
+      const t = new u(e);
       return t.isZero() ? this : this.multiply(t.inverse());
     });
     /**
@@ -2016,7 +2016,7 @@ const Ne = class Ne {
     /**
      * Determine if the equation contains more than one letter/variable.
      */
-    a(this, "isMultiVariable", () => s(this, q).isMultiVariable || s(this, k).isMultiVariable);
+    a(this, "isMultiVariable", () => s(this, O).isMultiVariable || s(this, C).isMultiVariable);
     // -----------------------------------------------
     // Equations helpers
     a(this, "isEqualTo", (e) => {
@@ -2031,47 +2031,47 @@ const Ne = class Ne {
       if (!this.degree(e).isOne() || this.isMultiVariable())
         return !1;
       let t;
-      s(this, q).subtract(s(this, k)), s(this, k).zero();
-      const i = [...s(this, q).monoms];
+      s(this, O).subtract(s(this, C)), s(this, C).zero();
+      const i = [...s(this, O).monoms];
       for (const r of i)
-        r.hasVariable(e) || (t = r.clone(), s(this, q).subtract(t), s(this, k).subtract(t));
-      if (s(this, q).length !== 1)
+        r.hasVariable(e) || (t = r.clone(), s(this, O).subtract(t), s(this, C).subtract(t));
+      if (s(this, O).length !== 1)
         return !1;
-      const n = s(this, q).monoms[0].coefficient.clone();
-      return s(this, q).divide(n), s(this, k).divide(n), this;
+      const n = s(this, O).monoms[0].coefficient.clone();
+      return s(this, O).divide(n), s(this, C).divide(n), this;
     });
     // -----------------------------------------------
     // Equations operations
     // -----------------------------------------------
-    a(this, "letters", () => [.../* @__PURE__ */ new Set([...s(this, q).letters(), ...s(this, k).letters()])]);
+    a(this, "letters", () => [.../* @__PURE__ */ new Set([...s(this, O).letters(), ...s(this, C).letters()])]);
     // -----------------------------------------------
     /**
      * Reorder will move all monoms containing a letter on the left, all the other on the right.
      */
-    a(this, "moveLeft", () => (s(this, q).subtract(s(this, k)), s(this, k).zero(), this));
+    a(this, "moveLeft", () => (s(this, O).subtract(s(this, C)), s(this, C).zero(), this));
     /**
      * Multiple an equation by a fraction value.
      * @param value
      */
     a(this, "multiply", (e) => {
-      const t = new f(e);
-      return s(this, q).multiply(t), s(this, k).multiply(t), s(this, oe) !== "=" && t.sign() === -1 && s(this, Zt).call(this), this;
+      const t = new u(e);
+      return s(this, O).multiply(t), s(this, C).multiply(t), s(this, oe) !== "=" && t.sign() === -1 && s(this, Xt).call(this), this;
     });
-    a(this, "opposite", () => (h(this, q, s(this, q).opposite()), h(this, k, s(this, k).opposite()), this));
-    a(this, "reorder", (e) => (s(this, q).subtract(s(this, k)), s(this, k).zero(), s(this, q).reorder(), e ? this : (s(this, q).monoms.filter((t) => t.degree().isZero()).forEach((t) => {
+    a(this, "opposite", () => (h(this, O, s(this, O).opposite()), h(this, C, s(this, C).opposite()), this));
+    a(this, "reorder", (e) => (s(this, O).subtract(s(this, C)), s(this, C).zero(), s(this, O).reorder(), e ? this : (s(this, O).monoms.filter((t) => t.degree().isZero()).forEach((t) => {
       const i = t.clone();
-      s(this, q).subtract(i), s(this, k).subtract(i);
-    }), s(this, q).reorder(), s(this, k).reorder(), this)));
+      s(this, O).subtract(i), s(this, C).subtract(i);
+    }), s(this, O).reorder(), s(this, C).reorder(), this)));
     // ------------------------------------------
-    a(this, "replaceBy", (e, t) => (s(this, q).replaceBy(e, t), s(this, k).replaceBy(e, t), this));
+    a(this, "replaceBy", (e, t) => (s(this, O).replaceBy(e, t), s(this, C).replaceBy(e, t), this));
     /**
      * Multiply by the lcm denominator and divide by the gcm numerators.
      */
-    a(this, "simplify", () => (this.multiply(U.lcm(...s(this, q).getDenominators(), ...s(this, k).getDenominators())), this.divide(U.gcd(...s(this, q).getNumerators(), ...s(this, k).getNumerators())), this));
+    a(this, "simplify", () => (this.multiply(G.lcm(...s(this, O).getDenominators(), ...s(this, C).getDenominators())), this.divide(G.gcd(...s(this, O).getNumerators(), ...s(this, C).getNumerators())), this));
     // -----------------------------------------------
-    a(this, "solve", () => new At(this.clone()).solve());
+    a(this, "solve", () => new Mt(this.clone()).solve());
     a(this, "test", (e) => this.left.evaluate(e).isEqual(this.right.evaluate(e)));
-    m(this, Dt, (e) => {
+    m(this, Wt, (e) => {
       if (e.includes("geq"))
         return e.includes("\\geq") ? "\\geq" : "geq";
       if (e.includes("leq"))
@@ -2094,13 +2094,13 @@ const Ne = class Ne {
     });
     // -----------------------------------------------
     // Equations solving algorithms
-    m(this, et, (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=");
-    m(this, Zt, () => s(this, oe) === "=" ? this : s(this, oe).includes("<") ? (s(this, oe).replace("<", ">"), this) : s(this, oe).includes(">") ? (s(this, oe).replace(">", "<"), this) : this);
-    if (h(this, q, new O().zero()), h(this, k, new O().zero()), h(this, oe, "="), e !== void 0 && t === void 0) {
-      if (e instanceof Ne)
+    m(this, st, (e) => e === void 0 ? "=" : e.includes("geq") || e.includes(">=") || e.includes("=>") ? ">=" : e.includes(">") ? ">" : e.includes("leq") || e.includes("<=") || e.includes("=<") ? "<=" : e.includes("<") ? "<" : "=");
+    m(this, Xt, () => s(this, oe) === "=" ? this : s(this, oe).includes("<") ? (s(this, oe).replace("<", ">"), this) : s(this, oe).includes(">") ? (s(this, oe).replace(">", "<"), this) : this);
+    if (h(this, O, new N().zero()), h(this, C, new N().zero()), h(this, oe, "="), e !== void 0 && t === void 0) {
+      if (e instanceof qe)
         return e.clone();
       typeof e == "string" && this.parse(e);
-    } else e !== void 0 && t !== void 0 && (this.left = new O(e), this.right = new O(t));
+    } else e !== void 0 && t !== void 0 && (this.left = new N(e), this.right = new N(t));
     return i !== void 0 && (this.sign = i), this;
   }
   /**
@@ -2112,12 +2112,12 @@ const Ne = class Ne {
    * @param value | Polynom | Monom | Fraction | string | monom
    */
   add(e) {
-    if (e instanceof Ne)
-      return s(this, q).add(e.left), s(this, k).add(e.right), this;
-    if (typeof e == "string" && !Ne.isEquationString(e))
-      return this.add(new Ne(e));
-    const t = new O(e);
-    return s(this, q).add(t), s(this, k).add(t), this;
+    if (e instanceof qe)
+      return s(this, O).add(e.left), s(this, C).add(e.right), this;
+    if (typeof e == "string" && !qe.isEquationString(e))
+      return this.add(new qe(e));
+    const t = new N(e);
+    return s(this, O).add(t), s(this, C).add(t), this;
   }
   /**
    * Create an Equation using two polynoms.
@@ -2126,29 +2126,29 @@ const Ne = class Ne {
    * @param asNumeric
    */
   evaluate(e, t) {
-    const i = s(this, q).evaluate(e, t), n = s(this, k).evaluate(e, t);
+    const i = s(this, O).evaluate(e, t), n = s(this, C).evaluate(e, t);
     return t ? i === n : i.isEqual(n);
   }
   isEqual(e) {
-    const t = new Ne(e);
-    return t.left.isEqual(s(this, q)) && t.right.isEqual(s(this, k));
+    const t = new qe(e);
+    return t.left.isEqual(s(this, O)) && t.right.isEqual(s(this, C));
   }
   pow(e) {
-    return s(this, q).pow(e), s(this, k).pow(e), this;
+    return s(this, O).pow(e), s(this, C).pow(e), this;
   }
   reduce() {
-    return this.moveLeft(), s(this, q).reduce(), this.simplify(), s(this, q).monoms[0].coefficient.isNegative() && this.multiply(-1), this;
+    return this.moveLeft(), s(this, O).reduce(), this.simplify(), s(this, O).monoms[0].coefficient.isNegative() && this.multiply(-1), this;
   }
   split() {
-    return [s(this, q).clone(), s(this, k).clone()];
+    return [s(this, O).clone(), s(this, C).clone()];
   }
   subtract(e) {
-    if (e instanceof Ne)
-      return s(this, q).subtract(e.left), s(this, k).subtract(e.right), this;
-    if (typeof e == "string" && !Ne.isEquationString(e))
-      return this.subtract(new Ne(e));
-    const t = new O(e);
-    return s(this, q).subtract(t), s(this, k).subtract(t), this;
+    if (e instanceof qe)
+      return s(this, O).subtract(e.left), s(this, C).subtract(e.right), this;
+    if (typeof e == "string" && !qe.isEquationString(e))
+      return this.subtract(new qe(e));
+    const t = new N(e);
+    return s(this, O).subtract(t), s(this, C).subtract(t), this;
   }
   static isEquationString(e) {
     return e.includes("=") || e.includes("<") || e.includes(">") || e.includes("<=") || e.includes(">=");
@@ -2158,85 +2158,85 @@ const Ne = class Ne {
     return t === !0 && n.sort((r, l) => r.value - l.value), n;
   }
   get display() {
-    return `${s(this, q).display}${this.signAsTex}${s(this, k).display}`;
+    return `${s(this, O).display}${this.signAsTex}${s(this, C).display}`;
   }
   // Getter and setter
   get left() {
-    return s(this, q);
+    return s(this, O);
   }
   set left(e) {
-    h(this, q, e);
+    h(this, O, e);
   }
   get numberOfVars() {
     return this.variables.length;
   }
   get right() {
-    return s(this, k);
+    return s(this, C);
   }
   set right(e) {
-    h(this, k, e);
+    h(this, C, e);
   }
   // ------------------------------------------
   get sign() {
     return s(this, oe);
   }
   set sign(e) {
-    h(this, oe, s(this, et).call(this, e));
+    h(this, oe, s(this, st).call(this, e));
   }
   get signAsTex() {
     return s(this, oe) === ">=" ? "\\geq" : s(this, oe) === "<=" ? "\\leq" : s(this, oe);
   }
   get tex() {
-    return `${s(this, q).tex}${this.signAsTex}${s(this, k).tex}`;
+    return `${s(this, O).tex}${this.signAsTex}${s(this, C).tex}`;
   }
   get variables() {
-    return [...new Set(s(this, k).variables.concat(s(this, q).variables))];
+    return [...new Set(s(this, C).variables.concat(s(this, O).variables))];
   }
 };
-q = new WeakMap(), k = new WeakMap(), oe = new WeakMap(), Dt = new WeakMap(), et = new WeakMap(), Zt = new WeakMap();
-let H = Ne;
-var Te, Ae, be, tt;
-const ve = class ve {
+O = new WeakMap(), C = new WeakMap(), oe = new WeakMap(), Wt = new WeakMap(), st = new WeakMap(), Xt = new WeakMap();
+let V = qe;
+var Ce, Ae, xe, nt;
+const be = class be {
   constructor(e, t) {
-    m(this, Te);
+    m(this, Ce);
     m(this, Ae);
-    m(this, be);
-    m(this, tt, !1);
-    return e instanceof ve ? (h(this, Ae, e.polynom.clone()), h(this, be, e.power.clone()), t !== void 0 && s(this, be).multiply(new f(t))) : e !== void 0 ? (h(this, Ae, new O(e)), h(this, be, new f(t ?? 1))) : (h(this, Ae, new O()), h(this, be, new f(1))), h(this, Te, 1), this;
+    m(this, xe);
+    m(this, nt, !1);
+    return e instanceof be ? (h(this, Ae, e.polynom.clone()), h(this, xe, e.power.clone()), t !== void 0 && s(this, xe).multiply(new u(t))) : e !== void 0 ? (h(this, Ae, new N(e)), h(this, xe, new u(t ?? 1))) : (h(this, Ae, new N()), h(this, xe, new u(1))), h(this, Ce, 1), this;
   }
   parse() {
     throw new Error("Method not implemented.");
   }
   clone() {
-    return new ve(this);
+    return new be(this);
   }
   fromPolynom(e) {
-    return h(this, Ae, new O(e)), h(this, be, new f(1)), this;
+    return h(this, Ae, new N(e)), h(this, xe, new u(1)), this;
   }
   get tex() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, n;
-    return s(this, Te) === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, n = e === 1 ? "" : `^{ ${e} }`) : (i = s(this, tt) && this.power.isOne() ? this.polynom.tex : yi(this.polynom.tex), n = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${n}`, s(this, Te) === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
+    return s(this, Ce) === 0 && t > 1 ? (i = `\\sqrt${t === 2 ? "" : `[ ${t} ]`}{ ${this.polynom.tex} }`, n = e === 1 ? "" : `^{ ${e} }`) : (i = s(this, nt) && this.power.isOne() ? this.polynom.tex : qi(this.polynom.tex), n = t === 1 && e === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${n}`, s(this, Ce) === 0 && e < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
   }
   get display() {
     const e = this.power.numerator, t = this.power.denominator;
     let i, n;
-    return s(this, Te) === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, n = e === 1 ? "" : `^(${e})`) : (i = s(this, tt) && this.power.isOne() ? this.polynom.display : yi(this.polynom.display, !1), n = t === 1 && e === 1 ? "" : `^(${this.power.display})`), i = `${i}${n}`, s(this, Te) === 0 && e < 0 && (i = `1/(${i})`), i;
+    return s(this, Ce) === 0 && t > 1 ? (i = `${t === 2 ? "sqrt" : `root(${t})`}(${this.polynom.display})`, n = e === 1 ? "" : `^(${e})`) : (i = s(this, nt) && this.power.isOne() ? this.polynom.display : qi(this.polynom.display, !1), n = t === 1 && e === 1 ? "" : `^(${this.power.display})`), i = `${i}${n}`, s(this, Ce) === 0 && e < 0 && (i = `1/(${i})`), i;
   }
   add() {
     throw new Error("Adding two factors is not possible");
   }
   get asSingle() {
-    return h(this, tt, !0), this;
+    return h(this, nt, !0), this;
   }
   degree(e) {
     return this.polynom.degree(e).multiply(this.power);
   }
   derivative() {
-    return this.power.isZero() ? [new ve("0")] : this.power.isOne() ? [new ve(this.polynom.clone().derivative())] : [
-      new ve(this.power.clone()),
-      new ve(this.polynom.clone().derivative()),
-      new ve(this.polynom.clone(), this.power.clone().subtract(1))
+    return this.power.isZero() ? [new be("0")] : this.power.isOne() ? [new be(this.polynom.clone().derivative())] : [
+      new be(this.power.clone()),
+      new be(this.polynom.clone().derivative()),
+      new be(this.polynom.clone(), this.power.clone().subtract(1))
     ];
   }
   develop() {
@@ -2245,9 +2245,9 @@ const ve = class ve {
     throw new Error("The power must be a natural number");
   }
   divide(e) {
-    if (e instanceof ve && this.isSameAs(e))
+    if (e instanceof be && this.isSameAs(e))
       return this.power.subtract(e.power), this;
-    const t = new O(e);
+    const t = new N(e);
     if (this.isSameAs(t))
       return this.power.subtract(1), this;
     throw new Error("The two factors must be the same");
@@ -2269,21 +2269,21 @@ const ve = class ve {
   }
   isSameAs(e) {
     let t;
-    return e instanceof ve ? t = e.polynom : e instanceof O ? t = e : t = new O(e), this.polynom.isEqual(t);
+    return e instanceof be ? t = e.polynom : e instanceof N ? t = e : t = new N(e), this.polynom.isEqual(t);
   }
   isZero() {
     return this.polynom.isZero();
   }
   multiply(e) {
-    if (e instanceof ve && this.isSameAs(e))
+    if (e instanceof be && this.isSameAs(e))
       return this.power.add(e.power), this;
-    const t = new O(e);
+    const t = new N(e);
     if (this.isSameAs(t))
       return this.power.add(1), this;
     throw new Error("The two factors must be the same");
   }
   one() {
-    return s(this, Ae).one(), s(this, be).one(), this;
+    return s(this, Ae).one(), s(this, xe).one(), this;
   }
   opposite() {
     throw new Error("Method not implemented.");
@@ -2298,10 +2298,10 @@ const ve = class ve {
     return this.power.multiply(e), this;
   }
   get power() {
-    return s(this, be);
+    return s(this, xe);
   }
   set power(e) {
-    h(this, be, new f(e));
+    h(this, xe, new u(e));
   }
   primitive() {
     throw new Error("Method not implemented.");
@@ -2320,45 +2320,45 @@ const ve = class ve {
   }
   tableOfSigns() {
     const e = this.power.clone().reduce(), t = this.polynom.tableOfSigns();
-    return e.isStrictlyNegative() && (t.signs = Et(t.signs, "z", "d")), e.denominator % 2 === 0 ? t.signs = Et(t.signs, "-", "h") : e.numerator % 2 === 0 && (t.signs = Et(t.signs, "-", "+")), { roots: t.roots, signs: t.signs };
+    return e.isStrictlyNegative() && (t.signs = Ct(t.signs, "z", "d")), e.denominator % 2 === 0 ? t.signs = Ct(t.signs, "-", "h") : e.numerator % 2 === 0 && (t.signs = Ct(t.signs, "-", "+")), { roots: t.roots, signs: t.signs };
   }
   get variables() {
     return this.polynom.variables;
   }
   get withPower() {
-    return h(this, Te, 1), this;
+    return h(this, Ce, 1), this;
   }
   get withRoot() {
-    return h(this, Te, 0), this;
+    return h(this, Ce, 0), this;
   }
   zero() {
-    return s(this, Ae).zero(), s(this, be).one(), this;
+    return s(this, Ae).zero(), s(this, xe).one(), this;
   }
 };
-Te = new WeakMap(), Ae = new WeakMap(), be = new WeakMap(), tt = new WeakMap();
-let se = ve;
-var lt = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(lt || {}), D, Pe, Ft, jt;
-const Xe = class Xe {
+Ce = new WeakMap(), Ae = new WeakMap(), xe = new WeakMap(), nt = new WeakMap();
+let se = be;
+var dt = /* @__PURE__ */ ((o) => (o[o.ROOT = 0] = "ROOT", o[o.POWER = 1] = "POWER", o))(dt || {}), Z, Se, Yt, Qt;
+const Ke = class Ke {
   constructor(...e) {
-    m(this, D);
+    m(this, Z);
     // Determine the letters in the linear system, usually ['x', 'y']
-    m(this, Pe);
-    a(this, "parse", (...e) => (h(this, D, e.map((t) => new H(t))), s(this, Ft).call(this), this));
-    a(this, "clone", () => new Xe().parse(...s(this, D).map((e) => e.clone())));
+    m(this, Se);
+    a(this, "parse", (...e) => (h(this, Z, e.map((t) => new V(t))), s(this, Yt).call(this), this));
+    a(this, "clone", () => new Ke().parse(...s(this, Z).map((e) => e.clone())));
     a(this, "buildTex", (e, t) => {
       let i, n, r = [];
       const l = [];
-      for (const u of e)
-        r = r.concat(u.letters());
+      for (const f of e)
+        r = r.concat(f.letters());
       r = [...new Set(r)], r.sort();
-      for (let u = 0; u < e.length; u++) {
-        const d = e[u];
+      for (let f = 0; f < e.length; f++) {
+        const d = e[f];
         i = [];
         for (const p of r)
           n = d.left.monomByLetter(p), i.length === 0 ? i.push(n.isZero() ? "" : n.tex) : i.push(n.isZero() ? "" : (n.coefficient.sign() === 1 ? "+" : "") + n.tex);
-        if (i.push("="), i.push(d.right.tex), (t == null ? void 0 : t[u]) !== void 0) {
+        if (i.push("="), i.push(d.right.tex), (t == null ? void 0 : t[f]) !== void 0) {
           i[i.length - 1] = i[i.length - 1] + " \\phantom{\\quad}";
-          for (const p of t[u])
+          for (const p of t[f])
             i.push(`\\ \\cdot\\ ${p.startsWith("-") ? "\\left(" + p + "\\right)" : p}`);
         }
         l.push(i.join("&"));
@@ -2367,12 +2367,12 @@ const Xe = class Xe {
       return t !== void 0 && t.length > 0 && (c = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(r.length)}cl ${"|l".repeat(c)}}${l.join("\\\\ ")}\\end{array}\\right.`;
     });
     a(this, "mergeEquations", (e, t, i, n) => {
-      const r = e.clone().multiply(new f(i)), l = t.clone().multiply(new f(n));
+      const r = e.clone().multiply(new u(i)), l = t.clone().multiply(new u(n));
       return r.left.add(l.left), r.right.add(l.right), r;
     });
     // ------------------------------------------
     a(this, "reorder", () => {
-      for (const e of s(this, D))
+      for (const e of s(this, Z))
         e.reorder();
       return this;
     });
@@ -2381,9 +2381,9 @@ const Xe = class Xe {
       for (let n = 0; n < e.length; n++) {
         let r = i[n][n].clone();
         if (r.isZero()) {
-          const l = i.find((c, u) => u > n && !c[n].isZero());
+          const l = i.find((c, f) => f > n && !c[n].isZero());
           if (l)
-            i[n].forEach((c, u) => c.add(l[u])), r = i[n][n].clone();
+            i[n].forEach((c, f) => c.add(l[f])), r = i[n][n].clone();
           else
             throw new Error("Unsolvable...");
         }
@@ -2392,18 +2392,18 @@ const Xe = class Xe {
           if (l === n)
             continue;
           const c = i[l][n].clone().opposite();
-          for (let u = 0; u < i[l].length; u++)
-            i[l][u].add(i[n][u].clone().multiply(c));
-          if (i[l].slice(0, i[l].length - 1).every((u) => u.isZero()))
-            return i[l][i[l].length - 1].isZero() ? [new f().infinite()] : [];
+          for (let f = 0; f < i[l].length; f++)
+            i[l][f].add(i[n][f].clone().multiply(c));
+          if (i[l].slice(0, i[l].length - 1).every((f) => f.isZero()))
+            return i[l][i[l].length - 1].isZero() ? [new u().infinite()] : [];
         }
       }
       return i.map((n) => n[n.length - 1]);
     });
-    m(this, Ft, () => (h(this, Pe, s(this, D).reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], [])), s(this, Pe).sort(), this));
-    m(this, jt, () => {
+    m(this, Yt, () => (h(this, Se, s(this, Z).reduce((e, t) => [.../* @__PURE__ */ new Set([...e, ...t.variables])], [])), s(this, Se).sort(), this));
+    m(this, Qt, () => {
       const e = [], t = [];
-      for (const i of s(this, D)) {
+      for (const i of s(this, Z)) {
         const n = [], r = i.clone().reorder();
         for (const l of this.variables) {
           const c = r.left.monomByLetter(l);
@@ -2413,74 +2413,74 @@ const Xe = class Xe {
       }
       return [e, t];
     });
-    return h(this, D, []), h(this, Pe, []), e.length > 0 && this.parse(...e), this;
+    return h(this, Z, []), h(this, Se, []), e.length > 0 && this.parse(...e), this;
   }
   static fromMatrix(e, t = "xyz") {
     const i = e[0].length;
     if (e.some((r) => r.length !== i))
       throw new Error("All rows must have the same number of columns");
     const n = t.split("").splice(0, i - 1);
-    return new Xe(
+    return new Ke(
       ...e.map((r) => {
-        const l = new O(n.join(""), ...r);
-        return new H(l, 0);
+        const l = new N(n.join(""), ...r);
+        return new V(l, 0);
       })
     );
   }
   add(e, t) {
-    if (e instanceof Xe) {
+    if (e instanceof Ke) {
       const i = e.equations.length;
-      if (i !== s(this, D).length)
+      if (i !== s(this, Z).length)
         throw new Error("The number of equations must be the same");
       for (let n = 0; n < i; n++)
-        s(this, D)[n].add(e.equations[n]);
+        s(this, Z)[n].add(e.equations[n]);
     } else {
-      if (t === void 0 || t < 0 || t >= s(this, D).length)
+      if (t === void 0 || t < 0 || t >= s(this, Z).length)
         throw new Error("Index out of range");
-      const i = new H(e);
-      s(this, D)[t].add(i);
+      const i = new V(e);
+      s(this, Z)[t].add(i);
     }
     return this;
   }
   degree(e) {
-    return f.max(...s(this, D).map((t) => t.degree(e)));
+    return u.max(...s(this, Z).map((t) => t.degree(e)));
   }
   get display() {
     return this.tex + "as display";
   }
   // ------------------------------------------
   get equations() {
-    return s(this, D);
+    return s(this, Z);
   }
   set equations(e) {
-    h(this, D, e);
+    h(this, Z, e);
   }
   evaluate(e, t) {
     throw new Error("Method not implemented.");
   }
   hasVariable(e) {
-    return s(this, Pe).includes(e);
+    return s(this, Se).includes(e);
   }
   isEqual(e) {
     return this.equations.every((t, i) => t.isEqual(e.equations[i]));
   }
   get isSolvable() {
-    return this.variables.length === s(this, D).length;
+    return this.variables.length === s(this, Z).length;
   }
   get matrix() {
-    return s(this, jt).call(this);
+    return s(this, Qt).call(this);
   }
   multiply(e, t) {
     if (Array.isArray(e)) {
-      if (e.length !== s(this, D).length)
+      if (e.length !== s(this, Z).length)
         throw new Error("The number of values must be the same as the number of equations");
       for (let i = 0; i < e.length; i++)
-        s(this, D)[i].multiply(e[i]);
+        s(this, Z)[i].multiply(e[i]);
       return this;
     }
-    if (t === void 0 || t < 0 || t >= s(this, D).length)
+    if (t === void 0 || t < 0 || t >= s(this, Z).length)
       throw new Error("Index out of range");
-    return s(this, D)[t].multiply(e), this;
+    return s(this, Z)[t].multiply(e), this;
   }
   reduce() {
     throw new Error("Method not implemented.");
@@ -2489,17 +2489,17 @@ const Xe = class Xe {
     return [];
   }
   subtract(e, t) {
-    if (e instanceof Xe) {
+    if (e instanceof Ke) {
       const i = e.equations.length;
-      if (i !== s(this, D).length)
+      if (i !== s(this, Z).length)
         throw new Error("The number of equations must be the same");
       for (let n = 0; n < i; n++)
-        s(this, D)[n].subtract(e.equations[n]);
+        s(this, Z)[n].subtract(e.equations[n]);
     } else {
-      if (t === void 0 || t < 0 || t >= s(this, D).length)
+      if (t === void 0 || t < 0 || t >= s(this, Z).length)
         throw new Error("Index out of range");
-      const i = new H(e);
-      s(this, D)[t].subtract(i);
+      const i = new V(e);
+      s(this, Z)[t].subtract(i);
     }
     return this;
   }
@@ -2508,33 +2508,33 @@ const Xe = class Xe {
     return this.buildTex(e.equations);
   }
   get variables() {
-    return s(this, Pe);
+    return s(this, Se);
   }
   set variables(e) {
     const t = typeof e == "string" ? e.split("") : [...e];
-    t.sort(), h(this, Pe, t);
+    t.sort(), h(this, Se, t);
   }
 };
-D = new WeakMap(), Pe = new WeakMap(), Ft = new WeakMap(), jt = new WeakMap();
-let ti = Xe;
-var Oe, mt, ii;
-class ss {
+Z = new WeakMap(), Se = new WeakMap(), Yt = new WeakMap(), Qt = new WeakMap();
+let hi = Ke;
+var ke, vt, ai;
+class fs {
   /**
    *
    * @param {string} value (optional) Default polynom to parse on class creation
    */
   constructor(e) {
-    m(this, mt);
-    m(this, Oe);
-    a(this, "parse", (e) => (h(this, Oe, new Kt(Ze.SET).parse(e).rpn), this));
-    return h(this, Oe, []), e !== void 0 && this.parse(e), this;
+    m(this, vt);
+    m(this, ke);
+    a(this, "parse", (e) => (h(this, ke, new si(Ue.SET).parse(e).rpn), this));
+    return h(this, ke, []), e !== void 0 && this.parse(e), this;
   }
   evaluate(e) {
     this.variables.forEach((i) => {
       Object.hasOwn(e, i) || (e[i] = !1);
     });
     const t = [];
-    for (const i of s(this, Oe))
+    for (const i of s(this, ke))
       if (console.log(i), i.tokenType === "variable")
         t.push(e[i.token]);
       else if (i.tokenType === "operation")
@@ -2563,11 +2563,11 @@ class ss {
     return t.length === 1 && t[0];
   }
   get rpn() {
-    return s(this, Oe);
+    return s(this, ke);
   }
   get tex() {
     const e = [];
-    for (const t of s(this, Oe))
+    for (const t of s(this, ke))
       if (t.tokenType === "variable")
         e.push(t);
       else
@@ -2600,23 +2600,23 @@ class ss {
     return e[0].token;
   }
   get variables() {
-    return s(this, Oe).filter((e) => e.tokenType === "variable").map((e) => e.token);
+    return s(this, ke).filter((e) => e.tokenType === "variable").map((e) => e.token);
   }
   vennAB() {
-    return A(this, mt, ii).call(this, {
+    return A(this, vt, ai).call(this, {
       A: ["A", "AB"],
       B: ["B", "AB"]
     }, ["A", "B", "AB", "E"]);
   }
   vennABC() {
-    return A(this, mt, ii).call(this, {
+    return A(this, vt, ai).call(this, {
       A: ["A", "AB", "AC", "ABC"],
       B: ["B", "AB", "BC", "ABC"],
       C: ["C", "AC", "BC", "ABC"]
     }, ["A", "B", "C", "AB", "AC", "BC", "ABC", "E"]);
   }
 }
-Oe = new WeakMap(), mt = new WeakSet(), ii = function(e, t) {
+ke = new WeakMap(), vt = new WeakSet(), ai = function(e, t) {
   const i = [];
   let n;
   if (t === void 0) {
@@ -2628,7 +2628,7 @@ Oe = new WeakMap(), mt = new WeakSet(), ii = function(e, t) {
       ]);
   } else
     n = new Set(t);
-  for (const r of s(this, Oe))
+  for (const r of s(this, ke))
     if (r.tokenType === "variable")
       e[r.token] === void 0 ? i.push(/* @__PURE__ */ new Set()) : i.push(new Set(e[r.token]));
     else
@@ -2636,7 +2636,7 @@ Oe = new WeakMap(), mt = new WeakSet(), ii = function(e, t) {
         case "&":
           if (i.length >= 2) {
             const l = i.pop(), c = i.pop();
-            c && l && i.push(new Set([...c].filter((u) => l.has(u))));
+            c && l && i.push(new Set([...c].filter((f) => l.has(f))));
           }
           break;
         case "|":
@@ -2648,7 +2648,7 @@ Oe = new WeakMap(), mt = new WeakSet(), ii = function(e, t) {
         case "-":
           if (i.length >= 2) {
             const l = i.pop(), c = i.pop();
-            c && l && i.push(new Set([...c].filter((u) => !l.has(u))));
+            c && l && i.push(new Set([...c].filter((f) => !l.has(f))));
           }
           break;
         case "!":
@@ -2660,31 +2660,31 @@ Oe = new WeakMap(), mt = new WeakSet(), ii = function(e, t) {
       }
   return [...i[0]].sort();
 };
-var it, N, We, ni, Mi, gt, ri;
-const X = class X {
+var rt, q, Ye, ci, zi, bt, ui;
+const Y = class Y {
   constructor(...e) {
-    m(this, gt);
-    m(this, it, lt.POWER);
-    m(this, N, []);
+    m(this, bt);
+    m(this, rt, dt.POWER);
+    m(this, q, []);
     return this.parse(...e), this;
   }
   parse(...e) {
-    return h(this, N, []), e.length === 0 ? this : (e.forEach((t) => {
-      t instanceof X ? s(this, N).push(...t.factors.map((i) => i.clone())) : s(this, N).push(new se(t));
+    return h(this, q, []), e.length === 0 ? this : (e.forEach((t) => {
+      t instanceof Y ? s(this, q).push(...t.factors.map((i) => i.clone())) : s(this, q).push(new se(t));
     }), this);
   }
   clone() {
-    return new X(...s(this, N).map((e) => e.clone()));
+    return new Y(...s(this, q).map((e) => e.clone()));
   }
   get tex() {
-    const { num: e, den: t } = A(this, gt, ri).call(this);
+    const { num: e, den: t } = A(this, bt, ui).call(this);
     if (t.length === 0)
       return e.length === 1 ? e[0].asSingle.tex : e.map((r) => r.tex).join("");
     const i = e.length === 1 ? e[0].asSingle.tex : e.map((r) => r.tex).join(""), n = t.length === 1 ? t[0].asSingle.tex : t.map((r) => r.tex).join("");
     return `\\frac{ ${i} }{ ${n} }`;
   }
   get display() {
-    const { num: e, den: t } = A(this, gt, ri).call(this);
+    const { num: e, den: t } = A(this, bt, ui).call(this);
     if (t.length === 0)
       return e.length === 1 ? e[0].asSingle.display : e.map(
         (r, l) => l === 0 && r.polynom.monoms.length === 1 ? r.asSingle.display : r.display
@@ -2695,117 +2695,117 @@ const X = class X {
   static gcd(...e) {
     var i;
     if (e.length === 0)
-      return new X().one();
+      return new Y().one();
     if (e.length === 1)
       return e[0];
     if (e.length === 2)
-      return A(i = X, We, ni).call(i, e[0], e[1]);
+      return A(i = Y, Ye, ci).call(i, e[0], e[1]);
     let t = e[0];
     return e.shift(), e.forEach((n) => {
       var r;
-      return t = A(r = X, We, ni).call(r, t, n);
+      return t = A(r = Y, Ye, ci).call(r, t, n);
     }), t;
   }
   static lcm(...e) {
     if (e.length === 0)
-      return new X().one();
+      return new Y().one();
     if (e.length === 1)
       return e[0];
     let t = e[0];
     return e.shift(), e.forEach((i) => {
       var n;
-      return t = A(n = X, We, Mi).call(n, t, i);
+      return t = A(n = Y, Ye, zi).call(n, t, i);
     }), t;
   }
   add(...e) {
     const t = [this.numerator, ...e.map((c) => c.numerator)], i = [this.denominator, ...e.map((c) => c.denominator)];
     let n;
     if (i.some((c) => c.factors.length > 0)) {
-      const c = X.lcm(...i);
-      t.forEach((u, d) => {
-        u.multiply(c.clone().divide(i[d]));
+      const c = Y.lcm(...i);
+      t.forEach((f, d) => {
+        f.multiply(c.clone().divide(i[d]));
       }), n = c;
     }
-    const r = X.gcd(...t), l = new O(0).add(
+    const r = Y.gcd(...t), l = new N(0).add(
       ...t.map((c) => c.divide(r).reduce().develop().factors[0].polynom)
     ).reduce();
-    return h(this, N, [
+    return h(this, q, [
       ...r.factors,
       new se(l)
-    ]), n && this.divide(n), h(this, N, s(this, N).filter((c) => !c.power.isZero())), this;
+    ]), n && this.divide(n), h(this, q, s(this, q).filter((c) => !c.power.isZero())), this;
   }
   get asPower() {
-    return h(this, it, lt.POWER), this;
+    return h(this, rt, dt.POWER), this;
   }
   get asRoot() {
-    return h(this, it, lt.ROOT), this;
+    return h(this, rt, dt.ROOT), this;
   }
   degree(e) {
-    return s(this, N).reduce((t, i) => t.add(i.degree(e)), new f("0"));
+    return s(this, q).reduce((t, i) => t.add(i.degree(e)), new u("0"));
   }
   get denominator() {
-    return new X(
-      ...s(this, N).filter((e) => e.power.isNegative()).map((e) => e.clone().inverse())
+    return new Y(
+      ...s(this, q).filter((e) => e.power.isNegative()).map((e) => e.clone().inverse())
     );
   }
   derivative() {
-    const e = [], t = s(this, N).length;
+    const e = [], t = s(this, q).length;
     for (let n = 0; n < t; n++) {
-      const r = s(this, N).slice(), l = r.splice(n, 1)[0].derivative();
+      const r = s(this, q).slice(), l = r.splice(n, 1)[0].derivative();
       e.push(
-        new X(...r, ...l)
+        new Y(...r, ...l)
       );
     }
     e.forEach((n) => n.reduce());
     const i = e.shift();
-    return i !== void 0 && h(this, N, i.factors), this.add(...e);
+    return i !== void 0 && h(this, q, i.factors), this.add(...e);
   }
   develop() {
-    const e = new O("1"), t = new O("1");
+    const e = new N("1"), t = new N("1");
     return this.numerator.factors.forEach((i) => {
       e.multiply(i.develop());
     }), this.denominator.factors.forEach((i) => {
       t.multiply(i.develop());
-    }), new X().fromPolynom(e, t);
+    }), new Y().fromPolynom(e, t);
   }
   divide(e) {
-    return h(this, N, s(this, N).concat(e.clone().factors.map((t) => t.inverse()))), this;
+    return h(this, q, s(this, q).concat(e.clone().factors.map((t) => t.inverse()))), this;
   }
   evaluate(e, t) {
-    return t ? s(this, N).reduce((i, n) => i * n.evaluate(e, t), 1) : s(this, N).reduce((i, n) => i.multiply(n.evaluate(e)), new f("1"));
+    return t ? s(this, q).reduce((i, n) => i * n.evaluate(e, t), 1) : s(this, q).reduce((i, n) => i.multiply(n.evaluate(e)), new u("1"));
   }
   factorize(e) {
     const t = [];
-    s(this, N).forEach((l) => {
+    s(this, q).forEach((l) => {
       const c = l.polynom.factorize(e);
       if (c.length > 1) {
-        const u = l.power.clone();
-        t.push(...c.map((d) => new se(d, u)));
+        const f = l.power.clone();
+        t.push(...c.map((d) => new se(d, f)));
       } else
         t.push(l.clone());
     });
-    const i = new X(...t), n = i.numerator.reduce(), r = i.denominator.reduce();
+    const i = new Y(...t), n = i.numerator.reduce(), r = i.denominator.reduce();
     return n.divide(r);
   }
   get factors() {
-    return s(this, N);
+    return s(this, q);
   }
   set factors(e) {
-    h(this, N, e);
+    h(this, q, e);
   }
   fromPolynom(e, t) {
-    if (h(this, N, [new se(new O(e))]), t) {
-      const i = new O(t);
+    if (h(this, q, [new se(new N(e))]), t) {
+      const i = new N(t);
       if (i.isOne())
         return this;
       if (i.isZero())
         throw new Error("Cannot divide by zero");
-      s(this, N).push(new se(i, -1));
+      s(this, q).push(new se(i, -1));
     }
     return this;
   }
   getZeroes() {
-    const e = [].concat(...s(this, N).map((t) => t.polynom.getZeroes()));
+    const e = [].concat(...s(this, q).map((t) => t.polynom.getZeroes()));
     return e.sort((t, i) => t.value - i.value), e.filter(
       (t, i, n) => i === n.findIndex(
         (r) => r.value === t.value
@@ -2813,51 +2813,51 @@ const X = class X {
     );
   }
   hasVariable(e) {
-    return s(this, N).some((t) => t.hasVariable(e));
+    return s(this, q).some((t) => t.hasVariable(e));
   }
   inverse() {
-    return h(this, N, s(this, N).map((e) => e.inverse())), this;
+    return h(this, q, s(this, q).map((e) => e.inverse())), this;
   }
   isEqual(e) {
-    const t = X.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
+    const t = Y.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
     return i.isOne() && n.isOne();
   }
   isOne() {
-    return s(this, N).every((e) => e.isOne());
+    return s(this, q).every((e) => e.isOne());
   }
   isZero() {
-    return s(this, N).every((e) => e.isZero());
+    return s(this, q).every((e) => e.isZero());
   }
   multiply(...e) {
     return e.forEach((t) => {
-      h(this, N, s(this, N).concat(t.clone().factors));
+      h(this, q, s(this, q).concat(t.clone().factors));
     }), this;
   }
   get numerator() {
-    return new X(...s(this, N).filter((e) => e.power.isPositive()));
+    return new Y(...s(this, q).filter((e) => e.power.isPositive()));
   }
   one() {
-    return h(this, N, [new se("1", "1")]), this;
+    return h(this, q, [new se("1", "1")]), this;
   }
   opposite() {
-    const e = s(this, N).findIndex((t) => t.display === "(-1)");
-    return e >= 0 ? s(this, N).splice(e, 1) : s(this, N).push(new se("-1", "1")), this;
+    const e = s(this, q).findIndex((t) => t.display === "(-1)");
+    return e >= 0 ? s(this, q).splice(e, 1) : s(this, q).push(new se("-1", "1")), this;
   }
   pow(e) {
-    return h(this, N, s(this, N).map((t) => t.pow(e))), this;
+    return h(this, q, s(this, q).map((t) => t.pow(e))), this;
   }
   primitive() {
     throw new Error("Method not implemented.");
   }
   reduce() {
-    const e = ht(this);
-    return h(this, N, Object.values(e).map((t) => {
-      const i = t[0].polynom, n = t.reduce((r, l) => r.add(l.power), new f("0"));
+    const e = ut(this);
+    return h(this, q, Object.values(e).map((t) => {
+      const i = t[0].polynom, n = t.reduce((r, l) => r.add(l.power), new u("0"));
       return new se(i, n.reduce());
     }).filter((t) => !t.power.isZero())), this;
   }
   root(e) {
-    return h(this, N, s(this, N).map((t) => t.root(e))), this;
+    return h(this, q, s(this, q).map((t) => t.root(e))), this;
   }
   /**
    * Reoarder the factors using :
@@ -2866,19 +2866,19 @@ const X = class X {
    * 3. power of polyfactor
    */
   sort(e) {
-    return s(this, N).sort((t, i) => {
+    return s(this, q).sort((t, i) => {
       const n = t.power.value, r = i.power.value;
       if (n * r < 0)
         return -n;
       const l = t.polynom.monoms.length, c = i.polynom.monoms.length;
       if (l !== c)
         return l - c;
-      const u = t.polynom.degree(e).value, d = i.polynom.degree(e).value;
-      return u !== d ? u - d : n !== r ? n - r : t.degree().isLeq(i.degree()) ? -1 : 1;
+      const f = t.polynom.degree(e).value, d = i.polynom.degree(e).value;
+      return f !== d ? f - d : n !== r ? n - r : t.degree().isLeq(i.degree()) ? -1 : 1;
     }), this;
   }
   sqrt() {
-    return h(this, N, s(this, N).map((e) => e.sqrt())), this;
+    return h(this, q, s(this, q).map((e) => e.sqrt())), this;
   }
   subtract(...e) {
     return this.add(...e.map((t) => t.opposite()));
@@ -2887,72 +2887,72 @@ const X = class X {
     const e = this.getZeroes(), t = e.map((r) => r.value), i = this.factors.map((r) => ({ factor: new se(r), ...r.tableOfSigns() }));
     return i.forEach((r) => {
       const l = new Array(2 * e.length + 1).fill("");
-      let c = r.signs.shift(), u = r.roots.shift();
+      let c = r.signs.shift(), f = r.roots.shift();
       const d = l.map((p, w) => {
         if (w % 2 === 0)
           return c;
-        if (u === void 0 || u.value !== t[(w - 1) / 2])
+        if (f === void 0 || f.value !== t[(w - 1) / 2])
           return "t";
-        const V = r.signs.shift();
-        return c = r.signs.shift(), u = r.roots.shift(), V;
+        const L = r.signs.shift();
+        return c = r.signs.shift(), f = r.roots.shift(), L;
       });
       r.roots = e, r.signs = d;
-    }), { signs: i.map((r) => r.signs).reduce((r, l) => r.length === 0 ? l : (l.forEach((c, u) => {
+    }), { signs: i.map((r) => r.signs).reduce((r, l) => r.length === 0 ? l : (l.forEach((c, f) => {
       switch (c) {
         case "d":
-          r[u] = "d";
+          r[f] = "d";
           break;
         case "z":
-          r[u] = r[u] === "d" ? "d" : "z";
+          r[f] = r[f] === "d" ? "d" : "z";
           break;
         case "h":
-          r[u] = "h";
+          r[f] = "h";
           break;
         case "-":
-          r[u] = r[u] === "h" ? "h" : r[u] === "-" ? "+" : "-";
+          r[f] = r[f] === "h" ? "h" : r[f] === "-" ? "+" : "-";
           break;
       }
     }), r), []), roots: e, factors: i };
   }
   get variables() {
-    return s(this, N).reduce((e, t) => e.concat(t.variables), []);
+    return s(this, q).reduce((e, t) => e.concat(t.variables), []);
   }
   zero() {
-    return h(this, N, [new se("0", "1")]), this;
+    return h(this, q, [new se("0", "1")]), this;
   }
 };
-it = new WeakMap(), N = new WeakMap(), We = new WeakSet(), ni = function(e, t) {
-  const i = ht(e), n = ht(t), l = Object.keys(i).filter((c) => Object.hasOwn(n, c)).map((c) => {
-    const u = i[c].reduce((p, w) => p.add(w.power), new f("0")), d = n[c].reduce((p, w) => p.add(w.power), new f("0"));
-    return new se(c, f.min(u, d));
+rt = new WeakMap(), q = new WeakMap(), Ye = new WeakSet(), ci = function(e, t) {
+  const i = ut(e), n = ut(t), l = Object.keys(i).filter((c) => Object.hasOwn(n, c)).map((c) => {
+    const f = i[c].reduce((p, w) => p.add(w.power), new u("0")), d = n[c].reduce((p, w) => p.add(w.power), new u("0"));
+    return new se(c, u.min(f, d));
   });
-  return new X(...l);
-}, Mi = function(e, t) {
-  const i = ht(e), n = ht(t), l = [.../* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(n)])].map((c) => {
-    const u = Object.hasOwn(i, c) ? i[c].reduce((p, w) => p.add(w.power), new f("0")) : new f(0), d = Object.hasOwn(n, c) ? n[c].reduce((p, w) => p.add(w.power), new f("0")) : new f(0);
-    return new se(c, f.max(u, d));
+  return new Y(...l);
+}, zi = function(e, t) {
+  const i = ut(e), n = ut(t), l = [.../* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(n)])].map((c) => {
+    const f = Object.hasOwn(i, c) ? i[c].reduce((p, w) => p.add(w.power), new u("0")) : new u(0), d = Object.hasOwn(n, c) ? n[c].reduce((p, w) => p.add(w.power), new u("0")) : new u(0);
+    return new se(c, u.max(f, d));
   });
-  return new X(...l);
-}, gt = new WeakSet(), ri = function() {
+  return new Y(...l);
+}, bt = new WeakSet(), ui = function() {
   let e, t = [];
-  return s(this, it) === lt.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = s(this, N), e.length === 0 && (e = [new se("1")]), { num: e, den: t };
-}, m(X, We);
-let si = X;
-function ht(o) {
-  const e = new f().one(), t = new f().one(), i = o.factors.reduce((l, c) => {
+  return s(this, rt) === dt.ROOT ? (e = this.numerator.factors, t = this.denominator.factors) : e = s(this, q), e.length === 0 && (e = [new se("1")]), { num: e, den: t };
+}, m(Y, Ye);
+let li = Y;
+function ut(o) {
+  const e = new u().one(), t = new u().one(), i = o.factors.reduce((l, c) => {
     if (c.polynom.degree().isZero())
       return c.power.isPositive() ? e.multiply(c.polynom.monoms[0].coefficient) : t.multiply(c.polynom.monoms[0].coefficient), l;
-    const u = c.polynom.display;
-    return Object.hasOwn(l, u) ? l[u].push(c) : l[u] = [c], l;
+    const f = c.polynom.display;
+    return Object.hasOwn(l, f) ? l[f].push(c) : l[f] = [c], l;
   }, {}), { numerator: n, denominator: r } = e.divide(t).reduce();
   return n !== 1 && (i[n.toString()] = [new se(n, 1)]), r !== 1 && (i[r.toString()] = [new se(r, -1)]), i;
 }
-function ns(o, e) {
+function ds(o, e) {
   return o.dimension === e.dimension && o.array.every(
     (t, i) => e.array[i].isEqual(t)
   );
 }
-function rs(o, e) {
+function ps(o, e) {
   if (o.dimension !== e.dimension)
     return !1;
   const t = e.array[0].value / o.array[0].value;
@@ -2960,13 +2960,13 @@ function rs(o, e) {
     (i, n) => e.array[n].value === i.value * t
   );
 }
-function os(o, e) {
-  return o.dimension !== e.dimension ? new f().invalid() : o.array.reduce(
+function ms(o, e) {
+  return o.dimension !== e.dimension ? new u().invalid() : o.array.reduce(
     (t, i, n) => t.add(i.clone().multiply(e.array[n])),
-    new f(0)
+    new u(0)
   );
 }
-function hs(...o) {
+function gs(...o) {
   if (o.some((e) => e.dimension !== o[0].dimension))
     throw new Error("All vectors must have the same dimension");
   if (o[0].dimension !== o.length)
@@ -2979,39 +2979,39 @@ function hs(...o) {
     )
   ).add(o[0].array[2].clone().multiply(o[1].array[0].clone().multiply(o[2].array[1]).subtract(o[1].array[1].clone().multiply(o[2].array[0]))));
 }
-var F, Le;
-const Be = class Be {
+var j, Ve;
+const De = class De {
   constructor(...e) {
-    m(this, F, []);
-    m(this, Le, !1);
-    a(this, "zero", () => (s(this, F).forEach((e) => e.zero()), this));
+    m(this, j, []);
+    m(this, Ve, !1);
+    a(this, "zero", () => (s(this, j).forEach((e) => e.zero()), this));
     a(this, "one", () => (this.zero(), this.x.one(), this));
-    a(this, "opposite", () => (s(this, F).forEach((e) => e.opposite()), this));
-    a(this, "add", (e) => (s(this, F).forEach((t, i) => t.add(e.array[i])), this));
+    a(this, "opposite", () => (s(this, j).forEach((e) => e.opposite()), this));
+    a(this, "add", (e) => (s(this, j).forEach((t, i) => t.add(e.array[i])), 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) => os(this, e));
+    a(this, "dot", (e) => ms(this, e));
     a(this, "normal", () => {
       if (this.dimension >= 3)
         throw new Error("Normal vector can only be determined in 2D");
       const e = this.x.clone().opposite(), t = this.y.clone();
-      return s(this, F)[0] = t, s(this, F)[1] = e, this;
+      return s(this, j)[0] = t, s(this, j)[1] = e, this;
     });
-    a(this, "isEqual", (e) => ns(this, e));
-    a(this, "isColinearTo", (e) => rs(this, e));
+    a(this, "isEqual", (e) => ds(this, e));
+    a(this, "isColinearTo", (e) => ps(this, e));
     a(this, "isNormalTo", (e) => this.dot(e).isZero());
     a(this, "multiplyByScalar", (e) => {
-      const t = new f(e);
+      const t = new u(e);
       return this.array.forEach((i) => i.multiply(t)), this;
     });
-    a(this, "divideByScalar", (e) => this.multiplyByScalar(new f(e).inverse()));
+    a(this, "divideByScalar", (e) => this.multiplyByScalar(new u(e).inverse()));
     a(this, "simplify", () => this.multiplyByScalar(
-      U.lcm(...this.array.map((e) => e.denominator))
+      G.lcm(...this.array.map((e) => e.denominator))
     ).divideByScalar(
-      U.gcd(...this.array.map((e) => e.numerator))
+      G.gcd(...this.array.map((e) => e.numerator))
     ).multiplyByScalar(
       this.x.isNegative() ? -1 : 1
     ));
@@ -3022,7 +3022,7 @@ const Be = class Be {
     a(this, "fromString", (e) => {
       e.startsWith("(") && (e = e.substring(1)), e.endsWith(")") && (e = e.substring(0, e.length - 1));
       const t = e.split(/[,;\s]/g).filter((i) => i.trim() !== "");
-      return t.length < 2 ? this : (h(this, F, t.map((i) => new f(i))), this);
+      return t.length < 2 ? this : (h(this, j, t.map((i) => new u(i))), this);
     });
     e.length > 0 && this.parse(...e);
   }
@@ -3030,59 +3030,59 @@ const Be = class Be {
   // Getter and setter
   // ------------------------------------------
   get array() {
-    return s(this, F);
+    return s(this, j);
   }
   set array(e) {
-    h(this, F, e);
+    h(this, j, e);
   }
   get x() {
-    return s(this, F)[0];
+    return s(this, j)[0];
   }
   set x(e) {
-    s(this, F)[0] = new f(e);
+    s(this, j)[0] = new u(e);
   }
   get y() {
-    return s(this, F)[1];
+    return s(this, j)[1];
   }
   set y(e) {
-    s(this, F)[1] = new f(e);
+    s(this, j)[1] = new u(e);
   }
   get z() {
     if (this.dimension < 3)
       throw new Error("Vector is not 3D");
-    return s(this, F)[2];
+    return s(this, j)[2];
   }
   set z(e) {
     if (this.dimension < 3)
       throw new Error("Vector is not 3D");
-    s(this, F)[2] = new f(e);
+    s(this, j)[2] = new u(e);
   }
   get asPoint() {
-    return s(this, Le);
+    return s(this, Ve);
   }
   set asPoint(e) {
-    h(this, Le, e);
+    h(this, Ve, e);
   }
   get normSquare() {
-    return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new f(0));
+    return this.array.reduce((e, t) => e.add(t.clone().pow(2)), new u(0));
   }
   get norm() {
     return Math.sqrt(this.normSquare.value);
   }
   get tex() {
-    return s(this, Le) ? `\\left(${this.array.map((e) => e.tex).join(";")}\\right)` : `\\begin{pmatrix} ${this.array.map((e) => e.tex).join(" \\\\ ")} \\end{pmatrix}`;
+    return s(this, Ve) ? `\\left(${this.array.map((e) => e.tex).join(";")}\\right)` : `\\begin{pmatrix} ${this.array.map((e) => e.tex).join(" \\\\ ")} \\end{pmatrix}`;
   }
   get display() {
-    return s(this, Le) ? `(${this.array.map((e) => e.display).join(";")})` : `((${this.array.map((e) => e.display).join(",")}))`;
+    return s(this, Ve) ? `(${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, F, s(this, F).slice(0, e));
+      h(this, j, s(this, j).slice(0, e));
     else if (e > this.dimension)
       for (let t = this.dimension; t < e; t++)
-        s(this, F).push(new f(0));
+        s(this, j).push(new u(0));
     return this;
   }
   get dimension() {
@@ -3101,13 +3101,13 @@ const Be = class Be {
     return `((${e.join(",")}))`;
   }
   defineAsPoint(e) {
-    return h(this, Le, e !== !1), this;
+    return h(this, Ve, e !== !1), this;
   }
   parse(...e) {
     if (e.length === 0)
       throw new Error("Invalid value");
     if (e.length === 1) {
-      if (e[0] instanceof Be)
+      if (e[0] instanceof De)
         return e[0].clone();
       if (typeof e[0] == "string")
         return this.fromString(e[0]);
@@ -3115,20 +3115,20 @@ const Be = class Be {
     }
     if (e.length === 2) {
       const [t, i] = e;
-      if (t instanceof Be && i instanceof Be) {
+      if (t instanceof De && i instanceof De) {
         if (t.dimension !== i.dimension)
           throw new Error("Vectors must have the same dimension");
-        return h(this, F, i.array.map((n, r) => n.clone().subtract(t.array[r]))), this;
+        return h(this, j, i.array.map((n, r) => n.clone().subtract(t.array[r]))), this;
       }
     }
-    return h(this, F, e.map((t) => new f(t))), this;
+    return h(this, j, e.map((t) => new u(t))), this;
   }
   clone() {
-    const e = new Be();
+    const e = new De();
     return e.array = this.copy(), e.asPoint = this.asPoint, e;
   }
   copy() {
-    return s(this, F).map((e) => e.clone());
+    return s(this, j).map((e) => e.clone());
   }
   middleOf(e, t) {
     if (e.dimension !== t.dimension)
@@ -3143,7 +3143,7 @@ const Be = class Be {
   cross(e) {
     if (this.dimension !== 3 || e.dimension !== 3)
       throw new Error("Cross product can only be determined in 3D");
-    return new Be(
+    return new De(
       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))
@@ -3156,7 +3156,7 @@ const Be = class Be {
     return this.array.every((e, t) => t === 0 ? e.isOne() : e.isZero());
   }
   distanceTo(e) {
-    const t = new Be(this, e);
+    const t = new De(this, e);
     return {
       value: t.norm,
       fraction: t.normSquare,
@@ -3164,40 +3164,40 @@ const Be = class Be {
     };
   }
 };
-F = new WeakMap(), Le = new WeakMap();
-let E = Be;
-var we = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(we || {}), oi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(oi || {});
-function Ci(o = 0.5) {
+j = new WeakMap(), Ve = new WeakMap();
+let E = De;
+var ve = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(ve || {}), fi = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Perpendicular = "perpendicular", o.Tangent = "tangent", o))(fi || {});
+function Ri(o = 0.5) {
   return Math.random() < o;
 }
-function pe(o, e, t) {
+function me(o, e, t) {
   if (e === void 0)
-    return o >= 0 ? pe(0, o) : pe(o, 0);
+    return o >= 0 ? me(0, o) : me(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 i = pe(o, e);
+  let i = me(o, e);
   for (; t.includes(i); )
-    i = pe(o, e);
+    i = me(o, e);
   return i;
 }
-function Q(o, e) {
-  return e === !1 ? Ci() ? pe(1, o) : -pe(1, o) : pe(-o, o);
+function H(o, e) {
+  return e === !1 ? Ri() ? me(1, o) : -me(1, o) : me(-o, o);
 }
-function as(o) {
-  let e = U.primes();
-  return o !== void 0 && (e = e.filter((t) => t < o)), di(e);
+function ys(o) {
+  let e = G.primes();
+  return o !== void 0 && (e = e.filter((t) => t < o)), bi(e);
 }
-function ls(o, e) {
-  return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : Pi(o).slice(0, e);
+function ws(o, e) {
+  return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : Di(o).slice(0, e);
 }
-function di(o) {
-  return o.length === 0 ? null : o[pe(0, o.length - 1)];
+function bi(o) {
+  return o.length === 0 ? null : o[me(0, o.length - 1)];
 }
-function Pi(o) {
+function Di(o) {
   const e = Object.values(o);
   for (let t = e.length - 1; t > 0; t--) {
     const i = Math.floor(Math.random() * (t + 1)), n = e[t];
@@ -3219,7 +3219,7 @@ class S extends E {
     if (e.length > 1) {
       if (e.some((i) => i instanceof E))
         throw new Error("Creating a point with  multiple argument requires an input fraction");
-      const t = e.map((i) => new f(i));
+      const t = e.map((i) => new u(i));
       if (t.some((i) => i.isNaN()))
         throw new Error("The value is not a valid point sting (a,b): " + e.join(","));
       this.array = t;
@@ -3231,32 +3231,32 @@ class S extends E {
     return e.array = this.copy(), e.asPoint = !0, e;
   }
 }
-var $e, B, z, W, he, J, Ie, xe;
-const De = class De {
+var Ie, I, R, W, he, J, ze, Ee;
+const je = class je {
   /**
    * Value can be a mix of:
    *
    * @param values
    */
   constructor(...e) {
-    m(this, $e);
+    m(this, Ie);
     // ax + by + c = 0
-    m(this, B);
-    m(this, z);
+    m(this, I);
+    m(this, R);
     m(this, W);
     m(this, he);
     m(this, J);
-    m(this, Ie);
-    m(this, xe, "canonical");
+    m(this, ze);
+    m(this, Ee, "canonical");
     a(this, "randomPoint", (e) => {
-      const t = s(this, J).clone().multiplyByScalar(Q(e === void 0 || e <= 1 ? 3 : e, !1)).add(s(this, he));
+      const t = s(this, J).clone().multiplyByScalar(H(e === void 0 || e <= 1 ? 3 : e, !1)).add(s(this, he));
       return t.asPoint = !0, t;
     });
     a(this, "randomNearPoint", (e) => {
       const t = this.randomPoint(e);
       let i = 10;
       for (; this.isOnLine(t) && i > 0; )
-        t.x.add(Q(1, !1)), t.y.add(Q(1, !1)), i--;
+        t.x.add(H(1, !1)), t.y.add(H(1, !1)), i--;
       return t;
     });
     // ------------------------------------------
@@ -3271,13 +3271,13 @@ const De = class De {
       if (e.length === 0)
         return this;
       if (e.length === 1) {
-        if (e[0] instanceof De)
+        if (e[0] instanceof je)
           return this.fromCoefficient(e[0].a, e[0].b, e[0].c);
-        if (e[0] instanceof H)
+        if (e[0] instanceof V)
           return this.fromEquation(e[0]);
         if (typeof e[0] == "string")
           try {
-            const t = new H(e[0]);
+            const t = new V(e[0]);
             return this.parse(t);
           } catch {
             return this;
@@ -3292,12 +3292,12 @@ const De = class De {
       }
       if (e.length === 3) {
         if (e[0] instanceof E && e[1] instanceof E) {
-          if (e[2] === we.Perpendicular)
+          if (e[2] === ve.Perpendicular)
             return this.fromPointAndNormal(e[0], e[1]);
-          if (e[2] === we.Parallel)
+          if (e[2] === ve.Parallel)
             return this.fromPointAndDirection(e[0], e[1]);
         }
-        return e[0] instanceof E && e[1] instanceof De ? e[2] === we.Parallel || e[2] === null ? this.fromPointAndLine(e[0], e[1], we.Parallel) : this.fromPointAndLine(e[0], e[1], we.Perpendicular) : this.fromCoefficient(
+        return e[0] instanceof E && e[1] instanceof je ? e[2] === ve.Parallel || e[2] === null ? this.fromPointAndLine(e[0], e[1], ve.Parallel) : this.fromPointAndLine(e[0], e[1], ve.Perpendicular) : this.fromCoefficient(
           e[0],
           e[1],
           e[2]
@@ -3318,34 +3318,34 @@ const De = class De {
         e.left.monomByDegree(0).coefficient
       );
     });
-    a(this, "fromCoefficient", (e, t, i) => (h(this, B, new f(e)), h(this, z, new f(t)), h(this, W, new f(i)), h(this, J, new E(s(this, z).clone(), s(this, B).clone().opposite())), h(this, he, new E(new f().zero(), s(this, W).clone())), h(this, Ie, s(this, J).clone().normal()), this));
+    a(this, "fromCoefficient", (e, t, i) => (h(this, I, new u(e)), h(this, R, new u(t)), h(this, W, new u(i)), h(this, J, new E(s(this, R).clone(), s(this, I).clone().opposite())), h(this, he, new E(new u().zero(), s(this, W).clone())), h(this, ze, s(this, J).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, he, e.clone()), h(this, J, t.clone()), h(this, Ie, s(this, J).clone().normal()), this));
+    ), h(this, he, e.clone()), h(this, J, t.clone()), h(this, ze, s(this, J).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, "fromPointAndLine", (e, t, i) => (i === void 0 && (i = we.Parallel), i === we.Parallel ? this.fromPointAndNormal(e, t.normal) : i === we.Perpendicular ? this.fromPointAndNormal(e, t.director) : this));
-    a(this, "clone", () => (h(this, B, s(this, B).clone()), h(this, z, s(this, z).clone()), h(this, W, s(this, W).clone()), h(this, J, s(this, J).clone()), h(this, he, s(this, he).clone()), h(this, Ie, s(this, Ie).clone()), this));
+    a(this, "fromPointAndLine", (e, t, i) => (i === void 0 && (i = ve.Parallel), i === ve.Parallel ? this.fromPointAndNormal(e, t.normal) : i === ve.Perpendicular ? this.fromPointAndNormal(e, t.director) : this));
+    a(this, "clone", () => (h(this, I, s(this, I).clone()), h(this, R, s(this, R).clone()), h(this, W, s(this, W).clone()), h(this, J, s(this, J).clone()), h(this, he, s(this, he).clone()), h(this, ze, s(this, ze).clone()), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
-    a(this, "isOnLine", (e) => s(this, B).clone().multiply(e.x).add(
-      s(this, z).clone().multiply(e.y)
+    a(this, "isOnLine", (e) => s(this, I).clone().multiply(e.x).add(
+      s(this, R).clone().multiply(e.y)
     ).add(s(this, W)).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 = U.lcm(s(this, B).denominator, s(this, z).denominator, s(this, W).denominator), t = U.gcd(s(this, B).numerator, s(this, z).numerator, s(this, W).numerator);
+      const e = G.lcm(s(this, I).denominator, s(this, R).denominator, s(this, W).denominator), t = G.gcd(s(this, I).numerator, s(this, R).numerator, s(this, W).numerator);
       return this.fromCoefficient(
-        s(this, B).clone().multiply(e).divide(t),
-        s(this, z).clone().multiply(e).divide(t),
+        s(this, I).clone().multiply(e).divide(t),
+        s(this, R).clone().multiply(e).divide(t),
         s(this, W).clone().multiply(e).divide(t)
       ), this;
     });
@@ -3353,7 +3353,7 @@ const De = class De {
     a(this, "intersection", (e) => {
       const t = new S();
       let i = !1, n = !1;
-      return s(this, z).isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new f().invalid(), t.y = new f().invalid(), i = !0) : this.isSameAs(e) ? (t.x = new f().invalid(), t.y = new f().invalid(), n = !0) : (t.x = s(this, z).clone().multiply(e.c).subtract(s(this, W).clone().multiply(e.b)).divide(s(this, B).clone().multiply(e.b).subtract(s(this, z).clone().multiply(e.a))), t.y = s(this, B).clone().multiply(e.c).subtract(s(this, W).clone().multiply(e.a)).divide(s(this, z).clone().multiply(e.a).subtract(s(this, B).clone().multiply(e.b)))), {
+      return s(this, R).isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = new u().invalid(), t.y = new u().invalid(), i = !0) : this.isSameAs(e) ? (t.x = new u().invalid(), t.y = new u().invalid(), n = !0) : (t.x = s(this, R).clone().multiply(e.c).subtract(s(this, W).clone().multiply(e.b)).divide(s(this, I).clone().multiply(e.b).subtract(s(this, R).clone().multiply(e.a))), t.y = s(this, I).clone().multiply(e.c).subtract(s(this, W).clone().multiply(e.a)).divide(s(this, R).clone().multiply(e.a).subtract(s(this, I).clone().multiply(e.b)))), {
         point: t,
         hasIntersection: !(i || n),
         isParallel: i,
@@ -3361,28 +3361,28 @@ const De = class De {
       };
     });
     a(this, "getValueAtX", (e) => {
-      const t = this.getEquation().isolate("y"), i = new f(e);
-      return t instanceof H ? t.right.evaluate({ x: i }) : new f().invalid();
+      const t = this.getEquation().isolate("y"), i = new u(e);
+      return t instanceof V ? t.right.evaluate({ x: i }) : new u().invalid();
     });
     a(this, "getValueAtY", (e) => {
-      const t = this.getEquation().isolate("x"), i = new f(e);
-      return t instanceof H ? t.right.evaluate({ y: i }) : new f().invalid();
+      const t = this.getEquation().isolate("x"), i = new u(e);
+      return t instanceof V ? t.right.evaluate({ y: i }) : new u().invalid();
     });
-    return h(this, B, new f().zero()), h(this, z, new f().zero()), h(this, W, new f().zero()), h(this, he, new E()), h(this, J, new E()), h(this, Ie, new E()), h(this, $e, !0), e.length > 0 && this.parse(...e), this;
+    return h(this, I, new u().zero()), h(this, R, new u().zero()), h(this, W, new u().zero()), h(this, he, new E()), h(this, J, new E()), h(this, ze, new E()), h(this, Ie, !0), e.length > 0 && this.parse(...e), this;
   }
   get a() {
-    return s(this, B);
+    return s(this, I);
   }
   // ------------------------------------------
   // Getter and setter
   set a(e) {
-    h(this, B, e);
+    h(this, I, e);
   }
   get b() {
-    return s(this, z);
+    return s(this, R);
   }
   set b(e) {
-    h(this, z, e);
+    h(this, R, e);
   }
   get c() {
     return s(this, W);
@@ -3403,12 +3403,12 @@ const De = class De {
     h(this, J, e);
   }
   get n() {
-    return s(this, Ie);
+    return s(this, ze);
   }
   // ------------------------------------------
   getEquation() {
-    const e = new H(new O().parse("xy", s(this, B), s(this, z), s(this, W)), new O("0"));
-    return s(this, $e) ? e.simplify() : e;
+    const e = new V(new N().parse("xy", s(this, I), s(this, R), s(this, W)), new N("0"));
+    return s(this, Ie) ? e.simplify() : e;
   }
   // get system(): { x: Equation, y: Equation } {
   //     const e1 = new Equation(
@@ -3424,86 +3424,86 @@ const De = class De {
   //     return { x: e1, y: e2 }
   // }
   get canonical() {
-    return h(this, xe, "canonical"), this;
+    return h(this, Ee, "canonical"), this;
   }
   get equation() {
-    return h(this, xe, "equation"), this;
+    return h(this, Ee, "equation"), this;
   }
   get mxh() {
-    return h(this, xe, "mxh"), this;
+    return h(this, Ee, "mxh"), this;
   }
   get parametric() {
-    return h(this, xe, "parametric"), this;
+    return h(this, Ee, "parametric"), this;
   }
   get system() {
-    return h(this, xe, "system"), this;
+    return h(this, Ee, "system"), this;
   }
   get tex() {
-    const e = s(this, xe);
-    switch (h(this, xe, "canonical"), e) {
+    const e = s(this, Ee);
+    switch (h(this, Ee, "canonical"), e) {
       case "equation":
         return this.getEquation().reorder().tex;
       case "mxh":
-        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new O().parse("x", this.slope, this.height).tex;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new N().parse("x", this.slope, this.height).tex;
       case "parametric":
       case "system": {
         const t = s(this, J).clone();
-        return s(this, $e) && t.simplify(), e === "parametric" ? `${E.asTex("x", "y")} = ${E.asTex(s(this, he).x.tex, s(this, he).y.tex)} + k\\cdot ${E.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
-            x &= ${new O(s(this, he).x).add(new M(s(this, J).x).multiply(new M("k"))).reorder("k", !0).tex}\\\\ 
-            y &= ${new O(s(this, he).y).add(new M(s(this, J).y).multiply(new M("k"))).reorder("k", !0).tex}
+        return s(this, Ie) && t.simplify(), e === "parametric" ? `${E.asTex("x", "y")} = ${E.asTex(s(this, he).x.tex, s(this, he).y.tex)} + k\\cdot ${E.asTex(t.x.tex, t.y.tex)}` : `\\left\\{\\begin{aligned}
+            x &= ${new N(s(this, he).x).add(new k(s(this, J).x).multiply(new k("k"))).reorder("k", !0).tex}\\\\ 
+            y &= ${new N(s(this, he).y).add(new k(s(this, J).y).multiply(new k("k"))).reorder("k", !0).tex}
             \\end{aligned}\\right.`;
       }
       default: {
         const t = this.getEquation();
-        return s(this, B).isNegative() && t.multiply(-1), t.tex;
+        return s(this, I).isNegative() && t.multiply(-1), t.tex;
       }
     }
   }
   get reduceBeforeDisplay() {
-    return s(this, $e);
+    return s(this, Ie);
   }
   set reduceBeforeDisplay(e) {
-    h(this, $e, e);
+    h(this, Ie, e);
   }
   get display() {
-    const e = s(this, xe);
-    switch (h(this, xe, "canonical"), e) {
+    const e = s(this, Ee);
+    switch (h(this, Ee, "canonical"), e) {
       case "equation":
         return this.getEquation().reorder().display;
       case "mxh":
-        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new O().parse("x", this.slope, this.height).display;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new N().parse("x", this.slope, this.height).display;
       case "parametric": {
         const t = s(this, J).clone();
-        return s(this, $e) && t.simplify(), `((x,y))=((${s(this, he).x.display},${s(this, he).y.display}))+k((${t.x.display},${t.y.display}))`;
+        return s(this, Ie) && t.simplify(), `((x,y))=((${s(this, he).x.display},${s(this, he).y.display}))+k((${t.x.display},${t.y.display}))`;
       }
       default: {
         const t = this.getEquation();
-        return s(this, B).isNegative() && t.multiply(-1), t.display;
+        return s(this, I).isNegative() && t.multiply(-1), t.display;
       }
     }
   }
   get normal() {
-    return new E(s(this, B), s(this, z));
+    return new E(s(this, I), s(this, R));
   }
   get director() {
     return s(this, J).clone();
   }
   get slope() {
-    return s(this, B).clone().opposite().divide(s(this, z));
+    return s(this, I).clone().opposite().divide(s(this, R));
   }
   get height() {
-    return s(this, W).clone().opposite().divide(s(this, z));
+    return s(this, W).clone().opposite().divide(s(this, R));
   }
   fromPoints(e, t) {
     return this.fromPointAndDirection(e, new E(e, t));
   }
   distanceTo(e) {
-    const t = e.x.clone().multiply(s(this, B)).add(e.y.clone().multiply(s(this, z))).add(s(this, W)).abs(), i = this.normal.normSquare;
+    const t = e.x.clone().multiply(s(this, I)).add(e.y.clone().multiply(s(this, R))).add(s(this, W)).abs(), i = this.normal.normSquare;
     if (i.isZero())
       return {
         value: NaN,
         tex: "Not a line",
-        fraction: new f().infinite()
+        fraction: new u().infinite()
       };
     const n = t.value / Math.sqrt(i.value), r = t.clone().divide(i.clone().sqrt());
     return i.isSquare() ? {
@@ -3518,7 +3518,7 @@ const De = class De {
   }
   hitSegment(e, t) {
     const i = this.intersection(
-      new De().fromPoints(e, t)
+      new je().fromPoints(e, t)
     );
     return i.hasIntersection ? i.point.x.value >= Math.min(e.x.value, t.x.value) && i.point.x.value <= Math.max(e.x.value, t.x.value) && i.point.y.value >= Math.min(e.y.value, t.y.value) && i.point.y.value <= Math.max(e.y.value, t.y.value) : !1;
   }
@@ -3528,44 +3528,44 @@ const De = class De {
   canonicalAsFloatCoefficient(e) {
     e === void 0 && (e = 2);
     let t = "";
-    return s(this, B).isZero() || (s(this, B).isOne() ? t = "x" : s(this, B).clone().opposite().isOne() ? t = "-x" : t = s(this, B).value.toFixed(e) + "x"), s(this, z).isZero() || (s(this, z).isPositive() && (t += "+"), t += s(this, z).value.toFixed(e) + "y"), s(this, W).isZero() || (s(this, W).isPositive() && (t += "+"), t += s(this, W).value.toFixed(e)), t + "=0";
+    return s(this, I).isZero() || (s(this, I).isOne() ? t = "x" : s(this, I).clone().opposite().isOne() ? t = "-x" : t = s(this, I).value.toFixed(e) + "x"), s(this, R).isZero() || (s(this, R).isPositive() && (t += "+"), t += s(this, R).value.toFixed(e) + "y"), s(this, W).isZero() || (s(this, W).isPositive() && (t += "+"), t += s(this, W).value.toFixed(e)), t + "=0";
   }
 };
-$e = new WeakMap(), B = new WeakMap(), z = new WeakMap(), W = new WeakMap(), he = new WeakMap(), J = new WeakMap(), Ie = new WeakMap(), xe = new WeakMap(), // A line is defined as the canonical form
-a(De, "PERPENDICULAR", we.Perpendicular), a(De, "PARALLEL", we.Parallel);
-let R = De;
-var ae, j, qe, Ut, Wt, Gt, le, $i, Nt, Ii, Si, Bi, hi;
-const Ht = class Ht {
+Ie = new WeakMap(), I = new WeakMap(), R = new WeakMap(), W = new WeakMap(), he = new WeakMap(), J = new WeakMap(), ze = new WeakMap(), Ee = new WeakMap(), // A line is defined as the canonical form
+a(je, "PERPENDICULAR", ve.Perpendicular), a(je, "PARALLEL", ve.Parallel);
+let z = je;
+var ae, U, Me, Ht, Kt, Jt, le, Li, kt, Zi, Vi, Fi, di;
+const _t = class _t {
   constructor(...e) {
     m(this, le);
     m(this, ae);
-    m(this, j);
-    m(this, qe);
+    m(this, U);
+    m(this, Me);
     /**
      * 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 (s(this, ae) === void 0 || s(this, j) === void 0)
+      if (s(this, ae) === void 0 || s(this, U) === void 0)
         throw new Error("Circle not defined");
-      const t = e.distanceTo(s(this, ae)), i = Math.sqrt(s(this, j).value);
+      const t = e.distanceTo(s(this, ae)), i = Math.sqrt(s(this, U).value);
       return t.value - i > 1e-10 ? 0 : Math.abs(t.value - i) < 1e-10 ? 1 : 2;
     });
     a(this, "lineIntersection", (e) => {
       const t = [];
-      if (s(this, qe) === void 0)
+      if (s(this, Me) === void 0)
         return [];
-      const i = s(this, qe).clone(), n = e.getEquation().clone().isolate("x"), r = e.getEquation().clone().isolate("y");
-      return n instanceof H && r instanceof H && (i.replaceBy("y", r.right).simplify(), i.solve()), t;
+      const i = s(this, Me).clone(), n = e.getEquation().clone().isolate("x"), r = e.getEquation().clone().isolate("y");
+      return n instanceof V && r instanceof V && (i.replaceBy("y", r.right).simplify(), i.solve()), t;
     });
-    a(this, "tangents", (e) => e instanceof f ? s(this, Gt).call(this, e) : this.isPointOnCircle(e) ? s(this, Ut).call(this, e) : s(this, ae) !== void 0 && s(this, ae).distanceTo(e).value > this.radius.value ? s(this, Wt).call(this, e) : (console.log("No tangents as the point is inside !"), []));
+    a(this, "tangents", (e) => e instanceof u ? s(this, Jt).call(this, e) : this.isPointOnCircle(e) ? s(this, Ht).call(this, e) : s(this, ae) !== void 0 && s(this, ae).distanceTo(e).value > this.radius.value ? s(this, Kt).call(this, e) : (console.log("No tangents as the point is inside !"), []));
     a(this, "isPointOnCircle", (e) => {
       var t;
-      return ((t = s(this, qe)) == null ? void 0 : t.test({ x: e.x, y: e.y })) ?? !1;
+      return ((t = s(this, Me)) == null ? void 0 : t.test({ x: e.x, y: e.y })) ?? !1;
     });
     a(this, "getPointsOnCircle", (e) => {
-      const t = U.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), i = [];
+      const t = G.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), i = [];
       return t.forEach((n) => {
         for (const r of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
           i.push(
@@ -3576,21 +3576,21 @@ const Ht = class Ht {
           );
       }), i;
     });
-    m(this, Ut, (e) => {
+    m(this, Ht, (e) => {
       const t = new E(this.center, e);
-      return [new R(e, t, we.Perpendicular)];
+      return [new z(e, t, ve.Perpendicular)];
     });
-    m(this, Wt, (e) => {
-      const t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), n = new O("x"), r = new O("x^2+1");
-      return n.multiply(t).subtract(i).pow(2), r.multiply(this.squareRadius), new H(n, r).solve().map((u) => {
+    m(this, Kt, (e) => {
+      const t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), n = new N("x"), r = new N("x^2+1");
+      return n.multiply(t).subtract(i).pow(2), r.multiply(this.squareRadius), new V(n, r).solve().map((f) => {
         let d;
-        const p = new H("y", "x");
-        return u.exact instanceof f ? (d = e.x.clone().opposite().multiply(u.exact).add(e.y), p.right.multiply(u.exact).add(d)) : (d = e.x.clone().opposite().multiply(u.value).add(e.y), p.right.multiply(u.value).add(d)), new R(p);
+        const p = new V("y", "x");
+        return f.exact instanceof u ? (d = e.x.clone().opposite().multiply(f.exact).add(e.y), p.right.multiply(f.exact).add(d)) : (d = e.x.clone().opposite().multiply(f.value).add(e.y), p.right.multiply(f.value).add(d)), new z(p);
       });
     });
-    m(this, Gt, (e) => {
-      const t = e.numerator, i = -e.denominator, n = this.center.x.clone(), r = this.center.y.clone(), l = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), c = n.clone().multiply(t).opposite().subtract(r.clone().multiply(i)).add(l.clone().sqrt()), u = n.clone().multiply(t).opposite().subtract(r.clone().multiply(i)).subtract(l.clone().sqrt());
-      return [new R(t, i, c), new R(t, i, u)];
+    m(this, Jt, (e) => {
+      const t = e.numerator, i = -e.denominator, n = this.center.x.clone(), r = this.center.y.clone(), l = this.squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), c = n.clone().multiply(t).opposite().subtract(r.clone().multiply(i)).add(l.clone().sqrt()), f = n.clone().multiply(t).opposite().subtract(r.clone().multiply(i)).subtract(l.clone().sqrt());
+      return [new z(t, i, c), new z(t, i, f)];
     });
     e.length > 0 && this.parse(...e);
   }
@@ -3598,22 +3598,22 @@ const Ht = class Ht {
     return s(this, ae) ?? new S();
   }
   get squareRadius() {
-    return s(this, j) ?? new f(0);
+    return s(this, U) ?? new u(0);
   }
   get cartesian() {
-    if (s(this, qe) === void 0)
+    if (s(this, Me) === void 0)
       throw new Error("Cartesian equation not defined");
-    return s(this, qe);
+    return s(this, Me);
   }
   get radius() {
-    return s(this, j) === void 0 ? { tex: "", display: "", value: 0 } : s(this, j).isSquare() ? {
-      tex: s(this, j).clone().sqrt().tex,
-      display: s(this, j).clone().sqrt().display,
-      value: s(this, j).clone().sqrt().value
+    return s(this, U) === void 0 ? { tex: "", display: "", value: 0 } : s(this, U).isSquare() ? {
+      tex: s(this, U).clone().sqrt().tex,
+      display: s(this, U).clone().sqrt().display,
+      value: s(this, U).clone().sqrt().value
     } : {
-      tex: `\\sqrt{${s(this, j).tex}}`,
-      display: `sqrt(${s(this, j).display})`,
-      value: s(this, j).clone().sqrt().value
+      tex: `\\sqrt{${s(this, U).tex}}`,
+      display: `sqrt(${s(this, U).display})`,
+      value: s(this, U).clone().sqrt().value
     };
   }
   get tex() {
@@ -3628,17 +3628,17 @@ const Ht = class Ht {
     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 Ht(
+    return new _t(
       this.center.clone(),
       this.squareRadius.clone(),
       !0
     );
   }
   setRadius(e, t) {
-    return t ? h(this, j, new f(e)) : h(this, j, new f(e).pow(2)), A(this, le, Nt).call(this), this;
+    return t ? h(this, U, new u(e)) : h(this, U, new u(e).pow(2)), A(this, le, kt).call(this), this;
   }
   parse(...e) {
-    return A(this, le, $i).call(this), typeof e[0] == "string" ? A(this, le, hi).call(this, new H(e[0])) : e[0] instanceof H ? A(this, le, hi).call(this, e[0]) : e[0] instanceof Ht ? A(this, le, Ii).call(this, e[0]) : e[0] instanceof S && e.length > 1 && (e[1] instanceof S ? e[2] instanceof S || A(this, le, Bi).call(this, e[0], e[1]) : (e[1] instanceof f || typeof e[1] == "number") && A(this, le, Si).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), A(this, le, Nt).call(this), this;
+    return A(this, le, Li).call(this), typeof e[0] == "string" ? A(this, le, di).call(this, new V(e[0])) : e[0] instanceof V ? A(this, le, di).call(this, e[0]) : e[0] instanceof _t ? A(this, le, Zi).call(this, e[0]) : e[0] instanceof S && e.length > 1 && (e[1] instanceof S ? e[2] instanceof S || A(this, le, Fi).call(this, e[0], e[1]) : (e[1] instanceof u || typeof e[1] == "number") && A(this, le, Vi).call(this, e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), A(this, le, kt).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(),
@@ -3647,35 +3647,35 @@ const Ht = class Ht {
   //     return this
   // }
 };
-ae = new WeakMap(), j = new WeakMap(), qe = new WeakMap(), Ut = new WeakMap(), Wt = new WeakMap(), Gt = new WeakMap(), le = new WeakSet(), $i = function() {
-  return h(this, ae, void 0), h(this, j, void 0), h(this, qe, void 0), this;
-}, Nt = function() {
-  h(this, qe, new H(
-    new O(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
-    new O(this.squareRadius.display)
+ae = new WeakMap(), U = new WeakMap(), Me = new WeakMap(), Ht = new WeakMap(), Kt = new WeakMap(), Jt = new WeakMap(), le = new WeakSet(), Li = function() {
+  return h(this, ae, void 0), h(this, U, void 0), h(this, Me, void 0), this;
+}, kt = function() {
+  h(this, Me, new V(
+    new N(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
+    new N(this.squareRadius.display)
   ).moveLeft());
-}, Ii = function(e) {
-  return h(this, ae, e.center.clone()), h(this, j, e.squareRadius.clone()), A(this, le, Nt).call(this), this;
-}, Si = function(e, t, i) {
-  return h(this, ae, e.clone()), i ? h(this, j, new f(t)) : h(this, j, new f(t).pow(2)), this;
-}, Bi = function(e, t) {
-  return h(this, ae, e.clone()), h(this, j, new E(s(this, ae), t).normSquare), this;
-}, hi = function(e) {
+}, Zi = function(e) {
+  return h(this, ae, e.center.clone()), h(this, U, e.squareRadius.clone()), A(this, le, kt).call(this), this;
+}, Vi = function(e, t, i) {
+  return h(this, ae, e.clone()), i ? h(this, U, new u(t)) : h(this, U, new u(t).pow(2)), this;
+}, Fi = function(e, t) {
+  return h(this, ae, e.clone()), h(this, U, new E(s(this, ae), t).normSquare), this;
+}, di = function(e) {
   if (e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
     const t = e.left.monomByDegree(2, "x"), i = e.left.monomByDegree(2, "y");
     let n, r, l;
-    t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), n = e.left.monomByDegree(1, "x"), r = e.left.monomByDegree(1, "y"), l = e.left.monomByDegree(0), h(this, ae, new S(n.coefficient.clone().divide(2).opposite(), r.coefficient.clone().divide(2).opposite())), h(this, j, l.coefficient.clone().opposite().add(s(this, ae).x.clone().pow(2)).add(s(this, ae).y.clone().pow(2)))) : (h(this, ae, void 0), h(this, j, void 0));
+    t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), n = e.left.monomByDegree(1, "x"), r = e.left.monomByDegree(1, "y"), l = e.left.monomByDegree(0), h(this, ae, new S(n.coefficient.clone().divide(2).opposite(), r.coefficient.clone().divide(2).opposite())), h(this, U, l.coefficient.clone().opposite().add(s(this, ae).x.clone().pow(2)).add(s(this, ae).y.clone().pow(2)))) : (h(this, ae, void 0), h(this, U, void 0));
   }
   return this;
 };
-let Tt = Ht;
-var L, G;
-const ct = class ct {
+let $t = _t;
+var D, X;
+const pt = class pt {
   constructor(e, t) {
     // ax + by + c = 0
-    m(this, L, new S());
-    m(this, G, new E());
-    a(this, "clone", () => (h(this, G, s(this, G).clone()), h(this, L, s(this, L).clone()), this));
+    m(this, D, new S());
+    m(this, X, new E());
+    a(this, "clone", () => (h(this, X, s(this, X).clone()), h(this, D, s(this, D).clone()), this));
     // ------------------------------------------
     // Mathematical operations
     // ------------------------------------------
@@ -3715,54 +3715,54 @@ const ct = class ct {
     //     return new Fraction().invalid()
     // }
     a(this, "randomPoint", (e = 5) => {
-      const t = s(this, L).clone(), i = new f(Q(e, !1));
+      const t = s(this, D).clone(), i = new u(H(e, !1));
       return new S(
-        t.x.clone().add(s(this, G).x.clone().multiply(i)),
-        t.y.clone().add(s(this, G).y.clone().multiply(i)),
-        t.z.clone().add(s(this, G).z.clone().multiply(i))
+        t.x.clone().add(s(this, X).x.clone().multiply(i)),
+        t.y.clone().add(s(this, X).y.clone().multiply(i)),
+        t.z.clone().add(s(this, X).z.clone().multiply(i))
       );
     });
-    return h(this, L, e.clone()), h(this, G, t.asPoint ? new E(e, t) : t.clone()), this;
+    return h(this, D, e.clone()), h(this, X, t.asPoint ? new E(e, t) : t.clone()), this;
   }
   get OA() {
-    return s(this, L);
+    return s(this, D);
   }
   set OA(e) {
-    h(this, L, e);
+    h(this, D, e);
   }
   get point() {
-    return s(this, L).clone();
+    return s(this, D).clone();
   }
   get d() {
-    return s(this, G);
+    return s(this, X);
   }
   set d(e) {
-    h(this, G, e);
+    h(this, X, e);
   }
   get tex() {
     return {
-      parametric: `${E.asTex("x", "y", "z")} = ${E.asTex(s(this, L).x.tex, s(this, L).y.tex, s(this, L).z.tex)} + k\\cdot ${E.asTex(s(this, G).x.tex, s(this, G).y.tex, s(this, G).z.tex)}`,
+      parametric: `${E.asTex("x", "y", "z")} = ${E.asTex(s(this, D).x.tex, s(this, D).y.tex, s(this, D).z.tex)} + k\\cdot ${E.asTex(s(this, X).x.tex, s(this, X).y.tex, s(this, X).z.tex)}`,
       system: `\\left\\{\\begin{aligned}
-    x &= ${new O(s(this, L).x).add(new M(s(this, G).x).multiply(new M("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new O(s(this, L).y).add(new M(s(this, G).y).multiply(new M("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new O(s(this, L).z).add(new M(s(this, G).z).multiply(new M("k"))).reorder("k", !0).tex}
+    x &= ${new N(s(this, D).x).add(new k(s(this, X).x).multiply(new k("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new N(s(this, D).y).add(new k(s(this, X).y).multiply(new k("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new N(s(this, D).z).add(new k(s(this, X).z).multiply(new k("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`,
-      cartesian: `\\frac{ ${new O("x", 1, s(this, L).x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new O("y", 1, s(this, L).y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new O("z", 1, s(this, L).z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+      cartesian: `\\frac{ ${new N("x", 1, s(this, D).x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new N("y", 1, s(this, D).y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new N("z", 1, s(this, D).z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
     };
   }
   get display() {
-    const e = s(this, L).x.display, t = s(this, L).y.display, i = s(this, L).z.display, n = this.direction.simplify(), r = n.x.display, l = n.y.display, c = n.z.display;
+    const e = s(this, D).x.display, t = s(this, D).y.display, i = s(this, D).z.display, n = this.direction.simplify(), r = n.x.display, l = n.y.display, c = n.z.display;
     return {
-      parametric: `${E.asDisplay("x", "y", "z")} = ${E.asDisplay(s(this, L).x.display, s(this, L).y.display, s(this, L).z.display)} + k\\cdot ${E.asDisplay(s(this, G).x.display, s(this, G).y.display, s(this, G).z.display)}`,
+      parametric: `${E.asDisplay("x", "y", "z")} = ${E.asDisplay(s(this, D).x.display, s(this, D).y.display, s(this, D).z.display)} + k\\cdot ${E.asDisplay(s(this, X).x.display, s(this, X).y.display, s(this, X).z.display)}`,
       system: "",
       cartesian: `(x-${e})/${r} = (y-${t})/${l} = (z-${i})/${c}`
     };
   }
   get direction() {
-    return s(this, G).clone();
+    return s(this, X).clone();
   }
   distanceTo(e) {
-    const t = new E(s(this, L), e), i = this.direction, n = this.direction.normSquare, r = t.cross(i).normSquare, l = r.clone().divide(n), c = l.clone().sqrt();
+    const t = new E(s(this, D), e), i = this.direction, n = this.direction.normSquare, r = t.cross(i).normSquare, l = r.clone().divide(n), c = l.clone().sqrt();
     return console.log("CROSS", t.cross(i).display), {
       value: Math.sqrt(l.value),
       fraction: l.clone().sqrt(),
@@ -3771,76 +3771,82 @@ const ct = class ct {
   }
   hitSegment(e, t) {
     const i = this.intersection(
-      new ct(e, t)
+      new pt(e, t)
     );
     return i.hasIntersection ? i.point.x.value >= Math.min(e.x.value, t.x.value) && i.point.x.value <= Math.max(e.x.value, t.x.value) && i.point.y.value >= Math.min(e.y.value, t.y.value) && i.point.y.value <= Math.max(e.y.value, t.y.value) && i.point.z.value >= Math.min(e.z.value, t.z.value) && i.point.z.value <= Math.max(e.z.value, t.z.value) : !1;
   }
 };
-L = new WeakMap(), G = new WeakMap(), // A line is defined as the canonical form
-a(ct, "PERPENDICULAR", oi.Perpendicular), a(ct, "PARALLEL", oi.Parallel);
-let Ot = ct;
-var ke;
-class cs {
+D = new WeakMap(), X = new WeakMap(), // A line is defined as the canonical form
+a(pt, "PERPENDICULAR", fi.Perpendicular), a(pt, "PARALLEL", fi.Parallel);
+let Bt = pt;
+var $e;
+class vs {
   constructor(...e) {
-    m(this, ke, []);
-    return h(this, ke, e), this;
+    m(this, $e, []);
+    return h(this, $e, e), this;
   }
   get values() {
-    return s(this, ke);
+    return s(this, $e);
   }
   get array() {
-    return s(this, ke).map((e) => e.array);
+    return s(this, $e).map((e) => e.array);
   }
   get dimension() {
-    return [s(this, ke).length, s(this, ke)[0].dimension];
+    return [s(this, $e).length, s(this, $e)[0].dimension];
   }
   isSquare() {
-    return s(this, ke).length === s(this, ke)[0].dimension;
+    return s(this, $e).length === s(this, $e)[0].dimension;
   }
   determinant() {
     if (!this.isSquare())
       throw new Error("Matrix is not square");
-    return hs(...this.values);
+    return gs(...this.values);
   }
 }
-ke = new WeakMap();
-var Me, Ue;
-const mi = class mi {
+$e = new WeakMap();
+var Be, Xe;
+const Ei = class Ei {
   constructor(e) {
-    m(this, Me, new E(0, 0, 1));
-    m(this, Ue, new S(0, 0, 0));
+    m(this, Be, new E(0, 0, 1));
+    m(this, Xe, new S(0, 0, 0));
     return e && this.parse(e), this;
   }
   get normal() {
-    return s(this, Me);
+    return s(this, Be);
   }
   set normal(e) {
-    h(this, Me, e), s(this, Me).asPoint = !1;
+    h(this, Be, e), s(this, Be).asPoint = !1;
   }
   get point() {
-    return s(this, Ue);
+    return s(this, Xe);
   }
   set point(e) {
-    h(this, Ue, e), s(this, Ue).asPoint = !0;
+    h(this, Xe, e), s(this, Xe).asPoint = !0;
   }
   get a() {
-    return s(this, Me).x;
+    return s(this, Be).x;
   }
   get b() {
-    return s(this, Me).y;
+    return s(this, Be).y;
   }
   get c() {
-    return s(this, Me).z;
+    return s(this, Be).z;
   }
   get d() {
-    return s(this, Me).dot(s(this, Ue)).opposite();
+    return s(this, Be).dot(s(this, Xe)).opposite();
   }
   get tex() {
-    return new H(
-      new O("xyz", this.a, this.b, this.c, this.d),
-      new O(0)
+    return new V(
+      new N("xyz", this.a, this.b, this.c, this.d),
+      new N(0)
     ).reduce().tex;
   }
+  get display() {
+    return new V(
+      new N("xyz", this.a, this.b, this.c, this.d),
+      new N(0)
+    ).reduce().display;
+  }
   parse(e) {
     var t, i, n;
     if (e.point && e.normal) {
@@ -3854,23 +3860,23 @@ const mi = class mi {
       return;
     }
     if (e.equation) {
-      const r = e.equation.moveLeft().reduce().left, l = r.monomByLetter("x").coefficient, c = r.monomByLetter("y").coefficient, u = r.monomByLetter("z").coefficient, d = r.monomByDegree(0).coefficient;
-      this.normal = new E(l, c, u), l.isNotZero() ? this.point = new S(d.clone().divide(l).opposite(), 0, 0) : c.isNotZero() ? this.point = new S(0, d.clone().divide(c).opposite(), 0) : this.point = new S(0, 0, d.clone().divide(u).opposite());
+      const r = e.equation.moveLeft().reduce().left, l = r.monomByLetter("x").coefficient, c = r.monomByLetter("y").coefficient, f = r.monomByLetter("z").coefficient, d = r.monomByDegree(0).coefficient;
+      this.normal = new E(l, c, f), l.isNotZero() ? this.point = new S(d.clone().divide(l).opposite(), 0, 0) : c.isNotZero() ? this.point = new S(0, d.clone().divide(c).opposite(), 0) : this.point = new S(0, 0, d.clone().divide(f).opposite());
       return;
     }
     if (((i = e.points) == null ? void 0 : i.length) === 3 && e.points.every((r) => r instanceof E)) {
-      const r = e.points[0], l = e.points[1], c = e.points[2], u = new E(r, l), d = new E(r, c);
-      this.normal = u.cross(d), this.point = r;
+      const r = e.points[0], l = e.points[1], c = e.points[2], f = new E(r, l), d = new E(r, c);
+      this.normal = f.cross(d), this.point = r;
       return;
     }
     if (((n = e.coefficients) == null ? void 0 : n.length) === 4) {
-      const [r, l, c, u] = e.coefficients;
-      this.normal = new E(r, l, c), this.point = new S(0, 0, -u);
+      const [r, l, c, f] = e.coefficients;
+      this.normal = new E(r, l, c), this.point = new S(0, 0, -f);
       return;
     }
   }
   angle(e, t, i) {
-    if (e instanceof mi)
+    if (e instanceof Ei)
       return this.normal.angle(e.normal, t, i);
     let n;
     if (e instanceof E) {
@@ -3895,25 +3901,25 @@ const mi = class mi {
     return this.normal.dot(e).add(this.d).isZero();
   }
 };
-Me = new WeakMap(), Ue = new WeakMap();
-let ai = mi;
-var Y, _, ee, st, Ce, yt, Xt, wt, Se, Yt, nt;
-const Qt = class Qt {
+Be = new WeakMap(), Xe = new WeakMap();
+let pi = Ei;
+var Q, _, ee, ot, Pe, xt, ei, Et, Re, ti, ht;
+const ii = class ii {
   constructor(...e) {
-    m(this, Y, new S());
+    m(this, Q, new S());
     m(this, _, new S());
     m(this, ee, new S());
-    m(this, st, {
-      AB: new R(),
-      AC: new R(),
-      BC: new R()
+    m(this, ot, {
+      AB: new z(),
+      AC: new z(),
+      BC: new z()
     });
-    m(this, Ce, {
+    m(this, Pe, {
       AB: new S(),
       AC: new S(),
       BC: new S()
     });
-    m(this, yt, null);
+    m(this, xt, null);
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
@@ -3925,7 +3931,7 @@ const Qt = class Qt {
      */
     a(this, "parse", (...e) => {
       if (e.length === 6) {
-        const t = e.map((i) => new f(i));
+        const t = e.map((i) => new u(i));
         if (t.some((i) => i.isNaN()))
           throw new Error("One of the values is not a valid number");
         return this.parse(
@@ -3936,11 +3942,11 @@ const Qt = class Qt {
       } else if (e.length === 3) {
         if (e.every((t) => typeof t == "string"))
           return this.parse(
-            ...e.map((t) => new R(t))
+            ...e.map((t) => new z(t))
           );
-        if (e.every((t) => t instanceof R)) {
+        if (e.every((t) => t instanceof z)) {
           const t = e[0].clone(), i = e[1].clone(), n = e[2].clone();
-          h(this, st, { AB: t, BC: i, AC: n });
+          h(this, ot, { AB: t, BC: i, AC: n });
           let r = t.intersection(i);
           if (r.hasIntersection)
             h(this, _, r.point.clone());
@@ -3951,23 +3957,23 @@ const Qt = class Qt {
           else
             throw new Error("Lines do not intersect !");
           if (r = n.intersection(t), r.hasIntersection)
-            h(this, Y, r.point.clone());
+            h(this, Q, r.point.clone());
           else
             throw new Error("Lines do not intersect !");
-        } else e.every((t) => t instanceof S) && (h(this, Y, e[0].clone()), h(this, _, e[1].clone()), h(this, ee, e[2].clone()), h(this, st, {
-          AB: new R(s(this, Y), s(this, _)),
-          BC: new R(s(this, _), s(this, ee)),
-          AC: new R(s(this, Y), s(this, ee))
+        } else e.every((t) => t instanceof S) && (h(this, Q, e[0].clone()), h(this, _, e[1].clone()), h(this, ee, e[2].clone()), h(this, ot, {
+          AB: new z(s(this, Q), s(this, _)),
+          BC: new z(s(this, _), s(this, ee)),
+          AC: new z(s(this, Q), s(this, ee))
         }));
-      } else if (e.length === 1 && e[0] instanceof Qt)
+      } else if (e.length === 1 && e[0] instanceof ii)
         return e[0].clone();
-      return s(this, Xt).call(this), this;
+      return s(this, ei).call(this), this;
     });
     /**
      * Clone the Triangle class
      */
-    a(this, "clone", () => new Qt(
-      s(this, Y).clone(),
+    a(this, "clone", () => new ii(
+      s(this, Q).clone(),
       s(this, _).clone(),
       s(this, ee).clone()
     ));
@@ -3977,59 +3983,59 @@ const Qt = class Qt {
     /**
      * Generate the Line object for the three segments of the triangle
      */
-    m(this, Xt, () => {
-      s(this, Y).asPoint = !0, s(this, _).asPoint = !0, s(this, ee).asPoint = !0, h(this, Ce, {
-        AB: new S().middleOf(s(this, Y), s(this, _)),
-        AC: new S().middleOf(s(this, Y), s(this, ee)),
+    m(this, ei, () => {
+      s(this, Q).asPoint = !0, s(this, _).asPoint = !0, s(this, ee).asPoint = !0, h(this, Pe, {
+        AB: new S().middleOf(s(this, Q), s(this, _)),
+        AC: new S().middleOf(s(this, Q), s(this, ee)),
         BC: new S().middleOf(s(this, _), s(this, ee))
-      }), h(this, yt, s(this, Yt).call(this));
+      }), h(this, xt, s(this, ti).call(this));
     });
     /**
      * Get the Vector2D class for the given name
      * @param ptName
      */
-    m(this, wt, (e) => {
+    m(this, Et, (e) => {
       switch (e.toUpperCase()) {
         case "A":
-          return s(this, Y);
+          return s(this, Q);
         case "B":
           return s(this, _);
         case "C":
           return s(this, ee);
       }
-      return s(this, Y);
+      return s(this, Q);
     });
     /**
      * Get the vector for the segment given by name.
      * @param ptName1
      * @param ptName2
      */
-    m(this, Se, (e, t) => new E(
-      s(this, wt).call(this, e),
-      s(this, wt).call(this, t)
+    m(this, Re, (e, t) => new E(
+      s(this, Et).call(this, e),
+      s(this, Et).call(this, t)
     ));
-    m(this, Yt, () => {
+    m(this, ti, () => {
       const e = {
-        A: new R().fromPoints(s(this, Y), s(this, Ce).BC),
-        B: new R().fromPoints(s(this, _), s(this, Ce).AC),
-        C: new R().fromPoints(s(this, ee), s(this, Ce).AB),
+        A: new z().fromPoints(s(this, Q), s(this, Pe).BC),
+        B: new z().fromPoints(s(this, _), s(this, Pe).AC),
+        C: new z().fromPoints(s(this, ee), s(this, Pe).AB),
         intersection: null
       }, t = {
-        AB: new R().fromPointAndNormal(s(this, Ce).AB, new E(s(this, Y), s(this, _)).normal()),
-        AC: new R().fromPointAndNormal(s(this, Ce).AC, new E(s(this, Y), s(this, ee)).normal()),
-        BC: new R().fromPointAndNormal(s(this, Ce).BC, new E(s(this, _), s(this, ee)).normal()),
+        AB: new z().fromPointAndNormal(s(this, Pe).AB, new E(s(this, Q), s(this, _)).normal()),
+        AC: new z().fromPointAndNormal(s(this, Pe).AC, new E(s(this, Q), s(this, ee)).normal()),
+        BC: new z().fromPointAndNormal(s(this, Pe).BC, new E(s(this, _), s(this, ee)).normal()),
         intersection: null
       }, i = {
-        A: new R().fromPointAndNormal(s(this, Y), new E(s(this, _), s(this, ee)).normal()),
-        B: new R().fromPointAndNormal(s(this, _), new E(s(this, Y), s(this, ee)).normal()),
-        C: new R().fromPointAndNormal(s(this, ee), new E(s(this, Y), s(this, _)).normal()),
+        A: new z().fromPointAndNormal(s(this, Q), new E(s(this, _), s(this, ee)).normal()),
+        B: new z().fromPointAndNormal(s(this, _), new E(s(this, Q), s(this, ee)).normal()),
+        C: new z().fromPointAndNormal(s(this, ee), new E(s(this, Q), s(this, _)).normal()),
         intersection: null
-      }, n = s(this, nt).call(this, "A"), r = s(this, nt).call(this, "B"), l = s(this, nt).call(this, "C"), c = {
+      }, n = s(this, ht).call(this, "A"), r = s(this, ht).call(this, "B"), l = s(this, ht).call(this, "C"), c = {
         A: n.internal,
         B: r.internal,
         C: r.internal,
         intersection: null
-      }, u = {
+      }, f = {
         A: n.external,
         B: r.external,
         C: l.external,
@@ -4039,16 +4045,16 @@ const Qt = class Qt {
         mediators: t,
         heights: i,
         bisectors: c,
-        externalBisectors: u
+        externalBisectors: f
       };
       return d.medians.intersection = d.medians.A.intersection(d.medians.B).point, d.mediators.intersection = d.mediators.AB.intersection(d.mediators.BC).point, d.heights.intersection = d.heights.A.intersection(d.heights.B).point, d.bisectors.intersection = d.bisectors.A.intersection(d.bisectors.B).point, d;
     });
-    m(this, nt, (e) => {
+    m(this, ht, (e) => {
       const t = this.lines;
       let i, n;
       if (e === "A" ? (i = t.AB, n = t.AC) : e === "B" ? (i = t.AB, n = t.BC) : e === "C" && (i = t.BC, n = t.AC), i === void 0 || n === void 0)
         throw new Error(`The point ${e} does not exist`);
-      const r = i.n.simplify().norm, l = n.n.simplify().norm, c = i.getEquation().multiply(l), u = n.getEquation().multiply(r), d = new R(c.clone().subtract(u).simplify()), p = new R(u.clone().subtract(c).simplify());
+      const r = i.n.simplify().norm, l = n.n.simplify().norm, c = i.getEquation().multiply(l), f = n.getEquation().multiply(r), d = new z(c.clone().subtract(f).simplify()), p = new z(f.clone().subtract(c).simplify());
       return e === "A" ? d.hitSegment(this.B, this.C) ? { internal: d, external: p } : { internal: p, external: d } : e === "B" ? d.hitSegment(this.A, this.C) ? { internal: d, external: p } : { internal: p, external: d } : e === "C" ? d.hitSegment(this.B, this.A) ? { internal: d, external: p } : { internal: p, external: d } : { internal: d, external: p };
     });
     return e.length > 0 && this.parse(...e), this;
@@ -4057,7 +4063,7 @@ const Qt = class Qt {
   // Getter and setters
   // ------------------------------------------
   get A() {
-    return s(this, Y);
+    return s(this, Q);
   }
   get B() {
     return s(this, _);
@@ -4066,22 +4072,22 @@ const Qt = class Qt {
     return s(this, ee);
   }
   get AB() {
-    return s(this, Se).call(this, "A", "B");
+    return s(this, Re).call(this, "A", "B");
   }
   get BA() {
-    return s(this, Se).call(this, "B", "A");
+    return s(this, Re).call(this, "B", "A");
   }
   get BC() {
-    return s(this, Se).call(this, "B", "C");
+    return s(this, Re).call(this, "B", "C");
   }
   get CB() {
-    return s(this, Se).call(this, "C", "B");
+    return s(this, Re).call(this, "C", "B");
   }
   get AC() {
-    return s(this, Se).call(this, "A", "C");
+    return s(this, Re).call(this, "A", "C");
   }
   get CA() {
-    return s(this, Se).call(this, "C", "A");
+    return s(this, Re).call(this, "C", "A");
   }
   get isRectangle() {
     return !!(this.AB.isNormalTo(this.BC) || this.AB.isNormalTo(this.AC) || this.BC.isNormalTo(this.AC));
@@ -4093,15 +4099,119 @@ const Qt = class Qt {
     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 s(this, st);
+    return s(this, ot);
   }
   get remarquables() {
-    return s(this, yt);
+    return s(this, xt);
   }
 };
-Y = new WeakMap(), _ = new WeakMap(), ee = new WeakMap(), st = new WeakMap(), Ce = new WeakMap(), yt = new WeakMap(), Xt = new WeakMap(), wt = new WeakMap(), Se = new WeakMap(), Yt = new WeakMap(), nt = new WeakMap();
-let li = Qt;
-function qt(o) {
+Q = new WeakMap(), _ = new WeakMap(), ee = new WeakMap(), ot = new WeakMap(), Pe = new WeakMap(), xt = new WeakMap(), ei = new WeakMap(), Et = new WeakMap(), Re = new WeakMap(), ti = new WeakMap(), ht = new WeakMap();
+let mi = ii;
+var ji = /* @__PURE__ */ ((o) => (o[o.INTERIOR = 0] = "INTERIOR", o[o.EXTERIOR = 1] = "EXTERIOR", o[o.SECANT = 2] = "SECANT", o[o.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", o[o.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", o[o.SUPERPOSED = 5] = "SUPERPOSED", o[o.CONCENTRIC = 6] = "CONCENTRIC", o))(ji || {}), Te, de, Oe, at, Nt, qt, gi;
+class Ui {
+  constructor(e, t) {
+    m(this, qt);
+    m(this, Te);
+    m(this, de);
+    m(this, Oe);
+    m(this, at, 1);
+    m(this, Nt, (e) => {
+      if (s(this, Oe) === void 0)
+        throw new Error("Sphere3 is undefined");
+      if (s(this, at) === 0)
+        return e ? s(this, Oe).tex : s(this, Oe).display;
+      const t = [];
+      return ["x", "y", "z"].forEach((n) => {
+        if (this.center[n].isZero())
+          t.push(`${n}^2`);
+        else {
+          const r = new N(n).subtract(this.center[n]);
+          t.push(
+            e ? `\\(${r.tex}\\)^2` : `(${r.display})^2`
+          );
+        }
+      }), t.join("+") + "=" + (e ? this.squareRadius.tex : this.squareRadius.display);
+    });
+    a(this, "relativePosition", (e) => {
+      const t = this.center.distanceTo(e.center).value, i = this.radius.value, n = e.radius.value;
+      return t > i + n ? 1 : t === i + n ? 4 : t === Math.abs(i - n) ? 3 : t < Math.abs(i - n) ? 0 : t === 0 ? i === n ? 5 : 6 : 2;
+    });
+    a(this, "isPointOnSphere", (e) => {
+      var t;
+      return ((t = s(this, Oe)) == null ? void 0 : t.test({
+        x: e.x,
+        y: e.y,
+        z: e.z
+      })) ?? !1;
+    });
+    return e && t && (h(this, Te, e), h(this, de, new u(t).clone().pow(2)), A(this, qt, gi).call(this)), this;
+  }
+  fromEquation(e) {
+    const t = new V(e).moveLeft().reduce(), i = ["x", "y", "z"];
+    if (i.some((r) => t.degree(r).value !== 2))
+      return this.makeUndefined();
+    const n = t.left.monomByDegree(2, "x").coefficient;
+    return i.some((r) => t.left.monomByDegree(2, r).coefficient.isNotEqual(n)) ? this.makeUndefined() : (h(this, Te, new S(
+      t.left.monomByDegree(1, "x").coefficient.clone().opposite().divide(2),
+      t.left.monomByDegree(1, "y").coefficient.clone().opposite().divide(2),
+      t.left.monomByDegree(1, "z").coefficient.clone().opposite().divide(2)
+    )), h(this, de, t.left.monomByDegree(0).coefficient.clone().opposite().add(s(this, Te).x.clone().pow(2)).add(s(this, Te).y.clone().pow(2)).add(s(this, Te).z.clone().pow(2))), A(this, qt, gi).call(this), this);
+  }
+  get center() {
+    if (s(this, Te) === void 0)
+      throw new Error("Sphere3 is undefined");
+    return s(this, Te);
+  }
+  get squareRadius() {
+    if (s(this, de) === void 0)
+      throw new Error("Sphere3 is undefined");
+    return s(this, de);
+  }
+  get radius() {
+    if (s(this, de) === void 0)
+      throw new Error("Sphere3 is undefined");
+    return s(this, de).isSquare() ? {
+      tex: s(this, de).clone().sqrt().tex,
+      display: s(this, de).clone().sqrt().display,
+      value: s(this, de).clone().sqrt().value
+    } : {
+      tex: `\\sqrt{${s(this, de).tex}}`,
+      display: `sqrt(${s(this, de).display})`,
+      value: s(this, de).clone().sqrt().value
+    };
+  }
+  get equation() {
+    if (s(this, Oe) === void 0)
+      throw new Error("Sphere3 is undefined");
+    return s(this, Oe);
+  }
+  makeUndefined() {
+    return h(this, Te, void 0), h(this, de, void 0), h(this, Oe, void 0), this;
+  }
+  get centerRadius() {
+    return h(this, at, 1), this;
+  }
+  get developped() {
+    return h(this, at, 0), this;
+  }
+  get tex() {
+    return s(this, Nt).call(this, !0);
+  }
+  get display() {
+    return s(this, Nt).call(this, !1);
+  }
+}
+Te = new WeakMap(), de = new WeakMap(), Oe = new WeakMap(), at = new WeakMap(), Nt = new WeakMap(), qt = new WeakSet(), gi = function() {
+  h(this, Oe, new V(
+    new N("x").subtract(this.center.x).pow(2).add(
+      new N("y").subtract(this.center.y).pow(2)
+    ).add(
+      new N("z").subtract(this.center.z).pow(2)
+    ),
+    new N(this.squareRadius)
+  ).reduce());
+}, a(Ui, "RELATIVE_POSITION", ji);
+function Pt(o) {
   const e = Object.assign(
     {
       negative: !0,
@@ -4111,17 +4221,17 @@ function qt(o) {
       natural: !1
     },
     o
-  ), t = new f();
-  if (e.negative ? t.numerator = Q(e.max, e.zero) : t.numerator = pe(e.zero ? 0 : 1, e.max), e.natural)
+  ), t = new u();
+  if (e.negative ? t.numerator = H(e.max, e.zero) : t.numerator = me(e.zero ? 0 : 1, e.max), e.natural)
     t.denominator = 1;
   else {
     let i = 0;
     for (; t.isRelative() && i < 10; )
-      t.denominator = pe(1, e.max), i++;
+      t.denominator = me(1, e.max), i++;
   }
   return e.reduced ? t.reduce() : t;
 }
-function Ri(o) {
+function Gi(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -4130,8 +4240,8 @@ function Ri(o) {
       zero: !1
     },
     o
-  ), t = new M();
-  if (t.coefficient = qt({
+  ), t = new k();
+  if (t.coefficient = Pt({
     zero: e.zero,
     reduced: !0,
     natural: !e.fraction
@@ -4139,14 +4249,14 @@ function Ri(o) {
     for (const i of e.letters.split(""))
       t.setLetter(i, 0);
     for (let i = 0; i < e.degree; i++) {
-      const n = di(e.letters.split(""));
+      const n = bi(e.letters.split(""));
       t.setLetter(n, t.degree(n).clone().add(1));
     }
   } else
     t.setLetter(e.letters, e.degree);
   return t;
 }
-const us = {
+const bs = {
   letters: "x",
   degree: 2,
   fraction: !1,
@@ -4157,14 +4267,14 @@ const us = {
   numberOfMonoms: 0,
   positive: !0
 };
-function zi(o) {
+function Wi(o) {
   const e = Object.assign(
-    us,
+    bs,
     o
-  ), t = new O().empty();
+  ), t = new N().empty();
   let i;
   for (let n = e.degree; n >= 0; n--)
-    i = Ri({
+    i = Gi({
       letters: e.letters,
       degree: n,
       fraction: e.fraction,
@@ -4172,12 +4282,12 @@ function zi(o) {
     }), e.unit && e.degree === n && i.coefficient.one(), t.add(i);
   if (e.positive && t.monomByDegree().coefficient.isNegative() && t.monomByDegree().coefficient.opposite(), e.numberOfMonoms && e.numberOfMonoms > 0 && e.numberOfMonoms < t.length)
     for (; t.length > e.numberOfMonoms; ) {
-      const n = pe(1, t.length - 1);
+      const n = me(1, t.length - 1);
       t.monoms.splice(n, 1);
     }
   return t.reduce();
 }
-function fs(o) {
+function xs(o) {
   const e = Object.assign(
     {
       letters: "x",
@@ -4197,9 +4307,9 @@ function fs(o) {
       }
     },
     o
-  ), t = new O().one();
+  ), t = new N().one();
   for (let i = 0; i < e.degree; i++) {
-    const n = zi({
+    const n = Wi({
       degree: 1,
       unit: e.unit,
       fraction: e.fraction,
@@ -4208,9 +4318,9 @@ function fs(o) {
     });
     t.multiply(n);
   }
-  return new H(t, 0);
+  return new V(t, 0);
 }
-function ci(o) {
+function yi(o) {
   const e = Object.assign(
     {
       axis: !0,
@@ -4219,10 +4329,10 @@ function ci(o) {
       quadrant: null
     },
     o
-  ), t = e.axis === "x", i = e.axis === "y", n = e.fraction ? qt({ max: e.max, zero: t }) : new f(Q(e.max, t)), r = e.fraction ? qt({ max: e.max, zero: i }) : new f(Q(e.max, i));
+  ), t = e.axis === "x", i = e.axis === "y", n = e.fraction ? Pt({ max: e.max, zero: t }) : new u(H(e.max, t)), r = e.fraction ? Pt({ max: e.max, zero: i }) : new u(H(e.max, i));
   return Number(e.quadrant) === 1 && (n.abs(), r.abs()), Number(e.quadrant) === 2 && (n.isPositive() && n.opposite(), r.isNegative() && r.opposite()), Number(e.quadrant) === 3 && (n.isPositive() && n.opposite(), r.isPositive() && r.opposite()), Number(e.quadrant) === 4 && (n.isNegative() && n.opposite(), r.isPositive() && r.opposite()), new S(n, r);
 }
-function ds(o) {
+function Es(o) {
   const e = Object.assign(
     {
       center: {
@@ -4232,116 +4342,119 @@ function ds(o) {
       pointsOnCircle: 8
     },
     o
-  ), t = ci(e.center);
+  ), t = yi(e.center);
   let i, n;
-  return e.pointsOnCircle === 8 ? (i = pe(1, 3), n = i ** 2 + (i + 1) ** 2) : n = pe(1, 20), new Tt(t, n, !0);
+  return e.pointsOnCircle === 8 ? (i = me(1, 3), n = i ** 2 + (i + 1) ** 2) : n = me(1, 20), new $t(t, n, !0);
 }
-function ps(o) {
+function Ns(o) {
   const e = Object.assign(
     {
       A: {
-        x: Q(10),
-        y: Q(10)
+        x: H(10),
+        y: H(10)
       }
     },
     o
   ), t = new E(
-    Q(10),
-    Q(10)
+    H(10),
+    H(10)
   );
   for (; t.isNull; )
-    t.x = Q(10), t.y = Q(10);
-  return e.slope === 1 ? t.x.sign() !== t.y.sign() && t.y.opposite() : e.slope === -1 && t.x.sign() !== t.y.sign() && t.y.opposite(), new R().fromPointAndDirection(new E(e.A.x, e.A.y), t);
+    t.x = H(10), t.y = H(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 z().fromPointAndDirection(new E(e.A.x, e.A.y), t);
 }
-function ms(o) {
+function qs(o) {
   const e = Object.assign(
     {
       A: {
-        x: Q(10),
-        y: Q(10),
-        z: Q(10)
+        x: H(10),
+        y: H(10),
+        z: H(10)
       },
       direction: {
-        x: Q(10),
-        y: Q(10),
-        z: Q(10)
+        x: H(10),
+        y: H(10),
+        z: H(10)
       }
     },
     o
   ), t = new S(e.A.x, e.A.y, e.A.z), i = new E(e.direction.x, e.direction.y, e.direction.z);
-  return new Ot(t, i);
+  return new Bt(t, i);
 }
-const gs = {
-  equation: (o) => fs(o),
-  polynom: (o) => zi(o),
-  monom: (o) => Ri(o),
-  fraction: (o) => qt(o),
-  number: (o, e, t) => pe(o, e, t),
-  numberSym: (o, e) => Q(o, e),
-  prime: (o) => as(o),
-  bool: (o) => Ci(o),
-  array: (o, e) => ls(o, e),
-  item: (o) => di(o),
-  shuffle: (o) => Pi(o),
-  line: (o) => ps(o),
-  line3: (o) => ms(o),
-  vector: (o) => ci(o),
+const As = {
+  equation: (o) => xs(o),
+  polynom: (o) => Wi(o),
+  monom: (o) => Gi(o),
+  fraction: (o) => Pt(o),
+  number: (o, e, t) => me(o, e, t),
+  numberSym: (o, e) => H(o, e),
+  prime: (o) => ys(o),
+  bool: (o) => Ri(o),
+  array: (o, e) => ws(o, e),
+  item: (o) => bi(o),
+  shuffle: (o) => Di(o),
+  line: (o) => Ns(o),
+  line3: (o) => qs(o),
+  vector: (o) => yi(o),
   point: (o) => {
-    const e = ci(o);
+    const e = yi(o);
     return e.asPoint = !0, e;
   },
-  circle: (o) => ds(o)
-}, ws = {
-  Numeric: U,
-  Fraction: f,
-  Root: vt,
-  Monom: M,
-  Polynom: O,
-  Equation: H,
-  Matrix: cs,
-  LinearSystem: ti,
+  circle: (o) => Es(o)
+}, Os = {
+  Numeric: G,
+  Fraction: u,
+  Root: At,
+  Monom: k,
+  Polynom: N,
+  Equation: V,
+  Matrix: vs,
+  LinearSystem: hi,
   Factor: se,
-  PolyFactor: si,
-  LogicalSet: ss,
-  Random: gs,
+  PolyFactor: li,
+  LogicalSet: fs,
+  Random: As,
   Geometry: {
     Vector: E,
     Point: S,
-    Line: R,
-    Triangle: li,
-    Circle: Tt,
-    Line3: Ot,
-    Plane3: ai
+    Line: z,
+    Triangle: mi,
+    Circle: $t,
+    Line3: Bt,
+    Plane3: pi,
+    Sphere3: Ui
   },
-  NumExp: is
+  NumExp: us
 };
 export {
-  Tt as Circle,
-  H as Equation,
-  At as EquationSolver,
-  lt as FACTOR_DISPLAY,
+  $t as Circle,
+  V as Equation,
+  Mt as EquationSolver,
+  dt as FACTOR_DISPLAY,
   se as Factor,
-  f as Fraction,
-  R as Line,
-  Ot as Line3,
-  ti as LinearSystem,
-  ss as LogicalSet,
-  cs as Matrix,
-  M as Monom,
-  vt as NthRoot,
-  is as NumExp,
-  U as Numeric,
-  ai as Plane3,
+  u as Fraction,
+  z as Line,
+  Bt as Line3,
+  hi as LinearSystem,
+  fs as LogicalSet,
+  vs as Matrix,
+  k as Monom,
+  At as NthRoot,
+  us as NumExp,
+  G as Numeric,
+  pi as Plane3,
   S as Point,
-  si as PolyFactor,
-  O as Polynom,
-  gs as Random,
-  li as Triangle,
+  li as PolyFactor,
+  N as Polynom,
+  As as Random,
+  ji as SPHERE3_RELATIVE_POSITION,
+  Ui as Sphere3,
+  mi as Triangle,
   E as Vector,
-  rs as areVectorsColinears,
-  ns as areVectorsEquals,
-  ws as default,
-  hs as determinant,
-  os as dotProduct
+  ps as areVectorsColinears,
+  ds as areVectorsEquals,
+  Os as default,
+  gs as determinant,
+  ms as dotProduct
 };
 //# sourceMappingURL=pimath.js.map