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

package/dist/core/result.d.ts

@@ -0,0 +1,33 @@
+/**
+ * The result type used by every attempt-shaped operation in this package.
+ *
+ * The rule, which is the same one the sibling packages use: pure parsers and
+ * programmer-error guards throw, and attempt-shaped operations return a
+ * `Result`. Reading a QR code from a camera frame is attempt-shaped and fails
+ * thirty times a second while somebody lines the phone up, so it must not
+ * allocate a stack trace to say "not yet". Discovering that a ZIP entry claims
+ * a length of four gigabytes is a parse failure and throws.
+ */
+import { QrStudioError } from './errors.js';
+export type Result<T, E = QrStudioError> = {
+    readonly ok: true;
+    readonly value: T;
+} | {
+    readonly ok: false;
+    readonly error: E;
+};
+export declare function ok<T>(value: T): Result<T, never>;
+export declare function err<E>(error: E): Result<never, E>;
+/** Unwrap or rethrow. For callers that would rather have the exception. */
+export declare function unwrap<T>(result: Result<T, QrStudioError>): T;
+/**
+ * Run `fn` and convert a thrown `QrStudioError` into a failed result.
+ *
+ * Anything that is not a `QrStudioError` is rethrown rather than wrapped. A
+ * `TypeError` from calling this wrongly is a bug in the caller, and swallowing
+ * it into a `Result` would hide it behind a message about QR codes.
+ */
+export declare function attempt<T>(fn: () => T): Result<T, QrStudioError>;
+/** `attempt` for work that awaits. */
+export declare function attemptAsync<T>(fn: () => T | Promise<T>): Promise<Result<T, QrStudioError>>;
+//# sourceMappingURL=result.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"result.d.ts","sourceRoot":"","sources":["../../src/core/result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,MAAM,MAAM,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,IACtC;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GAAG;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,CAAC;AAEtF,wBAAgB,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAEhD;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAEjD;AAED,2EAA2E;AAC3E,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,aAAa,CAAC,GAAG,CAAC,CAG7D;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,aAAa,CAAC,CAOhE;AAED,sCAAsC;AACtC,wBAAsB,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAOjG"}

package/dist/core/result.js

@@ -0,0 +1,52 @@
+/**
+ * The result type used by every attempt-shaped operation in this package.
+ *
+ * The rule, which is the same one the sibling packages use: pure parsers and
+ * programmer-error guards throw, and attempt-shaped operations return a
+ * `Result`. Reading a QR code from a camera frame is attempt-shaped and fails
+ * thirty times a second while somebody lines the phone up, so it must not
+ * allocate a stack trace to say "not yet". Discovering that a ZIP entry claims
+ * a length of four gigabytes is a parse failure and throws.
+ */
+import { QrStudioError } from './errors.js';
+export function ok(value) {
+    return { ok: true, value };
+}
+export function err(error) {
+    return { ok: false, error };
+}
+/** Unwrap or rethrow. For callers that would rather have the exception. */
+export function unwrap(result) {
+    if (result.ok)
+        return result.value;
+    throw result.error;
+}
+/**
+ * Run `fn` and convert a thrown `QrStudioError` into a failed result.
+ *
+ * Anything that is not a `QrStudioError` is rethrown rather than wrapped. A
+ * `TypeError` from calling this wrongly is a bug in the caller, and swallowing
+ * it into a `Result` would hide it behind a message about QR codes.
+ */
+export function attempt(fn) {
+    try {
+        return ok(fn());
+    }
+    catch (error) {
+        if (error instanceof QrStudioError)
+            return err(error);
+        throw error;
+    }
+}
+/** `attempt` for work that awaits. */
+export async function attemptAsync(fn) {
+    try {
+        return ok(await fn());
+    }
+    catch (error) {
+        if (error instanceof QrStudioError)
+            return err(error);
+        throw error;
+    }
+}
+//# sourceMappingURL=result.js.map

package/dist/core/result.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.js","sourceRoot":"","sources":["../../src/core/result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAK5C,MAAM,UAAU,EAAE,CAAI,KAAQ;IAC7B,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,GAAG,CAAI,KAAQ;IAC9B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,MAAM,CAAI,MAAgC;IACzD,IAAI,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC;IACnC,MAAM,MAAM,CAAC,KAAK,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,EAAW;IACrC,IAAI,CAAC;QACJ,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACjB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAChB,IAAI,KAAK,YAAY,aAAa;YAAE,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,KAAK,CAAC;IACb,CAAC;AACF,CAAC;AAED,sCAAsC;AACtC,MAAM,CAAC,KAAK,UAAU,YAAY,CAAI,EAAwB;IAC7D,IAAI,CAAC;QACJ,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACvB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAChB,IAAI,KAAK,YAAY,aAAa;YAAE,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,KAAK,CAAC;IACb,CAAC;AACF,CAAC"}

