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

package/dist/conformance/sample.js

@@ -0,0 +1,75 @@
+/**
+ * The parameter sets every check draws an entry at.
+ *
+ * The defaults, then each parameter at both ends of its range (or at each of
+ * its options) with the rest at their defaults, then every parameter at its
+ * lowest together and at its highest together, then a few seeded mixtures.
+ * Extremes are where a shape breaks: a dot at its smallest, a bar at its
+ * thinnest. The mixtures catch the cases that only break in combination.
+ * Duplicates are dropped, so an entry with no parameters is drawn once.
+ */
+import { createPrng } from '../core/prng.js';
+import { resolveParams } from '../design/params.js';
+function choices(schema) {
+    switch (schema.kind) {
+        case 'boolean':
+            return [false, true];
+        case 'select':
+            return (schema.options ?? []).map((option) => option.value);
+        case 'colour':
+            return [schema.default];
+        default:
+            return [schema.min ?? schema.default, schema.max ?? schema.default];
+    }
+}
+/** A value drawn from a parameter's range, on its step where it has one. */
+function draw(schema, random) {
+    const options = choices(schema);
+    if (schema.kind === 'boolean' || schema.kind === 'select' || schema.kind === 'colour') {
+        return options[Math.floor(random() * options.length)];
+    }
+    const low = options[0];
+    const high = options[1];
+    const value = low + random() * (high - low);
+    if (schema.kind === 'integer')
+        return Math.round(value);
+    const step = schema.step;
+    if (step === undefined || step <= 0)
+        return value;
+    const stepped = low + Math.round((value - low) / step) * step;
+    return Math.min(Math.max(Number(stepped.toFixed(10)), low), high);
+}
+export function sampleParams(schema, seed = 1, mixtures = 3) {
+    const out = [resolveParams(schema, undefined)];
+    for (const entry of schema) {
+        for (const value of choices(entry))
+            out.push(resolveParams(schema, { [entry.key]: value }));
+    }
+    if (schema.length > 1) {
+        for (const end of [0, 1]) {
+            const given = {};
+            for (const entry of schema)
+                given[entry.key] = choices(entry)[end] ?? entry.default;
+            out.push(resolveParams(schema, given));
+        }
+    }
+    const prng = createPrng(seed);
+    const random = () => prng.next();
+    if (schema.length > 0) {
+        for (let i = 0; i < mixtures; i += 1) {
+            const given = {};
+            for (const entry of schema)
+                given[entry.key] = draw(entry, random);
+            out.push(resolveParams(schema, given));
+        }
+    }
+    const seen = new Set();
+    return out.filter((params) => {
+        const key = JSON.stringify(params);
+        if (seen.has(key))
+            return false;
+        seen.add(key);
+        return true;
+    });
+}
+//# sourceMappingURL=sample.js.map

package/dist/conformance/sample.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sample.js","sourceRoot":"","sources":["../../src/conformance/sample.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAGpD,SAAS,OAAO,CAAC,MAAmB;IACnC,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,SAAS;YACb,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACtB,KAAK,QAAQ;YACZ,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7D,KAAK,QAAQ;YACZ,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACzB;YACC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;IACtE,CAAC;AACF,CAAC;AAED,4EAA4E;AAC5E,SAAS,IAAI,CAAC,MAAmB,EAAE,MAAoB;IACtD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACvF,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAe,CAAC;IACrE,CAAC;IACD,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;IACjC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;IAClC,MAAM,KAAK,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;IAC5C,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAClD,MAAM,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IAC9D,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,YAAY,CAC3B,MAA8B,EAC9B,IAAI,GAAG,CAAC,EACR,QAAQ,GAAG,CAAC;IAEZ,MAAM,GAAG,GAAqB,CAAC,aAAa,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IACjE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAC7F,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAA+B,EAAE,CAAC;YAC7C,KAAK,MAAM,KAAK,IAAI,MAAM;gBAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC;YACpF,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QACxC,CAAC;IACF,CAAC;IACD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,GAAW,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACzC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,MAAM,KAAK,GAA+B,EAAE,CAAC;YAC7C,KAAK,MAAM,KAAK,IAAI,MAAM;gBAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACnE,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QACxC,CAAC;IACF,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,CAAC;IACb,CAAC,CAAC,CAAC;AACJ,CAAC"}

