puzlink 0.1.0

package/dist/lib/distribution.d.ts

@@ -0,0 +1,40 @@
+import { LogCounter } from "./logCounter.js";
+import { LogNum } from "./logNum.js";
+/** A probability distribution of items. */
+export declare class Distribution<T extends PropertyKey> {
+    private readonly frequencies;
+    constructor(frequencies: ReadonlyMap<T, LogNum>);
+    static from(data: string): Distribution<string>;
+    static from<T extends PropertyKey>(data: readonly T[]): Distribution<T>;
+    static from<T extends PropertyKey>(counter: LogCounter<T>): Distribution<T>;
+    /** Get the frequency of the given item. */
+    get(item: T): LogNum;
+    /** Returns an iterable of [item, log probability] pairs. */
+    entries(): IterableIterator<[T, LogNum]>;
+    /** k-th moment of the distribution. */
+    moment(k: number): LogNum;
+    /** Log probability that k items drawn from the distribution are all equal. */
+    probEqual(k: number): LogNum;
+    /**
+     * Log probability that k items drawn from the distribution have two distinct
+     * values.
+     */
+    probTwoDistinct(k: number): LogNum;
+    /**
+     * Log probability that k items drawn from the distribution are all equal,
+     * with exactly one exception.
+     */
+    probAlmostEqual(k: number): LogNum;
+    /** Map the items of the distribution, returning the new distribution. */
+    map<U extends PropertyKey>(fn: (item: T) => U): Distribution<U>;
+    /** Chi-squared test statistic against an observed distribution. */
+    chi2(observed: LogCounter<T>): LogNum;
+    /** Log probability that an unordered distribution is drawn from this. */
+    probUnordered(observed: LogCounter<T>): LogNum;
+    /** Over- and under-represented items, at the given sigma. */
+    outliers(observed: LogCounter<T>, sigma?: number): {
+        high: Record<T, LogNum>;
+        low: Record<T, LogNum>;
+    };
+}
+//# sourceMappingURL=distribution.d.ts.map

package/dist/lib/distribution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"distribution.d.ts","sourceRoot":"","sources":["../../src/lib/distribution.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAIrC,2CAA2C;AAC3C,qBAAa,YAAY,CAAC,CAAC,SAAS,WAAW;IAC7C,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAyB;gBAEzC,WAAW,EAAE,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC;IAI/C,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IAC/C,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,WAAW,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC;IACvE,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,WAAW,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAO3E,2CAA2C;IAC3C,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM;IAIpB,4DAA4D;IAC5D,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAIxC,uCAAuC;IAEvC,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAMzB,8EAA8E;IAC9E,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAO5B;;;OAGG;IAEH,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAclC;;;OAGG;IAEH,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAalC,yEAAyE;IACzE,GAAG,CAAC,CAAC,SAAS,WAAW,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAY/D,mEAAmE;IACnE,IAAI,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM;IAkBrC,yEAAyE;IACzE,aAAa,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM;IAM9C,6DAA6D;IAC7D,QAAQ,CACN,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,EACvB,KAAK,SAAI,GACR;QACD,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACxB,GAAG,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;KACxB;CA6BF"}

package/dist/lib/distribution.js

