puzlink 0.1.0

package/dist/lib/memoize.js

@@ -0,0 +1,104 @@
+/* eslint-disable @typescript-eslint/no-explicit-any */
+function memoizeWith(fn, makeCache) {
+    const cache = makeCache();
+    const memoized = function (...args) {
+        const cached = cache.get(args);
+        if (cached !== null) {
+            return cached;
+        }
+        const result = fn.apply(this, args);
+        cache.set(args, result);
+        return result;
+    };
+    for (const property of Reflect.ownKeys(fn)) {
+        if (property === "length" ||
+            property === "prototype" ||
+            property === "argunments" ||
+            property === "prototype") {
+            continue;
+        }
+        const fnDesc = Object.getOwnPropertyDescriptor(fn, property);
+        const mmDesc = Object.getOwnPropertyDescriptor(memoized, property);
+        if (mmDesc === undefined ||
+            mmDesc.configurable ||
+            (mmDesc.writable === fnDesc.writable &&
+                mmDesc.enumerable === fnDesc.enumerable &&
+                mmDesc.configurable === fnDesc.configurable &&
+                (mmDesc.writable || mmDesc.value === fnDesc.value))) {
+            Object.defineProperty(memoized, property, fnDesc);
+        }
+    }
+    Object.setPrototypeOf(memoized, Object.getPrototypeOf(fn));
+    return memoized;
+}
+function memoizeDecorator(makeCache) {
+    return (target) => {
+        const instanceMap = new WeakMap();
+        return function (...args) {
+            let memoized = instanceMap.get(this);
+            if (memoized === undefined) {
+                memoized = memoizeWith(target, makeCache);
+                instanceMap.set(this, memoized);
+            }
+            return memoized.apply(this, args);
+        };
+    };
+}
+function memoize1() {
+    return memoizeDecorator(() => {
+        const cache = new Map();
+        return {
+            get: ([key]) => {
+                return cache.get(key) ?? null;
+            },
+            set: ([key], value) => {
+                return cache.set(key, value);
+            },
+        };
+    });
+}
+function memoize2() {
+    return memoizeDecorator(() => {
+        const cache = new Map();
+        return {
+            get: ([outerKey, innerKey]) => {
+                return cache.get(outerKey)?.get(innerKey) ?? null;
+            },
+            set: ([outerKey, innerKey], value) => {
+                let inner = cache.get(outerKey);
+                if (inner === undefined) {
+                    inner = new Map();
+                    cache.set(outerKey, inner);
+                }
+                inner.set(innerKey, value);
+            },
+        };
+    });
+}
+function memoize3() {
+    return memoizeDecorator(() => {
+        const cache = new Map();
+        return {
+            get: ([outerKey, middleKey, innerKey]) => {
+                return cache.get(outerKey)?.get(middleKey)?.get(innerKey) ?? null;
+            },
+            set: ([outerKey, middleKey, innerKey], value) => {
+                let middle = cache.get(outerKey);
+                if (middle === undefined) {
+                    middle = new Map();
+                    cache.set(outerKey, middle);
+                }
+                let inner = middle.get(middleKey);
+                if (inner === undefined) {
+                    inner = new Map();
+                    middle.set(middleKey, inner);
+                }
+                inner.set(innerKey, value);
+            },
+        };
+    });
+}
+export function memoize(levels) {
+    return levels === 3 ? memoize3() : levels === 2 ? memoize2() : memoize1();
+}
+//# sourceMappingURL=memoize.js.map

