sanity 3.94.1 → 3.94.2-next.0.91a5116c07

package/dist/QRCodeSVG-hyTW2xeN.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"QRCodeSVG-hyTW2xeN.mjs","sources":["../src/presentation/preview/qrcodegen.ts","../src/presentation/preview/QRCodeSVG.tsx"],"sourcesContent":["/**\n * \\@license QR Code generator library (TypeScript)\n * Copyright (c) Project Nayuki.\n * SPDX-License-Identifier: MIT\n */\n/* eslint-disable no-empty-function,no-negated-condition,unicorn/prefer-string-slice,unused-imports/no-unused-vars,no-param-reassign,no-bitwise,max-params */\n\ntype bit = number\ntype byte = number\ntype 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 */\nexport 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: Ecc): QrCode {\n    const segs: Array<QrSegment> = 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(data: Readonly<Array<byte>>, ecl: Ecc): QrCode {\n    const seg: QrSegment = 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: Ecc,\n    minVersion: int = 1,\n    maxVersion: int = 40,\n    mask: int = -1,\n    boostEcl: boolean = 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 = 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 [Ecc.MEDIUM, Ecc.QUARTILE, Ecc.HIGH]) {\n      // From low to high\n      if (boostEcl && dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8) 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 = 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 (let padByte = 0xec; bb.length < dataCapacityBits; padByte ^= 0xec ^ 0x11)\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((b: bit, i: int) => (dataCodewords[i >>> 3] |= b << (7 - (i & 7))))\n\n    // Create the QR Code object\n    return new QrCode(version, ecl, dataCodewords, mask)\n  }\n\n  /*-- Fields --*/\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    public readonly version: int,\n\n    // The error correction level used in this QR Code.\n    public readonly errorCorrectionLevel: Ecc,\n\n    dataCodewords: Readonly<Array<byte>>,\n\n    msk: int,\n  ) {\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 0 <= x && x < this.size && 0 <= y && y < this.size && this.modules[y][x]\n  }\n\n  // Modified to expose modules for easy access\n  public getModules(): boolean[][] {\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 (!((i == 0 && j == 0) || (i == 0 && j == numAlign - 1) || (i == numAlign - 1 && j == 0)))\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++) 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++) this.setFunctionModule(14 - i, 8, getBit(bits, i))\n\n    // Draw second copy\n    for (let i = 0; i < 8; i++) this.setFunctionModule(this.size - 1 - i, 8, getBit(bits, i))\n    for (let i = 8; i < 15; i++) 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(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) != 1)\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: 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 = 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(QrCode.getNumRawDataModules(ver) / 8)\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) 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 (data.length != Math.floor(QrCode.getNumRawDataModules(this.version) / 8))\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) 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) result += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3\n          runColor = this.modules[y][x]\n          runX = 1\n        }\n      }\n      result += this.finderPenaltyTerminateAndCount(runColor, runX, runHistory) * 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) result += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3\n          runColor = this.modules[y][x]\n          runY = 1\n        }\n      }\n      result += this.finderPenaltyTerminateAndCount(runColor, runY, runHistory) * 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) 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\n    const numAlign: int = Math.floor(this.version / 7) + 2\n    const step: int =\n      this.version == 32 ? 26 : 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) result.splice(1, 0, pos)\n    return result\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: 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) 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    // eslint-disable-next-line @typescript-eslint/no-unused-vars\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((coef, i) => (result[i] ^= QrCode.reedSolomonMultiply(coef, factor)))\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) 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(currentRunLength: int, runHistory: Array<int>): 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, 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    ], // Low\n    [\n      -1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28,\n      28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n    ], // Medium\n    [\n      -1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30,\n      30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n    ], // Quartile\n    [\n      -1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24,\n      30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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, 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,\n      14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25,\n    ], // Low\n    [\n      -1, 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    ], // Medium\n    [\n      -1, 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,\n      34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68,\n    ], // Quartile\n    [\n      -1, 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    ], // 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.\nfunction appendBits(val: int, len: int, bb: Array<bit>): void {\n  if (len < 0 || len > 31 || val >>> len != 0) 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.\nfunction getBit(x: int, i: int): boolean {\n  return ((x >>> i) & 1) != 0\n}\n\n// Throws an exception if the given condition is false.\nfunction 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\nexport 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(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)) 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.substring(i, i + n), 10), n * 3 + 1, bb)\n      i += n\n    }\n    return new 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('String contains unencodable characters in alphanumeric mode')\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 = 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(QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6, bb)\n    return new 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)) return [QrSegment.makeAlphanumeric(text)]\n    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) 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(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\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    public readonly mode: 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    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(segs: Readonly<Array<QrSegment>>, version: int): number {\n    let result: number = 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.substring(i + 1, i + 3), 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 * The error correction level in a QR Code symbol. Immutable.\n */\nexport 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  private constructor(\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  ) {}\n}\n\n/*\n * Describes how a segment's data bits are interpreted. Immutable.\n */\nexport 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  private constructor(\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\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 * This component is a fork of the `qrcode.react` package, original licensing can be found below.\n * \\@license qrcode.react\n * Copyright (c) Paul O'Shannessy\n * SPDX-License-Identifier: ISC\n */\n\n/* eslint-disable @typescript-eslint/no-shadow,no-eq-null,prefer-arrow-callback */\n\nimport {motion} from 'framer-motion'\nimport {memo, useMemo} from 'react'\n\nimport {Ecc, QrCode, QrSegment} from './qrcodegen'\n\ntype Modules = Array<Array<boolean>>\ntype Excavation = {x: number; y: number; w: number; h: number}\ntype ErrorCorrectionLevel = 'L' | 'M' | 'Q' | 'H'\n\ntype ERROR_LEVEL_MAPPED_TYPE = {\n  [index in ErrorCorrectionLevel]: Ecc\n}\n\nconst ERROR_LEVEL_MAP: ERROR_LEVEL_MAPPED_TYPE = {\n  L: Ecc.LOW,\n  M: Ecc.MEDIUM,\n  Q: Ecc.QUARTILE,\n  H: Ecc.HIGH,\n} as const\n\ntype QRProps = {\n  /**\n   * The value to encode into the QR Code.\n   */\n  value: string\n  /**\n   * The size, in pixels, to render the QR Code.\n   * @defaultValue 128\n   */\n  size?: number\n  /**\n   * The Error Correction Level to use.\n   * @see https://www.qrcode.com/en/about/error_correction.html\n   * @defaultValue L\n   */\n  level?: ErrorCorrectionLevel\n  /**\n   * @defaultValue #000000\n   */\n  color?: string\n  /**\n   * The title to assign to the QR Code. Used for accessibility reasons.\n   */\n  title?: string\n  /**\n   * The minimum version used when encoding the QR Code. Valid values are 1-40\n   * with higher values resulting in more complex QR Codes. The optimal\n   * (lowest) version is determined for the `value` provided, using `minVersion`\n   * as the lower bound.\n   * @defaultValue 1\n   */\n  minVersion?: number\n  logoSize?: number\n}\n\nconst DEFAULT_SIZE = 128\nconst DEFAULT_LEVEL: ErrorCorrectionLevel = 'L'\nconst DEFAULT_FGCOLOR = '#000000'\nconst DEFAULT_INCLUDEMARGIN = false\nconst DEFAULT_MINVERSION = 1\n\nconst SPEC_MARGIN_SIZE = 4\nconst DEFAULT_MARGIN_SIZE = 0\n\nfunction generatePath(modules: Modules, margin: number = 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(`M${start + margin} ${y + margin}h${x - start}v1H${start + margin}z`)\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(`M${start + margin},${y + margin} h${x + 1 - start}v1H${start + margin}z`)\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.\nfunction excavateModules(modules: Modules, excavation: Excavation): 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\nfunction getImageSettings(\n  cells: Modules,\n  size: number,\n  margin: number,\n  logoSize?: number,\n): null | {\n  x: number\n  y: number\n  h: number\n  w: number\n  excavation: Excavation | null\n} {\n  if (!logoSize) {\n    return null\n  }\n  const numCells = cells.length + margin * 2\n  const scale = numCells / size\n  const w = logoSize * scale\n  const h = logoSize * scale\n  const x = cells.length / 2 - w / 2\n  const y = cells.length / 2 - h / 2\n\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  const excavation = {x: floorX, y: floorY, w: ceilW, h: ceilH}\n\n  return {x, y, h, w, excavation}\n}\n\nfunction getMarginSize(includeMargin: boolean, marginSize?: number): number {\n  if (marginSize != null) {\n    return Math.max(Math.floor(marginSize), 0)\n  }\n  return includeMargin ? SPEC_MARGIN_SIZE : DEFAULT_MARGIN_SIZE\n}\n\nfunction useQRCode({\n  value,\n  level,\n  minVersion,\n  includeMargin,\n  marginSize,\n  logoSize,\n  size,\n}: {\n  value: string\n  level: ErrorCorrectionLevel\n  minVersion: number\n  includeMargin: boolean\n  marginSize?: number\n  logoSize?: number\n  size: number\n}) {\n  const qrcode = useMemo(() => {\n    const segments = QrSegment.makeSegments(value)\n    return QrCode.encodeSegments(segments, ERROR_LEVEL_MAP[level], minVersion)\n  }, [value, level, minVersion])\n\n  const {cells, margin, numCells, calculatedImageSettings} = useMemo(() => {\n    const cells = qrcode.getModules()\n\n    const margin = getMarginSize(includeMargin, marginSize)\n    const numCells = cells.length + margin * 2\n    const calculatedImageSettings = getImageSettings(cells, size, margin, logoSize)\n    return {\n      cells,\n      margin,\n      numCells,\n      calculatedImageSettings,\n    }\n  }, [qrcode, size, logoSize, includeMargin, marginSize])\n\n  return {\n    qrcode,\n    margin,\n    cells,\n    numCells,\n    calculatedImageSettings,\n  }\n}\n\nfunction QRCodeSVGComponent(props: QRProps) {\n  const {\n    value,\n    size = DEFAULT_SIZE,\n    level = DEFAULT_LEVEL,\n    color = DEFAULT_FGCOLOR,\n    minVersion = DEFAULT_MINVERSION,\n    title,\n    logoSize,\n  } = props\n  const marginSize: number | undefined = undefined\n\n  const {margin, cells, numCells, calculatedImageSettings} = useQRCode({\n    value,\n    level,\n    minVersion,\n    includeMargin: DEFAULT_INCLUDEMARGIN,\n    marginSize,\n    logoSize,\n    size,\n  })\n\n  const cellsToDraw = useMemo(\n    () =>\n      logoSize && calculatedImageSettings?.excavation\n        ? excavateModules(cells, calculatedImageSettings.excavation)\n        : cells,\n    [calculatedImageSettings?.excavation, cells, logoSize],\n  )\n\n  // Drawing strategy: instead of a rect per module, we're going to create a\n  // single path for the dark modules and layer that on top of a light rect,\n  // for a total of 2 DOM nodes. We pay a bit more in string concat but that's\n  // way faster than DOM ops.\n  // For level 1, 441 nodes -> 2\n  // For level 40, 31329 -> 2\n  const fgPath = generatePath(cellsToDraw, margin)\n\n  return (\n    <svg height={size} width={size} viewBox={`0 0 ${numCells} ${numCells}`} role=\"img\">\n      {!!title && <title>{title}</title>}\n      <motion.path\n        fill={color}\n        d={fgPath}\n        shapeRendering=\"crispEdges\"\n        initial={{opacity: 0}}\n        animate={{opacity: 2}}\n        exit={{opacity: -1}}\n      />\n    </svg>\n  )\n}\nconst QRCodeSVG = memo(QRCodeSVGComponent)\nQRCodeSVG.displayName = 'Memo(QRCodeSVG)'\n\nexport default QRCodeSVG\n"],"names":["QrCode","constructor","version","errorCorrectionLevel","dataCodewords","msk","size","mask","modules","isFunction","MIN_VERSION","MAX_VERSION","RangeError","row","i","push","slice","drawFunctionPatterns","allCodewords","addEccAndInterleave","drawCodewords","minPenalty","applyMask","drawFormatBits","penalty","getPenaltyScore","assert","encodeText","text","ecl","segs","QrSegment","makeSegments","encodeSegments","encodeBinary","data","seg","makeBytes","minVersion","maxVersion","boostEcl","dataUsedBits","dataCapacityBits","getNumDataCodewords","usedBits","getTotalBits","newEcl","Ecc","MEDIUM","QUARTILE","HIGH","bb","appendBits","mode","modeBits","numChars","numCharCountBits","b","getData","length","Math","min","padByte","forEach","getModule","x","y","getModules","setFunctionModule","drawFinderPattern","alignPatPos","getAlignmentPatternPositions","numAlign","j","drawAlignmentPattern","drawVersion","formatBits","rem","bits","getBit","color","a","floor","dy","dx","dist","max","abs","xx","yy","isDark","ver","numBlocks","NUM_ERROR_CORRECTION_BLOCKS","ordinal","blockEccLen","ECC_CODEWORDS_PER_BLOCK","rawCodewords","getNumRawDataModules","numShortBlocks","shortBlockLen","blocks","rsDiv","reedSolomonComputeDivisor","k","dat","ecc","reedSolomonComputeRemainder","concat","result","block","right","vert","invert","Error","runColor","runX","runHistory","PENALTY_N1","finderPenaltyAddHistory","finderPenaltyCountPatterns","PENALTY_N3","finderPenaltyTerminateAndCount","runY","PENALTY_N2","dark","reduce","sum","total","ceil","PENALTY_N4","step","pos","splice","degree","root","reedSolomonMultiply","divisor","map","_","factor","shift","coef","z","n","core","currentRunColor","currentRunLength","pop","unshift","__publicField","_QrCode","val","len","cond","bitData","Mode","BYTE","makeNumeric","digits","isNumeric","parseInt","substring","NUMERIC","makeAlphanumeric","isAlphanumeric","temp","ALPHANUMERIC_CHARSET","indexOf","charAt","ALPHANUMERIC","toUtf8ByteArray","makeEci","assignVal","ECI","NUMERIC_REGEX","test","ALPHANUMERIC_REGEX","ccbits","Infinity","str","encodeURI","charCodeAt","_QrSegment","LOW","_Ecc","numBitsCharCount","KANJI","_Mode","ERROR_LEVEL_MAP","L","M","Q","H","DEFAULT_SIZE","DEFAULT_LEVEL","DEFAULT_FGCOLOR","DEFAULT_INCLUDEMARGIN","DEFAULT_MINVERSION","SPEC_MARGIN_SIZE","DEFAULT_MARGIN_SIZE","generatePath","margin","ops","start","cell","join","excavateModules","excavation","h","w","getImageSettings","cells","logoSize","scale","floorX","floorY","ceilW","ceilH","getMarginSize","includeMargin","marginSize","useQRCode","value","level","qrcode","useMemo","segments","numCells","calculatedImageSettings","QRCodeSVGComponent","props","title","undefined","cellsToDraw","fgPath","jsxs","jsx","motion","opacity","QRCodeSVG","memo","displayName"],"mappings":";;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AA6BO,MAAMA,IAAN,MAAMA,EAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8HXC,YAGWC,GAGAC,GAEhBC,GAEAC,GACA;AA/BcC;AAAAA;AAAAA;AAAAA,IAAAA,EAAAA;AAKAC;AAAAA;AAAAA;AAAAA,IAAAA,EAAAA;AAICC;AAAAA;AAAAA,IAAAA,EAAAA,iBAAiC,CAAE;AAGnCC;AAAAA,IAAAA,EAAAA,oBAAoC,CAAE;AAqBjDP,QAVYA,KAAAA,UAAAA,GAGAC,KAAAA,uBAAAA,GAOZD,IAAUF,EAAOU,eAAeR,IAAUF,EAAOW,YACnD,OAAM,IAAIC,WAAW,4BAA4B;AACnD,QAAIP,IAAM,MAAMA,IAAM,EAAS,OAAA,IAAIO,WAAW,yBAAyB;AAClEN,SAAAA,OAAOJ,IAAU,IAAI;AAG1B,UAAMW,IAAsB,CAAE;AACrBC,aAAAA,IAAI,GAAGA,IAAI,KAAKR,MAAMQ,IAAKD,CAAAA,EAAIE,KAAK,EAAK;AAClD,aAASD,IAAI,GAAGA,IAAI,KAAKR,MAAMQ;AAC7B,WAAKN,QAAQO,KAAKF,EAAIG,MAAAA,CAAO,GAC7B,KAAKP,WAAWM,KAAKF,EAAIG,MAAAA,CAAO;AAIlC,SAAKC,qBAAqB;AACpBC,UAAAA,IAA4B,KAAKC,oBAAoBf,CAAa;AAIxE,QAHA,KAAKgB,cAAcF,CAAY,GAG3Bb,KAAO,IAAI;AAEb,UAAIgB,IAAkB;AACtB,eAASP,IAAI,GAAGA,IAAI,GAAGA,KAAK;AAC1B,aAAKQ,UAAUR,CAAC,GAChB,KAAKS,eAAeT,CAAC;AACfU,cAAAA,IAAe,KAAKC,gBAAgB;AAC1C,QAAID,IAAUH,MACNP,IAAAA,GACOU,IAAAA,IAEf,KAAKF,UAAUR,CAAC;AAAA,MAAA;AAAA,IAClB;AAEK,IAAAY,EAAA,KAAKrB,KAAOA,KAAO,CAAC,GAC3B,KAAKE,OAAOF,GACZ,KAAKiB,UAAUjB,CAAG,GAClB,KAAKkB,eAAelB,CAAG,GAEvB,KAAKI,aAAa,CAAE;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAzKtB,OAAckB,WAAWC,GAAcC,GAAkB;AACjDC,UAAAA,IAAyBC,EAAUC,aAAaJ,CAAI;AACnD5B,WAAAA,EAAOiC,eAAeH,GAAMD,CAAG;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOxC,OAAcK,aAAaC,GAA6BN,GAAkB;AAClEO,UAAAA,IAAiBL,EAAUM,UAAUF,CAAI;AAC/C,WAAOnC,EAAOiC,eAAe,CAACG,CAAG,GAAGP,CAAG;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAczC,OAAcI,eACZH,GACAD,GACAS,IAAkB,GAClBC,IAAkB,IAClBhC,IAAY,IACZiC,IAAoB,IACZ;AACR,QACE,EACExC,EAAOU,eAAe4B,KACtBA,KAAcC,KACdA,KAAcvC,EAAOW,gBAEvBJ,IAAO,MACPA,IAAO,EAED,OAAA,IAAIK,WAAW,eAAe;AAGlCV,QAAAA,GACAuC;AACCvC,SAAAA,IAAUoC,KAAcpC,KAAW;AACtC,YAAMwC,IAAwB1C,EAAO2C,oBAAoBzC,GAAS2B,CAAG,IAAI,GACnEe,IAAmBb,EAAUc,aAAaf,GAAM5B,CAAO;AAC7D,UAAI0C,KAAYF,GAAkB;AACjBE,QAAAA,IAAAA;AACf;AAAA,MAAA;AAEF,UAAI1C,KAAWqC;AAEP,cAAA,IAAI3B,WAAW,eAAe;AAAA,IAAA;AAI7BkC,eAAAA,KAAU,CAACC,EAAIC,QAAQD,EAAIE,UAAUF,EAAIG,IAAI;AAElDV,MAAAA,KAAYC,KAAgBzC,EAAO2C,oBAAoBzC,GAAS4C,CAAM,IAAI,MAASA,IAAAA;AAIzF,UAAMK,IAAiB,CAAE;AACzB,eAAWf,KAAON,GAAM;AACtBsB,MAAAA,EAAWhB,EAAIiB,KAAKC,UAAU,GAAGH,CAAE,GACnCC,EAAWhB,EAAImB,UAAUnB,EAAIiB,KAAKG,iBAAiBtD,CAAO,GAAGiD,CAAE;AAC/D,iBAAWM,KAAKrB,EAAIsB,QAAWP,EAAAA,CAAAA,EAAGpC,KAAK0C,CAAC;AAAA,IAAA;AAEnCN,IAAAA,EAAAA,EAAGQ,UAAUlB,CAAY;AAGhC,UAAMC,IAAwB1C,EAAO2C,oBAAoBzC,GAAS2B,CAAG,IAAI;AAClEsB,IAAAA,EAAAA,EAAGQ,UAAUjB,CAAgB,GACzBU,EAAA,GAAGQ,KAAKC,IAAI,GAAGnB,IAAmBS,EAAGQ,MAAM,GAAGR,CAAE,GAC3DC,EAAW,IAAI,IAAKD,EAAGQ,SAAS,KAAM,GAAGR,CAAE,GACpCA,EAAAA,EAAGQ,SAAS,KAAK,CAAC;AAGhBG,aAAAA,IAAU,KAAMX,EAAGQ,SAASjB,GAAkBoB,KAAW,IAChEV,CAAAA,EAAWU,GAAS,GAAGX,CAAE;AAG3B,UAAM/C,IAA6B,CAAE;AACrC,WAAOA,EAAcuD,SAAS,IAAIR,EAAGQ,SAAQvD,CAAAA,EAAcW,KAAK,CAAC;AAC9DgD,WAAAA,EAAAA,QAAQ,CAACN,GAAQ3C,MAAYV,EAAcU,MAAM,CAAC,KAAK2C,KAAM,KAAK3C,IAAI,EAAI,GAGtE,IAAId,EAAOE,GAAS2B,GAAKzB,GAAeG,CAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsF9CyD,UAAUC,GAAQC,GAAiB;AACxC,WAAO,KAAKD,KAAKA,IAAI,KAAK3D,QAAQ,KAAK4D,KAAKA,IAAI,KAAK5D,QAAQ,KAAKE,QAAQ0D,CAAC,EAAED,CAAC;AAAA,EAAA;AAAA;AAAA,EAIzEE,aAA0B;AAC/B,WAAO,KAAK3D;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA,EAMNS,uBAA6B;AAEnC,aAASH,IAAI,GAAGA,IAAI,KAAKR,MAAMQ;AAC7B,WAAKsD,kBAAkB,GAAGtD,GAAGA,IAAI,KAAK,CAAC,GACvC,KAAKsD,kBAAkBtD,GAAG,GAAGA,IAAI,KAAK,CAAC;AAIpCuD,SAAAA,kBAAkB,GAAG,CAAC,GAC3B,KAAKA,kBAAkB,KAAK/D,OAAO,GAAG,CAAC,GACvC,KAAK+D,kBAAkB,GAAG,KAAK/D,OAAO,CAAC;AAGjCgE,UAAAA,IAA0B,KAAKC,6BAA6B,GAC5DC,IAAgBF,EAAYX;AAClC,aAAS7C,IAAI,GAAGA,IAAI0D,GAAU1D;AAC5B,eAAS2D,IAAI,GAAGA,IAAID,GAAUC;AAExB,QAAG3D,KAAK,KAAK2D,KAAK,KAAO3D,KAAK,KAAK2D,KAAKD,IAAW,KAAO1D,KAAK0D,IAAW,KAAKC,KAAK,KACjFC,KAAAA,qBAAqBJ,EAAYxD,CAAC,GAAGwD,EAAYG,CAAC,CAAC;AAK9D,SAAKlD,eAAe,CAAC,GACrB,KAAKoD,YAAY;AAAA,EAAA;AAAA;AAAA;AAAA,EAKXpD,eAAehB,GAAiB;AAEtC,UAAM4B,IAAa,KAAKhC,qBAAqByE,cAAc,IAAKrE;AAChE,QAAIsE,IAAW1C;AACNrB,aAAAA,IAAI,GAAGA,IAAI,IAAIA,IAAY+D,CAAAA,IAAAA,KAAO,KAAOA,MAAQ,KAAK;AACzDC,UAAAA,KAAS3C,KAAQ,KAAM0C,KAAO;AAC7BC,IAAAA,EAAAA,MAAS,MAAM,CAAC;AAGvB,aAAShE,IAAI,GAAGA,KAAK,GAAGA,IAAK,MAAKsD,kBAAkB,GAAGtD,GAAGiE,EAAOD,GAAMhE,CAAC,CAAC;AACzE,SAAKsD,kBAAkB,GAAG,GAAGW,EAAOD,GAAM,CAAC,CAAC,GAC5C,KAAKV,kBAAkB,GAAG,GAAGW,EAAOD,GAAM,CAAC,CAAC,GAC5C,KAAKV,kBAAkB,GAAG,GAAGW,EAAOD,GAAM,CAAC,CAAC;AAC5C,aAAShE,IAAI,GAAGA,IAAI,IAAIA,IAAK,MAAKsD,kBAAkB,KAAKtD,GAAG,GAAGiE,EAAOD,GAAMhE,CAAC,CAAC;AAG9E,aAASA,IAAI,GAAGA,IAAI,GAAGA,IAAUsD,MAAAA,kBAAkB,KAAK9D,OAAO,IAAIQ,GAAG,GAAGiE,EAAOD,GAAMhE,CAAC,CAAC;AACxF,aAASA,IAAI,GAAGA,IAAI,IAAIA,IAAUsD,MAAAA,kBAAkB,GAAG,KAAK9D,OAAO,KAAKQ,GAAGiE,EAAOD,GAAMhE,CAAC,CAAC;AAC1F,SAAKsD,kBAAkB,GAAG,KAAK9D,OAAO,GAAG,EAAI;AAAA,EAAA;AAAA;AAAA;AAAA,EAKvCqE,cAAoB;AACtB,QAAA,KAAKzE,UAAU,EAAG;AAGtB,QAAI2E,IAAW,KAAK3E;AACXY,aAAAA,IAAI,GAAGA,IAAI,IAAIA,IAAY+D,CAAAA,IAAAA,KAAO,KAAOA,MAAQ,MAAM;AAC1DC,UAAAA,IAAa,KAAK5E,WAAW,KAAM2E;AAClCC,IAAAA,EAAAA,MAAS,MAAM,CAAC;AAGvB,aAAShE,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACrBkE,YAAAA,IAAiBD,EAAOD,GAAMhE,CAAC,GAC/BmE,IAAS,KAAK3E,OAAO,KAAMQ,IAAI,GAC/B2C,IAASG,KAAKsB,MAAMpE,IAAI,CAAC;AAC1BsD,WAAAA,kBAAkBa,GAAGxB,GAAGuB,CAAK,GAC7BZ,KAAAA,kBAAkBX,GAAGwB,GAAGD,CAAK;AAAA,IAAA;AAAA,EACpC;AAAA;AAAA;AAAA,EAKMX,kBAAkBJ,GAAQC,GAAc;AAC9C,aAASiB,IAAK,IAAIA,KAAM,GAAGA;AACzB,eAASC,IAAK,IAAIA,KAAM,GAAGA,KAAM;AACzBC,cAAAA,IAAYzB,KAAK0B,IAAI1B,KAAK2B,IAAIH,CAAE,GAAGxB,KAAK2B,IAAIJ,CAAE,CAAC,GAC/CK,IAAUvB,IAAImB,GACdK,IAAUvB,IAAIiB;AACpB,QAAI,KAAKK,KAAMA,IAAK,KAAKlF,QAAQ,KAAKmF,KAAMA,IAAK,KAAKnF,aAC/C8D,kBAAkBoB,GAAIC,GAAIJ,KAAQ,KAAKA,KAAQ,CAAC;AAAA,MAAA;AAAA,EAE3D;AAAA;AAAA;AAAA,EAKMX,qBAAqBT,GAAQC,GAAc;AACjD,aAASiB,IAAK,IAAIA,KAAM,GAAGA;AAChBC,eAAAA,IAAK,IAAIA,KAAM,GAAGA,IACpBhB,MAAAA,kBAAkBH,IAAImB,GAAIlB,IAAIiB,GAAIvB,KAAK0B,IAAI1B,KAAK2B,IAAIH,CAAE,GAAGxB,KAAK2B,IAAIJ,CAAE,CAAC,KAAK,CAAC;AAAA,EACpF;AAAA;AAAA;AAAA,EAKMf,kBAAkBH,GAAQC,GAAQwB,GAAuB;AAC/D,SAAKlF,QAAQ0D,CAAC,EAAED,CAAC,IAAIyB,GACrB,KAAKjF,WAAWyD,CAAC,EAAED,CAAC,IAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAOlB9C,oBAAoBgB,GAA0C;AACpE,UAAMwD,IAAW,KAAKzF,SAChB2B,IAAW,KAAK1B;AAClBgC,QAAAA,EAAKwB,UAAU3D,EAAO2C,oBAAoBgD,GAAK9D,CAAG,EACpD,OAAM,IAAIjB,WAAW,kBAAkB;AAGzC,UAAMgF,IAAiB5F,EAAO6F,4BAA4BhE,EAAIiE,OAAO,EAAEH,CAAG,GACpEI,IAAmB/F,EAAOgG,wBAAwBnE,EAAIiE,OAAO,EAAEH,CAAG,GAClEM,IAAoBrC,KAAKsB,MAAMlF,EAAOkG,qBAAqBP,CAAG,IAAI,CAAC,GACnEQ,IAAsBP,IAAaK,IAAeL,GAClDQ,IAAqBxC,KAAKsB,MAAMe,IAAeL,CAAS,GAGxDS,IAA6B,CAAE,GAC/BC,IAAqBtG,EAAOuG,0BAA0BR,CAAW;AACvE,aAASjF,IAAI,GAAG0F,IAAI,GAAG1F,IAAI8E,GAAW9E,KAAK;AACnC2F,YAAAA,IAAmBtE,EAAKnB,MAC5BwF,GACAA,IAAIJ,IAAgBL,KAAejF,IAAIqF,IAAiB,IAAI,EAC9D;AACAK,MAAAA,KAAKC,EAAI9C;AACT,YAAM+C,IAAmB1G,EAAO2G,4BAA4BF,GAAKH,CAAK;AACtE,MAAIxF,IAAIqF,KAAoBpF,EAAAA,KAAK,CAAC,GAClCsF,EAAOtF,KAAK0F,EAAIG,OAAOF,CAAG,CAAC;AAAA,IAAA;AAI7B,UAAMG,IAAsB,CAAE;AAC9B,aAAS/F,IAAI,GAAGA,IAAIuF,EAAO,CAAC,EAAE1C,QAAQ7C;AAC7BiD,MAAAA,EAAAA,QAAQ,CAAC+C,GAAOrC,MAAM;AAEvB3D,SAAAA,KAAKsF,IAAgBL,KAAetB,KAAK0B,MAAuBpF,EAAAA,KAAK+F,EAAMhG,CAAC,CAAC;AAAA,MAAA,CAClF;AAEI+F,WAAAA,EAAAA,EAAOlD,UAAUsC,CAAY,GAC7BY;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA,EAKDzF,cAAce,GAAmC;AACvD,QAAIA,EAAKwB,UAAUC,KAAKsB,MAAMlF,EAAOkG,qBAAqB,KAAKhG,OAAO,IAAI,CAAC,EACnE,OAAA,IAAIU,WAAW,kBAAkB;AACzC,QAAIE,IAAS;AAEb,aAASiG,IAAQ,KAAKzG,OAAO,GAAGyG,KAAS,GAAGA,KAAS,GAAG;AAElDA,MAAAA,KAAS,MAAWA,IAAA;AACxB,eAASC,IAAO,GAAGA,IAAO,KAAK1G,MAAM0G;AAEnC,iBAASvC,IAAI,GAAGA,IAAI,GAAGA,KAAK;AAC1B,gBAAMR,IAAS8C,IAAQtC,GAEjBP,KADoB6C,IAAQ,IAAK,MAAM,IACrB,KAAKzG,OAAO,IAAI0G,IAAOA;AAC3C,UAAA,CAAC,KAAKvG,WAAWyD,CAAC,EAAED,CAAC,KAAKnD,IAAIqB,EAAKwB,SAAS,MAC9C,KAAKnD,QAAQ0D,CAAC,EAAED,CAAC,IAAIc,EAAO5C,EAAKrB,MAAM,CAAC,GAAG,KAAKA,IAAI,EAAE,GACtDA;AAAAA,QACF;AAAA,IAIJ;AAEKA,IAAAA,EAAAA,KAAKqB,EAAKwB,SAAS,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQrBrC,UAAUf,GAAiB;AACjC,QAAIA,IAAO,KAAKA,IAAO,EAAS,OAAA,IAAIK,WAAW,yBAAyB;AACxE,aAASsD,IAAI,GAAGA,IAAI,KAAK5D,MAAM4D;AAC7B,eAASD,IAAI,GAAGA,IAAI,KAAK3D,MAAM2D,KAAK;AAC9BgD,YAAAA;AACJ,gBAAQ1G,GAAI;AAAA,UACV,KAAK;AACO0D,YAAAA,KAAAA,IAAIC,KAAK,KAAK;AACxB;AAAA,UACF,KAAK;AACH+C,YAAAA,IAAS/C,IAAI,KAAK;AAClB;AAAA,UACF,KAAK;AACH+C,YAAAA,IAAShD,IAAI,KAAK;AAClB;AAAA,UACF,KAAK;AACOA,YAAAA,KAAAA,IAAIC,KAAK,KAAK;AACxB;AAAA,UACF,KAAK;AACON,YAAAA,KAAAA,KAAKsB,MAAMjB,IAAI,CAAC,IAAIL,KAAKsB,MAAMhB,IAAI,CAAC,KAAK,KAAK;AACxD;AAAA,UACF,KAAK;AACH+C,YAAAA,IAAWhD,IAAIC,IAAK,IAAOD,IAAIC,IAAK,KAAM;AAC1C;AAAA,UACF,KAAK;AACH+C,YAAAA,KAAYhD,IAAIC,IAAK,IAAOD,IAAIC,IAAK,KAAM,KAAK;AAChD;AAAA,UACF,KAAK;AACH+C,YAAAA,MAAYhD,IAAIC,KAAK,IAAOD,IAAIC,IAAK,KAAM,KAAK;AAChD;AAAA,UACF;AACQ,kBAAA,IAAIgD,MAAM,aAAa;AAAA,QAAA;AAEjC,QAAI,CAAC,KAAKzG,WAAWyD,CAAC,EAAED,CAAC,KAAKgD,MAAQ,KAAKzG,QAAQ0D,CAAC,EAAED,CAAC,IAAI,CAAC,KAAKzD,QAAQ0D,CAAC,EAAED,CAAC;AAAA,MAAA;AAAA,EAEjF;AAAA;AAAA;AAAA,EAKMxC,kBAAuB;AAC7B,QAAIoF,IAAc;AAGlB,aAAS3C,IAAI,GAAGA,IAAI,KAAK5D,MAAM4D,KAAK;AAClC,UAAIiD,IAAW,IACXC,IAAO;AACLC,YAAAA,IAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACvC,eAASpD,IAAI,GAAGA,IAAI,KAAK3D,MAAM2D;AAC7B,QAAI,KAAKzD,QAAQ0D,CAAC,EAAED,CAAC,KAAKkD,KACxBC,KACIA,KAAQ,IAAGP,KAAU7G,EAAOsH,aACvBF,IAAO,KAAGP,QAEdU,KAAAA,wBAAwBH,GAAMC,CAAU,GACxCF,MAAUN,KAAU,KAAKW,2BAA2BH,CAAU,IAAIrH,EAAOyH,aAC9EN,IAAW,KAAK3G,QAAQ0D,CAAC,EAAED,CAAC,GACrBmD,IAAA;AAGXP,MAAAA,KAAU,KAAKa,+BAA+BP,GAAUC,GAAMC,CAAU,IAAIrH,EAAOyH;AAAAA,IAAAA;AAGrF,aAASxD,IAAI,GAAGA,IAAI,KAAK3D,MAAM2D,KAAK;AAClC,UAAIkD,IAAW,IACXQ,IAAO;AACLN,YAAAA,IAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACvC,eAASnD,IAAI,GAAGA,IAAI,KAAK5D,MAAM4D;AAC7B,QAAI,KAAK1D,QAAQ0D,CAAC,EAAED,CAAC,KAAKkD,KACxBQ,KACIA,KAAQ,IAAGd,KAAU7G,EAAOsH,aACvBK,IAAO,KAAGd,QAEdU,KAAAA,wBAAwBI,GAAMN,CAAU,GACxCF,MAAUN,KAAU,KAAKW,2BAA2BH,CAAU,IAAIrH,EAAOyH,aAC9EN,IAAW,KAAK3G,QAAQ0D,CAAC,EAAED,CAAC,GACrB0D,IAAA;AAGXd,MAAAA,KAAU,KAAKa,+BAA+BP,GAAUQ,GAAMN,CAAU,IAAIrH,EAAOyH;AAAAA,IAAAA;AAIrF,aAASvD,IAAI,GAAGA,IAAI,KAAK5D,OAAO,GAAG4D;AACjC,eAASD,IAAI,GAAGA,IAAI,KAAK3D,OAAO,GAAG2D,KAAK;AACtC,cAAMe,IAAiB,KAAKxE,QAAQ0D,CAAC,EAAED,CAAC;AAEtCe,QAAAA,KAAS,KAAKxE,QAAQ0D,CAAC,EAAED,IAAI,CAAC,KAC9Be,KAAS,KAAKxE,QAAQ0D,IAAI,CAAC,EAAED,CAAC,KAC9Be,KAAS,KAAKxE,QAAQ0D,IAAI,CAAC,EAAED,IAAI,CAAC,MAElC4C,KAAU7G,EAAO4H;AAAAA,MAAAA;AAKvB,QAAIC,IAAY;AAChB,eAAWhH,KAAO,KAAKL,QAASqH,CAAAA,IAAOhH,EAAIiH,OAAO,CAACC,GAAK/C,MAAU+C,KAAO/C,IAAQ,IAAI,IAAI6C,CAAI;AACvFG,UAAAA,IAAa,KAAK1H,OAAO,KAAKA,MAE9BkG,IAAS5C,KAAKqE,KAAKrE,KAAK2B,IAAIsC,IAAO,KAAKG,IAAQ,EAAE,IAAIA,CAAK,IAAI;AAC9D,WAAAtG,EAAA,KAAK8E,KAAKA,KAAK,CAAC,GACvBK,KAAUL,IAAIxG,EAAOkI,YACdxG,EAAA,KAAKmF,KAAUA,KAAU,OAAO,GAChCA;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA;AAAAA;AAAAA,EAQDtC,+BAA2C;AACjD,QAAI,KAAKrE,WAAW,EAAG,QAAO,CAAE;AAEhC,UAAMsE,IAAgBZ,KAAKsB,MAAM,KAAKhF,UAAU,CAAC,IAAI,GAC/CiI,IACJ,KAAKjI,WAAW,KAAK,KAAK0D,KAAKqE,MAAM,KAAK/H,UAAU,IAAI,MAAMsE,IAAW,IAAI,EAAE,IAAI,GAC/EqC,IAAqB,CAAC,CAAC;AAC7B,aAASuB,IAAM,KAAK9H,OAAO,GAAGuG,EAAOlD,SAASa,GAAU4D,KAAOD,EAAMtB,CAAAA,EAAOwB,OAAO,GAAG,GAAGD,CAAG;AACrFvB,WAAAA;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA;AAAAA,EAMT,OAAeX,qBAAqBP,GAAe;AAC7CA,QAAAA,IAAM3F,EAAOU,eAAeiF,IAAM3F,EAAOW,YAC3C,OAAM,IAAIC,WAAW,6BAA6B;AACpD,QAAIiG,KAAe,KAAKlB,IAAM,OAAOA,IAAM;AAC3C,QAAIA,KAAO,GAAG;AACZ,YAAMnB,IAAgBZ,KAAKsB,MAAMS,IAAM,CAAC,IAAI;AACjC,MAAAkB,MAAA,KAAKrC,IAAW,MAAMA,IAAW,IACxCmB,KAAO,MAAakB,KAAA;AAAA,IAAA;AAEnB,WAAAnF,EAAA,OAAOmF,KAAUA,KAAU,KAAK,GAChCA;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA;AAAAA,EAMT,OAAelE,oBAAoBgD,GAAU9D,GAAe;AAExD+B,WAAAA,KAAKsB,MAAMlF,EAAOkG,qBAAqBP,CAAG,IAAI,CAAC,IAC/C3F,EAAOgG,wBAAwBnE,EAAIiE,OAAO,EAAEH,CAAG,IAC7C3F,EAAO6F,4BAA4BhE,EAAIiE,OAAO,EAAEH,CAAG;AAAA,EAAA;AAAA;AAAA;AAAA,EAMzD,OAAeY,0BAA0B+B,GAA0B;AACjE,QAAIA,IAAS,KAAKA,IAAS,IAAW,OAAA,IAAI1H,WAAW,qBAAqB;AAG1E,UAAMiG,IAAsB,CAAE;AACrB/F,aAAAA,IAAI,GAAGA,IAAIwH,IAAS,GAAGxH,IAAK+F,CAAAA,EAAO9F,KAAK,CAAC;AAClD8F,IAAAA,EAAO9F,KAAK,CAAC;AAKb,QAAIwH,IAAO;AACX,aAASzH,IAAI,GAAGA,IAAIwH,GAAQxH,KAAK;AAE/B,eAAS2D,IAAI,GAAGA,IAAIoC,EAAOlD,QAAQc;AACjCoC,QAAAA,EAAOpC,CAAC,IAAIzE,EAAOwI,oBAAoB3B,EAAOpC,CAAC,GAAG8D,CAAI,GAClD9D,IAAI,IAAIoC,EAAOlD,aAAec,CAAC,KAAKoC,EAAOpC,IAAI,CAAC;AAE/CzE,MAAAA,IAAAA,EAAOwI,oBAAoBD,GAAM,CAAI;AAAA,IAAA;AAEvC1B,WAAAA;AAAAA,EAAAA;AAAAA;AAAAA,EAIT,OAAeF,4BACbxE,GACAsG,GACa;AAEb,UAAM5B,IAAsB4B,EAAQC,IAAKC,CAAAA,MAAM,CAAC;AAChD,eAAWlF,KAAKtB,GAAM;AAEdyG,YAAAA,IAAenF,IAAKoD,EAAOgC,MAAM;AACvChC,MAAAA,EAAO9F,KAAK,CAAC,GACLgD,EAAAA,QAAQ,CAAC+E,GAAMhI,MAAO+F,EAAO/F,CAAC,KAAKd,EAAOwI,oBAAoBM,GAAMF,CAAM,CAAE;AAAA,IAAA;AAE/E/B,WAAAA;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA,EAKT,OAAe2B,oBAAoBvE,GAASC,GAAe;AACrDD,QAAAA,MAAM,KAAUC,MAAM,EAAQ,OAAM,IAAItD,WAAW,mBAAmB;AAE1E,QAAImI,IAAS;AACb,aAASjI,IAAI,GAAGA,KAAK,GAAGA;AACjBiI,MAAAA,IAAAA,KAAK,KAAOA,MAAM,KAAK,KACrB7E,MAAAA,MAAMpD,IAAK,KAAKmD;AAElB8E,WAAAA,EAAAA,MAAM,KAAK,CAAC,GACZA;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA,EAKDvB,2BAA2BH,GAAuC;AAClE2B,UAAAA,IAAS3B,EAAW,CAAC;AACpB2B,IAAAA,EAAAA,KAAK,KAAK1I,OAAO,CAAC;AACzB,UAAM2I,IACJD,IAAI,KACJ3B,EAAW,CAAC,KAAK2B,KACjB3B,EAAW,CAAC,KAAK2B,IAAI,KACrB3B,EAAW,CAAC,KAAK2B,KACjB3B,EAAW,CAAC,KAAK2B;AAEhBC,YAAAA,KAAQ5B,EAAW,CAAC,KAAK2B,IAAI,KAAK3B,EAAW,CAAC,KAAK2B,IAAI,IAAI,MAC3DC,KAAQ5B,EAAW,CAAC,KAAK2B,IAAI,KAAK3B,EAAW,CAAC,KAAK2B,IAAI,IAAI;AAAA,EAAA;AAAA;AAAA,EAKxDtB,+BACNwB,GACAC,GACA9B,GACK;AACL,WAAI6B,MAEG3B,KAAAA,wBAAwB4B,GAAkB9B,CAAU,GACtC8B,IAAA,IAErBA,KAAoB,KAAK7I,MACpBiH,KAAAA,wBAAwB4B,GAAkB9B,CAAU,GAClD,KAAKG,2BAA2BH,CAAU;AAAA,EAAA;AAAA;AAAA,EAI3CE,wBAAwB4B,GAAuB9B,GAA8B;AACnF,IAAIA,EAAW,CAAC,KAAK,WAAuB,KAAK/G,OACjD+G,EAAW+B,IAAI,GACf/B,EAAWgC,QAAQF,CAAgB;AAAA,EAAA;AAyDvC;AAAA;AAAA;AAnDEG,EA/mBWtJ,GA+mBYU,eAAmB;AAE1C4I,EAjnBWtJ,GAinBYW,eAAmB;AAG1C2I,EApnBWtJ,GAonBasH,cAAkB,IAC1CgC,EArnBWtJ,GAqnBa4H,cAAkB,IAC1C0B,EAtnBWtJ,GAsnBayH,cAAkB,KAC1C6B,EAvnBWtJ,GAunBakI,cAAkB,KAE1CoB,EAznBWtJ,GAynBagG,2BAA6C;AAAA;AAAA;AAAA,EAGnE,CACE,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAC3F,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAEpE,CACE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IACxF,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAExE,CACE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IACxF,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAExE,CACE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IACxF,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AACrE,IAGLsD,EA9oBWtJ,GA8oBa6F,+BAAiD;AAAA;AAAA;AAAA,EAGvE,CACE,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IACzF,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAEhD,CACE,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAC1F,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAExD,CACE,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IACzF,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAE5D,CACE,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAC1F,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AACzD;AAhqBA,IAAM7F,IAANuJ;AAsqBP,SAASnG,EAAWoG,GAAUC,GAAUtG,GAAsB;AACxDsG,MAAAA,IAAM,KAAKA,IAAM,MAAMD,MAAQC,EAAU,OAAM,IAAI7I,WAAW,oBAAoB;AAEhFE,WAAAA,IAAI2I,IAAM,GACd3I,KAAK,GACLA,IAEGC,CAAAA,EAAAA,KAAMyI,MAAQ1I,IAAK,CAAC;AAC3B;AAGA,SAASiE,EAAOd,GAAQnD,GAAiB;AAC9BmD,UAAAA,MAAMnD,IAAK,MAAM;AAC5B;AAGA,SAASY,EAAOgI,GAAqB;AACnC,MAAI,CAACA,EAAY,OAAA,IAAIxC,MAAM,iBAAiB;AAC9C;AAgBO,MAAMnF,IAAN,MAAMA,EAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAyFd9B,YAEWoD,GAKAE,GAGCoG,GACjB;AACA,QAVgBtG,KAAAA,OAAAA,GAKAE,KAAAA,WAAAA,GAGCoG,KAAAA,UAAAA,GAEbpG,IAAW,EAAS,OAAA,IAAI3C,WAAW,kBAAkB;AACpD+I,SAAAA,UAAUA,EAAQ3I,MAAM;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAhG/B,OAAcqB,UAAUF,GAAwC;AAC9D,UAAMgB,IAAiB,CAAE;AACzB,eAAWM,KAAKtB,EAAiBsB,CAAAA,EAAAA,GAAG,GAAGN,CAAE;AACzC,WAAO,IAAIpB,EAAU6H,EAAKC,MAAM1H,EAAKwB,QAAQR,CAAE;AAAA,EAAA;AAAA;AAAA,EAIjD,OAAc2G,YAAYC,GAA2B;AAC/C,QAAA,CAAChI,EAAUiI,UAAUD,CAAM,EAAS,OAAA,IAAInJ,WAAW,wCAAwC;AAC/F,UAAMuC,IAAiB,CAAE;AACzB,aAASrC,IAAI,GAAGA,IAAIiJ,EAAOpG,UAAU;AAEnC,YAAMqF,IAASpF,KAAKC,IAAIkG,EAAOpG,SAAS7C,GAAG,CAAC;AAC5CsC,MAAAA,EAAW6G,SAASF,EAAOG,UAAUpJ,GAAGA,IAAIkI,CAAC,GAAG,EAAE,GAAGA,IAAI,IAAI,GAAG7F,CAAE,GAC7D6F,KAAAA;AAAAA,IAAAA;AAEP,WAAO,IAAIjH,EAAU6H,EAAKO,SAASJ,EAAOpG,QAAQR,CAAE;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMtD,OAAciH,iBAAiBxI,GAAyB;AAClD,QAAA,CAACG,EAAUsI,eAAezI,CAAI,EAC1B,OAAA,IAAIhB,WAAW,6DAA6D;AACpF,UAAMuC,IAAiB,CAAE;AACrBrC,QAAAA;AACJ,SAAKA,IAAI,GAAGA,IAAI,KAAKc,EAAK+B,QAAQ7C,KAAK,GAAG;AAEpCwJ,UAAAA,IAAYvI,EAAUwI,qBAAqBC,QAAQ5I,EAAK6I,OAAO3J,CAAC,CAAC,IAAI;AACzEwJ,MAAAA,KAAQvI,EAAUwI,qBAAqBC,QAAQ5I,EAAK6I,OAAO3J,IAAI,CAAC,CAAC,GACtDwJ,EAAAA,GAAM,IAAInH,CAAE;AAAA,IAAA;AAEzB,WAAIrC,IAAIc,EAAK+B,UAEA5B,EAAAA,EAAUwI,qBAAqBC,QAAQ5I,EAAK6I,OAAO3J,CAAC,CAAC,GAAG,GAAGqC,CAAE,GACnE,IAAIpB,EAAU6H,EAAKc,cAAc9I,EAAK+B,QAAQR,CAAE;AAAA,EAAA;AAAA;AAAA;AAAA,EAKzD,OAAcnB,aAAaJ,GAAgC;AAErDA,WAAAA,KAAQ,KAAW,CAAA,IACdG,EAAUiI,UAAUpI,CAAI,IAAU,CAACG,EAAU+H,YAAYlI,CAAI,CAAC,IAC9DG,EAAUsI,eAAezI,CAAI,IAAU,CAACG,EAAUqI,iBAAiBxI,CAAI,CAAC,IAC1E,CAACG,EAAUM,UAAUN,EAAU4I,gBAAgB/I,CAAI,CAAC,CAAC;AAAA,EAAA;AAAA;AAAA;AAAA,EAK9D,OAAcgJ,QAAQC,GAA2B;AAC/C,UAAM1H,IAAiB,CAAE;AACzB,QAAI0H,IAAY,EAAS,OAAA,IAAIjK,WAAW,mCAAmC;AAAA,QAClEiK,IAAY,IAAmBA,CAAAA,EAAAA,GAAW,GAAG1H,CAAE;AAAA,aAC/C0H,IAAY;AACR,MAAAzH,EAAA,GAAM,GAAGD,CAAE,GACX0H,EAAAA,GAAW,IAAI1H,CAAE;AAAA,aACnB0H,IAAY;AACV,MAAAzH,EAAA,GAAO,GAAGD,CAAE,GACZ0H,EAAAA,GAAW,IAAI1H,CAAE;AAAA,QACvB,OAAM,IAAIvC,WAAW,mCAAmC;AAC/D,WAAO,IAAImB,EAAU6H,EAAKkB,KAAK,GAAG3H,CAAE;AAAA,EAAA;AAAA;AAAA;AAAA,EAKtC,OAAc6G,UAAUpI,GAAuB;AACtCG,WAAAA,EAAUgJ,cAAcC,KAAKpJ,CAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM1C,OAAcyI,eAAezI,GAAuB;AAC3CG,WAAAA,EAAUkJ,mBAAmBD,KAAKpJ,CAAI;AAAA,EAAA;AAAA;AAAA;AAAA,EA2BxC8B,UAAsB;AACpB,WAAA,KAAKiG,QAAQ3I,MAAM;AAAA,EAAA;AAAA;AAAA;AAAA,EAK5B,OAAc6B,aAAaf,GAAkC5B,GAAsB;AACjF,QAAI2G,IAAiB;AACrB,eAAWzE,KAAON,GAAM;AACtB,YAAMoJ,IAAc9I,EAAIiB,KAAKG,iBAAiBtD,CAAO;AACrD,UAAIkC,EAAImB,YAAY,KAAK2H,EAAeC,QAAAA;AAC9B,MAAAtE,KAAA,IAAIqE,IAAS9I,EAAIuH,QAAQhG;AAAAA,IAAAA;AAE9BkD,WAAAA;AAAAA,EAAAA;AAAAA;AAAAA,EAIT,OAAe8D,gBAAgBS,GAA0B;AACvDA,IAAAA,IAAMC,UAAUD,CAAG;AACnB,UAAMvE,IAAsB,CAAE;AAC9B,aAAS/F,IAAI,GAAGA,IAAIsK,EAAIzH,QAAQ7C;AAC1BsK,MAAAA,EAAIX,OAAO3J,CAAC,KAAK,QAAYC,KAAKqK,EAAIE,WAAWxK,CAAC,CAAC,KAE9CC,EAAAA,KAAKkJ,SAASmB,EAAIlB,UAAUpJ,IAAI,GAAGA,IAAI,CAAC,GAAG,EAAE,CAAC,GAChDA,KAAA;AAGF+F,WAAAA;AAAAA,EAAAA;AAeX;AAAA;AAAA;AATEyC,EA7IWvH,GA6IagJ,iBAAwB;AAGhDzB,EAhJWvH,GAgJakJ,sBAA6B;AAAA;AAIrD3B,EApJWvH,GAoJawI,wBACtB;AArJG,IAAMxI,IAANwJ;AA2JA,MAAMxI,IAAN,MAAMA,EAAI;AAAA;AAAA;AAAA,EAUP9C,YAEU6F,GAEAlB,GAChB;AAHgBkB,SAAAA,UAAAA,GAEAlB,KAAAA,aAAAA;AAAAA,EAAAA;AAEpB;AAAA;AAbE0E,EAHWvG,GAGYyI,OAAM,IAAIzI,EAAI,GAAG,CAAC;AACzCuG,EAJWvG,GAIYC,UAAS,IAAID,EAAI,GAAG,CAAC;AAC5CuG,EALWvG,GAKYE,YAAW,IAAIF,EAAI,GAAG,CAAC;AAC9CuG,EANWvG,GAMYG,QAAO,IAAIH,EAAI,GAAG,CAAC;AANrC,IAAMA,IAAN0I;AAqBA,MAAM7B,IAAN,MAAMA,EAAK;AAAA;AAAA,EAWR3J,YAEUqD,GAECoI,GACjB;AAHgBpI,SAAAA,WAAAA,GAECoI,KAAAA,mBAAAA;AAAAA,EAAAA;AAAAA;AAAAA;AAAAA;AAAAA,EAOZlI,iBAAiBmC,GAAe;AACrC,WAAO,KAAK+F,iBAAiB9H,KAAKsB,OAAOS,IAAM,KAAK,EAAE,CAAC;AAAA,EAAA;AAE3D;AAAA;AAtBE2D,EAHWM,GAGYO,WAAU,IAAIP,EAAK,GAAK,CAAC,IAAI,IAAI,EAAE,CAAC,IAC3DN,EAJWM,GAIYc,gBAAe,IAAId,EAAK,GAAK,CAAC,GAAG,IAAI,EAAE,CAAC,IAC/DN,EALWM,GAKYC,QAAO,IAAID,EAAK,GAAK,CAAC,GAAG,IAAI,EAAE,CAAC,IACvDN,EANWM,GAMY+B,SAAQ,IAAI/B,EAAK,GAAK,CAAC,GAAG,IAAI,EAAE,CAAC,IACxDN,EAPWM,GAOYkB,OAAM,IAAIlB,EAAK,GAAK,CAAC,GAAG,GAAG,CAAC,CAAC;AAP/C,IAAMA,IAANgC;AC/3BP,MAAMC,IAA2C;AAAA,EAC/CC,GAAG/I,EAAIyI;AAAAA,EACPO,GAAGhJ,EAAIC;AAAAA,EACPgJ,GAAGjJ,EAAIE;AAAAA,EACPgJ,GAAGlJ,EAAIG;AACT,GAqCMgJ,IAAe,KACfC,IAAsC,KACtCC,IAAkB,WAClBC,IAAwB,IACxBC,IAAqB,GAErBC,IAAmB,GACnBC,IAAsB;AAE5B,SAASC,EAAajM,GAAkBkM,IAAiB,GAAW;AAClE,QAAMC,IAAqB,CAAE;AACrB5I,SAAAA,EAAAA,QAAQ,SAAUlD,GAAKqD,GAAG;AAChC,QAAI0I,IAAuB;AACvB7I,IAAAA,EAAAA,QAAQ,SAAU8I,GAAM5I,GAAG;AACzB,UAAA,CAAC4I,KAAQD,MAAU,MAAM;AAG3BD,QAAAA,EAAI5L,KAAK,IAAI6L,IAAQF,CAAM,IAAIxI,IAAIwI,CAAM,IAAIzI,IAAI2I,CAAK,MAAMA,IAAQF,CAAM,GAAG,GACrEE,IAAA;AACR;AAAA,MAAA;AAIE3I,UAAAA,MAAMpD,EAAI8C,SAAS,GAAG;AACxB,YAAI,CAACkJ;AAGH;AAEF,QAAID,MAAU,OAER7L,EAAAA,KAAK,IAAIkD,IAAIyI,CAAM,IAAIxI,IAAIwI,CAAM,SAASzI,IAAIyI,CAAM,GAAG,IAG3DC,EAAI5L,KAAK,IAAI6L,IAAQF,CAAM,IAAIxI,IAAIwI,CAAM,KAAKzI,IAAI,IAAI2I,CAAK,MAAMA,IAAQF,CAAM,GAAG;AAEpF;AAAA,MAAA;AAGEG,MAAAA,KAAQD,MAAU,SACZ3I,IAAAA;AAAAA,IACV,CACD;AAAA,EAAA,CACF,GACM0I,EAAIG,KAAK,EAAE;AACpB;AAIA,SAASC,EAAgBvM,GAAkBwM,GAAiC;AAC1E,SAAOxM,EAAQQ,MAAM,EAAE0H,IAAI,CAAC7H,GAAKqD,MAC3BA,IAAI8I,EAAW9I,KAAKA,KAAK8I,EAAW9I,IAAI8I,EAAWC,IAC9CpM,IAEFA,EAAI6H,IAAI,CAACmE,GAAM5I,MAChBA,IAAI+I,EAAW/I,KAAKA,KAAK+I,EAAW/I,IAAI+I,EAAWE,IAC9CL,IAEF,EACR,CACF;AACH;AAEA,SAASM,EACPC,GACA9M,GACAoM,GACAW,GAOA;AACA,MAAI,CAACA;AACI,WAAA;AAGT,QAAMC,KADWF,EAAMzJ,SAAS+I,IAAS,KAChBpM,GACnB4M,IAAIG,IAAWC,GACfL,IAAII,IAAWC,GACfrJ,IAAImJ,EAAMzJ,SAAS,IAAIuJ,IAAI,GAC3BhJ,IAAIkJ,EAAMzJ,SAAS,IAAIsJ,IAAI,GAE3BM,IAAS3J,KAAKsB,MAAMjB,CAAC,GACrBuJ,IAAS5J,KAAKsB,MAAMhB,CAAC,GACrBuJ,IAAQ7J,KAAKqE,KAAKiF,IAAIjJ,IAAIsJ,CAAM,GAChCG,IAAQ9J,KAAKqE,KAAKgF,IAAI/I,IAAIsJ,CAAM;AAG/B,SAAA;AAAA,IAACvJ,GAAAA;AAAAA,IAAGC,GAAAA;AAAAA,IAAG+I,GAAAA;AAAAA,IAAGC,GAAAA;AAAAA,IAAGF,YAFD;AAAA,MAAC/I,GAAGsJ;AAAAA,MAAQrJ,GAAGsJ;AAAAA,MAAQN,GAAGO;AAAAA,MAAOR,GAAGS;AAAAA,IAAK;AAAA,EAE9B;AAChC;AAEA,SAASC,EAAcC,GAAwBC,GAA6B;AAI1E,SAAOD,IAAgBrB,IAAmBC;AAC5C;AAEA,SAASsB,EAAU;AAAA,EACjBC,OAAAA;AAAAA,EACAC,OAAAA;AAAAA,EACA1L,YAAAA;AAAAA,EACAsL,eAAAA;AAAAA,EACAC,YAAAA;AAAAA,EACAR,UAAAA;AAAAA,EACA/M,MAAAA;AASF,GAAG;AACK2N,QAAAA,IAASC,EAAQ,MAAM;AACrBC,UAAAA,IAAWpM,EAAUC,aAAa+L,CAAK;AAC7C,WAAO/N,EAAOiC,eAAekM,GAAUtC,EAAgBmC,CAAK,GAAG1L,CAAU;AAAA,EACxE,GAAA,CAACyL,GAAOC,GAAO1L,CAAU,CAAC,GAEvB;AAAA,IAAC8K,OAAAA;AAAAA,IAAOV,QAAAA;AAAAA,IAAQ0B,UAAAA;AAAAA,IAAUC,yBAAAA;AAAAA,EAAuB,IAAIH,EAAQ,MAAM;AACjEd,UAAAA,IAAQa,EAAO9J,WAAW,GAE1BuI,IAASiB,EAAcC,CAAyB,GAChDQ,IAAWhB,EAAMzJ,SAAS+I,IAAS,GACnC2B,IAA0BlB,EAAiBC,GAAO9M,GAAMoM,GAAQW,CAAQ;AACvE,WAAA;AAAA,MACLD,OAAAA;AAAAA,MACAV,QAAAA;AAAAA,MACA0B,UAAAA;AAAAA,MACAC,yBAAAA;AAAAA,IACF;AAAA,EAAA,GACC,CAACJ,GAAQ3N,GAAM+M,GAAUO,GAAeC,CAAU,CAAC;AAE/C,SAAA;AAAA,IACLI,QAAAA;AAAAA,IACAvB,QAAAA;AAAAA,IACAU,OAAAA;AAAAA,IACAgB,UAAAA;AAAAA,IACAC,yBAAAA;AAAAA,EACF;AACF;AAEA,SAASC,EAAmBC,GAAgB;AACpC,QAAA;AAAA,IACJR,OAAAA;AAAAA,IACAzN,MAAAA,IAAO4L;AAAAA,IACP8B,OAAAA,IAAQ7B;AAAAA,IACRnH,OAAAA,IAAQoH;AAAAA,IACR9J,YAAAA,IAAagK;AAAAA,IACbkC,OAAAA;AAAAA,IACAnB,UAAAA;AAAAA,EAAAA,IACEkB,GACEV,IAAiCY,QAEjC;AAAA,IAAC/B,QAAAA;AAAAA,IAAQU,OAAAA;AAAAA,IAAOgB,UAAAA;AAAAA,IAAUC,yBAAAA;AAAAA,MAA2BP,EAAU;AAAA,IACnEC,OAAAA;AAAAA,IACAC,OAAAA;AAAAA,IACA1L,YAAAA;AAAAA,IACAsL,eAAevB;AAAAA,IACfwB,YAAAA;AAAAA,IACAR,UAAAA;AAAAA,IACA/M,MAAAA;AAAAA,EAAAA,CACD,GAEKoO,IAAcR,EAClB,MACEb,MAAYgB,KAAAA,QAAAA,EAAyBrB,cACjCD,EAAgBK,GAAOiB,EAAwBrB,UAAU,IACzDI,GACN,CAACiB,KAAAA,gBAAAA,EAAyBrB,YAAYI,GAAOC,CAAQ,CACvD,GAQMsB,IAASlC,EAAaiC,GAAahC,CAAM;AAE/C,SACG,gBAAAkC,EAAA,OAAA,EAAI,QAAQtO,GAAM,OAAOA,GAAM,SAAS,OAAO8N,CAAQ,IAAIA,CAAQ,IAAI,MAAK,OAC1E,UAAA;AAAA,IAAA,CAAC,CAACI,KAAU,gBAAAK,EAAA,SAAA,EAAOL,UAAMA,GAAA;AAAA,IAC1B,gBAAAK,EAACC,EAAO,MAAP,EACC,MAAM9J,GACN,GAAG2J,GACH,gBAAe,cACf,SAAS;AAAA,MAACI,SAAS;AAAA,OACnB,SAAS;AAAA,MAACA,SAAS;AAAA,OACnB,MAAM;AAAA,MAACA,SAAS;AAAA,IAAA,EAAI,CAAA;AAAA,EAAA,GAExB;AAEJ;AACMC,MAAAA,IAAYC,EAAKX,CAAkB;AACzCU,EAAUE,cAAc;"}