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

package/dist/symbology/qr/mask.js

@@ -0,0 +1,113 @@
+/**
+ * QR's eight data masks and the penalty score that chooses between them.
+ *
+ * Masking exists so a symbol never holds a large blank area or an accidental
+ * copy of a finder pattern, either of which sends a reader looking in the
+ * wrong place. The encoder scores all eight and keeps the lowest; the reader
+ * is told which was used in the format information, so a reader never has to
+ * agree with the encoder's taste.
+ *
+ * Lifted from the authenticator package (`src/qr/mask.ts` there), rewritten
+ * over the flat module array, with its reading of the one ambiguous rule kept:
+ * rule 3's four light modules must lie inside the symbol (the quiet zone does
+ * not count), and a finder-like run counts once even when both its sides are
+ * clear. The `qrcode` package reads that last case as two, and also rounds
+ * rule 4 differently above 50% dark; `tests/symbology/qr/mask.test.ts`
+ * measures both and checks that every place the two packages choose different
+ * masks is explained by one of those two readings and nothing else.
+ *
+ * The predicates take (row, column): ISO/IEC 18004 Table 10 writes them as
+ * (i, j) with i the row, and swapping the two gives four masks that are the
+ * transposes of the right ones, which round-trips within one implementation
+ * and fails against every other.
+ */
+export const QR_MASKS = Object.freeze([
+    (row, column) => (row + column) % 2 === 0,
+    (row) => row % 2 === 0,
+    (_row, column) => column % 3 === 0,
+    (row, column) => (row + column) % 3 === 0,
+    (row, column) => (Math.floor(row / 2) + Math.floor(column / 3)) % 2 === 0,
+    (row, column) => ((row * column) % 2) + ((row * column) % 3) === 0,
+    (row, column) => (((row * column) % 2) + ((row * column) % 3)) % 2 === 0,
+    (row, column) => (((row + column) % 2) + ((row * column) % 3)) % 2 === 0,
+]);
+/** Penalty weights, ISO/IEC 18004 7.8.3.1. */
+const N1 = 3;
+const N2 = 3;
+const N3 = 40;
+const N4 = 10;
+/** Runs of five or more of one colour along a line: N1 plus one for each module past five. */
+function runPenalty(data, start, stride, length) {
+    let penalty = 0;
+    let colour = data[start];
+    let run = 1;
+    for (let i = 1; i < length; i += 1) {
+        const value = data[start + i * stride];
+        if (value === colour) {
+            run += 1;
+            continue;
+        }
+        if (run >= 5)
+            penalty += N1 + run - 5;
+        colour = value;
+        run = 1;
+    }
+    if (run >= 5)
+        penalty += N1 + run - 5;
+    return penalty;
+}
+const FINDER_LIKE = [1, 0, 1, 1, 1, 0, 1];
+/**
+ * Finder-like runs (dark, light, dark dark dark, light, dark) along a line
+ * with four light modules inside the symbol before or after them, N3 each.
+ */
+function finderPenalty(data, start, stride, length) {
+    let count = 0;
+    const at = (i) => data[start + i * stride];
+    const light = (from, to) => {
+        if (from < 0 || to > length)
+            return false;
+        for (let i = from; i < to; i += 1)
+            if (at(i) !== 0)
+                return false;
+        return true;
+    };
+    for (let i = 0; i + 7 <= length; i += 1) {
+        let matches = true;
+        for (let k = 0; k < 7 && matches; k += 1)
+            matches = at(i + k) === FINDER_LIKE[k];
+        if (matches && (light(i - 4, i) || light(i + 7, i + 11)))
+            count += 1;
+    }
+    return count * N3;
+}
+/** The four penalty rules of ISO/IEC 18004 7.8.3.1 over a square matrix, row major. */
+export function penalty(data, size) {
+    let rule1 = 0;
+    let rule3 = 0;
+    for (let line = 0; line < size; line += 1) {
+        rule1 += runPenalty(data, line * size, 1, size) + runPenalty(data, line, size, size);
+        rule3 += finderPenalty(data, line * size, 1, size) + finderPenalty(data, line, size, size);
+    }
+    let blocks = 0;
+    for (let y = 0; y + 1 < size; y += 1) {
+        for (let x = 0; x + 1 < size; x += 1) {
+            const at = y * size + x;
+            const sum = data[at] +
+                data[at + 1] +
+                data[at + size] +
+                data[at + size + 1];
+            if (sum === 0 || sum === 4)
+                blocks += 1;
+        }
+    }
+    const rule2 = blocks * N2;
+    let dark = 0;
+    for (let i = 0; i < data.length; i += 1)
+        dark += data[i];
+    // k steps of 5% away from half dark, counted down: 54.9% is k = 0. In
+    // integers, floor(|20 dark - 10 total| / total), which is exact here.
+    const rule4 = Math.floor((Math.abs(2 * dark - data.length) * 10) / data.length) * N4;
+    return { rule1, rule2, rule3, rule4, total: rule1 + rule2 + rule3 + rule4 };
+}
+//# sourceMappingURL=mask.js.map

