@kensio/pinyinjs 1.7.4 → 1.7.5

package/dist/script/conversion.js

@@ -1,5 +1,7 @@
 import { readSyllable, writeSyllable } from "../syllable/syllable.js";
 import { toCharacters } from "./characters.js";
+export { readScriptTables } from "./conversion-read.js";
+export { writeScriptTables } from "./conversion-write.js";
 /**
  * The key a reading is stored under: numbered pinyin, or the empty string.
  *
@@ -67,121 +69,6 @@ export function convertCharacters(table, word, readings = []) {
     }
     return converted;
 }
-const COLUMN = "\t";
-const LINE = "\n";
-const READING = ",";
-const READING_FORM = "=";
-/**
- * Line tags, one per table, so that all six ship as one fetchable file.
- */
-const TAGS = {
-    toTraditional: "t",
-    toSimplified: "s",
-    traditionalWord: "w",
-    simplifiedWord: "x",
-    hansOnly: "h",
-    hantOnly: "H",
-};
-/**
- * Write one character table's lines.
- */
-function writeCharacterTable(tag, table) {
-    return [...table].map(([character, conversion]) => {
-        const readings = [...(conversion.byReading ?? [])]
-            .map(([key, form]) => `${key}${READING_FORM}${form}`)
-            .join(READING);
-        const also = (conversion.also ?? []).join("");
-        const columns = [tag, character, conversion.to, readings, also];
-        // Trailing empty columns say nothing and are dropped, which is most lines:
-        // the common case is a character with one form and no reading to condition.
-        while (columns.at(-1) === "") {
-            columns.pop();
-        }
-        return columns.join(COLUMN);
-    });
-}
-/**
- * Write the tables as the artifact text.
- *
- * One line per mapping, tagged by which table it belongs to, so the whole of
- * script conversion is a single file to fetch and a single scan to read. The
- * format is the same shape as the dictionary's: separators rather than syntax,
- * so that reading it back is a split rather than a parse.
- */
-export function writeScriptTables(tables) {
-    return [
-        ...writeCharacterTable(TAGS.toTraditional, tables.toTraditional),
-        ...writeCharacterTable(TAGS.toSimplified, tables.toSimplified),
-        ...[...tables.traditionalWords].map(([hans, hant]) => [TAGS.traditionalWord, hans, hant].join(COLUMN)),
-        ...[...tables.simplifiedWords].map(([hant, hans]) => [TAGS.simplifiedWord, hant, hans].join(COLUMN)),
-        ...[...tables.hansOnly].map((character) => [TAGS.hansOnly, character].join(COLUMN)),
-        ...[...tables.hantOnly].map((character) => [TAGS.hantOnly, character].join(COLUMN)),
-        "",
-    ].join(LINE);
-}
-/**
- * Read one character table line into its conversion.
- */
-function readConversion(to, readings, also) {
-    const pairs = readings === "" ? [] : readings.split(READING);
-    const byReading = new Map();
-    for (const pair of pairs) {
-        const [key = "", form = ""] = pair.split(READING_FORM);
-        if (form !== "") {
-            byReading.set(key, form);
-        }
-    }
-    return {
-        to,
-        ...(byReading.size > 0 && { byReading }),
-        ...(also !== "" && { also: toCharacters(also) }),
-    };
-}
-/**
- * Read the tables back from the artifact text.
- *
- * Unknown tags are skipped rather than rejected, so that a future table can be
- * added without an older reader refusing the file outright.
- */
-export function readScriptTables(text) {
-    const toTraditional = new Map();
-    const toSimplified = new Map();
-    const traditionalWords = new Map();
-    const simplifiedWords = new Map();
-    const hansOnly = new Set();
-    const hantOnly = new Set();
-    const characterTables = new Map([
-        [TAGS.toTraditional, toTraditional],
-        [TAGS.toSimplified, toSimplified],
-    ]);
-    const wordTables = new Map([
-        [TAGS.traditionalWord, traditionalWords],
-        [TAGS.simplifiedWord, simplifiedWords],
-    ]);
-    const characterSets = new Map([
-        [TAGS.hansOnly, hansOnly],
-        [TAGS.hantOnly, hantOnly],
-    ]);
-    for (const line of text.split(LINE)) {
-        const [tag = "", from = "", to = "", readings = "", also = ""] = line.split(COLUMN);
-        if (from === "") {
-            continue;
-        }
-        // Dispatching on a map rather than a switch keeps an unknown tag a no-op,
-        // so a file written by a later version reads as much as this one knows.
-        characterTables.get(tag)?.set(from, readConversion(to, readings, also));
-        wordTables.get(tag)?.set(from, to);
-        characterSets.get(tag)?.add(from);
-    }
-    return {
-        toTraditional,
-        toSimplified,
-        traditionalWords,
-        simplifiedWords,
-        hansOnly,
-        hantOnly,
-    };
-}
 /**
  * Parse a stored reading key back into a syllable.
  *

package/dist/script/conversion.js.map

@@ -1 +1 @@
-{"version":3,"file":"conversion.js","sourceRoot":"","sources":["../../src/script/conversion.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAkD/C;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,QAA8B;IAC1D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,oDAAoD;IACpD,OAAO,aAAa,CAAC,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;AACjE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAA+C,EAC/C,SAAiB,EACjB,QAA8B;IAE9B,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACpC,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC;AACzD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAA+C,EAC/C,SAAiB;IAEjB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,CACL,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAC5E,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CACrB,UAA2C;IAE3C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO;QACL,GAAG,IAAI,GAAG,CAAC;YACT,UAAU,CAAC,EAAE;YACb,GAAG,CAAC,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YACzC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC;SAC3B,CAAC;KACH,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA+C,EAC/C,IAAY,EACZ,QAAQ,GAAsC,EAAE;IAEhD,IAAI,SAAS,GAAG,EAAE,CAAC;IACnB,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,SAAS,IAAI,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,MAAM,GAAG,IAAI,CAAC;AAEpB,MAAM,IAAI,GAAG,IAAI,CAAC;AAElB,MAAM,OAAO,GAAG,GAAG,CAAC;AAEpB,MAAM,YAAY,GAAG,GAAG,CAAC;AAEzB;;GAEG;AACH,MAAM,IAAI,GAAG;IACX,aAAa,EAAE,GAAG;IAClB,YAAY,EAAE,GAAG;IACjB,eAAe,EAAE,GAAG;IACpB,cAAc,EAAE,GAAG;IACnB,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG;CACL,CAAC;AAEX;;GAEG;AACH,SAAS,mBAAmB,CAC1B,GAAW,EACX,KAA+C;IAE/C,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,EAAE;QAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;aAC/C,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,YAAY,GAAG,IAAI,EAAE,CAAC;aACpD,IAAI,CAAC,OAAO,CAAC,CAAC;QACjB,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAChE,2EAA2E;QAC3E,4EAA4E;QAC5E,OAAO,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,EAAE,CAAC;QAChB,CAAC;QACD,OAAO,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAoB;IACpD,OAAO;QACL,GAAG,mBAAmB,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,aAAa,CAAC;QAChE,GAAG,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,YAAY,CAAC;QAC9D,GAAG,CAAC,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CACnD,CAAC,IAAI,CAAC,eAAe,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAChD;QACD,GAAG,CAAC,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAClD,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAC/C;QACD,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CACxC,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CACxC;QACD,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CACxC,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CACxC;QACD,EAAE;KACH,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACrB,EAAU,EACV,QAAgB,EAChB,IAAY;IAEZ,MAAM,KAAK,GAAG,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO;QACL,EAAE;QACF,GAAG,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;KACjD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC7D,MAAM,YAAY,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC5D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,MAAM,eAAe,GAAG,IAAI,GAAG,CAA2C;QACxE,CAAC,IAAI,CAAC,aAAa,EAAE,aAAa,CAAC;QACnC,CAAC,IAAI,CAAC,YAAY,EAAE,YAAY,CAAC;KAClC,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,IAAI,GAAG,CAA8B;QACtD,CAAC,IAAI,CAAC,eAAe,EAAE,gBAAgB,CAAC;QACxC,CAAC,IAAI,CAAC,cAAc,EAAE,eAAe,CAAC;KACvC,CAAC,CAAC;IACH,MAAM,aAAa,GAAG,IAAI,GAAG,CAAsB;QACjD,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC;QACzB,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC;KAC1B,CAAC,CAAC;IAEH,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,GAC5D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrB,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,SAAS;QACX,CAAC;QACD,0EAA0E;QAC1E,wEAAwE;QACxE,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,cAAc,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;QACxE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,OAAO;QACL,aAAa;QACb,YAAY;QACZ,gBAAgB;QAChB,eAAe;QACf,QAAQ;QACR,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;AACpD,CAAC"}
+{"version":3,"file":"conversion.js","sourceRoot":"","sources":["../../src/script/conversion.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAkD1D;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,QAA8B;IAC1D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,oDAAoD;IACpD,OAAO,aAAa,CAAC,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;AACjE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAA+C,EAC/C,SAAiB,EACjB,QAA8B;IAE9B,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACpC,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC;AACzD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAA+C,EAC/C,SAAiB;IAEjB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,CACL,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAC5E,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CACrB,UAA2C;IAE3C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO;QACL,GAAG,IAAI,GAAG,CAAC;YACT,UAAU,CAAC,EAAE;YACb,GAAG,CAAC,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YACzC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,EAAE,CAAC;SAC3B,CAAC;KACH,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA+C,EAC/C,IAAY,EACZ,QAAQ,GAAsC,EAAE;IAEhD,IAAI,SAAS,GAAG,EAAE,CAAC;IACnB,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,SAAS,IAAI,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;AACpD,CAAC"}

package/dist/search/candidate-narrowing.d.ts

@@ -0,0 +1,56 @@
+/**
+ * How a found candidate list is narrowed before it is handed back.
+ *
+ * Both of the searches in `candidates.ts` end the same way: they have every word
+ * a reading reaches, in rank order, and the caller wants fewer of them. The
+ * narrowing is the same for both — collapse the two scripts, then cut to the
+ * limit — so it lives here rather than twice there, and the options that drive
+ * it live beside it.
+ */
+import { type ScriptTables } from "../script/conversion.js";
+import type { Script } from "../script/script.js";
+/**
+ * Which script a caller wants a candidate list written in, and the tables that
+ * can tell.
+ *
+ * The two are one option because neither is any use without the other. Both
+ * scripts are dictionary keys, so a reading group holds 银行 *and* 銀行 — over a
+ * third of a typical list is that pairing — and the artifact deliberately does
+ * not record which 简体 form pairs with which 繁體 one, since conversion never
+ * needs it. So the index cannot pair them on its own, and honouring a
+ * preference means loading `script.map`: about 100 KB that the hanzi → pinyin
+ * path never fetches.
+ *
+ * Asking for the preference and the tables in one object is what keeps that
+ * cost visible at the call site rather than hidden inside a load.
+ *
+ * ```ts
+ * const tables = await loadScriptTables(source);
+ * candidates(index, "yinhang", { script: { prefer: "Hans", tables } });
+ * // 银行, and not 銀行 beside it
+ * ```
+ */
+export interface ScriptPreference {
+    /** The script to keep where both writings of a word are candidates. */
+    readonly prefer: Script;
+    /** The conversion tables, from `loadScriptTables`. */
+    readonly tables: ScriptTables;
+}
+/**
+ * How a candidate list should be narrowed.
+ */
+export interface CandidateOptions {
+    /** How many candidates to return at most. */
+    readonly limit?: number;
+    /** Keep one writing of a word rather than both; see {@link ScriptPreference}. */
+    readonly script?: ScriptPreference;
+}
+/**
+ * Apply the caller's options to a ranked list of candidates.
+ *
+ * In that order, because a limit counts what the caller will actually see: a
+ * list of five that collapses to three should be cut to three, not cut to five
+ * and then collapsed to two.
+ */
+export declare function narrowCandidates(found: readonly string[], options: CandidateOptions): readonly string[];
+//# sourceMappingURL=candidate-narrowing.d.ts.map

