@hexpro/qr-code-studio 0.0.0-stage → 0.1.1

package/dist/core/prng.js

@@ -0,0 +1,111 @@
+/**
+ * Seeded randomness, for everything in the determinism zone that needs it:
+ * the scan check's simulated damage, dithering, a random-looking design that
+ * must look the same tomorrow.
+ *
+ * xoshiro128** 1.1 (Blackman and Vigna), seeded by splitmix32. Both are
+ * integer arithmetic over 32 bits with `Math.imul` and shifts, which
+ * ECMAScript fixes exactly, so a seed gives the same stream in every engine.
+ * `Math.random` is banned here for the opposite reason: it is unseeded and
+ * differs everywhere, and a verdict that depends on it cannot be reproduced.
+ *
+ * `fork` gives an independent stream per label, derived from the stream's
+ * starting state rather than its current position. So a job can hand
+ * `fork(1)` to one stage and `fork(2)` to another, and adding a draw to one
+ * stage never shifts the numbers the other sees.
+ */
+const GOLDEN = 0x9e3779b9;
+const TWO_32 = 4294967296;
+/** The splitmix32 output function: a bijection on 32 bits with good avalanche. */
+function mix32(value) {
+    let z = value >>> 0;
+    z = Math.imul(z ^ (z >>> 16), 0x21f0aaad);
+    z = Math.imul(z ^ (z >>> 15), 0x735a2d97);
+    return (z ^ (z >>> 15)) >>> 0;
+}
+/**
+ * Four consecutive splitmix32 outputs from `seed`.
+ *
+ * Each is mix32 of a different input and mix32 is zero only at zero, so at
+ * most one of the four is zero and the state is never all zero, which is the
+ * one state xoshiro cannot leave.
+ */
+function splitmix(seed) {
+    let state = seed >>> 0;
+    const word = () => {
+        state = (state + GOLDEN) >>> 0;
+        return mix32(state);
+    };
+    return [word(), word(), word(), word()];
+}
+function checkUint32(value, what) {
+    if (!Number.isInteger(value) || value < 0 || value >= TWO_32) {
+        throw new RangeError(`${what} is an integer from 0 to 2^32 - 1`);
+    }
+}
+class Xoshiro128 {
+    s0;
+    s1;
+    s2;
+    s3;
+    origin;
+    constructor(state) {
+        this.origin = state;
+        [this.s0, this.s1, this.s2, this.s3] = state;
+    }
+    next() {
+        return this.step() / TWO_32;
+    }
+    int(maxExclusive) {
+        if (!Number.isInteger(maxExclusive) || maxExclusive < 1 || maxExclusive > TWO_32) {
+            throw new RangeError('int() takes a bound from 1 to 2^32');
+        }
+        // Rejection sampling: draws in the top partial copy of [0, n) would make
+        // the low values likelier, so they are drawn again. Exact in doubles,
+        // since everything here is below 2^33.
+        const limit = TWO_32 - (TWO_32 % maxExclusive);
+        for (;;) {
+            const draw = this.step();
+            if (draw < limit)
+                return draw % maxExclusive;
+        }
+    }
+    fork(label) {
+        checkUint32(label, 'a fork label');
+        const [w0, w1, w2, w3] = splitmix(label);
+        const [o0, o1, o2, o3] = this.origin;
+        const child = [
+            mix32(o0 ^ w0),
+            mix32(o1 ^ w1),
+            mix32(o2 ^ w2),
+            mix32(o3 ^ w3),
+        ];
+        // All zero only when the starting state equals the label's words, as it
+        // does for createPrng(n).fork(n). The origin is never all zero, so this
+        // rotation of it, mixed, never is either.
+        if ((child[0] | child[1] | child[2] | child[3]) === 0) {
+            return new Xoshiro128([mix32(o1), mix32(o2), mix32(o3), mix32(o0)]);
+        }
+        return new Xoshiro128(child);
+    }
+    /** xoshiro128** 1.1, one step. */
+    step() {
+        const s1 = this.s1;
+        const scaled = Math.imul(s1, 5);
+        const result = Math.imul((scaled << 7) | (scaled >>> 25), 9) >>> 0;
+        const t = s1 << 9;
+        this.s2 ^= this.s0;
+        this.s3 ^= s1;
+        this.s1 ^= this.s2;
+        this.s0 ^= this.s3;
+        this.s2 ^= t;
+        this.s3 = (this.s3 << 11) | (this.s3 >>> 21);
+        return result;
+    }
+}
+/** A stream seeded by `seed`, an integer from 0 to 2^32 - 1. */
+export function createPrng(seed) {
+    checkUint32(seed, 'a seed');
+    return new Xoshiro128(splitmix(seed));
+}
+//# sourceMappingURL=prng.js.map

