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

package/dist/decode/binarise.d.ts

@@ -0,0 +1,95 @@
+/**
+ * Deciding which pixels are dark.
+ *
+ * The hardest and least glamorous part of reading a code from a photograph. A
+ * screenshot is trivial; a phone photograph of a laptop screen has a
+ * brightness gradient across it, a highlight somewhere and a colour cast, and
+ * one global threshold shreds it.
+ *
+ * Three strategies, lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/binarise.ts`), tried in order
+ * by the lenient ladder rather than chosen cleverly. The strict profile reads
+ * with the block-mean hybrid alone, the one jsQR and ZXing use, and models
+ * zxing-cpp with that reader's own (`binariseLocalAverage`).
+ *
+ * Each keeps its thresholds as well as its decisions. A sampled module is
+ * soft: how far its grey sits from the local threshold, as well as which side,
+ * and the threshold that made the decision is the one it is measured against.
+ */
+import type { GreyImage } from './grey.js';
+export type BinariserId = 'hybrid' | 'hybrid-mean' | 'otsu' | 'sauvola';
+export interface Binarised {
+    readonly width: number;
+    readonly height: number;
+    /** One byte per pixel, row major: 1 dark, 0 light. */
+    readonly bits: Uint8Array;
+    /** The threshold at a pixel: a grey at or below it is dark. */
+    threshold(x: number, y: number): number;
+}
+/**
+ * Otsu's method: the global split that minimises the variance within the two
+ * groups it makes.
+ *
+ * Excellent on screenshots, which have two clean peaks, and useless under a
+ * gradient, which is why it is not the first rung.
+ */
+export declare function otsuThreshold(image: GreyImage): number;
+export declare function binariseOtsu(image: GreyImage): Binarised;
+/**
+ * Local thresholds on an 8 by 8 grid, smoothed across neighbouring blocks.
+ *
+ * The workhorse, and the reason photographs read at all. Two details do the
+ * work. A block whose range is tiny is judged flat, and takes the average of
+ * its already-computed neighbours rather than inventing a threshold in the
+ * middle of a uniform area, which would shred a plain quiet zone into noise.
+ * And each block's threshold is averaged over its 3 by 3 neighbourhood, so the
+ * block boundaries do not print themselves onto the result.
+ */
+export declare function binariseHybrid(image: GreyImage): Binarised;
+/**
+ * The hybrid binariser the common readers use: zxing's HybridBinarizer, which
+ * jsQR ports line for line.
+ *
+ * The same 8 by 8 grid as `binariseHybrid`, with three differences that
+ * matter. A block's threshold is the mean of its pixels rather than the middle
+ * of its range, which on a low-contrast or unevenly lit block lands somewhere
+ * else entirely. A flat block assumes it is light ground (half its minimum)
+ * and takes its neighbours' threshold only when its own pixels sit below it.
+ * And the smoothing is over 5 by 5 blocks, clamped so the window stays inside
+ * the grid at the edges.
+ *
+ * The strict profile thresholds this way because it is how the phone readers
+ * it has to be at least as hard as see the picture: a module that lands on
+ * the wrong side of their threshold is an error for them whatever a better
+ * threshold would have made of it.
+ */
+export declare function binariseHybridMean(image: GreyImage): Binarised;
+/**
+ * zxing-cpp's hybrid binariser as it stands, the "LocalAverage" one zxing-wasm
+ * reads with by default, written from its description: the strict profile's
+ * model of how zxing-cpp sees a picture, where it has to predict what zxing-cpp
+ * will make of a finder or a grid.
+ *
+ * It is neither `binariseHybrid` nor `binariseHybridMean`, and the differences
+ * decide what a flat patch becomes. A block's threshold is the middle of its
+ * range, or none at all when the range is 24 or less; each is then averaged
+ * over the five by five blocks round it, its own counted three times and the
+ * blocks with none not at all; and a block left with none after that takes
+ * the next block's that has one, in reading order. So a dark patch wider than
+ * a block, the centre of a finder at ten pixels a module, takes its threshold
+ * from its surroundings and stays dark, where `binariseHybrid` can leave a
+ * light hole in it. Edge blocks are moved back inside the picture, and the
+ * last one decides the pixels it shares with the one before.
+ */
+export declare function binariseLocalAverage(image: GreyImage): Binarised;
+/**
+ * Sauvola: a windowed mean adjusted by the local standard deviation.
+ *
+ * Slow, and the right answer for glare. A highlight wrecks the local mean but
+ * leaves the local variance alone, so a rule that leans on the variance keeps
+ * reading modules where a mean-based one gives up. Integral images make the
+ * window size free.
+ */
+export declare function binariseSauvola(image: GreyImage, window?: number, k?: number): Binarised;
+export declare function binarise(image: GreyImage, which: BinariserId): Binarised;
+//# sourceMappingURL=binarise.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"binarise.d.ts","sourceRoot":"","sources":["../../src/decode/binarise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAE3C,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,aAAa,GAAG,MAAM,GAAG,SAAS,CAAC;AAExE,MAAM,WAAW,SAAS;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,+DAA+D;IAC/D,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACxC;AAMD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAyBtD;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,CAKxD;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,CA0E1D;AAKD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,CAsE9D;AAOD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,CAkEhE;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,SAAK,EAAE,CAAC,SAAM,GAAG,SAAS,CA4CjF;AAED,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,GAAG,SAAS,CAWxE"}