package/dist/symbology/qr/mask.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mask.js","sourceRoot":"","sources":["../../../src/symbology/qr/mask.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAIH,MAAM,CAAC,MAAM,QAAQ,GAA6B,MAAM,CAAC,MAAM,CAAC;IAC/D,CAAC,GAAW,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;IACzD,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;IAC9B,CAAC,IAAY,EAAE,MAAc,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;IAClD,CAAC,GAAW,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;IACzD,CAAC,GAAW,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IACzF,CAAC,GAAW,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClF,CAAC,GAAW,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IACxF,CAAC,GAAW,EAAE,MAAc,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;CACxF,CAAC,CAAC;AAEH,8CAA8C;AAC9C,MAAM,EAAE,GAAG,CAAC,CAAC;AACb,MAAM,EAAE,GAAG,CAAC,CAAC;AACb,MAAM,EAAE,GAAG,EAAE,CAAC;AACd,MAAM,EAAE,GAAG,EAAE,CAAC;AAUd,8FAA8F;AAC9F,SAAS,UAAU,CAAC,IAAgB,EAAE,KAAa,EAAE,MAAc,EAAE,MAAc;IAClF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAW,CAAC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,MAAM,CAAW,CAAC;QACjD,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACtB,GAAG,IAAI,CAAC,CAAC;YACT,SAAS;QACV,CAAC;QACD,IAAI,GAAG,IAAI,CAAC;YAAE,OAAO,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACtC,MAAM,GAAG,KAAK,CAAC;QACf,GAAG,GAAG,CAAC,CAAC;IACT,CAAC;IACD,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACtC,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAE1C;;;GAGG;AACH,SAAS,aAAa,CAAC,IAAgB,EAAE,KAAa,EAAE,MAAc,EAAE,MAAc;IACrF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,EAAE,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,MAAM,CAAW,CAAC;IACrE,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,EAAU,EAAW,EAAE;QACnD,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,MAAM;YAAE,OAAO,KAAK,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;YAAE,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QACjE,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC,IAAI,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC;QACjF,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,KAAK,GAAG,EAAE,CAAC;AACnB,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,OAAO,CAAC,IAAgB,EAAE,IAAY;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3C,KAAK,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACrF,KAAK,IAAI,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;YACxB,MAAM,GAAG,GACP,IAAI,CAAC,EAAE,CAAY;gBACnB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAY;gBACvB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAY;gBAC1B,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,CAAY,CAAC;YACjC,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;gBAAE,MAAM,IAAI,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,GAAG,EAAE,CAAC;IAC1B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;QAAE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAW,CAAC;IACnE,sEAAsE;IACtE,sEAAsE;IACtE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IACrF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC;AAC7E,CAAC"}