package/dist/conformance/types.d.ts

@@ -0,0 +1,16 @@
+/**
+ * What the conformance checks return: one entry per rule broken, with enough
+ * detail for whoever wrote the entry to find the case and draw it again.
+ *
+ * `detail` is for a developer reading a test failure, in plain English with
+ * the numbers in it. It never reaches a person using the studio, so it is
+ * not a message key.
+ */
+export interface Violation {
+    /** The entry's id. */
+    readonly entry: string;
+    /** Which rule, as a short kebab-case name. */
+    readonly rule: string;
+    readonly detail: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/conformance/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/conformance/types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,WAAW,SAAS;IACzB,sBAAsB;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,8CAA8C;IAC9C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACxB"}

package/dist/conformance/types.js

@@ -0,0 +1,10 @@
+/**
+ * What the conformance checks return: one entry per rule broken, with enough
+ * detail for whoever wrote the entry to find the case and draw it again.
+ *
+ * `detail` is for a developer reading a test failure, in plain English with
+ * the numbers in it. It never reaches a person using the studio, so it is
+ * not a message key.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/conformance/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/conformance/types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/core/bch.d.ts

@@ -0,0 +1,36 @@
+/**
+ * The small BCH codes that protect format and version information.
+ *
+ * These are not the Reed-Solomon code that protects the data. They are tiny
+ * and strong for their size, because a reader that cannot read the format
+ * does not know the mask or the error correction level and cannot begin on the
+ * data. QR's format information is BCH(15, 5) with generator 0x537, its
+ * version information BCH(18, 6) with generator 0x1f25; Micro QR and rMQR use
+ * the same two generators with different masks.
+ *
+ * Decoding is a nearest-codeword search over a table the symbology builds with
+ * `bchEncode`, not syndrome algebra. There are 32 format codewords and 34
+ * version codewords, so comparing against every one is simpler than the
+ * algebra and is what the established readers do. The XOR masks are the
+ * symbology's business and are not applied here.
+ */
+/**
+ * The codeword for `data`: the data bits followed by the remainder of
+ * data * x^checkBits divided by `generator`, where checkBits is the
+ * generator's degree.
+ */
+export declare function bchEncode(data: number, dataBits: number, generator: number): number;
+/**
+ * The codeword in `table` nearest `received` by Hamming distance, if within
+ * `maxDistance`.
+ *
+ * A tie at the nearest distance returns undefined rather than the first entry.
+ * Within a code's correction radius a tie cannot happen; outside it, picking
+ * one of two equally distant codewords is a guess, and a wrong guess at the
+ * format turns the whole data region into noise that might still decode.
+ */
+export declare function bchNearest(received: number, table: readonly number[], maxDistance: number): {
+    index: number;
+    distance: number;
+} | undefined;
+//# sourceMappingURL=bch.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bch.d.ts","sourceRoot":"","sources":["../../src/core/bch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAmBnF;AAkBD;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CACzB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,WAAW,EAAE,MAAM,GACjB;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,CAsBjD"}

package/dist/core/bch.js

@@ -0,0 +1,92 @@
+/**
+ * The small BCH codes that protect format and version information.
+ *
+ * These are not the Reed-Solomon code that protects the data. They are tiny
+ * and strong for their size, because a reader that cannot read the format
+ * does not know the mask or the error correction level and cannot begin on the
+ * data. QR's format information is BCH(15, 5) with generator 0x537, its
+ * version information BCH(18, 6) with generator 0x1f25; Micro QR and rMQR use
+ * the same two generators with different masks.
+ *
+ * Decoding is a nearest-codeword search over a table the symbology builds with
+ * `bchEncode`, not syndrome algebra. There are 32 format codewords and 34
+ * version codewords, so comparing against every one is simpler than the
+ * algebra and is what the established readers do. The XOR masks are the
+ * symbology's business and are not applied here.
+ */
+function degree(generator) {
+    return 31 - Math.clz32(generator);
+}
+/**
+ * The codeword for `data`: the data bits followed by the remainder of
+ * data * x^checkBits divided by `generator`, where checkBits is the
+ * generator's degree.
+ */
+export function bchEncode(data, dataBits, generator) {
+    if (!Number.isInteger(generator) || generator < 2 || generator > 0x7fffffff) {
+        throw new RangeError('a BCH generator is a polynomial of degree 1 or more, below 2^31');
+    }
+    const checkBits = degree(generator);
+    if (!Number.isInteger(dataBits) || dataBits < 1 || dataBits + checkBits > 31) {
+        throw new RangeError(`with ${checkBits} check bits, a codeword has 1 to ${31 - checkBits} data bits`);
+    }
+    if (!Number.isInteger(data) || data < 0 || data >= 1 << dataBits) {
+        throw new RangeError(`the data does not fit in ${dataBits} bits`);
+    }
+    const total = dataBits + checkBits;
+    let remainder = data << checkBits;
+    for (let bit = total - 1; bit >= checkBits; bit -= 1) {
+        if ((remainder >>> bit) & 1)
+            remainder ^= generator << (bit - checkBits);
+    }
+    return (data << checkBits) | remainder;
+}
+function popcount(value) {
+    let rest = value >>> 0;
+    let count = 0;
+    while (rest !== 0) {
+        rest = (rest & (rest - 1)) >>> 0;
+        count += 1;
+    }
+    return count;
+}
+function checkWord(value, what) {
+    if (!Number.isInteger(value) || value < 0 || value > 0xffffffff) {
+        throw new RangeError(`${what} is an unsigned 32 bit integer`);
+    }
+}
+/**
+ * The codeword in `table` nearest `received` by Hamming distance, if within
+ * `maxDistance`.
+ *
+ * A tie at the nearest distance returns undefined rather than the first entry.
+ * Within a code's correction radius a tie cannot happen; outside it, picking
+ * one of two equally distant codewords is a guess, and a wrong guess at the
+ * format turns the whole data region into noise that might still decode.
+ */
+export function bchNearest(received, table, maxDistance) {
+    checkWord(received, 'a received word');
+    if (!Number.isInteger(maxDistance) || maxDistance < 0) {
+        throw new RangeError('a distance is a whole number of bits');
+    }
+    let best = -1;
+    let bestDistance = Infinity;
+    let tied = false;
+    for (let i = 0; i < table.length; i += 1) {
+        const candidate = table[i];
+        checkWord(candidate, 'a table entry');
+        const distance = popcount(received ^ candidate);
+        if (distance < bestDistance) {
+            best = i;
+            bestDistance = distance;
+            tied = false;
+        }
+        else if (distance === bestDistance) {
+            tied = true;
+        }
+    }
+    if (best < 0 || tied || bestDistance > maxDistance)
+        return undefined;
+    return { index: best, distance: bestDistance };
+}
+//# sourceMappingURL=bch.js.map

package/dist/core/bch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bch.js","sourceRoot":"","sources":["../../src/core/bch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,SAAS,MAAM,CAAC,SAAiB;IAChC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,QAAgB,EAAE,SAAiB;IAC1E,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;QAC7E,MAAM,IAAI,UAAU,CAAC,iEAAiE,CAAC,CAAC;IACzF,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,SAAS,GAAG,EAAE,EAAE,CAAC;QAC9E,MAAM,IAAI,UAAU,CACnB,QAAQ,SAAS,oCAAoC,EAAE,GAAG,SAAS,YAAY,CAC/E,CAAC;IACH,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;QAClE,MAAM,IAAI,UAAU,CAAC,4BAA4B,QAAQ,OAAO,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,KAAK,GAAG,QAAQ,GAAG,SAAS,CAAC;IACnC,IAAI,SAAS,GAAG,IAAI,IAAI,SAAS,CAAC;IAClC,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,IAAI,SAAS,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACtD,IAAI,CAAC,SAAS,KAAK,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS,IAAI,SAAS,IAAI,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,SAAS,CAAC;AACxC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAa;IAC9B,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,KAAa,EAAE,IAAY;IAC7C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,UAAU,EAAE,CAAC;QACjE,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,gCAAgC,CAAC,CAAC;IAC/D,CAAC;AACF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CACzB,QAAgB,EAChB,KAAwB,EACxB,WAAmB;IAEnB,SAAS,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;IACvC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,IAAI,YAAY,GAAG,QAAQ,CAAC;IAC5B,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAW,CAAC;QACrC,SAAS,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;QAChD,IAAI,QAAQ,GAAG,YAAY,EAAE,CAAC;YAC7B,IAAI,GAAG,CAAC,CAAC;YACT,YAAY,GAAG,QAAQ,CAAC;YACxB,IAAI,GAAG,KAAK,CAAC;QACd,CAAC;aAAM,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YACtC,IAAI,GAAG,IAAI,CAAC;QACb,CAAC;IACF,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,YAAY,GAAG,WAAW;QAAE,OAAO,SAAS,CAAC;IACrE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AAChD,CAAC"}

package/dist/core/bit-matrix.d.ts

@@ -0,0 +1,56 @@
+/**
+ * A rectangular grid of modules: a symbol, a sampled grid, or a binarised
+ * image.
+ *
+ * Rectangular rather than square because rMQR is, and because a binarised
+ * camera frame is. One byte per module rather than a packed bitset: the
+ * largest symbol is 177 by 177 (31 kB), and the unpacked form removes a class
+ * of shift-and-mask bug from code that is dense enough already.
+ *
+ * Coordinates are checked. An unchecked `y * width + x` with x one past the
+ * edge reads the first module of the next row, which is a valid module with a
+ * plausible value, and the bug it causes shows up three layers later as a
+ * symbol that decodes in one orientation and not another.
+ */
+export declare class BitMatrix {
+    readonly width: number;
+    readonly height: number;
+    /** Row major, one byte per module, 0 for light and 1 for dark. */
+    readonly data: Uint8Array;
+    /**
+     * `data`, when given, is copied, so the matrix never writes into memory the
+     * caller still holds. It must have exactly `width * height` bytes, each 0 or
+     * 1.
+     */
+    constructor(width: number, height: number, data?: Uint8Array);
+    get(x: number, y: number): 0 | 1;
+    set(x: number, y: number, dark: boolean): void;
+    /** Flip one module, which is how a mask is applied. */
+    xor(x: number, y: number): void;
+    setRegion(x: number, y: number, w: number, h: number, dark: boolean): void;
+    clone(): BitMatrix;
+    /**
+     * Every module flipped.
+     *
+     * The cheapest answer to a dark-mode screenshot: rather than guess the
+     * polarity, a reader tries both.
+     */
+    inverted(): BitMatrix;
+    /**
+     * The symbol as it reads in a mirror.
+     *
+     * For a square symbol that is the transpose. Mirroring is invisible to the
+     * finder geometry (a reflected QR code has its three finders in the same L),
+     * so it cannot be detected before sampling; once sampled, a mirrored square
+     * symbol is exactly the transpose of a readable one.
+     *
+     * A rectangular symbol cannot be transposed into one of its own shape, and
+     * rMQR's finder and sub-finder sit at opposite ends of the long side, so a
+     * reflection there is a flip along x.
+     */
+    mirrored(): BitMatrix;
+    countDark(): number;
+    equals(other: BitMatrix): boolean;
+    private index;
+}
+//# sourceMappingURL=bit-matrix.d.ts.map

package/dist/core/bit-matrix.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-matrix.d.ts","sourceRoot":"","sources":["../../src/core/bit-matrix.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,qBAAa,SAAS;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,kEAAkE;IAClE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAE1B;;;;OAIG;gBACS,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU;IAwB5D,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC;IAIhC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI;IAI9C,uDAAuD;IACvD,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAK/B,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI;IAuB1E,KAAK,IAAI,SAAS;IAMlB;;;;;OAKG;IACH,QAAQ,IAAI,SAAS;IAQrB;;;;;;;;;;;OAWG;IACH,QAAQ,IAAI,SAAS;IAqBrB,SAAS,IAAI,MAAM;IAQnB,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;IAQjC,OAAO,CAAC,KAAK;CAQb"}

package/dist/core/bit-matrix.js

@@ -0,0 +1,150 @@
+/**
+ * A rectangular grid of modules: a symbol, a sampled grid, or a binarised
+ * image.
+ *
+ * Rectangular rather than square because rMQR is, and because a binarised
+ * camera frame is. One byte per module rather than a packed bitset: the
+ * largest symbol is 177 by 177 (31 kB), and the unpacked form removes a class
+ * of shift-and-mask bug from code that is dense enough already.
+ *
+ * Coordinates are checked. An unchecked `y * width + x` with x one past the
+ * edge reads the first module of the next row, which is a valid module with a
+ * plausible value, and the bug it causes shows up three layers later as a
+ * symbol that decodes in one orientation and not another.
+ */
+export class BitMatrix {
+    width;
+    height;
+    /** Row major, one byte per module, 0 for light and 1 for dark. */
+    data;
+    /**
+     * `data`, when given, is copied, so the matrix never writes into memory the
+     * caller still holds. It must have exactly `width * height` bytes, each 0 or
+     * 1.
+     */
+    constructor(width, height, data) {
+        if (!Number.isInteger(width) || width < 1 || !Number.isInteger(height) || height < 1) {
+            throw new RangeError('a matrix is at least 1 by 1 with whole-number sides');
+        }
+        this.width = width;
+        this.height = height;
+        if (data === undefined) {
+            this.data = new Uint8Array(width * height);
+            return;
+        }
+        if (data.length !== width * height) {
+            throw new RangeError(`a ${width} by ${height} matrix holds ${width * height} modules, not ${data.length}`);
+        }
+        for (let i = 0; i < data.length; i += 1) {
+            if (data[i] > 1) {
+                throw new RangeError(`module ${i} is neither 0 nor 1`);
+            }
+        }
+        // Not `data.slice()`: on a Node Buffer that is a view of the same memory.
+        this.data = new Uint8Array(data);
+    }
+    get(x, y) {
+        return this.data[this.index(x, y)];
+    }
+    set(x, y, dark) {
+        this.data[this.index(x, y)] = dark ? 1 : 0;
+    }
+    /** Flip one module, which is how a mask is applied. */
+    xor(x, y) {
+        const at = this.index(x, y);
+        this.data[at] = this.data[at] ^ 1;
+    }
+    setRegion(x, y, w, h, dark) {
+        if (!Number.isInteger(w) ||
+            !Number.isInteger(h) ||
+            w < 0 ||
+            h < 0 ||
+            !Number.isInteger(x) ||
+            !Number.isInteger(y) ||
+            x < 0 ||
+            y < 0 ||
+            x + w > this.width ||
+            y + h > this.height) {
+            throw new RangeError(`a ${w} by ${h} region at ${x}, ${y} does not fit a ${this.width} by ${this.height} matrix`);
+        }
+        const fill = dark ? 1 : 0;
+        for (let row = y; row < y + h; row += 1) {
+            this.data.fill(fill, row * this.width + x, row * this.width + x + w);
+        }
+    }
+    clone() {
+        const out = new BitMatrix(this.width, this.height);
+        out.data.set(this.data);
+        return out;
+    }
+    /**
+     * Every module flipped.
+     *
+     * The cheapest answer to a dark-mode screenshot: rather than guess the
+     * polarity, a reader tries both.
+     */
+    inverted() {
+        const out = new BitMatrix(this.width, this.height);
+        for (let i = 0; i < this.data.length; i += 1) {
+            out.data[i] = this.data[i] ^ 1;
+        }
+        return out;
+    }
+    /**
+     * The symbol as it reads in a mirror.
+     *
+     * For a square symbol that is the transpose. Mirroring is invisible to the
+     * finder geometry (a reflected QR code has its three finders in the same L),
+     * so it cannot be detected before sampling; once sampled, a mirrored square
+     * symbol is exactly the transpose of a readable one.
+     *
+     * A rectangular symbol cannot be transposed into one of its own shape, and
+     * rMQR's finder and sub-finder sit at opposite ends of the long side, so a
+     * reflection there is a flip along x.
+     */
+    mirrored() {
+        const { width, height } = this;
+        if (width === height) {
+            const out = new BitMatrix(width, height);
+            for (let y = 0; y < height; y += 1) {
+                for (let x = 0; x < width; x += 1) {
+                    out.data[x * width + y] = this.data[y * width + x];
+                }
+            }
+            return out;
+        }
+        const out = new BitMatrix(width, height);
+        for (let y = 0; y < height; y += 1) {
+            const row = y * width;
+            for (let x = 0; x < width; x += 1) {
+                out.data[row + width - 1 - x] = this.data[row + x];
+            }
+        }
+        return out;
+    }
+    countDark() {
+        let count = 0;
+        for (let i = 0; i < this.data.length; i += 1) {
+            count += this.data[i];
+        }
+        return count;
+    }
+    equals(other) {
+        if (other.width !== this.width || other.height !== this.height)
+            return false;
+        for (let i = 0; i < this.data.length; i += 1) {
+            if (this.data[i] !== other.data[i])
+                return false;
+        }
+        return true;
+    }
+    index(x, y) {
+        // `(x | 0) === x` is false for fractions, NaN and anything past 2^31, all
+        // of which are bugs here, in one comparison.
+        if ((x | 0) !== x || (y | 0) !== y || x < 0 || y < 0 || x >= this.width || y >= this.height) {
+            throw new RangeError(`${x}, ${y} is outside a ${this.width} by ${this.height} matrix`);
+        }
+        return y * this.width + x;
+    }
+}
+//# sourceMappingURL=bit-matrix.js.map

package/dist/core/bit-matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-matrix.js","sourceRoot":"","sources":["../../src/core/bit-matrix.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,SAAS;IACZ,KAAK,CAAS;IACd,MAAM,CAAS;IACxB,kEAAkE;IACzD,IAAI,CAAa;IAE1B;;;;OAIG;IACH,YAAY,KAAa,EAAE,MAAc,EAAE,IAAiB;QAC3D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACtF,MAAM,IAAI,UAAU,CAAC,qDAAqD,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;YAC3C,OAAO;QACR,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,GAAG,MAAM,EAAE,CAAC;YACpC,MAAM,IAAI,UAAU,CACnB,KAAK,KAAK,OAAO,MAAM,iBAAiB,KAAK,GAAG,MAAM,iBAAiB,IAAI,CAAC,MAAM,EAAE,CACpF,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAK,IAAI,CAAC,CAAC,CAAY,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,UAAU,CAAC,UAAU,CAAC,qBAAqB,CAAC,CAAC;YACxD,CAAC;QACF,CAAC;QACD,0EAA0E;QAC1E,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,CAAS,EAAE,CAAS;QACvB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAU,CAAC;IAC7C,CAAC;IAED,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,IAAa;QACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,uDAAuD;IACvD,GAAG,CAAC,CAAS,EAAE,CAAS;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAY,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,IAAa;QAClE,IACC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;YACpB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,CAAC;YACL,CAAC,GAAG,CAAC;YACL,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;YACpB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,CAAC;YACL,CAAC,GAAG,CAAC;YACL,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK;YAClB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAClB,CAAC;YACF,MAAM,IAAI,UAAU,CACnB,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,mBAAmB,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,MAAM,SAAS,CAC3F,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,CAAC;IACF,CAAC;IAED,KAAK;QACJ,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;;OAKG;IACH,QAAQ;QACP,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,QAAQ;QACP,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAC/B,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACnC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAW,CAAC;gBAC9D,CAAC;YACF,CAAC;YACD,OAAO,GAAG,CAAC;QACZ,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAW,CAAC;YAC9D,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,SAAS;QACR,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC;QACjC,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,MAAM,CAAC,KAAgB;QACtB,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEO,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,0EAA0E;QAC1E,6CAA6C;QAC7C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7F,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,iBAAiB,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,MAAM,SAAS,CAAC,CAAC;QACxF,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAC3B,CAAC;CACD"}

package/dist/core/bits.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Bit-level writing and reading, most significant bit first.
+ *
+ * Every bit field in the symbologies this package writes is MSB first: mode
+ * indicators, character counts, segment data, codewords, format information.
+ * Having one implementation of that order rather than a shift at each call
+ * site removes a whole category of bug, and it is the kind of bug that
+ * produces plausible-looking wrong output rather than an obvious failure.
+ *
+ * Numbers that are out of range throw `RangeError`. They are bugs in the
+ * caller (a field width of 33, a read past the end of a stream whose length
+ * the caller already knew), never something to explain to a person. The
+ * messages give widths and positions, never the value that was refused: a
+ * value written here is a piece of somebody's content.
+ */
+export declare class BitBuffer {
+    private bytes;
+    private bitLength;
+    /** Bits written so far. */
+    get length(): number;
+    /** Append the low `bits` bits of `value`, most significant first. */
+    append(value: number, bits: number): void;
+    /** Append every bit of `other`, which may be this buffer itself. */
+    appendBits(other: BitBuffer): void;
+    bit(index: number): 0 | 1;
+    /**
+     * The bits as bytes, the last one padded with zero bits.
+     *
+     * A copy: the buffer can go on being appended to without changing what a
+     * caller already holds.
+     */
+    toBytes(): Uint8Array;
+    private reserve;
+    /** Bits are only ever set, never cleared, so fresh bytes must start at zero, which they do. */
+    private push;
+}
+export declare class BitReader {
+    private readonly bytes;
+    private readonly end;
+    private offset;
+    /**
+     * `bitLength` limits the stream to fewer bits than the bytes hold, for a
+     * symbol whose data capacity is not a whole number of bytes (Micro QR M1
+     * and M3 end on a half codeword).
+     */
+    constructor(bytes: Uint8Array, bitLength?: number);
+    get remaining(): number;
+    /** Bits read so far, for a caller reporting where in a stream something went wrong. */
+    get position(): number;
+    /** Read `bits` bits as an unsigned number, most significant first. */
+    read(bits: number): number;
+}
+//# sourceMappingURL=bits.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bits.d.ts","sourceRoot":"","sources":["../../src/core/bits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAaH,qBAAa,SAAS;IACrB,OAAO,CAAC,KAAK,CAAsB;IACnC,OAAO,CAAC,SAAS,CAAK;IAEtB,2BAA2B;IAC3B,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,qEAAqE;IACrE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAWzC,oEAAoE;IACpE,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAWlC,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC;IAOzB;;;;;OAKG;IACH,OAAO,IAAI,UAAU;IAIrB,OAAO,CAAC,OAAO;IAUf,+FAA+F;IAC/F,OAAO,CAAC,IAAI;CAOZ;AAED,qBAAa,SAAS;IACrB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAa;IACnC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,MAAM,CAAK;IAEnB;;;;OAIG;gBACS,KAAK,EAAE,UAAU,EAAE,SAAS,GAAE,MAAyB;IAUnE,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,uFAAuF;IACvF,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,sEAAsE;IACtE,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;CAc1B"}