package/dist/lib/memoize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoize.js","sourceRoot":"","sources":["../../src/lib/memoize.ts"],"names":[],"mappings":"AAAA,uDAAuD;AASvD,SAAS,WAAW,CAClB,EAAM,EACN,SAAsD;IAEtD,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;IAE1B,MAAM,QAAQ,GAAG,UAEf,GAAG,IAAoB;QAEvB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAmB,CAAC;QACtD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC;IAChB,CAAO,CAAC;IAER,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QAC3C,IACE,QAAQ,KAAK,QAAQ;YACrB,QAAQ,KAAK,WAAW;YACxB,QAAQ,KAAK,YAAY;YACzB,QAAQ,KAAK,WAAW,EACxB,CAAC;YACD,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,wBAAwB,CAAC,EAAE,EAAE,QAAQ,CAAE,CAAC;QAC9D,MAAM,MAAM,GAAG,MAAM,CAAC,wBAAwB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnE,IACE,MAAM,KAAK,SAAS;YACpB,MAAM,CAAC,YAAY;YACnB,CAAC,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ;gBAClC,MAAM,CAAC,UAAU,KAAK,MAAM,CAAC,UAAU;gBACvC,MAAM,CAAC,YAAY,KAAK,MAAM,CAAC,YAAY;gBAC3C,CAAC,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC,EACrD,CAAC;YACD,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,cAAc,CAAC,EAAE,CAAW,CAAC,CAAC;IAErE,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,gBAAgB,CACvB,SAAsD;IAEtD,OAAO,CAAC,MAAU,EAAM,EAAE;QACxB,MAAM,WAAW,GAAG,IAAI,OAAO,EAAW,CAAC;QAC3C,OAAO,UAAqB,GAAG,IAAoB;YACjD,IAAI,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC1C,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAClC,CAAC;YACD,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAmB,CAAC;QACtD,CAAO,CAAC;IACV,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ;IACf,OAAO,gBAAgB,CAAK,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QACtC,OAAO;YACL,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE;gBACb,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;YAChC,CAAC;YACD,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE;gBACpB,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC/B,CAAC;SACuC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,QAAQ;IACf,OAAO,gBAAgB,CAAK,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;QAChD,OAAO;YACL,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE;gBAC5B,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;YACpD,CAAC;YACD,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,EAAE;gBACnC,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;oBAClB,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;gBAC7B,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7B,CAAC;SACuC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,QAAQ;IACf,OAAO,gBAAgB,CAAK,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoC,CAAC;QAC1D,OAAO;YACL,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,EAAE;gBACvC,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;YACpE,CAAC;YACD,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,EAAE;gBAC9C,IAAI,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;oBACnB,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC9B,CAAC;gBACD,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAClC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;oBAClB,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC/B,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7B,CAAC;SACuC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC;AAMD,MAAM,UAAU,OAAO,CAAC,MAAkB;IACxC,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAC5E,CAAC"}

package/dist/lib/util.d.ts

@@ -0,0 +1,30 @@
+/** Capitalizes the letters of a slug at the given indices. */
+export declare function capitalizeAt(slug: string, indices: number[]): string;
+/** Prints the index of a slug at the given indices. */
+export declare function printIndexSlug(slug: string, indices: number[]): string;
+/** Returns an array of numbers from start to end (inclusive). */
+export declare function interval(start: number, end: number, step?: number): number[];
+type IterMap<A extends any[]> = A extends [infer First, ...infer Rest] ? [Iterable<First>, ...IterMap<Rest>] : [];
+/** Map a function to a product of iterators. */
+export declare function mapProduct<const Args extends any[], R>(fn: (...args: Args) => R, ...args: IterMap<Args>): Generator<R>;
+/** Returns the ordinal suffix of the given number. */
+export declare function ordinal(n: number): string;
+/** Caesar shift a slug. */
+export declare function caesar(slug: string, n: number): string;
+/** Returns an iterator over [index, item] pairs. */
+export declare function enumerate<T>(iter: Iterable<T>): Generator<[number, T]>;
+/** Returns an iterator over windows of the given size. */
+export declare function windows<T>(iter: Iterable<T>, size: 2): Generator<[T, T]>;
+export declare function windows<T>(iter: Iterable<T>, size: 3): Generator<[T, T, T]>;
+export declare function windows<T>(iter: Iterable<T>, size: number): Generator<T[]>;
+/**
+ * If the given array is a non-constant arithmetic sequence, returns the start,
+ * step, and last. Else, returns null.
+ */
+export declare function getArithmeticSequenceInfo(terms: number[]): {
+    start: number;
+    step: number;
+    last: number;
+} | null;
+export {};
+//# sourceMappingURL=util.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../src/lib/util.ts"],"names":[],"mappings":"AAEA,8DAA8D;AAC9D,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAMpE;AAED,uDAAuD;AACvD,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAStE;AAED,iEAAiE;AACjE,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,MAAM,EAAE,CAMvE;AA4BD,KAAK,OAAO,CAAC,CAAC,SAAS,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,EAAE,GAAG,MAAM,IAAI,CAAC,GAClE,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GACnC,EAAE,CAAC;AAEP,gDAAgD;AAChD,wBAAiB,UAAU,CAAC,KAAK,CAAC,IAAI,SAAS,GAAG,EAAE,EAAE,CAAC,EACrD,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,CAAC,EACxB,GAAG,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,GACrB,SAAS,CAAC,CAAC,CAAC,CAId;AAED,sDAAsD;AACtD,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAYzC;AAID,2BAA2B;AAC3B,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAOtD;AAED,oDAAoD;AACpD,wBAAiB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAMvE;AAED,0DAA0D;AAC1D,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1E,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC7E,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;AAc5E;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG;IAC1D,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd,GAAG,IAAI,CAgBP"}

