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

package/dist/decode/tiled.d.ts

@@ -0,0 +1,137 @@
+/**
+ * A third opinion for the strict profile, from version 7: the grid zxing-cpp
+ * lays in tiles, through the alignment patterns and the finders' inner
+ * corners.
+ *
+ * From version 7 zxing-cpp does not sample a symbol through one projective
+ * map. It finds every alignment pattern and samples each square of four of
+ * them through a map of its own. Three of those squares have a finder at one
+ * corner, where no alignment pattern is, and there zxing-cpp takes the
+ * finder's ring instead: it traces the ring's inner and outer edges, fits four
+ * straight sides to each, blends the two, and takes the corner of the blend
+ * that faces the middle of the symbol, wherever that lands within half a
+ * finder of where the alignment grid predicts it.
+ *
+ * On a square ring that corner is the centre of the ring's corner module, as
+ * the grid expects. On a ring with its corners cut or rounded, the sides are
+ * fitted from whatever the edge walk counts as each side, and the corners they
+ * meet in move: by a third of a module on an octagon at any density, and by
+ * as much on a rounded ring a few pixels a module across. The whole tile moves
+ * with its corner, a third of a module off at the finder and less towards the
+ * other three, and at a few pixels a module that is the difference between a
+ * module read and a module missed. Measured over verify's captures of every
+ * design preset, those were all of the version 7 symbols the strict reader
+ * passed and zxing-cpp failed: octagonal finders at 3 to 6 pixels a module,
+ * rounded and round ones at 2.5. So the strict profile lays zxing-cpp's grid
+ * here, on zxing-cpp's threshold (`binariseLocalAverage`), and requires it to
+ * read to the same bytes with at most one more error in any block than the
+ * strict reader's own.
+ *
+ * Which corner the fit lands on depends on the pixel the walk starts from,
+ * and zxing-cpp starts from under its own estimate of the finder's centre:
+ * the middle of walks round the finder's centre and rings (`finderCentre`).
+ * That estimate is modelled here, and the grid is laid from each start a
+ * little either side of it (`TILED_NUDGES`); every one of them has to read.
+ *
+ * Written from the algorithm's description, after zxing-cpp's
+ * `ConcentricFinder` and QR `SampleQR` (Apache 2.0), including the details
+ * that look arbitrary and decide where the corner lands: the walk starts on
+ * the ray to the right of the centre's pixel, the first corner is the point
+ * of the walk furthest from the centre, and the others are searched for by
+ * their place in the walk rather than by angle.
+ *
+ * The alignment patterns are put where the strict grid has them rather than
+ * searched for: on a symbol the strict reader read they are where it says,
+ * and it is the finders' corners that this is about.
+ */
+import { BitMatrix } from '../core/bit-matrix.js';
+import type { Binarised } from './binarise.js';
+import type { Homography } from './transform.js';
+import type { Point } from './types.js';
+/** The smallest symbol zxing-cpp samples in tiles: version 7, 45 modules. */
+export declare const TILED_SIZE = 45;
+/**
+ * The most errors a block of zxing-cpp's tiled grid may have beyond the strict
+ * reader's own, from every start in `TILED_NUDGES`. Measured, not chosen:
+ * over 15,396 version 7 and 10 symbols from verify's captures of every preset
+ * on three seeds that the strict reader read with this check left out, the 15
+ * zxing-cpp missed (octagonal, fluid and rounded finders at 2.5 to 10 pixels a
+ * module) all came out two or more errors worse in a block from one start or
+ * another, or did not read; of the rest, 98 in 100 came out within one from
+ * every start. On two fresh seeds, 10,483 symbols, the same held: the 8 misses
+ * caught, 98 in 100 of the rest passed. Allowing two let 2 of the 15
+ * through.
+ *
+ * Laid on `binariseLocalAverage`, zxing-cpp's own threshold. Laid on
+ * `binariseHybrid`, whose flat blocks differ, the grid came out a further
+ * error worse at a few pixels a module where zxing-cpp's did not, and needed
+ * none worse at all below six pixels a module to catch the same misses,
+ * which refused twice as many symbols zxing-cpp reads.
+ */
+export declare const TILED_EXTRA_ERRORS = 1;
+/**
+ * The pixels along the `edge`th edge out from a finder's centre, walked all
+ * the way round: on the dark side of it, the first pixel past it or with
+ * `backup` the last before it. Empty unless the walk closes on itself having
+ * gone round the centre in all eight directions, inside twice `width`.
+ */
+export declare function ringPoints(image: Binarised, centre: Point, width: number, edge: number, backup: boolean): Point[];
+/**
+ * Four corners fitted to a ring's walk, as zxing-cpp fits them, or null where
+ * it would refuse the ring: too round (its nearest point more than 0.85 of
+ * the way out to its furthest), or a side whose points stray from their line
+ * by more than an eighth of the side's length, clamped to between one and
+ * eight pixels.
+ */
+export declare function fitQuadrilateral(centre: Point, walk: readonly Point[]): Point[] | null;
+/**
+ * The corners of a finder's dark ring as zxing-cpp fits them: the inner edge's
+ * and the outer edge's fits blended, corner by nearest corner, which puts
+ * them at the middle of the ring. Null where either fit is refused.
+ */
+export declare function finderCorners(image: Binarised, centre: Point, width: number): Point[] | null;
+/**
+ * Where zxing-cpp settles a finder's centre, starting from a point `near` it:
+ * the middle of the walk round the dark centre's edge, averaged with the
+ * middles of the walks round the dark ring's inner and outer edges, those
+ * started from the first. Where the centre's walk does not close, `near`
+ * itself, and where a ring's walk does not close or strays more than a sixth
+ * of the finder from the centre's middle, the average of those that did.
+ *
+ * zxing-cpp walks the finder's ring for its corners from the pixel under this
+ * point, so this is where the tiled grid's corners start from.
+ */
+export declare function finderCentre(image: Binarised, near: Point, width: number): Point;
+/**
+ * The pixel positions zxing-cpp would take for the corners of its tiles, on
+ * a QR symbol of `size` modules, at least `TILED_SIZE`, that the strict grid
+ * `transform` lies over: row by row, the centres of the alignment patterns
+ * where the grid has them, and at the three finders the fitted corner of the
+ * ring facing the middle of the symbol, where the fit lands one within half
+ * a finder of the grid's own. The rings are walked from where zxing-cpp
+ * settles each finder's centre (`finderCentre`), moved by `nudge` pixels.
+ */
+export declare function tileCorners(image: Binarised, transform: Homography, size: number, nudge?: Point): Point[][];
+/**
+ * The matrix zxing-cpp would sample from a QR symbol of `size` modules, at
+ * least `TILED_SIZE`, that the strict grid `transform` lies over: in tiles
+ * between the corners `tileCorners` gives, each mapped through its own four,
+ * one pixel a module.
+ */
+export declare function tiledGrid(image: Binarised, transform: Homography, size: number, nudge?: Point): BitMatrix;
+/**
+ * Where zxing-cpp's own finder centres may be, against the model of them
+ * (`finderCentre`), in pixels: a quarter of a pixel either way, each way. The
+ * corner zxing-cpp fits on a ring with cut or rounded corners depends on the
+ * pixel its walk starts from, under its centre, and the model is a model:
+ * from its centre alone the tiled grid let 3 of the 15 misses above through.
+ * From each of the pixels these reach it let none through, and half a pixel
+ * either way refused more symbols zxing-cpp reads without catching more.
+ */
+export declare const TILED_NUDGES: readonly Point[];
+/**
+ * Every distinct matrix zxing-cpp might sample in tiles (see `tiledGrid`),
+ * one for each of `TILED_NUDGES` whose fitted corners differ from the rest.
+ */
+export declare function tiledGrids(image: Binarised, transform: Homography, size: number): BitMatrix[];
+//# sourceMappingURL=tiled.d.ts.map

