sanity 3.74.2-corel.18 → 3.74.2-coreui.20

package/dist/QRCodeSVG-D6VfGEbM.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"QRCodeSVG-D6VfGEbM.mjs","sources":["../../../node_modules/.pnpm/@sanity+presentation@1.19.14-release.0_@emotion+is-prop-valid@1.3.1_@sanity+color@3.0.6_debug_vqegs67ktulknun2leapg5jvli/node_modules/@sanity/presentation/dist/_chunks-es/QRCodeSVG.js"],"sourcesContent":["import { jsxs, jsx } from \"react/jsx-runtime\";\nimport { motion } from \"framer-motion\";\nimport { memo, useMemo } from \"react\";\n/**\n * @license QR Code generator library (TypeScript)\n * Copyright (c) Project Nayuki.\n * SPDX-License-Identifier: MIT\n */\nclass QrCode {\n  /*-- Static factory functions (high level) --*/\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  static encodeText(text, ecl) {\n    const segs = QrSegment.makeSegments(text);\n    return QrCode.encodeSegments(segs, ecl);\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  static encodeBinary(data, ecl) {\n    const seg = QrSegment.makeBytes(data);\n    return QrCode.encodeSegments([seg], ecl);\n  }\n  /*-- Static factory functions (mid level) --*/\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  static encodeSegments(segs, ecl, minVersion = 1, maxVersion = 40, mask = -1, boostEcl = !0) {\n    if (!(QrCode.MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= QrCode.MAX_VERSION) || mask < -1 || mask > 7) throw new RangeError(\"Invalid value\");\n    let version, dataUsedBits;\n    for (version = minVersion; ; version++) {\n      const dataCapacityBits2 = QrCode.getNumDataCodewords(version, ecl) * 8, usedBits = QrSegment.getTotalBits(segs, version);\n      if (usedBits <= dataCapacityBits2) {\n        dataUsedBits = usedBits;\n        break;\n      }\n      if (version >= maxVersion)\n        throw new RangeError(\"Data too long\");\n    }\n    for (const newEcl of [Ecc.MEDIUM, Ecc.QUARTILE, Ecc.HIGH])\n      boostEcl && dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8 && (ecl = newEcl);\n    const bb = [];\n    for (const seg of segs) {\n      appendBits(seg.mode.modeBits, 4, bb), 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    const dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8;\n    assert(bb.length <= dataCapacityBits), appendBits(0, Math.min(4, dataCapacityBits - bb.length), bb), appendBits(0, (8 - bb.length % 8) % 8, bb), assert(bb.length % 8 == 0);\n    for (let padByte = 236; bb.length < dataCapacityBits; padByte ^= 253) appendBits(padByte, 8, bb);\n    const dataCodewords = [];\n    for (; dataCodewords.length * 8 < bb.length; ) dataCodewords.push(0);\n    return bb.forEach((b, i) => dataCodewords[i >>> 3] |= b << 7 - (i & 7)), new QrCode(version, ecl, dataCodewords, mask);\n  }\n  /*-- Fields --*/\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  // 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  // The modules of this QR Code (false = light, true = dark).\n  // Immutable after constructor finishes. Accessed through getModule().\n  modules = [];\n  // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.\n  isFunction = [];\n  /*-- Constructor (low level) and fields --*/\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  constructor(version, errorCorrectionLevel, dataCodewords, msk) {\n    if (this.version = version, this.errorCorrectionLevel = errorCorrectionLevel, version < QrCode.MIN_VERSION || version > QrCode.MAX_VERSION) 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    const row = [];\n    for (let i = 0; i < this.size; i++) row.push(!1);\n    for (let i = 0; i < this.size; i++)\n      this.modules.push(row.slice()), this.isFunction.push(row.slice());\n    this.drawFunctionPatterns();\n    const allCodewords = this.addEccAndInterleave(dataCodewords);\n    if (this.drawCodewords(allCodewords), msk == -1) {\n      let minPenalty = 1e9;\n      for (let i = 0; i < 8; i++) {\n        this.applyMask(i), this.drawFormatBits(i);\n        const penalty = this.getPenaltyScore();\n        penalty < minPenalty && (msk = i, minPenalty = penalty), this.applyMask(i);\n      }\n    }\n    assert(0 <= msk && msk <= 7), this.mask = msk, this.applyMask(msk), this.drawFormatBits(msk), this.isFunction = [];\n  }\n  /*-- Accessor methods --*/\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  getModule(x, y) {\n    return 0 <= x && x < this.size && 0 <= y && y < this.size && this.modules[y][x];\n  }\n  // Modified to expose modules for easy access\n  getModules() {\n    return this.modules;\n  }\n  /*-- Private helper methods for constructor: Drawing function modules --*/\n  // Reads this object's version field, and draws and marks all function modules.\n  drawFunctionPatterns() {\n    for (let i = 0; i < this.size; i++)\n      this.setFunctionModule(6, i, i % 2 == 0), this.setFunctionModule(i, 6, i % 2 == 0);\n    this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);\n    const alignPatPos = this.getAlignmentPatternPositions(), numAlign = alignPatPos.length;\n    for (let i = 0; i < numAlign; i++)\n      for (let j = 0; j < numAlign; j++)\n        i == 0 && j == 0 || i == 0 && j == numAlign - 1 || i == numAlign - 1 && j == 0 || this.drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);\n    this.drawFormatBits(0), this.drawVersion();\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  drawFormatBits(mask) {\n    const data = this.errorCorrectionLevel.formatBits << 3 | mask;\n    let rem = data;\n    for (let i = 0; i < 10; i++) rem = rem << 1 ^ (rem >>> 9) * 1335;\n    const bits = (data << 10 | rem) ^ 21522;\n    assert(bits >>> 15 == 0);\n    for (let i = 0; i <= 5; i++) this.setFunctionModule(8, i, getBit(bits, i));\n    this.setFunctionModule(8, 7, getBit(bits, 6)), this.setFunctionModule(8, 8, getBit(bits, 7)), this.setFunctionModule(7, 8, getBit(bits, 8));\n    for (let i = 9; i < 15; i++) this.setFunctionModule(14 - i, 8, getBit(bits, i));\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, !0);\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  drawVersion() {\n    if (this.version < 7) return;\n    let rem = this.version;\n    for (let i = 0; i < 12; i++) rem = rem << 1 ^ (rem >>> 11) * 7973;\n    const bits = this.version << 12 | rem;\n    assert(bits >>> 18 == 0);\n    for (let i = 0; i < 18; i++) {\n      const color = getBit(bits, i), a = this.size - 11 + i % 3, b = Math.floor(i / 3);\n      this.setFunctionModule(a, b, color), this.setFunctionModule(b, a, color);\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  drawFinderPattern(x, y) {\n    for (let dy = -4; dy <= 4; dy++)\n      for (let dx = -4; dx <= 4; dx++) {\n        const dist = Math.max(Math.abs(dx), Math.abs(dy)), xx = x + dx, yy = y + dy;\n        0 <= xx && xx < this.size && 0 <= yy && yy < this.size && this.setFunctionModule(xx, yy, dist != 2 && dist != 4);\n      }\n  }\n  // Draws a 5*5 alignment pattern, with the center module\n  // at (x, y). All modules must be in bounds.\n  drawAlignmentPattern(x, y) {\n    for (let dy = -2; dy <= 2; dy++)\n      for (let dx = -2; dx <= 2; dx++) this.setFunctionModule(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) != 1);\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  setFunctionModule(x, y, isDark) {\n    this.modules[y][x] = isDark, this.isFunction[y][x] = !0;\n  }\n  /*-- Private helper methods for constructor: Codewords and masking --*/\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  addEccAndInterleave(data) {\n    const ver = this.version, ecl = this.errorCorrectionLevel;\n    if (data.length != QrCode.getNumDataCodewords(ver, ecl)) throw new RangeError(\"Invalid argument\");\n    const numBlocks = QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver], blockEccLen = QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver], rawCodewords = Math.floor(QrCode.getNumRawDataModules(ver) / 8), numShortBlocks = numBlocks - rawCodewords % numBlocks, shortBlockLen = Math.floor(rawCodewords / numBlocks), blocks = [], rsDiv = QrCode.reedSolomonComputeDivisor(blockEccLen);\n    for (let i = 0, k = 0; i < numBlocks; i++) {\n      const dat = data.slice(k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1));\n      k += dat.length;\n      const ecc = QrCode.reedSolomonComputeRemainder(dat, rsDiv);\n      i < numShortBlocks && dat.push(0), blocks.push(dat.concat(ecc));\n    }\n    const result = [];\n    for (let i = 0; i < blocks[0].length; i++)\n      blocks.forEach((block, j) => {\n        (i != shortBlockLen - blockEccLen || j >= numShortBlocks) && result.push(block[i]);\n      });\n    return assert(result.length == rawCodewords), result;\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  drawCodewords(data) {\n    if (data.length != Math.floor(QrCode.getNumRawDataModules(this.version) / 8)) throw new RangeError(\"Invalid argument\");\n    let i = 0;\n    for (let right = this.size - 1; right >= 1; right -= 2) {\n      right == 6 && (right = 5);\n      for (let vert = 0; vert < this.size; vert++)\n        for (let j = 0; j < 2; j++) {\n          const x = right - j, y = right + 1 & 2 ? vert : this.size - 1 - vert;\n          !this.isFunction[y][x] && i < data.length * 8 && (this.modules[y][x] = getBit(data[i >>> 3], 7 - (i & 7)), i++);\n        }\n    }\n    assert(i == data.length * 8);\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  applyMask(mask) {\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;\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        !this.isFunction[y][x] && invert && (this.modules[y][x] = !this.modules[y][x]);\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  getPenaltyScore() {\n    let result = 0;\n    for (let y = 0; y < this.size; y++) {\n      let runColor = !1, runX = 0;\n      const runHistory = [0, 0, 0, 0, 0, 0, 0];\n      for (let x = 0; x < this.size; x++)\n        this.modules[y][x] == runColor ? (runX++, runX == 5 ? result += QrCode.PENALTY_N1 : runX > 5 && result++) : (this.finderPenaltyAddHistory(runX, runHistory), runColor || (result += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3), runColor = this.modules[y][x], runX = 1);\n      result += this.finderPenaltyTerminateAndCount(runColor, runX, runHistory) * QrCode.PENALTY_N3;\n    }\n    for (let x = 0; x < this.size; x++) {\n      let runColor = !1, runY = 0;\n      const runHistory = [0, 0, 0, 0, 0, 0, 0];\n      for (let y = 0; y < this.size; y++)\n        this.modules[y][x] == runColor ? (runY++, runY == 5 ? result += QrCode.PENALTY_N1 : runY > 5 && result++) : (this.finderPenaltyAddHistory(runY, runHistory), runColor || (result += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3), runColor = this.modules[y][x], runY = 1);\n      result += this.finderPenaltyTerminateAndCount(runColor, runY, runHistory) * QrCode.PENALTY_N3;\n    }\n    for (let y = 0; y < this.size - 1; y++)\n      for (let x = 0; x < this.size - 1; x++) {\n        const color = this.modules[y][x];\n        color == this.modules[y][x + 1] && color == this.modules[y + 1][x] && color == this.modules[y + 1][x + 1] && (result += QrCode.PENALTY_N2);\n      }\n    let dark = 0;\n    for (const row of this.modules) dark = row.reduce((sum, color) => sum + (color ? 1 : 0), dark);\n    const total = this.size * this.size, k = Math.ceil(Math.abs(dark * 20 - total * 10) / total) - 1;\n    return assert(0 <= k && k <= 9), result += k * QrCode.PENALTY_N4, assert(0 <= result && result <= 2568888), result;\n  }\n  /*-- Private helper functions --*/\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  getAlignmentPatternPositions() {\n    if (this.version == 1) return [];\n    {\n      const numAlign = Math.floor(this.version / 7) + 2, step = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (numAlign * 2 - 2)) * 2, result = [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  static getNumRawDataModules(ver) {\n    if (ver < QrCode.MIN_VERSION || ver > QrCode.MAX_VERSION) throw new RangeError(\"Version number out of range\");\n    let result = (16 * ver + 128) * ver + 64;\n    if (ver >= 2) {\n      const numAlign = Math.floor(ver / 7) + 2;\n      result -= (25 * numAlign - 10) * numAlign - 55, ver >= 7 && (result -= 36);\n    }\n    return assert(208 <= result && result <= 29648), result;\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  static getNumDataCodewords(ver, ecl) {\n    return Math.floor(QrCode.getNumRawDataModules(ver) / 8) - QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] * QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];\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  static reedSolomonComputeDivisor(degree) {\n    if (degree < 1 || degree > 255) throw new RangeError(\"Degree out of range\");\n    const result = [];\n    for (let i = 0; i < degree - 1; i++) result.push(0);\n    result.push(1);\n    let root = 1;\n    for (let i = 0; i < degree; i++) {\n      for (let j = 0; j < result.length; j++)\n        result[j] = QrCode.reedSolomonMultiply(result[j], root), j + 1 < result.length && (result[j] ^= result[j + 1]);\n      root = QrCode.reedSolomonMultiply(root, 2);\n    }\n    return result;\n  }\n  // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.\n  static reedSolomonComputeRemainder(data, divisor) {\n    const result = divisor.map((_) => 0);\n    for (const b of data) {\n      const factor = b ^ result.shift();\n      result.push(0), divisor.forEach((coef, i) => result[i] ^= QrCode.reedSolomonMultiply(coef, factor));\n    }\n    return result;\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  static reedSolomonMultiply(x, y) {\n    if (x >>> 8 || y >>> 8) throw new RangeError(\"Byte out of range\");\n    let z = 0;\n    for (let i = 7; i >= 0; i--)\n      z = z << 1 ^ (z >>> 7) * 285, z ^= (y >>> i & 1) * x;\n    return assert(z >>> 8 == 0), z;\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  finderPenaltyCountPatterns(runHistory) {\n    const n = runHistory[1];\n    assert(n <= this.size * 3);\n    const core = n > 0 && runHistory[2] == n && runHistory[3] == n * 3 && runHistory[4] == n && runHistory[5] == n;\n    return (core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0) + (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0);\n  }\n  // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().\n  finderPenaltyTerminateAndCount(currentRunColor, currentRunLength, runHistory) {\n    return currentRunColor && (this.finderPenaltyAddHistory(currentRunLength, runHistory), currentRunLength = 0), currentRunLength += this.size, this.finderPenaltyAddHistory(currentRunLength, runHistory), this.finderPenaltyCountPatterns(runHistory);\n  }\n  // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().\n  finderPenaltyAddHistory(currentRunLength, runHistory) {\n    runHistory[0] == 0 && (currentRunLength += this.size), runHistory.pop(), runHistory.unshift(currentRunLength);\n  }\n  /*-- Constants and tables --*/\n  // The minimum version number supported in the QR Code Model 2 standard.\n  static MIN_VERSION = 1;\n  // The maximum version number supported in the QR Code Model 2 standard.\n  static MAX_VERSION = 40;\n  // For use in getPenaltyScore(), when evaluating which mask is best.\n  static PENALTY_N1 = 3;\n  static PENALTY_N2 = 3;\n  static PENALTY_N3 = 40;\n  static PENALTY_N4 = 10;\n  static ECC_CODEWORDS_PER_BLOCK = [\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    [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n    // Low\n    [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],\n    // Medium\n    [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],\n    // Quartile\n    [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]\n    // High\n  ];\n  static NUM_ERROR_CORRECTION_BLOCKS = [\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    [-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, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],\n    // Low\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, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],\n    // Medium\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, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],\n    // Quartile\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, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]\n    // High\n  ];\n}\nfunction appendBits(val, len, bb) {\n  if (len < 0 || len > 31 || val >>> len) throw new RangeError(\"Value out of range\");\n  for (let i = len - 1; i >= 0; i--) bb.push(val >>> i & 1);\n}\nfunction getBit(x, i) {\n  return (x >>> i & 1) != 0;\n}\nfunction assert(cond) {\n  if (!cond) throw new Error(\"Assertion error\");\n}\nclass QrSegment {\n  /*-- Static factory functions (mid level) --*/\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  static makeBytes(data) {\n    const bb = [];\n    for (const b of data) appendBits(b, 8, bb);\n    return new QrSegment(Mode.BYTE, data.length, bb);\n  }\n  // Returns a segment representing the given string of decimal digits encoded in numeric mode.\n  static makeNumeric(digits) {\n    if (!QrSegment.isNumeric(digits)) throw new RangeError(\"String contains non-numeric characters\");\n    const bb = [];\n    for (let i = 0; i < digits.length; ) {\n      const n = Math.min(digits.length - i, 3);\n      appendBits(parseInt(digits.substring(i, i + n), 10), n * 3 + 1, bb), i += n;\n    }\n    return new QrSegment(Mode.NUMERIC, digits.length, bb);\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  static makeAlphanumeric(text) {\n    if (!QrSegment.isAlphanumeric(text)) throw new RangeError(\"String contains unencodable characters in alphanumeric mode\");\n    const bb = [];\n    let i;\n    for (i = 0; i + 2 <= text.length; i += 2) {\n      let temp = QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45;\n      temp += QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1)), appendBits(temp, 11, bb);\n    }\n    return i < text.length && appendBits(QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6, bb), new QrSegment(Mode.ALPHANUMERIC, text.length, bb);\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  static makeSegments(text) {\n    return text == \"\" ? [] : QrSegment.isNumeric(text) ? [QrSegment.makeNumeric(text)] : QrSegment.isAlphanumeric(text) ? [QrSegment.makeAlphanumeric(text)] : [QrSegment.makeBytes(QrSegment.toUtf8ByteArray(text))];\n  }\n  // Returns a segment representing an Extended Channel Interpretation\n  // (ECI) designator with the given assignment value.\n  static makeEci(assignVal) {\n    const bb = [];\n    if (assignVal < 0) throw new RangeError(\"ECI assignment value out of range\");\n    if (assignVal < 128) appendBits(assignVal, 8, bb);\n    else if (assignVal < 16384)\n      appendBits(2, 2, bb), appendBits(assignVal, 14, bb);\n    else if (assignVal < 1e6)\n      appendBits(6, 3, bb), 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  // 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  static isNumeric(text) {\n    return QrSegment.NUMERIC_REGEX.test(text);\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  static isAlphanumeric(text) {\n    return QrSegment.ALPHANUMERIC_REGEX.test(text);\n  }\n  /*-- Constructor (low level) and fields --*/\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  constructor(mode, numChars, bitData) {\n    if (this.mode = mode, this.numChars = numChars, this.bitData = bitData, numChars < 0) throw new RangeError(\"Invalid argument\");\n    this.bitData = bitData.slice();\n  }\n  /*-- Methods --*/\n  // Returns a new copy of the data bits of this segment.\n  getData() {\n    return this.bitData.slice();\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  static getTotalBits(segs, version) {\n    let result = 0;\n    for (const seg of segs) {\n      const ccbits = seg.mode.numCharCountBits(version);\n      if (seg.numChars >= 1 << ccbits) return 1 / 0;\n      result += 4 + ccbits + seg.bitData.length;\n    }\n    return result;\n  }\n  // Returns a new array of bytes representing the given string encoded in UTF-8.\n  static toUtf8ByteArray(str) {\n    str = encodeURI(str);\n    const result = [];\n    for (let i = 0; i < str.length; i++)\n      str.charAt(i) != \"%\" ? result.push(str.charCodeAt(i)) : (result.push(parseInt(str.substring(i + 1, i + 3), 16)), i += 2);\n    return result;\n  }\n  /*-- Constants --*/\n  // Describes precisely all strings that are encodable in numeric mode.\n  static NUMERIC_REGEX = /^[0-9]*$/;\n  // Describes precisely all strings that are encodable in alphanumeric mode.\n  static ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+./:-]*$/;\n  // The set of all legal characters in alphanumeric mode,\n  // where each character value maps to the index in the string.\n  static ALPHANUMERIC_CHARSET = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\";\n}\nclass Ecc {\n  /*-- Constants --*/\n  static LOW = new Ecc(0, 1);\n  // The QR Code can tolerate about  7% erroneous codewords\n  static MEDIUM = new Ecc(1, 0);\n  // The QR Code can tolerate about 15% erroneous codewords\n  static QUARTILE = new Ecc(2, 3);\n  // The QR Code can tolerate about 25% erroneous codewords\n  static HIGH = new Ecc(3, 2);\n  // The QR Code can tolerate about 30% erroneous codewords\n  /*-- Constructor and fields --*/\n  constructor(ordinal, formatBits) {\n    this.ordinal = ordinal, this.formatBits = formatBits;\n  }\n}\nclass Mode {\n  /*-- Constants --*/\n  static NUMERIC = new Mode(1, [10, 12, 14]);\n  static ALPHANUMERIC = new Mode(2, [9, 11, 13]);\n  static BYTE = new Mode(4, [8, 16, 16]);\n  static KANJI = new Mode(8, [8, 10, 12]);\n  static ECI = new Mode(7, [0, 0, 0]);\n  /*-- Constructor and fields --*/\n  constructor(modeBits, numBitsCharCount) {\n    this.modeBits = modeBits, this.numBitsCharCount = numBitsCharCount;\n  }\n  /*-- Method --*/\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  numCharCountBits(ver) {\n    return this.numBitsCharCount[Math.floor((ver + 7) / 17)];\n  }\n}\nconst ERROR_LEVEL_MAP = {\n  L: Ecc.LOW,\n  M: Ecc.MEDIUM,\n  Q: Ecc.QUARTILE,\n  H: Ecc.HIGH\n}, DEFAULT_SIZE = 128, DEFAULT_LEVEL = \"L\", DEFAULT_FGCOLOR = \"#000000\", DEFAULT_INCLUDEMARGIN = !1, DEFAULT_MINVERSION = 1, SPEC_MARGIN_SIZE = 4, DEFAULT_MARGIN_SIZE = 0;\nfunction generatePath(modules, margin = 0) {\n  const ops = [];\n  return modules.forEach(function(row, y) {\n    let start = null;\n    row.forEach(function(cell, x) {\n      if (!cell && start !== null) {\n        ops.push(`M${start + margin} ${y + margin}h${x - start}v1H${start + margin}z`), start = null;\n        return;\n      }\n      if (x === row.length - 1) {\n        if (!cell)\n          return;\n        start === null ? ops.push(`M${x + margin},${y + margin} h1v1H${x + margin}z`) : ops.push(`M${start + margin},${y + margin} h${x + 1 - start}v1H${start + margin}z`);\n        return;\n      }\n      cell && start === null && (start = x);\n    });\n  }), ops.join(\"\");\n}\nfunction excavateModules(modules, excavation) {\n  return modules.slice().map((row, y) => y < excavation.y || y >= excavation.y + excavation.h ? row : row.map((cell, x) => x < excavation.x || x >= excavation.x + excavation.w ? cell : !1));\n}\nfunction getImageSettings(cells, size, margin, logoSize) {\n  if (!logoSize)\n    return null;\n  const scale = (cells.length + margin * 2) / size, w = logoSize * scale, h = logoSize * scale, x = cells.length / 2 - w / 2, y = cells.length / 2 - h / 2, floorX = Math.floor(x), floorY = Math.floor(y), ceilW = Math.ceil(w + x - floorX), ceilH = Math.ceil(h + y - floorY);\n  return {\n    x,\n    y,\n    h,\n    w,\n    excavation: {\n      x: floorX,\n      y: floorY,\n      w: ceilW,\n      h: ceilH\n    }\n  };\n}\nfunction getMarginSize(includeMargin, marginSize) {\n  return marginSize != null ? Math.max(Math.floor(marginSize), 0) : includeMargin ? SPEC_MARGIN_SIZE : DEFAULT_MARGIN_SIZE;\n}\nfunction useQRCode({\n  value,\n  level,\n  minVersion,\n  includeMargin,\n  marginSize,\n  logoSize,\n  size\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    cells: cells_0,\n    margin: margin_0,\n    numCells: numCells_0,\n    calculatedImageSettings: calculatedImageSettings_0\n  } = useMemo(() => {\n    const cells = qrcode.getModules(), margin = getMarginSize(includeMargin, marginSize), numCells = cells.length + margin * 2, calculatedImageSettings = getImageSettings(cells, size, margin, logoSize);\n    return {\n      cells,\n      margin,\n      numCells,\n      calculatedImageSettings\n    };\n  }, [qrcode, size, logoSize, includeMargin, marginSize]);\n  return {\n    qrcode,\n    margin: margin_0,\n    cells: cells_0,\n    numCells: numCells_0,\n    calculatedImageSettings: calculatedImageSettings_0\n  };\n}\nfunction QRCodeSVGComponent(props) {\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, marginSize = void 0, {\n    margin,\n    cells,\n    numCells,\n    calculatedImageSettings\n  } = useQRCode({\n    value,\n    level,\n    minVersion,\n    includeMargin: DEFAULT_INCLUDEMARGIN,\n    marginSize,\n    logoSize,\n    size\n  }), cellsToDraw = useMemo(() => logoSize && calculatedImageSettings?.excavation ? excavateModules(cells, calculatedImageSettings.excavation) : cells, [calculatedImageSettings?.excavation, cells, logoSize]), fgPath = generatePath(cellsToDraw, margin);\n  return /* @__PURE__ */ jsxs(\"svg\", { height: size, width: size, viewBox: `0 0 ${numCells} ${numCells}`, role: \"img\", children: [\n    !!title && /* @__PURE__ */ jsx(\"title\", { children: title }),\n    /* @__PURE__ */ jsx(motion.path, { fill: color, d: fgPath, shapeRendering: \"crispEdges\", initial: {\n      opacity: 0\n    }, animate: {\n      opacity: 2\n    }, exit: {\n      opacity: -1\n    } })\n  ] });\n}\nconst QRCodeSVG = memo(QRCodeSVGComponent);\nQRCodeSVG.displayName = \"Memo(QRCodeSVG)\";\nexport {\n  QRCodeSVG as default\n};\n//# sourceMappingURL=QRCodeSVG.js.map\n"],"names":["_QrCode","version","errorCorrectionLevel","dataCodewords","msk","__publicField","row","allCodewords","minPenalty","i","penalty","assert","text","ecl","segs","QrSegment","data","seg","minVersion","maxVersion","mask","boostEcl","dataUsedBits","dataCapacityBits2","usedBits","newEcl","Ecc","bb","appendBits","b","dataCapacityBits","padByte","x","y","alignPatPos","numAlign","j","rem","bits","getBit","color","a","dy","dx","dist","xx","yy","isDark","ver","numBlocks","blockEccLen","rawCodewords","numShortBlocks","shortBlockLen","blocks","rsDiv","k","dat","ecc","result","block","right","vert","invert","runColor","runX","runHistory","runY","dark","sum","total","step","pos","degree","root","divisor","_","factor","coef","z","n","core","currentRunColor","currentRunLength","QrCode","val","len","cond","_QrSegment","Mode","digits","temp","assignVal","mode","numChars","bitData","ccbits","str","_Ecc","ordinal","formatBits","_Mode","modeBits","numBitsCharCount","ERROR_LEVEL_MAP","DEFAULT_SIZE","DEFAULT_LEVEL","DEFAULT_FGCOLOR","DEFAULT_INCLUDEMARGIN","DEFAULT_MINVERSION","SPEC_MARGIN_SIZE","DEFAULT_MARGIN_SIZE","generatePath","modules","margin","ops","start","cell","excavateModules","excavation","getImageSettings","cells","size","logoSize","scale","w","h","floorX","floorY","ceilW","ceilH","getMarginSize","includeMargin","marginSize","useQRCode","value","level","qrcode","useMemo","segments","cells_0","margin_0","numCells_0","calculatedImageSettings_0","numCells","calculatedImageSettings","QRCodeSVGComponent","props","title","cellsToDraw","fgPath","jsxs","jsx","motion","QRCodeSVG","memo"],"mappings":";;;;;;AAGA;AAAA;AAAA;AAAA;AAAA;AAKA,MAAMA,IAAN,MAAMA,EAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwEX,YAAYC,GAASC,GAAsBC,GAAeC,GAAK;AAR/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAC,EAAA,iBAAU,CAAE;AAEZ;AAAA,IAAAA,EAAA,oBAAa,CAAE;AAOb,QAAI,KAAK,UAAUJ,GAAS,KAAK,uBAAuBC,GAAsBD,IAAUD,EAAO,eAAeC,IAAUD,EAAO,YAAa,OAAM,IAAI,WAAW,4BAA4B;AAC7L,QAAII,IAAM,MAAMA,IAAM,EAAG,OAAM,IAAI,WAAW,yBAAyB;AACvE,SAAK,OAAOH,IAAU,IAAI;AAC1B,UAAMK,IAAM,CAAE;AACd,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,IAAK,CAAAA,EAAI,KAAK,EAAE;AAC/C,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM;AAC7B,WAAK,QAAQ,KAAKA,EAAI,MAAO,CAAA,GAAG,KAAK,WAAW,KAAKA,EAAI,MAAK,CAAE;AAClE,SAAK,qBAAsB;AAC3B,UAAMC,IAAe,KAAK,oBAAoBJ,CAAa;AAC3D,QAAI,KAAK,cAAcI,CAAY,GAAGH,KAAO,IAAI;AAC/C,UAAII,IAAa;AACjB,eAASC,IAAI,GAAGA,IAAI,GAAGA,KAAK;AAC1B,aAAK,UAAUA,CAAC,GAAG,KAAK,eAAeA,CAAC;AACxC,cAAMC,IAAU,KAAK,gBAAiB;AACtC,QAAAA,IAAUF,MAAeJ,IAAMK,GAAGD,IAAaE,IAAU,KAAK,UAAUD,CAAC;AAAA,MACjF;AAAA,IACA;AACI,IAAAE,EAAO,KAAKP,KAAOA,KAAO,CAAC,GAAG,KAAK,OAAOA,GAAK,KAAK,UAAUA,CAAG,GAAG,KAAK,eAAeA,CAAG,GAAG,KAAK,aAAa,CAAE;AAAA,EACtH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EApFE,OAAO,WAAWQ,GAAMC,GAAK;AAC3B,UAAMC,IAAOC,EAAU,aAAaH,CAAI;AACxC,WAAOZ,EAAO,eAAec,GAAMD,CAAG;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKE,OAAO,aAAaG,GAAMH,GAAK;AAC7B,UAAMI,IAAMF,EAAU,UAAUC,CAAI;AACpC,WAAOhB,EAAO,eAAe,CAACiB,CAAG,GAAGJ,CAAG;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWE,OAAO,eAAeC,GAAMD,GAAKK,IAAa,GAAGC,IAAa,IAAIC,IAAO,IAAIC,IAAW,IAAI;AAC1F,QAAI,EAAErB,EAAO,eAAekB,KAAcA,KAAcC,KAAcA,KAAcnB,EAAO,gBAAgBoB,IAAO,MAAMA,IAAO,EAAG,OAAM,IAAI,WAAW,eAAe;AACtK,QAAInB,GAASqB;AACb,SAAKrB,IAAUiB,KAAcjB,KAAW;AACtC,YAAMsB,IAAoBvB,EAAO,oBAAoBC,GAASY,CAAG,IAAI,GAAGW,IAAWT,EAAU,aAAaD,GAAMb,CAAO;AACvH,UAAIuB,KAAYD,GAAmB;AACjC,QAAAD,IAAeE;AACf;AAAA,MACR;AACM,UAAIvB,KAAWkB;AACb,cAAM,IAAI,WAAW,eAAe;AAAA,IAC5C;AACI,eAAWM,KAAU,CAACC,EAAI,QAAQA,EAAI,UAAUA,EAAI,IAAI;AACtD,MAAAL,KAAYC,KAAgBtB,EAAO,oBAAoBC,GAASwB,CAAM,IAAI,MAAMZ,IAAMY;AACxF,UAAME,IAAK,CAAE;AACb,eAAWV,KAAOH,GAAM;AACtB,MAAAc,EAAWX,EAAI,KAAK,UAAU,GAAGU,CAAE,GAAGC,EAAWX,EAAI,UAAUA,EAAI,KAAK,iBAAiBhB,CAAO,GAAG0B,CAAE;AACrG,iBAAWE,KAAKZ,EAAI,QAAS,EAAE,CAAAU,EAAG,KAAKE,CAAC;AAAA,IAC9C;AACI,IAAAlB,EAAOgB,EAAG,UAAUL,CAAY;AAChC,UAAMQ,IAAmB9B,EAAO,oBAAoBC,GAASY,CAAG,IAAI;AACpE,IAAAF,EAAOgB,EAAG,UAAUG,CAAgB,GAAGF,EAAW,GAAG,KAAK,IAAI,GAAGE,IAAmBH,EAAG,MAAM,GAAGA,CAAE,GAAGC,EAAW,IAAI,IAAID,EAAG,SAAS,KAAK,GAAGA,CAAE,GAAGhB,EAAOgB,EAAG,SAAS,KAAK,CAAC;AAC1K,aAASI,IAAU,KAAKJ,EAAG,SAASG,GAAkBC,KAAW,IAAK,CAAAH,EAAWG,GAAS,GAAGJ,CAAE;AAC/F,UAAMxB,IAAgB,CAAE;AACxB,WAAOA,EAAc,SAAS,IAAIwB,EAAG,SAAU,CAAAxB,EAAc,KAAK,CAAC;AACnE,WAAOwB,EAAG,QAAQ,CAACE,GAAGpB,MAAMN,EAAcM,MAAM,CAAC,KAAKoB,KAAK,KAAKpB,IAAI,EAAE,GAAG,IAAIT,EAAOC,GAASY,GAAKV,GAAeiB,CAAI;AAAA,EACzH;AAAA;AAAA;AAAA;AAAA;AAAA,EAyCE,UAAUY,GAAGC,GAAG;AACd,WAAO,KAAKD,KAAKA,IAAI,KAAK,QAAQ,KAAKC,KAAKA,IAAI,KAAK,QAAQ,KAAK,QAAQA,CAAC,EAAED,CAAC;AAAA,EAClF;AAAA;AAAA,EAEE,aAAa;AACX,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA,EAGE,uBAAuB;AACrB,aAASvB,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,WAAK,kBAAkB,GAAGA,GAAGA,IAAI,KAAK,CAAC,GAAG,KAAK,kBAAkBA,GAAG,GAAGA,IAAI,KAAK,CAAC;AACnF,SAAK,kBAAkB,GAAG,CAAC,GAAG,KAAK,kBAAkB,KAAK,OAAO,GAAG,CAAC,GAAG,KAAK,kBAAkB,GAAG,KAAK,OAAO,CAAC;AAC/G,UAAMyB,IAAc,KAAK,6BAA8B,GAAEC,IAAWD,EAAY;AAChF,aAASzB,IAAI,GAAGA,IAAI0B,GAAU1B;AAC5B,eAAS2B,IAAI,GAAGA,IAAID,GAAUC;AAC5B,QAAA3B,KAAK,KAAK2B,KAAK,KAAK3B,KAAK,KAAK2B,KAAKD,IAAW,KAAK1B,KAAK0B,IAAW,KAAKC,KAAK,KAAK,KAAK,qBAAqBF,EAAYzB,CAAC,GAAGyB,EAAYE,CAAC,CAAC;AAC9I,SAAK,eAAe,CAAC,GAAG,KAAK,YAAa;AAAA,EAC9C;AAAA;AAAA;AAAA,EAGE,eAAehB,GAAM;AACnB,UAAMJ,IAAO,KAAK,qBAAqB,cAAc,IAAII;AACzD,QAAIiB,IAAMrB;AACV,aAASP,IAAI,GAAGA,IAAI,IAAIA,IAAK,CAAA4B,IAAMA,KAAO,KAAKA,MAAQ,KAAK;AAC5D,UAAMC,KAAQtB,KAAQ,KAAKqB,KAAO;AAClC,IAAA1B,EAAO2B,MAAS,MAAM,CAAC;AACvB,aAAS7B,IAAI,GAAGA,KAAK,GAAGA,IAAK,MAAK,kBAAkB,GAAGA,GAAG8B,EAAOD,GAAM7B,CAAC,CAAC;AACzE,SAAK,kBAAkB,GAAG,GAAG8B,EAAOD,GAAM,CAAC,CAAC,GAAG,KAAK,kBAAkB,GAAG,GAAGC,EAAOD,GAAM,CAAC,CAAC,GAAG,KAAK,kBAAkB,GAAG,GAAGC,EAAOD,GAAM,CAAC,CAAC;AAC1I,aAAS7B,IAAI,GAAGA,IAAI,IAAIA,IAAK,MAAK,kBAAkB,KAAKA,GAAG,GAAG8B,EAAOD,GAAM7B,CAAC,CAAC;AAC9E,aAASA,IAAI,GAAGA,IAAI,GAAGA,IAAK,MAAK,kBAAkB,KAAK,OAAO,IAAIA,GAAG,GAAG8B,EAAOD,GAAM7B,CAAC,CAAC;AACxF,aAASA,IAAI,GAAGA,IAAI,IAAIA,IAAK,MAAK,kBAAkB,GAAG,KAAK,OAAO,KAAKA,GAAG8B,EAAOD,GAAM7B,CAAC,CAAC;AAC1F,SAAK,kBAAkB,GAAG,KAAK,OAAO,GAAG,EAAE;AAAA,EAC/C;AAAA;AAAA;AAAA,EAGE,cAAc;AACZ,QAAI,KAAK,UAAU,EAAG;AACtB,QAAI4B,IAAM,KAAK;AACf,aAAS5B,IAAI,GAAGA,IAAI,IAAIA,IAAK,CAAA4B,IAAMA,KAAO,KAAKA,MAAQ,MAAM;AAC7D,UAAMC,IAAO,KAAK,WAAW,KAAKD;AAClC,IAAA1B,EAAO2B,MAAS,MAAM,CAAC;AACvB,aAAS7B,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAC3B,YAAM+B,IAAQD,EAAOD,GAAM7B,CAAC,GAAGgC,IAAI,KAAK,OAAO,KAAKhC,IAAI,GAAGoB,IAAI,KAAK,MAAMpB,IAAI,CAAC;AAC/E,WAAK,kBAAkBgC,GAAGZ,GAAGW,CAAK,GAAG,KAAK,kBAAkBX,GAAGY,GAAGD,CAAK;AAAA,IAC7E;AAAA,EACA;AAAA;AAAA;AAAA,EAGE,kBAAkBR,GAAGC,GAAG;AACtB,aAASS,IAAK,IAAIA,KAAM,GAAGA;AACzB,eAASC,IAAK,IAAIA,KAAM,GAAGA,KAAM;AAC/B,cAAMC,IAAO,KAAK,IAAI,KAAK,IAAID,CAAE,GAAG,KAAK,IAAID,CAAE,CAAC,GAAGG,IAAKb,IAAIW,GAAIG,IAAKb,IAAIS;AACzE,aAAKG,KAAMA,IAAK,KAAK,QAAQ,KAAKC,KAAMA,IAAK,KAAK,QAAQ,KAAK,kBAAkBD,GAAIC,GAAIF,KAAQ,KAAKA,KAAQ,CAAC;AAAA,MACvH;AAAA,EACA;AAAA;AAAA;AAAA,EAGE,qBAAqBZ,GAAGC,GAAG;AACzB,aAASS,IAAK,IAAIA,KAAM,GAAGA;AACzB,eAASC,IAAK,IAAIA,KAAM,GAAGA,IAAM,MAAK,kBAAkBX,IAAIW,GAAIV,IAAIS,GAAI,KAAK,IAAI,KAAK,IAAIC,CAAE,GAAG,KAAK,IAAID,CAAE,CAAC,KAAK,CAAC;AAAA,EACvH;AAAA;AAAA;AAAA,EAGE,kBAAkBV,GAAGC,GAAGc,GAAQ;AAC9B,SAAK,QAAQd,CAAC,EAAED,CAAC,IAAIe,GAAQ,KAAK,WAAWd,CAAC,EAAED,CAAC,IAAI;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA,EAIE,oBAAoBhB,GAAM;AACxB,UAAMgC,IAAM,KAAK,SAASnC,IAAM,KAAK;AACrC,QAAIG,EAAK,UAAUhB,EAAO,oBAAoBgD,GAAKnC,CAAG,EAAG,OAAM,IAAI,WAAW,kBAAkB;AAChG,UAAMoC,IAAYjD,EAAO,4BAA4Ba,EAAI,OAAO,EAAEmC,CAAG,GAAGE,IAAclD,EAAO,wBAAwBa,EAAI,OAAO,EAAEmC,CAAG,GAAGG,IAAe,KAAK,MAAMnD,EAAO,qBAAqBgD,CAAG,IAAI,CAAC,GAAGI,IAAiBH,IAAYE,IAAeF,GAAWI,IAAgB,KAAK,MAAMF,IAAeF,CAAS,GAAGK,IAAS,CAAA,GAAIC,IAAQvD,EAAO,0BAA0BkD,CAAW;AACvX,aAASzC,IAAI,GAAG+C,IAAI,GAAG/C,IAAIwC,GAAWxC,KAAK;AACzC,YAAMgD,IAAMzC,EAAK,MAAMwC,GAAGA,IAAIH,IAAgBH,KAAezC,IAAI2C,IAAiB,IAAI,EAAE;AACxF,MAAAI,KAAKC,EAAI;AACT,YAAMC,IAAM1D,EAAO,4BAA4ByD,GAAKF,CAAK;AACzD,MAAA9C,IAAI2C,KAAkBK,EAAI,KAAK,CAAC,GAAGH,EAAO,KAAKG,EAAI,OAAOC,CAAG,CAAC;AAAA,IACpE;AACI,UAAMC,IAAS,CAAE;AACjB,aAASlD,IAAI,GAAGA,IAAI6C,EAAO,CAAC,EAAE,QAAQ7C;AACpC,MAAA6C,EAAO,QAAQ,CAACM,GAAOxB,MAAM;AAC3B,SAAC3B,KAAK4C,IAAgBH,KAAed,KAAKgB,MAAmBO,EAAO,KAAKC,EAAMnD,CAAC,CAAC;AAAA,MACzF,CAAO;AACH,WAAOE,EAAOgD,EAAO,UAAUR,CAAY,GAAGQ;AAAA,EAClD;AAAA;AAAA;AAAA,EAGE,cAAc3C,GAAM;AAClB,QAAIA,EAAK,UAAU,KAAK,MAAMhB,EAAO,qBAAqB,KAAK,OAAO,IAAI,CAAC,EAAG,OAAM,IAAI,WAAW,kBAAkB;AACrH,QAAIS,IAAI;AACR,aAASoD,IAAQ,KAAK,OAAO,GAAGA,KAAS,GAAGA,KAAS,GAAG;AACtD,MAAAA,KAAS,MAAMA,IAAQ;AACvB,eAASC,IAAO,GAAGA,IAAO,KAAK,MAAMA;AACnC,iBAAS1B,IAAI,GAAGA,IAAI,GAAGA,KAAK;AAC1B,gBAAMJ,IAAI6B,IAAQzB,GAAGH,IAAI4B,IAAQ,IAAI,IAAIC,IAAO,KAAK,OAAO,IAAIA;AAChE,WAAC,KAAK,WAAW7B,CAAC,EAAED,CAAC,KAAKvB,IAAIO,EAAK,SAAS,MAAM,KAAK,QAAQiB,CAAC,EAAED,CAAC,IAAIO,EAAOvB,EAAKP,MAAM,CAAC,GAAG,KAAKA,IAAI,EAAE,GAAGA;AAAA,QACrH;AAAA,IACA;AACI,IAAAE,EAAOF,KAAKO,EAAK,SAAS,CAAC;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAME,UAAUI,GAAM;AACd,QAAIA,IAAO,KAAKA,IAAO,EAAG,OAAM,IAAI,WAAW,yBAAyB;AACxE,aAASa,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,eAASD,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,YAAI+B;AACJ,gBAAQ3C,GAAI;AAAA,UACV,KAAK;AACH,YAAA2C,KAAU/B,IAAIC,KAAK,KAAK;AACxB;AAAA,UACF,KAAK;AACH,YAAA8B,IAAS9B,IAAI,KAAK;AAClB;AAAA,UACF,KAAK;AACH,YAAA8B,IAAS/B,IAAI,KAAK;AAClB;AAAA,UACF,KAAK;AACH,YAAA+B,KAAU/B,IAAIC,KAAK,KAAK;AACxB;AAAA,UACF,KAAK;AACH,YAAA8B,KAAU,KAAK,MAAM/B,IAAI,CAAC,IAAI,KAAK,MAAMC,IAAI,CAAC,KAAK,KAAK;AACxD;AAAA,UACF,KAAK;AACH,YAAA8B,IAAS/B,IAAIC,IAAI,IAAID,IAAIC,IAAI,KAAK;AAClC;AAAA,UACF,KAAK;AACH,YAAA8B,KAAU/B,IAAIC,IAAI,IAAID,IAAIC,IAAI,KAAK,KAAK;AACxC;AAAA,UACF,KAAK;AACH,YAAA8B,MAAW/B,IAAIC,KAAK,IAAID,IAAIC,IAAI,KAAK,KAAK;AAC1C;AAAA,UACF;AACE,kBAAM,IAAI,MAAM,aAAa;AAAA,QACzC;AACQ,SAAC,KAAK,WAAWA,CAAC,EAAED,CAAC,KAAK+B,MAAW,KAAK,QAAQ9B,CAAC,EAAED,CAAC,IAAI,CAAC,KAAK,QAAQC,CAAC,EAAED,CAAC;AAAA,MACpF;AAAA,EACA;AAAA;AAAA;AAAA,EAGE,kBAAkB;AAChB,QAAI2B,IAAS;AACb,aAAS1B,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,UAAI+B,IAAW,IAAIC,IAAO;AAC1B,YAAMC,IAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACvC,eAASlC,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,aAAK,QAAQC,CAAC,EAAED,CAAC,KAAKgC,KAAYC,KAAQA,KAAQ,IAAIN,KAAU3D,EAAO,aAAaiE,IAAO,KAAKN,QAAa,KAAK,wBAAwBM,GAAMC,CAAU,GAAGF,MAAaL,KAAU,KAAK,2BAA2BO,CAAU,IAAIlE,EAAO,aAAagE,IAAW,KAAK,QAAQ/B,CAAC,EAAED,CAAC,GAAGiC,IAAO;AAC9R,MAAAN,KAAU,KAAK,+BAA+BK,GAAUC,GAAMC,CAAU,IAAIlE,EAAO;AAAA,IACzF;AACI,aAASgC,IAAI,GAAGA,IAAI,KAAK,MAAMA,KAAK;AAClC,UAAIgC,IAAW,IAAIG,IAAO;AAC1B,YAAMD,IAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACvC,eAASjC,IAAI,GAAGA,IAAI,KAAK,MAAMA;AAC7B,aAAK,QAAQA,CAAC,EAAED,CAAC,KAAKgC,KAAYG,KAAQA,KAAQ,IAAIR,KAAU3D,EAAO,aAAamE,IAAO,KAAKR,QAAa,KAAK,wBAAwBQ,GAAMD,CAAU,GAAGF,MAAaL,KAAU,KAAK,2BAA2BO,CAAU,IAAIlE,EAAO,aAAagE,IAAW,KAAK,QAAQ/B,CAAC,EAAED,CAAC,GAAGmC,IAAO;AAC9R,MAAAR,KAAU,KAAK,+BAA+BK,GAAUG,GAAMD,CAAU,IAAIlE,EAAO;AAAA,IACzF;AACI,aAASiC,IAAI,GAAGA,IAAI,KAAK,OAAO,GAAGA;AACjC,eAASD,IAAI,GAAGA,IAAI,KAAK,OAAO,GAAGA,KAAK;AACtC,cAAMQ,IAAQ,KAAK,QAAQP,CAAC,EAAED,CAAC;AAC/B,QAAAQ,KAAS,KAAK,QAAQP,CAAC,EAAED,IAAI,CAAC,KAAKQ,KAAS,KAAK,QAAQP,IAAI,CAAC,EAAED,CAAC,KAAKQ,KAAS,KAAK,QAAQP,IAAI,CAAC,EAAED,IAAI,CAAC,MAAM2B,KAAU3D,EAAO;AAAA,MACvI;AACI,QAAIoE,IAAO;AACX,eAAW9D,KAAO,KAAK,QAAS,CAAA8D,IAAO9D,EAAI,OAAO,CAAC+D,GAAK7B,MAAU6B,KAAO7B,IAAQ,IAAI,IAAI4B,CAAI;AAC7F,UAAME,IAAQ,KAAK,OAAO,KAAK,MAAMd,IAAI,KAAK,KAAK,KAAK,IAAIY,IAAO,KAAKE,IAAQ,EAAE,IAAIA,CAAK,IAAI;AAC/F,WAAO3D,EAAO,KAAK6C,KAAKA,KAAK,CAAC,GAAGG,KAAUH,IAAIxD,EAAO,YAAYW,EAAO,KAAKgD,KAAUA,KAAU,OAAO,GAAGA;AAAA,EAChH;AAAA;AAAA;AAAA;AAAA;AAAA,EAKE,+BAA+B;AAC7B,QAAI,KAAK,WAAW,EAAG,QAAO,CAAE;AAChC;AACE,YAAMxB,IAAW,KAAK,MAAM,KAAK,UAAU,CAAC,IAAI,GAAGoC,IAAO,KAAK,WAAW,KAAK,KAAK,KAAK,MAAM,KAAK,UAAU,IAAI,MAAMpC,IAAW,IAAI,EAAE,IAAI,GAAGwB,IAAS,CAAC,CAAC;AAC3J,eAASa,IAAM,KAAK,OAAO,GAAGb,EAAO,SAASxB,GAAUqC,KAAOD,EAAM,CAAAZ,EAAO,OAAO,GAAG,GAAGa,CAAG;AAC5F,aAAOb;AAAA,IACb;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAIE,OAAO,qBAAqBX,GAAK;AAC/B,QAAIA,IAAMhD,EAAO,eAAegD,IAAMhD,EAAO,YAAa,OAAM,IAAI,WAAW,6BAA6B;AAC5G,QAAI2D,KAAU,KAAKX,IAAM,OAAOA,IAAM;AACtC,QAAIA,KAAO,GAAG;AACZ,YAAMb,IAAW,KAAK,MAAMa,IAAM,CAAC,IAAI;AACvC,MAAAW,MAAW,KAAKxB,IAAW,MAAMA,IAAW,IAAIa,KAAO,MAAMW,KAAU;AAAA,IAC7E;AACI,WAAOhD,EAAO,OAAOgD,KAAUA,KAAU,KAAK,GAAGA;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA,EAIE,OAAO,oBAAoBX,GAAKnC,GAAK;AACnC,WAAO,KAAK,MAAMb,EAAO,qBAAqBgD,CAAG,IAAI,CAAC,IAAIhD,EAAO,wBAAwBa,EAAI,OAAO,EAAEmC,CAAG,IAAIhD,EAAO,4BAA4Ba,EAAI,OAAO,EAAEmC,CAAG;AAAA,EACpK;AAAA;AAAA;AAAA,EAGE,OAAO,0BAA0ByB,GAAQ;AACvC,QAAIA,IAAS,KAAKA,IAAS,IAAK,OAAM,IAAI,WAAW,qBAAqB;AAC1E,UAAMd,IAAS,CAAE;AACjB,aAASlD,IAAI,GAAGA,IAAIgE,IAAS,GAAGhE,IAAK,CAAAkD,EAAO,KAAK,CAAC;AAClD,IAAAA,EAAO,KAAK,CAAC;AACb,QAAIe,IAAO;AACX,aAASjE,IAAI,GAAGA,IAAIgE,GAAQhE,KAAK;AAC/B,eAAS2B,IAAI,GAAGA,IAAIuB,EAAO,QAAQvB;AACjC,QAAAuB,EAAOvB,CAAC,IAAIpC,EAAO,oBAAoB2D,EAAOvB,CAAC,GAAGsC,CAAI,GAAGtC,IAAI,IAAIuB,EAAO,WAAWA,EAAOvB,CAAC,KAAKuB,EAAOvB,IAAI,CAAC;AAC9G,MAAAsC,IAAO1E,EAAO,oBAAoB0E,GAAM,CAAC;AAAA,IAC/C;AACI,WAAOf;AAAA,EACX;AAAA;AAAA,EAEE,OAAO,4BAA4B3C,GAAM2D,GAAS;AAChD,UAAMhB,IAASgB,EAAQ,IAAI,CAACC,MAAM,CAAC;AACnC,eAAW/C,KAAKb,GAAM;AACpB,YAAM6D,IAAShD,IAAI8B,EAAO,MAAO;AACjC,MAAAA,EAAO,KAAK,CAAC,GAAGgB,EAAQ,QAAQ,CAACG,GAAM,MAAMnB,EAAO,CAAC,KAAK3D,EAAO,oBAAoB8E,GAAMD,CAAM,CAAC;AAAA,IACxG;AACI,WAAOlB;AAAA,EACX;AAAA;AAAA;AAAA,EAGE,OAAO,oBAAoB3B,GAAGC,GAAG;AAC/B,QAAID,MAAM,KAAKC,MAAM,EAAG,OAAM,IAAI,WAAW,mBAAmB;AAChE,QAAI8C,IAAI;AACR,aAAStE,IAAI,GAAGA,KAAK,GAAGA;AACtB,MAAAsE,IAAIA,KAAK,KAAKA,MAAM,KAAK,KAAKA,MAAM9C,MAAMxB,IAAI,KAAKuB;AACrD,WAAOrB,EAAOoE,MAAM,KAAK,CAAC,GAAGA;AAAA,EACjC;AAAA;AAAA;AAAA,EAGE,2BAA2Bb,GAAY;AACrC,UAAMc,IAAId,EAAW,CAAC;AACtB,IAAAvD,EAAOqE,KAAK,KAAK,OAAO,CAAC;AACzB,UAAMC,IAAOD,IAAI,KAAKd,EAAW,CAAC,KAAKc,KAAKd,EAAW,CAAC,KAAKc,IAAI,KAAKd,EAAW,CAAC,KAAKc,KAAKd,EAAW,CAAC,KAAKc;AAC7G,YAAQC,KAAQf,EAAW,CAAC,KAAKc,IAAI,KAAKd,EAAW,CAAC,KAAKc,IAAI,IAAI,MAAMC,KAAQf,EAAW,CAAC,KAAKc,IAAI,KAAKd,EAAW,CAAC,KAAKc,IAAI,IAAI;AAAA,EACxI;AAAA;AAAA,EAEE,+BAA+BE,GAAiBC,GAAkBjB,GAAY;AAC5E,WAAOgB,MAAoB,KAAK,wBAAwBC,GAAkBjB,CAAU,GAAGiB,IAAmB,IAAIA,KAAoB,KAAK,MAAM,KAAK,wBAAwBA,GAAkBjB,CAAU,GAAG,KAAK,2BAA2BA,CAAU;AAAA,EACvP;AAAA;AAAA,EAEE,wBAAwBiB,GAAkBjB,GAAY;AACpD,IAAAA,EAAW,CAAC,KAAK,MAAMiB,KAAoB,KAAK,OAAOjB,EAAW,IAAK,GAAEA,EAAW,QAAQiB,CAAgB;AAAA,EAChH;AAmCA;AAAA;AAAA;AAhCE9E,EA5VIL,GA4VG,eAAc;AAErBK,EA9VIL,GA8VG,eAAc;AAErBK,EAhWIL,GAgWG,cAAa,IACpBK,EAjWIL,GAiWG,cAAa,IACpBK,EAlWIL,GAkWG,cAAa,KACpBK,EAnWIL,GAmWG,cAAa,KACpBK,EApWIL,GAoWG,2BAA0B;AAAA;AAAA;AAAA,EAG/B,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAElK,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAEnK,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAEnK,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAEpK,IACDK,EAhXIL,GAgXG,+BAA8B;AAAA;AAAA;AAAA,EAGnC,CAAC,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,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAE5I,CAAC,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,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAErJ,CAAC,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,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EAExJ,CAAC,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,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA;AAE1J;AA3XH,IAAMoF,IAANpF;AA6XA,SAAS4B,EAAWyD,GAAKC,GAAK3D,GAAI;AAChC,MAAI2D,IAAM,KAAKA,IAAM,MAAMD,MAAQC,EAAK,OAAM,IAAI,WAAW,oBAAoB;AACjF,WAAS7E,IAAI6E,IAAM,GAAG7E,KAAK,GAAGA,IAAK,CAAAkB,EAAG,KAAK0D,MAAQ5E,IAAI,CAAC;AAC1D;AACA,SAAS8B,EAAOP,GAAGvB,GAAG;AACpB,UAAQuB,MAAMvB,IAAI,MAAM;AAC1B;AACA,SAASE,EAAO4E,GAAM;AACpB,MAAI,CAACA,EAAM,OAAM,IAAI,MAAM,iBAAiB;AAC9C;AACA,MAAMC,IAAN,MAAMA,EAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKd,OAAO,UAAUxE,GAAM;AACrB,UAAMW,IAAK,CAAE;AACb,eAAWE,KAAKb,EAAM,CAAAY,EAAWC,GAAG,GAAGF,CAAE;AACzC,WAAO,IAAI6D,EAAUC,EAAK,MAAMzE,EAAK,QAAQW,CAAE;AAAA,EACnD;AAAA;AAAA,EAEE,OAAO,YAAY+D,GAAQ;AACzB,QAAI,CAACF,EAAU,UAAUE,CAAM,EAAG,OAAM,IAAI,WAAW,wCAAwC;AAC/F,UAAM/D,IAAK,CAAE;AACb,aAASlB,IAAI,GAAGA,IAAIiF,EAAO,UAAU;AACnC,YAAM,IAAI,KAAK,IAAIA,EAAO,SAASjF,GAAG,CAAC;AACvC,MAAAmB,EAAW,SAAS8D,EAAO,UAAUjF,GAAGA,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,GAAGkB,CAAE,GAAGlB,KAAK;AAAA,IAChF;AACI,WAAO,IAAI+E,EAAUC,EAAK,SAASC,EAAO,QAAQ/D,CAAE;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA,EAIE,OAAO,iBAAiBf,GAAM;AAC5B,QAAI,CAAC4E,EAAU,eAAe5E,CAAI,EAAG,OAAM,IAAI,WAAW,6DAA6D;AACvH,UAAMe,IAAK,CAAE;AACb,QAAIlB;AACJ,SAAKA,IAAI,GAAGA,IAAI,KAAKG,EAAK,QAAQH,KAAK,GAAG;AACxC,UAAIkF,IAAOH,EAAU,qBAAqB,QAAQ5E,EAAK,OAAOH,CAAC,CAAC,IAAI;AACpE,MAAAkF,KAAQH,EAAU,qBAAqB,QAAQ5E,EAAK,OAAOH,IAAI,CAAC,CAAC,GAAGmB,EAAW+D,GAAM,IAAIhE,CAAE;AAAA,IACjG;AACI,WAAOlB,IAAIG,EAAK,UAAUgB,EAAW4D,EAAU,qBAAqB,QAAQ5E,EAAK,OAAOH,CAAC,CAAC,GAAG,GAAGkB,CAAE,GAAG,IAAI6D,EAAUC,EAAK,cAAc7E,EAAK,QAAQe,CAAE;AAAA,EACzJ;AAAA;AAAA;AAAA,EAGE,OAAO,aAAaf,GAAM;AACxB,WAAOA,KAAQ,KAAK,CAAE,IAAG4E,EAAU,UAAU5E,CAAI,IAAI,CAAC4E,EAAU,YAAY5E,CAAI,CAAC,IAAI4E,EAAU,eAAe5E,CAAI,IAAI,CAAC4E,EAAU,iBAAiB5E,CAAI,CAAC,IAAI,CAAC4E,EAAU,UAAUA,EAAU,gBAAgB5E,CAAI,CAAC,CAAC;AAAA,EACpN;AAAA;AAAA;AAAA,EAGE,OAAO,QAAQgF,GAAW;AACxB,UAAMjE,IAAK,CAAE;AACb,QAAIiE,IAAY,EAAG,OAAM,IAAI,WAAW,mCAAmC;AAC3E,QAAIA,IAAY,IAAK,CAAAhE,EAAWgE,GAAW,GAAGjE,CAAE;AAAA,aACvCiE,IAAY;AACnB,MAAAhE,EAAW,GAAG,GAAGD,CAAE,GAAGC,EAAWgE,GAAW,IAAIjE,CAAE;AAAA,aAC3CiE,IAAY;AACnB,MAAAhE,EAAW,GAAG,GAAGD,CAAE,GAAGC,EAAWgE,GAAW,IAAIjE,CAAE;AAAA,QAC/C,OAAM,IAAI,WAAW,mCAAmC;AAC7D,WAAO,IAAI6D,EAAUC,EAAK,KAAK,GAAG9D,CAAE;AAAA,EACxC;AAAA;AAAA;AAAA,EAGE,OAAO,UAAUf,GAAM;AACrB,WAAO4E,EAAU,cAAc,KAAK5E,CAAI;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAIE,OAAO,eAAeA,GAAM;AAC1B,WAAO4E,EAAU,mBAAmB,KAAK5E,CAAI;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKE,YAAYiF,GAAMC,GAAUC,GAAS;AACnC,QAAI,KAAK,OAAOF,GAAM,KAAK,WAAWC,GAAU,KAAK,UAAUC,GAASD,IAAW,EAAG,OAAM,IAAI,WAAW,kBAAkB;AAC7H,SAAK,UAAUC,EAAQ,MAAO;AAAA,EAClC;AAAA;AAAA;AAAA,EAGE,UAAU;AACR,WAAO,KAAK,QAAQ,MAAO;AAAA,EAC/B;AAAA;AAAA;AAAA,EAGE,OAAO,aAAajF,GAAMb,GAAS;AACjC,QAAI0D,IAAS;AACb,eAAW1C,KAAOH,GAAM;AACtB,YAAMkF,IAAS/E,EAAI,KAAK,iBAAiBhB,CAAO;AAChD,UAAIgB,EAAI,YAAY,KAAK+E,EAAQ,QAAO;AACxC,MAAArC,KAAU,IAAIqC,IAAS/E,EAAI,QAAQ;AAAA,IACzC;AACI,WAAO0C;AAAA,EACX;AAAA;AAAA,EAEE,OAAO,gBAAgBsC,GAAK;AAC1B,IAAAA,IAAM,UAAUA,CAAG;AACnB,UAAMtC,IAAS,CAAE;AACjB,aAASlD,IAAI,GAAGA,IAAIwF,EAAI,QAAQxF;AAC9B,MAAAwF,EAAI,OAAOxF,CAAC,KAAK,MAAMkD,EAAO,KAAKsC,EAAI,WAAWxF,CAAC,CAAC,KAAKkD,EAAO,KAAK,SAASsC,EAAI,UAAUxF,IAAI,GAAGA,IAAI,CAAC,GAAG,EAAE,CAAC,GAAGA,KAAK;AACxH,WAAOkD;AAAA,EACX;AASA;AAAA;AAAA;AANEtD,EAhGImF,GAgGG,iBAAgB;AAEvBnF,EAlGImF,GAkGG,sBAAqB;AAAA;AAG5BnF,EArGImF,GAqGG,wBAAuB;AArGhC,IAAMzE,IAANyE;AAuGA,MAAMU,IAAN,MAAMA,EAAI;AAAA;AAAA;AAAA,EAWR,YAAYC,GAASC,GAAY;AAC/B,SAAK,UAAUD,GAAS,KAAK,aAAaC;AAAA,EAC9C;AACA;AAAA;AAZE/F,EAFI6F,GAEG,OAAM,IAAIA,EAAI,GAAG,CAAC;AAEzB7F,EAJI6F,GAIG,UAAS,IAAIA,EAAI,GAAG,CAAC;AAE5B7F,EANI6F,GAMG,YAAW,IAAIA,EAAI,GAAG,CAAC;AAE9B7F,EARI6F,GAQG,QAAO,IAAIA,EAAI,GAAG,CAAC;AAR5B,IAAMxE,IAANwE;AAeA,MAAMG,IAAN,MAAMA,EAAK;AAAA;AAAA,EAQT,YAAYC,GAAUC,GAAkB;AACtC,SAAK,WAAWD,GAAU,KAAK,mBAAmBC;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAIE,iBAAiBvD,GAAK;AACpB,WAAO,KAAK,iBAAiB,KAAK,OAAOA,IAAM,KAAK,EAAE,CAAC;AAAA,EAC3D;AACA;AAAA;AAfE3C,EAFIgG,GAEG,WAAU,IAAIA,EAAK,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,IACzChG,EAHIgG,GAGG,gBAAe,IAAIA,EAAK,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IAC7ChG,EAJIgG,GAIG,QAAO,IAAIA,EAAK,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IACrChG,EALIgG,GAKG,SAAQ,IAAIA,EAAK,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IACtChG,EANIgG,GAMG,OAAM,IAAIA,EAAK,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AANpC,IAAMZ,IAANY;AAkBA,MAAMG,IAAkB;AAAA,EACtB,GAAG9E,EAAI;AAAA,EACP,GAAGA,EAAI;AAAA,EACP,GAAGA,EAAI;AAAA,EACP,GAAGA,EAAI;AACT,GAAG+E,IAAe,KAAKC,IAAgB,KAAKC,IAAkB,WAAWC,IAAwB,IAAIC,IAAqB,GAAGC,IAAmB,GAAGC,IAAsB;AACzK,SAASC,EAAaC,GAASC,IAAS,GAAG;AACzC,QAAMC,IAAM,CAAE;AACd,SAAOF,EAAQ,QAAQ,SAAS3G,GAAK2B,GAAG;AACtC,QAAImF,IAAQ;AACZ,IAAA9G,EAAI,QAAQ,SAAS+G,GAAMrF,GAAG;AAC5B,UAAI,CAACqF,KAAQD,MAAU,MAAM;AAC3B,QAAAD,EAAI,KAAK,IAAIC,IAAQF,CAAM,IAAIjF,IAAIiF,CAAM,IAAIlF,IAAIoF,CAAK,MAAMA,IAAQF,CAAM,GAAG,GAAGE,IAAQ;AACxF;AAAA,MACR;AACM,UAAIpF,MAAM1B,EAAI,SAAS,GAAG;AACxB,YAAI,CAAC+G;AACH;AACF,QAAAD,MAAU,OAAOD,EAAI,KAAK,IAAInF,IAAIkF,CAAM,IAAIjF,IAAIiF,CAAM,SAASlF,IAAIkF,CAAM,GAAG,IAAIC,EAAI,KAAK,IAAIC,IAAQF,CAAM,IAAIjF,IAAIiF,CAAM,KAAKlF,IAAI,IAAIoF,CAAK,MAAMA,IAAQF,CAAM,GAAG;AAClK;AAAA,MACR;AACM,MAAAG,KAAQD,MAAU,SAASA,IAAQpF;AAAA,IACzC,CAAK;AAAA,EACL,CAAG,GAAGmF,EAAI,KAAK,EAAE;AACjB;AACA,SAASG,EAAgBL,GAASM,GAAY;AAC5C,SAAON,EAAQ,MAAO,EAAC,IAAI,CAAC3G,GAAK2B,MAAMA,IAAIsF,EAAW,KAAKtF,KAAKsF,EAAW,IAAIA,EAAW,IAAIjH,IAAMA,EAAI,IAAI,CAAC+G,GAAMrF,MAAMA,IAAIuF,EAAW,KAAKvF,KAAKuF,EAAW,IAAIA,EAAW,IAAIF,IAAO,EAAE,CAAC;AAC5L;AACA,SAASG,EAAiBC,GAAOC,GAAMR,GAAQS,GAAU;AACvD,MAAI,CAACA;AACH,WAAO;AACT,QAAMC,KAASH,EAAM,SAASP,IAAS,KAAKQ,GAAMG,IAAIF,IAAWC,GAAOE,IAAIH,IAAWC,GAAO5F,IAAIyF,EAAM,SAAS,IAAII,IAAI,GAAG5F,IAAIwF,EAAM,SAAS,IAAIK,IAAI,GAAGC,IAAS,KAAK,MAAM/F,CAAC,GAAGgG,IAAS,KAAK,MAAM/F,CAAC,GAAGgG,IAAQ,KAAK,KAAKJ,IAAI7F,IAAI+F,CAAM,GAAGG,IAAQ,KAAK,KAAKJ,IAAI7F,IAAI+F,CAAM;AAC7Q,SAAO;AAAA,IACL,GAAAhG;AAAA,IACA,GAAAC;AAAA,IACA,GAAA6F;AAAA,IACA,GAAAD;AAAA,IACA,YAAY;AAAA,MACV,GAAGE;AAAA,MACH,GAAGC;AAAA,MACH,GAAGC;AAAA,MACH,GAAGC;AAAA,IACT;AAAA,EACG;AACH;AACA,SAASC,EAAcC,GAAeC,GAAY;AAChD,SAAOA,KAAc,OAAO,KAAK,IAAI,KAAK,MAAMA,CAAU,GAAG,CAAC,IAAID,IAAgBtB,IAAmBC;AACvG;AACA,SAASuB,EAAU;AAAA,EACjB,OAAAC;AAAA,EACA,OAAAC;AAAA,EACA,YAAAtH;AAAA,EACA,eAAAkH;AAAA,EACA,YAAAC;AAAA,EACA,UAAAV;AAAA,EACA,MAAAD;AACF,GAAG;AACD,QAAMe,IAASC,EAAQ,MAAM;AAC3B,UAAMC,IAAW5H,EAAU,aAAawH,CAAK;AAC7C,WAAOnD,EAAO,eAAeuD,GAAUnC,EAAgBgC,CAAK,GAAGtH,CAAU;AAAA,EAC1E,GAAE,CAACqH,GAAOC,GAAOtH,CAAU,CAAC,GAAG;AAAA,IAC9B,OAAO0H;AAAA,IACP,QAAQC;AAAA,IACR,UAAUC;AAAA,IACV,yBAAyBC;AAAA,EAC1B,IAAGL,EAAQ,MAAM;AAChB,UAAMjB,IAAQgB,EAAO,WAAY,GAAEvB,IAASiB,EAAcC,GAAeC,CAAU,GAAGW,IAAWvB,EAAM,SAASP,IAAS,GAAG+B,IAA0BzB,EAAiBC,GAAOC,GAAMR,GAAQS,CAAQ;AACpM,WAAO;AAAA,MACL,OAAAF;AAAA,MACA,QAAAP;AAAA,MACA,UAAA8B;AAAA,MACA,yBAAAC;AAAA,IACD;AAAA,EACL,GAAK,CAACR,GAAQf,GAAMC,GAAUS,GAAeC,CAAU,CAAC;AACtD,SAAO;AAAA,IACL,QAAAI;AAAA,IACA,QAAQI;AAAA,IACR,OAAOD;AAAA,IACP,UAAUE;AAAA,IACV,yBAAyBC;AAAA,EAC1B;AACH;AACA,SAASG,EAAmBC,GAAO;AACjC,QAAM;AAAA,IACJ,OAAAZ;AAAA,IACA,MAAAb,IAAOjB;AAAA,IACP,OAAA+B,IAAQ9B;AAAA,IACR,OAAAlE,IAAQmE;AAAA,IACR,YAAAzF,IAAa2F;AAAA,IACb,OAAAuC;AAAA,IACA,UAAAzB;AAAA,EACJ,IAAMwB,GAAOd,IAAa,QAAQ;AAAA,IAC9B,QAAAnB;AAAA,IACA,OAAAO;AAAA,IACA,UAAAuB;AAAA,IACA,yBAAAC;AAAA,EACD,IAAGX,EAAU;AAAA,IACZ,OAAAC;AAAA,IACA,OAAAC;AAAA,IACA,YAAAtH;AAAA,IACA,eAAe0F;AAAA,IACf,YAAAyB;AAAA,IACA,UAAAV;AAAA,IACA,MAAAD;AAAA,EACJ,CAAG,GAAG2B,IAAcX,EAAQ,MAAMf,MAAYsB,KAAA,QAAAA,EAAyB,cAAa3B,EAAgBG,GAAOwB,EAAwB,UAAU,IAAIxB,GAAO,CAACwB,KAAA,gBAAAA,EAAyB,YAAYxB,GAAOE,CAAQ,CAAC,GAAG2B,IAAStC,EAAaqC,GAAanC,CAAM;AACxP,SAAuB,gBAAAqC,EAAK,OAAO,EAAE,QAAQ7B,GAAM,OAAOA,GAAM,SAAS,OAAOsB,CAAQ,IAAIA,CAAQ,IAAI,MAAM,OAAO,UAAU;AAAA,IAC7H,CAAC,CAACI,KAAyB,gBAAAI,EAAI,SAAS,EAAE,UAAUJ,GAAO;AAAA,IAC3C,gBAAAI,EAAIC,EAAO,MAAM,EAAE,MAAMjH,GAAO,GAAG8G,GAAQ,gBAAgB,cAAc,SAAS;AAAA,MAChG,SAAS;AAAA,IACV,GAAE,SAAS;AAAA,MACV,SAAS;AAAA,IACV,GAAE,MAAM;AAAA,MACP,SAAS;AAAA,IACf,EAAO,CAAA;AAAA,EACP,GAAK;AACL;AACK,MAACI,IAAYC,EAAKT,CAAkB;AACzCQ,EAAU,cAAc;","x_google_ignoreList":[0]}

