@johnhenry/math 0.0.0

package/dist/GroupTheory.js

@@ -0,0 +1,194 @@
+import { Permutation } from "./Permutation.js";
+const contains = (arr, x, eq) => arr.some((y) => eq(x, y));
+export class GroupTheory {
+    /** The Cayley (multiplication) table: `table[i][j] = op(elements[i], elements[j])`. */
+    static cayleyTable(elements, op) {
+        return elements.map((a) => elements.map((b) => op(a, b)));
+    }
+    /** True when the set is closed under `op`. */
+    static isClosed(elements, op, eq) {
+        for (const a of elements)
+            for (const b of elements)
+                if (!contains(elements, op(a, b), eq))
+                    return false;
+        return true;
+    }
+    /** The identity element, or `null` if none exists. */
+    static findIdentity(elements, op, eq) {
+        for (const e of elements) {
+            if (elements.every((a) => eq(op(e, a), a) && eq(op(a, e), a)))
+                return e;
+        }
+        return null;
+    }
+    /** True when `op` is associative over the set (O(n³) check). */
+    static isAssociative(elements, op, eq) {
+        for (const a of elements)
+            for (const b of elements)
+                for (const c of elements)
+                    if (!eq(op(op(a, b), c), op(a, op(b, c))))
+                        return false;
+        return true;
+    }
+    /** True when every element has an inverse relative to `identity`. */
+    static hasInverses(elements, op, eq, identity) {
+        return elements.every((a) => elements.some((b) => eq(op(a, b), identity) && eq(op(b, a), identity)));
+    }
+    /** Verify all four group axioms (closure, associativity, identity, inverses). */
+    static isGroup(elements, op, eq) {
+        if (!GroupTheory.isClosed(elements, op, eq))
+            return false;
+        const id = GroupTheory.findIdentity(elements, op, eq);
+        if (id === null)
+            return false;
+        return GroupTheory.isAssociative(elements, op, eq) && GroupTheory.hasInverses(elements, op, eq, id);
+    }
+    /** True when the group is also abelian (commutative). */
+    static isAbelian(elements, op, eq) {
+        for (const a of elements)
+            for (const b of elements)
+                if (!eq(op(a, b), op(b, a)))
+                    return false;
+        return true;
+    }
+    /** The order of an element: the least `k ≥ 1` with `elementᵏ = identity`. */
+    static elementOrder(element, op, eq, identity, max = 100000) {
+        let acc = element;
+        for (let k = 1; k <= max; k++) {
+            if (eq(acc, identity))
+                return k;
+            acc = op(acc, element);
+        }
+        throw new Error("Element order exceeded the search bound (is the group finite?).");
+    }
+    /**
+     * The subgroup generated by `generators`: the closure of the generators (and
+     * the identity) under `op`. `identity` may be supplied when it is not itself a
+     * generator; otherwise closure alone recovers it for a finite group — except
+     * when `generators` is empty, in which case there is nothing to multiply out
+     * and `identity` must be supplied explicitly to get the trivial subgroup
+     * `[identity]` back (omitting it returns `[]`, since no identity can be
+     * discovered from zero elements and `op` alone).
+     */
+    static closure(generators, op, eq, identity, cap = 100000) {
+        const elements = [];
+        if (identity !== undefined)
+            elements.push(identity);
+        for (const g of generators)
+            if (!contains(elements, g, eq))
+                elements.push(g);
+        let changed = true;
+        while (changed) {
+            changed = false;
+            for (let i = 0; i < elements.length; i++) {
+                for (const g of generators) {
+                    const p = op(elements[i], g);
+                    if (!contains(elements, p, eq)) {
+                        elements.push(p);
+                        changed = true;
+                        if (elements.length > cap)
+                            throw new Error("Closure exceeded the size cap.");
+                    }
+                }
+            }
+        }
+        return elements;
+    }
+    /** True when `sub` is a subgroup of `group` under `op`. */
+    static isSubgroup(sub, group, op, eq) {
+        if (!sub.every((s) => contains(group, s, eq)))
+            return false;
+        return GroupTheory.isGroup(sub, op, eq);
+    }
+    /** The distinct left cosets `gH` of subgroup `H` in `group`. */
+    static leftCosets(subgroup, group, op, eq) {
+        const cosets = [];
+        const seen = [];
+        for (const g of group) {
+            if (contains(seen, g, eq))
+                continue;
+            const coset = subgroup.map((h) => op(g, h));
+            cosets.push(coset);
+            for (const c of coset)
+                if (!contains(seen, c, eq))
+                    seen.push(c);
+        }
+        return cosets;
+    }
+    /** Lagrange index `[G : H] = |G| / |H|`. */
+    static index(group, subgroup) {
+        return group.length / subgroup.length;
+    }
+    /** The orbit of `x` under a group action, given the generators and the action map. */
+    static orbit(x, generators, action, eqX, cap = 100000) {
+        const orbit = [x];
+        let changed = true;
+        while (changed) {
+            changed = false;
+            for (let i = 0; i < orbit.length; i++) {
+                for (const g of generators) {
+                    const y = action(g, orbit[i]);
+                    if (!contains(orbit, y, eqX)) {
+                        orbit.push(y);
+                        changed = true;
+                        if (orbit.length > cap)
+                            throw new Error("Orbit exceeded the size cap.");
+                    }
+                }
+            }
+        }
+        return orbit;
+    }
+    /** The cyclic group Zₙ as `{0, …, n-1}` under addition mod n. */
+    static cyclicGroup(n) {
+        return {
+            elements: Array.from({ length: n }, (_, i) => i),
+            op: (a, b) => (a + b) % n,
+            identity: 0,
+        };
+    }
+    /**
+     * The dihedral group Dₙ (order 2n): symmetries of a regular n-gon, as
+     * permutations of its n vertices `{0, …, n-1}`. n rotations `ρₖ: i ↦ (i+k)
+     * mod n` plus n reflections `σₖ: i ↦ (k-i) mod n` (reflecting through the
+     * axis fixing vertex k/2 when k is even, or the edge midpoint between
+     * ⌊k/2⌋ and ⌈k/2⌉ when k is odd). For n=3 this is exactly (element-for-
+     * element, not just isomorphic) {@link symmetricGroup}(3) — the two
+     * constructions coincide since S₃ has only 6 permutations total, matching
+     * D₃'s own order 2·3=6.
+     */
+    static dihedralGroup(n) {
+        const domain = Array.from({ length: n }, (_, i) => i);
+        const mod = (x) => ((x % n) + n) % n;
+        const rotations = Array.from({ length: n }, (_, k) => new Permutation(domain, domain.map((i) => mod(i + k))));
+        const reflections = Array.from({ length: n }, (_, k) => new Permutation(domain, domain.map((i) => mod(k - i))));
+        return [...rotations, ...reflections];
+    }
+    /**
+     * The stabilizer of `x` under a group action: the elements of `group`
+     * fixing `x`. Complements {@link orbit} — the orbit-stabilizer theorem
+     * (`|orbit(x)| · |stabilizer(x)| = |G|`) holds for any finite group action.
+     */
+    static stabilizer(x, group, action, eqX) {
+        return group.filter((g) => eqX(action(g, x), x));
+    }
+    /** The symmetric group Sₙ: every permutation of `{0, …, n-1}`. */
+    static symmetricGroup(n) {
+        const domain = Array.from({ length: n }, (_, i) => i);
+        const results = [];
+        const permute = (arr, k) => {
+            if (k === arr.length) {
+                results.push(new Permutation(domain, [...arr]));
+                return;
+            }
+            for (let i = k; i < arr.length; i++) {
+                [arr[k], arr[i]] = [arr[i], arr[k]];
+                permute(arr, k + 1);
+                [arr[k], arr[i]] = [arr[i], arr[k]];
+            }
+        };
+        permute([...domain], 0);
+        return results;
+    }
+}
+//# sourceMappingURL=GroupTheory.js.map

