continuedfraction.js 0.0.2 → 0.1.0

package/dist/continuedfraction.js

@@ -1,179 +1,250 @@
-'use strict';
-const Fraction = require('fraction.js');
-
-
-
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/continuedfraction.ts
+var continuedfraction_exports = {};
+__export(continuedfraction_exports, {
+  ContinuedFraction: () => ContinuedFraction,
+  default: () => continuedfraction_default
+});
+module.exports = __toCommonJS(continuedfraction_exports);
+var import_fraction = __toESM(require("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);
-    }
+ * @license ContinuedFraction.js v0.1.0
+ * https://github.com/rawify/ContinuedFraction.js
+ *
+ * Copyright (c) 2026, Robert Eisele (https://raw.org/)
+ * Licensed under the MIT license.
+ **/
+var Fraction = import_fraction.default;
+function iteratorFrom(source) {
+  return typeof source === "function" ? source() : source;
 }
-
-Object.defineProperty(ContinuedFraction, "__esModule", { 'value': true });
-ContinuedFraction['default'] = ContinuedFraction;
-ContinuedFraction['ContinuedFraction'] = ContinuedFraction;
-module['exports'] = ContinuedFraction;
+function coefficientOf(term) {
+  return typeof term === "object" && term !== null && "a" in term ? term.a : term;
+}
+function numeratorOf(term) {
+  return typeof term === "object" && term !== null && "b" in term ? term.b : 1;
+}
+function validateSteps(steps) {
+  if (!Number.isSafeInteger(steps) || steps < 0) {
+    throw new RangeError("steps must be a non-negative safe integer");
+  }
+}
+var ContinuedFraction = class _ContinuedFraction {
+  constructor() {
+    throw new TypeError("ContinuedFraction is a static class");
+  }
+  /**
+   * Infinite generator for the continued-fraction terms of sqrt(N).
+   *   sqrt(N) = [a0; (a1, a2, ..., a_p)], with a period boundary at ak = 2*a0.
+   * For perfect squares, yields only a0 = floor(sqrt(N)) and then returns.
+   *
+   * @param N Integer whose square-root CF expansion is desired (N >= 0).
+   * @yields Next continued-fraction term of sqrt(N).
+   */
+  static *sqrt(N) {
+    if (!Number.isSafeInteger(N) || N < 0) {
+      throw new RangeError("N must be a non-negative safe integer");
+    }
+    const a0 = Math.floor(Math.sqrt(N));
+    yield a0;
+    if (a0 * a0 === N) return;
+    let nk = 0;
+    let dk = 1;
+    let ak = a0;
+    while (true) {
+      nk = ak * dk - nk;
+      dk = (N - nk * nk) / dk;
+      ak = Math.floor((a0 + nk) / dk);
+      yield ak;
+    }
+  }
+  /**
+   * 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) {
+    yield* Fraction(n).toContinued();
+  }
+  /**
+   * Generator for continued-fraction terms of a rational a/b via Fraction.js.
+   *
+   * @param a Numerator, Fraction, or complete fraction string.
+   * @param b Optional denominator.
+   * @yields Next continued-fraction term of a/b.
+   */
+  static *fromFraction(a, b) {
+    const fraction = b === void 0 ? Fraction(a) : Fraction(a).div(Fraction(b));
+    yield* fraction.toContinued();
+  }
+  /**
+   * Yields a finite sequence of simple or generalized terms unchanged.
+   *
+   * @param terms Continued-fraction terms.
+   * @yields Each supplied term in order.
+   */
+  static *fromTerms(terms) {
+    yield* terms;
+  }
+  /**
+   * Infinite generator of the golden ratio phi = [1; 1, 1, 1, ...].
+   *
+   * @yields Always 1.
+   */
+  static *PHI() {
+    while (true) {
+      yield 1;
+    }
+  }
+  /**
+   * Infinite generator for Brouncker's generalized continued fraction of 4/pi:
+   *   4/pi = 1 + 1^2/(2 + 3^2/(2 + 5^2/(2 + ...)))
+   *
+   * @yields Term pair (a_n, b_n) of the generalized continued fraction.
+   *   - first: a_0 = 1
+   *   - then: a_n = 2, b_n = (2n-1)^2 (n >= 1)
+   */
+  static *FOUR_OVER_PI() {
+    yield { a: 1, b: 0 };
+    for (let n = 1; true; n++) {
+      yield { a: 2, b: (n * 2 - 1) ** 2 };
+    }
+  }
+  /**
+   * Infinite generator for a generalized continued fraction of pi:
+   *   pi = 3 + 1^2/(6 + 3^2/(6 + 5^2/(6 + ...)))
+   *
+   * @yields Term pair (a_n, b_n) of the generalized continued fraction.
+   *   - first: a_0 = 3
+   *   - then: a_n = 6, b_n = (2n-1)^2 (n >= 1)
+   */
+  static *PI() {
+    yield { a: 3, b: 0 };
+    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 Next continued-fraction term of e.
+   */
+  static *E() {
+    yield 2;
+    for (let m = 1; true; m++) {
+      yield 1;
+      yield 2 * m;
+      yield 1;
+    }
+  }
+  /**
+   * Collects at most `steps` terms from a continued fraction.
+   *
+   * @param source Continued-fraction term iterator or a function returning one.
+   * @param steps Maximum number of terms to collect.
+   * @returns Collected terms in source order.
+   */
+  static toArray(source, steps = 10) {
+    validateSteps(steps);
+    const iterator = iteratorFrom(source);
+    const terms = [];
+    while (terms.length < steps) {
+      const result = iterator.next();
+      if (result.done) break;
+      terms.push(result.value);
+    }
+    return terms;
+  }
+  /**
+   * Generates every convergent of a simple or generalized continued fraction.
+   *
+   * @param source Continued-fraction term iterator or a function returning one.
+   * @yields Exact convergents as Fraction instances.
+   */
+  static *convergents(source) {
+    const iterator = iteratorFrom(source);
+    const first = iterator.next();
+    if (first.done) return;
+    let currentNumerator = Fraction(coefficientOf(first.value));
+    let currentDenominator = Fraction(1);
+    let previousNumerator = Fraction(1);
+    let previousDenominator = Fraction(0);
+    yield currentNumerator.div(currentDenominator);
+    while (true) {
+      const result = iterator.next();
+      if (result.done) return;
+      const coefficient = Fraction(coefficientOf(result.value));
+      const numerator = Fraction(numeratorOf(result.value));
+      [previousNumerator, currentNumerator] = [
+        currentNumerator,
+        coefficient.mul(currentNumerator).add(numerator.mul(previousNumerator))
+      ];
+      [previousDenominator, currentDenominator] = [
+        currentDenominator,
+        coefficient.mul(currentDenominator).add(numerator.mul(previousDenominator))
+      ];
+      yield currentNumerator.div(currentDenominator);
+    }
+  }
+  /**
+   * Evaluates a simple or generalized continued fraction generator.
+   * For generalized fractions terms are objects `{ a, b }`; otherwise they are coefficients.
+   *
+   * @param source Continued-fraction term iterator or a function returning one.
+   * @param steps Number of terms to evaluate.
+   * @returns Rational approximation as Fraction.
+   */
+  static eval(source, steps = 10) {
+    validateSteps(steps);
+    if (steps === 0) return Fraction(0);
+    let approximation = Fraction(0);
+    let count = 0;
+    for (const convergent of _ContinuedFraction.convergents(source)) {
+      approximation = convergent;
+      count++;
+      if (count === steps) break;
+    }
+    return approximation;
+  }
+};
+var continuedfraction_default = ContinuedFraction;
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ContinuedFraction
+});
+const ContinuedFractionExport = module.exports.default;
+Object.defineProperty(ContinuedFractionExport, "__esModule", { value: true });
+ContinuedFractionExport.default = ContinuedFractionExport;
+ContinuedFractionExport.ContinuedFraction = ContinuedFractionExport;
+module.exports = ContinuedFractionExport;
+//# sourceMappingURL=continuedfraction.js.map

package/dist/continuedfraction.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/continuedfraction.ts"],
+  "sourcesContent": ["/**\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": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQA,sBAAgE;AARhE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaA,IAAM,WAAW,gBAAAA;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,WAAO,SAAS,CAAC,EAAE,YAAY;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,aAAa,GAAgB,GAAmD;AACpF,UAAM,WAAW,MAAM,SAAY,SAAS,CAAC,IAAI,SAAS,CAAC,EAAE,IAAI,SAAS,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,mBAAmB,SAAS,cAAc,MAAM,KAAK,CAAC;AAC1D,QAAI,qBAAqB,SAAS,CAAC;AACnC,QAAI,oBAAoB,SAAS,CAAC;AAClC,QAAI,sBAAsB,SAAS,CAAC;AAEpC,UAAM,iBAAiB,IAAI,kBAAkB;AAE7C,WAAO,MAAM;AACT,YAAM,SAAS,SAAS,KAAK;AAC7B,UAAI,OAAO,KAAM;AAEjB,YAAM,cAAc,SAAS,cAAc,OAAO,KAAK,CAAC;AACxD,YAAM,YAAY,SAAS,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,QAAO,SAAS,CAAC;AAElC,QAAI,gBAAgB,SAAS,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": ["FractionFactory"]
+}

package/dist/continuedfraction.min.js

@@ -1,10 +1,8 @@
-/*
-ContinuedFraction.js v0.0.2 8/16/2025
-https://github.com/rawify/ContinuedFraction.js
-
-Copyright (c) 2025, Robert Eisele (https://raw.org/)
-Licensed under the MIT license.
-*/
-'use strict';(function(n){const e={sqrt:function*(a){const c=Math.floor(Math.sqrt(a));yield c;if(c*c!==a){var b=0,d=1,f=c;do b=f*d-b,d=(a-b*b)/d,f=Math.floor((c+b)/d),yield f;while(1)}},fromNumber:function*(a){yield*Fraction(a).toContinued()},fromFraction:function*(a,c){yield*Fraction(a,c).toContinued()},PHI:function*(){for(;;)yield 1},FOUR_OVER_PI:function*(){yield{a:1,b:0};for(let a=0;;a++)yield{a:2,b:(2*a+1)**2}},PI:function*(){yield{a:3,b:0};for(let a=1;;a++)yield{a:6,b:(2*a-1)**2}},E:function*(){yield 2;
-for(let a=1;;a++)yield 1,yield 2*a,yield 1},eval:function(a,c=10){"function"===typeof a&&(a=a());var b=a.next();if(b.done)return Fraction(0);b=Fraction(b.value.a??b.value);let d=Fraction(1),f=Fraction(1),h=Fraction(0);for(let k=1;k<c;k++){const {value:g,done:p}=a.next();if(p)break;const l=Fraction(g.a??g),m=Fraction(g.b??1);[f,b]=[b,l.mul(b).add(m.mul(f))];[h,d]=[d,l.mul(d).add(m.mul(h))]}return b.div(d)}};"function"===typeof define&&define.amd?define([],function(){return e}):"object"===typeof exports?
-(Object.defineProperty(e,"__esModule",{value:!0}),e["default"]=e,e.ContinuedFraction=e,module.exports=e):n.ContinuedFraction=e})(this);
+"use strict";var ContinuedFractionExports=(()=>{var S=Object.defineProperty;var L=Object.getOwnPropertyDescriptor;var R=Object.getOwnPropertyNames;var j=Object.prototype.hasOwnProperty;var A=(t,n)=>{for(var e in n)S(t,e,{get:n[e],enumerable:!0})},q=(t,n,e,i)=>{if(n&&typeof n=="object"||typeof n=="function")for(let s of R(n))!j.call(t,s)&&s!==e&&S(t,s,{get:()=>n[s],enumerable:!(i=L(n,s))||i.enumerable});return t};var z=t=>q(S({},"__esModule",{value:!0}),t);var J={};A(J,{ContinuedFraction:()=>x,default:()=>Y});typeof BigInt>"u"&&(BigInt=function(t){if(isNaN(t))throw new Error("");return t});var u=BigInt(0),f=BigInt(1),T=BigInt(2),O=BigInt(5),y=BigInt(10),Z=2e3,o={s:f,n:u,d:f};function v(t,n){try{t=BigInt(t)}catch{throw C()}return t*n}function b(t){return typeof t=="bigint"?t:Math.floor(t)}function a(t,n){if(n===u)throw D();let e=Object.create(k.prototype);e.s=t<u?-f:f,t=t<u?-t:t;let i=B(t,n);return e.n=t/i,e.d=n/i,e}function F(t){let n={},e=t,i=T,s=O-f;for(;s<=e;){for(;e%i===u;)e/=i,n[i]=(n[i]||u)+f;s+=f+T*i++}return e!==t?e>1&&(n[e]=(n[e]||u)+f):n[t]=(n[t]||u)+f,n}var m=function(t,n){let e=u,i=f,s=f;if(t!=null)if(n!==void 0){if(typeof t=="bigint")e=t;else{if(isNaN(t))throw C();if(t%1!==0)throw _();e=BigInt(t)}if(typeof n=="bigint")i=n;else{if(isNaN(n))throw C();if(n%1!==0)throw _();i=BigInt(n)}s=e*i}else if(typeof t=="object"){if("d"in t&&"n"in t)e=BigInt(t.n),i=BigInt(t.d),"s"in t&&(e*=BigInt(t.s));else if(0 in t)e=BigInt(t[0]),1 in t&&(i=BigInt(t[1]));else if(typeof t=="bigint")e=t;else throw C();s=e*i}else if(typeof t=="number"){if(isNaN(t))throw C();if(t<0&&(s=-f,t=-t),t%1===0)e=BigInt(t);else{let r=1,l=0,d=1,g=1,h=1,w=1e7;for(t>=1&&(r=10**Math.floor(1+Math.log10(t)),t/=r);d<=w&&h<=w;){let c=(l+g)/(d+h);if(t===c){d+h<=w?(e=l+g,i=d+h):h>d?(e=g,i=h):(e=l,i=d);break}else t>c?(l+=g,d+=h):(g+=l,h+=d),d>w?(e=g,i=h):(e=l,i=d)}e=BigInt(e)*BigInt(r),i=BigInt(i)}}else if(typeof t=="string"){let r=0,l=u,d=u,g=u,h=f,w=f,c=t.replace(/_/g,"").match(/\d+|./g);if(c===null)throw C();if(c[r]==="-"?(s=-f,r++):c[r]==="+"&&r++,c.length===r+1?d=v(c[r++],s):c[r+1]==="."||c[r]==="."?(c[r]!=="."&&(l=v(c[r++],s)),r++,(r+1===c.length||c[r+1]==="("&&c[r+3]===")"||c[r+1]==="'"&&c[r+3]==="'")&&(d=v(c[r],s),h=y**BigInt(c[r].length),r++),(c[r]==="("&&c[r+2]===")"||c[r]==="'"&&c[r+2]==="'")&&(g=v(c[r+1],s),w=y**BigInt(c[r+1].length)-f,r+=3)):c[r+1]==="/"||c[r+1]===":"?(d=v(c[r],s),h=v(c[r+2],f),r+=3):c[r+3]==="/"&&c[r+1]===" "&&(l=v(c[r],s),d=v(c[r+2],s),h=v(c[r+4],f),r+=5),c.length<=r)i=h*w,s=e=g+i*l+w*d;else throw C()}else if(typeof t=="bigint")e=t,s=t,i=f;else throw C();if(i===u)throw D();o.s=s<u?-f:f,o.n=e<u?-e:e,o.d=i<u?-i:i};function H(t,n,e){let i=f;for(;n>u;t=t*t%e,n>>=f)n&f&&(i=i*t%e);return i}function U(t,n){for(;n%T===u;n/=T);for(;n%O===u;n/=O);if(n===f)return u;let e=y%n,i=1;for(;e!==f;i++)if(e=e*y%n,i>Z)return u;return BigInt(i)}function W(t,n,e){let i=f,s=H(y,e,n);for(let r=0;r<300;r++){if(i===s)return BigInt(r);i=i*y%n,s=s*y%n}return 0}function B(t,n){if(!t)return n;if(!n)return t;for(;;){if(t%=n,!t)return n;if(n%=t,!n)return t}}function k(t,n){if(m(t,n),this instanceof k)t=B(o.d,o.n),this.s=o.s,this.n=o.n/t,this.d=o.d/t;else return a(o.s*o.n,o.d)}var D=function(){return new Error("Division by Zero")},C=function(){return new Error("Invalid argument")},_=function(){return new Error("Parameters must be integer")};k.prototype={s:f,n:u,d:f,abs:function(){return a(this.n,this.d)},neg:function(){return a(-this.s*this.n,this.d)},add:function(t,n){return m(t,n),a(this.s*this.n*o.d+o.s*this.d*o.n,this.d*o.d)},sub:function(t,n){return m(t,n),a(this.s*this.n*o.d-o.s*this.d*o.n,this.d*o.d)},mul:function(t,n){return m(t,n),a(this.s*o.s*this.n*o.n,this.d*o.d)},div:function(t,n){return m(t,n),a(this.s*o.s*this.n*o.d,this.d*o.n)},clone:function(){return a(this.s*this.n,this.d)},mod:function(t,n){if(t===void 0)return a(this.s*this.n%this.d,f);if(m(t,n),u===o.n*this.d)throw D();return a(this.s*(o.d*this.n)%(o.n*this.d),o.d*this.d)},gcd:function(t,n){return m(t,n),a(B(o.n,this.n)*B(o.d,this.d),o.d*this.d)},lcm:function(t,n){return m(t,n),o.n===u&&this.n===u?a(u,f):a(o.n*this.n,B(o.n,this.n)*B(o.d,this.d))},inverse:function(){return a(this.s*this.d,this.n)},pow:function(t,n){if(m(t,n),o.d===f)return o.s<u?a((this.s*this.d)**o.n,this.n**o.n):a((this.s*this.n)**o.n,this.d**o.n);if(this.s<u)return null;let e=F(this.n),i=F(this.d),s=f,r=f;for(let l in e)if(l!=="1"){if(l==="0"){s=u;break}if(e[l]*=o.n,e[l]%o.d===u)e[l]/=o.d;else return null;s*=BigInt(l)**e[l]}for(let l in i)if(l!=="1"){if(i[l]*=o.n,i[l]%o.d===u)i[l]/=o.d;else return null;r*=BigInt(l)**i[l]}return o.s<u?a(r,s):a(s,r)},log:function(t,n){if(m(t,n),this.s<=u||o.s<=u)return null;let e={},i=F(o.n),s=F(o.d),r=F(this.n),l=F(this.d);for(let h in s)i[h]=(i[h]||u)-s[h];for(let h in l)r[h]=(r[h]||u)-l[h];for(let h in i)h!=="1"&&(e[h]=!0);for(let h in r)h!=="1"&&(e[h]=!0);let d=null,g=null;for(let h in e){let w=i[h]||u,c=r[h]||u;if(w===u){if(c!==u)return null;continue}let N=c,E=w,G=B(N,E);if(N/=G,E/=G,d===null&&g===null)d=N,g=E;else if(N*g!==d*E)return null}return d!==null&&g!==null?a(d,g):null},equals:function(t,n){return m(t,n),this.s*this.n*o.d===o.s*o.n*this.d},lt:function(t,n){return m(t,n),this.s*this.n*o.d<o.s*o.n*this.d},lte:function(t,n){return m(t,n),this.s*this.n*o.d<=o.s*o.n*this.d},gt:function(t,n){return m(t,n),this.s*this.n*o.d>o.s*o.n*this.d},gte:function(t,n){return m(t,n),this.s*this.n*o.d>=o.s*o.n*this.d},compare:function(t,n){m(t,n);let e=this.s*this.n*o.d-o.s*o.n*this.d;return(u<e)-(e<u)},ceil:function(t){return t=y**BigInt(t||0),a(b(this.s*t*this.n/this.d)+(t*this.n%this.d>u&&this.s>=u?f:u),t)},floor:function(t){return t=y**BigInt(t||0),a(b(this.s*t*this.n/this.d)-(t*this.n%this.d>u&&this.s<u?f:u),t)},round:function(t){return t=y**BigInt(t||0),a(b(this.s*t*this.n/this.d)+this.s*((this.s>=u?f:u)+T*(t*this.n%this.d)>this.d?f:u),t)},roundTo:function(t,n){m(t,n);let e=this.n*o.d,i=this.d*o.n,s=e%i,r=b(e/i);return s+s>=i&&r++,a(this.s*r*o.n,o.d)},divisible:function(t,n){return m(t,n),!(!(o.n*this.d)||this.n*o.d%(o.n*this.d))},valueOf:function(){return Number(this.s*this.n)/Number(this.d)},toString:function(t){let n=this.n,e=this.d;t=t||15;let i=U(n,e),s=W(n,e,i),r=this.s<u?"-":"";if(r+=b(n/e),n%=e,n*=y,n&&(r+="."),i){for(let l=s;l--;)r+=b(n/e),n%=e,n*=y;r+="(";for(let l=i;l--;)r+=b(n/e),n%=e,n*=y;r+=")"}else for(let l=t;n&&l--;)r+=b(n/e),n%=e,n*=y;return r},toFraction:function(t){let n=this.n,e=this.d,i=this.s<u?"-":"";if(e===f)i+=n;else{let s=b(n/e);t&&s>u&&(i+=s,i+=" ",n%=e),i+=n,i+="/",i+=e}return i},toLatex:function(t){let n=this.n,e=this.d,i=this.s<u?"-":"";if(e===f)i+=n;else{let s=b(n/e);t&&s>u&&(i+=s,n%=e),i+="\\frac{",i+=n,i+="}{",i+=e,i+="}"}return i},toContinued:function(){let t=this.n,n=this.d,e=[];do{e.push(b(t/n));let i=t%n;t=n,n=i}while(t!==f);return e},simplify:function(t){let n=BigInt(1/(t||.001)|0),e=this.abs(),i=e.toContinued();for(let s=1;s<i.length;s++){let r=a(i[s-1],f);for(let d=s-2;d>=0;d--)r=r.inverse().add(i[d]);let l=r.sub(e);if(l.n*n<l.d)return r.mul(this.s)}return this}};/**
+ * @license ContinuedFraction.js v0.1.0
+ * https://github.com/rawify/ContinuedFraction.js
+ *
+ * Copyright (c) 2026, Robert Eisele (https://raw.org/)
+ * Licensed under the MIT license.
+ **/var I=k;function M(t){return typeof t=="function"?t():t}function P(t){return typeof t=="object"&&t!==null&&"a"in t?t.a:t}function X(t){return typeof t=="object"&&t!==null&&"b"in t?t.b:1}function V(t){if(!Number.isSafeInteger(t)||t<0)throw new RangeError("steps must be a non-negative safe integer")}var x=class t{constructor(){throw new TypeError("ContinuedFraction is a static class")}static*sqrt(n){if(!Number.isSafeInteger(n)||n<0)throw new RangeError("N must be a non-negative safe integer");let e=Math.floor(Math.sqrt(n));if(yield e,e*e===n)return;let i=0,s=1,r=e;for(;;)i=r*s-i,s=(n-i*i)/s,r=Math.floor((e+i)/s),yield r}static*fromNumber(n){yield*I(n).toContinued()}static*fromFraction(n,e){yield*(e===void 0?I(n):I(n).div(I(e))).toContinued()}static*fromTerms(n){yield*n}static*PHI(){for(;;)yield 1}static*FOUR_OVER_PI(){yield{a:1,b:0};for(let n=1;;n++)yield{a:2,b:(n*2-1)**2}}static*PI(){yield{a:3,b:0};for(let n=1;;n++)yield{a:6,b:(n*2-1)**2}}static*E(){yield 2;for(let n=1;;n++)yield 1,yield 2*n,yield 1}static toArray(n,e=10){V(e);let i=M(n),s=[];for(;s.length<e;){let r=i.next();if(r.done)break;s.push(r.value)}return s}static*convergents(n){let e=M(n),i=e.next();if(i.done)return;let s=I(P(i.value)),r=I(1),l=I(1),d=I(0);for(yield s.div(r);;){let g=e.next();if(g.done)return;let h=I(P(g.value)),w=I(X(g.value));[l,s]=[s,h.mul(s).add(w.mul(l))],[d,r]=[r,h.mul(r).add(w.mul(d))],yield s.div(r)}}static eval(n,e=10){if(V(e),e===0)return I(0);let i=I(0),s=0;for(let r of t.convergents(n))if(i=r,s++,s===e)break;return i}},Y=x;return z(J);})();
+globalThis.ContinuedFraction = ContinuedFractionExports.default;