@@ -0,0 +1,176 @@
+var __runInitializers = (this && this.__runInitializers) || function (thisArg, initializers, value) {
+    var useValue = arguments.length > 2;
+    for (var i = 0; i < initializers.length; i++) {
+        value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+    }
+    return useValue ? value : void 0;
+};
+var __esDecorate = (this && this.__esDecorate) || function (ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+    function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+    var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+    var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+    var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+    var _, done = false;
+    for (var i = decorators.length - 1; i >= 0; i--) {
+        var context = {};
+        for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+        for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+        context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+        var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+        if (kind === "accessor") {
+            if (result === void 0) continue;
+            if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+            if (_ = accept(result.get)) descriptor.get = _;
+            if (_ = accept(result.set)) descriptor.set = _;
+            if (_ = accept(result.init)) initializers.unshift(_);
+        }
+        else if (_ = accept(result)) {
+            if (kind === "field") initializers.unshift(_);
+            else descriptor[key] = _;
+        }
+    }
+    if (target) Object.defineProperty(target, contextIn.name, descriptor);
+    done = true;
+};
+import { cumulativeStdNormalProbability as normCdf } from "simple-statistics";
+import { LogCounter } from "./logCounter.js";
+import { LogNum } from "./logNum.js";
+import { memoize } from "./memoize.js";
+import { interval } from "./util.js";
+/** A probability distribution of items. */
+let Distribution = (() => {
+    let _instanceExtraInitializers = [];
+    let _moment_decorators;
+    let _probTwoDistinct_decorators;
+    let _probAlmostEqual_decorators;
+    return class Distribution {
+        static {
+            const _metadata = typeof Symbol === "function" && Symbol.metadata ? Object.create(null) : void 0;
+            _moment_decorators = [memoize()];
+            _probTwoDistinct_decorators = [memoize()];
+            _probAlmostEqual_decorators = [memoize()];
+            __esDecorate(this, null, _moment_decorators, { kind: "method", name: "moment", static: false, private: false, access: { has: obj => "moment" in obj, get: obj => obj.moment }, metadata: _metadata }, null, _instanceExtraInitializers);
+            __esDecorate(this, null, _probTwoDistinct_decorators, { kind: "method", name: "probTwoDistinct", static: false, private: false, access: { has: obj => "probTwoDistinct" in obj, get: obj => obj.probTwoDistinct }, metadata: _metadata }, null, _instanceExtraInitializers);
+            __esDecorate(this, null, _probAlmostEqual_decorators, { kind: "method", name: "probAlmostEqual", static: false, private: false, access: { has: obj => "probAlmostEqual" in obj, get: obj => obj.probAlmostEqual }, metadata: _metadata }, null, _instanceExtraInitializers);
+            if (_metadata) Object.defineProperty(this, Symbol.metadata, { enumerable: true, configurable: true, writable: true, value: _metadata });
+        }
+        frequencies = __runInitializers(this, _instanceExtraInitializers);
+        constructor(frequencies) {
+            this.frequencies = frequencies;
+        }
+        static from(data) {
+            const counter = data instanceof LogCounter ? data : LogCounter.from(data);
+            return new Distribution(new Map(counter.frequencies()));
+        }
+        /** Get the frequency of the given item. */
+        get(item) {
+            return this.frequencies.get(item) ?? LogNum.from(0);
+        }
+        /** Returns an iterable of [item, log probability] pairs. */
+        entries() {
+            return this.frequencies.entries();
+        }
+        /** k-th moment of the distribution. */
+        moment(k) {
+            return LogNum.sum(Array.from(this.frequencies.values(), (freq) => freq.pow(k)));
+        }
+        /** Log probability that k items drawn from the distribution are all equal. */
+        probEqual(k) {
+            if (k <= 0) {
+                return LogNum.from(1);
+            }
+            return this.moment(k);
+        }
+        /**
+         * Log probability that k items drawn from the distribution have two distinct
+         * values.
+         */
+        probTwoDistinct(k) {
+            const probs = [];
+            for (const i of interval(0, k)) {
+                const j = k - i;
+                probs.push(LogNum.fromBinomial(k, i).mul(this.probEqual(i)).mul(this.probEqual(j)));
+            }
+            // Case where all are equal is counted 2^k times; others are counted twice:
+            return LogNum.sum(probs)
+                .sub(LogNum.from(2).pow(k).mul(this.probEqual(k)))
+                .div(LogNum.from(2));
+        }
+        /**
+         * Log probability that k items drawn from the distribution are all equal,
+         * with exactly one exception.
+         */
+        probAlmostEqual(k) {
+            const probs = [];
+            for (const [, freq] of this.frequencies) {
+                probs.push(this.moment(k - 1)
+                    .sub(freq.pow(k - 1))
+                    .mul(freq)
+                    .mul(LogNum.from(k)));
+            }
+            return LogNum.sum(probs);
+        }
+        /** Map the items of the distribution, returning the new distribution. */
+        map(fn) {
+            const frequencies = new Map();
+            for (const [item, freq] of this.frequencies) {
+                const mapped = fn(item);
+                frequencies.set(mapped, (frequencies.get(mapped) ?? LogNum.from(0)).add(freq));
+            }
+            return new Distribution(frequencies);
+        }
+        /** Chi-squared test statistic against an observed distribution. */
+        chi2(observed) {
+            for (const [item] of observed.entries()) {
+                if (!this.frequencies.has(item)) {
+                    return LogNum.from(Infinity);
+                }
+            }
+            const n = observed.total;
+            const partials = [];
+            for (const [item, freq] of this.frequencies) {
+                const expected = n.mul(freq);
+                const actual = observed.get(item);
+                // Under chi-squared assumptions, the (expected - actual)^2/expected
+                // should be iid N(0, 1)^2.
+                partials.push(expected.absSub(actual).pow(2).div(expected));
+            }
+            return LogNum.sum(partials);
+        }
+        /** Log probability that an unordered distribution is drawn from this. */
+        probUnordered(observed) {
+            const df = this.frequencies.size - 1;
+            const z = (this.chi2(observed).toNum() - df) / Math.sqrt(2 * df);
+            return LogNum.from(1 - normCdf(z));
+        }
+        /** Over- and under-represented items, at the given sigma. */
+        outliers(observed, sigma = 2) {
+            const n = observed.total;
+            const low = {};
+            const high = {};
+            const keys = [
+                ...this.frequencies.keys(),
+                ...observed.filterKeys((key) => !this.frequencies.has(key)),
+            ];
+            const threshold = LogNum.from(sigma ** 2);
+            for (const item of keys) {
+                const freq = this.frequencies.get(item) ?? LogNum.from(0);
+                const expected = n.mul(freq);
+                const actual = observed.get(item);
+                // We assume (expected - actual)^2/expected should be distributed as
+                // N(0, 1)^2; thus if it's over sigma^2, it's an outlier.
+                if (expected.absSub(actual).pow(2).div(expected).gt(threshold)) {
+                    if (expected.gt(actual)) {
+                        low[item] = expected.sub(actual);
+                    }
+                    else {
+                        high[item] = actual.sub(expected);
+                    }
+                }
+            }
+            return { high, low };
+        }
+    };
+})();
+export { Distribution };
+//# sourceMappingURL=distribution.js.map

