tempest-react-sdk 0.27.0 → 0.28.0

package/dist/components/QRCode/qr-encode.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"qr-encode.cjs","names":[],"sources":["../../../src/components/QRCode/qr-encode.ts"],"sourcesContent":["import {\n    ALPHANUMERIC_CHARS,\n    alignmentPatternPositions,\n    dataCodewords,\n    ECC_BLOCK_COUNT,\n    ECC_CODEWORDS_PER_BLOCK,\n    ECC_FORMAT_BITS,\n    MAX_VERSION,\n    MIN_VERSION,\n    rawDataModules,\n    type QRErrorCorrection,\n} from \"./qr-tables\";\n\nexport type { QRErrorCorrection };\n\n/** How the payload is packed into bits. */\nexport type QRMode = \"numeric\" | \"alphanumeric\" | \"byte\";\n\nexport interface QRMatrix {\n    /** Side length in modules, including no quiet zone. */\n    size: number;\n    /** Row-major modules; `true` is dark. */\n    modules: boolean[][];\n    /** Symbol version, 1 to 40. */\n    version: number;\n    /** Level the symbol was encoded at. */\n    level: QRErrorCorrection;\n    /** The mode chosen for the payload. */\n    mode: QRMode;\n    /** Which of the eight masks scored best. */\n    mask: number;\n}\n\nexport interface QREncodeOptions {\n    /** Error correction level. Default `\"M\"`. */\n    level?: QRErrorCorrection;\n    /**\n     * Force a minimum version. The encoder still grows past it when the payload\n     * does not fit — a version is a floor, never a cap that silently truncates.\n     */\n    minVersion?: number;\n}\n\n/** Raised when a payload cannot be encoded at the requested level. */\nexport class QRCapacityError extends Error {\n    constructor(\n        readonly length: number,\n        readonly level: QRErrorCorrection,\n    ) {\n        super(\n            `Payload of ${length} bytes does not fit in a version-${MAX_VERSION} QR symbol at level ${level}. ` +\n                \"Shorten the data, or drop to a lower correction level.\",\n        );\n        this.name = \"QRCapacityError\";\n    }\n}\n\nconst MODE_INDICATOR: Record<QRMode, number> = { numeric: 1, alphanumeric: 2, byte: 4 };\n\nconst NUMERIC_RE = /^[0-9]*$/;\nconst ALPHANUMERIC_RE = /^[0-9A-Z $%*+\\-./:]*$/;\n\n/**\n * Pick the densest mode the payload qualifies for.\n *\n * Numeric packs 3 digits into 10 bits and alphanumeric 2 characters into 11, so\n * a phone number or an upper-case code encodes far smaller than the same string\n * as bytes — often a whole version smaller, which is a visibly coarser symbol\n * and therefore easier to scan.\n *\n * @param text - The payload.\n * @returns The narrowest mode that can represent it.\n */\nexport function selectMode(text: string): QRMode {\n    if (NUMERIC_RE.test(text)) return \"numeric\";\n    if (ALPHANUMERIC_RE.test(text)) return \"alphanumeric\";\n    return \"byte\";\n}\n\n/** Bits the character-count field takes, which widens with the version. */\nfunction charCountBits(mode: QRMode, version: number): number {\n    const tier = version <= 9 ? 0 : version <= 26 ? 1 : 2;\n    if (mode === \"numeric\") return [10, 12, 14][tier];\n    if (mode === \"alphanumeric\") return [9, 11, 13][tier];\n    return [8, 16, 16][tier];\n}\n\n/** A bit sink that appends most-significant-bit first. */\nclass BitBuffer {\n    readonly bits: number[] = [];\n\n    append(value: number, length: number) {\n        for (let i = length - 1; i >= 0; i--) this.bits.push((value >>> i) & 1);\n    }\n\n    get length(): number {\n        return this.bits.length;\n    }\n}\n\n/** UTF-8 bytes for the byte mode, so accents and emoji survive the round trip. */\nfunction utf8Bytes(text: string): number[] {\n    return Array.from(new TextEncoder().encode(text));\n}\n\n/** Bits the payload itself occupies in a given mode, excluding the headers. */\nfunction payloadBits(text: string, mode: QRMode): number {\n    if (mode === \"numeric\") {\n        const groups = Math.floor(text.length / 3);\n        const rest = text.length % 3;\n        return groups * 10 + (rest === 0 ? 0 : rest === 1 ? 4 : 7);\n    }\n    if (mode === \"alphanumeric\") {\n        return Math.floor(text.length / 2) * 11 + (text.length % 2) * 6;\n    }\n    return utf8Bytes(text).length * 8;\n}\n\n/** Write the payload into the buffer in the chosen mode. */\nfunction writePayload(buffer: BitBuffer, text: string, mode: QRMode) {\n    if (mode === \"numeric\") {\n        for (let i = 0; i < text.length; i += 3) {\n            const chunk = text.slice(i, i + 3);\n            buffer.append(Number(chunk), chunk.length * 3 + 1);\n        }\n        return;\n    }\n    if (mode === \"alphanumeric\") {\n        for (let i = 0; i < text.length; i += 2) {\n            const first = ALPHANUMERIC_CHARS.indexOf(text[i]);\n            if (i + 1 === text.length) {\n                buffer.append(first, 6);\n            } else {\n                buffer.append(first * 45 + ALPHANUMERIC_CHARS.indexOf(text[i + 1]), 11);\n            }\n        }\n        return;\n    }\n    for (const byte of utf8Bytes(text)) buffer.append(byte, 8);\n}\n\n/** Character count for the header, which is bytes — not characters — in byte mode. */\nfunction headerCount(text: string, mode: QRMode): number {\n    return mode === \"byte\" ? utf8Bytes(text).length : text.length;\n}\n\n/**\n * The smallest version that fits the payload at this level.\n *\n * @throws {QRCapacityError} When even version 40 is too small.\n */\nfunction selectVersion(\n    text: string,\n    mode: QRMode,\n    level: QRErrorCorrection,\n    minVersion: number,\n): number {\n    const bits = payloadBits(text, mode);\n    for (let version = Math.max(MIN_VERSION, minVersion); version <= MAX_VERSION; version++) {\n        const capacity = dataCodewords(version, level) * 8;\n        if (4 + charCountBits(mode, version) + bits <= capacity) return version;\n    }\n    throw new QRCapacityError(headerCount(text, mode), level);\n}\n\n// ── Reed-Solomon over GF(256), primitive polynomial 0x11D ───────────────────\n\nconst GF_EXP = new Uint8Array(512);\nconst GF_LOG = new Uint8Array(256);\n\n{\n    let x = 1;\n    for (let i = 0; i < 255; i++) {\n        GF_EXP[i] = x;\n        GF_LOG[x] = i;\n        x = (x << 1) ^ (x & 0x80 ? 0x11d : 0);\n    }\n    for (let i = 255; i < 512; i++) GF_EXP[i] = GF_EXP[i - 255];\n}\n\nfunction gfMul(a: number, b: number): number {\n    if (a === 0 || b === 0) return 0;\n    return GF_EXP[GF_LOG[a] + GF_LOG[b]];\n}\n\n/** The generator polynomial for `degree` error-correction codewords. */\nfunction rsGenerator(degree: number): number[] {\n    let poly = [1];\n    for (let i = 0; i < degree; i++) {\n        const next = new Array<number>(poly.length + 1).fill(0);\n        for (let j = 0; j < poly.length; j++) {\n            next[j] ^= poly[j];\n            next[j + 1] ^= gfMul(poly[j], GF_EXP[i]);\n        }\n        poly = next;\n    }\n    return poly;\n}\n\n/**\n * The error-correction codewords for one block.\n *\n * @param data - The block's data codewords.\n * @param degree - How many correction codewords to produce.\n * @returns The remainder of the polynomial division, which is the ECC block.\n */\nexport function reedSolomon(data: readonly number[], degree: number): number[] {\n    const generator = rsGenerator(degree);\n    const remainder = new Array<number>(degree).fill(0);\n    for (const byte of data) {\n        const factor = byte ^ remainder[0];\n        remainder.shift();\n        remainder.push(0);\n        for (let i = 0; i < degree; i++) {\n            remainder[i] ^= gfMul(generator[i + 1], factor);\n        }\n    }\n    return remainder;\n}\n\n/**\n * Split into blocks, add correction, and interleave into the final codeword\n * stream.\n *\n * Interleaving is what makes the correction useful against a real-world smudge:\n * a contiguous scratch on the printed symbol then damages a few codewords of\n * every block instead of destroying one block completely.\n */\nfunction buildCodewords(\n    data: readonly number[],\n    version: number,\n    level: QRErrorCorrection,\n): number[] {\n    const blockCount = ECC_BLOCK_COUNT[level][version - 1];\n    const eccPerBlock = ECC_CODEWORDS_PER_BLOCK[level][version - 1];\n    const totalCodewords = Math.floor(rawDataModules(version) / 8);\n    const shortBlockLength = Math.floor(totalCodewords / blockCount) - eccPerBlock;\n    const longBlockCount = totalCodewords % blockCount;\n\n    const dataBlocks: number[][] = [];\n    const eccBlocks: number[][] = [];\n    let offset = 0;\n    for (let i = 0; i < blockCount; i++) {\n        const length = shortBlockLength + (i >= blockCount - longBlockCount ? 1 : 0);\n        const block = data.slice(offset, offset + length);\n        offset += length;\n        dataBlocks.push(block);\n        eccBlocks.push(reedSolomon(block, eccPerBlock));\n    }\n\n    const result: number[] = [];\n    for (let i = 0; i < shortBlockLength + 1; i++) {\n        for (const block of dataBlocks) {\n            if (i < block.length) result.push(block[i]);\n        }\n    }\n    for (let i = 0; i < eccPerBlock; i++) {\n        for (const block of eccBlocks) result.push(block[i]);\n    }\n    return result;\n}\n\n// ── Matrix construction ─────────────────────────────────────────────────────\n\n/** A grid under construction: modules plus which cells are function patterns. */\ninterface Canvas {\n    size: number;\n    modules: boolean[][];\n    reserved: boolean[][];\n}\n\nfunction createCanvas(version: number): Canvas {\n    const size = version * 4 + 17;\n    return {\n        size,\n        modules: Array.from({ length: size }, () => new Array<boolean>(size).fill(false)),\n        reserved: Array.from({ length: size }, () => new Array<boolean>(size).fill(false)),\n    };\n}\n\nfunction setModule(canvas: Canvas, x: number, y: number, dark: boolean, reserve = true) {\n    if (x < 0 || y < 0 || x >= canvas.size || y >= canvas.size) return;\n    canvas.modules[y][x] = dark;\n    if (reserve) canvas.reserved[y][x] = true;\n}\n\n/** A finder pattern with its separator, anchored at a corner. */\nfunction drawFinder(canvas: Canvas, left: number, top: number) {\n    for (let dy = -1; dy <= 7; dy++) {\n        for (let dx = -1; dx <= 7; dx++) {\n            const distance = Math.max(Math.abs(dx - 3), Math.abs(dy - 3));\n            setModule(canvas, left + dx, top + dy, distance !== 2 && distance <= 3);\n        }\n    }\n}\n\nfunction drawAlignment(canvas: Canvas, cx: number, cy: number) {\n    for (let dy = -2; dy <= 2; dy++) {\n        for (let dx = -2; dx <= 2; dx++) {\n            setModule(canvas, cx + dx, cy + dy, Math.max(Math.abs(dx), Math.abs(dy)) !== 1);\n        }\n    }\n}\n\nfunction drawFunctionPatterns(canvas: Canvas, version: number) {\n    drawFinder(canvas, 0, 0);\n    drawFinder(canvas, canvas.size - 7, 0);\n    drawFinder(canvas, 0, canvas.size - 7);\n\n    for (let i = 8; i < canvas.size - 8; i++) {\n        const dark = i % 2 === 0;\n        setModule(canvas, i, 6, dark);\n        setModule(canvas, 6, i, dark);\n    }\n\n    const positions = alignmentPatternPositions(version);\n    for (const cy of positions) {\n        for (const cx of positions) {\n            // The three corners already hold finder patterns.\n            const atFinder =\n                (cx === 6 && cy === 6) ||\n                (cx === 6 && cy === canvas.size - 7) ||\n                (cx === canvas.size - 7 && cy === 6);\n            if (!atFinder) drawAlignment(canvas, cx, cy);\n        }\n    }\n\n    // Reserve the format information, and light the always-dark module.\n    for (let i = 0; i < 9; i++) {\n        setModule(canvas, i, 8, false);\n        setModule(canvas, 8, i, false);\n    }\n    for (let i = 0; i < 8; i++) {\n        setModule(canvas, canvas.size - 1 - i, 8, false);\n        setModule(canvas, 8, canvas.size - 1 - i, false);\n    }\n    setModule(canvas, 8, canvas.size - 8, true);\n\n    if (version >= 7) {\n        const value = versionInformation(version);\n        for (let i = 0; i < 18; i++) {\n            const bit = ((value >>> i) & 1) === 1;\n            const a = canvas.size - 11 + (i % 3);\n            const b = Math.floor(i / 3);\n            setModule(canvas, a, b, bit);\n            setModule(canvas, b, a, bit);\n        }\n    }\n}\n\n/** The 18-bit version information block, BCH(18,6) with generator 0x1F25. */\nfunction versionInformation(version: number): number {\n    let remainder = version;\n    for (let i = 0; i < 12; i++) {\n        remainder = (remainder << 1) ^ ((remainder >>> 11) * 0x1f25);\n    }\n    return (version << 12) | remainder;\n}\n\n/** The 15-bit format information, BCH(15,5) masked with 0x5412. */\nfunction formatInformation(level: QRErrorCorrection, mask: number): number {\n    const data = (ECC_FORMAT_BITS[level] << 3) | mask;\n    let remainder = data;\n    for (let i = 0; i < 10; i++) {\n        remainder = (remainder << 1) ^ ((remainder >>> 9) * 0x537);\n    }\n    return ((data << 10) | remainder) ^ 0x5412;\n}\n\nfunction drawFormatInformation(canvas: Canvas, level: QRErrorCorrection, mask: number) {\n    const bits = formatInformation(level, mask);\n\n    for (let i = 0; i <= 5; i++) setModule(canvas, 8, i, ((bits >>> i) & 1) === 1);\n    setModule(canvas, 8, 7, ((bits >>> 6) & 1) === 1);\n    setModule(canvas, 8, 8, ((bits >>> 7) & 1) === 1);\n    setModule(canvas, 7, 8, ((bits >>> 8) & 1) === 1);\n    for (let i = 9; i < 15; i++) setModule(canvas, 14 - i, 8, ((bits >>> i) & 1) === 1);\n\n    for (let i = 0; i < 8; i++) {\n        setModule(canvas, canvas.size - 1 - i, 8, ((bits >>> i) & 1) === 1);\n    }\n    for (let i = 8; i < 15; i++) {\n        setModule(canvas, 8, canvas.size - 15 + i, ((bits >>> i) & 1) === 1);\n    }\n    setModule(canvas, 8, canvas.size - 8, true);\n}\n\n/**\n * Lay the codeword stream into the free modules.\n *\n * The path is a boustrophedon over two-module columns from the bottom-right\n * corner, skipping the vertical timing pattern in column 6 entirely — that\n * column would otherwise shift every subsequent column by one.\n */\nfunction drawCodewords(canvas: Canvas, codewords: readonly number[]) {\n    let bitIndex = 0;\n    let upward = true;\n\n    for (let right = canvas.size - 1; right >= 1; right -= 2) {\n        if (right === 6) right = 5;\n        for (let step = 0; step < canvas.size; step++) {\n            const y = upward ? canvas.size - 1 - step : step;\n            for (let column = 0; column < 2; column++) {\n                const x = right - column;\n                if (canvas.reserved[y][x]) continue;\n                const byte = codewords[bitIndex >>> 3];\n                // Remainder bits past the stream are light, per the standard.\n                canvas.modules[y][x] =\n                    byte !== undefined && ((byte >>> (7 - (bitIndex & 7))) & 1) === 1;\n                bitIndex++;\n            }\n        }\n        upward = !upward;\n    }\n}\n\nconst MASK_FUNCTIONS: readonly ((x: number, y: number) => boolean)[] = [\n    (x, y) => (x + y) % 2 === 0,\n    (_x, y) => y % 2 === 0,\n    (x) => x % 3 === 0,\n    (x, y) => (x + y) % 3 === 0,\n    (x, y) => (Math.floor(y / 2) + Math.floor(x / 3)) % 2 === 0,\n    (x, y) => ((x * y) % 2) + ((x * y) % 3) === 0,\n    (x, y) => (((x * y) % 2) + ((x * y) % 3)) % 2 === 0,\n    (x, y) => (((x + y) % 2) + ((x * y) % 3)) % 2 === 0,\n];\n\nfunction applyMask(canvas: Canvas, mask: number) {\n    const fn = MASK_FUNCTIONS[mask];\n    for (let y = 0; y < canvas.size; y++) {\n        for (let x = 0; x < canvas.size; x++) {\n            if (!canvas.reserved[y][x] && fn(x, y)) canvas.modules[y][x] = !canvas.modules[y][x];\n        }\n    }\n}\n\n/**\n * Score a masked symbol; lower is better.\n *\n * The four penalties push away from patterns a scanner confuses with the finder\n * marks, and from large flat areas where it cannot lock on.\n */\nfunction penalty(canvas: Canvas): number {\n    const { size, modules } = canvas;\n    let score = 0;\n\n    const runPenalty = (run: number) => (run >= 5 ? 3 + (run - 5) : 0);\n\n    for (let y = 0; y < size; y++) {\n        let run = 1;\n        for (let x = 1; x < size; x++) {\n            if (modules[y][x] === modules[y][x - 1]) run++;\n            else {\n                score += runPenalty(run);\n                run = 1;\n            }\n        }\n        score += runPenalty(run);\n    }\n    for (let x = 0; x < size; x++) {\n        let run = 1;\n        for (let y = 1; y < size; y++) {\n            if (modules[y][x] === modules[y - 1][x]) run++;\n            else {\n                score += runPenalty(run);\n                run = 1;\n            }\n        }\n        score += runPenalty(run);\n    }\n\n    for (let y = 0; y < size - 1; y++) {\n        for (let x = 0; x < size - 1; x++) {\n            const cell = modules[y][x];\n            if (\n                cell === modules[y][x + 1] &&\n                cell === modules[y + 1][x] &&\n                cell === modules[y + 1][x + 1]\n            ) {\n                score += 3;\n            }\n        }\n    }\n\n    // 1:1:3:1:1 with four light modules on either side — the finder's signature.\n    const FINDER = [true, false, true, true, true, false, true];\n    const matchesAt = (line: readonly boolean[], at: number): boolean => {\n        for (let i = 0; i < FINDER.length; i++) {\n            if (line[at + i] !== FINDER[i]) return false;\n        }\n        const before = line.slice(Math.max(0, at - 4), at);\n        const after = line.slice(at + 7, at + 11);\n        const clear = (part: readonly boolean[]) => part.length === 4 && part.every((m) => !m);\n        return clear(before) || clear(after);\n    };\n\n    for (let i = 0; i < size; i++) {\n        const row = modules[i];\n        const column = modules.map((line) => line[i]);\n        for (let at = 0; at + 7 <= size; at++) {\n            if (matchesAt(row, at)) score += 40;\n            if (matchesAt(column, at)) score += 40;\n        }\n    }\n\n    let dark = 0;\n    for (const row of modules) for (const cell of row) if (cell) dark++;\n    const percent = (dark * 100) / (size * size);\n    score += Math.floor(Math.abs(percent - 50) / 5) * 10;\n\n    return score;\n}\n\nfunction cloneCanvas(canvas: Canvas): Canvas {\n    return {\n        size: canvas.size,\n        modules: canvas.modules.map((row) => [...row]),\n        reserved: canvas.reserved.map((row) => [...row]),\n    };\n}\n\n/**\n * Encode text into a QR matrix.\n *\n * The whole pipeline of ISO/IEC 18004: pick the densest mode the payload\n * qualifies for, pick the smallest version that fits, build the bit stream, add\n * Reed-Solomon correction, interleave the blocks, lay the modules out, then try\n * all eight masks and keep the one the standard's penalty function likes best.\n *\n * @param text - The payload. Byte mode encodes it as UTF-8.\n * @param options - Level and an optional version floor.\n * @returns The finished matrix, without a quiet zone.\n * @throws {QRCapacityError} When the payload does not fit at that level.\n *\n * @example\n * const qr = encodeQR(\"https://tempest.dev\", { level: \"Q\" });\n * qr.modules[0][0]; // true — top-left of the finder pattern\n */\nexport function encodeQR(text: string, options: QREncodeOptions = {}): QRMatrix {\n    const { level = \"M\", minVersion = MIN_VERSION } = options;\n    const mode = selectMode(text);\n    const version = selectVersion(text, mode, level, minVersion);\n\n    const buffer = new BitBuffer();\n    buffer.append(MODE_INDICATOR[mode], 4);\n    buffer.append(headerCount(text, mode), charCountBits(mode, version));\n    writePayload(buffer, text, mode);\n\n    const capacity = dataCodewords(version, level) * 8;\n    buffer.append(0, Math.min(4, capacity - buffer.length));\n    buffer.append(0, (8 - (buffer.length % 8)) % 8);\n\n    const data: number[] = [];\n    for (let i = 0; i < buffer.length; i += 8) {\n        let byte = 0;\n        for (let j = 0; j < 8; j++) byte = (byte << 1) | buffer.bits[i + j];\n        data.push(byte);\n    }\n    // The two alternating pad bytes are prescribed, not arbitrary filler.\n    for (let pad = 0xec; data.length < capacity / 8; pad ^= 0xec ^ 0x11) data.push(pad);\n\n    const codewords = buildCodewords(data, version, level);\n\n    const base = createCanvas(version);\n    drawFunctionPatterns(base, version);\n    drawCodewords(base, codewords);\n\n    let best: Canvas | null = null;\n    let bestMask = 0;\n    let bestScore = Number.POSITIVE_INFINITY;\n    for (let mask = 0; mask < 8; mask++) {\n        const candidate = cloneCanvas(base);\n        applyMask(candidate, mask);\n        drawFormatInformation(candidate, level, mask);\n        const score = penalty(candidate);\n        if (score < bestScore) {\n            bestScore = score;\n            bestMask = mask;\n            best = candidate;\n        }\n    }\n\n    const chosen = best as Canvas;\n    return {\n        size: chosen.size,\n        modules: chosen.modules,\n        version,\n        level,\n        mode,\n        mask: bestMask,\n    };\n}\n\n/**\n * The matrix as an SVG path, one `M…h…v…h…z` rectangle per dark module.\n *\n * A path beats one `<rect>` per module: a version-10 symbol is 3 481 modules,\n * and that many elements is a real cost to parse and to paint. Coordinates are\n * whole numbers in module space, so the shape stays crisp at any size.\n *\n * @param matrix - An encoded matrix.\n * @param margin - Quiet zone in modules. The standard asks for 4.\n * @returns The `d` attribute, empty when there is nothing dark.\n */\nexport function matrixToPath(matrix: QRMatrix, margin = 4): string {\n    const parts: string[] = [];\n    for (let y = 0; y < matrix.size; y++) {\n        let runStart = -1;\n        for (let x = 0; x <= matrix.size; x++) {\n            const dark = x < matrix.size && matrix.modules[y][x];\n            if (dark && runStart === -1) runStart = x;\n            if (!dark && runStart !== -1) {\n                // Merge each horizontal run into one rectangle.\n                parts.push(\n                    `M${runStart + margin} ${y + margin}h${x - runStart}v1h-${x - runStart}z`,\n                );\n                runStart = -1;\n            }\n        }\n    }\n    return parts.join(\"\");\n}\n"],"mappings":"mCA4CA,IAAa,EAAb,cAAqC,KAAM,CAE1B,OACA,MAFb,YACI,EACA,EACF,CACE,MACI,cAAc,EAAO,yDAAqE,EAAM,yDAEpG,EANS,KAAA,OAAA,EACA,KAAA,MAAA,EAMT,KAAK,KAAO,iBAChB,CACJ,EAEM,EAAyC,CAAE,QAAS,EAAG,aAAc,EAAG,KAAM,CAAE,EAEhF,EAAa,WACb,EAAkB,wBAaxB,SAAgB,EAAW,EAAsB,CAG7C,OAFI,EAAW,KAAK,CAAI,EAAU,UAC9B,EAAgB,KAAK,CAAI,EAAU,eAChC,MACX,CAGA,SAAS,EAAc,EAAc,EAAyB,CAC1D,IAAM,EAAO,GAAW,EAAI,EAAI,GAAW,GAAK,EAAI,EAGpD,OAFI,IAAS,UAAkB,CAAC,GAAI,GAAI,EAAE,CAAC,CAAC,GACxC,IAAS,eAAuB,CAAC,EAAG,GAAI,EAAE,CAAC,CAAC,GACzC,CAAC,EAAG,GAAI,EAAE,CAAC,CAAC,EACvB,CAGA,IAAM,EAAN,KAAgB,CACZ,KAA0B,CAAC,EAE3B,OAAO,EAAe,EAAgB,CAClC,IAAK,IAAI,EAAI,EAAS,EAAG,GAAK,EAAG,IAAK,KAAK,KAAK,KAAM,IAAU,EAAK,CAAC,CAC1E,CAEA,IAAI,QAAiB,CACjB,OAAO,KAAK,KAAK,MACrB,CACJ,EAGA,SAAS,EAAU,EAAwB,CACvC,OAAO,MAAM,KAAK,IAAI,YAAY,CAAC,CAAC,OAAO,CAAI,CAAC,CACpD,CAGA,SAAS,EAAY,EAAc,EAAsB,CACrD,GAAI,IAAS,UAAW,CACpB,IAAM,EAAS,KAAK,MAAM,EAAK,OAAS,CAAC,EACnC,EAAO,EAAK,OAAS,EAC3B,OAAO,EAAS,IAAM,IAAS,EAAI,EAAI,IAAS,EAAI,EAAI,EAC5D,CAIA,OAHI,IAAS,eACF,KAAK,MAAM,EAAK,OAAS,CAAC,EAAI,GAAM,EAAK,OAAS,EAAK,EAE3D,EAAU,CAAI,CAAC,CAAC,OAAS,CACpC,CAGA,SAAS,EAAa,EAAmB,EAAc,EAAc,CACjE,GAAI,IAAS,UAAW,CACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,GAAK,EAAG,CACrC,IAAM,EAAQ,EAAK,MAAM,EAAG,EAAI,CAAC,EACjC,EAAO,OAAO,OAAO,CAAK,EAAG,EAAM,OAAS,EAAI,CAAC,CACrD,CACA,MACJ,CACA,GAAI,IAAS,eAAgB,CACzB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,GAAK,EAAG,CACrC,IAAM,EAAQ,EAAA,mBAAmB,QAAQ,EAAK,EAAE,EAC5C,EAAI,IAAM,EAAK,OACf,EAAO,OAAO,EAAO,CAAC,EAEtB,EAAO,OAAO,EAAQ,GAAK,EAAA,mBAAmB,QAAQ,EAAK,EAAI,EAAE,EAAG,EAAE,CAE9E,CACA,MACJ,CACA,IAAK,IAAM,KAAQ,EAAU,CAAI,EAAG,EAAO,OAAO,EAAM,CAAC,CAC7D,CAGA,SAAS,EAAY,EAAc,EAAsB,CACrD,OAAO,IAAS,OAAS,EAAU,CAAI,CAAC,CAAC,OAAS,EAAK,MAC3D,CAOA,SAAS,EACL,EACA,EACA,EACA,EACM,CACN,IAAM,EAAO,EAAY,EAAM,CAAI,EACnC,IAAK,IAAI,EAAU,KAAK,IAAA,EAAiB,CAAU,EAAG,GAAA,GAAwB,IAAW,CACrF,IAAM,EAAW,EAAA,cAAc,EAAS,CAAK,EAAI,EACjD,GAAI,EAAI,EAAc,EAAM,CAAO,EAAI,GAAQ,EAAU,OAAO,CACpE,CACA,MAAM,IAAI,EAAgB,EAAY,EAAM,CAAI,EAAG,CAAK,CAC5D,CAIA,IAAM,EAAS,IAAI,WAAW,GAAG,EAC3B,EAAS,IAAI,WAAW,GAAG,EAEjC,CACI,IAAI,EAAI,EACR,IAAK,IAAI,EAAI,EAAG,EAAI,IAAK,IACrB,EAAO,GAAK,EACZ,EAAO,GAAK,EACZ,EAAK,GAAK,GAAM,EAAI,IAAO,IAAQ,GAEvC,IAAK,IAAI,EAAI,IAAK,EAAI,IAAK,IAAK,EAAO,GAAK,EAAO,EAAI,IAC3D,CAEA,SAAS,EAAM,EAAW,EAAmB,CAEzC,OADI,IAAM,GAAK,IAAM,EAAU,EACxB,EAAO,EAAO,GAAK,EAAO,GACrC,CAGA,SAAS,EAAY,EAA0B,CAC3C,IAAI,EAAO,CAAC,CAAC,EACb,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IAAK,CAC7B,IAAM,EAAW,MAAc,EAAK,OAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EACtD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC7B,EAAK,IAAM,EAAK,GAChB,EAAK,EAAI,IAAM,EAAM,EAAK,GAAI,EAAO,EAAE,EAE3C,EAAO,CACX,CACA,OAAO,CACX,CASA,SAAgB,EAAY,EAAyB,EAA0B,CAC3E,IAAM,EAAY,EAAY,CAAM,EAC9B,EAAgB,MAAc,CAAM,CAAC,CAAC,KAAK,CAAC,EAClD,IAAK,IAAM,KAAQ,EAAM,CACrB,IAAM,EAAS,EAAO,EAAU,GAChC,EAAU,MAAM,EAChB,EAAU,KAAK,CAAC,EAChB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,IACxB,EAAU,IAAM,EAAM,EAAU,EAAI,GAAI,CAAM,CAEtD,CACA,OAAO,CACX,CAUA,SAAS,EACL,EACA,EACA,EACQ,CACR,IAAM,EAAa,EAAA,gBAAgB,EAAM,CAAC,EAAU,GAC9C,EAAc,EAAA,wBAAwB,EAAM,CAAC,EAAU,GACvD,EAAiB,KAAK,MAAM,EAAA,eAAe,CAAO,EAAI,CAAC,EACvD,EAAmB,KAAK,MAAM,EAAiB,CAAU,EAAI,EAC7D,EAAiB,EAAiB,EAElC,EAAyB,CAAC,EAC1B,EAAwB,CAAC,EAC3B,EAAS,EACb,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,IAAK,CACjC,IAAM,EAAS,GAAoB,KAAK,EAAa,GAC/C,EAAQ,EAAK,MAAM,EAAQ,EAAS,CAAM,EAChD,GAAU,EACV,EAAW,KAAK,CAAK,EACrB,EAAU,KAAK,EAAY,EAAO,CAAW,CAAC,CAClD,CAEA,IAAM,EAAmB,CAAC,EAC1B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAmB,EAAG,IACtC,IAAK,IAAM,KAAS,EACZ,EAAI,EAAM,QAAQ,EAAO,KAAK,EAAM,EAAE,EAGlD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAa,IAC7B,IAAK,IAAM,KAAS,EAAW,EAAO,KAAK,EAAM,EAAE,EAEvD,OAAO,CACX,CAWA,SAAS,EAAa,EAAyB,CAC3C,IAAM,EAAO,EAAU,EAAI,GAC3B,MAAO,CACH,OACA,QAAS,MAAM,KAAK,CAAE,OAAQ,CAAK,MAAa,MAAe,CAAI,CAAC,CAAC,KAAK,EAAK,CAAC,EAChF,SAAU,MAAM,KAAK,CAAE,OAAQ,CAAK,MAAa,MAAe,CAAI,CAAC,CAAC,KAAK,EAAK,CAAC,CACrF,CACJ,CAEA,SAAS,EAAU,EAAgB,EAAW,EAAW,EAAe,EAAU,GAAM,CAChF,EAAI,GAAK,EAAI,GAAK,GAAK,EAAO,MAAQ,GAAK,EAAO,OACtD,EAAO,QAAQ,EAAE,CAAC,GAAK,EACnB,IAAS,EAAO,SAAS,EAAE,CAAC,GAAK,IACzC,CAGA,SAAS,EAAW,EAAgB,EAAc,EAAa,CAC3D,IAAK,IAAI,EAAK,GAAI,GAAM,EAAG,IACvB,IAAK,IAAI,EAAK,GAAI,GAAM,EAAG,IAAM,CAC7B,IAAM,EAAW,KAAK,IAAI,KAAK,IAAI,EAAK,CAAC,EAAG,KAAK,IAAI,EAAK,CAAC,CAAC,EAC5D,EAAU,EAAQ,EAAO,EAAI,EAAM,EAAI,IAAa,GAAK,GAAY,CAAC,CAC1E,CAER,CAEA,SAAS,EAAc,EAAgB,EAAY,EAAY,CAC3D,IAAK,IAAI,EAAK,GAAI,GAAM,EAAG,IACvB,IAAK,IAAI,EAAK,GAAI,GAAM,EAAG,IACvB,EAAU,EAAQ,EAAK,EAAI,EAAK,EAAI,KAAK,IAAI,KAAK,IAAI,CAAE,EAAG,KAAK,IAAI,CAAE,CAAC,IAAM,CAAC,CAG1F,CAEA,SAAS,EAAqB,EAAgB,EAAiB,CAC3D,EAAW,EAAQ,EAAG,CAAC,EACvB,EAAW,EAAQ,EAAO,KAAO,EAAG,CAAC,EACrC,EAAW,EAAQ,EAAG,EAAO,KAAO,CAAC,EAErC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,KAAO,EAAG,IAAK,CACtC,IAAM,EAAO,EAAI,GAAM,EACvB,EAAU,EAAQ,EAAG,EAAG,CAAI,EAC5B,EAAU,EAAQ,EAAG,EAAG,CAAI,CAChC,CAEA,IAAM,EAAY,EAAA,0BAA0B,CAAO,EACnD,IAAK,IAAM,KAAM,EACb,IAAK,IAAM,KAAM,EAGR,IAAO,GAAK,IAAO,GACnB,IAAO,GAAK,IAAO,EAAO,KAAO,GACjC,IAAO,EAAO,KAAO,GAAK,IAAO,GACvB,EAAc,EAAQ,EAAI,CAAE,EAKnD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACnB,EAAU,EAAQ,EAAG,EAAG,EAAK,EAC7B,EAAU,EAAQ,EAAG,EAAG,EAAK,EAEjC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACnB,EAAU,EAAQ,EAAO,KAAO,EAAI,EAAG,EAAG,EAAK,EAC/C,EAAU,EAAQ,EAAG,EAAO,KAAO,EAAI,EAAG,EAAK,EAInD,GAFA,EAAU,EAAQ,EAAG,EAAO,KAAO,EAAG,EAAI,EAEtC,GAAW,EAAG,CACd,IAAM,EAAQ,EAAmB,CAAO,EACxC,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IAAK,CACzB,IAAM,GAAQ,IAAU,EAAK,IAAO,EAC9B,EAAI,EAAO,KAAO,GAAM,EAAI,EAC5B,EAAI,KAAK,MAAM,EAAI,CAAC,EAC1B,EAAU,EAAQ,EAAG,EAAG,CAAG,EAC3B,EAAU,EAAQ,EAAG,EAAG,CAAG,CAC/B,CACJ,CACJ,CAGA,SAAS,EAAmB,EAAyB,CACjD,IAAI,EAAY,EAChB,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,EAAa,GAAa,GAAO,IAAc,IAAM,KAEzD,OAAQ,GAAW,GAAM,CAC7B,CAGA,SAAS,EAAkB,EAA0B,EAAsB,CACvE,IAAM,EAAQ,EAAA,gBAAgB,IAAU,EAAK,EACzC,EAAY,EAChB,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,EAAa,GAAa,GAAO,IAAc,GAAK,KAExD,OAAS,GAAQ,GAAM,GAAa,KACxC,CAEA,SAAS,EAAsB,EAAgB,EAA0B,EAAc,CACnF,IAAM,EAAO,EAAkB,EAAO,CAAI,EAE1C,IAAK,IAAI,EAAI,EAAG,GAAK,EAAG,IAAK,EAAU,EAAQ,EAAG,GAAK,IAAS,EAAK,IAAO,CAAC,EAC7E,EAAU,EAAQ,EAAG,GAAK,IAAS,EAAK,IAAO,CAAC,EAChD,EAAU,EAAQ,EAAG,GAAK,IAAS,EAAK,IAAO,CAAC,EAChD,EAAU,EAAQ,EAAG,GAAK,IAAS,EAAK,IAAO,CAAC,EAChD,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IAAK,EAAU,EAAQ,GAAK,EAAG,GAAK,IAAS,EAAK,IAAO,CAAC,EAElF,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACnB,EAAU,EAAQ,EAAO,KAAO,EAAI,EAAG,GAAK,IAAS,EAAK,IAAO,CAAC,EAEtE,IAAK,IAAI,EAAI,EAAG,EAAI,GAAI,IACpB,EAAU,EAAQ,EAAG,EAAO,KAAO,GAAK,GAAK,IAAS,EAAK,IAAO,CAAC,EAEvE,EAAU,EAAQ,EAAG,EAAO,KAAO,EAAG,EAAI,CAC9C,CASA,SAAS,EAAc,EAAgB,EAA8B,CACjE,IAAI,EAAW,EACX,EAAS,GAEb,IAAK,IAAI,EAAQ,EAAO,KAAO,EAAG,GAAS,EAAG,GAAS,EAAG,CAClD,IAAU,IAAG,EAAQ,GACzB,IAAK,IAAI,EAAO,EAAG,EAAO,EAAO,KAAM,IAAQ,CAC3C,IAAM,EAAI,EAAS,EAAO,KAAO,EAAI,EAAO,EAC5C,IAAK,IAAI,EAAS,EAAG,EAAS,EAAG,IAAU,CACvC,IAAM,EAAI,EAAQ,EAClB,GAAI,EAAO,SAAS,EAAE,CAAC,GAAI,SAC3B,IAAM,EAAO,EAAU,IAAa,GAEpC,EAAO,QAAQ,EAAE,CAAC,GACd,IAAS,IAAA,KAAe,IAAU,GAAK,EAAW,GAAO,IAAO,EACpE,GACJ,CACJ,CACA,EAAS,CAAC,CACd,CACJ,CAEA,IAAM,EAAiE,EAClE,EAAG,KAAO,EAAI,GAAK,GAAM,GACzB,EAAI,IAAM,EAAI,GAAM,EACpB,GAAM,EAAI,GAAM,GAChB,EAAG,KAAO,EAAI,GAAK,GAAM,GACzB,EAAG,KAAO,KAAK,MAAM,EAAI,CAAC,EAAI,KAAK,MAAM,EAAI,CAAC,GAAK,GAAM,GACzD,EAAG,IAAQ,EAAI,EAAK,EAAO,EAAI,EAAK,GAAO,GAC3C,EAAG,KAAS,EAAI,EAAK,EAAO,EAAI,EAAK,GAAM,GAAM,GACjD,EAAG,MAAS,EAAI,GAAK,EAAO,EAAI,EAAK,GAAM,GAAM,CACtD,EAEA,SAAS,EAAU,EAAgB,EAAc,CAC7C,IAAM,EAAK,EAAe,GAC1B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,KAAM,IAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,KAAM,IACzB,CAAC,EAAO,SAAS,EAAE,CAAC,IAAM,EAAG,EAAG,CAAC,IAAG,EAAO,QAAQ,EAAE,CAAC,GAAK,CAAC,EAAO,QAAQ,EAAE,CAAC,GAG9F,CAQA,SAAS,EAAQ,EAAwB,CACrC,GAAM,CAAE,OAAM,WAAY,EACtB,EAAQ,EAEN,EAAc,GAAiB,GAAO,EAAI,GAAK,EAAM,GAAK,EAEhE,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAAK,CAC3B,IAAI,EAAM,EACV,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAClB,EAAQ,EAAE,CAAC,KAAO,EAAQ,EAAE,CAAC,EAAI,GAAI,KAErC,GAAS,EAAW,CAAG,EACvB,EAAM,GAGd,GAAS,EAAW,CAAG,CAC3B,CACA,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAAK,CAC3B,IAAI,EAAM,EACV,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAClB,EAAQ,EAAE,CAAC,KAAO,EAAQ,EAAI,EAAE,CAAC,GAAI,KAErC,GAAS,EAAW,CAAG,EACvB,EAAM,GAGd,GAAS,EAAW,CAAG,CAC3B,CAEA,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,EAAG,IAC1B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,EAAG,IAAK,CAC/B,IAAM,EAAO,EAAQ,EAAE,CAAC,GAEpB,IAAS,EAAQ,EAAE,CAAC,EAAI,IACxB,IAAS,EAAQ,EAAI,EAAE,CAAC,IACxB,IAAS,EAAQ,EAAI,EAAE,CAAC,EAAI,KAE5B,GAAS,EAEjB,CAIJ,IAAM,EAAS,CAAC,GAAM,GAAO,GAAM,GAAM,GAAM,GAAO,EAAI,EACpD,GAAa,EAA0B,IAAwB,CACjE,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,GAAI,EAAK,EAAK,KAAO,EAAO,GAAI,MAAO,GAE3C,IAAM,EAAS,EAAK,MAAM,KAAK,IAAI,EAAG,EAAK,CAAC,EAAG,CAAE,EAC3C,EAAQ,EAAK,MAAM,EAAK,EAAG,EAAK,EAAE,EAClC,EAAS,GAA6B,EAAK,SAAW,GAAK,EAAK,MAAO,GAAM,CAAC,CAAC,EACrF,OAAO,EAAM,CAAM,GAAK,EAAM,CAAK,CACvC,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAAK,CAC3B,IAAM,EAAM,EAAQ,GACd,EAAS,EAAQ,IAAK,GAAS,EAAK,EAAE,EAC5C,IAAK,IAAI,EAAK,EAAG,EAAK,GAAK,EAAM,IACzB,EAAU,EAAK,CAAE,IAAG,GAAS,IAC7B,EAAU,EAAQ,CAAE,IAAG,GAAS,GAE5C,CAEA,IAAI,EAAO,EACX,IAAK,IAAM,KAAO,EAAS,IAAK,IAAM,KAAQ,EAAS,GAAM,IAC7D,IAAM,EAAW,EAAO,KAAQ,EAAO,GAGvC,MAFA,IAAS,KAAK,MAAM,KAAK,IAAI,EAAU,EAAE,EAAI,CAAC,EAAI,GAE3C,CACX,CAEA,SAAS,EAAY,EAAwB,CACzC,MAAO,CACH,KAAM,EAAO,KACb,QAAS,EAAO,QAAQ,IAAK,GAAQ,CAAC,GAAG,CAAG,CAAC,EAC7C,SAAU,EAAO,SAAS,IAAK,GAAQ,CAAC,GAAG,CAAG,CAAC,CACnD,CACJ,CAmBA,SAAgB,EAAS,EAAc,EAA2B,CAAC,EAAa,CAC5E,GAAM,CAAE,QAAQ,IAAK,aAAA,GAA6B,EAC5C,EAAO,EAAW,CAAI,EACtB,EAAU,EAAc,EAAM,EAAM,EAAO,CAAU,EAErD,EAAS,IAAI,EACnB,EAAO,OAAO,EAAe,GAAO,CAAC,EACrC,EAAO,OAAO,EAAY,EAAM,CAAI,EAAG,EAAc,EAAM,CAAO,CAAC,EACnE,EAAa,EAAQ,EAAM,CAAI,EAE/B,IAAM,EAAW,EAAA,cAAc,EAAS,CAAK,EAAI,EACjD,EAAO,OAAO,EAAG,KAAK,IAAI,EAAG,EAAW,EAAO,MAAM,CAAC,EACtD,EAAO,OAAO,GAAI,EAAK,EAAO,OAAS,GAAM,CAAC,EAE9C,IAAM,EAAiB,CAAC,EACxB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,GAAK,EAAG,CACvC,IAAI,EAAO,EACX,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,EAAQ,GAAQ,EAAK,EAAO,KAAK,EAAI,GACjE,EAAK,KAAK,CAAI,CAClB,CAEA,IAAK,IAAI,EAAM,IAAM,EAAK,OAAS,EAAW,EAAG,GAAO,IAAa,EAAK,KAAK,CAAG,EAElF,IAAM,EAAY,EAAe,EAAM,EAAS,CAAK,EAE/C,EAAO,EAAa,CAAO,EACjC,EAAqB,EAAM,CAAO,EAClC,EAAc,EAAM,CAAS,EAE7B,IAAI,EAAsB,KACtB,EAAW,EACX,EAAY,IAChB,IAAK,IAAI,EAAO,EAAG,EAAO,EAAG,IAAQ,CACjC,IAAM,EAAY,EAAY,CAAI,EAClC,EAAU,EAAW,CAAI,EACzB,EAAsB,EAAW,EAAO,CAAI,EAC5C,IAAM,EAAQ,EAAQ,CAAS,EAC3B,EAAQ,IACR,EAAY,EACZ,EAAW,EACX,EAAO,EAEf,CAEA,IAAM,EAAS,EACf,MAAO,CACH,KAAM,EAAO,KACb,QAAS,EAAO,QAChB,UACA,QACA,OACA,KAAM,CACV,CACJ,CAaA,SAAgB,EAAa,EAAkB,EAAS,EAAW,CAC/D,IAAM,EAAkB,CAAC,EACzB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,KAAM,IAAK,CAClC,IAAI,EAAW,GACf,IAAK,IAAI,EAAI,EAAG,GAAK,EAAO,KAAM,IAAK,CACnC,IAAM,EAAO,EAAI,EAAO,MAAQ,EAAO,QAAQ,EAAE,CAAC,GAC9C,GAAQ,IAAa,KAAI,EAAW,GACpC,CAAC,GAAQ,IAAa,KAEtB,EAAM,KACF,IAAI,EAAW,EAAO,GAAG,EAAI,EAAO,GAAG,EAAI,EAAS,MAAM,EAAI,EAAS,EAC3E,EACA,EAAW,GAEnB,CACJ,CACA,OAAO,EAAM,KAAK,EAAE,CACxB"}

