continuedfraction.js 0.0.1 → 0.1.0

package/dist/continuedfraction.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../node_modules/fraction.js/dist/fraction.mjs", "../src/continuedfraction.ts"],
+  "sourcesContent": ["'use strict';\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <numerator>, 1 => <denominator> ]\n * { n => <numerator>, d => <denominator> }\n *\n * Integer form\n * - Single integer value as BigInt or Number\n *\n * Double form\n * - Single double value as Number\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n * let f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n// Set Identity function to downgrade BigInt to Number if needed\nif (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(\"\"); return n; };\n\nconst C_ZERO = BigInt(0);\nconst C_ONE = BigInt(1);\nconst C_TWO = BigInt(2);\nconst C_FIVE = BigInt(5);\nconst C_TEN = BigInt(10);\n\n// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n// Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\nconst MAX_CYCLE_LEN = 2000;\n\n// Parsed data to avoid calling \"new\" all the time\nconst P = {\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE\n};\n\nfunction assign(n, s) {\n\n  try {\n    n = BigInt(n);\n  } catch (e) {\n    throw InvalidParameter();\n  }\n  return n * s;\n}\n\nfunction trunc(x) {\n  return typeof x === 'bigint' ? x : Math.floor(x);\n}\n\n// Creates a new Fraction internally without the need of the bulky constructor\nfunction newFraction(n, d) {\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  const f = Object.create(Fraction.prototype);\n  f[\"s\"] = n < C_ZERO ? -C_ONE : C_ONE;\n\n  n = n < C_ZERO ? -n : n;\n\n  const a = gcd(n, d);\n\n  f[\"n\"] = n / a;\n  f[\"d\"] = d / a;\n  return f;\n}\n\nfunction factorize(num) {\n\n  const factors = {};\n\n  let n = num;\n  let i = C_TWO;\n  let s = C_FIVE - C_ONE;\n\n  while (s <= n) {\n\n    while (n % i === C_ZERO) {\n      n /= i;\n      factors[i] = (factors[i] || C_ZERO) + C_ONE;\n    }\n    s += C_ONE + C_TWO * i++;\n  }\n\n  if (n !== num) {\n    if (n > 1)\n      factors[n] = (factors[n] || C_ZERO) + C_ONE;\n  } else {\n    factors[num] = (factors[num] || C_ZERO) + C_ONE;\n  }\n  return factors;\n}\n\nconst parse = function (p1, p2) {\n\n  let n = C_ZERO, d = C_ONE, s = C_ONE;\n\n  if (p1 === undefined || p1 === null) { // No argument\n    /* void */\n  } else if (p2 !== undefined) { // Two arguments\n\n    if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else if (isNaN(p1)) {\n      throw InvalidParameter();\n    } else if (p1 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      n = BigInt(p1);\n    }\n\n    if (typeof p2 === \"bigint\") {\n      d = p2;\n    } else if (isNaN(p2)) {\n      throw InvalidParameter();\n    } else if (p2 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      d = BigInt(p2);\n    }\n\n    s = n * d;\n\n  } else if (typeof p1 === \"object\") {\n    if (\"d\" in p1 && \"n\" in p1) {\n      n = BigInt(p1[\"n\"]);\n      d = BigInt(p1[\"d\"]);\n      if (\"s\" in p1)\n        n *= BigInt(p1[\"s\"]);\n    } else if (0 in p1) {\n      n = BigInt(p1[0]);\n      if (1 in p1)\n        d = BigInt(p1[1]);\n    } else if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else {\n      throw InvalidParameter();\n    }\n    s = n * d;\n  } else if (typeof p1 === \"number\") {\n\n    if (isNaN(p1)) {\n      throw InvalidParameter();\n    }\n\n    if (p1 < 0) {\n      s = -C_ONE;\n      p1 = -p1;\n    }\n\n    if (p1 % 1 === 0) {\n      n = BigInt(p1);\n    } else {\n\n      let z = 1;\n\n      let A = 0, B = 1;\n      let C = 1, D = 1;\n\n      let N = 10000000;\n\n      if (p1 >= 1) {\n        z = 10 ** Math.floor(1 + Math.log10(p1));\n        p1 /= z;\n      }\n\n      // Using Farey Sequences\n\n      while (B <= N && D <= N) {\n        let M = (A + C) / (B + D);\n\n        if (p1 === M) {\n          if (B + D <= N) {\n            n = A + C;\n            d = B + D;\n          } else if (D > B) {\n            n = C;\n            d = D;\n          } else {\n            n = A;\n            d = B;\n          }\n          break;\n\n        } else {\n\n          if (p1 > M) {\n            A += C;\n            B += D;\n          } else {\n            C += A;\n            D += B;\n          }\n\n          if (B > N) {\n            n = C;\n            d = D;\n          } else {\n            n = A;\n            d = B;\n          }\n        }\n      }\n      n = BigInt(n) * BigInt(z);\n      d = BigInt(d);\n    }\n\n  } else if (typeof p1 === \"string\") {\n\n    let ndx = 0;\n\n    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;\n\n    let match = p1.replace(/_/g, '').match(/\\d+|./g);\n\n    if (match === null)\n      throw InvalidParameter();\n\n    if (match[ndx] === '-') {// Check for minus sign at the beginning\n      s = -C_ONE;\n      ndx++;\n    } else if (match[ndx] === '+') {// Check for plus sign at the beginning\n      ndx++;\n    }\n\n    if (match.length === ndx + 1) { // Check if it's just a simple number \"1234\"\n      w = assign(match[ndx++], s);\n    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number\n\n      if (match[ndx] !== '.') { // Handle 0.5 and .5\n        v = assign(match[ndx++], s);\n      }\n      ndx++;\n\n      // Check for decimal places\n      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === \"'\" && match[ndx + 3] === \"'\") {\n        w = assign(match[ndx], s);\n        y = C_TEN ** BigInt(match[ndx].length);\n        ndx++;\n      }\n\n      // Check for repeating places\n      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === \"'\" && match[ndx + 2] === \"'\") {\n        x = assign(match[ndx + 1], s);\n        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;\n        ndx += 3;\n      }\n\n    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n      w = assign(match[ndx], s);\n      y = assign(match[ndx + 2], C_ONE);\n      ndx += 3;\n    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n      v = assign(match[ndx], s);\n      w = assign(match[ndx + 2], s);\n      y = assign(match[ndx + 4], C_ONE);\n      ndx += 5;\n    }\n\n    if (match.length <= ndx) { // Check for more tokens on the stack\n      d = y * z;\n      s = /* void */\n        n = x + d * v + z * w;\n    } else {\n      throw InvalidParameter();\n    }\n\n  } else if (typeof p1 === \"bigint\") {\n    n = p1;\n    s = p1;\n    d = C_ONE;\n  } else {\n    throw InvalidParameter();\n  }\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  P[\"s\"] = s < C_ZERO ? -C_ONE : C_ONE;\n  P[\"n\"] = n < C_ZERO ? -n : n;\n  P[\"d\"] = d < C_ZERO ? -d : d;\n};\n\nfunction modpow(b, e, m) {\n\n  let r = C_ONE;\n  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {\n\n    if (e & C_ONE) {\n      r = (r * b) % m;\n    }\n  }\n  return r;\n}\n\nfunction cycleLen(n, d) {\n\n  for (; d % C_TWO === C_ZERO;\n    d /= C_TWO) {\n  }\n\n  for (; d % C_FIVE === C_ZERO;\n    d /= C_FIVE) {\n  }\n\n  if (d === C_ONE) // Catch non-cyclic numbers\n    return C_ZERO;\n\n  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n  // 10^(d-1) % d == 1\n  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n  // as we want to translate the numbers to strings.\n\n  let rem = C_TEN % d;\n  let t = 1;\n\n  for (; rem !== C_ONE; t++) {\n    rem = rem * C_TEN % d;\n\n    if (t > MAX_CYCLE_LEN)\n      return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n  }\n  return BigInt(t);\n}\n\nfunction cycleStart(n, d, len) {\n\n  let rem1 = C_ONE;\n  let rem2 = modpow(C_TEN, len, d);\n\n  for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n    // Solve 10^s == 10^(s+t) (mod d)\n\n    if (rem1 === rem2)\n      return BigInt(t);\n\n    rem1 = rem1 * C_TEN % d;\n    rem2 = rem2 * C_TEN % d;\n  }\n  return 0;\n}\n\nfunction gcd(a, b) {\n\n  if (!a)\n    return b;\n  if (!b)\n    return a;\n\n  while (1) {\n    a %= b;\n    if (!a)\n      return b;\n    b %= a;\n    if (!b)\n      return a;\n  }\n}\n\n/**\n * Module constructor\n *\n * @constructor\n * @param {number|Fraction=} a\n * @param {number=} b\n */\nfunction Fraction(a, b) {\n\n  parse(a, b);\n\n  if (this instanceof Fraction) {\n    a = gcd(P[\"d\"], P[\"n\"]); // Abuse a\n    this[\"s\"] = P[\"s\"];\n    this[\"n\"] = P[\"n\"] / a;\n    this[\"d\"] = P[\"d\"] / a;\n  } else {\n    return newFraction(P['s'] * P['n'], P['d']);\n  }\n}\n\nvar DivisionByZero = function () { return new Error(\"Division by Zero\"); };\nvar InvalidParameter = function () { return new Error(\"Invalid argument\"); };\nvar NonIntegerParameter = function () { return new Error(\"Parameters must be integer\"); };\n\nFraction.prototype = {\n\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE,\n\n  /**\n   * Calculates the absolute value\n   *\n   * Ex: new Fraction(-4).abs() => 4\n   **/\n  \"abs\": function () {\n\n    return newFraction(this[\"n\"], this[\"d\"]);\n  },\n\n  /**\n   * Inverts the sign of the current fraction\n   *\n   * Ex: new Fraction(-4).neg() => 4\n   **/\n  \"neg\": function () {\n\n    return newFraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n  },\n\n  /**\n   * Adds two rational numbers\n   *\n   * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n   **/\n  \"add\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Subtracts two rational numbers\n   *\n   * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n   **/\n  \"sub\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Multiplies two rational numbers\n   *\n   * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n   **/\n  \"mul\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Divides two rational numbers\n   *\n   * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n   **/\n  \"div\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n      this[\"d\"] * P[\"n\"]\n    );\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * Ex: new Fraction(\"-17.(345)\").clone()\n   **/\n  \"clone\": function () {\n    return newFraction(this['s'] * this['n'], this['d']);\n  },\n\n  /**\n   * Calculates the modulo of two rational numbers - a more precise fmod\n   *\n   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n   * Ex: new Fraction(20, 10).mod().equals(0) ? \"is Integer\"\n   **/\n  \"mod\": function (a, b) {\n\n    if (a === undefined) {\n      return newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], C_ONE);\n    }\n\n    parse(a, b);\n    if (C_ZERO === P[\"n\"] * this[\"d\"]) {\n      throw DivisionByZero();\n    }\n\n    /**\n     * I derived the rational modulo similar to the modulo for integers\n     *\n     * https://raw.org/book/analysis/rational-numbers/\n     *\n     *    n1/d1 = (n2/d2) * q + r, where 0 \u2264 r < n2/d2\n     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r\n     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)\n     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)\n     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)\n     */\n    return newFraction(\n      this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n      P[\"d\"] * this[\"d\"]);\n  },\n\n  /**\n   * Calculates the fractional gcd of two rational numbers\n   *\n   * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n   */\n  \"gcd\": function (a, b) {\n\n    parse(a, b);\n\n    // https://raw.org/book/analysis/rational-numbers/\n    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n    return newFraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n  },\n\n  /**\n   * Calculates the fractional lcm of two rational numbers\n   *\n   * Ex: new Fraction(5,8).lcm(3,7) => 15\n   */\n  \"lcm\": function (a, b) {\n\n    parse(a, b);\n\n    // https://raw.org/book/analysis/rational-numbers/\n    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n    if (P[\"n\"] === C_ZERO && this[\"n\"] === C_ZERO) {\n      return newFraction(C_ZERO, C_ONE);\n    }\n    return newFraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n  },\n\n  /**\n   * Gets the inverse of the fraction, means numerator and denominator are exchanged\n   *\n   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n   **/\n  \"inverse\": function () {\n    return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n  },\n\n  /**\n   * Calculates the fraction to some integer exponent\n   *\n   * Ex: new Fraction(-1,2).pow(-3) => -8\n   */\n  \"pow\": function (a, b) {\n\n    parse(a, b);\n\n    // Trivial case when exp is an integer\n\n    if (P['d'] === C_ONE) {\n\n      if (P['s'] < C_ZERO) {\n        return newFraction((this['s'] * this[\"d\"]) ** P['n'], this[\"n\"] ** P['n']);\n      } else {\n        return newFraction((this['s'] * this[\"n\"]) ** P['n'], this[\"d\"] ** P['n']);\n      }\n    }\n\n    // Negative roots become complex\n    //     (-a/b)^(c/d) = x\n    // \u21D4 (-1)^(c/d) * (a/b)^(c/d) = x\n    // \u21D4 (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x\n    // \u21D4 (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula\n    // From which follows that only for c=0 the root is non-complex\n    if (this['s'] < C_ZERO) return null;\n\n    // Now prime factor n and d\n    let N = factorize(this['n']);\n    let D = factorize(this['d']);\n\n    // Exponentiate and take root for n and d individually\n    let n = C_ONE;\n    let d = C_ONE;\n    for (let k in N) {\n      if (k === '1') continue;\n      if (k === '0') {\n        n = C_ZERO;\n        break;\n      }\n      N[k] *= P['n'];\n\n      if (N[k] % P['d'] === C_ZERO) {\n        N[k] /= P['d'];\n      } else return null;\n      n *= BigInt(k) ** N[k];\n    }\n\n    for (let k in D) {\n      if (k === '1') continue;\n      D[k] *= P['n'];\n\n      if (D[k] % P['d'] === C_ZERO) {\n        D[k] /= P['d'];\n      } else return null;\n      d *= BigInt(k) ** D[k];\n    }\n\n    if (P['s'] < C_ZERO) {\n      return newFraction(d, n);\n    }\n    return newFraction(n, d);\n  },\n\n  /**\n   * Calculates the logarithm of a fraction to a given rational base\n   *\n   * Ex: new Fraction(27, 8).log(9, 4) => 3/2\n   */\n  \"log\": function (a, b) {\n\n    parse(a, b);\n\n    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;\n\n    const allPrimes = {};\n\n    const baseFactors = factorize(P['n']);\n    const T1 = factorize(P['d']);\n\n    const numberFactors = factorize(this['n']);\n    const T2 = factorize(this['d']);\n\n    for (const prime in T1) {\n      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];\n    }\n    for (const prime in T2) {\n      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];\n    }\n\n    for (const prime in baseFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n    for (const prime in numberFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n\n    let retN = null;\n    let retD = null;\n\n    // Iterate over all unique primes to determine if a consistent ratio exists\n    for (const prime in allPrimes) {\n\n      const baseExponent = baseFactors[prime] || C_ZERO;\n      const numberExponent = numberFactors[prime] || C_ZERO;\n\n      if (baseExponent === C_ZERO) {\n        if (numberExponent !== C_ZERO) {\n          return null; // Logarithm cannot be expressed as a rational number\n        }\n        continue; // Skip this prime since both exponents are zero\n      }\n\n      // Calculate the ratio of exponents for this prime\n      let curN = numberExponent;\n      let curD = baseExponent;\n\n      // Simplify the current ratio\n      const gcdValue = gcd(curN, curD);\n      curN /= gcdValue;\n      curD /= gcdValue;\n\n      // Check if this is the first ratio; otherwise, ensure ratios are consistent\n      if (retN === null && retD === null) {\n        retN = curN;\n        retD = curD;\n      } else if (curN * retD !== retN * curD) {\n        return null; // Ratios do not match, logarithm cannot be rational\n      }\n    }\n\n    return retN !== null && retD !== null\n      ? newFraction(retN, retD)\n      : null;\n  },\n\n  /**\n   * Check if two rational numbers are the same\n   *\n   * Ex: new Fraction(19.6).equals([98, 5]);\n   **/\n  \"equals\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] < P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] <= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] > P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] >= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Compare two rational numbers\n   * < 0 iff this < that\n   * > 0 iff this > that\n   * = 0 iff this = that\n   *\n   * Ex: new Fraction(19.6).compare([98, 5]);\n   **/\n  \"compare\": function (a, b) {\n\n    parse(a, b);\n    let t = this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"];\n\n    return (C_ZERO < t) - (t < C_ZERO);\n  },\n\n  /**\n   * Calculates the ceil of a rational number\n   *\n   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n   **/\n  \"ceil\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    return newFraction(trunc(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n   * Calculates the floor of a rational number\n   *\n   * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n   **/\n  \"floor\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    return newFraction(trunc(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) -\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] < C_ZERO ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n   * Rounds a rational numbers\n   *\n   * Ex: new Fraction('4.(3)').round() => (4 / 1)\n   **/\n  \"round\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    /* Derivation:\n\n    s >= 0:\n      round(n / d) = trunc(n / d) + (n % d) / d >= 0.5 ? 1 : 0\n                   = trunc(n / d) + 2(n % d) >= d ? 1 : 0\n    s < 0:\n      round(n / d) =-trunc(n / d) - (n % d) / d > 0.5 ? 1 : 0\n                   =-trunc(n / d) - 2(n % d) > d ? 1 : 0\n\n    =>:\n\n    round(s * n / d) = s * trunc(n / d) + s * (C + 2(n % d) > d ? 1 : 0)\n        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.\n    */\n\n    return newFraction(trunc(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      this[\"s\"] * ((this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this[\"n\"] % this[\"d\"]) > this[\"d\"] ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n    * Rounds a rational number to a multiple of another rational number\n    *\n    * Ex: new Fraction('0.9').roundTo(\"1/8\") => 7 / 8\n    **/\n  \"roundTo\": function (a, b) {\n\n    /*\n    k * x/y \u2264 a/b < (k+1) * x/y\n    \u21D4 k \u2264 a/b / (x/y) < (k+1)\n    \u21D4 k = floor(a/b * y/x)\n    \u21D4 k = floor((a * y) / (b * x))\n    */\n\n    parse(a, b);\n\n    const n = this['n'] * P['d'];\n    const d = this['d'] * P['n'];\n    const r = n % d;\n\n    // round(n / d) = trunc(n / d) + 2(n % d) >= d ? 1 : 0\n    let k = trunc(n / d);\n    if (r + r >= d) {\n      k++;\n    }\n    return newFraction(this['s'] * k * P['n'], P['d']);\n  },\n\n  /**\n   * Check if two rational numbers are divisible\n   *\n   * Ex: new Fraction(19.6).divisible(1.5);\n   */\n  \"divisible\": function (a, b) {\n\n    parse(a, b);\n    return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n  },\n\n  /**\n   * Returns a decimal representation of the fraction\n   *\n   * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n   **/\n  'valueOf': function () {\n    // Best we can do so far\n    return Number(this[\"s\"] * this[\"n\"]) / Number(this[\"d\"]);\n  },\n\n  /**\n   * Creates a string representation of a fraction with all digits\n   *\n   * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n   **/\n  'toString': function (dec) {\n\n    let N = this[\"n\"];\n    let D = this[\"d\"];\n\n    dec = dec || 15; // 15 = decimal places when no repetition\n\n    let cycLen = cycleLen(N, D); // Cycle length\n    let cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    // Append integer part\n    str += trunc(N / D);\n\n    N %= D;\n    N *= C_TEN;\n\n    if (N)\n      str += \".\";\n\n    if (cycLen) {\n\n      for (let i = cycOff; i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \"(\";\n      for (let i = cycLen; i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \")\";\n    } else {\n      for (let i = dec; N && i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n    }\n    return str;\n  },\n\n  /**\n   * Returns a string-fraction representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toFraction() => \"4 1/3\"\n   **/\n  'toFraction': function (showMixed) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      let whole = trunc(n / d);\n      if (showMixed && whole > C_ZERO) {\n        str += whole;\n        str += \" \";\n        n %= d;\n      }\n\n      str += n;\n      str += '/';\n      str += d;\n    }\n    return str;\n  },\n\n  /**\n   * Returns a latex representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n   **/\n  'toLatex': function (showMixed) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      let whole = trunc(n / d);\n      if (showMixed && whole > C_ZERO) {\n        str += whole;\n        n %= d;\n      }\n\n      str += \"\\\\frac{\";\n      str += n;\n      str += '}{';\n      str += d;\n      str += '}';\n    }\n    return str;\n  },\n\n  /**\n   * Returns an array of continued fraction elements\n   *\n   * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n   */\n  'toContinued': function () {\n\n    let a = this['n'];\n    let b = this['d'];\n    let res = [];\n\n    do {\n      res.push(trunc(a / b));\n      let t = a % b;\n      a = b;\n      b = t;\n    } while (a !== C_ONE);\n\n    return res;\n  },\n\n  \"simplify\": function (eps) {\n\n    const ieps = BigInt(1 / (eps || 0.001) | 0);\n\n    const thisABS = this['abs']();\n    const cont = thisABS['toContinued']();\n\n    for (let i = 1; i < cont.length; i++) {\n\n      let s = newFraction(cont[i - 1], C_ONE);\n      for (let k = i - 2; k >= 0; k--) {\n        s = s['inverse']()['add'](cont[k]);\n      }\n\n      let t = s['sub'](thisABS);\n      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps\n        return s['mul'](this['s']);\n      }\n    }\n    return this;\n  }\n};\nexport {\n  Fraction as default, Fraction\n};\n", "/**\n * @license ContinuedFraction.js v0.1.0\n * https://github.com/rawify/ContinuedFraction.js\n *\n * Copyright (c) 2026, Robert Eisele (https://raw.org/)\n * Licensed under the MIT license.\n **/\n\nimport FractionFactory, { type Fraction as FractionValue } from 'fraction.js';\n\n/** A value accepted by Fraction.js as a continued-fraction coefficient. */\nexport type Coefficient = number | string | bigint | FractionValue;\n\nconst Fraction = FractionFactory as unknown as (value: Coefficient) => FractionValue;\n\n/** A term of a generalized continued fraction. */\nexport interface CFTerm {\n    /** The a_n coefficient. */\n    a: Coefficient;\n    /** The b_n coefficient. */\n    b: Coefficient;\n}\n\n/** A simple or generalized continued-fraction term. */\nexport type ContinuedFractionTerm = Coefficient | CFTerm;\n\n/** A term iterator or a function that creates one. */\nexport type ContinuedFractionSource<T = ContinuedFractionTerm> = Iterator<T> | (() => Iterator<T>);\n\nfunction iteratorFrom<T>(source: ContinuedFractionSource<T>): Iterator<T> {\n    return typeof source === 'function' ? source() : source;\n}\n\nfunction coefficientOf(term: ContinuedFractionTerm): Coefficient {\n    return typeof term === 'object' && term !== null && 'a' in term ? term.a : term;\n}\n\nfunction numeratorOf(term: ContinuedFractionTerm): Coefficient {\n    return typeof term === 'object' && term !== null && 'b' in term ? term.b : 1;\n}\n\nfunction validateSteps(steps: number): void {\n    if (!Number.isSafeInteger(steps) || steps < 0) {\n        throw new RangeError('steps must be a non-negative safe integer');\n    }\n}\n\n/**\n * Utility class for generating and evaluating continued fractions.\n * All methods are static; the class cannot be instantiated.\n */\nexport class ContinuedFraction {\n    private constructor() {\n        throw new TypeError('ContinuedFraction is a static class');\n    }\n\n    /**\n     * Infinite generator for the continued-fraction terms of sqrt(N).\n     *   sqrt(N) = [a0; (a1, a2, ..., a_p)], with a period boundary at ak = 2*a0.\n     * For perfect squares, yields only a0 = floor(sqrt(N)) and then returns.\n     *\n     * @param N Integer whose square-root CF expansion is desired (N >= 0).\n     * @yields Next continued-fraction term of sqrt(N).\n     */\n    static *sqrt(N: number): Generator<number, void, unknown> {\n        if (!Number.isSafeInteger(N) || N < 0) {\n            throw new RangeError('N must be a non-negative safe integer');\n        }\n\n        const a0 = Math.floor(Math.sqrt(N));\n        yield a0;\n        if (a0 * a0 === N) return; // perfect square: single-term CF\n\n        let nk = 0;\n        let dk = 1;\n        let ak = a0;\n\n        while (true) {\n            nk = ak * dk - nk;\n            dk = (N - nk * nk) / dk; // remains integer by construction\n            ak = Math.floor((a0 + nk) / dk);\n            yield ak;\n        }\n    }\n\n    /**\n     * Generator for continued-fraction terms of any real number via Fraction.js.\n     *\n     * @param n The real number to convert (as number, string, or bigint).\n     * @yields Next continued-fraction term of n.\n     */\n    static *fromNumber(n: Coefficient): Generator<bigint, void, unknown> {\n        yield* Fraction(n).toContinued();\n    }\n\n    /**\n     * Generator for continued-fraction terms of a rational a/b via Fraction.js.\n     *\n     * @param a Numerator, Fraction, or complete fraction string.\n     * @param b Optional denominator.\n     * @yields Next continued-fraction term of a/b.\n     */\n    static *fromFraction(a: Coefficient, b?: Coefficient): Generator<bigint, void, unknown> {\n        const fraction = b === undefined ? Fraction(a) : Fraction(a).div(Fraction(b));\n        yield* fraction.toContinued();\n    }\n\n    /**\n     * Yields a finite sequence of simple or generalized terms unchanged.\n     *\n     * @param terms Continued-fraction terms.\n     * @yields Each supplied term in order.\n     */\n    static *fromTerms<T extends ContinuedFractionTerm>(terms: Iterable<T>): Generator<T, void, unknown> {\n        yield* terms;\n    }\n\n    /**\n     * Infinite generator of the golden ratio phi = [1; 1, 1, 1, ...].\n     *\n     * @yields Always 1.\n     */\n    static *PHI(): Generator<number, never, unknown> {\n        while (true) {\n            yield 1;\n        }\n    }\n\n    /**\n     * Infinite generator for Brouncker's generalized continued fraction of 4/pi:\n     *   4/pi = 1 + 1^2/(2 + 3^2/(2 + 5^2/(2 + ...)))\n     *\n     * @yields Term pair (a_n, b_n) of the generalized continued fraction.\n     *   - first: a_0 = 1\n     *   - then: a_n = 2, b_n = (2n-1)^2 (n >= 1)\n     */\n    static *FOUR_OVER_PI(): Generator<CFTerm, never, unknown> {\n        yield { a: 1, b: 0 }; // a_0 = 1\n\n        for (let n = 1; true; n++) {\n            yield { a: 2, b: (n * 2 - 1) ** 2 };\n        }\n    }\n\n    /**\n     * Infinite generator for a generalized continued fraction of pi:\n     *   pi = 3 + 1^2/(6 + 3^2/(6 + 5^2/(6 + ...)))\n     *\n     * @yields Term pair (a_n, b_n) of the generalized continued fraction.\n     *   - first: a_0 = 3\n     *   - then: a_n = 6, b_n = (2n-1)^2 (n >= 1)\n     */\n    static *PI(): Generator<CFTerm, never, unknown> {\n        yield { a: 3, b: 0 }; // a_0 = 3\n\n        for (let n = 1; true; n++) {\n            yield { a: 6, b: (n * 2 - 1) ** 2 };\n        }\n    }\n\n    /**\n     * Infinite generator of e = [2; 1, 2, 1, 1, 4, 1, ...].\n     * Terms follow the pattern [2; (1, 2m, 1) for m = 1, 2, 3, ...].\n     *\n     * @yields Next continued-fraction term of e.\n     */\n    static *E(): Generator<number, never, unknown> {\n        yield 2; // a_0 = 2\n\n        for (let m = 1; true; m++) {\n            yield 1;\n            yield 2 * m;\n            yield 1;\n        }\n    }\n\n    /**\n     * Collects at most `steps` terms from a continued fraction.\n     *\n     * @param source Continued-fraction term iterator or a function returning one.\n     * @param steps Maximum number of terms to collect.\n     * @returns Collected terms in source order.\n     */\n    static toArray<T>(source: ContinuedFractionSource<T>, steps = 10): T[] {\n        validateSteps(steps);\n\n        const iterator = iteratorFrom(source);\n        const terms: T[] = [];\n\n        while (terms.length < steps) {\n            const result = iterator.next();\n            if (result.done) break;\n            terms.push(result.value);\n        }\n\n        return terms;\n    }\n\n    /**\n     * Generates every convergent of a simple or generalized continued fraction.\n     *\n     * @param source Continued-fraction term iterator or a function returning one.\n     * @yields Exact convergents as Fraction instances.\n     */\n    static *convergents(source: ContinuedFractionSource): Generator<FractionValue, void, unknown> {\n        const iterator = iteratorFrom(source);\n        const first = iterator.next();\n        if (first.done) return;\n\n        let currentNumerator = Fraction(coefficientOf(first.value));\n        let currentDenominator = Fraction(1);\n        let previousNumerator = Fraction(1);\n        let previousDenominator = Fraction(0);\n\n        yield currentNumerator.div(currentDenominator);\n\n        while (true) {\n            const result = iterator.next();\n            if (result.done) return;\n\n            const coefficient = Fraction(coefficientOf(result.value));\n            const numerator = Fraction(numeratorOf(result.value));\n\n            [previousNumerator, currentNumerator] = [\n                currentNumerator,\n                coefficient.mul(currentNumerator).add(numerator.mul(previousNumerator))];\n            [previousDenominator, currentDenominator] = [\n                currentDenominator,\n                coefficient.mul(currentDenominator).add(numerator.mul(previousDenominator))];\n\n            yield currentNumerator.div(currentDenominator);\n        }\n    }\n\n    /**\n     * Evaluates a simple or generalized continued fraction generator.\n     * For generalized fractions terms are objects `{ a, b }`; otherwise they are coefficients.\n     *\n     * @param source Continued-fraction term iterator or a function returning one.\n     * @param steps Number of terms to evaluate.\n     * @returns Rational approximation as Fraction.\n     */\n    static eval(source: ContinuedFractionSource, steps = 10): FractionValue {\n        validateSteps(steps);\n        if (steps === 0) return Fraction(0);\n\n        let approximation = Fraction(0);\n        let count = 0;\n\n        for (const convergent of ContinuedFraction.convergents(source)) {\n            approximation = convergent;\n            count++;\n            if (count === steps) break;\n        }\n\n        return approximation;\n    }\n}\n\nexport default ContinuedFraction;"],
+  "mappings": ";AAgCA,IAAI,OAAO,WAAW,YAAa,UAAS,SAAU,GAAG;AAAE,MAAI,MAAM,CAAC,EAAG,OAAM,IAAI,MAAM,EAAE;AAAG,SAAO;AAAG;AAExG,IAAM,SAAS,OAAO,CAAC;AACvB,IAAM,QAAQ,OAAO,CAAC;AACtB,IAAM,QAAQ,OAAO,CAAC;AACtB,IAAM,SAAS,OAAO,CAAC;AACvB,IAAM,QAAQ,OAAO,EAAE;AAKvB,IAAM,gBAAgB;AAGtB,IAAM,IAAI;AAAA,EACR,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AACP;AAEA,SAAS,OAAO,GAAG,GAAG;AAEpB,MAAI;AACF,QAAI,OAAO,CAAC;AAAA,EACd,SAAS,GAAG;AACV,UAAM,iBAAiB;AAAA,EACzB;AACA,SAAO,IAAI;AACb;AAEA,SAAS,MAAM,GAAG;AAChB,SAAO,OAAO,MAAM,WAAW,IAAI,KAAK,MAAM,CAAC;AACjD;AAGA,SAAS,YAAY,GAAG,GAAG;AAEzB,MAAI,MAAM,QAAQ;AAChB,UAAM,eAAe;AAAA,EACvB;AAEA,QAAM,IAAI,OAAO,OAAO,SAAS,SAAS;AAC1C,IAAE,GAAG,IAAI,IAAI,SAAS,CAAC,QAAQ;AAE/B,MAAI,IAAI,SAAS,CAAC,IAAI;AAEtB,QAAM,IAAI,IAAI,GAAG,CAAC;AAElB,IAAE,GAAG,IAAI,IAAI;AACb,IAAE,GAAG,IAAI,IAAI;AACb,SAAO;AACT;AAEA,SAAS,UAAU,KAAK;AAEtB,QAAM,UAAU,CAAC;AAEjB,MAAI,IAAI;AACR,MAAI,IAAI;AACR,MAAI,IAAI,SAAS;AAEjB,SAAO,KAAK,GAAG;AAEb,WAAO,IAAI,MAAM,QAAQ;AACvB,WAAK;AACL,cAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,UAAU;AAAA,IACxC;AACA,SAAK,QAAQ,QAAQ;AAAA,EACvB;AAEA,MAAI,MAAM,KAAK;AACb,QAAI,IAAI;AACN,cAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,UAAU;AAAA,EAC1C,OAAO;AACL,YAAQ,GAAG,KAAK,QAAQ,GAAG,KAAK,UAAU;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,IAAM,QAAQ,SAAU,IAAI,IAAI;AAE9B,MAAI,IAAI,QAAQ,IAAI,OAAO,IAAI;AAE/B,MAAI,OAAO,UAAa,OAAO,MAAM;AAAA,EAErC,WAAW,OAAO,QAAW;AAE3B,QAAI,OAAO,OAAO,UAAU;AAC1B,UAAI;AAAA,IACN,WAAW,MAAM,EAAE,GAAG;AACpB,YAAM,iBAAiB;AAAA,IACzB,WAAW,KAAK,MAAM,GAAG;AACvB,YAAM,oBAAoB;AAAA,IAC5B,OAAO;AACL,UAAI,OAAO,EAAE;AAAA,IACf;AAEA,QAAI,OAAO,OAAO,UAAU;AAC1B,UAAI;AAAA,IACN,WAAW,MAAM,EAAE,GAAG;AACpB,YAAM,iBAAiB;AAAA,IACzB,WAAW,KAAK,MAAM,GAAG;AACvB,YAAM,oBAAoB;AAAA,IAC5B,OAAO;AACL,UAAI,OAAO,EAAE;AAAA,IACf;AAEA,QAAI,IAAI;AAAA,EAEV,WAAW,OAAO,OAAO,UAAU;AACjC,QAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,UAAI,OAAO,GAAG,GAAG,CAAC;AAClB,UAAI,OAAO,GAAG,GAAG,CAAC;AAClB,UAAI,OAAO;AACT,aAAK,OAAO,GAAG,GAAG,CAAC;AAAA,IACvB,WAAW,KAAK,IAAI;AAClB,UAAI,OAAO,GAAG,CAAC,CAAC;AAChB,UAAI,KAAK;AACP,YAAI,OAAO,GAAG,CAAC,CAAC;AAAA,IACpB,WAAW,OAAO,OAAO,UAAU;AACjC,UAAI;AAAA,IACN,OAAO;AACL,YAAM,iBAAiB;AAAA,IACzB;AACA,QAAI,IAAI;AAAA,EACV,WAAW,OAAO,OAAO,UAAU;AAEjC,QAAI,MAAM,EAAE,GAAG;AACb,YAAM,iBAAiB;AAAA,IACzB;AAEA,QAAI,KAAK,GAAG;AACV,UAAI,CAAC;AACL,WAAK,CAAC;AAAA,IACR;AAEA,QAAI,KAAK,MAAM,GAAG;AAChB,UAAI,OAAO,EAAE;AAAA,IACf,OAAO;AAEL,UAAI,IAAI;AAER,UAAI,IAAI,GAAG,IAAI;AACf,UAAI,IAAI,GAAG,IAAI;AAEf,UAAI,IAAI;AAER,UAAI,MAAM,GAAG;AACX,YAAI,MAAM,KAAK,MAAM,IAAI,KAAK,MAAM,EAAE,CAAC;AACvC,cAAM;AAAA,MACR;AAIA,aAAO,KAAK,KAAK,KAAK,GAAG;AACvB,YAAI,KAAK,IAAI,MAAM,IAAI;AAEvB,YAAI,OAAO,GAAG;AACZ,cAAI,IAAI,KAAK,GAAG;AACd,gBAAI,IAAI;AACR,gBAAI,IAAI;AAAA,UACV,WAAW,IAAI,GAAG;AAChB,gBAAI;AACJ,gBAAI;AAAA,UACN,OAAO;AACL,gBAAI;AACJ,gBAAI;AAAA,UACN;AACA;AAAA,QAEF,OAAO;AAEL,cAAI,KAAK,GAAG;AACV,iBAAK;AACL,iBAAK;AAAA,UACP,OAAO;AACL,iBAAK;AACL,iBAAK;AAAA,UACP;AAEA,cAAI,IAAI,GAAG;AACT,gBAAI;AACJ,gBAAI;AAAA,UACN,OAAO;AACL,gBAAI;AACJ,gBAAI;AAAA,UACN;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO,CAAC,IAAI,OAAO,CAAC;AACxB,UAAI,OAAO,CAAC;AAAA,IACd;AAAA,EAEF,WAAW,OAAO,OAAO,UAAU;AAEjC,QAAI,MAAM;AAEV,QAAI,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,OAAO,IAAI;AAEvD,QAAI,QAAQ,GAAG,QAAQ,MAAM,EAAE,EAAE,MAAM,QAAQ;AAE/C,QAAI,UAAU;AACZ,YAAM,iBAAiB;AAEzB,QAAI,MAAM,GAAG,MAAM,KAAK;AACtB,UAAI,CAAC;AACL;AAAA,IACF,WAAW,MAAM,GAAG,MAAM,KAAK;AAC7B;AAAA,IACF;AAEA,QAAI,MAAM,WAAW,MAAM,GAAG;AAC5B,UAAI,OAAO,MAAM,KAAK,GAAG,CAAC;AAAA,IAC5B,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,GAAG,MAAM,KAAK;AAEvD,UAAI,MAAM,GAAG,MAAM,KAAK;AACtB,YAAI,OAAO,MAAM,KAAK,GAAG,CAAC;AAAA,MAC5B;AACA;AAGA,UAAI,MAAM,MAAM,MAAM,UAAU,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AACpI,YAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,YAAI,SAAS,OAAO,MAAM,GAAG,EAAE,MAAM;AACrC;AAAA,MACF;AAGA,UAAI,MAAM,GAAG,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,GAAG,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAChG,YAAI,OAAO,MAAM,MAAM,CAAC,GAAG,CAAC;AAC5B,YAAI,SAAS,OAAO,MAAM,MAAM,CAAC,EAAE,MAAM,IAAI;AAC7C,eAAO;AAAA,MACT;AAAA,IAEF,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAC3D,UAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,UAAI,OAAO,MAAM,MAAM,CAAC,GAAG,KAAK;AAChC,aAAO;AAAA,IACT,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAC3D,UAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,UAAI,OAAO,MAAM,MAAM,CAAC,GAAG,CAAC;AAC5B,UAAI,OAAO,MAAM,MAAM,CAAC,GAAG,KAAK;AAChC,aAAO;AAAA,IACT;AAEA,QAAI,MAAM,UAAU,KAAK;AACvB,UAAI,IAAI;AACR;AAAA,MACE,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,IACxB,OAAO;AACL,YAAM,iBAAiB;AAAA,IACzB;AAAA,EAEF,WAAW,OAAO,OAAO,UAAU;AACjC,QAAI;AACJ,QAAI;AACJ,QAAI;AAAA,EACN,OAAO;AACL,UAAM,iBAAiB;AAAA,EACzB;AAEA,MAAI,MAAM,QAAQ;AAChB,UAAM,eAAe;AAAA,EACvB;AAEA,IAAE,GAAG,IAAI,IAAI,SAAS,CAAC,QAAQ;AAC/B,IAAE,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI;AAC3B,IAAE,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI;AAC7B;AAEA,SAAS,OAAO,GAAG,GAAG,GAAG;AAEvB,MAAI,IAAI;AACR,SAAO,IAAI,QAAQ,IAAK,IAAI,IAAK,GAAG,MAAM,OAAO;AAE/C,QAAI,IAAI,OAAO;AACb,UAAK,IAAI,IAAK;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,SAAS,GAAG,GAAG;AAEtB,SAAO,IAAI,UAAU,QACnB,KAAK,OAAO;AAAA,EACd;AAEA,SAAO,IAAI,WAAW,QACpB,KAAK,QAAQ;AAAA,EACf;AAEA,MAAI,MAAM;AACR,WAAO;AAOT,MAAI,MAAM,QAAQ;AAClB,MAAI,IAAI;AAER,SAAO,QAAQ,OAAO,KAAK;AACzB,UAAM,MAAM,QAAQ;AAEpB,QAAI,IAAI;AACN,aAAO;AAAA,EACX;AACA,SAAO,OAAO,CAAC;AACjB;AAEA,SAAS,WAAW,GAAG,GAAG,KAAK;AAE7B,MAAI,OAAO;AACX,MAAI,OAAO,OAAO,OAAO,KAAK,CAAC;AAE/B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,QAAI,SAAS;AACX,aAAO,OAAO,CAAC;AAEjB,WAAO,OAAO,QAAQ;AACtB,WAAO,OAAO,QAAQ;AAAA,EACxB;AACA,SAAO;AACT;AAEA,SAAS,IAAI,GAAG,GAAG;AAEjB,MAAI,CAAC;AACH,WAAO;AACT,MAAI,CAAC;AACH,WAAO;AAET,SAAO,GAAG;AACR,SAAK;AACL,QAAI,CAAC;AACH,aAAO;AACT,SAAK;AACL,QAAI,CAAC;AACH,aAAO;AAAA,EACX;AACF;AASA,SAAS,SAAS,GAAG,GAAG;AAEtB,QAAM,GAAG,CAAC;AAEV,MAAI,gBAAgB,UAAU;AAC5B,QAAI,IAAI,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AACtB,SAAK,GAAG,IAAI,EAAE,GAAG;AACjB,SAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AACrB,SAAK,GAAG,IAAI,EAAE,GAAG,IAAI;AAAA,EACvB,OAAO;AACL,WAAO,YAAY,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AAAA,EAC5C;AACF;AAEA,IAAI,iBAAiB,WAAY;AAAE,SAAO,IAAI,MAAM,kBAAkB;AAAG;AACzE,IAAI,mBAAmB,WAAY;AAAE,SAAO,IAAI,MAAM,kBAAkB;AAAG;AAC3E,IAAI,sBAAsB,WAAY;AAAE,SAAO,IAAI,MAAM,4BAA4B;AAAG;AAExF,SAAS,YAAY;AAAA,EAEnB,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOL,OAAO,WAAY;AAEjB,WAAO,YAAY,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,WAAY;AAEjB,WAAO,YAAY,CAAC,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,MAC3D,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,MAC3D,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,MACtC,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AACV,WAAO;AAAA,MACL,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,MACtC,KAAK,GAAG,IAAI,EAAE,GAAG;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,WAAY;AACnB,WAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,SAAU,GAAG,GAAG;AAErB,QAAI,MAAM,QAAW;AACnB,aAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK;AAAA,IAC7D;AAEA,UAAM,GAAG,CAAC;AACV,QAAI,WAAW,EAAE,GAAG,IAAI,KAAK,GAAG,GAAG;AACjC,YAAM,eAAe;AAAA,IACvB;AAaA,WAAO;AAAA,MACL,KAAK,GAAG,KAAK,EAAE,GAAG,IAAI,KAAK,GAAG,MAAM,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,MACrD,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IAAC;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AAKV,WAAO,YAAY,IAAI,EAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,KAAK,GAAG,CAAC;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AAKV,QAAI,EAAE,GAAG,MAAM,UAAU,KAAK,GAAG,MAAM,QAAQ;AAC7C,aAAO,YAAY,QAAQ,KAAK;AAAA,IAClC;AACA,WAAO,YAAY,EAAE,GAAG,IAAI,KAAK,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAY;AACrB,WAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AAIV,QAAI,EAAE,GAAG,MAAM,OAAO;AAEpB,UAAI,EAAE,GAAG,IAAI,QAAQ;AACnB,eAAO,aAAa,KAAK,GAAG,IAAI,KAAK,GAAG,MAAM,EAAE,GAAG,GAAG,KAAK,GAAG,KAAK,EAAE,GAAG,CAAC;AAAA,MAC3E,OAAO;AACL,eAAO,aAAa,KAAK,GAAG,IAAI,KAAK,GAAG,MAAM,EAAE,GAAG,GAAG,KAAK,GAAG,KAAK,EAAE,GAAG,CAAC;AAAA,MAC3E;AAAA,IACF;AAQA,QAAI,KAAK,GAAG,IAAI,OAAQ,QAAO;AAG/B,QAAI,IAAI,UAAU,KAAK,GAAG,CAAC;AAC3B,QAAI,IAAI,UAAU,KAAK,GAAG,CAAC;AAG3B,QAAI,IAAI;AACR,QAAI,IAAI;AACR,aAAS,KAAK,GAAG;AACf,UAAI,MAAM,IAAK;AACf,UAAI,MAAM,KAAK;AACb,YAAI;AACJ;AAAA,MACF;AACA,QAAE,CAAC,KAAK,EAAE,GAAG;AAEb,UAAI,EAAE,CAAC,IAAI,EAAE,GAAG,MAAM,QAAQ;AAC5B,UAAE,CAAC,KAAK,EAAE,GAAG;AAAA,MACf,MAAO,QAAO;AACd,WAAK,OAAO,CAAC,KAAK,EAAE,CAAC;AAAA,IACvB;AAEA,aAAS,KAAK,GAAG;AACf,UAAI,MAAM,IAAK;AACf,QAAE,CAAC,KAAK,EAAE,GAAG;AAEb,UAAI,EAAE,CAAC,IAAI,EAAE,GAAG,MAAM,QAAQ;AAC5B,UAAE,CAAC,KAAK,EAAE,GAAG;AAAA,MACf,MAAO,QAAO;AACd,WAAK,OAAO,CAAC,KAAK,EAAE,CAAC;AAAA,IACvB;AAEA,QAAI,EAAE,GAAG,IAAI,QAAQ;AACnB,aAAO,YAAY,GAAG,CAAC;AAAA,IACzB;AACA,WAAO,YAAY,GAAG,CAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AAEV,QAAI,KAAK,GAAG,KAAK,UAAU,EAAE,GAAG,KAAK,OAAQ,QAAO;AAEpD,UAAM,YAAY,CAAC;AAEnB,UAAM,cAAc,UAAU,EAAE,GAAG,CAAC;AACpC,UAAM,KAAK,UAAU,EAAE,GAAG,CAAC;AAE3B,UAAM,gBAAgB,UAAU,KAAK,GAAG,CAAC;AACzC,UAAM,KAAK,UAAU,KAAK,GAAG,CAAC;AAE9B,eAAW,SAAS,IAAI;AACtB,kBAAY,KAAK,KAAK,YAAY,KAAK,KAAK,UAAU,GAAG,KAAK;AAAA,IAChE;AACA,eAAW,SAAS,IAAI;AACtB,oBAAc,KAAK,KAAK,cAAc,KAAK,KAAK,UAAU,GAAG,KAAK;AAAA,IACpE;AAEA,eAAW,SAAS,aAAa;AAC/B,UAAI,UAAU,IAAK;AACnB,gBAAU,KAAK,IAAI;AAAA,IACrB;AACA,eAAW,SAAS,eAAe;AACjC,UAAI,UAAU,IAAK;AACnB,gBAAU,KAAK,IAAI;AAAA,IACrB;AAEA,QAAI,OAAO;AACX,QAAI,OAAO;AAGX,eAAW,SAAS,WAAW;AAE7B,YAAM,eAAe,YAAY,KAAK,KAAK;AAC3C,YAAM,iBAAiB,cAAc,KAAK,KAAK;AAE/C,UAAI,iBAAiB,QAAQ;AAC3B,YAAI,mBAAmB,QAAQ;AAC7B,iBAAO;AAAA,QACT;AACA;AAAA,MACF;AAGA,UAAI,OAAO;AACX,UAAI,OAAO;AAGX,YAAM,WAAW,IAAI,MAAM,IAAI;AAC/B,cAAQ;AACR,cAAQ;AAGR,UAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,eAAO;AACP,eAAO;AAAA,MACT,WAAW,OAAO,SAAS,OAAO,MAAM;AACtC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,SAAS,QAAQ,SAAS,OAC7B,YAAY,MAAM,IAAI,IACtB;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,SAAU,GAAG,GAAG;AAExB,UAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,SAAU,GAAG,GAAG;AAEpB,UAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,SAAU,GAAG,GAAG;AAEpB,UAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAM,GAAG,CAAC;AACV,WAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,WAAW,SAAU,GAAG,GAAG;AAEzB,UAAM,GAAG,CAAC;AACV,QAAI,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,KAAK,GAAG;AAEnE,YAAQ,SAAS,MAAM,IAAI;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,SAAU,QAAQ;AAExB,aAAS,SAAS,OAAO,UAAU,CAAC;AAEpC,WAAO;AAAA,MAAY,MAAM,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,KAChE,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,KAAK,SAAS,QAAQ;AAAA,MAC1E;AAAA,IAAM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAU,QAAQ;AAEzB,aAAS,SAAS,OAAO,UAAU,CAAC;AAEpC,WAAO;AAAA,MAAY,MAAM,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,KAChE,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,IAAI,SAAS,QAAQ;AAAA,MACzE;AAAA,IAAM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,SAAU,QAAQ;AAEzB,aAAS,SAAS,OAAO,UAAU,CAAC;AAiBpC,WAAO;AAAA,MAAY,MAAM,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,IACjE,KAAK,GAAG,MAAM,KAAK,GAAG,KAAK,SAAS,QAAQ,UAAU,SAAS,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,IAAI,QAAQ;AAAA,MACrH;AAAA,IAAM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,SAAU,GAAG,GAAG;AASzB,UAAM,GAAG,CAAC;AAEV,UAAM,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG;AAC3B,UAAM,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG;AAC3B,UAAM,IAAI,IAAI;AAGd,QAAI,IAAI,MAAM,IAAI,CAAC;AACnB,QAAI,IAAI,KAAK,GAAG;AACd;AAAA,IACF;AACA,WAAO,YAAY,KAAK,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,SAAU,GAAG,GAAG;AAE3B,UAAM,GAAG,CAAC;AACV,WAAO,EAAE,EAAE,EAAE,GAAG,IAAI,KAAK,GAAG,MAAQ,KAAK,GAAG,IAAI,EAAE,GAAG,KAAM,EAAE,GAAG,IAAI,KAAK,GAAG;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAY;AAErB,WAAO,OAAO,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,IAAI,OAAO,KAAK,GAAG,CAAC;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,SAAU,KAAK;AAEzB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAEhB,UAAM,OAAO;AAEb,QAAI,SAAS,SAAS,GAAG,CAAC;AAC1B,QAAI,SAAS,WAAW,GAAG,GAAG,MAAM;AAEpC,QAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAGrC,WAAO,MAAM,IAAI,CAAC;AAElB,SAAK;AACL,SAAK;AAEL,QAAI;AACF,aAAO;AAET,QAAI,QAAQ;AAEV,eAAS,IAAI,QAAQ,OAAM;AACzB,eAAO,MAAM,IAAI,CAAC;AAClB,aAAK;AACL,aAAK;AAAA,MACP;AACA,aAAO;AACP,eAAS,IAAI,QAAQ,OAAM;AACzB,eAAO,MAAM,IAAI,CAAC;AAClB,aAAK;AACL,aAAK;AAAA,MACP;AACA,aAAO;AAAA,IACT,OAAO;AACL,eAAS,IAAI,KAAK,KAAK,OAAM;AAC3B,eAAO,MAAM,IAAI,CAAC;AAClB,aAAK;AACL,aAAK;AAAA,MACP;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,SAAU,WAAW;AAEjC,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAErC,QAAI,MAAM,OAAO;AACf,aAAO;AAAA,IACT,OAAO;AACL,UAAI,QAAQ,MAAM,IAAI,CAAC;AACvB,UAAI,aAAa,QAAQ,QAAQ;AAC/B,eAAO;AACP,eAAO;AACP,aAAK;AAAA,MACP;AAEA,aAAO;AACP,aAAO;AACP,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,SAAU,WAAW;AAE9B,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAErC,QAAI,MAAM,OAAO;AACf,aAAO;AAAA,IACT,OAAO;AACL,UAAI,QAAQ,MAAM,IAAI,CAAC;AACvB,UAAI,aAAa,QAAQ,QAAQ;AAC/B,eAAO;AACP,aAAK;AAAA,MACP;AAEA,aAAO;AACP,aAAO;AACP,aAAO;AACP,aAAO;AACP,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAe,WAAY;AAEzB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,IAAI,KAAK,GAAG;AAChB,QAAI,MAAM,CAAC;AAEX,OAAG;AACD,UAAI,KAAK,MAAM,IAAI,CAAC,CAAC;AACrB,UAAI,IAAI,IAAI;AACZ,UAAI;AACJ,UAAI;AAAA,IACN,SAAS,MAAM;AAEf,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,SAAU,KAAK;AAEzB,UAAM,OAAO,OAAO,KAAK,OAAO,QAAS,CAAC;AAE1C,UAAM,UAAU,KAAK,KAAK,EAAE;AAC5B,UAAM,OAAO,QAAQ,aAAa,EAAE;AAEpC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAEpC,UAAI,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,KAAK;AACtC,eAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,YAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,MACnC;AAEA,UAAI,IAAI,EAAE,KAAK,EAAE,OAAO;AACxB,UAAI,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,GAAG;AAC1B,eAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,MAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;;;AC1gCA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaA,IAAMA,YAAW;AAgBjB,SAAS,aAAgB,QAAiD;AACtE,SAAO,OAAO,WAAW,aAAa,OAAO,IAAI;AACrD;AAEA,SAAS,cAAc,MAA0C;AAC7D,SAAO,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,OAAO,KAAK,IAAI;AAC/E;AAEA,SAAS,YAAY,MAA0C;AAC3D,SAAO,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,OAAO,KAAK,IAAI;AAC/E;AAEA,SAAS,cAAc,OAAqB;AACxC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC3C,UAAM,IAAI,WAAW,2CAA2C;AAAA,EACpE;AACJ;AAMO,IAAM,oBAAN,MAAM,mBAAkB;AAAA,EACnB,cAAc;AAClB,UAAM,IAAI,UAAU,qCAAqC;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,KAAK,GAA6C;AACtD,QAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,GAAG;AACnC,YAAM,IAAI,WAAW,uCAAuC;AAAA,IAChE;AAEA,UAAM,KAAK,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC;AAClC,UAAM;AACN,QAAI,KAAK,OAAO,EAAG;AAEnB,QAAI,KAAK;AACT,QAAI,KAAK;AACT,QAAI,KAAK;AAET,WAAO,MAAM;AACT,WAAK,KAAK,KAAK;AACf,YAAM,IAAI,KAAK,MAAM;AACrB,WAAK,KAAK,OAAO,KAAK,MAAM,EAAE;AAC9B,YAAM;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,WAAW,GAAkD;AACjE,WAAOA,UAAS,CAAC,EAAE,YAAY;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,aAAa,GAAgB,GAAmD;AACpF,UAAM,WAAW,MAAM,SAAYA,UAAS,CAAC,IAAIA,UAAS,CAAC,EAAE,IAAIA,UAAS,CAAC,CAAC;AAC5E,WAAO,SAAS,YAAY;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,UAA2C,OAAiD;AAChG,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,MAAyC;AAC7C,WAAO,MAAM;AACT,YAAM;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,eAAkD;AACtD,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE;AAEnB,aAAS,IAAI,GAAG,MAAM,KAAK;AACvB,YAAM,EAAE,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,EAAE;AAAA,IACtC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,KAAwC;AAC5C,UAAM,EAAE,GAAG,GAAG,GAAG,EAAE;AAEnB,aAAS,IAAI,GAAG,MAAM,KAAK;AACvB,YAAM,EAAE,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM,EAAE;AAAA,IACtC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,IAAuC;AAC3C,UAAM;AAEN,aAAS,IAAI,GAAG,MAAM,KAAK;AACvB,YAAM;AACN,YAAM,IAAI;AACV,YAAM;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,QAAW,QAAoC,QAAQ,IAAS;AACnE,kBAAc,KAAK;AAEnB,UAAM,WAAW,aAAa,MAAM;AACpC,UAAM,QAAa,CAAC;AAEpB,WAAO,MAAM,SAAS,OAAO;AACzB,YAAM,SAAS,SAAS,KAAK;AAC7B,UAAI,OAAO,KAAM;AACjB,YAAM,KAAK,OAAO,KAAK;AAAA,IAC3B;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,YAAY,QAA0E;AAC1F,UAAM,WAAW,aAAa,MAAM;AACpC,UAAM,QAAQ,SAAS,KAAK;AAC5B,QAAI,MAAM,KAAM;AAEhB,QAAI,mBAAmBA,UAAS,cAAc,MAAM,KAAK,CAAC;AAC1D,QAAI,qBAAqBA,UAAS,CAAC;AACnC,QAAI,oBAAoBA,UAAS,CAAC;AAClC,QAAI,sBAAsBA,UAAS,CAAC;AAEpC,UAAM,iBAAiB,IAAI,kBAAkB;AAE7C,WAAO,MAAM;AACT,YAAM,SAAS,SAAS,KAAK;AAC7B,UAAI,OAAO,KAAM;AAEjB,YAAM,cAAcA,UAAS,cAAc,OAAO,KAAK,CAAC;AACxD,YAAM,YAAYA,UAAS,YAAY,OAAO,KAAK,CAAC;AAEpD,OAAC,mBAAmB,gBAAgB,IAAI;AAAA,QACpC;AAAA,QACA,YAAY,IAAI,gBAAgB,EAAE,IAAI,UAAU,IAAI,iBAAiB,CAAC;AAAA,MAAC;AAC3E,OAAC,qBAAqB,kBAAkB,IAAI;AAAA,QACxC;AAAA,QACA,YAAY,IAAI,kBAAkB,EAAE,IAAI,UAAU,IAAI,mBAAmB,CAAC;AAAA,MAAC;AAE/E,YAAM,iBAAiB,IAAI,kBAAkB;AAAA,IACjD;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,KAAK,QAAiC,QAAQ,IAAmB;AACpE,kBAAc,KAAK;AACnB,QAAI,UAAU,EAAG,QAAOA,UAAS,CAAC;AAElC,QAAI,gBAAgBA,UAAS,CAAC;AAC9B,QAAI,QAAQ;AAEZ,eAAW,cAAc,mBAAkB,YAAY,MAAM,GAAG;AAC5D,sBAAgB;AAChB;AACA,UAAI,UAAU,MAAO;AAAA,IACzB;AAEA,WAAO;AAAA,EACX;AACJ;AAEA,IAAO,4BAAQ;",
+  "names": ["Fraction"]
+}