package/dist/lib/distribution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"distribution.js","sourceRoot":"","sources":["../../src/lib/distribution.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,8BAA8B,IAAI,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,2CAA2C;IAC9B,YAAY;;;;;iBAAZ,YAAY;;;kCA2BtB,OAAO,EAAE;2CAmBT,OAAO,EAAE;2CAmBT,OAAO,EAAE;YArCV,qKAAA,MAAM,6DAIL;YAeD,gMAAA,eAAe,6DAYd;YAOD,gMAAA,eAAe,6DAWd;;;QA5EgB,WAAW,GADjB,mDAAY,CAC8B;QAErD,YAAY,WAAmC;YAC7C,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QACjC,CAAC;QAKD,MAAM,CAAC,IAAI,CAAC,IAA+D;YACzE,MAAM,OAAO,GACX,IAAI,YAAY,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;YACtE,OAAO,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,2CAA2C;QAC3C,GAAG,CAAC,IAAO;YACT,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,4DAA4D;QAC5D,OAAO;YACL,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACpC,CAAC;QAED,uCAAuC;QAEvC,MAAM,CAAC,CAAS;YACd,OAAO,MAAM,CAAC,GAAG,CACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAC7D,CAAC;QACJ,CAAC;QAED,8EAA8E;QAC9E,SAAS,CAAC,CAAS;YACjB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAED;;;WAGG;QAEH,eAAe,CAAC,CAAS;YACvB,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,KAAK,CAAC,IAAI,CACR,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CACxE,CAAC;YACJ,CAAC;YACD,2EAA2E;YAC3E,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;iBACrB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;iBACjD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QAED;;;WAGG;QAEH,eAAe,CAAC,CAAS;YACvB,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACxC,KAAK,CAAC,IAAI,CACR,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;qBACf,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;qBACpB,GAAG,CAAC,IAAI,CAAC;qBACT,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CACvB,CAAC;YACJ,CAAC;YACD,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAED,yEAAyE;QACzE,GAAG,CAAwB,EAAkB;YAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAa,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;gBACxB,WAAW,CAAC,GAAG,CACb,MAAM,EACN,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CACtD,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;QACvC,CAAC;QAED,mEAAmE;QACnE,IAAI,CAAC,QAAuB;YAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,OAAO,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YACD,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;YACzB,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,oEAAoE;gBACpE,2BAA2B;gBAC3B,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC9D,CAAC;YACD,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;QAED,yEAAyE;QACzE,aAAa,CAAC,QAAuB;YACnC,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YACjE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;QAED,6DAA6D;QAC7D,QAAQ,CACN,QAAuB,EACvB,KAAK,GAAG,CAAC;YAKT,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;YACzB,MAAM,GAAG,GAAG,EAAuB,CAAC;YACpC,MAAM,IAAI,GAAG,EAAuB,CAAC;YAErC,MAAM,IAAI,GAAG;gBACX,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE;gBAC1B,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAC5D,CAAC;YACF,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAE1C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC1D,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAElC,oEAAoE;gBACpE,yDAAyD;gBACzD,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC/D,IAAI,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;wBACxB,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBACnC,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QACvB,CAAC;;;SAzJU,YAAY"}

package/dist/lib/lengthDistribution.d.ts