package/dist/components/QRCode/qr-encode.js

@@ -0,0 +1,295 @@
+import { ALPHANUMERIC_CHARS as e, ECC_BLOCK_COUNT as t, ECC_CODEWORDS_PER_BLOCK as n, ECC_FORMAT_BITS as r, alignmentPatternPositions as i, dataCodewords as a, rawDataModules as o } from "./qr-tables.js";
+//#region src/components/QRCode/qr-encode.ts
+var s = class extends Error {
+	length;
+	level;
+	constructor(e, t) {
+		super(`Payload of ${e} bytes does not fit in a version-40 QR symbol at level ${t}. Shorten the data, or drop to a lower correction level.`), this.length = e, this.level = t, this.name = "QRCapacityError";
+	}
+}, c = {
+	numeric: 1,
+	alphanumeric: 2,
+	byte: 4
+}, l = /^[0-9]*$/, u = /^[0-9A-Z $%*+\-./:]*$/;
+function d(e) {
+	return l.test(e) ? "numeric" : u.test(e) ? "alphanumeric" : "byte";
+}
+function f(e, t) {
+	let n = t <= 9 ? 0 : t <= 26 ? 1 : 2;
+	return e === "numeric" ? [
+		10,
+		12,
+		14
+	][n] : e === "alphanumeric" ? [
+		9,
+		11,
+		13
+	][n] : [
+		8,
+		16,
+		16
+	][n];
+}
+var p = class {
+	bits = [];
+	append(e, t) {
+		for (let n = t - 1; n >= 0; n--) this.bits.push(e >>> n & 1);
+	}
+	get length() {
+		return this.bits.length;
+	}
+};
+function m(e) {
+	return Array.from(new TextEncoder().encode(e));
+}
+function h(e, t) {
+	if (t === "numeric") {
+		let t = Math.floor(e.length / 3), n = e.length % 3;
+		return t * 10 + (n === 0 ? 0 : n === 1 ? 4 : 7);
+	}
+	return t === "alphanumeric" ? Math.floor(e.length / 2) * 11 + e.length % 2 * 6 : m(e).length * 8;
+}
+function g(t, n, r) {
+	if (r === "numeric") {
+		for (let e = 0; e < n.length; e += 3) {
+			let r = n.slice(e, e + 3);
+			t.append(Number(r), r.length * 3 + 1);
+		}
+		return;
+	}
+	if (r === "alphanumeric") {
+		for (let r = 0; r < n.length; r += 2) {
+			let i = e.indexOf(n[r]);
+			r + 1 === n.length ? t.append(i, 6) : t.append(i * 45 + e.indexOf(n[r + 1]), 11);
+		}
+		return;
+	}
+	for (let e of m(n)) t.append(e, 8);
+}
+function _(e, t) {
+	return t === "byte" ? m(e).length : e.length;
+}
+function v(e, t, n, r) {
+	let i = h(e, t);
+	for (let e = Math.max(1, r); e <= 40; e++) {
+		let r = a(e, n) * 8;
+		if (4 + f(t, e) + i <= r) return e;
+	}
+	throw new s(_(e, t), n);
+}
+var y = /* @__PURE__ */ new Uint8Array(512), b = /* @__PURE__ */ new Uint8Array(256);
+{
+	let e = 1;
+	for (let t = 0; t < 255; t++) y[t] = e, b[e] = t, e = e << 1 ^ (e & 128 ? 285 : 0);
+	for (let e = 255; e < 512; e++) y[e] = y[e - 255];
+}
+function x(e, t) {
+	return e === 0 || t === 0 ? 0 : y[b[e] + b[t]];
+}
+function S(e) {
+	let t = [1];
+	for (let n = 0; n < e; n++) {
+		let e = Array(t.length + 1).fill(0);
+		for (let r = 0; r < t.length; r++) e[r] ^= t[r], e[r + 1] ^= x(t[r], y[n]);
+		t = e;
+	}
+	return t;
+}
+function C(e, t) {
+	let n = S(t), r = Array(t).fill(0);
+	for (let i of e) {
+		let e = i ^ r[0];
+		r.shift(), r.push(0);
+		for (let i = 0; i < t; i++) r[i] ^= x(n[i + 1], e);
+	}
+	return r;
+}
+function w(e, r, i) {
+	let a = t[i][r - 1], s = n[i][r - 1], c = Math.floor(o(r) / 8), l = Math.floor(c / a) - s, u = c % a, d = [], f = [], p = 0;
+	for (let t = 0; t < a; t++) {
+		let n = l + +(t >= a - u), r = e.slice(p, p + n);
+		p += n, d.push(r), f.push(C(r, s));
+	}
+	let m = [];
+	for (let e = 0; e < l + 1; e++) for (let t of d) e < t.length && m.push(t[e]);
+	for (let e = 0; e < s; e++) for (let t of f) m.push(t[e]);
+	return m;
+}
+function T(e) {
+	let t = e * 4 + 17;
+	return {
+		size: t,
+		modules: Array.from({ length: t }, () => Array(t).fill(!1)),
+		reserved: Array.from({ length: t }, () => Array(t).fill(!1))
+	};
+}
+function E(e, t, n, r, i = !0) {
+	t < 0 || n < 0 || t >= e.size || n >= e.size || (e.modules[n][t] = r, i && (e.reserved[n][t] = !0));
+}
+function D(e, t, n) {
+	for (let r = -1; r <= 7; r++) for (let i = -1; i <= 7; i++) {
+		let a = Math.max(Math.abs(i - 3), Math.abs(r - 3));
+		E(e, t + i, n + r, a !== 2 && a <= 3);
+	}
+}
+function O(e, t, n) {
+	for (let r = -2; r <= 2; r++) for (let i = -2; i <= 2; i++) E(e, t + i, n + r, Math.max(Math.abs(i), Math.abs(r)) !== 1);
+}
+function k(e, t) {
+	D(e, 0, 0), D(e, e.size - 7, 0), D(e, 0, e.size - 7);
+	for (let t = 8; t < e.size - 8; t++) {
+		let n = t % 2 == 0;
+		E(e, t, 6, n), E(e, 6, t, n);
+	}
+	let n = i(t);
+	for (let t of n) for (let r of n) r === 6 && t === 6 || r === 6 && t === e.size - 7 || r === e.size - 7 && t === 6 || O(e, r, t);
+	for (let t = 0; t < 9; t++) E(e, t, 8, !1), E(e, 8, t, !1);
+	for (let t = 0; t < 8; t++) E(e, e.size - 1 - t, 8, !1), E(e, 8, e.size - 1 - t, !1);
+	if (E(e, 8, e.size - 8, !0), t >= 7) {
+		let n = A(t);
+		for (let t = 0; t < 18; t++) {
+			let r = (n >>> t & 1) == 1, i = e.size - 11 + t % 3, a = Math.floor(t / 3);
+			E(e, i, a, r), E(e, a, i, r);
+		}
+	}
+}
+function A(e) {
+	let t = e;
+	for (let e = 0; e < 12; e++) t = t << 1 ^ (t >>> 11) * 7973;
+	return e << 12 | t;
+}
+function j(e, t) {
+	let n = r[e] << 3 | t, i = n;
+	for (let e = 0; e < 10; e++) i = i << 1 ^ (i >>> 9) * 1335;
+	return (n << 10 | i) ^ 21522;
+}
+function M(e, t, n) {
+	let r = j(t, n);
+	for (let t = 0; t <= 5; t++) E(e, 8, t, (r >>> t & 1) == 1);
+	E(e, 8, 7, (r >>> 6 & 1) == 1), E(e, 8, 8, (r >>> 7 & 1) == 1), E(e, 7, 8, (r >>> 8 & 1) == 1);
+	for (let t = 9; t < 15; t++) E(e, 14 - t, 8, (r >>> t & 1) == 1);
+	for (let t = 0; t < 8; t++) E(e, e.size - 1 - t, 8, (r >>> t & 1) == 1);
+	for (let t = 8; t < 15; t++) E(e, 8, e.size - 15 + t, (r >>> t & 1) == 1);
+	E(e, 8, e.size - 8, !0);
+}
+function N(e, t) {
+	let n = 0, r = !0;
+	for (let i = e.size - 1; i >= 1; i -= 2) {
+		i === 6 && (i = 5);
+		for (let a = 0; a < e.size; a++) {
+			let o = r ? e.size - 1 - a : a;
+			for (let r = 0; r < 2; r++) {
+				let a = i - r;
+				if (e.reserved[o][a]) continue;
+				let s = t[n >>> 3];
+				e.modules[o][a] = s !== void 0 && (s >>> 7 - (n & 7) & 1) == 1, n++;
+			}
+		}
+		r = !r;
+	}
+}
+var P = [
+	(e, t) => (e + t) % 2 == 0,
+	(e, t) => t % 2 == 0,
+	(e) => e % 3 == 0,
+	(e, t) => (e + t) % 3 == 0,
+	(e, t) => (Math.floor(t / 2) + Math.floor(e / 3)) % 2 == 0,
+	(e, t) => e * t % 2 + e * t % 3 == 0,
+	(e, t) => (e * t % 2 + e * t % 3) % 2 == 0,
+	(e, t) => ((e + t) % 2 + e * t % 3) % 2 == 0
+];
+function F(e, t) {
+	let n = P[t];
+	for (let t = 0; t < e.size; t++) for (let r = 0; r < e.size; r++) !e.reserved[t][r] && n(r, t) && (e.modules[t][r] = !e.modules[t][r]);
+}
+function I(e) {
+	let { size: t, modules: n } = e, r = 0, i = (e) => e >= 5 ? 3 + (e - 5) : 0;
+	for (let e = 0; e < t; e++) {
+		let a = 1;
+		for (let o = 1; o < t; o++) n[e][o] === n[e][o - 1] ? a++ : (r += i(a), a = 1);
+		r += i(a);
+	}
+	for (let e = 0; e < t; e++) {
+		let a = 1;
+		for (let o = 1; o < t; o++) n[o][e] === n[o - 1][e] ? a++ : (r += i(a), a = 1);
+		r += i(a);
+	}
+	for (let e = 0; e < t - 1; e++) for (let i = 0; i < t - 1; i++) {
+		let t = n[e][i];
+		t === n[e][i + 1] && t === n[e + 1][i] && t === n[e + 1][i + 1] && (r += 3);
+	}
+	let a = [
+		!0,
+		!1,
+		!0,
+		!0,
+		!0,
+		!1,
+		!0
+	], o = (e, t) => {
+		for (let n = 0; n < a.length; n++) if (e[t + n] !== a[n]) return !1;
+		let n = e.slice(Math.max(0, t - 4), t), r = e.slice(t + 7, t + 11), i = (e) => e.length === 4 && e.every((e) => !e);
+		return i(n) || i(r);
+	};
+	for (let e = 0; e < t; e++) {
+		let i = n[e], a = n.map((t) => t[e]);
+		for (let e = 0; e + 7 <= t; e++) o(i, e) && (r += 40), o(a, e) && (r += 40);
+	}
+	let s = 0;
+	for (let e of n) for (let t of e) t && s++;
+	let c = s * 100 / (t * t);
+	return r += Math.floor(Math.abs(c - 50) / 5) * 10, r;
+}
+function L(e) {
+	return {
+		size: e.size,
+		modules: e.modules.map((e) => [...e]),
+		reserved: e.reserved.map((e) => [...e])
+	};
+}
+function R(e, t = {}) {
+	let { level: n = "M", minVersion: r = 1 } = t, i = d(e), o = v(e, i, n, r), s = new p();
+	s.append(c[i], 4), s.append(_(e, i), f(i, o)), g(s, e, i);
+	let l = a(o, n) * 8;
+	s.append(0, Math.min(4, l - s.length)), s.append(0, (8 - s.length % 8) % 8);
+	let u = [];
+	for (let e = 0; e < s.length; e += 8) {
+		let t = 0;
+		for (let n = 0; n < 8; n++) t = t << 1 | s.bits[e + n];
+		u.push(t);
+	}
+	for (let e = 236; u.length < l / 8; e ^= 253) u.push(e);
+	let m = w(u, o, n), h = T(o);
+	k(h, o), N(h, m);
+	let y = null, b = 0, x = Infinity;
+	for (let e = 0; e < 8; e++) {
+		let t = L(h);
+		F(t, e), M(t, n, e);
+		let r = I(t);
+		r < x && (x = r, b = e, y = t);
+	}
+	let S = y;
+	return {
+		size: S.size,
+		modules: S.modules,
+		version: o,
+		level: n,
+		mode: i,
+		mask: b
+	};
+}
+function z(e, t = 4) {
+	let n = [];
+	for (let r = 0; r < e.size; r++) {
+		let i = -1;
+		for (let a = 0; a <= e.size; a++) {
+			let o = a < e.size && e.modules[r][a];
+			o && i === -1 && (i = a), !o && i !== -1 && (n.push(`M${i + t} ${r + t}h${a - i}v1h-${a - i}z`), i = -1);
+		}
+	}
+	return n.join("");
+}
+//#endregion
+export { s as QRCapacityError, R as encodeQR, z as matrixToPath, C as reedSolomon, d as selectMode };
+
+//# sourceMappingURL=qr-encode.js.map

