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

package/dist/decode/locate-qr.d.ts

@@ -0,0 +1,80 @@
+/**
+ * From three finder patterns to sampling grids for QR Model 2.
+ *
+ * Every grid a triple could stand for, best guess first. The size is
+ * measured, so it carries error, and the far corner of the symbol is
+ * extrapolated, so it carries more; rather than commit to one answer the
+ * scanner offers the nearest legal size and its neighbours, and the plain
+ * three-point fit beside each alignment pattern candidate. Trying a wrong one
+ * is cheap and safe, because format information and then Reed-Solomon refuse
+ * it almost at once, and they are exact where everything here is estimated.
+ *
+ * The strict profile offers one grid at most, chosen by the symbol's own
+ * timing patterns from the same candidates (see `strictHypothesis`).
+ *
+ * Lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/decoder.ts`).
+ */
+import type { Binarised } from './binarise.js';
+import type { FinderTriple } from './finder.js';
+import type { Homography } from './transform.js';
+export interface GridHypothesis {
+    /** Modules across and down. */
+    readonly width: number;
+    readonly height: number;
+    /** Module coordinates to work-image pixels. */
+    readonly transform: Homography;
+}
+/**
+ * Module size for a triple, measured along the two axes joining the finders
+ * rather than taken from the row scan, which inflates with rotation (see
+ * `moduleSizeAcross`).
+ */
+export declare function tripleModuleSize(image: Binarised, triple: FinderTriple): number;
+/** Sizes worth trying, best first: the nearest legal size and its neighbours four and eight away. */
+export declare function candidateSizes(estimate: number, legal: ReadonlySet<number>): number[];
+/**
+ * The centres of the alignment patterns on the diagonal of a QR symbol of
+ * `size` modules, smallest first, past the top left finder: ISO/IEC 18004's
+ * table, as the usual formula derives it (version 32 is the one irregular
+ * step).
+ */
+export declare function diagonalAlignments(size: number): number[];
+/**
+ * The strict reader's one grid for a triple, or null.
+ *
+ * Of the legal sizes nearest the estimate and a step either side, and for
+ * each (from version 2) the alignment pattern candidates near the
+ * prediction and the best of the scanner's wide window, each refitted once,
+ * the grid that lays the timing patterns down straightest. The symbol's own
+ * ruler decides, where rounding an estimate or nearness to an affine guess
+ * would not: a version 30 symbol tilted 20 degrees measures two modules
+ * short, and under perspective the patch of data nearest the guess is often
+ * not the pattern. Whether a plain reader would get the same grid is asked
+ * later, of the grid it would lay (see plain.ts); the symbology's strict
+ * read then requires the version information to agree with the size.
+ */
+export declare function strictHypothesis(image: Binarised, triple: FinderTriple, legal: ReadonlySet<number>): GridHypothesis | null;
+/**
+ * Every grid hypothesis for a triple, lazily, best first: the scanner's.
+ *
+ * The plain three-point fit comes first: it is right for a flat scan and the
+ * only answer for version 1. Then each scored alignment candidate, refitted
+ * where a tight second search moves it: once a pattern is found the
+ * four-point fit through it is projective, so its prediction is sub-module
+ * accurate and the re-search either confirms the centre or lands it properly.
+ * Both are kept, because the read downstream is exact and can refuse the
+ * wrong one.
+ */
+export declare function qrHypotheses(image: Binarised, triple: FinderTriple, legal: ReadonlySet<number>): Generator<GridHypothesis>;
+/**
+ * Whether a sampled QR grid landed on the symbol.
+ *
+ * Row and column six alternate dark and light across every QR symbol, so they
+ * are the cheapest test there is of whether the grid is in the right place,
+ * and unlike Reed-Solomon they answer that question specifically: a misplaced
+ * grid scores about a half and a damaged symbol on the right grid scores
+ * nearly one. Symmetric under transposition, so a mirrored symbol passes too.
+ */
+export declare function qrTimingAgreement(modules: Uint8Array, size: number): number;
+//# sourceMappingURL=locate-qr.d.ts.map

package/dist/decode/locate-qr.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"locate-qr.d.ts","sourceRoot":"","sources":["../../src/decode/locate-qr.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAIjD,MAAM,WAAW,cAAc;IAC9B,+BAA+B;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC;CAC/B;AAwCD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,GAAG,MAAM,CAM/E;AAiBD,qGAAqG;AACrG,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAKrF;AAmED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAQzD;AAmDD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAC/B,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,YAAY,EACpB,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,GACxB,cAAc,GAAG,IAAI,CAiCvB;AAED;;;;;;;;;;GAUG;AACH,wBAAiB,YAAY,CAC5B,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,YAAY,EACpB,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,GACxB,SAAS,CAAC,cAAc,CAAC,CAgB3B;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAU3E"}