package/dist/GroupTheory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GroupTheory.js","sourceRoot":"","sources":["../src/GroupTheory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAa/C,MAAM,QAAQ,GAAG,CAAI,GAAiB,EAAE,CAAI,EAAE,EAAS,EAAW,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAE/F,MAAM,OAAO,WAAW;IACtB,uFAAuF;IACvF,MAAM,CAAC,WAAW,CAAI,QAAsB,EAAE,EAAY;QACxD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,8CAA8C;IAC9C,MAAM,CAAC,QAAQ,CAAI,QAAsB,EAAE,EAAY,EAAE,EAAS;QAChE,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;QACxG,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sDAAsD;IACtD,MAAM,CAAC,YAAY,CAAI,QAAsB,EAAE,EAAY,EAAE,EAAS;QACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,MAAM,CAAC,aAAa,CAAI,QAAsB,EAAE,EAAY,EAAE,EAAS;QACrE,KAAK,MAAM,CAAC,IAAI,QAAQ;YACtB,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,KAAK,MAAM,CAAC,IAAI,QAAQ;oBAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qEAAqE;IACrE,MAAM,CAAC,WAAW,CAAI,QAAsB,EAAE,EAAY,EAAE,EAAS,EAAE,QAAW;QAChF,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvG,CAAC;IAED,iFAAiF;IACjF,MAAM,CAAC,OAAO,CAAI,QAAsB,EAAE,EAAY,EAAE,EAAS;QAC/D,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1D,MAAM,EAAE,GAAG,WAAW,CAAC,YAAY,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtD,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAC9B,OAAO,WAAW,CAAC,aAAa,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACtG,CAAC;IAED,yDAAyD;IACzD,MAAM,CAAC,SAAS,CAAI,QAAsB,EAAE,EAAY,EAAE,EAAS;QACjE,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;QAC9F,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6EAA6E;IAC7E,MAAM,CAAC,YAAY,CAAI,OAAU,EAAE,EAAY,EAAE,EAAS,EAAE,QAAW,EAAE,GAAG,GAAG,MAAM;QACnF,IAAI,GAAG,GAAG,OAAO,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC;gBAAE,OAAO,CAAC,CAAC;YAChC,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACzB,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,iEAAiE,CAAC,CAAC;IACrF,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,OAAO,CAAI,UAAwB,EAAE,EAAY,EAAE,EAAS,EAAE,QAAY,EAAE,GAAG,GAAG,MAAM;QAC7F,MAAM,QAAQ,GAAQ,EAAE,CAAC;QACzB,IAAI,QAAQ,KAAK,SAAS;YAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpD,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBAC3B,MAAM,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAM,EAAE,CAAC,CAAC,CAAC;oBAClC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;wBAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACjB,OAAO,GAAG,IAAI,CAAC;wBACf,IAAI,QAAQ,CAAC,MAAM,GAAG,GAAG;4BAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;oBAC/E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,2DAA2D;IAC3D,MAAM,CAAC,UAAU,CAAI,GAAiB,EAAE,KAAmB,EAAE,EAAY,EAAE,EAAS;QAClF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC5D,OAAO,WAAW,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,gEAAgE;IAChE,MAAM,CAAC,UAAU,CAAI,QAAsB,EAAE,KAAmB,EAAE,EAAY,EAAE,EAAS;QACvF,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAE,SAAS;YACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,4CAA4C;IAC5C,MAAM,CAAC,KAAK,CAAI,KAAmB,EAAE,QAAsB;QACzD,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IACxC,CAAC;IAED,sFAAsF;IACtF,MAAM,CAAC,KAAK,CAAO,CAAI,EAAE,UAAwB,EAAE,MAAyB,EAAE,GAAU,EAAE,GAAG,GAAG,MAAM;QACpG,MAAM,KAAK,GAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAM,CAAC,CAAC;oBACnC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;wBAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACd,OAAO,GAAG,IAAI,CAAC;wBACf,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG;4BAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;oBAC1E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iEAAiE;IACjE,MAAM,CAAC,WAAW,CAAC,CAAS;QAC1B,OAAO;YACL,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAChD,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;YACzB,QAAQ,EAAE,CAAC;SACZ,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,aAAa,CAAC,CAAS;QAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAC1B,EAAE,MAAM,EAAE,CAAC,EAAE,EACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,WAAW,CACb,MAAM,EACN,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAC9B,CACJ,CAAC;QACF,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAC5B,EAAE,MAAM,EAAE,CAAC,EAAE,EACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,WAAW,CACb,MAAM,EACN,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAC9B,CACJ,CAAC;QACF,OAAO,CAAC,GAAG,SAAS,EAAE,GAAG,WAAW,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAO,CAAI,EAAE,KAAmB,EAAE,MAAyB,EAAE,GAAU;QACtF,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,kEAAkE;IAClE,MAAM,CAAC,cAAc,CAAC,CAAS;QAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,OAAO,GAA+B,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,CAAC,GAAa,EAAE,CAAS,EAAE,EAAE;YAC3C,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChD,OAAO;YACT,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC,CAAC;QACF,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/IntUtils.d.ts