package/dist/components/QRCode/qr-encode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"qr-encode.js","names":[],"sources":["../../../src/components/QRCode/qr-encode.ts"],"sourcesContent":["import {\n    ALPHANUMERIC_CHARS,\n    alignmentPatternPositions,\n    dataCodewords,\n    ECC_BLOCK_COUNT,\n    ECC_CODEWORDS_PER_BLOCK,\n    ECC_FORMAT_BITS,\n    MAX_VERSION,\n    MIN_VERSION,\n    rawDataModules,\n    type QRErrorCorrection,\n} from \"./qr-tables\";\n\nexport type { QRErrorCorrection };\n\n/** How the payload is packed into bits. */\nexport type QRMode = \"numeric\" | \"alphanumeric\" | \"byte\";\n\nexport interface QRMatrix {\n    /** Side length in modules, including no quiet zone. */\n    size: number;\n    /** Row-major modules; `true` is dark. */\n    modules: boolean[][];\n    /** Symbol version, 1 to 40. */\n    version: number;\n    /** Level the symbol was encoded at. */\n    level: QRErrorCorrection;\n    /** The mode chosen for the payload. */\n    mode: QRMode;\n    /** Which of the eight masks scored best. */\n    mask: number;\n}\n\nexport interface QREncodeOptions {\n    /** Error correction level. Default `\"M\"`. */\n    level?: QRErrorCorrection;\n    /**\n     * Force a minimum version. The encoder still grows past it when the payload\n     * does not fit — a version is a floor, never a cap that silently truncates.\n     */\n    minVersion?: number;\n}\n\n/** Raised when a payload cannot be encoded at the requested level. */\nexport class QRCapacityError extends Error {\n    constructor(\n        readonly length: number,\n        readonly level: QRErrorCorrection,\n    ) {\n        super(\n            `Payload of ${length} bytes does not fit in a version-${MAX_VERSION} QR symbol at level ${level}. ` +\n                \"Shorten the data, or drop to a lower correction level.\",\n        );\n        this.name = \"QRCapacityError\";\n    }\n}\n\nconst MODE_INDICATOR: Record<QRMode, number> = { numeric: 1, alphanumeric: 2, byte: 4 };\n\nconst NUMERIC_RE = /^[0-9]*$/;\nconst ALPHANUMERIC_RE = /^[0-9A-Z $%*+\\-./:]*$/;\n\n/**\n * Pick the densest mode the payload qualifies for.\n *\n * Numeric packs 3 digits into 10 bits and alphanumeric 2 characters into 11, so\n * a phone number or an upper-case code encodes far smaller than the same string\n * as bytes — often a whole version smaller, which is a visibly coarser symbol\n * and therefore easier to scan.\n *\n * @param text - The payload.\n * @returns The narrowest mode that can represent it.\n */\nexport function selectMode(text: string): QRMode {\n    if (NUMERIC_RE.test(text)) return \"numeric\";\n    if (ALPHANUMERIC_RE.test(text)) return \"alphanumeric\";\n    return \"byte\";\n}\n\n/** Bits the character-count field takes, which widens with the version. */\nfunction charCountBits(mode: QRMode, version: number): number {\n    const tier = version <= 9 ? 0 : version <= 26 ? 1 : 2;\n    if (mode === \"numeric\") return [10, 12, 14][tier];\n    if (mode === \"alphanumeric\") return [9, 11, 13][tier];\n    return [8, 16, 16][tier];\n}\n\n/** A bit sink that appends most-significant-bit first. */\nclass BitBuffer {\n    readonly bits: number[] = [];\n\n    append(value: number, length: number) {\n        for (let i = length - 1; i >= 0; i--) this.bits.push((value >>> i) & 1);\n    }\n\n    get length(): number {\n        return this.bits.length;\n    }\n}\n\n/** UTF-8 bytes for the byte mode, so accents and emoji survive the round trip. */\nfunction utf8Bytes(text: string): number[] {\n    return Array.from(new TextEncoder().encode(text));\n}\n\n/** Bits the payload itself occupies in a given mode, excluding the headers. */\nfunction payloadBits(text: string, mode: QRMode): number {\n    if (mode === \"numeric\") {\n        const groups = Math.floor(text.length / 3);\n        const rest = text.length % 3;\n        return groups * 10 + (rest === 0 ? 0 : rest === 1 ? 4 : 7);\n    }\n    if (mode === \"alphanumeric\") {\n        return Math.floor(text.length / 2) * 11 + (text.length % 2) * 6;\n    }\n    return utf8Bytes(text).length * 8;\n}\n\n/** Write the payload into the buffer in the chosen mode. */\nfunction writePayload(buffer: BitBuffer, text: string, mode: QRMode) {\n    if (mode === \"numeric\") {\n        for (let i = 0; i < text.length; i += 3) {\n            const chunk = text.slice(i, i + 3);\n            buffer.append(Number(chunk), chunk.length * 3 + 1);\n        }\n        return;\n    }\n    if (mode === \"alphanumeric\") {\n        for (let i = 0; i < text.length; i += 2) {\n            const first = ALPHANUMERIC_CHARS.indexOf(text[i]);\n            if (i + 1 === text.length) {\n                buffer.append(first, 6);\n            } else {\n                buffer.append(first * 45 + ALPHANUMERIC_CHARS.indexOf(text[i + 1]), 11);\n            }\n        }\n        return;\n    }\n    for (const byte of utf8Bytes(text)) buffer.append(byte, 8);\n}\n\n/** Character count for the header, which is bytes — not characters — in byte mode. */\nfunction headerCount(text: string, mode: QRMode): number {\n    return mode === \"byte\" ? utf8Bytes(text).length : text.length;\n}\n\n/**\n * The smallest version that fits the payload at this level.\n *\n * @throws {QRCapacityError} When even version 40 is too small.\n */\nfunction selectVersion(\n    text: string,\n    mode: QRMode,\n    level: QRErrorCorrection,\n    minVersion: number,\n): number {\n    const bits = payloadBits(text, mode);\n    for (let version = Math.max(MIN_VERSION, minVersion); version <= MAX_VERSION; version++) {\n        const capacity = dataCodewords(version, level) * 8;\n        if (4 + charCountBits(mode, version) + bits <= capacity) return version;\n    }\n    throw new QRCapacityError(headerCount(text, mode), level);\n}\n\n// ── Reed-Solomon over GF(256), primitive polynomial 0x11D ───────────────────\n\nconst GF_EXP = new Uint8Array(512);\nconst GF_LOG = new Uint8Array(256);\n\n{\n    let x = 1;\n    for (let i = 0; i < 255; i++) {\n        GF_EXP[i] = x;\n        GF_LOG[x] = i;\n        x = (x << 1) ^ (x & 0x80 ? 0x11d : 0);\n    }\n    for (let i = 255; i < 512; i++) GF_EXP[i] = GF_EXP[i - 255];\n}\n\nfunction gfMul(a: number, b: number): number {\n    if (a === 0 || b === 0) return 0;\n    return GF_EXP[GF_LOG[a] + GF_LOG[b]];\n}\n\n/** The generator polynomial for `degree` error-correction codewords. */\nfunction rsGenerator(degree: number): number[] {\n    let poly = [1];\n    for (let i = 0; i < degree; i++) {\n        const next = new Array<number>(poly.length + 1).fill(0);\n        for (let j = 0; j < poly.length; j++) {\n            next[j] ^= poly[j];\n            next[j + 1] ^= gfMul(poly[j], GF_EXP[i]);\n        }\n        poly = next;\n    }\n    return poly;\n}\n\n/**\n * The error-correction codewords for one block.\n *\n * @param data - The block's data codewords.\n * @param degree - How many correction codewords to produce.\n * @returns The remainder of the polynomial division, which is the ECC block.\n */\nexport function reedSolomon(data: readonly number[], degree: number): number[] {\n    const generator = rsGenerator(degree);\n    const remainder = new Array<number>(degree).fill(0);\n    for (const byte of data) {\n        const factor = byte ^ remainder[0];\n        remainder.shift();\n        remainder.push(0);\n        for (let i = 0; i < degree; i++) {\n            remainder[i] ^= gfMul(generator[i + 1], factor);\n        }\n    }\n    return remainder;\n}\n\n/**\n * Split into blocks, add correction, and interleave into the final codeword\n * stream.\n *\n * Interleaving is what makes the correction useful against a real-world smudge:\n * a contiguous scratch on the printed symbol then damages a few codewords of\n * every block instead of destroying one block completely.\n */\nfunction buildCodewords(\n    data: readonly number[],\n    version: number,\n    level: QRErrorCorrection,\n): number[] {\n    const blockCount = ECC_BLOCK_COUNT[level][version - 1];\n    const eccPerBlock = ECC_CODEWORDS_PER_BLOCK[level][version - 1];\n    const totalCodewords = Math.floor(rawDataModules(version) / 8);\n    const shortBlockLength = Math.floor(totalCodewords / blockCount) - eccPerBlock;\n    const longBlockCount = totalCodewords % blockCount;\n\n    const dataBlocks: number[][] = [];\n    const eccBlocks: number[][] = [];\n    let offset = 0;\n    for (let i = 0; i < blockCount; i++) {\n        const length = shortBlockLength + (i >= blockCount - longBlockCount ? 1 : 0);\n        const block = data.slice(offset, offset + length);\n        offset += length;\n        dataBlocks.push(block);\n        eccBlocks.push(reedSolomon(block, eccPerBlock));\n    }\n\n    const result: number[] = [];\n    for (let i = 0; i < shortBlockLength + 1; i++) {\n        for (const block of dataBlocks) {\n            if (i < block.length) result.push(block[i]);\n        }\n    }\n    for (let i = 0; i < eccPerBlock; i++) {\n        for (const block of eccBlocks) result.push(block[i]);\n    }\n    return result;\n}\n\n// ── Matrix construction ─────────────────────────────────────────────────────\n\n/** A grid under construction: modules plus which cells are function patterns. */\ninterface Canvas {\n    size: number;\n    modules: boolean[][];\n    reserved: boolean[][];\n}\n\nfunction createCanvas(version: number): Canvas {\n    const size = version * 4 + 17;\n    return {\n        size,\n        modules: Array.from({ length: size }, () => new Array<boolean>(size).fill(false)),\n        reserved: Array.from({ length: size }, () => new Array<boolean>(size).fill(false)),\n    };\n}\n\nfunction setModule(canvas: Canvas, x: number, y: number, dark: boolean, reserve = true) {\n    if (x < 0 || y < 0 || x >= canvas.size || y >= canvas.size) return;\n    canvas.modules[y][x] = dark;\n    if (reserve) canvas.reserved[y][x] = true;\n}\n\n/** A finder pattern with its separator, anchored at a corner. */\nfunction drawFinder(canvas: Canvas, left: number, top: number) {\n    for (let dy = -1; dy <= 7; dy++) {\n        for (let dx = -1; dx <= 7; dx++) {\n            const distance = Math.max(Math.abs(dx - 3), Math.abs(dy - 3));\n            setModule(canvas, left + dx, top + dy, distance !== 2 && distance <= 3);\n        }\n    }\n}\n\nfunction drawAlignment(canvas: Canvas, cx: number, cy: number) {\n    for (let dy = -2; dy <= 2; dy++) {\n        for (let dx = -2; dx <= 2; dx++) {\n            setModule(canvas, cx + dx, cy + dy, Math.max(Math.abs(dx), Math.abs(dy)) !== 1);\n        }\n    }\n}\n\nfunction drawFunctionPatterns(canvas: Canvas, version: number) {\n    drawFinder(canvas, 0, 0);\n    drawFinder(canvas, canvas.size - 7, 0);\n    drawFinder(canvas, 0, canvas.size - 7);\n\n    for (let i = 8; i < canvas.size - 8; i++) {\n        const dark = i % 2 === 0;\n        setModule(canvas, i, 6, dark);\n        setModule(canvas, 6, i, dark);\n    }\n\n    const positions = alignmentPatternPositions(version);\n    for (const cy of positions) {\n        for (const cx of positions) {\n            // The three corners already hold finder patterns.\n            const atFinder =\n                (cx === 6 && cy === 6) ||\n                (cx === 6 && cy === canvas.size - 7) ||\n                (cx === canvas.size - 7 && cy === 6);\n            if (!atFinder) drawAlignment(canvas, cx, cy);\n        }\n    }\n\n    // Reserve the format information, and light the always-dark module.\n    for (let i = 0; i < 9; i++) {\n        setModule(canvas, i, 8, false);\n        setModule(canvas, 8, i, false);\n    }\n    for (let i = 0; i < 8; i++) {\n        setModule(canvas, canvas.size - 1 - i, 8, false);\n        setModule(canvas, 8, canvas.size - 1 - i, false);\n    }\n    setModule(canvas, 8, canvas.size - 8, true);\n\n    if (version >= 7) {\n        const value = versionInformation(version);\n        for (let i = 0; i < 18; i++) {\n            const bit = ((value >>> i) & 1) === 1;\n            const a = canvas.size - 11 + (i % 3);\n            const b = Math.floor(i / 3);\n            setModule(canvas, a, b, bit);\n            setModule(canvas, b, a, bit);\n        }\n    }\n}\n\n/** The 18-bit version information block, BCH(18,6) with generator 0x1F25. */\nfunction versionInformation(version: number): number {\n    let remainder = version;\n    for (let i = 0; i < 12; i++) {\n        remainder = (remainder << 1) ^ ((remainder >>> 11) * 0x1f25);\n    }\n    return (version << 12) | remainder;\n}\n\n/** The 15-bit format information, BCH(15,5) masked with 0x5412. */\nfunction formatInformation(level: QRErrorCorrection, mask: number): number {\n    const data = (ECC_FORMAT_BITS[level] << 3) | mask;\n    let remainder = data;\n    for (let i = 0; i < 10; i++) {\n        remainder = (remainder << 1) ^ ((remainder >>> 9) * 0x537);\n    }\n    return ((data << 10) | remainder) ^ 0x5412;\n}\n\nfunction drawFormatInformation(canvas: Canvas, level: QRErrorCorrection, mask: number) {\n    const bits = formatInformation(level, mask);\n\n    for (let i = 0; i <= 5; i++) setModule(canvas, 8, i, ((bits >>> i) & 1) === 1);\n    setModule(canvas, 8, 7, ((bits >>> 6) & 1) === 1);\n    setModule(canvas, 8, 8, ((bits >>> 7) & 1) === 1);\n    setModule(canvas, 7, 8, ((bits >>> 8) & 1) === 1);\n    for (let i = 9; i < 15; i++) setModule(canvas, 14 - i, 8, ((bits >>> i) & 1) === 1);\n\n    for (let i = 0; i < 8; i++) {\n        setModule(canvas, canvas.size - 1 - i, 8, ((bits >>> i) & 1) === 1);\n    }\n    for (let i = 8; i < 15; i++) {\n        setModule(canvas, 8, canvas.size - 15 + i, ((bits >>> i) & 1) === 1);\n    }\n    setModule(canvas, 8, canvas.size - 8, true);\n}\n\n/**\n * Lay the codeword stream into the free modules.\n *\n * The path is a boustrophedon over two-module columns from the bottom-right\n * corner, skipping the vertical timing pattern in column 6 entirely — that\n * column would otherwise shift every subsequent column by one.\n */\nfunction drawCodewords(canvas: Canvas, codewords: readonly number[]) {\n    let bitIndex = 0;\n    let upward = true;\n\n    for (let right = canvas.size - 1; right >= 1; right -= 2) {\n        if (right === 6) right = 5;\n        for (let step = 0; step < canvas.size; step++) {\n            const y = upward ? canvas.size - 1 - step : step;\n            for (let column = 0; column < 2; column++) {\n                const x = right - column;\n                if (canvas.reserved[y][x]) continue;\n                const byte = codewords[bitIndex >>> 3];\n                // Remainder bits past the stream are light, per the standard.\n                canvas.modules[y][x] =\n                    byte !== undefined && ((byte >>> (7 - (bitIndex & 7))) & 1) === 1;\n                bitIndex++;\n            }\n        }\n        upward = !upward;\n    }\n}\n\nconst MASK_FUNCTIONS: readonly ((x: number, y: number) => boolean)[] = [\n    (x, y) => (x + y) % 2 === 0,\n    (_x, y) => y % 2 === 0,\n    (x) => x % 3 === 0,\n    (x, y) => (x + y) % 3 === 0,\n    (x, y) => (Math.floor(y / 2) + Math.floor(x / 3)) % 2 === 0,\n    (x, y) => ((x * y) % 2) + ((x * y) % 3) === 0,\n    (x, y) => (((x * y) % 2) + ((x * y) % 3)) % 2 === 0,\n    (x, y) => (((x + y) % 2) + ((x * y) % 3)) % 2 === 0,\n];\n\nfunction applyMask(canvas: Canvas, mask: number) {\n    const fn = MASK_FUNCTIONS[mask];\n    for (let y = 0; y < canvas.size; y++) {\n        for (let x = 0; x < canvas.size; x++) {\n            if (!canvas.reserved[y][x] && fn(x, y)) canvas.modules[y][x] = !canvas.modules[y][x];\n        }\n    }\n}\n\n/**\n * Score a masked symbol; lower is better.\n *\n * The four penalties push away from patterns a scanner confuses with the finder\n * marks, and from large flat areas where it cannot lock on.\n */\nfunction penalty(canvas: Canvas): number {\n    const { size, modules } = canvas;\n    let score = 0;\n\n    const runPenalty = (run: number) => (run >= 5 ? 3 + (run - 5) : 0);\n\n    for (let y = 0; y < size; y++) {\n        let run = 1;\n        for (let x = 1; x < size; x++) {\n            if (modules[y][x] === modules[y][x - 1]) run++;\n            else {\n                score += runPenalty(run);\n                run = 1;\n            }\n        }\n        score += runPenalty(run);\n    }\n    for (let x = 0; x < size; x++) {\n        let run = 1;\n        for (let y = 1; y < size; y++) {\n            if (modules[y][x] === modules[y - 1][x]) run++;\n            else {\n                score += runPenalty(run);\n                run = 1;\n            }\n        }\n        score += runPenalty(run);\n    }\n\n    for (let y = 0; y < size - 1; y++) {\n        for (let x = 0; x < size - 1; x++) {\n            const cell = modules[y][x];\n            if (\n                cell === modules[y][x + 1] &&\n                cell === modules[y + 1][x] &&\n                cell === modules[y + 1][x + 1]\n            ) {\n                score += 3;\n            }\n        }\n    }\n\n    // 1:1:3:1:1 with four light modules on either side — the finder's signature.\n    const FINDER = [true, false, true, true, true, false, true];\n    const matchesAt = (line: readonly boolean[], at: number): boolean => {\n        for (let i = 0; i < FINDER.length; i++) {\n            if (line[at + i] !== FINDER[i]) return false;\n        }\n        const before = line.slice(Math.max(0, at - 4), at);\n        const after = line.slice(at + 7, at + 11);\n        const clear = (part: readonly boolean[]) => part.length === 4 && part.every((m) => !m);\n        return clear(before) || clear(after);\n    };\n\n    for (let i = 0; i < size; i++) {\n        const row = modules[i];\n        const column = modules.map((line) => line[i]);\n        for (let at = 0; at + 7 <= size; at++) {\n            if (matchesAt(row, at)) score += 40;\n            if (matchesAt(column, at)) score += 40;\n        }\n    }\n\n    let dark = 0;\n    for (const row of modules) for (const cell of row) if (cell) dark++;\n    const percent = (dark * 100) / (size * size);\n    score += Math.floor(Math.abs(percent - 50) / 5) * 10;\n\n    return score;\n}\n\nfunction cloneCanvas(canvas: Canvas): Canvas {\n    return {\n        size: canvas.size,\n        modules: canvas.modules.map((row) => [...row]),\n        reserved: canvas.reserved.map((row) => [...row]),\n    };\n}\n\n/**\n * Encode text into a QR matrix.\n *\n * The whole pipeline of ISO/IEC 18004: pick the densest mode the payload\n * qualifies for, pick the smallest version that fits, build the bit stream, add\n * Reed-Solomon correction, interleave the blocks, lay the modules out, then try\n * all eight masks and keep the one the standard's penalty function likes best.\n *\n * @param text - The payload. Byte mode encodes it as UTF-8.\n * @param options - Level and an optional version floor.\n * @returns The finished matrix, without a quiet zone.\n * @throws {QRCapacityError} When the payload does not fit at that level.\n *\n * @example\n * const qr = encodeQR(\"https://tempest.dev\", { level: \"Q\" });\n * qr.modules[0][0]; // true — top-left of the finder pattern\n */\nexport function encodeQR(text: string, options: QREncodeOptions = {}): QRMatrix {\n    const { level = \"M\", minVersion = MIN_VERSION } = options;\n    const mode = selectMode(text);\n    const version = selectVersion(text, mode, level, minVersion);\n\n    const buffer = new BitBuffer();\n    buffer.append(MODE_INDICATOR[mode], 4);\n    buffer.append(headerCount(text, mode), charCountBits(mode, version));\n    writePayload(buffer, text, mode);\n\n    const capacity = dataCodewords(version, level) * 8;\n    buffer.append(0, Math.min(4, capacity - buffer.length));\n    buffer.append(0, (8 - (buffer.length % 8)) % 8);\n\n    const data: number[] = [];\n    for (let i = 0; i < buffer.length; i += 8) {\n        let byte = 0;\n        for (let j = 0; j < 8; j++) byte = (byte << 1) | buffer.bits[i + j];\n        data.push(byte);\n    }\n    // The two alternating pad bytes are prescribed, not arbitrary filler.\n    for (let pad = 0xec; data.length < capacity / 8; pad ^= 0xec ^ 0x11) data.push(pad);\n\n    const codewords = buildCodewords(data, version, level);\n\n    const base = createCanvas(version);\n    drawFunctionPatterns(base, version);\n    drawCodewords(base, codewords);\n\n    let best: Canvas | null = null;\n    let bestMask = 0;\n    let bestScore = Number.POSITIVE_INFINITY;\n    for (let mask = 0; mask < 8; mask++) {\n        const candidate = cloneCanvas(base);\n        applyMask(candidate, mask);\n        drawFormatInformation(candidate, level, mask);\n        const score = penalty(candidate);\n        if (score < bestScore) {\n            bestScore = score;\n            bestMask = mask;\n            best = candidate;\n        }\n    }\n\n    const chosen = best as Canvas;\n    return {\n        size: chosen.size,\n        modules: chosen.modules,\n        version,\n        level,\n        mode,\n        mask: bestMask,\n    };\n}\n\n/**\n * The matrix as an SVG path, one `M…h…v…h…z` rectangle per dark module.\n *\n * A path beats one `<rect>` per module: a version-10 symbol is 3 481 modules,\n * and that many elements is a real cost to parse and to paint. Coordinates are\n * whole numbers in module space, so the shape stays crisp at any size.\n *\n * @param matrix - An encoded matrix.\n * @param margin - Quiet zone in modules. The standard asks for 4.\n * @returns The `d` attribute, empty when there is nothing dark.\n */\nexport function matrixToPath(matrix: QRMatrix, margin = 4): string {\n    const parts: string[] = [];\n    for (let y = 0; y < matrix.size; y++) {\n        let runStart = -1;\n        for (let x = 0; x <= matrix.size; x++) {\n            const dark = x < matrix.size && matrix.modules[y][x];\n            if (dark && runStart === -1) runStart = x;\n            if (!dark && runStart !== -1) {\n                // Merge each horizontal run into one rectangle.\n                parts.push(\n                    `M${runStart + margin} ${y + margin}h${x - runStart}v1h-${x - runStart}z`,\n                );\n                runStart = -1;\n            }\n        }\n    }\n    return parts.join(\"\");\n}\n"],"mappings":";;AA4CA,IAAa,IAAb,cAAqC,MAAM;CAE1B;CACA;CAFb,YACI,GACA,GACF;EAKE,AAJA,MACI,cAAc,EAAO,yDAAqE,EAAM,yDAEpG,GANS,KAAA,SAAA,GACA,KAAA,QAAA,GAMT,KAAK,OAAO;CAChB;AACJ,GAEM,IAAyC;CAAE,SAAS;CAAG,cAAc;CAAG,MAAM;AAAE,GAEhF,IAAa,YACb,IAAkB;AAaxB,SAAgB,EAAW,GAAsB;CAG7C,OAFI,EAAW,KAAK,CAAI,IAAU,YAC9B,EAAgB,KAAK,CAAI,IAAU,iBAChC;AACX;AAGA,SAAS,EAAc,GAAc,GAAyB;CAC1D,IAAM,IAAO,KAAW,IAAI,IAAI,KAAW,KAAK,IAAI;CAGpD,OAFI,MAAS,YAAkB;EAAC;EAAI;EAAI;CAAE,CAAC,CAAC,KACxC,MAAS,iBAAuB;EAAC;EAAG;EAAI;CAAE,CAAC,CAAC,KACzC;EAAC;EAAG;EAAI;CAAE,CAAC,CAAC;AACvB;AAGA,IAAM,IAAN,MAAgB;CACZ,OAA0B,CAAC;CAE3B,OAAO,GAAe,GAAgB;EAClC,KAAK,IAAI,IAAI,IAAS,GAAG,KAAK,GAAG,KAAK,KAAK,KAAK,KAAM,MAAU,IAAK,CAAC;CAC1E;CAEA,IAAI,SAAiB;EACjB,OAAO,KAAK,KAAK;CACrB;AACJ;AAGA,SAAS,EAAU,GAAwB;CACvC,OAAO,MAAM,KAAK,IAAI,YAAY,CAAC,CAAC,OAAO,CAAI,CAAC;AACpD;AAGA,SAAS,EAAY,GAAc,GAAsB;CACrD,IAAI,MAAS,WAAW;EACpB,IAAM,IAAS,KAAK,MAAM,EAAK,SAAS,CAAC,GACnC,IAAO,EAAK,SAAS;EAC3B,OAAO,IAAS,MAAM,MAAS,IAAI,IAAI,MAAS,IAAI,IAAI;CAC5D;CAIA,OAHI,MAAS,iBACF,KAAK,MAAM,EAAK,SAAS,CAAC,IAAI,KAAM,EAAK,SAAS,IAAK,IAE3D,EAAU,CAAI,CAAC,CAAC,SAAS;AACpC;AAGA,SAAS,EAAa,GAAmB,GAAc,GAAc;CACjE,IAAI,MAAS,WAAW;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK,GAAG;GACrC,IAAM,IAAQ,EAAK,MAAM,GAAG,IAAI,CAAC;GACjC,EAAO,OAAO,OAAO,CAAK,GAAG,EAAM,SAAS,IAAI,CAAC;EACrD;EACA;CACJ;CACA,IAAI,MAAS,gBAAgB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK,GAAG;GACrC,IAAM,IAAQ,EAAmB,QAAQ,EAAK,EAAE;GAChD,AAAI,IAAI,MAAM,EAAK,SACf,EAAO,OAAO,GAAO,CAAC,IAEtB,EAAO,OAAO,IAAQ,KAAK,EAAmB,QAAQ,EAAK,IAAI,EAAE,GAAG,EAAE;EAE9E;EACA;CACJ;CACA,KAAK,IAAM,KAAQ,EAAU,CAAI,GAAG,EAAO,OAAO,GAAM,CAAC;AAC7D;AAGA,SAAS,EAAY,GAAc,GAAsB;CACrD,OAAO,MAAS,SAAS,EAAU,CAAI,CAAC,CAAC,SAAS,EAAK;AAC3D;AAOA,SAAS,EACL,GACA,GACA,GACA,GACM;CACN,IAAM,IAAO,EAAY,GAAM,CAAI;CACnC,KAAK,IAAI,IAAU,KAAK,IAAA,GAAiB,CAAU,GAAG,KAAA,IAAwB,KAAW;EACrF,IAAM,IAAW,EAAc,GAAS,CAAK,IAAI;EACjD,IAAI,IAAI,EAAc,GAAM,CAAO,IAAI,KAAQ,GAAU,OAAO;CACpE;CACA,MAAM,IAAI,EAAgB,EAAY,GAAM,CAAI,GAAG,CAAK;AAC5D;AAIA,IAAM,oBAAS,IAAI,WAAW,GAAG,GAC3B,oBAAS,IAAI,WAAW,GAAG;AAEjC;CACI,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAGrB,AAFA,EAAO,KAAK,GACZ,EAAO,KAAK,GACZ,IAAK,KAAK,KAAM,IAAI,MAAO,MAAQ;CAEvC,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,EAAO,KAAK,EAAO,IAAI;AAC3D;AAEA,SAAS,EAAM,GAAW,GAAmB;CAEzC,OADI,MAAM,KAAK,MAAM,IAAU,IACxB,EAAO,EAAO,KAAK,EAAO;AACrC;AAGA,SAAS,EAAY,GAA0B;CAC3C,IAAI,IAAO,CAAC,CAAC;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,GAAQ,KAAK;EAC7B,IAAM,IAAW,MAAc,EAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;EACtD,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAE7B,AADA,EAAK,MAAM,EAAK,IAChB,EAAK,IAAI,MAAM,EAAM,EAAK,IAAI,EAAO,EAAE;EAE3C,IAAO;CACX;CACA,OAAO;AACX;AASA,SAAgB,EAAY,GAAyB,GAA0B;CAC3E,IAAM,IAAY,EAAY,CAAM,GAC9B,IAAgB,MAAc,CAAM,CAAC,CAAC,KAAK,CAAC;CAClD,KAAK,IAAM,KAAQ,GAAM;EACrB,IAAM,IAAS,IAAO,EAAU;EAEhC,AADA,EAAU,MAAM,GAChB,EAAU,KAAK,CAAC;EAChB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAQ,KACxB,EAAU,MAAM,EAAM,EAAU,IAAI,IAAI,CAAM;CAEtD;CACA,OAAO;AACX;AAUA,SAAS,EACL,GACA,GACA,GACQ;CACR,IAAM,IAAa,EAAgB,EAAM,CAAC,IAAU,IAC9C,IAAc,EAAwB,EAAM,CAAC,IAAU,IACvD,IAAiB,KAAK,MAAM,EAAe,CAAO,IAAI,CAAC,GACvD,IAAmB,KAAK,MAAM,IAAiB,CAAU,IAAI,GAC7D,IAAiB,IAAiB,GAElC,IAAyB,CAAC,GAC1B,IAAwB,CAAC,GAC3B,IAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,GAAY,KAAK;EACjC,IAAM,IAAS,IAAoB,OAAK,IAAa,IAC/C,IAAQ,EAAK,MAAM,GAAQ,IAAS,CAAM;EAGhD,AAFA,KAAU,GACV,EAAW,KAAK,CAAK,GACrB,EAAU,KAAK,EAAY,GAAO,CAAW,CAAC;CAClD;CAEA,IAAM,IAAmB,CAAC;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAmB,GAAG,KACtC,KAAK,IAAM,KAAS,GAChB,AAAI,IAAI,EAAM,UAAQ,EAAO,KAAK,EAAM,EAAE;CAGlD,KAAK,IAAI,IAAI,GAAG,IAAI,GAAa,KAC7B,KAAK,IAAM,KAAS,GAAW,EAAO,KAAK,EAAM,EAAE;CAEvD,OAAO;AACX;AAWA,SAAS,EAAa,GAAyB;CAC3C,IAAM,IAAO,IAAU,IAAI;CAC3B,OAAO;EACH;EACA,SAAS,MAAM,KAAK,EAAE,QAAQ,EAAK,SAAa,MAAe,CAAI,CAAC,CAAC,KAAK,EAAK,CAAC;EAChF,UAAU,MAAM,KAAK,EAAE,QAAQ,EAAK,SAAa,MAAe,CAAI,CAAC,CAAC,KAAK,EAAK,CAAC;CACrF;AACJ;AAEA,SAAS,EAAU,GAAgB,GAAW,GAAW,GAAe,IAAU,IAAM;CAChF,IAAI,KAAK,IAAI,KAAK,KAAK,EAAO,QAAQ,KAAK,EAAO,SACtD,EAAO,QAAQ,EAAE,CAAC,KAAK,GACnB,MAAS,EAAO,SAAS,EAAE,CAAC,KAAK;AACzC;AAGA,SAAS,EAAW,GAAgB,GAAc,GAAa;CAC3D,KAAK,IAAI,IAAK,IAAI,KAAM,GAAG,KACvB,KAAK,IAAI,IAAK,IAAI,KAAM,GAAG,KAAM;EAC7B,IAAM,IAAW,KAAK,IAAI,KAAK,IAAI,IAAK,CAAC,GAAG,KAAK,IAAI,IAAK,CAAC,CAAC;EAC5D,EAAU,GAAQ,IAAO,GAAI,IAAM,GAAI,MAAa,KAAK,KAAY,CAAC;CAC1E;AAER;AAEA,SAAS,EAAc,GAAgB,GAAY,GAAY;CAC3D,KAAK,IAAI,IAAK,IAAI,KAAM,GAAG,KACvB,KAAK,IAAI,IAAK,IAAI,KAAM,GAAG,KACvB,EAAU,GAAQ,IAAK,GAAI,IAAK,GAAI,KAAK,IAAI,KAAK,IAAI,CAAE,GAAG,KAAK,IAAI,CAAE,CAAC,MAAM,CAAC;AAG1F;AAEA,SAAS,EAAqB,GAAgB,GAAiB;CAG3D,AAFA,EAAW,GAAQ,GAAG,CAAC,GACvB,EAAW,GAAQ,EAAO,OAAO,GAAG,CAAC,GACrC,EAAW,GAAQ,GAAG,EAAO,OAAO,CAAC;CAErC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,OAAO,GAAG,KAAK;EACtC,IAAM,IAAO,IAAI,KAAM;EAEvB,AADA,EAAU,GAAQ,GAAG,GAAG,CAAI,GAC5B,EAAU,GAAQ,GAAG,GAAG,CAAI;CAChC;CAEA,IAAM,IAAY,EAA0B,CAAO;CACnD,KAAK,IAAM,KAAM,GACb,KAAK,IAAM,KAAM,GAMb,AAHK,MAAO,KAAK,MAAO,KACnB,MAAO,KAAK,MAAO,EAAO,OAAO,KACjC,MAAO,EAAO,OAAO,KAAK,MAAO,KACvB,EAAc,GAAQ,GAAI,CAAE;CAKnD,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAEnB,AADA,EAAU,GAAQ,GAAG,GAAG,EAAK,GAC7B,EAAU,GAAQ,GAAG,GAAG,EAAK;CAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAEnB,AADA,EAAU,GAAQ,EAAO,OAAO,IAAI,GAAG,GAAG,EAAK,GAC/C,EAAU,GAAQ,GAAG,EAAO,OAAO,IAAI,GAAG,EAAK;CAInD,IAFA,EAAU,GAAQ,GAAG,EAAO,OAAO,GAAG,EAAI,GAEtC,KAAW,GAAG;EACd,IAAM,IAAQ,EAAmB,CAAO;EACxC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;GACzB,IAAM,KAAQ,MAAU,IAAK,MAAO,GAC9B,IAAI,EAAO,OAAO,KAAM,IAAI,GAC5B,IAAI,KAAK,MAAM,IAAI,CAAC;GAE1B,AADA,EAAU,GAAQ,GAAG,GAAG,CAAG,GAC3B,EAAU,GAAQ,GAAG,GAAG,CAAG;EAC/B;CACJ;AACJ;AAGA,SAAS,EAAmB,GAAyB;CACjD,IAAI,IAAY;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACpB,IAAa,KAAa,KAAO,MAAc,MAAM;CAEzD,OAAQ,KAAW,KAAM;AAC7B;AAGA,SAAS,EAAkB,GAA0B,GAAsB;CACvE,IAAM,IAAQ,EAAgB,MAAU,IAAK,GACzC,IAAY;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACpB,IAAa,KAAa,KAAO,MAAc,KAAK;CAExD,QAAS,KAAQ,KAAM,KAAa;AACxC;AAEA,SAAS,EAAsB,GAAgB,GAA0B,GAAc;CACnF,IAAM,IAAO,EAAkB,GAAO,CAAI;CAE1C,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK,EAAU,GAAQ,GAAG,IAAK,MAAS,IAAK,MAAO,CAAC;CAG7E,AAFA,EAAU,GAAQ,GAAG,IAAK,MAAS,IAAK,MAAO,CAAC,GAChD,EAAU,GAAQ,GAAG,IAAK,MAAS,IAAK,MAAO,CAAC,GAChD,EAAU,GAAQ,GAAG,IAAK,MAAS,IAAK,MAAO,CAAC;CAChD,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,EAAU,GAAQ,KAAK,GAAG,IAAK,MAAS,IAAK,MAAO,CAAC;CAElF,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACnB,EAAU,GAAQ,EAAO,OAAO,IAAI,GAAG,IAAK,MAAS,IAAK,MAAO,CAAC;CAEtE,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACpB,EAAU,GAAQ,GAAG,EAAO,OAAO,KAAK,IAAK,MAAS,IAAK,MAAO,CAAC;CAEvE,EAAU,GAAQ,GAAG,EAAO,OAAO,GAAG,EAAI;AAC9C;AASA,SAAS,EAAc,GAAgB,GAA8B;CACjE,IAAI,IAAW,GACX,IAAS;CAEb,KAAK,IAAI,IAAQ,EAAO,OAAO,GAAG,KAAS,GAAG,KAAS,GAAG;EACtD,AAAI,MAAU,MAAG,IAAQ;EACzB,KAAK,IAAI,IAAO,GAAG,IAAO,EAAO,MAAM,KAAQ;GAC3C,IAAM,IAAI,IAAS,EAAO,OAAO,IAAI,IAAO;GAC5C,KAAK,IAAI,IAAS,GAAG,IAAS,GAAG,KAAU;IACvC,IAAM,IAAI,IAAQ;IAClB,IAAI,EAAO,SAAS,EAAE,CAAC,IAAI;IAC3B,IAAM,IAAO,EAAU,MAAa;IAIpC,AAFA,EAAO,QAAQ,EAAE,CAAC,KACd,MAAS,KAAA,MAAe,MAAU,KAAK,IAAW,KAAO,MAAO,GACpE;GACJ;EACJ;EACA,IAAS,CAAC;CACd;AACJ;AAEA,IAAM,IAAiE;EAClE,GAAG,OAAO,IAAI,KAAK,KAAM;EACzB,GAAI,MAAM,IAAI,KAAM;EACpB,MAAM,IAAI,KAAM;EAChB,GAAG,OAAO,IAAI,KAAK,KAAM;EACzB,GAAG,OAAO,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,KAAM;EACzD,GAAG,MAAQ,IAAI,IAAK,IAAO,IAAI,IAAK,KAAO;EAC3C,GAAG,OAAS,IAAI,IAAK,IAAO,IAAI,IAAK,KAAM,KAAM;EACjD,GAAG,QAAS,IAAI,KAAK,IAAO,IAAI,IAAK,KAAM,KAAM;AACtD;AAEA,SAAS,EAAU,GAAgB,GAAc;CAC7C,IAAM,IAAK,EAAe;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,MAAM,KAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,MAAM,KAC7B,AAAI,CAAC,EAAO,SAAS,EAAE,CAAC,MAAM,EAAG,GAAG,CAAC,MAAG,EAAO,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAO,QAAQ,EAAE,CAAC;AAG9F;AAQA,SAAS,EAAQ,GAAwB;CACrC,IAAM,EAAE,SAAM,eAAY,GACtB,IAAQ,GAEN,KAAc,MAAiB,KAAO,IAAI,KAAK,IAAM,KAAK;CAEhE,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KAAK;EAC3B,IAAI,IAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KACtB,AAAI,EAAQ,EAAE,CAAC,OAAO,EAAQ,EAAE,CAAC,IAAI,KAAI,OAErC,KAAS,EAAW,CAAG,GACvB,IAAM;EAGd,KAAS,EAAW,CAAG;CAC3B;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KAAK;EAC3B,IAAI,IAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KACtB,AAAI,EAAQ,EAAE,CAAC,OAAO,EAAQ,IAAI,EAAE,CAAC,KAAI,OAErC,KAAS,EAAW,CAAG,GACvB,IAAM;EAGd,KAAS,EAAW,CAAG;CAC3B;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,IAAO,GAAG,KAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAO,GAAG,KAAK;EAC/B,IAAM,IAAO,EAAQ,EAAE,CAAC;EACxB,AACI,MAAS,EAAQ,EAAE,CAAC,IAAI,MACxB,MAAS,EAAQ,IAAI,EAAE,CAAC,MACxB,MAAS,EAAQ,IAAI,EAAE,CAAC,IAAI,OAE5B,KAAS;CAEjB;CAIJ,IAAM,IAAS;EAAC;EAAM;EAAO;EAAM;EAAM;EAAM;EAAO;CAAI,GACpD,KAAa,GAA0B,MAAwB;EACjE,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KAC/B,IAAI,EAAK,IAAK,OAAO,EAAO,IAAI,OAAO;EAE3C,IAAM,IAAS,EAAK,MAAM,KAAK,IAAI,GAAG,IAAK,CAAC,GAAG,CAAE,GAC3C,IAAQ,EAAK,MAAM,IAAK,GAAG,IAAK,EAAE,GAClC,KAAS,MAA6B,EAAK,WAAW,KAAK,EAAK,OAAO,MAAM,CAAC,CAAC;EACrF,OAAO,EAAM,CAAM,KAAK,EAAM,CAAK;CACvC;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KAAK;EAC3B,IAAM,IAAM,EAAQ,IACd,IAAS,EAAQ,KAAK,MAAS,EAAK,EAAE;EAC5C,KAAK,IAAI,IAAK,GAAG,IAAK,KAAK,GAAM,KAE7B,AADI,EAAU,GAAK,CAAE,MAAG,KAAS,KAC7B,EAAU,GAAQ,CAAE,MAAG,KAAS;CAE5C;CAEA,IAAI,IAAO;CACX,KAAK,IAAM,KAAO,GAAS,KAAK,IAAM,KAAQ,GAAK,AAAI,KAAM;CAC7D,IAAM,IAAW,IAAO,OAAQ,IAAO;CAGvC,OAFA,KAAS,KAAK,MAAM,KAAK,IAAI,IAAU,EAAE,IAAI,CAAC,IAAI,IAE3C;AACX;AAEA,SAAS,EAAY,GAAwB;CACzC,OAAO;EACH,MAAM,EAAO;EACb,SAAS,EAAO,QAAQ,KAAK,MAAQ,CAAC,GAAG,CAAG,CAAC;EAC7C,UAAU,EAAO,SAAS,KAAK,MAAQ,CAAC,GAAG,CAAG,CAAC;CACnD;AACJ;AAmBA,SAAgB,EAAS,GAAc,IAA2B,CAAC,GAAa;CAC5E,IAAM,EAAE,WAAQ,KAAK,gBAAA,MAA6B,GAC5C,IAAO,EAAW,CAAI,GACtB,IAAU,EAAc,GAAM,GAAM,GAAO,CAAU,GAErD,IAAS,IAAI,EAAU;CAG7B,AAFA,EAAO,OAAO,EAAe,IAAO,CAAC,GACrC,EAAO,OAAO,EAAY,GAAM,CAAI,GAAG,EAAc,GAAM,CAAO,CAAC,GACnE,EAAa,GAAQ,GAAM,CAAI;CAE/B,IAAM,IAAW,EAAc,GAAS,CAAK,IAAI;CAEjD,AADA,EAAO,OAAO,GAAG,KAAK,IAAI,GAAG,IAAW,EAAO,MAAM,CAAC,GACtD,EAAO,OAAO,IAAI,IAAK,EAAO,SAAS,KAAM,CAAC;CAE9C,IAAM,IAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK,GAAG;EACvC,IAAI,IAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAQ,KAAQ,IAAK,EAAO,KAAK,IAAI;EACjE,EAAK,KAAK,CAAI;CAClB;CAEA,KAAK,IAAI,IAAM,KAAM,EAAK,SAAS,IAAW,GAAG,KAAO,KAAa,EAAK,KAAK,CAAG;CAElF,IAAM,IAAY,EAAe,GAAM,GAAS,CAAK,GAE/C,IAAO,EAAa,CAAO;CAEjC,AADA,EAAqB,GAAM,CAAO,GAClC,EAAc,GAAM,CAAS;CAE7B,IAAI,IAAsB,MACtB,IAAW,GACX,IAAY;CAChB,KAAK,IAAI,IAAO,GAAG,IAAO,GAAG,KAAQ;EACjC,IAAM,IAAY,EAAY,CAAI;EAElC,AADA,EAAU,GAAW,CAAI,GACzB,EAAsB,GAAW,GAAO,CAAI;EAC5C,IAAM,IAAQ,EAAQ,CAAS;EAC/B,AAAI,IAAQ,MACR,IAAY,GACZ,IAAW,GACX,IAAO;CAEf;CAEA,IAAM,IAAS;CACf,OAAO;EACH,MAAM,EAAO;EACb,SAAS,EAAO;EAChB;EACA;EACA;EACA,MAAM;CACV;AACJ;AAaA,SAAgB,EAAa,GAAkB,IAAS,GAAW;CAC/D,IAAM,IAAkB,CAAC;CACzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,MAAM,KAAK;EAClC,IAAI,IAAW;EACf,KAAK,IAAI,IAAI,GAAG,KAAK,EAAO,MAAM,KAAK;GACnC,IAAM,IAAO,IAAI,EAAO,QAAQ,EAAO,QAAQ,EAAE,CAAC;GAElD,AADI,KAAQ,MAAa,OAAI,IAAW,IACpC,CAAC,KAAQ,MAAa,OAEtB,EAAM,KACF,IAAI,IAAW,EAAO,GAAG,IAAI,EAAO,GAAG,IAAI,EAAS,MAAM,IAAI,EAAS,EAC3E,GACA,IAAW;EAEnB;CACJ;CACA,OAAO,EAAM,KAAK,EAAE;AACxB"}

