@kensio/pinyinjs 1.7.3 → 1.7.5

package/dist/search/reverse-index.js

@@ -1,73 +1,7 @@
-import { FREQUENCY_BUCKETS } from "../dictionary/frequency-table.js";
+import { buildAll, startBuild } from "./reverse-index-build.js";
 import { KeyIndex } from "../dictionary/key-index.js";
-/**
- * The separator between reading keys, matching what {@link KeyIndex} expects.
- */
-const LINE = "\n";
-const SPACE = 32;
-const ZERO = 48;
-const FIVE = 53;
-const UMLAUT_U = "ü";
-const PLAIN_U = "u";
-/**
- * How many positions one {@link ReverseIndexBuild.step} covers by default.
- *
- * Sized so that a step is a frame rather than several: the full tier's build is
- * about 510 ms of work over 723,147 keys, so 20,000 keys is roughly 14 ms of it.
- * A caller with a frame budget of its own should pass its own number rather than
- * trust this one.
- */
-const STEP = 20_000;
-/**
- * Fold a stored reading into the key a typist's spelling reaches it by.
- *
- * `yin2 hang2` becomes `yinhang` and `lü4 se4` becomes `luse`. Three things go:
- * the spaces, because nobody types them; the tone digits, because a typist
- * mostly does not write tones and a toned query is answered by filtering a
- * toneless list rather than by a second index; and the umlaut, because `lu` and
- * `lv` both have to reach 绿 and the only spelling both of them fold to is `lu`.
- *
- * The 儿化 r **stays**, so 玩儿 is keyed `wanr` and not `wan`. It is a letter a
- * typist writes, and the query side reaches the key from both directions by
- * searching `wan` and `wanr` alike — see `candidates`.
- *
- * Nothing here parses a syllable, which is what keeps a pass over every key in
- * the dictionary affordable.
- */
-export function readingKey(reading) {
-    let key = "";
-    for (let at = 0; at < reading.length; at++) {
-        /* c8 ignore next -- `at` is inside the string, so the fallback cannot fire */
-        const code = reading.codePointAt(at) ?? 0;
-        if (code === SPACE || (code >= ZERO && code <= FIVE)) {
-            continue;
-        }
-        const character = reading.charAt(at);
-        key += character === UMLAUT_U ? PLAIN_U : character;
-    }
-    return key;
-}
-/**
- * What share of the build each pass is worth, for {@link ReverseIndexBuild.progress}.
- */
-const SHARE = { counting: 0.45, filling: 0.45, ranking: 0.1 };
-/**
- * The empty posting list, shared rather than allocated per miss.
- */
-const NONE = new Uint32Array(0);
-/**
- * Read a `Uint32Array` at an index that is in range by construction.
- *
- * `noUncheckedIndexedAccess` types every read as possibly undefined, and every
- * one below is bounded by the layout of the array it indexes — a group start, a
- * cursor inside a group, a bucket between 0 and 15. Gathered here rather than
- * written as a fallback at each of them, since a fallback that cannot happen
- * reads as a case somebody considered.
- */
-/* c8 ignore next 3 -- the fallback is unreachable; see above */
-function readAt(values, at) {
-    return values[at] ?? 0;
-}
+import { NONE, readAt, } from "./reverse-index-passes.js";
+export { readingKey } from "./reverse-index-format.js";
 /**
  * Which readings each word in the dictionary can be reached by.
  *
@@ -95,12 +29,7 @@ export class ReverseIndex {
      * for anything that has a frame to hold on to.
      */
     static of(dictionary) {
-        const build = this.building(dictionary);
-        let index = build.step(Number.POSITIVE_INFINITY);
-        while (index === undefined) {
-            index = build.step(Number.POSITIVE_INFINITY);
-        }
-        return index;
+        return buildAll(dictionary);
     }
     /**
      * Start a build that can be driven a slice at a time.
@@ -173,184 +102,4 @@ export class ReverseIndex {
         };
     }
 }
-/**
- * The streaming build, which never holds every reading at once.
- *
- * Three passes over the dictionary — count the groups, fill them, rank them —
- * with each key's reading recomputed in the fill pass rather than kept from the
- * count pass. That trade is the whole reason this is safe on a phone: keeping
- * all 723,147 readings costs 39 MB retained and peaks at 65 MB, where
- * recomputing them peaks at 25 MB for a 2 MB result.
- *
- * A closure rather than a class because the state is a cursor and four buffers
- * that only the passes below ever touch, and because two of them are dropped
- * part way through: what is live during counting is not what is live during
- * ranking.
- */
-function startBuild(dictionary) {
-    const readings = dictionary.readingsInOrder();
-    let counts = new Map();
-    let pass = "counting";
-    let at = 0;
-    let keys = [];
-    let slots = new Map();
-    let starts = new Uint32Array(1);
-    let cursors = new Uint32Array(0);
-    let postings = NONE;
-    let widest = 0;
-    /** The reading key at a position, or the empty string where there is none. */
-    const keyAt = (position) => readingKey(readings.readingAt(position));
-    /** Where a position sorts, commonest first: the bucket, counted downwards. */
-    const rankOf = (position) => FREQUENCY_BUCKETS - 1 - dictionary.frequencyAt(position);
-    /** Count how many words each reading has, so the postings can be one array. */
-    const count = (positions) => {
-        const end = Math.min(readings.size, at + positions);
-        for (; at < end; at++) {
-            const key = keyAt(at);
-            if (key !== "") {
-                counts.set(key, (counts.get(key) ?? 0) + 1);
-            }
-        }
-        if (at >= readings.size) {
-            pass = "ordering";
-        }
-    };
-    /**
-     * Sort the reading keys and lay out where each group's postings go.
-     *
-     * One step of its own, because a sort cannot be resumed part way through.
-     */
-    const order = () => {
-        // Sorted as pairs rather than by key and looked up again, and by code unit
-        // rather than by locale, which is the order `KeyIndex` searches in.
-        const ordered = [...counts].toSorted(([left], [right]) => left < right ? -1 : Number(left > right));
-        keys = ordered.map(([key]) => key);
-        starts = new Uint32Array(keys.length + 1);
-        let running = 0;
-        for (const [group, [key, held]] of ordered.entries()) {
-            slots.set(key, group);
-            starts[group] = running;
-            running += held;
-            widest = Math.max(widest, held);
-        }
-        starts[keys.length] = running;
-        counts = new Map();
-        cursors = starts.slice(0, keys.length);
-        postings = new Uint32Array(running);
-        at = 0;
-        pass = "filling";
-    };
-    /** Place each position in its reading's group, recomputing the reading. */
-    const fill = (positions) => {
-        const end = Math.min(readings.size, at + positions);
-        for (; at < end; at++) {
-            const key = keyAt(at);
-            const group = key === "" ? undefined : slots.get(key);
-            if (group === undefined) {
-                continue;
-            }
-            const cursor = readAt(cursors, group);
-            postings[cursor] = at;
-            cursors[group] = cursor + 1;
-        }
-        if (at >= readings.size) {
-            slots = new Map();
-            cursors = new Uint32Array(0);
-            at = 0;
-            pass = "ranking";
-        }
-    };
-    /**
-     * Sort each group likeliest-first, which is a counting sort on the bucket.
-     *
-     * Buckets run 0 to 15, so there is nothing to compare: tally the group, turn
-     * the tally into offsets, and deal the postings out. Stable, so two words in
-     * the same bucket keep the dictionary's own order and the result does not
-     * depend on how the fill pass happened to lay the postings down.
-     */
-    const rank = (groups) => {
-        const scratch = new Uint32Array(widest);
-        const tally = new Uint32Array(FREQUENCY_BUCKETS);
-        const end = Math.min(keys.length, at + groups);
-        for (; at < end; at++) {
-            const from = readAt(starts, at);
-            const to = readAt(starts, at + 1);
-            tally.fill(0);
-            for (let cursor = from; cursor < to; cursor++) {
-                const position = readAt(postings, cursor);
-                scratch[cursor - from] = position;
-                const bucket = rankOf(position);
-                tally[bucket] = readAt(tally, bucket) + 1;
-            }
-            let running = from;
-            for (let bucket = 0; bucket < FREQUENCY_BUCKETS; bucket++) {
-                const held = readAt(tally, bucket);
-                tally[bucket] = running;
-                running += held;
-            }
-            for (let cursor = 0; cursor < to - from; cursor++) {
-                const position = readAt(scratch, cursor);
-                const bucket = rankOf(position);
-                postings[readAt(tally, bucket)] = position;
-                tally[bucket] = readAt(tally, bucket) + 1;
-            }
-        }
-        if (at < keys.length) {
-            return undefined;
-        }
-        pass = "done";
-        return ReverseIndex.from(dictionary, {
-            keys: keys.join(LINE),
-            postings,
-            starts,
-        });
-    };
-    return {
-        get progress() {
-            const size = Math.max(1, readings.size);
-            switch (pass) {
-                case "counting": {
-                    return (SHARE.counting * at) / size;
-                }
-                case "ordering": {
-                    return SHARE.counting;
-                }
-                case "filling": {
-                    return SHARE.counting + (SHARE.filling * at) / size;
-                }
-                case "ranking": {
-                    return (SHARE.counting +
-                        SHARE.filling +
-                        (SHARE.ranking * at) / Math.max(1, keys.length));
-                }
-                case "done": {
-                    return 1;
-                }
-            }
-        },
-        step(positions = STEP) {
-            switch (pass) {
-                case "counting": {
-                    count(positions);
-                    return undefined;
-                }
-                case "ordering": {
-                    order();
-                    return undefined;
-                }
-                case "filling": {
-                    fill(positions);
-                    return undefined;
-                }
-                case "ranking": {
-                    return rank(positions);
-                }
-                /* c8 ignore next 3 -- a finished build is not stepped again */
-                case "done": {
-                    return undefined;
-                }
-            }
-        },
-    };
-}
 //# sourceMappingURL=reverse-index.js.map