package/dist/decode/locate-qr.js

@@ -0,0 +1,295 @@
+/**
+ * From three finder patterns to sampling grids for QR Model 2.
+ *
+ * Every grid a triple could stand for, best guess first. The size is
+ * measured, so it carries error, and the far corner of the symbol is
+ * extrapolated, so it carries more; rather than commit to one answer the
+ * scanner offers the nearest legal size and its neighbours, and the plain
+ * three-point fit beside each alignment pattern candidate. Trying a wrong one
+ * is cheap and safe, because format information and then Reed-Solomon refuse
+ * it almost at once, and they are exact where everything here is estimated.
+ *
+ * The strict profile offers one grid at most, chosen by the symbol's own
+ * timing patterns from the same candidates (see `strictHypothesis`).
+ *
+ * Lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/decoder.ts`).
+ */
+import { hypot } from '../core/math.js';
+import { searchBullseye } from './alignment.js';
+import { moduleSizeAcross } from './finder.js';
+import { apply, fitHomography, quadToQuad } from './transform.js';
+/** Below this, in pixels, a re-search has landed on the same centre. */
+const REFIT_MIN_SHIFT = 0.5;
+/** How near its prediction, in modules, the strict reader looks for the alignment pattern first. */
+const NEAR_ALIGNMENT = 2;
+/** How far from each prediction, in modules, the walk down the diagonal looks. */
+const WALK_RADIUS = 4;
+/** The worst bullseye score the walk takes for a pattern: a real one scores under 0.1, a patch of data over 0.29. */
+const WALK_MAX_SCORE = 0.25;
+/** Alignment candidates the strict reader weighs from each window. */
+const STRICT_CANDIDATES = 3;
+/** The timing patterns' agreement with their alternation, read through a transform from the thresholded picture. */
+function timingThrough(image, transform, size) {
+    let matched = 0;
+    let total = 0;
+    for (let i = 8; i < size - 8; i += 1) {
+        const dark = i % 2 === 0;
+        for (const [u, v] of [
+            [i, 6],
+            [6, i],
+        ]) {
+            const p = apply(transform, u + 0.5, v + 0.5);
+            const x = Math.floor(p.x);
+            const y = Math.floor(p.y);
+            const bit = x >= 0 &&
+                y >= 0 &&
+                x < image.width &&
+                y < image.height &&
+                image.bits[y * image.width + x] === 1;
+            if (bit === dark)
+                matched += 1;
+            total += 1;
+        }
+    }
+    return matched / total;
+}
+/**
+ * Module size for a triple, measured along the two axes joining the finders
+ * rather than taken from the row scan, which inflates with rotation (see
+ * `moduleSizeAcross`).
+ */
+export function tripleModuleSize(image, triple) {
+    const { topLeft, topRight, bottomLeft } = triple;
+    const across = moduleSizeAcross(image, topLeft, topRight);
+    const down = moduleSizeAcross(image, topLeft, bottomLeft);
+    if (across !== null && down !== null)
+        return (across + down) / 2;
+    return across ?? down ?? (topLeft.moduleSize + topRight.moduleSize + bottomLeft.moduleSize) / 3;
+}
+/** The size the finders imply, before it is made legal: finder centres sit 3.5 modules in from each edge. */
+function estimateSize(image, triple) {
+    const { topLeft, topRight, bottomLeft } = triple;
+    // Each axis by its own module size, measured along it at both ends: under
+    // perspective the two axes are foreshortened differently.
+    const fallback = tripleModuleSize(image, triple);
+    const across = hypot(topRight.x - topLeft.x, topRight.y - topLeft.y) /
+        (moduleSizeAcross(image, topLeft, topRight) ?? fallback);
+    const down = hypot(bottomLeft.x - topLeft.x, bottomLeft.y - topLeft.y) /
+        (moduleSizeAcross(image, topLeft, bottomLeft) ?? fallback);
+    return (across + down) / 2 + 7;
+}
+/** Sizes worth trying, best first: the nearest legal size and its neighbours four and eight away. */
+export function candidateSizes(estimate, legal) {
+    const nearest = Math.round((estimate - 17) / 4) * 4 + 17;
+    return [nearest, nearest - 4, nearest + 4, nearest - 8, nearest + 8].filter((size) => legal.has(size));
+}
+/**
+ * The transform from module coordinates to pixels, from the three finder
+ * centres and a fourth correspondence: the alignment pattern when one was
+ * found, at module (size - 7, size - 7) whose centre is size - 6.5, or else
+ * the corner the finders imply, treating the view as a parallelogram, which is
+ * exact for an affine view and good enough for mild perspective.
+ */
+function samplingTransform(size, triple, alignment) {
+    const { topLeft, topRight, bottomLeft } = triple;
+    const edge = size - 3.5;
+    const fourth = alignment ?? {
+        x: topRight.x + bottomLeft.x - topLeft.x,
+        y: topRight.y + bottomLeft.y - topLeft.y,
+    };
+    const fourthSource = alignment === null ? edge : size - 6.5;
+    return quadToQuad([
+        { x: 3.5, y: 3.5 },
+        { x: edge, y: 3.5 },
+        { x: fourthSource, y: fourthSource },
+        { x: 3.5, y: edge },
+    ], [topLeft, topRight, fourth, bottomLeft]);
+}
+/** One module's width in pixels near a point of the symbol, through a transform. */
+function moduleAt(transform, at) {
+    const here = apply(transform, at, at);
+    const next = apply(transform, at + 1, at);
+    return hypot(next.x - here.x, next.y - here.y);
+}
+/**
+ * Candidates for the bottom right alignment pattern, best first, or none for
+ * version 1, which has no alignment pattern.
+ *
+ * The lenient window has to cover how wrong the prediction can be, not how
+ * big the pattern is: from three finders the far corner is extrapolated as if
+ * the view were affine, and on a real perspective view that is off by a good
+ * fraction of the symbol at the far corner.
+ */
+function alignmentCandidates(image, transform, size, radiusModules, limit) {
+    if (size < 25)
+        return [];
+    const centre = size - 6.5;
+    const expected = apply(transform, centre, centre);
+    const module = moduleAt(transform, centre);
+    if (!Number.isFinite(module) || !Number.isFinite(expected.x) || module <= 0)
+        return [];
+    const radius = radiusModules === null
+        ? Math.max(4, Math.round(Math.min(module * 6 + size * module * 0.12, 160)))
+        : Math.max(2, Math.round(radiusModules * module));
+    return searchBullseye(image, expected, radius, module, limit).map((match) => match.point);
+}
+/**
+ * The centres of the alignment patterns on the diagonal of a QR symbol of
+ * `size` modules, smallest first, past the top left finder: ISO/IEC 18004's
+ * table, as the usual formula derives it (version 32 is the one irregular
+ * step).
+ */
+export function diagonalAlignments(size) {
+    const version = (size - 17) / 4;
+    if (version < 2)
+        return [];
+    const count = Math.floor(version / 7) + 2;
+    const step = version === 32 ? 26 : Math.ceil((version * 4 + 4) / (count * 2 - 2)) * 2;
+    const out = [];
+    for (let at = size - 7; out.length < count - 1; at -= step)
+        out.unshift(at);
+    return out;
+}
+/**
+ * The grid fitted by walking the alignment patterns down the diagonal: each
+ * one predicted from the fit through the last, found close to the
+ * prediction, and fitted through in turn. Under perspective the three
+ * finders alone put the far corner of a large symbol tens of modules out,
+ * but the next pattern along from a good fit is never more than a module or
+ * two away. Null when not one pattern is found.
+ */
+function walkedTransform(image, triple, size) {
+    const { topLeft, topRight, bottomLeft } = triple;
+    const source = [
+        { x: 3.5, y: 3.5 },
+        { x: size - 3.5, y: 3.5 },
+        { x: 3.5, y: size - 3.5 },
+    ];
+    const destination = [topLeft, topRight, bottomLeft];
+    let transform = samplingTransform(size, triple, null);
+    let found = false;
+    for (const centre of diagonalAlignments(size)) {
+        const at = centre + 0.5;
+        const expected = apply(transform, at, at);
+        const module = moduleAt(transform, at);
+        // A grid collapsed to a line or a point measures no module, or NaN.
+        if (!(module > 0))
+            break;
+        const [best] = searchBullseye(image, expected, Math.max(2, Math.round(WALK_RADIUS * module)), module, 1);
+        // A pattern that looks like one: a patch of data that happens to ring would
+        // throw every later prediction off. The first is up to three modules from
+        // where the finders put it on a large symbol tilted 20 degrees; from then
+        // on each prediction is through every pattern already found.
+        if (best === undefined || best.score > WALK_MAX_SCORE)
+            continue;
+        source.push({ x: at, y: at });
+        destination.push(best.point);
+        // Least squares through all of them: a pattern in the middle of the symbol
+        // is on the line between the top right and bottom left finders, and four
+        // points with three on a line fix no projective map.
+        const fitted = fitHomography(source, destination);
+        if (fitted === null)
+            continue;
+        transform = fitted;
+        found = true;
+    }
+    return found ? transform : null;
+}
+/**
+ * The strict reader's one grid for a triple, or null.
+ *
+ * Of the legal sizes nearest the estimate and a step either side, and for
+ * each (from version 2) the alignment pattern candidates near the
+ * prediction and the best of the scanner's wide window, each refitted once,
+ * the grid that lays the timing patterns down straightest. The symbol's own
+ * ruler decides, where rounding an estimate or nearness to an affine guess
+ * would not: a version 30 symbol tilted 20 degrees measures two modules
+ * short, and under perspective the patch of data nearest the guess is often
+ * not the pattern. Whether a plain reader would get the same grid is asked
+ * later, of the grid it would lay (see plain.ts); the symbology's strict
+ * read then requires the version information to agree with the size.
+ */
+export function strictHypothesis(image, triple, legal) {
+    let chosen = null;
+    let straightest = -1;
+    for (const size of candidateSizes(estimateSize(image, triple), legal).slice(0, 3)) {
+        const initial = samplingTransform(size, triple, null);
+        const transforms = [];
+        // Version 1 has no alignment pattern and reads from the three finders.
+        if (size < 25)
+            transforms.push(initial);
+        for (const found of size < 25
+            ? []
+            : [
+                ...alignmentCandidates(image, initial, size, NEAR_ALIGNMENT, STRICT_CANDIDATES),
+                ...alignmentCandidates(image, initial, size, null, STRICT_CANDIDATES),
+            ]) {
+            const fitted = samplingTransform(size, triple, found);
+            const [refined] = alignmentCandidates(image, fitted, size, 2, 1);
+            transforms.push(refined !== undefined && hypot(refined.x - found.x, refined.y - found.y) > REFIT_MIN_SHIFT
+                ? samplingTransform(size, triple, refined)
+                : fitted);
+        }
+        const walked = size < 25 ? null : walkedTransform(image, triple, size);
+        if (walked !== null)
+            transforms.push(walked);
+        for (const transform of transforms) {
+            const agreement = timingThrough(image, transform, size);
+            if (agreement > straightest) {
+                straightest = agreement;
+                chosen = { width: size, height: size, transform };
+            }
+        }
+    }
+    return chosen;
+}
+/**
+ * Every grid hypothesis for a triple, lazily, best first: the scanner's.
+ *
+ * The plain three-point fit comes first: it is right for a flat scan and the
+ * only answer for version 1. Then each scored alignment candidate, refitted
+ * where a tight second search moves it: once a pattern is found the
+ * four-point fit through it is projective, so its prediction is sub-module
+ * accurate and the re-search either confirms the centre or lands it properly.
+ * Both are kept, because the read downstream is exact and can refuse the
+ * wrong one.
+ */
+export function* qrHypotheses(image, triple, legal) {
+    for (const size of candidateSizes(estimateSize(image, triple), legal)) {
+        const initial = samplingTransform(size, triple, null);
+        yield { width: size, height: size, transform: initial };
+        for (const found of alignmentCandidates(image, initial, size, null, 3)) {
+            const transform = samplingTransform(size, triple, found);
+            const [refined] = alignmentCandidates(image, transform, size, 2, 1);
+            if (refined !== undefined &&
+                hypot(refined.x - found.x, refined.y - found.y) > REFIT_MIN_SHIFT) {
+                yield { width: size, height: size, transform: samplingTransform(size, triple, refined) };
+            }
+            yield { width: size, height: size, transform };
+        }
+    }
+}
+/**
+ * Whether a sampled QR grid landed on the symbol.
+ *
+ * Row and column six alternate dark and light across every QR symbol, so they
+ * are the cheapest test there is of whether the grid is in the right place,
+ * and unlike Reed-Solomon they answer that question specifically: a misplaced
+ * grid scores about a half and a damaged symbol on the right grid scores
+ * nearly one. Symmetric under transposition, so a mirrored symbol passes too.
+ */
+export function qrTimingAgreement(modules, size) {
+    let matched = 0;
+    let total = 0;
+    for (let i = 8; i < size - 8; i += 1) {
+        const dark = i % 2 === 0 ? 1 : 0;
+        if (modules[6 * size + i] === dark)
+            matched += 1;
+        if (modules[i * size + 6] === dark)
+            matched += 1;
+        total += 2;
+    }
+    return matched / total;
+}
+//# sourceMappingURL=locate-qr.js.map

