@johnhenry/math 0.0.0

package/dist/Clifford4Internal.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Internal Cl(4,0) geometric-algebra engine, used by {@link Vec4}, {@link Bivector4}
+ * and {@link Rotor4} to implement the geometric product, sandwich product, and
+ * exponential/logarithm maps correctly.
+ *
+ * Not exported from the package index — it is an implementation detail. Basis
+ * vectors e1..e4 are represented as bits 0..3 of a "blade" bitmask (0..15),
+ * e.g. blade 0b0011 = e1^e2, blade 0b1111 = e1^e2^e3^e4 (the pseudoscalar).
+ * Because the metric is Euclidean (e_i * e_i = +1 for every i — no negative or
+ * null basis vectors), the geometric product of two basis blades only needs a
+ * *reordering sign* (how many transpositions sort the concatenated index list
+ * into canonical order); there is no metric-signature contribution. This is
+ * the standard bitmask/blade technique used by geometric-algebra libraries
+ * (e.g. ganja.js), and is far less error-prone than hand-deriving each
+ * product formula term by term.
+ */
+export declare const BLADE_COUNT = 16;
+export type Multivector4 = Float64Array;
+export declare function mvZero(): Multivector4;
+/** Full geometric product of two multivectors: a * b. */
+export declare function geometricProductMV(a: Multivector4, b: Multivector4): Multivector4;
+/** Outer (wedge) product: nonzero only for blade pairs that share no basis vector. */
+export declare function wedgeProductMV(a: Multivector4, b: Multivector4): Multivector4;
+export declare const E1: number;
+export declare const E2: number;
+export declare const E3: number;
+export declare const E4: number;
+export declare const E12: number;
+export declare const E13: number;
+export declare const E14: number;
+export declare const E23: number;
+export declare const E24: number;
+export declare const E34: number;
+export declare const PSEUDOSCALAR4: number;
+//# sourceMappingURL=Clifford4Internal.d.ts.map

package/dist/Clifford4Internal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Clifford4Internal.d.ts","sourceRoot":"","sources":["../src/Clifford4Internal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,eAAO,MAAM,WAAW,KAAK,CAAC;AAuB9B,MAAM,MAAM,YAAY,GAAG,YAAY,CAAC;AAExC,wBAAgB,MAAM,IAAI,YAAY,CAErC;AAED,yDAAyD;AACzD,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,YAAY,CAajF;AAED,sFAAsF;AACtF,wBAAgB,cAAc,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,YAAY,CAa7E;AAGD,eAAO,MAAM,EAAE,QAAS,CAAC;AACzB,eAAO,MAAM,EAAE,QAAS,CAAC;AACzB,eAAO,MAAM,EAAE,QAAS,CAAC;AACzB,eAAO,MAAM,EAAE,QAAS,CAAC;AACzB,eAAO,MAAM,GAAG,QAAU,CAAC;AAC3B,eAAO,MAAM,GAAG,QAAU,CAAC;AAC3B,eAAO,MAAM,GAAG,QAAU,CAAC;AAC3B,eAAO,MAAM,GAAG,QAAU,CAAC;AAC3B,eAAO,MAAM,GAAG,QAAU,CAAC;AAC3B,eAAO,MAAM,GAAG,QAAU,CAAC;AAC3B,eAAO,MAAM,aAAa,QAAoB,CAAC"}

package/dist/Clifford4Internal.js