package/dist/decode/tiled.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiled.d.ts","sourceRoot":"","sources":["../../src/decode/tiled.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,6EAA6E;AAC7E,eAAO,MAAM,UAAU,KAAK,CAAC;AAE7B;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,kBAAkB,IAAI,CAAC;AA8EpC;;;;;GAKG;AACH,wBAAgB,UAAU,CACzB,KAAK,EAAE,SAAS,EAChB,MAAM,EAAE,KAAK,EACb,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,OAAO,GACb,KAAK,EAAE,CA6BT;AA6DD;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,KAAK,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,CA4BtF;AA+BD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,IAAI,CAW5F;AAaD;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,CAiBhF;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAC1B,KAAK,EAAE,SAAS,EAChB,SAAS,EAAE,UAAU,EACrB,IAAI,EAAE,MAAM,EACZ,KAAK,GAAE,KAAsB,GAC3B,KAAK,EAAE,EAAE,CA+BX;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CACxB,KAAK,EAAE,SAAS,EAChB,SAAS,EAAE,UAAU,EACrB,IAAI,EAAE,MAAM,EACZ,KAAK,GAAE,KAAsB,GAC3B,SAAS,CAyCX;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,YAAY,EAAE,SAAS,KAAK,EAExC,CAAC;AAEF;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,EAAE,CAa7F"}