package/dist/search/candidate-narrowing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-narrowing.d.ts","sourceRoot":"","sources":["../../src/search/candidate-narrowing.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAqB,KAAK,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAElD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,gBAAgB;IAC/B,uEAAuE;IACvE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,iFAAiF;IACjF,QAAQ,CAAC,MAAM,CAAC,EAAE,gBAAgB,CAAC;CACpC;AAuCD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,OAAO,EAAE,gBAAgB,GACxB,SAAS,MAAM,EAAE,CAMnB"}

package/dist/search/candidate-narrowing.js

@@ -0,0 +1,55 @@
+/**
+ * How a found candidate list is narrowed before it is handed back.
+ *
+ * Both of the searches in `candidates.ts` end the same way: they have every word
+ * a reading reaches, in rank order, and the caller wants fewer of them. The
+ * narrowing is the same for both — collapse the two scripts, then cut to the
+ * limit — so it lives here rather than twice there, and the options that drive
+ * it live beside it.
+ */
+import { convertCharacters } from "../script/conversion.js";
+/**
+ * Keep one writing of a word where the group holds both scripts.
+ *
+ * Paired by 简体 form in both directions rather than by converting toward the
+ * preference, because simplification is many-to-one and so the 简体 form is the
+ * one both writings agree on. Going the other way needs a reading to tell 發
+ * from 髮, and a pair that failed to meet would simply be left as two.
+ *
+ * The kept writing takes the rank of the better-placed of the two, so
+ * collapsing a list never reorders what is left of it.
+ */
+function preferScript(words, script) {
+    /** Whether a candidate is the writing the caller asked for. */
+    const isWanted = (word, simplified) => script.prefer === "Hans" ? word === simplified : word !== simplified;
+    const chosen = new Map();
+    const order = [];
+    for (const word of words) {
+        const simplified = convertCharacters(script.tables.toSimplified, word);
+        const held = chosen.get(simplified);
+        if (held === undefined) {
+            chosen.set(simplified, word);
+            order.push(simplified);
+            continue;
+        }
+        if (!isWanted(held, simplified) && isWanted(word, simplified)) {
+            chosen.set(simplified, word);
+        }
+    }
+    /* c8 ignore next -- every entry in `order` was put in `chosen` beside it */
+    return order.map((simplified) => chosen.get(simplified) ?? simplified);
+}
+/**
+ * Apply the caller's options to a ranked list of candidates.
+ *
+ * In that order, because a limit counts what the caller will actually see: a
+ * list of five that collapses to three should be cut to three, not cut to five
+ * and then collapsed to two.
+ */
+export function narrowCandidates(found, options) {
+    const preferred = options.script === undefined ? found : preferScript(found, options.script);
+    return options.limit === undefined
+        ? preferred
+        : preferred.slice(0, Math.max(0, options.limit));
+}
+//# sourceMappingURL=candidate-narrowing.js.map