package/package.json

@@ -1,33 +1,51 @@
 {
     "name": "continuedfraction.js",
-    "title": "ContinuedFraction.js",
-    "version": "0.0.1",
+    "version": "0.1.0",
+    "type": "commonjs",
+    "description": "Generator-based simple and generalized continued fractions with exact Fraction.js convergents",
     "homepage": "https://github.com/rawify/ContinuedFraction.js",
     "bugs": "https://github.com/rawify/ContinuedFraction.js/issues",
-    "description": "The RAW continued fractions library",
     "keywords": [
         "math",
-        "continued fraction",
+        "continued-fraction",
+        "convergents",
         "fraction",
-        "bigint"
+        "bigint",
+        "rational-approximation",
+        "square-root",
+        "generator"
+    ],
+    "files": [
+        "dist",
+        "README.md",
+        "LICENSE"
     ],
-    "private": false,
     "main": "./dist/continuedfraction.js",
     "module": "./dist/continuedfraction.mjs",
-    "types": "./continuedfraction.d.ts",
-    "browser": "./dist/continuedfraction.min.js",
     "unpkg": "./dist/continuedfraction.min.js",
-    "readmeFilename": "README.md",
+    "jsdelivr": "./dist/continuedfraction.min.js",
+    "types": "./dist/continuedfraction.d.ts",
     "exports": {
         ".": {
-            "types": "./continuedfraction.d.ts",
-            "require": "./dist/continuedfraction.js",
-            "import": "./dist/continuedfraction.mjs"
-        }
+            "import": {
+                "types": "./dist/continuedfraction.d.mts",
+                "default": "./dist/continuedfraction.mjs"
+            },
+            "require": {
+                "types": "./dist/continuedfraction.d.ts",
+                "default": "./dist/continuedfraction.js"
+            },
+            "default": {
+                "types": "./dist/continuedfraction.d.ts",
+                "default": "./dist/continuedfraction.js"
+            }
+        },
+        "./package.json": "./package.json"
     },
