@digigov/ui 1.2.0-a7ffb5dc → 2.0.0-7d9a8d86

package/cjs/app/QrCodeViewer/qrcodegen.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/app/QrCodeViewer/qrcodegen.ts"],
+  "sourcesContent": ["/* eslint-disable */\n/**\n * @license QR Code generator library (TypeScript)\n * Copyright (c) Project Nayuki.\n * SPDX-License-Identifier: MIT\n */\n\n'use strict';\n// eslint-disable-next-line @typescript-eslint/no-namespace\nnamespace qrcodegen {\n  type bit = number;\n  type byte = number;\n  type int = number;\n\n  /*---- QR Code symbol class ----*/\n\n  /*\n   * A QR Code symbol, which is a type of two-dimension barcode.\n   * Invented by Denso Wave and described in the ISO/IEC 18004 standard.\n   * Instances of this class represent an immutable square grid of dark and light cells.\n   * The class provides static factory functions to create a QR Code from text or binary data.\n   * The class covers the QR Code Model 2 specification, supporting all versions (sizes)\n   * from 1 to 40, all 4 error correction levels, and 4 character encoding modes.\n   *\n   * Ways to create a QR Code object:\n   * - High level: Take the payload data and call QrCode.encodeText() or QrCode.encodeBinary().\n   * - Mid level: Custom-make the list of segments and call QrCode.encodeSegments().\n   * - Low level: Custom-make the array of data codeword bytes (including\n   *   segment headers and final padding, excluding error correction codewords),\n   *   supply the appropriate version number, and call the QrCode() constructor.\n   * (Note that all ways require supplying the desired error correction level.)\n   */\n  export class QrCode {\n    /*-- Static factory functions (high level) --*/\n\n    // Returns a QR Code representing the given Unicode text string at the given error correction level.\n    // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer\n    // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible\n    // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the\n    // ecl argument if it can be done without increasing the version.\n    public static encodeText(text: string, ecl: QrCode.Ecc): QrCode {\n      const segs: Array<QrSegment> = qrcodegen.QrSegment.makeSegments(text);\n      return QrCode.encodeSegments(segs, ecl);\n    }\n\n    // Returns a QR Code representing the given binary data at the given error correction level.\n    // This function always encodes using the binary segment mode, not any text mode. The maximum number of\n    // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.\n    // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.\n    public static encodeBinary(\n      data: Readonly<Array<byte>>,\n      ecl: QrCode.Ecc\n    ): QrCode {\n      const seg: QrSegment = qrcodegen.QrSegment.makeBytes(data);\n      return QrCode.encodeSegments([seg], ecl);\n    }\n\n    /*-- Static factory functions (mid level) --*/\n\n    // Returns a QR Code representing the given segments with the given encoding parameters.\n    // The smallest possible QR Code version within the given range is automatically\n    // chosen for the output. Iff boostEcl is true, then the ECC level of the result\n    // may be higher than the ecl argument if it can be done without increasing the\n    // version. The mask number is either between 0 to 7 (inclusive) to force that\n    // mask, or -1 to automatically choose an appropriate mask (which may be slow).\n    // This function allows the user to create a custom sequence of segments that switches\n    // between modes (such as alphanumeric and byte) to encode text in less space.\n    // This is a mid-level API; the high-level API is encodeText() and encodeBinary().\n    public static encodeSegments(\n      segs: Readonly<Array<QrSegment>>,\n      ecl: QrCode.Ecc,\n      minVersion: int = 1,\n      maxVersion: int = 40,\n      mask: int = -1,\n      boostEcl = true\n    ): QrCode {\n      if (\n        !(\n          QrCode.MIN_VERSION <= minVersion &&\n          minVersion <= maxVersion &&\n          maxVersion <= QrCode.MAX_VERSION\n        ) ||\n        mask < -1 ||\n        mask > 7\n      )\n        throw new RangeError('Invalid value');\n\n      // Find the minimal version number to use\n      let version: int;\n      let dataUsedBits: int;\n      for (version = minVersion; ; version++) {\n        const dataCapacityBits: int =\n          QrCode.getNumDataCodewords(version, ecl) * 8; // Number of data bits available\n        const usedBits: number = QrSegment.getTotalBits(segs, version);\n        if (usedBits <= dataCapacityBits) {\n          dataUsedBits = usedBits;\n          break; // This version number is found to be suitable\n        }\n        if (version >= maxVersion)\n          // All versions in the range could not fit the given data\n          throw new RangeError('Data too long');\n      }\n\n      // Increase the error correction level while the data still fits in the current version number\n      for (const newEcl of [\n        QrCode.Ecc.MEDIUM,\n        QrCode.Ecc.QUARTILE,\n        QrCode.Ecc.HIGH,\n      ]) {\n        // From low to high\n        if (\n          boostEcl &&\n          dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8\n        )\n          ecl = newEcl;\n      }\n\n      // Concatenate all segments to create the data bit string\n      const bb: Array<bit> = [];\n      for (const seg of segs) {\n        appendBits(seg.mode.modeBits, 4, bb);\n        appendBits(seg.numChars, seg.mode.numCharCountBits(version), bb);\n        for (const b of seg.getData()) bb.push(b);\n      }\n      assert(bb.length == dataUsedBits);\n\n      // Add terminator and pad up to a byte if applicable\n      const dataCapacityBits: int =\n        QrCode.getNumDataCodewords(version, ecl) * 8;\n      assert(bb.length <= dataCapacityBits);\n      appendBits(0, Math.min(4, dataCapacityBits - bb.length), bb);\n      appendBits(0, (8 - (bb.length % 8)) % 8, bb);\n      assert(bb.length % 8 == 0);\n\n      // Pad with alternating bytes until data capacity is reached\n      for (\n        let padByte = 0xec;\n        bb.length < dataCapacityBits;\n        padByte ^= 0xec ^ 0x11\n      )\n        appendBits(padByte, 8, bb);\n\n      // Pack bits into bytes in big endian\n      const dataCodewords: Array<byte> = [];\n      while (dataCodewords.length * 8 < bb.length) dataCodewords.push(0);\n      bb.forEach(\n        (b: bit, i: int) => (dataCodewords[i >>> 3] |= b << (7 - (i & 7)))\n      );\n\n      // Create the QR Code object\n      return new QrCode(version, ecl, dataCodewords, mask);\n    }\n\n    /*-- Fields --*/\n    // The version number of this QR Code, which is between 1 and 40 (inclusive).\n    // This determines the size of this barcode.\n    public readonly version: int;\n\n    // The error correction level used in this QR Code.\n    public readonly errorCorrectionLevel: QrCode.Ecc;\n\n    // The width and height of this QR Code, measured in modules, between\n    // 21 and 177 (inclusive). This is equal to version * 4 + 17.\n    public readonly size: int;\n\n    // The index of the mask pattern used in this QR Code, which is between 0 and 7 (inclusive).\n    // Even if a QR Code is created with automatic masking requested (mask = -1),\n    // the resulting object still has a mask value between 0 and 7.\n    public readonly mask: int;\n\n    // The modules of this QR Code (false = light, true = dark).\n    // Immutable after constructor finishes. Accessed through getModule().\n    private readonly modules: Array<Array<boolean>> = [];\n\n    // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.\n    private readonly isFunction: Array<Array<boolean>> = [];\n\n    /*-- Constructor (low level) and fields --*/\n\n    // Creates a new QR Code with the given version number,\n    // error correction level, data codeword bytes, and mask number.\n    // This is a low-level API that most users should not use directly.\n    // A mid-level API is the encodeSegments() function.\n    public constructor(\n      // The version number of this QR Code, which is between 1 and 40 (inclusive).\n      // This determines the size of this barcode.\n      version: int,\n\n      // The error correction level used in this QR Code.\n      errorCorrectionLevel: QrCode.Ecc,\n\n      dataCodewords: Readonly<Array<byte>>,\n\n      msk: int\n    ) {\n      this.version = version;\n      this.errorCorrectionLevel = errorCorrectionLevel;\n      // Check scalar arguments\n      if (version < QrCode.MIN_VERSION || version > QrCode.MAX_VERSION)\n        throw new RangeError('Version value out of range');\n      if (msk < -1 || msk > 7) throw new RangeError('Mask value out of range');\n      this.size = version * 4 + 17;\n\n      // Initialize both grids to be size*size arrays of Boolean false\n      const row: Array<boolean> = [];\n      for (let i = 0; i < this.size; i++) row.push(false);\n      for (let i = 0; i < this.size; i++) {\n        this.modules.push(row.slice()); // Initially all light\n        this.isFunction.push(row.slice());\n      }\n\n      // Compute ECC, draw modules\n      this.drawFunctionPatterns();\n      const allCodewords: Array<byte> = this.addEccAndInterleave(dataCodewords);\n      this.drawCodewords(allCodewords);\n\n      // Do masking\n      if (msk == -1) {\n        // Automatically choose best mask\n        let minPenalty: int = 1000000000;\n        for (let i = 0; i < 8; i++) {\n          this.applyMask(i);\n          this.drawFormatBits(i);\n          const penalty: int = this.getPenaltyScore();\n          if (penalty < minPenalty) {\n            msk = i;\n            minPenalty = penalty;\n          }\n          this.applyMask(i); // Undoes the mask due to XOR\n        }\n      }\n      assert(0 <= msk && msk <= 7);\n      this.mask = msk;\n      this.applyMask(msk); // Apply the final choice of mask\n      this.drawFormatBits(msk); // Overwrite old format bits\n\n      this.isFunction = [];\n    }\n\n    /*-- Accessor methods --*/\n\n    // Returns the color of the module (pixel) at the given coordinates, which is false\n    // for light or true for dark. The top left corner has the coordinates (x=0, y=0).\n    // If the given coordinates are out of bounds, then false (light) is returned.\n    public getModule(x: int, y: int): boolean {\n      return (\n        0 <= x && x < this.size && 0 <= y && y < this.size && this.modules[y][x]\n      );\n    }\n\n    // Modified to expose modules for easy access\n    public getModules() {\n      return this.modules;\n    }\n\n    /*-- Private helper methods for constructor: Drawing function modules --*/\n\n    // Reads this object's version field, and draws and marks all function modules.\n    private drawFunctionPatterns(): void {\n      // Draw horizontal and vertical timing patterns\n      for (let i = 0; i < this.size; i++) {\n        this.setFunctionModule(6, i, i % 2 == 0);\n        this.setFunctionModule(i, 6, i % 2 == 0);\n      }\n\n      // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules)\n      this.drawFinderPattern(3, 3);\n      this.drawFinderPattern(this.size - 4, 3);\n      this.drawFinderPattern(3, this.size - 4);\n\n      // Draw numerous alignment patterns\n      const alignPatPos: Array<int> = this.getAlignmentPatternPositions();\n      const numAlign: int = alignPatPos.length;\n      for (let i = 0; i < numAlign; i++) {\n        for (let j = 0; j < numAlign; j++) {\n          // Don't draw on the three finder corners\n          if (\n            !(\n              (i == 0 && j == 0) ||\n              (i == 0 && j == numAlign - 1) ||\n              (i == numAlign - 1 && j == 0)\n            )\n          )\n            this.drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);\n        }\n      }\n\n      // Draw configuration data\n      this.drawFormatBits(0); // Dummy mask value; overwritten later in the constructor\n      this.drawVersion();\n    }\n\n    // Draws two copies of the format bits (with its own error correction code)\n    // based on the given mask and this object's error correction level field.\n    private drawFormatBits(mask: int): void {\n      // Calculate error correction code and pack bits\n      const data: int = (this.errorCorrectionLevel.formatBits << 3) | mask; // errCorrLvl is uint2, mask is uint3\n      let rem: int = data;\n      for (let i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >>> 9) * 0x537);\n      const bits = ((data << 10) | rem) ^ 0x5412; // uint15\n      assert(bits >>> 15 == 0);\n\n      // Draw first copy\n      for (let i = 0; i <= 5; i++)\n        this.setFunctionModule(8, i, getBit(bits, i));\n      this.setFunctionModule(8, 7, getBit(bits, 6));\n      this.setFunctionModule(8, 8, getBit(bits, 7));\n      this.setFunctionModule(7, 8, getBit(bits, 8));\n      for (let i = 9; i < 15; i++)\n        this.setFunctionModule(14 - i, 8, getBit(bits, i));\n\n      // Draw second copy\n      for (let i = 0; i < 8; i++)\n        this.setFunctionModule(this.size - 1 - i, 8, getBit(bits, i));\n      for (let i = 8; i < 15; i++)\n        this.setFunctionModule(8, this.size - 15 + i, getBit(bits, i));\n      this.setFunctionModule(8, this.size - 8, true); // Always dark\n    }\n\n    // Draws two copies of the version bits (with its own error correction code),\n    // based on this object's version field, iff 7 <= version <= 40.\n    private drawVersion(): void {\n      if (this.version < 7) return;\n\n      // Calculate error correction code and pack bits\n      let rem: int = this.version; // version is uint6, in the range [7, 40]\n      for (let i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >>> 11) * 0x1f25);\n      const bits: int = (this.version << 12) | rem; // uint18\n      assert(bits >>> 18 == 0);\n\n      // Draw two copies\n      for (let i = 0; i < 18; i++) {\n        const color: boolean = getBit(bits, i);\n        const a: int = this.size - 11 + (i % 3);\n        const b: int = Math.floor(i / 3);\n        this.setFunctionModule(a, b, color);\n        this.setFunctionModule(b, a, color);\n      }\n    }\n\n    // Draws a 9*9 finder pattern including the border separator,\n    // with the center module at (x, y). Modules can be out of bounds.\n    private drawFinderPattern(x: int, y: int): void {\n      for (let dy = -4; dy <= 4; dy++) {\n        for (let dx = -4; dx <= 4; dx++) {\n          const dist: int = Math.max(Math.abs(dx), Math.abs(dy)); // Chebyshev/infinity norm\n          const xx: int = x + dx;\n          const yy: int = y + dy;\n          if (0 <= xx && xx < this.size && 0 <= yy && yy < this.size)\n            this.setFunctionModule(xx, yy, dist != 2 && dist != 4);\n        }\n      }\n    }\n\n    // Draws a 5*5 alignment pattern, with the center module\n    // at (x, y). All modules must be in bounds.\n    private drawAlignmentPattern(x: int, y: int): void {\n      for (let dy = -2; dy <= 2; dy++) {\n        for (let dx = -2; dx <= 2; dx++)\n          this.setFunctionModule(\n            x + dx,\n            y + dy,\n            Math.max(Math.abs(dx), Math.abs(dy)) != 1\n          );\n      }\n    }\n\n    // Sets the color of a module and marks it as a function module.\n    // Only used by the constructor. Coordinates must be in bounds.\n    private setFunctionModule(x: int, y: int, isDark: boolean): void {\n      this.modules[y][x] = isDark;\n      this.isFunction[y][x] = true;\n    }\n\n    /*-- Private helper methods for constructor: Codewords and masking --*/\n\n    // Returns a new byte string representing the given data with the appropriate error correction\n    // codewords appended to it, based on this object's version and error correction level.\n    private addEccAndInterleave(data: Readonly<Array<byte>>): Array<byte> {\n      const ver: int = this.version;\n      const ecl: QrCode.Ecc = this.errorCorrectionLevel;\n      if (data.length != QrCode.getNumDataCodewords(ver, ecl))\n        throw new RangeError('Invalid argument');\n\n      // Calculate parameter numbers\n      const numBlocks: int =\n        QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];\n      const blockEccLen: int = QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver];\n      const rawCodewords: int = Math.floor(\n        QrCode.getNumRawDataModules(ver) / 8\n      );\n      const numShortBlocks: int = numBlocks - (rawCodewords % numBlocks);\n      const shortBlockLen: int = Math.floor(rawCodewords / numBlocks);\n\n      // Split data into blocks and append ECC to each block\n      const blocks: Array<Array<byte>> = [];\n      const rsDiv: Array<byte> = QrCode.reedSolomonComputeDivisor(blockEccLen);\n      for (let i = 0, k = 0; i < numBlocks; i++) {\n        const dat: Array<byte> = data.slice(\n          k,\n          k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1)\n        );\n        k += dat.length;\n        const ecc: Array<byte> = QrCode.reedSolomonComputeRemainder(dat, rsDiv);\n        if (i < numShortBlocks) dat.push(0);\n        blocks.push(dat.concat(ecc));\n      }\n\n      // Interleave (not concatenate) the bytes from every block into a single sequence\n      const result: Array<byte> = [];\n      for (let i = 0; i < blocks[0].length; i++) {\n        blocks.forEach((block, j) => {\n          // Skip the padding byte in short blocks\n          if (i != shortBlockLen - blockEccLen || j >= numShortBlocks)\n            result.push(block[i]);\n        });\n      }\n      assert(result.length == rawCodewords);\n      return result;\n    }\n\n    // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire\n    // data area of this QR Code. Function modules need to be marked off before this is called.\n    private drawCodewords(data: Readonly<Array<byte>>): void {\n      if (\n        data.length != Math.floor(QrCode.getNumRawDataModules(this.version) / 8)\n      )\n        throw new RangeError('Invalid argument');\n      let i: int = 0; // Bit index into the data\n      // Do the funny zigzag scan\n      for (let right = this.size - 1; right >= 1; right -= 2) {\n        // Index of right column in each column pair\n        if (right == 6) right = 5;\n        for (let vert = 0; vert < this.size; vert++) {\n          // Vertical counter\n          for (let j = 0; j < 2; j++) {\n            const x: int = right - j; // Actual x coordinate\n            const upward: boolean = ((right + 1) & 2) == 0;\n            const y: int = upward ? this.size - 1 - vert : vert; // Actual y coordinate\n            if (!this.isFunction[y][x] && i < data.length * 8) {\n              this.modules[y][x] = getBit(data[i >>> 3], 7 - (i & 7));\n              i++;\n            }\n            // If this QR Code has any remainder bits (0 to 7), they were assigned as\n            // 0/false/light by the constructor and are left unchanged by this method\n          }\n        }\n      }\n      assert(i == data.length * 8);\n    }\n\n    // XORs the codeword modules in this QR Code with the given mask pattern.\n    // The function modules must be marked and the codeword bits must be drawn\n    // before masking. Due to the arithmetic of XOR, calling applyMask() with\n    // the same mask value a second time will undo the mask. A final well-formed\n    // QR Code needs exactly one (not zero, two, etc.) mask applied.\n    private applyMask(mask: int): void {\n      if (mask < 0 || mask > 7) throw new RangeError('Mask value out of range');\n      for (let y = 0; y < this.size; y++) {\n        for (let x = 0; x < this.size; x++) {\n          let invert: boolean;\n          switch (mask) {\n            case 0:\n              invert = (x + y) % 2 == 0;\n              break;\n            case 1:\n              invert = y % 2 == 0;\n              break;\n            case 2:\n              invert = x % 3 == 0;\n              break;\n            case 3:\n              invert = (x + y) % 3 == 0;\n              break;\n            case 4:\n              invert = (Math.floor(x / 3) + Math.floor(y / 2)) % 2 == 0;\n              break;\n            case 5:\n              invert = ((x * y) % 2) + ((x * y) % 3) == 0;\n              break;\n            case 6:\n              invert = (((x * y) % 2) + ((x * y) % 3)) % 2 == 0;\n              break;\n            case 7:\n              invert = (((x + y) % 2) + ((x * y) % 3)) % 2 == 0;\n              break;\n            default:\n              throw new Error('Unreachable');\n          }\n          if (!this.isFunction[y][x] && invert)\n            this.modules[y][x] = !this.modules[y][x];\n        }\n      }\n    }\n\n    // Calculates and returns the penalty score based on state of this QR Code's current modules.\n    // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.\n    private getPenaltyScore(): int {\n      let result: int = 0;\n\n      // Adjacent modules in row having same color, and finder-like patterns\n      for (let y = 0; y < this.size; y++) {\n        let runColor = false;\n        let runX = 0;\n        const runHistory = [0, 0, 0, 0, 0, 0, 0];\n        for (let x = 0; x < this.size; x++) {\n          if (this.modules[y][x] == runColor) {\n            runX++;\n            if (runX == 5) result += QrCode.PENALTY_N1;\n            else if (runX > 5) result++;\n          } else {\n            this.finderPenaltyAddHistory(runX, runHistory);\n            if (!runColor)\n              result +=\n                this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;\n            runColor = this.modules[y][x];\n            runX = 1;\n          }\n        }\n        result +=\n          this.finderPenaltyTerminateAndCount(runColor, runX, runHistory) *\n          QrCode.PENALTY_N3;\n      }\n      // Adjacent modules in column having same color, and finder-like patterns\n      for (let x = 0; x < this.size; x++) {\n        let runColor = false;\n        let runY = 0;\n        const runHistory = [0, 0, 0, 0, 0, 0, 0];\n        for (let y = 0; y < this.size; y++) {\n          if (this.modules[y][x] == runColor) {\n            runY++;\n            if (runY == 5) result += QrCode.PENALTY_N1;\n            else if (runY > 5) result++;\n          } else {\n            this.finderPenaltyAddHistory(runY, runHistory);\n            if (!runColor)\n              result +=\n                this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;\n            runColor = this.modules[y][x];\n            runY = 1;\n          }\n        }\n        result +=\n          this.finderPenaltyTerminateAndCount(runColor, runY, runHistory) *\n          QrCode.PENALTY_N3;\n      }\n\n      // 2*2 blocks of modules having same color\n      for (let y = 0; y < this.size - 1; y++) {\n        for (let x = 0; x < this.size - 1; x++) {\n          const color: boolean = this.modules[y][x];\n          if (\n            color == this.modules[y][x + 1] &&\n            color == this.modules[y + 1][x] &&\n            color == this.modules[y + 1][x + 1]\n          )\n            result += QrCode.PENALTY_N2;\n        }\n      }\n\n      // Balance of dark and light modules\n      let dark: int = 0;\n      for (const row of this.modules)\n        dark = row.reduce((sum, color) => sum + (color ? 1 : 0), dark);\n      const total: int = this.size * this.size; // Note that size is odd, so dark/total != 1/2\n      // Compute the smallest integer k >= 0 such that (45-5k)% <= dark/total <= (55+5k)%\n      const k: int = Math.ceil(Math.abs(dark * 20 - total * 10) / total) - 1;\n      assert(0 <= k && k <= 9);\n      result += k * QrCode.PENALTY_N4;\n      assert(0 <= result && result <= 2568888); // Non-tight upper bound based on default values of PENALTY_N1, ..., N4\n      return result;\n    }\n\n    /*-- Private helper functions --*/\n\n    // Returns an ascending list of positions of alignment patterns for this version number.\n    // Each position is in the range [0,177), and are used on both the x and y axes.\n    // This could be implemented as lookup table of 40 variable-length lists of integers.\n    private getAlignmentPatternPositions(): Array<int> {\n      if (this.version == 1) return [];\n      else {\n        const numAlign: int = Math.floor(this.version / 7) + 2;\n        const step: int =\n          this.version == 32\n            ? 26\n            : Math.ceil((this.version * 4 + 4) / (numAlign * 2 - 2)) * 2;\n        const result: Array<int> = [6];\n        for (let pos = this.size - 7; result.length < numAlign; pos -= step)\n          result.splice(1, 0, pos);\n        return result;\n      }\n    }\n\n    // Returns the number of data bits that can be stored in a QR Code of the given version number, after\n    // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.\n    // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.\n    private static getNumRawDataModules(ver: int): int {\n      if (ver < QrCode.MIN_VERSION || ver > QrCode.MAX_VERSION)\n        throw new RangeError('Version number out of range');\n      let result: int = (16 * ver + 128) * ver + 64;\n      if (ver >= 2) {\n        const numAlign: int = Math.floor(ver / 7) + 2;\n        result -= (25 * numAlign - 10) * numAlign - 55;\n        if (ver >= 7) result -= 36;\n      }\n      assert(208 <= result && result <= 29648);\n      return result;\n    }\n\n    // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any\n    // QR Code of the given version number and error correction level, with remainder bits discarded.\n    // This stateless pure function could be implemented as a (40*4)-cell lookup table.\n    private static getNumDataCodewords(ver: int, ecl: QrCode.Ecc): int {\n      return (\n        Math.floor(QrCode.getNumRawDataModules(ver) / 8) -\n        QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] *\n          QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver]\n      );\n    }\n\n    // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be\n    // implemented as a lookup table over all possible parameter values, instead of as an algorithm.\n    private static reedSolomonComputeDivisor(degree: int): Array<byte> {\n      if (degree < 1 || degree > 255)\n        throw new RangeError('Degree out of range');\n      // Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1.\n      // For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array [255, 8, 93].\n      const result: Array<byte> = [];\n      for (let i = 0; i < degree - 1; i++) result.push(0);\n      result.push(1); // Start off with the monomial x^0\n\n      // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),\n      // and drop the highest monomial term which is always 1x^degree.\n      // Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D).\n      let root = 1;\n      for (let i = 0; i < degree; i++) {\n        // Multiply the current product by (x - r^i)\n        for (let j = 0; j < result.length; j++) {\n          result[j] = QrCode.reedSolomonMultiply(result[j], root);\n          if (j + 1 < result.length) result[j] ^= result[j + 1];\n        }\n        root = QrCode.reedSolomonMultiply(root, 0x02);\n      }\n      return result;\n    }\n\n    // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.\n    private static reedSolomonComputeRemainder(\n      data: Readonly<Array<byte>>,\n      divisor: Readonly<Array<byte>>\n    ): Array<byte> {\n      const result: Array<byte> = divisor.map((_) => 0);\n      for (const b of data) {\n        // Polynomial division\n        const factor: byte = b ^ (result.shift() as byte);\n        result.push(0);\n        divisor.forEach(\n          (coef, i) => (result[i] ^= QrCode.reedSolomonMultiply(coef, factor))\n        );\n      }\n      return result;\n    }\n\n    // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result\n    // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.\n    private static reedSolomonMultiply(x: byte, y: byte): byte {\n      if (x >>> 8 != 0 || y >>> 8 != 0)\n        throw new RangeError('Byte out of range');\n      // Russian peasant multiplication\n      let z: int = 0;\n      for (let i = 7; i >= 0; i--) {\n        z = (z << 1) ^ ((z >>> 7) * 0x11d);\n        z ^= ((y >>> i) & 1) * x;\n      }\n      assert(z >>> 8 == 0);\n      return z as byte;\n    }\n\n    // Can only be called immediately after a light run is added, and\n    // returns either 0, 1, or 2. A helper function for getPenaltyScore().\n    private finderPenaltyCountPatterns(runHistory: Readonly<Array<int>>): int {\n      const n: int = runHistory[1];\n      assert(n <= this.size * 3);\n      const core: boolean =\n        n > 0 &&\n        runHistory[2] == n &&\n        runHistory[3] == n * 3 &&\n        runHistory[4] == n &&\n        runHistory[5] == n;\n      return (\n        (core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0) +\n        (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0)\n      );\n    }\n\n    // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().\n    private finderPenaltyTerminateAndCount(\n      currentRunColor: boolean,\n      currentRunLength: int,\n      runHistory: Array<int>\n    ): int {\n      if (currentRunColor) {\n        // Terminate dark run\n        this.finderPenaltyAddHistory(currentRunLength, runHistory);\n        currentRunLength = 0;\n      }\n      currentRunLength += this.size; // Add light border to final run\n      this.finderPenaltyAddHistory(currentRunLength, runHistory);\n      return this.finderPenaltyCountPatterns(runHistory);\n    }\n\n    // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().\n    private finderPenaltyAddHistory(\n      currentRunLength: int,\n      runHistory: Array<int>\n    ): void {\n      if (runHistory[0] == 0) currentRunLength += this.size; // Add light border to initial run\n      runHistory.pop();\n      runHistory.unshift(currentRunLength);\n    }\n\n    /*-- Constants and tables --*/\n\n    // The minimum version number supported in the QR Code Model 2 standard.\n    public static readonly MIN_VERSION: int = 1;\n    // The maximum version number supported in the QR Code Model 2 standard.\n    public static readonly MAX_VERSION: int = 40;\n\n    // For use in getPenaltyScore(), when evaluating which mask is best.\n    private static readonly PENALTY_N1: int = 3;\n    private static readonly PENALTY_N2: int = 3;\n    private static readonly PENALTY_N3: int = 40;\n    private static readonly PENALTY_N4: int = 10;\n\n    private static readonly ECC_CODEWORDS_PER_BLOCK: Array<Array<int>> = [\n      // Version: (note that index 0 is for padding, and is set to an illegal value)\n      //0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level\n      [\n        -1,\n        7,\n        10,\n        15,\n        20,\n        26,\n        18,\n        20,\n        24,\n        30,\n        18,\n        20,\n        24,\n        26,\n        30,\n        22,\n        24,\n        28,\n        30,\n        28,\n        28,\n        28,\n        28,\n        30,\n        30,\n        26,\n        28,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n      ], // Low\n      [\n        -1,\n        10,\n        16,\n        26,\n        18,\n        24,\n        16,\n        18,\n        22,\n        22,\n        26,\n        30,\n        22,\n        22,\n        24,\n        24,\n        28,\n        28,\n        26,\n        26,\n        26,\n        26,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n        28,\n      ], // Medium\n      [\n        -1,\n        13,\n        22,\n        18,\n        26,\n        18,\n        24,\n        18,\n        22,\n        20,\n        24,\n        28,\n        26,\n        24,\n        20,\n        30,\n        24,\n        28,\n        28,\n        26,\n        30,\n        28,\n        30,\n        30,\n        30,\n        30,\n        28,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n      ], // Quartile\n      [\n        -1,\n        17,\n        28,\n        22,\n        16,\n        22,\n        28,\n        26,\n        26,\n        24,\n        28,\n        24,\n        28,\n        22,\n        24,\n        24,\n        30,\n        28,\n        28,\n        26,\n        28,\n        30,\n        24,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n        30,\n      ], // High\n    ];\n\n    private static readonly NUM_ERROR_CORRECTION_BLOCKS: Array<Array<int>> = [\n      // Version: (note that index 0 is for padding, and is set to an illegal value)\n      //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level\n      [\n        -1,\n        1,\n        1,\n        1,\n        1,\n        1,\n        2,\n        2,\n        2,\n        2,\n        4,\n        4,\n        4,\n        4,\n        4,\n        6,\n        6,\n        6,\n        6,\n        7,\n        8,\n        8,\n        9,\n        9,\n        10,\n        12,\n        12,\n        12,\n        13,\n        14,\n        15,\n        16,\n        17,\n        18,\n        19,\n        19,\n        20,\n        21,\n        22,\n        24,\n        25,\n      ], // Low\n      [\n        -1,\n        1,\n        1,\n        1,\n        2,\n        2,\n        4,\n        4,\n        4,\n        5,\n        5,\n        5,\n        8,\n        9,\n        9,\n        10,\n        10,\n        11,\n        13,\n        14,\n        16,\n        17,\n        17,\n        18,\n        20,\n        21,\n        23,\n        25,\n        26,\n        28,\n        29,\n        31,\n        33,\n        35,\n        37,\n        38,\n        40,\n        43,\n        45,\n        47,\n        49,\n      ], // Medium\n      [\n        -1,\n        1,\n        1,\n        2,\n        2,\n        4,\n        4,\n        6,\n        6,\n        8,\n        8,\n        8,\n        10,\n        12,\n        16,\n        12,\n        17,\n        16,\n        18,\n        21,\n        20,\n        23,\n        23,\n        25,\n        27,\n        29,\n        34,\n        34,\n        35,\n        38,\n        40,\n        43,\n        45,\n        48,\n        51,\n        53,\n        56,\n        59,\n        62,\n        65,\n        68,\n      ], // Quartile\n      [\n        -1,\n        1,\n        1,\n        2,\n        4,\n        4,\n        4,\n        5,\n        6,\n        8,\n        8,\n        11,\n        11,\n        16,\n        16,\n        18,\n        16,\n        19,\n        21,\n        25,\n        25,\n        25,\n        34,\n        30,\n        32,\n        35,\n        37,\n        40,\n        42,\n        45,\n        48,\n        51,\n        54,\n        57,\n        60,\n        63,\n        66,\n        70,\n        74,\n        77,\n        81,\n      ], // High\n    ];\n  }\n\n  // Appends the given number of low-order bits of the given value\n  // to the given buffer. Requires 0 <= len <= 31 and 0 <= val < 2^len.\n  function appendBits(val: int, len: int, bb: Array<bit>): void {\n    if (len < 0 || len > 31 || val >>> len != 0)\n      throw new RangeError('Value out of range');\n    for (\n      let i = len - 1;\n      i >= 0;\n      i-- // Append bit by bit\n    )\n      bb.push((val >>> i) & 1);\n  }\n\n  // Returns true iff the i'th bit of x is set to 1.\n  function getBit(x: int, i: int): boolean {\n    return ((x >>> i) & 1) != 0;\n  }\n\n  // Throws an exception if the given condition is false.\n  function assert(cond: boolean): void {\n    if (!cond) throw new Error('Assertion error');\n  }\n\n  /*---- Data segment class ----*/\n\n  /*\n   * A segment of character/binary/control data in a QR Code symbol.\n   * Instances of this class are immutable.\n   * The mid-level way to create a segment is to take the payload data\n   * and call a static factory function such as QrSegment.makeNumeric().\n   * The low-level way to create a segment is to custom-make the bit buffer\n   * and call the QrSegment() constructor with appropriate values.\n   * This segment class imposes no length restrictions, but QR Codes have restrictions.\n   * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data.\n   * Any segment longer than this is meaningless for the purpose of generating QR Codes.\n   */\n  export class QrSegment {\n    /*-- Static factory functions (mid level) --*/\n\n    // Returns a segment representing the given binary data encoded in\n    // byte mode. All input byte arrays are acceptable. Any text string\n    // can be converted to UTF-8 bytes and encoded as a byte mode segment.\n    public static makeBytes(data: Readonly<Array<byte>>): QrSegment {\n      const bb: Array<bit> = [];\n      for (const b of data) appendBits(b, 8, bb);\n      return new QrSegment(QrSegment.Mode.BYTE, data.length, bb);\n    }\n\n    // Returns a segment representing the given string of decimal digits encoded in numeric mode.\n    public static makeNumeric(digits: string): QrSegment {\n      if (!QrSegment.isNumeric(digits))\n        throw new RangeError('String contains non-numeric characters');\n      const bb: Array<bit> = [];\n      for (let i = 0; i < digits.length; ) {\n        // Consume up to 3 digits per iteration\n        const n: int = Math.min(digits.length - i, 3);\n        appendBits(parseInt(digits.substr(i, n), 10), n * 3 + 1, bb);\n        i += n;\n      }\n      return new QrSegment(QrSegment.Mode.NUMERIC, digits.length, bb);\n    }\n\n    // Returns a segment representing the given text string encoded in alphanumeric mode.\n    // The characters allowed are: 0 to 9, A to Z (uppercase only), space,\n    // dollar, percent, asterisk, plus, hyphen, period, slash, colon.\n    public static makeAlphanumeric(text: string): QrSegment {\n      if (!QrSegment.isAlphanumeric(text))\n        throw new RangeError(\n          'String contains unencodable characters in alphanumeric mode'\n        );\n      const bb: Array<bit> = [];\n      let i: int;\n      for (i = 0; i + 2 <= text.length; i += 2) {\n        // Process groups of 2\n        let temp: int =\n          QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45;\n        temp += QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1));\n        appendBits(temp, 11, bb);\n      }\n      if (i < text.length)\n        // 1 character remaining\n        appendBits(\n          QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)),\n          6,\n          bb\n        );\n      return new QrSegment(QrSegment.Mode.ALPHANUMERIC, text.length, bb);\n    }\n\n    // Returns a new mutable list of zero or more segments to represent the given Unicode text string.\n    // The result may use various segment modes and switch modes to optimize the length of the bit stream.\n    public static makeSegments(text: string): Array<QrSegment> {\n      // Select the most efficient segment encoding automatically\n      if (text == '') return [];\n      else if (QrSegment.isNumeric(text)) return [QrSegment.makeNumeric(text)];\n      else if (QrSegment.isAlphanumeric(text))\n        return [QrSegment.makeAlphanumeric(text)];\n      else return [QrSegment.makeBytes(QrSegment.toUtf8ByteArray(text))];\n    }\n\n    // Returns a segment representing an Extended Channel Interpretation\n    // (ECI) designator with the given assignment value.\n    public static makeEci(assignVal: int): QrSegment {\n      const bb: Array<bit> = [];\n      if (assignVal < 0)\n        throw new RangeError('ECI assignment value out of range');\n      else if (assignVal < 1 << 7) appendBits(assignVal, 8, bb);\n      else if (assignVal < 1 << 14) {\n        appendBits(0b10, 2, bb);\n        appendBits(assignVal, 14, bb);\n      } else if (assignVal < 1000000) {\n        appendBits(0b110, 3, bb);\n        appendBits(assignVal, 21, bb);\n      } else throw new RangeError('ECI assignment value out of range');\n      return new QrSegment(QrSegment.Mode.ECI, 0, bb);\n    }\n\n    // Tests whether the given string can be encoded as a segment in numeric mode.\n    // A string is encodable iff each character is in the range 0 to 9.\n    public static isNumeric(text: string): boolean {\n      return QrSegment.NUMERIC_REGEX.test(text);\n    }\n\n    // Tests whether the given string can be encoded as a segment in alphanumeric mode.\n    // A string is encodable iff each character is in the following set: 0 to 9, A to Z\n    // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.\n    public static isAlphanumeric(text: string): boolean {\n      return QrSegment.ALPHANUMERIC_REGEX.test(text);\n    }\n\n    /*-- Constructor (low level) and fields --*/\n    public readonly mode: QrSegment.Mode;\n\n    // The length of this segment's unencoded data. Measured in characters for\n    // numeric/alphanumeric/kanji mode, bytes for byte mode, and 0 for ECI mode.\n    // Always zero or positive. Not the same as the data's bit length.\n    public readonly numChars: int;\n\n    // The data bits of this segment. Accessed through getData().\n    private readonly bitData: Array<bit>;\n\n    // Creates a new QR Code segment with the given attributes and data.\n    // The character count (numChars) must agree with the mode and the bit buffer length,\n    // but the constraint isn't checked. The given bit buffer is cloned and stored.\n    public constructor(\n      // The mode indicator of this segment.\n      mode: QrSegment.Mode,\n\n      // The length of this segment's unencoded data. Measured in characters for\n      // numeric/alphanumeric/kanji mode, bytes for byte mode, and 0 for ECI mode.\n      // Always zero or positive. Not the same as the data's bit length.\n      numChars: int,\n\n      // The data bits of this segment. Accessed through getData().\n      bitData: Array<bit>\n    ) {\n      this.mode = mode;\n      this.numChars = numChars;\n      this.bitData = bitData;\n      if (numChars < 0) throw new RangeError('Invalid argument');\n      this.bitData = bitData.slice(); // Make defensive copy\n    }\n\n    /*-- Methods --*/\n\n    // Returns a new copy of the data bits of this segment.\n    public getData(): Array<bit> {\n      return this.bitData.slice(); // Make defensive copy\n    }\n\n    // (Package-private) Calculates and returns the number of bits needed to encode the given segments at\n    // the given version. The result is infinity if a segment has too many characters to fit its length field.\n    public static getTotalBits(\n      segs: Readonly<Array<QrSegment>>,\n      version: int\n    ): number {\n      let result = 0;\n      for (const seg of segs) {\n        const ccbits: int = seg.mode.numCharCountBits(version);\n        if (seg.numChars >= 1 << ccbits) return Infinity; // The segment's length doesn't fit the field's bit width\n        result += 4 + ccbits + seg.bitData.length;\n      }\n      return result;\n    }\n\n    // Returns a new array of bytes representing the given string encoded in UTF-8.\n    private static toUtf8ByteArray(str: string): Array<byte> {\n      str = encodeURI(str);\n      const result: Array<byte> = [];\n      for (let i = 0; i < str.length; i++) {\n        if (str.charAt(i) != '%') result.push(str.charCodeAt(i));\n        else {\n          result.push(parseInt(str.substr(i + 1, 2), 16));\n          i += 2;\n        }\n      }\n      return result;\n    }\n\n    /*-- Constants --*/\n\n    // Describes precisely all strings that are encodable in numeric mode.\n    private static readonly NUMERIC_REGEX: RegExp = /^[0-9]*$/;\n\n    // Describes precisely all strings that are encodable in alphanumeric mode.\n    private static readonly ALPHANUMERIC_REGEX: RegExp = /^[A-Z0-9 $%*+.\\/:-]*$/;\n\n    // The set of all legal characters in alphanumeric mode,\n    // where each character value maps to the index in the string.\n    private static readonly ALPHANUMERIC_CHARSET: string =\n      '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:';\n  }\n}\n\n/*---- Public helper enumeration ----*/\n// eslint-disable-next-line @typescript-eslint/no-namespace\nnamespace qrcodegen.QrCode {\n  type int = number;\n\n  /*\n   * The error correction level in a QR Code symbol. Immutable.\n   */\n  export class Ecc {\n    /*-- Constants --*/\n\n    public static readonly LOW = new Ecc(0, 1); // The QR Code can tolerate about  7% erroneous codewords\n    public static readonly MEDIUM = new Ecc(1, 0); // The QR Code can tolerate about 15% erroneous codewords\n    public static readonly QUARTILE = new Ecc(2, 3); // The QR Code can tolerate about 25% erroneous codewords\n    public static readonly HIGH = new Ecc(3, 2); // The QR Code can tolerate about 30% erroneous codewords\n\n    /*-- Constructor and fields --*/\n\n    // In the range 0 to 3 (unsigned 2-bit integer).\n    public readonly ordinal: int;\n    // (Package-private) In the range 0 to 3 (unsigned 2-bit integer).\n    public readonly formatBits: int;\n    private constructor(\n      // In the range 0 to 3 (unsigned 2-bit integer).\n      ordinal: int,\n      // (Package-private) In the range 0 to 3 (unsigned 2-bit integer).\n      formatBits: int\n    ) {\n      this.ordinal = ordinal;\n      this.formatBits = formatBits;\n    }\n  }\n}\n\n/*---- Public helper enumeration ----*/\n// eslint-disable-next-line @typescript-eslint/no-namespace\nnamespace qrcodegen.QrSegment {\n  type int = number;\n\n  /*\n   * Describes how a segment's data bits are interpreted. Immutable.\n   */\n  export class Mode {\n    /*-- Constants --*/\n\n    public static readonly NUMERIC = new Mode(0x1, [10, 12, 14]);\n    public static readonly ALPHANUMERIC = new Mode(0x2, [9, 11, 13]);\n    public static readonly BYTE = new Mode(0x4, [8, 16, 16]);\n    public static readonly KANJI = new Mode(0x8, [8, 10, 12]);\n    public static readonly ECI = new Mode(0x7, [0, 0, 0]);\n\n    /*-- Constructor and fields --*/\n\n    // The mode indicator bits, which is a uint4 value (range 0 to 15).\n    public readonly modeBits: int;\n    // Number of character count bits for three different version ranges.\n    private readonly numBitsCharCount: [int, int, int];\n\n    private constructor(\n      // The mode indicator bits, which is a uint4 value (range 0 to 15).\n      modeBits: int,\n      // Number of character count bits for three different version ranges.\n      numBitsCharCount: [int, int, int]\n    ) {\n      this.modeBits = modeBits;\n      this.numBitsCharCount = numBitsCharCount;\n    }\n\n    /*-- Method --*/\n\n    // (Package-private) Returns the bit width of the character count field for a segment in\n    // this mode in a QR Code at the given version number. The result is in the range [0, 16].\n    public numCharCountBits(ver: int): int {\n      return this.numBitsCharCount[Math.floor((ver + 7) / 17)];\n    }\n  }\n}\n\n// Modification to export for actual use\nexport default qrcodegen;\n"],
+  "mappings": ";;;;;;;AAAA;AAAA;AAAA;AAAA;AACA;AAAA;AAAA;AAAA;AAAA;AAQA,IAAU;AAAV,UAAU,YAAV;AAuBS,wBAAa;AAAA,IAuJX,YAGL,SAGA,sBAEA,eAEA,KACA;AAtBe,qBAAiC;AAGjC,wBAAoC;AAoBnD,WAAK,UAAU;AACf,WAAK,uBAAuB;AAE5B,UAAI,UAAU,QAAO,eAAe,UAAU,QAAO;AACnD,cAAM,IAAI,WAAW;AACvB,UAAI,MAAM,MAAM,MAAM;AAAG,cAAM,IAAI,WAAW;AAC9C,WAAK,OAAO,UAAU,IAAI;AAG1B,YAAM,MAAsB;AAC5B,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM;AAAK,YAAI,KAAK;AAC7C,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,aAAK,QAAQ,KAAK,IAAI;AACtB,aAAK,WAAW,KAAK,IAAI;AAAA;AAI3B,WAAK;AACL,YAAM,eAA4B,KAAK,oBAAoB;AAC3D,WAAK,cAAc;AAGnB,UAAI,OAAO,IAAI;AAEb,YAAI,aAAkB;AACtB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAK,UAAU;AACf,eAAK,eAAe;AACpB,gBAAM,UAAe,KAAK;AAC1B,cAAI,UAAU,YAAY;AACxB,kBAAM;AACN,yBAAa;AAAA;AAEf,eAAK,UAAU;AAAA;AAAA;AAGnB,aAAO,KAAK,OAAO,OAAO;AAC1B,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,WAAK,eAAe;AAEpB,WAAK,aAAa;AAAA;AAAA,WApMN,WAAW,MAAc,KAAyB;AAC9D,YAAM,OAAyB,WAAU,UAAU,aAAa;AAChE,aAAO,QAAO,eAAe,MAAM;AAAA;AAAA,WAOvB,aACZ,MACA,KACQ;AACR,YAAM,MAAiB,WAAU,UAAU,UAAU;AACrD,aAAO,QAAO,eAAe,CAAC,MAAM;AAAA;AAAA,WAcxB,eACZ,MACA,KACA,aAAkB,GAClB,aAAkB,IAClB,OAAY,IACZ,WAAW,MACH;AACR,UACE,CACE,SAAO,eAAe,cACtB,cAAc,cACd,cAAc,QAAO,gBAEvB,OAAO,MACP,OAAO;AAEP,cAAM,IAAI,WAAW;AAGvB,UAAI;AACJ,UAAI;AACJ,WAAK,UAAU,cAAc,WAAW;AACtC,cAAM,oBACJ,QAAO,oBAAoB,SAAS,OAAO;AAC7C,cAAM,WAAmB,UAAU,aAAa,MAAM;AACtD,YAAI,YAAY,mBAAkB;AAChC,yBAAe;AACf;AAAA;AAEF,YAAI,WAAW;AAEb,gBAAM,IAAI,WAAW;AAAA;AAIzB,iBAAW,UAAU;AAAA,QACnB,QAAO,IAAI;AAAA,QACX,QAAO,IAAI;AAAA,QACX,QAAO,IAAI;AAAA,SACV;AAED,YACE,YACA,gBAAgB,QAAO,oBAAoB,SAAS,UAAU;AAE9D,gBAAM;AAAA;AAIV,YAAM,KAAiB;AACvB,iBAAW,OAAO,MAAM;AACtB,mBAAW,IAAI,KAAK,UAAU,GAAG;AACjC,mBAAW,IAAI,UAAU,IAAI,KAAK,iBAAiB,UAAU;AAC7D,mBAAW,KAAK,IAAI;AAAW,aAAG,KAAK;AAAA;AAEzC,aAAO,GAAG,UAAU;AAGpB,YAAM,mBACJ,QAAO,oBAAoB,SAAS,OAAO;AAC7C,aAAO,GAAG,UAAU;AACpB,iBAAW,GAAG,KAAK,IAAI,GAAG,mBAAmB,GAAG,SAAS;AACzD,iBAAW,GAAI,KAAK,GAAG,SAAS,KAAM,GAAG;AACzC,aAAO,GAAG,SAAS,KAAK;AAGxB,eACM,UAAU,KACd,GAAG,SAAS,kBACZ,WAAW,MAAO;AAElB,mBAAW,SAAS,GAAG;AAGzB,YAAM,gBAA6B;AACnC,aAAO,cAAc,SAAS,IAAI,GAAG;AAAQ,sBAAc,KAAK;AAChE,SAAG,QACD,CAAC,GAAQ,MAAY,cAAc,MAAM,MAAM,KAAM,IAAK,KAAI;AAIhE,aAAO,IAAI,QAAO,SAAS,KAAK,eAAe;AAAA;AAAA,IA8F1C,UAAU,GAAQ,GAAiB;AACxC,aACE,KAAK,KAAK,IAAI,KAAK,QAAQ,KAAK,KAAK,IAAI,KAAK,QAAQ,KAAK,QAAQ,GAAG;AAAA;AAAA,IAKnE,aAAa;AAClB,aAAO,KAAK;AAAA;AAAA,IAMN,uBAA6B;AAEnC,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,aAAK,kBAAkB,GAAG,GAAG,IAAI,KAAK;AACtC,aAAK,kBAAkB,GAAG,GAAG,IAAI,KAAK;AAAA;AAIxC,WAAK,kBAAkB,GAAG;AAC1B,WAAK,kBAAkB,KAAK,OAAO,GAAG;AACtC,WAAK,kBAAkB,GAAG,KAAK,OAAO;AAGtC,YAAM,cAA0B,KAAK;AACrC,YAAM,WAAgB,YAAY;AAClC,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,cACE,CACG,MAAK,KAAK,KAAK,KACf,KAAK,KAAK,KAAK,WAAW,KAC1B,KAAK,WAAW,KAAK,KAAK;AAG7B,iBAAK,qBAAqB,YAAY,IAAI,YAAY;AAAA;AAAA;AAK5D,WAAK,eAAe;AACpB,WAAK;AAAA;AAAA,IAKC,eAAe,MAAiB;AAEtC,YAAM,OAAa,KAAK,qBAAqB,cAAc,IAAK;AAChE,UAAI,MAAW;AACf,eAAS,IAAI,GAAG,IAAI,IAAI;AAAK,cAAO,OAAO,IAAO,SAAQ,KAAK;AAC/D,YAAM,OAAS,SAAQ,KAAM,OAAO;AACpC,aAAO,SAAS,MAAM;AAGtB,eAAS,IAAI,GAAG,KAAK,GAAG;AACtB,aAAK,kBAAkB,GAAG,GAAG,OAAO,MAAM;AAC5C,WAAK,kBAAkB,GAAG,GAAG,OAAO,MAAM;AAC1C,WAAK,kBAAkB,GAAG,GAAG,OAAO,MAAM;AAC1C,WAAK,kBAAkB,GAAG,GAAG,OAAO,MAAM;AAC1C,eAAS,IAAI,GAAG,IAAI,IAAI;AACtB,aAAK,kBAAkB,KAAK,GAAG,GAAG,OAAO,MAAM;AAGjD,eAAS,IAAI,GAAG,IAAI,GAAG;AACrB,aAAK,kBAAkB,KAAK,OAAO,IAAI,GAAG,GAAG,OAAO,MAAM;AAC5D,eAAS,IAAI,GAAG,IAAI,IAAI;AACtB,aAAK,kBAAkB,GAAG,KAAK,OAAO,KAAK,GAAG,OAAO,MAAM;AAC7D,WAAK,kBAAkB,GAAG,KAAK,OAAO,GAAG;AAAA;AAAA,IAKnC,cAAoB;AAC1B,UAAI,KAAK,UAAU;AAAG;AAGtB,UAAI,MAAW,KAAK;AACpB,eAAS,IAAI,GAAG,IAAI,IAAI;AAAK,cAAO,OAAO,IAAO,SAAQ,MAAM;AAChE,YAAM,OAAa,KAAK,WAAW,KAAM;AACzC,aAAO,SAAS,MAAM;AAGtB,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,cAAM,QAAiB,OAAO,MAAM;AACpC,cAAM,IAAS,KAAK,OAAO,KAAM,IAAI;AACrC,cAAM,IAAS,KAAK,MAAM,IAAI;AAC9B,aAAK,kBAAkB,GAAG,GAAG;AAC7B,aAAK,kBAAkB,GAAG,GAAG;AAAA;AAAA;AAAA,IAMzB,kBAAkB,GAAQ,GAAc;AAC9C,eAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,iBAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,gBAAM,OAAY,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI;AAClD,gBAAM,KAAU,IAAI;AACpB,gBAAM,KAAU,IAAI;AACpB,cAAI,KAAK,MAAM,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK,KAAK;AACpD,iBAAK,kBAAkB,IAAI,IAAI,QAAQ,KAAK,QAAQ;AAAA;AAAA;AAAA;AAAA,IAOpD,qBAAqB,GAAQ,GAAc;AACjD,eAAS,KAAK,IAAI,MAAM,GAAG,MAAM;AAC/B,iBAAS,KAAK,IAAI,MAAM,GAAG;AACzB,eAAK,kBACH,IAAI,IACJ,IAAI,IACJ,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA,IAOxC,kBAAkB,GAAQ,GAAQ,QAAuB;AAC/D,WAAK,QAAQ,GAAG,KAAK;AACrB,WAAK,WAAW,GAAG,KAAK;AAAA;AAAA,IAOlB,oBAAoB,MAA0C;AACpE,YAAM,MAAW,KAAK;AACtB,YAAM,MAAkB,KAAK;AAC7B,UAAI,KAAK,UAAU,QAAO,oBAAoB,KAAK;AACjD,cAAM,IAAI,WAAW;AAGvB,YAAM,YACJ,QAAO,4BAA4B,IAAI,SAAS;AAClD,YAAM,cAAmB,QAAO,wBAAwB,IAAI,SAAS;AACrE,YAAM,eAAoB,KAAK,MAC7B,QAAO,qBAAqB,OAAO;AAErC,YAAM,iBAAsB,YAAa,eAAe;AACxD,YAAM,gBAAqB,KAAK,MAAM,eAAe;AAGrD,YAAM,SAA6B;AACnC,YAAM,QAAqB,QAAO,0BAA0B;AAC5D,eAAS,IAAI,GAAG,IAAI,GAAG,IAAI,WAAW,KAAK;AACzC,cAAM,MAAmB,KAAK,MAC5B,GACA,IAAI,gBAAgB,cAAe,KAAI,iBAAiB,IAAI;AAE9D,aAAK,IAAI;AACT,cAAM,MAAmB,QAAO,4BAA4B,KAAK;AACjE,YAAI,IAAI;AAAgB,cAAI,KAAK;AACjC,eAAO,KAAK,IAAI,OAAO;AAAA;AAIzB,YAAM,SAAsB;AAC5B,eAAS,IAAI,GAAG,IAAI,OAAO,GAAG,QAAQ,KAAK;AACzC,eAAO,QAAQ,CAAC,OAAO,MAAM;AAE3B,cAAI,KAAK,gBAAgB,eAAe,KAAK;AAC3C,mBAAO,KAAK,MAAM;AAAA;AAAA;AAGxB,aAAO,OAAO,UAAU;AACxB,aAAO;AAAA;AAAA,IAKD,cAAc,MAAmC;AACvD,UACE,KAAK,UAAU,KAAK,MAAM,QAAO,qBAAqB,KAAK,WAAW;AAEtE,cAAM,IAAI,WAAW;AACvB,UAAI,IAAS;AAEb,eAAS,QAAQ,KAAK,OAAO,GAAG,SAAS,GAAG,SAAS,GAAG;AAEtD,YAAI,SAAS;AAAG,kBAAQ;AACxB,iBAAS,OAAO,GAAG,OAAO,KAAK,MAAM,QAAQ;AAE3C,mBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,kBAAM,IAAS,QAAQ;AACvB,kBAAM,SAAoB,SAAQ,IAAK,MAAM;AAC7C,kBAAM,IAAS,SAAS,KAAK,OAAO,IAAI,OAAO;AAC/C,gBAAI,CAAC,KAAK,WAAW,GAAG,MAAM,IAAI,KAAK,SAAS,GAAG;AACjD,mBAAK,QAAQ,GAAG,KAAK,OAAO,KAAK,MAAM,IAAI,IAAK,KAAI;AACpD;AAAA;AAAA;AAAA;AAAA;AAOR,aAAO,KAAK,KAAK,SAAS;AAAA;AAAA,IAQpB,UAAU,MAAiB;AACjC,UAAI,OAAO,KAAK,OAAO;AAAG,cAAM,IAAI,WAAW;AAC/C,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,cAAI;AACJ,kBAAQ;AAAA,iBACD;AACH,uBAAU,KAAI,KAAK,KAAK;AACxB;AAAA,iBACG;AACH,uBAAS,IAAI,KAAK;AAClB;AAAA,iBACG;AACH,uBAAS,IAAI,KAAK;AAClB;AAAA,iBACG;AACH,uBAAU,KAAI,KAAK,KAAK;AACxB;AAAA,iBACG;AACH,uBAAU,MAAK,MAAM,IAAI,KAAK,KAAK,MAAM,IAAI,MAAM,KAAK;AACxD;AAAA,iBACG;AACH,uBAAW,IAAI,IAAK,IAAO,IAAI,IAAK,KAAM;AAC1C;AAAA,iBACG;AACH,uBAAY,KAAI,IAAK,IAAO,IAAI,IAAK,KAAM,KAAK;AAChD;AAAA,iBACG;AACH,uBAAY,MAAI,KAAK,IAAO,IAAI,IAAK,KAAM,KAAK;AAChD;AAAA;AAEA,oBAAM,IAAI,MAAM;AAAA;AAEpB,cAAI,CAAC,KAAK,WAAW,GAAG,MAAM;AAC5B,iBAAK,QAAQ,GAAG,KAAK,CAAC,KAAK,QAAQ,GAAG;AAAA;AAAA;AAAA;AAAA,IAOtC,kBAAuB;AAC7B,UAAI,SAAc;AAGlB,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,YAAI,WAAW;AACf,YAAI,OAAO;AACX,cAAM,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACtC,iBAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,cAAI,KAAK,QAAQ,GAAG,MAAM,UAAU;AAClC;AACA,gBAAI,QAAQ;AAAG,wBAAU,QAAO;AAAA,qBACvB,OAAO;AAAG;AAAA,iBACd;AACL,iBAAK,wBAAwB,MAAM;AACnC,gBAAI,CAAC;AACH,wBACE,KAAK,2BAA2B,cAAc,QAAO;AACzD,uBAAW,KAAK,QAAQ,GAAG;AAC3B,mBAAO;AAAA;AAAA;AAGX,kBACE,KAAK,+BAA+B,UAAU,MAAM,cACpD,QAAO;AAAA;AAGX,eAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,YAAI,WAAW;AACf,YAAI,OAAO;AACX,cAAM,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACtC,iBAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,cAAI,KAAK,QAAQ,GAAG,MAAM,UAAU;AAClC;AACA,gBAAI,QAAQ;AAAG,wBAAU,QAAO;AAAA,qBACvB,OAAO;AAAG;AAAA,iBACd;AACL,iBAAK,wBAAwB,MAAM;AACnC,gBAAI,CAAC;AACH,wBACE,KAAK,2BAA2B,cAAc,QAAO;AACzD,uBAAW,KAAK,QAAQ,GAAG;AAC3B,mBAAO;AAAA;AAAA;AAGX,kBACE,KAAK,+BAA+B,UAAU,MAAM,cACpD,QAAO;AAAA;AAIX,eAAS,IAAI,GAAG,IAAI,KAAK,OAAO,GAAG,KAAK;AACtC,iBAAS,IAAI,GAAG,IAAI,KAAK,OAAO,GAAG,KAAK;AACtC,gBAAM,QAAiB,KAAK,QAAQ,GAAG;AACvC,cACE,SAAS,KAAK,QAAQ,GAAG,IAAI,MAC7B,SAAS,KAAK,QAAQ,IAAI,GAAG,MAC7B,SAAS,KAAK,QAAQ,IAAI,GAAG,IAAI;AAEjC,sBAAU,QAAO;AAAA;AAAA;AAKvB,UAAI,OAAY;AAChB,iBAAW,OAAO,KAAK;AACrB,eAAO,IAAI,OAAO,CAAC,KAAK,UAAU,MAAO,SAAQ,IAAI,IAAI;AAC3D,YAAM,QAAa,KAAK,OAAO,KAAK;AAEpC,YAAM,IAAS,KAAK,KAAK,KAAK,IAAI,OAAO,KAAK,QAAQ,MAAM,SAAS;AACrE,aAAO,KAAK,KAAK,KAAK;AACtB,gBAAU,IAAI,QAAO;AACrB,aAAO,KAAK,UAAU,UAAU;AAChC,aAAO;AAAA;AAAA,IAQD,+BAA2C;AACjD,UAAI,KAAK,WAAW;AAAG,eAAO;AAAA,WACzB;AACH,cAAM,WAAgB,KAAK,MAAM,KAAK,UAAU,KAAK;AACrD,cAAM,OACJ,KAAK,WAAW,KACZ,KACA,KAAK,KAAM,MAAK,UAAU,IAAI,KAAM,YAAW,IAAI,MAAM;AAC/D,cAAM,SAAqB,CAAC;AAC5B,iBAAS,MAAM,KAAK,OAAO,GAAG,OAAO,SAAS,UAAU,OAAO;AAC7D,iBAAO,OAAO,GAAG,GAAG;AACtB,eAAO;AAAA;AAAA;AAAA,WAOI,qBAAqB,KAAe;AACjD,UAAI,MAAM,QAAO,eAAe,MAAM,QAAO;AAC3C,cAAM,IAAI,WAAW;AACvB,UAAI,SAAe,MAAK,MAAM,OAAO,MAAM;AAC3C,UAAI,OAAO,GAAG;AACZ,cAAM,WAAgB,KAAK,MAAM,MAAM,KAAK;AAC5C,kBAAW,MAAK,WAAW,MAAM,WAAW;AAC5C,YAAI,OAAO;AAAG,oBAAU;AAAA;AAE1B,aAAO,OAAO,UAAU,UAAU;AAClC,aAAO;AAAA;AAAA,WAMM,oBAAoB,KAAU,KAAsB;AACjE,aACE,KAAK,MAAM,QAAO,qBAAqB,OAAO,KAC9C,QAAO,wBAAwB,IAAI,SAAS,OAC1C,QAAO,4BAA4B,IAAI,SAAS;AAAA;AAAA,WAMvC,0BAA0B,QAA0B;AACjE,UAAI,SAAS,KAAK,SAAS;AACzB,cAAM,IAAI,WAAW;AAGvB,YAAM,SAAsB;AAC5B,eAAS,IAAI,GAAG,IAAI,SAAS,GAAG;AAAK,eAAO,KAAK;AACjD,aAAO,KAAK;AAKZ,UAAI,OAAO;AACX,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAE/B,iBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,iBAAO,KAAK,QAAO,oBAAoB,OAAO,IAAI;AAClD,cAAI,IAAI,IAAI,OAAO;AAAQ,mBAAO,MAAM,OAAO,IAAI;AAAA;AAErD,eAAO,QAAO,oBAAoB,MAAM;AAAA;AAE1C,aAAO;AAAA;AAAA,WAIM,4BACb,MACA,SACa;AACb,YAAM,SAAsB,QAAQ,IAAI,CAAC,MAAM;AAC/C,iBAAW,KAAK,MAAM;AAEpB,cAAM,SAAe,IAAK,OAAO;AACjC,eAAO,KAAK;AACZ,gBAAQ,QACN,CAAC,MAAM,MAAO,OAAO,MAAM,QAAO,oBAAoB,MAAM;AAAA;AAGhE,aAAO;AAAA;AAAA,WAKM,oBAAoB,GAAS,GAAe;AACzD,UAAI,MAAM,KAAK,KAAK,MAAM,KAAK;AAC7B,cAAM,IAAI,WAAW;AAEvB,UAAI,IAAS;AACb,eAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAK,KAAK,IAAO,OAAM,KAAK;AAC5B,aAAO,OAAM,IAAK,KAAK;AAAA;AAEzB,aAAO,MAAM,KAAK;AAClB,aAAO;AAAA;AAAA,IAKD,2BAA2B,YAAuC;AACxE,YAAM,IAAS,WAAW;AAC1B,aAAO,KAAK,KAAK,OAAO;AACxB,YAAM,OACJ,IAAI,KACJ,WAAW,MAAM,KACjB,WAAW,MAAM,IAAI,KACrB,WAAW,MAAM,KACjB,WAAW,MAAM;AACnB,aACG,SAAQ,WAAW,MAAM,IAAI,KAAK,WAAW,MAAM,IAAI,IAAI,KAC3D,SAAQ,WAAW,MAAM,IAAI,KAAK,WAAW,MAAM,IAAI,IAAI;AAAA;AAAA,IAKxD,+BACN,iBACA,kBACA,YACK;AACL,UAAI,iBAAiB;AAEnB,aAAK,wBAAwB,kBAAkB;AAC/C,2BAAmB;AAAA;AAErB,0BAAoB,KAAK;AACzB,WAAK,wBAAwB,kBAAkB;AAC/C,aAAO,KAAK,2BAA2B;AAAA;AAAA,IAIjC,wBACN,kBACA,YACM;AACN,UAAI,WAAW,MAAM;AAAG,4BAAoB,KAAK;AACjD,iBAAW;AACX,iBAAW,QAAQ;AAAA;AAAA;AA9qBhB;AAorBkB,EAprBlB,OAorBkB,cAAmB;AAEnB,EAtrBlB,OAsrBkB,cAAmB;AAGlB,EAzrBnB,OAyrBmB,aAAkB;AAClB,EA1rBnB,OA0rBmB,aAAkB;AAClB,EA3rBnB,OA2rBmB,aAAkB;AAClB,EA5rBnB,OA4rBmB,aAAkB;AAElB,EA9rBnB,OA8rBmB,0BAA6C;AAAA,IAGnE;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAEF;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAEF;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAEF;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA;AAIoB,EA/2BnB,OA+2BmB,8BAAiD;AAAA,IAGvE;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAEF;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAEF;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAEF;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA;AA5hCC,aAAM;AAmiCb,sBAAoB,KAAU,KAAU,IAAsB;AAC5D,QAAI,MAAM,KAAK,MAAM,MAAM,QAAQ,OAAO;AACxC,YAAM,IAAI,WAAW;AACvB,aACM,IAAI,MAAM,GACd,KAAK,GACL;AAEA,SAAG,KAAM,QAAQ,IAAK;AAAA;AAI1B,kBAAgB,GAAQ,GAAiB;AACvC,WAAS,OAAM,IAAK,MAAM;AAAA;AAI5B,kBAAgB,MAAqB;AACnC,QAAI,CAAC;AAAM,YAAM,IAAI,MAAM;AAAA;AAgBtB,2BAAgB;AAAA,WAMP,UAAU,MAAwC;AAC9D,YAAM,KAAiB;AACvB,iBAAW,KAAK;AAAM,mBAAW,GAAG,GAAG;AACvC,aAAO,IAAI,WAAU,WAAU,KAAK,MAAM,KAAK,QAAQ;AAAA;AAAA,WAI3C,YAAY,QAA2B;AACnD,UAAI,CAAC,WAAU,UAAU;AACvB,cAAM,IAAI,WAAW;AACvB,YAAM,KAAiB;AACvB,eAAS,IAAI,GAAG,IAAI,OAAO,UAAU;AAEnC,cAAM,IAAS,KAAK,IAAI,OAAO,SAAS,GAAG;AAC3C,mBAAW,SAAS,OAAO,OAAO,GAAG,IAAI,KAAK,IAAI,IAAI,GAAG;AACzD,aAAK;AAAA;AAEP,aAAO,IAAI,WAAU,WAAU,KAAK,SAAS,OAAO,QAAQ;AAAA;AAAA,WAMhD,iBAAiB,MAAyB;AACtD,UAAI,CAAC,WAAU,eAAe;AAC5B,cAAM,IAAI,WACR;AAEJ,YAAM,KAAiB;AACvB,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK,GAAG;AAExC,YAAI,OACF,WAAU,qBAAqB,QAAQ,KAAK,OAAO,MAAM;AAC3D,gBAAQ,WAAU,qBAAqB,QAAQ,KAAK,OAAO,IAAI;AAC/D,mBAAW,MAAM,IAAI;AAAA;AAEvB,UAAI,IAAI,KAAK;AAEX,mBACE,WAAU,qBAAqB,QAAQ,KAAK,OAAO,KACnD,GACA;AAEJ,aAAO,IAAI,WAAU,WAAU,KAAK,cAAc,KAAK,QAAQ;AAAA;AAAA,WAKnD,aAAa,MAAgC;AAEzD,UAAI,QAAQ;AAAI,eAAO;AAAA,eACd,WAAU,UAAU;AAAO,eAAO,CAAC,WAAU,YAAY;AAAA,eACzD,WAAU,eAAe;AAChC,eAAO,CAAC,WAAU,iBAAiB;AAAA;AAChC,eAAO,CAAC,WAAU,UAAU,WAAU,gBAAgB;AAAA;AAAA,WAK/C,QAAQ,WAA2B;AAC/C,YAAM,KAAiB;AACvB,UAAI,YAAY;AACd,cAAM,IAAI,WAAW;AAAA,eACd,YAAY,KAAK;AAAG,mBAAW,WAAW,GAAG;AAAA,eAC7C,YAAY,KAAK,IAAI;AAC5B,mBAAW,GAAM,GAAG;AACpB,mBAAW,WAAW,IAAI;AAAA,iBACjB,YAAY,KAAS;AAC9B,mBAAW,GAAO,GAAG;AACrB,mBAAW,WAAW,IAAI;AAAA;AACrB,cAAM,IAAI,WAAW;AAC5B,aAAO,IAAI,WAAU,WAAU,KAAK,KAAK,GAAG;AAAA;AAAA,WAKhC,UAAU,MAAuB;AAC7C,aAAO,WAAU,cAAc,KAAK;AAAA;AAAA,WAMxB,eAAe,MAAuB;AAClD,aAAO,WAAU,mBAAmB,KAAK;AAAA;AAAA,IAiBpC,YAEL,MAKA,UAGA,SACA;AACA,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,UAAI,WAAW;AAAG,cAAM,IAAI,WAAW;AACvC,WAAK,UAAU,QAAQ;AAAA;AAAA,IAMlB,UAAsB;AAC3B,aAAO,KAAK,QAAQ;AAAA;AAAA,WAKR,aACZ,MACA,SACQ;AACR,UAAI,SAAS;AACb,iBAAW,OAAO,MAAM;AACtB,cAAM,SAAc,IAAI,KAAK,iBAAiB;AAC9C,YAAI,IAAI,YAAY,KAAK;AAAQ,iBAAO;AACxC,kBAAU,IAAI,SAAS,IAAI,QAAQ;AAAA;AAErC,aAAO;AAAA;AAAA,WAIM,gBAAgB,KAA0B;AACvD,YAAM,UAAU;AAChB,YAAM,SAAsB;AAC5B,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAI,IAAI,OAAO,MAAM;AAAK,iBAAO,KAAK,IAAI,WAAW;AAAA,aAChD;AACH,iBAAO,KAAK,SAAS,IAAI,OAAO,IAAI,GAAG,IAAI;AAC3C,eAAK;AAAA;AAAA;AAGT,aAAO;AAAA;AAAA;AAhKJ;AAsKmB,EAtKnB,UAsKmB,gBAAwB;AAGxB,EAzKnB,UAyKmB,qBAA6B;AAI7B,EA7KnB,UA6KmB,uBACtB;AA9KG,aAAM;AAAA,GA5lCL;AAgxCV,UAAU,YAAV;AAAmB,MAAC;AAAD,YAAC,SAAD;AAMV,uBAAU;AAAA,MAcP,YAEN,SAEA,YACA;AACA,aAAK,UAAU;AACf,aAAK,aAAa;AAAA;AAAA;AArBf;AAGkB,IAHlB,IAGkB,MAAM,IAAI,KAAI,GAAG;AACjB,IAJlB,IAIkB,SAAS,IAAI,KAAI,GAAG;AACpB,IALlB,IAKkB,WAAW,IAAI,KAAI,GAAG;AACtB,IANlB,IAMkB,OAAO,IAAI,KAAI,GAAG;AANpC,YAAM;AAAA,KANK;AAAA,GAAV;AAkCV,UAAU,YAAV;AAAmB,MAAC;AAAD,YAAC,YAAD;AAMV,wBAAW;AAAA,MAgBR,YAEN,UAEA,kBACA;AACA,aAAK,WAAW;AAChB,aAAK,mBAAmB;AAAA;AAAA,MAOnB,iBAAiB,KAAe;AACrC,eAAO,KAAK,iBAAiB,KAAK,MAAO,OAAM,KAAK;AAAA;AAAA;AA/BjD;AAGkB,IAHlB,KAGkB,UAAU,IAAI,MAAK,GAAK,CAAC,IAAI,IAAI;AACjC,IAJlB,KAIkB,eAAe,IAAI,MAAK,GAAK,CAAC,GAAG,IAAI;AACrC,IALlB,KAKkB,OAAO,IAAI,MAAK,GAAK,CAAC,GAAG,IAAI;AAC7B,IANlB,KAMkB,QAAQ,IAAI,MAAK,GAAK,CAAC,GAAG,IAAI;AAC9B,IAPlB,KAOkB,MAAM,IAAI,MAAK,GAAK,CAAC,GAAG,GAAG;AAP7C,eAAM;AAAA,KANK;AAAA,GAAV;AA2CV,IAAO,oBAAQ;",
+  "names": []
+}

