@kensio/pinyinjs 1.6.0 → 1.7.1

package/dist/search/reverse-index.d.ts

@@ -0,0 +1,141 @@
+import type { Dictionary } from "../dictionary/dictionary.js";
+/**
+ * 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 declare function readingKey(reading: string): string;
+/**
+ * A reverse index in the form it can be handed between threads.
+ *
+ * Three pieces, the same shape the forward index has: the reading keys as one
+ * sorted newline-joined blob, the dictionary positions grouped under them, and
+ * where each group begins. The two arrays are transferable and the blob is a
+ * string, so a worker can build this and post it back with no copy of the
+ * postings — which is the point, since the full tier's build is over half a
+ * second and does not belong on the main thread.
+ */
+export interface ReverseIndexData {
+    /** Sorted reading keys, newline-joined: a {@link KeyIndex} blob. */
+    readonly keys: string;
+    /** Dictionary positions, grouped by reading key, likeliest first. */
+    readonly postings: Uint32Array;
+    /** Where each key's postings begin, with one past the end on the tail. */
+    readonly starts: Uint32Array;
+}
+/**
+ * A reverse index being built, a slice at a time.
+ *
+ * The full tier costs about 510 ms to derive, which is thirty-odd frames, so the
+ * build is a state machine a caller can drive from `requestIdleCallback` rather
+ * than a function that takes the thread. `core` is 4 ms and `standard` is 62 ms,
+ * and both can simply be built with {@link ReverseIndex.of}.
+ *
+ * ```ts
+ * const build = ReverseIndex.building(dictionary);
+ * const tick = (): void => {
+ *   const index = build.step();
+ *   if (index === undefined) {
+ *     requestIdleCallback(tick);
+ *   }
+ * };
+ * requestIdleCallback(tick);
+ * ```
+ */
+export interface ReverseIndexBuild {
+    /**
+     * How much of the build is done, from 0 to 1.
+     */
+    readonly progress: number;
+    /**
+     * Do some more of the work, returning the index once there is none left.
+     *
+     * `positions` bounds a step to that many dictionary positions, or that many
+     * reading groups while the last pass is ranking them. It is a bound rather
+     * than a promise: the pass that sorts the reading keys cannot be divided, and
+     * is one step of its own.
+     */
+    readonly step: (positions?: number) => ReverseIndex | undefined;
+}
+/**
+ * Which readings each word in the dictionary can be reached by.
+ *
+ * Every index in the package runs hanzi → reading; this is the other direction,
+ * and it is **derived on load rather than downloaded**. The measurement is in
+ * issue #71 and the summary is that shipping it would add 1,995 KB to the full
+ * tier — an 84% increase — to save under 60% of a build the client can do from
+ * bytes it already holds. Nothing new is fetched and no artifact exists.
+ *
+ * Held the way the forward index is held, and for the same reason: the reading
+ * keys are one sorted blob searched by binary search, and the postings are a
+ * `Uint32Array` of dictionary positions. That is 2.03 MB on the full tier where
+ * a `Map<string, number[]>` of the same content is 47.83 MB.
+ *
+ * A posting is a position rather than a word, which is what makes ranking free:
+ * a position indexes the frequency table directly, so the groups are sorted
+ * likeliest-first during the build and a query pays nothing for its order.
+ */
+export declare class ReverseIndex {
+    #private;
+    /**
+     * Derive the whole index in one go.
+     *
+     * About 4 ms on `core`, 62 ms on `standard` and 510 ms on `full`, measured on
+     * a machine roughly 2.5× a mid-range laptop. Use {@link ReverseIndex.building}
+     * for anything that has a frame to hold on to.
+     */
+    static of(dictionary: Dictionary): ReverseIndex;
+    /**
+     * Start a build that can be driven a slice at a time.
+     */
+    static building(dictionary: Dictionary): ReverseIndexBuild;
+    /**
+     * Wrap what a worker built and posted back.
+     *
+     * The dictionary is passed again rather than travelling with the data,
+     * because the positions are only meaningful against the artifact they were
+     * derived from — a dictionary of a different tier would resolve them to the
+     * wrong words.
+     */
+    static from(dictionary: Dictionary, data: ReverseIndexData): ReverseIndex;
+    /**
+     * Wrap already-grouped postings. Use {@link ReverseIndex.of} or
+     * {@link ReverseIndex.from}.
+     */
+    private constructor();
+    /**
+     * The dictionary the index was derived from, and resolves its postings
+     * against.
+     */
+    get dictionary(): Dictionary;
+    /**
+     * How many distinct readings the index holds, which is its key count.
+     */
+    get size(): number;
+    /**
+     * The dictionary positions read as a key, likeliest first.
+     *
+     * The key is the folded spelling {@link readingKey} produces — toneless, no
+     * spaces, ü written u — not a query. `candidates` is what turns what somebody
+     * types into one of these.
+     *
+     * A view onto the postings rather than a copy, so asking is free.
+     */
+    positionsFor(key: string): Uint32Array;
+    /**
+     * The pieces, ready to be posted to another thread or held elsewhere.
+     */
+    serialise(): ReverseIndexData;
+}
+//# sourceMappingURL=reverse-index.d.ts.map

package/dist/search/reverse-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse-index.d.ts","sourceRoot":"","sources":["../../src/search/reverse-index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AA6B9D;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAYlD;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,gBAAgB;IAC/B,oEAAoE;IACpE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC/B,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;CAC9B;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;;;;OAOG;IACH,QAAQ,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,MAAM,KAAK,YAAY,GAAG,SAAS,CAAC;CACjE;AA+BD;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,YAAY;;IACvB;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,GAAG,YAAY,CAO9C;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,GAAG,iBAAiB,CAEzD;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,gBAAgB,GAAG,YAAY,CAOxE;IAOD;;;OAGG;IACH,OAAO,eAUN;IAED;;;OAGG;IACH,IAAI,UAAU,IAAI,UAAU,CAE3B;IAED;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW,CASrC;IAED;;OAEG;IACH,SAAS,IAAI,gBAAgB,CAM5B;CACF"}