package/dist/lib/util.js

@@ -0,0 +1,111 @@
+/* eslint-disable @typescript-eslint/no-explicit-any */
+/** Capitalizes the letters of a slug at the given indices. */
+export function capitalizeAt(slug, indices) {
+    const capitalized = [];
+    for (let i = 0; i < slug.length; i++) {
+        capitalized.push(indices.includes(i) ? slug[i].toUpperCase() : slug[i]);
+    }
+    return capitalized.join("");
+}
+/** Prints the index of a slug at the given indices. */
+export function printIndexSlug(slug, indices) {
+    indices = Array.from(new Set(indices)).sort((a, b) => a - b);
+    const isInterval = indices.length > 2 &&
+        Math.max(...indices) - Math.min(...indices) === indices.length - 1;
+    const indexString = isInterval
+        ? `${Math.min(...indices).toString()}..${Math.max(...indices).toString()}`
+        : `${indices.slice(0, 5).join(", ")}${indices.length > 5 ? ", ..." : ""}`;
+    return `index(${slug}, ${indexString}) = ${capitalizeAt(slug, indices)}`;
+}
+/** Returns an array of numbers from start to end (inclusive). */
+export function interval(start, end, step = 1) {
+    const result = [];
+    for (let i = start; i <= end; i += step) {
+        result.push(i);
+    }
+    return result;
+}
+/** Cartesian product of iterables. */
+function* product(...args) {
+    if (args.length === 1) {
+        for (const arg of args[0]) {
+            yield [arg];
+        }
+        return;
+    }
+    const [first, ...rest] = args;
+    for (const a of first) {
+        for (const b of product(...rest)) {
+            yield [a, ...b];
+        }
+    }
+}
+/** Map a function to a product of iterators. */
+export function* mapProduct(fn, ...args) {
+    for (const arg of product(...args)) {
+        yield fn(...arg);
+    }
+}
+/** Returns the ordinal suffix of the given number. */
+export function ordinal(n) {
+    const suffix = Math.abs(n) % 100 >= 11 && Math.abs(n) % 100 <= 14
+        ? "th"
+        : Math.abs(n) % 10 === 1
+            ? "st"
+            : Math.abs(n) % 10 === 2
+                ? "nd"
+                : Math.abs(n) % 10 === 3
+                    ? "rd"
+                    : "th";
+    return `${n.toString()}${suffix}`;
+}
+const aCharCode = "a".charCodeAt(0);
+/** Caesar shift a slug. */
+export function caesar(slug, n) {
+    n %= 26;
+    return Array.from(slug, (c) => {
+        return String.fromCharCode(((c.charCodeAt(0) - aCharCode + n + 26) % 26) + aCharCode);
+    }).join("");
+}
+/** Returns an iterator over [index, item] pairs. */
+export function* enumerate(iter) {
+    let i = 0;
+    for (const item of iter) {
+        yield [i, item];
+        i += 1;
+    }
+}
+export function* windows(iter, size) {
+    const buffer = [];
+    for (const item of iter) {
+        if (buffer.length === size) {
+            buffer.shift();
+        }
+        buffer.push(item);
+        if (buffer.length === size) {
+            yield buffer.slice();
+        }
+    }
+}
+/**
+ * If the given array is a non-constant arithmetic sequence, returns the start,
+ * step, and last. Else, returns null.
+ */
+export function getArithmeticSequenceInfo(terms) {
+    if (terms.length < 2) {
+        return null;
+    }
+    terms.sort((a, b) => a - b);
+    const start = terms[0];
+    const step = terms[1] - start;
+    if (step === 0) {
+        return null;
+    }
+    for (let i = 2; i < terms.length; i++) {
+        if (terms[i] - terms[i - 1] !== step) {
+            return null;
+        }
+    }
+    return { start, step, last: terms.at(-1) };
+}
+//# sourceMappingURL=util.js.map