package/dist/decode/locate-qr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"locate-qr.js","sourceRoot":"","sources":["../../src/decode/locate-qr.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AACxC,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAGhD,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAWlE,wEAAwE;AACxE,MAAM,eAAe,GAAG,GAAG,CAAC;AAE5B,oGAAoG;AACpG,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,kFAAkF;AAClF,MAAM,WAAW,GAAG,CAAC,CAAC;AACtB,qHAAqH;AACrH,MAAM,cAAc,GAAG,IAAI,CAAC;AAC5B,sEAAsE;AACtE,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,oHAAoH;AACpH,SAAS,aAAa,CAAC,KAAgB,EAAE,SAAqB,EAAE,IAAY;IAC3E,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI;YACpB,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACG,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;YAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,GAAG,GACR,CAAC,IAAI,CAAC;gBACN,CAAC,IAAI,CAAC;gBACN,CAAC,GAAG,KAAK,CAAC,KAAK;gBACf,CAAC,GAAG,KAAK,CAAC,MAAM;gBAChB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,CAAC;YAC/B,KAAK,IAAI,CAAC,CAAC;QACZ,CAAC;IACF,CAAC;IACD,OAAO,OAAO,GAAG,KAAK,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAgB,EAAE,MAAoB;IACtE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IACjD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IAC1D,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACjE,OAAO,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AACjG,CAAC;AAED,6GAA6G;AAC7G,SAAS,YAAY,CAAC,KAAgB,EAAE,MAAoB;IAC3D,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IACjD,0EAA0E;IAC1E,0DAA0D;IAC1D,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACjD,MAAM,MAAM,GACX,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACrD,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC;IAC1D,MAAM,IAAI,GACT,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACzD,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,IAAI,QAAQ,CAAC,CAAC;IAC5D,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,cAAc,CAAC,QAAgB,EAAE,KAA0B;IAC1E,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACzD,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CACpF,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CACf,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CACzB,IAAY,EACZ,MAAoB,EACpB,SAAuB;IAEvB,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;IACxB,MAAM,MAAM,GAAG,SAAS,IAAI;QAC3B,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;QACxC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;KACxC,CAAC;IACF,MAAM,YAAY,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC;IAC5D,OAAO,UAAU,CAChB;QACC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE;QAClB,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE;QACnB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE;QACpC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE;KACnB,EACD,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,CACvC,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,QAAQ,CAAC,SAAqB,EAAE,EAAU;IAClD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,mBAAmB,CAC3B,KAAgB,EAChB,SAAqB,EACrB,IAAY,EACZ,aAA4B,EAC5B,KAAa;IAEb,IAAI,IAAI,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC;IAC1B,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACvF,MAAM,MAAM,GACX,aAAa,KAAK,IAAI;QACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC;IACpD,OAAO,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC3F,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC9C,MAAM,OAAO,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,OAAO,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACtF,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,EAAE,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,EAAE,EAAE,IAAI,IAAI;QAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC5E,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,KAAgB,EAAE,MAAoB,EAAE,IAAY;IAC5E,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IACjD,MAAM,MAAM,GAAY;QACvB,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE;QAClB,EAAE,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE;KACzB,CAAC;IACF,MAAM,WAAW,GAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC7D,IAAI,SAAS,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACtD,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,MAAM,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,EAAE,GAAG,MAAM,GAAG,GAAG,CAAC;QACxB,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACvC,oEAAoE;QACpE,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YAAE,MAAM;QACzB,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAC5B,KAAK,EACL,QAAQ,EACR,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC,EAC7C,MAAM,EACN,CAAC,CACD,CAAC;QACF,4EAA4E;QAC5E,0EAA0E;QAC1E,0EAA0E;QAC1E,6DAA6D;QAC7D,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,cAAc;YAAE,SAAS;QAChE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,2EAA2E;QAC3E,yEAAyE;QACzE,qDAAqD;QACrD,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAClD,IAAI,MAAM,KAAK,IAAI;YAAE,SAAS;QAC9B,SAAS,GAAG,MAAM,CAAC;QACnB,KAAK,GAAG,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,gBAAgB,CAC/B,KAAgB,EAChB,MAAoB,EACpB,KAA0B;IAE1B,IAAI,MAAM,GAA0B,IAAI,CAAC;IACzC,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACnF,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,UAAU,GAAiB,EAAE,CAAC;QACpC,uEAAuE;QACvE,IAAI,IAAI,GAAG,EAAE;YAAE,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,IAAI,GAAG,EAAE;YAC5B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACA,GAAG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,iBAAiB,CAAC;gBAC/E,GAAG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,iBAAiB,CAAC;aACrE,EAAE,CAAC;YACL,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YACtD,MAAM,CAAC,OAAO,CAAC,GAAG,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjE,UAAU,CAAC,IAAI,CACd,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,eAAe;gBACzF,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC;gBAC1C,CAAC,CAAC,MAAM,CACT,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,MAAM,KAAK,IAAI;YAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YACxD,IAAI,SAAS,GAAG,WAAW,EAAE,CAAC;gBAC7B,WAAW,GAAG,SAAS,CAAC;gBACxB,MAAM,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YACnD,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,SAAS,CAAC,CAAC,YAAY,CAC5B,KAAgB,EAChB,MAAoB,EACpB,KAA0B;IAE1B,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;QACvE,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;QACxD,KAAK,MAAM,KAAK,IAAI,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACxE,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YACzD,MAAM,CAAC,OAAO,CAAC,GAAG,mBAAmB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpE,IACC,OAAO,KAAK,SAAS;gBACrB,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,eAAe,EAChE,CAAC;gBACF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;YAC1F,CAAC;YACD,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;IACF,CAAC;AACF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAmB,EAAE,IAAY;IAClE,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,CAAC;QACjD,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,OAAO,GAAG,KAAK,CAAC;AACxB,CAAC"}