package/dist/core/zip.d.ts

@@ -0,0 +1,36 @@
+/**
+ * A ZIP writer, for batch exports: a folder of PNGs or SVGs a person
+ * downloads in one go.
+ *
+ * Writer only, and deliberately small: local headers, the central directory
+ * and the end record (APPNOTE 6.3.10 sections 4.3.7, 4.3.12 and 4.3.16), each
+ * entry stored or deflated, no ZIP64, no encryption, no extra fields. The same
+ * entries give the same bytes every time: the timestamp is a parameter that
+ * defaults to 1980-01-01 00:00 (the earliest a DOS date can say), entries are
+ * written in the order given, and the compressor is this package's own.
+ *
+ * Names are checked rather than cleaned. A name that would extract outside the
+ * folder somebody chose (an absolute path, a `..` segment, a backslash that
+ * Windows reads as a separator) or overwrite another entry is a bug in the
+ * caller, which should have built a safe name from the person's data first,
+ * so it throws `TypeError` rather than being quietly rewritten into something
+ * nobody asked for.
+ */
+export interface ZipEntry {
+    /** A relative path with `/` between folders, in any script. */
+    readonly name: string;
+    readonly bytes: Uint8Array;
+    /** Deflate this entry (stored anyway if that is not smaller). Defaults to false. */
+    readonly compress?: boolean;
+}
+export interface ZipOptions {
+    /** The modification date every entry carries, 1980 to 2107. Time of day is always 00:00. */
+    readonly date?: {
+        readonly year: number;
+        readonly month: number;
+        readonly day: number;
+    };
+}
+/** A ZIP archive of `entries`, in the order given. */
+export declare function writeZip(entries: readonly ZipEntry[], options?: ZipOptions): Uint8Array;
+//# sourceMappingURL=zip.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"zip.d.ts","sourceRoot":"","sources":["../../src/core/zip.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAMH,MAAM,WAAW,QAAQ;IACxB,+DAA+D;IAC/D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,oFAAoF;IACpF,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,UAAU;IAC1B,4FAA4F;IAC5F,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;CACxF;AAwGD,sDAAsD;AACtD,wBAAgB,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,UAAU,CA4HvF"}

package/dist/core/zip.js