package/dist/lib/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/lib/util.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAEvD,8DAA8D;AAC9D,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,OAAiB;IAC1D,MAAM,WAAW,GAAG,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,cAAc,CAAC,IAAY,EAAE,OAAiB;IAC5D,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7D,MAAM,UAAU,GACd,OAAO,CAAC,MAAM,GAAG,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IACrE,MAAM,WAAW,GAAG,UAAU;QAC5B,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC1E,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IAC5E,OAAO,SAAS,IAAI,KAAK,WAAW,OAAO,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;AAC3E,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,QAAQ,CAAC,KAAa,EAAE,GAAW,EAAE,IAAI,GAAG,CAAC;IAC3D,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAUD,sCAAsC;AACtC,QAAQ,CAAC,CAAC,OAAO,CACf,GAAG,IAAU;IAEb,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,CAAC,CAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAkB,CAAC;QAC/B,CAAC;QACD,OAAO;IACT,CAAC;IACD,MAAM,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAkB,CAAC;QACnC,CAAC;IACH,CAAC;AACH,CAAC;AAMD,gDAAgD;AAChD,MAAM,SAAS,CAAC,CAAC,UAAU,CACzB,EAAwB,EACxB,GAAG,IAAmB;IAEtB,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,EAAE,CAAC,GAAI,GAAuB,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,MAAM,MAAM,GACV,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,EAAE;QAChD,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC;YACtB,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC;gBACtB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC;oBACtB,CAAC,CAAC,IAAI;oBACN,CAAC,CAAC,IAAI,CAAC;IACjB,OAAO,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,MAAM,EAAE,CAAC;AACpC,CAAC;AAED,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAEpC,2BAA2B;AAC3B,MAAM,UAAU,MAAM,CAAC,IAAY,EAAE,CAAS;IAC5C,CAAC,IAAI,EAAE,CAAC;IACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;QAC5B,OAAO,MAAM,CAAC,YAAY,CACxB,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,SAAS,CAC1D,CAAC;IACJ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC;AAED,oDAAoD;AACpD,MAAM,SAAS,CAAC,CAAC,SAAS,CAAI,IAAiB;IAC7C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAChB,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;AACH,CAAC;AAMD,MAAM,SAAS,CAAC,CAAC,OAAO,CAAC,IAAmB,EAAE,IAAY;IACxD,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,MAAM,CAAC,KAAK,EAAE,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CAAC,KAAe;IAKvD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IACxB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC;IAC/B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,KAAK,IAAI,EAAE,CAAC;YACvC,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC;AAC9C,CAAC"}

package/dist/lib/wordlist.d.ts