package/dist/core/prng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prng.js","sourceRoot":"","sources":["../../src/core/prng.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAWH,MAAM,MAAM,GAAG,UAAU,CAAC;AAC1B,MAAM,MAAM,GAAG,UAAU,CAAC;AAE1B,kFAAkF;AAClF,SAAS,KAAK,CAAC,KAAa;IAC3B,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;IACpB,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,IAAY;IAC7B,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;IACvB,MAAM,IAAI,GAAG,GAAW,EAAE;QACzB,KAAK,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/B,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC,CAAC;IACF,OAAO,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,WAAW,CAAC,KAAa,EAAE,IAAY;IAC/C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;QAC9D,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,mCAAmC,CAAC,CAAC;IAClE,CAAC;AACF,CAAC;AAED,MAAM,UAAU;IACP,EAAE,CAAS;IACX,EAAE,CAAS;IACX,EAAE,CAAS;IACX,EAAE,CAAS;IACF,MAAM,CAA4C;IAEnE,YAAY,KAAgD;QAC3D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IAC9C,CAAC;IAED,IAAI;QACH,OAAO,IAAI,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC;IAC7B,CAAC;IAED,GAAG,CAAC,YAAoB;QACvB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,YAAY,GAAG,CAAC,IAAI,YAAY,GAAG,MAAM,EAAE,CAAC;YAClF,MAAM,IAAI,UAAU,CAAC,oCAAoC,CAAC,CAAC;QAC5D,CAAC;QACD,yEAAyE;QACzE,sEAAsE;QACtE,uCAAuC;QACvC,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;QAC/C,SAAS,CAAC;YACT,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,IAAI,IAAI,GAAG,KAAK;gBAAE,OAAO,IAAI,GAAG,YAAY,CAAC;QAC9C,CAAC;IACF,CAAC;IAED,IAAI,CAAC,KAAa;QACjB,WAAW,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACrC,MAAM,KAAK,GAAqC;YAC/C,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;YACd,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;YACd,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;YACd,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;SACd,CAAC;QACF,wEAAwE;QACxE,wEAAwE;QACxE,0CAA0C;QAC1C,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,OAAO,IAAI,UAAU,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,kCAAkC;IAC1B,IAAI;QACX,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACnE,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;QACd,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7C,OAAO,MAAM,CAAC;IACf,CAAC;CACD;AAED,gEAAgE;AAChE,MAAM,UAAU,UAAU,CAAC,IAAY;IACtC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC5B,OAAO,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AACvC,CAAC"}