@@ -0,0 +1,33 @@
+/**
+ * IntUtils — convert integers (and numeric strings) into English words.
+ *
+ * Ported from Mallory's ActionScript `IntUtils`. The peculiar comma-joined
+ * grouping of the original output is preserved so behaviour is unchanged, but
+ * two spelling bugs are fixed: "fourty" → "forty" and "ninty" → "ninety".
+ *
+ * Passing a string lets you exceed JS's safe-integer range, exactly as the AS3
+ * version did to sidestep ActionScript's number limits.
+ */
+export declare class IntUtils {
+    private static readonly ONES;
+    private static readonly TENS;
+    /** Accepted group suffixes (units, thousands, millions, …). */
+    static readonly ActualNames: string[];
+    /** Whimsical fall-back names once the real ones run out. */
+    static readonly FakeNames: string[];
+    private static toInt;
+    /** Words for the last three digits (0–999) of a number. */
+    static toWordsTriple(num?: number): string;
+    /** Suffix for the group at `index` (0 = units, 1 = thousands, …). */
+    static numberGroupNames(index?: number): string;
+    /** Convert an integer (or its string form) to English words. */
+    static toWords(num: number | string): string;
+    private static readonly ORDINAL_IRREGULARS;
+    /** Ordinal words: "twenty-first", "one-hundredth", "twentieth", "eighth", … */
+    static toWordsOrdinal(num: number | string): string;
+    /** Ordinal words with a leading "one-" stripped ("one-hundredth" → "hundredth"). */
+    static toWordsOrdinalLazy(num: number | string): string;
+    /** Convert a decimal number (or string) to English words. */
+    static toWordsDecimal(num: number | string): string | null;
+}
+//# sourceMappingURL=IntUtils.d.ts.map