@@ -0,0 +1,66 @@
+import { PrefixDistribution, SuffixDistribution } from "./affixDistribution.js";
+import { LetterDistribution } from "./letterDistribution.js";
+import { LogNum } from "./logNum.js";
+/**
+ * Info about the words in a wordlist.
+ *
+ * We assume (as in `cromulence`) that words appearing in puzzles are
+ * distributed via Zipf frequency.
+ */
+export declare class Wordlist {
+    private cromulence;
+    /** A map from letter bitsets to words with that bitset. */
+    private bitsets;
+    /** The letter distribution of the wordlist. */
+    letters: LetterDistribution;
+    /** The prefix distribution of the wordlist. */
+    prefixes: PrefixDistribution;
+    /** The suffix distribution of the wordlist. */
+    suffixes: SuffixDistribution;
+    constructor(wordlist: Record<string, number>);
+    static download(): Promise<Wordlist>;
+    /**
+     * For testing purposes: create a wordlist from an array of words, each
+     * equiprobable.
+     */
+    static from(words: string[]): Wordlist;
+    /** Apply a reducer to each word in the wordlist. */
+    reduce<T>(initial: T, reducer: (acc: T, slug: string, zipf: number) => T): T;
+    /**
+     * Get the log prob that a wordlist item, drawn uniformly at random,
+     * satisfies the given property. This is NOT weighted by zipf!
+     */
+    logProb(property: (slug: string) => boolean): LogNum;
+    /** Returns true if the given slug is in the wordlist. */
+    isWord(slug: string, { threshold }?: {
+        threshold?: number;
+    }): boolean;
+    /** Returns true if any of the given slugs are in the wordlist. */
+    hasWord(slugs: string[], { threshold }?: {
+        threshold?: number;
+    }): boolean;
+    /** Filters for slugs in the wordlist, sorted from most common to least. */
+    filterWords(slugs: string[], { threshold }?: {
+        threshold?: number;
+    }): string[];
+    /**
+     * Filters for slugs in the wordlist under the given getter, sorted from most
+     * common to least.
+     */
+    filterWordsUnder<T>(items: T[], getSlug: (item: T) => string, { threshold }?: {
+        threshold?: number;
+    }): T[];
+    /** Returns true if the given phrase is in the wordlist. */
+    isPhrase(phrase: string): boolean;
+    /** Returns the anagrams of a given slug, sorted from most common to least. */
+    anagrams(slug: string, { loose, threshold, }?: {
+        loose?: boolean;
+        threshold?: number;
+    }): string[];
+    /**
+     * Prob that, for two words, the first has a suffix equal to the second's
+     * prefix, of the given length.
+     */
+    probSharedAffix(length: number): LogNum;
+}
+//# sourceMappingURL=wordlist.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"wordlist.d.ts","sourceRoot":"","sources":["../../src/lib/wordlist.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAEhF,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAGrC;;;;;GAKG;AACH,qBAAa,QAAQ;IACnB,OAAO,CAAC,UAAU,CAAa;IAC/B,2DAA2D;IAC3D,OAAO,CAAC,OAAO,CAAgB;IAC/B,+CAA+C;IAC/C,OAAO,EAAE,kBAAkB,CAAC;IAC5B,+CAA+C;IAC/C,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,+CAA+C;IAC/C,QAAQ,EAAE,kBAAkB,CAAC;gBAEjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;WAQ/B,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC;IAI1C;;;OAGG;IACH,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,QAAQ;IAgBtC,oDAAoD;IACpD,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC;IAS5E;;;OAGG;IACH,OAAO,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,GAAG,MAAM;IAQpD,yDAAyD;IACzD,MAAM,CACJ,IAAI,EAAE,MAAM,EACZ,EAAE,SAAa,EAAE,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GAC7C,OAAO;IAIV,kEAAkE;IAClE,OAAO,CACL,KAAK,EAAE,MAAM,EAAE,EACf,EAAE,SAAa,EAAE,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GAC7C,OAAO;IAIV,2EAA2E;IAC3E,WAAW,CACT,KAAK,EAAE,MAAM,EAAE,EACf,EAAE,SAAa,EAAE,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GAC7C,MAAM,EAAE;IAUX;;;OAGG;IACH,gBAAgB,CAAC,CAAC,EAChB,KAAK,EAAE,CAAC,EAAE,EACV,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,EAC5B,EAAE,SAAa,EAAE,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GAC7C,CAAC,EAAE;IAQN,2DAA2D;IAC3D,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIjC,8EAA8E;IAC9E,QAAQ,CACN,IAAI,EAAE,MAAM,EACZ,EACE,KAAa,EACb,SAAa,GACd,GAAE;QAAE,KAAK,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GAC9C,MAAM,EAAE;IAUX;;;OAGG;IAEH,eAAe,CAAC,MAAM,EAAE,MAAM;CAU/B"}

package/dist/lib/wordlist.js