package/dist/decode/locate-single.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Grids for the one-finder symbologies, Micro QR and rMQR.
+ *
+ * Both start from `finderFrame`: the finder's centre, the angle of its sides
+ * and its module size, with the right quarter turn still to find. Micro QR
+ * then reads its size off the timing patterns that run from the finder along
+ * the top row and down the left column. rMQR reads its height down the left
+ * column the same way, and then looks for its finder sub-pattern, the 5 by 5
+ * bullseye in the far corner, at each width its height allows; the two
+ * patterns' centres fix the grid, since they are the whole symbol apart.
+ *
+ * Clean images only: screenshots, scans, this package's own renders and mild
+ * rotation. Perspective is not in scope for these two in this version. Micro
+ * QR is at most 17 modules, so an affine grid from the one finder holds
+ * across it; rMQR is up to 139 long and only two points far apart keep its
+ * grid on the modules, which perspective would bend away from between them.
+ */
+import type { Binarised } from './binarise.js';
+import type { FinderFrame } from './frame.js';
+import type { GridHypothesis } from './locate-qr.js';
+/** How much of a timing pattern and its quiet zone has to read right, as for QR's. */
+export declare const TIMING_AGREEMENT = 0.85;
+export interface SingleHypothesis extends GridHypothesis {
+    /** Sampled in a left-handed frame: the picture is a mirror image of the symbol. */
+    readonly mirrored: boolean;
+}
+/**
+ * Micro QR grids for one finder, best first: each quarter turn, and each size
+ * whose timing patterns read there, the best agreement first. Right-handed
+ * only: a mirrored symbol samples as its transpose, which the symbology's
+ * lenient read turns back, as it does for QR.
+ */
+export declare function microHypotheses(image: Binarised, frame: FinderFrame, sizes: readonly number[]): SingleHypothesis[];
+/**
+ * rMQR grids for one finder, best first.
+ *
+ * For each quarter turn and handedness the left column gives the height, and
+ * each width that height comes in is tried by looking for the sub-pattern
+ * where it would be. The window grows with the width, because the frame's
+ * angle and module size are estimated over seven modules and extrapolated
+ * over up to 139.
+ */
+export declare function rmqrHypotheses(image: Binarised, frame: FinderFrame, sizes: readonly {
+    readonly width: number;
+    readonly height: number;
+}[], mirroredToo: boolean): SingleHypothesis[];
+//# sourceMappingURL=locate-single.d.ts.map