@@ -0,0 +1,30 @@
+import { Distribution } from "./distribution.js";
+import { LogNum } from "./logNum.js";
+export declare class LengthDistribution {
+    readonly distribution: Distribution<number>;
+    private readonly distMod2;
+    private readonly distMod3;
+    /** Length such that 99.9% of answers have length less than this. */
+    private readonly maxLength;
+    constructor(distribution: Distribution<number>);
+    static from(data: Map<number, LogNum>): LengthDistribution;
+    /** Log probability that k words have the same length. */
+    probEqual(k: number): LogNum;
+    /** Log probability that k words have the same length, except for one. */
+    probAlmostEqual(k: number): LogNum;
+    /** Log probability that k words have the same length modulo 2. */
+    probEqualMod2(k: number): LogNum;
+    /** Log probability that k words have the same length modulo 3. */
+    probEqualMod3(k: number): LogNum;
+    /** Log probability that k words have consecutive lengths. */
+    probConsecutive(k: number): LogNum;
+    /** Log probability that k words have exactly two distinct lengths. */
+    probTwoDistinct(k: number): LogNum;
+    /**
+     * Log probability that k words have distinct lengths, all at least min.
+     */
+    probDistinct(k: number, min?: number): LogNum;
+    /** Log probability that k words can be paired by length. */
+    probPaired(k: number): LogNum;
+}
+//# sourceMappingURL=lengthDistribution.d.ts.map

package/dist/lib/lengthDistribution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lengthDistribution.d.ts","sourceRoot":"","sources":["../../src/lib/lengthDistribution.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAIrC,qBAAa,kBAAkB;IAC7B,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAuB;IAChD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAuB;IAChD,oEAAoE;IACpE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAEvB,YAAY,EAAE,YAAY,CAAC,MAAM,CAAC;IAgB9C,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,kBAAkB;IAI1D,yDAAyD;IACzD,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAI5B,yEAAyE;IACzE,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIlC,kEAAkE;IAClE,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIhC,kEAAkE;IAClE,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIhC,6DAA6D;IAE7D,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAiBlC,sEAAsE;IACtE,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIlC;;OAEG;IAEH,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,SAAI,GAAG,MAAM;IAoBxC,4DAA4D;IAC5D,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CAM9B"}

package/dist/lib/lengthDistribution.js