package/dist/IntUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IntUtils.d.ts","sourceRoot":"","sources":["../src/IntUtils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,qBAAa,QAAQ;IACnB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAqB1B;IAGF,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAS1B;IAEF,+DAA+D;IAC/D,MAAM,CAAC,QAAQ,CAAC,WAAW,WAazB;IAEF,4DAA4D;IAC5D,MAAM,CAAC,QAAQ,CAAC,SAAS,WAAqD;IAE9E,OAAO,CAAC,MAAM,CAAC,KAAK;IAKpB,2DAA2D;IAC3D,MAAM,CAAC,aAAa,CAAC,GAAG,SAAI,GAAG,MAAM;IA0BrC,qEAAqE;IACrE,MAAM,CAAC,gBAAgB,CAAC,KAAK,SAAI,GAAG,MAAM;IAM1C,gEAAgE;IAChE,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAqC5C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,kBAAkB,CASxC;IAEF,+EAA+E;IAC/E,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAenD,oFAAoF;IACpF,MAAM,CAAC,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAMvD,6DAA6D;IAC7D,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI;CAsB3D"}

package/dist/IntUtils.js

@@ -0,0 +1,185 @@
+/**
+ * IntUtils — convert integers (and numeric strings) into English words.
+ *
+ * Ported from Mallory's ActionScript `IntUtils`. The peculiar comma-joined
+ * grouping of the original output is preserved so behaviour is unchanged, but
+ * two spelling bugs are fixed: "fourty" → "forty" and "ninty" → "ninety".
+ *
+ * Passing a string lets you exceed JS's safe-integer range, exactly as the AS3
+ * version did to sidestep ActionScript's number limits.
+ */
+export class IntUtils {
+    static ONES = [
+        "zero",
+        "one",
+        "two",
+        "three",
+        "four",
+        "five",
+        "six",
+        "seven",
+        "eight",
+        "nine",
+        "ten",
+        "eleven",
+        "twelve",
+        "thirteen",
+        "fourteen",
+        "fifteen",
+        "sixteen",
+        "seventeen",
+        "eighteen",
+        "nineteen",
+    ];
+    // index 2..9 => tens words (forty/ninety fixed from AS3 "fourty"/"ninty").
+    static TENS = {
+        2: "twenty",
+        3: "thirty",
+        4: "forty",
+        5: "fifty",
+        6: "sixty",
+        7: "seventy",
+        8: "eighty",
+        9: "ninety",
+    };
+    /** Accepted group suffixes (units, thousands, millions, …). */
+    static ActualNames = [
+        "",
+        "-thousand",
+        "-million",
+        "-billion",
+        "-trillion",
+        "-quadrillion",
+        "-quintillion",
+        "-sextillion",
+        "-septillion",
+        "-octillion",
+        "-nonillion",
+        "-decillion",
+    ];
+    /** Whimsical fall-back names once the real ones run out. */
+    static FakeNames = ["ZILLION!!!", "-BAJILLION!!!", "-AGAZILLION!!!"];
+    static toInt(s) {
+        const n = Number.parseInt(s, 10);
+        return Number.isNaN(n) ? 0 : n;
+    }
+    /** Words for the last three digits (0–999) of a number. */
+    static toWordsTriple(num = 0) {
+        if (num < 20)
+            return IntUtils.ONES[num] ?? "";
+        const numString = num.toString();
+        const lowerPlace = IntUtils.toInt(numString.charAt(numString.length - 1));
+        const tensPlace = IntUtils.toInt(numString.charAt(numString.length - 2));
+        let intString = "";
+        if (lowerPlace !== 0) {
+            const tens = IntUtils.TENS[tensPlace];
+            if (tens)
+                intString = `${tens}-${IntUtils.toWordsTriple(lowerPlace)}`;
+        }
+        else {
+            intString = IntUtils.TENS[tensPlace] ?? "";
+        }
+        if (num < 100)
+            return intString;
+        const lastTwo = IntUtils.toInt(`${tensPlace}${lowerPlace}`);
+        const hundredsPlace = IntUtils.toInt(numString.charAt(numString.length - 3));
+        if (lastTwo !== 0) {
+            return `${IntUtils.toWordsTriple(hundredsPlace)}-hundred-${IntUtils.toWordsTriple(lastTwo)}`;
+        }
+        return `${IntUtils.toWordsTriple(hundredsPlace)}-hundred`;
+    }
+    /** Suffix for the group at `index` (0 = units, 1 = thousands, …). */
+    static numberGroupNames(index = 0) {
+        return index < IntUtils.ActualNames.length
+            ? IntUtils.ActualNames[index]
+            : IntUtils.FakeNames[0];
+    }
+    /** Convert an integer (or its string form) to English words. */
+    static toWords(num) {
+        let negative = false;
+        let value = num;
+        if (typeof value === "string") {
+            if (value.charAt(0) === "-") {
+                negative = true;
+                value = value.substring(1);
+            }
+        }
+        else if (value < 0) {
+            negative = true;
+            value = value * -1;
+        }
+        let numString = value.toString().split(",").join("");
+        const groups = [];
+        while (numString.length > 0) {
+            const take = numString.length > 2 ? 3 : numString.length > 1 ? 2 : 1;
+            groups.unshift(IntUtils.toInt(numString.substring(numString.length - take)));
+            numString = numString.substr(0, numString.length - take);
+        }
+        if (groups.length === 1) {
+            const single = IntUtils.toWordsTriple(groups[0]);
+            return negative ? `negative ${single}` : single;
+        }
+        const parts = groups
+            .map((g, i) => (g === 0 ? null : IntUtils.toWordsTriple(g) + IntUtils.numberGroupNames(groups.length - i - 1)))
+            .filter((p) => p !== null);
+        const joined = parts.join(",");
+        return negative ? `negative ${joined}` : joined;
+    }
+    // Irregular ordinal suffixes for the last word of a words-string (one..twelve
+    // don't all follow the plain "+th" rule: eight/nine/twelve drop a letter).
+    static ORDINAL_IRREGULARS = {
+        one: "first",
+        two: "second",
+        three: "third",
+        four: "fourth",
+        five: "fifth",
+        eight: "eighth",
+        nine: "ninth",
+        twelve: "twelfth",
+    };
+    /** Ordinal words: "twenty-first", "one-hundredth", "twentieth", "eighth", … */
+    static toWordsOrdinal(num) {
+        const originalString = IntUtils.toWords(num);
+        const lastHyphen = originalString.lastIndexOf("-");
+        const prefix = lastHyphen === -1 ? "" : originalString.substring(0, lastHyphen + 1);
+        const lastWord = lastHyphen === -1 ? originalString : originalString.substring(lastHyphen + 1);
+        const irregular = IntUtils.ORDINAL_IRREGULARS[lastWord];
+        if (irregular)
+            return `${prefix}${irregular}`;
+        // Tens words (twenty, thirty, … ninety) take "-ieth" in place of the "y".
+        if (lastWord.endsWith("y"))
+            return `${prefix}${lastWord.slice(0, -1)}ieth`;
+        return `${originalString}th`;
+    }
+    /** Ordinal words with a leading "one-" stripped ("one-hundredth" → "hundredth"). */
+    static toWordsOrdinalLazy(num) {
+        const ordinal = IntUtils.toWordsOrdinal(num);
+        if (ordinal.substring(0, 4) === "one-")
+            return ordinal.substring(4);
+        return ordinal;
+    }
+    /** Convert a decimal number (or string) to English words. */
+    static toWordsDecimal(num) {
+        const str = num.toString();
+        if (str.lastIndexOf(".") === -1)
+            return IntUtils.toWords(str);
+        const integer = str.split(".")[0] ?? "";
+        const decimal = str.split(".")[1] ?? "";
+        const pluralFraction = decimal.length > 0 && decimal.charAt(decimal.length - 1) !== "1";
+        let finalString;
+        if ((!integer || IntUtils.toWords(integer) === "zero") && decimal.length > 0) {
+            finalString = `${IntUtils.toWords(decimal)} ${IntUtils.toWordsOrdinalLazy(10 ** decimal.length)}`;
+        }
+        else if ((!decimal || IntUtils.toWords(decimal) === "zero") && integer.length > 0) {
+            finalString = IntUtils.toWords(integer);
+        }
+        else if (!(integer || decimal)) {
+            return null;
+        }
+        else {
+            finalString = `${IntUtils.toWords(integer)} and ${IntUtils.toWords(decimal)} ${IntUtils.toWordsOrdinalLazy(10 ** decimal.length)}`;
+        }
+        return pluralFraction ? `${finalString}s` : finalString;
+    }
+}
+//# sourceMappingURL=IntUtils.js.map