package/dist/symbology/qr/read.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Reading a sampled QR matrix: modules in, bitstream out.
+ *
+ * The order is the specification's, and each step can refuse:
+ *
+ *   1. format information (level and mask), from either of its two copies;
+ *   2. version information from version 7, checked against the size;
+ *   3. unmask;
+ *   4. extract the codewords along the placement walk;
+ *   5. de-interleave;
+ *   6. Reed-Solomon per block, through core, with misdecode protection;
+ *   7. the bitstream, through `readSegments`.
+ *
+ * Lifted from the authenticator package's matrix decoder
+ * (`src/qr/decode/{extract,blocks,matrix-decoder}.ts` there) and given the
+ * two profiles the scan check needs.
+ *
+ * Strict is the reading of a careful phone: format information with at most
+ * one bit corrected and both copies agreeing, version information required
+ * from version 7 (the size alone is not trusted), no mirrored attempt and no
+ * erasures. It must be at least as hard to satisfy as the readers people use,
+ * because the scan check's "this will scan" rests on it.
+ *
+ * Lenient is the reading of a reader trying hard: format information up to
+ * three bits out in either copy (BCH(15, 5) corrects three), each plausible
+ * format tried in turn, the size standing in for unreadable version
+ * information, erasures honoured, and a mirrored (transposed) attempt when
+ * the symbol will not read the right way round.
+ *
+ * Neither applies the strict profile's error margin, ceil(0.25 * t) of each
+ * block left unused. That is the scan check's verdict to give, so the numbers
+ * it needs (errors and capacity per block) are reported and nothing more.
+ *
+ * Every failure is a QrStudioError with code 'decode/unreadable' and a stage:
+ * 'version', 'format', 'reed-solomon' (from core) or 'segments' (from the
+ * segment layer), or 'decode/unsupported' for a character set this runtime
+ * cannot decode.
+ */
+import type { BitMatrix } from '../../core/bit-matrix.js';
+import type { MatrixRead, ReadOptions } from '../types.js';
+/** Read a sampled matrix. Pure: throws QrStudioError 'decode/unreadable' with params { stage }. */
+export declare function readQr(matrix: BitMatrix, options: ReadOptions): MatrixRead;
+//# sourceMappingURL=read.d.ts.map

package/dist/symbology/qr/read.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../../src/symbology/qr/read.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAK1D,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAmK3D,mGAAmG;AACnG,wBAAgB,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,GAAG,UAAU,CAyB1E"}

package/dist/symbology/qr/read.js