package/dist/SourceContext-T8zcpOpp.mjs

@@ -1,33 +0,0 @@
-import { _ as i } from "./Observable-wwWYwtkh.mjs";
-import { S as u } from "./Subject-DP0DoUP_.mjs";
-import { createContext as s } from "sanity/_createContext";
-var p = function(o) {
-  i(r, o);
-  function r(t) {
-    var e = o.call(this) || this;
-    return e._value = t, e;
-  }
-  return Object.defineProperty(r.prototype, "value", {
-    get: function() {
-      return this.getValue();
-    },
-    enumerable: !1,
-    configurable: !0
-  }), r.prototype._subscribe = function(t) {
-    var e = o.prototype._subscribe.call(this, t);
-    return !e.closed && t.next(this._value), e;
-  }, r.prototype.getValue = function() {
-    var t = this, e = t.hasError, n = t.thrownError, a = t._value;
-    if (e)
-      throw n;
-    return this._throwIfClosed(), a;
-  }, r.prototype.next = function(t) {
-    o.prototype.next.call(this, this._value = t);
-  }, r;
-}(u);
-const f = s("sanity/_singletons/context/source", null);
-export {
-  p as B,
-  f as S
-};
-//# sourceMappingURL=SourceContext-T8zcpOpp.mjs.map