package/dist/IntUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IntUtils.js","sourceRoot":"","sources":["../src/IntUtils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,OAAO,QAAQ;IACX,MAAM,CAAU,IAAI,GAAG;QAC7B,MAAM;QACN,KAAK;QACL,KAAK;QACL,OAAO;QACP,MAAM;QACN,MAAM;QACN,KAAK;QACL,OAAO;QACP,OAAO;QACP,MAAM;QACN,KAAK;QACL,QAAQ;QACR,QAAQ;QACR,UAAU;QACV,UAAU;QACV,SAAS;QACT,SAAS;QACT,WAAW;QACX,UAAU;QACV,UAAU;KACX,CAAC;IAEF,2EAA2E;IACnE,MAAM,CAAU,IAAI,GAA2B;QACrD,CAAC,EAAE,QAAQ;QACX,CAAC,EAAE,QAAQ;QACX,CAAC,EAAE,OAAO;QACV,CAAC,EAAE,OAAO;QACV,CAAC,EAAE,OAAO;QACV,CAAC,EAAE,SAAS;QACZ,CAAC,EAAE,QAAQ;QACX,CAAC,EAAE,QAAQ;KACZ,CAAC;IAEF,+DAA+D;IAC/D,MAAM,CAAU,WAAW,GAAG;QAC5B,EAAE;QACF,WAAW;QACX,UAAU;QACV,UAAU;QACV,WAAW;QACX,cAAc;QACd,cAAc;QACd,aAAa;QACb,aAAa;QACb,YAAY;QACZ,YAAY;QACZ,YAAY;KACb,CAAC;IAEF,4DAA4D;IAC5D,MAAM,CAAU,SAAS,GAAG,CAAC,YAAY,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;IAEtE,MAAM,CAAC,KAAK,CAAC,CAAS;QAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,2DAA2D;IAC3D,MAAM,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAC1B,IAAI,GAAG,GAAG,EAAE;YAAE,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAE9C,MAAM,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;QACjC,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAEzE,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACtC,IAAI,IAAI;gBAAE,SAAS,GAAG,GAAG,IAAI,IAAI,QAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QACxE,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAC7C,CAAC;QAED,IAAI,GAAG,GAAG,GAAG;YAAE,OAAO,SAAS,CAAC;QAEhC,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,UAAU,EAAE,CAAC,CAAC;QAC5D,MAAM,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAE7E,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;YAClB,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,aAAa,CAAC,YAAY,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/F,CAAC;QACD,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,aAAa,CAAC,UAAU,CAAC;IAC5D,CAAC;IAED,qEAAqE;IACrE,MAAM,CAAC,gBAAgB,CAAC,KAAK,GAAG,CAAC;QAC/B,OAAO,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,MAAM;YACxC,CAAC,CAAE,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAY;YACzC,CAAC,CAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAY,CAAC;IACxC,CAAC;IAED,gEAAgE;IAChE,MAAM,CAAC,OAAO,CAAC,GAAoB;QACjC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,KAAK,GAAG,GAAG,CAAC;QAEhB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC5B,QAAQ,GAAG,IAAI,CAAC;gBAChB,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACrB,QAAQ,GAAG,IAAI,CAAC;YAChB,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QACrB,CAAC;QAED,IAAI,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7E,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,OAAO,QAAQ,CAAC,CAAC,CAAC,YAAY,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QAClD,CAAC;QAED,MAAM,KAAK,GAAG,MAAM;aACjB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC9G,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,OAAO,QAAQ,CAAC,CAAC,CAAC,YAAY,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAClD,CAAC;IAED,8EAA8E;IAC9E,2EAA2E;IACnE,MAAM,CAAU,kBAAkB,GAA2B;QACnE,GAAG,EAAE,OAAO;QACZ,GAAG,EAAE,QAAQ;QACb,KAAK,EAAE,OAAO;QACd,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,QAAQ;QACf,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,SAAS;KAClB,CAAC;IAEF,+EAA+E;IAC/E,MAAM,CAAC,cAAc,CAAC,GAAoB;QACxC,MAAM,cAAc,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;QACpF,MAAM,QAAQ,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAE/F,MAAM,SAAS,GAAG,QAAQ,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,SAAS;YAAE,OAAO,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC;QAE9C,0EAA0E;QAC1E,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QAE3E,OAAO,GAAG,cAAc,IAAI,CAAC;IAC/B,CAAC;IAED,oFAAoF;IACpF,MAAM,CAAC,kBAAkB,CAAC,GAAoB;QAC5C,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM;YAAE,OAAO,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,6DAA6D;IAC7D,MAAM,CAAC,cAAc,CAAC,GAAoB;QACxC,MAAM,GAAG,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAE9D,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAExC,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC;QAExF,IAAI,WAAmB,CAAC;QACxB,IAAI,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7E,WAAW,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,EAAE,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACpG,CAAC;aAAM,IAAI,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpF,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC1C,CAAC;aAAM,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,EAAE,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACrI,CAAC;QAED,OAAO,cAAc,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;IAC1D,CAAC"}