package/dist/core/reed-solomon.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Reed-Solomon codes over any field in `field.ts`, with errors and erasures.
+ *
+ * Lifted from the authenticator package's QR-only decoder and generalised in
+ * three directions: the field (QR's GF(2^8), Data Matrix's other GF(2^8),
+ * PDF417's GF(929)), the first root of the generator polynomial (0 for QR, 1
+ * for Data Matrix and PDF417), and erasures, positions a reader already knows
+ * are unreliable, each of which costs one check symbol to repair instead of
+ * two.
+ *
+ * Decoding is the classical pipeline: syndromes, Berlekamp-Massey started from
+ * the erasure locator (Forney's way of folding known positions in), Chien
+ * search for the roots, Forney's formula for the values, and then a syndrome
+ * check of the result, because the one outcome worse than failing is
+ * succeeding wrongly.
+ *
+ * Conventions. Codewords arrive most significant first, as they sit in a
+ * symbol: index 0 is the coefficient of x^(n-1). Inside the algebra,
+ * polynomials are arrays with index i holding the coefficient of x^i. The
+ * conversion happens at the edges of `rsDecode` and nowhere else, because
+ * mixing the two inside the algebra produces code that works for symmetric
+ * inputs and fails for everything else.
+ *
+ * Nothing here assumes characteristic 2. Subtraction is `field.sub`, integer
+ * multiples (the formal derivative) are repeated additions, and the check
+ * symbols are the negated remainder, which is the remainder itself in GF(2^8)
+ * and its complement mod 929 in PDF417.
+ */
+import type { Field } from './field.js';
+export interface RsCode {
+    readonly field: Field;
+    /** Check symbols per block. */
+    readonly ecCount: number;
+    /** The generator's roots are generator^firstRoot onwards: 0 for QR, 1 for Data Matrix. */
+    readonly firstRoot: number;
+}
+export interface RsDecodeOptions {
+    /** Positions (indexes into the received block) known to be unreliable. */
+    readonly erasures?: readonly number[];
+    /** Refuse more than this many errors even if the code could correct them (misdecode protection). */
+    readonly maxErrors?: number;
+}
+export interface RsDecoded {
+    /** Corrected, data and check symbols. */
+    readonly codewords: number[];
+    /** Symbol errors corrected (erasures not counted). */
+    readonly errors: number;
+    /** Erasures used. */
+    readonly erasures: number;
+}
+/**
+ * The `ecCount` check symbols for `data`, most significant first.
+ *
+ * Appending them to the data gives a block divisible by the generator
+ * polynomial, which is what every reader checks.
+ */
+export declare function rsEncode(code: RsCode, data: ArrayLike<number>): number[];
+/**
+ * Correct a block of data followed by check symbols. The block passed in is
+ * not modified; the corrected one is a new array.
+ *
+ * Corrects any pattern of e errors and f erasures with 2e + f <= ecCount.
+ * Throws `RsDecodeError` when there is no such pattern, when e is past
+ * `maxErrors`, or when the corrected block fails its own syndrome check.
+ * A block past the code's reach either throws or comes back as some valid
+ * codeword; it never comes back as a block that is not a codeword.
+ */
+export declare function rsDecode(code: RsCode, received: ArrayLike<number>, options?: RsDecodeOptions): RsDecoded;
+//# sourceMappingURL=reed-solomon.d.ts.map

package/dist/core/reed-solomon.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon.d.ts","sourceRoot":"","sources":["../../src/core/reed-solomon.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAGH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,MAAM,WAAW,MAAM;IACtB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB,+BAA+B;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,0FAA0F;IAC1F,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC/B,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC,oGAAoG;IACpG,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,SAAS;IACzB,yCAAyC;IACzC,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC;IAC7B,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,qBAAqB;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAiED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAoBxE;AAuCD;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CACvB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,SAAS,CAAC,MAAM,CAAC,EAC3B,OAAO,GAAE,eAAoB,GAC3B,SAAS,CAoKX"}

package/dist/core/reed-solomon.js

@@ -0,0 +1,308 @@
+/**
+ * Reed-Solomon codes over any field in `field.ts`, with errors and erasures.
+ *
+ * Lifted from the authenticator package's QR-only decoder and generalised in
+ * three directions: the field (QR's GF(2^8), Data Matrix's other GF(2^8),
+ * PDF417's GF(929)), the first root of the generator polynomial (0 for QR, 1
+ * for Data Matrix and PDF417), and erasures, positions a reader already knows
+ * are unreliable, each of which costs one check symbol to repair instead of
+ * two.
+ *
+ * Decoding is the classical pipeline: syndromes, Berlekamp-Massey started from
+ * the erasure locator (Forney's way of folding known positions in), Chien
+ * search for the roots, Forney's formula for the values, and then a syndrome
+ * check of the result, because the one outcome worse than failing is
+ * succeeding wrongly.
+ *
+ * Conventions. Codewords arrive most significant first, as they sit in a
+ * symbol: index 0 is the coefficient of x^(n-1). Inside the algebra,
+ * polynomials are arrays with index i holding the coefficient of x^i. The
+ * conversion happens at the edges of `rsDecode` and nowhere else, because
+ * mixing the two inside the algebra produces code that works for symmetric
+ * inputs and fails for everything else.
+ *
+ * Nothing here assumes characteristic 2. Subtraction is `field.sub`, integer
+ * multiples (the formal derivative) are repeated additions, and the check
+ * symbols are the negated remainder, which is the remainder itself in GF(2^8)
+ * and its complement mod 929 in PDF417.
+ */
+import { RsDecodeError } from './errors.js';
+/** The longest block a field can carry: every position needs its own power of the generator. */
+function checkCode(code, length) {
+    const { field, ecCount, firstRoot } = code;
+    if (!Number.isInteger(ecCount) || ecCount < 1) {
+        throw new RangeError('a Reed-Solomon code has at least one check symbol');
+    }
+    if (!Number.isSafeInteger(firstRoot)) {
+        throw new RangeError('the first root of a Reed-Solomon code is a whole power');
+    }
+    if (length > field.size - 1) {
+        throw new RangeError(`a block in a field of ${field.size} elements is at most ${field.size - 1} symbols, not ${length}`);
+    }
+}
+/**
+ * The first root as a power in [0, size - 1). Powers of the generator repeat
+ * with that period, so this changes no answer, and it keeps every exponent
+ * formed from it a safe integer however large the caller's value.
+ */
+function rootPower(code) {
+    const order = code.field.size - 1;
+    return ((code.firstRoot % order) + order) % order;
+}
+let generators;
+/**
+ * The generator polynomial, monic, most significant coefficient first:
+ * (x - a^b)(x - a^(b+1))...(x - a^(b+ecCount-1)) for generator a and first
+ * root b. Cached per field, because an encoder asks for the same few dozen
+ * again and again.
+ */
+function generatorPolynomial(code) {
+    const { field, ecCount } = code;
+    const firstRoot = rootPower(code);
+    generators ??= new WeakMap();
+    let byField = generators.get(field);
+    if (byField === undefined) {
+        byField = new Map();
+        generators.set(field, byField);
+    }
+    const key = `${ecCount}:${firstRoot}`;
+    const cached = byField.get(key);
+    if (cached !== undefined)
+        return cached;
+    let poly = [1];
+    for (let i = 0; i < ecCount; i += 1) {
+        const root = field.exp(firstRoot + i);
+        const next = new Array(poly.length + 1);
+        next[0] = poly[0];
+        for (let j = 1; j < poly.length; j += 1) {
+            next[j] = field.sub(poly[j], field.mul(root, poly[j - 1]));
+        }
+        next[poly.length] = field.sub(0, field.mul(root, poly[poly.length - 1]));
+        poly = next;
+    }
+    const frozen = Object.freeze(poly);
+    byField.set(key, frozen);
+    return frozen;
+}
+/**
+ * The `ecCount` check symbols for `data`, most significant first.
+ *
+ * Appending them to the data gives a block divisible by the generator
+ * polynomial, which is what every reader checks.
+ */
+export function rsEncode(code, data) {
+    checkCode(code, data.length + code.ecCount);
+    const { field, ecCount } = code;
+    const generator = generatorPolynomial(code);
+    // The running remainder of data(x) * x^ecCount over the generator, highest
+    // coefficient first, kept as a shift register rather than a full division.
+    const remainder = new Array(ecCount).fill(0);
+    for (let i = 0; i < data.length; i += 1) {
+        const factor = field.add(data[i], remainder[0]);
+        for (let j = 0; j < ecCount - 1; j += 1) {
+            remainder[j] = field.sub(remainder[j + 1], field.mul(factor, generator[j + 1]));
+        }
+        remainder[ecCount - 1] = field.sub(0, field.mul(factor, generator[ecCount]));
+    }
+    // data * x^ecCount - remainder is the codeword, so the check symbols are the
+    // negated remainder.
+    return remainder.map((value) => field.sub(0, value));
+}
+/** Evaluate a lowest-first polynomial at x, by Horner's rule. */
+function evaluate(field, poly, x) {
+    let result = 0;
+    for (let i = poly.length - 1; i >= 0; i -= 1) {
+        result = field.add(field.mul(result, x), poly[i]);
+    }
+    return result;
+}
+/** k copies of a added together: the integer multiple a field needs for a formal derivative. */
+function times(field, k, a) {
+    let result = 0;
+    let addend = a;
+    for (let n = k; n > 0; n >>>= 1) {
+        if (n & 1)
+            result = field.add(result, addend);
+        addend = field.add(addend, addend);
+    }
+    return result;
+}
+/** S_k = r(a^(b+k)) for k in [0, ecCount). All zero means a valid codeword. */
+function syndromes(code, received) {
+    const { field, ecCount } = code;
+    const firstRoot = rootPower(code);
+    const out = new Array(ecCount);
+    for (let k = 0; k < ecCount; k += 1) {
+        const x = field.exp(firstRoot + k);
+        // The block is most significant first, so Horner runs forwards over it.
+        let value = 0;
+        for (let i = 0; i < received.length; i += 1) {
+            value = field.add(field.mul(value, x), received[i]);
+        }
+        out[k] = value;
+    }
+    return out;
+}
+/**
+ * Correct a block of data followed by check symbols. The block passed in is
+ * not modified; the corrected one is a new array.
+ *
+ * Corrects any pattern of e errors and f erasures with 2e + f <= ecCount.
+ * Throws `RsDecodeError` when there is no such pattern, when e is past
+ * `maxErrors`, or when the corrected block fails its own syndrome check.
+ * A block past the code's reach either throws or comes back as some valid
+ * codeword; it never comes back as a block that is not a codeword.
+ */
+export function rsDecode(code, received, options = {}) {
+    const { field, ecCount } = code;
+    const n = received.length;
+    checkCode(code, n);
+    const firstRoot = rootPower(code);
+    if (n < ecCount) {
+        throw new RangeError(`a block with ${ecCount} check symbols is at least that long, not ${n}`);
+    }
+    const codewords = new Array(n);
+    for (let i = 0; i < n; i += 1) {
+        const value = received[i];
+        if ((value | 0) !== value || value < 0 || value >= field.size) {
+            throw new RangeError(`symbol ${i} is not an element of a field of ${field.size}`);
+        }
+        codewords[i] = value;
+    }
+    const erased = options.erasures ?? [];
+    const erasedSet = new Set();
+    for (const position of erased) {
+        if (!Number.isInteger(position) || position < 0 || position >= n) {
+            throw new RangeError(`an erasure is a position in the block, 0 to ${n - 1}`);
+        }
+        if (erasedSet.has(position)) {
+            throw new TypeError(`position ${position} is listed as an erasure twice`);
+        }
+        erasedSet.add(position);
+    }
+    const { maxErrors } = options;
+    if (maxErrors !== undefined && (!Number.isInteger(maxErrors) || maxErrors < 0)) {
+        throw new RangeError('maxErrors is a whole number of errors');
+    }
+    const f = erased.length;
+    if (f > ecCount)
+        throw new RsDecodeError('too-many-erasures');
+    const s = syndromes(code, codewords);
+    if (s.every((value) => value === 0)) {
+        return { codewords, errors: 0, erasures: f };
+    }
+    // Position i in the block is the coefficient of x^(n-1-i), and its locator
+    // is a^(n-1-i).
+    const power = (i) => n - 1 - i;
+    // The erasure locator, the product of (1 - X x) over the erased positions.
+    let gamma = [1];
+    for (const position of erased) {
+        const x = field.exp(power(position));
+        const next = new Array(gamma.length + 1).fill(0);
+        for (let i = 0; i < gamma.length; i += 1) {
+            next[i] = field.add(next[i], gamma[i]);
+            next[i + 1] = field.sub(next[i + 1], field.mul(x, gamma[i]));
+        }
+        gamma = next;
+    }
+    // Berlekamp-Massey, started from the erasure locator rather than from 1.
+    // That is the same as running it on Forney's modified syndromes and
+    // multiplying by gamma afterwards, without forming either: the register
+    // starts f long, steps begin at f, and the length update carries f along.
+    let lambda = gamma.slice();
+    let previous = gamma.slice();
+    let length = f;
+    let shift = 1;
+    let lastDiscrepancy = 1;
+    for (let step = f; step < ecCount; step += 1) {
+        let discrepancy = 0;
+        for (let i = 0; i <= length && i < lambda.length; i += 1) {
+            discrepancy = field.add(discrepancy, field.mul(lambda[i], s[step - i]));
+        }
+        if (discrepancy === 0) {
+            shift += 1;
+            continue;
+        }
+        const scale = field.div(discrepancy, lastDiscrepancy);
+        const updated = new Array(Math.max(lambda.length, previous.length + shift)).fill(0);
+        for (let i = 0; i < lambda.length; i += 1)
+            updated[i] = lambda[i];
+        for (let i = 0; i < previous.length; i += 1) {
+            updated[i + shift] = field.sub(updated[i + shift], field.mul(scale, previous[i]));
+        }
+        if (2 * length <= step + f) {
+            previous = lambda;
+            length = step + 1 + f - length;
+            lastDiscrepancy = discrepancy;
+            shift = 1;
+        }
+        else {
+            shift += 1;
+        }
+        lambda = updated;
+    }
+    const errorCount = length - f;
+    if (2 * errorCount + f > ecCount)
+        throw new RsDecodeError('too-many-errors');
+    if (maxErrors !== undefined && errorCount > maxErrors)
+        throw new RsDecodeError('over-limit');
+    // The locator must have exactly `length` roots, all inside the block.
+    let degree = lambda.length - 1;
+    while (degree > 0 && lambda[degree] === 0)
+        degree -= 1;
+    if (degree !== length)
+        throw new RsDecodeError('no-solution');
+    lambda = lambda.slice(0, degree + 1);
+    const positions = [];
+    for (let i = 0; i < n; i += 1) {
+        if (evaluate(field, lambda, field.exp(-power(i))) === 0)
+            positions.push(i);
+    }
+    if (positions.length !== degree)
+        throw new RsDecodeError('no-solution');
+    // Omega = S(x) Lambda(x) mod x^ecCount, and the formal derivative of Lambda.
+    const omega = new Array(ecCount).fill(0);
+    for (let i = 0; i < ecCount; i += 1) {
+        for (let j = 0; j < lambda.length && i + j < ecCount; j += 1) {
+            omega[i + j] = field.add(omega[i + j], field.mul(s[i], lambda[j]));
+        }
+    }
+    const derivative = new Array(degree);
+    for (let i = 1; i <= degree; i += 1)
+        derivative[i - 1] = times(field, i, lambda[i]);
+    let errors = 0;
+    let phantom = false;
+    for (const position of positions) {
+        const j = power(position);
+        const xInverse = field.exp(-j);
+        // Never zero: Chien search found `degree` distinct roots, so Lambda splits
+        // into distinct linear factors and its derivative cannot vanish at any of
+        // them.
+        const denominator = evaluate(field, derivative, xInverse);
+        // Forney, for roots starting at a^b: Y = -X^(1-b) Omega(X^-1) / Lambda'(X^-1).
+        const magnitude = field.sub(0, field.mul(field.exp(j * (1 - firstRoot)), field.div(evaluate(field, omega, xInverse), denominator)));
+        codewords[position] = field.sub(codewords[position], magnitude);
+        if (erasedSet.has(position))
+            continue;
+        // An error position whose value is zero is not an error: the locator
+        // claimed more than the block holds, which only happens past the code's
+        // reach.
+        phantom ||= magnitude === 0;
+        errors += 1;
+    }
+    // Verify rather than trust. With the root count checked above this cannot
+    // fire: a register of length L that generates all the syndromes and splits
+    // into L distinct roots inside the block describes an error pattern exactly
+    // (the syndromes are then a combination of those roots' powers, and Forney
+    // computes its coefficients), and a zero coefficient would contradict the
+    // register being the shortest. It stays because the cost is one more pass
+    // over the syndromes, and the alternative to a theorem being implemented
+    // correctly is somebody's Wi-Fi password decoded wrongly with confidence.
+    // No test can reach it without a bug to reach it through, hence the hint.
+    /* v8 ignore next 3 */
+    if (phantom || syndromes(code, codewords).some((value) => value !== 0)) {
+        throw new RsDecodeError('no-solution');
+    }
+    return { codewords, errors, erasures: f };
+}
+//# sourceMappingURL=reed-solomon.js.map

package/dist/core/reed-solomon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon.js","sourceRoot":"","sources":["../../src/core/reed-solomon.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AA2B5C,gGAAgG;AAChG,SAAS,SAAS,CAAC,IAAY,EAAE,MAAc;IAC9C,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;IAC3C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,UAAU,CAAC,wDAAwD,CAAC,CAAC;IAChF,CAAC;IACD,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CACnB,yBAAyB,KAAK,CAAC,IAAI,wBAAwB,KAAK,CAAC,IAAI,GAAG,CAAC,iBAAiB,MAAM,EAAE,CAClG,CAAC;IACH,CAAC;AACF,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,IAAY;IAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;IAClC,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AACnD,CAAC;AAED,IAAI,UAAsE,CAAC;AAE3E;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,IAAY;IACxC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAChC,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAClC,UAAU,KAAK,IAAI,OAAO,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QACpB,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,GAAG,GAAG,GAAG,OAAO,IAAI,SAAS,EAAE,CAAC;IACtC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAExC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAW,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;QACnF,IAAI,GAAG,IAAI,CAAC;IACb,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,IAAuB;IAC7D,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAChC,MAAM,SAAS,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,2EAA2E;IAC3E,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAW,EAAE,SAAS,CAAC,CAAC,CAAW,CAAC,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CACvB,SAAS,CAAC,CAAC,GAAG,CAAC,CAAW,EAC1B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC,CAC7C,CAAC;QACH,CAAC;QACD,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAW,CAAC,CAAC,CAAC;IACxF,CAAC;IACD,6EAA6E;IAC7E,qBAAqB;IACrB,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,iEAAiE;AACjE,SAAS,QAAQ,CAAC,KAAY,EAAE,IAAuB,EAAE,CAAS;IACjE,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAW,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,gGAAgG;AAChG,SAAS,KAAK,CAAC,KAAY,EAAE,CAAS,EAAE,CAAS;IAChD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,SAAS,SAAS,CAAC,IAAY,EAAE,QAA2B;IAC3D,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAChC,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,OAAO,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACnC,wEAAwE;QACxE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAW,CAAC,CAAC;QAC/D,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAChB,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CACvB,IAAY,EACZ,QAA2B,EAC3B,UAA2B,EAAE;IAE7B,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAChC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC1B,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnB,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;QACjB,MAAM,IAAI,UAAU,CAAC,gBAAgB,OAAO,6CAA6C,CAAC,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAW,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC/D,MAAM,IAAI,UAAU,CAAC,UAAU,CAAC,oCAAoC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,SAAS,CAAC,YAAY,QAAQ,gCAAgC,CAAC,CAAC;QAC3E,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACzB,CAAC;IACD,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IAC9B,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;QAChF,MAAM,IAAI,UAAU,CAAC,uCAAuC,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,GAAG,OAAO;QAAE,MAAM,IAAI,aAAa,CAAC,mBAAmB,CAAC,CAAC;IAE9D,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACrC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAC9C,CAAC;IAED,2EAA2E;IAC3E,gBAAgB;IAChB,MAAM,KAAK,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAE/C,2EAA2E;IAC3E,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAW,EAAE,KAAK,CAAC,CAAC,CAAW,CAAC,CAAC;YAC3D,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,KAAK,GAAG,IAAI,CAAC;IACd,CAAC;IAED,yEAAyE;IACzE,oEAAoE;IACpE,wEAAwE;IACxE,0EAA0E;IAC1E,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,IAAI,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC7B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1D,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;QAC7F,CAAC;QACD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACV,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;QAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,CAC7B,OAAO,CAAC,CAAC,GAAG,KAAK,CAAW,EAC5B,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAW,CAAC,CACvC,CAAC;QACH,CAAC;QACD,IAAI,CAAC,GAAG,MAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YAC5B,QAAQ,GAAG,MAAM,CAAC;YAClB,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YAC/B,eAAe,GAAG,WAAW,CAAC;YAC9B,KAAK,GAAG,CAAC,CAAC;QACX,CAAC;aAAM,CAAC;YACP,KAAK,IAAI,CAAC,CAAC;QACZ,CAAC;QACD,MAAM,GAAG,OAAO,CAAC;IAClB,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,GAAG,OAAO;QAAE,MAAM,IAAI,aAAa,CAAC,iBAAiB,CAAC,CAAC;IAC7E,IAAI,SAAS,KAAK,SAAS,IAAI,UAAU,GAAG,SAAS;QAAE,MAAM,IAAI,aAAa,CAAC,YAAY,CAAC,CAAC;IAE7F,sEAAsE;IACtE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,OAAO,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,CAAC,CAAC;IACvD,IAAI,MAAM,KAAK,MAAM;QAAE,MAAM,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;IAC9D,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAErC,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,KAAK,MAAM;QAAE,MAAM,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;IAExE,6EAA6E;IAC7E,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9D,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CACvB,KAAK,CAAC,CAAC,GAAG,CAAC,CAAW,EACtB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAW,EAAE,MAAM,CAAC,CAAC,CAAW,CAAC,CAC9C,CAAC;QACH,CAAC;IACF,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,CAAC;QAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAW,CAAC,CAAC;IAE9F,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,2EAA2E;QAC3E,0EAA0E;QAC1E,QAAQ;QACR,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC1D,+EAA+E;QAC/E,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAC1B,CAAC,EACD,KAAK,CAAC,GAAG,CACR,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAC9B,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,CACxD,CACD,CAAC;QACF,SAAS,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAW,EAAE,SAAS,CAAC,CAAC;QAC1E,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QACtC,qEAAqE;QACrE,wEAAwE;QACxE,SAAS;QACT,OAAO,KAAK,SAAS,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,CAAC,CAAC;IACb,CAAC;IAED,0EAA0E;IAC1E,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,0EAA0E;IAC1E,0EAA0E;IAC1E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,sBAAsB;IACtB,IAAI,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AAC3C,CAAC"}

package/dist/core/registry.d.ts

@@ -0,0 +1,45 @@
+/**
+ * A named set of entries: module shapes, frames, content types, symbologies.
+ *
+ * An instance, never a module-level list. `sideEffects: false` lets a bundler
+ * drop an import whose only purpose was to register something, so nothing
+ * here registers itself at import: `createRegistries()` in the layers above
+ * builds instances filled with the built-ins, and a test can build an empty
+ * one.
+ *
+ * Ids are kebab-case because they travel: into design files, into message
+ * keys the website translates, into the list a verify job sends to say which
+ * entries it needs. One spelling per entry keeps all of those in step.
+ */
+export interface RegistryEntry {
+    readonly id: string;
+}
+export declare class Registry<T extends RegistryEntry> {
+    readonly kind: string;
+    private readonly entries;
+    private ordered;
+    private names;
+    private registrations;
+    constructor(kind: string, entries?: readonly T[]);
+    /** Increments on every register, so a cache keyed on it knows when to rebuild. */
+    get version(): number;
+    /** Throws TypeError on an id that is not kebab-case or is already taken. */
+    register(entry: T): void;
+    get(id: string): T | undefined;
+    /**
+     * Throws `UnknownEntryError` ('design/unknown-entry', params { kind, id })
+     * when it is missing.
+     *
+     * The id comes back in params only if it is a well-formed id; otherwise
+     * params.id is empty. An id usually arrives from a design file, and a file
+     * can put anything in that field, so arbitrary text from it is never echoed
+     * into an error that might end up in a bug report.
+     */
+    require(id: string): T;
+    has(id: string): boolean;
+    /** Every entry, in registration order. Frozen. */
+    list(): readonly T[];
+    /** Every id, in registration order. Frozen. */
+    ids(): readonly string[];
+}
+//# sourceMappingURL=registry.d.ts.map

package/dist/core/registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/core/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,MAAM,WAAW,aAAa;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACpB;AAYD,qBAAa,QAAQ,CAAC,CAAC,SAAS,aAAa;IAC5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAwB;IAChD,OAAO,CAAC,OAAO,CAAmC;IAClD,OAAO,CAAC,KAAK,CAAwC;IACrD,OAAO,CAAC,aAAa,CAAK;gBAEd,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,SAAS,CAAC,EAAO;IAMpD,kFAAkF;IAClF,IAAI,OAAO,IAAI,MAAM,CAEpB;IAED,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAWxB,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAI9B;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;IAStB,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIxB,kDAAkD;IAClD,IAAI,IAAI,SAAS,CAAC,EAAE;IAIpB,+CAA+C;IAC/C,GAAG,IAAI,SAAS,MAAM,EAAE;CAGxB"}

package/dist/core/registry.js

@@ -0,0 +1,80 @@
+/**
+ * A named set of entries: module shapes, frames, content types, symbologies.
+ *
+ * An instance, never a module-level list. `sideEffects: false` lets a bundler
+ * drop an import whose only purpose was to register something, so nothing
+ * here registers itself at import: `createRegistries()` in the layers above
+ * builds instances filled with the built-ins, and a test can build an empty
+ * one.
+ *
+ * Ids are kebab-case because they travel: into design files, into message
+ * keys the website translates, into the list a verify job sends to say which
+ * entries it needs. One spelling per entry keeps all of those in step.
+ */
+import { UnknownEntryError } from './errors.js';
+const KEBAB = /^[a-z][a-z0-9]*(?:-[a-z0-9]+)*$/;
+function checkKebab(value, what) {
+    if (typeof value !== 'string' || !KEBAB.test(value)) {
+        throw new TypeError(`${what} must be kebab-case: lowercase words of letters and digits joined by hyphens`);
+    }
+}
+export class Registry {
+    kind;
+    entries = new Map();
+    ordered = Object.freeze([]);
+    names = Object.freeze([]);
+    registrations = 0;
+    constructor(kind, entries = []) {
+        checkKebab(kind, 'a registry kind');
+        this.kind = kind;
+        for (const entry of entries)
+            this.register(entry);
+    }
+    /** Increments on every register, so a cache keyed on it knows when to rebuild. */
+    get version() {
+        return this.registrations;
+    }
+    /** Throws TypeError on an id that is not kebab-case or is already taken. */
+    register(entry) {
+        checkKebab(entry.id, `a ${this.kind} id`);
+        if (this.entries.has(entry.id)) {
+            throw new TypeError(`this ${this.kind} registry already has an entry with that id`);
+        }
+        this.entries.set(entry.id, entry);
+        this.ordered = Object.freeze([...this.ordered, entry]);
+        this.names = Object.freeze([...this.names, entry.id]);
+        this.registrations += 1;
+    }
+    get(id) {
+        return this.entries.get(id);
+    }
+    /**
+     * Throws `UnknownEntryError` ('design/unknown-entry', params { kind, id })
+     * when it is missing.
+     *
+     * The id comes back in params only if it is a well-formed id; otherwise
+     * params.id is empty. An id usually arrives from a design file, and a file
+     * can put anything in that field, so arbitrary text from it is never echoed
+     * into an error that might end up in a bug report.
+     */
+    require(id) {
+        const found = this.entries.get(id);
+        if (found === undefined) {
+            const safe = typeof id === 'string' && id.length <= 64 && KEBAB.test(id) ? id : '';
+            throw new UnknownEntryError(this.kind, safe);
+        }
+        return found;
+    }
+    has(id) {
+        return this.entries.has(id);
+    }
+    /** Every entry, in registration order. Frozen. */
+    list() {
+        return this.ordered;
+    }
+    /** Every id, in registration order. Frozen. */
+    ids() {
+        return this.names;
+    }
+}
+//# sourceMappingURL=registry.js.map

package/dist/core/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../../src/core/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAMhD,MAAM,KAAK,GAAG,iCAAiC,CAAC;AAEhD,SAAS,UAAU,CAAC,KAAc,EAAE,IAAY;IAC/C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,SAAS,CAClB,GAAG,IAAI,8EAA8E,CACrF,CAAC;IACH,CAAC;AACF,CAAC;AAED,MAAM,OAAO,QAAQ;IACX,IAAI,CAAS;IACL,OAAO,GAAG,IAAI,GAAG,EAAa,CAAC;IACxC,OAAO,GAAiB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC1C,KAAK,GAAsB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC7C,aAAa,GAAG,CAAC,CAAC;IAE1B,YAAY,IAAY,EAAE,UAAwB,EAAE;QACnD,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,OAAO;YAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC;IAED,kFAAkF;IAClF,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,aAAa,CAAC;IAC3B,CAAC;IAED,4EAA4E;IAC5E,QAAQ,CAAC,KAAQ;QAChB,UAAU,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,SAAS,CAAC,QAAQ,IAAI,CAAC,IAAI,6CAA6C,CAAC,CAAC;QACrF,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,EAAU;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,IAAI,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnF,MAAM,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,GAAG,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,kDAAkD;IAClD,IAAI;QACH,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,+CAA+C;IAC/C,GAAG;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;CACD"}