@@ -0,0 +1,86 @@
+/**
+ * Internal Cl(4,0) geometric-algebra engine, used by {@link Vec4}, {@link Bivector4}
+ * and {@link Rotor4} to implement the geometric product, sandwich product, and
+ * exponential/logarithm maps correctly.
+ *
+ * Not exported from the package index — it is an implementation detail. Basis
+ * vectors e1..e4 are represented as bits 0..3 of a "blade" bitmask (0..15),
+ * e.g. blade 0b0011 = e1^e2, blade 0b1111 = e1^e2^e3^e4 (the pseudoscalar).
+ * Because the metric is Euclidean (e_i * e_i = +1 for every i — no negative or
+ * null basis vectors), the geometric product of two basis blades only needs a
+ * *reordering sign* (how many transpositions sort the concatenated index list
+ * into canonical order); there is no metric-signature contribution. This is
+ * the standard bitmask/blade technique used by geometric-algebra libraries
+ * (e.g. ganja.js), and is far less error-prone than hand-deriving each
+ * product formula term by term.
+ */
+export const BLADE_COUNT = 16; // 2^4 basis blades in Cl(4,0)
+function popcount(n) {
+    let count = 0;
+    let x = n;
+    while (x !== 0) {
+        count += x & 1;
+        x >>= 1;
+    }
+    return count;
+}
+/** Sign picked up reordering the concatenation of blade `a` then blade `b` into canonical order. */
+function reorderingSign(a, b) {
+    let aShifted = a >> 1;
+    let swaps = 0;
+    while (aShifted !== 0) {
+        swaps += popcount(aShifted & b);
+        aShifted >>= 1;
+    }
+    return swaps % 2 === 0 ? 1 : -1;
+}
+export function mvZero() {
+    return new Float64Array(BLADE_COUNT);
+}
+/** Full geometric product of two multivectors: a * b. */
+export function geometricProductMV(a, b) {
+    const out = mvZero();
+    for (let i = 0; i < BLADE_COUNT; i++) {
+        const ai = a[i];
+        if (!ai)
+            continue;
+        for (let j = 0; j < BLADE_COUNT; j++) {
+            const bj = b[j];
+            if (!bj)
+                continue;
+            const blade = i ^ j;
+            out[blade] += reorderingSign(i, j) * ai * bj;
+        }
+    }
+    return out;
+}
+/** Outer (wedge) product: nonzero only for blade pairs that share no basis vector. */
+export function wedgeProductMV(a, b) {
+    const out = mvZero();
+    for (let i = 0; i < BLADE_COUNT; i++) {
+        const ai = a[i];
+        if (!ai)
+            continue;
+        for (let j = 0; j < BLADE_COUNT; j++) {
+            const bj = b[j];
+            if (!bj || (i & j) !== 0)
+                continue;
+            const blade = i ^ j;
+            out[blade] += reorderingSign(i, j) * ai * bj;
+        }
+    }
+    return out;
+}
+// Basis-vector and basis-bivector blade indices.
+export const E1 = 1 << 0;
+export const E2 = 1 << 1;
+export const E3 = 1 << 2;
+export const E4 = 1 << 3;
+export const E12 = E1 | E2;
+export const E13 = E1 | E3;
+export const E14 = E1 | E4;
+export const E23 = E2 | E3;
+export const E24 = E2 | E4;
+export const E34 = E3 | E4;
+export const PSEUDOSCALAR4 = E1 | E2 | E3 | E4;
+//# sourceMappingURL=Clifford4Internal.js.map

package/dist/Clifford4Internal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Clifford4Internal.js","sourceRoot":"","sources":["../src/Clifford4Internal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAC,CAAC,8BAA8B;AAE7D,SAAS,QAAQ,CAAC,CAAS;IACzB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,CAAC,KAAK,CAAC,CAAC;IACV,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,oGAAoG;AACpG,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1C,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,QAAQ,KAAK,CAAC,EAAE,CAAC;QACtB,KAAK,IAAI,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAChC,QAAQ,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC;AAID,MAAM,UAAU,MAAM;IACpB,OAAO,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;AACvC,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,kBAAkB,CAAC,CAAe,EAAE,CAAe;IACjE,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,EAAE;YAAE,SAAS;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,EAAE;gBAAE,SAAS;YAClB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,GAAG,CAAC,KAAK,CAAC,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC/C,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,cAAc,CAAC,CAAe,EAAE,CAAe;IAC7D,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,EAAE;YAAE,SAAS;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;gBAAE,SAAS;YACnC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,GAAG,CAAC,KAAK,CAAC,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC/C,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iDAAiD;AACjD,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AACzB,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC"}