@@ -0,0 +1,166 @@
+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 { Cromulence, loadWordlist, logProbToZipf } from "cromulence";
+import { PrefixDistribution, SuffixDistribution } from "./affixDistribution.js";
+import { LetterBitsets } from "./letterBitset.js";
+import { LetterDistribution } from "./letterDistribution.js";
+import { LogNum } from "./logNum.js";
+import { memoize } from "./memoize.js";
+/**
+ * Info about the words in a wordlist.
+ *
+ * We assume (as in `cromulence`) that words appearing in puzzles are
+ * distributed via Zipf frequency.
+ */
+let Wordlist = (() => {
+    let _instanceExtraInitializers = [];
+    let _probSharedAffix_decorators;
+    return class Wordlist {
+        static {
+            const _metadata = typeof Symbol === "function" && Symbol.metadata ? Object.create(null) : void 0;
+            _probSharedAffix_decorators = [memoize()];
+            __esDecorate(this, null, _probSharedAffix_decorators, { kind: "method", name: "probSharedAffix", static: false, private: false, access: { has: obj => "probSharedAffix" in obj, get: obj => obj.probSharedAffix }, metadata: _metadata }, null, _instanceExtraInitializers);
+            if (_metadata) Object.defineProperty(this, Symbol.metadata, { enumerable: true, configurable: true, writable: true, value: _metadata });
+        }
+        cromulence = __runInitializers(this, _instanceExtraInitializers);
+        /** A map from letter bitsets to words with that bitset. */
+        bitsets;
+        /** The letter distribution of the wordlist. */
+        letters;
+        /** The prefix distribution of the wordlist. */
+        prefixes;
+        /** The suffix distribution of the wordlist. */
+        suffixes;
+        constructor(wordlist) {
+            this.cromulence = new Cromulence(wordlist);
+            this.bitsets = new LetterBitsets(Object.keys(wordlist));
+            this.letters = new LetterDistribution(Object.keys(wordlist));
+            this.prefixes = new PrefixDistribution(Object.keys(wordlist));
+            this.suffixes = new SuffixDistribution(Object.keys(wordlist));
+        }
+        static async download() {
+            return new Wordlist(await loadWordlist());
+        }
+        /**
+         * For testing purposes: create a wordlist from an array of words, each
+         * equiprobable.
+         */
+        static from(words) {
+            const logFrac = LogNum.fromFraction(1, words.length);
+            const wordlist = {};
+            for (const word of words) {
+                wordlist[word] = wordlist[word] ? wordlist[word].add(logFrac) : logFrac;
+            }
+            return new Wordlist(Object.fromEntries(Object.entries(wordlist).map(([word, logProb]) => [
+                word,
+                logProbToZipf(logProb.toLog()),
+            ])));
+        }
+        /** Apply a reducer to each word in the wordlist. */
+        reduce(initial, reducer) {
+            let result = initial;
+            for (const slug in this.cromulence.wordlist) {
+                const zipf = this.cromulence.wordlist[slug];
+                result = reducer(result, slug, zipf);
+            }
+            return result;
+        }
+        /**
+         * Get the log prob that a wordlist item, drawn uniformly at random,
+         * satisfies the given property. This is NOT weighted by zipf!
+         */
+        logProb(property) {
+            // TODO: maybe tweak the weights here to get better results?
+            // if we do so, do the same thing in letterDistribution
+            const count = this.reduce(0, (acc, slug) => acc + (property(slug) ? 1 : 0));
+            const total = Object.keys(this.cromulence.wordlist).length;
+            return LogNum.fromFraction(count, total);
+        }
+        /** Returns true if the given slug is in the wordlist. */
+        isWord(slug, { threshold = 0 } = {}) {
+            return (this.cromulence.wordlist[slug] ?? -1000) > threshold;
+        }
+        /** Returns true if any of the given slugs are in the wordlist. */
+        hasWord(slugs, { threshold = 0 } = {}) {
+            return slugs.some((slug) => this.isWord(slug, { threshold }));
+        }
+        /** Filters for slugs in the wordlist, sorted from most common to least. */
+        filterWords(slugs, { threshold = 0 } = {}) {
+            return slugs
+                .map((slug) => [slug, this.cromulence.wordlist[slug]])
+                .filter((t) => t[1] !== undefined && t[1] > threshold)
+                .sort((a, b) => b[1] - a[1])
+                .map((t) => t[0]);
+        }
+        /**
+         * Filters for slugs in the wordlist under the given getter, sorted from most
+         * common to least.
+         */
+        filterWordsUnder(items, getSlug, { threshold = 0 } = {}) {
+            return items
+                .map((item) => [item, this.cromulence.wordlist[getSlug(item)]])
+                .filter((t) => t[1] !== undefined && t[1] > threshold)
+                .sort((a, b) => b[1] - a[1])
+                .map((t) => t[0]);
+        }
+        /** Returns true if the given phrase is in the wordlist. */
+        isPhrase(phrase) {
+            return this.cromulence.cromulence(phrase) > 0;
+        }
+        /** Returns the anagrams of a given slug, sorted from most common to least. */
+        anagrams(slug, { loose = false, threshold = 0, } = {}) {
+            return this.bitsets
+                .get(slug)
+                .filter((word) => loose || word !== slug)
+                .map((word) => [word, this.cromulence.wordlist[word]])
+                .filter((t) => t[1] > threshold)
+                .sort((a, b) => b[1] - a[1])
+                .map((t) => t[0]);
+        }
+        /**
+         * Prob that, for two words, the first has a suffix equal to the second's
+         * prefix, of the given length.
+         */
+        probSharedAffix(length) {
+            const prefixes = this.prefixes.get(length);
+            const suffixes = this.suffixes.get(length);
+            return LogNum.sum(Array.from(prefixes.entries(), ([prefix, prefixProb]) => {
+                return prefixProb.mul(suffixes.get(prefix));
+            }));
+        }
+    };
+})();
+export { Wordlist };
+//# sourceMappingURL=wordlist.js.map