@@ -0,0 +1,137 @@
+var __runInitializers = (this && this.__runInitializers) || function (thisArg, initializers, value) {
+    var useValue = arguments.length > 2;
+    for (var i = 0; i < initializers.length; i++) {
+        value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+    }
+    return useValue ? value : void 0;
+};
+var __esDecorate = (this && this.__esDecorate) || function (ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+    function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+    var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+    var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+    var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+    var _, done = false;
+    for (var i = decorators.length - 1; i >= 0; i--) {
+        var context = {};
+        for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+        for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+        context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+        var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+        if (kind === "accessor") {
+            if (result === void 0) continue;
+            if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+            if (_ = accept(result.get)) descriptor.get = _;
+            if (_ = accept(result.set)) descriptor.set = _;
+            if (_ = accept(result.init)) initializers.unshift(_);
+        }
+        else if (_ = accept(result)) {
+            if (kind === "field") initializers.unshift(_);
+            else descriptor[key] = _;
+        }
+    }
+    if (target) Object.defineProperty(target, contextIn.name, descriptor);
+    done = true;
+};
+import { Distribution } from "./distribution.js";
+import { LogNum } from "./logNum.js";
+import { memoize } from "./memoize.js";
+import { interval, windows } from "./util.js";
+let LengthDistribution = (() => {
+    let _instanceExtraInitializers = [];
+    let _probConsecutive_decorators;
+    let _probDistinct_decorators;
+    return class LengthDistribution {
+        static {
+            const _metadata = typeof Symbol === "function" && Symbol.metadata ? Object.create(null) : void 0;
+            _probConsecutive_decorators = [memoize()];
+            _probDistinct_decorators = [memoize(2)];
+            __esDecorate(this, null, _probConsecutive_decorators, { kind: "method", name: "probConsecutive", static: false, private: false, access: { has: obj => "probConsecutive" in obj, get: obj => obj.probConsecutive }, metadata: _metadata }, null, _instanceExtraInitializers);
+            __esDecorate(this, null, _probDistinct_decorators, { kind: "method", name: "probDistinct", static: false, private: false, access: { has: obj => "probDistinct" in obj, get: obj => obj.probDistinct }, metadata: _metadata }, null, _instanceExtraInitializers);
+            if (_metadata) Object.defineProperty(this, Symbol.metadata, { enumerable: true, configurable: true, writable: true, value: _metadata });
+        }
+        distribution = __runInitializers(this, _instanceExtraInitializers);
+        distMod2;
+        distMod3;
+        /** Length such that 99.9% of answers have length less than this. */
+        maxLength;
+        constructor(distribution) {
+            this.distribution = distribution;
+            this.distMod2 = this.distribution.map((length) => length % 2);
+            this.distMod3 = this.distribution.map((length) => length % 3);
+            this.maxLength = Infinity;
+            let totalProb = LogNum.from(0);
+            for (const [length, freq] of distribution.entries()) {
+                totalProb = totalProb.add(freq);
+                if (totalProb.gt(LogNum.from(0.999))) {
+                    this.maxLength = length;
+                    break;
+                }
+            }
+        }
+        static from(data) {
+            return new LengthDistribution(new Distribution(data));
+        }
+        /** Log probability that k words have the same length. */
+        probEqual(k) {
+            return this.distribution.probEqual(k);
+        }
+        /** Log probability that k words have the same length, except for one. */
+        probAlmostEqual(k) {
+            return this.distribution.probAlmostEqual(k);
+        }
+        /** Log probability that k words have the same length modulo 2. */
+        probEqualMod2(k) {
+            return this.distMod2.probEqual(k);
+        }
+        /** Log probability that k words have the same length modulo 3. */
+        probEqualMod3(k) {
+            return this.distMod3.probEqual(k);
+        }
+        /** Log probability that k words have consecutive lengths. */
+        probConsecutive(k) {
+            if (k <= 1) {
+                return LogNum.from(1);
+            }
+            else if (k > this.maxLength) {
+                return LogNum.from(0);
+            }
+            const range = interval(1, this.maxLength).map((i) => this.distribution.get(i));
+            const partials = Array.from(windows(range, k), (window) => LogNum.prod(window));
+            return LogNum.fromFactorial(k).mul(LogNum.sum(partials));
+        }
+        /** Log probability that k words have exactly two distinct lengths. */
+        probTwoDistinct(k) {
+            return this.distribution.probTwoDistinct(k);
+        }
+        /**
+         * Log probability that k words have distinct lengths, all at least min.
+         */
+        probDistinct(k, min = 0) {
+            if (k <= 0) {
+                return LogNum.from(1);
+            }
+            else if (min > this.maxLength) {
+                return LogNum.from(0);
+            }
+            const probs = [];
+            for (const [length, freq] of this.distribution.entries()) {
+                if (length < min) {
+                    continue;
+                }
+                probs.push(freq.mul(this.probDistinct(k - 1, length + 1)));
+            }
+            return probs.length === 0
+                ? LogNum.from(0)
+                : LogNum.from(k).mul(LogNum.sum(probs));
+        }
+        /** Log probability that k words can be paired by length. */
+        probPaired(k) {
+            if (k % 2 !== 0) {
+                return LogNum.from(0);
+            }
+            return this.probDistinct(Math.floor(k / 2));
+        }
+    };
+})();
+export { LengthDistribution };
+//# sourceMappingURL=lengthDistribution.js.map

package/dist/lib/lengthDistribution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lengthDistribution.js","sourceRoot":"","sources":["../../src/lib/lengthDistribution.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;IAEjC,kBAAkB;;;;iBAAlB,kBAAkB;;;2CAgD5B,OAAO,EAAE;wCA0BT,OAAO,CAAC,CAAC,CAAC;YAzBX,gMAAA,eAAe,6DAed;YAWD,uLAAA,YAAY,6DAkBX;;;QA5FQ,YAAY,GADV,mDAAkB,CACe;QAC3B,QAAQ,CAAuB;QAC/B,QAAQ,CAAuB;QAChD,oEAAoE;QACnD,SAAS,CAAS;QAEnC,YAAY,YAAkC;YAC5C,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;YACjC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE9D,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;YAC1B,IAAI,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpD,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAChC,IAAI,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACrC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC;oBACxB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,IAAyB;YACnC,OAAO,IAAI,kBAAkB,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,yDAAyD;QACzD,SAAS,CAAC,CAAS;YACjB,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,yEAAyE;QACzE,eAAe,CAAC,CAAS;YACvB,OAAO,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,kEAAkE;QAClE,aAAa,CAAC,CAAS;YACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,kEAAkE;QAClE,aAAa,CAAC,CAAS;YACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,6DAA6D;QAE7D,eAAe,CAAC,CAAS;YACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC9B,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CACzB,CAAC;YACF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CACxD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CACpB,CAAC;YAEF,OAAO,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,sEAAsE;QACtE,eAAe,CAAC,CAAS;YACvB,OAAO,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED;;WAEG;QAEH,YAAY,CAAC,CAAS,EAAE,GAAG,GAAG,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;gBACzD,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC;YAED,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;gBACvB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,4DAA4D;QAC5D,UAAU,CAAC,CAAS;YAClB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;;;SArGU,kBAAkB"}