package/dist/Combinatorics.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Combinatorics — exact counting mathematics: factorials, binomial/multinomial
+ * coefficients, Catalan/Stirling/Bell numbers, integer partitions, and
+ * derangements. The natural counting-math sibling to {@link Permutation},
+ * {@link Cycle}, and {@link GroupTheory} — none of those previously had a way
+ * to just compute `nCr`.
+ *
+ * Everything here is `bigint`-based (matching {@link NumberTheory}'s
+ * convention) since factorial-scale values exceed `Number.MAX_SAFE_INTEGER`
+ * well before n reaches 20.
+ */
+import { combinations, combinationsWithReplacement, permutations, product } from "./CombinatoricsGenerators.ts";
+export declare class Combinatorics {
+    /** `n!` */
+    static factorial(n: bigint | number): bigint;
+    /** `nCk` — the number of ways to choose `k` items from `n` (order doesn't matter). */
+    static binomial(n: bigint | number, k: bigint | number): bigint;
+    /** `nPk` — the number of ordered arrangements of `k` items chosen from `n`. */
+    static permutationsCount(n: bigint | number, k: bigint | number): bigint;
+    /** `n! / (k1! · k2! · … · km!)`, the number of ways to partition `n` labeled items into groups of the given sizes. */
+    static multinomial(n: bigint | number, groupSizes: Array<bigint | number>): bigint;
+    /** The `n`th Catalan number: `C(2n, n) / (n + 1)` — counts balanced parenthesizations, binary trees, etc. */
+    static catalan(n: bigint | number): bigint;
+    /** Stirling numbers of the second kind `S(n, k)` — ways to partition an `n`-set into `k` nonempty unlabeled subsets. */
+    static stirlingSecond(n: bigint | number, k: bigint | number): bigint;
+    /** Unsigned Stirling numbers of the first kind `c(n, k)` — permutations of `n` elements with exactly `k` cycles. */
+    static stirlingFirstUnsigned(n: bigint | number, k: bigint | number): bigint;
+    /**
+     * Full row of Stirling numbers of the second kind: `S(n, j)` for every `j` from `0` to `n`,
+     * built in a single `O(n²)` DP pass (same recurrence as {@link stirlingSecond}, but computed
+     * once for all columns instead of re-running the whole table per column).
+     */
+    private static stirlingSecondRow;
+    /** The `n`th Bell number — the total number of partitions of an `n`-set (`Σₖ S(n, k)`). */
+    static bell(n: bigint | number): bigint;
+    /** The number of integer partitions of `n` (ways to write `n` as a sum of positive integers, order irrelevant). */
+    static partitionCount(n: bigint | number): bigint;
+    /** The number of derangements of `n` items (permutations with no fixed point), aka the subfactorial `!n`. */
+    static derangements(n: bigint | number): bigint;
+    /**
+     * Cartesian product of the given iterables, last varying fastest.
+     * Counting counterpart: multiply the pool sizes.
+     */
+    static product: typeof product;
+    /**
+     * `r`-length permutations of `iterable` (default `r` = pool size).
+     * Counting counterpart: {@link Combinatorics.permutationsCount}.
+     */
+    static permutations: typeof permutations;
+    /**
+     * `r`-length combinations of `iterable`, in input order.
+     * Counting counterpart: {@link Combinatorics.binomial}.
+     */
+    static combinations: typeof combinations;
+    /**
+     * `r`-length combinations of `iterable` allowing repeats.
+     * Counting counterpart: `binomial(n + r - 1, r)`.
+     */
+    static combinationsWithReplacement: typeof combinationsWithReplacement;
+}
+//# sourceMappingURL=Combinatorics.d.ts.map

package/dist/Combinatorics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Combinatorics.d.ts","sourceRoot":"","sources":["../src/Combinatorics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,2BAA2B,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAIhH,qBAAa,aAAa;IACxB,WAAW;IACX,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAQ5C,sFAAsF;IACtF,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAU/D,+EAA+E;IAC/E,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IASxE,sHAAsH;IACtH,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM;IAUlF,6GAA6G;IAC7G,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAM1C,wHAAwH;IACxH,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAiBrE,oHAAoH;IACpH,MAAM,CAAC,qBAAqB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAgB5E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAYhC,2FAA2F;IAC3F,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IASvC,mHAAmH;IACnH,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAWjD,6GAA6G;IAC7G,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAmB/C;;;OAGG;IACH,MAAM,CAAC,OAAO,iBAAW;IAEzB;;;OAGG;IACH,MAAM,CAAC,YAAY,sBAAgB;IAEnC;;;OAGG;IACH,MAAM,CAAC,YAAY,sBAAgB;IAEnC;;;OAGG;IACH,MAAM,CAAC,2BAA2B,qCAA+B;CAClE"}

package/dist/Combinatorics.js