+    "sideEffects": false,
     "repository": {
         "type": "git",
-        "url": "git@github.com:rawify/ContinuedFraction.js.git"
+        "url": "git+ssh://git@github.com/rawify/ContinuedFraction.js.git"
     },
     "funding": {
         "type": "github",
@@ -40,18 +58,22 @@
     },
     "license": "MIT",
     "engines": {
-        "node": "*"
-    },
-    "directories": {
-        "test": "tests"
+        "node": ">=20"
     },
     "scripts": {
-        "build": "crude-build ContinuedFraction",
-        "test": "mocha tests/*.js"
+        "clean": "node scripts/clean.mjs",
+        "typecheck": "tsc --noEmit",
+        "build:types": "tsc -p tsconfig.build.json",
+        "build:js": "node scripts/build.mjs",
+        "build": "npm run clean && npm run build:types && npm run build:js",
+        "test:types": "tsc -p tests/types/tsconfig.json",
+        "test:runtime": "node --test tests/*.test.js tests/*.test.mjs",
+        "test": "npm run build && npm run test:types && npm run test:runtime",
+        "prepublishOnly": "npm test"
     },
     "devDependencies": {
-        "crude-build": "^0.1.0",
-        "mocha": "^11.1.0"
+        "esbuild": "^0.25.9",
+        "typescript": "^5.9.2"
     },
     "dependencies": {
         "fraction.js": "^5.2.2"

package/continuedfraction.d.ts

@@ -1,80 +0,0 @@
-
-import type Fraction from 'fraction.js';
-
-/**
- * A term of a generalized continued fraction.
- */
-export interface CFTerm {
-    /** The aₙ coefficient */
-    a: number;
-    /** The bₙ coefficient */
-    b: number;
-}
-
-/**
- * Utility class for generating continued-fraction expansions of various constants.
- * All methods are static.
- */
-export default class ContinuedFraction {
-    /**
-     * Infinite generator for the continued‐fraction terms of √N.
-     * @param N Integer whose square‐root CF expansion is desired (N ≥ 0)
-     * @yields Next continued‐fraction term of √N
-     */
-    static sqrt(N: number): Generator<number, void, unknown>;
-
-    /**
-     * Generator for continued‐fraction terms of any real number via Fraction.js.
-     * @param n The real number to convert (as number, string, or bigint)
-     * @yields Next continued‐fraction term of n
-     */
-    static fromNumber(n: number | string | bigint): Generator<number, void, unknown>;
-
-    /**
-     * Generator for continued‐fraction terms of a rational a/b via Fraction.js.
-     * @param a Numerator (number, string, bigint, or Fraction)
-     * @param b Denominator (number, string, or bigint)
-     * @yields Next continued‐fraction term of a/b
-     */
-    static fromFraction(
-        a: number | string | bigint | Fraction,
-        b: number | string | bigint
-    ): Generator<number, void, unknown>;
-
-    /**
-     * Infinite generator of the golden ratio φ = [1; 1, 1, 1, …].
-     * @yields Always 1
-     */
-    static PHI(): Generator<number, void, unknown>;
-
-    /**
-     * Infinite generator for the generalized continued‐fraction terms of 4/π.
-     * @yields Term pairs { a, b } for the continued‐fraction
-     */
-    static FOUR_OVER_PI(): Generator<CFTerm, void, unknown>;
-
-    /**
-     * Infinite generator for the generalized continued‐fraction terms of π.
-     * @yields Term pairs { a, b } for the continued‐fraction
-     */
-    static PI(): Generator<CFTerm, void, unknown>;
-
-    /**
-     * Infinite generator of e = [2; 1, 2, 1, 1, 4, 1, …].
-     * @yields Next continued‐fraction term of e
-     */
-    static E(): Generator<number, void, unknown>;
-
-    /**
-     * Evaluate a (simple or generalized) continued fraction generator.
-     * @param generator A CF term generator or a function returning one
-     * @param steps Number of terms to include (default 10)
-     * @returns Rational approximation as a Fraction
-     */
-    static eval(
-        generator:
-            | Generator<number | CFTerm, any, any>
-            | (() => Generator<number | CFTerm, any, any>),
-        steps?: number
-    ): Fraction;
-}

package/src/continuedfraction.js

@@ -1,179 +0,0 @@
-/**
- * @license ContinuedFraction.js v0.0.1 4/18/2025
- * https://github.com/rawify/ContinuedFraction.js
- *
- * Copyright (c) 2025, Robert Eisele (https://raw.org/)
- * Licensed under the MIT license.
- **/
-
-import Fraction from 'fraction.js';
-
-/**
- * Utility class for generating continued-fraction expansions of various constants.
- */
-const ContinuedFraction = {
-
-    /**
-     * Infinite generator for the continued-fraction terms of sqrt(N).
-     *   √N = [a0; (a1, a2, ..., a_p)], where the period ends when ak = 2*a0.
-     * For perfect squares, yields only a0 = floor(sqrt(N)) and then returns.
-     *
-     * @param {number} N - Integer whose square root CF expansion is desired (N ≥ 0).
-     * @yields {number} - Next continued-fraction term of √N.
-     */
-    "sqrt": function* (N) {
-
-        const a0 = Math.floor(Math.sqrt(N));
-        yield a0;
-        if (a0 * a0 === N) return; // perfect square: single-term CF
-
-        //while (true) {
-        let nk = 0;
-        let dk = 1;
-        let ak = a0;
-
-        do {
-            nk = ak * dk - nk;
-            dk = (N - nk * nk) / dk; // remains integer by construction
-            ak = Math.floor((a0 + nk) / dk);
-            yield ak;
-        } while (/* 2 * a0 !== ak */ true);
-        //}
-    },
-
-    /**
-     * Generator for continued-fraction terms of any real number via Fraction.js.
-     *
-     * @exports
-     * @param {number|string|BigInt} n - The real number to convert (as number or string).
-     * @yields {number} - Next continued-fraction term of n.
-     */
-    "fromNumber": function* (n) {
-
-        yield* Fraction(n)['toContinued']();
-    },
-
-    /**
-     * Generator for continued-fraction terms of a rational a/b via Fraction.js.
-     *
-     * @param {number|string|BigInt|Fraction} a - Numerator.
-     * @param {number|string|BigInt} b - Denominator.
-     * @yields {number} - Next continued-fraction term of a/b.
-     */
-    "fromFraction": function* (a, b) {
-
-        yield* Fraction(a, b)['toContinued']();
-    },
-
-    /**
-     * Infinite generator of the golden ratio φ = [1; 1, 1, 1, …].
-     *
-     * @yields {number} - Always 1.
-     */
-    "PHI": function* () {
-
-        while (true) {
-            yield 1;
-        }
-    },
-
-    /**
-     * Infinite generator for Continued‐fraction terms of 4/π:
-     *   4/π = 1 + 1²/(3 + 2²/(5 + 3²/(7 + …)))
-     * @yields {{a:number,b:number}} - Term pair (aₙ, bₙ) of the generalized continued fraction.
-     *   - first: a₀ = 1
-     *   - then: aₙ = 2n+1, bₙ = n²  (n ≥ 1)
-     */
-    "FOUR_OVER_PI": function* () {
-
-        yield { "a": 1, "b": 0 }; // a₀ = 1
-
-        for (let n = 0; true; n++) {
-            yield { "a": 2, "b": (n * 2 + 1) ** 2 };
-        }
-    },
-
-    /**
-     * Infinite generator for Continued‐fraction terms of π:
-     *   π = 3 + 1²/(6 + 3²/(6 + 5²/(6 + …)))
-     * @yields {{a:number,b:number}} - Term pair (aₙ, bₙ) of the generalized continued fraction.
-     *   - first: a₀ = 3
-     *   - then: aₙ = 6, bₙ = (2n-1)²  (n ≥ 1)
-     */
-    "PI": function* () {
-
-        yield { "a": 3, "b": 0 }; // a₀ = 3
-
-        for (let n = 1; true; n++) {
-            yield { "a": 6, "b": (n * 2 - 1) ** 2 };
-        }
-    },
-
-    /**
-     * Infinite generator of e = [2; 1, 2, 1, 1, 4, 1, …].
-     * Terms follow the pattern [2; (1,2m,1) for m = 1,2,3,…].
-     *
-     * @yields {number} - Next continued-fraction term of e.
-     */
-    "E": function* () {
-
-        yield 2; // a₀ = 2
-
-        for (let m = 1; ; m++) {
-            yield 1;
-            yield 2 * m;
-            yield 1;
-        }
-
-        /* Alternative:
-        yield { a: 2, b: 0 }; // a₀ = 2
-        yield { a: 1, b: 1 }; // a₁ = 1
-
-        for (let m = 2; ; m++) {
-            yield { a: n, b: m - 1 };
-        }
-        */
-    },
-
-    /**
-     * Evaluate a (simple or generalized) continued fraction generator.
-     * For generalized: terms are objects { a, b }, else regular numbers.
-     * 
-     * @param {Generator|Function} generator - Continued fraction term generator.
-     * @param {number} steps - Number of terms to evaluate.
-     * @returns {Fraction} - Rational approximation as Fraction.
-     */
-    "eval": function (generator, steps = 10) {
-
-        if (typeof generator === "function") {
-            generator = generator();
-        }
-
-        // pull off a₀ (with its b₀)
-        const first = generator['next']();
-        if (first['done']) return Fraction(0);
-
-        const a0 = Fraction(first['value']['a'] ?? first['value']);
-
-        // initialize convergents p₋₁/q₋₁ = 1/0, p₀/q₀ = a₀/1
-        let pCurr = a0, qCurr = Fraction(1);
-        let pPrev = Fraction(1), qPrev = Fraction(0);
-
-        // run through a₁… up to `steps-1` more
-        for (let k = 1; k < steps; k++) {
-            const { value, done } = generator['next']();
-            if (done) break;
-
-            const ak = Fraction(value['a'] ?? value),
-                bk = Fraction(value['b'] ?? 1);
-
-            // pₖ = aₖ·pₖ₋₁ + bₖ·pₖ₋₂
-            // qₖ = aₖ·qₖ₋₁ + bₖ·qₖ₋₂
-            [pPrev, pCurr] = [pCurr, ak['mul'](pCurr)['add'](bk['mul'](pPrev))];
-            [qPrev, qCurr] = [qCurr, ak['mul'](qCurr)['add'](bk['mul'](qPrev))];
-        }
-
-        // final convergent = pCurr/qCurr
-        return pCurr['div'](qCurr);
-    }
-}

package/tests/continued.js

@@ -1,50 +0,0 @@
-
-const ContinuedFraction = require("continuedfraction.js");
-const assert = require('assert');
-
-function get(gen, num = 10) {
-
-    const res = [];
-    for (let i = 0; i < num; i++) {
-        let x = gen.next();
-        if (x.done) break;
-        res.push(x.value);
-    }
-    return res;
-}
-
-const tests = [
-
-    { label: "sqrt(2)", generator: ContinuedFraction.sqrt(2), expect: [1, 2, 2, 2, 2, 2, 2, 2, 2, 2] },
-    { label: "sqrt(3)", generator: ContinuedFraction.sqrt(3), expect: [1, 1, 2, 1, 2, 1, 2, 1, 2, 1] },
-    { label: "sqrt(5)", generator: ContinuedFraction.sqrt(5), expect: [2, 4, 4, 4, 4, 4, 4, 4, 4, 4] },
-    { label: "sqrt(7)", generator: ContinuedFraction.sqrt(7), expect: [2, 1, 1, 1, 4, 1, 1, 1, 4, 1] },
-
-    { label: "fromNumber(23.43)", generator: ContinuedFraction.fromNumber(23.43), expect: [23, 2, 3, 14] },
-    { label: "fromNumber(77)", generator: ContinuedFraction.fromNumber(77), expect: [77] },
-
-    { label: "PHI", generator: ContinuedFraction.PHI(), expect: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] },
-    { label: "PI", generator: ContinuedFraction.PI(), expect: [{ a: 3, b: 0 }, { a: 6, b: 1 }, { a: 6, b: 9 }, { a: 6, b: 25 }, { a: 6, b: 49 }, { a: 6, b: 81 }, { a: 6, b: 121 },{ a: 6, b: 169 },{ a: 6, b: 225 },{ a: 6, b: 289 }] },
-    { label: "FOUR_OVER_PI", generator: ContinuedFraction.FOUR_OVER_PI(), expect: [{ a: 1, b: 0 }, { a: 2, b: 1 }, { a: 2, b: 9 }, { a: 2, b: 25 }, { a: 2, b: 49 }, { a: 2, b: 81 }, { a: 2, b: 121 },{ a: 2, b: 169 },{ a: 2, b: 225 },{ a: 2, b: 289 }] },
-    { label: "E", generator: ContinuedFraction.E(), expect: [2, 1, 2, 1, 1, 4, 1, 1, 6, 1] },
-
-    { label: "eval(Fraction(271/13))", input: ContinuedFraction.eval(ContinuedFraction.fromFraction("271/13"), 10).toFraction(), expect: "271/13" },
-    { label: "eval(PHI)", input: ContinuedFraction.eval(ContinuedFraction.PHI, 21).toFraction(), expect: "17711/10946" }
-];
-
-describe('Continued Fraction', function () {
-
-    for (var i = 0; i < tests.length; i++) {
-
-        (function (test) {
-
-            it(test.label, function () {
-                if (test.generator)
-                    assert.deepEqual(get(test.generator, 10), test.expect);
-                else
-                    assert.deepEqual(test.input, test.expect);
-            });
-
-        })(tests[i]);
-    }
-});