pimath 0.0.129 → 0.0.131

package/dist/pimath.js

@@ -1,84 +1,6 @@
 var te = Object.defineProperty;
 var ie = (c, e, t) => e in c ? te(c, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : c[e] = t;
 var r = (c, e, t) => (ie(c, typeof e != "symbol" ? e + "" : e, t), t);
-class x {
-  static round(e, t = 2) {
-    return +(Math.round(+(e + "e" + t)) + "e-" + t);
-  }
-  /**
-   * Get the list of the nth first prime numbers.
-   * @param nb : number of primes to choose from
-   */
-  static primes(e) {
-    let 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 e === void 0 ? t : t.slice(0, Math.min(t.length, e));
-  }
-  /**
-   * Get the list of all dividers of a number.
-   * @param value
-   */
-  static dividers(e) {
-    let t;
-    const i = Math.sqrt(Math.abs(e));
-    t = [];
-    for (let s = 1; s <= i; s++)
-      e % s === 0 && (t.push(s), t.push(e / s));
-    return t.sort(function(s, n) {
-      return s - n;
-    }), [...new Set(t)];
-  }
-  /**
-   * Great Common Divisor
-   * @param values : number values
-   */
-  static gcd(...e) {
-    let t = function(n, o) {
-      return o === 0 ? n : t(o, n % o);
-    }, i = 1, s = 2;
-    if (e.length === 0)
-      return 1;
-    if (e.length === 1)
-      return e[0] === 0 ? 1 : e[0];
-    if (i = t(e[0], e[1]), i === 1)
-      return 1;
-    for (s = 2; s < e.length && (i = t(i, e[s]), i !== 1); s++)
-      ;
-    return Math.abs(i);
-  }
-  static divideNumbersByGCD(...e) {
-    let t = x.gcd(...e);
-    return e.map((i) => i / t);
-  }
-  /**
-   * Least Common Multiple
-   * @param values: list of numbers
-   */
-  static lcm(...e) {
-    return e.reduce(function(t, i) {
-      return Math.abs(t * i / x.gcd(t, i));
-    });
-  }
-  static pythagoricianTripletsWithTarget(e, t) {
-    const i = [], s = t === !0 ? +e : e ** 2;
-    for (let n = 0; n <= e; n++)
-      for (let o = 0; o <= e; o++)
-        n ** 2 + o ** 2 === s && i.push([n, o, e]);
-    return i;
-  }
-  static numberCorrection(e, t = 1, i = 10, s = 8) {
-    return +e.toFixed(s);
-  }
-  static periodic(e) {
-    if (Number.isSafeInteger(e) || e.toString().split(".")[0].length < 10)
-      return 0;
-  }
-  static decompose(e) {
-    let t = x.dividers(e), i = [], s, n;
-    for (; t.length > 0; )
-      s = t.shift(), n = t.length > 0 ? t.pop() : +s, i.push([s, n]);
-    return i;
-  }
-}
 const X = {
   pi: Math.PI,
   e: Math.exp(1)
@@ -527,6 +449,84 @@ class P {
     return this._rpn = i.concat(s.reverse()), this;
   }
 }
+class x {
+  static round(e, t = 2) {
+    return +(Math.round(+(e + "e" + t)) + "e-" + t);
+  }
+  /**
+   * Get the list of the nth first prime numbers.
+   * @param nb : number of primes to choose from
+   */
+  static primes(e) {
+    let 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 e === void 0 ? t : t.slice(0, Math.min(t.length, e));
+  }
+  /**
+   * Get the list of all dividers of a number.
+   * @param value
+   */
+  static dividers(e) {
+    let t;
+    const i = Math.sqrt(Math.abs(e));
+    t = [];
+    for (let s = 1; s <= i; s++)
+      e % s === 0 && (t.push(s), t.push(e / s));
+    return t.sort(function(s, n) {
+      return s - n;
+    }), [...new Set(t)];
+  }
+  /**
+   * Great Common Divisor
+   * @param values : number values
+   */
+  static gcd(...e) {
+    let t = function(n, o) {
+      return o === 0 ? n : t(o, n % o);
+    }, i = 1, s = 2;
+    if (e.length === 0)
+      return 1;
+    if (e.length === 1)
+      return e[0] === 0 ? 1 : e[0];
+    if (i = t(e[0], e[1]), i === 1)
+      return 1;
+    for (s = 2; s < e.length && (i = t(i, e[s]), i !== 1); s++)
+      ;
+    return Math.abs(i);
+  }
+  static divideNumbersByGCD(...e) {
+    let t = x.gcd(...e);
+    return e.map((i) => i / t);
+  }
+  /**
+   * Least Common Multiple
+   * @param values: list of numbers
+   */
+  static lcm(...e) {
+    return e.reduce(function(t, i) {
+      return Math.abs(t * i / x.gcd(t, i));
+    });
+  }
+  static pythagoricianTripletsWithTarget(e, t) {
+    const i = [], s = t === !0 ? +e : e ** 2;
+    for (let n = 0; n <= e; n++)
+      for (let o = 0; o <= e; o++)
+        n ** 2 + o ** 2 === s && i.push([n, o, e]);
+    return i;
+  }
+  static numberCorrection(e, t = 1, i = 10, s = 8) {
+    return +e.toFixed(s);
+  }
+  static periodic(e) {
+    if (Number.isSafeInteger(e) || e.toString().split(".")[0].length < 10)
+      return 0;
+  }
+  static decompose(e) {
+    let t = x.dividers(e), i = [], s, n;
+    for (; t.length > 0; )
+      s = t.shift(), n = t.length > 0 ? t.pop() : +s, i.push([s, n]);
+    return i;
+  }
+}
 const b = class b {
   constructor(e, t) {
     r(this, "_denominator");
@@ -870,14 +870,68 @@ class K {
     e.push(this._numberCorrection(t));
   }
 }
-class D {
-  constructor() {
-    r(this, "_config");
-    r(this, "_defaultConfig");
-    r(this, "mergeConfig", (e, t) => e !== void 0 ? { ...t, ...e } : t);
-    r(this, "generate", () => {
+class Q {
+  constructor(...e) {
+    r(this, "_radical");
+    r(this, "_nth");
+    r(this, "_coefficient");
+    r(this, "_isValid");
+    // ------------------------------------------
+    // Creation / parsing functions
+    // ------------------------------------------
+    r(this, "parse", (e, t, i) => (this._coefficient = i === void 0 ? 1 : i, this._nth = t === void 0 ? 2 : t, this._radical = e === void 0 ? 1 : e, this._nth % 2 === 0 && this._radical < 0 && (this._isValid = !1), this));
+    // ------------------------------------------
+    // Mathematical operations
+    // ------------------------------------------
+    r(this, "reduce", () => {
+      let e = Math.floor(Math.pow(this._radical, 1 / this._nth));
+      for (; e > 1; ) {
+        if (this._radical % Math.pow(e, this._nth) === 0) {
+          this._coefficient *= e, this._radical = this._radical / Math.pow(e, this._nth), e = Math.floor(Math.pow(this._radical, 1 / this._nth));
+          continue;
+        }
+        e--;
+      }
+      return this;
     });
-    r(this, "config", (e) => (this._config = this.mergeConfig(e, this._defaultConfig), this));
+    r(this, "multiply", (e) => (this._radical *= e.radical, this.reduce()));
+    // ------------------------------------------
+    // Help functions
+    // ------------------------------------------
+    r(this, "hasRadical", () => !(this._radical === 1 || this._radical === 0 || this._isValid === !1));
+    this._radical = 1, this._coefficient = 1, this._nth = 2, this._isValid = !0, e !== void 0 && this.parse(e[0], e[1], e[2]);
+  }
+  // ------------------------------------------
+  // Getter and setter
+  // ------------------------------------------
+  get radical() {
+    return this._radical;
+  }
+  set radical(e) {
+    this._radical = e;
+  }
+  get nth() {
+    return this._nth;
+  }
+  set nth(e) {
+    Number.isSafeInteger(e) && e >= 2 ? this._nth = e : (console.log("Error setting the nth root"), this._nth = 2);
+  }
+  get coefficient() {
+    return this._coefficient;
+  }
+  set coefficient(e) {
+    this._coefficient = e;
+  }
+  get tex() {
+    let e;
+    return this._coefficient === 1 ? e = "" : this._coefficient === -1 ? e = "-" : e = this._coefficient.toString(), this._radical === 1 ? `${this._coefficient}` : this._nth === 2 ? `${e}\\sqrt{${this._radical}}` : `${e}\\sqrt[${this._nth}]{${this._radical}}`;
+  }
+  get display() {
+    let e;
+    return this._coefficient === 1 ? e = "" : this._coefficient === -1 ? e = "-" : e = this._coefficient.toString(), this._radical === 1 ? `${this._coefficient}` : this._nth === 2 ? `${e}sqrt{${this._radical}}` : `${e}root(${this._nth}){${this._radical}}`;
+  }
+  get value() {
+    return this._coefficient * Math.pow(this._radical, 1 / this._nth);
   }
 }
 const $ = class $ {
@@ -1390,98 +1444,6 @@ r($, "xmultiply", (...e) => {
   return t;
 });
 let g = $;
-class Q extends D {
-  constructor(t) {
-    super();
-    r(this, "generate", () => {
-      let t = new g();
-      if (typeof this._config.fraction == "boolean" ? t.coefficient = w.fraction({
-        zero: this._config.zero,
-        reduced: !0,
-        natural: !this._config.fraction
-      }) : t.coefficient = w.fraction(this._config.fraction), this._config.letters.length > 1) {
-        for (let i of this._config.letters.split(""))
-          t.setLetter(i, 0);
-        for (let i = 0; i < this._config.degree; i++) {
-          const s = w.item(this._config.letters.split(""));
-          t.setLetter(s, t.degree(s).clone().add(1));
-        }
-      } else
-        t.setLetter(this._config.letters, this._config.degree);
-      return t;
-    });
-    this._defaultConfig = {
-      letters: "x",
-      degree: 2,
-      fraction: !0,
-      zero: !1
-    }, this._config = this.mergeConfig(t, this._defaultConfig);
-  }
-}
-class J {
-  constructor(...e) {
-    r(this, "_radical");
-    r(this, "_nth");
-    r(this, "_coefficient");
-    r(this, "_isValid");
-    // ------------------------------------------
-    // Creation / parsing functions
-    // ------------------------------------------
-    r(this, "parse", (e, t, i) => (this._coefficient = i === void 0 ? 1 : i, this._nth = t === void 0 ? 2 : t, this._radical = e === void 0 ? 1 : e, this._nth % 2 === 0 && this._radical < 0 && (this._isValid = !1), this));
-    // ------------------------------------------
-    // Mathematical operations
-    // ------------------------------------------
-    r(this, "reduce", () => {
-      let e = Math.floor(Math.pow(this._radical, 1 / this._nth));
-      for (; e > 1; ) {
-        if (this._radical % Math.pow(e, this._nth) === 0) {
-          this._coefficient *= e, this._radical = this._radical / Math.pow(e, this._nth), e = Math.floor(Math.pow(this._radical, 1 / this._nth));
-          continue;
-        }
-        e--;
-      }
-      return this;
-    });
-    r(this, "multiply", (e) => (this._radical *= e.radical, this.reduce()));
-    // ------------------------------------------
-    // Help functions
-    // ------------------------------------------
-    r(this, "hasRadical", () => !(this._radical === 1 || this._radical === 0 || this._isValid === !1));
-    this._radical = 1, this._coefficient = 1, this._nth = 2, this._isValid = !0, e !== void 0 && this.parse(e[0], e[1], e[2]);
-  }
-  // ------------------------------------------
-  // Getter and setter
-  // ------------------------------------------
-  get radical() {
-    return this._radical;
-  }
-  set radical(e) {
-    this._radical = e;
-  }
-  get nth() {
-    return this._nth;
-  }
-  set nth(e) {
-    Number.isSafeInteger(e) && e >= 2 ? this._nth = e : (console.log("Error setting the nth root"), this._nth = 2);
-  }
-  get coefficient() {
-    return this._coefficient;
-  }
-  set coefficient(e) {
-    this._coefficient = e;
-  }
-  get tex() {
-    let e;
-    return this._coefficient === 1 ? e = "" : this._coefficient === -1 ? e = "-" : e = this._coefficient.toString(), this._radical === 1 ? `${this._coefficient}` : this._nth === 2 ? `${e}\\sqrt{${this._radical}}` : `${e}\\sqrt[${this._nth}]{${this._radical}}`;
-  }
-  get display() {
-    let e;
-    return this._coefficient === 1 ? e = "" : this._coefficient === -1 ? e = "-" : e = this._coefficient.toString(), this._radical === 1 ? `${this._coefficient}` : this._nth === 2 ? `${e}sqrt{${this._radical}}` : `${e}root(${this._nth}){${this._radical}}`;
-  }
-  get value() {
-    return this._coefficient * Math.pow(this._radical, 1 / this._nth);
-  }
-}
 var F = /* @__PURE__ */ ((c) => (c.real = "\\mathbb{R}", c.varnothing = "\\varnothing", c))(F || {});
 class k {
   /**
@@ -1669,7 +1631,7 @@ class k {
               exact: !1
             }
           ];
-        } else if (o = new J(n).reduce(), o.hasRadical()) {
+        } else if (o = new Q(n).reduce(), o.hasRadical()) {
           let v = x.gcd(f, 2 * a, o.coefficient), B = a / v, S = f / v;
           o.coefficient = o.coefficient / v, a < 0 && (B = -B, S = -S);
           let I = "", Z = "";
@@ -2550,1724 +2512,1762 @@ class u {
       return this.zero();
   }
 }
-class se extends D {
-  constructor(t) {
-    super();
-    r(this, "generate", () => {
-      if (this._config.factorable && this._config.degree > 1)
-        return this.factorable();
-      let t = new u().empty(), i;
-      for (let s = this._config.degree; s >= 0; s--)
-        i = new Q({
-          letters: this._config.letters,
-          degree: s,
-          fraction: this._config.fraction,
-          zero: s === this._config.degree ? !1 : this._config.allowNullMonom
-        }).generate(), this._config.unit && this._config.degree === s && i.coefficient.one(), t.add(i);
-      if (this._config.positive && t.monomByDegree().coefficient.isNegative() && t.monomByDegree().coefficient.opposed(), this._config.numberOfMonoms > 0 && this._config.numberOfMonoms < t.length) {
-        let s = t.monomByDegree().clone();
-        t.monoms = w.array(t.monoms.slice(1), this._config.numberOfMonoms - 1), t.add(s).reorder().reduce();
+class Y {
+  constructor(...e) {
+    // Stores the original equations
+    r(this, "_equations");
+    // Determine the letters in the linear system, usually ['x', 'y']
+    r(this, "_letters");
+    // Resolution steps contains each steps
+    // letter : target letter
+    // steps: {system: current LinearSystem, operations: [*3,/5] or [[*3,*2], [,*5], [*2,]]}
+    r(this, "_resolutionSteps");
+    // Get the solution of the equation
+    r(this, "_solutions");
+    r(this, "buildTex", (e, t) => {
+      let i, s = [], n, o = [];
+      for (let a of e)
+        o = o.concat(a.letters());
+      o = [...new Set(o)], o.sort();
+      for (let a = 0; a < e.length; a++) {
+        let f = e[a];
+        i = [];
+        for (let m of o)
+          n = f.left.monomByLetter(m), i.length === 0 ? i.push(n.isZero() ? "" : n.tex) : i.push(n.isZero() ? "" : (n.coefficient.sign() === 1 ? "+" : "") + n.tex);
+        if (i.push("="), i.push(f.right.tex), t !== void 0 && t[a] !== void 0) {
+          i[i.length - 1] = i[i.length - 1] + " \\phantom{\\quad}";
+          for (let m of t[a])
+            i.push(`\\ \\cdot\\ ${m.startsWith("-") ? "\\left(" + m + "\\right)" : m}`);
+        }
+        s.push(i.join("&"));
       }
-      return t;
+      let l = 0;
+      return t !== void 0 && t.length > 0 && (l = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(o.length)}cl ${"|l".repeat(l)}}${s.join("\\\\ ")}\\end{array}\\right.`;
     });
-    r(this, "factorable", () => {
-      let t = new u().one(), i = { ...this._config };
-      i.degree = 1, i.factorable = !1;
-      for (let s = 0; s < this._config.degree; s++)
-        t.multiply(w.polynom(i));
-      return t;
+    r(this, "stepTex", (e) => {
+      const t = this._resolutionSteps[e];
+      if (t === void 0)
+        return "";
+      let i = [];
+      for (let s = 0; s < t.length; s++)
+        i.push(this.buildTex(t[s].equations, t[s].operations));
+      return `\\begin{aligned}&${i.join("\\\\&")}\\end{aligned}`;
     });
-    this._defaultConfig = {
-      letters: "x",
-      degree: 2,
-      fraction: !1,
-      zero: !1,
-      unit: !1,
-      factorable: !1,
-      allowNullMonom: !0,
-      numberOfMonoms: 0,
-      positive: !0
-    }, this._config = this.mergeConfig(t, this._defaultConfig);
+    // ------------------------------------------
+    // Creation / parsing functions
+    // ------------------------------------------
+    r(this, "parse", (...e) => (this._equations = e.map((t) => new k(t)), this._findLetters(), this));
+    r(this, "clone", () => new Y().parse(...this._equations.map((e) => e.clone())));
+    // ------------------------------------------
+    r(this, "reorder", () => {
+      for (let e of this._equations)
+        e.reorder();
+      return this;
+    });
+    // -----------------------------------------------
+    // Equations solving algorithms
+    r(this, "solve", (e) => {
+      this._solutions = {}, this._resolutionSteps = {}, this.reorder(), e === void 0 && (e = !1);
+      for (let t of this.variables)
+        this._solutions[t] = this._solveOneLetter(t, e);
+      return this;
+    });
+    r(this, "mergeEquations", (e, t, i, s) => {
+      let n = e.clone().multiply(new h(i)), o = t.clone().multiply(new h(s));
+      return n.left.add(o.left), n.right.add(o.right), n;
+    });
+    r(this, "_findLetters", () => {
+      let e = /* @__PURE__ */ new Set();
+      for (let t of this._equations)
+        e = /* @__PURE__ */ new Set([...e, ...t.variables]);
+      return this._letters = [...e], this._letters.sort(), this;
+    });
+    return this._equations = [], this._letters = "xyz".split(""), e !== void 0 && e.length > 0 && this.parse(...e), this;
   }
-}
-class T {
-  /**
-   * Random boolean with a percent ratio
-   * @param percent
-   */
-  static randomBool(e = 0.5) {
-    return Math.random() < e;
+  // ------------------------------------------
+  // Getter and setter
+  // ------------------------------------------
+  get equations() {
+    return this._equations;
   }
-  /**
-   * Random integer between two values.
-   * @param a (number) : From this value to the second value. If the second is ommited, this value is the max value.
-   * @param b (number) : To this value. If this is ommited.
-   */
-  static randomInt(e, t, i) {
-    if (t === void 0)
-      return e >= 0 ? this.randomInt(0, e) : this.randomInt(e, 0);
-    if (e === t)
-      return e;
-    if (i === void 0)
-      return Math.floor(Math.random() * (t - e + 1) + e);
-    if (Math.abs(t - e) <= i.length)
-      throw new Error("The number of excluded values is too high.");
-    let s = this.randomInt(e, t);
-    for (; i.includes(s); )
-      s = this.randomInt(e, t);
-    return s;
+  set equations(e) {
+    this._equations = e;
   }
-  /**
-   * Random integer between -max and max value.
-   * @param max (number) : determine the limits.
-   * @param zero (bool) : determine if zero is allowed or not.
-   */
-  static randomIntSym(e, t) {
-    return t === !1 ? this.randomBool() ? this.randomInt(1, e) : -this.randomInt(1, e) : this.randomInt(-e, e);
+  get letters() {
+    return this._letters.join("");
   }
-  static randomPrime(e) {
-    let t = x.primes();
-    return e !== void 0 && (t = t.filter((i) => i < e)), this.randomItem(t);
+  set letters(e) {
+    this._letters = e.split("");
   }
-  static randomArray(e, t) {
-    return t === void 0 && (t = 1), e.length <= 0 ? Object.values(e) : T.shuffleArray(e).slice(0, t);
+  get isSolvable() {
+    return this.variables.length === this._equations.length;
   }
-  static randomItem(e) {
-    return e.length === 0 ? "" : e[this.randomInt(0, e.length - 1)];
+  get variables() {
+    return this._letters;
   }
-  static shuffleArray(e) {
-    let t = Object.values(e);
-    for (let i = t.length - 1; i > 0; i--) {
-      const s = Math.floor(Math.random() * (i + 1)), n = t[i];
-      t[i] = t[s], t[s] = n;
-    }
-    return t;
+  get tex() {
+    let e = this.clone().reorder();
+    return e.variables, this.buildTex(e.equations);
   }
-}
-class re extends D {
-  constructor(t) {
-    super();
-    r(this, "generate", () => {
-      let t = new h();
-      if (this._config.negative ? t.numerator = w.numberSym(this._config.max, this._config.zero) : t.numerator = w.number(this._config.zero ? 0 : 1, this._config.max), this._config.natural)
-        t.denominator = 1;
-      else {
-        let i = 0;
-        for (; t.isRelative() && i < 10; )
-          t.denominator = w.number(1, this._config.max), i++;
-      }
-      return this._config.reduced ? t.reduce() : t;
-    });
-    this._defaultConfig = {
-      negative: !0,
-      max: 10,
-      reduced: !0,
-      zero: !0,
-      natural: !1
-    }, this._config = this.mergeConfig(t, this._defaultConfig);
+  get solution() {
+    let e = [];
+    this._solutions === void 0 && this.solve();
+    for (let t in this._solutions) {
+      if (this._solutions[t].display === "RR")
+        return `\\left\\{ \\left(${this._letters.join(";")}\\right) \\big\\vert ${this.equations[0].tex} \\right\\}`;
+      if (this._solutions[t].display === "O/")
+        return "\\varnothing";
+      e.push(this._solutions[t].tex);
+    }
+    return `\\left(${e.join(";")}\\right)`;
   }
-}
-class ne {
-  constructor() {
-    r(this, "x");
-    r(this, "y");
+  get solutionAsDisplay() {
+    let e = [];
+    this._solutions === void 0 && this.solve();
+    for (let t in this._solutions) {
+      if (this._solutions[t].display === "RR")
+        return `{(${this._letters.join(";")}) | ${this.equations[0].display} }`;
+      if (this._solutions[t].display === "O/")
+        return "O/";
+      e.push(this._solutions[t].display);
+    }
+    return `(${e.join(";")})`;
   }
-}
-const V = class V {
-  constructor(...e) {
-    r(this, "_x");
-    // 1st component
-    r(this, "_y");
-    // 2nd component
-    r(this, "_exist");
-    // ------------------------------------------
-    r(this, "parse", (...e) => {
-      if (this.zero(), e.length === 0)
-        return this;
-      if (e.length === 1) {
-        if (e[0] instanceof V)
-          return this._x = e[0].x.clone(), this._y = e[0].y.clone(), this;
-        if (typeof e[0] == "string") {
-          let t = e[0].split(",");
-          if (t.length === 2)
-            return this._x = new h(t[0]).reduce(), this._y = new h(t[1]).reduce(), this;
+  get resolutionSteps() {
+    return this._resolutionSteps;
+  }
+  _linearReduction(e, t, i) {
+    let s = e.left.monomByDegree(1, i).coefficient.clone(), n = t.left.monomByDegree(1, i).coefficient.clone().opposed();
+    const o = x.gcd(s.numerator, n.numerator), l = x.gcd(s.denominator, n.denominator);
+    return s.divide(o).multiply(l), n.divide(o).multiply(l), (n.isNegativeOne() || s.isNegativeOne()) && (s.opposed(), n.opposed()), {
+      merged: this.mergeEquations(e, t, n, s),
+      factors: [n, s]
+    };
+  }
+  /**
+   * Linear reduction of the equations to have only one letter
+   * @param letter    letter to isolate
+   * @private
+   */
+  _solveOneLetter(e, t) {
+    let i = this.clone().equations, s = [], n;
+    this._resolutionSteps[e] = [];
+    for (let a of this.variables)
+      if (s = [], a !== e) {
+        t && (this._resolutionSteps[e].push({
+          equations: i.map((f) => f.clone()),
+          operations: [...new Array(i.length)].map((f) => [...new Array(i.length - 1)].map((m) => ""))
+        }), n = this._resolutionSteps[e].length - 1);
+        for (let f = 0; f < i.length - 1; f++) {
+          const m = this._linearReduction(i[f], i[f + 1], a);
+          s.push(m.merged), t && (this._resolutionSteps[e][n].operations[f][f] = m.factors[0].tex, this._resolutionSteps[e][n].operations[f + 1][f] = m.factors[1].tex);
         }
-        return e[0] instanceof ne ? (this._x = new h(e[0].x).reduce(), this._y = new h(e[0].y).reduce(), this) : this.zero();
+        i = [...s];
       }
-      return e.length === 2 ? (this._x = new h(e[0]).reduce(), this._y = new h(e[1]).reduce(), this) : this;
+    let o = i[0];
+    o.solve();
+    const l = o.solutions[0];
+    if (t) {
+      this._resolutionSteps[e].push({
+        equations: [i[0]],
+        operations: [[i[0].left.monoms[0].coefficient.tex]]
+      });
+      let a;
+      l.exact instanceof h || typeof l.exact == "string" ? a = new u(l.exact) : a = new u(l.value), this._resolutionSteps[e].push({
+        equations: [new k(new u(e), a)],
+        operations: []
+      });
+    }
+    return o.solutions[0];
+  }
+}
+var L = /* @__PURE__ */ ((c) => (c.ZERO = "z", c.DEFENCE = "d", c.NOTHING = "t", c))(L || {}), M = /* @__PURE__ */ ((c) => (c.VERTICAL = "av", c.HORIZONTAL = "ah", c.SLOPE = "ao", c.HOLE = "hole", c))(M || {}), E = /* @__PURE__ */ ((c) => (c.LT = "LT", c.RT = "RT", c.LB = "LB", c.RB = "RB", c))(E || {}), H = /* @__PURE__ */ ((c) => (c.MIN = "min", c.MAX = "max", c.FLAT = "flat", c.NOTHING = "", c))(H || {}), W = /* @__PURE__ */ ((c) => (c.SIGNS = "signs", c.GROWS = "grows", c.VARIATIONS = "variatins", c))(W || {});
+class se {
+  constructor(e, t) {
+    r(this, "fx");
+    r(this, "_asymptotes");
+    r(this, "_derivative");
+    r(this, "_signs");
+    r(this, "_variations");
+    r(this, "_zeroes");
+    r(this, "_config");
+    r(this, "_name");
+    r(this, "makeStudy", () => {
+      this._zeroes = this.makeZeroes(), this._config.signs && (this._signs = this.makeSigns()), this._config.asymptotes && (this._asymptotes = this.makeAsymptotes()), this._config.derivative && (this._derivative = this.makeDerivative()), this._config.variations && (this._variations = this.makeVariation()), this._config.signs && (this._signs.tex = this.texSigns), this._config.derivative && (this._derivative.tex = this.texGrows), this._config.variations && (this._variations.tex = this.texVariations);
     });
-    r(this, "clone", () => (this._x = this._x.clone(), this._y = this._y.clone(), this));
-    r(this, "zero", () => (this._x = new h(null), this._y = new h(null), this));
-    r(this, "origin", () => (this.zero(), this));
-    // ------------------------------------------
-    // Display functions
-    r(this, "middleOf", (e, t) => (this._x = e.x.clone().add(t.x).divide(2), this._y = e.y.clone().add(t.y).divide(2), this));
-    // ------------------------------------------
-    // Mathematical operations
-    // ------------------------------------------
-    // ------------------------------------------
-    // Vector functions
-    // ------------------------------------------
-    // ------------------------------------------
-    // Static functions
-    r(this, "translate", (e) => (this._x = this._x.add(e.x), this._y = this._y.add(e.y), this));
-    // ------------------------------------------
-    r(this, "texValues", (e) => {
-      let t = [];
-      return t.push(this._x.value.toFixed(e === void 0 ? 2 : e)), t.push(this._y.value.toFixed(e === void 0 ? 2 : e)), `\\left(${t.join(";")}\\right)`;
+    r(this, "indexOfZero", (e, t) => {
+      for (let i = 0; i < e.length; i++)
+        if (e[i].tex === t.tex)
+          return i;
+      return -1;
     });
-    r(this, "distanceTo", (e) => {
-      let t = 0, i = new h(), s = "";
-      if (e instanceof A)
-        return e.distanceTo(this);
-      if (e instanceof V) {
-        let n = new N(this, e);
-        t = n.norm, i = n.normSquare.sqrt(), s = n.normSquare.isSquare() ? i.tex : `\\sqrt{\\frac{ ${n.normSquare.numerator} }{ ${n.normSquare.denominator} }}`;
+    r(this, "makeOneLineForSigns", (e, t, i) => {
+      let s = [], n = e.getZeroes().map((o) => o.tex);
+      s.push(""), e.degree().isZero() ? s.push(e.monoms[0].coefficient.sign() === 1 ? "+" : "-") : s.push(e.evaluate(t[0].value - 1).sign() === 1 ? "+" : "-");
+      for (let o = 0; o < t.length; o++)
+        s.push(
+          n.includes(t[o].tex) ? i : "t"
+          /* NOTHING */
+        ), o < t.length - 1 ? s.push(e.evaluate((t[o].value + t[o + 1].value) / 2).sign() === 1 ? "+" : "-") : o === t.length - 1 && s.push(e.evaluate(t[o].value + 1).sign() === 1 ? "+" : "-");
+      return s.push(""), s;
+    });
+    r(this, "makeSignsResult", (e) => {
+      let t = e[0].map((i, s) => s === 0 || s === e[0].length - 1 ? "" : s % 2 === 0 ? "t" : "+");
+      for (let i of e)
+        for (let s = 0; s < i.length; s++)
+          if (s % 2 === 0) {
+            if (t[s] === "d")
+              continue;
+            i[s] !== "t" && (t[s] = i[s]);
+          } else
+            i[s] === "-" && (t[s] = t[s] === "+" ? "-" : "+");
+      return t;
+    });
+    r(this, "makeGrowsResult", (e) => {
+      let t = Object.values(e.signs), i = t[t.length - 1], s = [], n = {}, o = e.zeroes;
+      for (let l = 0; l < o.length; l++) {
+        let a = 2 * l + 2;
+        if (i[a] === "z") {
+          let f, m, d = o[l].exact, p, _, q, v = new K(this.fx.plotFunction);
+          if (d instanceof h) {
+            let B = d, S = this.fx.evaluate(B);
+            f = d.value, m = S.value, p = d.tex, _ = S.tex;
+          } else
+            f = o[l].value, m = v.evaluate({ x: f }), p = f.toFixed(2), _ = m.toFixed(2);
+          i[a - 1] === i[a + 1] ? q = "flat" : i[a - 1] === "+" ? q = "max" : q = "min", n[o[l].tex] = {
+            type: q,
+            tex: { x: p, y: _ },
+            value: { x: f, y: m }
+          };
+        }
       }
-      return { value: t, fraction: i, tex: s };
+      s.push(i[1] === "+" ? "-/" : "+/");
+      for (let l = 1; l < i.length - 1; l++)
+        if (i[l] === "z") {
+          let a = n[o[(l - 2) / 2].tex];
+          s.push(`${i[l - 1]}/\\(${a.type}(${a.tex.x};${a.tex.y})\\)`);
+        } else
+          i[l] === "d" && s.push(`${i[l - 1]}D${i[l + 1] === "+" ? "-" : "+"}/`);
+      return s.push(`${i[i.length - 2]}/`), { growsLine: s, extremes: n };
     });
-    r(this, "isInListOfPoints", (e) => e.map((i) => i.key).includes(this.key));
-    r(this, "isEqual", (e) => this.x.isEqual(e.x) && this.y.isEqual(e.y));
-    return this._x = new h().zero(), this._y = new h().zero(), e !== void 0 && this.parse(...e), this;
+    r(this, "makeVariationsResult", (e) => ({ varsLine: [], extremes: {} }));
+    r(this, "drawCode", () => {
+      let e = `f(x)=${this.fx.plotFunction}`, t = 1;
+      this.asymptotes.forEach((i) => {
+        i.type === "av" ? (e += `
+av_${t}=line x=${i.zero.value}->red,dash`, t++) : i.type === "ah" ? e += `
+ah=line y=${i.fx.monoms[0].coefficient.value}->orange,dash` : i.type === "ao" && (e += `
+ao=line y=${i.fx.plotFunction}->red,dash`), t++;
+      });
+      for (let i in this.derivative.extremes) {
+        let s = this.derivative.extremes[i];
+        e += `
+M_${t}(${s.value.x},${s.value.y})*`, t++;
+      }
+      return this.zeroes.forEach((i) => {
+        i.type === "z" && (e += `
+Z_${t}(${i.value},0)*`, t++);
+      }), e;
+    });
+    r(this, "_makeTexFromTableOfSigns", (e) => {
+      let t = e.factors.map((l) => `\\(${l.tex}\\)/1`), i = `\\(${this._config.name}(${this._config.variable})\\)/1.2`, s = e.zeroes;
+      e.type === "grows" ? i = `\\(${this._config.name}'(${this._config.variable})\\)/1.2,\\(f(x${this._config.variable})\\)/2` : e.type === "variatins" && (i = `\\(${this._config.name}''(${this._config.variable})\\)/1.2,\\(f(${this._config.variable})\\)/2`);
+      let n = `\\begin{tikzpicture}
+\\tkzTabInit[lgt=3,espcl=2,deltacl=0]{/1.2,${t.join(",")},/.1,${i} }{{\\scriptsize \\hspace{1cm} \\(-\\infty\\)},\\(${s.map((l) => l.tex).join("\\),\\(")}\\),{\\scriptsize \\hspace{-1cm} \\(+\\infty\\)}}`, o;
+      for (o = 0; o < e.factors.length; o++)
+        n += `
+\\tkzTabLine{${e.signs[o].join(",")}}`;
+      return n += `
+\\tkzTabLine{${e.signs[o].join(",")}}`, e.type === "grows" ? n += `
+\\tkzTabVar{${e.signs[o + 1].join(",")}}` : e.type === "variatins" && (n += `
+\\tkzTabVar{${e.signs[o + 1].join(",")}}`), n += `
+\\end{tikzpicture}`, n;
+    });
+    if (this.fx = e, this._config = {
+      name: "f",
+      variable: "x",
+      domain: !0,
+      asymptotes: !0,
+      signs: !0,
+      derivative: !0,
+      variations: !0
+    }, t)
+      if (typeof t == "string") {
+        const i = t.split(",");
+        this._config = {};
+        let s = i.filter((n) => n.includes("(") && n.includes(")"));
+        s.length === 1 && (this._config.name = s[0].split("(")[0], this._config.variable = s[0].split("(")[1].split(")")[0]), this._config.domain = i.includes("d"), this._config.asymptotes = i.includes("a"), this._config.signs = i.includes("signs"), this._config.derivative = i.includes("dx"), this._config.variations = i.includes("ddx");
+      } else
+        this._config = t;
+    return this.makeStudy(), this;
   }
-  // ------------------------------------------
-  // Getter and setter
-  // ------------------------------------------
-  get x() {
-    return this._x;
+  get name() {
+    return this._config.name;
   }
-  set x(e) {
-    this._x = e;
+  set name(e) {
+    this._config.name = e;
   }
-  get y() {
-    return this._y;
+  get config() {
+    return this._config;
   }
-  set y(e) {
-    this._y = e;
+  set config(e) {
+    this._config = e;
   }
-  get tex() {
-    let e = [];
-    return e.push(this._x.tex), e.push(this._y.tex), `\\left(${e.join(";")}\\right)`;
+  get zeroes() {
+    return this._zeroes;
   }
-  get display() {
-    let e = [];
-    return e.push(this._x.tex), e.push(this._y.tex), `(${e.join(";")})`;
+  get domain() {
+    return this.fx.domain();
   }
-  get asVector() {
-    return new N(this.x, this.y);
+  get signs() {
+    return this._signs;
   }
-  // ------------------------------------------
-  // Creation / parsing functions
-  get key() {
-    return `${this.x.display};${this.y.display}`;
+  get asymptotes() {
+    return this._asymptotes;
   }
-};
-// ------------------------------------------
-r(V, "pmatrix", (e, t, i) => i === void 0 ? `\\begin{pmatrix} ${e.tex ? e.tex : e} \\\\ ${t.tex ? t.tex : t} \\end{pmatrix}` : `\\begin{pmatrix} ${e.tex ? e.tex : e} \\\\ ${t.tex ? t.tex : t} \\\\ ${i.tex ? i.tex : i} \\end{pmatrix}`);
-let y = V;
-const O = class O {
-  // 2nd component
-  constructor(...e) {
-    r(this, "_x");
-    // 1st component
-    r(this, "_y");
-    r(this, "parse", (...e) => {
-      if (this.zero(), e.length === 0)
-        return this;
-      if (e.length === 1)
-        return e[0] instanceof O ? e[0].clone() : this._parseString(e[0]);
-      if (e.length >= 2) {
-        if (e[0] instanceof y && e[1] instanceof y)
-          return this._x = e[1].x.clone().subtract(e[0].x), this._y = e[1].y.clone().subtract(e[0].y), this;
-        (e[0] instanceof h || !isNaN(e[0])) && (this._x = new h(e[0])), (e[1] instanceof h || !isNaN(e[1])) && (this._y = new h(e[1])), typeof e[0] == "object" && !isNaN(e[0].x) && !isNaN(e[0].x) && typeof e[1] == "object" && !isNaN(e[1].x) && !isNaN(e[1].x) && (this._x = new h(+e[1].x - e[0].x), this._y = new h(+e[1].y - e[0].y));
-      }
-      return this;
-    });
-    r(this, "clone", () => {
-      let e = new O();
-      return this._x !== null && (e.x = this._x.clone()), this._y !== null && (e.y = this._y.clone()), e;
-    });
-    r(this, "reset", () => (this._x = null, this._y = null, this));
-    // ------------------------------------------
-    // Mathematical operations
-    r(this, "zero", () => (this.reset(), this._x = new h(null), this._y = new h(null), this));
-    r(this, "one", () => (this._x = new h(), this._y = new h(), this));
-    // ------------------------------------------
-    r(this, "opposed", () => (this._x.opposed(), this._y.opposed(), this));
-    r(this, "add", (e) => (this._x.add(e.x), this._y.add(e.y), this));
-    r(this, "subtract", (e) => this.add(e.clone().opposed()));
-    r(this, "scalarProductWithVector", (e) => O.scalarProduct(this, e));
-    r(this, "determinantWithVector", (e) => O.determinant(this, e));
-    r(this, "normal", () => {
-      let e = this.x.clone().opposed(), t = this.y.clone();
-      return this._x = t, this._y = e, this;
-    });
-    r(this, "isColinearTo", (e) => this.determinantWithVector(e).isZero());
-    r(this, "isNormalTo", (e) => this.scalarProductWithVector(e).isZero());
-    r(this, "multiplyByScalar", (e) => {
-      let t = new h(e);
-      return this._x.multiply(t), this._y.multiply(t), this;
-    });
-    r(this, "divideByScalar", (e) => this.multiplyByScalar(new h(e).invert()));
-    r(this, "simplify", () => this.multiplyByScalar(x.lcm(this._x.denominator, this._y.denominator)).divideByScalar(x.gcd(this._x.numerator, this._y.numerator)));
-    // ------------------------------------------
-    // Vector functions
-    // ------------------------------------------
-    r(this, "simplifyDirection", () => {
-      let e = x.lcm(this.x.denominator, this.y.denominator), t = x.gcd(this.x.numerator, this.y.numerator);
-      return this.x.multiply(e).divide(t), this.y.multiply(e).divide(t), this;
-    });
-    r(this, "angleWith", (e, t, i) => {
-      let s = this.scalarProductWithVector(e).value, n = i ? 1 : 180 / Math.PI;
-      return t && (s = Math.abs(s)), n * Math.acos(s / (this.norm * e.norm));
-    });
-    r(this, "_parseString", (e) => {
-      let t = e.split(/[,;\s]/g);
-      return this.x = new h(t[0] || null), this.y = new h(t[1] || null), this;
-    });
-    this._x = new h().zero(), this._y = new h().zero(), e !== void 0 && this.parse(...e);
+  get derivative() {
+    return this._derivative;
   }
-  // ------------------------------------------
-  // Getter and setter
-  // ------------------------------------------
-  get x() {
-    return this._x;
+  get texSigns() {
+    return this._makeTexFromTableOfSigns(this._signs);
   }
-  set x(e) {
-    this._x = new h(e);
+  get texGrows() {
+    return this._makeTexFromTableOfSigns(this._derivative);
   }
-  get y() {
-    return this._y;
+  get texVariations() {
+    return this._makeTexFromTableOfSigns(this._variations);
   }
-  set y(e) {
-    this._y = new h(e);
+  makeZeroes() {
+    return [];
   }
-  get normSquare() {
-    return this._x.clone().pow(2).add(this._y.clone().pow(2));
+  makeSigns() {
+    return {
+      type: "signs",
+      fx: null,
+      factors: [],
+      zeroes: [],
+      signs: [],
+      extremes: {},
+      tex: ""
+    };
   }
-  get norm() {
-    return Math.sqrt(this.normSquare.value);
+  makeAsymptotes() {
+    return [];
   }
-  get tex() {
-    return `\\begin{pmatrix}${this._x.tex} \\\\ ${this._y.tex} \\end{pmatrix}`;
+  makeDerivative() {
+    return {
+      type: "grows",
+      fx: null,
+      factors: [],
+      zeroes: [],
+      signs: [],
+      extremes: {},
+      tex: ""
+    };
   }
-  get asPoint() {
-    return new y(this.x, this.y);
+  makeVariation() {
+    return {
+      type: "variatins",
+      fx: null,
+      factors: [],
+      zeroes: [],
+      signs: [],
+      extremes: {},
+      tex: ""
+    };
   }
-  // ------------------------------------------
-  // Creation / parsing functions
-  // ------------------------------------------
-  get isNull() {
-    return this.x.isZero() && this.y.isZero();
+}
+class re extends se {
+  constructor(e, t) {
+    return super(e, t), this;
   }
-};
-r(O, "scalarProduct", (e, t) => e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y))), r(O, "determinant", (e, t) => e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)));
-let N = O;
-var ee = /* @__PURE__ */ ((c) => (c[c.None = 0] = "None", c.Parallel = "parallel", c.Perpendicular = "perpendicular", c.Tangent = "tangent", c))(ee || {});
-const z = class z {
-  /**
-   * Value can be a mix of:
-   *
-   * @param values
-   */
-  constructor(...e) {
-    r(this, "_referencePropriety");
-    r(this, "_referenceLine");
-    r(this, "_reduceBeforeDisplay");
-    // ax + by + c = 0
-    r(this, "_a");
-    r(this, "_b");
-    r(this, "_c");
-    r(this, "_OA");
-    r(this, "_d");
-    r(this, "_n");
-    r(this, "_exists");
-    r(this, "randomPoint", (e) => this._d.clone().multiplyByScalar(w.numberSym(e === void 0 || e <= 1 ? 3 : e, !1)).add(this._OA.asVector).asPoint);
-    r(this, "randomNearPoint", (e) => {
-      let t = this.randomPoint(e), i = 10;
-      for (; this.isOnLine(t) && i > 0; )
-        t.x.add(w.numberSym(1, !1)), t.y.add(w.numberSym(1, !1)), i--;
-      return t;
-    });
-    // ------------------------------------------
-    // Creation / parsing functions
-    // ------------------------------------------
-    /**
-     * Parse data to a line
-     * @param {any} values
-     * @returns {Line}
-     */
-    r(this, "parse", (...e) => {
-      if (this._exists = !1, e.length === 0)
-        return this;
-      if (e.length === 1) {
-        if (e[0] instanceof z)
-          return e[0].clone();
-        if (e[0] instanceof k)
-          return this.parseEquation(e[0]);
-        if (typeof e[0] == "string")
-          try {
-            let t = new k(e[0]);
-            return this.parse(t);
-          } catch {
-            return this;
-          }
-      }
-      if (e.length === 2) {
-        if (e[0] instanceof y && e[1] instanceof N)
-          return this.parseByPointAndVector(e[0], e[1]);
-        if (e[0] instanceof y && e[1] instanceof y)
-          return this.parseByPointAndVector(e[0], new N(e[0], e[1]));
-        if (e[0] instanceof N && e[1] instanceof y)
-          return this.parseByPointAndNormal(e[1], e[0]);
-      }
-      if (e.length === 3) {
-        if ((e[0] instanceof h || typeof e[0] == "number") && (e[1] instanceof h || typeof e[1] == "number") && (e[2] instanceof h || typeof e[2] == "number"))
-          return this.parseByCoefficient(e[0], e[1], e[2]);
-        if (e[0] instanceof y && e[1] instanceof N) {
-          if (e[2] === "perpendicular")
-            return this.parseByPointAndNormal(e[0], e[1]);
-          if (e[2] === "parallel")
-            return this.parseByPointAndVector(e[0], e[1]);
-        } else if (e[0] instanceof y && e[1] instanceof z)
-          return e[2] === "parallel" || e[2] === null ? this.parseByPointAndLine(
-            e[0],
-            e[1],
-            "parallel"
-            /* Parallel */
-          ) : this.parseByPointAndLine(
-            e[0],
-            e[1],
-            "perpendicular"
-            /* Perpendicular */
-          );
-      }
-      return console.log("Someting wrong happend while creating the line"), this;
+  makeZeroes() {
+    return this._getZeroes(this.fx);
+  }
+  makeSigns() {
+    return this._getSigns(this.fx, this.zeroes);
+  }
+  makeAsymptotes() {
+    const e = this.fx.clone().reduce();
+    let t = [];
+    this.zeroes.filter((n) => n.type === L.DEFENCE).forEach((n) => {
+      let o = M.VERTICAL, l = `x=${n.tex}`, a = `x=${n.display}`;
+      n.exact instanceof h ? e.denominator.evaluate(n.exact).isNotZero() && (o = M.HOLE, l = `(${n.tex};${e.evaluate(n.exact).tex})`, a = `(${n.display};${e.evaluate(n.exact).display})`) : e.denominator.evaluate(n.value).isNotZero() && (o = M.HOLE, l = `(${n.tex};${e.evaluate(n.value).tex})`, a = `(${n.display};${e.evaluate(n.value).display})`);
+      const f = 1e-6;
+      let m = this.fx.evaluateAsNumeric(n.value - f), d = this.fx.evaluateAsNumeric(n.value + f), p = [], _ = "";
+      d < -1e4 ? (p.push(E.RB), _ += "m") : d > 1e4 && (p.push(E.RT), _ += "p"), m < -1e4 ? (p.push(E.LB), _ += "m") : m > 1e4 && (p.push(E.LT), _ += "p"), _ === "pp" ? _ = "+" : _ === "mm" ? _ = "-" : _ = `\\${_}`, t.push({
+        fx: null,
+        type: o,
+        tex: l,
+        display: a,
+        zero: n,
+        limits: `\\lim_{x\\to${n.tex} }\\ f(x) = ${_}\\infty`,
+        deltaX: null,
+        tableOfSign: null,
+        position: p
+      });
     });
-    r(this, "parseEquation", (e) => {
-      e.reorder(!0);
-      let t = new Set(e.letters());
-      if (!(t.has("x") || t.has("y")))
-        return this;
-      for (let i of ["x", "y"])
-        t.has(i) && t.delete(i);
-      return t.size > 0 ? this : this.parseByCoefficient(e.left.monomByLetter("x").coefficient, e.left.monomByLetter("y").coefficient, e.left.monomByDegree(0).coefficient);
-    });
-    r(this, "parseByCoefficient", (e, t, i) => (this._a = new h(e), this._b = new h(t), this._c = new h(i), this._d = new N(this._b.clone(), this._a.clone().opposed()), this._OA = new y(new h().zero(), this._c.clone()), this._n = this._d.clone().normal(), this._exists = !0, this));
-    r(this, "parseByPointAndVector", (e, t) => (this.parseByCoefficient(
-      t.y,
-      t.x.clone().opposed(),
-      e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)).opposed()
-    ), this._OA = e.clone(), this._d = t.clone(), this._n = this._d.clone().normal(), this._exists = !0, this));
-    r(this, "parseByPointAndNormal", (e, t) => this.parseByCoefficient(
-      t.x,
-      t.y,
-      e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposed()
+    let i = this.fx.numerator.degree(), s = this.fx.denominator.degree();
+    if (i.isEqual(s)) {
+      let n = this.fx.numerator.monomByDegree().coefficient.clone().divide(this.fx.denominator.monomByDegree().coefficient), o = n.tex, { reminder: l } = e.euclidian(), a = new R(l, e.denominator);
+      t.push({
+        fx: new u(n),
+        type: M.HORIZONTAL,
+        tex: `y=${o}`,
+        display: `y=${n.display}`,
+        zero: null,
+        limits: `\\lim_{x\\to\\infty}\\ f(x) = ${o}`,
+        deltaX: a,
+        tableOfSign: this._getSigns(a),
+        position: this._getHorizontalAsymptoteRelativePositon(a)
+      });
+    } else if (s.greater(i))
+      t.push({
+        fx: new u("0"),
+        type: M.HORIZONTAL,
+        tex: "y=0",
+        display: "y=0",
+        zero: null,
+        limits: "\\lim_{x\\to\\infty}\\ f(x) = 0",
+        deltaX: null,
+        tableOfSign: null,
+        position: this._getHorizontalAsymptoteRelativePositon(this.fx)
+      });
+    else if (i.value - 1 === s.value) {
+      let { quotient: n, reminder: o } = e.euclidian(), l = new R(o, e.denominator);
+      t.push({
+        fx: n.clone(),
+        type: M.SLOPE,
+        tex: `y=${n.tex}`,
+        display: `y=${n.display}`,
+        zero: null,
+        limits: "",
+        deltaX: new R(o, e.denominator),
+        tableOfSign: this._getSigns(l),
+        position: this._getHorizontalAsymptoteRelativePositon(l)
+      });
+    }
+    return t;
+  }
+  _getHorizontalAsymptoteRelativePositon(e, t = 1e6) {
+    let i = [], s = e.evaluateAsNumeric(-t), n = e.evaluateAsNumeric(t);
+    return s >= 0 ? i.push(E.LT) : i.push(E.LB), n >= 0 ? i.push(E.RT) : i.push(E.RB), i;
+  }
+  makeDerivative() {
+    let e = this.fx.clone().derivative(), t = this._getSigns(e, this._getZeroes(e), W.GROWS), i = this.makeGrowsResult(t);
+    return t.signs.push(i.growsLine), t.extremes = i.extremes, t;
+  }
+  makeVariation() {
+    let e = this.derivative.fx.clone().derivative(), t = this._getSigns(e, this._getZeroes(e), W.VARIATIONS), i = this.makeVariationsResult(t);
+    return t.signs.push(i.varsLine), t.extremes = i.extremes, t;
+  }
+  _getZeroes(e) {
+    let t = [];
+    return e.numerator.getZeroes().filter((i) => !isNaN(i.value)).forEach((i) => {
+      t.push({
+        tex: i.tex,
+        display: i.display,
+        value: i.value,
+        exact: i.exact,
+        extrema: H.NOTHING,
+        type: L.ZERO
+      });
+    }), e.denominator.getZeroes().filter((i) => !isNaN(i.value)).forEach((i) => {
+      let s = this.indexOfZero(t, i);
+      s !== -1 ? t[s].type = L.DEFENCE : t.push({
+        tex: i.tex,
+        display: i.display,
+        value: i.value,
+        exact: i.exact,
+        extrema: H.NOTHING,
+        type: L.DEFENCE
+      });
+    }), t.sort((i, s) => i.value - s.value), t;
+  }
+  _getSigns(e, t, i) {
+    let s = [], n = [];
+    return t === void 0 && (t = this._getZeroes(e)), e.numerator.factors.forEach((o) => {
+      s.push(this.makeOneLineForSigns(o, t, L.ZERO)), n.push(o.clone());
+    }), e.denominator.factors.forEach((o) => {
+      s.push(this.makeOneLineForSigns(o, t, L.DEFENCE)), n.push(o.clone());
+    }), s.push(this.makeSignsResult(s)), {
+      type: i,
+      fx: e,
+      factors: n,
+      zeroes: t,
+      signs: s,
+      extremes: {},
+      tex: ""
+    };
+  }
+}
+class R {
+  /**
+   *
+   * @param numerator
+   * @param denominator
+   */
+  constructor(e, t) {
+    r(this, "_denominator");
+    r(this, "_numerator");
+    r(this, "_rawString");
+    r(this, "clone", () => new R(
+      this._numerator.clone(),
+      this._denominator.clone()
     ));
-    r(this, "parseByPointAndLine", (e, t, i) => (i === void 0 && (i = "parallel"), i === "parallel" ? this.parseByPointAndNormal(e, t.normal) : i === "perpendicular" ? this.parseByPointAndNormal(e, t.director) : (this._exists = !1, this)));
-    r(this, "clone", () => (this._a = this._a.clone(), this._b = this._b.clone(), this._c = this._c.clone(), this._d = this._d.clone(), this._OA = this._OA.clone(), this._n = this._n.clone(), this._exists = this.exists, this));
-    // ------------------------------------------
-    // Mathematical operations
-    // ------------------------------------------
-    r(this, "isOnLine", (e) => this._a.clone().multiply(e.x).add(
-      this._b.clone().multiply(e.y)
-    ).add(this._c).isZero());
-    r(this, "isParallelTo", (e) => this.slope.isEqual(e.slope) && this.height.isNotEqual(e.height));
-    r(this, "isSameAs", (e) => this.slope.isEqual(e.slope) && this.height.isEqual(e.height));
-    r(this, "isPerpendicularTo", (e) => this.d.isNormalTo(e.d));
-    r(this, "isVertical", () => this.slope.isInfinity());
-    r(this, "simplify", () => {
-      let e = x.lcm(this._a.denominator, this._b.denominator, this._c.denominator), t = x.gcd(this._a.numerator, this._b.numerator, this._c.numerator);
-      return this.parseByCoefficient(
-        this._a.clone().multiply(e).divide(t),
-        this._b.clone().multiply(e).divide(t),
-        this._c.clone().multiply(e).divide(t)
-      ), this;
+    r(this, "domain", () => {
+      let e = this._denominator.getZeroes();
+      return e.length === 0 || e[0].tex === F.real ? F.varnothing : e[0].tex === F.varnothing ? F.real : "\\mathbb{R}\\setminus\\left\\{" + e.map((t) => t.tex).join(";") + "\\right\\}";
     });
-    r(this, "simplifyDirection", () => (this._d.simplifyDirection(), this));
-    r(this, "intersection", (e) => {
-      let t = new y(), i = !1, s = !1;
-      return this._b.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = null, t.y = null, i = !0) : this.isSameAs(e) ? (t.x = null, t.y = null, s = !0) : (t.x = this._b.clone().multiply(e.c).subtract(this._c.clone().multiply(e.b)).divide(this._a.clone().multiply(e.b).subtract(this._b.clone().multiply(e.a))), t.y = this._a.clone().multiply(e.c).subtract(this._c.clone().multiply(e.a)).divide(this._b.clone().multiply(e.a).subtract(this._a.clone().multiply(e.b)))), {
-        point: t,
-        hasIntersection: !(i || s),
-        isParallel: i,
-        isSame: s
-      };
+    r(this, "amplify", (e) => (this._numerator.multiply(e), this._denominator.multiply(e), this));
+    r(this, "derivative", (e) => {
+      let t = this._numerator.clone(), i = this._denominator.clone(), s = t.clone().derivative(e), n = i.clone().derivative(e);
+      return this._numerator = s.clone().multiply(i).subtract(t.clone().multiply(n)), this._denominator = i.clone().pow(2), this;
     });
-    r(this, "getValueAtX", (e) => {
-      const t = this.equation.clone().isolate("y"), i = new h(e);
-      if (t instanceof k)
-        return t.right.evaluate({ x: i });
+    r(this, "factorize", (e) => (this._numerator.factorize(e), this._denominator.factorize(e), this));
+    r(this, "simplify", (e) => {
+      let t = this._numerator.euclidian(e);
+      if (!t.reminder.isZero())
+        return this;
+      let i = this._denominator.euclidian(e);
+      return i.reminder.isZero() ? (this._numerator = t.quotient, this._denominator = i.quotient, this) : this;
     });
-    r(this, "getValueAtY", (e) => {
-      const t = this.equation.clone().isolate("x"), i = new h(e);
-      if (t instanceof k)
-        return t.right.evaluate({ y: i });
+    r(this, "reduce", () => {
+      this._numerator.factorize();
+      for (let e of this._numerator.factors)
+        e.degree().isZero() ? this._denominator.commonMonom().coefficient.clone().divide(e.monomByDegree().coefficient).isNatural() && this.simplify(e) : this.simplify(e);
+      return this;
     });
-    return this._exists = !1, this._reduceBeforeDisplay = !0, e.length > 0 && this.parse(...e), this;
-  }
-  get a() {
-    return this._a;
+    r(this, "opposed", () => (this._numerator.opposed(), this));
+    r(this, "add", (e) => {
+      let t = this._denominator.clone();
+      return this.amplify(e._denominator), this._numerator.add(e._numerator.clone().multiply(t)), this;
+    });
+    r(this, "subtract", (e) => this.add(e.clone().opposed()));
+    r(this, "euclidian", () => this._numerator.euclidian(this._denominator));
+    // TODO : where and how is used limits ?
+    r(this, "limits", (e, t, i) => {
+      if (e === 1 / 0 || e === -1 / 0) {
+        let { quotient: s, reminder: n } = this._numerator.clone().euclidian(this._denominator);
+        return s.degree(i).isStrictlyPositive() ? e === 1 / 0 ? s.limitToInfinity(i) : s.limitToNegativeInfinity(i) : s.monomByDegree(void 0, i).coefficient;
+      } else {
+        let s = {}, n = {}, o, l, a = this.clone().reduce();
+        return s[i === void 0 ? "x" : i] = new h(e), t !== "above" && t !== "below" ? (o = a._numerator.evaluate(s).divide(a._denominator.evaluate(s)), o.isInfinity() ? o.abs() : o) : (t === "above" ? n[i === void 0 ? "x" : i] = new h(e).add(1e-6) : t === "below" && (n[i === void 0 ? "x" : i] = new h(e).subtract(1e-6)), o = a._numerator.evaluate(s).divide(a._denominator.evaluate(s)), l = a._numerator.evaluate(n).divide(a._denominator.evaluate(n)).sign(), o.isInfinity() ? l === 1 ? o.abs() : o.abs().opposed() : o);
+      }
+    });
+    r(this, "evaluate", (e) => {
+      new h().zero();
+      let t = this._numerator.evaluate(e), i = this._denominator.evaluate(e);
+      return t.divide(i);
+    });
+    r(this, "evaluateAsNumeric", (e) => this._numerator.evaluateAsNumeric(e) / this._denominator.evaluateAsNumeric(e));
+    r(this, "study", (e) => new re(this, e));
+    e instanceof u ? this._numerator = e.clone() : typeof e == "string" ? this._numerator = new u(e) : this._numerator = new u(), t instanceof u ? this._denominator = t.clone() : typeof t == "string" ? this._denominator = new u(t) : this._denominator = new u();
   }
-  // ------------------------------------------
-  // Getter and setter
-  set a(e) {
-    this._a = e;
+  get numerator() {
+    return this._numerator;
   }
-  get b() {
-    return this._b;
+  get denominator() {
+    return this._denominator;
   }
-  set b(e) {
-    this._b = e;
+  get tex() {
+    return `\\frac{ ${this._numerator.tex} }{ ${this._denominator.tex} }`;
   }
-  get c() {
-    return this._c;
+  get display() {
+    return `(${this._numerator.display})/(${this._denominator.display})`;
   }
-  set c(e) {
-    this._c = e;
+  get texFactors() {
+    return `\\frac{ ${this._numerator.texFactors} }{ ${this._denominator.texFactors} }`;
   }
-  get OA() {
-    return this._OA;
+  get displayFactors() {
+    return `(${this._numerator.displayFactors})/(${this._denominator.displayFactors})`;
   }
-  set OA(e) {
-    this._OA = e;
+  get plotFunction() {
+    return `(${this._numerator.plotFunction})/(${this._denominator.plotFunction})`;
   }
-  get d() {
-    return this._d;
+}
+class ne {
+  /**
+   *
+   * @param {string} value (optional) Default polynom to parse on class creation
+   */
+  constructor(e) {
+    r(this, "_rawString");
+    r(this, "_rpn");
+    r(this, "parse", (e) => (this._rpn = new P(U.SET).parse(e).rpn, this));
+    return this._rawString = e, this.parse(e), this;
   }
-  set d(e) {
-    this._d = e;
+  get isLogicalset() {
+    return !0;
   }
-  get n() {
-    return this._n;
-  }
-  get exists() {
-    return this._exists;
-  }
-  // ------------------------------------------
-  get equation() {
-    let e = new k(new u().parse("xy", this._a, this._b, this._c), new u("0"));
-    return this._reduceBeforeDisplay ? e.simplify() : e;
-  }
-  get system() {
-    let e = new k(
-      new u("x"),
-      new u(this._OA.x).add(new g("k").multiplyByNumber(this._d.x))
-    ), t = new k(
-      new u("y"),
-      new u(this._OA.y).add(new g("k").multiplyByNumber(this._d.y))
-    );
-    return { x: e, y: t };
+  get rpn() {
+    return this._rpn;
   }
   get tex() {
-    let e = this.equation.clone().reorder(!0);
-    this._a.isNegative() && e.multiply(-1);
-    let t = this._d.clone();
-    return this._reduceBeforeDisplay && t.simplifyDirection(), {
-      canonical: e.tex,
-      equation: e.clone().reorder().tex,
-      mxh: this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new u().parse("x", this.slope, this.height).tex,
-      parametric: `${y.pmatrix("x", "y")} = ${y.pmatrix(this._OA.x, this._OA.y)} + k\\cdot ${y.pmatrix(t.x, t.y)}`,
-      system: `\\left\\{\\begin{aligned}
-            x &= ${new u(this._OA.x).add(new g(this._d.x).multiply(new g("k"))).reorder("k", !0).tex}\\\\ 
-            y &= ${new u(this._OA.y).add(new g(this._d.y).multiply(new g("k"))).reorder("k", !0).tex}
-            \\end{aligned}\\right.`
-    };
-  }
-  get reduceBeforeDisplay() {
-    return this._reduceBeforeDisplay;
-  }
-  set reduceBeforeDisplay(e) {
-    this._reduceBeforeDisplay = e;
-  }
-  get display() {
-    let e = this.equation;
-    return this._a.isNegative() && e.multiply(-1), {
-      canonical: e.display,
-      mxh: this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new u().parse("x", this.slope, this.height).display,
-      parametric: ""
-    };
-  }
-  get normal() {
-    return new N(this._a, this._b);
-  }
-  get director() {
-    return this._d.clone();
-  }
-  get slope() {
-    return this._a.clone().opposed().divide(this._b);
+    let e = [];
+    for (let t of this._rpn)
+      if (t.tokenType === "variable")
+        e.push(t);
+      else
+        switch (t.token) {
+          case "&":
+            if (e.length >= 2) {
+              let i = e.pop(), s = e.pop();
+              s.tokenType === "mix" && (s.token = `( ${s.token} )`), i.tokenType === "mix" && (i.token = `( ${i.token} )`), e.push({ token: `${s.token} \\cap ${i.token}`, tokenType: "mix" });
+            }
+            break;
+          case "|":
+            if (e.length >= 2) {
+              let i = e.pop(), s = e.pop();
+              s.tokenType === "mix" && (s.token = `( ${s.token} )`), i.tokenType === "mix" && (i.token = `( ${i.token} )`), e.push({ token: `${s.token} \\cup ${i.token}`, tokenType: "mix" });
+            }
+            break;
+          case "-":
+            if (e.length >= 2) {
+              let i = e.pop(), s = e.pop();
+              s.tokenType === "mix" && (s.token = `( ${s.token} )`), i.tokenType === "mix" && (i.token = `( ${i.token} )`), e.push({ token: `${s.token} \\setminus ${i.token}`, tokenType: "mix" });
+            }
+            break;
+          case "!":
+            if (e.length >= 1) {
+              let i = e.pop();
+              e.push({ token: `\\overline{ ${i.token} }`, tokenType: "variable" });
+            }
+            break;
+        }
+    return e[0].token;
   }
-  get height() {
-    return this._c.clone().opposed().divide(this._b);
+  evaluate(e, t) {
+    let i = [], s;
+    if (t === void 0) {
+      s = /* @__PURE__ */ new Set();
+      for (let n in e)
+        s = /* @__PURE__ */ new Set([...s, ...e[n]]);
+    } else
+      s = new Set(t);
+    for (let n of this._rpn)
+      if (n.tokenType === "variable")
+        e[n.token] === void 0 ? i.push(/* @__PURE__ */ new Set()) : i.push(new Set(e[n.token]));
+      else
+        switch (n.token) {
+          case "&":
+            if (i.length >= 2) {
+              let o = i.pop(), l = i.pop();
+              i.push(new Set([...l].filter((a) => o.has(a))));
+            }
+            break;
+          case "|":
+            if (i.length >= 2) {
+              let o = i.pop(), l = i.pop();
+              i.push(/* @__PURE__ */ new Set([...l, ...o]));
+            }
+            break;
+          case "-":
+            if (i.length >= 2) {
+              let o = i.pop(), l = i.pop();
+              i.push(new Set([...l].filter((a) => !o.has(a))));
+            }
+            break;
+          case "!":
+            if (i.length >= 1) {
+              let o = i.pop();
+              i.push(new Set([...s].filter((l) => !o.has(l))));
+            }
+            break;
+        }
+    return [...i[0]].sort();
   }
-  distanceTo(e) {
-    let t = e.x.clone().multiply(this._a).add(e.y.clone().multiply(this._b)).add(this._c).abs(), i = this.normal.normSquare;
-    if (i.isZero())
-      return {
-        value: NaN,
-        tex: "Not a line",
-        fraction: new h().infinite()
-      };
-    let s = t.value / Math.sqrt(i.value), n = t.clone().divide(i.clone().sqrt());
-    return i.isSquare() ? {
-      value: s,
-      tex: n.tex,
-      fraction: n
-    } : {
-      value: s,
-      tex: `\\frac{${t.tex}}{\\sqrt{${i.tex}}}`,
-      fraction: n
-    };
+  vennAB() {
+    return this.evaluate(
+      {
+        A: ["A", "AB"],
+        B: ["B", "AB"]
+      },
+      ["A", "B", "AB", "E"]
+    );
   }
-  hitSegment(e, t) {
-    let i = this.intersection(
-      new z(e, t)
+  vennABC() {
+    return this.evaluate(
+      {
+        A: ["A", "AB", "AC", "ABC"],
+        B: ["B", "AB", "BC", "ABC"],
+        C: ["C", "AC", "BC", "ABC"]
+      },
+      ["A", "B", "C", "AB", "AC", "BC", "E"]
     );
-    return i.hasIntersection ? i.point.x.value >= Math.min(e.x.value, t.x.value) && i.point.x.value <= Math.max(e.x.value, t.x.value) && i.point.y.value >= Math.min(e.y.value, t.y.value) && i.point.y.value <= Math.max(e.y.value, t.y.value) : !1;
   }
-  // ------------------------------------------
-  // Special functions
-  // ------------------------------------------
-  canonicalAsFloatCoefficient(e) {
-    e === void 0 && (e = 2), this._a.value, this._b.value, this._c.value;
-    let t = "";
-    return this._a.isZero() || (this._a.isOne() ? t = "x" : this._a.clone().opposed().isOne() ? t = "-x" : t = this._a.value.toFixed(e) + "x"), this._b.isZero() || (this._b.isPositive() && (t += "+"), t += this._b.value.toFixed(e) + "y"), this._c.isZero() || (this._c.isPositive() && (t += "+"), t += this._c.value.toFixed(e)), t + "=0";
+}
+class D {
+  constructor() {
+    r(this, "_config");
+    r(this, "_defaultConfig");
+    r(this, "mergeConfig", (e, t) => e !== void 0 ? { ...t, ...e } : t);
+    r(this, "generate", () => {
+    });
+    r(this, "config", (e) => (this._config = this.mergeConfig(e, this._defaultConfig), this));
   }
-};
-// A line is defined as the canonical form
-r(z, "PERPENDICULAR", "perpendicular"), r(z, "PARALLEL", "parallel");
-let A = z;
-class oe extends D {
+}
+class J extends D {
   constructor(t) {
     super();
     r(this, "generate", () => {
-      const t = new N(
-        w.numberSym(10),
-        w.numberSym(10)
-      );
-      for (; t.isNull; )
-        t.x = w.numberSym(10), t.y = w.numberSym(10);
-      return this._config.slope === 1 ? t.x.sign() !== t.y.sign() && t.y.opposed() : this._config.slope === -1 && t.x.sign() !== t.y.sign() && t.y.opposed(), new A(new y(this._config.A.x, this._config.A.y), t);
+      let t = new g();
+      if (typeof this._config.fraction == "boolean" ? t.coefficient = w.fraction({
+        zero: this._config.zero,
+        reduced: !0,
+        natural: !this._config.fraction
+      }) : t.coefficient = w.fraction(this._config.fraction), this._config.letters.length > 1) {
+        for (let i of this._config.letters.split(""))
+          t.setLetter(i, 0);
+        for (let i = 0; i < this._config.degree; i++) {
+          const s = w.item(this._config.letters.split(""));
+          t.setLetter(s, t.degree(s).clone().add(1));
+        }
+      } else
+        t.setLetter(this._config.letters, this._config.degree);
+      return t;
     });
     this._defaultConfig = {
-      A: {
-        x: w.numberSym(10),
-        y: w.numberSym(10)
-      }
+      letters: "x",
+      degree: 2,
+      fraction: !0,
+      zero: !1
     }, this._config = this.mergeConfig(t, this._defaultConfig);
   }
 }
-class le extends D {
+class oe extends D {
   constructor(t) {
     super();
     r(this, "generate", () => {
-      let t, i, s = this._config.axis === !0 || this._config.axis === "x", n = this._config.axis === !0 || this._config.axis === "y";
-      return t = this._config.fraction ? w.fraction({ max: this._config.max, zero: s }) : new h(w.numberSym(this._config.max, s)), i = this._config.fraction ? w.fraction({ max: this._config.max, zero: n }) : new h(w.numberSym(this._config.max, n)), +this._config.quadrant == 1 && (t.abs(), i.abs()), +this._config.quadrant == 2 && (t.isPositive() && t.opposed(), i.isNegative() && i.opposed()), +this._config.quadrant == 3 && (t.isPositive() && t.opposed(), i.isPositive() && i.opposed()), +this._config.quadrant == 4 && (t.isNegative() && t.opposed(), i.isPositive() && i.opposed()), new y(t, i);
+      if (this._config.factorable && this._config.degree > 1)
+        return this.factorable();
+      let t = new u().empty(), i;
+      for (let s = this._config.degree; s >= 0; s--)
+        i = new J({
+          letters: this._config.letters,
+          degree: s,
+          fraction: this._config.fraction,
+          zero: s === this._config.degree ? !1 : this._config.allowNullMonom
+        }).generate(), this._config.unit && this._config.degree === s && i.coefficient.one(), t.add(i);
+      if (this._config.positive && t.monomByDegree().coefficient.isNegative() && t.monomByDegree().coefficient.opposed(), this._config.numberOfMonoms > 0 && this._config.numberOfMonoms < t.length) {
+        let s = t.monomByDegree().clone();
+        t.monoms = w.array(t.monoms.slice(1), this._config.numberOfMonoms - 1), t.add(s).reorder().reduce();
+      }
+      return t;
+    });
+    r(this, "factorable", () => {
+      let t = new u().one(), i = { ...this._config };
+      i.degree = 1, i.factorable = !1;
+      for (let s = 0; s < this._config.degree; s++)
+        t.multiply(w.polynom(i));
+      return t;
     });
     this._defaultConfig = {
-      axis: !0,
+      letters: "x",
+      degree: 2,
       fraction: !1,
-      max: 10
+      zero: !1,
+      unit: !1,
+      factorable: !1,
+      allowNullMonom: !0,
+      numberOfMonoms: 0,
+      positive: !0
     }, this._config = this.mergeConfig(t, this._defaultConfig);
   }
 }
-class j {
-  constructor(...e) {
-    r(this, "_A");
-    r(this, "_B");
-    r(this, "_C");
-    r(this, "_lines");
-    r(this, "_middles");
-    r(this, "_remarquables");
-    // ------------------------------------------
-    // Creation / parsing functions
+class T {
+  /**
+   * Random boolean with a percent ratio
+   * @param percent
+   */
+  static randomBool(e = 0.5) {
+    return Math.random() < e;
+  }
+  /**
+   * Random integer between two values.
+   * @param a (number) : From this value to the second value. If the second is ommited, this value is the max value.
+   * @param b (number) : To this value. If this is ommited.
+   */
+  static randomInt(e, t, i) {
+    if (t === void 0)
+      return e >= 0 ? this.randomInt(0, e) : this.randomInt(e, 0);
+    if (e === t)
+      return e;
+    if (i === void 0)
+      return Math.floor(Math.random() * (t - e + 1) + e);
+    if (Math.abs(t - e) <= i.length)
+      throw new Error("The number of excluded values is too high.");
+    let s = this.randomInt(e, t);
+    for (; i.includes(s); )
+      s = this.randomInt(e, t);
+    return s;
+  }
+  /**
+   * Random integer between -max and max value.
+   * @param max (number) : determine the limits.
+   * @param zero (bool) : determine if zero is allowed or not.
+   */
+  static randomIntSym(e, t) {
+    return t === !1 ? this.randomBool() ? this.randomInt(1, e) : -this.randomInt(1, e) : this.randomInt(-e, e);
+  }
+  static randomPrime(e) {
+    let t = x.primes();
+    return e !== void 0 && (t = t.filter((i) => i < e)), this.randomItem(t);
+  }
+  static randomArray(e, t) {
+    return t === void 0 && (t = 1), e.length <= 0 ? Object.values(e) : T.shuffleArray(e).slice(0, t);
+  }
+  static randomItem(e) {
+    return e.length === 0 ? "" : e[this.randomInt(0, e.length - 1)];
+  }
+  static shuffleArray(e) {
+    let t = Object.values(e);
+    for (let i = t.length - 1; i > 0; i--) {
+      const s = Math.floor(Math.random() * (i + 1)), n = t[i];
+      t[i] = t[s], t[s] = n;
+    }
+    return t;
+  }
+}
+class le extends D {
+  constructor(t) {
+    super();
+    r(this, "generate", () => {
+      let t = new h();
+      if (this._config.negative ? t.numerator = w.numberSym(this._config.max, this._config.zero) : t.numerator = w.number(this._config.zero ? 0 : 1, this._config.max), this._config.natural)
+        t.denominator = 1;
+      else {
+        let i = 0;
+        for (; t.isRelative() && i < 10; )
+          t.denominator = w.number(1, this._config.max), i++;
+      }
+      return this._config.reduced ? t.reduce() : t;
+    });
+    this._defaultConfig = {
+      negative: !0,
+      max: 10,
+      reduced: !0,
+      zero: !0,
+      natural: !1
+    }, this._config = this.mergeConfig(t, this._defaultConfig);
+  }
+}
+class ae {
+  constructor() {
+    r(this, "x");
+    r(this, "y");
+  }
+}
+const V = class V {
+  constructor(...e) {
+    r(this, "_x");
+    // 1st component
+    r(this, "_y");
+    // 2nd component
+    r(this, "_exist");
     // ------------------------------------------
-    /**
-     * Parse values to a triangle. Supported formats:
-     * Point, Point, Point
-     * x1, y1, x2, y2, x3, y3
-     * TODO: Something else ?
-     * @param values
-     */
     r(this, "parse", (...e) => {
-      if (e.length === 6) {
-        let t = e.map((i) => new h(i));
-        return this.parse(
-          new y(t[0], t[1]),
-          new y(t[2], t[3]),
-          new y(t[4], t[5])
-        );
-      } else if (e.length === 3) {
-        if (e.filter((t) => typeof t == "string").length === 3)
-          return this.parse(...e.map((t) => new A(t)));
-        if (e.filter((t) => t instanceof A).length === 3) {
-          this._lines = {
-            AB: e[0],
-            BC: e[1],
-            AC: e[2]
-          };
-          let t = e[0].intersection(e[1]);
-          if (t.hasIntersection)
-            this._B = t.point.clone();
-          else
-            return this;
-          if (t = e[1].intersection(e[2]), t.hasIntersection)
-            this._C = t.point.clone();
-          else
-            return this;
-          if (t = e[2].intersection(e[0]), t.hasIntersection)
-            this._A = t.point.clone();
-          else
-            return this;
-        } else {
-          if (e.filter((t) => t instanceof y).length < 3)
-            return this.parse(
-              new y(e[0]),
-              new y(e[1]),
-              new y(e[2])
-            );
-          this._A = e[0].clone(), this._B = e[1].clone(), this._C = e[2].clone(), this._lines = {
-            AB: new A(this._A, this._B),
-            BC: new A(this._B, this._C),
-            AC: new A(this._A, this._C)
-          };
+      if (this.zero(), e.length === 0)
+        return this;
+      if (e.length === 1) {
+        if (e[0] instanceof V)
+          return this._x = e[0].x.clone(), this._y = e[0].y.clone(), this;
+        if (typeof e[0] == "string") {
+          let t = e[0].split(",");
+          if (t.length === 2)
+            return this._x = new h(t[0]).reduce(), this._y = new h(t[1]).reduce(), this;
         }
-      } else if (e.length === 1 && e[0] instanceof j)
-        return e[0].clone();
-      return this._updateTriangle(), this;
+        return e[0] instanceof ae ? (this._x = new h(e[0].x).reduce(), this._y = new h(e[0].y).reduce(), this) : this.zero();
+      }
+      return e.length === 2 ? (this._x = new h(e[0]).reduce(), this._y = new h(e[1]).reduce(), this) : this;
     });
-    /**
-     * Clone the Triangle class
-     */
-    r(this, "clone", () => (this._A = this._A.clone(), this._B = this._B.clone(), this._C = this._C.clone(), this._lines = {
-      AB: this._lines.AB.clone(),
-      BC: this._lines.BC.clone(),
-      AC: this._lines.AC.clone()
-    }, this._updateTriangle(), this));
+    r(this, "clone", () => (this._x = this._x.clone(), this._y = this._y.clone(), this));
+    r(this, "zero", () => (this._x = new h(null), this._y = new h(null), this));
+    r(this, "origin", () => (this.zero(), this));
     // ------------------------------------------
-    // Triangle operations and properties
+    // Display functions
+    r(this, "middleOf", (e, t) => (this._x = e.x.clone().add(t.x).divide(2), this._y = e.y.clone().add(t.y).divide(2), this));
     // ------------------------------------------
-    /**
-     * Generate the Line object for the three segments of the triangle
-     */
-    r(this, "_updateTriangle", () => {
-      this._middles = {
-        AB: new y().middleOf(this._A, this._B),
-        AC: new y().middleOf(this._A, this._C),
-        BC: new y().middleOf(this._B, this._C)
-      }, this._remarquables = this._calculateRemarquableLines();
+    // Mathematical operations
+    // ------------------------------------------
+    // ------------------------------------------
+    // Vector functions
+    // ------------------------------------------
+    // ------------------------------------------
+    // Static functions
+    r(this, "translate", (e) => (this._x = this._x.add(e.x), this._y = this._y.add(e.y), this));
+    // ------------------------------------------
+    r(this, "texValues", (e) => {
+      let t = [];
+      return t.push(this._x.value.toFixed(e === void 0 ? 2 : e)), t.push(this._y.value.toFixed(e === void 0 ? 2 : e)), `\\left(${t.join(";")}\\right)`;
     });
-    /**
-     * Get the Point class for the given name
-     * @param ptName
-     */
-    r(this, "getPointByName", (e) => {
-      switch (e.toUpperCase()) {
-        case "A":
-          return this._A;
-        case "B":
-          return this._B;
-        case "C":
-          return this._C;
+    r(this, "distanceTo", (e) => {
+      let t = 0, i = new h(), s = "";
+      if (e instanceof A)
+        return e.distanceTo(this);
+      if (e instanceof V) {
+        let n = new N(this, e);
+        t = n.norm, i = n.normSquare.sqrt(), s = n.normSquare.isSquare() ? i.tex : `\\sqrt{\\frac{ ${n.normSquare.numerator} }{ ${n.normSquare.denominator} }}`;
       }
-      return this._A;
-    });
-    /**
-     * Get the vector for the segment given by name.
-     * @param ptName1
-     * @param ptName2
-     */
-    r(this, "getSegment", (e, t) => new N(
-      this.getPointByName(e),
-      this.getPointByName(t)
-    ));
-    r(this, "_calculateRemarquableLines", () => {
-      const e = this._calculateBisectors("A"), t = this._calculateBisectors("B"), i = this._calculateBisectors("C");
-      let s = {
-        medians: {
-          A: new A(this._A, this._middles.BC),
-          B: new A(this._B, this._middles.AC),
-          C: new A(this._C, this._middles.AB),
-          intersection: null
-        },
-        mediators: {
-          AB: new A(this._middles.AB, new N(this._A, this._B).normal()),
-          AC: new A(this._middles.AC, new N(this._A, this._C).normal()),
-          BC: new A(this._middles.BC, new N(this._B, this._C).normal()),
-          intersection: null
-        },
-        heights: {
-          A: new A(this._A, new N(this._B, this._C).normal()),
-          B: new A(this._B, new N(this._A, this._C).normal()),
-          C: new A(this._C, new N(this._A, this._B).normal()),
-          intersection: null
-        },
-        bisectors: {
-          A: e.internal,
-          B: t.internal,
-          C: t.internal,
-          intersection: null
-        },
-        externalBisectors: {
-          A: e.external,
-          B: t.external,
-          C: i.external,
-          intersection: null
-        }
-      };
-      return s.medians.intersection = s.medians.A.intersection(s.medians.B).point, s.mediators.intersection = s.mediators.AB.intersection(s.mediators.BC).point, s.heights.intersection = s.heights.A.intersection(s.heights.B).point, s.bisectors.intersection = s.bisectors.A.intersection(s.bisectors.B).point, s;
-    });
-    r(this, "_calculateBisectors", (e) => {
-      let t = this.lines, i, s;
-      e === "A" ? (i = t.AB, s = t.AC) : e === "B" ? (i = t.AB, s = t.BC) : e === "C" && (i = t.BC, s = t.AC);
-      let n = new A(new k(i.equation.left.clone().multiply(s.n.simplify().norm), s.equation.left.clone().multiply(i.n.simplify().norm)).reorder(!0).simplify()), o = new A(new k(i.equation.left.clone().multiply(s.n.simplify().norm), s.equation.left.clone().multiply(i.n.simplify().norm).opposed()).reorder(!0).simplify());
-      return e === "A" ? n.hitSegment(this.B, this.C) ? { internal: n, external: o } : { internal: o, external: n } : e === "B" ? n.hitSegment(this.A, this.C) ? { internal: n, external: o } : { internal: o, external: n } : e === "C" ? n.hitSegment(this.B, this.A) ? { internal: n, external: o } : { internal: o, external: n } : { internal: n, external: o };
-    });
-    return e.length > 0 && this.parse(...e), this;
-  }
-  // ------------------------------------------
-  // Getter and setters
-  // ------------------------------------------
-  get A() {
-    return this._A;
-  }
-  get B() {
-    return this._B;
-  }
-  get C() {
-    return this._C;
-  }
-  get AB() {
-    return this.getSegment("A", "B");
-  }
-  get BA() {
-    return this.getSegment("B", "A");
-  }
-  get BC() {
-    return this.getSegment("B", "C");
+      return { value: t, fraction: i, tex: s };
+    });
+    r(this, "isInListOfPoints", (e) => e.map((i) => i.key).includes(this.key));
+    r(this, "isEqual", (e) => this.x.isEqual(e.x) && this.y.isEqual(e.y));
+    return this._x = new h().zero(), this._y = new h().zero(), e !== void 0 && this.parse(...e), this;
   }
-  get CB() {
-    return this.getSegment("C", "B");
+  // ------------------------------------------
+  // Getter and setter
+  // ------------------------------------------
+  get x() {
+    return this._x;
   }
-  get AC() {
-    return this.getSegment("A", "C");
+  set x(e) {
+    this._x = e;
   }
-  get CA() {
-    return this.getSegment("C", "A");
+  get y() {
+    return this._y;
   }
-  get isRectangle() {
-    return !!(this.AB.isNormalTo(this.BC) || this.AB.isNormalTo(this.AC) || this.BC.isNormalTo(this.AC));
+  set y(e) {
+    this._y = e;
   }
-  get isEquilateral() {
-    return this.AB.normSquare.isEqual(this.BC.normSquare) && this.AB.normSquare.isEqual(this.AC.normSquare);
+  get tex() {
+    let e = [];
+    return e.push(this._x.tex), e.push(this._y.tex), `\\left(${e.join(";")}\\right)`;
   }
-  get isIsocele() {
-    return this.AB.normSquare.isEqual(this.BC.normSquare) || this.AB.normSquare.isEqual(this.AC.normSquare) || this.BC.normSquare.isEqual(this.AC.normSquare);
+  get display() {
+    let e = [];
+    return e.push(this._x.tex), e.push(this._y.tex), `(${e.join(";")})`;
   }
-  get lines() {
-    return this._lines;
+  get asVector() {
+    return new N(this.x, this.y);
   }
-  get remarquables() {
-    return this._remarquables;
+  // ------------------------------------------
+  // Creation / parsing functions
+  get key() {
+    return `${this.x.display};${this.y.display}`;
   }
-}
-class G {
+};
+// ------------------------------------------
+r(V, "pmatrix", (e, t, i) => i === void 0 ? `\\begin{pmatrix} ${e.tex ? e.tex : e} \\\\ ${t.tex ? t.tex : t} \\end{pmatrix}` : `\\begin{pmatrix} ${e.tex ? e.tex : e} \\\\ ${t.tex ? t.tex : t} \\\\ ${i.tex ? i.tex : i} \\end{pmatrix}`);
+let y = V;
+const O = class O {
+  // 2nd component
   constructor(...e) {
-    r(this, "_center");
-    r(this, "_squareRadius");
-    r(this, "_cartesian");
-    r(this, "_exists");
-    /**
-     * Get the relative position between circle and line. It corresponds to the number of intersection.
-     * @param {Line} L
-     * @returns {number}
-     */
-    r(this, "relativePosition", (e) => {
-      let t = e.distanceTo(this.center), i = Math.sqrt(this._squareRadius.value);
-      return t.value - i > 1e-10 ? 0 : Math.abs(t.value - i) < 1e-10 ? 1 : 2;
-    });
-    r(this, "lineIntersection", (e) => {
-      let t = [], i;
-      if (this._cartesian === null)
-        return [];
-      const s = this._cartesian.clone(), n = e.equation.clone().isolate("x"), o = e.equation.clone().isolate("y");
-      if (n instanceof k && o instanceof k) {
-        s.replaceBy("y", o.right).simplify(), s.solve();
-        for (let l of s.solutions)
-          l.exact === !1 && isNaN(l.value) || (i = new h(l.exact === !1 ? l.value : l.exact), t.push(new y(i.clone(), o.right.evaluate(i))));
+    r(this, "_x");
+    // 1st component
+    r(this, "_y");
+    r(this, "parse", (...e) => {
+      if (this.zero(), e.length === 0)
+        return this;
+      if (e.length === 1)
+        return e[0] instanceof O ? e[0].clone() : this._parseString(e[0]);
+      if (e.length >= 2) {
+        if (e[0] instanceof y && e[1] instanceof y)
+          return this._x = e[1].x.clone().subtract(e[0].x), this._y = e[1].y.clone().subtract(e[0].y), this;
+        (e[0] instanceof h || !isNaN(e[0])) && (this._x = new h(e[0])), (e[1] instanceof h || !isNaN(e[1])) && (this._y = new h(e[1])), typeof e[0] == "object" && !isNaN(e[0].x) && !isNaN(e[0].x) && typeof e[1] == "object" && !isNaN(e[1].x) && !isNaN(e[1].x) && (this._x = new h(+e[1].x - e[0].x), this._y = new h(+e[1].y - e[0].y));
       }
-      return t;
+      return this;
     });
-    r(this, "tangents", (e) => e instanceof h ? this._tangentsWithSlope(e) : this.isPointOnCircle(e) ? this._tangentsThroughOnePointOnTheCircle(e) : this.center.distanceTo(e).value > this.radius.value ? this._tangentsThroughOnePointOutsideTheCircle(e) : (console.log("No tangents as the point is inside !"), []));
-    r(this, "isPointOnCircle", (e) => this._cartesian.test({ x: e.x, y: e.y }));
-    r(this, "getPointsOnCircle", (e) => {
-      let t = x.pythagoricianTripletsWithTarget(this._squareRadius.value, !0), i = [], s;
-      return t.forEach((n) => {
-        for (let o of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
-          s = new y(
-            this.center.x.clone().add(o[0] * n[0]),
-            this.center.y.clone().add(o[1] * n[1])
-          ), s.isInListOfPoints(i) || i.push(s);
-      }), i;
+    r(this, "clone", () => {
+      let e = new O();
+      return this._x !== null && (e.x = this._x.clone()), this._y !== null && (e.y = this._y.clone()), e;
     });
-    r(this, "_tangentsThroughOnePointOnTheCircle", (e) => {
-      let t = new N(this._center, e);
-      return [new A(e, t, ee.Perpendicular)];
+    r(this, "reset", () => (this._x = null, this._y = null, this));
+    // ------------------------------------------
+    // Mathematical operations
+    r(this, "zero", () => (this.reset(), this._x = new h(null), this._y = new h(null), this));
+    r(this, "one", () => (this._x = new h(), this._y = new h(), this));
+    // ------------------------------------------
+    r(this, "opposed", () => (this._x.opposed(), this._y.opposed(), this));
+    r(this, "add", (e) => (this._x.add(e.x), this._y.add(e.y), this));
+    r(this, "subtract", (e) => this.add(e.clone().opposed()));
+    r(this, "scalarProductWithVector", (e) => O.scalarProduct(this, e));
+    r(this, "determinantWithVector", (e) => O.determinant(this, e));
+    r(this, "normal", () => {
+      let e = this.x.clone().opposed(), t = this.y.clone();
+      return this._x = t, this._y = e, this;
     });
-    r(this, "_tangentsThroughOnePointOutsideTheCircle", (e) => {
-      let t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), s = new u("x"), n = new u("x^2+1");
-      s.multiply(t).subtract(i).pow(2), n.multiply(this.squareRadius);
-      let o = new k(s, n);
-      return o.moveLeft().simplify().solve(), o.solutions.map((l) => {
-        let a, f = new k("y", "x");
-        return l.exact instanceof h ? (a = e.x.clone().opposed().multiply(l.exact).add(e.y), f.right.multiply(l.exact).add(a)) : (a = e.x.clone().opposed().multiply(l.value).add(e.y), f.right.multiply(l.value).add(a)), new A(f);
-      });
+    r(this, "isColinearTo", (e) => this.determinantWithVector(e).isZero());
+    r(this, "isNormalTo", (e) => this.scalarProductWithVector(e).isZero());
+    r(this, "multiplyByScalar", (e) => {
+      let t = new h(e);
+      return this._x.multiply(t), this._y.multiply(t), this;
     });
-    r(this, "_tangentsWithSlope", (e) => {
-      const t = e.numerator, i = -e.denominator, s = this._center.x.clone(), n = this._center.y.clone();
-      this._squareRadius;
-      let o = this._squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), l = s.clone().multiply(t).opposed().subtract(n.clone().multiply(i)).add(o.clone().sqrt()), a = s.clone().multiply(t).opposed().subtract(n.clone().multiply(i)).subtract(o.clone().sqrt());
-      return [new A(t, i, l), new A(t, i, a)];
+    r(this, "divideByScalar", (e) => this.multiplyByScalar(new h(e).invert()));
+    r(this, "simplify", () => this.multiplyByScalar(x.lcm(this._x.denominator, this._y.denominator)).divideByScalar(x.gcd(this._x.numerator, this._y.numerator)));
+    // ------------------------------------------
+    // Vector functions
+    // ------------------------------------------
+    r(this, "simplifyDirection", () => {
+      let e = x.lcm(this.x.denominator, this.y.denominator), t = x.gcd(this.x.numerator, this.y.numerator);
+      return this.x.multiply(e).divide(t), this.y.multiply(e).divide(t), this;
     });
-    this._exists = !1, e !== void 0 && this.parse(...e);
-  }
-  get center() {
-    return this._center;
-  }
-  get squareRadius() {
-    return this._squareRadius;
-  }
-  get cartesian() {
-    return this._cartesian;
-  }
-  get exists() {
-    return this._exists;
-  }
-  get radius() {
-    return this._squareRadius.isSquare() ? {
-      tex: this._squareRadius.clone().sqrt().tex,
-      display: this._squareRadius.clone().sqrt().display,
-      value: this._squareRadius.clone().sqrt().value
-    } : {
-      tex: `\\sqrt{${this._squareRadius.tex}}`,
-      display: `sqrt(${this._squareRadius.display})`,
-      value: this._squareRadius.clone().sqrt().value
-    };
-  }
-  get tex() {
-    if (this._exists) {
-      let e, t;
-      return this._center.x.isZero() ? e = "x^2" : e = `\\left(x${this._center.x.isNegative() ? "+" : "-"}${this._center.x.clone().abs().tex}\\right)^2`, this._center.y.isZero() ? t = "y^2" : t = `\\left(y${this._center.y.isNegative() ? "+" : "-"}${this._center.y.clone().abs().tex}\\right)^2`, `${e}+${t}=${this._squareRadius.tex}`;
-    } else
-      return "\\text{le cercle n'existe pas.}";
-  }
-  get developed() {
-    return this._cartesian.tex;
-  }
-  get display() {
-    if (this._exists) {
-      let e, t;
-      return this._center.x.isZero() ? e = "x^2" : e = `(x${this._center.x.isNegative() ? "+" : "-"}${this._center.x.clone().abs().tex})^2`, this._center.y.isZero() ? t = "y^2" : t = `(y${this._center.y.isNegative() ? "+" : "-"}${this._center.y.clone().abs().tex})^2`, `${e}+${t}=${this._squareRadius.display}`;
-    } else
-      return "\\text{le cercle n'existe pas.}";
-  }
-  clone() {
-    return this._center = this._center.clone(), this._squareRadius = this._squareRadius.clone(), this._calculateCartesian(), this;
-  }
-  _reset() {
-    return this._center = null, this._squareRadius = null, this._cartesian = null, this._exists = !1, this;
-  }
-  parse(...e) {
-    return this._reset(), typeof e[0] == "string" ? this._parseEquation(new k(e[0])) : e[0] instanceof k ? this._parseEquation(e[0]) : e[0] instanceof G ? this._parseCopyCircle(e[0]) : e[0] instanceof y && e.length > 1 && (e[1] instanceof y ? e[2] instanceof y ? this._parseThroughtThreePoints(e[0], e[1], e[2]) : this._parseCenterAndPointThrough(e[0], e[1]) : (e[1] instanceof h || typeof e[1] == "number") && this._parseCenterAndRadius(e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), this._exists && (this._calculateCartesian(), this._squareRadius !== void 0 && this._squareRadius.isNegative() && (this._exists = !1)), this;
-  }
-  _calculateCartesian() {
-    this._cartesian = new k(new u(`(x-(${this._center.x.display}))^2+(y-(${this._center.y.display}))^2`), new u(`${this._squareRadius.display}`)).moveLeft();
-  }
-  _parseCopyCircle(e) {
-    return this._center = e.center.clone(), this._squareRadius = e.squareRadius.clone(), this._calculateCartesian(), this._exists = e.exists, this;
-  }
-  _parseCenterAndRadius(e, t, i) {
-    return this._center = e.clone(), i ? this._squareRadius = new h(t) : this._squareRadius = new h(t).pow(2), this._exists = !0, this;
-  }
-  _parseCenterAndPointThrough(e, t) {
-    return this._center = e.clone(), this._squareRadius = new N(this._center, t).normSquare, this._exists = !0, this;
-  }
-  _parseEquation(e) {
-    if (this._exists = !1, e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
-      let t = e.left.monomByDegree(2, "x"), i = e.left.monomByDegree(2, "y"), s, n, o;
-      t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), s = e.left.monomByDegree(1, "x"), n = e.left.monomByDegree(1, "y"), o = e.left.monomByDegree(0), this._center = new y(s.coefficient.clone().divide(2).opposed(), n.coefficient.clone().divide(2).opposed()), this._squareRadius = o.coefficient.clone().opposed().add(this._center.x.clone().pow(2)).add(this._center.y.clone().pow(2)), this._calculateCartesian(), this._exists = !0) : (this._center = null, this._squareRadius = null, this._exists = !1);
-    }
-    return this;
-  }
-  _parseThroughtThreePoints(e, t, i) {
-    let s = new j(e, t, i), n = s.remarquables.mediators.AB.clone(), o = s.remarquables.mediators.AC.clone();
-    return this.parse(n.intersection(o).point, e), this;
-  }
-}
-class ae extends D {
-  constructor(t) {
-    super();
-    r(this, "generate", () => {
-      const t = w.Geometry.point(this._config.center);
-      let i, s;
-      return this._config.pointsOnCircle === 8 ? (i = w.number(1, 3), s = i ** 2 + (i + 1) ** 2) : s = w.number(1, 20), new G(t, s, !0);
+    r(this, "angleWith", (e, t, i) => {
+      let s = this.scalarProductWithVector(e).value, n = i ? 1 : 180 / Math.PI;
+      return t && (s = Math.abs(s)), n * Math.acos(s / (this.norm * e.norm));
     });
-    this._defaultConfig = {}, this._config = this.mergeConfig(t, this._defaultConfig);
-  }
-}
-var w;
-((c) => {
-  function e(d) {
-    return new se(d).generate();
+    r(this, "_parseString", (e) => {
+      let t = e.split(/[,;\s]/g);
+      return this.x = new h(t[0] || null), this.y = new h(t[1] || null), this;
+    });
+    this._x = new h().zero(), this._y = new h().zero(), e !== void 0 && this.parse(...e);
   }
-  c.polynom = e;
-  function t(d) {
-    return new Q(d).generate();
+  // ------------------------------------------
+  // Getter and setter
+  // ------------------------------------------
+  get x() {
+    return this._x;
   }
-  c.monom = t;
-  function i(d) {
-    return new re(d).generate();
+  set x(e) {
+    this._x = new h(e);
   }
-  c.fraction = i;
-  function s(d, p, _) {
-    return T.randomInt(d, p, _);
+  get y() {
+    return this._y;
   }
-  c.number = s;
-  function n(d, p) {
-    return T.randomIntSym(d, p);
+  set y(e) {
+    this._y = new h(e);
   }
-  c.numberSym = n;
-  function o(d) {
-    return T.randomPrime(d);
+  get normSquare() {
+    return this._x.clone().pow(2).add(this._y.clone().pow(2));
   }
-  c.prime = o;
-  function l(d) {
-    return T.randomBool(d);
+  get norm() {
+    return Math.sqrt(this.normSquare.value);
   }
-  c.bool = l;
-  function a(d, p) {
-    return T.randomArray(d, p);
+  get tex() {
+    return `\\begin{pmatrix}${this._x.tex} \\\\ ${this._y.tex} \\end{pmatrix}`;
   }
-  c.array = a;
-  function f(d) {
-    return T.randomItem(d);
+  get asPoint() {
+    return new y(this.x, this.y);
   }
-  c.item = f;
-  function m(d) {
-    return T.shuffleArray(d);
+  // ------------------------------------------
+  // Creation / parsing functions
+  // ------------------------------------------
+  get isNull() {
+    return this.x.isZero() && this.y.isZero();
   }
-  c.shuffle = m, ((d) => {
-    function p(v) {
-      return new oe(v).generate();
-    }
-    d.line = p;
-    function _(v) {
-      return new le(v).generate();
-    }
-    d.point = _;
-    function q(v) {
-      return new ae(v).generate();
-    }
-    d.circle = q;
-  })(c.Geometry || (c.Geometry = {}));
-})(w || (w = {}));
-class Y {
+};
+r(O, "scalarProduct", (e, t) => e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y))), r(O, "determinant", (e, t) => e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)));
+let N = O;
+var ee = /* @__PURE__ */ ((c) => (c[c.None = 0] = "None", c.Parallel = "parallel", c.Perpendicular = "perpendicular", c.Tangent = "tangent", c))(ee || {});
+const z = class z {
+  /**
+   * Value can be a mix of:
+   *
+   * @param values
+   */
   constructor(...e) {
-    // Stores the original equations
-    r(this, "_equations");
-    // Determine the letters in the linear system, usually ['x', 'y']
-    r(this, "_letters");
-    // Resolution steps contains each steps
-    // letter : target letter
-    // steps: {system: current LinearSystem, operations: [*3,/5] or [[*3,*2], [,*5], [*2,]]}
-    r(this, "_resolutionSteps");
-    // Get the solution of the equation
-    r(this, "_solutions");
-    r(this, "buildTex", (e, t) => {
-      let i, s = [], n, o = [];
-      for (let a of e)
-        o = o.concat(a.letters());
-      o = [...new Set(o)], o.sort();
-      for (let a = 0; a < e.length; a++) {
-        let f = e[a];
-        i = [];
-        for (let m of o)
-          n = f.left.monomByLetter(m), i.length === 0 ? i.push(n.isZero() ? "" : n.tex) : i.push(n.isZero() ? "" : (n.coefficient.sign() === 1 ? "+" : "") + n.tex);
-        if (i.push("="), i.push(f.right.tex), t !== void 0 && t[a] !== void 0) {
-          i[i.length - 1] = i[i.length - 1] + " \\phantom{\\quad}";
-          for (let m of t[a])
-            i.push(`\\ \\cdot\\ ${m.startsWith("-") ? "\\left(" + m + "\\right)" : m}`);
-        }
-        s.push(i.join("&"));
-      }
-      let l = 0;
-      return t !== void 0 && t.length > 0 && (l = t[0].length), `\\left\\{\\begin{array}{${"r".repeat(o.length)}cl ${"|l".repeat(l)}}${s.join("\\\\ ")}\\end{array}\\right.`;
-    });
-    r(this, "stepTex", (e) => {
-      const t = this._resolutionSteps[e];
-      if (t === void 0)
-        return "";
-      let i = [];
-      for (let s = 0; s < t.length; s++)
-        i.push(this.buildTex(t[s].equations, t[s].operations));
-      return `\\begin{aligned}&${i.join("\\\\&")}\\end{aligned}`;
+    r(this, "_referencePropriety");
+    r(this, "_referenceLine");
+    r(this, "_reduceBeforeDisplay");
+    // ax + by + c = 0
+    r(this, "_a");
+    r(this, "_b");
+    r(this, "_c");
+    r(this, "_OA");
+    r(this, "_d");
+    r(this, "_n");
+    r(this, "_exists");
+    r(this, "randomPoint", (e) => this._d.clone().multiplyByScalar(w.numberSym(e === void 0 || e <= 1 ? 3 : e, !1)).add(this._OA.asVector).asPoint);
+    r(this, "randomNearPoint", (e) => {
+      let t = this.randomPoint(e), i = 10;
+      for (; this.isOnLine(t) && i > 0; )
+        t.x.add(w.numberSym(1, !1)), t.y.add(w.numberSym(1, !1)), i--;
+      return t;
     });
     // ------------------------------------------
     // Creation / parsing functions
     // ------------------------------------------
-    r(this, "parse", (...e) => (this._equations = e.map((t) => new k(t)), this._findLetters(), this));
-    r(this, "clone", () => new Y().parse(...this._equations.map((e) => e.clone())));
+    /**
+     * Parse data to a line
+     * @param {any} values
+     * @returns {Line}
+     */
+    r(this, "parse", (...e) => {
+      if (this._exists = !1, e.length === 0)
+        return this;
+      if (e.length === 1) {
+        if (e[0] instanceof z)
+          return e[0].clone();
+        if (e[0] instanceof k)
+          return this.parseEquation(e[0]);
+        if (typeof e[0] == "string")
+          try {
+            let t = new k(e[0]);
+            return this.parse(t);
+          } catch {
+            return this;
+          }
+      }
+      if (e.length === 2) {
+        if (e[0] instanceof y && e[1] instanceof N)
+          return this.parseByPointAndVector(e[0], e[1]);
+        if (e[0] instanceof y && e[1] instanceof y)
+          return this.parseByPointAndVector(e[0], new N(e[0], e[1]));
+        if (e[0] instanceof N && e[1] instanceof y)
+          return this.parseByPointAndNormal(e[1], e[0]);
+      }
+      if (e.length === 3) {
+        if ((e[0] instanceof h || typeof e[0] == "number") && (e[1] instanceof h || typeof e[1] == "number") && (e[2] instanceof h || typeof e[2] == "number"))
+          return this.parseByCoefficient(e[0], e[1], e[2]);
+        if (e[0] instanceof y && e[1] instanceof N) {
+          if (e[2] === "perpendicular")
+            return this.parseByPointAndNormal(e[0], e[1]);
+          if (e[2] === "parallel")
+            return this.parseByPointAndVector(e[0], e[1]);
+        } else if (e[0] instanceof y && e[1] instanceof z)
+          return e[2] === "parallel" || e[2] === null ? this.parseByPointAndLine(
+            e[0],
+            e[1],
+            "parallel"
+            /* Parallel */
+          ) : this.parseByPointAndLine(
+            e[0],
+            e[1],
+            "perpendicular"
+            /* Perpendicular */
+          );
+      }
+      return console.log("Someting wrong happend while creating the line"), this;
+    });
+    r(this, "parseEquation", (e) => {
+      e.reorder(!0);
+      let t = new Set(e.letters());
+      if (!(t.has("x") || t.has("y")))
+        return this;
+      for (let i of ["x", "y"])
+        t.has(i) && t.delete(i);
+      return t.size > 0 ? this : this.parseByCoefficient(e.left.monomByLetter("x").coefficient, e.left.monomByLetter("y").coefficient, e.left.monomByDegree(0).coefficient);
+    });
+    r(this, "parseByCoefficient", (e, t, i) => (this._a = new h(e), this._b = new h(t), this._c = new h(i), this._d = new N(this._b.clone(), this._a.clone().opposed()), this._OA = new y(new h().zero(), this._c.clone()), this._n = this._d.clone().normal(), this._exists = !0, this));
+    r(this, "parseByPointAndVector", (e, t) => (this.parseByCoefficient(
+      t.y,
+      t.x.clone().opposed(),
+      e.x.clone().multiply(t.y).subtract(e.y.clone().multiply(t.x)).opposed()
+    ), this._OA = e.clone(), this._d = t.clone(), this._n = this._d.clone().normal(), this._exists = !0, this));
+    r(this, "parseByPointAndNormal", (e, t) => this.parseByCoefficient(
+      t.x,
+      t.y,
+      e.x.clone().multiply(t.x).add(e.y.clone().multiply(t.y)).opposed()
+    ));
+    r(this, "parseByPointAndLine", (e, t, i) => (i === void 0 && (i = "parallel"), i === "parallel" ? this.parseByPointAndNormal(e, t.normal) : i === "perpendicular" ? this.parseByPointAndNormal(e, t.director) : (this._exists = !1, this)));
+    r(this, "clone", () => (this._a = this._a.clone(), this._b = this._b.clone(), this._c = this._c.clone(), this._d = this._d.clone(), this._OA = this._OA.clone(), this._n = this._n.clone(), this._exists = this.exists, this));
     // ------------------------------------------
-    r(this, "reorder", () => {
-      for (let e of this._equations)
-        e.reorder();
-      return this;
+    // Mathematical operations
+    // ------------------------------------------
+    r(this, "isOnLine", (e) => this._a.clone().multiply(e.x).add(
+      this._b.clone().multiply(e.y)
+    ).add(this._c).isZero());
+    r(this, "isParallelTo", (e) => this.slope.isEqual(e.slope) && this.height.isNotEqual(e.height));
+    r(this, "isSameAs", (e) => this.slope.isEqual(e.slope) && this.height.isEqual(e.height));
+    r(this, "isPerpendicularTo", (e) => this.d.isNormalTo(e.d));
+    r(this, "isVertical", () => this.slope.isInfinity());
+    r(this, "simplify", () => {
+      let e = x.lcm(this._a.denominator, this._b.denominator, this._c.denominator), t = x.gcd(this._a.numerator, this._b.numerator, this._c.numerator);
+      return this.parseByCoefficient(
+        this._a.clone().multiply(e).divide(t),
+        this._b.clone().multiply(e).divide(t),
+        this._c.clone().multiply(e).divide(t)
+      ), this;
     });
-    // -----------------------------------------------
-    // Equations solving algorithms
-    r(this, "solve", (e) => {
-      this._solutions = {}, this._resolutionSteps = {}, this.reorder(), e === void 0 && (e = !1);
-      for (let t of this.variables)
-        this._solutions[t] = this._solveOneLetter(t, e);
-      return this;
+    r(this, "simplifyDirection", () => (this._d.simplifyDirection(), this));
+    r(this, "intersection", (e) => {
+      let t = new y(), i = !1, s = !1;
+      return this._b.isZero() || e.b.isZero(), this.isParallelTo(e) ? (t.x = null, t.y = null, i = !0) : this.isSameAs(e) ? (t.x = null, t.y = null, s = !0) : (t.x = this._b.clone().multiply(e.c).subtract(this._c.clone().multiply(e.b)).divide(this._a.clone().multiply(e.b).subtract(this._b.clone().multiply(e.a))), t.y = this._a.clone().multiply(e.c).subtract(this._c.clone().multiply(e.a)).divide(this._b.clone().multiply(e.a).subtract(this._a.clone().multiply(e.b)))), {
+        point: t,
+        hasIntersection: !(i || s),
+        isParallel: i,
+        isSame: s
+      };
     });
-    r(this, "mergeEquations", (e, t, i, s) => {
-      let n = e.clone().multiply(new h(i)), o = t.clone().multiply(new h(s));
-      return n.left.add(o.left), n.right.add(o.right), n;
+    r(this, "getValueAtX", (e) => {
+      const t = this.equation.clone().isolate("y"), i = new h(e);
+      if (t instanceof k)
+        return t.right.evaluate({ x: i });
     });
-    r(this, "_findLetters", () => {
-      let e = /* @__PURE__ */ new Set();
-      for (let t of this._equations)
-        e = /* @__PURE__ */ new Set([...e, ...t.variables]);
-      return this._letters = [...e], this._letters.sort(), this;
+    r(this, "getValueAtY", (e) => {
+      const t = this.equation.clone().isolate("x"), i = new h(e);
+      if (t instanceof k)
+        return t.right.evaluate({ y: i });
     });
-    return this._equations = [], this._letters = "xyz".split(""), e !== void 0 && e.length > 0 && this.parse(...e), this;
+    return this._exists = !1, this._reduceBeforeDisplay = !0, e.length > 0 && this.parse(...e), this;
+  }
+  get a() {
+    return this._a;
   }
   // ------------------------------------------
   // Getter and setter
-  // ------------------------------------------
-  get equations() {
-    return this._equations;
-  }
-  set equations(e) {
-    this._equations = e;
+  set a(e) {
+    this._a = e;
   }
-  get letters() {
-    return this._letters.join("");
+  get b() {
+    return this._b;
   }
-  set letters(e) {
-    this._letters = e.split("");
+  set b(e) {
+    this._b = e;
   }
-  get isSolvable() {
-    return this.variables.length === this._equations.length;
+  get c() {
+    return this._c;
   }
-  get variables() {
-    return this._letters;
+  set c(e) {
+    this._c = e;
   }
-  get tex() {
-    let e = this.clone().reorder();
-    return e.variables, this.buildTex(e.equations);
+  get OA() {
+    return this._OA;
   }
-  get solution() {
-    let e = [];
-    this._solutions === void 0 && this.solve();
-    for (let t in this._solutions) {
-      if (this._solutions[t].display === "RR")
-        return `\\left\\{ \\left(${this._letters.join(";")}\\right) \\big\\vert ${this.equations[0].tex} \\right\\}`;
-      if (this._solutions[t].display === "O/")
-        return "\\varnothing";
-      e.push(this._solutions[t].tex);
-    }
-    return `\\left(${e.join(";")}\\right)`;
+  set OA(e) {
+    this._OA = e;
   }
-  get solutionAsDisplay() {
-    let e = [];
-    this._solutions === void 0 && this.solve();
-    for (let t in this._solutions) {
-      if (this._solutions[t].display === "RR")
-        return `{(${this._letters.join(";")}) | ${this.equations[0].display} }`;
-      if (this._solutions[t].display === "O/")
-        return "O/";
-      e.push(this._solutions[t].display);
-    }
-    return `(${e.join(";")})`;
+  get d() {
+    return this._d;
   }
-  get resolutionSteps() {
-    return this._resolutionSteps;
+  set d(e) {
+    this._d = e;
   }
-  _linearReduction(e, t, i) {
-    let s = e.left.monomByDegree(1, i).coefficient.clone(), n = t.left.monomByDegree(1, i).coefficient.clone().opposed();
-    const o = x.gcd(s.numerator, n.numerator), l = x.gcd(s.denominator, n.denominator);
-    return s.divide(o).multiply(l), n.divide(o).multiply(l), (n.isNegativeOne() || s.isNegativeOne()) && (s.opposed(), n.opposed()), {
-      merged: this.mergeEquations(e, t, n, s),
-      factors: [n, s]
-    };
+  get n() {
+    return this._n;
   }
-  /**
-   * Linear reduction of the equations to have only one letter
-   * @param letter    letter to isolate
-   * @private
-   */
-  _solveOneLetter(e, t) {
-    let i = this.clone().equations, s = [], n;
-    this._resolutionSteps[e] = [];
-    for (let a of this.variables)
-      if (s = [], a !== e) {
-        t && (this._resolutionSteps[e].push({
-          equations: i.map((f) => f.clone()),
-          operations: [...new Array(i.length)].map((f) => [...new Array(i.length - 1)].map((m) => ""))
-        }), n = this._resolutionSteps[e].length - 1);
-        for (let f = 0; f < i.length - 1; f++) {
-          const m = this._linearReduction(i[f], i[f + 1], a);
-          s.push(m.merged), t && (this._resolutionSteps[e][n].operations[f][f] = m.factors[0].tex, this._resolutionSteps[e][n].operations[f + 1][f] = m.factors[1].tex);
-        }
-        i = [...s];
-      }
-    let o = i[0];
-    o.solve();
-    const l = o.solutions[0];
-    if (t) {
-      this._resolutionSteps[e].push({
-        equations: [i[0]],
-        operations: [[i[0].left.monoms[0].coefficient.tex]]
-      });
-      let a;
-      l.exact instanceof h || typeof l.exact == "string" ? a = new u(l.exact) : a = new u(l.value), this._resolutionSteps[e].push({
-        equations: [new k(new u(e), a)],
-        operations: []
-      });
-    }
-    return o.solutions[0];
+  get exists() {
+    return this._exists;
   }
-}
-var L = /* @__PURE__ */ ((c) => (c.ZERO = "z", c.DEFENCE = "d", c.NOTHING = "t", c))(L || {}), M = /* @__PURE__ */ ((c) => (c.VERTICAL = "av", c.HORIZONTAL = "ah", c.SLOPE = "ao", c.HOLE = "hole", c))(M || {}), E = /* @__PURE__ */ ((c) => (c.LT = "LT", c.RT = "RT", c.LB = "LB", c.RB = "RB", c))(E || {}), H = /* @__PURE__ */ ((c) => (c.MIN = "min", c.MAX = "max", c.FLAT = "flat", c.NOTHING = "", c))(H || {}), W = /* @__PURE__ */ ((c) => (c.SIGNS = "signs", c.GROWS = "grows", c.VARIATIONS = "variatins", c))(W || {});
-class he {
-  constructor(e, t) {
-    r(this, "fx");
-    r(this, "_asymptotes");
-    r(this, "_derivative");
-    r(this, "_signs");
-    r(this, "_variations");
-    r(this, "_zeroes");
-    r(this, "_config");
-    r(this, "_name");
-    r(this, "makeStudy", () => {
-      this._zeroes = this.makeZeroes(), this._config.signs && (this._signs = this.makeSigns()), this._config.asymptotes && (this._asymptotes = this.makeAsymptotes()), this._config.derivative && (this._derivative = this.makeDerivative()), this._config.variations && (this._variations = this.makeVariation()), this._config.signs && (this._signs.tex = this.texSigns), this._config.derivative && (this._derivative.tex = this.texGrows), this._config.variations && (this._variations.tex = this.texVariations);
-    });
-    r(this, "indexOfZero", (e, t) => {
-      for (let i = 0; i < e.length; i++)
-        if (e[i].tex === t.tex)
-          return i;
-      return -1;
-    });
-    r(this, "makeOneLineForSigns", (e, t, i) => {
-      let s = [], n = e.getZeroes().map((o) => o.tex);
-      s.push(""), e.degree().isZero() ? s.push(e.monoms[0].coefficient.sign() === 1 ? "+" : "-") : s.push(e.evaluate(t[0].value - 1).sign() === 1 ? "+" : "-");
-      for (let o = 0; o < t.length; o++)
-        s.push(
-          n.includes(t[o].tex) ? i : "t"
-          /* NOTHING */
-        ), o < t.length - 1 ? s.push(e.evaluate((t[o].value + t[o + 1].value) / 2).sign() === 1 ? "+" : "-") : o === t.length - 1 && s.push(e.evaluate(t[o].value + 1).sign() === 1 ? "+" : "-");
-      return s.push(""), s;
-    });
-    r(this, "makeSignsResult", (e) => {
-      let t = e[0].map((i, s) => s === 0 || s === e[0].length - 1 ? "" : s % 2 === 0 ? "t" : "+");
-      for (let i of e)
-        for (let s = 0; s < i.length; s++)
-          if (s % 2 === 0) {
-            if (t[s] === "d")
-              continue;
-            i[s] !== "t" && (t[s] = i[s]);
-          } else
-            i[s] === "-" && (t[s] = t[s] === "+" ? "-" : "+");
-      return t;
-    });
-    r(this, "makeGrowsResult", (e) => {
-      let t = Object.values(e.signs), i = t[t.length - 1], s = [], n = {}, o = e.zeroes;
-      for (let l = 0; l < o.length; l++) {
-        let a = 2 * l + 2;
-        if (i[a] === "z") {
-          let f, m, d = o[l].exact, p, _, q, v = new K(this.fx.plotFunction);
-          if (d instanceof h) {
-            let B = d, S = this.fx.evaluate(B);
-            f = d.value, m = S.value, p = d.tex, _ = S.tex;
-          } else
-            f = o[l].value, m = v.evaluate({ x: f }), p = f.toFixed(2), _ = m.toFixed(2);
-          i[a - 1] === i[a + 1] ? q = "flat" : i[a - 1] === "+" ? q = "max" : q = "min", n[o[l].tex] = {
-            type: q,
-            tex: { x: p, y: _ },
-            value: { x: f, y: m }
-          };
-        }
-      }
-      s.push(i[1] === "+" ? "-/" : "+/");
-      for (let l = 1; l < i.length - 1; l++)
-        if (i[l] === "z") {
-          let a = n[o[(l - 2) / 2].tex];
-          s.push(`${i[l - 1]}/\\(${a.type}(${a.tex.x};${a.tex.y})\\)`);
-        } else
-          i[l] === "d" && s.push(`${i[l - 1]}D${i[l + 1] === "+" ? "-" : "+"}/`);
-      return s.push(`${i[i.length - 2]}/`), { growsLine: s, extremes: n };
-    });
-    r(this, "makeVariationsResult", (e) => ({ varsLine: [], extremes: {} }));
-    r(this, "drawCode", () => {
-      let e = `f(x)=${this.fx.plotFunction}`, t = 1;
-      this.asymptotes.forEach((i) => {
-        i.type === "av" ? (e += `
-av_${t}=line x=${i.zero.value}->red,dash`, t++) : i.type === "ah" ? e += `
-ah=line y=${i.fx.monoms[0].coefficient.value}->orange,dash` : i.type === "ao" && (e += `
-ao=line y=${i.fx.plotFunction}->red,dash`), t++;
-      });
-      for (let i in this.derivative.extremes) {
-        let s = this.derivative.extremes[i];
-        e += `
-M_${t}(${s.value.x},${s.value.y})*`, t++;
-      }
-      return this.zeroes.forEach((i) => {
-        i.type === "z" && (e += `
-Z_${t}(${i.value},0)*`, t++);
-      }), e;
-    });
-    r(this, "_makeTexFromTableOfSigns", (e) => {
-      let t = e.factors.map((l) => `\\(${l.tex}\\)/1`), i = `\\(${this._config.name}(${this._config.variable})\\)/1.2`, s = e.zeroes;
-      e.type === "grows" ? i = `\\(${this._config.name}'(${this._config.variable})\\)/1.2,\\(f(x${this._config.variable})\\)/2` : e.type === "variatins" && (i = `\\(${this._config.name}''(${this._config.variable})\\)/1.2,\\(f(${this._config.variable})\\)/2`);
-      let n = `\\begin{tikzpicture}
-\\tkzTabInit[lgt=3,espcl=2,deltacl=0]{/1.2,${t.join(",")},/.1,${i} }{{\\scriptsize \\hspace{1cm} \\(-\\infty\\)},\\(${s.map((l) => l.tex).join("\\),\\(")}\\),{\\scriptsize \\hspace{-1cm} \\(+\\infty\\)}}`, o;
-      for (o = 0; o < e.factors.length; o++)
-        n += `
-\\tkzTabLine{${e.signs[o].join(",")}}`;
-      return n += `
-\\tkzTabLine{${e.signs[o].join(",")}}`, e.type === "grows" ? n += `
-\\tkzTabVar{${e.signs[o + 1].join(",")}}` : e.type === "variatins" && (n += `
-\\tkzTabVar{${e.signs[o + 1].join(",")}}`), n += `
-\\end{tikzpicture}`, n;
-    });
-    if (this.fx = e, this._config = {
-      name: "f",
-      variable: "x",
-      domain: !0,
-      asymptotes: !0,
-      signs: !0,
-      derivative: !0,
-      variations: !0
-    }, t)
-      if (typeof t == "string") {
-        const i = t.split(",");
-        this._config = {};
-        let s = i.filter((n) => n.includes("(") && n.includes(")"));
-        s.length === 1 && (this._config.name = s[0].split("(")[0], this._config.variable = s[0].split("(")[1].split(")")[0]), this._config.domain = i.includes("d"), this._config.asymptotes = i.includes("a"), this._config.signs = i.includes("signs"), this._config.derivative = i.includes("dx"), this._config.variations = i.includes("ddx");
-      } else
-        this._config = t;
-    return this.makeStudy(), this;
+  // ------------------------------------------
+  get equation() {
+    let e = new k(new u().parse("xy", this._a, this._b, this._c), new u("0"));
+    return this._reduceBeforeDisplay ? e.simplify() : e;
   }
-  get name() {
-    return this._config.name;
+  get system() {
+    let e = new k(
+      new u("x"),
+      new u(this._OA.x).add(new g("k").multiplyByNumber(this._d.x))
+    ), t = new k(
+      new u("y"),
+      new u(this._OA.y).add(new g("k").multiplyByNumber(this._d.y))
+    );
+    return { x: e, y: t };
   }
-  set name(e) {
-    this._config.name = e;
+  get tex() {
+    let e = this.equation.clone().reorder(!0);
+    this._a.isNegative() && e.multiply(-1);
+    let t = this._d.clone();
+    return this._reduceBeforeDisplay && t.simplifyDirection(), {
+      canonical: e.tex,
+      equation: e.clone().reorder().tex,
+      mxh: this.slope.isInfinity() ? "x=" + this.OA.x.tex : "y=" + new u().parse("x", this.slope, this.height).tex,
+      parametric: `${y.pmatrix("x", "y")} = ${y.pmatrix(this._OA.x, this._OA.y)} + k\\cdot ${y.pmatrix(t.x, t.y)}`,
+      system: `\\left\\{\\begin{aligned}
+            x &= ${new u(this._OA.x).add(new g(this._d.x).multiply(new g("k"))).reorder("k", !0).tex}\\\\ 
+            y &= ${new u(this._OA.y).add(new g(this._d.y).multiply(new g("k"))).reorder("k", !0).tex}
+            \\end{aligned}\\right.`
+    };
   }
-  get config() {
-    return this._config;
+  get reduceBeforeDisplay() {
+    return this._reduceBeforeDisplay;
   }
-  set config(e) {
-    this._config = e;
+  set reduceBeforeDisplay(e) {
+    this._reduceBeforeDisplay = e;
+  }
+  get display() {
+    let e = this.equation;
+    return this._a.isNegative() && e.multiply(-1), {
+      canonical: e.display,
+      mxh: this.slope.isInfinity() ? "x=" + this.OA.x.display : "y=" + new u().parse("x", this.slope, this.height).display,
+      parametric: ""
+    };
   }
-  get zeroes() {
-    return this._zeroes;
+  get normal() {
+    return new N(this._a, this._b);
   }
-  get domain() {
-    return this.fx.domain();
+  get director() {
+    return this._d.clone();
   }
-  get signs() {
-    return this._signs;
+  get slope() {
+    return this._a.clone().opposed().divide(this._b);
   }
-  get asymptotes() {
-    return this._asymptotes;
+  get height() {
+    return this._c.clone().opposed().divide(this._b);
   }
-  get derivative() {
-    return this._derivative;
+  distanceTo(e) {
+    let t = e.x.clone().multiply(this._a).add(e.y.clone().multiply(this._b)).add(this._c).abs(), i = this.normal.normSquare;
+    if (i.isZero())
+      return {
+        value: NaN,
+        tex: "Not a line",
+        fraction: new h().infinite()
+      };
+    let s = t.value / Math.sqrt(i.value), n = t.clone().divide(i.clone().sqrt());
+    return i.isSquare() ? {
+      value: s,
+      tex: n.tex,
+      fraction: n
+    } : {
+      value: s,
+      tex: `\\frac{${t.tex}}{\\sqrt{${i.tex}}}`,
+      fraction: n
+    };
   }
-  get texSigns() {
-    return this._makeTexFromTableOfSigns(this._signs);
+  hitSegment(e, t) {
+    let i = this.intersection(
+      new z(e, t)
+    );
+    return i.hasIntersection ? i.point.x.value >= Math.min(e.x.value, t.x.value) && i.point.x.value <= Math.max(e.x.value, t.x.value) && i.point.y.value >= Math.min(e.y.value, t.y.value) && i.point.y.value <= Math.max(e.y.value, t.y.value) : !1;
   }
-  get texGrows() {
-    return this._makeTexFromTableOfSigns(this._derivative);
+  // ------------------------------------------
+  // Special functions
+  // ------------------------------------------
+  canonicalAsFloatCoefficient(e) {
+    e === void 0 && (e = 2), this._a.value, this._b.value, this._c.value;
+    let t = "";
+    return this._a.isZero() || (this._a.isOne() ? t = "x" : this._a.clone().opposed().isOne() ? t = "-x" : t = this._a.value.toFixed(e) + "x"), this._b.isZero() || (this._b.isPositive() && (t += "+"), t += this._b.value.toFixed(e) + "y"), this._c.isZero() || (this._c.isPositive() && (t += "+"), t += this._c.value.toFixed(e)), t + "=0";
   }
-  get texVariations() {
-    return this._makeTexFromTableOfSigns(this._variations);
+};
+// A line is defined as the canonical form
+r(z, "PERPENDICULAR", "perpendicular"), r(z, "PARALLEL", "parallel");
+let A = z;
+class he extends D {
+  constructor(t) {
+    super();
+    r(this, "generate", () => {
+      const t = new N(
+        w.numberSym(10),
+        w.numberSym(10)
+      );
+      for (; t.isNull; )
+        t.x = w.numberSym(10), t.y = w.numberSym(10);
+      return this._config.slope === 1 ? t.x.sign() !== t.y.sign() && t.y.opposed() : this._config.slope === -1 && t.x.sign() !== t.y.sign() && t.y.opposed(), new A(new y(this._config.A.x, this._config.A.y), t);
+    });
+    this._defaultConfig = {
+      A: {
+        x: w.numberSym(10),
+        y: w.numberSym(10)
+      }
+    }, this._config = this.mergeConfig(t, this._defaultConfig);
   }
-  makeZeroes() {
-    return [];
+}
+class ce extends D {
+  constructor(t) {
+    super();
+    r(this, "generate", () => {
+      let t, i, s = this._config.axis === !0 || this._config.axis === "x", n = this._config.axis === !0 || this._config.axis === "y";
+      return t = this._config.fraction ? w.fraction({ max: this._config.max, zero: s }) : new h(w.numberSym(this._config.max, s)), i = this._config.fraction ? w.fraction({ max: this._config.max, zero: n }) : new h(w.numberSym(this._config.max, n)), +this._config.quadrant == 1 && (t.abs(), i.abs()), +this._config.quadrant == 2 && (t.isPositive() && t.opposed(), i.isNegative() && i.opposed()), +this._config.quadrant == 3 && (t.isPositive() && t.opposed(), i.isPositive() && i.opposed()), +this._config.quadrant == 4 && (t.isNegative() && t.opposed(), i.isPositive() && i.opposed()), new y(t, i);
+    });
+    this._defaultConfig = {
+      axis: !0,
+      fraction: !1,
+      max: 10
+    }, this._config = this.mergeConfig(t, this._defaultConfig);
   }
-  makeSigns() {
-    return {
-      type: "signs",
-      fx: null,
-      factors: [],
-      zeroes: [],
-      signs: [],
-      extremes: {},
-      tex: ""
-    };
+}
+class j {
+  constructor(...e) {
+    r(this, "_A");
+    r(this, "_B");
+    r(this, "_C");
+    r(this, "_lines");
+    r(this, "_middles");
+    r(this, "_remarquables");
+    // ------------------------------------------
+    // Creation / parsing functions
+    // ------------------------------------------
+    /**
+     * Parse values to a triangle. Supported formats:
+     * Point, Point, Point
+     * x1, y1, x2, y2, x3, y3
+     * TODO: Something else ?
+     * @param values
+     */
+    r(this, "parse", (...e) => {
+      if (e.length === 6) {
+        let t = e.map((i) => new h(i));
+        return this.parse(
+          new y(t[0], t[1]),
+          new y(t[2], t[3]),
+          new y(t[4], t[5])
+        );
+      } else if (e.length === 3) {
+        if (e.filter((t) => typeof t == "string").length === 3)
+          return this.parse(...e.map((t) => new A(t)));
+        if (e.filter((t) => t instanceof A).length === 3) {
+          this._lines = {
+            AB: e[0],
+            BC: e[1],
+            AC: e[2]
+          };
+          let t = e[0].intersection(e[1]);
+          if (t.hasIntersection)
+            this._B = t.point.clone();
+          else
+            return this;
+          if (t = e[1].intersection(e[2]), t.hasIntersection)
+            this._C = t.point.clone();
+          else
+            return this;
+          if (t = e[2].intersection(e[0]), t.hasIntersection)
+            this._A = t.point.clone();
+          else
+            return this;
+        } else {
+          if (e.filter((t) => t instanceof y).length < 3)
+            return this.parse(
+              new y(e[0]),
+              new y(e[1]),
+              new y(e[2])
+            );
+          this._A = e[0].clone(), this._B = e[1].clone(), this._C = e[2].clone(), this._lines = {
+            AB: new A(this._A, this._B),
+            BC: new A(this._B, this._C),
+            AC: new A(this._A, this._C)
+          };
+        }
+      } else if (e.length === 1 && e[0] instanceof j)
+        return e[0].clone();
+      return this._updateTriangle(), this;
+    });
+    /**
+     * Clone the Triangle class
+     */
+    r(this, "clone", () => (this._A = this._A.clone(), this._B = this._B.clone(), this._C = this._C.clone(), this._lines = {
+      AB: this._lines.AB.clone(),
+      BC: this._lines.BC.clone(),
+      AC: this._lines.AC.clone()
+    }, this._updateTriangle(), this));
+    // ------------------------------------------
+    // Triangle operations and properties
+    // ------------------------------------------
+    /**
+     * Generate the Line object for the three segments of the triangle
+     */
+    r(this, "_updateTriangle", () => {
+      this._middles = {
+        AB: new y().middleOf(this._A, this._B),
+        AC: new y().middleOf(this._A, this._C),
+        BC: new y().middleOf(this._B, this._C)
+      }, this._remarquables = this._calculateRemarquableLines();
+    });
+    /**
+     * Get the Point class for the given name
+     * @param ptName
+     */
+    r(this, "getPointByName", (e) => {
+      switch (e.toUpperCase()) {
+        case "A":
+          return this._A;
+        case "B":
+          return this._B;
+        case "C":
+          return this._C;
+      }
+      return this._A;
+    });
+    /**
+     * Get the vector for the segment given by name.
+     * @param ptName1
+     * @param ptName2
+     */
+    r(this, "getSegment", (e, t) => new N(
+      this.getPointByName(e),
+      this.getPointByName(t)
+    ));
+    r(this, "_calculateRemarquableLines", () => {
+      const e = this._calculateBisectors("A"), t = this._calculateBisectors("B"), i = this._calculateBisectors("C");
+      let s = {
+        medians: {
+          A: new A(this._A, this._middles.BC),
+          B: new A(this._B, this._middles.AC),
+          C: new A(this._C, this._middles.AB),
+          intersection: null
+        },
+        mediators: {
+          AB: new A(this._middles.AB, new N(this._A, this._B).normal()),
+          AC: new A(this._middles.AC, new N(this._A, this._C).normal()),
+          BC: new A(this._middles.BC, new N(this._B, this._C).normal()),
+          intersection: null
+        },
+        heights: {
+          A: new A(this._A, new N(this._B, this._C).normal()),
+          B: new A(this._B, new N(this._A, this._C).normal()),
+          C: new A(this._C, new N(this._A, this._B).normal()),
+          intersection: null
+        },
+        bisectors: {
+          A: e.internal,
+          B: t.internal,
+          C: t.internal,
+          intersection: null
+        },
+        externalBisectors: {
+          A: e.external,
+          B: t.external,
+          C: i.external,
+          intersection: null
+        }
+      };
+      return s.medians.intersection = s.medians.A.intersection(s.medians.B).point, s.mediators.intersection = s.mediators.AB.intersection(s.mediators.BC).point, s.heights.intersection = s.heights.A.intersection(s.heights.B).point, s.bisectors.intersection = s.bisectors.A.intersection(s.bisectors.B).point, s;
+    });
+    r(this, "_calculateBisectors", (e) => {
+      let t = this.lines, i, s;
+      e === "A" ? (i = t.AB, s = t.AC) : e === "B" ? (i = t.AB, s = t.BC) : e === "C" && (i = t.BC, s = t.AC);
+      let n = new A(new k(i.equation.left.clone().multiply(s.n.simplify().norm), s.equation.left.clone().multiply(i.n.simplify().norm)).reorder(!0).simplify()), o = new A(new k(i.equation.left.clone().multiply(s.n.simplify().norm), s.equation.left.clone().multiply(i.n.simplify().norm).opposed()).reorder(!0).simplify());
+      return e === "A" ? n.hitSegment(this.B, this.C) ? { internal: n, external: o } : { internal: o, external: n } : e === "B" ? n.hitSegment(this.A, this.C) ? { internal: n, external: o } : { internal: o, external: n } : e === "C" ? n.hitSegment(this.B, this.A) ? { internal: n, external: o } : { internal: o, external: n } : { internal: n, external: o };
+    });
+    return e.length > 0 && this.parse(...e), this;
   }
-  makeAsymptotes() {
-    return [];
+  // ------------------------------------------
+  // Getter and setters
+  // ------------------------------------------
+  get A() {
+    return this._A;
   }
-  makeDerivative() {
-    return {
-      type: "grows",
-      fx: null,
-      factors: [],
-      zeroes: [],
-      signs: [],
-      extremes: {},
-      tex: ""
-    };
+  get B() {
+    return this._B;
   }
-  makeVariation() {
-    return {
-      type: "variatins",
-      fx: null,
-      factors: [],
-      zeroes: [],
-      signs: [],
-      extremes: {},
-      tex: ""
-    };
+  get C() {
+    return this._C;
   }
-}
-class ce extends he {
-  constructor(e, t) {
-    return super(e, t), this;
+  get AB() {
+    return this.getSegment("A", "B");
   }
-  makeZeroes() {
-    return this._getZeroes(this.fx);
+  get BA() {
+    return this.getSegment("B", "A");
   }
-  makeSigns() {
-    return this._getSigns(this.fx, this.zeroes);
+  get BC() {
+    return this.getSegment("B", "C");
   }
-  makeAsymptotes() {
-    const e = this.fx.clone().reduce();
-    let t = [];
-    this.zeroes.filter((n) => n.type === L.DEFENCE).forEach((n) => {
-      let o = M.VERTICAL, l = `x=${n.tex}`, a = `x=${n.display}`;
-      n.exact instanceof h ? e.denominator.evaluate(n.exact).isNotZero() && (o = M.HOLE, l = `(${n.tex};${e.evaluate(n.exact).tex})`, a = `(${n.display};${e.evaluate(n.exact).display})`) : e.denominator.evaluate(n.value).isNotZero() && (o = M.HOLE, l = `(${n.tex};${e.evaluate(n.value).tex})`, a = `(${n.display};${e.evaluate(n.value).display})`);
-      const f = 1e-6;
-      let m = this.fx.evaluateAsNumeric(n.value - f), d = this.fx.evaluateAsNumeric(n.value + f), p = [], _ = "";
-      d < -1e4 ? (p.push(E.RB), _ += "m") : d > 1e4 && (p.push(E.RT), _ += "p"), m < -1e4 ? (p.push(E.LB), _ += "m") : m > 1e4 && (p.push(E.LT), _ += "p"), _ === "pp" ? _ = "+" : _ === "mm" ? _ = "-" : _ = `\\${_}`, t.push({
-        fx: null,
-        type: o,
-        tex: l,
-        display: a,
-        zero: n,
-        limits: `\\lim_{x\\to${n.tex} }\\ f(x) = ${_}\\infty`,
-        deltaX: null,
-        tableOfSign: null,
-        position: p
-      });
-    });
-    let i = this.fx.numerator.degree(), s = this.fx.denominator.degree();
-    if (i.isEqual(s)) {
-      let n = this.fx.numerator.monomByDegree().coefficient.clone().divide(this.fx.denominator.monomByDegree().coefficient), o = n.tex, { reminder: l } = e.euclidian(), a = new R(l, e.denominator);
-      t.push({
-        fx: new u(n),
-        type: M.HORIZONTAL,
-        tex: `y=${o}`,
-        display: `y=${n.display}`,
-        zero: null,
-        limits: `\\lim_{x\\to\\infty}\\ f(x) = ${o}`,
-        deltaX: a,
-        tableOfSign: this._getSigns(a),
-        position: this._getHorizontalAsymptoteRelativePositon(a)
-      });
-    } else if (s.greater(i))
-      t.push({
-        fx: new u("0"),
-        type: M.HORIZONTAL,
-        tex: "y=0",
-        display: "y=0",
-        zero: null,
-        limits: "\\lim_{x\\to\\infty}\\ f(x) = 0",
-        deltaX: null,
-        tableOfSign: null,
-        position: this._getHorizontalAsymptoteRelativePositon(this.fx)
-      });
-    else if (i.value - 1 === s.value) {
-      let { quotient: n, reminder: o } = e.euclidian(), l = new R(o, e.denominator);
-      t.push({
-        fx: n.clone(),
-        type: M.SLOPE,
-        tex: `y=${n.tex}`,
-        display: `y=${n.display}`,
-        zero: null,
-        limits: "",
-        deltaX: new R(o, e.denominator),
-        tableOfSign: this._getSigns(l),
-        position: this._getHorizontalAsymptoteRelativePositon(l)
-      });
-    }
-    return t;
+  get CB() {
+    return this.getSegment("C", "B");
   }
-  _getHorizontalAsymptoteRelativePositon(e, t = 1e6) {
-    let i = [], s = e.evaluateAsNumeric(-t), n = e.evaluateAsNumeric(t);
-    return s >= 0 ? i.push(E.LT) : i.push(E.LB), n >= 0 ? i.push(E.RT) : i.push(E.RB), i;
+  get AC() {
+    return this.getSegment("A", "C");
   }
-  makeDerivative() {
-    let e = this.fx.clone().derivative(), t = this._getSigns(e, this._getZeroes(e), W.GROWS), i = this.makeGrowsResult(t);
-    return t.signs.push(i.growsLine), t.extremes = i.extremes, t;
+  get CA() {
+    return this.getSegment("C", "A");
   }
-  makeVariation() {
-    let e = this.derivative.fx.clone().derivative(), t = this._getSigns(e, this._getZeroes(e), W.VARIATIONS), i = this.makeVariationsResult(t);
-    return t.signs.push(i.varsLine), t.extremes = i.extremes, t;
+  get isRectangle() {
+    return !!(this.AB.isNormalTo(this.BC) || this.AB.isNormalTo(this.AC) || this.BC.isNormalTo(this.AC));
   }
-  _getZeroes(e) {
-    let t = [];
-    return e.numerator.getZeroes().filter((i) => !isNaN(i.value)).forEach((i) => {
-      t.push({
-        tex: i.tex,
-        display: i.display,
-        value: i.value,
-        exact: i.exact,
-        extrema: H.NOTHING,
-        type: L.ZERO
-      });
-    }), e.denominator.getZeroes().filter((i) => !isNaN(i.value)).forEach((i) => {
-      let s = this.indexOfZero(t, i);
-      s !== -1 ? t[s].type = L.DEFENCE : t.push({
-        tex: i.tex,
-        display: i.display,
-        value: i.value,
-        exact: i.exact,
-        extrema: H.NOTHING,
-        type: L.DEFENCE
-      });
-    }), t.sort((i, s) => i.value - s.value), t;
+  get isEquilateral() {
+    return this.AB.normSquare.isEqual(this.BC.normSquare) && this.AB.normSquare.isEqual(this.AC.normSquare);
   }
-  _getSigns(e, t, i) {
-    let s = [], n = [];
-    return t === void 0 && (t = this._getZeroes(e)), e.numerator.factors.forEach((o) => {
-      s.push(this.makeOneLineForSigns(o, t, L.ZERO)), n.push(o.clone());
-    }), e.denominator.factors.forEach((o) => {
-      s.push(this.makeOneLineForSigns(o, t, L.DEFENCE)), n.push(o.clone());
-    }), s.push(this.makeSignsResult(s)), {
-      type: i,
-      fx: e,
-      factors: n,
-      zeroes: t,
-      signs: s,
-      extremes: {},
-      tex: ""
-    };
+  get isIsocele() {
+    return this.AB.normSquare.isEqual(this.BC.normSquare) || this.AB.normSquare.isEqual(this.AC.normSquare) || this.BC.normSquare.isEqual(this.AC.normSquare);
+  }
+  get lines() {
+    return this._lines;
+  }
+  get remarquables() {
+    return this._remarquables;
   }
 }
-class R {
-  /**
-   *
-   * @param numerator
-   * @param denominator
-   */
-  constructor(e, t) {
-    r(this, "_denominator");
-    r(this, "_numerator");
-    r(this, "_rawString");
-    r(this, "clone", () => new R(
-      this._numerator.clone(),
-      this._denominator.clone()
-    ));
-    r(this, "domain", () => {
-      let e = this._denominator.getZeroes();
-      return e.length === 0 || e[0].tex === F.real ? F.varnothing : e[0].tex === F.varnothing ? F.real : "\\mathbb{R}\\setminus\\left\\{" + e.map((t) => t.tex).join(";") + "\\right\\}";
-    });
-    r(this, "amplify", (e) => (this._numerator.multiply(e), this._denominator.multiply(e), this));
-    r(this, "derivative", (e) => {
-      let t = this._numerator.clone(), i = this._denominator.clone(), s = t.clone().derivative(e), n = i.clone().derivative(e);
-      return this._numerator = s.clone().multiply(i).subtract(t.clone().multiply(n)), this._denominator = i.clone().pow(2), this;
-    });
-    r(this, "factorize", (e) => (this._numerator.factorize(e), this._denominator.factorize(e), this));
-    r(this, "simplify", (e) => {
-      let t = this._numerator.euclidian(e);
-      if (!t.reminder.isZero())
-        return this;
-      let i = this._denominator.euclidian(e);
-      return i.reminder.isZero() ? (this._numerator = t.quotient, this._denominator = i.quotient, this) : this;
-    });
-    r(this, "reduce", () => {
-      this._numerator.factorize();
-      for (let e of this._numerator.factors)
-        e.degree().isZero() ? this._denominator.commonMonom().coefficient.clone().divide(e.monomByDegree().coefficient).isNatural() && this.simplify(e) : this.simplify(e);
-      return this;
-    });
-    r(this, "opposed", () => (this._numerator.opposed(), this));
-    r(this, "add", (e) => {
-      let t = this._denominator.clone();
-      return this.amplify(e._denominator), this._numerator.add(e._numerator.clone().multiply(t)), this;
+class G {
+  constructor(...e) {
+    r(this, "_center");
+    r(this, "_squareRadius");
+    r(this, "_cartesian");
+    r(this, "_exists");
+    /**
+     * Get the relative position between circle and line. It corresponds to the number of intersection.
+     * @param {Line} L
+     * @returns {number}
+     */
+    r(this, "relativePosition", (e) => {
+      let t = e.distanceTo(this.center), i = Math.sqrt(this._squareRadius.value);
+      return t.value - i > 1e-10 ? 0 : Math.abs(t.value - i) < 1e-10 ? 1 : 2;
     });
-    r(this, "subtract", (e) => this.add(e.clone().opposed()));
-    r(this, "euclidian", () => this._numerator.euclidian(this._denominator));
-    // TODO : where and how is used limits ?
-    r(this, "limits", (e, t, i) => {
-      if (e === 1 / 0 || e === -1 / 0) {
-        let { quotient: s, reminder: n } = this._numerator.clone().euclidian(this._denominator);
-        return s.degree(i).isStrictlyPositive() ? e === 1 / 0 ? s.limitToInfinity(i) : s.limitToNegativeInfinity(i) : s.monomByDegree(void 0, i).coefficient;
-      } else {
-        let s = {}, n = {}, o, l, a = this.clone().reduce();
-        return s[i === void 0 ? "x" : i] = new h(e), t !== "above" && t !== "below" ? (o = a._numerator.evaluate(s).divide(a._denominator.evaluate(s)), o.isInfinity() ? o.abs() : o) : (t === "above" ? n[i === void 0 ? "x" : i] = new h(e).add(1e-6) : t === "below" && (n[i === void 0 ? "x" : i] = new h(e).subtract(1e-6)), o = a._numerator.evaluate(s).divide(a._denominator.evaluate(s)), l = a._numerator.evaluate(n).divide(a._denominator.evaluate(n)).sign(), o.isInfinity() ? l === 1 ? o.abs() : o.abs().opposed() : o);
+    r(this, "lineIntersection", (e) => {
+      let t = [], i;
+      if (this._cartesian === null)
+        return [];
+      const s = this._cartesian.clone(), n = e.equation.clone().isolate("x"), o = e.equation.clone().isolate("y");
+      if (n instanceof k && o instanceof k) {
+        s.replaceBy("y", o.right).simplify(), s.solve();
+        for (let l of s.solutions)
+          l.exact === !1 && isNaN(l.value) || (i = new h(l.exact === !1 ? l.value : l.exact), t.push(new y(i.clone(), o.right.evaluate(i))));
       }
+      return t;
+    });
+    r(this, "tangents", (e) => e instanceof h ? this._tangentsWithSlope(e) : this.isPointOnCircle(e) ? this._tangentsThroughOnePointOnTheCircle(e) : this.center.distanceTo(e).value > this.radius.value ? this._tangentsThroughOnePointOutsideTheCircle(e) : (console.log("No tangents as the point is inside !"), []));
+    r(this, "isPointOnCircle", (e) => this._cartesian.test({ x: e.x, y: e.y }));
+    r(this, "getPointsOnCircle", (e) => {
+      let t = x.pythagoricianTripletsWithTarget(this._squareRadius.value, !0), i = [], s;
+      return t.forEach((n) => {
+        for (let o of [[1, 1], [-1, 1], [-1, -1], [1, -1]])
+          s = new y(
+            this.center.x.clone().add(o[0] * n[0]),
+            this.center.y.clone().add(o[1] * n[1])
+          ), s.isInListOfPoints(i) || i.push(s);
+      }), i;
     });
-    r(this, "evaluate", (e) => {
-      new h().zero();
-      let t = this._numerator.evaluate(e), i = this._denominator.evaluate(e);
-      return t.divide(i);
+    r(this, "_tangentsThroughOnePointOnTheCircle", (e) => {
+      let t = new N(this._center, e);
+      return [new A(e, t, ee.Perpendicular)];
     });
-    r(this, "evaluateAsNumeric", (e) => this._numerator.evaluateAsNumeric(e) / this._denominator.evaluateAsNumeric(e));
-    r(this, "study", (e) => new ce(this, e));
-    e instanceof u ? this._numerator = e.clone() : typeof e == "string" ? this._numerator = new u(e) : this._numerator = new u(), t instanceof u ? this._denominator = t.clone() : typeof t == "string" ? this._denominator = new u(t) : this._denominator = new u();
+    r(this, "_tangentsThroughOnePointOutsideTheCircle", (e) => {
+      let t = this.center.x.clone().subtract(e.x), i = this.center.y.clone().subtract(e.y), s = new u("x"), n = new u("x^2+1");
+      s.multiply(t).subtract(i).pow(2), n.multiply(this.squareRadius);
+      let o = new k(s, n);
+      return o.moveLeft().simplify().solve(), o.solutions.map((l) => {
+        let a, f = new k("y", "x");
+        return l.exact instanceof h ? (a = e.x.clone().opposed().multiply(l.exact).add(e.y), f.right.multiply(l.exact).add(a)) : (a = e.x.clone().opposed().multiply(l.value).add(e.y), f.right.multiply(l.value).add(a)), new A(f);
+      });
+    });
+    r(this, "_tangentsWithSlope", (e) => {
+      const t = e.numerator, i = -e.denominator, s = this._center.x.clone(), n = this._center.y.clone();
+      this._squareRadius;
+      let o = this._squareRadius.clone().multiply(e.numerator ** 2 + e.denominator ** 2), l = s.clone().multiply(t).opposed().subtract(n.clone().multiply(i)).add(o.clone().sqrt()), a = s.clone().multiply(t).opposed().subtract(n.clone().multiply(i)).subtract(o.clone().sqrt());
+      return [new A(t, i, l), new A(t, i, a)];
+    });
+    this._exists = !1, e !== void 0 && this.parse(...e);
   }
-  get numerator() {
-    return this._numerator;
+  get center() {
+    return this._center;
   }
-  get denominator() {
-    return this._denominator;
+  get squareRadius() {
+    return this._squareRadius;
+  }
+  get cartesian() {
+    return this._cartesian;
+  }
+  get exists() {
+    return this._exists;
+  }
+  get radius() {
+    return this._squareRadius.isSquare() ? {
+      tex: this._squareRadius.clone().sqrt().tex,
+      display: this._squareRadius.clone().sqrt().display,
+      value: this._squareRadius.clone().sqrt().value
+    } : {
+      tex: `\\sqrt{${this._squareRadius.tex}}`,
+      display: `sqrt(${this._squareRadius.display})`,
+      value: this._squareRadius.clone().sqrt().value
+    };
   }
   get tex() {
-    return `\\frac{ ${this._numerator.tex} }{ ${this._denominator.tex} }`;
+    if (this._exists) {
+      let e, t;
+      return this._center.x.isZero() ? e = "x^2" : e = `\\left(x${this._center.x.isNegative() ? "+" : "-"}${this._center.x.clone().abs().tex}\\right)^2`, this._center.y.isZero() ? t = "y^2" : t = `\\left(y${this._center.y.isNegative() ? "+" : "-"}${this._center.y.clone().abs().tex}\\right)^2`, `${e}+${t}=${this._squareRadius.tex}`;
+    } else
+      return "\\text{le cercle n'existe pas.}";
+  }
+  get developed() {
+    return this._cartesian.tex;
   }
   get display() {
-    return `(${this._numerator.display})/(${this._denominator.display})`;
+    if (this._exists) {
+      let e, t;
+      return this._center.x.isZero() ? e = "x^2" : e = `(x${this._center.x.isNegative() ? "+" : "-"}${this._center.x.clone().abs().tex})^2`, this._center.y.isZero() ? t = "y^2" : t = `(y${this._center.y.isNegative() ? "+" : "-"}${this._center.y.clone().abs().tex})^2`, `${e}+${t}=${this._squareRadius.display}`;
+    } else
+      return "\\text{le cercle n'existe pas.}";
   }
-  get texFactors() {
-    return `\\frac{ ${this._numerator.texFactors} }{ ${this._denominator.texFactors} }`;
+  clone() {
+    return this._center = this._center.clone(), this._squareRadius = this._squareRadius.clone(), this._calculateCartesian(), this;
   }
-  get displayFactors() {
-    return `(${this._numerator.displayFactors})/(${this._denominator.displayFactors})`;
+  _reset() {
+    return this._center = null, this._squareRadius = null, this._cartesian = null, this._exists = !1, this;
   }
-  get plotFunction() {
-    return `(${this._numerator.plotFunction})/(${this._denominator.plotFunction})`;
+  parse(...e) {
+    return this._reset(), typeof e[0] == "string" ? this._parseEquation(new k(e[0])) : e[0] instanceof k ? this._parseEquation(e[0]) : e[0] instanceof G ? this._parseCopyCircle(e[0]) : e[0] instanceof y && e.length > 1 && (e[1] instanceof y ? e[2] instanceof y ? this._parseThroughtThreePoints(e[0], e[1], e[2]) : this._parseCenterAndPointThrough(e[0], e[1]) : (e[1] instanceof h || typeof e[1] == "number") && this._parseCenterAndRadius(e[0], e[1], typeof e[2] == "boolean" ? e[2] : !1)), this._exists && (this._calculateCartesian(), this._squareRadius !== void 0 && this._squareRadius.isNegative() && (this._exists = !1)), this;
   }
-}
-class fe {
-  /**
-   *
-   * @param {string} value (optional) Default polynom to parse on class creation
-   */
-  constructor(e) {
-    r(this, "_rawString");
-    r(this, "_rpn");
-    r(this, "parse", (e) => (this._rpn = new P(U.SET).parse(e).rpn, this));
-    return this._rawString = e, this.parse(e), this;
+  _calculateCartesian() {
+    this._cartesian = new k(new u(`(x-(${this._center.x.display}))^2+(y-(${this._center.y.display}))^2`), new u(`${this._squareRadius.display}`)).moveLeft();
   }
-  get isLogicalset() {
-    return !0;
+  _parseCopyCircle(e) {
+    return this._center = e.center.clone(), this._squareRadius = e.squareRadius.clone(), this._calculateCartesian(), this._exists = e.exists, this;
   }
-  get rpn() {
-    return this._rpn;
+  _parseCenterAndRadius(e, t, i) {
+    return this._center = e.clone(), i ? this._squareRadius = new h(t) : this._squareRadius = new h(t).pow(2), this._exists = !0, this;
   }
-  get tex() {
-    let e = [];
-    for (let t of this._rpn)
-      if (t.tokenType === "variable")
-        e.push(t);
-      else
-        switch (t.token) {
-          case "&":
-            if (e.length >= 2) {
-              let i = e.pop(), s = e.pop();
-              s.tokenType === "mix" && (s.token = `( ${s.token} )`), i.tokenType === "mix" && (i.token = `( ${i.token} )`), e.push({ token: `${s.token} \\cap ${i.token}`, tokenType: "mix" });
-            }
-            break;
-          case "|":
-            if (e.length >= 2) {
-              let i = e.pop(), s = e.pop();
-              s.tokenType === "mix" && (s.token = `( ${s.token} )`), i.tokenType === "mix" && (i.token = `( ${i.token} )`), e.push({ token: `${s.token} \\cup ${i.token}`, tokenType: "mix" });
-            }
-            break;
-          case "-":
-            if (e.length >= 2) {
-              let i = e.pop(), s = e.pop();
-              s.tokenType === "mix" && (s.token = `( ${s.token} )`), i.tokenType === "mix" && (i.token = `( ${i.token} )`), e.push({ token: `${s.token} \\setminus ${i.token}`, tokenType: "mix" });
-            }
-            break;
-          case "!":
-            if (e.length >= 1) {
-              let i = e.pop();
-              e.push({ token: `\\overline{ ${i.token} }`, tokenType: "variable" });
-            }
-            break;
-        }
-    return e[0].token;
+  _parseCenterAndPointThrough(e, t) {
+    return this._center = e.clone(), this._squareRadius = new N(this._center, t).normSquare, this._exists = !0, this;
   }
-  evaluate(e, t) {
-    let i = [], s;
-    if (t === void 0) {
-      s = /* @__PURE__ */ new Set();
-      for (let n in e)
-        s = /* @__PURE__ */ new Set([...s, ...e[n]]);
-    } else
-      s = new Set(t);
-    for (let n of this._rpn)
-      if (n.tokenType === "variable")
-        e[n.token] === void 0 ? i.push(/* @__PURE__ */ new Set()) : i.push(new Set(e[n.token]));
-      else
-        switch (n.token) {
-          case "&":
-            if (i.length >= 2) {
-              let o = i.pop(), l = i.pop();
-              i.push(new Set([...l].filter((a) => o.has(a))));
-            }
-            break;
-          case "|":
-            if (i.length >= 2) {
-              let o = i.pop(), l = i.pop();
-              i.push(/* @__PURE__ */ new Set([...l, ...o]));
-            }
-            break;
-          case "-":
-            if (i.length >= 2) {
-              let o = i.pop(), l = i.pop();
-              i.push(new Set([...l].filter((a) => !o.has(a))));
-            }
-            break;
-          case "!":
-            if (i.length >= 1) {
-              let o = i.pop();
-              i.push(new Set([...s].filter((l) => !o.has(l))));
-            }
-            break;
-        }
-    return [...i[0]].sort();
+  _parseEquation(e) {
+    if (this._exists = !1, e.moveLeft(), e.degree("x").value === 2 && e.degree("y").value === 2) {
+      let t = e.left.monomByDegree(2, "x"), i = e.left.monomByDegree(2, "y"), s, n, o;
+      t.coefficient.isEqual(i.coefficient) ? (e.divide(t.coefficient), s = e.left.monomByDegree(1, "x"), n = e.left.monomByDegree(1, "y"), o = e.left.monomByDegree(0), this._center = new y(s.coefficient.clone().divide(2).opposed(), n.coefficient.clone().divide(2).opposed()), this._squareRadius = o.coefficient.clone().opposed().add(this._center.x.clone().pow(2)).add(this._center.y.clone().pow(2)), this._calculateCartesian(), this._exists = !0) : (this._center = null, this._squareRadius = null, this._exists = !1);
+    }
+    return this;
   }
-  vennAB() {
-    return this.evaluate(
-      {
-        A: ["A", "AB"],
-        B: ["B", "AB"]
-      },
-      ["A", "B", "AB", "E"]
-    );
+  _parseThroughtThreePoints(e, t, i) {
+    let s = new j(e, t, i), n = s.remarquables.mediators.AB.clone(), o = s.remarquables.mediators.AC.clone();
+    return this.parse(n.intersection(o).point, e), this;
   }
-  vennABC() {
-    return this.evaluate(
-      {
-        A: ["A", "AB", "AC", "ABC"],
-        B: ["B", "AB", "BC", "ABC"],
-        C: ["C", "AC", "BC", "ABC"]
-      },
-      ["A", "B", "C", "AB", "AC", "BC", "E"]
-    );
+}
+class fe extends D {
+  constructor(t) {
+    super();
+    r(this, "generate", () => {
+      const t = w.Geometry.point(this._config.center);
+      let i, s;
+      return this._config.pointsOnCircle === 8 ? (i = w.number(1, 3), s = i ** 2 + (i + 1) ** 2) : s = w.number(1, 20), new G(t, s, !0);
+    });
+    this._defaultConfig = {}, this._config = this.mergeConfig(t, this._defaultConfig);
   }
 }
+var w;
+((c) => {
+  function e(d) {
+    return new oe(d).generate();
+  }
+  c.polynom = e;
+  function t(d) {
+    return new J(d).generate();
+  }
+  c.monom = t;
+  function i(d) {
+    return new le(d).generate();
+  }
+  c.fraction = i;
+  function s(d, p, _) {
+    return T.randomInt(d, p, _);
+  }
+  c.number = s;
+  function n(d, p) {
+    return T.randomIntSym(d, p);
+  }
+  c.numberSym = n;
+  function o(d) {
+    return T.randomPrime(d);
+  }
+  c.prime = o;
+  function l(d) {
+    return T.randomBool(d);
+  }
+  c.bool = l;
+  function a(d, p) {
+    return T.randomArray(d, p);
+  }
+  c.array = a;
+  function f(d) {
+    return T.randomItem(d);
+  }
+  c.item = f;
+  function m(d) {
+    return T.shuffleArray(d);
+  }
+  c.shuffle = m, ((d) => {
+    function p(v) {
+      return new he(v).generate();
+    }
+    d.line = p;
+    function _(v) {
+      return new ce(v).generate();
+    }
+    d.point = _;
+    function q(v) {
+      return new fe(v).generate();
+    }
+    d.circle = q;
+  })(c.Geometry || (c.Geometry = {}));
+})(w || (w = {}));
 const de = {
   ShutingYard: P,
   Numeric: x,
   NumExp: K,
   Fraction: h,
-  Root: J,
+  Root: Q,
   Monom: g,
   Polynom: u,
   Equation: k,
   LinearSystem: Y,
   Rational: R,
-  Logicalset: fe,
+  Logicalset: ne,
   Random: w,
   Geometry: {
     Vector: N,