@@ -0,0 +1,186 @@
+/**
+ * Combinatorics — exact counting mathematics: factorials, binomial/multinomial
+ * coefficients, Catalan/Stirling/Bell numbers, integer partitions, and
+ * derangements. The natural counting-math sibling to {@link Permutation},
+ * {@link Cycle}, and {@link GroupTheory} — none of those previously had a way
+ * to just compute `nCr`.
+ *
+ * Everything here is `bigint`-based (matching {@link NumberTheory}'s
+ * convention) since factorial-scale values exceed `Number.MAX_SAFE_INTEGER`
+ * well before n reaches 20.
+ */
+import { combinations, combinationsWithReplacement, permutations, product } from "./CombinatoricsGenerators.js";
+const big = (x) => (typeof x === "bigint" ? x : BigInt(x));
+export class Combinatorics {
+    /** `n!` */
+    static factorial(n) {
+        const num = big(n);
+        if (num < 0n)
+            throw new RangeError("factorial is undefined for negative numbers");
+        let result = 1n;
+        for (let i = 2n; i <= num; i++)
+            result *= i;
+        return result;
+    }
+    /** `nCk` — the number of ways to choose `k` items from `n` (order doesn't matter). */
+    static binomial(n, k) {
+        const N = big(n);
+        const K = big(k);
+        if (K < 0n || K > N)
+            return 0n;
+        const kk = K > N - K ? N - K : K; // symmetry: nCk = nC(n-k)
+        let result = 1n;
+        for (let i = 0n; i < kk; i++)
+            result = (result * (N - i)) / (i + 1n);
+        return result;
+    }
+    /** `nPk` — the number of ordered arrangements of `k` items chosen from `n`. */
+    static permutationsCount(n, k) {
+        const N = big(n);
+        const K = big(k);
+        if (K < 0n || K > N)
+            return 0n;
+        let result = 1n;
+        for (let i = 0n; i < K; i++)
+            result *= N - i;
+        return result;
+    }
+    /** `n! / (k1! · k2! · … · km!)`, the number of ways to partition `n` labeled items into groups of the given sizes. */
+    static multinomial(n, groupSizes) {
+        const N = big(n);
+        const sizes = groupSizes.map(big);
+        const sum = sizes.reduce((s, k) => s + k, 0n);
+        if (sum !== N)
+            throw new RangeError("multinomial: group sizes must sum to n");
+        let result = Combinatorics.factorial(N);
+        for (const k of sizes)
+            result /= Combinatorics.factorial(k);
+        return result;
+    }
+    /** The `n`th Catalan number: `C(2n, n) / (n + 1)` — counts balanced parenthesizations, binary trees, etc. */
+    static catalan(n) {
+        const N = big(n);
+        if (N < 0n)
+            throw new RangeError("catalan is undefined for negative numbers");
+        return Combinatorics.binomial(2n * N, N) / (N + 1n);
+    }
+    /** Stirling numbers of the second kind `S(n, k)` — ways to partition an `n`-set into `k` nonempty unlabeled subsets. */
+    static stirlingSecond(n, k) {
+        const N = Number(big(n));
+        const K = Number(big(k));
+        if (N < 0 || K < 0)
+            throw new RangeError("stirlingSecond is undefined for negative arguments");
+        if (K > N)
+            return 0n;
+        // dp[j] holds S(i, j) for the current row i, built bottom-up.
+        const dp = new Array(N + 1).fill(0n);
+        dp[0] = 1n; // S(0, 0) = 1
+        for (let i = 1; i <= N; i++) {
+            for (let j = Math.min(i, K); j >= 1; j--) {
+                dp[j] = BigInt(j) * dp[j] + dp[j - 1];
+            }
+            dp[0] = 0n; // S(i, 0) = 0 for i > 0
+        }
+        return dp[K];
+    }
+    /** Unsigned Stirling numbers of the first kind `c(n, k)` — permutations of `n` elements with exactly `k` cycles. */
+    static stirlingFirstUnsigned(n, k) {
+        const N = Number(big(n));
+        const K = Number(big(k));
+        if (N < 0 || K < 0)
+            throw new RangeError("stirlingFirstUnsigned is undefined for negative arguments");
+        if (K > N)
+            return 0n;
+        const dp = new Array(N + 1).fill(0n);
+        dp[0] = 1n; // c(0, 0) = 1
+        for (let i = 1; i <= N; i++) {
+            for (let j = Math.min(i, K); j >= 1; j--) {
+                dp[j] = BigInt(i - 1) * dp[j] + dp[j - 1];
+            }
+            dp[0] = 0n; // c(i, 0) = 0 for i > 0
+        }
+        return dp[K];
+    }
+    /**
+     * Full row of Stirling numbers of the second kind: `S(n, j)` for every `j` from `0` to `n`,
+     * built in a single `O(n²)` DP pass (same recurrence as {@link stirlingSecond}, but computed
+     * once for all columns instead of re-running the whole table per column).
+     */
+    static stirlingSecondRow(n) {
+        const dp = new Array(n + 1).fill(0n);
+        dp[0] = 1n; // S(0, 0) = 1
+        for (let i = 1; i <= n; i++) {
+            for (let j = i; j >= 1; j--) {
+                dp[j] = BigInt(j) * dp[j] + dp[j - 1];
+            }
+            dp[0] = 0n; // S(i, 0) = 0 for i > 0
+        }
+        return dp;
+    }
+    /** The `n`th Bell number — the total number of partitions of an `n`-set (`Σₖ S(n, k)`). */
+    static bell(n) {
+        const N = Number(big(n));
+        if (N < 0)
+            throw new RangeError("bell is undefined for negative numbers");
+        const row = Combinatorics.stirlingSecondRow(N);
+        let total = 0n;
+        for (let k = 0; k <= N; k++)
+            total += row[k];
+        return total;
+    }
+    /** The number of integer partitions of `n` (ways to write `n` as a sum of positive integers, order irrelevant). */
+    static partitionCount(n) {
+        const N = Number(big(n));
+        if (N < 0)
+            throw new RangeError("partitionCount is undefined for negative numbers");
+        const dp = new Array(N + 1).fill(0n);
+        dp[0] = 1n;
+        for (let part = 1; part <= N; part++) {
+            for (let total = part; total <= N; total++)
+                dp[total] += dp[total - part];
+        }
+        return dp[N];
+    }
+    /** The number of derangements of `n` items (permutations with no fixed point), aka the subfactorial `!n`. */
+    static derangements(n) {
+        const N = Number(big(n));
+        if (N < 0)
+            throw new RangeError("derangements is undefined for negative numbers");
+        if (N === 0)
+            return 1n;
+        if (N === 1)
+            return 0n;
+        let prev2 = 1n; // !0
+        let prev1 = 0n; // !1
+        for (let i = 2; i <= N; i++) {
+            const cur = BigInt(i - 1) * (prev1 + prev2);
+            prev2 = prev1;
+            prev1 = cur;
+        }
+        return prev1;
+    }
+    // ---- enumeration ---------------------------------------------------------
+    // The counting functions above answer "how many?"; these yield the objects
+    // themselves. See CombinatoricsGenerators.ts for the algorithms.
+    /**
+     * Cartesian product of the given iterables, last varying fastest.
+     * Counting counterpart: multiply the pool sizes.
+     */
+    static product = product;
+    /**
+     * `r`-length permutations of `iterable` (default `r` = pool size).
+     * Counting counterpart: {@link Combinatorics.permutationsCount}.
+     */
+    static permutations = permutations;
+    /**
+     * `r`-length combinations of `iterable`, in input order.
+     * Counting counterpart: {@link Combinatorics.binomial}.
+     */
+    static combinations = combinations;
+    /**
+     * `r`-length combinations of `iterable` allowing repeats.
+     * Counting counterpart: `binomial(n + r - 1, r)`.
+     */
+    static combinationsWithReplacement = combinationsWithReplacement;
+}
+//# sourceMappingURL=Combinatorics.js.map