package/dist/lib/letterBitset.d.ts

@@ -0,0 +1,49 @@
+/**
+ * A class that uses a single bigint to store counts for each lowercase letter,
+ * for fast-ish comparison.
+ *
+ * Idea stolen from Collective.jl:
+ * https://github.com/rdeits/Collective.jl/blob/master/src/bitstally.jl
+ */
+export declare class LetterBitset {
+    private static readonly bits;
+    private static readonly mask;
+    private static readonly offsets;
+    private static readonly letterMasks;
+    /**
+     * This is a (26 * 5)-bit integer; each 5-bit block is a count for a letter.
+     * Unclear how efficient this'll be for different engines...
+     *
+     * Note that 26 * 5 = 130, so these *mostly* fit in 128-bit integers, unless
+     * there's more than 7 'z's.
+     */
+    readonly data: bigint;
+    constructor(data: bigint);
+    private static toIndex;
+    private static fromIndex;
+    /** Create a new LetterCounter from a slug. */
+    static from(slug: string): LetterBitset;
+    /** Count the number of times the given letter appears in this bitset. */
+    index(letter: string): number;
+    equals(other: LetterBitset): boolean;
+    add(char: string): LetterBitset;
+    sub(char: string): LetterBitset;
+    /** If this + result == other, return result; else null. */
+    transaddOf(other: LetterBitset): string | null;
+    /** If this - result == other, return result; else null. */
+    transdeleteOf(other: LetterBitset): string | null;
+}
+/** A map from letter bitsets to words with that bitset. */
+export declare class LetterBitsets {
+    private letterCounters;
+    private lengths;
+    constructor(wordlist: string[]);
+    /** Get the words whose bitset matches the given slug's bitset. */
+    get(slug: string): string[];
+    /** Find all substrings of the slug that anagram to a word's bitset. */
+    matchSubstring(slug: string): Generator<{
+        start: number;
+        words: string[];
+    }>;
+}
+//# sourceMappingURL=letterBitset.d.ts.map

package/dist/lib/letterBitset.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"letterBitset.d.ts","sourceRoot":"","sources":["../../src/lib/letterBitset.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAM;IAClC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAkC;IAC9D,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAEiB;IAChD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAEjC;IAEF;;;;;;OAMG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;gBAEV,IAAI,EAAE,MAAM;IAIxB,OAAO,CAAC,MAAM,CAAC,OAAO;IAItB,OAAO,CAAC,MAAM,CAAC,SAAS;IAIxB,8CAA8C;IAC9C,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM;IAQxB,yEAAyE;IACzE,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAO7B,MAAM,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO;IAIpC,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY;IAM/B,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY;IAM/B,2DAA2D;IAC3D,UAAU,CAAC,KAAK,EAAE,YAAY;IAS9B,2DAA2D;IAC3D,aAAa,CAAC,KAAK,EAAE,YAAY;CAGlC;AAED,2DAA2D;AAC3D,qBAAa,aAAa;IACxB,OAAO,CAAC,cAAc,CAA+B;IACrD,OAAO,CAAC,OAAO,CAAqB;gBAExB,QAAQ,EAAE,MAAM,EAAE;IAW9B,kEAAkE;IAClE,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAI3B,uEAAuE;IACtE,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;CAa7E"}

package/dist/lib/letterBitset.js