package/dist/decode/binarise.js

@@ -0,0 +1,399 @@
+/**
+ * Deciding which pixels are dark.
+ *
+ * The hardest and least glamorous part of reading a code from a photograph. A
+ * screenshot is trivial; a phone photograph of a laptop screen has a
+ * brightness gradient across it, a highlight somewhere and a colour cast, and
+ * one global threshold shreds it.
+ *
+ * Three strategies, lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/binarise.ts`), tried in order
+ * by the lenient ladder rather than chosen cleverly. The strict profile reads
+ * with the block-mean hybrid alone, the one jsQR and ZXing use, and models
+ * zxing-cpp with that reader's own (`binariseLocalAverage`).
+ *
+ * Each keeps its thresholds as well as its decisions. A sampled module is
+ * soft: how far its grey sits from the local threshold, as well as which side,
+ * and the threshold that made the decision is the one it is measured against.
+ */
+const BLOCK = 8;
+/** Below this range a block is judged flat and takes its threshold from its neighbours. */
+const MIN_DYNAMIC_RANGE = 24;
+/**
+ * Otsu's method: the global split that minimises the variance within the two
+ * groups it makes.
+ *
+ * Excellent on screenshots, which have two clean peaks, and useless under a
+ * gradient, which is why it is not the first rung.
+ */
+export function otsuThreshold(image) {
+    const histogram = new Uint32Array(256);
+    for (let i = 0; i < image.data.length; i += 1)
+        histogram[image.data[i]] += 1;
+    const total = image.data.length;
+    let sum = 0;
+    for (let i = 0; i < 256; i += 1)
+        sum += i * histogram[i];
+    let sumBackground = 0;
+    let weightBackground = 0;
+    let best = 0;
+    let bestVariance = -1;
+    for (let t = 0; t < 256; t += 1) {
+        weightBackground += histogram[t];
+        if (weightBackground === 0)
+            continue;
+        const weightForeground = total - weightBackground;
+        if (weightForeground === 0)
+            break;
+        sumBackground += t * histogram[t];
+        const difference = sumBackground / weightBackground - (sum - sumBackground) / weightForeground;
+        const variance = weightBackground * weightForeground * difference * difference;
+        if (variance > bestVariance) {
+            bestVariance = variance;
+            best = t;
+        }
+    }
+    return best;
+}
+export function binariseOtsu(image) {
+    const threshold = otsuThreshold(image);
+    const bits = new Uint8Array(image.data.length);
+    for (let i = 0; i < bits.length; i += 1)
+        bits[i] = image.data[i] <= threshold ? 1 : 0;
+    return { width: image.width, height: image.height, bits, threshold: () => threshold };
+}
+/**
+ * Local thresholds on an 8 by 8 grid, smoothed across neighbouring blocks.
+ *
+ * The workhorse, and the reason photographs read at all. Two details do the
+ * work. A block whose range is tiny is judged flat, and takes the average of
+ * its already-computed neighbours rather than inventing a threshold in the
+ * middle of a uniform area, which would shred a plain quiet zone into noise.
+ * And each block's threshold is averaged over its 3 by 3 neighbourhood, so the
+ * block boundaries do not print themselves onto the result.
+ */
+export function binariseHybrid(image) {
+    const { width, height, data } = image;
+    // Too small for local statistics to mean anything.
+    if (width < BLOCK * 3 || height < BLOCK * 3)
+        return binariseOtsu(image);
+    const blocksX = Math.ceil(width / BLOCK);
+    const blocksY = Math.ceil(height / BLOCK);
+    const raw = new Float64Array(blocksX * blocksY);
+    for (let by = 0; by < blocksY; by += 1) {
+        for (let bx = 0; bx < blocksX; bx += 1) {
+            const x0 = bx * BLOCK;
+            const y0 = by * BLOCK;
+            const x1 = Math.min(x0 + BLOCK, width);
+            const y1 = Math.min(y0 + BLOCK, height);
+            let min = 255;
+            let max = 0;
+            for (let y = y0; y < y1; y += 1) {
+                for (let x = x0; x < x1; x += 1) {
+                    const value = data[y * width + x];
+                    if (value < min)
+                        min = value;
+                    if (value > max)
+                        max = value;
+                }
+            }
+            let threshold;
+            if (max - min > MIN_DYNAMIC_RANGE) {
+                threshold = (min + max) >> 1;
+            }
+            else if (bx === 0 && by === 0) {
+                // Nothing computed yet to borrow from. Biased dark so a uniformly light
+                // corner does not come out solid black.
+                threshold = min >> 1;
+            }
+            else {
+                // Flat: inherit from the neighbours already computed, which is what
+                // stops a plain quiet zone becoming noise. The first row and column
+                // have one neighbour each; everything else has three, the diagonal one
+                // counted twice, as the authenticator has it.
+                const left = bx > 0 ? raw[by * blocksX + bx - 1] : 0;
+                const above = by > 0 ? raw[(by - 1) * blocksX + bx] : 0;
+                const aboveLeft = bx > 0 && by > 0 ? raw[(by - 1) * blocksX + bx - 1] : 0;
+                const divisor = (bx > 0 ? 1 : 0) + (by > 0 ? 1 : 0) + (bx > 0 && by > 0 ? 2 : 0);
+                threshold = Math.round((left + above + 2 * aboveLeft) / divisor);
+            }
+            raw[by * blocksX + bx] = threshold;
+        }
+    }
+    const smoothed = new Float64Array(blocksX * blocksY);
+    for (let by = 0; by < blocksY; by += 1) {
+        for (let bx = 0; bx < blocksX; bx += 1) {
+            let total = 0;
+            let count = 0;
+            for (let ny = Math.max(0, by - 1); ny <= Math.min(blocksY - 1, by + 1); ny += 1) {
+                for (let nx = Math.max(0, bx - 1); nx <= Math.min(blocksX - 1, bx + 1); nx += 1) {
+                    total += raw[ny * blocksX + nx];
+                    count += 1;
+                }
+            }
+            smoothed[by * blocksX + bx] = total / count;
+        }
+    }
+    const bits = new Uint8Array(width * height);
+    for (let y = 0; y < height; y += 1) {
+        const blockRow = (y >> 3) * blocksX;
+        for (let x = 0; x < width; x += 1) {
+            bits[y * width + x] =
+                data[y * width + x] <= smoothed[blockRow + (x >> 3)] ? 1 : 0;
+        }
+    }
+    return {
+        width,
+        height,
+        bits,
+        threshold: (x, y) => smoothed[(y >> 3) * blocksX + (x >> 3)],
+    };
+}
+/** Below this many pixels on a side, zxing's hybrid binariser hands over to a global one, and so does this. */
+const MEAN_MINIMUM_DIMENSION = 40;
+/**
+ * The hybrid binariser the common readers use: zxing's HybridBinarizer, which
+ * jsQR ports line for line.
+ *
+ * The same 8 by 8 grid as `binariseHybrid`, with three differences that
+ * matter. A block's threshold is the mean of its pixels rather than the middle
+ * of its range, which on a low-contrast or unevenly lit block lands somewhere
+ * else entirely. A flat block assumes it is light ground (half its minimum)
+ * and takes its neighbours' threshold only when its own pixels sit below it.
+ * And the smoothing is over 5 by 5 blocks, clamped so the window stays inside
+ * the grid at the edges.
+ *
+ * The strict profile thresholds this way because it is how the phone readers
+ * it has to be at least as hard as see the picture: a module that lands on
+ * the wrong side of their threshold is an error for them whatever a better
+ * threshold would have made of it.
+ */
+export function binariseHybridMean(image) {
+    const { width, height, data } = image;
+    const blocksX = Math.ceil(width / BLOCK);
+    const blocksY = Math.ceil(height / BLOCK);
+    if (width < MEAN_MINIMUM_DIMENSION ||
+        height < MEAN_MINIMUM_DIMENSION ||
+        blocksX < 5 ||
+        blocksY < 5) {
+        return binariseOtsu(image);
+    }
+    const blackPoints = new Float64Array(blocksX * blocksY);
+    for (let by = 0; by < blocksY; by += 1) {
+        for (let bx = 0; bx < blocksX; bx += 1) {
+            let sum = 0;
+            let min = 255;
+            let max = 0;
+            let count = 0;
+            for (let y = by * BLOCK; y < Math.min(height, by * BLOCK + BLOCK); y += 1) {
+                for (let x = bx * BLOCK; x < Math.min(width, bx * BLOCK + BLOCK); x += 1) {
+                    const value = data[y * width + x];
+                    sum += value;
+                    count += 1;
+                    if (value < min)
+                        min = value;
+                    if (value > max)
+                        max = value;
+                }
+            }
+            let average = sum / count;
+            if (max - min <= MIN_DYNAMIC_RANGE) {
+                average = min / 2;
+                if (by > 0 && bx > 0) {
+                    const neighbours = (blackPoints[(by - 1) * blocksX + bx] +
+                        2 * blackPoints[by * blocksX + bx - 1] +
+                        blackPoints[(by - 1) * blocksX + bx - 1]) /
+                        4;
+                    if (min < neighbours)
+                        average = neighbours;
+                }
+            }
+            blackPoints[by * blocksX + bx] = average;
+        }
+    }
+    const thresholds = new Float64Array(blocksX * blocksY);
+    for (let by = 0; by < blocksY; by += 1) {
+        const top = Math.min(Math.max(by, 2), blocksY - 3);
+        for (let bx = 0; bx < blocksX; bx += 1) {
+            const left = Math.min(Math.max(bx, 2), blocksX - 3);
+            let sum = 0;
+            for (let dy = -2; dy <= 2; dy += 1) {
+                for (let dx = -2; dx <= 2; dx += 1)
+                    sum += blackPoints[(top + dy) * blocksX + left + dx];
+            }
+            thresholds[by * blocksX + bx] = sum / 25;
+        }
+    }
+    const bits = new Uint8Array(width * height);
+    for (let y = 0; y < height; y += 1) {
+        const row = (y >> 3) * blocksX;
+        for (let x = 0; x < width; x += 1) {
+            bits[y * width + x] =
+                data[y * width + x] <= thresholds[row + (x >> 3)] ? 1 : 0;
+        }
+    }
+    return {
+        width,
+        height,
+        bits,
+        threshold: (x, y) => thresholds[(y >> 3) * blocksX + (x >> 3)],
+    };
+}
+/** zxing-cpp's local thresholds need a picture this many pixels on a side, and fall back to a global one below it. */
+const LOCAL_AVERAGE_MINIMUM = 40;
+/** Blocks either side of a block that its threshold is smoothed over: five by five. */
+const LOCAL_AVERAGE_RADIUS = 2;
+/**
+ * zxing-cpp's hybrid binariser as it stands, the "LocalAverage" one zxing-wasm
+ * reads with by default, written from its description: the strict profile's
+ * model of how zxing-cpp sees a picture, where it has to predict what zxing-cpp
+ * will make of a finder or a grid.
+ *
+ * It is neither `binariseHybrid` nor `binariseHybridMean`, and the differences
+ * decide what a flat patch becomes. A block's threshold is the middle of its
+ * range, or none at all when the range is 24 or less; each is then averaged
+ * over the five by five blocks round it, its own counted three times and the
+ * blocks with none not at all; and a block left with none after that takes
+ * the next block's that has one, in reading order. So a dark patch wider than
+ * a block, the centre of a finder at ten pixels a module, takes its threshold
+ * from its surroundings and stays dark, where `binariseHybrid` can leave a
+ * light hole in it. Edge blocks are moved back inside the picture, and the
+ * last one decides the pixels it shares with the one before.
+ */
+export function binariseLocalAverage(image) {
+    const { width, height, data } = image;
+    if (width < LOCAL_AVERAGE_MINIMUM || height < LOCAL_AVERAGE_MINIMUM)
+        return binariseOtsu(image);
+    const blocksX = Math.ceil(width / BLOCK);
+    const blocksY = Math.ceil(height / BLOCK);
+    const origin = (block, size) => Math.min(block * BLOCK, size - BLOCK);
+    const raw = new Uint8Array(blocksX * blocksY);
+    for (let by = 0; by < blocksY; by += 1) {
+        const y0 = origin(by, height);
+        for (let bx = 0; bx < blocksX; bx += 1) {
+            const x0 = origin(bx, width);
+            let min = 255;
+            let max = 0;
+            for (let y = y0; y < y0 + BLOCK; y += 1) {
+                for (let x = x0; x < x0 + BLOCK; x += 1) {
+                    const level = data[y * width + x];
+                    if (level < min)
+                        min = level;
+                    if (level > max)
+                        max = level;
+                }
+            }
+            raw[by * blocksX + bx] = max - min > MIN_DYNAMIC_RANGE ? (max + min) >> 1 : 0;
+        }
+    }
+    const smooth = new Uint8Array(raw.length);
+    const r = LOCAL_AVERAGE_RADIUS;
+    for (let by = 0; by < blocksY; by += 1) {
+        const top = Math.min(Math.max(by, r), blocksY - r - 1);
+        for (let bx = 0; bx < blocksX; bx += 1) {
+            const left = Math.min(Math.max(bx, r), blocksX - r - 1);
+            const own = raw[by * blocksX + bx];
+            let sum = own > 0 ? 2 * own : 0;
+            let count = own > 0 ? 2 : 0;
+            for (let dy = -r; dy <= r; dy += 1) {
+                for (let dx = -r; dx <= r; dx += 1) {
+                    const value = raw[(top + dy) * blocksX + left + dx];
+                    sum += value;
+                    if (value > 0)
+                        count += 1;
+                }
+            }
+            smooth[by * blocksX + bx] = count > 0 ? Math.floor(sum / count) : 0;
+        }
+    }
+    // Blocks still without a threshold take the next one's, in reading order,
+    // and the last ones the last there is.
+    let next = 0;
+    for (let i = smooth.length - 1; i >= 0; i -= 1) {
+        if (smooth[i] > 0)
+            next = smooth[i];
+        else
+            smooth[i] = next;
+    }
+    let previous = 0;
+    for (let i = 0; i < smooth.length; i += 1) {
+        if (smooth[i] > 0)
+            previous = smooth[i];
+        else
+            smooth[i] = previous;
+    }
+    if (previous === 0)
+        return binariseOtsu(image);
+    const blockOf = (pixel, size, blocks) => pixel >= size - BLOCK ? blocks - 1 : Math.floor(pixel / BLOCK);
+    const at = (x, y) => smooth[blockOf(y, height, blocksY) * blocksX + blockOf(x, width, blocksX)];
+    const bits = new Uint8Array(width * height);
+    for (let y = 0; y < height; y += 1) {
+        for (let x = 0; x < width; x += 1) {
+            bits[y * width + x] = data[y * width + x] <= at(x, y) ? 1 : 0;
+        }
+    }
+    return { width, height, bits, threshold: at };
+}
+/**
+ * Sauvola: a windowed mean adjusted by the local standard deviation.
+ *
+ * Slow, and the right answer for glare. A highlight wrecks the local mean but
+ * leaves the local variance alone, so a rule that leans on the variance keeps
+ * reading modules where a mean-based one gives up. Integral images make the
+ * window size free.
+ */
+export function binariseSauvola(image, window = 31, k = 0.2) {
+    const { width, height, data } = image;
+    const radius = window >> 1;
+    const stride = width + 1;
+    // Integral images of the values and their squares, with a row and column of
+    // padding so the window arithmetic needs no bounds checks.
+    const sums = new Float64Array(stride * (height + 1));
+    const squares = new Float64Array(stride * (height + 1));
+    for (let y = 0; y < height; y += 1) {
+        let rowSum = 0;
+        let rowSquare = 0;
+        for (let x = 0; x < width; x += 1) {
+            const value = data[y * width + x];
+            rowSum += value;
+            rowSquare += value * value;
+            sums[(y + 1) * stride + x + 1] = sums[y * stride + x + 1] + rowSum;
+            squares[(y + 1) * stride + x + 1] = squares[y * stride + x + 1] + rowSquare;
+        }
+    }
+    const area = (table, x0, y0, x1, y1) => table[y1 * stride + x1] -
+        table[y0 * stride + x1] -
+        table[y1 * stride + x0] +
+        table[y0 * stride + x0];
+    const threshold = (x, y) => {
+        const x0 = Math.max(0, x - radius);
+        const y0 = Math.max(0, y - radius);
+        const x1 = Math.min(width, x + radius + 1);
+        const y1 = Math.min(height, y + radius + 1);
+        const count = (x1 - x0) * (y1 - y0);
+        const mean = area(sums, x0, y0, x1, y1) / count;
+        const variance = Math.max(0, area(squares, x0, y0, x1, y1) / count - mean * mean);
+        // R = 128, the usual choice for 8-bit input.
+        return mean * (1 + k * (Math.sqrt(variance) / 128 - 1));
+    };
+    const bits = new Uint8Array(width * height);
+    for (let y = 0; y < height; y += 1) {
+        for (let x = 0; x < width; x += 1) {
+            bits[y * width + x] = data[y * width + x] <= threshold(x, y) ? 1 : 0;
+        }
+    }
+    return { width, height, bits, threshold };
+}
+export function binarise(image, which) {
+    switch (which) {
+        case 'hybrid':
+            return binariseHybrid(image);
+        case 'hybrid-mean':
+            return binariseHybridMean(image);
+        case 'otsu':
+            return binariseOtsu(image);
+        case 'sauvola':
+            return binariseSauvola(image);
+    }
+}
+//# sourceMappingURL=binarise.js.map