package/dist/Combinatorics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Combinatorics.js","sourceRoot":"","sources":["../src/Combinatorics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,2BAA2B,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,8BAA8B,CAAC;AAEhH,MAAM,GAAG,GAAG,CAAC,CAAkB,EAAU,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAEpF,MAAM,OAAO,aAAa;IACxB,WAAW;IACX,MAAM,CAAC,SAAS,CAAC,CAAkB;QACjC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,GAAG,GAAG,EAAE;YAAE,MAAM,IAAI,UAAU,CAAC,6CAA6C,CAAC,CAAC;QAClF,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,sFAAsF;IACtF,MAAM,CAAC,QAAQ,CAAC,CAAkB,EAAE,CAAkB;QACpD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B;QAC5D,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+EAA+E;IAC/E,MAAM,CAAC,iBAAiB,CAAC,CAAkB,EAAE,CAAkB;QAC7D,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QAC/B,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,sHAAsH;IACtH,MAAM,CAAC,WAAW,CAAC,CAAkB,EAAE,UAAkC;QACvE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;QAC9E,IAAI,MAAM,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,MAAM,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5D,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,6GAA6G;IAC7G,MAAM,CAAC,OAAO,CAAC,CAAkB;QAC/B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,EAAE;YAAE,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAC;QAC9E,OAAO,aAAa,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;IAED,wHAAwH;IACxH,MAAM,CAAC,cAAc,CAAC,CAAkB,EAAE,CAAkB;QAC1D,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,oDAAoD,CAAC,CAAC;QAC/F,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QACrB,8DAA8D;QAC9D,MAAM,EAAE,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC;YACD,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,wBAAwB;QACtC,CAAC;QACD,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAED,oHAAoH;IACpH,MAAM,CAAC,qBAAqB,CAAC,CAAkB,EAAE,CAAkB;QACjE,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,2DAA2D,CAAC,CAAC;QACtG,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QACrB,MAAM,EAAE,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,wBAAwB;QACtC,CAAC;QACD,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,iBAAiB,CAAC,CAAS;QACxC,MAAM,EAAE,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,cAAc;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC;YACD,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,wBAAwB;QACtC,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,2FAA2F;IAC3F,MAAM,CAAC,IAAI,CAAC,CAAkB;QAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;QAC1E,MAAM,GAAG,GAAG,aAAa,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,GAAG,CAAC,CAAC,CAAW,CAAC;QACvD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mHAAmH;IACnH,MAAM,CAAC,cAAc,CAAC,CAAkB;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,kDAAkD,CAAC,CAAC;QACpF,MAAM,EAAE,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACX,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YACrC,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE;gBAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAED,6GAA6G;IAC7G,MAAM,CAAC,YAAY,CAAC,CAAkB;QACpC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,gDAAgD,CAAC,CAAC;QAClF,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACvB,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,KAAK;QACrB,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,KAAK;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YAC5C,KAAK,GAAG,KAAK,CAAC;YACd,KAAK,GAAG,GAAG,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6EAA6E;IAC7E,2EAA2E;IAC3E,iEAAiE;IAEjE;;;OAGG;IACH,MAAM,CAAC,OAAO,GAAG,OAAO,CAAC;IAEzB;;;OAGG;IACH,MAAM,CAAC,YAAY,GAAG,YAAY,CAAC;IAEnC;;;OAGG;IACH,MAAM,CAAC,YAAY,GAAG,YAAY,CAAC;IAEnC;;;OAGG;IACH,MAAM,CAAC,2BAA2B,GAAG,2BAA2B,CAAC"}

