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

package/dist/core/huffman.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Length-limited canonical Huffman codes, for the DEFLATE compressor.
+ *
+ * Internal to core: `deflate.ts` is the only caller, and the tests reach it
+ * directly because a code that breaks the Kraft inequality is easier to catch
+ * here than as a stream zlib refuses.
+ *
+ * Lengths come from package-merge, which is optimal under a length limit
+ * (zlib's own construction is a heuristic that is usually but not always
+ * optimal). Every choice that could go either way is fixed: leaves are
+ * ordered by frequency and then by symbol, and a leaf sorts before a package
+ * of equal weight. So the same frequencies give the same code in every
+ * engine, which is the point of having this at all rather than the platform's
+ * compressor.
+ */
+/**
+ * Optimal code lengths no longer than `limit` bits.
+ *
+ * Symbols with a frequency of zero get length zero; a single used symbol gets
+ * length one. `limit` must leave room for every used symbol (2^limit of them).
+ */
+export declare function codeLengths(frequencies: ArrayLike<number>, limit: number): Uint8Array;
+/** The low `length` bits of `code`, in the opposite order. */
+export declare function reverseBits(code: number, length: number): number;
+/**
+ * The canonical code for each symbol (RFC 1951 section 3.2.2), bit-reversed
+ * because DEFLATE packs bits least significant first while Huffman codes are
+ * sent most significant first. Lengths up to 15.
+ */
+export declare function canonicalCodes(lengths: Uint8Array): Uint16Array;
+//# sourceMappingURL=huffman.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"huffman.d.ts","sourceRoot":"","sources":["../../src/core/huffman.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU,CAyErF;AAED,8DAA8D;AAC9D,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAIhE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,UAAU,GAAG,WAAW,CAkB/D"}

package/dist/core/huffman.js

@@ -0,0 +1,131 @@
+/**
+ * Length-limited canonical Huffman codes, for the DEFLATE compressor.
+ *
+ * Internal to core: `deflate.ts` is the only caller, and the tests reach it
+ * directly because a code that breaks the Kraft inequality is easier to catch
+ * here than as a stream zlib refuses.
+ *
+ * Lengths come from package-merge, which is optimal under a length limit
+ * (zlib's own construction is a heuristic that is usually but not always
+ * optimal). Every choice that could go either way is fixed: leaves are
+ * ordered by frequency and then by symbol, and a leaf sorts before a package
+ * of equal weight. So the same frequencies give the same code in every
+ * engine, which is the point of having this at all rather than the platform's
+ * compressor.
+ */
+/**
+ * Optimal code lengths no longer than `limit` bits.
+ *
+ * Symbols with a frequency of zero get length zero; a single used symbol gets
+ * length one. `limit` must leave room for every used symbol (2^limit of them).
+ */
+export function codeLengths(frequencies, limit) {
+    const size = frequencies.length;
+    const lengths = new Uint8Array(size);
+    const used = [];
+    for (let symbol = 0; symbol < size; symbol += 1) {
+        if (frequencies[symbol] > 0)
+            used.push(symbol);
+    }
+    const n = used.length;
+    if (!Number.isInteger(limit) || limit < 1 || limit > 30 || n > 1 << limit) {
+        throw new RangeError(`${n} symbols do not fit in codes of at most ${limit} bits`);
+    }
+    if (n === 0)
+        return lengths;
+    if (n === 1) {
+        lengths[used[0]] = 1;
+        return lengths;
+    }
+    used.sort((a, b) => frequencies[a] - frequencies[b] || a - b);
+    // Nodes 0..n-1 are the leaves in sorted order; later nodes are packages of
+    // two items from the list before.
+    const capacity = n + limit * n;
+    const weight = new Float64Array(capacity);
+    const left = new Int32Array(capacity).fill(-1);
+    const right = new Int32Array(capacity);
+    for (let i = 0; i < n; i += 1)
+        weight[i] = frequencies[used[i]];
+    let nodes = n;
+    // Only the 2n - 2 lightest items of any list can be chosen: every used
+    // symbol's coin is chosen at the top level, so the top list's packages use
+    // at most 2n - 4 items of the list below, and so on down.
+    const keep = 2 * n - 2;
+    let list = Array.from({ length: n }, (_, i) => i);
+    for (let level = 1; level < limit; level += 1) {
+        const merged = [];
+        const pairs = list.length >>> 1;
+        let leaf = 0;
+        let pair = 0;
+        let pending = -1;
+        while (merged.length < keep && (leaf < n || pair < pairs)) {
+            if (pending < 0 && pair < pairs) {
+                const a = list[2 * pair];
+                const b = list[2 * pair + 1];
+                weight[nodes] = weight[a] + weight[b];
+                left[nodes] = a;
+                right[nodes] = b;
+                pending = nodes;
+                nodes += 1;
+            }
+            if (leaf < n && (pending < 0 || weight[leaf] <= weight[pending])) {
+                merged.push(leaf);
+                leaf += 1;
+            }
+            else {
+                merged.push(pending);
+                pending = -1;
+                pair += 1;
+            }
+        }
+        list = merged;
+    }
+    // Each appearance of a leaf among the chosen items, directly or inside a
+    // package, is one bit of its code.
+    const stack = list.slice(0, keep);
+    while (stack.length > 0) {
+        const node = stack.pop();
+        if (left[node] < 0) {
+            const symbol = used[node];
+            lengths[symbol] = lengths[symbol] + 1;
+        }
+        else {
+            stack.push(left[node], right[node]);
+        }
+    }
+    return lengths;
+}
+/** The low `length` bits of `code`, in the opposite order. */
+export function reverseBits(code, length) {
+    let out = 0;
+    for (let i = 0; i < length; i += 1)
+        out = (out << 1) | ((code >>> i) & 1);
+    return out;
+}
+/**
+ * The canonical code for each symbol (RFC 1951 section 3.2.2), bit-reversed
+ * because DEFLATE packs bits least significant first while Huffman codes are
+ * sent most significant first. Lengths up to 15.
+ */
+export function canonicalCodes(lengths) {
+    const counts = new Uint16Array(16);
+    for (const length of lengths)
+        counts[length] = counts[length] + 1;
+    counts[0] = 0;
+    const next = new Uint16Array(16);
+    let code = 0;
+    for (let bits = 1; bits < 16; bits += 1) {
+        code = (code + counts[bits - 1]) << 1;
+        next[bits] = code;
+    }
+    const codes = new Uint16Array(lengths.length);
+    for (let symbol = 0; symbol < lengths.length; symbol += 1) {
+        const length = lengths[symbol];
+        if (length === 0)
+            continue;
+        codes[symbol] = reverseBits(next[length], length);
+        next[length] = next[length] + 1;
+    }
+    return codes;
+}
+//# sourceMappingURL=huffman.js.map