package/dist/search/candidate-narrowing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-narrowing.js","sourceRoot":"","sources":["../../src/search/candidate-narrowing.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,iBAAiB,EAAqB,MAAM,yBAAyB,CAAC;AAyC/E;;;;;;;;;;GAUG;AACH,SAAS,YAAY,CACnB,KAAwB,EACxB,MAAwB;IAExB,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,UAAkB,EAAW,EAAE,CAC7D,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC;IAEvE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACvE,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;YAC9D,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AACzE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAwB,EACxB,OAAyB;IAEzB,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7E,OAAO,OAAO,CAAC,KAAK,KAAK,SAAS;QAChC,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC"}

package/dist/search/candidate-query.d.ts

@@ -0,0 +1,25 @@
+/**
+ * A query in the one form the index is searched by, and the one it is filtered
+ * by.
+ */
+export interface Query {
+    /** The folded spelling, which is a reading key: toneless, no ü, no spaces. */
+    readonly key: string;
+    /** What was typed, with `v` and `u:` resolved and any tone still on it. */
+    readonly written: string;
+}
+/**
+ * Put a typed query into both the forms a search needs.
+ *
+ * Case, spacing and the ways of writing ü are all noise on the way to the key,
+ * and the tone is noise there too — the index is keyed toneless. None of it is
+ * noise on the way to the *filter*, which is what honours a tone the query
+ * wrote, so the resolved spelling is kept alongside.
+ *
+ * A tone written as a mark counts here, unlike in `match`. The reason it cannot
+ * count there is that a mark says nothing about where its syllable ends and a
+ * half-typed query is exactly where that is unsettled; here the candidate's own
+ * reading says where every syllable ends, so the mark has somewhere to land.
+ */
+export declare function readQuery(query: string): Query;
+//# sourceMappingURL=candidate-query.d.ts.map