package/dist/lib/wordlist.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wordlist.js","sourceRoot":"","sources":["../../src/lib/wordlist.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAChF,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC;;;;;GAKG;IACU,QAAQ;;;iBAAR,QAAQ;;;2CAyIlB,OAAO,EAAE;YACV,gMAAA,eAAe,6DASd;;;QAlJO,UAAU,GADP,mDAAQ,CACY;QAC/B,2DAA2D;QACnD,OAAO,CAAgB;QAC/B,+CAA+C;QAC/C,OAAO,CAAqB;QAC5B,+CAA+C;QAC/C,QAAQ,CAAqB;QAC7B,+CAA+C;QAC/C,QAAQ,CAAqB;QAE7B,YAAY,QAAgC;YAC1C,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,OAAO,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC7D,IAAI,CAAC,QAAQ,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,QAAQ,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,QAAQ;YACnB,OAAO,IAAI,QAAQ,CAAC,MAAM,YAAY,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED;;;WAGG;QACH,MAAM,CAAC,IAAI,CAAC,KAAe;YACzB,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YACrD,MAAM,QAAQ,GAA2B,EAAE,CAAC;YAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAC1E,CAAC;YACD,OAAO,IAAI,QAAQ,CACjB,MAAM,CAAC,WAAW,CAChB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC;gBAChD,IAAI;gBACJ,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;aAC/B,CAAC,CACH,CACF,CAAC;QACJ,CAAC;QAED,oDAAoD;QACpD,MAAM,CAAI,OAAU,EAAE,OAAkD;YACtE,IAAI,MAAM,GAAG,OAAO,CAAC;YACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAE,CAAC;gBAC7C,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACvC,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED;;;WAGG;QACH,OAAO,CAAC,QAAmC;YACzC,4DAA4D;YAC5D,uDAAuD;YACvD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;YAC3D,OAAO,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;QAED,yDAAyD;QACzD,MAAM,CACJ,IAAY,EACZ,EAAE,SAAS,GAAG,CAAC,KAA6B,EAAE;YAE9C,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;QAC/D,CAAC;QAED,kEAAkE;QAClE,OAAO,CACL,KAAe,EACf,EAAE,SAAS,GAAG,CAAC,KAA6B,EAAE;YAE9C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,2EAA2E;QAC3E,WAAW,CACT,KAAe,EACf,EAAE,SAAS,GAAG,CAAC,KAA6B,EAAE;YAE9C,OAAO,KAAK;iBACT,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAU,CAAC;iBAC9D,MAAM,CACL,CAAC,CAAC,EAAyB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CACrE;iBACA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAED;;;WAGG;QACH,gBAAgB,CACd,KAAU,EACV,OAA4B,EAC5B,EAAE,SAAS,GAAG,CAAC,KAA6B,EAAE;YAE9C,OAAO,KAAK;iBACT,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAU,CAAC;iBACvE,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;iBACvE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAED,2DAA2D;QAC3D,QAAQ,CAAC,MAAc;YACrB,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChD,CAAC;QAED,8EAA8E;QAC9E,QAAQ,CACN,IAAY,EACZ,EACE,KAAK,GAAG,KAAK,EACb,SAAS,GAAG,CAAC,MAC8B,EAAE;YAE/C,OAAO,IAAI,CAAC,OAAO;iBAChB,GAAG,CAAC,IAAI,CAAC;iBACT,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC;iBACxC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAE,CAAU,CAAC;iBAC/D,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;iBAC/B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAED;;;WAGG;QAEH,eAAe,CAAC,MAAc;YAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE3C,OAAO,MAAM,CAAC,GAAG,CACf,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,EAAE;gBACtD,OAAO,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9C,CAAC,CAAC,CACH,CAAC;QACJ,CAAC;;;SAnJU,QAAQ"}

package/dist/linkers/index.d.ts

