@ohif/app 3.10.0-beta.0 → 3.10.0-beta.10

package/dist/{5807.bundle.dac5ce36534a71c77723.js → 967.bundle.fee0d6c1e9e244ad5bb3.js}

@@ -1,4 +1,4 @@
-(self["webpackChunk"] = self["webpackChunk"] || []).push([[5807],{
+(self["webpackChunk"] = self["webpackChunk"] || []).push([[967],{
 
 /***/ 2682:
 /***/ ((module) => {
@@ -85,898 +85,6 @@ module.exports = function (str) {
   return result;
 };
 
-/***/ }),
-
-/***/ 67042:
-/***/ (function(module) {
-
-/**
- * @license Fraction.js v4.3.0 20/08/2023
- * https://www.xarg.org/2014/03/rational-numbers-in-javascript/
- *
- * Copyright (c) 2023, Robert Eisele (robert@raw.org)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- **/
-
-
-/**
- *
- * This class offers the possibility to calculate fractions.
- * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
- *
- * Array/Object form
- * [ 0 => <numerator>, 1 => <denominator> ]
- * [ n => <numerator>, d => <denominator> ]
- *
- * Integer form
- * - Single integer value
- *
- * Double form
- * - Single double value
- *
- * String form
- * 123.456 - a simple double
- * 123/456 - a string fraction
- * 123.'456' - a double with repeating decimal places
- * 123.(456) - synonym
- * 123.45'6' - a double with repeating last place
- * 123.45(6) - synonym
- *
- * Example:
- *
- * var f = new Fraction("9.4'31'");
- * f.mul([-4, 3]).div(4.9);
- *
- */
-
-(function(root) {
-
-  "use strict";
-
-  // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
-  // Example: 1/7 = 0.(142857) has 6 repeating decimal places.
-  // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
-  var MAX_CYCLE_LEN = 2000;
-
-  // Parsed data to avoid calling "new" all the time
-  var P = {
-    "s": 1,
-    "n": 0,
-    "d": 1
-  };
-
-  function assign(n, s) {
-
-    if (isNaN(n = parseInt(n, 10))) {
-      throw InvalidParameter();
-    }
-    return n * s;
-  }
-
-  // Creates a new Fraction internally without the need of the bulky constructor
-  function newFraction(n, d) {
-
-    if (d === 0) {
-      throw DivisionByZero();
-    }
-
-    var f = Object.create(Fraction.prototype);
-    f["s"] = n < 0 ? -1 : 1;
-
-    n = n < 0 ? -n : n;
-
-    var a = gcd(n, d);
-
-    f["n"] = n / a;
-    f["d"] = d / a;
-    return f;
-  }
-
-  function factorize(num) {
-
-    var factors = {};
-
-    var n = num;
-    var i = 2;
-    var s = 4;
-
-    while (s <= n) {
-
-      while (n % i === 0) {
-        n/= i;
-        factors[i] = (factors[i] || 0) + 1;
-      }
-      s+= 1 + 2 * i++;
-    }
-
-    if (n !== num) {
-      if (n > 1)
-        factors[n] = (factors[n] || 0) + 1;
-    } else {
-      factors[num] = (factors[num] || 0) + 1;
-    }
-    return factors;
-  }
-
-  var parse = function(p1, p2) {
-
-    var n = 0, d = 1, s = 1;
-    var v = 0, w = 0, x = 0, y = 1, z = 1;
-
-    var A = 0, B = 1;
-    var C = 1, D = 1;
-
-    var N = 10000000;
-    var M;
-
-    if (p1 === undefined || p1 === null) {
-      /* void */
-    } else if (p2 !== undefined) {
-      n = p1;
-      d = p2;
-      s = n * d;
-
-      if (n % 1 !== 0 || d % 1 !== 0) {
-        throw NonIntegerParameter();
-      }
-
-    } else
-      switch (typeof p1) {
-
-        case "object":
-          {
-            if ("d" in p1 && "n" in p1) {
-              n = p1["n"];
-              d = p1["d"];
-              if ("s" in p1)
-                n*= p1["s"];
-            } else if (0 in p1) {
-              n = p1[0];
-              if (1 in p1)
-                d = p1[1];
-            } else {
-              throw InvalidParameter();
-            }
-            s = n * d;
-            break;
-          }
-        case "number":
-          {
-            if (p1 < 0) {
-              s = p1;
-              p1 = -p1;
-            }
-
-            if (p1 % 1 === 0) {
-              n = p1;
-            } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow
-
-              if (p1 >= 1) {
-                z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));
-                p1/= z;
-              }
-
-              // Using Farey Sequences
-              // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/
-
-              while (B <= N && D <= N) {
-                M = (A + C) / (B + D);
-
-                if (p1 === M) {
-                  if (B + D <= N) {
-                    n = A + C;
-                    d = B + D;
-                  } else if (D > B) {
-                    n = C;
-                    d = D;
-                  } else {
-                    n = A;
-                    d = B;
-                  }
-                  break;
-
-                } else {
-
-                  if (p1 > M) {
-                    A+= C;
-                    B+= D;
-                  } else {
-                    C+= A;
-                    D+= B;
-                  }
-
-                  if (B > N) {
-                    n = C;
-                    d = D;
-                  } else {
-                    n = A;
-                    d = B;
-                  }
-                }
-              }
-              n*= z;
-            } else if (isNaN(p1) || isNaN(p2)) {
-              d = n = NaN;
-            }
-            break;
-          }
-        case "string":
-          {
-            B = p1.match(/\d+|./g);
-
-            if (B === null)
-              throw InvalidParameter();
-
-            if (B[A] === '-') {// Check for minus sign at the beginning
-              s = -1;
-              A++;
-            } else if (B[A] === '+') {// Check for plus sign at the beginning
-              A++;
-            }
-
-            if (B.length === A + 1) { // Check if it's just a simple number "1234"
-              w = assign(B[A++], s);
-            } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number
-
-              if (B[A] !== '.') { // Handle 0.5 and .5
-                v = assign(B[A++], s);
-              }
-              A++;
-
-              // Check for decimal places
-              if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === "'" && B[A + 3] === "'") {
-                w = assign(B[A], s);
-                y = Math.pow(10, B[A].length);
-                A++;
-              }
-
-              // Check for repeating places
-              if (B[A] === '(' && B[A + 2] === ')' || B[A] === "'" && B[A + 2] === "'") {
-                x = assign(B[A + 1], s);
-                z = Math.pow(10, B[A + 1].length) - 1;
-                A+= 3;
-              }
-
-            } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
-              w = assign(B[A], s);
-              y = assign(B[A + 2], 1);
-              A+= 3;
-            } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction "123 1/2"
-              v = assign(B[A], s);
-              w = assign(B[A + 2], s);
-              y = assign(B[A + 4], 1);
-              A+= 5;
-            }
-
-            if (B.length <= A) { // Check for more tokens on the stack
-              d = y * z;
-              s = /* void */
-              n = x + d * v + z * w;
-              break;
-            }
-
-            /* Fall through on error */
-          }
-        default:
-          throw InvalidParameter();
-      }
-
-    if (d === 0) {
-      throw DivisionByZero();
-    }
-
-    P["s"] = s < 0 ? -1 : 1;
-    P["n"] = Math.abs(n);
-    P["d"] = Math.abs(d);
-  };
-
-  function modpow(b, e, m) {
-
-    var r = 1;
-    for (; e > 0; b = (b * b) % m, e >>= 1) {
-
-      if (e & 1) {
-        r = (r * b) % m;
-      }
-    }
-    return r;
-  }
-
-
-  function cycleLen(n, d) {
-
-    for (; d % 2 === 0;
-      d/= 2) {
-    }
-
-    for (; d % 5 === 0;
-      d/= 5) {
-    }
-
-    if (d === 1) // Catch non-cyclic numbers
-      return 0;
-
-    // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
-    // 10^(d-1) % d == 1
-    // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
-    // as we want to translate the numbers to strings.
-
-    var rem = 10 % d;
-    var t = 1;
-
-    for (; rem !== 1; t++) {
-      rem = rem * 10 % d;
-
-      if (t > MAX_CYCLE_LEN)
-        return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
-    }
-    return t;
-  }
-
-
-  function cycleStart(n, d, len) {
-
-    var rem1 = 1;
-    var rem2 = modpow(10, len, d);
-
-    for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
-      // Solve 10^s == 10^(s+t) (mod d)
-
-      if (rem1 === rem2)
-        return t;
-
-      rem1 = rem1 * 10 % d;
-      rem2 = rem2 * 10 % d;
-    }
-    return 0;
-  }
-
-  function gcd(a, b) {
-
-    if (!a)
-      return b;
-    if (!b)
-      return a;
-
-    while (1) {
-      a%= b;
-      if (!a)
-        return b;
-      b%= a;
-      if (!b)
-        return a;
-    }
-  };
-
-  /**
-   * Module constructor
-   *
-   * @constructor
-   * @param {number|Fraction=} a
-   * @param {number=} b
-   */
-  function Fraction(a, b) {
-
-    parse(a, b);
-
-    if (this instanceof Fraction) {
-      a = gcd(P["d"], P["n"]); // Abuse variable a
-      this["s"] = P["s"];
-      this["n"] = P["n"] / a;
-      this["d"] = P["d"] / a;
-    } else {
-      return newFraction(P['s'] * P['n'], P['d']);
-    }
-  }
-
-  var DivisionByZero = function() { return new Error("Division by Zero"); };
-  var InvalidParameter = function() { return new Error("Invalid argument"); };
-  var NonIntegerParameter = function() { return new Error("Parameters must be integer"); };
-
-  Fraction.prototype = {
-
-    "s": 1,
-    "n": 0,
-    "d": 1,
-
-    /**
-     * Calculates the absolute value
-     *
-     * Ex: new Fraction(-4).abs() => 4
-     **/
-    "abs": function() {
-
-      return newFraction(this["n"], this["d"]);
-    },
-
-    /**
-     * Inverts the sign of the current fraction
-     *
-     * Ex: new Fraction(-4).neg() => 4
-     **/
-    "neg": function() {
-
-      return newFraction(-this["s"] * this["n"], this["d"]);
-    },
-
-    /**
-     * Adds two rational numbers
-     *
-     * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
-     **/
-    "add": function(a, b) {
-
-      parse(a, b);
-      return newFraction(
-        this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
-        this["d"] * P["d"]
-      );
-    },
-
-    /**
-     * Subtracts two rational numbers
-     *
-     * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
-     **/
-    "sub": function(a, b) {
-
-      parse(a, b);
-      return newFraction(
-        this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
-        this["d"] * P["d"]
-      );
-    },
-
-    /**
-     * Multiplies two rational numbers
-     *
-     * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
-     **/
-    "mul": function(a, b) {
-
-      parse(a, b);
-      return newFraction(
-        this["s"] * P["s"] * this["n"] * P["n"],
-        this["d"] * P["d"]
-      );
-    },
-
-    /**
-     * Divides two rational numbers
-     *
-     * Ex: new Fraction("-17.(345)").inverse().div(3)
-     **/
-    "div": function(a, b) {
-
-      parse(a, b);
-      return newFraction(
-        this["s"] * P["s"] * this["n"] * P["d"],
-        this["d"] * P["n"]
-      );
-    },
-
-    /**
-     * Clones the actual object
-     *
-     * Ex: new Fraction("-17.(345)").clone()
-     **/
-    "clone": function() {
-      return newFraction(this['s'] * this['n'], this['d']);
-    },
-
-    /**
-     * Calculates the modulo of two rational numbers - a more precise fmod
-     *
-     * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
-     **/
-    "mod": function(a, b) {
-
-      if (isNaN(this['n']) || isNaN(this['d'])) {
-        return new Fraction(NaN);
-      }
-
-      if (a === undefined) {
-        return newFraction(this["s"] * this["n"] % this["d"], 1);
-      }
-
-      parse(a, b);
-      if (0 === P["n"] && 0 === this["d"]) {
-        throw DivisionByZero();
-      }
-
-      /*
-       * First silly attempt, kinda slow
-       *
-       return that["sub"]({
-       "n": num["n"] * Math.floor((this.n / this.d) / (num.n / num.d)),
-       "d": num["d"],
-       "s": this["s"]
-       });*/
-
-      /*
-       * New attempt: a1 / b1 = a2 / b2 * q + r
-       * => b2 * a1 = a2 * b1 * q + b1 * b2 * r
-       * => (b2 * a1 % a2 * b1) / (b1 * b2)
-       */
-      return newFraction(
-        this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
-        P["d"] * this["d"]
-      );
-    },
-
-    /**
-     * Calculates the fractional gcd of two rational numbers
-     *
-     * Ex: new Fraction(5,8).gcd(3,7) => 1/56
-     */
-    "gcd": function(a, b) {
-
-      parse(a, b);
-
-      // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
-
-      return newFraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
-    },
-
-    /**
-     * Calculates the fractional lcm of two rational numbers
-     *
-     * Ex: new Fraction(5,8).lcm(3,7) => 15
-     */
-    "lcm": function(a, b) {
-
-      parse(a, b);
-
-      // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
-
-      if (P["n"] === 0 && this["n"] === 0) {
-        return newFraction(0, 1);
-      }
-      return newFraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
-    },
-
-    /**
-     * Calculates the ceil of a rational number
-     *
-     * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
-     **/
-    "ceil": function(places) {
-
-      places = Math.pow(10, places || 0);
-
-      if (isNaN(this["n"]) || isNaN(this["d"])) {
-        return new Fraction(NaN);
-      }
-      return newFraction(Math.ceil(places * this["s"] * this["n"] / this["d"]), places);
-    },
-
-    /**
-     * Calculates the floor of a rational number
-     *
-     * Ex: new Fraction('4.(3)').floor() => (4 / 1)
-     **/
-    "floor": function(places) {
-
-      places = Math.pow(10, places || 0);
-
-      if (isNaN(this["n"]) || isNaN(this["d"])) {
-        return new Fraction(NaN);
-      }
-      return newFraction(Math.floor(places * this["s"] * this["n"] / this["d"]), places);
-    },
-
-    /**
-     * Rounds a rational numbers
-     *
-     * Ex: new Fraction('4.(3)').round() => (4 / 1)
-     **/
-    "round": function(places) {
-
-      places = Math.pow(10, places || 0);
-
-      if (isNaN(this["n"]) || isNaN(this["d"])) {
-        return new Fraction(NaN);
-      }
-      return newFraction(Math.round(places * this["s"] * this["n"] / this["d"]), places);
-    },
-
-    /**
-     * Gets the inverse of the fraction, means numerator and denominator are exchanged
-     *
-     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
-     **/
-    "inverse": function() {
-
-      return newFraction(this["s"] * this["d"], this["n"]);
-    },
-
-    /**
-     * Calculates the fraction to some rational exponent, if possible
-     *
-     * Ex: new Fraction(-1,2).pow(-3) => -8
-     */
-    "pow": function(a, b) {
-
-      parse(a, b);
-
-      // Trivial case when exp is an integer
-
-      if (P['d'] === 1) {
-
-        if (P['s'] < 0) {
-          return newFraction(Math.pow(this['s'] * this["d"], P['n']), Math.pow(this["n"], P['n']));
-        } else {
-          return newFraction(Math.pow(this['s'] * this["n"], P['n']), Math.pow(this["d"], P['n']));
-        }
-      }
-
-      // Negative roots become complex
-      //     (-a/b)^(c/d) = x
-      // <=> (-1)^(c/d) * (a/b)^(c/d) = x
-      // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x         # rotate 1 by 180°
-      // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )
-      // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.
-      if (this['s'] < 0) return null;
-
-      // Now prime factor n and d
-      var N = factorize(this['n']);
-      var D = factorize(this['d']);
-
-      // Exponentiate and take root for n and d individually
-      var n = 1;
-      var d = 1;
-      for (var k in N) {
-        if (k === '1') continue;
-        if (k === '0') {
-          n = 0;
-          break;
-        }
-        N[k]*= P['n'];
-
-        if (N[k] % P['d'] === 0) {
-          N[k]/= P['d'];
-        } else return null;
-        n*= Math.pow(k, N[k]);
-      }
-
-      for (var k in D) {
-        if (k === '1') continue;
-        D[k]*= P['n'];
-
-        if (D[k] % P['d'] === 0) {
-          D[k]/= P['d'];
-        } else return null;
-        d*= Math.pow(k, D[k]);
-      }
-
-      if (P['s'] < 0) {
-        return newFraction(d, n);
-      }
-      return newFraction(n, d);
-    },
-
-    /**
-     * Check if two rational numbers are the same
-     *
-     * Ex: new Fraction(19.6).equals([98, 5]);
-     **/
-    "equals": function(a, b) {
-
-      parse(a, b);
-      return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"]; // Same as compare() === 0
-    },
-
-    /**
-     * Check if two rational numbers are the same
-     *
-     * Ex: new Fraction(19.6).equals([98, 5]);
-     **/
-    "compare": function(a, b) {
-
-      parse(a, b);
-      var t = (this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"]);
-      return (0 < t) - (t < 0);
-    },
-
-    "simplify": function(eps) {
-
-      if (isNaN(this['n']) || isNaN(this['d'])) {
-        return this;
-      }
-
-      eps = eps || 0.001;
-
-      var thisABS = this['abs']();
-      var cont = thisABS['toContinued']();
-
-      for (var i = 1; i < cont.length; i++) {
-
-        var s = newFraction(cont[i - 1], 1);
-        for (var k = i - 2; k >= 0; k--) {
-          s = s['inverse']()['add'](cont[k]);
-        }
-
-        if (Math.abs(s['sub'](thisABS).valueOf()) < eps) {
-          return s['mul'](this['s']);
-        }
-      }
-      return this;
-    },
-
-    /**
-     * Check if two rational numbers are divisible
-     *
-     * Ex: new Fraction(19.6).divisible(1.5);
-     */
-    "divisible": function(a, b) {
-
-      parse(a, b);
-      return !(!(P["n"] * this["d"]) || ((this["n"] * P["d"]) % (P["n"] * this["d"])));
-    },
-
-    /**
-     * Returns a decimal representation of the fraction
-     *
-     * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
-     **/
-    'valueOf': function() {
-
-      return this["s"] * this["n"] / this["d"];
-    },
-
-    /**
-     * Returns a string-fraction representation of a Fraction object
-     *
-     * Ex: new Fraction("1.'3'").toFraction(true) => "4 1/3"
-     **/
-    'toFraction': function(excludeWhole) {
-
-      var whole, str = "";
-      var n = this["n"];
-      var d = this["d"];
-      if (this["s"] < 0) {
-        str+= '-';
-      }
-
-      if (d === 1) {
-        str+= n;
-      } else {
-
-        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
-          str+= whole;
-          str+= " ";
-          n%= d;
-        }
-
-        str+= n;
-        str+= '/';
-        str+= d;
-      }
-      return str;
-    },
-
-    /**
-     * Returns a latex representation of a Fraction object
-     *
-     * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
-     **/
-    'toLatex': function(excludeWhole) {
-
-      var whole, str = "";
-      var n = this["n"];
-      var d = this["d"];
-      if (this["s"] < 0) {
-        str+= '-';
-      }
-
-      if (d === 1) {
-        str+= n;
-      } else {
-
-        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
-          str+= whole;
-          n%= d;
-        }
-
-        str+= "\\frac{";
-        str+= n;
-        str+= '}{';
-        str+= d;
-        str+= '}';
-      }
-      return str;
-    },
-
-    /**
-     * Returns an array of continued fraction elements
-     *
-     * Ex: new Fraction("7/8").toContinued() => [0,1,7]
-     */
-    'toContinued': function() {
-
-      var t;
-      var a = this['n'];
-      var b = this['d'];
-      var res = [];
-
-      if (isNaN(a) || isNaN(b)) {
-        return res;
-      }
-
-      do {
-        res.push(Math.floor(a / b));
-        t = a % b;
-        a = b;
-        b = t;
-      } while (a !== 1);
-
-      return res;
-    },
-
-    /**
-     * Creates a string representation of a fraction with all digits
-     *
-     * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
-     **/
-    'toString': function(dec) {
-
-      var N = this["n"];
-      var D = this["d"];
-
-      if (isNaN(N) || isNaN(D)) {
-        return "NaN";
-      }
-
-      dec = dec || 15; // 15 = decimal places when no repetation
-
-      var cycLen = cycleLen(N, D); // Cycle length
-      var cycOff = cycleStart(N, D, cycLen); // Cycle start
-
-      var str = this['s'] < 0 ? "-" : "";
-
-      str+= N / D | 0;
-
-      N%= D;
-      N*= 10;
-
-      if (N)
-        str+= ".";
-
-      if (cycLen) {
-
-        for (var i = cycOff; i--;) {
-          str+= N / D | 0;
-          N%= D;
-          N*= 10;
-        }
-        str+= "(";
-        for (var i = cycLen; i--;) {
-          str+= N / D | 0;
-          N%= D;
-          N*= 10;
-        }
-        str+= ")";
-      } else {
-        for (var i = dec; N && i--;) {
-          str+= N / D | 0;
-          N%= D;
-          N*= 10;
-        }
-      }
-      return str;
-    }
-  };
-
-  if (true) {
-    Object.defineProperty(Fraction, "__esModule", { 'value': true });
-    Fraction['default'] = Fraction;
-    Fraction['Fraction'] = Fraction;
-    module['exports'] = Fraction;
-  } else {}
-
-})(this);
-
-
 /***/ }),
 
 /***/ 52794:
@@ -1105,7 +213,7 @@ module.exports.TinyEmitter = E;
 
 /***/ }),
 
-/***/ 55807:
+/***/ 43348:
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
 "use strict";
@@ -10367,17 +9475,17 @@ var createBigNumberClass = /* #__PURE__ */factory_factory(BigNumber_name, BigNum
  *
  * Example:
  *
- * var c = new Complex('99.3+8i');
+ * const c = new Complex('99.3+8i');
  * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
  *
  */
 
 
-var complex_cosh = Math.cosh || function (x) {
+const complex_cosh = Math.cosh || function (x) {
   return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;
 };
 
-var complex_sinh = Math.sinh || function (x) {
+const complex_sinh = Math.sinh || function (x) {
   return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;
 };
 
@@ -10387,16 +9495,16 @@ var complex_sinh = Math.sinh || function (x) {
  * @param {number} x
  * @returns {number} cos(x) - 1
  */
-var cosm1 = function (x) {
+const cosm1 = function (x) {
 
-  var b = Math.PI / 4;
+  const b = Math.PI / 4;
   if (-b > x || x > b) {
     return Math.cos(x) - 1.0;
   }
 
   /* Calculate horner form of polynomial of taylor series in Q
-  var fac = 1, alt = 1, pol = {};
-  for (var i = 0; i <= 16; i++) {
+  let fac = 1, alt = 1, pol = {};
+  for (let i = 0; i <= 16; i++) {
     fac*= i || 1;
     if (i % 2 == 0) {
       pol[i] = new Fraction(1, alt * fac);
@@ -10406,7 +9514,7 @@ var cosm1 = function (x) {
   console.log(new Polynomial(pol).toHorner()); // (((((((1/20922789888000x^2-1/87178291200)x^2+1/479001600)x^2-1/3628800)x^2+1/40320)x^2-1/720)x^2+1/24)x^2-1/2)x^2+1
   */
 
-  var xx = x * x;
+  const xx = x * x;
   return xx * (
     xx * (
       xx * (
@@ -10424,25 +9532,23 @@ var cosm1 = function (x) {
     - 1 / 2);
 };
 
-var complex_hypot = function (x, y) {
+const complex_hypot = function (x, y) {
 
-  var a = Math.abs(x);
-  var b = Math.abs(y);
+  x = Math.abs(x);
+  y = Math.abs(y);
 
-  if (a < 3000 && b < 3000) {
-    return Math.sqrt(a * a + b * b);
-  }
+  // Ensure `x` is the larger value
+  if (x < y) [x, y] = [y, x];
 
-  if (a < b) {
-    a = b;
-    b = x / y;
-  } else {
-    b = y / x;
-  }
-  return a * Math.sqrt(1 + b * b);
+  // If both are below the threshold, use straightforward Pythagoras
+  if (x < 1e8) return Math.sqrt(x * x + y * y);
+
+  // For larger values, scale to avoid overflow
+  y /= x;
+  return x * Math.sqrt(1 + y * y);
 };
 
-var parser_exit = function () {
+const parser_exit = function () {
   throw SyntaxError('Invalid Param');
 };
 
@@ -10455,8 +9561,8 @@ var parser_exit = function () {
  */
 function logHypot(a, b) {
 
-  var _a = Math.abs(a);
-  var _b = Math.abs(b);
+  const _a = Math.abs(a);
+  const _b = Math.abs(b);
 
   if (a === 0) {
     return Math.log(_b);
@@ -10482,10 +9588,10 @@ function logHypot(a, b) {
    *
    * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)
 
-   var fn = function(a, b) {
+   const fn = function(a, b) {
    a = Math.abs(a);
    b = Math.abs(b);
-   var t = Math.min(a, b);
+   let t = Math.min(a, b);
    a = Math.max(a, b);
    t = t / a;
 
@@ -10502,15 +9608,16 @@ function logHypot(a, b) {
 
    */
 
-  a = a / 2;
-  b = b / 2;
+  a = a * 0.5;
+  b = b * 0.5;
 
   return 0.5 * Math.log(a * a + b * b) + Math.LN2;
 }
 
-var parse = function (a, b) {
+const complex_P = { 're': 0, 'im': 0 };
+const parse = function (a, b) {
 
-  var z = { 're': 0, 'im': 0 };
+  const z = complex_P;
 
   if (a === undefined || a === null) {
     z['re'] =
@@ -10527,13 +9634,13 @@ var parse = function (a, b) {
           z['re'] = a['re'];
           z['im'] = a['im'];
         } else if ('abs' in a && 'arg' in a) {
-          if (!Number.isFinite(a['abs']) && Number.isFinite(a['arg'])) {
+          if (!isFinite(a['abs']) && isFinite(a['arg'])) {
             return Complex['INFINITY'];
           }
           z['re'] = a['abs'] * Math.cos(a['arg']);
           z['im'] = a['abs'] * Math.sin(a['arg']);
         } else if ('r' in a && 'phi' in a) {
-          if (!Number.isFinite(a['r']) && Number.isFinite(a['phi'])) {
+          if (!isFinite(a['r']) && isFinite(a['phi'])) {
             return Complex['INFINITY'];
           }
           z['re'] = a['r'] * Math.cos(a['phi']);
@@ -10549,19 +9656,20 @@ var parse = function (a, b) {
       case 'string':
 
         z['im'] = /* void */
-          z['re'] = 0;
+        z['re'] = 0;
 
-        var tokens = a.match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
-        var plus = 1;
-        var minus = 0;
+        const tokens = a.replace(/_/g, '')
+          .match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
+        let plus = 1;
+        let minus = 0;
 
         if (tokens === null) {
           parser_exit();
         }
 
-        for (var i = 0; i < tokens.length; i++) {
+        for (let i = 0; i < tokens.length; i++) {
 
-          var c = tokens[i];
+          const c = tokens[i];
 
           if (c === ' ' || c === '\t' || c === '\n') {
             /* void */
@@ -10632,7 +9740,7 @@ function Complex(a, b) {
     return new Complex(a, b);
   }
 
-  var z = parse(a, b);
+  const z = parse(a, b);
 
   this['re'] = z['re'];
   this['im'] = z['im'];
@@ -10650,7 +9758,7 @@ Complex.prototype = {
    */
   'sign': function () {
 
-    var abs = this['abs']();
+    const abs = complex_hypot(this['re'], this['im']);
 
     return new Complex(
       this['re'] / abs,
@@ -10664,15 +9772,18 @@ Complex.prototype = {
    */
   'add': function (a, b) {
 
-    var z = new Complex(a, b);
+    const z = parse(a, b);
 
-    // Infinity + Infinity = NaN
-    if (this['isInfinite']() && z['isInfinite']()) {
-      return Complex['NAN'];
-    }
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
 
-    // Infinity + z = Infinity { where z != Infinity }
-    if (this['isInfinite']() || z['isInfinite']()) {
+      if (tInfin && zInfin) {
+        // Infinity + Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity + z = Infinity { where z != Infinity }
       return Complex['INFINITY'];
     }
 
@@ -10688,15 +9799,18 @@ Complex.prototype = {
    */
   'sub': function (a, b) {
 
-    var z = new Complex(a, b);
+    const z = parse(a, b);
 
-    // Infinity - Infinity = NaN
-    if (this['isInfinite']() && z['isInfinite']()) {
-      return Complex['NAN'];
-    }
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
 
-    // Infinity - z = Infinity { where z != Infinity }
-    if (this['isInfinite']() || z['isInfinite']()) {
+      if (tInfin && zInfin) {
+        // Infinity - Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity - z = Infinity { where z != Infinity }
       return Complex['INFINITY'];
     }
 
@@ -10712,19 +9826,24 @@ Complex.prototype = {
    */
   'mul': function (a, b) {
 
-    var z = new Complex(a, b);
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
 
     // Infinity * 0 = NaN
-    if ((this['isInfinite']() && z['isZero']()) || (this['isZero']() && z['isInfinite']())) {
+    if (tInfin && zIsZero || zInfin && tIsZero) {
       return Complex['NAN'];
     }
 
     // Infinity * z = Infinity { where z != 0 }
-    if (this['isInfinite']() || z['isInfinite']()) {
+    if (tInfin || zInfin) {
       return Complex['INFINITY'];
     }
 
-    // Short circuit for real values
+    // Shortcut for real values
     if (z['im'] === 0 && this['im'] === 0) {
       return new Complex(this['re'] * z['re'], 0);
     }
@@ -10741,52 +9860,50 @@ Complex.prototype = {
    */
   'div': function (a, b) {
 
-    var z = new Complex(a, b);
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
 
     // 0 / 0 = NaN and Infinity / Infinity = NaN
-    if ((this['isZero']() && z['isZero']()) || (this['isInfinite']() && z['isInfinite']())) {
+    if (tIsZero && zIsZero || tInfin && zInfin) {
       return Complex['NAN'];
     }
 
     // Infinity / 0 = Infinity
-    if (this['isInfinite']() || z['isZero']()) {
+    if (zIsZero || tInfin) {
       return Complex['INFINITY'];
     }
 
     // 0 / Infinity = 0
-    if (this['isZero']() || z['isInfinite']()) {
+    if (tIsZero || zInfin) {
       return Complex['ZERO'];
     }
 
-    a = this['re'];
-    b = this['im'];
-
-    var c = z['re'];
-    var d = z['im'];
-    var t, x;
-
-    if (0 === d) {
+    if (0 === z['im']) {
       // Divisor is real
-      return new Complex(a / c, b / c);
+      return new Complex(this['re'] / z['re'], this['im'] / z['re']);
     }
 
-    if (Math.abs(c) < Math.abs(d)) {
+    if (Math.abs(z['re']) < Math.abs(z['im'])) {
 
-      x = c / d;
-      t = c * x + d;
+      const x = z['re'] / z['im'];
+      const t = z['re'] * x + z['im'];
 
       return new Complex(
-        (a * x + b) / t,
-        (b * x - a) / t);
+        (this['re'] * x + this['im']) / t,
+        (this['im'] * x - this['re']) / t);
 
     } else {
 
-      x = d / c;
-      t = d * x + c;
+      const x = z['im'] / z['re'];
+      const t = z['im'] * x + z['re'];
 
       return new Complex(
-        (a + b * x) / t,
-        (b - a * x) / t);
+        (this['re'] + this['im'] * x) / t,
+        (this['im'] - this['re'] * x) / t);
     }
   },
 
@@ -10797,33 +9914,33 @@ Complex.prototype = {
    */
   'pow': function (a, b) {
 
-    var z = new Complex(a, b);
+    const z = parse(a, b);
 
-    a = this['re'];
-    b = this['im'];
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
 
-    if (z['isZero']()) {
+    if (zIsZero) {
       return Complex['ONE'];
     }
 
     // If the exponent is real
     if (z['im'] === 0) {
 
-      if (b === 0 && a > 0) {
+      if (this['im'] === 0 && this['re'] > 0) {
 
-        return new Complex(Math.pow(a, z['re']), 0);
+        return new Complex(Math.pow(this['re'], z['re']), 0);
 
-      } else if (a === 0) { // If base is fully imaginary
+      } else if (this['re'] === 0) { // If base is fully imaginary
 
         switch ((z['re'] % 4 + 4) % 4) {
           case 0:
-            return new Complex(Math.pow(b, z['re']), 0);
+            return new Complex(Math.pow(this['im'], z['re']), 0);
           case 1:
-            return new Complex(0, Math.pow(b, z['re']));
+            return new Complex(0, Math.pow(this['im'], z['re']));
           case 2:
-            return new Complex(-Math.pow(b, z['re']), 0);
+            return new Complex(-Math.pow(this['im'], z['re']), 0);
           case 3:
-            return new Complex(0, -Math.pow(b, z['re']));
+            return new Complex(0, -Math.pow(this['im'], z['re']));
         }
       }
     }
@@ -10847,18 +9964,18 @@ Complex.prototype = {
      *
      */
 
-    if (a === 0 && b === 0 && z['re'] > 0 && z['im'] >= 0) {
+    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero
       return Complex['ZERO'];
     }
 
-    var arg = Math.atan2(b, a);
-    var loh = logHypot(a, b);
+    const arg = Math.atan2(this['im'], this['re']);
+    const loh = logHypot(this['re'], this['im']);
 
-    a = Math.exp(z['re'] * loh - z['im'] * arg);
-    b = z['im'] * loh + z['re'] * arg;
+    let re = Math.exp(z['re'] * loh - z['im'] * arg);
+    let im = z['im'] * loh + z['re'] * arg;
     return new Complex(
-      a * Math.cos(b),
-      a * Math.sin(b));
+      re * Math.cos(im),
+      re * Math.sin(im));
   },
 
   /**
@@ -10868,30 +9985,28 @@ Complex.prototype = {
    */
   'sqrt': function () {
 
-    var a = this['re'];
-    var b = this['im'];
-    var r = this['abs']();
+    const a = this['re'];
+    const b = this['im'];
 
-    var re, im;
-
-    if (a >= 0) {
-
-      if (b === 0) {
+    if (b === 0) {
+      // Real number case
+      if (a >= 0) {
         return new Complex(Math.sqrt(a), 0);
+      } else {
+        return new Complex(0, Math.sqrt(-a));
       }
-
-      re = 0.5 * Math.sqrt(2.0 * (r + a));
-    } else {
-      re = Math.abs(b) / Math.sqrt(2 * (r - a));
     }
 
-    if (a <= 0) {
-      im = 0.5 * Math.sqrt(2.0 * (r - a));
+    const r = complex_hypot(a, b);
+
+    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)
+    let im = Math.abs(b) / (2 * re);
+
+    if (a >= 0) {
+      return new Complex(re, b < 0 ? -im : im);
     } else {
-      im = Math.abs(b) / Math.sqrt(2 * (r + a));
+      return new Complex(im, b < 0 ? -re : re);
     }
-
-    return new Complex(re, b < 0 ? -im : im);
   },
 
   /**
@@ -10901,14 +10016,14 @@ Complex.prototype = {
    */
   'exp': function () {
 
-    var tmp = Math.exp(this['re']);
+    const er = Math.exp(this['re']);
 
     if (this['im'] === 0) {
-      //return new Complex(tmp, 0);
+      return new Complex(er, 0);
     }
     return new Complex(
-      tmp * Math.cos(this['im']),
-      tmp * Math.sin(this['im']));
+      er * Math.cos(this['im']),
+      er * Math.sin(this['im']));
   },
 
   /**
@@ -10927,8 +10042,8 @@ Complex.prototype = {
      = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)
      */
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     return new Complex(
       Math.expm1(a) * Math.cos(b) + cosm1(b),
@@ -10942,11 +10057,11 @@ Complex.prototype = {
    */
   'log': function () {
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (b === 0 && a > 0) {
-      //return new Complex(Math.log(a), 0);
+      return new Complex(Math.log(a), 0);
     }
 
     return new Complex(
@@ -10984,8 +10099,8 @@ Complex.prototype = {
     // sin(z) = ( e^iz - e^-iz ) / 2i 
     //        = sin(a)cosh(b) + i cos(a)sinh(b)
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     return new Complex(
       Math.sin(a) * complex_cosh(b),
@@ -11002,8 +10117,8 @@ Complex.prototype = {
     // cos(z) = ( e^iz + e^-iz ) / 2 
     //        = cos(a)cosh(b) - i sin(a)sinh(b)
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     return new Complex(
       Math.cos(a) * complex_cosh(b),
@@ -11022,9 +10137,9 @@ Complex.prototype = {
     //        = ( e^2iz - 1 ) / i( e^2iz + 1 )
     //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )
 
-    var a = 2 * this['re'];
-    var b = 2 * this['im'];
-    var d = Math.cos(a) + complex_cosh(b);
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) + complex_cosh(b);
 
     return new Complex(
       Math.sin(a) / d,
@@ -11040,9 +10155,9 @@ Complex.prototype = {
 
     // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))
 
-    var a = 2 * this['re'];
-    var b = 2 * this['im'];
-    var d = Math.cos(a) - complex_cosh(b);
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) - complex_cosh(b);
 
     return new Complex(
       -Math.sin(a) / d,
@@ -11058,9 +10173,9 @@ Complex.prototype = {
 
     // sec(c) = 2 / (e^(ci) + e^(-ci))
 
-    var a = this['re'];
-    var b = this['im'];
-    var d = 0.5 * complex_cosh(2 * b) + 0.5 * Math.cos(2 * a);
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * complex_cosh(2 * b) + 0.5 * Math.cos(2 * a);
 
     return new Complex(
       Math.cos(a) * complex_cosh(b) / d,
@@ -11076,9 +10191,9 @@ Complex.prototype = {
 
     // csc(c) = 2i / (e^(ci) - e^(-ci))
 
-    var a = this['re'];
-    var b = this['im'];
-    var d = 0.5 * complex_cosh(2 * b) - 0.5 * Math.cos(2 * a);
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * complex_cosh(2 * b) - 0.5 * Math.cos(2 * a);
 
     return new Complex(
       Math.sin(a) * complex_cosh(b) / d,
@@ -11094,14 +10209,14 @@ Complex.prototype = {
 
     // asin(c) = -i * log(ci + sqrt(1 - c^2))
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
-    var t1 = new Complex(
+    const t1 = new Complex(
       b * b - a * a + 1,
       -2 * a * b)['sqrt']();
 
-    var t2 = new Complex(
+    const t2 = new Complex(
       t1['re'] - b,
       t1['im'] + a)['log']();
 
@@ -11117,14 +10232,14 @@ Complex.prototype = {
 
     // acos(c) = i * log(c - i * sqrt(1 - c^2))
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
-    var t1 = new Complex(
+    const t1 = new Complex(
       b * b - a * a + 1,
       -2 * a * b)['sqrt']();
 
-    var t2 = new Complex(
+    const t2 = new Complex(
       t1['re'] - b,
       t1['im'] + a)['log']();
 
@@ -11140,8 +10255,8 @@ Complex.prototype = {
 
     // atan(c) = i / 2 log((i + x) / (i - x))
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (a === 0) {
 
@@ -11154,9 +10269,9 @@ Complex.prototype = {
       }
     }
 
-    var d = a * a + (1.0 - b) * (1.0 - b);
+    const d = a * a + (1.0 - b) * (1.0 - b);
 
-    var t1 = new Complex(
+    const t1 = new Complex(
       (1 - b * b - a * a) / d,
       -2 * a / d).log();
 
@@ -11172,14 +10287,14 @@ Complex.prototype = {
 
     // acot(c) = i / 2 log((c - i) / (c + i))
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (b === 0) {
       return new Complex(Math.atan2(1, a), 0);
     }
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
     return (d !== 0)
       ? new Complex(
         a / d,
@@ -11198,14 +10313,14 @@ Complex.prototype = {
 
     // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (a === 0 && b === 0) {
       return new Complex(0, Infinity);
     }
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
     return (d !== 0)
       ? new Complex(
         a / d,
@@ -11224,14 +10339,14 @@ Complex.prototype = {
 
     // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (a === 0 && b === 0) {
       return new Complex(Math.PI / 2, Infinity);
     }
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
     return (d !== 0)
       ? new Complex(
         a / d,
@@ -11250,8 +10365,8 @@ Complex.prototype = {
 
     // sinh(c) = (e^c - e^-c) / 2
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     return new Complex(
       complex_sinh(a) * Math.cos(b),
@@ -11267,8 +10382,8 @@ Complex.prototype = {
 
     // cosh(c) = (e^c + e^-c) / 2
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     return new Complex(
       complex_cosh(a) * Math.cos(b),
@@ -11284,9 +10399,9 @@ Complex.prototype = {
 
     // tanh(c) = (e^c - e^-c) / (e^c + e^-c)
 
-    var a = 2 * this['re'];
-    var b = 2 * this['im'];
-    var d = complex_cosh(a) + Math.cos(b);
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = complex_cosh(a) + Math.cos(b);
 
     return new Complex(
       complex_sinh(a) / d,
@@ -11302,9 +10417,9 @@ Complex.prototype = {
 
     // coth(c) = (e^c + e^-c) / (e^c - e^-c)
 
-    var a = 2 * this['re'];
-    var b = 2 * this['im'];
-    var d = complex_cosh(a) - Math.cos(b);
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = complex_cosh(a) - Math.cos(b);
 
     return new Complex(
       complex_sinh(a) / d,
@@ -11320,9 +10435,9 @@ Complex.prototype = {
 
     // csch(c) = 2 / (e^c - e^-c)
 
-    var a = this['re'];
-    var b = this['im'];
-    var d = Math.cos(2 * b) - complex_cosh(2 * a);
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) - complex_cosh(2 * a);
 
     return new Complex(
       -2 * complex_sinh(a) * Math.cos(b) / d,
@@ -11338,9 +10453,9 @@ Complex.prototype = {
 
     // sech(c) = 2 / (e^c + e^-c)
 
-    var a = this['re'];
-    var b = this['im'];
-    var d = Math.cos(2 * b) + complex_cosh(2 * a);
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) + complex_cosh(2 * a);
 
     return new Complex(
       2 * complex_cosh(a) * Math.cos(b) / d,
@@ -11356,10 +10471,10 @@ Complex.prototype = {
 
     // asinh(c) = log(c + sqrt(c^2 + 1))
 
-    var tmp = this['im'];
+    let tmp = this['im'];
     this['im'] = -this['re'];
     this['re'] = tmp;
-    var res = this['asin']();
+    const res = this['asin']();
 
     this['re'] = -this['im'];
     this['im'] = tmp;
@@ -11379,13 +10494,13 @@ Complex.prototype = {
 
     // acosh(c) = log(c + sqrt(c^2 - 1))
 
-    var res = this['acos']();
+    const res = this['acos']();
     if (res['im'] <= 0) {
-      var tmp = res['re'];
+      const tmp = res['re'];
       res['re'] = -res['im'];
       res['im'] = tmp;
     } else {
-      var tmp = res['im'];
+      const tmp = res['im'];
       res['im'] = -res['re'];
       res['re'] = tmp;
     }
@@ -11401,15 +10516,15 @@ Complex.prototype = {
 
     // atanh(c) = log((1+c) / (1-c)) / 2
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
-    var noIM = a > 1 && b === 0;
-    var oneMinus = 1 - a;
-    var onePlus = 1 + a;
-    var d = oneMinus * oneMinus + b * b;
+    const noIM = a > 1 && b === 0;
+    const oneMinus = 1 - a;
+    const onePlus = 1 + a;
+    const d = oneMinus * oneMinus + b * b;
 
-    var x = (d !== 0)
+    const x = (d !== 0)
       ? new Complex(
         (onePlus * oneMinus - b * b) / d,
         (b * oneMinus + onePlus * b) / d)
@@ -11417,7 +10532,7 @@ Complex.prototype = {
         (a !== -1) ? (a / 0) : 0,
         (b !== 0) ? (b / 0) : 0);
 
-    var temp = x['re'];
+    const temp = x['re'];
     x['re'] = logHypot(x['re'], x['im']) / 2;
     x['im'] = Math.atan2(x['im'], temp) / 2;
     if (noIM) {
@@ -11435,14 +10550,14 @@ Complex.prototype = {
 
     // acoth(c) = log((c+1) / (c-1)) / 2
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (a === 0 && b === 0) {
       return new Complex(0, Math.PI / 2);
     }
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
     return (d !== 0)
       ? new Complex(
         a / d,
@@ -11461,8 +10576,8 @@ Complex.prototype = {
 
     // acsch(c) = log((1+sqrt(1+c^2))/c)
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (b === 0) {
 
@@ -11472,7 +10587,7 @@ Complex.prototype = {
           : Infinity, 0);
     }
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
     return (d !== 0)
       ? new Complex(
         a / d,
@@ -11491,14 +10606,14 @@ Complex.prototype = {
 
     // asech(c) = log((1+sqrt(1-c^2))/c)
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
     if (this['isZero']()) {
       return Complex['INFINITY'];
     }
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
     return (d !== 0)
       ? new Complex(
         a / d,
@@ -11524,10 +10639,10 @@ Complex.prototype = {
       return Complex['ZERO'];
     }
 
-    var a = this['re'];
-    var b = this['im'];
+    const a = this['re'];
+    const b = this['im'];
 
-    var d = a * a + b * b;
+    const d = a * a + b * b;
 
     return new Complex(a / d, -b / d);
   },
@@ -11603,7 +10718,7 @@ Complex.prototype = {
    */
   'equals': function (a, b) {
 
-    var z = new Complex(a, b);
+    const z = parse(a, b);
 
     return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&
       Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];
@@ -11626,9 +10741,9 @@ Complex.prototype = {
    */
   'toString': function () {
 
-    var a = this['re'];
-    var b = this['im'];
-    var ret = "";
+    let a = this['re'];
+    let b = this['im'];
+    let ret = "";
 
     if (this['isNaN']()) {
       return 'NaN';
@@ -11731,7 +10846,7 @@ Complex.prototype = {
    * @returns {boolean}
    */
   'isInfinite': function () {
-    return !(this['isNaN']() || this['isFinite']());
+    return !this['isFinite']();
   }
 };
 
@@ -11940,8 +11055,899 @@ var createComplexClass = /* #__PURE__ */factory_factory(Complex_name, Complex_de
 }, {
   isClass: true
 });
-// EXTERNAL MODULE: ../../../node_modules/fraction.js/fraction.js
-var fraction = __webpack_require__(67042);
+;// CONCATENATED MODULE: ../../../node_modules/fraction.js/fraction.js
+/**
+ * @license Fraction.js v4.3.7 31/08/2023
+ * https://www.xarg.org/2014/03/rational-numbers-in-javascript/
+ *
+ * Copyright (c) 2023, Robert Eisele (robert@raw.org)
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ **/
+
+
+/**
+ *
+ * This class offers the possibility to calculate fractions.
+ * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
+ *
+ * Array/Object form
+ * [ 0 => <numerator>, 1 => <denominator> ]
+ * [ n => <numerator>, d => <denominator> ]
+ *
+ * Integer form
+ * - Single integer value
+ *
+ * Double form
+ * - Single double value
+ *
+ * String form
+ * 123.456 - a simple double
+ * 123/456 - a string fraction
+ * 123.'456' - a double with repeating decimal places
+ * 123.(456) - synonym
+ * 123.45'6' - a double with repeating last place
+ * 123.45(6) - synonym
+ *
+ * Example:
+ *
+ * var f = new Fraction("9.4'31'");
+ * f.mul([-4, 3]).div(4.9);
+ *
+ */
+
+
+// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
+// Example: 1/7 = 0.(142857) has 6 repeating decimal places.
+// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
+var MAX_CYCLE_LEN = 2000;
+
+// Parsed data to avoid calling "new" all the time
+var fraction_P = {
+  "s": 1,
+  "n": 0,
+  "d": 1
+};
+
+function fraction_assign(n, s) {
+
+  if (isNaN(n = parseInt(n, 10))) {
+    throw InvalidParameter();
+  }
+  return n * s;
+}
+
+// Creates a new Fraction internally without the need of the bulky constructor
+function newFraction(n, d) {
+
+  if (d === 0) {
+    throw DivisionByZero();
+  }
+
+  var f = Object.create(Fraction.prototype);
+  f["s"] = n < 0 ? -1 : 1;
+
+  n = n < 0 ? -n : n;
+
+  var a = gcd(n, d);
+
+  f["n"] = n / a;
+  f["d"] = d / a;
+  return f;
+}
+
+function factorize(num) {
+
+  var factors = {};
+
+  var n = num;
+  var i = 2;
+  var s = 4;
+
+  while (s <= n) {
+
+    while (n % i === 0) {
+      n/= i;
+      factors[i] = (factors[i] || 0) + 1;
+    }
+    s+= 1 + 2 * i++;
+  }
+
+  if (n !== num) {
+    if (n > 1)
+      factors[n] = (factors[n] || 0) + 1;
+  } else {
+    factors[num] = (factors[num] || 0) + 1;
+  }
+  return factors;
+}
+
+var fraction_parse = function(p1, p2) {
+
+  var n = 0, d = 1, s = 1;
+  var v = 0, w = 0, x = 0, y = 1, z = 1;
+
+  var A = 0, B = 1;
+  var C = 1, D = 1;
+
+  var N = 10000000;
+  var M;
+
+  if (p1 === undefined || p1 === null) {
+    /* void */
+  } else if (p2 !== undefined) {
+    n = p1;
+    d = p2;
+    s = n * d;
+
+    if (n % 1 !== 0 || d % 1 !== 0) {
+      throw NonIntegerParameter();
+    }
+
+  } else
+    switch (typeof p1) {
+
+      case "object":
+        {
+          if ("d" in p1 && "n" in p1) {
+            n = p1["n"];
+            d = p1["d"];
+            if ("s" in p1)
+              n*= p1["s"];
+          } else if (0 in p1) {
+            n = p1[0];
+            if (1 in p1)
+              d = p1[1];
+          } else {
+            throw InvalidParameter();
+          }
+          s = n * d;
+          break;
+        }
+      case "number":
+        {
+          if (p1 < 0) {
+            s = p1;
+            p1 = -p1;
+          }
+
+          if (p1 % 1 === 0) {
+            n = p1;
+          } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow
+
+            if (p1 >= 1) {
+              z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));
+              p1/= z;
+            }
+
+            // Using Farey Sequences
+            // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/
+
+            while (B <= N && D <= N) {
+              M = (A + C) / (B + D);
+
+              if (p1 === M) {
+                if (B + D <= N) {
+                  n = A + C;
+                  d = B + D;
+                } else if (D > B) {
+                  n = C;
+                  d = D;
+                } else {
+                  n = A;
+                  d = B;
+                }
+                break;
+
+              } else {
+
+                if (p1 > M) {
+                  A+= C;
+                  B+= D;
+                } else {
+                  C+= A;
+                  D+= B;
+                }
+
+                if (B > N) {
+                  n = C;
+                  d = D;
+                } else {
+                  n = A;
+                  d = B;
+                }
+              }
+            }
+            n*= z;
+          } else if (isNaN(p1) || isNaN(p2)) {
+            d = n = NaN;
+          }
+          break;
+        }
+      case "string":
+        {
+          B = p1.match(/\d+|./g);
+
+          if (B === null)
+            throw InvalidParameter();
+
+          if (B[A] === '-') {// Check for minus sign at the beginning
+            s = -1;
+            A++;
+          } else if (B[A] === '+') {// Check for plus sign at the beginning
+            A++;
+          }
+
+          if (B.length === A + 1) { // Check if it's just a simple number "1234"
+            w = fraction_assign(B[A++], s);
+          } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number
+
+            if (B[A] !== '.') { // Handle 0.5 and .5
+              v = fraction_assign(B[A++], s);
+            }
+            A++;
+
+            // Check for decimal places
+            if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === "'" && B[A + 3] === "'") {
+              w = fraction_assign(B[A], s);
+              y = Math.pow(10, B[A].length);
+              A++;
+            }
+
+            // Check for repeating places
+            if (B[A] === '(' && B[A + 2] === ')' || B[A] === "'" && B[A + 2] === "'") {
+              x = fraction_assign(B[A + 1], s);
+              z = Math.pow(10, B[A + 1].length) - 1;
+              A+= 3;
+            }
+
+          } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
+            w = fraction_assign(B[A], s);
+            y = fraction_assign(B[A + 2], 1);
+            A+= 3;
+          } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction "123 1/2"
+            v = fraction_assign(B[A], s);
+            w = fraction_assign(B[A + 2], s);
+            y = fraction_assign(B[A + 4], 1);
+            A+= 5;
+          }
+
+          if (B.length <= A) { // Check for more tokens on the stack
+            d = y * z;
+            s = /* void */
+            n = x + d * v + z * w;
+            break;
+          }
+
+          /* Fall through on error */
+        }
+      default:
+        throw InvalidParameter();
+    }
+
+  if (d === 0) {
+    throw DivisionByZero();
+  }
+
+  fraction_P["s"] = s < 0 ? -1 : 1;
+  fraction_P["n"] = Math.abs(n);
+  fraction_P["d"] = Math.abs(d);
+};
+
+function modpow(b, e, m) {
+
+  var r = 1;
+  for (; e > 0; b = (b * b) % m, e >>= 1) {
+
+    if (e & 1) {
+      r = (r * b) % m;
+    }
+  }
+  return r;
+}
+
+
+function cycleLen(n, d) {
+
+  for (; d % 2 === 0;
+    d/= 2) {
+  }
+
+  for (; d % 5 === 0;
+    d/= 5) {
+  }
+
+  if (d === 1) // Catch non-cyclic numbers
+    return 0;
+
+  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
+  // 10^(d-1) % d == 1
+  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
+  // as we want to translate the numbers to strings.
+
+  var rem = 10 % d;
+  var t = 1;
+
+  for (; rem !== 1; t++) {
+    rem = rem * 10 % d;
+
+    if (t > MAX_CYCLE_LEN)
+      return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
+  }
+  return t;
+}
+
+
+function cycleStart(n, d, len) {
+
+  var rem1 = 1;
+  var rem2 = modpow(10, len, d);
+
+  for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
+    // Solve 10^s == 10^(s+t) (mod d)
+
+    if (rem1 === rem2)
+      return t;
+
+    rem1 = rem1 * 10 % d;
+    rem2 = rem2 * 10 % d;
+  }
+  return 0;
+}
+
+function gcd(a, b) {
+
+  if (!a)
+    return b;
+  if (!b)
+    return a;
+
+  while (1) {
+    a%= b;
+    if (!a)
+      return b;
+    b%= a;
+    if (!b)
+      return a;
+  }
+};
+
+/**
+ * Module constructor
+ *
+ * @constructor
+ * @param {number|Fraction=} a
+ * @param {number=} b
+ */
+function Fraction(a, b) {
+
+  fraction_parse(a, b);
+
+  if (this instanceof Fraction) {
+    a = gcd(fraction_P["d"], fraction_P["n"]); // Abuse variable a
+    this["s"] = fraction_P["s"];
+    this["n"] = fraction_P["n"] / a;
+    this["d"] = fraction_P["d"] / a;
+  } else {
+    return newFraction(fraction_P['s'] * fraction_P['n'], fraction_P['d']);
+  }
+}
+
+var DivisionByZero = function() { return new Error("Division by Zero"); };
+var InvalidParameter = function() { return new Error("Invalid argument"); };
+var NonIntegerParameter = function() { return new Error("Parameters must be integer"); };
+
+Fraction.prototype = {
+
+  "s": 1,
+  "n": 0,
+  "d": 1,
+
+  /**
+   * Calculates the absolute value
+   *
+   * Ex: new Fraction(-4).abs() => 4
+   **/
+  "abs": function() {
+
+    return newFraction(this["n"], this["d"]);
+  },
+
+  /**
+   * Inverts the sign of the current fraction
+   *
+   * Ex: new Fraction(-4).neg() => 4
+   **/
+  "neg": function() {
+
+    return newFraction(-this["s"] * this["n"], this["d"]);
+  },
+
+  /**
+   * Adds two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
+   **/
+  "add": function(a, b) {
+
+    fraction_parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * fraction_P["d"] + fraction_P["s"] * this["d"] * fraction_P["n"],
+      this["d"] * fraction_P["d"]
+    );
+  },
+
+  /**
+   * Subtracts two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
+   **/
+  "sub": function(a, b) {
+
+    fraction_parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * fraction_P["d"] - fraction_P["s"] * this["d"] * fraction_P["n"],
+      this["d"] * fraction_P["d"]
+    );
+  },
+
+  /**
+   * Multiplies two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
+   **/
+  "mul": function(a, b) {
+
+    fraction_parse(a, b);
+    return newFraction(
+      this["s"] * fraction_P["s"] * this["n"] * fraction_P["n"],
+      this["d"] * fraction_P["d"]
+    );
+  },
+
+  /**
+   * Divides two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").inverse().div(3)
+   **/
+  "div": function(a, b) {
+
+    fraction_parse(a, b);
+    return newFraction(
+      this["s"] * fraction_P["s"] * this["n"] * fraction_P["d"],
+      this["d"] * fraction_P["n"]
+    );
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * Ex: new Fraction("-17.(345)").clone()
+   **/
+  "clone": function() {
+    return newFraction(this['s'] * this['n'], this['d']);
+  },
+
+  /**
+   * Calculates the modulo of two rational numbers - a more precise fmod
+   *
+   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
+   **/
+  "mod": function(a, b) {
+
+    if (isNaN(this['n']) || isNaN(this['d'])) {
+      return new Fraction(NaN);
+    }
+
+    if (a === undefined) {
+      return newFraction(this["s"] * this["n"] % this["d"], 1);
+    }
+
+    fraction_parse(a, b);
+    if (0 === fraction_P["n"] && 0 === this["d"]) {
+      throw DivisionByZero();
+    }
+
+    /*
+     * First silly attempt, kinda slow
+     *
+     return that["sub"]({
+     "n": num["n"] * Math.floor((this.n / this.d) / (num.n / num.d)),
+     "d": num["d"],
+     "s": this["s"]
+     });*/
+
+    /*
+     * New attempt: a1 / b1 = a2 / b2 * q + r
+     * => b2 * a1 = a2 * b1 * q + b1 * b2 * r
+     * => (b2 * a1 % a2 * b1) / (b1 * b2)
+     */
+    return newFraction(
+      this["s"] * (fraction_P["d"] * this["n"]) % (fraction_P["n"] * this["d"]),
+      fraction_P["d"] * this["d"]
+    );
+  },
+
+  /**
+   * Calculates the fractional gcd of two rational numbers
+   *
+   * Ex: new Fraction(5,8).gcd(3,7) => 1/56
+   */
+  "gcd": function(a, b) {
+
+    fraction_parse(a, b);
+
+    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
+
+    return newFraction(gcd(fraction_P["n"], this["n"]) * gcd(fraction_P["d"], this["d"]), fraction_P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional lcm of two rational numbers
+   *
+   * Ex: new Fraction(5,8).lcm(3,7) => 15
+   */
+  "lcm": function(a, b) {
+
+    fraction_parse(a, b);
+
+    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
+
+    if (fraction_P["n"] === 0 && this["n"] === 0) {
+      return newFraction(0, 1);
+    }
+    return newFraction(fraction_P["n"] * this["n"], gcd(fraction_P["n"], this["n"]) * gcd(fraction_P["d"], this["d"]));
+  },
+
+  /**
+   * Calculates the ceil of a rational number
+   *
+   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
+   **/
+  "ceil": function(places) {
+
+    places = Math.pow(10, places || 0);
+
+    if (isNaN(this["n"]) || isNaN(this["d"])) {
+      return new Fraction(NaN);
+    }
+    return newFraction(Math.ceil(places * this["s"] * this["n"] / this["d"]), places);
+  },
+
+  /**
+   * Calculates the floor of a rational number
+   *
+   * Ex: new Fraction('4.(3)').floor() => (4 / 1)
+   **/
+  "floor": function(places) {
+
+    places = Math.pow(10, places || 0);
+
+    if (isNaN(this["n"]) || isNaN(this["d"])) {
+      return new Fraction(NaN);
+    }
+    return newFraction(Math.floor(places * this["s"] * this["n"] / this["d"]), places);
+  },
+
+  /**
+   * Rounds a rational number
+   *
+   * Ex: new Fraction('4.(3)').round() => (4 / 1)
+   **/
+  "round": function(places) {
+
+    places = Math.pow(10, places || 0);
+
+    if (isNaN(this["n"]) || isNaN(this["d"])) {
+      return new Fraction(NaN);
+    }
+    return newFraction(Math.round(places * this["s"] * this["n"] / this["d"]), places);
+  },
+
+  /**
+   * Rounds a rational number to a multiple of another rational number
+   *
+   * Ex: new Fraction('0.9').roundTo("1/8") => 7 / 8
+   **/
+  "roundTo": function(a, b) {
+
+    /*
+    k * x/y ≤ a/b < (k+1) * x/y
+    ⇔ k ≤ a/b / (x/y) < (k+1)
+    ⇔ k = floor(a/b * y/x)
+    */
+
+    fraction_parse(a, b);
+
+    return newFraction(this['s'] * Math.round(this['n'] * fraction_P['d'] / (this['d'] * fraction_P['n'])) * fraction_P['n'], fraction_P['d']);
+  },
+
+  /**
+   * Gets the inverse of the fraction, means numerator and denominator are exchanged
+   *
+   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
+   **/
+  "inverse": function() {
+
+    return newFraction(this["s"] * this["d"], this["n"]);
+  },
+
+  /**
+   * Calculates the fraction to some rational exponent, if possible
+   *
+   * Ex: new Fraction(-1,2).pow(-3) => -8
+   */
+  "pow": function(a, b) {
+
+    fraction_parse(a, b);
+
+    // Trivial case when exp is an integer
+
+    if (fraction_P['d'] === 1) {
+
+      if (fraction_P['s'] < 0) {
+        return newFraction(Math.pow(this['s'] * this["d"], fraction_P['n']), Math.pow(this["n"], fraction_P['n']));
+      } else {
+        return newFraction(Math.pow(this['s'] * this["n"], fraction_P['n']), Math.pow(this["d"], fraction_P['n']));
+      }
+    }
+
+    // Negative roots become complex
+    //     (-a/b)^(c/d) = x
+    // <=> (-1)^(c/d) * (a/b)^(c/d) = x
+    // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x         # rotate 1 by 180°
+    // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )
+    // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.
+    if (this['s'] < 0) return null;
+
+    // Now prime factor n and d
+    var N = factorize(this['n']);
+    var D = factorize(this['d']);
+
+    // Exponentiate and take root for n and d individually
+    var n = 1;
+    var d = 1;
+    for (var k in N) {
+      if (k === '1') continue;
+      if (k === '0') {
+        n = 0;
+        break;
+      }
+      N[k]*= fraction_P['n'];
+
+      if (N[k] % fraction_P['d'] === 0) {
+        N[k]/= fraction_P['d'];
+      } else return null;
+      n*= Math.pow(k, N[k]);
+    }
+
+    for (var k in D) {
+      if (k === '1') continue;
+      D[k]*= fraction_P['n'];
+
+      if (D[k] % fraction_P['d'] === 0) {
+        D[k]/= fraction_P['d'];
+      } else return null;
+      d*= Math.pow(k, D[k]);
+    }
+
+    if (fraction_P['s'] < 0) {
+      return newFraction(d, n);
+    }
+    return newFraction(n, d);
+  },
+
+  /**
+   * Check if two rational numbers are the same
+   *
+   * Ex: new Fraction(19.6).equals([98, 5]);
+   **/
+  "equals": function(a, b) {
+
+    fraction_parse(a, b);
+    return this["s"] * this["n"] * fraction_P["d"] === fraction_P["s"] * fraction_P["n"] * this["d"]; // Same as compare() === 0
+  },
+
+  /**
+   * Check if two rational numbers are the same
+   *
+   * Ex: new Fraction(19.6).equals([98, 5]);
+   **/
+  "compare": function(a, b) {
+
+    fraction_parse(a, b);
+    var t = (this["s"] * this["n"] * fraction_P["d"] - fraction_P["s"] * fraction_P["n"] * this["d"]);
+    return (0 < t) - (t < 0);
+  },
+
+  "simplify": function(eps) {
+
+    if (isNaN(this['n']) || isNaN(this['d'])) {
+      return this;
+    }
+
+    eps = eps || 0.001;
+
+    var thisABS = this['abs']();
+    var cont = thisABS['toContinued']();
+
+    for (var i = 1; i < cont.length; i++) {
+
+      var s = newFraction(cont[i - 1], 1);
+      for (var k = i - 2; k >= 0; k--) {
+        s = s['inverse']()['add'](cont[k]);
+      }
+
+      if (Math.abs(s['sub'](thisABS).valueOf()) < eps) {
+        return s['mul'](this['s']);
+      }
+    }
+    return this;
+  },
+
+  /**
+   * Check if two rational numbers are divisible
+   *
+   * Ex: new Fraction(19.6).divisible(1.5);
+   */
+  "divisible": function(a, b) {
+
+    fraction_parse(a, b);
+    return !(!(fraction_P["n"] * this["d"]) || ((this["n"] * fraction_P["d"]) % (fraction_P["n"] * this["d"])));
+  },
+
+  /**
+   * Returns a decimal representation of the fraction
+   *
+   * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
+   **/
+  'valueOf': function() {
+
+    return this["s"] * this["n"] / this["d"];
+  },
+
+  /**
+   * Returns a string-fraction representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toFraction(true) => "4 1/3"
+   **/
+  'toFraction': function(excludeWhole) {
+
+    var whole, str = "";
+    var n = this["n"];
+    var d = this["d"];
+    if (this["s"] < 0) {
+      str+= '-';
+    }
+
+    if (d === 1) {
+      str+= n;
+    } else {
+
+      if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
+        str+= whole;
+        str+= " ";
+        n%= d;
+      }
+
+      str+= n;
+      str+= '/';
+      str+= d;
+    }
+    return str;
+  },
+
+  /**
+   * Returns a latex representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
+   **/
+  'toLatex': function(excludeWhole) {
+
+    var whole, str = "";
+    var n = this["n"];
+    var d = this["d"];
+    if (this["s"] < 0) {
+      str+= '-';
+    }
+
+    if (d === 1) {
+      str+= n;
+    } else {
+
+      if (excludeWhole && (whole = Math.floor(n / d)) > 0) {
+        str+= whole;
+        n%= d;
+      }
+
+      str+= "\\frac{";
+      str+= n;
+      str+= '}{';
+      str+= d;
+      str+= '}';
+    }
+    return str;
+  },
+
+  /**
+   * Returns an array of continued fraction elements
+   *
+   * Ex: new Fraction("7/8").toContinued() => [0,1,7]
+   */
+  'toContinued': function() {
+
+    var t;
+    var a = this['n'];
+    var b = this['d'];
+    var res = [];
+
+    if (isNaN(a) || isNaN(b)) {
+      return res;
+    }
+
+    do {
+      res.push(Math.floor(a / b));
+      t = a % b;
+      a = b;
+      b = t;
+    } while (a !== 1);
+
+    return res;
+  },
+
+  /**
+   * Creates a string representation of a fraction with all digits
+   *
+   * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
+   **/
+  'toString': function(dec) {
+
+    var N = this["n"];
+    var D = this["d"];
+
+    if (isNaN(N) || isNaN(D)) {
+      return "NaN";
+    }
+
+    dec = dec || 15; // 15 = decimal places when no repetation
+
+    var cycLen = cycleLen(N, D); // Cycle length
+    var cycOff = cycleStart(N, D, cycLen); // Cycle start
+
+    var str = this['s'] < 0 ? "-" : "";
+
+    str+= N / D | 0;
+
+    N%= D;
+    N*= 10;
+
+    if (N)
+      str+= ".";
+
+    if (cycLen) {
+
+      for (var i = cycOff; i--;) {
+        str+= N / D | 0;
+        N%= D;
+        N*= 10;
+      }
+      str+= "(";
+      for (var i = cycLen; i--;) {
+        str+= N / D | 0;
+        N%= D;
+        N*= 10;
+      }
+      str+= ")";
+    } else {
+      for (var i = dec; N && i--;) {
+        str+= N / D | 0;
+        N%= D;
+        N*= 10;
+      }
+    }
+    return str;
+  }
+};
+
 ;// CONCATENATED MODULE: ../../../node_modules/mathjs/lib/esm/type/fraction/Fraction.js
 
 
@@ -11951,19 +11957,19 @@ var createFractionClass = /* #__PURE__ */factory_factory(Fraction_name, Fraction
   /**
    * Attach type information
    */
-  Object.defineProperty(fraction, 'name', {
+  Object.defineProperty(Fraction, 'name', {
     value: 'Fraction'
   });
-  fraction.prototype.constructor = fraction;
-  fraction.prototype.type = 'Fraction';
-  fraction.prototype.isFraction = true;
+  Fraction.prototype.constructor = Fraction;
+  Fraction.prototype.type = 'Fraction';
+  Fraction.prototype.isFraction = true;
 
   /**
    * Get a JSON representation of a Fraction containing type information
    * @returns {Object} Returns a JSON object structured as:
    *                   `{"mathjs": "Fraction", "n": 3, "d": 8}`
    */
-  fraction.prototype.toJSON = function () {
+  Fraction.prototype.toJSON = function () {
     return {
       mathjs: 'Fraction',
       n: this.s * this.n,
@@ -11977,10 +11983,10 @@ var createFractionClass = /* #__PURE__ */factory_factory(Fraction_name, Fraction
    *                       `{"mathjs": "Fraction", "n": 3, "d": 8}`
    * @return {BigNumber}
    */
-  fraction.fromJSON = function (json) {
-    return new fraction(json);
+  Fraction.fromJSON = function (json) {
+    return new Fraction(json);
   };
-  return fraction;
+  return Fraction;
 }, {
   isClass: true
 });
@@ -64877,7 +64883,7 @@ var fineStructure = /* #__PURE__ */createFineStructure({
   BigNumber,
   config: config
 });
-var Fraction = /* #__PURE__ */createFractionClass({});
+var pureFunctionsAny_generated_Fraction = /* #__PURE__ */createFractionClass({});
 var i = /* #__PURE__ */createI({
   Complex: pureFunctionsAny_generated_Complex
 });
@@ -64943,7 +64949,7 @@ var typed = /* #__PURE__ */createTyped({
   BigNumber,
   Complex: pureFunctionsAny_generated_Complex,
   DenseMatrix,
-  Fraction
+  Fraction: pureFunctionsAny_generated_Fraction
 });
 var unaryPlus = /* #__PURE__ */createUnaryPlus({
   BigNumber,
@@ -65131,7 +65137,7 @@ var sec = /* #__PURE__ */createSec({
 });
 var pureFunctionsAny_generated_sign = /* #__PURE__ */createSign({
   BigNumber,
-  Fraction,
+  Fraction: pureFunctionsAny_generated_Fraction,
   complex,
   typed
 });
@@ -65236,8 +65242,8 @@ var coth = /* #__PURE__ */createCoth({
   BigNumber,
   typed
 });
-var pureFunctionsAny_generated_fraction = /* #__PURE__ */createFraction({
-  Fraction,
+var fraction = /* #__PURE__ */createFraction({
+  Fraction: pureFunctionsAny_generated_Fraction,
   typed
 });
 var isNumeric = /* #__PURE__ */createIsNumeric({
@@ -65261,7 +65267,7 @@ var mode = /* #__PURE__ */createMode({
 });
 var numeric = /* #__PURE__ */createNumeric({
   bignumber,
-  fraction: pureFunctionsAny_generated_fraction,
+  fraction,
   number
 });
 var prod = /* #__PURE__ */createProd({
@@ -65308,7 +65314,7 @@ var pureFunctionsAny_generated_asin = /* #__PURE__ */createAsin({
 var pureFunctionsAny_generated_cbrt = /* #__PURE__ */createCbrt({
   BigNumber,
   Complex: pureFunctionsAny_generated_Complex,
-  Fraction,
+  Fraction: pureFunctionsAny_generated_Fraction,
   config: config,
   isNegative,
   matrix,
@@ -65549,7 +65555,7 @@ var catalan = /* #__PURE__ */createCatalan({
 var compare = /* #__PURE__ */createCompare({
   BigNumber,
   DenseMatrix,
-  Fraction,
+  Fraction: pureFunctionsAny_generated_Fraction,
   concat: pureFunctionsAny_generated_concat,
   config: config,
   equalScalar,
@@ -65607,7 +65613,7 @@ var pureFunctionsAny_generated_floor = /* #__PURE__ */createFloor({
   typed,
   zeros: pureFunctionsAny_generated_zeros
 });
-var gcd = /* #__PURE__ */createGcd({
+var pureFunctionsAny_generated_gcd = /* #__PURE__ */createGcd({
   BigNumber,
   DenseMatrix,
   concat: pureFunctionsAny_generated_concat,
@@ -66015,7 +66021,7 @@ var pinv = /* #__PURE__ */createPinv({
 var pureFunctionsAny_generated_pow = /* #__PURE__ */createPow({
   Complex: pureFunctionsAny_generated_Complex,
   config: config,
-  fraction: pureFunctionsAny_generated_fraction,
+  fraction,
   identity,
   inv,
   matrix,
@@ -66056,7 +66062,7 @@ var sqrtm = /* #__PURE__ */createSqrtm({
 var Unit = /* #__PURE__ */createUnitClass({
   BigNumber,
   Complex: pureFunctionsAny_generated_Complex,
-  Fraction,
+  Fraction: pureFunctionsAny_generated_Fraction,
   abs: pureFunctionsAny_generated_abs,
   addScalar,
   config: config,
@@ -66757,7 +66763,7 @@ var resolve = createResolve({
 });
 var simplifyConstant = createSimplifyConstant({
   bignumber: bignumber,
-  fraction: pureFunctionsAny_generated_fraction,
+  fraction: fraction,
   AccessorNode,
   ArrayNode,
   ConstantNode,
@@ -66807,7 +66813,7 @@ var Parser = createParserClass({
 });
 var simplify = createSimplify({
   bignumber: bignumber,
-  fraction: pureFunctionsAny_generated_fraction,
+  fraction: fraction,
   AccessorNode,
   ArrayNode,
   ConstantNode,
@@ -66849,7 +66855,7 @@ var parser = createParser({
 });
 var rationalize = createRationalize({
   bignumber: bignumber,
-  fraction: pureFunctionsAny_generated_fraction,
+  fraction: fraction,
   AccessorNode,
   ArrayNode,
   ConstantNode,
@@ -66998,7 +67004,7 @@ var help = createHelp({
   unaryMinus: unaryMinus,
   acoth: acoth,
   coth: coth,
-  fraction: pureFunctionsAny_generated_fraction,
+  fraction: fraction,
   isNumeric: isNumeric,
   matrix: matrix,
   matrixFromFunction: matrixFromFunction,
@@ -67055,7 +67061,7 @@ var help = createHelp({
   dot: dot,
   equalText: equalText,
   floor: pureFunctionsAny_generated_floor,
-  gcd: gcd,
+  gcd: pureFunctionsAny_generated_gcd,
   hypot: pureFunctionsAny_generated_hypot,
   larger: larger,
   log: pureFunctionsAny_generated_log,
@@ -67361,7 +67367,7 @@ var help = createHelp({
 (0,esm_extends/* default */.A)(classes, {
   BigNumber: BigNumber,
   Complex: pureFunctionsAny_generated_Complex,
-  Fraction: Fraction,
+  Fraction: pureFunctionsAny_generated_Fraction,
   Matrix: Matrix,
   Node,
   ObjectNode,