package/dist/decode/tiled.js

@@ -0,0 +1,452 @@
+/**
+ * A third opinion for the strict profile, from version 7: the grid zxing-cpp
+ * lays in tiles, through the alignment patterns and the finders' inner
+ * corners.
+ *
+ * From version 7 zxing-cpp does not sample a symbol through one projective
+ * map. It finds every alignment pattern and samples each square of four of
+ * them through a map of its own. Three of those squares have a finder at one
+ * corner, where no alignment pattern is, and there zxing-cpp takes the
+ * finder's ring instead: it traces the ring's inner and outer edges, fits four
+ * straight sides to each, blends the two, and takes the corner of the blend
+ * that faces the middle of the symbol, wherever that lands within half a
+ * finder of where the alignment grid predicts it.
+ *
+ * On a square ring that corner is the centre of the ring's corner module, as
+ * the grid expects. On a ring with its corners cut or rounded, the sides are
+ * fitted from whatever the edge walk counts as each side, and the corners they
+ * meet in move: by a third of a module on an octagon at any density, and by
+ * as much on a rounded ring a few pixels a module across. The whole tile moves
+ * with its corner, a third of a module off at the finder and less towards the
+ * other three, and at a few pixels a module that is the difference between a
+ * module read and a module missed. Measured over verify's captures of every
+ * design preset, those were all of the version 7 symbols the strict reader
+ * passed and zxing-cpp failed: octagonal finders at 3 to 6 pixels a module,
+ * rounded and round ones at 2.5. So the strict profile lays zxing-cpp's grid
+ * here, on zxing-cpp's threshold (`binariseLocalAverage`), and requires it to
+ * read to the same bytes with at most one more error in any block than the
+ * strict reader's own.
+ *
+ * Which corner the fit lands on depends on the pixel the walk starts from,
+ * and zxing-cpp starts from under its own estimate of the finder's centre:
+ * the middle of walks round the finder's centre and rings (`finderCentre`).
+ * That estimate is modelled here, and the grid is laid from each start a
+ * little either side of it (`TILED_NUDGES`); every one of them has to read.
+ *
+ * Written from the algorithm's description, after zxing-cpp's
+ * `ConcentricFinder` and QR `SampleQR` (Apache 2.0), including the details
+ * that look arbitrary and decide where the corner lands: the walk starts on
+ * the ray to the right of the centre's pixel, the first corner is the point
+ * of the walk furthest from the centre, and the others are searched for by
+ * their place in the walk rather than by angle.
+ *
+ * The alignment patterns are put where the strict grid has them rather than
+ * searched for: on a symbol the strict reader read they are where it says,
+ * and it is the finders' corners that this is about.
+ */
+import { BitMatrix } from '../core/bit-matrix.js';
+import { hypot } from '../core/math.js';
+import { diagonalAlignments } from './locate-qr.js';
+import { apply, moduleWidth, quadToQuad } from './transform.js';
+/** The smallest symbol zxing-cpp samples in tiles: version 7, 45 modules. */
+export const TILED_SIZE = 45;
+/**
+ * The most errors a block of zxing-cpp's tiled grid may have beyond the strict
+ * reader's own, from every start in `TILED_NUDGES`. Measured, not chosen:
+ * over 15,396 version 7 and 10 symbols from verify's captures of every preset
+ * on three seeds that the strict reader read with this check left out, the 15
+ * zxing-cpp missed (octagonal, fluid and rounded finders at 2.5 to 10 pixels a
+ * module) all came out two or more errors worse in a block from one start or
+ * another, or did not read; of the rest, 98 in 100 came out within one from
+ * every start. On two fresh seeds, 10,483 symbols, the same held: the 8 misses
+ * caught, 98 in 100 of the rest passed. Allowing two let 2 of the 15
+ * through.
+ *
+ * Laid on `binariseLocalAverage`, zxing-cpp's own threshold. Laid on
+ * `binariseHybrid`, whose flat blocks differ, the grid came out a further
+ * error worse at a few pixels a module where zxing-cpp's did not, and needed
+ * none worse at all below six pixels a module to catch the same misses,
+ * which refused twice as many symbols zxing-cpp reads.
+ */
+export const TILED_EXTRA_ERRORS = 1;
+/** A pixel of a thresholded picture: 1 dark, 0 light, -1 off the picture. */
+function pixel(image, x, y) {
+    if (x < 0 || y < 0 || x >= image.width || y >= image.height)
+        return -1;
+    return image.bits[y * image.width + x];
+}
+/** The heading a quarter turn to the right (`side` 1) or left (-1), y pointing down. */
+function turned(cursor, side) {
+    return { dx: -cursor.dy * side, dy: cursor.dx * side };
+}
+/** Whether the pixel one step away in (dx, dy) differs from the cursor's own: an edge, or the picture's border. */
+function edgeAt(image, cursor, dx, dy) {
+    return pixel(image, cursor.x + dx, cursor.y + dy) !== pixel(image, cursor.x, cursor.y);
+}
+/**
+ * Walk forward past `nth` changes of colour, at most `range` steps, and stop
+ * on the first pixel past the last one, or with `backup` the last pixel before
+ * it. False when the edges run out first.
+ */
+function stepToEdge(image, cursor, nth, range, backup) {
+    let steps = 0;
+    let last = pixel(image, cursor.x, cursor.y);
+    let left = nth;
+    while (left > 0 && steps < range && last !== -1) {
+        steps += 1;
+        const here = pixel(image, cursor.x + steps * cursor.dx, cursor.y + steps * cursor.dy);
+        if (here !== last) {
+            last = here;
+            left -= 1;
+        }
+    }
+    if (backup)
+        steps -= 1;
+    cursor.x += steps * cursor.dx;
+    cursor.y += steps * cursor.dy;
+    return left === 0;
+}
+/**
+ * One step along an edge kept on `side`: turn towards that side when the edge
+ * leaves it, away from it when the edge blocks the way, and give up when it
+ * blocks every way. False when the step leaves the picture.
+ */
+function stepAlongEdge(image, cursor, side) {
+    const towards = turned(cursor, side);
+    if (!edgeAt(image, cursor, towards.dx, towards.dy)) {
+        cursor.dx = towards.dx;
+        cursor.dy = towards.dy;
+    }
+    else {
+        for (let turns = 0; edgeAt(image, cursor, cursor.dx, cursor.dy); turns += 1) {
+            if (turns === 2)
+                return false;
+            const away = turned(cursor, -side);
+            cursor.dx = away.dx;
+            cursor.dy = away.dy;
+        }
+    }
+    cursor.x += cursor.dx;
+    cursor.y += cursor.dy;
+    return pixel(image, cursor.x, cursor.y) !== -1;
+}
+/**
+ * The pixels along the `edge`th edge out from a finder's centre, walked all
+ * the way round: on the dark side of it, the first pixel past it or with
+ * `backup` the last before it. Empty unless the walk closes on itself having
+ * gone round the centre in all eight directions, inside twice `width`.
+ */
+export function ringPoints(image, centre, width, edge, backup) {
+    const cx = Math.trunc(centre.x);
+    const cy = Math.trunc(centre.y);
+    const most = Math.trunc((4 * (width + 1) * 3) / 2);
+    const reach = width * 2;
+    const cursor = { x: cx, y: cy, dx: 1, dy: 0 };
+    if (!stepToEdge(image, cursor, edge, reach, backup))
+        return [];
+    const right = turned(cursor, 1);
+    cursor.dx = right.dx;
+    cursor.dy = right.dy;
+    const side = backup ? -1 : 1;
+    const startX = cursor.x;
+    const startY = cursor.y;
+    let directions = 0;
+    const points = [];
+    do {
+        points.push({ x: cursor.x + 0.5, y: cursor.y + 0.5 });
+        // Which of the eight directions round the centre this pixel is in, by
+        // integer division as zxing-cpp takes it: a diagonal only where the walk
+        // crosses it exactly, which a closed walk round the centre always does.
+        const ox = cursor.x - cx;
+        const oy = cursor.y - cy;
+        const longest = Math.max(Math.abs(ox), Math.abs(oy));
+        directions |= 1 << (4 + Math.trunc(ox / longest) + 3 * Math.trunc(oy / longest));
+        if (!stepAlongEdge(image, cursor, side))
+            return [];
+        const out = hypot(cursor.x - cx, cursor.y - cy);
+        if (out > reach || out === 0 || points.length > most)
+            return [];
+    } while (cursor.x !== startX || cursor.y !== startY);
+    return directions === 0b111101111 ? points : [];
+}
+/** The orthogonal least squares line through some points, or null for fewer than two distinct ones. */
+function fitLine(points) {
+    let mx = 0;
+    let my = 0;
+    for (const p of points) {
+        mx += p.x / points.length;
+        my += p.y / points.length;
+    }
+    let xx = 0;
+    let yy = 0;
+    let xy = 0;
+    for (const p of points) {
+        xx += (p.x - mx) * (p.x - mx);
+        yy += (p.y - my) * (p.y - my);
+        xy += (p.x - mx) * (p.y - my);
+    }
+    // The normal, from whichever row of the scatter matrix is the larger.
+    const [a, b] = yy >= xx ? [yy, -xy] : [xy, -xx];
+    const length = hypot(a, b);
+    if (!(length > 0))
+        return null;
+    return { a: a / length, b: b / length, c: (a * mx + b * my) / length };
+}
+function distanceToLine(line, p) {
+    return Math.abs(line.a * p.x + line.b * p.y - line.c);
+}
+function intersect(first, second) {
+    const d = first.a * second.b - first.b * second.a;
+    return {
+        x: (first.c * second.b - first.b * second.c) / d,
+        y: (first.a * second.c - first.c * second.a) / d,
+    };
+}
+/** Index of the point in [from, to) that scores highest: the first of equals, or with `lastOfEquals` the last. */
+function highest(points, from, to, score, lastOfEquals = false) {
+    let best = from;
+    for (let i = from + 1; i < to; i += 1) {
+        const here = score(points[i]);
+        const top = score(points[best]);
+        if (here > top || (lastOfEquals && here === top))
+            best = i;
+    }
+    return best;
+}
+/**
+ * Four corners fitted to a ring's walk, as zxing-cpp fits them, or null where
+ * it would refuse the ring: too round (its nearest point more than 0.85 of
+ * the way out to its furthest), or a side whose points stray from their line
+ * by more than an eighth of the side's length, clamped to between one and
+ * eight pixels.
+ */
+export function fitQuadrilateral(centre, walk) {
+    const out = (p) => hypot(p.x - centre.x, p.y - centre.y);
+    const nearest = walk[highest(walk, 0, walk.length, (p) => -out(p))];
+    // The last of the furthest, as std::minmax_element gives it.
+    const furthest = highest(walk, 0, walk.length, out, true);
+    if (out(nearest) > 0.85 * out(walk[furthest]))
+        return null;
+    const points = [...walk.slice(furthest), ...walk.slice(0, furthest)];
+    const n = points.length;
+    const third = highest(points, Math.trunc((n * 3) / 8), Math.trunc((n * 5) / 8), out);
+    const first = points[0];
+    const across = points[third];
+    const span = hypot(across.x - first.x, across.y - first.y);
+    const offDiagonal = (p) => Math.abs((across.x - first.x) * (p.y - first.y) - (across.y - first.y) * (p.x - first.x)) /
+        span;
+    const second = highest(points, Math.trunc(n / 8), Math.trunc((n * 3) / 8), offDiagonal);
+    const fourth = highest(points, Math.trunc((n * 5) / 8), Math.trunc((n * 7) / 8), offDiagonal);
+    const corners = [0, second, third, fourth, n];
+    const lines = [];
+    for (let side = 0; side < 4; side += 1) {
+        const stretch = points.slice(corners[side] + 1, corners[side + 1]);
+        const line = fitLine(stretch);
+        if (line === null)
+            return null;
+        const slack = Math.max(1, Math.min(8, stretch.length / 8));
+        if (stretch.length > 3 && stretch.some((p) => distanceToLine(line, p) > slack))
+            return null;
+        lines.push(line);
+    }
+    return lines.map((line, i) => intersect(line, lines[(i + 1) % 4]));
+}
+/** A fitted ring's corners, unless its shortest side is under `floor` pixels or a third of its longest. */
+function plausibleSquare(corners, floor) {
+    let shortest = Number.POSITIVE_INFINITY;
+    let longest = 0;
+    for (let i = 0; i < 4; i += 1) {
+        const a = corners[i];
+        const b = corners[(i + 1) % 4];
+        const side = hypot(b.x - a.x, b.y - a.y);
+        shortest = Math.min(shortest, side);
+        longest = Math.max(longest, side);
+    }
+    return shortest >= floor && shortest > longest / 3;
+}
+function fittedEdge(image, centre, width, edge, backup) {
+    const walk = ringPoints(image, centre, width, edge, backup);
+    if (walk.length === 0)
+        return null;
+    const corners = fitQuadrilateral(centre, walk);
+    return corners !== null && plausibleSquare(corners, 2 * (edge - (backup ? 1 : 0)))
+        ? corners
+        : null;
+}
+/**
+ * The corners of a finder's dark ring as zxing-cpp fits them: the inner edge's
+ * and the outer edge's fits blended, corner by nearest corner, which puts
+ * them at the middle of the ring. Null where either fit is refused.
+ */
+export function finderCorners(image, centre, width) {
+    const inner = fittedEdge(image, centre, width, 2, false);
+    if (inner === null)
+        return null;
+    const outer = fittedEdge(image, centre, width, 3, true);
+    if (outer === null)
+        return null;
+    const start = inner[0];
+    const offset = highest(outer, 0, 4, (p) => -hypot(p.x - start.x, p.y - start.y));
+    return inner.map((p, i) => {
+        const q = outer[(i + offset) % 4];
+        return { x: (p.x + q.x) / 2, y: (p.y + q.y) / 2 };
+    });
+}
+/** The middle of a walk's points. */
+function middle(walk) {
+    let x = 0;
+    let y = 0;
+    for (const p of walk) {
+        x += p.x / walk.length;
+        y += p.y / walk.length;
+    }
+    return { x, y };
+}
+/**
+ * Where zxing-cpp settles a finder's centre, starting from a point `near` it:
+ * the middle of the walk round the dark centre's edge, averaged with the
+ * middles of the walks round the dark ring's inner and outer edges, those
+ * started from the first. Where the centre's walk does not close, `near`
+ * itself, and where a ring's walk does not close or strays more than a sixth
+ * of the finder from the centre's middle, the average of those that did.
+ *
+ * zxing-cpp walks the finder's ring for its corners from the pixel under this
+ * point, so this is where the tiled grid's corners start from.
+ */
+export function finderCentre(image, near, width) {
+    const centreWalk = ringPoints(image, near, width, 1, false);
+    if (centreWalk.length === 0)
+        return near;
+    const first = middle(centreWalk);
+    let x = first.x;
+    let y = first.y;
+    let count = 1;
+    for (const edge of [2, 3]) {
+        const walk = ringPoints(image, first, width, edge, false);
+        if (walk.length === 0)
+            break;
+        const ring = middle(walk);
+        if (hypot(ring.x - first.x, ring.y - first.y) > width / 6)
+            break;
+        x += ring.x;
+        y += ring.y;
+        count += 1;
+    }
+    return { x: x / count, y: y / count };
+}
+/**
+ * The pixel positions zxing-cpp would take for the corners of its tiles, on
+ * a QR symbol of `size` modules, at least `TILED_SIZE`, that the strict grid
+ * `transform` lies over: row by row, the centres of the alignment patterns
+ * where the grid has them, and at the three finders the fitted corner of the
+ * ring facing the middle of the symbol, where the fit lands one within half
+ * a finder of the grid's own. The rings are walked from where zxing-cpp
+ * settles each finder's centre (`finderCentre`), moved by `nudge` pixels.
+ */
+export function tileCorners(image, transform, size, nudge = { x: 0, y: 0 }) {
+    const at = [6, ...diagonalAlignments(size)];
+    const last = at.length - 1;
+    const corners = at.map((v) => at.map((u) => apply(transform, u + 0.5, v + 0.5)));
+    for (const [column, row, u, v] of [
+        [0, 0, 3.5, 3.5],
+        [last, 0, size - 3.5, 3.5],
+        [0, last, 3.5, size - 3.5],
+    ]) {
+        const finder = 7 * moduleWidth(transform, u, v);
+        const line = corners[row];
+        const predicted = line[column];
+        // The last of the fitted corners within half a finder of the prediction,
+        // as zxing-cpp takes it. A ring that does not fit keeps the prediction,
+        // and one that does not fit from its centre is taken not to fit from a
+        // start beside it either: a round ring zxing-cpp refuses to fit can
+        // sometimes be fitted from a start a little off.
+        const width = Math.round(finder);
+        const centre = finderCentre(image, apply(transform, u, v), width);
+        const fitted = nudge.x === 0 && nudge.y === 0
+            ? finderCorners(image, centre, width)
+            : finderCorners(image, centre, width) &&
+                finderCorners(image, { x: centre.x + nudge.x, y: centre.y + nudge.y }, width);
+        for (const candidate of fitted ?? []) {
+            if (hypot(candidate.x - predicted.x, candidate.y - predicted.y) < finder / 2) {
+                line[column] = candidate;
+            }
+        }
+    }
+    return corners;
+}
+/**
+ * The matrix zxing-cpp would sample from a QR symbol of `size` modules, at
+ * least `TILED_SIZE`, that the strict grid `transform` lies over: in tiles
+ * between the corners `tileCorners` gives, each mapped through its own four,
+ * one pixel a module.
+ */
+export function tiledGrid(image, transform, size, nudge = { x: 0, y: 0 }) {
+    const at = [6, ...diagonalAlignments(size)];
+    const last = at.length - 1;
+    const corners = tileCorners(image, transform, size, nudge);
+    const corner = (row, column) => corners[row][column];
+    const matrix = new BitMatrix(size, size);
+    for (let row = 0; row < last; row += 1) {
+        for (let column = 0; column < last; column += 1) {
+            const u0 = at[column];
+            const u1 = at[column + 1];
+            const v0 = at[row];
+            const v1 = at[row + 1];
+            const tile = quadToQuad([
+                { x: u0 + 0.5, y: v0 + 0.5 },
+                { x: u1 + 0.5, y: v0 + 0.5 },
+                { x: u1 + 0.5, y: v1 + 0.5 },
+                { x: u0 + 0.5, y: v1 + 0.5 },
+            ], [
+                corner(row, column),
+                corner(row, column + 1),
+                corner(row + 1, column + 1),
+                corner(row + 1, column),
+            ]);
+            // The tiles along the symbol's edges reach out over the finders and
+            // the last row and column of modules.
+            const top = row === 0 ? 0 : v0;
+            const bottom = row === last - 1 ? size : v1;
+            const left = column === 0 ? 0 : u0;
+            const right = column === last - 1 ? size : u1;
+            for (let y = top; y < bottom; y += 1) {
+                for (let x = left; x < right; x += 1) {
+                    const p = apply(tile, x + 0.5, y + 0.5);
+                    if (pixel(image, Math.floor(p.x), Math.floor(p.y)) === 1)
+                        matrix.set(x, y, true);
+                }
+            }
+        }
+    }
+    return matrix;
+}
+/**
+ * Where zxing-cpp's own finder centres may be, against the model of them
+ * (`finderCentre`), in pixels: a quarter of a pixel either way, each way. The
+ * corner zxing-cpp fits on a ring with cut or rounded corners depends on the
+ * pixel its walk starts from, under its centre, and the model is a model:
+ * from its centre alone the tiled grid let 3 of the 15 misses above through.
+ * From each of the pixels these reach it let none through, and half a pixel
+ * either way refused more symbols zxing-cpp reads without catching more.
+ */
+export const TILED_NUDGES = Object.freeze([-0.25, 0, 0.25].flatMap((y) => [-0.25, 0, 0.25].map((x) => Object.freeze({ x, y }))));
+/**
+ * Every distinct matrix zxing-cpp might sample in tiles (see `tiledGrid`),
+ * one for each of `TILED_NUDGES` whose fitted corners differ from the rest.
+ */
+export function tiledGrids(image, transform, size) {
+    const seen = new Set();
+    const out = [];
+    for (const nudge of TILED_NUDGES) {
+        const key = tileCorners(image, transform, size, nudge)
+            .flat()
+            .map((p) => `${p.x},${p.y}`)
+            .join(' ');
+        if (seen.has(key))
+            continue;
+        seen.add(key);
+        out.push(tiledGrid(image, transform, size, nudge));
+    }
+    return out;
+}
+//# sourceMappingURL=tiled.js.map