package/dist/search/reverse-index.js.map

@@ -1 +1 @@
-{"version":3,"file":"reverse-index.js","sourceRoot":"","sources":["../../src/search/reverse-index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD;;GAEG;AACH,MAAM,IAAI,GAAG,IAAI,CAAC;AAElB,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB,MAAM,IAAI,GAAG,EAAE,CAAC;AAEhB,MAAM,IAAI,GAAG,EAAE,CAAC;AAEhB,MAAM,QAAQ,GAAG,GAAG,CAAC;AAErB,MAAM,OAAO,GAAG,GAAG,CAAC;AAEpB;;;;;;;GAOG;AACH,MAAM,IAAI,GAAG,MAAM,CAAC;AAEpB;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe;IACxC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC3C,8EAA8E;QAC9E,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACrD,SAAS;QACX,CAAC;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,GAAG,IAAI,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IACtD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AA6DD;;GAEG;AACH,MAAM,KAAK,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;AAE9D;;GAEG;AACH,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAEhC;;;;;;;;GAQG;AACH,gEAAgE;AAChE,SAAS,MAAM,CAAC,MAAmB,EAAE,EAAU;IAC7C,OAAO,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,YAAY;IACvB;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,CAAC,UAAsB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACjD,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3B,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,UAAsB;QACpC,OAAO,UAAU,CAAC,UAAU,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,IAAI,CAAC,UAAsB,EAAE,IAAsB;QACxD,OAAO,IAAI,YAAY,CACrB,UAAU,EACV,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EACxB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,MAAM,CACZ,CAAC;IACJ,CAAC;IAEQ,WAAW,CAAa;IACxB,KAAK,CAAW;IAChB,SAAS,CAAc;IACvB,OAAO,CAAc;IAE9B;;;OAGG;IACH,YACE,UAAsB,EACtB,IAAc,EACd,QAAqB,EACrB,MAAmB;QAEnB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,GAAW;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,EACjC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CACtC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;YAC5B,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,MAAM,EAAE,IAAI,CAAC,OAAO;SACrB,CAAC;IACJ,CAAC;CACF;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,UAAU,CAAC,UAAsB;IACxC,MAAM,QAAQ,GAAG,UAAU,CAAC,eAAe,EAAE,CAAC;IAC9C,IAAI,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,IAAI,IAAI,GAAS,UAAU,CAAC;IAC5B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,IAAI,GAAsB,EAAE,CAAC;IACjC,IAAI,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,IAAI,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,8EAA8E;IAC9E,MAAM,KAAK,GAAG,CAAC,QAAgB,EAAU,EAAE,CACzC,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3C,8EAA8E;IAC9E,MAAM,MAAM,GAAG,CAAC,QAAgB,EAAU,EAAE,CAC1C,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAE3D,+EAA+E;IAC/E,MAAM,KAAK,GAAG,CAAC,SAAiB,EAAQ,EAAE;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC;QACpD,OAAO,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;gBACf,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,IAAI,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG,UAAU,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;IAEF;;;;OAIG;IACH,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,2EAA2E;QAC3E,oEAAoE;QACpE,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CACvD,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,CACzC,CAAC;QACF,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;YACxB,OAAO,IAAI,IAAI,CAAC;YAChB,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;QAC9B,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QAEnB,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,QAAQ,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;QACpC,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,GAAG,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,2EAA2E;IAC3E,MAAM,IAAI,GAAG,CAAC,SAAiB,EAAQ,EAAE;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,SAAS,CAAC,CAAC;QACpD,OAAO,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACtD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;YACtB,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YACxB,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;YAClB,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;YAC7B,EAAE,GAAG,CAAC,CAAC;YACP,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;IACH,CAAC,CAAC;IAEF;;;;;;;OAOG;IACH,MAAM,IAAI,GAAG,CAAC,MAAc,EAA4B,EAAE;QACxD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,iBAAiB,CAAC,CAAC;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC;QAC/C,OAAO,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAChC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,IAAI,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;gBAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC1C,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAClC,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAChC,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YAC5C,CAAC;YACD,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,iBAAiB,EAAE,MAAM,EAAE,EAAE,CAAC;gBAC1D,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,KAAK,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;gBACxB,OAAO,IAAI,IAAI,CAAC;YAClB,CAAC;YACD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;gBAClD,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAChC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC;gBAC3C,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,GAAG,MAAM,CAAC;QACd,OAAO,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE;YACnC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YACrB,QAAQ;YACR,MAAM;SACP,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,OAAO;QACL,IAAI,QAAQ;YACV,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;YACxC,QAAQ,IAAI,EAAE,CAAC;gBACb,KAAK,UAAU,EAAE,CAAC;oBAChB,OAAO,CAAC,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;gBACtC,CAAC;gBACD,KAAK,UAAU,EAAE,CAAC;oBAChB,OAAO,KAAK,CAAC,QAAQ,CAAC;gBACxB,CAAC;gBACD,KAAK,SAAS,EAAE,CAAC;oBACf,OAAO,KAAK,CAAC,QAAQ,GAAG,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;gBACtD,CAAC;gBACD,KAAK,SAAS,EAAE,CAAC;oBACf,OAAO,CACL,KAAK,CAAC,QAAQ;wBACd,KAAK,CAAC,OAAO;wBACb,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAChD,CAAC;gBACJ,CAAC;gBACD,KAAK,MAAM,EAAE,CAAC;oBACZ,OAAO,CAAC,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,GAAW,IAAI;YAC3B,QAAQ,IAAI,EAAE,CAAC;gBACb,KAAK,UAAU,EAAE,CAAC;oBAChB,KAAK,CAAC,SAAS,CAAC,CAAC;oBACjB,OAAO,SAAS,CAAC;gBACnB,CAAC;gBACD,KAAK,UAAU,EAAE,CAAC;oBAChB,KAAK,EAAE,CAAC;oBACR,OAAO,SAAS,CAAC;gBACnB,CAAC;gBACD,KAAK,SAAS,EAAE,CAAC;oBACf,IAAI,CAAC,SAAS,CAAC,CAAC;oBAChB,OAAO,SAAS,CAAC;gBACnB,CAAC;gBACD,KAAK,SAAS,EAAE,CAAC;oBACf,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzB,CAAC;gBACD,+DAA+D;gBAC/D,KAAK,MAAM,EAAE,CAAC;oBACZ,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC"}
+{"version":3,"file":"reverse-index.js","sourceRoot":"","sources":["../../src/search/reverse-index.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,EACL,IAAI,EACJ,MAAM,GAEP,MAAM,2BAA2B,CAAC;AAInC,OAAO,EAAE,UAAU,EAAyB,MAAM,2BAA2B,CAAC;AAE9E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,YAAY;IACvB;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,CAAC,UAAsB;QAC9B,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,UAAsB;QACpC,OAAO,UAAU,CAAC,UAAU,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,IAAI,CAAC,UAAsB,EAAE,IAAsB;QACxD,OAAO,IAAI,YAAY,CACrB,UAAU,EACV,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EACxB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,MAAM,CACZ,CAAC;IACJ,CAAC;IAEQ,WAAW,CAAa;IACxB,KAAK,CAAW;IAChB,SAAS,CAAc;IACvB,OAAO,CAAc;IAE9B;;;OAGG;IACH,YACE,UAAsB,EACtB,IAAc,EACd,QAAqB,EACrB,MAAmB;QAEnB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,GAAW;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,EACjC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CACtC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;YAC5B,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,MAAM,EAAE,IAAI,CAAC,OAAO;SACrB,CAAC;IACJ,CAAC;CACF"}

package/dist/sources/unihan-readings.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Reading and ranking the pronunciation fields Unihan carries.
+ *
+ * The fields disagree and are not equally trustworthy, so the order they are
+ * consulted in is what settles a character's readings.
+ */
+import { type ReadingField } from "./unihan.js";
+/**
+
+/**
+ * Pull the readings out of one field's value.
+ *
+ * The fields do not share a syntax: `kHanyuPinlu` writes `de(5096) dé(1496)`,
+ * the dictionary-indexed fields write `069.040:dé 069.090:de`, and `kMandarin`
+ * writes bare readings separated by spaces.
+ */
+export declare function readFieldValue(field: ReadingField, value: string): string[];
+/**
+ * Whether `kHanyuPinlu` ranks this character's readings against each other.
+ *
+ * True only where it lists more than one, which is the difference between a
+ * ranking and a bare observation — see {@link fieldOrder}. It decides both what
+ * ranks the readings here and whether anything downstream is entitled to
+ * re-rank them, so it is one predicate rather than two.
+ */
+export declare function isFrequencyRanked(fields: ReadonlyMap<ReadingField, readonly string[]>): boolean;
+/**
+ * Which fields to trust, in order, for one character.
+ *
+ * `kHanyuPinlu` is a ranking, and a ranking of one thing is not a ranking. Where
+ * the field lists a single reading it never compared it against anything, so it
+ * is saying "this reading occurred in the corpus" rather than "this reading
+ * leads" — and it is demoted to last, keeping its reading as a candidate
+ * without letting it set the default.
+ *
+ * That matters because the corpus behind the field, 《現代漢語頻率詞典》,
+ * predates the 1985 普通话异读词审音表. Where it is the only voice it can be
+ * reporting a reading that was standard then and is not now: of the ten
+ * characters where a lone `kHanyuPinlu` reading disagrees with `kMandarin`,
+ * eight are the superseded reading — 绩 `jī` for `jì`, 迹 `jī` for `jì`, 脊
+ * `jí` for `jǐ`, 哮 `xiāo` for `xiào`, 茸 `rōng` for `róng`, 澎 `pēng` for
+ * `péng`, 啥 `shà` for `shá`, 甸 `diān` for `diàn`. A high count does not make
+ * one current; 绩 `jī` carries 132 of them.
+ *
+ * The other two are genuine variants where both readings are current — 谁 is
+ * `shéi` or `shuí`, 桔 is `jié` or `jú` — so `kMandarin` deciding them costs
+ * nothing that a word entry does not already settle.
+ */
+export declare function fieldOrder(fields: ReadonlyMap<ReadingField, readonly string[]>): readonly ReadingField[];
+/**
+ * Gather one character's readings from its fields, likeliest first.
+ *
+ * A reading appearing in several fields keeps the position its highest-trusted
+ * one gives it, and every field's readings survive: the order decides the
+ * default, not the membership.
+ */
+export declare function rankReadings(fields: ReadonlyMap<ReadingField, readonly string[]>): string[];
+//# sourceMappingURL=unihan-readings.d.ts.map

package/dist/sources/unihan-readings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unihan-readings.d.ts","sourceRoot":"","sources":["../../src/sources/unihan-readings.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAGL,KAAK,YAAY,EAClB,MAAM,aAAa,CAAC;AAGrB;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAoB3E;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC,GACnD,OAAO,CAET;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC,GACnD,SAAS,YAAY,EAAE,CAQzB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC,GACnD,MAAM,EAAE,CAUV"}

package/dist/sources/unihan-readings.js

@@ -0,0 +1,95 @@
+/**
+ * Reading and ranking the pronunciation fields Unihan carries.
+ *
+ * The fields disagree and are not equally trustworthy, so the order they are
+ * consulted in is what settles a character's readings.
+ */
+import { FREQUENCY_FIELD, READING_FIELDS, } from "./unihan.js";
+const READING_WITH_COUNT = /^(.+)\((\d+)\)$/u;
+/**
+
+/**
+ * Pull the readings out of one field's value.
+ *
+ * The fields do not share a syntax: `kHanyuPinlu` writes `de(5096) dé(1496)`,
+ * the dictionary-indexed fields write `069.040:dé 069.090:de`, and `kMandarin`
+ * writes bare readings separated by spaces.
+ */
+export function readFieldValue(field, value) {
+    const tokens = value.split(/\s+/u).filter((token) => token !== "");
+    if (field === "kHanyuPinlu") {
+        return tokens
+            .map((token) => READING_WITH_COUNT.exec(token))
+            .filter((match) => match !== null)
+            .map((match) => ({ reading: match[1] ?? "", count: Number(match[2]) }))
+            .toSorted((left, right) => right.count - left.count)
+            .map(({ reading }) => reading);
+    }
+    // kTGHZ2013 and kXHC1983 prefix each reading with its dictionary entry
+    // number, as in 069.040:dé, and may list several against one entry.
+    return tokens
+        .flatMap((token) => token.includes(":") ? (token.split(":", 2)[1] ?? "") : token)
+        .flatMap((reading) => reading.split(","))
+        .filter((reading) => reading !== "");
+}
+/**
+ * Whether `kHanyuPinlu` ranks this character's readings against each other.
+ *
+ * True only where it lists more than one, which is the difference between a
+ * ranking and a bare observation — see {@link fieldOrder}. It decides both what
+ * ranks the readings here and whether anything downstream is entitled to
+ * re-rank them, so it is one predicate rather than two.
+ */
+export function isFrequencyRanked(fields) {
+    return (fields.get(FREQUENCY_FIELD) ?? []).length > 1;
+}
+/**
+ * Which fields to trust, in order, for one character.
+ *
+ * `kHanyuPinlu` is a ranking, and a ranking of one thing is not a ranking. Where
+ * the field lists a single reading it never compared it against anything, so it
+ * is saying "this reading occurred in the corpus" rather than "this reading
+ * leads" — and it is demoted to last, keeping its reading as a candidate
+ * without letting it set the default.
+ *
+ * That matters because the corpus behind the field, 《現代漢語頻率詞典》,
+ * predates the 1985 普通话异读词审音表. Where it is the only voice it can be
+ * reporting a reading that was standard then and is not now: of the ten
+ * characters where a lone `kHanyuPinlu` reading disagrees with `kMandarin`,
+ * eight are the superseded reading — 绩 `jī` for `jì`, 迹 `jī` for `jì`, 脊
+ * `jí` for `jǐ`, 哮 `xiāo` for `xiào`, 茸 `rōng` for `róng`, 澎 `pēng` for
+ * `péng`, 啥 `shà` for `shá`, 甸 `diān` for `diàn`. A high count does not make
+ * one current; 绩 `jī` carries 132 of them.
+ *
+ * The other two are genuine variants where both readings are current — 谁 is
+ * `shéi` or `shuí`, 桔 is `jié` or `jú` — so `kMandarin` deciding them costs
+ * nothing that a word entry does not already settle.
+ */
+export function fieldOrder(fields) {
+    if (isFrequencyRanked(fields)) {
+        return READING_FIELDS;
+    }
+    return [
+        ...READING_FIELDS.filter((field) => field !== FREQUENCY_FIELD),
+        FREQUENCY_FIELD,
+    ];
+}
+/**
+ * Gather one character's readings from its fields, likeliest first.
+ *
+ * A reading appearing in several fields keeps the position its highest-trusted
+ * one gives it, and every field's readings survive: the order decides the
+ * default, not the membership.
+ */
+export function rankReadings(fields) {
+    const ordered = [];
+    for (const field of fieldOrder(fields)) {
+        for (const reading of fields.get(field) ?? []) {
+            if (!ordered.includes(reading)) {
+                ordered.push(reading);
+            }
+        }
+    }
+    return ordered;
+}
+//# sourceMappingURL=unihan-readings.js.map

package/dist/sources/unihan-readings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unihan-readings.js","sourceRoot":"","sources":["../../src/sources/unihan-readings.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EACL,eAAe,EACf,cAAc,GAEf,MAAM,aAAa,CAAC;AAErB,MAAM,kBAAkB,GAAG,kBAAkB,CAAC;AAC9C;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,KAAmB,EAAE,KAAa;IAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;IAEnE,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;QAC5B,OAAO,MAAM;aACV,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC9C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aACjC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACtE,QAAQ,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;aACnD,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED,uEAAuE;IACvE,oEAAoE;IACpE,OAAO,MAAM;SACV,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CACjB,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAC7D;SACA,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACxC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAoD;IAEpD,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,UAAU,CACxB,MAAoD;IAEpD,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9B,OAAO,cAAc,CAAC;IACxB,CAAC;IACD,OAAO;QACL,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,eAAe,CAAC;QAC9D,eAAe;KAChB,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAoD;IAEpD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACvC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/sources/unihan.d.ts

@@ -1,4 +1,6 @@
+export { isFrequencyRanked } from "./unihan-readings.js";
 /**
+import { fieldOrder, isFrequencyRanked, rankReadings, readFieldValue } from "./unihan-readings.js";
  * What the Unihan database knows about one character's readings.
  */
 export interface UnihanReadings {
@@ -29,6 +31,10 @@ export interface UnihanReadings {
      */
     readonly taiwanReading?: string;
 }
+/**
+ * A single `kHanyuPinlu` token: a reading with its corpus count, as in
+ * `de(5096)`.
+ */
 /**
  * Fields carrying readings, in the order their readings are trusted.
  *
@@ -58,15 +64,6 @@ export type ReadingField = (typeof READING_FIELDS)[number];
  * most careful to read.
  */
 export declare const FREQUENCY_FIELD = "kHanyuPinlu";
-/**
- * Whether `kHanyuPinlu` ranks this character's readings against each other.
- *
- * True only where it lists more than one, which is the difference between a
- * ranking and a bare observation — see {@link fieldOrder}. It decides both what
- * ranks the readings here and whether anything downstream is entitled to
- * re-rank them, so it is one predicate rather than two.
- */
-export declare function isFrequencyRanked(fields: ReadonlyMap<ReadingField, readonly string[]>): boolean;
 /**
  * Read the readings out of a Unihan data file such as `Unihan_Readings.txt`.
  *

package/dist/sources/unihan.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unihan.d.ts","sourceRoot":"","sources":["../../src/sources/unihan.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC;;;;;;;;OAQG;IACH,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC9D;;;;;;OAMG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CACjC;AAaD;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,cAAc,YACzB,aAAa,EACb,WAAW,EACX,WAAW,EACX,UAAU,CACF,CAAC;AAEX;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE3D;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,gBAAuC,CAAC;AA+BpE;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC,GACnD,OAAO,CAET;AAyDD;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CA+C7E;AAUD;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,mDAAmD;IACnD,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC5D,mDAAmD;IACnD,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CAC9D;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,CA2BhE"}
+{"version":3,"file":"unihan.d.ts","sourceRoot":"","sources":["../../src/sources/unihan.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAEzD;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC;;;;;;;;OAQG;IACH,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC9D;;;;;;OAMG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CACjC;AAOD;;;GAGG;AAEH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,cAAc,YACzB,aAAa,EACb,WAAW,EACX,WAAW,EACX,UAAU,CACF,CAAC;AAEX;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAE3D;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,gBAAuC,CAAC;AAEpE;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CA+C7E;AAUD;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,mDAAmD;IACnD,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC5D,mDAAmD;IACnD,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CAC9D;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,CA2BhE"}

package/dist/sources/unihan.js

@@ -1,3 +1,5 @@
+export { isFrequencyRanked } from "./unihan-readings.js";
+import { rankReadings, readFieldValue } from "./unihan-readings.js";
 /**
  * A line of a Unihan data file: code point, field name, value.
  */
@@ -6,7 +8,6 @@ const FIELD_LINE = /^U\+([\dA-F]+)\t(\w+)\t(.+)$/u;
  * A single `kHanyuPinlu` token: a reading with its corpus count, as in
  * `de(5096)`.
  */
-const READING_WITH_COUNT = /^(.+)\((\d+)\)$/u;
 /**
  * Fields carrying readings, in the order their readings are trusted.
  *
@@ -37,90 +38,6 @@ export const READING_FIELDS = [
  * most careful to read.
  */
 export const FREQUENCY_FIELD = "kHanyuPinlu";
-/**
- * Pull the readings out of one field's value.
- *
- * The fields do not share a syntax: `kHanyuPinlu` writes `de(5096) dé(1496)`,
- * the dictionary-indexed fields write `069.040:dé 069.090:de`, and `kMandarin`
- * writes bare readings separated by spaces.
- */
-function readFieldValue(field, value) {
-    const tokens = value.split(/\s+/u).filter((token) => token !== "");
-    if (field === "kHanyuPinlu") {
-        return tokens
-            .map((token) => READING_WITH_COUNT.exec(token))
-            .filter((match) => match !== null)
-            .map((match) => ({ reading: match[1] ?? "", count: Number(match[2]) }))
-            .toSorted((left, right) => right.count - left.count)
-            .map(({ reading }) => reading);
-    }
-    // kTGHZ2013 and kXHC1983 prefix each reading with its dictionary entry
-    // number, as in 069.040:dé, and may list several against one entry.
-    return tokens
-        .flatMap((token) => token.includes(":") ? (token.split(":", 2)[1] ?? "") : token)
-        .flatMap((reading) => reading.split(","))
-        .filter((reading) => reading !== "");
-}
-/**
- * Whether `kHanyuPinlu` ranks this character's readings against each other.
- *
- * True only where it lists more than one, which is the difference between a
- * ranking and a bare observation — see {@link fieldOrder}. It decides both what
- * ranks the readings here and whether anything downstream is entitled to
- * re-rank them, so it is one predicate rather than two.
- */
-export function isFrequencyRanked(fields) {
-    return (fields.get(FREQUENCY_FIELD) ?? []).length > 1;
-}
-/**
- * Which fields to trust, in order, for one character.
- *
- * `kHanyuPinlu` is a ranking, and a ranking of one thing is not a ranking. Where
- * the field lists a single reading it never compared it against anything, so it
- * is saying "this reading occurred in the corpus" rather than "this reading
- * leads" — and it is demoted to last, keeping its reading as a candidate
- * without letting it set the default.
- *
- * That matters because the corpus behind the field, 《現代漢語頻率詞典》,
- * predates the 1985 普通话异读词审音表. Where it is the only voice it can be
- * reporting a reading that was standard then and is not now: of the ten
- * characters where a lone `kHanyuPinlu` reading disagrees with `kMandarin`,
- * eight are the superseded reading — 绩 `jī` for `jì`, 迹 `jī` for `jì`, 脊
- * `jí` for `jǐ`, 哮 `xiāo` for `xiào`, 茸 `rōng` for `róng`, 澎 `pēng` for
- * `péng`, 啥 `shà` for `shá`, 甸 `diān` for `diàn`. A high count does not make
- * one current; 绩 `jī` carries 132 of them.
- *
- * The other two are genuine variants where both readings are current — 谁 is
- * `shéi` or `shuí`, 桔 is `jié` or `jú` — so `kMandarin` deciding them costs
- * nothing that a word entry does not already settle.
- */
-function fieldOrder(fields) {
-    if (isFrequencyRanked(fields)) {
-        return READING_FIELDS;
-    }
-    return [
-        ...READING_FIELDS.filter((field) => field !== FREQUENCY_FIELD),
-        FREQUENCY_FIELD,
-    ];
-}
-/**
- * Gather one character's readings from its fields, likeliest first.
- *
- * A reading appearing in several fields keeps the position its highest-trusted
- * one gives it, and every field's readings survive: the order decides the
- * default, not the membership.
- */
-function rankReadings(fields) {
-    const ordered = [];
-    for (const field of fieldOrder(fields)) {
-        for (const reading of fields.get(field) ?? []) {
-            if (!ordered.includes(reading)) {
-                ordered.push(reading);
-            }
-        }
-    }
-    return ordered;
-}
 /**
  * Read the readings out of a Unihan data file such as `Unihan_Readings.txt`.
  *

package/dist/sources/unihan.js.map

@@ -1 +1 @@
-{"version":3,"file":"unihan.js","sourceRoot":"","sources":["../../src/sources/unihan.ts"],"names":[],"mappings":"AAgCA;;GAEG;AACH,MAAM,UAAU,GAAG,+BAA+B,CAAC;AAEnD;;;GAGG;AACH,MAAM,kBAAkB,GAAG,kBAAkB,CAAC;AAE9C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,aAAa;IACb,WAAW;IACX,WAAW;IACX,UAAU;CACF,CAAC;AAOX;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,aAAoC,CAAC;AAEpE;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,KAAmB,EAAE,KAAa;IACxD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;IAEnE,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;QAC5B,OAAO,MAAM;aACV,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC9C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aACjC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACtE,QAAQ,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;aACnD,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED,uEAAuE;IACvE,oEAAoE;IACpE,OAAO,MAAM;SACV,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CACjB,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAC7D;SACA,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACxC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAoD;IAEpD,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,SAAS,UAAU,CACjB,MAAoD;IAEpD,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9B,OAAO,cAAc,CAAC;IACxB,CAAC;IACD,OAAO;QACL,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,eAAe,CAAC;QAC9D,eAAe;KAChB,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CACnB,MAAoD;IAEpD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACvC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC/D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,SAAS;QACX,CAAC;QACD,MAAM,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;QAC7D,IAAI,CAAE,cAAoC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/D,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,SAAyB,CAAC;QACxC,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,wEAAwE;QACxE,IAAI,KAAK,KAAK,WAAW,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,CAAC,QAAQ,GAAG,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC9C,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACxB,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACxC,CAAC;YACD,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAA0B,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,KAAK,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE;YACpB,QAAQ,EAAE,OAAO;YACjB,MAAM;YACN,GAAG,CAAC,aAAa,KAAK,SAAS,IAAI,EAAE,aAAa,EAAE,CAAC;SACtD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,YAAY,GAChB,kEAAkE,CAAC;AAErE,MAAM,kBAAkB,GAAG,kBAAkB,CAAC;AAY9C;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,SAAS;QACX,CAAC;QACD,MAAM,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;QAC7D,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,QAAQ,GAAG,KAAK;aACnB,KAAK,CAAC,MAAM,CAAC;aACb,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC9C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aACjC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACb,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAC3D,CAAC;QACJ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GACV,SAAS,KAAK,oBAAoB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;QAChE,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AACrC,CAAC"}
+{"version":3,"file":"unihan.js","sourceRoot":"","sources":["../../src/sources/unihan.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAkCpE;;GAEG;AACH,MAAM,UAAU,GAAG,+BAA+B,CAAC;AAEnD;;;GAGG;AAEH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,aAAa;IACb,WAAW;IACX,WAAW;IACX,UAAU;CACF,CAAC;AAOX;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,aAAoC,CAAC;AAEpE;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC/D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,SAAS;QACX,CAAC;QACD,MAAM,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;QAC7D,IAAI,CAAE,cAAoC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/D,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,SAAyB,CAAC;QACxC,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,wEAAwE;QACxE,IAAI,KAAK,KAAK,WAAW,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,CAAC,QAAQ,GAAG,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC9C,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACxB,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACxC,CAAC;YACD,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAA0B,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,KAAK,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE;YACpB,QAAQ,EAAE,OAAO;YACjB,MAAM;YACN,GAAG,CAAC,aAAa,KAAK,SAAS,IAAI,EAAE,aAAa,EAAE,CAAC;SACtD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,YAAY,GAChB,kEAAkE,CAAC;AAErE,MAAM,kBAAkB,GAAG,kBAAkB,CAAC;AAY9C;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,SAAS;QACX,CAAC;QACD,MAAM,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;QAC7D,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,QAAQ,GAAG,KAAK;aACnB,KAAK,CAAC,MAAM,CAAC;aACb,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC9C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aACjC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACb,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAC3D,CAAC;QACJ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GACV,SAAS,KAAK,oBAAoB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;QAChE,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AACrC,CAAC"}

package/dist/syllable/final-tables.d.ts

@@ -0,0 +1,23 @@
+/**
+ * How a written final maps back to its underlying form after a palatal initial,
+ * where a written u always stands for ü.
+ */
+export declare const PALATAL_FINALS: Map<string, "a" | "ai" | "an" | "ang" | "ao" | "e" | "ei" | "en" | "eng" | "er" | "i" | "ia" | "ian" | "iang" | "iao" | "ie" | "in" | "ing" | "io" | "iong" | "iou" | "m" | "n" | "ng" | "o" | "ong" | "ou" | "u" | "ua" | "uai" | "uan" | "uang" | "uei" | "uen" | "ueng" | "uo" | "ê" | "ü" | "üan" | "üe" | "ün">;
+/**
+ * How a written final maps back to its underlying form after any other initial.
+ */
+export declare const ABBREVIATED_FINALS: Map<string, "a" | "ai" | "an" | "ang" | "ao" | "e" | "ei" | "en" | "eng" | "er" | "i" | "ia" | "ian" | "iang" | "iao" | "ie" | "in" | "ing" | "io" | "iong" | "iou" | "m" | "n" | "ng" | "o" | "ong" | "ou" | "u" | "ua" | "uai" | "uan" | "uang" | "uei" | "uen" | "ueng" | "uo" | "ê" | "ü" | "üan" | "üe" | "ün">;
+/**
+ * The reverse of {@link ZERO_INITIAL_SPELLINGS}, for reading y- and w- forms.
+ */
+export declare const ZERO_INITIAL_FINALS: Map<string, "a" | "ai" | "an" | "ang" | "ao" | "e" | "ei" | "en" | "eng" | "er" | "i" | "ia" | "ian" | "iang" | "iao" | "ie" | "in" | "ing" | "io" | "iong" | "iou" | "m" | "n" | "ng" | "o" | "ong" | "ou" | "u" | "ua" | "uai" | "uan" | "uang" | "uei" | "uen" | "ueng" | "uo" | "ê" | "ü" | "üan" | "üe" | "ün">;
+/**
+ * Finals that are written as-is when they make up a whole syllable on their own.
+ *
+ * Every other final either takes a y or w onset with no initial (i becomes yi)
+ * or cannot stand alone at all (ong only ever follows an initial), so accepting
+ * anything outside this set would let underlying forms such as `iou` through as
+ * if they were valid spellings.
+ */
+export declare const STANDALONE_FINALS: Set<"a" | "ai" | "an" | "ang" | "ao" | "e" | "ei" | "en" | "eng" | "er" | "i" | "ia" | "ian" | "iang" | "iao" | "ie" | "in" | "ing" | "io" | "iong" | "iou" | "m" | "n" | "ng" | "o" | "ong" | "ou" | "u" | "ua" | "uai" | "uan" | "uang" | "uei" | "uen" | "ueng" | "uo" | "ê" | "ü" | "üan" | "üe" | "ün">;
+//# sourceMappingURL=final-tables.d.ts.map