package/dist/core/huffman.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"huffman.js","sourceRoot":"","sources":["../../src/core/huffman.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,WAA8B,EAAE,KAAa;IACxE,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC;IAChC,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,IAAI,CAAC,EAAE,CAAC;QACjD,IAAK,WAAW,CAAC,MAAM,CAAY,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3E,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,2CAA2C,KAAK,OAAO,CAAC,CAAC;IACnF,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC,GAAG,CAAC,CAAC;QAC/B,OAAO,OAAO,CAAC;IAChB,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,WAAW,CAAC,CAAC,CAAY,GAAI,WAAW,CAAC,CAAC,CAAY,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAEtF,2EAA2E;IAC3E,kCAAkC;IAClC,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAW,CAAW,CAAC;IACpF,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,uEAAuE;IACvE,2EAA2E;IAC3E,0DAA0D;IAC1D,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,OAAO,MAAM,CAAC,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YAC3D,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;gBACjC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAW,CAAC;gBACnC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAW,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,GAAI,MAAM,CAAC,CAAC,CAAY,GAAI,MAAM,CAAC,CAAC,CAAY,CAAC;gBAC9D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAChB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACjB,OAAO,GAAG,KAAK,CAAC;gBAChB,KAAK,IAAI,CAAC,CAAC;YACZ,CAAC;YACD,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAK,MAAM,CAAC,IAAI,CAAY,IAAK,MAAM,CAAC,OAAO,CAAY,CAAC,EAAE,CAAC;gBAC1F,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,IAAI,IAAI,CAAC,CAAC;YACX,CAAC;iBAAM,CAAC;gBACP,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,CAAC,CAAC,CAAC;gBACb,IAAI,IAAI,CAAC,CAAC;YACX,CAAC;QACF,CAAC;QACD,IAAI,GAAG,MAAM,CAAC;IACf,CAAC;IAED,yEAAyE;IACzE,mCAAmC;IACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;QACnC,IAAK,IAAI,CAAC,IAAI,CAAY,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAW,CAAC;YACpC,OAAO,CAAC,MAAM,CAAC,GAAI,OAAO,CAAC,MAAM,CAAY,GAAG,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACP,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAW,EAAE,KAAK,CAAC,IAAI,CAAW,CAAC,CAAC;QACzD,CAAC;IACF,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,MAAc;IACvD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC;QAAE,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1E,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAmB;IACjD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IACnC,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,MAAM,CAAC,MAAM,CAAC,GAAI,MAAM,CAAC,MAAM,CAAY,GAAG,CAAC,CAAC;IAC9E,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACzC,IAAI,GAAG,CAAC,IAAI,GAAI,MAAM,CAAC,IAAI,GAAG,CAAC,CAAY,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACnB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9C,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,EAAE,CAAC;QAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAW,CAAC;QACzC,IAAI,MAAM,KAAK,CAAC;YAAE,SAAS;QAC3B,KAAK,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAW,EAAE,MAAM,CAAC,CAAC;QAC5D,IAAI,CAAC,MAAM,CAAC,GAAI,IAAI,CAAC,MAAM,CAAY,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC"}