package/dist/decode/tiled.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiled.js","sourceRoot":"","sources":["../../src/decode/tiled.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAEpD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAGhE,6EAA6E;AAC7E,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC;AAE7B;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAEpC,6EAA6E;AAC7E,SAAS,KAAK,CAAC,KAAgB,EAAE,CAAS,EAAE,CAAS;IACpD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC;IACvE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAW,CAAC;AAClD,CAAC;AAUD,wFAAwF;AACxF,SAAS,MAAM,CAAC,MAAc,EAAE,IAAY;IAC3C,OAAO,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;AACxD,CAAC;AAED,mHAAmH;AACnH,SAAS,MAAM,CAAC,KAAgB,EAAE,MAAc,EAAE,EAAU,EAAE,EAAU;IACvE,OAAO,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AACxF,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAClB,KAAgB,EAChB,MAAc,EACd,GAAW,EACX,KAAa,EACb,MAAe;IAEf,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACtF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,IAAI,CAAC,CAAC;QACX,CAAC;IACF,CAAC;IACD,IAAI,MAAM;QAAE,KAAK,IAAI,CAAC,CAAC;IACvB,MAAM,CAAC,CAAC,IAAI,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;IAC9B,MAAM,CAAC,CAAC,IAAI,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;IAC9B,OAAO,IAAI,KAAK,CAAC,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,KAAgB,EAAE,MAAc,EAAE,IAAY;IACpE,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC;IACxB,CAAC;SAAM,CAAC;QACP,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC7E,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACrB,CAAC;IACF,CAAC;IACD,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC;IACtB,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC;IACtB,OAAO,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CACzB,KAAgB,EAChB,MAAa,EACb,KAAa,EACb,IAAY,EACZ,MAAe;IAEf,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;IACxB,MAAM,MAAM,GAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IACtD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/D,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAChC,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;IACrB,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;IACrB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IACxB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,GAAG,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;QACtD,sEAAsE;QACtE,yEAAyE;QACzE,wEAAwE;QACxE,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,UAAU,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;QACjF,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACnD,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAChD,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI;YAAE,OAAO,EAAE,CAAC;IACjE,CAAC,QAAQ,MAAM,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,KAAK,MAAM,EAAE;IACrD,OAAO,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;AACjD,CAAC;AASD,uGAAuG;AACvG,SAAS,OAAO,CAAC,MAAwB;IACxC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACxB,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC1B,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACxB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9B,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9B,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC/B,CAAC;IACD,sEAAsE;IACtE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/B,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;AACxE,CAAC;AAED,SAAS,cAAc,CAAC,IAAU,EAAE,CAAQ;IAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,SAAS,CAAC,KAAW,EAAE,MAAY;IAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAClD,OAAO;QACN,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAChD,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;KAChD,CAAC;AACH,CAAC;AAED,kHAAkH;AAClH,SAAS,OAAO,CACf,MAAwB,EACxB,IAAY,EACZ,EAAU,EACV,KAA2B,EAC3B,YAAY,GAAG,KAAK;IAEpB,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAU,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAU,CAAC,CAAC;QACzC,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,IAAI,IAAI,KAAK,GAAG,CAAC;YAAE,IAAI,GAAG,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAa,EAAE,IAAsB;IACrE,MAAM,GAAG,GAAG,CAAC,CAAQ,EAAU,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAU,CAAC;IAC7E,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC1D,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IACpE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IACrE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrF,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAU,CAAC;IACjC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAU,CAAC;IACtC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,WAAW,GAAG,CAAC,CAAQ,EAAU,EAAE,CACxC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACzF,IAAI,CAAC;IACN,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACxF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC9F,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAE,OAAO,CAAC,IAAI,CAAY,GAAG,CAAC,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAW,CAAC,CAAC;QACzF,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5F,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAS,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED,2GAA2G;AAC3G,SAAS,eAAe,CAAC,OAAyB,EAAE,KAAa;IAChE,IAAI,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACxC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAU,CAAC;QAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAU,CAAC;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACpC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ,GAAG,OAAO,GAAG,CAAC,CAAC;AACpD,CAAC;AAED,SAAS,UAAU,CAClB,KAAgB,EAChB,MAAa,EACb,KAAa,EACb,IAAY,EACZ,MAAe;IAEf,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IAC5D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/C,OAAO,OAAO,KAAK,IAAI,IAAI,eAAe,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,IAAI,CAAC;AACT,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB,EAAE,MAAa,EAAE,KAAa;IAC3E,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACzD,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACxD,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAU,CAAC;IAChC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAU,CAAC;QAC3C,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,qCAAqC;AACrC,SAAS,MAAM,CAAC,IAAsB;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACtB,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACxB,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACjB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAAC,KAAgB,EAAE,IAAW,EAAE,KAAa;IACxE,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC;YAAE,MAAM;QACjE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;QACZ,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;AACvC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAC1B,KAAgB,EAChB,SAAqB,EACrB,IAAY,EACZ,QAAe,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IAE7B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,MAAM,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI;QACjC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC;QAChB,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,CAAC;QAC1B,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,GAAG,CAAC;KACjB,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAY,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAU,CAAC;QACxC,yEAAyE;QACzE,wEAAwE;QACxE,uEAAuE;QACvE,oEAAoE;QACpE,iDAAiD;QACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAClE,MAAM,MAAM,GACX,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC;YAC7B,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC;YACrC,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC;gBACpC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjF,KAAK,MAAM,SAAS,IAAI,MAAM,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9E,IAAI,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;YAC1B,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CACxB,KAAgB,EAChB,SAAqB,EACrB,IAAY,EACZ,QAAe,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;IAE7B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,MAAc,EAAS,EAAE,CAAE,OAAO,CAAC,GAAG,CAAa,CAAC,MAAM,CAAU,CAAC;IAClG,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACxC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,EAAE,CAAC;YACjD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAW,CAAC;YAChC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;YACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAW,CAAC;YAC7B,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAW,CAAC;YACjC,MAAM,IAAI,GAAG,UAAU,CACtB;gBACC,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE;gBAC5B,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE;gBAC5B,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE;gBAC5B,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE;aAC5B,EACD;gBACC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC;gBACnB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC;gBACvB,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,MAAM,CAAC;aACvB,CACD,CAAC;YACF,oEAAoE;YACpE,sCAAsC;YACtC,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;oBACxC,IAAI,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;wBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBAClF,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,YAAY,GAAqB,MAAM,CAAC,MAAM,CAC1D,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CACrF,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,KAAgB,EAAE,SAAqB,EAAE,IAAY;IAC/E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC;aACpD,IAAI,EAAE;aACN,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}