package/dist/components/QRCode/qr-tables.cjs

@@ -0,0 +1,2 @@
+var e={L:1,M:0,Q:3,H:2},t={L:[7,10,15,20,26,18,20,24,30,18,20,24,26,30,22,24,28,30,28,28,28,28,30,30,26,28,30,30,30,30,30,30,30,30,30,30,30,30,30,30],M:[10,16,26,18,24,16,18,22,22,26,30,22,22,24,24,28,28,26,26,26,26,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28],Q:[13,22,18,26,18,24,18,22,20,24,28,26,24,20,30,24,28,28,26,30,28,30,30,30,30,28,30,30,30,30,30,30,30,30,30,30,30,30,30,30],H:[17,28,22,16,22,28,26,26,24,28,24,28,22,24,24,30,28,28,26,28,30,24,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30]},n={L:[1,1,1,1,1,2,2,2,2,4,4,4,4,4,6,6,6,6,7,8,8,9,9,10,12,12,12,13,14,15,16,17,18,19,19,20,21,22,24,25],M:[1,1,1,2,2,4,4,4,5,5,5,8,9,9,10,10,11,13,14,16,17,17,18,20,21,23,25,26,28,29,31,33,35,37,38,40,43,45,47,49],Q:[1,1,2,2,4,4,6,6,8,8,8,10,12,16,12,17,16,18,21,20,23,23,25,27,29,34,34,35,38,40,43,45,48,51,53,56,59,62,65,68],H:[1,1,2,4,4,4,5,6,8,8,11,11,16,16,18,16,19,21,25,25,25,34,30,32,35,37,40,42,45,48,51,54,57,60,63,66,70,74,77,81]},r=`0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:`;function i(e){let t=(16*e+128)*e+64;if(e>=2){let n=Math.floor(e/7)+2;t-=(25*n-10)*n-55,e>=7&&(t-=36)}return t}function a(e,r){return Math.floor(i(e)/8)-t[r][e-1]*n[r][e-1]}function o(e){if(e===1)return[];let t=Math.floor(e/7)+2,n=e===32?26:Math.ceil((e*4+4)/(t*2-2))*2,r=[6];for(let i=e*4+10;r.length<t;i-=n)r.splice(1,0,i);return r}exports.ALPHANUMERIC_CHARS=r,exports.ECC_BLOCK_COUNT=n,exports.ECC_CODEWORDS_PER_BLOCK=t,exports.ECC_FORMAT_BITS=e,exports.alignmentPatternPositions=o,exports.dataCodewords=a,exports.rawDataModules=i;
+//# sourceMappingURL=qr-tables.cjs.map