package/dist/Interval.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Interval — rigorous interval arithmetic `[lo, hi]`. Operations return an
+ * interval guaranteed to contain every result of the corresponding operation on
+ * any pair of members, so a final interval bounds the true answer despite
+ * rounding — useful for reliable numerics and error tracking. Every
+ * operation that isn't provably exact (`negate`/`abs`/`hull`/`intersect`
+ * only move or compare existing endpoints) outward-rounds its result by
+ * one ULP per side via `outward()` above.
+ */
+export declare class Interval {
+    readonly lo: number;
+    readonly hi: number;
+    constructor(lo: number, hi?: number);
+    static of(lo: number, hi: number): Interval;
+    /** A degenerate interval `[x, x]`. */
+    static point(x: number): Interval;
+    get width(): number;
+    get midpoint(): number;
+    get radius(): number;
+    contains(x: number): boolean;
+    overlaps(o: Interval): boolean;
+    add(o: Interval): Interval;
+    subtract(o: Interval): Interval;
+    /** Exact: IEEE-754 negation only flips the sign bit, no rounding. */
+    negate(): Interval;
+    multiply(o: Interval): Interval;
+    divide(o: Interval): Interval;
+    /** The tightest interval containing both (the convex hull / union). */
+    hull(o: Interval): Interval;
+    /** The overlap of two intervals, or `null` if they are disjoint. */
+    intersect(o: Interval): Interval | null;
+    abs(): Interval;
+    sqrt(): Interval;
+    exp(): Interval;
+    log(): Interval;
+    /** Integer power (handles even powers of intervals straddling zero). Exact when `n === 0` (every interval to the 0th power is the exact point 1). */
+    pow(n: number): Interval;
+    private extrema;
+    sin(): Interval;
+    cos(): Interval;
+    equals(o: Interval): boolean;
+    toString(): string;
+}
+//# sourceMappingURL=Interval.d.ts.map