@@ -0,0 +1,219 @@
+/**
+ * Reading a sampled QR matrix: modules in, bitstream out.
+ *
+ * The order is the specification's, and each step can refuse:
+ *
+ *   1. format information (level and mask), from either of its two copies;
+ *   2. version information from version 7, checked against the size;
+ *   3. unmask;
+ *   4. extract the codewords along the placement walk;
+ *   5. de-interleave;
+ *   6. Reed-Solomon per block, through core, with misdecode protection;
+ *   7. the bitstream, through `readSegments`.
+ *
+ * Lifted from the authenticator package's matrix decoder
+ * (`src/qr/decode/{extract,blocks,matrix-decoder}.ts` there) and given the
+ * two profiles the scan check needs.
+ *
+ * Strict is the reading of a careful phone: format information with at most
+ * one bit corrected and both copies agreeing, version information required
+ * from version 7 (the size alone is not trusted), no mirrored attempt and no
+ * erasures. It must be at least as hard to satisfy as the readers people use,
+ * because the scan check's "this will scan" rests on it.
+ *
+ * Lenient is the reading of a reader trying hard: format information up to
+ * three bits out in either copy (BCH(15, 5) corrects three), each plausible
+ * format tried in turn, the size standing in for unreadable version
+ * information, erasures honoured, and a mirrored (transposed) attempt when
+ * the symbol will not read the right way round.
+ *
+ * Neither applies the strict profile's error margin, ceil(0.25 * t) of each
+ * block left unused. That is the scan check's verdict to give, so the numbers
+ * it needs (errors and capacity per block) are reported and nothing more.
+ *
+ * Every failure is a QrStudioError with code 'decode/unreadable' and a stage:
+ * 'version', 'format', 'reed-solomon' (from core) or 'segments' (from the
+ * segment layer), or 'decode/unsupported' for a character set this runtime
+ * cannot decode.
+ */
+import { QrStudioError } from '../../core/errors.js';
+import { qrProfile } from '../../segment/profile.js';
+import { readSegments } from '../../segment/read.js';
+import { decodeBlocks, qrBlocks } from './blocks.js';
+import { readFormat, readVersion } from './info.js';
+import { qrGeometry } from './layout.js';
+import { QR_MASKS } from './mask.js';
+/** BCH(15, 5) and BCH(18, 6) both have minimum distance 7 or more, so both correct three bits. */
+const LENIENT_INFO_BITS = 3;
+const STRICT_FORMAT_BITS = 1;
+const UNREADABLE = {
+    size: 'This is not a size a QR code comes in.',
+    version: 'The size of this code and the version it says it is do not match.',
+    format: 'The part of this code that says how it was made is too damaged to read.',
+};
+function unreadable(why) {
+    return new QrStudioError('decode/unreadable', UNREADABLE[why], {
+        stage: why === 'format' ? 'format' : 'version',
+    });
+}
+function wordAt(modules, positions, msbFirst) {
+    let word = 0;
+    for (let i = 0; i < positions.length; i += 1) {
+        const bit = modules[positions[i]];
+        if (msbFirst)
+            word = word * 2 + bit;
+        else
+            word += bit * (1 << i);
+    }
+    return word;
+}
+/**
+ * The formats worth trying, best first. Strict gives one or none; lenient
+ * gives each distinct format either copy decodes to, nearest first, the
+ * top-left copy first on a tie.
+ */
+function formatCandidates(modules, geometry, strict) {
+    const limit = strict ? STRICT_FORMAT_BITS : LENIENT_INFO_BITS;
+    const first = readFormat(wordAt(modules, geometry.formatFirst, true), limit);
+    const second = readFormat(wordAt(modules, geometry.formatSecond, true), limit);
+    if (strict) {
+        if (first === undefined || second === undefined)
+            return [];
+        if (first.ecLevel !== second.ecLevel || first.mask !== second.mask)
+            return [];
+        return [
+            {
+                ecLevel: first.ecLevel,
+                mask: first.mask,
+                errors: Math.max(first.distance, second.distance),
+            },
+        ];
+    }
+    const found = [first, second].filter((read) => read !== undefined);
+    found.sort((a, b) => a.distance - b.distance);
+    const out = [];
+    for (const read of found) {
+        if (out.some((c) => c.ecLevel === read.ecLevel && c.mask === read.mask))
+            continue;
+        out.push({ ecLevel: read.ecLevel, mask: read.mask, errors: read.distance });
+    }
+    return out;
+}
+/**
+ * Check version information against the size.
+ *
+ * Below version 7 the size is the only source and it is exact. From 7 the
+ * symbol also states its version twice. A copy that decodes to a different
+ * version means either heavy damage to that copy or a grid sampled at the
+ * wrong size, and carrying on in the second case produces confident
+ * nonsense. So strict refuses whenever a copy disagrees or neither agrees,
+ * as zxing does; lenient refuses only when a copy disagrees and neither
+ * agrees. When neither copy decodes at all, lenient trusts the size, because
+ * a grid sampled at the wrong size almost never lands on a legal one; strict
+ * does not, because a phone that cannot read the version block does not read
+ * the code.
+ */
+function checkVersion(modules, geometry, strict) {
+    if (geometry.versionFirst.length === 0)
+        return;
+    const reads = [
+        readVersion(wordAt(modules, geometry.versionFirst, false), LENIENT_INFO_BITS),
+        readVersion(wordAt(modules, geometry.versionSecond, false), LENIENT_INFO_BITS),
+    ];
+    const agree = reads.some((read) => read?.version === geometry.version);
+    const disagree = reads.some((read) => read !== undefined && read.version !== geometry.version);
+    if (strict ? !agree || disagree : !agree && disagree)
+        throw unreadable('version');
+}
+function readOriented(matrix, strict, erasures, mirrored) {
+    const size = matrix.width;
+    const version = (size - 17) / 4;
+    if (matrix.height !== size || !Number.isInteger(version) || version < 1 || version > 40) {
+        throw unreadable('size');
+    }
+    const geometry = qrGeometry(version);
+    const modules = matrix.data;
+    const candidates = formatCandidates(modules, geometry, strict);
+    if (candidates.length === 0)
+        throw unreadable('format');
+    checkVersion(modules, geometry, strict);
+    const { placement } = geometry;
+    let firstFailure;
+    for (const candidate of candidates) {
+        const blocks = qrBlocks(version, candidate.ecLevel);
+        const predicate = QR_MASKS[candidate.mask];
+        const codewords = new Uint8Array(blocks.totalCodewords);
+        const erased = erasures === undefined ? undefined : new Uint8Array(blocks.totalCodewords);
+        for (let i = 0; i < codewords.length * 8; i += 1) {
+            const index = placement[i];
+            const bit = modules[index] ^ (predicate(Math.floor(index / size), index % size) ? 1 : 0);
+            codewords[i >>> 3] = codewords[i >>> 3] | (bit << (7 - (i & 7)));
+            if (erased !== undefined && erasures[index] !== 0)
+                erased[i >>> 3] = 1;
+        }
+        let decoded;
+        try {
+            decoded = decodeBlocks(codewords, blocks, erased);
+        }
+        catch (error) {
+            firstFailure ??= error;
+            continue;
+        }
+        // Reed-Solomon accepted this reading, so it is the right one: a failure
+        // in the bitstream from here on is final, never a cue to try another.
+        const bitstream = readSegments(decoded.data, blocks.dataBits, qrProfile(version));
+        return Object.freeze({
+            version: String(version),
+            ecLevel: candidate.ecLevel,
+            mask: candidate.mask,
+            bitstream,
+            errorsPerBlock: decoded.errorsPerBlock,
+            capacityPerBlock: decoded.capacityPerBlock,
+            erasuresUsed: decoded.erasuresUsed,
+            formatErrors: candidate.errors,
+            mirrored,
+        });
+    }
+    throw firstFailure;
+}
+/** The transpose of a row-major square flag map, to follow a mirrored matrix. */
+function transpose(flags, size) {
+    const out = new Uint8Array(flags.length);
+    for (let y = 0; y < size; y += 1) {
+        for (let x = 0; x < size; x += 1)
+            out[x * size + y] = flags[y * size + x];
+    }
+    return out;
+}
+/** Read a sampled matrix. Pure: throws QrStudioError 'decode/unreadable' with params { stage }. */
+export function readQr(matrix, options) {
+    if (typeof options?.strict !== 'boolean')
+        throw new TypeError('read needs { strict: boolean }');
+    const { strict } = options;
+    const erasures = strict ? undefined : options.erasures;
+    if (erasures !== undefined &&
+        (!(erasures instanceof Uint8Array) || erasures.length !== matrix.data.length)) {
+        throw new TypeError('erasures has one byte for every module of the matrix');
+    }
+    if (strict)
+        return readOriented(matrix, true, undefined, false);
+    try {
+        return readOriented(matrix, false, erasures, false);
+    }
+    catch (error) {
+        // A reading that got past Reed-Solomon is the right way round, whatever
+        // went wrong after it.
+        if (error instanceof QrStudioError && error.params.stage === 'segments')
+            throw error;
+        if (matrix.width !== matrix.height)
+            throw error;
+        try {
+            const flags = erasures === undefined ? undefined : transpose(erasures, matrix.width);
+            return readOriented(matrix.mirrored(), false, flags, true);
+        }
+        catch {
+            throw error;
+        }
+    }
+}
+//# sourceMappingURL=read.js.map