package/dist/CombinatoricsGenerators.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Combinatorial generators: `product`, `permutations`, `combinations`,
+ * `combinationsWithReplacement` — ports of the iterative equivalent-code
+ * algorithms documented in CPython's itertools docs (chosen over a recursive
+ * approach to avoid recursion-depth limits on large inputs).
+ *
+ * These are the **enumerating** counterpart to {@link Combinatorics}'s
+ * **counting** functions: `Combinatorics.permutationsCount(n, r)` tells you how
+ * many there are, `Combinatorics.permutations(iterable, r)` yields them. They
+ * are surfaced as static methods on {@link Combinatorics} so both faces of each
+ * concept sit together.
+ *
+ * These are inherently "materialize fully, then compute" algorithms — CPython's
+ * own docs note that `product()` completely consumes its inputs before running,
+ * so a fully lazy formulation isn't available. Pools are therefore buffered in
+ * memory; enumerating a large product is bounded by that, not by laziness.
+ *
+ * Originally written for the library now published as `@johnhenry/iteration`;
+ * moved here because enumeration is mathematics rather than stream plumbing.
+ * The async duals stayed behind — they only added a "collect the source, then
+ * run this same sync generator" wrapper, and @johnhenry/math is deliberately
+ * synchronous throughout.
+ */
+/**
+ * Cartesian product of the given iterables. Mirrors Python's
+ * itertools.product(*iterables) -- the last iterable varies fastest.
+ */
+export declare function product<T>(...iterables: Array<Iterable<T>>): Generator<T[]>;
+/**
+ * r-length permutations of `iterable` (default r = pool length). Mirrors
+ * Python's itertools.permutations(iterable, r).
+ */
+export declare function permutations<T>(iterable: Iterable<T>, r?: number): Generator<T[]>;
+/**
+ * r-length combinations of `iterable`, in sorted (input) order, without
+ * replacement. Mirrors Python's itertools.combinations(iterable, r).
+ */
+export declare function combinations<T>(iterable: Iterable<T>, r: number): Generator<T[]>;
+/**
+ * r-length combinations of `iterable`, with replacement. Mirrors Python's
+ * itertools.combinations_with_replacement(iterable, r).
+ */
+export declare function combinationsWithReplacement<T>(iterable: Iterable<T>, r: number): Generator<T[]>;
+//# sourceMappingURL=CombinatoricsGenerators.d.ts.map

package/dist/CombinatoricsGenerators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CombinatoricsGenerators.d.ts","sourceRoot":"","sources":["../src/CombinatoricsGenerators.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAkBH;;;GAGG;AACH,wBAAiB,OAAO,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAE5E;AA+BD;;;GAGG;AACH,wBAAiB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAElF;AAwBD;;;GAGG;AACH,wBAAiB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAEjF;AAwBD;;;GAGG;AACH,wBAAiB,2BAA2B,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAEhG"}

package/dist/CombinatoricsGenerators.js