package/dist/search/candidate-query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-query.d.ts","sourceRoot":"","sources":["../../src/search/candidate-query.ts"],"names":[],"mappings":"AAWA;;;GAGG;AACH,MAAM,WAAW,KAAK;IACpB,8EAA8E;IAC9E,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,2EAA2E;IAC3E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAK9C"}

package/dist/search/candidate-query.js

@@ -0,0 +1,28 @@
+/**
+ * Reading a search query into the tokens it is matched by.
+ *
+ * A query is written with or without tones, with or without separators, and
+ * with v for ü, so it is normalised before anything is looked up.
+ */
+import { stripToneMarks } from "../tone/tone-mark.js";
+import { readingKey } from "./reverse-index-format.js";
+import { SEPARATORS } from "./candidate-writings.js";
+import { normaliseUmlaut } from "../syllable/syllable.js";
+/**
+ * Put a typed query into both the forms a search needs.
+ *
+ * Case, spacing and the ways of writing ü are all noise on the way to the key,
+ * and the tone is noise there too — the index is keyed toneless. None of it is
+ * noise on the way to the *filter*, which is what honours a tone the query
+ * wrote, so the resolved spelling is kept alongside.
+ *
+ * A tone written as a mark counts here, unlike in `match`. The reason it cannot
+ * count there is that a mark says nothing about where its syllable ends and a
+ * half-typed query is exactly where that is unsettled; here the candidate's own
+ * reading says where every syllable ends, so the mark has somewhere to land.
+ */
+export function readQuery(query) {
+    const written = normaliseUmlaut(query.normalize("NFC").toLowerCase()).replaceAll(SEPARATORS, "");
+    return { key: readingKey(stripToneMarks(written)), written };
+}
+//# sourceMappingURL=candidate-query.js.map