@@ -0,0 +1,101 @@
+/**
+ * A class that uses a single bigint to store counts for each lowercase letter,
+ * for fast-ish comparison.
+ *
+ * Idea stolen from Collective.jl:
+ * https://github.com/rdeits/Collective.jl/blob/master/src/bitstally.jl
+ */
+export class LetterBitset {
+    static bits = 5n;
+    static mask = (1n << LetterBitset.bits) - 1n;
+    static offsets = Array(26)
+        .fill(0)
+        .map((_, i) => LetterBitset.bits * BigInt(i));
+    static letterMasks = LetterBitset.offsets.map((x) => 1n << x);
+    /**
+     * This is a (26 * 5)-bit integer; each 5-bit block is a count for a letter.
+     * Unclear how efficient this'll be for different engines...
+     *
+     * Note that 26 * 5 = 130, so these *mostly* fit in 128-bit integers, unless
+     * there's more than 7 'z's.
+     */
+    data;
+    constructor(data) {
+        this.data = data;
+    }
+    static toIndex(letter) {
+        return letter.charCodeAt(0) - 97;
+    }
+    static fromIndex(index) {
+        return String.fromCharCode(97 + index);
+    }
+    /** Create a new LetterCounter from a slug. */
+    static from(slug) {
+        let data = 0n;
+        for (const char of slug) {
+            data += LetterBitset.letterMasks[this.toIndex(char)];
+        }
+        return new LetterBitset(data);
+    }
+    /** Count the number of times the given letter appears in this bitset. */
+    index(letter) {
+        return Number((this.data >> LetterBitset.offsets[LetterBitset.toIndex(letter)]) &
+            LetterBitset.mask);
+    }
+    equals(other) {
+        return this.data === other.data;
+    }
+    add(char) {
+        return new LetterBitset(this.data + (LetterBitset.letterMasks[LetterBitset.toIndex(char)] ?? 0n));
+    }
+    sub(char) {
+        return new LetterBitset(this.data - (LetterBitset.letterMasks[LetterBitset.toIndex(char)] ?? 0n));
+    }
+    /** If this + result == other, return result; else null. */
+    transaddOf(other) {
+        const diff = this.data - other.data;
+        const index = LetterBitset.letterMasks.findIndex((mask) => diff === mask);
+        if (index === -1) {
+            return null;
+        }
+        return LetterBitset.fromIndex(index);
+    }
+    /** If this - result == other, return result; else null. */
+    transdeleteOf(other) {
+        return other.transaddOf(this);
+    }
+}
+/** A map from letter bitsets to words with that bitset. */
+export class LetterBitsets {
+    letterCounters = new Map();
+    lengths = new Set();
+    constructor(wordlist) {
+        for (const word of wordlist) {
+            const bitset = LetterBitset.from(word).data;
+            if (!this.letterCounters.has(bitset)) {
+                this.letterCounters.set(bitset, []);
+            }
+            this.letterCounters.get(bitset).push(word);
+            this.lengths.add(word.length);
+        }
+    }
+    /** Get the words whose bitset matches the given slug's bitset. */
+    get(slug) {
+        return this.letterCounters.get(LetterBitset.from(slug).data) ?? [];
+    }
+    /** Find all substrings of the slug that anagram to a word's bitset. */
+    *matchSubstring(slug) {
+        for (const length of this.lengths) {
+            let start = 0;
+            let bitset = LetterBitset.from(slug.slice(0, length));
+            for (; start + length <= slug.length; start++) {
+                const words = this.letterCounters.get(bitset.data);
+                if (words && words.length > 0) {
+                    yield { start, words };
+                }
+                bitset = bitset.sub(slug[start] ?? "").add(slug[start + length] ?? "");
+            }
+        }
+    }
+}
+//# sourceMappingURL=letterBitset.js.map

