nerdamer 2.0.0-rc.1 → 2.0.0

package/output/algebra/algorithms/rational.d.ts

@@ -1,17 +0,0 @@
-export type Rat = {
-    n: bigint;
-    d: bigint;
-};
-export declare function ratNorm(r: Rat): Rat;
-export declare function rat(n: bigint, d?: bigint): Rat;
-export declare function ratAdd(a: Rat, b: Rat): Rat;
-export declare function ratSub(a: Rat, b: Rat): Rat;
-export declare function ratMul(a: Rat, b: Rat): Rat;
-export declare function ratDiv(a: Rat, b: Rat): Rat;
-export declare function ratToInt(r: Rat): bigint | null;
-export declare function uniAddRat(a: Rat[], b: Rat[]): Rat[];
-export declare function uniMulRat(a: Rat[], b: Rat[]): Rat[];
-export declare function interpolateUnivariateRat(points: Array<{
-    x: bigint;
-    y: Rat;
-}>): Rat[];

package/output/algebra/algorithms/rational.js

@@ -1,115 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ratNorm = ratNorm;
-exports.rat = rat;
-exports.ratAdd = ratAdd;
-exports.ratSub = ratSub;
-exports.ratMul = ratMul;
-exports.ratDiv = ratDiv;
-exports.ratToInt = ratToInt;
-exports.uniAddRat = uniAddRat;
-exports.uniMulRat = uniMulRat;
-exports.interpolateUnivariateRat = interpolateUnivariateRat;
-const arith_1 = require("./arith");
-function ratNorm(r) {
-    if (r.d === 0n) {
-        throw new Error('Rat: division by zero');
-    }
-    if (r.n === 0n) {
-        return { n: 0n, d: 1n };
-    }
-    let n = r.n;
-    let d = r.d;
-    if (d < 0n) {
-        n = -n;
-        d = -d;
-    }
-    const g0 = (0, arith_1.gcd)(n, d);
-    return { n: n / g0, d: d / g0 };
-}
-function rat(n, d = 1n) {
-    return ratNorm({ n, d });
-}
-function ratAdd(a, b) {
-    return ratNorm({ n: a.n * b.d + b.n * a.d, d: a.d * b.d });
-}
-function ratSub(a, b) {
-    return ratNorm({ n: a.n * b.d - b.n * a.d, d: a.d * b.d });
-}
-function ratMul(a, b) {
-    return ratNorm({ n: a.n * b.n, d: a.d * b.d });
-}
-function ratDiv(a, b) {
-    if (b.n === 0n) {
-        throw new Error('Rat: divide by zero');
-    }
-    return ratNorm({ n: a.n * b.d, d: a.d * b.n });
-}
-function ratToInt(r) {
-    return r.d === 1n ? r.n : null;
-}
-function uniAddRat(a, b) {
-    const len = Math.max(a.length, b.length);
-    const out = new Array(len).fill(0).map(() => rat(0n));
-    for (let i = 0; i < len; i++) {
-        out[i] = ratAdd(a[i] ?? rat(0n), b[i] ?? rat(0n));
-    }
-    while (out.length > 1 && out[out.length - 1].n === 0n) {
-        out.pop();
-    }
-    return out;
-}
-function uniMulRat(a, b) {
-    const out = new Array(a.length + b.length - 1).fill(0).map(() => rat(0n));
-    for (let i = 0; i < a.length; i++) {
-        for (let j = 0; j < b.length; j++) {
-            out[i + j] = ratAdd(out[i + j], ratMul(a[i], b[j]));
-        }
-    }
-    while (out.length > 1 && out[out.length - 1].n === 0n) {
-        out.pop();
-    }
-    return out;
-}
-function interpolateUnivariateRat(points) {
-    if (points.length === 0) {
-        return [rat(0n)];
-    }
-    const byX = new Map();
-    for (const p of points) {
-        const prev = byX.get(p.x);
-        if (!prev) {
-            byX.set(p.x, p.y);
-            continue;
-        }
-        if (ratSub(prev, p.y).n !== 0n) {
-            throw new Error('interpolateUnivariateRat: duplicate x with conflicting y');
-        }
-    }
-    const uniq = [...byX.entries()]
-        .map(([x, y]) => ({ x, y }))
-        .sort((a, b) => (a.x < b.x ? -1 : a.x > b.x ? 1 : 0));
-    const n = uniq.length;
-    if (n === 1) {
-        return [uniq[0].y];
-    }
-    let poly = [rat(0n)];
-    for (let i = 0; i < n; i++) {
-        let basis = [rat(1n)];
-        let denom = rat(1n);
-        for (let j = 0; j < n; j++) {
-            if (j === i) {
-                continue;
-            }
-            basis = uniMulRat(basis, [rat(-uniq[j].x), rat(1n)]);
-            denom = ratMul(denom, rat(uniq[i].x - uniq[j].x));
-        }
-        const scale = ratDiv(uniq[i].y, denom);
-        const scaled = basis.map(c => ratMul(c, scale));
-        poly = uniAddRat(poly, scaled);
-    }
-    while (poly.length > 1 && poly[poly.length - 1].n === 0n) {
-        poly.pop();
-    }
-    return poly;
-}

package/output/core/adapters.js

@@ -1,40 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.expressionToZPoly = expressionToZPoly;
-const Expression_1 = require("./classes/expression/Expression");
-const Polynomial_1 = require("./classes/polynomial/Polynomial");
-const bigint_1 = require("./functions/bigint/bigint");
-/**
- * Extracts the Z Polynomial from Q.
- * Given a polynomial with rational coefficients, returns:
- * - zPoly: the polynomial scaled to have integer coefficients (primitive part)
- * - content: the GCD of the integer coefficients after clearing denominators
- * - denominator: the common denominator used to clear fractions
- *
- * The relationship is: original = (content / denominator) * zPoly
- *
- * @param x
- */
-function expressionToZPoly(x) {
-    x = Expression_1.Expression.create(x);
-    const p = new Polynomial_1.Polynomial(x);
-    const denominators = [];
-    for (const term of p.terms) {
-        const m = term.coeff.getMultiplier();
-        denominators.push(m.denominator);
-    }
-    // LCM of all denominators to clear fractions
-    const lcmDenom = denominators.reduce((acc, d) => (0, bigint_1.LCM)(acc, d), 1n);
-    const common = new Polynomial_1.Polynomial(Expression_1.Expression.Number(lcmDenom));
-    // Scale to integer coefficients
-    const q = p.times(common);
-    // Extract content (GCD of integer coefficients)
-    const content = new Polynomial_1.Polynomial(q.content());
-    // Get the primitive part
-    const pp = q.div(content)[0];
-    return {
-        zPoly: pp,
-        content: content,
-        denominator: common,
-    };
-}

package/output/core/classes/parser/operations/comma.d.ts

@@ -1,7 +0,0 @@
-import type { ParserStackValue } from '../types';
-/**
- * The comma is essentially a prefix operator that just returns the object.
- *
- * @param a
- */
-export declare function comma(a: ParserStackValue, b: ParserStackValue): ParserStackValue[];

package/output/core/classes/parser/operations/comma.js

@@ -1,11 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.comma = comma;
-/**
- * The comma is essentially a prefix operator that just returns the object.
- *
- * @param a
- */
-function comma(a, b) {
-    return [a, b];
-}