pimath 0.2.5 → 0.2.7

package/dist/pimath.js

@@ -1,15 +1,15 @@
-function ut(n) {
-  const t = st(n), e = [];
+function ft(n) {
+  const t = rt(n), e = [];
   let i, s;
   for (; t.length > 0; )
     i = t.shift() ?? 1, s = (t.length > 0 ? t.pop() : +i) ?? 1, e.push([i, s]);
   return e;
 }
-function ft(...n) {
-  const t = J(...n);
+function dt(...n) {
+  const t = _(...n);
   return n.map((e) => e / t);
 }
-function st(n) {
+function rt(n) {
   const t = Math.abs(n), e = Math.sqrt(t), i = [];
   for (let s = 1; s <= e; s++)
     n % s === 0 && (i.push(s), i.push(t / s));
@@ -17,7 +17,7 @@ function st(n) {
     return s - r;
   }), [...new Set(i)];
 }
-function J(...n) {
+function _(...n) {
   const t = function(s, r) {
     return isNaN(s) || isNaN(r) ? NaN : r === 0 ? s : s === 0 ? r : t(r, s % r);
   };
@@ -32,34 +32,34 @@ function J(...n) {
     ;
   return Math.abs(e);
 }
-function dt(...n) {
+function pt(...n) {
   return n.reduce(function(t, e) {
-    return Math.abs(t * e / J(t, e));
+    return Math.abs(t * e / _(t, e));
   });
 }
-function pt(n, t = 3) {
+function mt(n, t = 3) {
   return +n.toFixed(t);
 }
-function mt(n) {
+function gt(n) {
   if (Number.isSafeInteger(n) || n.toString().split(".")[0].length < 10)
     return 0;
   throw new Error("Periodic value: Not implemented yet");
 }
-function gt(n) {
+function wt(n) {
   const t = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973];
   return n === void 0 ? t : t.slice(0, Math.min(t.length, n));
 }
-function wt(n, t) {
+function yt(n, t) {
   const e = [], i = t === !0 ? +n : n ** 2;
   for (let s = 0; s <= n; s++)
     for (let r = 0; r <= n; r++)
       s ** 2 + r ** 2 === i && e.push([s, r, n]);
   return e;
 }
-function yt(n, t = 2) {
+function vt(n, t = 2) {
   return +`${Math.round(+`${n}e${t}`)}e-${t}`;
 }
-function vt(n, t) {
+function xt(n, t) {
   let e = Math.floor(Math.pow(n, 1 / t));
   const i = n, s = 1;
   for (; e > 1; ) {
@@ -70,20 +70,20 @@ function vt(n, t) {
   }
   return s;
 }
-const x = {
-  decompose: ut,
-  dividers: st,
-  divideNumbersByGCD: ft,
-  gcd: J,
-  lcm: dt,
-  numberCorrection: pt,
-  periodic: mt,
-  primes: gt,
-  pythagoreanTripletsWithTarget: wt,
-  round: yt,
-  greatestPower: vt
+const b = {
+  decompose: ft,
+  dividers: rt,
+  divideNumbersByGCD: dt,
+  gcd: _,
+  lcm: pt,
+  numberCorrection: mt,
+  periodic: gt,
+  primes: wt,
+  pythagoreanTripletsWithTarget: yt,
+  round: vt,
+  greatestPower: xt
 };
-var xt = /* @__PURE__ */ ((n) => (n.frac = "frac", n.dfrac = "dfrac", n.tfrac = "tfrac", n))(xt || {});
+var bt = /* @__PURE__ */ ((n) => (n.frac = "frac", n.dfrac = "dfrac", n.tfrac = "tfrac", n))(bt || {});
 class h {
   #t = 1;
   #e = 3;
@@ -156,7 +156,7 @@ class h {
     return e && s.reverse(), s;
   };
   static toSameDenominateur(...t) {
-    const e = t.map((s) => new h(s)), i = x.lcm(...e.map((s) => s.denominator));
+    const e = t.map((s) => new h(s)), i = b.lcm(...e.map((s) => s.denominator));
     return e.forEach((s) => s.amplify(i / s.denominator)), e;
   }
   static unique = (t) => {
@@ -244,7 +244,7 @@ class h {
     if (Number.isSafeInteger(t))
       return this.#s = t, this.#t = 1, this.#i = !0, this;
     const [, e] = t.toString().split("."), i = e ? e.length : 0, s = Math.pow(10, i);
-    return this.#s = t * s, this.#t = s, this.#s = x.numberCorrection(this.#s), this.#t = x.numberCorrection(this.#t), this.reduce(), this.#i = i < 10, this;
+    return this.#s = t * s, this.#t = s, this.#s = b.numberCorrection(this.#s), this.#t = b.numberCorrection(this.#t), this.reduce(), this.#i = i < 10, this;
   }
   fromNumbers(t, e) {
     return Number.isSafeInteger(t) && Number.isSafeInteger(e) ? (this.#s = t, this.#t = e, this.#i = !0, this) : this.fromNumber(t / e);
@@ -285,7 +285,7 @@ class h {
   isOne = () => this.#s === 1 && this.#t === 1;
   isPositive = () => this.sign() === 1;
   isRational = () => this.exact && !this.isRelative();
-  isReduced = () => Math.abs(x.gcd(this.#s, this.#t)) === 1;
+  isReduced = () => Math.abs(b.gcd(this.#s, this.#t)) === 1;
   isRelative = () => this.exact && this.clone().reduce().denominator === 1;
   isSquare = () => Math.sqrt(this.#s) % 1 === 0 && Math.sqrt(this.#t) % 1 === 0;
   isStrictlyNegative = () => this.value < 0;
@@ -316,7 +316,7 @@ class h {
     return r === i && o === s ? (this.#s = r, this.#t = o) : (this.#s = i / s, this.#t = 1, this.exact = !1), this;
   };
   reduce = () => {
-    const t = x.gcd(this.#s, this.#t);
+    const t = b.gcd(this.#s, this.#t);
     return this.#s = this.#s / t, this.#t = this.#t / t, this.#t < 0 && (this.#t = -this.#t, this.#s = -this.#s), this;
   };
   root = (t) => {
@@ -349,15 +349,30 @@ class h {
   }
   zero = () => this.fromNumber(0);
 }
-function it(n, t = !0) {
+function st(n, t = !0) {
   return t ? `\\left( ${n} \\right)` : `(${n})`;
 }
-function Q(n) {
-  return n.startsWith("(") && (n = n.substring(1)), n.endsWith(")") && (n = n.substring(0, n.length - 1)), n;
+function j(n) {
+  if (!n.startsWith("(") || !n.endsWith(")")) return n;
+  let t = 0;
+  for (let e = 0; e < n.length - 1; e++)
+    if (n[e] === "(" ? t++ : n[e] === ")" && t--, t === 0) return n;
+  return n.slice(1, -1);
 }
-function j(n, t, e, i, s) {
+function F(n, t, e, i, s) {
   return n.map((r, o) => r === t ? e : r);
 }
+function H(n, t) {
+  if (t.length !== 1)
+    throw new Error(`splitChar must be a single character, got: "${t}"`);
+  let e = 0, i = 0;
+  const s = [];
+  for (let r = 0; r < n.length; r++) {
+    const o = n[r];
+    o === "(" ? e++ : o === ")" ? e-- : o === t && e === 0 && (s.push(n.substring(i, r)), i = r + 1);
+  }
+  return s.push(n.substring(i)), s;
+}
 class T {
   #t;
   #e;
@@ -464,7 +479,7 @@ class T {
   }
   pow(t) {
     this.factor.pow(t);
-    const e = x.gcd(this.index, t);
+    const e = b.gcd(this.index, t);
     return this.index = this.index / e, this.radical.pow(t / e), this;
   }
   get radical() {
@@ -478,7 +493,7 @@ class T {
       const e = this.radical.denominator;
       this.radical.denominator = 1, this.radical.numerator *= e, this.factor.divide(e);
     }
-    const t = x.greatestPower(this.radical.value, this.index);
+    const t = b.greatestPower(this.radical.value, this.index);
     return this.factor.multiply(Math.pow(t, 1 / this.index)), this.radical.divide(t), this;
   }
   root(t) {
@@ -492,7 +507,7 @@ class T {
     return this.add(e.opposite());
   }
   get value() {
-    return x.numberCorrection(this.factor.value * Math.pow(this.radical.value, 1 / this.index));
+    return b.numberCorrection(this.factor.value * Math.pow(this.radical.value, 1 / this.index));
   }
   get withSign() {
     return this.#s = !0, this;
@@ -518,12 +533,14 @@ class T {
     return s.length === 0 ? null : s.join(" ");
   }
   #o(t) {
-    const [e, i] = t.split("root"), [s, r] = i.split(")");
-    return this.index = +Q(s), this.radical = new h(Q(r)), this.factor = e === "" ? new h().one() : new h(e), this;
+    const e = /^(.*?)root\((\d+)\)\(?([^)]+)/.exec(t);
+    if (!e) throw new Error(`Invalid root format: "${t}"`);
+    const [, i, s, r] = e;
+    return this.index = +s, this.radical = new h(r), this.factor = i === "" ? new h().one() : new h(i.trim()), this;
   }
   #a(t) {
     const [e, i] = t.split("sqrt");
-    return this.index = 2, this.radical = new h(Q(i)), this.factor = e === "" ? new h().one() : new h(e), this;
+    return this.index = 2, this.radical = new h(j(i)), this.factor = e === "" ? new h().one() : new h(e), this;
   }
 }
 class C {
@@ -568,8 +585,8 @@ class C {
     if (a.isNegative())
       return [];
     if (a.isSquare()) {
-      const m = a.sqrt(), d = r.clone().opposite().subtract(m).divide(s.clone().multiply(2)), y = r.clone().opposite().add(m).divide(s.clone().multiply(2));
-      return m.isZero() ? [C.fromFraction(d)] : [C.fromFraction(d), C.fromFraction(y)];
+      const m = a.sqrt(), d = r.clone().opposite().subtract(m).divide(s.clone().multiply(2)), v = r.clone().opposite().add(m).divide(s.clone().multiply(2));
+      return m.isZero() ? [C.fromFraction(d)] : [C.fromFraction(d), C.fromFraction(v)];
     }
     const c = new C();
     c.fraction = r.clone().opposite().divide(s).divide(2), c.root = new T().from(2, a, s.clone().multiply(2).inverse().opposite()), c.setExact(!1);
@@ -619,11 +636,11 @@ class C {
     t !== void 0 && (this.#o = t);
   }
 }
-class Ut {
+class jt {
   #t;
   #e;
   constructor(t) {
-    t instanceof N || t instanceof b ? this.#t = new N(t) : this.#t = new N().fromPolynom(t), this.#e = this.#t.getRoots();
+    t instanceof N || t instanceof y ? this.#t = new N(t) : this.#t = new N().fromPolynom(t), this.#e = this.#t.getRoots();
   }
   get fx() {
     return this.#t;
@@ -689,8 +706,8 @@ class R {
       if (m === d)
         e.push(this.#r(m));
       else {
-        const y = this.#o(t, m, d);
-        y !== null && e.push(this.#s(y));
+        const v = this.#o(t, m, d);
+        v !== null && e.push(this.#s(v));
       }
     }), e;
   }
@@ -711,7 +728,7 @@ class R {
   #a(t, e, i) {
     const s = [], r = 2 * e / i;
     for (let o = -e; o <= e; o += r) {
-      const a = x.numberCorrection(o);
+      const a = b.numberCorrection(o);
       s.push(
         {
           x: a,
@@ -736,13 +753,13 @@ class R {
     const s = t.monomByDegree().coefficient, r = t.monomByDegree(0).coefficient;
     if (r.isZero()) {
       e.push(this.#r(0));
-      const d = t.monoms.reduce((q, $) => $.degree().value < q.degree().value ? $ : q), y = d.coefficient;
-      d.clone().divide(y), t.divide(d);
+      const d = t.monoms.reduce((q, $) => $.degree().value < q.degree().value ? $ : q), v = d.coefficient;
+      d.clone().divide(v), t.divide(d);
     }
-    const o = x.dividers(s.value), a = x.dividers(r.value), c = [];
+    const o = b.dividers(s.value), a = b.dividers(r.value), c = [];
     for (const d of o)
-      for (const y of a) {
-        const q = new h(y, d);
+      for (const v of a) {
+        const q = new h(v, d);
         c.find(($) => $.value === q.value) || (c.push(q.clone()), c.push(q.opposite().clone()));
       }
     c.forEach((d) => {
@@ -751,20 +768,20 @@ class R {
     for (const d of e) {
       if (d.isZero())
         continue;
-      const y = t.clone().fromCoefficients(d.fraction.denominator, -d.fraction.numerator);
-      for (d.count = 0; t.isDividableBy(y); )
-        t.divide(y), d.count++;
+      const v = t.clone().fromCoefficients(d.fraction.denominator, -d.fraction.numerator);
+      for (d.count = 0; t.isDividableBy(v); )
+        t.divide(v), d.count++;
     }
     if (t.degree().isZero() || t.degree().value > 3)
-      return e.sort((d, y) => d.value - y.value), { solutions: e, reminder: t };
+      return e.sort((d, v) => d.value - v.value), { solutions: e, reminder: t };
     const f = t.clone().zero(), m = new R(t, f, this.#i);
     return {
-      solutions: e.concat(m.solve()).sort((d, y) => d.value - y.value),
+      solutions: e.concat(m.solve()).sort((d, v) => d.value - v.value),
       reminder: f
     };
   }
   #h() {
-    const t = this.#e, e = t.monomByDegree(3).coefficient, i = t.monomByDegree(2).coefficient, s = t.monomByDegree(1).coefficient, r = t.monomByDegree(0).coefficient, o = i.clone().divide(e), a = s.clone().divide(e), c = r.clone().divide(e), f = a.clone().subtract(o.clone().pow(2).divide(3)), m = c.clone().subtract(o.clone().multiply(a).divide(3)).add(o.clone().pow(3).multiply(2).divide(27)), d = m.clone().opposite(), y = f.clone().opposite().pow(3).divide(27), q = d.clone().pow(2).subtract(y.clone().multiply(4)).opposite();
+    const t = this.#e, e = t.monomByDegree(3).coefficient, i = t.monomByDegree(2).coefficient, s = t.monomByDegree(1).coefficient, r = t.monomByDegree(0).coefficient, o = i.clone().divide(e), a = s.clone().divide(e), c = r.clone().divide(e), f = a.clone().subtract(o.clone().pow(2).divide(3)), m = c.clone().subtract(o.clone().multiply(a).divide(3)).add(o.clone().pow(3).multiply(2).divide(27)), d = m.clone().opposite(), v = f.clone().opposite().pow(3).divide(27), q = d.clone().pow(2).subtract(v.clone().multiply(4)).opposite();
     if (q.isNegative()) {
       const $ = m.clone().opposite().add(q.clone().opposite().sqrt()).divide(2).root(3), k = m.clone().opposite().subtract(q.clone().opposite().sqrt()).divide(2).root(3), I = $.clone().add(k).subtract(o.clone().divide(3));
       return [this.#r(I)];
@@ -774,13 +791,13 @@ class R {
       return k.isEqual(I) ? [this.#r(k)] : [
         this.#r(I),
         this.#r(k)
-      ].sort((Y, M) => Y.value - M.value);
+      ].sort((Q, M) => Q.value - M.value);
     }
     if (q.isPositive()) {
-      const $ = [], k = f.value, I = m.value, Y = o.value;
+      const $ = [], k = f.value, I = m.value, Q = o.value;
       for (let M = 0; M < 3; M++)
-        $.push(2 * Math.sqrt(-k / 3) * Math.cos(Math.acos(3 * I / (2 * k) * Math.sqrt(-3 / k)) / 3 + 2 * Math.PI * M / 3) - Y / 3);
-      return $.map((M) => this.#s(M)).sort((M, lt) => M.value - lt.value);
+        $.push(2 * Math.sqrt(-k / 3) * Math.cos(Math.acos(3 * I / (2 * k) * Math.sqrt(-3 / k)) / 3 + 2 * Math.PI * M / 3) - Q / 3);
+      return $.map((M) => this.#s(M)).sort((M, ut) => M.value - ut.value);
     }
     return [];
   }
@@ -816,105 +833,105 @@ class R {
     return o.fraction = e.clone().opposite().divide(s.clone()), o.root.radical = i.clone(), o.root.factor = new h().one().divide(s.clone()).opposite(), o.exact = !0, [r, o].sort((a, c) => a.value - c.value);
   }
 }
-const _ = {
+const tt = {
   pi: Math.PI,
   e: Math.exp(1)
 };
-var l = /* @__PURE__ */ ((n) => (n.VARIABLE = "variable", n.COEFFICIENT = "coefficient", n.OPERATION = "operation", n.CONSTANT = "constant", n.FUNCTION = "function", n.FUNCTION_ARGUMENT = "function-argument", n.MONOM = "monom", n.LEFT_PARENTHESIS = "(", n.RIGHT_PARENTHESIS = ")", n))(l || {}), S = /* @__PURE__ */ ((n) => (n.EXPRESSION = "expression", n.POLYNOM = "polynom", n.SET = "set", n.NUMERIC = "numeric", n))(S || {});
-function bt(n, t) {
+var u = /* @__PURE__ */ ((n) => (n.VARIABLE = "variable", n.COEFFICIENT = "coefficient", n.OPERATION = "operation", n.CONSTANT = "constant", n.FUNCTION = "function", n.FUNCTION_ARGUMENT = "function-argument", n.MONOM = "monom", n.LEFT_PARENTHESIS = "(", n.RIGHT_PARENTHESIS = ")", n))(u || {}), S = /* @__PURE__ */ ((n) => (n.EXPRESSION = "expression", n.POLYNOM = "polynom", n.SET = "set", n.NUMERIC = "numeric", n))(S || {});
+function Et(n, t) {
   if (n.length <= 1)
     return n;
-  const e = Object.keys(t).filter((d) => t[d].type === l.FUNCTION).map((d) => d);
-  e.sort((d, y) => y.length - d.length);
-  const i = new RegExp(`^(${e.join("|")})\\(`), s = Object.keys(_);
-  s.sort((d, y) => y.length - d.length);
+  const e = Object.keys(t).filter((d) => t[d].type === u.FUNCTION).map((d) => d);
+  e.sort((d, v) => v.length - d.length);
+  const i = new RegExp(`^(${e.join("|")})\\(`), s = Object.keys(tt);
+  s.sort((d, v) => v.length - d.length);
   const r = new RegExp(`^(${s.join("|")})`), o = /^(\d+(\.\d+)?)/;
   let a = "", c, f, m;
   for (e.forEach((d) => {
     if (n.includes(d)) {
-      const y = new RegExp(`${d}([0-9.]+)`, "g");
-      n = n.replaceAll(y, `${d}($1)`);
+      const v = new RegExp(`${d}([0-9.]+)`, "g");
+      n = n.replaceAll(v, `${d}($1)`);
     }
   }); n.length > 0; ) {
     if (c = f, m = void 0, e.length > 0 && i.exec(n)) {
-      const d = e.find((y) => n.startsWith(y));
-      d && (m = d + "(", n = n.slice(d.length + 1), f = l.FUNCTION);
+      const d = e.find((v) => n.startsWith(v));
+      d && (m = d + "(", n = n.slice(d.length + 1), f = u.FUNCTION);
     } else if (s.length > 0 && r.exec(n)) {
-      const d = s.find((y) => n.startsWith(y));
-      d && (m = d, n = n.slice(d.length), f = l.CONSTANT);
+      const d = s.find((v) => n.startsWith(v));
+      d && (m = d, n = n.slice(d.length), f = u.CONSTANT);
     } else if (o.exec(n)) {
       const d = o.exec(n);
-      d && (m = d[0], n = n.slice(d[0].length), f = l.COEFFICIENT);
+      d && (m = d[0], n = n.slice(d[0].length), f = u.COEFFICIENT);
     } else
       switch (m = n[0], n = n.slice(1), m) {
         case "(":
-          f = l.LEFT_PARENTHESIS;
+          f = u.LEFT_PARENTHESIS;
           break;
         case ")":
-          f = l.RIGHT_PARENTHESIS;
+          f = u.RIGHT_PARENTHESIS;
           break;
         case ",":
-          f = l.FUNCTION_ARGUMENT;
+          f = u.FUNCTION_ARGUMENT;
           break;
         case "+":
         case "-":
         case "*":
         case "/":
         case "^":
-          f = l.OPERATION;
+          f = u.OPERATION;
           break;
         default:
-          f = l.VARIABLE;
+          f = u.VARIABLE;
       }
     if (m === void 0 || f === void 0)
       throw new Error("The token is undefined");
-    a += Et(c, f), a += m;
+    a += Nt(c, f), a += m;
   }
   return a;
 }
-function Et(n, t) {
-  return n === void 0 || n === l.OPERATION || t === l.OPERATION || n === l.LEFT_PARENTHESIS || n === l.FUNCTION || n === l.FUNCTION_ARGUMENT || t === l.RIGHT_PARENTHESIS || t === l.FUNCTION_ARGUMENT ? "" : "*";
+function Nt(n, t) {
+  return n === void 0 || n === u.OPERATION || t === u.OPERATION || n === u.LEFT_PARENTHESIS || n === u.FUNCTION || n === u.FUNCTION_ARGUMENT || t === u.RIGHT_PARENTHESIS || t === u.FUNCTION_ARGUMENT ? "" : "*";
 }
-const Nt = {
-  "^": { precedence: 4, associative: "right", type: l.OPERATION },
-  "*": { precedence: 3, associative: "left", type: l.OPERATION },
-  "/": { precedence: 3, associative: "left", type: l.OPERATION },
-  "+": { precedence: 2, associative: "left", type: l.OPERATION },
-  "-": { precedence: 2, associative: "left", type: l.OPERATION }
-}, At = {
-  "^": { precedence: 4, associative: "right", type: l.OPERATION },
-  "*": { precedence: 3, associative: "left", type: l.OPERATION },
-  "/": { precedence: 3, associative: "left", type: l.OPERATION },
-  "+": { precedence: 2, associative: "left", type: l.OPERATION },
-  "-": { precedence: 2, associative: "left", type: l.OPERATION },
-  "%": { precedence: 3, associative: "right", type: l.OPERATION },
-  sin: { precedence: 4, associative: "right", type: l.FUNCTION },
-  cos: { precedence: 4, associative: "right", type: l.FUNCTION },
-  tan: { precedence: 4, associative: "right", type: l.FUNCTION },
-  sqrt: { precedence: 4, associative: "right", type: l.FUNCTION },
-  nthrt: { precedence: 4, associative: "right", type: l.FUNCTION },
-  ",": { precedence: 2, associative: "left", type: l.FUNCTION_ARGUMENT }
+const At = {
+  "^": { precedence: 4, associative: "right", type: u.OPERATION },
+  "*": { precedence: 3, associative: "left", type: u.OPERATION },
+  "/": { precedence: 3, associative: "left", type: u.OPERATION },
+  "+": { precedence: 2, associative: "left", type: u.OPERATION },
+  "-": { precedence: 2, associative: "left", type: u.OPERATION }
 }, Tt = {
-  "^": { precedence: 4, associative: "right", type: l.OPERATION },
-  "*": { precedence: 3, associative: "left", type: l.OPERATION },
-  "/": { precedence: 3, associative: "left", type: l.OPERATION },
-  "+": { precedence: 2, associative: "left", type: l.OPERATION },
-  "-": { precedence: 2, associative: "left", type: l.OPERATION },
-  "%": { precedence: 3, associative: "right", type: l.OPERATION },
-  sin: { precedence: 4, associative: "right", type: l.FUNCTION },
-  cos: { precedence: 4, associative: "right", type: l.FUNCTION },
-  tan: { precedence: 4, associative: "right", type: l.FUNCTION },
-  sqrt: { precedence: 4, associative: "right", type: l.FUNCTION },
-  nthrt: { precedence: 4, associative: "right", type: l.FUNCTION },
-  ln: { precedence: 4, associative: "right", type: l.FUNCTION },
-  log: { precedence: 4, associative: "right", type: l.FUNCTION }
+  "^": { precedence: 4, associative: "right", type: u.OPERATION },
+  "*": { precedence: 3, associative: "left", type: u.OPERATION },
+  "/": { precedence: 3, associative: "left", type: u.OPERATION },
+  "+": { precedence: 2, associative: "left", type: u.OPERATION },
+  "-": { precedence: 2, associative: "left", type: u.OPERATION },
+  "%": { precedence: 3, associative: "right", type: u.OPERATION },
+  sin: { precedence: 4, associative: "right", type: u.FUNCTION },
+  cos: { precedence: 4, associative: "right", type: u.FUNCTION },
+  tan: { precedence: 4, associative: "right", type: u.FUNCTION },
+  sqrt: { precedence: 4, associative: "right", type: u.FUNCTION },
+  nthrt: { precedence: 4, associative: "right", type: u.FUNCTION },
+  ",": { precedence: 2, associative: "left", type: u.FUNCTION_ARGUMENT }
 }, Ot = {
-  "&": { precedence: 3, associative: "left", type: l.OPERATION },
-  "|": { precedence: 3, associative: "left", type: l.OPERATION },
-  "!": { precedence: 4, associative: "right", type: l.OPERATION },
-  "-": { precedence: 2, associative: "left", type: l.OPERATION }
+  "^": { precedence: 4, associative: "right", type: u.OPERATION },
+  "*": { precedence: 3, associative: "left", type: u.OPERATION },
+  "/": { precedence: 3, associative: "left", type: u.OPERATION },
+  "+": { precedence: 2, associative: "left", type: u.OPERATION },
+  "-": { precedence: 2, associative: "left", type: u.OPERATION },
+  "%": { precedence: 3, associative: "right", type: u.OPERATION },
+  sin: { precedence: 4, associative: "right", type: u.FUNCTION },
+  cos: { precedence: 4, associative: "right", type: u.FUNCTION },
+  tan: { precedence: 4, associative: "right", type: u.FUNCTION },
+  sqrt: { precedence: 4, associative: "right", type: u.FUNCTION },
+  nthrt: { precedence: 4, associative: "right", type: u.FUNCTION },
+  ln: { precedence: 4, associative: "right", type: u.FUNCTION },
+  log: { precedence: 4, associative: "right", type: u.FUNCTION }
+}, Ct = {
+  "&": { precedence: 3, associative: "left", type: u.OPERATION },
+  "|": { precedence: 3, associative: "left", type: u.OPERATION },
+  "!": { precedence: 4, associative: "right", type: u.OPERATION },
+  "-": { precedence: 2, associative: "left", type: u.OPERATION }
 };
-class G {
+class W {
   #t;
   #e = [];
   #i = {};
@@ -931,7 +948,7 @@ class G {
     return this.#e.map((t) => t.token);
   }
   tokenConfigInitialization() {
-    return this.#t === S.SET ? (this.#i = Ot, this.#r = !1) : this.#t === S.NUMERIC ? (this.#i = Tt, this.#r = !0) : this.#t === S.EXPRESSION ? (this.#i = At, this.#r = !0) : (this.#i = Nt, this.#r = !0), this.#s = Object.keys(this.#i).sort((t, e) => e.length - t.length), this.#i;
+    return this.#t === S.SET ? (this.#i = Ct, this.#r = !1) : this.#t === S.NUMERIC ? (this.#i = Ot, this.#r = !0) : this.#t === S.EXPRESSION ? (this.#i = Tt, this.#r = !0) : (this.#i = At, this.#r = !0), this.#s = Object.keys(this.#i).sort((t, e) => e.length - t.length), this.#i;
   }
   /**
    * Get the next token to analyse.
@@ -941,31 +958,31 @@ class G {
   NextToken(t, e) {
     let i, s;
     if (i = "", s = void 0, t[e] === "(")
-      i = "(", s = l.LEFT_PARENTHESIS;
+      i = "(", s = u.LEFT_PARENTHESIS;
     else if (t[e] === ")")
-      i = ")", s = l.RIGHT_PARENTHESIS;
+      i = ")", s = u.RIGHT_PARENTHESIS;
     else if (t[e] === ",")
-      i = ",", s = l.FUNCTION_ARGUMENT;
+      i = ",", s = u.FUNCTION_ARGUMENT;
     else {
       for (const r of this.#s)
         if (t.substring(e, e + r.length) === r) {
           i += r, s = this.#i[r].type;
           break;
         }
-      for (const r in _)
+      for (const r in tt)
         if (t.substring(e, e + r.length) === r) {
-          i += r, s = l.CONSTANT;
+          i += r, s = u.CONSTANT;
           break;
         }
       if (i === "")
         if (/[0-9.]/.exec(t[e])) {
           const r = /^([0-9.]+)/.exec(t.substring(e));
-          i = r ? r[0] : "", s = l.COEFFICIENT;
+          i = r ? r[0] : "", s = u.COEFFICIENT;
         } else if (/[a-zA-Z]/.exec(t[e])) {
           const r = /^([a-zA-Z])/.exec(t.substring(e));
-          i = r ? r[0] : "", s = l.VARIABLE;
+          i = r ? r[0] : "", s = u.VARIABLE;
         } else
-          console.log("Unidentified token", t[e], t, e), i = t[e], s = l.MONOM;
+          console.log("Unidentified token", t[e], t, e), i = t[e], s = u.MONOM;
     }
     if (s === void 0)
       throw new Error(`Token type is undefined for token ${i}`);
@@ -980,7 +997,7 @@ class G {
   parse(t, e) {
     const i = [], s = [];
     let r = "", o = 0, a;
-    (e ?? this.#r) && (t = bt(t, this.#i));
+    (e ?? this.#r) && (t = Et(t, this.#i));
     let c = 50, f;
     for (; o < t.length; ) {
       if (c--, c === 0) {
@@ -988,16 +1005,16 @@ class G {
         break;
       }
       switch ([r, o, a] = this.NextToken(t, o), a) {
-        case l.MONOM:
-        case l.COEFFICIENT:
-        case l.VARIABLE:
-        case l.CONSTANT:
+        case u.MONOM:
+        case u.COEFFICIENT:
+        case u.VARIABLE:
+        case u.CONSTANT:
           i.push({
             token: r,
             tokenType: a
           });
           break;
-        case l.OPERATION:
+        case u.OPERATION:
           if (s.length > 0) {
             let m = s[s.length - 1];
             for (f = 50; m.token in this.#i && //either o1 is left-associative and its precedence is less than or equal to that of o2,
@@ -1007,14 +1024,14 @@ class G {
                 console.log("SECURITY LEVEL 2 OPERATION EXIT");
                 break;
               }
-              if (i.push(s.pop() ?? { token: "", tokenType: l.OPERATION }), s.length === 0)
+              if (i.push(s.pop() ?? { token: "", tokenType: u.OPERATION }), s.length === 0)
                 break;
               m = s[s.length - 1];
             }
           }
           s.push({ token: r, tokenType: a });
           break;
-        case l.FUNCTION_ARGUMENT:
+        case u.FUNCTION_ARGUMENT:
           for (f = 50; s[s.length - 1].token !== "(" && s.length > 0; ) {
             if (f--, f === 0) {
               console.log("SECURITY LEVEL 2 FUNCTION ARGUMENT EXIT");
@@ -1023,10 +1040,10 @@ class G {
             i.push(s.pop() ?? { token: r, tokenType: a });
           }
           break;
-        case l.LEFT_PARENTHESIS:
-          s.push({ token: r, tokenType: a }), t[o] === "-" && i.push({ token: "0", tokenType: l.COEFFICIENT });
+        case u.LEFT_PARENTHESIS:
+          s.push({ token: r, tokenType: a }), t[o] === "-" && i.push({ token: "0", tokenType: u.COEFFICIENT });
           break;
-        case l.RIGHT_PARENTHESIS:
+        case u.RIGHT_PARENTHESIS:
           for (f = 50; s[s.length - 1].token !== "(" && s.length > 1; ) {
             if (f--, f === 0) {
               console.log("SECURITY LEVEL 2 CLOSING PARENTHESIS EXIT");
@@ -1036,7 +1053,7 @@ class G {
           }
           s.pop();
           break;
-        case l.FUNCTION:
+        case u.FUNCTION:
           s.push({ token: r, tokenType: a });
           break;
         default:
@@ -1046,14 +1063,14 @@ class G {
     return this.#e = i.concat(s.reverse()), this;
   }
 }
-class Ct {
+class qt {
   _rpn;
   _expression;
   _isValid;
   constructor(t, e) {
     this._expression = t;
     try {
-      this._rpn = new G(S.NUMERIC).parse(t, e).rpn;
+      this._rpn = new W(S.NUMERIC).parse(t, e).rpn;
     } catch (i) {
       throw this._rpn = null, this._isValid = !1, console.warn(i), new Error(`There was a problem parsing: ${t}`);
     }
@@ -1082,7 +1099,7 @@ class Ct {
       return this._isValid = !1, 0;
     this._isValid = !0;
     for (const i of this._rpn)
-      if (i.tokenType === l.COEFFICIENT)
+      if (i.tokenType === u.COEFFICIENT)
         if (!isNaN(+i.token))
           e.push(+i.token);
         else {
@@ -1091,11 +1108,11 @@ class Ct {
             throw this._isValid = !1, new Error("This coefficient is not a fraction");
           e.push(+s[0] / +s[1]);
         }
-      else if (i.tokenType === l.VARIABLE && t !== void 0)
+      else if (i.tokenType === u.VARIABLE && t !== void 0)
         Object.hasOwn(t, i.token) && e.push(+t[i.token]);
-      else if (i.tokenType === l.CONSTANT)
-        e.push(_[i.token]);
-      else if (i.tokenType === l.OPERATION) {
+      else if (i.tokenType === u.CONSTANT)
+        e.push(tt[i.token]);
+      else if (i.tokenType === u.OPERATION) {
         if (i.token === "*") {
           const s = e.pop(), r = e.pop();
           if (r === void 0 || s === void 0)
@@ -1122,7 +1139,7 @@ class Ct {
             throw this._isValid = !1, new Error(`The base value ${r ?? "a"} or exponent ${s ?? "b"} are not defined`);
           e.push(Math.pow(r, s));
         }
-      } else if (i.tokenType === l.FUNCTION) {
+      } else if (i.tokenType === u.FUNCTION) {
         const s = e.pop();
         if (s === void 0)
           throw this._isValid = !1, new Error(`The parameters for ${i.token} is not defined`);
@@ -1190,7 +1207,7 @@ class p {
     for (const r of t)
       if (r.containsRationalPower())
         return new p().zero();
-    const e = new p(), i = x.gcd(...t.map((r) => r.coefficient.numerator)), s = x.lcm(...t.map((r) => r.coefficient.denominator));
+    const e = new p(), i = b.gcd(...t.map((r) => r.coefficient.numerator)), s = b.lcm(...t.map((r) => r.coefficient.denominator));
     e.coefficient = new h(i, s).reduce();
     for (const r of t) {
       for (const o in e.literal)
@@ -1275,7 +1292,7 @@ class p {
       return [this.clone()];
     if (this.coefficient.numerator > 1e6)
       return [this.clone()];
-    const t = x.dividers(Math.abs(this.coefficient.numerator));
+    const t = b.dividers(Math.abs(this.coefficient.numerator));
     let e = [];
     for (const s in this.literal)
       e = this.#n(e, s);
@@ -1568,12 +1585,12 @@ class p {
   }
   #o = (t, e) => {
     let i, s, r, o, a;
-    if (e.tokenType === l.COEFFICIENT)
+    if (e.tokenType === u.COEFFICIENT)
       t.push(new p(new h(e.token)));
-    else if (e.tokenType === l.VARIABLE) {
+    else if (e.tokenType === u.VARIABLE) {
       const c = new p().one();
       c.setLetter(e.token, 1), t.push(c.clone());
-    } else if (e.tokenType === l.OPERATION)
+    } else if (e.tokenType === u.OPERATION)
       switch (e.token) {
         case "-":
           s = t.pop() ?? new p().zero(), i = t.pop() ?? new p().zero(), t.push(i.subtract(s));
@@ -1591,19 +1608,19 @@ class p {
       }
   };
   #a = (t) => {
-    const i = new G().parse(t).rpn, s = [];
+    const i = new W().parse(t).rpn, s = [];
     if (i.length === 0)
       return this.zero(), this;
     if (i.length === 1) {
       const r = i[0];
-      return this.one(), r.tokenType === l.COEFFICIENT ? this.coefficient = new h(r.token) : r.tokenType === l.VARIABLE && this.setLetter(r.token, 1), this;
+      return this.one(), r.tokenType === u.COEFFICIENT ? this.coefficient = new h(r.token) : r.tokenType === u.VARIABLE && this.setLetter(r.token, 1), this;
     } else
       for (const r of i)
         this.#o(s, r);
     return this.one(), this.multiply(s[0]), this;
   };
 }
-function rt(n, t) {
+function nt(n, t) {
   if (!Number.isSafeInteger(t))
     throw new Error("Can only raise item by an integer");
   if (t < 0)
@@ -1615,7 +1632,7 @@ function rt(n, t) {
     n.multiply(e);
   return n;
 }
-class u {
+class l {
   #t = "x";
   #e;
   #i;
@@ -1638,7 +1655,7 @@ class u {
       this.#i.push(new p(t)), e.forEach((i) => {
         this.#i.push(new p(i));
       });
-    else if (t instanceof u)
+    else if (t instanceof l)
       for (const i of t.monoms)
         this.#i.push(i.clone());
     return this;
@@ -1647,7 +1664,7 @@ class u {
    * Clone the polynom
    */
   clone() {
-    const t = new u(), e = [];
+    const t = new l(), e = [];
     t.#t = this.#t;
     for (const i of this.#i)
       e.push(i.clone());
@@ -1660,14 +1677,14 @@ class u {
     return this.#l();
   }
   static xMultiply(...t) {
-    const e = new u().one();
+    const e = new l().one();
     return t.forEach((i) => {
       e.multiply(i);
     }), e;
   }
   add(...t) {
     for (const e of t)
-      e instanceof u ? this.#i = this.#i.concat(e.monoms.map((i) => i.clone())) : e instanceof p ? this.#i.push(e.clone()) : typeof e == "number" && Number.isSafeInteger(e) ? this.#i.push(new p(e.toString())) : this.#i.push(new p(e));
+      e instanceof l ? this.#i = this.#i.concat(e.monoms.map((i) => i.clone())) : e instanceof p ? this.#i.push(e.clone()) : typeof e == "number" && Number.isSafeInteger(e) ? this.#i.push(new p(e.toString())) : this.#i.push(new p(e));
     return this.reduce();
   }
   commonMonom() {
@@ -1688,7 +1705,7 @@ class u {
     return e;
   }
   derivative(t) {
-    const e = new u();
+    const e = new l();
     for (const i of this.#i)
       e.add(i.derivative(t));
     return e.reduce();
@@ -1699,8 +1716,8 @@ class u {
     if (typeof t == "number" && Number.isSafeInteger(t))
       return this.#a(t);
     if (t instanceof p)
-      return this.divide(new u(t));
-    if (t instanceof u) {
+      return this.divide(new l(t));
+    if (t instanceof l) {
       if (t.monoms.length === 1 && t.variables.length === 0)
         return this.#o(t.monoms[0].coefficient);
       {
@@ -1709,7 +1726,7 @@ class u {
           return this.#i = e.monoms, this.#h(), this;
       }
     } else if (typeof t == "string")
-      return this.divide(new u(t));
+      return this.divide(new l(t));
     throw new Error(`Cannot divide by ${t}`);
   }
   empty() {
@@ -1721,11 +1738,11 @@ class u {
    * returns {quotient: Polynom, reminder: Polynom}
    */
   euclidean(t) {
-    const e = t.variables[0], i = new u().zero(), s = this.clone().reorder(e);
+    const e = t.variables[0], i = new l().zero(), s = this.clone().reorder(e);
     if (t.variables.length === 0)
       return {
         quotient: this.clone().divide(t).reduce(),
-        reminder: new u().zero()
+        reminder: new l().zero()
       };
     if (!this.degree(e).isNatural() || !t.degree(e).isNatural())
       throw new Error("Euclidean division requires integer degrees");
@@ -1750,19 +1767,19 @@ class u {
    * TODO: Handle other letter than 'x'.
    */
   factorize(t) {
-    this.#e = [];
+    if (this.#e = [], this.monoms.length === 1) return [this.clone()];
     let e = this.clone().reorder();
     const i = e.commonMonom();
-    e.monomByDegree().coefficient.isStrictlyNegative() && i.opposite(), i.isOne() || (this.#e.push(new u(i)), e = e.euclidean(this.#e[0]).quotient);
+    e.monomByDegree().coefficient.isStrictlyNegative() && i.opposite(), i.isOne() || (this.#e.push(new l(i)), e = e.euclidean(this.#e[0]).quotient);
     const s = new R(e).solve();
     if (s.length === 0)
       return this.#e.length === 0 ? this.#e = [this.clone()] : this.#e.push(e), this.#e;
     if (s.forEach((o) => {
       if (o.exact && o.root.isZero())
         for (let a = 0; a < o.count; a++)
-          o.fraction.isRational() ? this.#e.push(new u().fromCoefficients(o.fraction.denominator, -o.fraction.numerator)) : this.#e.push(new u().fromCoefficients(1, o.fraction.clone().opposite()));
+          o.fraction.isRational() ? this.#e.push(new l().fromCoefficients(o.fraction.denominator, -o.fraction.numerator)) : this.#e.push(new l().fromCoefficients(1, o.fraction.clone().opposite()));
     }), this.#e.map((o) => o.degree().value).reduce((o, a) => o + a, 0) < this.degree().value) {
-      const o = u.xMultiply(...this.#e);
+      const o = l.xMultiply(...this.#e);
       this.#e.push(this.clone().divide(o));
     }
     return this.#e;
@@ -1779,10 +1796,10 @@ class u {
     }), this.#h(), this.reorder();
   }
   gcdDenominator() {
-    return x.gcd(...this.getDenominators());
+    return b.gcd(...this.getDenominators());
   }
   gcdNumerator() {
-    return x.gcd(...this.getNumerators());
+    return b.gcd(...this.getNumerators());
   }
   getCoefficients() {
     if (!this.degree().isNatural())
@@ -1824,7 +1841,7 @@ class u {
     if (i.includes("(") || i.includes(")"))
       return !1;
     try {
-      e = new u(t);
+      e = new l(t);
     } catch {
       return !1;
     }
@@ -1858,10 +1875,10 @@ class u {
     return this.#i.length === 1 && this.#i[0].coefficient.isZero() || this.#i.length === 0;
   }
   lcmDenominator() {
-    return x.lcm(...this.getDenominators());
+    return b.lcm(...this.getDenominators());
   }
   lcmNumerator() {
-    return x.lcm(...this.getNumerators());
+    return b.lcm(...this.getNumerators());
   }
   get length() {
     return this.#i.length;
@@ -1908,7 +1925,7 @@ class u {
     return i;
   }
   multiply(t) {
-    if (t instanceof u)
+    if (t instanceof l)
       return this.#p(t);
     if (t instanceof h)
       return this.#u(t);
@@ -1939,10 +1956,10 @@ class u {
     return this.#l("tex", !1, !1, !0);
   }
   pow(t) {
-    return rt(this, t).reduce();
+    return nt(this, t).reduce();
   }
   primitive(t) {
-    const e = new u();
+    const e = new l();
     for (const i of this.#i)
       e.add(i.primitive(t));
     return e;
@@ -1981,7 +1998,7 @@ class u {
    */
   replaceBy(t, e) {
     let i;
-    const s = new u().zero();
+    const s = new l().zero();
     for (const r of this.monoms)
       if (!r.hasVariable(t) || r.literal[t].isZero())
         s.add(r.clone());
@@ -2010,7 +2027,7 @@ class u {
   }
   subtract(...t) {
     for (const e of t)
-      e instanceof u ? this.add(e.clone().opposite()) : e instanceof p ? this.#i.push(e.clone().opposite()) : this.#i.push(new p(e).opposite());
+      e instanceof l ? this.add(e.clone().opposite()) : e instanceof p ? this.#i.push(e.clone().opposite()) : this.#i.push(new p(e).opposite());
     return this.reduce();
   }
   tableOfSigns() {
@@ -2018,7 +2035,7 @@ class u {
     let e = new Array(2 * t.length + 1).fill("").map((i, s) => s % 2 === 0 ? "" : "z");
     if (e.length === 1) {
       const [i] = this.getCoefficients().map((s) => s.value);
-      e = j(e, "", i > 0 ? "+" : "-");
+      e = F(e, "", i > 0 ? "+" : "-");
     } else if (this.degree().isOne()) {
       const [i] = this.getCoefficients().map((s) => s.value);
       e[0] = i > 0 ? "-" : "+", e[1] = "z", e[2] = i > 0 ? "+" : "-";
@@ -2144,15 +2161,15 @@ class u {
   }
   #g(t, e) {
     switch (e.tokenType) {
-      case l.COEFFICIENT:
-        t.push(new u(e.token));
+      case u.COEFFICIENT:
+        t.push(new l(e.token));
         break;
-      case l.VARIABLE:
-        t.push(new u().add(new p(e.token)));
+      case u.VARIABLE:
+        t.push(new l().add(new p(e.token)));
         break;
-      case l.CONSTANT:
+      case u.CONSTANT:
         throw new Error("Unsupported CONSTANT token in Polynom parser");
-      case l.OPERATION:
+      case u.OPERATION:
         if (t.length >= 2) {
           const i = t.pop(), s = t.pop();
           if (s === void 0 || i === void 0)
@@ -2185,9 +2202,9 @@ class u {
         } else
           throw new Error("Error parsing the polynom");
         break;
-      case l.MONOM:
+      case u.MONOM:
         throw new Error("Unexpected MONOM token in polynom parser");
-      case l.FUNCTION:
+      case u.FUNCTION:
         throw new Error(`Unsupported function token "${e.token}" in polynom parser`);
     }
   }
@@ -2196,7 +2213,7 @@ class u {
    * @param inputStr
    */
   #w(t) {
-    const i = new G().parse(t).rpn;
+    const i = new W().parse(t).rpn;
     this.zero();
     const s = [];
     for (const r of i)
@@ -2204,7 +2221,7 @@ class u {
     return s.length === 1 && this.add(s[0]), this.reorder();
   }
 }
-class v {
+class x {
   // Left part of the equation
   #t;
   // Right part of the equation
@@ -2212,11 +2229,11 @@ class v {
   // Signe of the equation
   #i;
   constructor(t, e, i) {
-    if (this.#t = new u().zero(), this.#e = new u().zero(), this.#i = "=", t !== void 0 && e === void 0) {
-      if (t instanceof v)
+    if (this.#t = new l().zero(), this.#e = new l().zero(), this.#i = "=", t !== void 0 && e === void 0) {
+      if (t instanceof x)
         return t.clone();
       typeof t == "string" && this.parse(t);
-    } else t !== void 0 && e !== void 0 && (this.left = new u(t), this.right = new u(e));
+    } else t !== void 0 && e !== void 0 && (this.left = new l(t), this.right = new l(e));
     return i !== void 0 && (this.sign = i), this;
   }
   // ------------------------------------------
@@ -2225,9 +2242,9 @@ class v {
     if (e === !1)
       throw new Error("The equation is not valid (no sign found)");
     const i = t.split(e);
-    return this.create(new u(i[0]), new u(i[1]), this.#r(e));
+    return this.create(new l(i[0]), new l(i[1]), this.#r(e));
   };
-  clone = () => new v(this.#t.clone(), this.#e.clone(), this.#i);
+  clone = () => new x(this.#t.clone(), this.#e.clone(), this.#i);
   get tex() {
     return `${this.#t.tex}${this.signAsTex}${this.#e.tex}`;
   }
@@ -2250,11 +2267,11 @@ class v {
    * @param value | Polynom | Monom | Fraction | string | monom
    */
   add(t) {
-    if (t instanceof v)
+    if (t instanceof x)
       return this.#t.add(t.left), this.#e.add(t.right), this;
-    if (typeof t == "string" && !v.isEquationString(t))
-      return this.add(new v(t));
-    const e = new u(t);
+    if (typeof t == "string" && !x.isEquationString(t))
+      return this.add(new x(t));
+    const e = new l(t);
     return this.#t.add(e), this.#e.add(e), this;
   }
   create = (t, e, i) => (this.#t = t, this.#e = e, this.#i = this.#r(i ?? "="), this);
@@ -2298,7 +2315,7 @@ class v {
    */
   hasVariable = (t) => this.variables.includes(t);
   isEqual(t) {
-    const e = new v(t);
+    const e = new x(t);
     return e.left.isEqual(this.#t) && e.right.isEqual(this.#e);
   }
   // -----------------------------------------------
@@ -2390,18 +2407,18 @@ class v {
   /**
    * Multiply by the lcm denominator and divide by the gcm numerators.
    */
-  simplify = () => (this.multiply(x.lcm(...this.#t.getDenominators(), ...this.#e.getDenominators())), this.divide(x.gcd(...this.#t.getNumerators(), ...this.#e.getNumerators())), this);
+  simplify = () => (this.multiply(b.lcm(...this.#t.getDenominators(), ...this.#e.getDenominators())), this.divide(b.gcd(...this.#t.getNumerators(), ...this.#e.getNumerators())), this);
   // -----------------------------------------------
   solve = () => new R(this.clone()).solve();
   split() {
     return [this.#t.clone(), this.#e.clone()];
   }
   subtract(t) {
-    if (t instanceof v)
+    if (t instanceof x)
       return this.#t.subtract(t.left), this.#e.subtract(t.right), this;
-    if (typeof t == "string" && !v.isEquationString(t))
-      return this.subtract(new v(t));
-    const e = new u(t);
+    if (typeof t == "string" && !x.isEquationString(t))
+      return this.subtract(new x(t));
+    const e = new l(t);
     return this.#t.subtract(e), this.#e.subtract(e), this;
   }
   test = (t) => this.left.evaluate(t).isEqual(this.right.evaluate(t));
@@ -2434,29 +2451,29 @@ class v {
   #r = (t) => t === void 0 ? "=" : t.includes("geq") || t.includes(">=") || t.includes("=>") ? ">=" : t.includes(">") ? ">" : t.includes("leq") || t.includes("<=") || t.includes("=<") ? "<=" : t.includes("<") ? "<" : "=";
   #n = () => this.#i === "=" ? this : this.#i.includes("<") ? (this.#i.replace("<", ">"), this) : this.#i.includes(">") ? (this.#i.replace(">", "<"), this) : this;
 }
-class b {
+class y {
   #t;
   #e;
   #i;
   #s = !1;
   constructor(t, e) {
-    return t instanceof b ? (this.#e = t.polynom.clone(), this.#i = t.power.clone(), e !== void 0 && this.#i.multiply(new h(e))) : t !== void 0 ? (this.#e = new u(t), this.#i = new h(e ?? 1)) : (this.#e = new u(), this.#i = new h(1)), this.#t = 1, this;
+    return t instanceof y ? (this.#e = t.polynom.clone(), this.#i = t.power.clone(), e !== void 0 && this.#i.multiply(new h(e))) : t !== void 0 ? (this.#e = new l(t), this.#i = new h(e ?? 1)) : (this.#e = new l(), this.#i = new h(1)), this.#t = 1, this;
   }
   parse() {
     throw new Error("Method not implemented.");
   }
   clone() {
-    return new b(this);
+    return new y(this);
   }
   get tex() {
     const t = this.power.numerator, e = this.power.denominator;
     let i, s;
-    return this.#t === 0 && e > 1 ? (i = `\\sqrt${e === 2 ? "" : `[ ${e} ]`}{ ${this.polynom.tex} }`, s = t === 1 ? "" : `^{ ${t} }`) : (i = this.#s && this.power.isOne() ? this.polynom.tex : it(this.polynom.tex), s = e === 1 && t === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${s}`, this.#t === 0 && t < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
+    return this.#t === 0 && e > 1 ? (i = `\\sqrt${e === 2 ? "" : `[ ${e} ]`}{ ${this.polynom.tex} }`, s = t === 1 ? "" : `^{ ${t} }`) : (i = this.#s && this.power.isOne() ? this.polynom.tex : st(this.polynom.tex), s = e === 1 && t === 1 ? "" : `^{ ${this.power.tex} }`), i = `${i}${s}`, this.#t === 0 && t < 0 && (i = `\\frac{ 1 }{ ${i} }`), i;
   }
   get display() {
     const t = this.power.numerator, e = this.power.denominator;
     let i, s;
-    return this.#t === 0 && e > 1 ? (i = `${e === 2 ? "sqrt" : `root(${e})`}(${this.polynom.display})`, s = t === 1 ? "" : `^(${t})`) : (i = this.#s && this.power.isOne() ? this.polynom.display : it(this.polynom.display, !1), s = e === 1 && t === 1 ? "" : `^(${this.power.display})`), i = `${i}${s}`, this.#t === 0 && t < 0 && (i = `1/(${i})`), i;
+    return this.#t === 0 && e > 1 ? (i = `${e === 2 ? "sqrt" : `root(${e})`}(${this.polynom.display})`, s = t === 1 ? "" : `^(${t})`) : (i = this.#s && this.power.isOne() ? this.polynom.display : st(this.polynom.display, !1), s = e === 1 && t === 1 ? "" : `^(${this.power.display})`), i = `${i}${s}`, this.#t === 0 && t < 0 && (i = `1/(${i})`), i;
   }
   add() {
     throw new Error("Adding two factors is not possible");
@@ -2468,10 +2485,10 @@ class b {
     return this.polynom.degree(t).multiply(this.power);
   }
   derivative() {
-    return this.power.isZero() ? [new b("0")] : this.power.isOne() ? [new b(this.polynom.clone().derivative())] : [
-      new b(this.power.clone()),
-      new b(this.polynom.clone().derivative()),
-      new b(this.polynom.clone(), this.power.clone().subtract(1))
+    return this.power.isZero() ? [new y("0")] : this.power.isOne() ? [new y(this.polynom.clone().derivative())] : [
+      new y(this.power.clone()),
+      new y(this.polynom.clone().derivative()),
+      new y(this.polynom.clone(), this.power.clone().subtract(1))
     ];
   }
   develop() {
@@ -2480,9 +2497,9 @@ class b {
     throw new Error("The power must be a natural number");
   }
   divide(t) {
-    if (t instanceof b && this.isSameAs(t))
+    if (t instanceof y && this.isSameAs(t))
       return this.power.subtract(t.power), this;
-    const e = new u(t);
+    const e = new l(t);
     if (this.isSameAs(e))
       return this.power.subtract(1), this;
     throw new Error("The two factors must be the same");
@@ -2491,7 +2508,7 @@ class b {
     return e ? this.polynom.evaluate(t, !0) ** this.power.value : this.polynom.evaluate(t).pow(this.power);
   }
   fromPolynom(t) {
-    return this.#e = new u(t), this.#i = new h(1), this;
+    return this.#e = new l(t), this.#i = new h(1), this;
   }
   hasVariable(t) {
     return this.polynom.hasVariable(t);
@@ -2507,15 +2524,15 @@ class b {
   }
   isSameAs(t) {
     let e;
-    return t instanceof b ? e = t.polynom : t instanceof u ? e = t : e = new u(t), this.polynom.isEqual(e);
+    return t instanceof y ? e = t.polynom : t instanceof l ? e = t : e = new l(t), this.polynom.isEqual(e);
   }
   isZero() {
     return this.polynom.isZero();
   }
   multiply(t) {
-    if (t instanceof b && this.isSameAs(t))
+    if (t instanceof y && this.isSameAs(t))
       return this.power.add(t.power), this;
-    const e = new u(t);
+    const e = new l(t);
     if (this.isSameAs(e))
       return this.power.add(1), this;
     throw new Error("The two factors must be the same");
@@ -2558,7 +2575,7 @@ class b {
   }
   tableOfSigns() {
     const t = this.power.clone().reduce(), e = this.polynom.tableOfSigns();
-    return t.isStrictlyNegative() && (e.signs = j(e.signs, "z", "d")), t.denominator % 2 === 0 ? e.signs = j(e.signs, "-", "h") : t.numerator % 2 === 0 && (e.signs = j(e.signs, "-", "+")), { roots: e.roots, signs: e.signs };
+    return t.isStrictlyNegative() && (e.signs = F(e.signs, "z", "d")), t.denominator % 2 === 0 ? e.signs = F(e.signs, "-", "h") : t.numerator % 2 === 0 && (e.signs = F(e.signs, "-", "+")), { roots: e.roots, signs: e.signs };
   }
   get variables() {
     return this.polynom.variables;
@@ -2572,17 +2589,39 @@ class b {
   zero() {
     return this.#e.zero(), this.#i.one(), this;
   }
+  static checkParseAsFactors(t) {
+    const e = H(t, "+");
+    if (e[0] === "" && e.shift(), e.length > 1) return !1;
+    const i = H(t, "-");
+    return i[0] === "" && i.shift(), !(i.length > 1);
+  }
+  static factorsFromString(t, e = !0) {
+    if (!y.checkParseAsFactors(t))
+      return [new y(t, e ? 1 : -1)];
+    const i = e ? 1 : -1, s = [], r = /\(([^)]+)\)(?:\^(-?[0-9]+(?:\/[0-9]+)?|\(-?[0-9]+(?:\/[0-9]+)?\)))?|([^(]+)/g;
+    for (const o of t.matchAll(r))
+      if (o[1] !== void 0) {
+        const a = (o[2] ?? "1").replace(/[()]/g, "");
+        s.push(
+          new y(
+            new l(o[1]),
+            new h(a).multiply(i)
+          )
+        );
+      } else o[3]?.trim() && s.push(new y(new l(o[3].trim()), new h(i)));
+    return s;
+  }
 }
 var D = /* @__PURE__ */ ((n) => (n[n.ROOT = 0] = "ROOT", n[n.POWER = 1] = "POWER", n))(D || {});
-class z {
+class P {
   #t;
   // Determine the letters in the linear asSystem, usually ['x', 'y']
   #e;
   constructor(...t) {
     return this.#t = [], this.#e = [], t.length > 0 && this.parse(...t), this;
   }
-  parse = (...t) => (this.#t = t.map((e) => new v(e)), this.#i(), this);
-  clone = () => new z().parse(...this.#t.map((t) => t.clone()));
+  parse = (...t) => (this.#t = t.map((e) => new x(e)), this.#i(), this);
+  clone = () => new P().parse(...this.#t.map((t) => t.clone()));
   get tex() {
     const t = this.clone().reorder();
     return this.buildTex(t.equations);
@@ -2595,10 +2634,10 @@ class z {
     if (t.some((r) => r.length !== i))
       throw new Error("All rows must have the same number of columns");
     const s = e.split("").splice(0, i - 1);
-    return new z(
+    return new P(
       ...t.map((r) => {
-        const o = new u(s.join(""), ...r);
-        return new v(o, 0);
+        const o = new l(s.join(""), ...r);
+        return new x(o, 0);
       })
     );
   }
@@ -2609,7 +2648,7 @@ class z {
     return `\\left( ${t.map((e) => e.tex).join(" ; ")} \\right)`;
   }
   add(t, e) {
-    if (t instanceof z) {
+    if (t instanceof P) {
       const i = t.equations.length;
       if (i !== this.#t.length)
         throw new Error("The number of equations must be the same");
@@ -2618,7 +2657,7 @@ class z {
     } else {
       if (e === void 0 || e < 0 || e >= this.#t.length)
         throw new Error("Index out of range");
-      const i = new v(t);
+      const i = new x(t);
       this.#t[e].add(i);
     }
     return this;
@@ -2722,7 +2761,7 @@ class z {
     const e = [], i = this.equations.map((s) => s.left.monomByLetter(t).coefficient.value);
     return i.forEach((s, r) => {
       for (let o = r + 1; o < i.length; o++) {
-        const a = x.lcm(s, i[o]), c = s < 0 ? -1 : 1;
+        const a = b.lcm(s, i[o]), c = s < 0 ? -1 : 1;
         e.push([
           {
             id: r,
@@ -2737,7 +2776,7 @@ class z {
     }), e.sort((s, r) => Math.abs(s[0].factor) + Math.abs(s[1].factor) - (Math.abs(r[0].factor) + Math.abs(r[1].factor)));
   }
   subtract(t, e) {
-    if (t instanceof z) {
+    if (t instanceof P) {
       const i = t.equations.length;
       if (i !== this.#t.length)
         throw new Error("The number of equations must be the same");
@@ -2746,7 +2785,7 @@ class z {
     } else {
       if (e === void 0 || e < 0 || e >= this.#t.length)
         throw new Error("Index out of range");
-      const i = new v(t);
+      const i = new x(t);
       this.#t[e].subtract(i);
     }
     return this;
@@ -2782,7 +2821,7 @@ class z {
     }), e);
   }
 }
-class qt {
+class $t {
   #t;
   /**
    *
@@ -2791,7 +2830,7 @@ class qt {
   constructor(t) {
     return this.#t = [], t !== void 0 && this.parse(t), this;
   }
-  parse = (t) => (this.#t = new G(S.SET).parse(t).rpn, this);
+  parse = (t) => (this.#t = new W(S.SET).parse(t).rpn, this);
   get tex() {
     const t = [];
     for (const e of this.#t)
@@ -2937,7 +2976,7 @@ class N {
   }
   parse(...t) {
     return this.#e = [], t.length === 0 ? this : (t.forEach((e) => {
-      e instanceof N ? this.#e.push(...e.factors.map((i) => i.clone())) : this.#e.push(new b(e));
+      e instanceof N ? this.#e.push(...e.factors.map((i) => i.clone())) : this.#e.push(new y(e));
     }), this);
   }
   clone() {
@@ -2962,14 +3001,14 @@ class N {
   static #i(t, e) {
     const i = Z(t), s = Z(e), o = Object.keys(i).filter((a) => Object.hasOwn(s, a)).map((a) => {
       const c = i[a].reduce((m, d) => m.add(d.power), new h("0")), f = s[a].reduce((m, d) => m.add(d.power), new h("0"));
-      return new b(a, h.min(c, f));
+      return new y(a, h.min(c, f));
     });
     return new N(...o);
   }
   static #s(t, e) {
     const i = Z(t), s = Z(e), o = [.../* @__PURE__ */ new Set([...Object.keys(i), ...Object.keys(s)])].map((a) => {
       const c = Object.hasOwn(i, a) ? i[a].reduce((m, d) => m.add(d.power), new h("0")) : new h(0), f = Object.hasOwn(s, a) ? s[a].reduce((m, d) => m.add(d.power), new h("0")) : new h(0);
-      return new b(a, h.max(c, f));
+      return new y(a, h.max(c, f));
     });
     return new N(...o);
   }
@@ -3000,12 +3039,12 @@ class N {
         c.multiply(a.clone().divide(i[f]));
       }), s = a;
     }
-    const r = N.gcd(...e), o = new u(0).add(
+    const r = N.gcd(...e), o = new l(0).add(
       ...e.map((a) => a.divide(r).reduce().develop().factors[0].polynom)
     ).reduce();
     return this.#e = [
       ...r.factors,
-      new b(o)
+      new y(o)
     ], s && this.divide(s), this.#e = this.#e.filter((a) => !a.power.isZero()), this;
   }
   get asPower() {
@@ -3035,7 +3074,7 @@ class N {
     return i !== void 0 && (this.#e = i.factors), this.add(...t);
   }
   develop() {
-    const t = new u("1"), e = new u("1");
+    const t = new l("1"), e = new l("1");
     return this.numerator.factors.forEach((i) => {
       t.multiply(i.develop());
     }), this.denominator.factors.forEach((i) => {
@@ -3054,7 +3093,7 @@ class N {
       const a = o.polynom.factorize(t);
       if (a.length > 1) {
         const c = o.power.clone();
-        e.push(...a.map((f) => new b(f, c)));
+        e.push(...a.map((f) => new y(f, c)));
       } else
         e.push(o.clone());
     });
@@ -3068,16 +3107,24 @@ class N {
     this.#e = t;
   }
   fromPolynom(t, e) {
-    if (this.#e = [new b(new u(t))], e) {
-      const i = new u(e);
-      if (i.isOne())
-        return this;
-      if (i.isZero())
-        throw new Error("Cannot divide by zero");
-      this.#e.push(new b(i, -1));
+    if (this.#e = [new y(new l(t))], e) {
+      const i = new l(e);
+      if (i.isOne()) return this;
+      if (i.isZero()) throw new Error("Cannot divide by zero");
+      this.#e.push(new y(i, -1));
     }
     return this;
   }
+  fromString(t) {
+    this.#e = [];
+    const [e, ...i] = H(t, "/");
+    if (e === "") throw new Error("Parsing a PolyFactor from a string requires a numerator");
+    if (i.length > 1) throw new Error('Parsing a PolyFactor from a string only allows max one signe "/"');
+    return i.length === 0 ? this.#e = y.factorsFromString(j(e), !0) : this.#e = [
+      ...y.factorsFromString(j(e), !0),
+      ...y.factorsFromString(j(i[0]), !1)
+    ], this;
+  }
   /**
    * Get the roots of the PolyFactor.
    */
@@ -3117,11 +3164,11 @@ class N {
     return new N(...this.#e.filter((t) => t.power.isPositive()));
   }
   one() {
-    return this.#e = [new b("1", "1")], this;
+    return this.#e = [new y("1", "1")], this;
   }
   opposite() {
     const t = this.#e.findIndex((e) => e.display === "(-1)");
-    return t >= 0 ? this.#e.splice(t, 1) : this.#e.push(new b("-1", "1")), this;
+    return t >= 0 ? this.#e.splice(t, 1) : this.#e.push(new y("-1", "1")), this;
   }
   pow(t) {
     return this.#e = this.#e.map((e) => e.pow(t)), this;
@@ -3133,7 +3180,7 @@ class N {
     const t = Z(this);
     return this.#e = Object.values(t).map((e) => {
       const i = e[0].polynom, s = e.reduce((r, o) => r.add(o.power), new h("0"));
-      return new b(i, s.reduce());
+      return new y(i, s.reduce());
     }).filter((e) => !e.power.isZero()), this;
   }
   root(t) {
@@ -3164,17 +3211,17 @@ class N {
     return this.add(...t.map((e) => e.opposite()));
   }
   tableOfSigns() {
-    const t = this.getZeroes(), e = t.map((r) => r.value), i = this.factorize().factors.map((r) => ({ factor: new b(r), ...r.tableOfSigns() }));
+    const t = this.getZeroes(), e = t.map((r) => r.value), i = this.factorize().factors.map((r) => ({ factor: new y(r), ...r.tableOfSigns() }));
     return i.forEach((r) => {
       const o = new Array(2 * t.length + 1).fill("");
       let a = r.signs.shift(), c = r.roots.shift();
       const f = o.map((m, d) => {
         if (d % 2 === 0)
           return a;
-        if (c === void 0 || c.value !== e[(d - 1) / 2])
+        if (c?.value !== e[(d - 1) / 2])
           return "t";
-        const y = r.signs.shift();
-        return a = r.signs.shift(), c = r.roots.shift(), y;
+        const v = r.signs.shift();
+        return a = r.signs.shift(), c = r.roots.shift(), v;
       });
       r.roots = t, r.signs = f;
     }), { signs: i.map((r) => [...r.signs]).reduce((r, o) => r.length === 0 ? o : (o.forEach((a, c) => {
@@ -3198,11 +3245,11 @@ class N {
     return this.#e.reduce((t, e) => t.concat(e.variables), []);
   }
   zero() {
-    return this.#e = [new b("0", "1")], this;
+    return this.#e = [new y("0", "1")], this;
   }
   #r() {
     let t, e = [];
-    return this.#t === D.ROOT ? (t = this.numerator.factors, e = this.denominator.factors) : t = this.#e, t.length === 0 && (t = [new b("1")]), { num: t, den: e };
+    return this.#t === D.ROOT ? (t = this.numerator.factors, e = this.denominator.factors) : t = this.#e, t.length === 0 && (t = [new y("1")]), { num: t, den: e };
   }
 }
 function Z(n) {
@@ -3212,7 +3259,7 @@ function Z(n) {
     const c = a.polynom.display;
     return Object.hasOwn(o, c) ? o[c].push(a) : o[c] = [a], o;
   }, {}), { numerator: s, denominator: r } = t.divide(e).reduce();
-  return s !== 1 && (i[s.toString()] = [new b(s, 1)]), r !== 1 && (i[r.toString()] = [new b(r, -1)]), i;
+  return s !== 1 && (i[s.toString()] = [new y(s, 1)]), r !== 1 && (i[r.toString()] = [new y(r, -1)]), i;
 }
 class B {
   #t = null;
@@ -3277,7 +3324,7 @@ class B {
   }
   characteristic_polynom(t) {
     return t ??= "k", this.clone().subtract(
-      new B(this.dimension.rows).one().multiply(new u(t))
+      new B(this.dimension.rows).one().multiply(new l(t))
     ).determinant();
   }
   cofactor(t, e) {
@@ -3287,7 +3334,7 @@ class B {
     }), i.determinant().multiply((-1) ** (t + e));
   }
   get cols() {
-    const t = Array.from({ length: this.dimension.cols }, () => Array.from({ length: this.dimension.rows }, () => new u()));
+    const t = Array.from({ length: this.dimension.cols }, () => Array.from({ length: this.dimension.rows }, () => new l()));
     return this.forEach((e, i, s) => {
       t[s][i] = e;
     }), t;
@@ -3295,7 +3342,7 @@ class B {
   determinant() {
     if (!this.isSquare())
       throw new Error("Matrix is not square");
-    const t = new u();
+    const t = new l();
     return this.#i.length === 1 ? this.#i[0][0].clone() : (this.values[0].forEach((e, i) => {
       const s = this.cofactor(0, i);
       t.add(e.clone().multiply(s));
@@ -3318,14 +3365,14 @@ class B {
     });
   }
   fromDimensions(t, e) {
-    return this.#i = Array.from({ length: t }, () => Array.from({ length: e }, () => new u())), this;
+    return this.#i = Array.from({ length: t }, () => Array.from({ length: e }, () => new l())), this;
   }
   fromString(t) {
     if (t.startsWith("((") && t.endsWith("))"))
       return this.fromString(t.substring(1, t.length - 1));
     const e = t.split("),(");
     return this.#i = e.map((i, s) => s === 0 ? i.substring(1).split(",") : s === e.length - 1 ? i.substring(0, i.length - 1).split(",") : i.split(",")).map(
-      (i) => i.map((s) => new u(s))
+      (i) => i.map((s) => new l(s))
     ), this;
   }
   fromValues(t) {
@@ -3336,7 +3383,7 @@ class B {
     return t.forEach((i) => {
       const s = [];
       i.forEach((r) => {
-        s.push(new u(r));
+        s.push(new l(r));
       }), this.#i.push(s);
     }), this;
   }
@@ -3347,7 +3394,7 @@ class B {
       throw new Error("Each vectors must be the same dimension");
     return this.fromDimensions(t[0].dimension, t.length), t.forEach((i, s) => {
       i.array.forEach((r, o) => {
-        this.#i[o][s] = new u(r);
+        this.#i[o][s] = new l(r);
       });
     }), this;
   }
@@ -3397,7 +3444,7 @@ class B {
         throw new Error("Cannot multiply a matrix with incompatibles dimensions");
       const e = new B(this.dimension.rows, t.dimension.cols);
       return e.forEach((i, s, r) => {
-        const o = this.rows[s], a = t.cols[r], c = new u();
+        const o = this.rows[s], a = t.cols[r], c = new l();
         o.forEach((f, m) => {
           c.add(f.clone().multiply(a[m]));
         }), e.setValue(s, r, c);
@@ -3421,7 +3468,7 @@ class B {
     return this.#e = !0, this;
   }
   pow(t) {
-    return rt(this, t);
+    return nt(this, t);
   }
   reduce() {
     throw new Error("Not yet implemented");
@@ -3433,7 +3480,7 @@ class B {
     const { rows: s, cols: r } = this.dimension;
     if (t < 0 || t >= s || e < 0 || e >= r)
       throw new Error(`${t}x${e} is out of range (${s}x${r})`);
-    return this.#i[t][e] = new u(i), this;
+    return this.#i[t][e] = new l(i), this;
   }
   subtract(t) {
     if (!this.canBeAdded(t))
@@ -3457,12 +3504,12 @@ class B {
     return this.forEach((t) => t.zero()), this;
   }
 }
-function $t(n, t) {
+function kt(n, t) {
   return n.dimension === t.dimension && n.array.every(
     (e, i) => t.array[i].isEqual(e)
   );
 }
-function kt(n, t) {
+function Mt(n, t) {
   if (n.dimension !== t.dimension)
     return !1;
   const e = t.array[0].value / n.array[0].value;
@@ -3470,13 +3517,13 @@ function kt(n, t) {
     (i, s) => t.array[s].value === i.value * e
   );
 }
-function Mt(n, t) {
+function Bt(n, t) {
   return n.dimension !== t.dimension ? new h().invalid() : n.array.reduce(
     (e, i, s) => e.add(i.clone().multiply(t.array[s])),
     new h(0)
   );
 }
-function jt(...n) {
+function Ft(...n) {
   if (n.some((t) => t.dimension !== n[0].dimension))
     throw new Error("All vectors must have the same dimension");
   if (n[0].dimension !== n.length)
@@ -3489,7 +3536,7 @@ function jt(...n) {
     )
   ).add(n[0].array[2].clone().multiply(n[1].array[0].clone().multiply(n[2].array[1]).subtract(n[1].array[1].clone().multiply(n[2].array[0]))));
 }
-class P {
+class z {
   #t = [];
   #e;
   constructor(...t) {
@@ -3552,13 +3599,13 @@ class P {
   }
   zero = () => (this.#t.forEach((t) => t.zero()), this.#e?.(), this);
 }
-class w extends P {
+class w extends z {
   constructor(...t) {
     super(), t.length > 0 && this.parse(...t);
   }
   parse(...t) {
     if (t.length === 1) {
-      if (t[0] instanceof P)
+      if (t[0] instanceof z)
         return this.array = t[0].copy(), this;
       if (typeof t[0] == "string")
         return this.fromString(t[0]), this;
@@ -3605,7 +3652,7 @@ class w extends P {
     }), this;
   }
 }
-class g extends P {
+class g extends z {
   constructor(...t) {
     return super(), t.length > 0 && this.parse(...t), this;
   }
@@ -3615,7 +3662,7 @@ class g extends P {
     if (t.length === 0)
       throw new Error("Invalid value");
     if (t.length === 1) {
-      if (t[0] instanceof P)
+      if (t[0] instanceof z)
         return this.array = t[0].copy(), this;
       if (typeof t[0] == "string")
         return this.fromString(t[0]);
@@ -3623,7 +3670,7 @@ class g extends P {
     }
     if (t.length === 2) {
       const [e, i] = t;
-      if (e instanceof P && i instanceof P) {
+      if (e instanceof z && i instanceof z) {
         if (e.dimension !== i.dimension)
           throw new Error("Vectors must have the same dimension");
         return this.array = i.array.map((s, r) => s.clone().subtract(e.array[r])), this;
@@ -3663,12 +3710,12 @@ class g extends P {
   // ------------------------------------------
   // Creation / parsing functions
   divideByScalar = (t) => this.multiplyByScalar(new h(t).inverse());
-  dot = (t) => Mt(this, t);
+  dot = (t) => Bt(this, t);
   fromString(t) {
     return t.startsWith("((") && t.endsWith("))") ? super.fromString(t.slice(1, -1)) : super.fromString(t);
   }
-  isColinearTo = (t) => kt(this, t);
-  isEqual = (t) => $t(this, t);
+  isColinearTo = (t) => Mt(this, t);
+  isEqual = (t) => kt(this, t);
   isNormalTo = (t) => this.dot(t).isZero();
   // ------------------------------------------
   get isNull() {
@@ -3699,7 +3746,7 @@ class g extends P {
   one = () => (this.zero(), this.x.one(), this);
   opposite = () => (this.array.forEach((t) => t.opposite()), this);
   simplify = () => {
-    const t = x.lcm(...this.array.map((i) => i.denominator)), e = x.gcd(...this.array.map((i) => i.numerator));
+    const t = b.lcm(...this.array.map((i) => i.denominator)), e = b.gcd(...this.array.map((i) => i.numerator));
     return this.multiplyByScalar(new h(t, e)), this.x.isNegative() && this.opposite(), this;
   };
   subtract = (t) => this.add(t.clone().opposite());
@@ -3711,8 +3758,8 @@ class g extends P {
     return t === 0 ? this : this.divideByScalar(t);
   };
 }
-var V = /* @__PURE__ */ ((n) => (n.None = "none", n.Parallel = "parallel", n.Perpendicular = "perpendicular", n.Tangent = "tangent", n))(V || {}), H = /* @__PURE__ */ ((n) => (n.None = "none", n.Parallel = "parallel", n.Perpendicular = "perpendicular", n.Tangent = "tangent", n))(H || {});
-function nt(n = 0.5) {
+var V = /* @__PURE__ */ ((n) => (n.None = "none", n.Parallel = "parallel", n.Perpendicular = "perpendicular", n.Tangent = "tangent", n))(V || {}), K = /* @__PURE__ */ ((n) => (n.None = "none", n.Parallel = "parallel", n.Perpendicular = "perpendicular", n.Tangent = "tangent", n))(K || {});
+function ot(n = 0.5) {
   return Math.random() < n;
 }
 function O(n, t, e) {
@@ -3730,23 +3777,23 @@ function O(n, t, e) {
   return i;
 }
 function A(n, t) {
-  return t === !1 ? nt() ? O(1, n) : -O(1, n) : O(-n, n);
+  return t === !1 ? ot() ? O(1, n) : -O(1, n) : O(-n, n);
 }
-function Bt(n, t) {
-  const e = x.pythagoreanTripletsWithTarget(n).filter((i) => t === !0 || !i.includes(0));
-  return e.length === 0 ? null : W(e);
+function St(n, t) {
+  const e = b.pythagoreanTripletsWithTarget(n).filter((i) => t === !0 || !i.includes(0));
+  return e.length === 0 ? null : X(e);
 }
-function St(n) {
-  let t = x.primes();
-  return n !== void 0 && (t = t.filter((e) => e < n)), W(t);
+function It(n) {
+  let t = b.primes();
+  return n !== void 0 && (t = t.filter((e) => e < n)), X(t);
 }
-function It(n, t) {
-  return t === void 0 && (t = 1), n.length <= 0 ? Object.values(n) : ot(n).slice(0, t);
+function Pt(n, t) {
+  return t === void 0 && (t = 1), n.length <= 0 ? Object.values(n) : ht(n).slice(0, t);
 }
-function W(n) {
+function X(n) {
   return n.length === 0 ? null : n[O(0, n.length - 1)];
 }
-function ot(n) {
+function ht(n) {
   const t = Object.values(n);
   for (let e = t.length - 1; e > 0; e--) {
     const i = Math.floor(Math.random() * (e + 1)), s = t[e];
@@ -3786,11 +3833,11 @@ class E {
     if (t.length === 1) {
       if (t[0] instanceof E)
         return this.fromCoefficient(t[0].a, t[0].b, t[0].c);
-      if (t[0] instanceof v)
+      if (t[0] instanceof x)
         return this.fromEquation(t[0]);
       if (typeof t[0] == "string")
         try {
-          const e = new v(t[0]);
+          const e = new x(t[0]);
           return this.parse(e);
         } catch (e) {
           return console.warn(e), this;
@@ -3817,13 +3864,13 @@ class E {
       case 0:
         return this.getEquation().reorder().tex;
       case 2:
-        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new u().parse("x", this.slope, this.height).tex;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new l().parse("x", this.slope, this.height).tex;
       case 3:
       case 4: {
         const e = this.d.clone().simplify();
         return t === 3 ? `${g.asTex("x", "y")} = ${g.asTex(this.#t.x.tex, this.#t.y.tex)} + k\\cdot ${g.asTex(e.x.tex, e.y.tex)}` : `\\left\\{\\begin{aligned}
-	x &= ${new u(this.#t.x).add(new p(e.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\
-	y &= ${new u(this.#t.y).add(new p(e.y).multiply(new p("k"))).reorder("k", !0).tex}
+	x &= ${new l(this.#t.x).add(new p(e.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\
+	y &= ${new l(this.#t.y).add(new p(e.y).multiply(new p("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`;
       }
       default: {
@@ -3838,13 +3885,13 @@ class E {
       case 0:
         return this.getEquation().reorder().display;
       case 2:
-        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new u().parse("x", this.slope, this.height).display;
+        return this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new l().parse("x", this.slope, this.height).display;
       case 3: {
         const e = this.d.clone().simplify();
         return `((x,y))=((${this.#t.x.display},${this.#t.y.display}))+k((${e.x.display},${e.y.display}))`;
       }
       case 4: {
-        const e = this.d.clone().simplify(), i = new u(this.#t.x).add(new p(e.x).multiply(new p("k"))).reorder("k", !0), s = new u(this.#t.y).add(new p(e.y).multiply(new p("k"))).reorder("k", !0);
+        const e = this.d.clone().simplify(), i = new l(this.#t.x).add(new p(e.x).multiply(new p("k"))).reorder("k", !0), s = new l(this.#t.y).add(new p(e.y).multiply(new p("k"))).reorder("k", !0);
         return `{(x,=,${i.display}),(y,=,${s.display}):}`;
       }
       default: {
@@ -3913,7 +3960,7 @@ class E {
   }
   fromCoefficient(t, e, i) {
     this.#e = new h(t), this.#i = new h(e), this.#s = new h(i);
-    const s = [this.#e, this.#i, this.#s].every((o) => o.exact) ? x.lcm(this.#e.denominator, this.#i.denominator, this.#s.denominator) : 1;
+    const s = [this.#e, this.#i, this.#s].every((o) => o.exact) ? b.lcm(this.#e.denominator, this.#i.denominator, this.#s.denominator) : 1;
     if (s > 1 && (this.#e.multiply(s).reduce(), this.#i.multiply(s).reduce(), this.#s.multiply(s).reduce()), this.#i.isZero())
       return this.#t = new g(this.#s.clone().divide(this.#e).opposite(), 0), this;
     for (let o = 0; o < this.#i.value; o++) {
@@ -3961,15 +4008,15 @@ class E {
   }
   // ------------------------------------------
   getEquation() {
-    return new v(new u().parse("xy", this.#e, this.#i, this.#s), new u("0")).simplify();
+    return new x(new l().parse("xy", this.#e, this.#i, this.#s), new l("0")).simplify();
   }
   getValueAtX = (t) => {
     const e = this.getEquation().isolate("y"), i = new h(t);
-    return e instanceof v ? e.right.evaluate({ x: i }) : new h().invalid();
+    return e instanceof x ? e.right.evaluate({ x: i }) : new h().invalid();
   };
   getValueAtY = (t) => {
     const e = this.getEquation().isolate("x"), i = new h(t);
-    return e instanceof v ? e.right.evaluate({ y: i }) : new h().invalid();
+    return e instanceof x ? e.right.evaluate({ y: i }) : new h().invalid();
   };
   get height() {
     return this.#s.clone().opposite().divide(this.#i);
@@ -4021,7 +4068,7 @@ class E {
     return new w(e);
   };
   simplify = () => {
-    const t = x.lcm(this.#e.denominator, this.#i.denominator, this.#s.denominator), e = x.gcd(this.#e.numerator, this.#i.numerator, this.#s.numerator);
+    const t = b.lcm(this.#e.denominator, this.#i.denominator, this.#s.denominator), e = b.gcd(this.#e.numerator, this.#i.numerator, this.#s.numerator);
     return this.fromCoefficient(
       this.#e.clone().multiply(t).divide(e),
       this.#i.clone().multiply(t).divide(e),
@@ -4264,7 +4311,7 @@ class L {
   }
   #c(t, e, i) {
     const s = (e ** 2 + i ** 2 - t ** 2) / (2 * e * i);
-    return this.#n ? Math.acos(s) : x.numberCorrection(Math.acos(s) * 180 / Math.PI);
+    return this.#n ? Math.acos(s) : b.numberCorrection(Math.acos(s) * 180 / Math.PI);
   }
   /**
    * Get the Point class for the given name
@@ -4300,7 +4347,7 @@ class U {
     t.length > 0 && this.parse(...t);
   }
   parse(...t) {
-    return typeof t[0] == "string" ? this.fromString(t[0]) : t[0] instanceof v ? this.fromEquation(t[0]) : t[0] instanceof U ? this.copy(t[0]) : t.length === 2 && t[0] instanceof w && t[1] instanceof w ? this.fromCenterPoint(t[0], t[1]) : t.length >= 2 && t[0] instanceof w && (t[1] instanceof h || typeof t[1] == "number") ? this.fromCenterRadius(
+    return typeof t[0] == "string" ? this.fromString(t[0]) : t[0] instanceof x ? this.fromEquation(t[0]) : t[0] instanceof U ? this.copy(t[0]) : t.length === 2 && t[0] instanceof w && t[1] instanceof w ? this.fromCenterPoint(t[0], t[1]) : t.length >= 2 && t[0] instanceof w && (t[1] instanceof h || typeof t[1] == "number") ? this.fromCenterRadius(
       t[0],
       t[1],
       typeof t[2] == "boolean" ? t[2] : !1
@@ -4338,7 +4385,7 @@ class U {
     return this.#t ?? new w();
   }
   get equation() {
-    return this.#e?.clone() ?? new v("0=0");
+    return this.#e?.clone() ?? new x("0=0");
   }
   fromCenterPoint(t, e) {
     return this.#t = t.clone(), this.#s = new g(this.#t, e).normSquare, this.#r(), this;
@@ -4367,10 +4414,10 @@ class U {
     );
   }
   fromString(t) {
-    return this.fromEquation(new v(t));
+    return this.fromEquation(new x(t));
   }
   getPointsOnCircle() {
-    const t = x.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), e = [];
+    const t = b.pythagoreanTripletsWithTarget(this.squareRadius.value, !0), e = [];
     return t.forEach((i) => {
       for (const s of [[1, 1], [-1, 1], [-1, -1], [1, -1]]) {
         const r = this.center.x.clone().add(s[0] * i[0]), o = this.center.y.clone().add(s[1] * i[1]);
@@ -4401,7 +4448,7 @@ class U {
     return [
       new w(f.x, f.y),
       new w(m.x, m.y)
-    ].sort((d, y) => i.x.isZero() ? i.y.isPositive() ? d.y.value - y.y.value : y.y.value - d.y.value : i.x.isPositive() ? d.x.value - y.x.value : y.x.value - d.x.value);
+    ].sort((d, v) => i.x.isZero() ? i.y.isPositive() ? d.y.value - v.y.value : v.y.value - d.y.value : i.x.isPositive() ? d.x.value - v.x.value : v.x.value - d.x.value);
   }
   get radius() {
     return new T().from(2, this.#s ?? 0);
@@ -4425,9 +4472,9 @@ class U {
   }
   tangents = (t) => t instanceof h ? this.#c(t) : this.isPointOnCircle(t) ? this.#o(t) : this.#t !== null && this.#t.distanceTo(t).value > this.radius.value ? this.#a(t) : [];
   #r() {
-    this.#e = new v(
-      new u(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
-      new u(this.squareRadius.display)
+    this.#e = new x(
+      new l(`(x-(${this.center.x.display}))^2+(y-(${this.center.y.display}))^2`),
+      new l(this.squareRadius.display)
     ).moveLeft();
   }
   #n() {
@@ -4438,10 +4485,10 @@ class U {
     return [new E().fromPointAndNormal(t, e)];
   };
   #a = (t) => {
-    const e = this.center.x.clone().subtract(t.x), i = this.center.y.clone().subtract(t.y), s = new u("x"), r = new u("x^2+1");
-    return s.multiply(e).subtract(i).pow(2), r.multiply(this.squareRadius), new v(s, r).solve().map((c) => {
+    const e = this.center.x.clone().subtract(t.x), i = this.center.y.clone().subtract(t.y), s = new l("x"), r = new l("x^2+1");
+    return s.multiply(e).subtract(i).pow(2), r.multiply(this.squareRadius), new x(s, r).solve().map((c) => {
       let f;
-      const m = new v("y", "x");
+      const m = new x("y", "x");
       return c.exact ? (f = t.x.clone().opposite().multiply(c.fraction).add(t.y), m.right.multiply(c.fraction).add(f)) : (f = t.x.clone().opposite().multiply(c.value).add(t.y), m.right.multiply(c.value).add(f)), new E(m);
     });
   };
@@ -4450,10 +4497,10 @@ class U {
     return [new E(e, i, a), new E(e, i, c)];
   };
 }
-class X {
-  static PARALLEL = H.Parallel;
+class Y {
+  static PARALLEL = K.Parallel;
   // A line is defined as the canonical form
-  static PERPENDICULAR = H.Perpendicular;
+  static PERPENDICULAR = K.Perpendicular;
   // ax + by + c = 0
   #t = new w();
   #e = new g();
@@ -4465,11 +4512,11 @@ class X {
     return {
       parametric: `${g.asTex("x", "y", "z")} = ${g.asTex(this.#t.x.tex, this.#t.y.tex, this.#t.z.tex)} + k\\cdot ${g.asTex(this.#e.x.tex, this.#e.y.tex, this.#e.z.tex)}`,
       system: `\\left\\{\\begin{aligned}
-    x &= ${new u(this.#t.x).add(new p(this.#e.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\ 
-    y &= ${new u(this.#t.y).add(new p(this.#e.y).multiply(new p("k"))).reorder("k", !0).tex}\\\\
-    z &= ${new u(this.#t.z).add(new p(this.#e.z).multiply(new p("k"))).reorder("k", !0).tex}
+    x &= ${new l(this.#t.x).add(new p(this.#e.x).multiply(new p("k"))).reorder("k", !0).tex}\\\\ 
+    y &= ${new l(this.#t.y).add(new p(this.#e.y).multiply(new p("k"))).reorder("k", !0).tex}\\\\
+    z &= ${new l(this.#t.z).add(new p(this.#e.z).multiply(new p("k"))).reorder("k", !0).tex}
 \\end{aligned}\\right.`,
-      cartesian: `\\frac{ ${new u("x", 1, this.#t.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new u("y", 1, this.#t.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new u("z", 1, this.#t.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
+      cartesian: `\\frac{ ${new l("x", 1, this.#t.x.clone().opposite()).tex} }{ ${this.direction.x.tex} } = \\frac{ ${new l("y", 1, this.#t.y.clone().opposite()).tex} }{ ${this.direction.y.tex} } = \\frac{ ${new l("z", 1, this.#t.z.clone().opposite()).tex} }{ ${this.direction.z.tex} }`
     };
   }
   get display() {
@@ -4507,7 +4554,7 @@ class X {
   // Mathematical operations
   hitSegment(t, e) {
     const i = this.intersection(
-      new X(t, e)
+      new Y(t, e)
     );
     return i.hasIntersection ? i.point.x.value >= Math.min(t.x.value, e.x.value) && i.point.x.value <= Math.max(t.x.value, e.x.value) && i.point.y.value >= Math.min(t.y.value, e.y.value) && i.point.y.value <= Math.max(t.y.value, e.y.value) && i.point.z.value >= Math.min(t.z.value, e.z.value) && i.point.z.value <= Math.max(t.z.value, e.z.value) : !1;
   }
@@ -4559,7 +4606,7 @@ class X {
     throw new Error("Method not implemented.");
   };
 }
-class tt {
+class et {
   #t = new g(0, 0, 1);
   #e = new w(0, 0, 0);
   constructor(t) {
@@ -4593,22 +4640,22 @@ class tt {
     }
   }
   get tex() {
-    return new v(
-      new u("xyz", this.a, this.b, this.c, this.d),
-      new u(0)
+    return new x(
+      new l("xyz", this.a, this.b, this.c, this.d),
+      new l(0)
     ).reduce().tex;
   }
   get display() {
-    return new v(
-      new u("xyz", this.a, this.b, this.c, this.d),
-      new u(0)
+    return new x(
+      new l("xyz", this.a, this.b, this.c, this.d),
+      new l(0)
     ).reduce().display;
   }
   get a() {
     return this.#t.x;
   }
   angle(t, e, i) {
-    if (t instanceof tt)
+    if (t instanceof et)
       return this.normal.angle(t.normal, e, i);
     let s;
     if (t instanceof g) {
@@ -4656,7 +4703,7 @@ class tt {
     this.#e = new w(t);
   }
 }
-var ht = /* @__PURE__ */ ((n) => (n[n.INTERIOR = 0] = "INTERIOR", n[n.EXTERIOR = 1] = "EXTERIOR", n[n.SECANT = 2] = "SECANT", n[n.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", n[n.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", n[n.SUPERPOSED = 5] = "SUPERPOSED", n[n.CONCENTRIC = 6] = "CONCENTRIC", n))(ht || {});
+var at = /* @__PURE__ */ ((n) => (n[n.INTERIOR = 0] = "INTERIOR", n[n.EXTERIOR = 1] = "EXTERIOR", n[n.SECANT = 2] = "SECANT", n[n.TANGENT_INSIDE = 3] = "TANGENT_INSIDE", n[n.TANGENT_OUTSIDE = 4] = "TANGENT_OUTSIDE", n[n.SUPERPOSED = 5] = "SUPERPOSED", n[n.CONCENTRIC = 6] = "CONCENTRIC", n))(at || {});
 class zt {
   #t = void 0;
   #e = void 0;
@@ -4666,7 +4713,7 @@ class zt {
     return t && e && (this.#t = t, this.#e = new h(e).clone().pow(2), this.#n()), this;
   }
   fromEquation(t) {
-    const e = new v(t).moveLeft().reduce(), i = ["x", "y", "z"];
+    const e = new x(t).moveLeft().reduce(), i = ["x", "y", "z"];
     if (i.some((r) => e.degree(r).value !== 2))
       return this.makeUndefined();
     const s = e.left.monomByDegree(2, "x").coefficient;
@@ -4729,7 +4776,7 @@ class zt {
       if (this.center[s].isZero())
         e.push(`${s}^2`);
       else {
-        const r = new u(s).subtract(this.center[s]);
+        const r = new l(s).subtract(this.center[s]);
         e.push(
           t ? `\\(${r.tex}\\)^2` : `(${r.display})^2`
         );
@@ -4737,16 +4784,16 @@ class zt {
     }), e.join("+") + "=" + (t ? this.squareRadius.tex : this.squareRadius.display);
   };
   #n() {
-    this.#i = new v(
-      new u("x").subtract(this.center.x).pow(2).add(
-        new u("y").subtract(this.center.y).pow(2)
+    this.#i = new x(
+      new l("x").subtract(this.center.x).pow(2).add(
+        new l("y").subtract(this.center.y).pow(2)
       ).add(
-        new u("z").subtract(this.center.z).pow(2)
+        new l("z").subtract(this.center.z).pow(2)
       ),
-      new u(this.squareRadius)
+      new l(this.squareRadius)
     ).reduce();
   }
-  static RELATIVE_POSITION = ht;
+  static RELATIVE_POSITION = at;
   relativePosition = (t) => {
     const e = this.center.distanceTo(t.center).value, i = this.radius.value, s = t.radius.value;
     return e > i + s ? 1 : e === i + s ? 4 : e === 0 ? i === s ? 5 : 6 : e === Math.abs(i - s) ? 3 : e < Math.abs(i - s) ? 0 : 2;
@@ -4757,7 +4804,7 @@ class zt {
     z: t.z
   }) ?? !1;
 }
-function F(n) {
+function G(n) {
   const t = Object.assign(
     {
       negative: !0,
@@ -4777,7 +4824,7 @@ function F(n) {
   }
   return t.reduced ? e.reduce() : e;
 }
-function at(n) {
+function ct(n) {
   const t = Object.assign(
     {
       letters: "x",
@@ -4787,7 +4834,7 @@ function at(n) {
     },
     n
   ), e = new p();
-  if (e.coefficient = F({
+  if (e.coefficient = G({
     zero: t.zero,
     reduced: !0,
     natural: !t.fraction
@@ -4795,14 +4842,14 @@ function at(n) {
     for (const i of t.letters.split(""))
       e.setLetter(i, 0);
     for (let i = 0; i < t.degree; i++) {
-      const s = W(t.letters.split(""));
+      const s = X(t.letters.split(""));
       e.setLetter(s, e.degree(s).clone().add(1));
     }
   } else
     e.setLetter(t.letters, t.degree);
   return e;
 }
-const ct = {
+const lt = {
   letters: "x",
   degree: 2,
   fraction: !1,
@@ -4814,18 +4861,18 @@ const ct = {
   commonConstant: !1,
   positive: !0
 };
-function et(n) {
+function it(n) {
   const t = Object.assign(
     {},
-    ct,
+    lt,
     n
   );
-  if (t.factorable) return Pt(t);
-  const e = new u().empty();
+  if (t.factorable) return Rt(t);
+  const e = new l().empty();
   let i;
   const s = t.degree ?? 2;
   for (let r = s; r >= 0; r--)
-    i = at({
+    i = ct({
       letters: t.letters,
       degree: r,
       fraction: t.fraction,
@@ -4838,22 +4885,22 @@ function et(n) {
     }
   return e.reduce();
 }
-function Pt(n) {
+function Rt(n) {
   const t = Object.assign(
-    ct,
+    lt,
     n
   ), e = { ...t };
   e.degree = 1, e.factorable = !1;
   const i = [], s = t.degree ?? 2;
   for (; i.length < s; )
-    i.push(et(e));
+    i.push(it(e));
   if (n?.commonConstant !== !1) {
     let r = A(10, !1);
-    n?.commonConstant === !0 && (r === 1 || r === -1) && (r *= O(2, 5)), r !== 1 && r !== -1 && i.unshift(new u(r));
+    n?.commonConstant === !0 && (r === 1 || r === -1) && (r *= O(2, 5)), r !== 1 && r !== -1 && i.unshift(new l(r));
   }
-  return u.xMultiply(...i);
+  return l.xMultiply(...i);
 }
-function Rt(n) {
+function Zt(n) {
   const t = Object.assign(
     {
       letters: "x",
@@ -4873,9 +4920,9 @@ function Rt(n) {
       }
     },
     n
-  ), e = new u().one();
+  ), e = new l().one();
   for (let i = 0; i < t.degree; i++) {
-    const s = et({
+    const s = it({
       degree: 1,
       unit: t.unit,
       fraction: t.fraction,
@@ -4884,9 +4931,9 @@ function Rt(n) {
     });
     e.multiply(s);
   }
-  return new v(e, 0);
+  return new x(e, 0);
 }
-function K(n) {
+function J(n) {
   const t = Object.assign(
     {
       axis: !0,
@@ -4895,10 +4942,10 @@ function K(n) {
       quadrant: null
     },
     n
-  ), e = t.axis === "x", i = t.axis === "y", s = t.fraction ? F({ max: t.max, zero: e }) : new h(A(t.max, e)), r = t.fraction ? F({ max: t.max, zero: i }) : new h(A(t.max, i));
+  ), e = t.axis === "x", i = t.axis === "y", s = t.fraction ? G({ max: t.max, zero: e }) : new h(A(t.max, e)), r = t.fraction ? G({ max: t.max, zero: i }) : new h(A(t.max, i));
   return Number(t.quadrant) === 1 && (s.abs(), r.abs()), Number(t.quadrant) === 2 && (s.isPositive() && s.opposite(), r.isNegative() && r.opposite()), Number(t.quadrant) === 3 && (s.isPositive() && s.opposite(), r.isPositive() && r.opposite()), Number(t.quadrant) === 4 && (s.isNegative() && s.opposite(), r.isPositive() && r.opposite()), new w(s, r);
 }
-function Zt(n) {
+function Dt(n) {
   const t = Object.assign(
     {
       center: {
@@ -4908,11 +4955,11 @@ function Zt(n) {
       pointsOnCircle: 8
     },
     n
-  ), e = K(t.center);
+  ), e = J(t.center);
   let i, s;
   return t.pointsOnCircle === 8 ? (i = O(1, 3), s = i ** 2 + (i + 1) ** 2) : s = O(1, 20), new U(e, s, !0);
 }
-function Dt(n) {
+function Vt(n) {
   const t = Object.assign(
     {
       A: {
@@ -4926,7 +4973,7 @@ function Dt(n) {
     e.x = A(10, t.allow?.vertical ?? !0), e.y = A(10, t.allow?.horizontal ?? !0);
   return t.slope === 1 ? e.x.sign() !== e.y.sign() && e.y.opposite() : t.slope === -1 && e.x.sign() !== e.y.sign() && e.y.opposite(), new E().fromPointAndDirection(new g(t.A.x, t.A.y), e);
 }
-function Vt(n) {
+function Lt(n) {
   const t = Object.assign(
     {
       A: {
@@ -4942,83 +4989,83 @@ function Vt(n) {
     },
     n
   ), e = new w(t.A.x, t.A.y, t.A.z), i = new g(t.direction.x, t.direction.y, t.direction.z);
-  return new X(e, i);
+  return new Y(e, i);
 }
-const Lt = {
-  equation: (n) => Rt(n),
-  polynom: (n) => et(n),
-  monom: (n) => at(n),
-  fraction: (n) => F(n),
+const Ut = {
+  equation: (n) => Zt(n),
+  polynom: (n) => it(n),
+  monom: (n) => ct(n),
+  fraction: (n) => G(n),
   number: (n, t, e) => O(n, t, e),
   numberSym: (n, t) => A(n, t),
-  prime: (n) => St(n),
-  triplet: (n, t) => Bt(n, t),
-  bool: (n) => nt(n),
-  array: (n, t) => It(n, t),
-  item: (n) => W(n),
-  shuffle: (n) => ot(n),
-  line: (n) => Dt(n),
-  line3: (n) => Vt(n),
-  vector: (n) => K(n),
-  point: (n) => new w(K(n)),
-  circle: (n) => Zt(n)
-}, Ft = {
-  Numeric: x,
+  prime: (n) => It(n),
+  triplet: (n, t) => St(n, t),
+  bool: (n) => ot(n),
+  array: (n, t) => Pt(n, t),
+  item: (n) => X(n),
+  shuffle: (n) => ht(n),
+  line: (n) => Vt(n),
+  line3: (n) => Lt(n),
+  vector: (n) => J(n),
+  point: (n) => new w(J(n)),
+  circle: (n) => Dt(n)
+}, Gt = {
+  Numeric: b,
   Fraction: h,
   Root: T,
   Monom: p,
-  Polynom: u,
-  Equation: v,
+  Polynom: l,
+  Equation: x,
   Matrix: B,
-  LinearSystem: z,
-  Factor: b,
+  LinearSystem: P,
+  Factor: y,
   PolyFactor: N,
-  LogicalSet: qt,
-  Random: Lt,
+  LogicalSet: $t,
+  Random: Ut,
   Geometry: {
     Vector: g,
     Point: w,
     Line: E,
     Triangle: L,
     Circle: U,
-    Line3: X,
-    Plane3: tt,
+    Line3: Y,
+    Plane3: et,
     Sphere3: zt
   },
-  NumExp: Ct
+  NumExp: qt
 };
 export {
   U as Circle,
-  v as Equation,
+  x as Equation,
   R as EquationSolver,
   D as FACTOR_DISPLAY,
-  xt as FRAC_TYPE,
-  b as Factor,
+  bt as FRAC_TYPE,
+  y as Factor,
   h as Fraction,
   E as Line,
-  X as Line3,
-  z as LinearSystem,
-  qt as LogicalSet,
+  Y as Line3,
+  P as LinearSystem,
+  $t as LogicalSet,
   B as Matrix,
   p as Monom,
-  Ct as NumExp,
-  x as Numeric,
-  tt as Plane3,
+  qt as NumExp,
+  b as Numeric,
+  et as Plane3,
   w as Point,
   N as PolyFactor,
-  u as Polynom,
-  Lt as Random,
+  l as Polynom,
+  Ut as Random,
   T as Root,
-  ht as SPHERE3_RELATIVE_POSITION,
+  at as SPHERE3_RELATIVE_POSITION,
   C as Solution,
   zt as Sphere3,
-  Ut as TableOfSigns,
+  jt as TableOfSigns,
   L as Triangle,
   g as Vector,
-  kt as areVectorsColinears,
-  $t as areVectorsEquals,
-  Ft as default,
-  jt as determinantFromVectors,
-  Mt as dotProduct
+  Mt as areVectorsColinears,
+  kt as areVectorsEquals,
+  Gt as default,
+  Ft as determinantFromVectors,
+  Bt as dotProduct
 };
 //# sourceMappingURL=pimath.js.map