package/dist/search/candidate-query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-query.js","sourceRoot":"","sources":["../../src/search/candidate-query.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAa1D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,OAAO,GAAG,eAAe,CAC7B,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CACrC,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IAC7B,OAAO,EAAE,GAAG,EAAE,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;AAC/D,CAAC"}

package/dist/search/candidate-writings.d.ts

@@ -0,0 +1,24 @@
+/**
+ * What a query may write between syllables, all of which mean nothing here.
+ *
+ * The same set the matcher accepts, minus its meaning: `match` treats a written
+ * boundary as evidence, because a haystack it is filtering can be read more than
+ * one way. A reverse index is asked for one reading and answers with the words
+ * that have it, so `yin hang` and `yinhang` are the same question.
+ */
+export declare const SEPARATORS: RegExp;
+/**
+ * The 儿化 suffix, which is the one letter a reading key keeps and a query may
+ * leave off.
+ */
+export declare const ERHUA = "r";
+/**
+ * Whether a query spells a reading, syllable by syllable.
+ *
+ * Walked as a set of positions the query can have been read up to rather than
+ * one cursor, because a syllable can be written more than one way and the ways
+ * are different lengths: `wanr2` is `wan` or `wanr`, and only what follows says
+ * which was meant.
+ */
+export declare function spells(query: string, reading: string, writings: Map<string, readonly string[]>): boolean;
+//# sourceMappingURL=candidate-writings.d.ts.map

package/dist/search/candidate-writings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-writings.d.ts","sourceRoot":"","sources":["../../src/search/candidate-writings.ts"],"names":[],"mappings":"AAYA;;;;;;;GAOG;AACH,eAAO,MAAM,UAAU,QAAgB,CAAC;AAmBxC;;;GAGG;AACH,eAAO,MAAM,KAAK,MAAM,CAAC;AAgDzB;;;;;;;GAOG;AACH,wBAAgB,MAAM,CACpB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GACvC,OAAO,CAsBT"}

package/dist/search/candidate-writings.js