package/dist/decode/binarise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binarise.js","sourceRoot":"","sources":["../../src/decode/binarise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAeH,MAAM,KAAK,GAAG,CAAC,CAAC;AAChB,2FAA2F;AAC3F,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB;IAC7C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;QAAE,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC,IAAI,CAAC,CAAC;IACvF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;IAChC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;QAAE,GAAG,IAAI,CAAC,GAAI,SAAS,CAAC,CAAC,CAAY,CAAC;IAErE,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACjC,gBAAgB,IAAI,SAAS,CAAC,CAAC,CAAW,CAAC;QAC3C,IAAI,gBAAgB,KAAK,CAAC;YAAE,SAAS;QACrC,MAAM,gBAAgB,GAAG,KAAK,GAAG,gBAAgB,CAAC;QAClD,IAAI,gBAAgB,KAAK,CAAC;YAAE,MAAM;QAClC,aAAa,IAAI,CAAC,GAAI,SAAS,CAAC,CAAC,CAAY,CAAC;QAC9C,MAAM,UAAU,GAAG,aAAa,GAAG,gBAAgB,GAAG,CAAC,GAAG,GAAG,aAAa,CAAC,GAAG,gBAAgB,CAAC;QAC/F,MAAM,QAAQ,GAAG,gBAAgB,GAAG,gBAAgB,GAAG,UAAU,GAAG,UAAU,CAAC;QAC/E,IAAI,QAAQ,GAAG,YAAY,EAAE,CAAC;YAC7B,YAAY,GAAG,QAAQ,CAAC;YACxB,IAAI,GAAG,CAAC,CAAC;QACV,CAAC;IACF,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAAgB;IAC5C,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,CAAC,GAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAY,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,SAAS,EAAE,CAAC;AACvF,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAC,KAAgB;IAC9C,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACtC,mDAAmD;IACnD,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC;QAAE,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;IACxE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IAEhD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;YACtB,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;YACtB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,EAAE,MAAM,CAAC,CAAC;YACxC,IAAI,GAAG,GAAG,GAAG,CAAC;YACd,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAW,CAAC;oBAC5C,IAAI,KAAK,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC;oBAC7B,IAAI,KAAK,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC;gBAC9B,CAAC;YACF,CAAC;YACD,IAAI,SAAiB,CAAC;YACtB,IAAI,GAAG,GAAG,GAAG,GAAG,iBAAiB,EAAE,CAAC;gBACnC,SAAS,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,CAAC;iBAAM,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACjC,wEAAwE;gBACxE,wCAAwC;gBACxC,SAAS,GAAG,GAAG,IAAI,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACP,oEAAoE;gBACpE,oEAAoE;gBACpE,uEAAuE;gBACvE,8CAA8C;gBAC9C,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjE,MAAM,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,EAAE,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,EAAE,GAAG,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtF,MAAM,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjF,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC;YAClE,CAAC;YACD,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAC,GAAG,SAAS,CAAC;QACpC,CAAC;IACF,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IACrD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACxC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjF,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;oBACjF,KAAK,IAAI,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAW,CAAC;oBAC1C,KAAK,IAAI,CAAC,CAAC;gBACZ,CAAC;YACF,CAAC;YACD,QAAQ,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;QAC7C,CAAC;IACF,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAY,IAAK,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,CAAC;IACF,CAAC;IACD,OAAO;QACN,KAAK;QACL,MAAM;QACN,IAAI;QACJ,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAW;KACtE,CAAC;AACH,CAAC;AAED,+GAA+G;AAC/G,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAgB;IAClD,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IAC1C,IACC,KAAK,GAAG,sBAAsB;QAC9B,MAAM,GAAG,sBAAsB;QAC/B,OAAO,GAAG,CAAC;QACX,OAAO,GAAG,CAAC,EACV,CAAC;QACF,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IACxD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACxC,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,GAAG,GAAG,CAAC;YACd,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3E,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAW,CAAC;oBAC5C,GAAG,IAAI,KAAK,CAAC;oBACb,KAAK,IAAI,CAAC,CAAC;oBACX,IAAI,KAAK,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC;oBAC7B,IAAI,KAAK,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC;gBAC9B,CAAC;YACF,CAAC;YACD,IAAI,OAAO,GAAG,GAAG,GAAG,KAAK,CAAC;YAC1B,IAAI,GAAG,GAAG,GAAG,IAAI,iBAAiB,EAAE,CAAC;gBACpC,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;gBAClB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,UAAU,GACf,CAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,EAAE,CAAY;wBAChD,CAAC,GAAI,WAAW,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,CAAC,CAAY;wBACjD,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,EAAE,GAAG,CAAC,CAAY,CAAC;wBACtD,CAAC,CAAC;oBACH,IAAI,GAAG,GAAG,UAAU;wBAAE,OAAO,GAAG,UAAU,CAAC;gBAC5C,CAAC;YACF,CAAC;YACD,WAAW,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;QAC1C,CAAC;IACF,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IACvD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;YACpD,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACpC,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;oBACjC,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,OAAO,GAAG,IAAI,GAAG,EAAE,CAAW,CAAC;YACjE,CAAC;YACD,UAAU,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;QAC1C,CAAC;IACF,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAY,IAAK,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;IACF,CAAC;IACD,OAAO;QACN,KAAK;QACL,MAAM;QACN,IAAI;QACJ,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAW;KACxE,CAAC;AACH,CAAC;AAED,sHAAsH;AACtH,MAAM,qBAAqB,GAAG,EAAE,CAAC;AACjC,uFAAuF;AACvF,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAE/B;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAgB;IACpD,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACtC,IAAI,KAAK,GAAG,qBAAqB,IAAI,MAAM,GAAG,qBAAqB;QAAE,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;IAChG,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,IAAY,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;IAC9F,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IAC9C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7B,IAAI,GAAG,GAAG,GAAG,CAAC;YACd,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAW,CAAC;oBAC5C,IAAI,KAAK,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC;oBAC7B,IAAI,KAAK,GAAG,GAAG;wBAAE,GAAG,GAAG,KAAK,CAAC;gBAC9B,CAAC;YACF,CAAC;YACD,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,CAAC;IACF,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,CAAC,GAAG,oBAAoB,CAAC;IAC/B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACvD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAW,CAAC;YAC7C,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACpC,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;oBACpC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,OAAO,GAAG,IAAI,GAAG,EAAE,CAAW,CAAC;oBAC9D,GAAG,IAAI,KAAK,CAAC;oBACb,IAAI,KAAK,GAAG,CAAC;wBAAE,KAAK,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACF,CAAC;YACD,MAAM,CAAC,EAAE,GAAG,OAAO,GAAG,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;IACF,CAAC;IACD,0EAA0E;IAC1E,uCAAuC;IACvC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,IAAK,MAAM,CAAC,CAAC,CAAY,GAAG,CAAC;YAAE,IAAI,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;;YACrD,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvB,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAK,MAAM,CAAC,CAAC,CAAY,GAAG,CAAC;YAAE,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;;YACzD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAC3B,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,IAAY,EAAE,MAAc,EAAU,EAAE,CACvE,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IAChE,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAW,CAAC;IACtF,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAI,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAY,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;IACF,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;AAC/C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,KAAgB,EAAE,MAAM,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG;IACrE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACtC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,4EAA4E;IAC5E,2DAA2D;IAC3D,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAW,CAAC;YAC5C,MAAM,IAAI,KAAK,CAAC;YAChB,SAAS,IAAI,KAAK,GAAG,KAAK,CAAC;YAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAI,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAY,GAAG,MAAM,CAAC;YAC/E,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,GAAI,OAAO,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAY,GAAG,SAAS,CAAC;QACzF,CAAC;IACF,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,KAAmB,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAU,EAAE,CAC3F,KAAK,CAAC,EAAE,GAAG,MAAM,GAAG,EAAE,CAAY;QAClC,KAAK,CAAC,EAAE,GAAG,MAAM,GAAG,EAAE,CAAY;QAClC,KAAK,CAAC,EAAE,GAAG,MAAM,GAAG,EAAE,CAAY;QAClC,KAAK,CAAC,EAAE,GAAG,MAAM,GAAG,EAAE,CAAY,CAAC;IAErC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;QAClD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;QAClF,6CAA6C;QAC7C,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAI,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAY,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,CAAC;IACF,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAC3C,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,KAAgB,EAAE,KAAkB;IAC5D,QAAQ,KAAK,EAAE,CAAC;QACf,KAAK,QAAQ;YACZ,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC;QAC9B,KAAK,aAAa;YACjB,OAAO,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAClC,KAAK,MAAM;YACV,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,SAAS;YACb,OAAO,eAAe,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;AACF,CAAC"}