package/dist/Interval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Interval.d.ts","sourceRoot":"","sources":["../src/Interval.ts"],"names":[],"mappings":"AAkCA;;;;;;;;GAQG;AACH,qBAAa,QAAQ;IACnB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;gBAER,EAAE,EAAE,MAAM,EAAE,EAAE,GAAE,MAAW;IAMvC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,QAAQ;IAI3C,sCAAsC;IACtC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ;IAIjC,IAAI,KAAK,IAAI,MAAM,CAElB;IACD,IAAI,QAAQ,IAAI,MAAM,CAErB;IACD,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAG5B,QAAQ,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAI9B,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAG1B,QAAQ,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAG/B,qEAAqE;IACrE,MAAM,IAAI,QAAQ;IAIlB,QAAQ,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAK/B,MAAM,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAU7B,uEAAuE;IACvE,IAAI,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAI3B,oEAAoE;IACpE,SAAS,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,IAAI;IAMvC,GAAG,IAAI,QAAQ;IAMf,IAAI,IAAI,QAAQ;IAIhB,GAAG,IAAI,QAAQ;IAGf,GAAG,IAAI,QAAQ;IAKf,qJAAqJ;IACrJ,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ;IASxB,OAAO,CAAC,OAAO;IASf,GAAG,IAAI,QAAQ;IAIf,GAAG,IAAI,QAAQ;IAKf,MAAM,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO;IAI5B,QAAQ,IAAI,MAAM;CAGnB"}

package/dist/Interval.js