package/dist/symbology/qr/read.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"read.js","sourceRoot":"","sources":["../../../src/symbology/qr/read.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAGrD,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,kGAAkG;AAClG,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAE7B,MAAM,UAAU,GAAG;IAClB,IAAI,EAAE,wCAAwC;IAC9C,OAAO,EAAE,mEAAmE;IAC5E,MAAM,EAAE,yEAAyE;CACxE,CAAC;AAEX,SAAS,UAAU,CAAC,GAA4B;IAC/C,OAAO,IAAI,aAAa,CAAC,mBAAmB,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE;QAC9D,KAAK,EAAE,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;KAC9C,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,OAAmB,EAAE,SAAqB,EAAE,QAAiB;IAC5E,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAW,CAAW,CAAC;QACtD,IAAI,QAAQ;YAAE,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC;;YAC/B,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAQD;;;;GAIG;AACH,SAAS,gBAAgB,CACxB,OAAmB,EACnB,QAAoB,EACpB,MAAe;IAEf,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAC9D,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7E,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/E,IAAI,MAAM,EAAE,CAAC;QACZ,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QAC3D,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QAC9E,OAAO;YACN;gBACC,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;aACjD;SACD,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IACnE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAClF,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,YAAY,CAAC,OAAmB,EAAE,QAAoB,EAAE,MAAe;IAC/E,IAAI,QAAQ,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAC/C,MAAM,KAAK,GAAG;QACb,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,YAAY,EAAE,KAAK,CAAC,EAAE,iBAAiB,CAAC;QAC7E,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,aAAa,EAAE,KAAK,CAAC,EAAE,iBAAiB,CAAC;KAC9E,CAAC;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,QAAQ,CAAC,OAAO,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC/F,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ;QAAE,MAAM,UAAU,CAAC,SAAS,CAAC,CAAC;AACnF,CAAC;AAED,SAAS,YAAY,CACpB,MAAiB,EACjB,MAAe,EACf,QAAgC,EAChC,QAAiB;IAEjB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;IAC1B,MAAM,OAAO,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,EAAE,CAAC;QACzF,MAAM,UAAU,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;IAC5B,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC/D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,UAAU,CAAC,QAAQ,CAAC,CAAC;IACxD,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAExC,MAAM,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC;IAC/B,IAAI,YAAqB,CAAC;IAC1B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,IAAI,CAA6C,CAAC;QACvF,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QAC1F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAW,CAAC;YACrC,MAAM,GAAG,GACP,OAAO,CAAC,KAAK,CAAY,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,GAAI,SAAS,CAAC,CAAC,KAAK,CAAC,CAAY,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7E,IAAI,MAAM,KAAK,SAAS,IAAK,QAAuB,CAAC,KAAK,CAAC,KAAK,CAAC;gBAAE,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,OAAO,CAAC;QACZ,IAAI,CAAC;YACJ,OAAO,GAAG,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACnD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,YAAY,KAAK,KAAK,CAAC;YACvB,SAAS;QACV,CAAC;QACD,wEAAwE;QACxE,sEAAsE;QACtE,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAClF,OAAO,MAAM,CAAC,MAAM,CAAC;YACpB,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC;YACxB,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,SAAS;YACT,cAAc,EAAE,OAAO,CAAC,cAAc;YACtC,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;YAC1C,YAAY,EAAE,OAAO,CAAC,YAAY;YAClC,YAAY,EAAE,SAAS,CAAC,MAAM;YAC9B,QAAQ;SACR,CAAC,CAAC;IACJ,CAAC;IACD,MAAM,YAAY,CAAC;AACpB,CAAC;AAED,iFAAiF;AACjF,SAAS,SAAS,CAAC,KAAiB,EAAE,IAAY;IACjD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAW,CAAC;IACrF,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,mGAAmG;AACnG,MAAM,UAAU,MAAM,CAAC,MAAiB,EAAE,OAAoB;IAC7D,IAAI,OAAO,OAAO,EAAE,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,SAAS,CAAC,gCAAgC,CAAC,CAAC;IAChG,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAC3B,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACvD,IACC,QAAQ,KAAK,SAAS;QACtB,CAAC,CAAC,CAAC,QAAQ,YAAY,UAAU,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAC5E,CAAC;QACF,MAAM,IAAI,SAAS,CAAC,sDAAsD,CAAC,CAAC;IAC7E,CAAC;IACD,IAAI,MAAM;QAAE,OAAO,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAChE,IAAI,CAAC;QACJ,OAAO,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAChB,wEAAwE;QACxE,uBAAuB;QACvB,IAAI,KAAK,YAAY,aAAa,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,KAAK,UAAU;YAAE,MAAM,KAAK,CAAC;QACrF,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,MAAM;YAAE,MAAM,KAAK,CAAC;QAChD,IAAI,CAAC;YACJ,MAAM,KAAK,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YACrF,OAAO,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5D,CAAC;QAAC,MAAM,CAAC;YACR,MAAM,KAAK,CAAC;QACb,CAAC;IACF,CAAC;AACF,CAAC"}