@@ -0,0 +1,234 @@
+/**
+ * A ZIP writer, for batch exports: a folder of PNGs or SVGs a person
+ * downloads in one go.
+ *
+ * Writer only, and deliberately small: local headers, the central directory
+ * and the end record (APPNOTE 6.3.10 sections 4.3.7, 4.3.12 and 4.3.16), each
+ * entry stored or deflated, no ZIP64, no encryption, no extra fields. The same
+ * entries give the same bytes every time: the timestamp is a parameter that
+ * defaults to 1980-01-01 00:00 (the earliest a DOS date can say), entries are
+ * written in the order given, and the compressor is this package's own.
+ *
+ * Names are checked rather than cleaned. A name that would extract outside the
+ * folder somebody chose (an absolute path, a `..` segment, a backslash that
+ * Windows reads as a separator) or overwrite another entry is a bug in the
+ * caller, which should have built a safe name from the person's data first,
+ * so it throws `TypeError` rather than being quietly rewritten into something
+ * nobody asked for.
+ */
+import { crc32 } from './checksums.js';
+import { deflateRaw } from './deflate.js';
+import { ArchiveTooLargeError } from './errors.js';
+const LOCAL_HEADER = 30;
+const CENTRAL_HEADER = 46;
+const END_RECORD = 22;
+/** General purpose bit 11: the name is UTF-8. */
+const UTF8_FLAG = 0x0800;
+/** Without ZIP64, every count is 16 bits and every size and offset 32. */
+const MAX_ENTRIES = 0xffff;
+const MAX_BYTES = 0xffffffff;
+/**
+ * UTF-8, written out because a name with a lone surrogate must be refused:
+ * TextEncoder would replace it with U+FFFD, and two different names could
+ * then come out as the same bytes.
+ */
+function utf8(name) {
+    const out = [];
+    for (let i = 0; i < name.length; i += 1) {
+        let code = name.charCodeAt(i);
+        if (code >= 0xd800 && code <= 0xdfff) {
+            const low = name.charCodeAt(i + 1);
+            if (code > 0xdbff || !(low >= 0xdc00 && low <= 0xdfff)) {
+                throw new TypeError('a ZIP entry name is not valid Unicode');
+            }
+            code = 0x10000 + ((code - 0xd800) << 10) + (low - 0xdc00);
+            i += 1;
+        }
+        if (code < 0x80) {
+            out.push(code);
+        }
+        else if (code < 0x800) {
+            out.push(0xc0 | (code >> 6), 0x80 | (code & 0x3f));
+        }
+        else if (code < 0x10000) {
+            out.push(0xe0 | (code >> 12), 0x80 | ((code >> 6) & 0x3f), 0x80 | (code & 0x3f));
+        }
+        else {
+            out.push(0xf0 | (code >> 18), 0x80 | ((code >> 12) & 0x3f), 0x80 | ((code >> 6) & 0x3f), 0x80 | (code & 0x3f));
+        }
+    }
+    return Uint8Array.from(out);
+}
+/**
+ * Refuse a name that would land outside the folder it is extracted into, or
+ * that one of the common extractors would read differently.
+ *
+ * The message gives the entry's position, never the name: names in a batch
+ * export are built from somebody's spreadsheet.
+ */
+function checkName(name, index) {
+    const where = `entry ${index}`;
+    if (typeof name !== 'string' || name.length === 0) {
+        throw new TypeError(`${where} has no name`);
+    }
+    if (name.includes('\\')) {
+        throw new TypeError(`${where} has a backslash in its name, which Windows reads as a folder`);
+    }
+    if (name.startsWith('/') || /^[A-Za-z]:/.test(name)) {
+        throw new TypeError(`${where} has an absolute path for a name`);
+    }
+    // Control characters, including NUL, which ends the name in C extractors.
+    for (let i = 0; i < name.length; i += 1) {
+        const code = name.charCodeAt(i);
+        if (code < 0x20 || code === 0x7f) {
+            throw new TypeError(`${where} has a control character in its name`);
+        }
+    }
+    for (const segment of name.split('/')) {
+        if (segment === '' || segment === '.' || segment === '..') {
+            throw new TypeError(`${where} has an empty, '.' or '..' folder in its name`);
+        }
+    }
+    return name;
+}
+function dosDate(options) {
+    const { year, month, day } = options?.date ?? { year: 1980, month: 1, day: 1 };
+    if (!Number.isInteger(year) || year < 1980 || year > 2107) {
+        throw new RangeError('a ZIP date is in the years 1980 to 2107');
+    }
+    if (!Number.isInteger(month) || month < 1 || month > 12) {
+        throw new RangeError('a ZIP date has a month from 1 to 12');
+    }
+    const leap = (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0;
+    const days = [31, leap ? 29 : 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][month - 1];
+    if (!Number.isInteger(day) || day < 1 || day > days) {
+        throw new RangeError(`that month has days 1 to ${days}`);
+    }
+    return ((year - 1980) << 9) | (month << 5) | day;
+}
+/** A ZIP archive of `entries`, in the order given. */
+export function writeZip(entries, options) {
+    const date = dosDate(options);
+    if (entries.length > MAX_ENTRIES)
+        throw new ArchiveTooLargeError(MAX_ENTRIES, 'entries');
+    // Names first, and the size before any entry is read, so an archive that
+    // cannot be written is refused before the work of compressing it. Exact and
+    // case-folded names are both checked, with every folder a name implies:
+    // macOS and Windows extract without regard to case, so 'Card.png' and
+    // 'card.png' would overwrite each other there, and a file cannot share a
+    // path with a folder.
+    const files = new Set();
+    const folders = new Set();
+    const names = [];
+    let largest = END_RECORD;
+    entries.forEach((entry, index) => {
+        const name = checkName(entry.name, index);
+        const folded = name.toLowerCase();
+        const parts = folded.split('/');
+        if (files.has(folded) || folders.has(folded)) {
+            throw new TypeError(`entry ${index} has the same name as an earlier entry or its folder`);
+        }
+        for (let i = 1; i < parts.length; i += 1) {
+            const folder = parts.slice(0, i).join('/');
+            if (files.has(folder)) {
+                throw new TypeError(`entry ${index} is inside a folder that is an earlier entry's name`);
+            }
+            folders.add(folder);
+        }
+        files.add(folded);
+        const encoded = utf8(name);
+        if (encoded.length > 0xffff)
+            throw new TypeError(`entry ${index} has too long a name`);
+        names.push(encoded);
+        // Stored size is the most an entry can take, since deflate is kept only
+        // when it is smaller.
+        largest += LOCAL_HEADER + CENTRAL_HEADER + 2 * encoded.length + entry.bytes.length;
+    });
+    // Without ZIP64 every offset and size is 32 bits. Checked against the stored
+    // size, so a batch that would only fit once compressed is refused too; that
+    // is four gigabytes, far past anything a browser tab holds.
+    if (largest > MAX_BYTES)
+        throw new ArchiveTooLargeError(MAX_BYTES);
+    const prepared = [];
+    let offset = 0;
+    entries.forEach((entry, index) => {
+        const name = names[index];
+        const bytes = entry.bytes;
+        let data = bytes;
+        let deflated = false;
+        if (entry.compress === true) {
+            const compressed = deflateRaw(bytes, { level: 6 });
+            if (compressed.length < bytes.length) {
+                data = compressed;
+                deflated = true;
+            }
+        }
+        prepared.push({ name, data, deflated, crc: crc32(bytes), size: bytes.length, offset });
+        offset += LOCAL_HEADER + name.length + data.length;
+    });
+    const directoryOffset = offset;
+    let directorySize = 0;
+    for (const item of prepared)
+        directorySize += CENTRAL_HEADER + item.name.length;
+    const out = new Uint8Array(directoryOffset + directorySize + END_RECORD);
+    const view = new DataView(out.buffer);
+    let at = 0;
+    const u16 = (value) => {
+        view.setUint16(at, value, true);
+        at += 2;
+    };
+    const u32 = (value) => {
+        view.setUint32(at, value, true);
+        at += 4;
+    };
+    for (const item of prepared) {
+        u32(0x04034b50);
+        u16(item.deflated ? 20 : 10); // version needed: 2.0 for deflate, 1.0 to store
+        u16(UTF8_FLAG);
+        u16(item.deflated ? 8 : 0);
+        u16(0); // time: 00:00:00
+        u16(date);
+        u32(item.crc);
+        u32(item.data.length);
+        u32(item.size);
+        u16(item.name.length);
+        u16(0); // no extra field
+        out.set(item.name, at);
+        at += item.name.length;
+        out.set(item.data, at);
+        at += item.data.length;
+    }
+    for (const item of prepared) {
+        u32(0x02014b50);
+        // Made by MS-DOS, spec 2.0. A Unix host byte would make extractors read
+        // the zero external attributes below as mode 0000, unreadable files.
+        u16(20);
+        u16(item.deflated ? 20 : 10);
+        u16(UTF8_FLAG);
+        u16(item.deflated ? 8 : 0);
+        u16(0);
+        u16(date);
+        u32(item.crc);
+        u32(item.data.length);
+        u32(item.size);
+        u16(item.name.length);
+        u16(0); // extra field
+        u16(0); // comment
+        u16(0); // disk number
+        u16(0); // internal attributes
+        u32(0); // external attributes
+        u32(item.offset);
+        out.set(item.name, at);
+        at += item.name.length;
+    }
+    u32(0x06054b50);
+    u16(0); // this disk
+    u16(0); // disk with the directory
+    u16(prepared.length);
+    u16(prepared.length);
+    u32(directorySize);
+    u32(directoryOffset);
+    u16(0); // comment
+    return out;
+}
+//# sourceMappingURL=zip.js.map

package/dist/core/zip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zip.js","sourceRoot":"","sources":["../../src/core/zip.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAenD,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,cAAc,GAAG,EAAE,CAAC;AAC1B,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,iDAAiD;AACjD,MAAM,SAAS,GAAG,MAAM,CAAC;AACzB,0EAA0E;AAC1E,MAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,MAAM,SAAS,GAAG,UAAU,CAAC;AAE7B;;;;GAIG;AACH,SAAS,IAAI,CAAC,IAAY;IACzB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,IAAI,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC;gBACxD,MAAM,IAAI,SAAS,CAAC,uCAAuC,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;YAC1D,CAAC,IAAI,CAAC,CAAC;QACR,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YACjB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,CAAC;aAAM,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QACpD,CAAC;aAAM,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;YAC3B,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QAClF,CAAC;aAAM,CAAC;YACP,GAAG,CAAC,IAAI,CACP,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,EACnB,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,EAC5B,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAC3B,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CACpB,CAAC;QACH,CAAC;IACF,CAAC;IACD,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,IAAa,EAAE,KAAa;IAC9C,MAAM,KAAK,GAAG,SAAS,KAAK,EAAE,CAAC;IAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnD,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,cAAc,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,+DAA+D,CAAC,CAAC;IAC9F,CAAC;IACD,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,kCAAkC,CAAC,CAAC;IACjE,CAAC;IACD,0EAA0E;IAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClC,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,sCAAsC,CAAC,CAAC;QACrE,CAAC;IACF,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,IAAI,OAAO,KAAK,EAAE,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YAC3D,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,+CAA+C,CAAC,CAAC;QAC9E,CAAC;IACF,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,OAA+B;IAC/C,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAC/E,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;QAC3D,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACzD,MAAM,IAAI,UAAU,CAAC,qCAAqC,CAAC,CAAC;IAC7D,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAW,CAAC;IAC/F,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;QACrD,MAAM,IAAI,UAAU,CAAC,4BAA4B,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;AAClD,CAAC;AAWD,sDAAsD;AACtD,MAAM,UAAU,QAAQ,CAAC,OAA4B,EAAE,OAAoB;IAC1E,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,OAAO,CAAC,MAAM,GAAG,WAAW;QAAE,MAAM,IAAI,oBAAoB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAEzF,yEAAyE;IACzE,4EAA4E;IAC5E,wEAAwE;IACxE,sEAAsE;IACtE,yEAAyE;IACzE,sBAAsB;IACtB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,UAAU,CAAC;IACzB,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAChC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,SAAS,CAAC,SAAS,KAAK,sDAAsD,CAAC,CAAC;QAC3F,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3C,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,SAAS,CAAC,SAAS,KAAK,qDAAqD,CAAC,CAAC;YAC1F,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,OAAO,CAAC,MAAM,GAAG,MAAM;YAAE,MAAM,IAAI,SAAS,CAAC,SAAS,KAAK,sBAAsB,CAAC,CAAC;QACvF,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,wEAAwE;QACxE,sBAAsB;QACtB,OAAO,IAAI,YAAY,GAAG,cAAc,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IACpF,CAAC,CAAC,CAAC;IACH,6EAA6E;IAC7E,4EAA4E;IAC5E,4DAA4D;IAC5D,IAAI,OAAO,GAAG,SAAS;QAAE,MAAM,IAAI,oBAAoB,CAAC,SAAS,CAAC,CAAC;IAEnE,MAAM,QAAQ,GAAe,EAAE,CAAC;IAChC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAChC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAe,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,KAAK,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACnD,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBACtC,IAAI,GAAG,UAAU,CAAC;gBAClB,QAAQ,GAAG,IAAI,CAAC;YACjB,CAAC;QACF,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QACvF,MAAM,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,MAAM,eAAe,GAAG,MAAM,CAAC;IAC/B,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,MAAM,IAAI,IAAI,QAAQ;QAAE,aAAa,IAAI,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAEhF,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,eAAe,GAAG,aAAa,GAAG,UAAU,CAAC,CAAC;IACzE,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,GAAG,CAAC,KAAa,EAAQ,EAAE;QACnC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAChC,EAAE,IAAI,CAAC,CAAC;IACT,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,CAAC,KAAa,EAAQ,EAAE;QACnC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAChC,EAAE,IAAI,CAAC,CAAC;IACT,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC7B,GAAG,CAAC,UAAU,CAAC,CAAC;QAChB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gDAAgD;QAC9E,GAAG,CAAC,SAAS,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACzB,GAAG,CAAC,IAAI,CAAC,CAAC;QACV,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QACvB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACxB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC7B,GAAG,CAAC,UAAU,CAAC,CAAC;QAChB,wEAAwE;QACxE,qEAAqE;QACrE,GAAG,CAAC,EAAE,CAAC,CAAC;QACR,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7B,GAAG,CAAC,SAAS,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,CAAC;QACP,GAAG,CAAC,IAAI,CAAC,CAAC;QACV,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QACtB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU;QAClB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QACtB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB;QAC9B,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB;QAC9B,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACxB,CAAC;IACD,GAAG,CAAC,UAAU,CAAC,CAAC;IAChB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;IACpB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B;IAClC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrB,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrB,GAAG,CAAC,aAAa,CAAC,CAAC;IACnB,GAAG,CAAC,eAAe,CAAC,CAAC;IACrB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU;IAClB,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/decode/alignment.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Finding a 5 by 5 bullseye near where a fit predicts it: QR's bottom right
+ * alignment pattern, and rMQR's finder sub-pattern, which has the same rings.
+ *
+ * Lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/sample.ts`), where the
+ * ranking below is the fix for the failure that tool was actually shipping: a
+ * photograph held at an angle, all three finders found precisely, and a
+ * symbol whose modules were perfectly legible refused as too damaged, because
+ * the fourth correspondence had landed on an ordinary dark data module.
+ */
+import type { Binarised } from './binarise.js';
+import type { Point } from './types.js';
+export interface AlignmentMatch {
+    /** Where it was found, in image pixels. */
+    readonly point: Point;
+    /** How much it fails to look like a bullseye. Lower is better; zero is a perfect one. */
+    readonly score: number;
+    /** How far it sits from the prediction, in modules. */
+    readonly offset: number;
+}
+/**
+ * Candidates within `radius` pixels of `expected`, best looking first.
+ *
+ * Quality first, and position only between candidates of equal quality. An
+ * isolated dark data module passes the two axis tests surprisingly often, and
+ * dozens of them sit inside a window wide enough to cover an affine
+ * prediction's error, so ranking by distance from that prediction is a
+ * lottery: the true pattern came seventh at version 18 and fourteenth at 26 on
+ * measured scenes. Position still matters when two genuine patterns both score
+ * near zero, and then it is all there is.
+ */
+export declare function searchBullseye(image: Binarised, expected: Point, radius: number, moduleSize: number, limit: number): AlignmentMatch[];
+//# sourceMappingURL=alignment.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"alignment.d.ts","sourceRoot":"","sources":["../../src/decode/alignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,MAAM,WAAW,cAAc;IAC9B,2CAA2C;IAC3C,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB,yFAAyF;IACzF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACxB;AAqBD;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAC7B,KAAK,EAAE,SAAS,EAChB,QAAQ,EAAE,KAAK,EACf,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,KAAK,EAAE,MAAM,GACX,cAAc,EAAE,CAgClB"}

package/dist/decode/alignment.js

@@ -0,0 +1,179 @@
+/**
+ * Finding a 5 by 5 bullseye near where a fit predicts it: QR's bottom right
+ * alignment pattern, and rMQR's finder sub-pattern, which has the same rings.
+ *
+ * Lifted from the authenticator package's reader
+ * (google-auth-secret-retriever, `src/qr/decode/sample.ts`), where the
+ * ranking below is the fix for the failure that tool was actually shipping: a
+ * photograph held at an angle, all three finders found precisely, and a
+ * symbol whose modules were perfectly legible refused as too damaged, because
+ * the fourth correspondence had landed on an ordinary dark data module.
+ */
+import { hypot } from '../core/math.js';
+/**
+ * Scores within this of each other are the same score. A genuine pattern
+ * measured 0.01 to 0.05 and the best data-module impostor 0.29, so a tenth
+ * separates the populations and not two genuine patterns.
+ */
+const SCORE_BAND = 0.1;
+/** Both axes and both diagonals. */
+const SCORE_DIRECTIONS = 4;
+/**
+ * What a direction with no measurable run costs. Charged rather than refused,
+ * because blur erodes the light ring at a pattern's corners before its axes,
+ * and a real pattern at three pixels a module can lose a diagonal.
+ */
+const MISSING_DIRECTION = 2;
+function isDark(image, x, y) {
+    return image.bits[y * image.width + x] === 1;
+}
+/**
+ * Candidates within `radius` pixels of `expected`, best looking first.
+ *
+ * Quality first, and position only between candidates of equal quality. An
+ * isolated dark data module passes the two axis tests surprisingly often, and
+ * dozens of them sit inside a window wide enough to cover an affine
+ * prediction's error, so ranking by distance from that prediction is a
+ * lottery: the true pattern came seventh at version 18 and fourteenth at 26 on
+ * measured scenes. Position still matters when two genuine patterns both score
+ * near zero, and then it is all there is.
+ */
+export function searchBullseye(image, expected, radius, moduleSize, limit) {
+    const found = [];
+    const cx = Math.floor(expected.x);
+    const cy = Math.floor(expected.y);
+    for (let y = Math.max(0, cy - radius); y <= Math.min(image.height - 1, cy + radius); y += 1) {
+        for (let x = Math.max(0, cx - radius); x <= Math.min(image.width - 1, cx + radius); x += 1) {
+            if (!isDark(image, x, y))
+                continue;
+            const measured = scoreAt(image, x, y, moduleSize);
+            if (measured === null)
+                continue;
+            const { point, score } = measured;
+            const offset = hypot(point.x - expected.x, point.y - expected.y) / moduleSize;
+            // Many starting pixels inside one pattern resolve to the same centre, and
+            // those are one candidate rather than hundreds; keep the best of them.
+            const existing = found.findIndex((candidate) => hypot(candidate.point.x - point.x, candidate.point.y - point.y) < moduleSize);
+            if (existing < 0)
+                found.push({ point, score, offset });
+            else if (score < found[existing].score) {
+                found[existing] = { point, score, offset };
+            }
+        }
+    }
+    return found
+        .sort((a, b) => {
+        // Adding a weighted distance to the score looks tidier and cannot work:
+        // the weight would have to be small enough not to swamp the gap between
+        // a pattern and a data module, and large enough to separate two
+        // patterns that both score near zero, and no number is both.
+        const band = Math.floor(a.score / SCORE_BAND) - Math.floor(b.score / SCORE_BAND);
+        return band !== 0 ? band : a.offset - b.offset;
+    })
+        .slice(0, limit);
+}
+/**
+ * Score a candidate centre, and refine it.
+ *
+ * Null means not a plausible pattern at all: both axes have to show a light,
+ * dark, light triple of roughly equal runs at roughly the expected module
+ * size. The diagonals do not gate, they only score, and nearly all of the
+ * discrimination comes from them.
+ */
+function scoreAt(image, x, y, moduleSize) {
+    const horizontal = runTriple(image, x, y, 1, 0, moduleSize);
+    if (horizontal === null || !plausible(horizontal, moduleSize))
+        return null;
+    const vertical = runTriple(image, x, y, 0, 1, moduleSize);
+    if (vertical === null || !plausible(vertical, moduleSize))
+        return null;
+    const down = runTriple(image, x, y, 1, 1, moduleSize);
+    const up = runTriple(image, x, y, 1, -1, moduleSize);
+    let error = horizontal.error + vertical.error;
+    error += down === null ? MISSING_DIRECTION : down.error;
+    error += up === null ? MISSING_DIRECTION : up.error;
+    // Opposite directions of one pair cross the same rings, so a real pattern
+    // shows the same module size along both. The two pairs only agree with each
+    // other at 22.5 degrees, which is why the comparison is within a pair.
+    const axisPair = disagreement(horizontal.size, vertical.size);
+    const diagonalPair = down === null || up === null ? MISSING_DIRECTION / 2 : disagreement(down.size, up.size);
+    return {
+        // Pixel centres: the walk counts whole pixels either side of (x, y).
+        point: { x: x + 0.5 + horizontal.offset, y: y + 0.5 + vertical.offset },
+        score: error / SCORE_DIRECTIONS + axisPair + diagonalPair,
+    };
+}
+function disagreement(a, b) {
+    return Math.abs(a - b) / ((a + b) / 2);
+}
+/**
+ * The light, dark, light triple through a point along one direction.
+ *
+ * The outer dark ring is required but not measured: reaching it is what tells
+ * a pattern from a dark module with a wide light gap beside it, while its
+ * width says nothing, because it touches data modules more often than not.
+ */
+function runTriple(image, x, y, dx, dy, moduleSize) {
+    // A diagonal step covers root two pixels.
+    const stepLength = dx !== 0 && dy !== 0 ? Math.SQRT2 : 1;
+    const limit = (moduleSize * 3) / stepLength;
+    const walk = (sign) => {
+        let centre = 0;
+        let light = 0;
+        let inLight = false;
+        let px = x + sign * dx;
+        let py = y + sign * dy;
+        while (px >= 0 && py >= 0 && px < image.width && py < image.height) {
+            const dark = isDark(image, px, py);
+            if (!inLight) {
+                if (dark)
+                    centre += 1;
+                else {
+                    inLight = true;
+                    light += 1;
+                }
+            }
+            else if (!dark)
+                light += 1;
+            else
+                return { centre, light };
+            if (centre > limit || light > limit)
+                return null;
+            px += sign * dx;
+            py += sign * dy;
+        }
+        return null;
+    };
+    const back = walk(-1);
+    if (back === null)
+        return null;
+    const forward = walk(1);
+    if (forward === null)
+        return null;
+    const runs = [
+        back.light,
+        back.centre + 1 + forward.centre,
+        forward.light,
+    ];
+    const mean = (runs[0] + runs[1] + runs[2]) / 3;
+    let error = 0;
+    for (const run of runs) {
+        const relative = (run - mean) / mean;
+        error += relative * relative;
+    }
+    return { runs, size: mean * stepLength, error, offset: (forward.centre - back.centre) / 2 };
+}
+/**
+ * Whether a triple is worth scoring. The runs are compared with each other
+ * rather than with `moduleSize`, because a scan across a rotated symbol
+ * stretches all three by the same factor, but the size still has to be in the
+ * right neighbourhood or a large smudge would qualify.
+ */
+function plausible(triple, moduleSize) {
+    const mean = (triple.runs[0] + triple.runs[1] + triple.runs[2]) / 3;
+    for (const run of triple.runs)
+        if (Math.abs(run - mean) > mean * 0.6)
+            return false;
+    return triple.size >= moduleSize * 0.5 && triple.size <= moduleSize * 2.2;
+}
+//# sourceMappingURL=alignment.js.map

package/dist/decode/alignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"alignment.js","sourceRoot":"","sources":["../../src/decode/alignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAaxC;;;;GAIG;AACH,MAAM,UAAU,GAAG,GAAG,CAAC;AACvB,oCAAoC;AACpC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAC3B;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,SAAS,MAAM,CAAC,KAAgB,EAAE,CAAS,EAAE,CAAS;IACrD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC7B,KAAgB,EAChB,QAAe,EACf,MAAc,EACd,UAAkB,EAClB,KAAa;IAEb,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5F,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS;YACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAClD,IAAI,QAAQ,KAAK,IAAI;gBAAE,SAAS;YAChC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC;YAClC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;YAC9E,0EAA0E;YAC1E,uEAAuE;YACvE,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAC/B,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAC3F,CAAC;YACF,IAAI,QAAQ,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;iBAClD,IAAI,KAAK,GAAI,KAAK,CAAC,QAAQ,CAAoB,CAAC,KAAK,EAAE,CAAC;gBAC5D,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;YAC5C,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,KAAK;SACV,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACd,wEAAwE;QACxE,wEAAwE;QACxE,gEAAgE;QAChE,6DAA6D;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QACjF,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAChD,CAAC,CAAC;SACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,OAAO,CACf,KAAgB,EAChB,CAAS,EACT,CAAS,EACT,UAAkB;IAElB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC5D,IAAI,UAAU,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3E,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1D,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IACvE,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACtD,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAErD,IAAI,KAAK,GAAG,UAAU,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC9C,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACxD,KAAK,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;IACpD,0EAA0E;IAC1E,4EAA4E;IAC5E,uEAAuE;IACvE,MAAM,QAAQ,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9D,MAAM,YAAY,GACjB,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IACzF,OAAO;QACN,qEAAqE;QACrE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC,MAAM,EAAE;QACvE,KAAK,EAAE,KAAK,GAAG,gBAAgB,GAAG,QAAQ,GAAG,YAAY;KACzD,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACxC,CAAC;AAaD;;;;;;GAMG;AACH,SAAS,SAAS,CACjB,KAAgB,EAChB,CAAS,EACT,CAAS,EACT,EAAU,EACV,EAAU,EACV,UAAkB;IAElB,0CAA0C;IAC1C,MAAM,UAAU,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;IAC5C,MAAM,IAAI,GAAG,CAAC,IAAY,EAA4C,EAAE;QACvE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACpE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,OAAO,EAAE,CAAC;gBACd,IAAI,IAAI;oBAAE,MAAM,IAAI,CAAC,CAAC;qBACjB,CAAC;oBACL,OAAO,GAAG,IAAI,CAAC;oBACf,KAAK,IAAI,CAAC,CAAC;gBACZ,CAAC;YACF,CAAC;iBAAM,IAAI,CAAC,IAAI;gBAAE,KAAK,IAAI,CAAC,CAAC;;gBACxB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YAC9B,IAAI,MAAM,GAAG,KAAK,IAAI,KAAK,GAAG,KAAK;gBAAE,OAAO,IAAI,CAAC;YACjD,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;YAChB,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,IAAI,GAA6B;QACtC,IAAI,CAAC,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM;QAChC,OAAO,CAAC,KAAK;KACb,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;QACrC,KAAK,IAAI,QAAQ,GAAG,QAAQ,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;AAC7F,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAAC,MAAiB,EAAE,UAAkB;IACvD,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpE,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;IACnF,OAAO,MAAM,CAAC,IAAI,IAAI,UAAU,GAAG,GAAG,IAAI,MAAM,CAAC,IAAI,IAAI,UAAU,GAAG,GAAG,CAAC;AAC3E,CAAC"}