@@ -0,0 +1,165 @@
+const F64 = new Float64Array(1);
+const U64 = new BigUint64Array(F64.buffer);
+/** The next representable double strictly greater than `value` (IEEE-754 nextafter toward +Infinity) -- JS has no built-in `Math.nextafter`, so this steps the raw 64-bit pattern by one ULP via a shared scratch buffer. */
+function nextUp(value) {
+    if (Number.isNaN(value) || value === Infinity)
+        return value;
+    if (value === 0)
+        return Number.MIN_VALUE;
+    F64[0] = value;
+    U64[0] = U64[0] + (value > 0 ? 1n : -1n);
+    return F64[0];
+}
+/** The next representable double strictly less than `value` -- `-nextUp(-value)`, since stepping toward -Infinity from `x` is the mirror of stepping toward +Infinity from `-x`. */
+function nextDown(value) {
+    return -nextUp(-value);
+}
+/**
+ * Widens `x` by one ULP on each side -- the outward-rounding every non-exact
+ * `Interval` operation below applies to its result. `Math.*` computes to
+ * the *nearest* representable double (`Math.sqrt` is correctly rounded to
+ * 0.5 ULP per IEEE-754; the other transcendentals/arithmetic are within
+ * ~1 ULP on every mainstream engine), which breaks the containment
+ * guarantee interval arithmetic exists to provide: `Interval.point(2).sqrt()`
+ * would otherwise return a degenerate `[s, s]` that provably does NOT
+ * contain the irrational `sqrt(2)`. One ULP of outward slack restores
+ * rigor, at the cost of a deliberately loose bound when a result happens
+ * to be exactly representable (e.g. `sqrt(4)` reports a width-2-ULP
+ * interval around 2 instead of the point `[2, 2]`).
+ */
+function outward(x) {
+    return new Interval(nextDown(x.lo), nextUp(x.hi));
+}
+/**
+ * Interval — rigorous interval arithmetic `[lo, hi]`. Operations return an
+ * interval guaranteed to contain every result of the corresponding operation on
+ * any pair of members, so a final interval bounds the true answer despite
+ * rounding — useful for reliable numerics and error tracking. Every
+ * operation that isn't provably exact (`negate`/`abs`/`hull`/`intersect`
+ * only move or compare existing endpoints) outward-rounds its result by
+ * one ULP per side via `outward()` above.
+ */
+export class Interval {
+    lo;
+    hi;
+    constructor(lo, hi = lo) {
+        if (lo > hi)
+            throw new Error(`Invalid interval: [${lo}, ${hi}]`);
+        this.lo = lo;
+        this.hi = hi;
+    }
+    static of(lo, hi) {
+        return new Interval(lo, hi);
+    }
+    /** A degenerate interval `[x, x]`. */
+    static point(x) {
+        return new Interval(x, x);
+    }
+    get width() {
+        return this.hi - this.lo;
+    }
+    get midpoint() {
+        return (this.lo + this.hi) / 2;
+    }
+    get radius() {
+        return this.width / 2;
+    }
+    contains(x) {
+        return this.lo <= x && x <= this.hi;
+    }
+    overlaps(o) {
+        return this.lo <= o.hi && o.lo <= this.hi;
+    }
+    add(o) {
+        return outward(new Interval(this.lo + o.lo, this.hi + o.hi));
+    }
+    subtract(o) {
+        return outward(new Interval(this.lo - o.hi, this.hi - o.lo));
+    }
+    /** Exact: IEEE-754 negation only flips the sign bit, no rounding. */
+    negate() {
+        return new Interval(-this.hi, -this.lo);
+    }
+    multiply(o) {
+        const p = [this.lo * o.lo, this.lo * o.hi, this.hi * o.lo, this.hi * o.hi];
+        return outward(new Interval(Math.min(...p), Math.max(...p)));
+    }
+    divide(o) {
+        if (o.contains(0))
+            throw new Error("Interval division by an interval containing zero.");
+        // The reciprocal bounds are themselves a rounded operation -- outward
+        // it before feeding into `multiply` (which outward-rounds its own
+        // result too), so neither step's rounding can silently eat the other's
+        // slack.
+        const reciprocal = outward(new Interval(1 / o.hi, 1 / o.lo));
+        return this.multiply(reciprocal);
+    }
+    /** The tightest interval containing both (the convex hull / union). */
+    hull(o) {
+        return new Interval(Math.min(this.lo, o.lo), Math.max(this.hi, o.hi));
+    }
+    /** The overlap of two intervals, or `null` if they are disjoint. */
+    intersect(o) {
+        const lo = Math.max(this.lo, o.lo);
+        const hi = Math.min(this.hi, o.hi);
+        return lo <= hi ? new Interval(lo, hi) : null;
+    }
+    abs() {
+        if (this.lo >= 0)
+            return this;
+        if (this.hi <= 0)
+            return this.negate();
+        return new Interval(0, Math.max(-this.lo, this.hi));
+    }
+    sqrt() {
+        if (this.lo < 0)
+            throw new Error("sqrt of an interval with negative values.");
+        return outward(new Interval(Math.sqrt(this.lo), Math.sqrt(this.hi)));
+    }
+    exp() {
+        return outward(new Interval(Math.exp(this.lo), Math.exp(this.hi)));
+    }
+    log() {
+        if (this.lo <= 0)
+            throw new Error("log of an interval with non-positive values.");
+        return outward(new Interval(Math.log(this.lo), Math.log(this.hi)));
+    }
+    /** Integer power (handles even powers of intervals straddling zero). Exact when `n === 0` (every interval to the 0th power is the exact point 1). */
+    pow(n) {
+        if (!Number.isInteger(n) || n < 0)
+            throw new Error("Interval.pow requires a non-negative integer.");
+        if (n === 0)
+            return Interval.point(1);
+        const a = this.lo ** n;
+        const b = this.hi ** n;
+        if (n % 2 === 0 && this.contains(0))
+            return outward(new Interval(0, Math.max(a, b)));
+        return outward(new Interval(Math.min(a, b), Math.max(a, b)));
+    }
+    extrema(f, criticalPeriodStart, period) {
+        const candidates = [f(this.lo), f(this.hi)];
+        // include critical points of the form `criticalPeriodStart + k·period` in range
+        const kStart = Math.ceil((this.lo - criticalPeriodStart) / period);
+        const kEnd = Math.floor((this.hi - criticalPeriodStart) / period);
+        for (let k = kStart; k <= kEnd; k++)
+            candidates.push(f(criticalPeriodStart + k * period));
+        return outward(new Interval(Math.min(...candidates), Math.max(...candidates)));
+    }
+    sin() {
+        if (this.width >= 2 * Math.PI)
+            return new Interval(-1, 1);
+        return this.extrema(Math.sin, Math.PI / 2, Math.PI);
+    }
+    cos() {
+        if (this.width >= 2 * Math.PI)
+            return new Interval(-1, 1);
+        return this.extrema(Math.cos, 0, Math.PI);
+    }
+    equals(o) {
+        return this.lo === o.lo && this.hi === o.hi;
+    }
+    toString() {
+        return `[${this.lo}, ${this.hi}]`;
+    }
+}
+//# sourceMappingURL=Interval.js.map