package/cjs/app/QrCodeViewer/types/index.js

@@ -1,5 +1,4 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
+var __defProp = Object.defineProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+__markAsModule(exports);
+//# sourceMappingURL=types.js.map

package/cjs/app/QrCodeViewer/types.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/app/QrCodeViewer/types.ts"],
+  "sourcesContent": ["import type { CSSProperties } from 'react';\nimport qrcodegen from '@digigov/ui/app/QrCodeViewer/qrcodegen';\n\nexport type QRProps = {\n  value: string;\n  size?: number;\n  // Should be a real enum, but doesn't seem to be compatible with real code.\n  level?: string;\n  bgColor?: string;\n  fgColor?: string;\n  style?: CSSProperties;\n  includeMargin?: boolean;\n  imageSettings?: ImageSettings;\n};\n\nexport type QRPropsCanvas = QRProps &\n  React.CanvasHTMLAttributes<HTMLCanvasElement>;\n\nexport type Modules = ReturnType<qrcodegen.QrCode['getModules']>;\n\nexport type Excavation = { x: number; y: number; w: number; h: number };\n\nexport type ImageSettings = {\n  src: string;\n  height: number;\n  width: number;\n  excavate: boolean;\n  x?: number;\n  y?: number;\n};\n"],
+  "mappings": ";;AAAA;",
+  "names": []
+}