package/dist/decode/locate-single.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"locate-single.d.ts","sourceRoot":"","sources":["../../src/decode/locate-single.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAKrD,sFAAsF;AACtF,eAAO,MAAM,gBAAgB,OAAO,CAAC;AAKrC,MAAM,WAAW,gBAAiB,SAAQ,cAAc;IACvD,mFAAmF;IACnF,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC3B;AA2CD;;;;;GAKG;AACH,wBAAgB,eAAe,CAC9B,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,SAAS,MAAM,EAAE,GACtB,gBAAgB,EAAE,CAcpB;AA+CD;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC7B,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,SAAS;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,EAAE,EACrE,WAAW,EAAE,OAAO,GAClB,gBAAgB,EAAE,CA0BpB"}

package/dist/decode/locate-single.js

@@ -0,0 +1,169 @@
+/**
+ * Grids for the one-finder symbologies, Micro QR and rMQR.
+ *
+ * Both start from `finderFrame`: the finder's centre, the angle of its sides
+ * and its module size, with the right quarter turn still to find. Micro QR
+ * then reads its size off the timing patterns that run from the finder along
+ * the top row and down the left column. rMQR reads its height down the left
+ * column the same way, and then looks for its finder sub-pattern, the 5 by 5
+ * bullseye in the far corner, at each width its height allows; the two
+ * patterns' centres fix the grid, since they are the whole symbol apart.
+ *
+ * Clean images only: screenshots, scans, this package's own renders and mild
+ * rotation. Perspective is not in scope for these two in this version. Micro
+ * QR is at most 17 modules, so an affine grid from the one finder holds
+ * across it; rMQR is up to 139 long and only two points far apart keep its
+ * grid on the modules, which perspective would bend away from between them.
+ */
+import { searchBullseye } from './alignment.js';
+import { axis, frameTransform, perpendicular } from './frame.js';
+import { apply } from './transform.js';
+/** How much of a timing pattern and its quiet zone has to read right, as for QR's. */
+export const TIMING_AGREEMENT = 0.85;
+/** A sub-pattern candidate scoring worse than this is not one: genuine ones score under 0.1. */
+const MAX_BULLSEYE_SCORE = 0.3;
+function isDark(image, transform, u, v) {
+    const p = apply(transform, u + 0.5, v + 0.5);
+    const x = Math.floor(p.x);
+    const y = Math.floor(p.y);
+    if (x < 0 || y < 0 || x >= image.width || y >= image.height)
+        return null;
+    return image.bits[y * image.width + x] === 1;
+}
+/** Fraction of `checks` (module, expected darkness) that read as expected; off the picture counts as light. */
+function agreement(image, transform, checks) {
+    let matched = 0;
+    for (const [u, v, dark] of checks)
+        if ((isDark(image, transform, u, v) ?? false) === dark)
+            matched += 1;
+    return matched / checks.length;
+}
+/** The transform for a frame turned `turns` quarter turns, in either handedness. */
+function turned(frame, turns, mirrored) {
+    const unit = axis(frame, turns);
+    const ex = { x: unit.x * frame.module, y: unit.y * frame.module };
+    return frameTransform(frame.centre, ex, perpendicular(ex, mirrored));
+}
+/**
+ * The timing checks for a Micro QR symbol of `size`: the separator at 7, the
+ * timing pattern from 8 (dark on even modules) along row 0 and column 0, and
+ * two modules of quiet zone past the end of each.
+ */
+function microChecks(size) {
+    const checks = [];
+    for (let i = 7; i < size + 2; i += 1) {
+        const dark = i < size && i % 2 === 0;
+        checks.push([i, 0, dark], [0, i, dark]);
+    }
+    return checks;
+}
+/**
+ * Micro QR grids for one finder, best first: each quarter turn, and each size
+ * whose timing patterns read there, the best agreement first. Right-handed
+ * only: a mirrored symbol samples as its transpose, which the symbology's
+ * lenient read turns back, as it does for QR.
+ */
+export function microHypotheses(image, frame, sizes) {
+    const found = [];
+    for (let turns = 0; turns < 4; turns += 1) {
+        const transform = turned(frame, turns, false);
+        for (const size of sizes) {
+            const score = agreement(image, transform, microChecks(size));
+            if (score < TIMING_AGREEMENT)
+                continue;
+            found.push({
+                hypothesis: { width: size, height: size, transform, mirrored: false },
+                score,
+            });
+        }
+    }
+    return found.sort((a, b) => b.score - a.score).map(({ hypothesis }) => hypothesis);
+}
+/**
+ * The height of an rMQR symbol read down its left column: below the finder
+ * comes the separator, then timing and the bottom left corner pattern, with no
+ * two light modules in a row until the quiet zone. The first such pair marks
+ * the bottom edge.
+ */
+function rmqrHeight(image, transform, heights) {
+    let previousLight = false;
+    const tallest = Math.max(...heights);
+    for (let v = 7; v <= tallest + 1; v += 1) {
+        const light = isDark(image, transform, 0, v) !== true;
+        if (light && previousLight)
+            return heights.has(v - 1) ? v - 1 : null;
+        previousLight = light;
+    }
+    return null;
+}
+/**
+ * The similarity transform through two points: the finder centre at module
+ * (3.5, 3.5) and the sub-pattern centre at (width - 2.5, height - 2.5). Square
+ * modules and no perspective, which is the scope.
+ */
+function twoPointTransform(finder, sub, width, height, mirrored) {
+    const a = width - 6;
+    const b = height - 6;
+    const dx = sub.x - finder.x;
+    const dy = sub.y - finder.y;
+    const norm = a * a + b * b;
+    // Solve a e + b perpendicular(e) = (dx, dy) for the module vector e.
+    const ex = mirrored
+        ? { x: (a * dx - b * dy) / norm, y: (b * dx + a * dy) / norm }
+        : { x: (a * dx + b * dy) / norm, y: (a * dy - b * dx) / norm };
+    return frameTransform(finder, ex, perpendicular(ex, mirrored));
+}
+/**
+ * rMQR grids for one finder, best first.
+ *
+ * For each quarter turn and handedness the left column gives the height, and
+ * each width that height comes in is tried by looking for the sub-pattern
+ * where it would be. The window grows with the width, because the frame's
+ * angle and module size are estimated over seven modules and extrapolated
+ * over up to 139.
+ */
+export function rmqrHypotheses(image, frame, sizes, mirroredToo) {
+    const heights = new Set(sizes.map((size) => size.height));
+    const out = [];
+    for (const mirrored of mirroredToo ? [false, true] : [false]) {
+        for (let turns = 0; turns < 4; turns += 1) {
+            const transform = turned(frame, turns, mirrored);
+            const height = rmqrHeight(image, transform, heights);
+            if (height === null)
+                continue;
+            for (const { width } of sizes.filter((size) => size.height === height)) {
+                const predicted = apply(transform, width - 2.5, height - 2.5);
+                const radius = Math.ceil((2 + width * 0.04) * frame.module);
+                const [best] = searchBullseye(image, predicted, radius, frame.module, 1);
+                if (best === undefined || best.score > MAX_BULLSEYE_SCORE)
+                    continue;
+                const grid = twoPointTransform(frame.centre, best.point, width, height, mirrored);
+                // The sub-pattern sits in the corner: quiet zone beyond it on both sides.
+                const quiet = [];
+                for (let i = 0; i < 5; i += 1) {
+                    quiet.push([width, height - 1 - i, false], [width - 1 - i, height, false]);
+                }
+                if (agreement(image, grid, quiet) < TIMING_AGREEMENT)
+                    continue;
+                if (rmqrTimingAgreement(image, grid, width, height) < TIMING_AGREEMENT)
+                    continue;
+                out.push({ width, height, transform: grid, mirrored });
+            }
+        }
+    }
+    return out;
+}
+/**
+ * Whether an rMQR grid landed on the symbol: the top and bottom rows alternate
+ * from the finder's separator to the corner patterns, dark on even modules,
+ * broken only where an alignment pattern's three dark modules cross them, and
+ * a symbol has few enough of those that the alternation still dominates.
+ */
+function rmqrTimingAgreement(image, transform, width, height) {
+    const checks = [];
+    for (let u = 8; u <= width - 4; u += 1) {
+        checks.push([u, 0, u % 2 === 0], [u, height - 1, u % 2 === 0]);
+    }
+    return agreement(image, transform, checks);
+}
+//# sourceMappingURL=locate-single.js.map