@@ -0,0 +1,34 @@
+import type { LinkOptions } from "../index.js";
+import { LogNum } from "../lib/logNum.js";
+import type { Wordlist } from "../lib/wordlist.js";
+/**
+ * A PartialLink is the subset of Link that a Linker needs to return. We do
+ * some processing before it ends up being a Link. See Link for full details.
+ */
+export type PartialLink = {
+    /** A human-readable link name; defaults to the name of the linker. */
+    name?: string;
+    /**
+     * Log prob we'd expect to see this link.
+     *
+     * Note that this should describe the log prob of the *name* of the link.
+     * A link with name "two distinct length values" should have the log prob
+     * that the words have *any two* distinct lengths, and the description
+     * should report more specifically what those lengths are.
+     */
+    logProb: LogNum;
+    /** Any extra info to include in the link. Can be blank. */
+    description: readonly string[];
+};
+/**
+ * A Linker is a function that takes a list of slugs and returns PartialLinks.
+ */
+export type Linker = {
+    name: string;
+    eval: (slugs: string[], options: Required<LinkOptions>) => PartialLink[];
+};
+/** All linkers. */
+export declare function allLinkers(wordlist: Wordlist): Linker[];
+/** For testing purposes. */
+export declare const testLinkOptions: Required<LinkOptions>;
+//# sourceMappingURL=index.d.ts.map

package/dist/linkers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/linkers/index.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAKnD;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG;IACxB,sEAAsE;IACtE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;;;OAOG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;CAChC,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,MAAM,GAAG;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC,WAAW,CAAC,KAAK,WAAW,EAAE,CAAC;CAC1E,CAAC;AAEF,mBAAmB;AACnB,wBAAgB,UAAU,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,EAAE,CAQvD;AAED,4BAA4B;AAC5B,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,WAAW,CAKjD,CAAC"}

package/dist/linkers/index.js

@@ -0,0 +1,25 @@
+import { answerLengthLogProbs } from "../data/answerLengths.js";
+import { featureLinkers } from "../features/index.js";
+import { LengthDistribution } from "../lib/lengthDistribution.js";
+import { LogNum } from "../lib/logNum.js";
+import { indexingLinker } from "./indexing.js";
+import { lengthLinker } from "./length.js";
+import { otherLinker } from "./other.js";
+/** All linkers. */
+export function allLinkers(wordlist) {
+    const lengthDist = LengthDistribution.from(answerLengthLogProbs);
+    return [
+        ...featureLinkers(wordlist),
+        indexingLinker(wordlist),
+        lengthLinker(lengthDist),
+        otherLinker(wordlist),
+    ];
+}
+/** For testing purposes. */
+export const testLinkOptions = {
+    lazy: false,
+    limit: Infinity,
+    minFeatureRatio: 0,
+    ordered: true,
+};
+//# sourceMappingURL=index.js.map

package/dist/linkers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/linkers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAClE,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AA8BzC,mBAAmB;AACnB,MAAM,UAAU,UAAU,CAAC,QAAkB;IAC3C,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACjE,OAAO;QACL,GAAG,cAAc,CAAC,QAAQ,CAAC;QAC3B,cAAc,CAAC,QAAQ,CAAC;QACxB,YAAY,CAAC,UAAU,CAAC;QACxB,WAAW,CAAC,QAAQ,CAAC;KACtB,CAAC;AACJ,CAAC;AAED,4BAA4B;AAC5B,MAAM,CAAC,MAAM,eAAe,GAA0B;IACpD,IAAI,EAAE,KAAK;IACX,KAAK,EAAE,QAAQ;IACf,eAAe,EAAE,CAAC;IAClB,OAAO,EAAE,IAAI;CACd,CAAC"}

package/dist/linkers/indexing.d.ts

@@ -0,0 +1,5 @@
+import type { Wordlist } from "../lib/wordlist.js";
+import type { Linker } from "./index.js";
+/** Links of the form "the nth indices are..." */
+export declare function indexingLinker(wordlist: Wordlist): Linker;
+//# sourceMappingURL=indexing.d.ts.map

package/dist/linkers/indexing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexing.d.ts","sourceRoot":"","sources":["../../src/linkers/indexing.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,MAAM,EAAe,MAAM,YAAY,CAAC;AAqKtD,iDAAiD;AACjD,wBAAgB,cAAc,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAwBzD"}