package/cjs/app/QrCodeViewer/utils/index.js

@@ -1,41 +1,36 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, {get: all[name], enumerable: true});
+};
+__markAsModule(exports);
+__export(exports, {
+  MARGIN_SIZE: () => MARGIN_SIZE,
+  excavateModules: () => excavateModules,
+  generatePath: () => generatePath,
+  getImageSettings: () => getImageSettings
 });
-exports.MARGIN_SIZE = void 0;
-exports.excavateModules = excavateModules;
-exports.generatePath = generatePath;
-exports.getImageSettings = getImageSettings;
-var DEFAULT_IMG_SCALE = 0.1;
-var MARGIN_SIZE = exports.MARGIN_SIZE = 4;
-function generatePath(modules) {
-  var margin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
-  var ops = [];
-  modules.forEach(function (row, y) {
-    var start = null;
-    row.forEach(function (cell, x) {
+const DEFAULT_IMG_SCALE = 0.1;
+const MARGIN_SIZE = 4;
+function generatePath(modules, margin = 0) {
+  const ops = [];
+  modules.forEach(function(row, y) {
+    let start = null;
+    row.forEach(function(cell, x) {
       if (!cell && start !== null) {
-        // M0 0h7v1H0z injects the space with the move and drops the comma,
-        // saving a char per operation
-        ops.push("M".concat(start + margin, " ").concat(y + margin, "h").concat(x - start, "v1H").concat(start + margin, "z"));
+        ops.push(`M${start + margin} ${y + margin}h${x - start}v1H${start + margin}z`);
         start = null;
         return;
       }
-
-      // end of row, clean up or skip
       if (x === row.length - 1) {
         if (!cell) {
-          // We would have closed the op above already so this can only mean
-          // 2+ light modules in a row.
           return;
         }
         if (start === null) {
-          // Just a single dark module.
-          ops.push("M".concat(x + margin, ",").concat(y + margin, " h1v1H").concat(x + margin, "z"));
+          ops.push(`M${x + margin},${y + margin} h1v1H${x + margin}z`);
         } else {
-          // Otherwise finish the current line.
-          ops.push("M".concat(start + margin, ",").concat(y + margin, " h").concat(x + 1 - start, "v1H").concat(start + margin, "z"));
+          ops.push(`M${start + margin},${y + margin} h${x + 1 - start}v1H${start + margin}z`);
         }
         return;
       }
@@ -44,17 +39,14 @@ function generatePath(modules) {
       }
     });
   });
-  return ops.join('');
+  return ops.join("");
 }
-
-// We could just do this in generatePath, except that we want to support
-// non-Path2D canvas, so we need to keep it an explicit step.
 function excavateModules(modules, excavation) {
-  return modules.slice().map(function (row, y) {
+  return modules.slice().map((row, y) => {
     if (y < excavation.y || y >= excavation.y + excavation.h) {
       return row;
     }
-    return row.map(function (cell, x) {
+    return row.map((cell, x) => {
       if (x < excavation.x || x >= excavation.x + excavation.w) {
         return cell;
       }
@@ -66,32 +58,29 @@ function getImageSettings(cells, size, includeMargin, imageSettings) {
   if (imageSettings == null) {
     return null;
   }
-  var margin = includeMargin ? MARGIN_SIZE : 0;
-  var numCells = cells.length + margin * 2;
-  var defaultSize = Math.floor(size * DEFAULT_IMG_SCALE);
-  var scale = numCells / size;
-  var w = (imageSettings.width || defaultSize) * scale;
-  var h = (imageSettings.height || defaultSize) * scale;
-  var x = imageSettings.x == null ? cells.length / 2 - w / 2 : imageSettings.x * scale;
-  var y = imageSettings.y == null ? cells.length / 2 - h / 2 : imageSettings.y * scale;
-  var excavation;
+  const margin = includeMargin ? MARGIN_SIZE : 0;
+  const numCells = cells.length + margin * 2;
+  const defaultSize = Math.floor(size * DEFAULT_IMG_SCALE);
+  const scale = numCells / size;
+  const w = (imageSettings.width || defaultSize) * scale;
+  const h = (imageSettings.height || defaultSize) * scale;
+  const x = imageSettings.x == null ? cells.length / 2 - w / 2 : imageSettings.x * scale;
+  const y = imageSettings.y == null ? cells.length / 2 - h / 2 : imageSettings.y * scale;
+  let excavation;
   if (imageSettings.excavate) {
-    var floorX = Math.floor(x);
-    var floorY = Math.floor(y);
-    var ceilW = Math.ceil(w + x - floorX);
-    var ceilH = Math.ceil(h + y - floorY);
-    excavation = {
-      x: floorX,
-      y: floorY,
-      w: ceilW,
-      h: ceilH
-    };
+    const floorX = Math.floor(x);
+    const floorY = Math.floor(y);
+    const ceilW = Math.ceil(w + x - floorX);
+    const ceilH = Math.ceil(h + y - floorY);
+    excavation = {x: floorX, y: floorY, w: ceilW, h: ceilH};
   }
-  return {
-    x: x,
-    y: y,
-    h: h,
-    w: w,
-    excavation: excavation
-  };
-}
+  return {x, y, h, w, excavation};
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  MARGIN_SIZE,
+  excavateModules,
+  generatePath,
+  getImageSettings
+});
+//# sourceMappingURL=utils.js.map

package/cjs/app/QrCodeViewer/utils.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/app/QrCodeViewer/utils.ts"],
+  "sourcesContent": ["import {\n  Modules,\n  Excavation,\n  ImageSettings,\n} from '@digigov/ui/app/QrCodeViewer/types';\n\nconst DEFAULT_IMG_SCALE = 0.1;\nexport const MARGIN_SIZE = 4;\nexport function generatePath(modules: Modules, margin = 0): string {\n  const ops: Array<string> = [];\n  modules.forEach(function (row, y) {\n    let start: number | null = null;\n    row.forEach(function (cell, x) {\n      if (!cell && start !== null) {\n        // M0 0h7v1H0z injects the space with the move and drops the comma,\n        // saving a char per operation\n        ops.push(\n          `M${start + margin} ${y + margin}h${x - start}v1H${start + margin}z`\n        );\n        start = null;\n        return;\n      }\n\n      // end of row, clean up or skip\n      if (x === row.length - 1) {\n        if (!cell) {\n          // We would have closed the op above already so this can only mean\n          // 2+ light modules in a row.\n          return;\n        }\n        if (start === null) {\n          // Just a single dark module.\n          ops.push(`M${x + margin},${y + margin} h1v1H${x + margin}z`);\n        } else {\n          // Otherwise finish the current line.\n          ops.push(\n            `M${start + margin},${y + margin} h${x + 1 - start}v1H${\n              start + margin\n            }z`\n          );\n        }\n        return;\n      }\n\n      if (cell && start === null) {\n        start = x;\n      }\n    });\n  });\n  return ops.join('');\n}\n\n// We could just do this in generatePath, except that we want to support\n// non-Path2D canvas, so we need to keep it an explicit step.\nexport function excavateModules(\n  modules: Modules,\n  excavation: Excavation\n): Modules {\n  return modules.slice().map((row, y) => {\n    if (y < excavation.y || y >= excavation.y + excavation.h) {\n      return row;\n    }\n    return row.map((cell, x) => {\n      if (x < excavation.x || x >= excavation.x + excavation.w) {\n        return cell;\n      }\n      return false;\n    });\n  });\n}\n\nexport function getImageSettings(\n  cells: Modules,\n  size: number,\n  includeMargin: boolean,\n  imageSettings?: ImageSettings\n): null | {\n  x: number;\n  y: number;\n  h: number;\n  w: number;\n  excavation: Excavation | null;\n} {\n  if (imageSettings == null) {\n    return null;\n  }\n  const margin = includeMargin ? MARGIN_SIZE : 0;\n  const numCells = cells.length + margin * 2;\n  const defaultSize = Math.floor(size * DEFAULT_IMG_SCALE);\n  const scale = numCells / size;\n  const w = (imageSettings.width || defaultSize) * scale;\n  const h = (imageSettings.height || defaultSize) * scale;\n  const x =\n    imageSettings.x == null\n      ? cells.length / 2 - w / 2\n      : imageSettings.x * scale;\n  const y =\n    imageSettings.y == null\n      ? cells.length / 2 - h / 2\n      : imageSettings.y * scale;\n\n  let excavation;\n  if (imageSettings.excavate) {\n    const floorX = Math.floor(x);\n    const floorY = Math.floor(y);\n    const ceilW = Math.ceil(w + x - floorX);\n    const ceilH = Math.ceil(h + y - floorY);\n    excavation = { x: floorX, y: floorY, w: ceilW, h: ceilH };\n  }\n\n  return { x, y, h, w, excavation };\n}\n"],
+  "mappings": ";;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMA,MAAM,oBAAoB;AACnB,MAAM,cAAc;AACpB,sBAAsB,SAAkB,SAAS,GAAW;AACjE,QAAM,MAAqB;AAC3B,UAAQ,QAAQ,SAAU,KAAK,GAAG;AAChC,QAAI,QAAuB;AAC3B,QAAI,QAAQ,SAAU,MAAM,GAAG;AAC7B,UAAI,CAAC,QAAQ,UAAU,MAAM;AAG3B,YAAI,KACF,IAAI,QAAQ,UAAU,IAAI,UAAU,IAAI,WAAW,QAAQ;AAE7D,gBAAQ;AACR;AAAA;AAIF,UAAI,MAAM,IAAI,SAAS,GAAG;AACxB,YAAI,CAAC,MAAM;AAGT;AAAA;AAEF,YAAI,UAAU,MAAM;AAElB,cAAI,KAAK,IAAI,IAAI,UAAU,IAAI,eAAe,IAAI;AAAA,eAC7C;AAEL,cAAI,KACF,IAAI,QAAQ,UAAU,IAAI,WAAW,IAAI,IAAI,WAC3C,QAAQ;AAAA;AAId;AAAA;AAGF,UAAI,QAAQ,UAAU,MAAM;AAC1B,gBAAQ;AAAA;AAAA;AAAA;AAId,SAAO,IAAI,KAAK;AAAA;AAKX,yBACL,SACA,YACS;AACT,SAAO,QAAQ,QAAQ,IAAI,CAAC,KAAK,MAAM;AACrC,QAAI,IAAI,WAAW,KAAK,KAAK,WAAW,IAAI,WAAW,GAAG;AACxD,aAAO;AAAA;AAET,WAAO,IAAI,IAAI,CAAC,MAAM,MAAM;AAC1B,UAAI,IAAI,WAAW,KAAK,KAAK,WAAW,IAAI,WAAW,GAAG;AACxD,eAAO;AAAA;AAET,aAAO;AAAA;AAAA;AAAA;AAKN,0BACL,OACA,MACA,eACA,eAOA;AACA,MAAI,iBAAiB,MAAM;AACzB,WAAO;AAAA;AAET,QAAM,SAAS,gBAAgB,cAAc;AAC7C,QAAM,WAAW,MAAM,SAAS,SAAS;AACzC,QAAM,cAAc,KAAK,MAAM,OAAO;AACtC,QAAM,QAAQ,WAAW;AACzB,QAAM,IAAK,eAAc,SAAS,eAAe;AACjD,QAAM,IAAK,eAAc,UAAU,eAAe;AAClD,QAAM,IACJ,cAAc,KAAK,OACf,MAAM,SAAS,IAAI,IAAI,IACvB,cAAc,IAAI;AACxB,QAAM,IACJ,cAAc,KAAK,OACf,MAAM,SAAS,IAAI,IAAI,IACvB,cAAc,IAAI;AAExB,MAAI;AACJ,MAAI,cAAc,UAAU;AAC1B,UAAM,SAAS,KAAK,MAAM;AAC1B,UAAM,SAAS,KAAK,MAAM;AAC1B,UAAM,QAAQ,KAAK,KAAK,IAAI,IAAI;AAChC,UAAM,QAAQ,KAAK,KAAK,IAAI,IAAI;AAChC,iBAAa,CAAE,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG;AAAA;AAGpD,SAAO,CAAE,GAAG,GAAG,GAAG,GAAG;AAAA;",
+  "names": []
+}