package/dist/core/image.d.ts

@@ -0,0 +1,18 @@
+/**
+ * The pixel container every layer shares.
+ *
+ * Structurally an `ImageData`, so a canvas read-back passes straight in and a
+ * result can be handed to `putImageData` without copying. It lives here rather
+ * than in render or decode because each of those needs it and neither may
+ * import the other.
+ *
+ * Rows run top to bottom, four bytes a pixel, red first, and the alpha is
+ * straight rather than premultiplied, which is what both `ImageData` and PNG
+ * use.
+ */
+export interface RgbaImage {
+    readonly width: number;
+    readonly height: number;
+    readonly data: Uint8ClampedArray;
+}
+//# sourceMappingURL=image.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"image.d.ts","sourceRoot":"","sources":["../../src/core/image.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,SAAS;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;CACjC"}

package/dist/core/image.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=image.js.map

package/dist/core/image.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"image.js","sourceRoot":"","sources":["../../src/core/image.ts"],"names":[],"mappings":""}

package/dist/core/index.d.ts

@@ -0,0 +1,25 @@
+export { ArchiveMalformedError, ArchiveTooLargeError, CancelledError, ERROR_CODES, QrStudioError, RsDecodeError, TooMuchDataError, UnknownEntryError, isQrStudioError, } from './errors.js';
+export type { ErrorParams, QrStudioErrorCode, RsFailure } from './errors.js';
+export { attempt, attemptAsync, err, ok, unwrap } from './result.js';
+export type { Result } from './result.js';
+export { hasErrors, issue } from './issue.js';
+export type { Issue, IssueSeverity, MessageKey } from './issue.js';
+export { BitBuffer, BitReader } from './bits.js';
+export { BitMatrix } from './bit-matrix.js';
+export { QR_FIELD, binaryField, primeField } from './field.js';
+export type { Field } from './field.js';
+export { rsDecode, rsEncode } from './reed-solomon.js';
+export type { RsCode, RsDecodeOptions, RsDecoded } from './reed-solomon.js';
+export { bchEncode, bchNearest } from './bch.js';
+export { adler32, crc32 } from './checksums.js';
+export { deflateRaw, inflateRaw, zlibUnwrap, zlibWrap } from './deflate.js';
+export type { DeflateLevel, DeflateOptions, InflateOptions } from './deflate.js';
+export { writeZip } from './zip.js';
+export type { ZipEntry, ZipOptions } from './zip.js';
+export { createPrng } from './prng.js';
+export type { Prng } from './prng.js';
+export { Registry } from './registry.js';
+export type { RegistryEntry } from './registry.js';
+export { PI, TAU, atan2, cos, exp, hypot, ln, pow, sin } from './math.js';
+export type { RgbaImage } from './image.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,qBAAqB,EACrB,oBAAoB,EACpB,cAAc,EACd,WAAW,EACX,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,GACf,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,WAAW,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrE,YAAY,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAC9C,YAAY,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC/D,YAAY,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC5E,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAC5E,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACjF,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACpC,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,YAAY,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAC1E,YAAY,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC"}

package/dist/core/index.js