package/dist/components/QRCode/qr-tables.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"qr-tables.cjs","names":[],"sources":["../../../src/components/QRCode/qr-tables.ts"],"sourcesContent":["/**\n * The fixed tables of ISO/IEC 18004, transcribed.\n *\n * They are data, not logic: the standard specifies them and there is nothing to\n * derive. They live apart from {@link ./qr-encode} so the algorithm reads as\n * algorithm and a typo in a table stays findable.\n */\n\n/** Error correction level, by how much of the symbol it can lose and survive. */\nexport type QRErrorCorrection = \"L\" | \"M\" | \"Q\" | \"H\";\n\nexport const ECC_LEVELS: readonly QRErrorCorrection[] = [\"L\", \"M\", \"Q\", \"H\"];\n\n/** The 2-bit code each level carries in the format information. */\nexport const ECC_FORMAT_BITS: Record<QRErrorCorrection, number> = { L: 1, M: 0, Q: 3, H: 2 };\n\n/**\n * Error-correction codewords per block, indexed `[level][version - 1]`.\n *\n * Together with {@link ECC_BLOCK_COUNT} this fixes how much of each version is\n * data and how much is redundancy.\n */\nexport const ECC_CODEWORDS_PER_BLOCK: Record<QRErrorCorrection, readonly number[]> = {\n    L: [\n        7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30,\n        30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n    ],\n    M: [\n        10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28,\n        28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n    ],\n    Q: [\n        13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30,\n        30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n    ],\n    H: [\n        17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30,\n        30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n    ],\n};\n\n/** Number of error-correction blocks, indexed `[level][version - 1]`. */\nexport const ECC_BLOCK_COUNT: Record<QRErrorCorrection, readonly number[]> = {\n    L: [\n        1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14,\n        15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25,\n    ],\n    M: [\n        1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23,\n        25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49,\n    ],\n    Q: [\n        1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34,\n        34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68,\n    ],\n    H: [\n        1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35,\n        37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81,\n    ],\n};\n\n/** The alphanumeric mode's 45-character alphabet, in code order. */\nexport const ALPHANUMERIC_CHARS = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\";\n\n/** Lowest and highest symbol version. */\nexport const MIN_VERSION = 1;\nexport const MAX_VERSION = 40;\n\n/**\n * Total data modules in a symbol, before subtracting error correction.\n *\n * Closed form rather than a 40-row table: the function patterns a version\n * carries are themselves a function of the version, so counting them beats\n * transcribing the totals and hoping.\n *\n * @param version - Symbol version, 1 to 40.\n * @returns The module count available to data and error correction.\n */\nexport function rawDataModules(version: number): number {\n    let result = (16 * version + 128) * version + 64;\n    if (version >= 2) {\n        const alignCount = Math.floor(version / 7) + 2;\n        result -= (25 * alignCount - 10) * alignCount - 55;\n        if (version >= 7) result -= 36;\n    }\n    return result;\n}\n\n/**\n * How many data codewords a version holds at a given level.\n *\n * @param version - Symbol version, 1 to 40.\n * @param level - Error correction level.\n * @returns Codewords left for the message itself.\n */\nexport function dataCodewords(version: number, level: QRErrorCorrection): number {\n    return (\n        Math.floor(rawDataModules(version) / 8) -\n        ECC_CODEWORDS_PER_BLOCK[level][version - 1] * ECC_BLOCK_COUNT[level][version - 1]\n    );\n}\n\n/**\n * Row/column centres of the alignment patterns for a version.\n *\n * @param version - Symbol version, 1 to 40.\n * @returns Coordinates, ascending. Empty for version 1, which has none.\n */\nexport function alignmentPatternPositions(version: number): number[] {\n    if (version === 1) return [];\n    const count = Math.floor(version / 7) + 2;\n    // Version 32 is the one case the general spacing rule gets wrong.\n    const step = version === 32 ? 26 : Math.ceil((version * 4 + 4) / (count * 2 - 2)) * 2;\n    const positions = [6];\n    for (let pos = version * 4 + 10; positions.length < count; pos -= step) {\n        positions.splice(1, 0, pos);\n    }\n    return positions;\n}\n"],"mappings":"AAcA,IAAa,EAAqD,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAE,EAQ9E,EAAwE,CACjF,EAAG,CACC,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACvF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EACpE,EACA,EAAG,CACC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACxF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EACpE,EACA,EAAG,CACC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACxF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EACpE,EACA,EAAG,CACC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACxF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EACpE,CACJ,EAGa,EAAgE,CACzE,EAAG,CACC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GACzF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAC5C,EACA,EAAG,CACC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACtF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EACxD,EACA,EAAG,CACC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACzF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EACxD,EACA,EAAG,CACC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACtF,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAC5D,CACJ,EAGa,EAAqB,gDAgBlC,SAAgB,EAAe,EAAyB,CACpD,IAAI,GAAU,GAAK,EAAU,KAAO,EAAU,GAC9C,GAAI,GAAW,EAAG,CACd,IAAM,EAAa,KAAK,MAAM,EAAU,CAAC,EAAI,EAC7C,IAAW,GAAK,EAAa,IAAM,EAAa,GAC5C,GAAW,IAAG,GAAU,GAChC,CACA,OAAO,CACX,CASA,SAAgB,EAAc,EAAiB,EAAkC,CAC7E,OACI,KAAK,MAAM,EAAe,CAAO,EAAI,CAAC,EACtC,EAAwB,EAAM,CAAC,EAAU,GAAK,EAAgB,EAAM,CAAC,EAAU,EAEvF,CAQA,SAAgB,EAA0B,EAA2B,CACjE,GAAI,IAAY,EAAG,MAAO,CAAC,EAC3B,IAAM,EAAQ,KAAK,MAAM,EAAU,CAAC,EAAI,EAElC,EAAO,IAAY,GAAK,GAAK,KAAK,MAAM,EAAU,EAAI,IAAM,EAAQ,EAAI,EAAE,EAAI,EAC9E,EAAY,CAAC,CAAC,EACpB,IAAK,IAAI,EAAM,EAAU,EAAI,GAAI,EAAU,OAAS,EAAO,GAAO,EAC9D,EAAU,OAAO,EAAG,EAAG,CAAG,EAE9B,OAAO,CACX"}