package/dist/symbology/qr/tables.d.ts

@@ -0,0 +1,62 @@
+/**
+ * QR Model 2's tables, as data.
+ *
+ * Lifted from the authenticator package (`src/qr/tables.ts` there), where
+ * they were transcribed from ISO/IEC 18004:2015 Tables 1, 7, 9 and E.1 and
+ * checked row by row against the arithmetic the specification guarantees.
+ * `tests/symbology/qr/tables.test.ts` keeps those invariants (block sizes
+ * summing to the total codeword count, group 2 always one data codeword
+ * longer than group 1, alignment counts following from the version, the data
+ * region holding exactly the codewords plus the remainder bits) and adds the
+ * `qrcode` package's own tables as an oracle, which catches a transcription
+ * slip without anyone proofreading 160 rows.
+ */
+import type { EcLevel } from '../../segment/types.js';
+/**
+ * Two different orderings of the same four levels, and they are not
+ * interchangeable.
+ *
+ * `EC_INDEX` is the order the block tables are written in: L, M, Q, H,
+ * weakest to strongest. `EC_FORMAT_BITS` is the two-bit value written into
+ * the format information, and the specification assigns those in a different
+ * order: M, L, H, Q (Table 12). The two are a permutation with no fixed
+ * point, so code that reaches for the wrong one is wrong for every symbol it
+ * touches, at every level. Both are spelled out so a reader has to pick one.
+ */
+export declare const EC_INDEX: Readonly<Record<EcLevel, number>>;
+export declare const EC_FORMAT_BITS: Readonly<Record<EcLevel, number>>;
+/** Weakest to strongest, the order `boostEc` climbs. */
+export declare const EC_LEVELS: readonly EcLevel[];
+/** The level for each two-bit format value. */
+export declare const EC_FROM_FORMAT_BITS: readonly EcLevel[];
+export interface EcRow {
+    readonly ecPerBlock: number;
+    readonly group1Blocks: number;
+    readonly group1Data: number;
+    readonly group2Blocks: number;
+    readonly group2Data: number;
+}
+export declare function ecRow(version: number, level: EcLevel): EcRow;
+/**
+ * Misdecode protection, the p of ISO/IEC 18004 Table 9.
+ *
+ * The smallest symbols keep a few check codewords back from correction, so
+ * that a damaged block is refused rather than "corrected" into a different
+ * valid block: with only 7 check codewords, using all of them to correct 3
+ * errors leaves nothing to notice a fourth. Errors correctable per block are
+ * floor((ec - p) / 2).
+ */
+export declare function misdecodeProtection(version: number, level: EcLevel): number;
+/** Total codewords in a symbol, indexed by version - 1. */
+export declare const TOTAL_CODEWORDS: readonly number[];
+/**
+ * Bits left over after the codewords, indexed by version - 1.
+ *
+ * The data region is not always a whole number of codewords, so a few zero bits
+ * are written at the end. They carry nothing but they occupy module positions,
+ * so a decoder that forgets them reads the last codeword from the wrong place.
+ */
+export declare const REMAINDER_BITS: readonly number[];
+/** Row and column coordinates of alignment pattern centres, indexed by version - 1. */
+export declare const ALIGNMENT_CENTRES: readonly (readonly number[])[];
+//# sourceMappingURL=tables.d.ts.map

package/dist/symbology/qr/tables.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tables.d.ts","sourceRoot":"","sources":["../../../src/symbology/qr/tables.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAItD;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAKrD,CAAC;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAK3D,CAAC;AACH,wDAAwD;AACxD,eAAO,MAAM,SAAS,EAAE,SAAS,OAAO,EAAwC,CAAC;AACjF,+CAA+C;AAC/C,eAAO,MAAM,mBAAmB,EAAE,SAAS,OAAO,EAAwC,CAAC;AAsN3F,MAAM,WAAW,KAAK;IACrB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC5B;AAED,wBAAgB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,CAK5D;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAK3E;AAED,2DAA2D;AAC3D,eAAO,MAAM,eAAe,EAAE,SAAS,MAAM,EAI3C,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,EAAE,SAAS,MAAM,EAG1C,CAAC;AAEH,uFAAuF;AACvF,eAAO,MAAM,iBAAiB,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAyC1D,CAAC"}