@@ -0,0 +1,114 @@
+/**
+ * The ways a typist may write a reading the dictionary stores one way.
+ *
+ * A stored reading is `yin2 hang2`: syllables separated, tones as digits, ü
+ * written as ü. A query for it is whatever a keyboard makes easy. This module
+ * holds the whole span between the two, so that the lookup itself can ask one
+ * question — does this query spell this reading? — and nothing else.
+ */
+import { applyToneMark } from "../tone/tone-mark.js";
+import { readSyllable, writeSyllable } from "../syllable/syllable.js";
+import { TONES } from "../tone/tone.js";
+/**
+ * What a query may write between syllables, all of which mean nothing here.
+ *
+ * The same set the matcher accepts, minus its meaning: `match` treats a written
+ * boundary as evidence, because a haystack it is filtering can be read more than
+ * one way. A reverse index is asked for one reading and answers with the words
+ * that have it, so `yin hang` and `yinhang` are the same question.
+ */
+export const SEPARATORS = /[\s'’‘-]+/gu;
+/**
+ * A tone written as a digit, which is the last character of a syllable.
+ */
+const TONE_DIGIT = /^[0-5]$/u;
+/**
+ * Every tone a syllable that wrote none could be standing for.
+ */
+const TONE_DIGITS = ["1", "2", "3", "4", "5"];
+/**
+ * The umlaut the readings are written with, and the letter a keyboard has.
+ */
+const UMLAUT = "ü";
+const PLAIN_U = "u";
+/**
+ * The 儿化 suffix, which is the one letter a reading key keeps and a query may
+ * leave off.
+ */
+export const ERHUA = "r";
+/**
+ * Every way a typist may write one syllable of a stored reading.
+ *
+ * `shi4` is written `shi`, `shi4` or `shì`; `lü4` adds `lu` and `lu4`, since ü
+ * is not on the keyboard; and an 儿化 `wanr2` adds the whole set again with the
+ * r left off, because 玩儿 is `wanr` to one typist and `wan` to another.
+ *
+ * The r comes off only where the syllable really is 儿化. 儿 itself is `er2`,
+ * and letting that shed its r would answer `e` with 儿.
+ */
+function writingsOf(token) {
+    const digit = token.slice(-1);
+    const toned = TONE_DIGIT.test(digit);
+    const spelling = toned ? token.slice(0, -1) : token;
+    const syllable = readSyllable(token);
+    // A reading with no tone written cannot contradict one, so a query is free to
+    // write any. Every reading the shipped artifacts hold has a tone digit on it,
+    // so this is a case a hand-built dictionary reaches rather than a real one.
+    const tones = toned ? [digit] : TONE_DIGITS;
+    const written = new Set();
+    const add = (form) => {
+        const plain = form.replaceAll(UMLAUT, PLAIN_U);
+        written.add(form);
+        written.add(plain);
+        for (const tone of tones) {
+            written.add(`${form}${tone}`);
+            written.add(`${plain}${tone}`);
+        }
+        if (!toned) {
+            for (const tone of TONES) {
+                written.add(applyToneMark(form, tone));
+            }
+        }
+    };
+    add(spelling);
+    if (syllable !== undefined) {
+        written.add(writeSyllable(syllable, "marks"));
+        if (syllable.erhua === true) {
+            add(spelling.slice(0, -ERHUA.length));
+            written.add(writeSyllable({ ...syllable, erhua: false }, "marks"));
+        }
+    }
+    return [...written];
+}
+/**
+ * Whether a query spells a reading, syllable by syllable.
+ *
+ * Walked as a set of positions the query can have been read up to rather than
+ * one cursor, because a syllable can be written more than one way and the ways
+ * are different lengths: `wanr2` is `wan` or `wanr`, and only what follows says
+ * which was meant.
+ */
+export function spells(query, reading, writings) {
+    let reached = new Set([0]);
+    for (const token of reading.split(" ")) {
+        let forms = writings.get(token);
+        if (forms === undefined) {
+            forms = writingsOf(token);
+            writings.set(token, forms);
+        }
+        const next = new Set();
+        for (const at of reached) {
+            for (const form of forms) {
+                if (query.startsWith(form, at)) {
+                    next.add(at + form.length);
+                }
+            }
+        }
+        if (next.size === 0) {
+            return false;
+        }
+        reached = next;
+    }
+    return reached.has(query.length);
+}
+//# sourceMappingURL=candidate-writings.js.map

package/dist/search/candidate-writings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-writings.js","sourceRoot":"","sources":["../../src/search/candidate-writings.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACtE,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,aAAa,CAAC;AAExC;;GAEG;AACH,MAAM,UAAU,GAAG,UAAU,CAAC;AAE9B;;GAEG;AACH,MAAM,WAAW,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE9C;;GAEG;AACH,MAAM,MAAM,GAAG,GAAG,CAAC;AAEnB,MAAM,OAAO,GAAG,GAAG,CAAC;AAEpB;;;GAGG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,GAAG,CAAC;AAEzB;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,KAAa;IAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACpD,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACrC,8EAA8E;IAC9E,8EAA8E;IAC9E,4EAA4E;IAC5E,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IAE5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC/C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,GAAG,CAAC,QAAQ,CAAC,CAAC;IACd,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;QAC9C,IAAI,QAAQ,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC5B,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CACpB,KAAa,EACb,OAAe,EACf,QAAwC;IAExC,IAAI,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YAC1B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACnC,CAAC"}

package/dist/search/candidates.d.ts

@@ -1,42 +1,6 @@
-import { type ScriptTables } from "../script/conversion.js";
-import type { Script } from "../script/script.js";
+import { type CandidateOptions } from "./candidate-narrowing.js";
 import { type ReverseIndex } from "./reverse-index.js";
-/**
- * Which script a caller wants a candidate list written in, and the tables that
- * can tell.
- *
- * The two are one option because neither is any use without the other. Both
- * scripts are dictionary keys, so a reading group holds 银行 *and* 銀行 — over a
- * third of a typical list is that pairing — and the artifact deliberately does
- * not record which 简体 form pairs with which 繁體 one, since conversion never
- * needs it. So the index cannot pair them on its own, and honouring a
- * preference means loading `script.map`: about 100 KB that the hanzi → pinyin
- * path never fetches.
- *
- * Asking for the preference and the tables in one object is what keeps that
- * cost visible at the call site rather than hidden inside a load.
- *
- * ```ts
- * const tables = await loadScriptTables(source);
- * candidates(index, "yinhang", { script: { prefer: "Hans", tables } });
- * // 银行, and not 銀行 beside it
- * ```
- */
-export interface ScriptPreference {
-    /** The script to keep where both writings of a word are candidates. */
-    readonly prefer: Script;
-    /** The conversion tables, from `loadScriptTables`. */
-    readonly tables: ScriptTables;
-}
-/**
- * How a candidate list should be narrowed.
- */
-export interface CandidateOptions {
-    /** How many candidates to return at most. */
-    readonly limit?: number;
-    /** Keep one writing of a word rather than both; see {@link ScriptPreference}. */
-    readonly script?: ScriptPreference;
-}
+export type { CandidateOptions, ScriptPreference, } from "./candidate-narrowing.js";
 /**
  * The words a pinyin query could be spelling, likeliest first.
  *
@@ -58,7 +22,8 @@ export interface CandidateOptions {
  * spaces between syllables, and the r of 儿化.
  *
  * Both scripts are dictionary keys, so 银行 and 銀行 both come back unless a
- * {@link ScriptPreference} says which to keep.
+ * {@link import("./candidate-narrowing.js").ScriptPreference} says which to
+ * keep.
  */
 export declare function candidates(index: ReverseIndex, query: string, options?: CandidateOptions): readonly string[];
 /**
@@ -74,8 +39,9 @@ export declare function candidates(index: ReverseIndex, query: string, options?:
  * dictionary — 4,659 candidates — that narrowing costs 1.2 ms in total.
  *
  * The word itself is never in its own list. Neither is its other-script writing
- * where a {@link ScriptPreference} is given, since 銀行 is not a homophone of
- * 银行 but the same word spelled for a different reader.
+ * where a {@link import("./candidate-narrowing.js").ScriptPreference} is given,
+ * since 銀行 is not a homophone of 银行 but the same word spelled for a
+ * different reader.
  *
  * Returns nothing for a word the dictionary does not hold, since a word with no
  * reading has no homophones rather than all of them.

package/dist/search/candidates.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"candidates.d.ts","sourceRoot":"","sources":["../../src/search/candidates.ts"],"names":[],"mappings":"AACA,OAAO,EAAqB,KAAK,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAE/E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAQlD,OAAO,EAAc,KAAK,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAmCnE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,gBAAgB;IAC/B,uEAAuE;IACvE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,iFAAiF;IACjF,QAAQ,CAAC,MAAM,CAAC,EAAE,gBAAgB,CAAC;CACpC;AA6LD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,YAAY,EACnB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,gBAAqB,GAC7B,SAAS,MAAM,EAAE,CA6BnB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,YAAY,EACnB,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,gBAAqB,GAC7B,SAAS,MAAM,EAAE,CAkCnB"}
+{"version":3,"file":"candidates.d.ts","sourceRoot":"","sources":["../../src/search/candidates.ts"],"names":[],"mappings":"AAGA,OAAO,EAEL,KAAK,gBAAgB,EACtB,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EAAc,KAAK,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEnE,YAAY,EACV,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,0BAA0B,CAAC;AAuClC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,YAAY,EACnB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,gBAAqB,GAC7B,SAAS,MAAM,EAAE,CAyBnB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,YAAY,EACnB,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,gBAAqB,GAC7B,SAAS,MAAM,EAAE,CA8BnB"}