@@ -0,0 +1,148 @@
+/**
+ * Combinatorial generators: `product`, `permutations`, `combinations`,
+ * `combinationsWithReplacement` — ports of the iterative equivalent-code
+ * algorithms documented in CPython's itertools docs (chosen over a recursive
+ * approach to avoid recursion-depth limits on large inputs).
+ *
+ * These are the **enumerating** counterpart to {@link Combinatorics}'s
+ * **counting** functions: `Combinatorics.permutationsCount(n, r)` tells you how
+ * many there are, `Combinatorics.permutations(iterable, r)` yields them. They
+ * are surfaced as static methods on {@link Combinatorics} so both faces of each
+ * concept sit together.
+ *
+ * These are inherently "materialize fully, then compute" algorithms — CPython's
+ * own docs note that `product()` completely consumes its inputs before running,
+ * so a fully lazy formulation isn't available. Pools are therefore buffered in
+ * memory; enumerating a large product is bounded by that, not by laziness.
+ *
+ * Originally written for the library now published as `@johnhenry/iteration`;
+ * moved here because enumeration is mathematics rather than stream plumbing.
+ * The async duals stayed behind — they only added a "collect the source, then
+ * run this same sync generator" wrapper, and @johnhenry/math is deliberately
+ * synchronous throughout.
+ */
+function* productFromPools(pools) {
+    if (pools.some((pool) => pool.length === 0))
+        return;
+    const indices = pools.map(() => 0);
+    while (true) {
+        yield pools.map((pool, i) => pool[indices[i]]);
+        let i = indices.length - 1;
+        while (i >= 0) {
+            indices[i]++;
+            if (indices[i] < pools[i].length)
+                break;
+            indices[i] = 0;
+            i--;
+        }
+        if (i < 0)
+            return;
+    }
+}
+/**
+ * Cartesian product of the given iterables. Mirrors Python's
+ * itertools.product(*iterables) -- the last iterable varies fastest.
+ */
+export function* product(...iterables) {
+    yield* productFromPools(iterables.map((it) => [...it]));
+}
+function* permutationsFromPool(pool, r) {
+    const n = pool.length;
+    if (r === undefined || r === null)
+        r = n;
+    if (r > n || r < 0)
+        return;
+    const indices = Array.from({ length: n }, (_, i) => i);
+    const cycles = Array.from({ length: r }, (_, i) => n - i);
+    yield indices.slice(0, r).map((i) => pool[i]);
+    if (n === 0)
+        return;
+    outer: while (true) {
+        for (let i = r - 1; i >= 0; i--) {
+            cycles[i] -= 1;
+            if (cycles[i] === 0) {
+                const tail = indices.slice(i + 1).concat(indices.slice(i, i + 1));
+                indices.splice(i, indices.length - i, ...tail);
+                cycles[i] = n - i;
+            }
+            else {
+                const j = cycles[i];
+                const a = indices[i];
+                const b = indices[n - j];
+                indices[i] = b;
+                indices[n - j] = a;
+                yield indices.slice(0, r).map((idx) => pool[idx]);
+                continue outer;
+            }
+        }
+        return;
+    }
+}
+/**
+ * r-length permutations of `iterable` (default r = pool length). Mirrors
+ * Python's itertools.permutations(iterable, r).
+ */
+export function* permutations(iterable, r) {
+    yield* permutationsFromPool([...iterable], r);
+}
+function* combinationsFromPool(pool, r) {
+    const n = pool.length;
+    if (r > n || r < 0)
+        return;
+    const indices = Array.from({ length: r }, (_, i) => i);
+    yield indices.map((i) => pool[i]);
+    while (true) {
+        let i = -1;
+        for (let k = r - 1; k >= 0; k--) {
+            if (indices[k] !== k + n - r) {
+                i = k;
+                break;
+            }
+        }
+        if (i === -1)
+            return;
+        indices[i] += 1;
+        for (let j = i + 1; j < r; j++) {
+            indices[j] = indices[j - 1] + 1;
+        }
+        yield indices.map((idx) => pool[idx]);
+    }
+}
+/**
+ * r-length combinations of `iterable`, in sorted (input) order, without
+ * replacement. Mirrors Python's itertools.combinations(iterable, r).
+ */
+export function* combinations(iterable, r) {
+    yield* combinationsFromPool([...iterable], r);
+}
+function* combinationsWithReplacementFromPool(pool, r) {
+    const n = pool.length;
+    if (n === 0 && r > 0)
+        return;
+    const indices = new Array(r).fill(0);
+    yield indices.map((i) => pool[i]);
+    while (true) {
+        let i = -1;
+        for (let k = r - 1; k >= 0; k--) {
+            if (indices[k] !== n - 1) {
+                i = k;
+                break;
+            }
+        }
+        if (i === -1)
+            return;
+        const value = indices[i] + 1;
+        for (let j = i; j < r; j++) {
+            indices[j] = value;
+        }
+        yield indices.map((idx) => pool[idx]);
+    }
+}
+/**
+ * r-length combinations of `iterable`, with replacement. Mirrors Python's
+ * itertools.combinations_with_replacement(iterable, r).
+ */
+export function* combinationsWithReplacement(iterable, r) {
+    yield* combinationsWithReplacementFromPool([...iterable], r);
+}
+//# sourceMappingURL=CombinatoricsGenerators.js.map