package/dist/decode/decoder.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Finding and reading codes in a picture.
+ *
+ * A ladder rather than one clever attempt. Thresholding, scale and polarity
+ * are all guesses, and a guess that costs a few milliseconds is not worth
+ * agonising over: try the cheap likely one, then the next. The exact half of
+ * reading sits behind each symbology's `read` and is never part of the
+ * guessing.
+ *
+ * Lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/decoder.ts`) and generalised:
+ * any registered symbology with a locator, several codes in one picture, soft
+ * samples and erasures, the strict profile beside the lenient one, and no
+ * clock unless the caller hands one in, so the same picture gives the same
+ * answer every time.
+ */
+import type { BitMatrix } from '../core/bit-matrix.js';
+import type { RgbaImage } from '../core/image.js';
+import type { Registry } from '../core/registry.js';
+import type { Result } from '../core/result.js';
+import type { MatrixRead, SymbologyEntry } from '../symbology/types.js';
+import type { DecodeOptions, DecodedSymbol } from './types.js';
+/**
+ * The working ceiling, in pixels. 2.5 megapixels is 1826 by 1369 at 4:3,
+ * which holds a 141-module symbol at 9.7 pixels a module across the short
+ * edge; Nyquist is 2. Measured in the authenticator, four megapixels read
+ * nothing two and a half did not, and cost a 50 MB transient on a phone.
+ */
+export declare const DEFAULT_MAX_PIXELS = 2500000;
+/**
+ * The strict profile's working ceiling. It reads at the picture's own scale,
+ * as the readers it is held to do: fitted to the scanner's ceiling, a version
+ * 40 symbol drawn at 10 pixels a module came down to 7, and its size measured
+ * off by two modules where zxing-cpp and jsQR, at full resolution, read it.
+ * Twelve megapixels holds such a symbol whole and keeps one strict read under
+ * a couple of seconds.
+ */
+export declare const STRICT_MAX_PIXELS = 12000000;
+/** The binarised frame handed to telemetry is a picture for a person: a megapixel is more than any overlay shows. */
+export declare const TELEMETRY_PIXELS = 1000000;
+/**
+ * The share of each block's corrections the plain reader's grid has to leave
+ * unused, as the verify layer has the strict reader's own leave: a quarter.
+ * A plain grid that reads only by the skin of its teeth is one jsQR, sampling
+ * a module or two differently, does not read: a hex-module design faded to
+ * 0.6 whose plain grid read with 7 errors of a block's 9 was one jsQR missed
+ * and zxing-cpp and the strict reader read. Over verify's captures of every
+ * preset on three seeds, the 39,864 symbols both oracles read, 10 left less.
+ */
+export declare const PLAIN_RESERVE = 0.25;
+/**
+ * Find and read every code in a picture, up to `maxSymbols`.
+ *
+ * A failed Result is 'decode/not-found' when no grid ever landed on a symbol,
+ * and 'decode/unreadable' (or the symbology's own 'decode/unsupported') when
+ * one did and its read was refused; both carry `params.stage`, the furthest
+ * stage reached. Nothing here reads a clock unless `options.clock` is given,
+ * so a picture gives the same answer every time.
+ *
+ * The ladder stops after the first rung that reads anything, having looked
+ * again on that rung, with each find masked out, until it finds nothing more:
+ * several codes in one picture are nearly always under the same light, and a
+ * camera frame with one code in it should not pay for eight more rungs.
+ */
+export declare function decodeImage(image: RgbaImage, options?: DecodeOptions, symbologies?: Registry<SymbologyEntry>): Result<readonly DecodedSymbol[]>;
+/**
+ * Read an already sampled matrix with whichever registered symbology has a
+ * version of its size. Pure: throws QrStudioError 'decode/unreadable' with
+ * params { stage }, the furthest stage any symbology reached.
+ */
+export declare function decodeMatrix(matrix: BitMatrix, options?: {
+    readonly strict?: boolean;
+    readonly symbologies?: readonly string[];
+}, symbologies?: Registry<SymbologyEntry>): MatrixRead;
+//# sourceMappingURL=decoder.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"decoder.d.ts","sourceRoot":"","sources":["../../src/decode/decoder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAEvD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAGpD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AA+BxE,OAAO,KAAK,EAEX,aAAa,EAEb,aAAa,EAIb,MAAM,YAAY,CAAC;AAEpB;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,UAAY,CAAC;AAE5C;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,WAAa,CAAC;AAE5C,qHAAqH;AACrH,eAAO,MAAM,gBAAgB,UAAY,CAAC;AAwb1C;;;;;;;;GAQG;AACH,eAAO,MAAM,aAAa,OAAO,CAAC;AAoNlC;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CAC1B,KAAK,EAAE,SAAS,EAChB,OAAO,GAAE,aAAkB,EAC3B,WAAW,CAAC,EAAE,QAAQ,CAAC,cAAc,CAAC,GACpC,MAAM,CAAC,SAAS,aAAa,EAAE,CAAC,CA2GlC;AAgBD;;;;GAIG;AACH,wBAAgB,YAAY,CAC3B,MAAM,EAAE,SAAS,EACjB,OAAO,GAAE;IAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CAAO,EACrF,WAAW,CAAC,EAAE,QAAQ,CAAC,cAAc,CAAC,GACpC,UAAU,CA+BZ"}