@@ -0,0 +1,15 @@
+export { ArchiveMalformedError, ArchiveTooLargeError, CancelledError, ERROR_CODES, QrStudioError, RsDecodeError, TooMuchDataError, UnknownEntryError, isQrStudioError, } from './errors.js';
+export { attempt, attemptAsync, err, ok, unwrap } from './result.js';
+export { hasErrors, issue } from './issue.js';
+export { BitBuffer, BitReader } from './bits.js';
+export { BitMatrix } from './bit-matrix.js';
+export { QR_FIELD, binaryField, primeField } from './field.js';
+export { rsDecode, rsEncode } from './reed-solomon.js';
+export { bchEncode, bchNearest } from './bch.js';
+export { adler32, crc32 } from './checksums.js';
+export { deflateRaw, inflateRaw, zlibUnwrap, zlibWrap } from './deflate.js';
+export { writeZip } from './zip.js';
+export { createPrng } from './prng.js';
+export { Registry } from './registry.js';
+export { PI, TAU, atan2, cos, exp, hypot, ln, pow, sin } from './math.js';
+//# sourceMappingURL=index.js.map

package/dist/core/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACN,qBAAqB,EACrB,oBAAoB,EACpB,cAAc,EACd,WAAW,EACX,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,GACf,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE/D,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAEvD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAE5E,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAEpC,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAEvC,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC"}

package/dist/core/issue.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Validation problems, as data.
+ *
+ * A design file with two bad colours, or a Wi-Fi form with no network name and
+ * a password that is too long, is not exceptional. It is the normal state of a
+ * form while somebody is typing into it. So validators return every problem
+ * they find as an `Issue` rather than throwing the first, and a view shows them
+ * beside the fields they belong to.
+ *
+ * An issue never carries a sentence. `code` is a `MessageKey`: the offline app
+ * looks it up in `src/messages/en.ts`, the website in its own locale files,
+ * and the two are kept in step by a test on each side. `params` carries the
+ * numbers a sentence needs, and never the value that was wrong: "this is 70
+ * characters and the limit is 63" is useful, and the 70 characters might be a
+ * password.
+ */
+/**
+ * A key into a message catalogue.
+ *
+ * Dotted and lowercase, `area.thing.detail`. Kept as a plain string type so
+ * that adding a registry entry does not mean editing a central union; the
+ * completeness of the catalogue is checked by test instead, which is the check
+ * that matters (a key with no sentence behind it shows up as raw text).
+ */
+export type MessageKey = string;
+export type IssueSeverity = 'error' | 'warning' | 'info';
+export interface Issue {
+    /** What is wrong, as a message key. */
+    readonly code: MessageKey;
+    /** Where, from the root of whatever was validated: `['fields', 'ssid']`. */
+    readonly path: readonly (string | number)[];
+    readonly severity: IssueSeverity;
+    /** Numbers and identifiers a sentence may use. Never the offending value. */
+    readonly params?: Readonly<Record<string, number | string>>;
+}
+export declare function issue(code: MessageKey, path: readonly (string | number)[], severity?: IssueSeverity, params?: Readonly<Record<string, number | string>>): Issue;
+/** True when any issue would stop the thing being used. Warnings and notes do not. */
+export declare function hasErrors(issues: readonly Issue[]): boolean;
+//# sourceMappingURL=issue.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"issue.d.ts","sourceRoot":"","sources":["../../src/core/issue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH;;;;;;;GAOG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,SAAS,GAAG,MAAM,CAAC;AAEzD,MAAM,WAAW,KAAK;IACrB,uCAAuC;IACvC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,4EAA4E;IAC5E,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;IAC5C,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC;IACjC,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;CAC5D;AAED,wBAAgB,KAAK,CACpB,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,EAClC,QAAQ,GAAE,aAAuB,EACjC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,GAChD,KAAK,CAEP;AAED,sFAAsF;AACtF,wBAAgB,SAAS,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,GAAG,OAAO,CAE3D"}

package/dist/core/issue.js

@@ -0,0 +1,24 @@
+/**
+ * Validation problems, as data.
+ *
+ * A design file with two bad colours, or a Wi-Fi form with no network name and
+ * a password that is too long, is not exceptional. It is the normal state of a
+ * form while somebody is typing into it. So validators return every problem
+ * they find as an `Issue` rather than throwing the first, and a view shows them
+ * beside the fields they belong to.
+ *
+ * An issue never carries a sentence. `code` is a `MessageKey`: the offline app
+ * looks it up in `src/messages/en.ts`, the website in its own locale files,
+ * and the two are kept in step by a test on each side. `params` carries the
+ * numbers a sentence needs, and never the value that was wrong: "this is 70
+ * characters and the limit is 63" is useful, and the 70 characters might be a
+ * password.
+ */
+export function issue(code, path, severity = 'error', params) {
+    return params === undefined ? { code, path, severity } : { code, path, severity, params };
+}
+/** True when any issue would stop the thing being used. Warnings and notes do not. */
+export function hasErrors(issues) {
+    return issues.some((found) => found.severity === 'error');
+}
+//# sourceMappingURL=issue.js.map