package/dist/CombinatoricsGenerators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CombinatoricsGenerators.js","sourceRoot":"","sources":["../src/CombinatoricsGenerators.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,QAAQ,CAAC,CAAC,gBAAgB,CAAI,KAAY;IACxC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;QAAE,OAAO;IACpD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACb,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM;gBAAE,MAAM;YACxC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACf,CAAC,EAAE,CAAC;QACN,CAAC;QACD,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO;IACpB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,OAAO,CAAI,GAAG,SAA6B;IAC1D,KAAK,CAAC,CAAC,gBAAgB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,QAAQ,CAAC,CAAC,oBAAoB,CAAI,IAAS,EAAE,CAAiB;IAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI;QAAE,CAAC,GAAG,CAAC,CAAC;IACzC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO;IAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO;IACpB,KAAK,EAAE,OAAO,IAAI,EAAE,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACf,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;gBAC/C,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACf,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnB,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClD,SAAS,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO;IACT,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,YAAY,CAAI,QAAqB,EAAE,CAAU;IAChE,KAAK,CAAC,CAAC,oBAAoB,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,QAAQ,CAAC,CAAC,oBAAoB,CAAI,IAAS,EAAE,CAAS;IACpD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO;IAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC7B,CAAC,GAAG,CAAC,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO;QACrB,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,YAAY,CAAI,QAAqB,EAAE,CAAS;IAC/D,KAAK,CAAC,CAAC,oBAAoB,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,QAAQ,CAAC,CAAC,mCAAmC,CAAI,IAAS,EAAE,CAAS;IACnE,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO;IAC7B,MAAM,OAAO,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,CAAC,GAAG,CAAC,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO;QACrB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,SAAS,CAAC,CAAC,2BAA2B,CAAI,QAAqB,EAAE,CAAS;IAC9E,KAAK,CAAC,CAAC,mCAAmC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC"}

package/dist/ComplexMath.d.ts

@@ -0,0 +1,46 @@
+import { ComplexNumber } from "./ComplexNumber.ts";
+import { Vector } from "./Vector.ts";
+/**
+ * ComplexMath — the remaining complex-valued operations that don't belong on a
+ * single {@link ComplexNumber}: vector algebra over `Vector<ComplexNumber>`
+ * and probability distributions. Plain exported functions rather than a
+ * `static` method bag (same "namespace class" fix as {@link RealMath}).
+ *
+ * Everything per-value (arithmetic, exponentials/logs, trig, comparisons) is
+ * now a fluent {@link ComplexNumber} instance method. Matrix operations were
+ * dropped — `Structure.complexField()` already provides generic linear
+ * algebra. Order-dependent statistics (median/percentile/variance/etc.) were
+ * dropped with them: they had no test coverage here and don't generalize to
+ * complex numbers (there's no total order on the complex plane to found
+ * percentiles on) — see {@link Statistics} for the real-only equivalents.
+ *
+ * Ported from Mallory's ActionScript `ComplexMath`; see `ComplexNumber`'s doc
+ * comment for the bug fixes inherited from that port (directed-infinity
+ * division, zero-base `power`, etc.). `normalDistribution`'s AS3 bug (the
+ * reciprocal was taken of the whole PDF expression, flipping the exponential's
+ * sign) is fixed here too.
+ */
+type CNInput = ComplexNumber | number;
+type CVec = Vector<ComplexNumber>;
+type CUnary = (x: ComplexNumber) => ComplexNumber;
+export declare function addVector(alpha: CVec, beta: CVec): CVec;
+export declare function scaleVector(alpha: CVec, scalar: CNInput): CVec;
+export declare function negativeVector(alpha: CVec): CVec;
+export declare function subtractVector(alpha: CVec, beta: CVec): CVec;
+export declare function dotProduct(alpha: CVec, beta: CVec): ComplexNumber;
+/** 3D cross product (bug fix: index 2 for z, presence not truthiness — as in RealMath). */
+export declare function crossProduct(alpha: CVec, beta: CVec): CVec;
+export declare function kroneckerProduct(A: CVec, B: CVec): CVec;
+export declare function pNorm(alpha: CVec, norm?: CNInput): ComplexNumber;
+export declare function distanceVector(alpha: CVec, beta: CVec, norm?: CNInput): ComplexNumber;
+export declare function magnitudeVector(alpha: CVec): ComplexNumber;
+export declare function angleBetween(alpha: CVec, beta: CVec): ComplexNumber;
+export declare function zScore(x: CNInput, mean?: CNInput, sDev?: CNInput): ComplexNumber;
+export declare function invertZScore(z: CNInput, mean?: CNInput, sDev?: CNInput): ComplexNumber;
+/** Normal PDF closure over complex arguments. */
+export declare function normalDistribution(mean: CNInput, sDev: CNInput): CUnary;
+export declare function standardNormalDistribution(x: CNInput): ComplexNumber;
+export declare function normalProbability(x: CNInput, mean: CNInput, sDev: CNInput, negativeInfinityApproximation?: number, integrationInterval?: number): ComplexNumber;
+export declare function standardNormalProbability(z: CNInput, negativeInfinityApproximation?: number, interval?: number): ComplexNumber;
+export {};
+//# sourceMappingURL=ComplexMath.d.ts.map