package/dist/decode/locate-single.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"locate-single.js","sourceRoot":"","sources":["../../src/decode/locate-single.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAGhD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAGjE,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAGvC,sFAAsF;AACtF,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAErC,gGAAgG;AAChG,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAO/B,SAAS,MAAM,CAAC,KAAgB,EAAE,SAAqB,EAAE,CAAS,EAAE,CAAS;IAC5E,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;IAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAC9C,CAAC;AAED,+GAA+G;AAC/G,SAAS,SAAS,CACjB,KAAgB,EAChB,SAAqB,EACrB,MAAuD;IAEvD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,MAAM;QAChC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,CAAC;IACtE,OAAO,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,oFAAoF;AACpF,SAAS,MAAM,CAAC,KAAkB,EAAE,KAAa,EAAE,QAAiB;IACnE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;IAClE,OAAO,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,EAAE,aAAa,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;AACtE,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,IAAY;IAChC,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC9B,KAAgB,EAChB,KAAkB,EAClB,KAAwB;IAExB,MAAM,KAAK,GAAsD,EAAE,CAAC;IACpE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7D,IAAI,KAAK,GAAG,gBAAgB;gBAAE,SAAS;YACvC,KAAK,CAAC,IAAI,CAAC;gBACV,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE;gBACrE,KAAK;aACL,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC;AACpF,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAClB,KAAgB,EAChB,SAAqB,EACrB,OAA4B;IAE5B,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC;QACtD,IAAI,KAAK,IAAI,aAAa;YAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACrE,aAAa,GAAG,KAAK,CAAC;IACvB,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CACzB,MAAa,EACb,GAAU,EACV,KAAa,EACb,MAAc,EACd,QAAiB;IAEjB,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;IACpB,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,qEAAqE;IACrE,MAAM,EAAE,GAAG,QAAQ;QAClB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE;QAC9D,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC;IAChE,OAAO,cAAc,CAAC,MAAM,EAAE,EAAE,EAAE,aAAa,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC7B,KAAgB,EAChB,KAAkB,EAClB,KAAqE,EACrE,WAAoB;IAEpB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1D,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,KAAK,MAAM,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YACjD,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YACrD,IAAI,MAAM,KAAK,IAAI;gBAAE,SAAS;YAC9B,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;gBACxE,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,KAAK,GAAG,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC;gBAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC5D,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACzE,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,kBAAkB;oBAAE,SAAS;gBACpE,MAAM,IAAI,GAAG,iBAAiB,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAClF,0EAA0E;gBAC1E,MAAM,KAAK,GAA2C,EAAE,CAAC;gBACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC5E,CAAC;gBACD,IAAI,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,gBAAgB;oBAAE,SAAS;gBAC/D,IAAI,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,gBAAgB;oBAAE,SAAS;gBACjF,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YACxD,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAC3B,KAAgB,EAChB,SAAqB,EACrB,KAAa,EACb,MAAc;IAEd,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;AAC5C,CAAC"}