package/dist/core/issue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"issue.js","sourceRoot":"","sources":["../../src/core/issue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAwBH,MAAM,UAAU,KAAK,CACpB,IAAgB,EAChB,IAAkC,EAClC,WAA0B,OAAO,EACjC,MAAkD;IAElD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC3F,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,SAAS,CAAC,MAAwB;IACjD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;AAC3D,CAAC"}

package/dist/core/math.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Deterministic replacements for the transcendental members of Math.
+ *
+ * ECMAScript specifies `+ - * /` and `Math.sqrt` to IEEE 754 exactly and
+ * leaves sin, cos, atan2, exp, log, pow and hypot "implementation-approximated".
+ * V8, JavaScriptCore and SpiderMonkey really do differ in the last place, and
+ * one disagreement in a curve flattening step moves an anti-aliased edge by a
+ * level, the strict reader thresholds that edge, and the scan check gives a
+ * different verdict in Safari than in Chrome. So everything here is built from
+ * the specified operations alone, plus `Math.abs`, `Math.round` and integer
+ * BigInt arithmetic, which are exact. The results are the same in every
+ * engine, and accurate to better than 1e-12 relative (in practice within a
+ * few units in the last place).
+ *
+ * The algorithms are the classical ones, after fdlibm: Cody-Waite range
+ * reduction with pi/2 split into three 33 bit pieces, exp and log reduced by
+ * ln 2, atan reduced by a table of atan(i/8). The polynomial kernels use
+ * Taylor coefficients, exact rationals, with enough terms that truncation sits
+ * far below rounding; that costs a few multiplications over a minimax fit and
+ * means no coefficient here rests on anybody's memory of a table. The
+ * constants that are not rationals are derived from series in the tests.
+ *
+ * Domains: sin and cos take any finite argument (beyond about 1.6 million the
+ * reduction is done exactly in BigInt against 2/pi to 1216 bits, the way
+ * fdlibm's Payne-Hanek path does it in floating point); atan2, hypot, exp and
+ * ln follow Math for every input, special values included; pow takes a base
+ * of zero or more (see its comment).
+ */
+export declare const PI = 3.141592653589793;
+export declare const TAU = 6.283185307179586;
+export declare function sin(x: number): number;
+export declare function cos(x: number): number;
+/** atan(y / x) in the right quadrant, matching Math.atan2 on every special value, signed zeros included. */
+export declare function atan2(y: number, x: number): number;
+/**
+ * sqrt(x^2 + y^2) without overflow or underflow on the way: both are scaled
+ * by a power of two (exactly) when the larger is far from 1. Matches
+ * Math.hypot on special values: Infinity wins over NaN.
+ */
+export declare function hypot(x: number, y: number): number;
+export declare function exp(x: number): number;
+export declare function ln(x: number): number;
+/**
+ * base^exponent for base >= 0.
+ *
+ * A negative base throws RangeError: every use in this package raises a length
+ * or a ratio, a negative one is a bug, and a NaN would travel silently into an
+ * export. A zero base, of either sign, is treated as +0. Everything else
+ * matches Math.pow, including pow(1, Infinity) being NaN and pow(NaN, 0) being
+ * 1. Integer exponents up to 64 in size give exact results whenever the exact
+ * result is a double; otherwise the result is exp(exponent ln base) carried in
+ * double-double, which keeps it within about 1e-14 relative even at the edges
+ * of the range.
+ */
+export declare function pow(base: number, exponent: number): number;
+//# sourceMappingURL=math.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../src/core/math.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,eAAO,MAAM,EAAE,oBAAoB,CAAC;AACpC,eAAO,MAAM,GAAG,oBAAoB,CAAC;AAuOrC,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAerC;AAED,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAerC;AA4CD,4GAA4G;AAC5G,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CA2BlD;AA4BD;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAclD;AAmDD,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAKrC;AAmED,wBAAgB,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAKpC;AAiCD;;;;;;;;;;;GAWG;AACH,wBAAgB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAwB1D"}