package/dist/lib/letterBitset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"letterBitset.js","sourceRoot":"","sources":["../../src/lib/letterBitset.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,OAAO,YAAY;IACf,MAAM,CAAU,IAAI,GAAG,EAAE,CAAC;IAC1B,MAAM,CAAU,IAAI,GAAG,CAAC,EAAE,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACtD,MAAM,CAAU,OAAO,GAAG,KAAK,CAAC,EAAE,CAAC;SACxC,IAAI,CAAC,CAAC,CAAC;SACP,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,CAAU,WAAW,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,CAC5D,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CACf,CAAC;IAEF;;;;;;OAMG;IACM,IAAI,CAAS;IAEtB,YAAY,IAAY;QACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,OAAO,CAAC,MAAc;QACnC,OAAO,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACnC,CAAC;IAEO,MAAM,CAAC,SAAS,CAAC,KAAa;QACpC,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,8CAA8C;IAC9C,MAAM,CAAC,IAAI,CAAC,IAAY;QACtB,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAE,CAAC;QACxD,CAAC;QACD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,yEAAyE;IACzE,KAAK,CAAC,MAAc;QAClB,OAAO,MAAM,CACX,CAAC,IAAI,CAAC,IAAI,IAAI,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAE,CAAC;YAChE,YAAY,CAAC,IAAI,CACpB,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,KAAmB;QACxB,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,YAAY,CACrB,IAAI,CAAC,IAAI,GAAG,CAAC,YAAY,CAAC,WAAW,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CACzE,CAAC;IACJ,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,YAAY,CACrB,IAAI,CAAC,IAAI,GAAG,CAAC,YAAY,CAAC,WAAW,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CACzE,CAAC;IACJ,CAAC;IAED,2DAA2D;IAC3D,UAAU,CAAC,KAAmB;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACpC,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QAC1E,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,YAAY,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,2DAA2D;IAC3D,aAAa,CAAC,KAAmB;QAC/B,OAAO,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;;AAGH,2DAA2D;AAC3D,MAAM,OAAO,aAAa;IAChB,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,YAAY,QAAkB;QAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACtC,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACrE,CAAC;IAED,uEAAuE;IACvE,CAAC,cAAc,CAAC,IAAY;QAC1B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACtD,OAAO,KAAK,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACnD,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;gBACzB,CAAC;gBACD,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/lib/letterDistribution.d.ts

@@ -0,0 +1,60 @@
+import { Distribution } from "./distribution.js";
+import { LogNum } from "./logNum.js";
+export declare const LETTERS = "abcdefghijklmnopqrstuvwxyz";
+export declare const VOWELS = "aeiou";
+export declare const CONSONANTS = "bcdfghjklmnpqrstvwxyz";
+/**
+ * Info about the letter distribution of a wordlist.
+ *
+ * All of these methods rely on letters being drawn iid. This is the case for
+ * letters that come from random indexing. This is *not* the case for things
+ * like random substrings.
+ */
+export declare class LetterDistribution {
+    readonly distribution: Distribution<string>;
+    private readonly lengthToProbs;
+    constructor(wordlist: string[]);
+    /**
+     * Log probability that a list of letters is iid drawn from this distribution,
+     * via chi-squared.
+     */
+    probUnordered(letters: string[]): LogNum;
+    /** Over- and under-represented letters, at 2 sigma. */
+    outliers(letters: string[]): {
+        high: string[];
+        low: string[];
+    };
+    /**
+     * Log probability that words of given lengths share common letters, in the
+     * same order.
+     */
+    probCommonOrdered(common: number, lengths: number[]): LogNum;
+    /** Log probability that k letters are all equal. */
+    probEqual(k: number): LogNum;
+    /** Log probability that k letters are all equal, except for one. */
+    probAlmostEqual(k: number): LogNum;
+    /** Log probability that k letters have exactly two values. */
+    probTwoDistinct(k: number): LogNum;
+    /** Log probability that k letters are consecutive. */
+    probConsecutive(k: number): LogNum;
+    /**
+     * Log probability that k letters have distinct values, all at least min.
+     */
+    probDistinct(k: number, min?: string): LogNum;
+    /** Log probability that k letters can be grouped in equal pairs. */
+    probPaired(k: number): LogNum;
+    /** Log probability that k letters form a word. */
+    probWord(k: number): LogNum;
+    /** Log probability that k letters form an anagram of a word. */
+    probAnagram(k: number): LogNum;
+    /** Log probability that k letters are all vowels. */
+    probVowels(k: number): LogNum;
+    /** Log probability that k letters are all consonants. */
+    probConsonants(k: number): LogNum;
+    /**
+     * Log probability that n words, each of length k, have the same pattern of
+     * vowels and consonants.
+     */
+    probEqualVowelPattern(n: number, k: number): LogNum;
+}
+//# sourceMappingURL=letterDistribution.d.ts.map

package/dist/lib/letterDistribution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"letterDistribution.d.ts","sourceRoot":"","sources":["../../src/lib/letterDistribution.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAIrC,eAAO,MAAM,OAAO,+BAA+B,CAAC;AACpD,eAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,eAAO,MAAM,UAAU,0BAA0B,CAAC;AAElD;;;;;;GAMG;AACH,qBAAa,kBAAkB;IAC7B,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAQ5B;gBAEU,QAAQ,EAAE,MAAM,EAAE;IAoD9B;;;OAGG;IACH,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM;IAKxC,uDAAuD;IACvD,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG;QAC3B,IAAI,EAAE,MAAM,EAAE,CAAC;QACf,GAAG,EAAE,MAAM,EAAE,CAAC;KACf;IAMD;;;OAGG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM;IAe5D,oDAAoD;IACpD,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAI5B,oEAAoE;IACpE,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIlC,8DAA8D;IAC9D,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIlC,sDAAsD;IAEtD,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAsBlC;;OAEG;IAEH,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,SAAM,GAAG,MAAM;IAoB1C,oEAAoE;IACpE,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAO7B,kDAAkD;IAClD,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAI3B,gEAAgE;IAChE,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAI9B,qDAAqD;IAErD,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAY7B,yDAAyD;IAEzD,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAYjC;;;OAGG;IACH,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;CAGpD"}