package/dist/search/reverse-index.js

@@ -0,0 +1,356 @@
+import { FREQUENCY_BUCKETS } from "../dictionary/frequency-table.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;
+}
+/**
+ * Which readings each word in the dictionary can be reached by.
+ *
+ * Every index in the package runs hanzi → reading; this is the other direction,
+ * and it is **derived on load rather than downloaded**. The measurement is in
+ * issue #71 and the summary is that shipping it would add 1,995 KB to the full
+ * tier — an 84% increase — to save under 60% of a build the client can do from
+ * bytes it already holds. Nothing new is fetched and no artifact exists.
+ *
+ * Held the way the forward index is held, and for the same reason: the reading
+ * keys are one sorted blob searched by binary search, and the postings are a
+ * `Uint32Array` of dictionary positions. That is 2.03 MB on the full tier where
+ * a `Map<string, number[]>` of the same content is 47.83 MB.
+ *
+ * A posting is a position rather than a word, which is what makes ranking free:
+ * a position indexes the frequency table directly, so the groups are sorted
+ * likeliest-first during the build and a query pays nothing for its order.
+ */
+export class ReverseIndex {
+    /**
+     * Derive the whole index in one go.
+     *
+     * About 4 ms on `core`, 62 ms on `standard` and 510 ms on `full`, measured on
+     * a machine roughly 2.5× a mid-range laptop. Use {@link ReverseIndex.building}
+     * 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;
+    }
+    /**
+     * Start a build that can be driven a slice at a time.
+     */
+    static building(dictionary) {
+        return startBuild(dictionary);
+    }
+    /**
+     * Wrap what a worker built and posted back.
+     *
+     * The dictionary is passed again rather than travelling with the data,
+     * because the positions are only meaningful against the artifact they were
+     * derived from — a dictionary of a different tier would resolve them to the
+     * wrong words.
+     */
+    static from(dictionary, data) {
+        return new ReverseIndex(dictionary, KeyIndex.from(data.keys), data.postings, data.starts);
+    }
+    #dictionary;
+    #keys;
+    #postings;
+    #starts;
+    /**
+     * Wrap already-grouped postings. Use {@link ReverseIndex.of} or
+     * {@link ReverseIndex.from}.
+     */
+    constructor(dictionary, keys, postings, starts) {
+        this.#dictionary = dictionary;
+        this.#keys = keys;
+        this.#postings = postings;
+        this.#starts = starts;
+    }
+    /**
+     * The dictionary the index was derived from, and resolves its postings
+     * against.
+     */
+    get dictionary() {
+        return this.#dictionary;
+    }
+    /**
+     * How many distinct readings the index holds, which is its key count.
+     */
+    get size() {
+        return this.#keys.size;
+    }
+    /**
+     * The dictionary positions read as a key, likeliest first.
+     *
+     * The key is the folded spelling {@link readingKey} produces — toneless, no
+     * spaces, ü written u — not a query. `candidates` is what turns what somebody
+     * types into one of these.
+     *
+     * A view onto the postings rather than a copy, so asking is free.
+     */
+    positionsFor(key) {
+        const found = this.#keys.lookup(key);
+        if (!found.isKey) {
+            return NONE;
+        }
+        return this.#postings.subarray(readAt(this.#starts, found.index), readAt(this.#starts, found.index + 1));
+    }
+    /**
+     * The pieces, ready to be posted to another thread or held elsewhere.
+     */
+    serialise() {
+        return {
+            keys: this.#keys.serialise(),
+            postings: this.#postings,
+            starts: this.#starts,
+        };
+    }
+}
+/**
+ * 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

@@ -0,0 +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"}

package/dist/sources/unihan.d.ts

@@ -58,6 +58,15 @@ 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;AAsFpE;;;;;;;;;;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;;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"}

package/dist/sources/unihan.js

@@ -61,6 +61,17 @@ function readFieldValue(field, value) {
         .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.
  *
@@ -84,7 +95,7 @@ function readFieldValue(field, value) {
  * nothing that a word entry does not already settle.
  */
 function fieldOrder(fields) {
-    if ((fields.get(FREQUENCY_FIELD) ?? []).length > 1) {
+    if (isFrequencyRanked(fields)) {
         return READING_FIELDS;
     }
     return [

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;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,SAAS,UAAU,CACjB,MAAoD;IAEpD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnD,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":"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"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@kensio/pinyinjs",
-  "version": "1.6.0",
+  "version": "1.7.1",
   "description": "Chinese hanzi to pinyin conversion",
   "repository": "https://github.com/KensioSoftware/pinyinjs",
   "homepage": "https://pinyinjs.dev",
@@ -26,7 +26,6 @@
     "dist",
     "data",
     "README.md",
-    "CHANGELOG.md",
     "LICENSE",
     "NOTICE"
   ],
@@ -67,7 +66,7 @@
     "@types/node": "^26.0.0",
     "@typescript/native": "npm:typescript@^7.0.2",
     "@vitest/coverage-v8": "^4.1.10",
-    "conventional-changelog-conventionalcommits": "10.2.1",
+    "conventional-changelog-conventionalcommits": "9.3.1",
     "fta-cli": "^3.0.0",
     "jiti": "^2.7.0",
     "oxfmt": "^0.62.0",