package/dist/SourceContext-T8zcpOpp.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"SourceContext-T8zcpOpp.mjs","sources":["../../../node_modules/.pnpm/rxjs@7.8.1/node_modules/rxjs/dist/esm5/internal/BehaviorSubject.js","../src/_singletons/context/SourceContext.ts"],"sourcesContent":["import { __extends } from \"tslib\";\nimport { Subject } from './Subject';\nvar BehaviorSubject = (function (_super) {\n    __extends(BehaviorSubject, _super);\n    function BehaviorSubject(_value) {\n        var _this = _super.call(this) || this;\n        _this._value = _value;\n        return _this;\n    }\n    Object.defineProperty(BehaviorSubject.prototype, \"value\", {\n        get: function () {\n            return this.getValue();\n        },\n        enumerable: false,\n        configurable: true\n    });\n    BehaviorSubject.prototype._subscribe = function (subscriber) {\n        var subscription = _super.prototype._subscribe.call(this, subscriber);\n        !subscription.closed && subscriber.next(this._value);\n        return subscription;\n    };\n    BehaviorSubject.prototype.getValue = function () {\n        var _a = this, hasError = _a.hasError, thrownError = _a.thrownError, _value = _a._value;\n        if (hasError) {\n            throw thrownError;\n        }\n        this._throwIfClosed();\n        return _value;\n    };\n    BehaviorSubject.prototype.next = function (value) {\n        _super.prototype.next.call(this, (this._value = value));\n    };\n    return BehaviorSubject;\n}(Subject));\nexport { BehaviorSubject };\n//# sourceMappingURL=BehaviorSubject.js.map","import {createContext} from 'sanity/_createContext'\n\nimport type {Source} from '../../core/config/types'\n\n/**\n * @internal\n */\nexport const SourceContext = createContext<Source | null>('sanity/_singletons/context/source', null)\n"],"names":["BehaviorSubject","_super","__extends","_value","_this","subscriber","subscription","_a","hasError","thrownError","value","Subject","SourceContext","createContext"],"mappings":";;;AAEG,IAACA,IAAmB,SAAUC,GAAQ;AACrC,EAAAC,EAAUF,GAAiBC,CAAM;AACjC,WAASD,EAAgBG,GAAQ;AAC7B,QAAIC,IAAQH,EAAO,KAAK,IAAI,KAAK;AACjC,WAAAG,EAAM,SAASD,GACRC;AAAA,EACf;AACI,gBAAO,eAAeJ,EAAgB,WAAW,SAAS;AAAA,IACtD,KAAK,WAAY;AACb,aAAO,KAAK,SAAU;AAAA,IACzB;AAAA,IACD,YAAY;AAAA,IACZ,cAAc;AAAA,EACtB,CAAK,GACDA,EAAgB,UAAU,aAAa,SAAUK,GAAY;AACzD,QAAIC,IAAeL,EAAO,UAAU,WAAW,KAAK,MAAMI,CAAU;AACpE,YAACC,EAAa,UAAUD,EAAW,KAAK,KAAK,MAAM,GAC5CC;AAAA,EACV,GACDN,EAAgB,UAAU,WAAW,WAAY;AAC7C,QAAIO,IAAK,MAAMC,IAAWD,EAAG,UAAUE,IAAcF,EAAG,aAAaJ,IAASI,EAAG;AACjF,QAAIC;AACA,YAAMC;AAEV,gBAAK,eAAgB,GACdN;AAAA,EACV,GACDH,EAAgB,UAAU,OAAO,SAAUU,GAAO;AAC9C,IAAAT,EAAO,UAAU,KAAK,KAAK,MAAO,KAAK,SAASS,CAAO;AAAA,EAC1D,GACMV;AACX,EAAEW,CAAO;AC1BIC,MAAAA,IAAgBC,EAA6B,qCAAqC,IAAI;","x_google_ignoreList":[0]}