@vkontakte/vk-qr 2.0.13 → 3.0.0

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../src/svg.ts","../src/qr.ts","../src/index.ts"],"sourcesContent":["import type { QrCode } from './qr.ts';\nimport type { RequiredQrOptions } from './types.ts';\n\nconst MULTI = 1;\nconst QR_BORDER = 7;\nconst TILE_SIZE = 96 * MULTI;\nexport const INC_TILE_SIZE = 96 * MULTI;\nconst SMALL_QR_SIZE = 25;\n\n/**\n * Returns the color of the module (pixel) at the given coordinates, which is false\n * for white or true for black. The top left corner has the coordinates (x=0, y=0).\n * If the given coordinates are out of bounds, then false (white) is returned.\n */\nconst getPixel = (\n  x: number,\n  y: number,\n  size: number,\n  modules: boolean[][],\n  isLogoShowed: boolean,\n) => {\n  if (x < QR_BORDER && y < QR_BORDER) {\n    return false;\n  }\n\n  if (x >= size - QR_BORDER && y < QR_BORDER) {\n    return false;\n  }\n\n  if (x < QR_BORDER && y >= size - QR_BORDER) {\n    return false;\n  }\n\n  if (isLogoShowed) {\n    let imageTiles = QR_BORDER + 2;\n    if (size <= SMALL_QR_SIZE) {\n      imageTiles--;\n    }\n\n    let paddingTiles = (size - QR_BORDER * 2 - imageTiles) / 2 - 1;\n    if (size <= SMALL_QR_SIZE) {\n      paddingTiles++;\n    }\n\n    if (\n      x > QR_BORDER + paddingTiles &&\n      x < size - QR_BORDER - paddingTiles - 1 &&\n      y > QR_BORDER + paddingTiles &&\n      y < size - QR_BORDER - paddingTiles - 1\n    ) {\n      return false;\n    }\n\n    return 0 <= x && x < size && 0 <= y && y < size && modules[y][x];\n  }\n\n  return modules[y]?.[x];\n};\n\nconst getNeighbors = (\n  x: number,\n  y: number,\n  size: number,\n  modules: boolean[][],\n  isLogoShowed = true,\n) => ({\n  l: getPixel(x - 1, y, size, modules, isLogoShowed),\n  r: getPixel(x + 1, y, size, modules, isLogoShowed),\n  t: getPixel(x, y - 1, size, modules, isLogoShowed),\n  b: getPixel(x, y + 1, size, modules, isLogoShowed),\n  current: getPixel(x, y, size, modules, isLogoShowed),\n});\n\n/**\n * Converts QrCode instance to SVG code\n * @param qrCode QrCode instance\n * @param options Convertation options\n */\nexport const convertSegmentsToSvgString = (qrCode: QrCode, options: RequiredQrOptions): string => {\n  if (typeof options.qrSize !== 'number') {\n    throw new Error('Size should be a number');\n  }\n\n  if (typeof options.className !== 'string') {\n    throw new Error('Classname should be a string');\n  }\n\n  const _2 = 2 * MULTI;\n  const _12_7 = 12.7 * MULTI;\n  const _12_8 = 12.8 * MULTI;\n  const _14_7 = 14.7 * MULTI;\n  const _14_8 = 14.8 * MULTI;\n  const _15_9 = 15.9 * MULTI;\n  const _28_6 = 28.6 * MULTI;\n  const _30_5 = 30.5 * MULTI;\n  const _84_7 = 84.7776815 * MULTI;\n  const _87_3 = 87.3 * MULTI;\n  const _71_4 = 71.4 * MULTI;\n  const _42_9 = 42.9 * MULTI;\n  const _87_2 = 87.2 * MULTI;\n  const _85_2 = 85.2 * MULTI;\n  const _85_3 = 85.3 * MULTI;\n  const _69_5 = 69.5 * MULTI;\n  const _98 = 98 * MULTI;\n  const _100 = 100 * MULTI;\n\n  const parts = [];\n  let leftPadding = 0;\n  let topPadding = 0;\n  let xCoord = 0;\n  let yCoord = 0;\n\n  for (let y = 0; y < qrCode.size; y++) {\n    leftPadding = 0;\n    for (let x = 0; x < qrCode.size; x++) {\n      xCoord = x + leftPadding;\n      leftPadding += TILE_SIZE;\n      yCoord = y + topPadding;\n\n      const neighbors = getNeighbors(x, y, qrCode.size, qrCode.modules, options.isShowLogo);\n\n      let path = '';\n      let selector = '';\n\n      if (neighbors.current) {\n        selector =\n          !selector && !neighbors.l && !neighbors.r && !neighbors.t && !neighbors.b ? 'empty' : '';\n        selector =\n          (!selector && neighbors.l && neighbors.r) || (neighbors.t && neighbors.b) ? 'rect' : '';\n        if (!selector) {\n          selector += neighbors.l ? 'l' : neighbors.r ? 'r' : '';\n          selector += neighbors.t ? 't' : neighbors.b ? 'b' : '';\n          if (!selector) {\n            selector = 'empty';\n          }\n        }\n      } else {\n        selector =\n          !selector &&\n          neighbors.l &&\n          neighbors.t &&\n          getPixel(x - 1, y - 1, qrCode.size, qrCode.modules, options.isShowLogo)\n            ? 'n_lt'\n            : '';\n        selector =\n          !selector &&\n          neighbors.l &&\n          neighbors.b &&\n          getPixel(x - 1, y + 1, qrCode.size, qrCode.modules, options.isShowLogo)\n            ? 'n_lb'\n            : '';\n        selector =\n          !selector &&\n          neighbors.r &&\n          neighbors.t &&\n          getPixel(x + 1, y - 1, qrCode.size, qrCode.modules, options.isShowLogo)\n            ? 'n_rt'\n            : '';\n        selector =\n          !selector &&\n          neighbors.r &&\n          neighbors.b &&\n          getPixel(x + 1, y + 1, qrCode.size, qrCode.modules, options.isShowLogo)\n            ? 'n_rb'\n            : '';\n      }\n\n      if (!selector) {\n        continue;\n      }\n      path = `<use xlink:href=\"#${selector}-${options.suffix}\"/>`;\n      parts.push(`<g transform=\"translate(${xCoord},${yCoord})\">${path}</g>`);\n    }\n    topPadding += TILE_SIZE;\n  }\n\n  let scale = '';\n  let position = ((qrCode.size - QR_BORDER * 3) / 2) * TILE_SIZE + TILE_SIZE * QR_BORDER - 10;\n  if (qrCode.size <= SMALL_QR_SIZE) {\n    scale = 'scale(0.85)';\n    position += 50;\n  }\n\n  const pointPosition = (qrCode.size - QR_BORDER) * options.incTileSize;\n  parts.push(\n    `<use fill-rule=\"evenodd\" transform=\"translate(0,0)\" xlink:href=\"#point-${options.suffix}\"/>`,\n  );\n  parts.push(\n    `<use fill-rule=\"evenodd\" transform=\"translate(${pointPosition},0)\" xlink:href=\"#point-${options.suffix}\"/>`,\n  );\n  parts.push(\n    `<use fill-rule=\"evenodd\" transform=\"translate(0,${pointPosition})\" xlink:href=\"#point-${options.suffix}\"/>`,\n  );\n\n  if (options.isShowLogo) {\n    if (!options.logoData) {\n      parts.push(`\n        <use style=\"width: 750px; height: 750px;\" width=\"750\" height=\"750\"\n          fill=\"none\"\n          fill-rule=\"evenodd\"\n          transform=\"translate(${position},${position}) ${scale}\" xlink:href=\"#vk_logo-${options.suffix}\"\n        />\n      `);\n    } else {\n      parts.push(`\n        <image\n          preserveAspectRatio=\"xMidYMid slice\" clip-path=\"url(#logo-mask-${options.suffix})\"\n          style=\"width: 750px; height: 750px;\" width=\"750\" height=\"750\"\n          transform=\"translate(${position},${position}) ${scale}\"\n          xlink:href=\"${options.logoData}\"\n        />\n      `);\n    }\n  }\n\n  const backgroundSize = 99 * qrCode.size;\n  let qrBackground = '';\n  let qrTransform = 'translate(0,0)';\n\n  if (options.isShowBackground) {\n    const qrScale = (options.qrSize - 20 * 2) / options.qrSize; // 0.756972112\n    const padding = (backgroundSize / options.qrSize) * 21;\n    const radius = Math.ceil(backgroundSize / (options.qrSize / 36)); // 7.11111111 = 256px/36px radius\n\n    qrBackground = `\n      <rect\n        x=\"0\"\n        width=\"${backgroundSize}\"\n        height=\"${backgroundSize}\"\n        rx=\"${radius}\"\n        fill=\"${options.backgroundColor}\"\n      />`;\n    qrTransform = `translate(${padding}, ${padding}) scale(${qrScale})`;\n  }\n\n  // eslint-disable-next-line\n  const oneSide = `M0,0 L66,0 C${_84_7},-3.44940413e-15 ${_100},15.2223185 ${_100},34 L${_100},66 C${_100},${_84_7} \\\n${_84_7},${_100} 66,${_100} L0,${_100} L0,0 Z`;\n  const twoSides = `M0,0 L${_100},0 L${_100},66 C${_100},${_84_7} ${_84_7},${_100} 66,${_100} L0,${_100} L0,0 Z`;\n\n  return `\n  <svg\n    version=\"1.1\"\n    viewBox=\"0 0 ${backgroundSize} ${backgroundSize}\"\n    width=\"${options.qrSize}px\"\n    height=\"${options.qrSize}px\"\n    ${options.className ? `class=\"${options.className}\"` : ''}\n    xml:space=\"preserve\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"\n  >\n    <defs>\n      <rect id=\"rect-${options.suffix}\" width=\"100\" height=\"100\" fill=\"${options.foregroundColor}\"/>\n      <path\n        id=\"empty-${options.suffix}\"\n        d=\"M0,${_28_6}v${_42_9}C0,${_87_3},${_12_8},${_100},${_28_6},${_100}h${_42_9}c${_15_9},0,${_28_6}-${_12_8},\\\n${_28_6}-${_28_6}V${_28_6}C${_100},${_12_7},${_87_2},0,${_71_4},0H${_28_6} C${_12_8},0,0,${_12_8},0,${_28_6}z\"\n        fill=\"${options.foregroundColor}\"\n      />\n      <path id=\"b-${options.suffix}\" d=\"${oneSide}\" transform=\"rotate(-90 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"r-${options.suffix}\" d=\"${oneSide}\" transform=\"rotate(-180 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"l-${options.suffix}\" d=\"${oneSide}\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"t-${options.suffix}\" d=\"${oneSide}\" transform=\"rotate(90 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"l-${options.suffix}\" d=\"${twoSides}\" transform=\"rotate(-90 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"lt-${options.suffix}\" d=\"${twoSides}\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"lb-${options.suffix}\" d=\"${twoSides}\" transform=\"rotate(-90 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"rb-${options.suffix}\" d=\"${twoSides}\" transform=\"rotate(-180 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path id=\"rt-${options.suffix}\" d=\"${twoSides}\" transform=\"rotate(90 50 50)\" fill=\"${options.foregroundColor}\"/>\n      <path\n        id=\"n_lt-${options.suffix}\"\n        d=\"M${_30_5},${_2}V0H0v${_30_5}h${_2}C${_2},${_14_7},${_14_8},${_2},${_30_5},${_2}z\"\n        fill=\"${options.foregroundColor}\"\n      />\n      <path\n        id=\"n_lb-${options.suffix}\"\n        d=\"M${_2},${_69_5}H0V${_100}h${_30_5}v-${_2}C${_14_7},${_98},${_2},${_85_2},${_2},${_69_5}z\"\n        fill=\"${options.foregroundColor}\"\n      />\n      <path\n        id=\"n_rt-${options.suffix}\"\n        d=\"M${_98},${_30_5}h${_2}V0H${_69_5}v${_2}C${_85_3},${_2},${_98},${_14_8},${_98},${_30_5}z\"\n        fill=\"${options.foregroundColor}\"\n      />\n      <path id=\"n_rb-${options.suffix}\"\n        d=\"M${_69_5},${_98}v${_2}H${_100}V${_69_5}h-${_2}C${_98},${_85_3},${_85_2},${_98},${_69_5},${_98}z\"\n        fill=\"${options.foregroundColor}\"\n      />\n      <path\n        id=\"point-${options.suffix}\"\n        fill=\"${options.foregroundColor}\"\n        d=\"M600.001786,457.329333 L600.001786,242.658167 C600.001786,147.372368 587.039517,124.122784 \\\n581.464617,118.535383 C575.877216,112.960483 552.627632,99.9982143 457.329333,99.9982143 \\\nL242.670667,99.9982143 C147.372368,99.9982143 124.122784,112.960483 118.547883,118.535383 \\\nC112.972983,124.122784 99.9982143,147.372368 99.9982143,242.658167 L99.9982143,457.329333 \\\nC99.9982143,552.627632 112.972983,575.877216 118.547883,581.464617 C124.122784,587.027017 \\\n147.372368,600.001786 242.670667,600.001786 L457.329333,600.001786 C552.627632,600.001786 \\\n575.877216,587.027017 581.464617,581.464617 C587.039517,575.877216 600.001786,552.627632 \\\n600.001786,457.329333 Z M457.329333,0 C653.338333,0 700,46.6616668 700,242.658167 C700,438.667167 \\\n700,261.332833 700,457.329333 C700,653.338333 653.338333,700 457.329333,700 C261.332833,700 438.667167,700 \\\n242.670667,700 C46.6616668,700 0,653.338333 0,457.329333 C0,261.332833 0,352.118712 0,242.658167 \\\nC0,46.6616668 46.6616668,0 242.670667,0 C438.667167,0 261.332833,0 457.329333,0 Z M395.996667,200 \\\nC480.004166,200 500,220.008332 500,303.990835 C500,387.998334 500,312.001666 500,395.996667 \\\nC500,479.991668 480.004166,500 395.996667,500 C312.001666,500 387.998334,500 304.003333,500 C220.008332,500 \\\n200,479.991668 200,395.996667 C200,312.001666 200,350.906061 200,303.990835 C200,220.008332 220.008332,200 \\\n304.003333,200 C387.998334,200 312.001666,200 395.996667,200 Z\"\n      />\n      <g id=\"vk_logo-${options.suffix}\">\n        <path\n          fill=\"${options.logoColor}\"\n          d=\"M83.3334 363.333C83.3334 231.34 83.3334 165.343 124.338 124.338C165.343 83.3333 231.34 \\\n             83.3333 363.333 83.3333H386.667C518.66 83.3333 584.657 83.3333 625.662 124.338C666.667 165.343 \\\n             666.667 231.34 666.667 363.333V386.667C666.667 518.66 666.667 584.657 625.662 625.662C584.657 \\\n             666.667 518.66 666.667 386.667 666.667H363.333C231.34 666.667 165.343 666.667 124.338 625.662C83.3334 \\\n             584.657 83.3334 518.66 83.3334 386.667V363.333Z\"\n        />\n        <path\n          fill=\"#FFF\"\n          d=\"M394.907 508.681C263.293 508.681 183.442 417.365 180.313 265.625H246.972C249.05 377.09 \\\n             299.763 424.323 338.638 434.036V265.625H402.519V361.82C440.016 357.664 479.264 313.909 \\\n             492.456 265.625H555.333C545.27 325 502.543 368.754 472.353 386.803C502.566 401.395 551.177 \\\n             439.593 569.926 508.681H500.815C486.222 462.498 450.476 426.728 402.542 421.872V508.681H394.907Z\"\n        />\n      </g>\n      <clipPath id=\"logo-mask-${options.suffix}\">\n        <rect x=\"0\" y=\"0\" width=\"750\" height=\"750\" />\n      </clipPath>\n    </defs>\n\n    ${qrBackground}\n\n    <g transform=\"${qrTransform}\">\n      ${parts.join('\\n')}\n    </g>\n  </svg>`;\n};\n","/*\n * QR Code generator library (TypeScript)\n *\n * Copyright (c) Project Nayuki. (MIT License)\n * https://www.nayuki.io/page/qr-code-generator-library\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n * - The above copyright notice and this permission notice shall be included in\n *   all copies or substantial portions of the Software.\n * - The Software is provided \"as is\", without warranty of any kind, express or\n *   implied, including but not limited to the warranties of merchantability,\n *   fitness for a particular purpose and noninfringement. In no event shall the\n *   authors or copyright holders be liable for any claim, damages or other\n *   liability, whether in an action of contract, tort or otherwise, arising from,\n *   out of or in connection with the Software or the use or other dealings in the\n *   Software.\n */\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 black and white 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: QrCodeEcc): 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: Array<byte>, ecl: QrCodeEcc): 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: Array<QrSegment>,\n    ecl: QrCodeEcc,\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 '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 '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 [QrCodeEcc.MEDIUM, QrCodeEcc.QUARTILE, QrCodeEcc.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 = new BitBuffer();\n    for (const seg of segs) {\n      bb.appendBits(seg.mode.modeBits, 4);\n      bb.appendBits(seg.numChars, seg.mode.numCharCountBits(version));\n      for (const b of seg.getData()) bb.array.push(b);\n    }\n    if (bb.array.length !== dataUsedBits) throw 'Assertion error';\n\n    // Add terminator and pad up to a byte if applicable\n    const dataCapacityBits: int = QrCode.getNumDataCodewords(version, ecl) * 8;\n    if (bb.array.length > dataCapacityBits) throw 'Assertion error';\n    bb.appendBits(0, Math.min(4, dataCapacityBits - bb.array.length));\n    bb.appendBits(0, (8 - (bb.array.length % 8)) % 8);\n    if (bb.array.length % 8 !== 0) throw 'Assertion error';\n\n    // Pad with alternating bytes until data capacity is reached\n    for (let padByte = 0xec; bb.array.length < dataCapacityBits; padByte ^= 0xec ^ 0x11)\n      bb.appendBits(padByte, 8);\n\n    // Pack bits into bytes in big endian\n    const dataCodewords: Array<byte> = [];\n    while (dataCodewords.length * 8 < bb.array.length) dataCodewords.push(0);\n    bb.array.forEach((b: bit, i: int) => {\n      dataCodewords[i >>> 3] |= b << (7 - (i & 7));\n    });\n\n    // Create the QR Code object\n    return new QrCode(version, ecl, dataCodewords, mask);\n  }\n\n  /*-- Fields --*/\n\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 modules of this QR Code (false = white, true = black).\n  // Immutable after constructor finishes. Accessed through getModule().\n  public 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  // 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: QrCodeEcc;\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  // 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    version: int,\n    errorCorrectionLevel: QrCodeEcc,\n    dataCodewords: Array<byte>,\n    mask: int,\n  ) {\n    // Check scalar arguments\n    if (version < QrCode.MIN_VERSION || version > QrCode.MAX_VERSION)\n      throw 'Version value out of range';\n    if (mask < -1 || mask > 7) throw 'Mask value out of range';\n    this.version = version;\n    this.errorCorrectionLevel = errorCorrectionLevel;\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 white\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 (mask === -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          mask = i;\n          minPenalty = penalty;\n        }\n        this.applyMask(i); // Undoes the mask due to XOR\n      }\n    }\n    if (mask < 0 || mask > 7) throw 'Assertion error';\n    this.mask = mask;\n    this.applyMask(mask); // Apply the final choice of mask\n    this.drawFormatBits(mask); // 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 white or true for black. The top left corner has the coordinates (x=0, y=0).\n  // If the given coordinates are out of bounds, then false (white) 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  /*-- Public instance methods --*/\n\n  // Returns a string of SVG code for an image depicting this QR Code, with the given number\n  // of border modules. The string always uses Unix newlines (\\n), regardless of the platform.\n  public toSvgString(border: int): string {\n    if (border < 0) throw 'Border must be non-negative';\n    const parts: Array<string> = [];\n    for (let y = 0; y < this.size; y++) {\n      for (let x = 0; x < this.size; x++) {\n        if (this.getModule(x, y)) parts.push(`M${x + border},${y + border}h1v1h-1z`);\n      }\n    }\n    return `<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\" \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n<svg xmlns=\"http://www.w3.org/2000/svg\" version=\"1.1\" viewBox=\"0 0 ${this.size + border * 2} ${\n      this.size + border * 2\n    }\" stroke=\"none\">\n\t<rect width=\"100%\" height=\"100%\" fill=\"#FFFFFF\"/>\n\t<path d=\"${parts.join(' ')}\" fill=\"#000000\"/>\n</svg>\n`;\n  }\n\n  /*-- Private helper methods for constructor: Drawing function modules --*/\n\n  // Reads this object's version field, and draws and marks all function modules.\n  private drawFunctionPatterns(): void {\n    // Draw horizontal and vertical timing patterns\n    for (let i = 0; i < this.size; i++) {\n      this.setFunctionModule(6, i, i % 2 === 0);\n      this.setFunctionModule(i, 6, i % 2 === 0);\n    }\n\n    // Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules)\n    this.drawFinderPattern(3, 3);\n    this.drawFinderPattern(this.size - 4, 3);\n    this.drawFinderPattern(3, this.size - 4);\n\n    // Draw numerous alignment patterns\n    const alignPatPos: Array<int> = this.getAlignmentPatternPositions();\n    const numAlign: int = alignPatPos.length;\n    for (let i = 0; i < numAlign; i++) {\n      for (let j = 0; j < numAlign; j++) {\n        // Don't draw on the three finder corners\n        if (\n          !(\n            (i === 0 && j === 0) ||\n            (i === 0 && j === numAlign - 1) ||\n            (i === numAlign - 1 && j === 0)\n          )\n        )\n          this.drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);\n      }\n    }\n\n    // Draw configuration data\n    this.drawFormatBits(0); // Dummy mask value; overwritten later in the constructor\n    this.drawVersion();\n  }\n\n  // Draws two copies of the format bits (with its own error correction code)\n  // based on the given mask and this object's error correction level field.\n  private drawFormatBits(mask: int): void {\n    // Calculate error correction code and pack bits\n    const data: int = (this.errorCorrectionLevel.formatBits << 3) | mask; // errCorrLvl is uint2, mask is uint3\n    let rem: int = data;\n    for (let i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >>> 9) * 0x537);\n    const bits = ((data << 10) | rem) ^ 0x5412; // uint15\n    if (bits >>> 15 !== 0) throw 'Assertion error';\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 black\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    if (bits >>> 18 !== 0) throw 'Assertion error';\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, isBlack: boolean): void {\n    this.modules[y][x] = isBlack;\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: Array<byte>): Array<byte> {\n    const ver: int = this.version;\n    const ecl: QrCodeEcc = this.errorCorrectionLevel;\n    if (data.length !== QrCode.getNumDataCodewords(ver, ecl)) throw '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 rs = new ReedSolomonGenerator(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> = rs.getRemainder(dat);\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      for (let j = 0; j < blocks.length; j++) {\n        // Skip the padding byte in short blocks\n        if (i !== shortBlockLen - blockEccLen || j >= numShortBlocks) result.push(blocks[j][i]);\n      }\n    }\n    if (result.length !== rawCodewords) throw 'Assertion error';\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: Array<byte>): void {\n    if (data.length !== Math.floor(QrCode.getNumRawDataModules(this.version) / 8))\n      throw '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/white by the constructor and are left unchanged by this method\n        }\n      }\n    }\n    if (i !== data.length * 8) throw 'Assertion error';\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 '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 'Assertion error';\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      const runHistory = [0, 0, 0, 0, 0, 0, 0];\n      let color = false;\n      let runX = 0;\n      for (let x = 0; x < this.size; x++) {\n        if (this.modules[y][x] === color) {\n          runX++;\n          if (runX === 5) result += QrCode.PENALTY_N1;\n          else if (runX > 5) result++;\n        } else {\n          QrCode.addRunToHistory(runX, runHistory);\n          if (!color && QrCode.hasFinderLikePattern(runHistory)) result += QrCode.PENALTY_N3;\n          color = this.modules[y][x];\n          runX = 1;\n        }\n      }\n      QrCode.addRunToHistory(runX, runHistory);\n      if (color) QrCode.addRunToHistory(0, runHistory); // Dummy run of white\n      if (QrCode.hasFinderLikePattern(runHistory)) result += 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      const runHistory = [0, 0, 0, 0, 0, 0, 0];\n      let color = false;\n      let runY = 0;\n      for (let y = 0; y < this.size; y++) {\n        if (this.modules[y][x] === color) {\n          runY++;\n          if (runY === 5) result += QrCode.PENALTY_N1;\n          else if (runY > 5) result++;\n        } else {\n          QrCode.addRunToHistory(runY, runHistory);\n          if (!color && QrCode.hasFinderLikePattern(runHistory)) result += QrCode.PENALTY_N3;\n          color = this.modules[y][x];\n          runY = 1;\n        }\n      }\n      QrCode.addRunToHistory(runY, runHistory);\n      if (color) QrCode.addRunToHistory(0, runHistory); // Dummy run of white\n      if (QrCode.hasFinderLikePattern(runHistory)) result += 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 black and white modules\n    let black: int = 0;\n    for (const row of this.modules) {\n      for (const color of row) {\n        if (color) black++;\n      }\n    }\n    const total: int = this.size * this.size; // Note that size is odd, so black/total != 1/2\n    // Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%\n    const k: int = Math.ceil(Math.abs(black * 20 - total * 10) / total) - 1;\n    result += k * QrCode.PENALTY_N4;\n    return result;\n  }\n\n  /*-- Private helper functions --*/\n\n  // Returns an ascending list of positions of alignment patterns for this version number.\n  // Each position is in the range [0,177), and are used on both the x and y axes.\n  // This could be implemented as lookup table of 40 variable-length lists of integers.\n  private getAlignmentPatternPositions(): Array<int> {\n    if (this.version === 1) return [];\n    else {\n      const numAlign: int = Math.floor(this.version / 7) + 2;\n      const step: int =\n        this.version === 32 ? 26 : Math.ceil((this.size - 13) / (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\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) throw '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    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: QrCodeEcc): 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  // Inserts the given value to the front of the given array, which shifts over the\n  // existing values and deletes the last value. A helper function for getPenaltyScore().\n  private static addRunToHistory(run: int, history: Array<int>): void {\n    history.pop();\n    history.unshift(run);\n  }\n\n  // Tests whether the given run history has the pattern of ratio 1:1:3:1:1 in the middle, and\n  // surrounded by at least 4 on either or both ends. A helper function for getPenaltyScore().\n  // Must only be called immediately after a run of white modules has ended.\n  private static hasFinderLikePattern(runHistory: Array<int>): boolean {\n    const n: int = runHistory[1];\n    return (\n      n > 0 &&\n      runHistory[2] === n &&\n      runHistory[4] === n &&\n      runHistory[5] === n &&\n      runHistory[3] === n * 3 &&\n      Math.max(runHistory[0], runHistory[6]) >= n * 4\n    );\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    /* eslint-disable */\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    // prettier-ignore\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    // prettier-ignore\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    // prettier-ignore\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    // prettier-ignore\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    /* eslint-enable */\n  ];\n\n  private static readonly NUM_ERROR_CORRECTION_BLOCKS: Array<Array<int>> = [\n    /* eslint-disable */\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    // prettier-ignore\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    // prettier-ignore\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    // prettier-ignore\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    // prettier-ignore\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    /* eslint-enable */\n  ];\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/*---- 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 */\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: Array<byte>): QrSegment {\n    const bb = new BitBuffer();\n    for (const b of data) bb.appendBits(b, 8);\n    return new QrSegment(QrSegmentMode.BYTE, data.length, bb.array);\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.NUMERIC_REGEX.test(digits)) throw 'String contains non-numeric characters';\n    const bb = new BitBuffer();\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      bb.appendBits(parseInt(digits.substr(i, n), 10), n * 3 + 1);\n      i += n;\n    }\n    return new QrSegment(QrSegmentMode.NUMERIC, digits.length, bb.array);\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.ALPHANUMERIC_REGEX.test(text))\n      throw 'String contains unencodable characters in alphanumeric mode';\n    const bb = new BitBuffer();\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      bb.appendBits(temp, 11);\n    }\n    if (i < text.length)\n      // 1 character remaining\n      bb.appendBits(QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6);\n    return new QrSegment(QrSegmentMode.ALPHANUMERIC, text.length, bb.array);\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.NUMERIC_REGEX.test(text)) return [QrSegment.makeNumeric(text)];\n    else if (QrSegment.ALPHANUMERIC_REGEX.test(text)) return [QrSegment.makeAlphanumeric(text)];\n    else return [QrSegment.makeBytes(QrSegment.toUtf8ByteArray(text))];\n  }\n\n  // Returns a segment representing an Extended Channel Interpretation\n  // (ECI) designator with the given assignment value.\n  public static makeEci(assignVal: int): QrSegment {\n    const bb = new BitBuffer();\n    if (assignVal < 0) throw 'ECI assignment value out of range';\n    else if (assignVal < 1 << 7) bb.appendBits(assignVal, 8);\n    else if (assignVal < 1 << 14) {\n      bb.appendBits(2, 2);\n      bb.appendBits(assignVal, 14);\n    } else if (assignVal < 1000000) {\n      bb.appendBits(6, 3);\n      bb.appendBits(assignVal, 21);\n    } else throw 'ECI assignment value out of range';\n    return new QrSegment(QrSegmentMode.ECI, 0, bb.array);\n  }\n\n  /*-- Constructor (low level) and fields --*/\n\n  // The mode indicator of this segment.\n  public readonly mode: QrSegmentMode;\n\n  // The length of this segment's unencoded data. Measured in characters for\n  // numeric/alphanumeric/kanji mode, bytes for byte mode, and 0 for ECI mode.\n  // Always zero or positive. Not the same as the data's bit length.\n  public readonly numChars: int;\n\n  // The data bits of this segment. Accessed through getData().\n  private readonly bitData: Array<bit>;\n\n  // Creates a new QR Code segment with the given attributes and data.\n  // The character count (numChars) must agree with the mode and the bit buffer length,\n  // but the constraint isn't checked. The given bit buffer is cloned and stored.\n  public constructor(mode: QrSegmentMode, numChars: int, bitData: Array<bit>) {\n    if (numChars < 0) throw 'Invalid argument';\n    this.mode = mode;\n    this.numChars = numChars;\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: 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.substr(i + 1, 2), 16));\n        i += 2;\n      }\n    }\n    return result;\n  }\n\n  /*-- Constants --*/\n\n  // Describes precisely all strings that are encodable in numeric mode. To test\n  // whether a string s is encodable: let ok: boolean = NUMERIC_REGEX.test(s);\n  // A string is encodable iff each character is in the range 0 to 9.\n  public static readonly NUMERIC_REGEX: RegExp = /^[0-9]*$/;\n\n  // Describes precisely all strings that are encodable in alphanumeric mode. To test\n  // whether a string s is encodable: let ok: boolean = ALPHANUMERIC_REGEX.test(s);\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 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/*---- Private helper classes ----*/\n\n/*\n * Computes the Reed-Solomon error correction codewords for a sequence of data codewords\n * at a given degree. Objects are immutable, and the state only depends on the degree.\n * This class exists because each data block in a QR Code shares the same the divisor polynomial.\n */\nclass ReedSolomonGenerator {\n  // Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which\n  // is always 1. For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}.\n  private readonly coefficients: Array<byte> = [];\n\n  // Creates a Reed-Solomon ECC generator for the given degree. This could be implemented\n  // as a lookup table over all possible parameter values, instead of as an algorithm.\n  public constructor(degree: int) {\n    if (degree < 1 || degree > 255) throw 'Degree out of range';\n    const coefs = this.coefficients;\n\n    // Start with the monomial x^0\n    for (let i = 0; i < degree - 1; i++) coefs.push(0);\n    coefs.push(1);\n\n    // Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),\n    // drop the highest term, and store the rest of the coefficients in order of descending powers.\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 < coefs.length; j++) {\n        coefs[j] = ReedSolomonGenerator.multiply(coefs[j], root);\n        if (j + 1 < coefs.length) coefs[j] ^= coefs[j + 1];\n      }\n      root = ReedSolomonGenerator.multiply(root, 0x02);\n    }\n  }\n\n  // Computes and returns the Reed-Solomon error correction codewords for the given\n  // sequence of data codewords. The returned object is always a new byte array.\n  // This method does not alter this object's state (because it is immutable).\n  public getRemainder(data: Array<byte>): Array<byte> {\n    // Compute the remainder by performing polynomial division\n    const result: Array<byte> = this.coefficients.map((_) => 0);\n    for (const b of data) {\n      const factor: byte = b ^ (result.shift() as byte);\n      result.push(0);\n      this.coefficients.forEach((coef, i) => {\n        result[i] ^= ReedSolomonGenerator.multiply(coef, factor);\n      });\n    }\n    return result;\n  }\n\n  // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result\n  // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.\n  private static multiply(x: byte, y: byte): byte {\n    if (x >>> 8 !== 0 || y >>> 8 !== 0) throw '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    if (z >>> 8 !== 0) throw 'Assertion error';\n    return z as byte;\n  }\n}\n\n/*\n * An appendable sequence of bits (0s and 1s). Mainly used by QrSegment.\n * The implicit constructor creates an empty bit buffer (length 0).\n */\nclass BitBuffer {\n  public array: Array<bit> = [];\n\n  // Appends the given number of low-order bits of the given value\n  // to this buffer. Requires 0 <= len <= 31 and 0 <= val < 2^len.\n  public appendBits(val: int, len: int): void {\n    if (len < 0 || len > 31 || val >>> len !== 0) throw 'Value out of range';\n    for (\n      let i = len - 1;\n      i >= 0;\n      i-- // Append bit by bit\n    )\n      this.array.push((val >>> i) & 1);\n  }\n}\n\n/*---- Public helper enumeration ----*/\n\n/*\n * The error correction level in a QR Code symbol. Immutable.\n */\nexport class QrCodeEcc {\n  /*-- Constants --*/\n\n  public static readonly LOW = new QrCodeEcc(0, 1); // The QR Code can tolerate about  7% erroneous codewords\n  public static readonly MEDIUM = new QrCodeEcc(1, 0); // The QR Code can tolerate about 15% erroneous codewords\n  public static readonly QUARTILE = new QrCodeEcc(2, 3); // The QR Code can tolerate about 25% erroneous codewords\n  public static readonly HIGH = new QrCodeEcc(3, 2); // The QR Code can tolerate about 30% erroneous codewords\n\n  /*-- Constructor and fields --*/\n\n  // In the range 0 to 3 (unsigned 2-bit integer).\n  public readonly ordinal: int;\n  // (Package-private) In the range 0 to 3 (unsigned 2-bit integer).\n  public readonly formatBits: int;\n\n  private constructor(ordinal: int, formatBits: int) {\n    this.ordinal = ordinal;\n    this.formatBits = formatBits;\n  }\n}\n\n/*---- Public helper enumeration ----*/\n\n/*\n * Describes how a segment's data bits are interpreted. Immutable.\n */\nexport class QrSegmentMode {\n  /*-- Constants --*/\n\n  public static readonly NUMERIC = new QrSegmentMode(0x1, [10, 12, 14]);\n  public static readonly ALPHANUMERIC = new QrSegmentMode(0x2, [9, 11, 13]);\n  public static readonly BYTE = new QrSegmentMode(0x4, [8, 16, 16]);\n  public static readonly KANJI = new QrSegmentMode(0x8, [8, 10, 12]);\n  public static readonly ECI = new QrSegmentMode(0x7, [0, 0, 0]);\n\n  /*-- Constructor and fields --*/\n\n  // The mode indicator bits, which is a uint4 value (range 0 to 15).\n  public readonly modeBits: int;\n  // Number of character count bits for three different version ranges.\n  private readonly numBitsCharCount: [int, int, int];\n\n  private constructor(modeBits: int, numBitsCharCount: [int, int, int]) {\n    this.modeBits = modeBits;\n    this.numBitsCharCount = numBitsCharCount;\n  }\n\n  /*-- Method --*/\n\n  // (Package-private) Returns the bit width of the character count field for a segment in\n  // this mode in a QR Code at the given version number. The result is in the range [0, 16].\n  public numCharCountBits(ver: int): int {\n    return this.numBitsCharCount[Math.floor((ver + 7) / 17)];\n  }\n}\n","import { convertSegmentsToSvgString, INC_TILE_SIZE } from './svg.ts';\nimport { QrSegment, QrCode, QrCodeEcc } from './qr.ts';\nimport type { QrOptions, RequiredQrOptions } from './types.ts';\n\n/** Default width and height of QR code */\nconst DEFAULT_SIZE = 128;\n\n/** Default background color of QR code*/\nconst BACKGROUND_COLOR_DEFAULT = '#ffffff';\n\n/** Default foreground color */\nconst FOREGROUND_COLOR_DEFAULT = '#000000';\n\n/** Default logo color */\nconst LOGO_COLOR_DEFAULT = '#07f';\n\n/**\n * Generates SVG QR code by a text\n * @param text String to encode\n * @param options QR code options\n */\nexport function createQR(text: string, options?: QrOptions): string;\n\n/**\n * Legacy interface\n * @deprecated\n * @param text String to encode\n * @param qrSize Size of QR code\n * @param className SVG element class name\n * @param options Options of the QR code\n */\nexport function createQR(\n  text: string,\n  qrSize: number,\n  className: string,\n  options?: QrOptions,\n): string;\n\n/**\n * Implementation\n */\nexport function createQR(\n  text: string,\n  qrSizeOrOptions?: number | QrOptions,\n  classNameLegacy?: string,\n  legacyOptions?: QrOptions,\n): string {\n  if (typeof text !== 'string') {\n    throw new TypeError('Enter text for encoding');\n  }\n\n  // Legacy interface resolve\n  const options: QrOptions = {\n    ...(typeof qrSizeOrOptions === 'object' && qrSizeOrOptions !== null ? qrSizeOrOptions : {}),\n    ...(typeof legacyOptions === 'object' && legacyOptions !== null ? legacyOptions : {}),\n    qrSize:\n      typeof qrSizeOrOptions === 'object' &&\n      qrSizeOrOptions !== null &&\n      typeof qrSizeOrOptions.qrSize === 'number'\n        ? qrSizeOrOptions.qrSize\n        : (qrSizeOrOptions as number),\n    className:\n      typeof qrSizeOrOptions === 'object' &&\n      qrSizeOrOptions !== null &&\n      typeof qrSizeOrOptions.className === 'string'\n        ? qrSizeOrOptions.className\n        : classNameLegacy,\n  };\n\n  // ECC levels mapping\n  const eccLevels = [QrCodeEcc.LOW, QrCodeEcc.MEDIUM, QrCodeEcc.QUARTILE, QrCodeEcc.HIGH];\n\n  // Fallback undefined options\n  const fallbackOptions: RequiredQrOptions = {\n    qrSize: typeof options.qrSize === 'number' ? options.qrSize : DEFAULT_SIZE,\n    className: typeof options.className === 'string' ? options.className : classNameLegacy || '',\n    isShowLogo: !!options.isShowLogo || false,\n    isShowBackground: !!options.isShowBackground || false,\n    foregroundColor:\n      typeof options.foregroundColor === 'string'\n        ? options.foregroundColor\n        : FOREGROUND_COLOR_DEFAULT,\n    backgroundColor:\n      typeof options.backgroundColor === 'string'\n        ? options.backgroundColor\n        : BACKGROUND_COLOR_DEFAULT,\n    logoColor: typeof options.logoColor === 'string' ? options.logoColor : LOGO_COLOR_DEFAULT,\n    suffix: options.suffix ? options.suffix.toString() : '0',\n    logoData: typeof options.logoData === 'string' ? options.logoData : null,\n    ecc: typeof options.ecc === 'number' && eccLevels[options.ecc] ? options.ecc : 3,\n    incTileSize: typeof options.incTileSize === 'number' ? options.incTileSize : INC_TILE_SIZE,\n  };\n\n  // Code generation\n  const segments: QrSegment[] = QrSegment.makeSegments(text);\n  const qrCode: QrCode = QrCode.encodeSegments(\n    segments,\n    eccLevels[fallbackOptions.ecc],\n    1,\n    40,\n    -1,\n    true,\n  );\n  const svgCode = convertSegmentsToSvgString(qrCode, fallbackOptions);\n\n  return svgCode;\n}\n"],"names":["MULTI","QR_BORDER","TILE_SIZE","SMALL_QR_SIZE","getPixel","x","y","size","modules","isLogoShowed","imageTiles","paddingTiles","getNeighbors","convertSegmentsToSvgString","qrCode","options","Error","_2","_12_7","_12_8","_14_7","_14_8","_15_9","_28_6","_30_5","_84_7","_87_3","_71_4","_42_9","_87_2","_85_2","_85_3","_69_5","_98","_100","parts","leftPadding","topPadding","xCoord","yCoord","neighbors","path","selector","scale","position","pointPosition","backgroundSize","qrBackground","qrTransform","qrScale","padding","radius","Math","oneSide","twoSides","QrCode","text","ecl","segs","QrSegment","data","seg","minVersion","maxVersion","mask","boostEcl","version","dataUsedBits","dataCapacityBits","usedBits","newEcl","QrCodeEcc","bb","BitBuffer","b","padByte","dataCodewords","i","border","alignPatPos","numAlign","j","rem","bits","getBit","color","a","dy","dx","dist","xx","yy","isBlack","ver","numBlocks","blockEccLen","rawCodewords","numShortBlocks","shortBlockLen","blocks","rs","ReedSolomonGenerator","k","dat","ecc","result","right","vert","upward","invert","runHistory","runX","runY","black","row","total","step","pos","run","history","n","errorCorrectionLevel","allCodewords","minPenalty","penalty","QrSegmentMode","digits","parseInt","temp","assignVal","ccbits","Infinity","str","encodeURI","mode","numChars","bitData","_","factor","coef","z","degree","coefs","root","val","len","ordinal","formatBits","modeBits","numBitsCharCount","DEFAULT_SIZE","BACKGROUND_COLOR_DEFAULT","FOREGROUND_COLOR_DEFAULT","LOGO_COLOR_DEFAULT","createQR","qrSizeOrOptions","classNameLegacy","legacyOptions","TypeError","eccLevels","fallbackOptions","INC_TILE_SIZE","segments","svgCode"],"mappings":";AAGA,MAAMA,QAAQ;AACd,MAAMC,YAAY;AAClB,MAAMC,YAAY,KAAKF;AAEvB,MAAMG,gBAAgB;AAOtB,MAAMC,WAAW,CACfC,GACAC,GACAC,MACAC,SACAC;IAEA,IAAIJ,IAAIJ,aAAaK,IAAIL,WACvB,OAAO;IAGT,IAAII,KAAKE,OAAON,aAAaK,IAAIL,WAC/B,OAAO;IAGT,IAAII,IAAIJ,aAAaK,KAAKC,OAAON,WAC/B,OAAO;IAGT,IAAIQ,cAAc;QAChB,IAAIC,aAAaT,YAAY;QAC7B,IAAIM,QAAQJ,eACVO;QAGF,IAAIC,eAAgBJ,AAAAA,CAAAA,OAAON,AAAY,IAAZA,YAAgBS,UAAS,IAAK,IAAI;QAC7D,IAAIH,QAAQJ,eACVQ;QAGF,IACEN,IAAIJ,YAAYU,gBAChBN,IAAIE,OAAON,YAAYU,eAAe,KACtCL,IAAIL,YAAYU,gBAChBL,IAAIC,OAAON,YAAYU,eAAe,GAEtC,OAAO;QAGT,OAAO,KAAKN,KAAKA,IAAIE,QAAQ,KAAKD,KAAKA,IAAIC,QAAQC,OAAO,CAACF,EAAE,CAACD,EAAE;IAClE;IAEA,OAAOG,OAAO,CAACF,EAAE,EAAE,CAACD,EAAE;AACxB;AAEA,MAAMO,eAAe,CACnBP,GACAC,GACAC,MACAC,SACAC,eAAe,IAAI,GACf;QACJ,GAAGL,SAASC,IAAI,GAAGC,GAAGC,MAAMC,SAASC;QACrC,GAAGL,SAASC,IAAI,GAAGC,GAAGC,MAAMC,SAASC;QACrC,GAAGL,SAASC,GAAGC,IAAI,GAAGC,MAAMC,SAASC;QACrC,GAAGL,SAASC,GAAGC,IAAI,GAAGC,MAAMC,SAASC;QACrC,SAASL,SAASC,GAAGC,GAAGC,MAAMC,SAASC;IACzC;AAOO,MAAMI,6BAA6B,CAACC,QAAgBC;IACzD,IAAI,AAA0B,YAA1B,OAAOA,QAAQ,MAAM,EACvB,MAAM,IAAIC,MAAM;IAGlB,IAAI,AAA6B,YAA7B,OAAOD,QAAQ,SAAS,EAC1B,MAAM,IAAIC,MAAM;IAGlB,MAAMC,KAAK,IAAIjB;IACf,MAAMkB,QAAQ,OAAOlB;IACrB,MAAMmB,QAAQ,OAAOnB;IACrB,MAAMoB,QAAQ,OAAOpB;IACrB,MAAMqB,QAAQ,OAAOrB;IACrB,MAAMsB,QAAQ,OAAOtB;IACrB,MAAMuB,QAAQ,OAAOvB;IACrB,MAAMwB,QAAQ,OAAOxB;IACrB,MAAMyB,QAAQ,aAAazB;IAC3B,MAAM0B,QAAQ,OAAO1B;IACrB,MAAM2B,QAAQ,OAAO3B;IACrB,MAAM4B,QAAQ,OAAO5B;IACrB,MAAM6B,QAAQ,OAAO7B;IACrB,MAAM8B,QAAQ,OAAO9B;IACrB,MAAM+B,QAAQ,OAAO/B;IACrB,MAAMgC,QAAQ,OAAOhC;IACrB,MAAMiC,MAAM,KAAKjC;IACjB,MAAMkC,OAAO,MAAMlC;IAEnB,MAAMmC,QAAQ,EAAE;IAChB,IAAIC,cAAc;IAClB,IAAIC,aAAa;IACjB,IAAIC,SAAS;IACb,IAAIC,SAAS;IAEb,IAAK,IAAIjC,IAAI,GAAGA,IAAIQ,OAAO,IAAI,EAAER,IAAK;QACpC8B,cAAc;QACd,IAAK,IAAI/B,IAAI,GAAGA,IAAIS,OAAO,IAAI,EAAET,IAAK;YACpCiC,SAASjC,IAAI+B;YACbA,eAAelC;YACfqC,SAASjC,IAAI+B;YAEb,MAAMG,YAAY5B,aAAaP,GAAGC,GAAGQ,OAAO,IAAI,EAAEA,OAAO,OAAO,EAAEC,QAAQ,UAAU;YAEpF,IAAI0B,OAAO;YACX,IAAIC,WAAW;YAEf,IAAIF,UAAU,OAAO,EAAE;gBACrBE,WACE,AAACA,YAAaF,UAAU,CAAC,IAAKA,UAAU,CAAC,IAAKA,UAAU,CAAC,IAAKA,UAAU,CAAC,GAAa,KAAV;gBAC9EE,WACG,CAACA,YAAYF,UAAU,CAAC,IAAIA,UAAU,CAAC,IAAMA,UAAU,CAAC,IAAIA,UAAU,CAAC,GAAI,SAAS;gBACvF,IAAI,CAACE,UAAU;oBACbA,YAAYF,UAAU,CAAC,GAAG,MAAMA,UAAU,CAAC,GAAG,MAAM;oBACpDE,YAAYF,UAAU,CAAC,GAAG,MAAMA,UAAU,CAAC,GAAG,MAAM;oBACpD,IAAI,CAACE,UACHA,WAAW;gBAEf;YACF,OAAO;gBACLA,WACE,CAACA,YACDF,UAAU,CAAC,IACXA,UAAU,CAAC,IACXpC,SAASC,IAAI,GAAGC,IAAI,GAAGQ,OAAO,IAAI,EAAEA,OAAO,OAAO,EAAEC,QAAQ,UAAU,IAClE,SACA;gBACN2B,WACE,CAACA,YACDF,UAAU,CAAC,IACXA,UAAU,CAAC,IACXpC,SAASC,IAAI,GAAGC,IAAI,GAAGQ,OAAO,IAAI,EAAEA,OAAO,OAAO,EAAEC,QAAQ,UAAU,IAClE,SACA;gBACN2B,WACE,CAACA,YACDF,UAAU,CAAC,IACXA,UAAU,CAAC,IACXpC,SAASC,IAAI,GAAGC,IAAI,GAAGQ,OAAO,IAAI,EAAEA,OAAO,OAAO,EAAEC,QAAQ,UAAU,IAClE,SACA;gBACN2B,WACE,CAACA,YACDF,UAAU,CAAC,IACXA,UAAU,CAAC,IACXpC,SAASC,IAAI,GAAGC,IAAI,GAAGQ,OAAO,IAAI,EAAEA,OAAO,OAAO,EAAEC,QAAQ,UAAU,IAClE,SACA;YACR;YAEA,IAAK2B;gBAGLD,OAAO,CAAC,kBAAkB,EAAEC,SAAS,CAAC,EAAE3B,QAAQ,MAAM,CAAC,GAAG,CAAC;gBAC3DoB,MAAM,IAAI,CAAC,CAAC,wBAAwB,EAAEG,OAAO,CAAC,EAAEC,OAAO,GAAG,EAAEE,KAAK,IAAI,CAAC;;QACxE;QACAJ,cAAcnC;IAChB;IAEA,IAAIyC,QAAQ;IACZ,IAAIC,WAAa9B,AAAAA,CAAAA,OAAO,IAAI,GAAGb,AAAY,IAAZA,SAAY,IAAK,IAAKC,YAAYA,YAAYD,YAAY;IACzF,IAAIa,OAAO,IAAI,IAAIX,eAAe;QAChCwC,QAAQ;QACRC,YAAY;IACd;IAEA,MAAMC,gBAAiB/B,AAAAA,CAAAA,OAAO,IAAI,GAAGb,SAAQ,IAAKc,QAAQ,WAAW;IACrEoB,MAAM,IAAI,CACR,CAAC,uEAAuE,EAAEpB,QAAQ,MAAM,CAAC,GAAG,CAAC;IAE/FoB,MAAM,IAAI,CACR,CAAC,8CAA8C,EAAEU,cAAc,wBAAwB,EAAE9B,QAAQ,MAAM,CAAC,GAAG,CAAC;IAE9GoB,MAAM,IAAI,CACR,CAAC,gDAAgD,EAAEU,cAAc,sBAAsB,EAAE9B,QAAQ,MAAM,CAAC,GAAG,CAAC;IAG9G,IAAIA,QAAQ,UAAU,EACpB,IAAKA,QAAQ,QAAQ,EASnBoB,MAAM,IAAI,CAAC,CAAC;;yEAEuD,EAAEpB,QAAQ,MAAM,CAAC;;+BAE3D,EAAE6B,SAAS,CAAC,EAAEA,SAAS,EAAE,EAAED,MAAM;sBAC1C,EAAE5B,QAAQ,QAAQ,CAAC;;MAEnC,CAAC;SAfDoB,MAAM,IAAI,CAAC,CAAC;;;;+BAIa,EAAES,SAAS,CAAC,EAAEA,SAAS,EAAE,EAAED,MAAM,uBAAuB,EAAE5B,QAAQ,MAAM,CAAC;;MAElG,CAAC;IAaL,MAAM+B,iBAAiB,KAAKhC,OAAO,IAAI;IACvC,IAAIiC,eAAe;IACnB,IAAIC,cAAc;IAElB,IAAIjC,QAAQ,gBAAgB,EAAE;QAC5B,MAAMkC,UAAWlC,AAAAA,CAAAA,QAAQ,MAAM,GAAG,EAAK,IAAKA,QAAQ,MAAM;QAC1D,MAAMmC,UAAWJ,iBAAiB/B,QAAQ,MAAM,GAAI;QACpD,MAAMoC,SAASC,KAAK,IAAI,CAACN,iBAAkB/B,CAAAA,QAAQ,MAAM,GAAG,EAAC;QAE7DgC,eAAe,CAAC;;;eAGL,EAAED,eAAe;gBAChB,EAAEA,eAAe;YACrB,EAAEK,OAAO;cACP,EAAEpC,QAAQ,eAAe,CAAC;QAChC,CAAC;QACLiC,cAAc,CAAC,UAAU,EAAEE,QAAQ,EAAE,EAAEA,QAAQ,QAAQ,EAAED,QAAQ,CAAC,CAAC;IACrE;IAGA,MAAMI,UAAU,CAAC,YAAY,EAAE5B,MAAM,iBAAiB,EAAES,KAAK,YAAY,EAAEA,KAAK,KAAK,EAAEA,KAAK,KAAK,EAAEA,KAAK,CAAC,EAAET,MAAM;AACnH,EAAEA,MAAM,CAAC,EAAES,KAAK,IAAI,EAAEA,KAAK,IAAI,EAAEA,KAAK,OAAO,CAAC;IAC5C,MAAMoB,WAAW,CAAC,MAAM,EAAEpB,KAAK,IAAI,EAAEA,KAAK,KAAK,EAAEA,KAAK,CAAC,EAAET,MAAM,CAAC,EAAEA,MAAM,CAAC,EAAES,KAAK,IAAI,EAAEA,KAAK,IAAI,EAAEA,KAAK,OAAO,CAAC;IAE9G,OAAO,CAAC;;;iBAGO,EAAEY,eAAe,CAAC,EAAEA,eAAe;WACzC,EAAE/B,QAAQ,MAAM,CAAC;YAChB,EAAEA,QAAQ,MAAM,CAAC;IACzB,EAAEA,QAAQ,SAAS,GAAG,CAAC,OAAO,EAAEA,QAAQ,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG;;;;qBAIzC,EAAEA,QAAQ,MAAM,CAAC,iCAAiC,EAAEA,QAAQ,eAAe,CAAC;;kBAE/E,EAAEA,QAAQ,MAAM,CAAC;cACrB,EAAEQ,MAAM,CAAC,EAAEK,MAAM,GAAG,EAAEF,MAAM,CAAC,EAAEP,MAAM,CAAC,EAAEe,KAAK,CAAC,EAAEX,MAAM,CAAC,EAAEW,KAAK,CAAC,EAAEN,MAAM,CAAC,EAAEN,MAAM,GAAG,EAAEC,MAAM,CAAC,EAAEJ,MAAM;AAClH,EAAEI,MAAM,CAAC,EAAEA,MAAM,CAAC,EAAEA,MAAM,CAAC,EAAEW,KAAK,CAAC,EAAEhB,MAAM,CAAC,EAAEW,MAAM,GAAG,EAAEF,MAAM,GAAG,EAAEJ,MAAM,EAAE,EAAEJ,MAAM,KAAK,EAAEA,MAAM,GAAG,EAAEI,MAAM;cAC9F,EAAER,QAAQ,eAAe,CAAC;;kBAEtB,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEsC,QAAQ,sCAAsC,EAAEtC,QAAQ,eAAe,CAAC;kBAChG,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEsC,QAAQ,uCAAuC,EAAEtC,QAAQ,eAAe,CAAC;kBACjG,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEsC,QAAQ,QAAQ,EAAEtC,QAAQ,eAAe,CAAC;kBAClE,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEsC,QAAQ,qCAAqC,EAAEtC,QAAQ,eAAe,CAAC;kBAC/F,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEuC,SAAS,sCAAsC,EAAEvC,QAAQ,eAAe,CAAC;mBAChG,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEuC,SAAS,QAAQ,EAAEvC,QAAQ,eAAe,CAAC;mBACnE,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEuC,SAAS,sCAAsC,EAAEvC,QAAQ,eAAe,CAAC;mBACjG,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEuC,SAAS,uCAAuC,EAAEvC,QAAQ,eAAe,CAAC;mBAClG,EAAEA,QAAQ,MAAM,CAAC,KAAK,EAAEuC,SAAS,qCAAqC,EAAEvC,QAAQ,eAAe,CAAC;;iBAElG,EAAEA,QAAQ,MAAM,CAAC;YACtB,EAAES,MAAM,CAAC,EAAEP,GAAG,KAAK,EAAEO,MAAM,CAAC,EAAEP,GAAG,CAAC,EAAEA,GAAG,CAAC,EAAEG,MAAM,CAAC,EAAEC,MAAM,CAAC,EAAEJ,GAAG,CAAC,EAAEO,MAAM,CAAC,EAAEP,GAAG;cAC5E,EAAEF,QAAQ,eAAe,CAAC;;;iBAGvB,EAAEA,QAAQ,MAAM,CAAC;YACtB,EAAEE,GAAG,CAAC,EAAEe,MAAM,GAAG,EAAEE,KAAK,CAAC,EAAEV,MAAM,EAAE,EAAEP,GAAG,CAAC,EAAEG,MAAM,CAAC,EAAEa,IAAI,CAAC,EAAEhB,GAAG,CAAC,EAAEa,MAAM,CAAC,EAAEb,GAAG,CAAC,EAAEe,MAAM;cACpF,EAAEjB,QAAQ,eAAe,CAAC;;;iBAGvB,EAAEA,QAAQ,MAAM,CAAC;YACtB,EAAEkB,IAAI,CAAC,EAAET,MAAM,CAAC,EAAEP,GAAG,GAAG,EAAEe,MAAM,CAAC,EAAEf,GAAG,CAAC,EAAEc,MAAM,CAAC,EAAEd,GAAG,CAAC,EAAEgB,IAAI,CAAC,EAAEZ,MAAM,CAAC,EAAEY,IAAI,CAAC,EAAET,MAAM;cACnF,EAAET,QAAQ,eAAe,CAAC;;qBAEnB,EAAEA,QAAQ,MAAM,CAAC;YAC1B,EAAEiB,MAAM,CAAC,EAAEC,IAAI,CAAC,EAAEhB,GAAG,CAAC,EAAEiB,KAAK,CAAC,EAAEF,MAAM,EAAE,EAAEf,GAAG,CAAC,EAAEgB,IAAI,CAAC,EAAEF,MAAM,CAAC,EAAED,MAAM,CAAC,EAAEG,IAAI,CAAC,EAAED,MAAM,CAAC,EAAEC,IAAI;cAC3F,EAAElB,QAAQ,eAAe,CAAC;;;kBAGtB,EAAEA,QAAQ,MAAM,CAAC;cACrB,EAAEA,QAAQ,eAAe,CAAC;;;;;;;;;;;;;;;;;qBAiBnB,EAAEA,QAAQ,MAAM,CAAC;;gBAEtB,EAAEA,QAAQ,SAAS,CAAC;;;;;;;;;;;;;;;8BAeN,EAAEA,QAAQ,MAAM,CAAC;;;;;IAK3C,EAAEgC,aAAa;;kBAED,EAAEC,YAAY;MAC1B,EAAEb,MAAM,IAAI,CAAC,MAAM;;QAEjB,CAAC;AACT;AC/RO,MAAMoB;IAQX,OAAc,WAAWC,IAAY,EAAEC,GAAc,EAAU;QAC7D,MAAMC,OAAyBC,UAAU,YAAY,CAACH;QACtD,OAAOD,OAAO,cAAc,CAACG,MAAMD;IACrC;IAMA,OAAc,aAAaG,IAAiB,EAAEH,GAAc,EAAU;QACpE,MAAMI,MAAiBF,UAAU,SAAS,CAACC;QAC3C,OAAOL,OAAO,cAAc,CAAC;YAACM;SAAI,EAAEJ;IACtC;IAaA,OAAc,eACZC,IAAsB,EACtBD,GAAc,EACdK,aAAkB,CAAC,EACnBC,aAAkB,EAAE,EACpBC,OAAY,EAAE,EACdC,WAAoB,IAAI,EAChB;QACR,IACE,CACEV,CAAAA,OAAO,WAAW,IAAIO,cACtBA,cAAcC,cACdA,cAAcR,OAAO,WAAU,KAEjCS,OAAO,MACPA,OAAO,GAEP,MAAM;QAGR,IAAIE;QACJ,IAAIC;QACJ,IAAKD,UAAUJ,aAAcI,UAAW;YACtC,MAAME,mBAAwBb,AAA2C,IAA3CA,OAAO,mBAAmB,CAACW,SAAST;YAClE,MAAMY,WAAmBV,UAAU,YAAY,CAACD,MAAMQ;YACtD,IAAIG,YAAYD,kBAAkB;gBAChCD,eAAeE;gBACf;YACF;YACA,IAAIH,WAAWH,YAEb,MAAM;QACV;QAGA,KAAK,MAAMO,UAAU;YAACC,UAAU,MAAM;YAAEA,UAAU,QAAQ;YAAEA,UAAU,IAAI;SAAC,CAEzE,IAAIN,YAAYE,gBAAgBZ,AAA8C,IAA9CA,OAAO,mBAAmB,CAACW,SAASI,SAAab,MAAMa;QAIzF,MAAME,KAAK,IAAIC;QACf,KAAK,MAAMZ,OAAOH,KAAM;YACtBc,GAAG,UAAU,CAACX,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjCW,GAAG,UAAU,CAACX,IAAI,QAAQ,EAAEA,IAAI,IAAI,CAAC,gBAAgB,CAACK;YACtD,KAAK,MAAMQ,KAAKb,IAAI,OAAO,GAAIW,GAAG,KAAK,CAAC,IAAI,CAACE;QAC/C;QACA,IAAIF,GAAG,KAAK,CAAC,MAAM,KAAKL,cAAc,MAAM;QAG5C,MAAMC,mBAAwBb,AAA2C,IAA3CA,OAAO,mBAAmB,CAACW,SAAST;QAClE,IAAIe,GAAG,KAAK,CAAC,MAAM,GAAGJ,kBAAkB,MAAM;QAC9CI,GAAG,UAAU,CAAC,GAAGpB,KAAK,GAAG,CAAC,GAAGgB,mBAAmBI,GAAG,KAAK,CAAC,MAAM;QAC/DA,GAAG,UAAU,CAAC,GAAI,KAAKA,GAAG,KAAK,CAAC,MAAM,GAAG,KAAM;QAC/C,IAAIA,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,GAAG,MAAM;QAGrC,IAAK,IAAIG,UAAU,MAAMH,GAAG,KAAK,CAAC,MAAM,GAAGJ,kBAAkBO,WAAW,IACtEH,GAAG,UAAU,CAACG,SAAS;QAGzB,MAAMC,gBAA6B,EAAE;QACrC,MAAOA,AAAuB,IAAvBA,cAAc,MAAM,GAAOJ,GAAG,KAAK,CAAC,MAAM,CAAEI,cAAc,IAAI,CAAC;QACtEJ,GAAG,KAAK,CAAC,OAAO,CAAC,CAACE,GAAQG;YACxBD,aAAa,CAACC,MAAM,EAAE,IAAIH,KAAM,IAAKG,CAAAA,AAAI,IAAJA,CAAI;QAC3C;QAGA,OAAO,IAAItB,OAAOW,SAAST,KAAKmB,eAAeZ;IACjD;IAwFO,UAAU3D,CAAM,EAAEC,CAAM,EAAW;QACxC,OAAO,KAAKD,KAAKA,IAAI,IAAI,CAAC,IAAI,IAAI,KAAKC,KAAKA,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAACA,EAAE,CAACD,EAAE;IACjF;IAMO,YAAYyE,MAAW,EAAU;QACtC,IAAIA,SAAS,GAAG,MAAM;QACtB,MAAM3C,QAAuB,EAAE;QAC/B,IAAK,IAAI7B,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAC7B,IAAK,IAAID,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAC7B,IAAI,IAAI,CAAC,SAAS,CAACA,GAAGC,IAAI6B,MAAM,IAAI,CAAC,CAAC,CAAC,EAAE9B,IAAIyE,OAAO,CAAC,EAAExE,IAAIwE,OAAO,QAAQ,CAAC;QAG/E,OAAO,CAAC;;mEAEuD,EAAE,IAAI,CAAC,IAAI,GAAGA,AAAS,IAATA,OAAW,CAAC,EACvF,IAAI,CAAC,IAAI,GAAGA,AAAS,IAATA,OACb;;UAEK,EAAE3C,MAAM,IAAI,CAAC,KAAK;;AAE5B,CAAC;IACC;IAKQ,uBAA6B;QAEnC,IAAK,IAAI0C,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAK;YAClC,IAAI,CAAC,iBAAiB,CAAC,GAAGA,GAAGA,IAAI,MAAM;YACvC,IAAI,CAAC,iBAAiB,CAACA,GAAG,GAAGA,IAAI,MAAM;QACzC;QAGA,IAAI,CAAC,iBAAiB,CAAC,GAAG;QAC1B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG;QACtC,IAAI,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG;QAGtC,MAAME,cAA0B,IAAI,CAAC,4BAA4B;QACjE,MAAMC,WAAgBD,YAAY,MAAM;QACxC,IAAK,IAAIF,IAAI,GAAGA,IAAIG,UAAUH,IAC5B,IAAK,IAAII,IAAI,GAAGA,IAAID,UAAUC,IAE5B,IACE,CACGJ,CAAAA,AAAM,MAANA,KAAWI,AAAM,MAANA,KACXJ,AAAM,MAANA,KAAWI,MAAMD,WAAW,KAC5BH,MAAMG,WAAW,KAAKC,AAAM,MAANA,CAAM,GAG/B,IAAI,CAAC,oBAAoB,CAACF,WAAW,CAACF,EAAE,EAAEE,WAAW,CAACE,EAAE;QAK9D,IAAI,CAAC,cAAc,CAAC;QACpB,IAAI,CAAC,WAAW;IAClB;IAIQ,eAAejB,IAAS,EAAQ;QAEtC,MAAMJ,OAAa,IAAI,CAAC,oBAAoB,CAAC,UAAU,IAAI,IAAKI;QAChE,IAAIkB,MAAWtB;QACf,IAAK,IAAIiB,IAAI,GAAGA,IAAI,IAAIA,IAAKK,MAAOA,OAAO,IAAOA,AAAAA,CAAAA,QAAQ,KAAK;QAC/D,MAAMC,OAAQ,AAACvB,CAAAA,QAAQ,KAAMsB,GAAE,IAAK;QACpC,IAAIC,SAAS,OAAO,GAAG,MAAM;QAG7B,IAAK,IAAIN,IAAI,GAAGA,KAAK,GAAGA,IAAK,IAAI,CAAC,iBAAiB,CAAC,GAAGA,GAAGO,OAAOD,MAAMN;QACvE,IAAI,CAAC,iBAAiB,CAAC,GAAG,GAAGO,OAAOD,MAAM;QAC1C,IAAI,CAAC,iBAAiB,CAAC,GAAG,GAAGC,OAAOD,MAAM;QAC1C,IAAI,CAAC,iBAAiB,CAAC,GAAG,GAAGC,OAAOD,MAAM;QAC1C,IAAK,IAAIN,IAAI,GAAGA,IAAI,IAAIA,IAAK,IAAI,CAAC,iBAAiB,CAAC,KAAKA,GAAG,GAAGO,OAAOD,MAAMN;QAG5E,IAAK,IAAIA,IAAI,GAAGA,IAAI,GAAGA,IAAK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,GAAG,IAAIA,GAAG,GAAGO,OAAOD,MAAMN;QACtF,IAAK,IAAIA,IAAI,GAAGA,IAAI,IAAIA,IAAK,IAAI,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,KAAKA,GAAGO,OAAOD,MAAMN;QACxF,IAAI,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG;IAC3C;IAIQ,cAAoB;QAC1B,IAAI,IAAI,CAAC,OAAO,GAAG,GAAG;QAGtB,IAAIK,MAAW,IAAI,CAAC,OAAO;QAC3B,IAAK,IAAIL,IAAI,GAAGA,IAAI,IAAIA,IAAKK,MAAOA,OAAO,IAAOA,AAAAA,CAAAA,QAAQ,EAAC,IAAK;QAChE,MAAMC,OAAa,IAAI,CAAC,OAAO,IAAI,KAAMD;QACzC,IAAIC,SAAS,OAAO,GAAG,MAAM;QAG7B,IAAK,IAAIN,IAAI,GAAGA,IAAI,IAAIA,IAAK;YAC3B,MAAMQ,QAAiBD,OAAOD,MAAMN;YACpC,MAAMS,IAAS,IAAI,CAAC,IAAI,GAAG,KAAMT,IAAI;YACrC,MAAMH,IAAStB,KAAK,KAAK,CAACyB,IAAI;YAC9B,IAAI,CAAC,iBAAiB,CAACS,GAAGZ,GAAGW;YAC7B,IAAI,CAAC,iBAAiB,CAACX,GAAGY,GAAGD;QAC/B;IACF;IAIQ,kBAAkBhF,CAAM,EAAEC,CAAM,EAAQ;QAC9C,IAAK,IAAIiF,KAAK,IAAIA,MAAM,GAAGA,KACzB,IAAK,IAAIC,KAAK,IAAIA,MAAM,GAAGA,KAAM;YAC/B,MAAMC,OAAYrC,KAAK,GAAG,CAACA,KAAK,GAAG,CAACoC,KAAKpC,KAAK,GAAG,CAACmC;YAClD,MAAMG,KAAUrF,IAAImF;YACpB,MAAMG,KAAUrF,IAAIiF;YACpB,IAAI,KAAKG,MAAMA,KAAK,IAAI,CAAC,IAAI,IAAI,KAAKC,MAAMA,KAAK,IAAI,CAAC,IAAI,EACxD,IAAI,CAAC,iBAAiB,CAACD,IAAIC,IAAIF,AAAS,MAATA,QAAcA,AAAS,MAATA;QACjD;IAEJ;IAIQ,qBAAqBpF,CAAM,EAAEC,CAAM,EAAQ;QACjD,IAAK,IAAIiF,KAAK,IAAIA,MAAM,GAAGA,KACzB,IAAK,IAAIC,KAAK,IAAIA,MAAM,GAAGA,KACzB,IAAI,CAAC,iBAAiB,CAACnF,IAAImF,IAAIlF,IAAIiF,IAAInC,AAAyC,MAAzCA,KAAK,GAAG,CAACA,KAAK,GAAG,CAACoC,KAAKpC,KAAK,GAAG,CAACmC;IAE7E;IAIQ,kBAAkBlF,CAAM,EAAEC,CAAM,EAAEsF,OAAgB,EAAQ;QAChE,IAAI,CAAC,OAAO,CAACtF,EAAE,CAACD,EAAE,GAAGuF;QACrB,IAAI,CAAC,UAAU,CAACtF,EAAE,CAACD,EAAE,GAAG;IAC1B;IAMQ,oBAAoBuD,IAAiB,EAAe;QAC1D,MAAMiC,MAAW,IAAI,CAAC,OAAO;QAC7B,MAAMpC,MAAiB,IAAI,CAAC,oBAAoB;QAChD,IAAIG,KAAK,MAAM,KAAKL,OAAO,mBAAmB,CAACsC,KAAKpC,MAAM,MAAM;QAGhE,MAAMqC,YAAiBvC,OAAO,2BAA2B,CAACE,IAAI,OAAO,CAAC,CAACoC,IAAI;QAC3E,MAAME,cAAmBxC,OAAO,uBAAuB,CAACE,IAAI,OAAO,CAAC,CAACoC,IAAI;QACzE,MAAMG,eAAoB5C,KAAK,KAAK,CAACG,OAAO,oBAAoB,CAACsC,OAAO;QACxE,MAAMI,iBAAsBH,YAAaE,eAAeF;QACxD,MAAMI,gBAAqB9C,KAAK,KAAK,CAAC4C,eAAeF;QAGrD,MAAMK,SAA6B,EAAE;QACrC,MAAMC,KAAK,IAAIC,qBAAqBN;QACpC,IAAK,IAAIlB,IAAI,GAAGyB,IAAI,GAAGzB,IAAIiB,WAAWjB,IAAK;YACzC,MAAM0B,MAAmB3C,KAAK,KAAK,CACjC0C,GACAA,IAAIJ,gBAAgBH,cAAelB,CAAAA,IAAIoB,iBAAiB,IAAI;YAE9DK,KAAKC,IAAI,MAAM;YACf,MAAMC,MAAmBJ,GAAG,YAAY,CAACG;YACzC,IAAI1B,IAAIoB,gBAAgBM,IAAI,IAAI,CAAC;YACjCJ,OAAO,IAAI,CAACI,IAAI,MAAM,CAACC;QACzB;QAGA,MAAMC,SAAsB,EAAE;QAC9B,IAAK,IAAI5B,IAAI,GAAGA,IAAIsB,MAAM,CAAC,EAAE,CAAC,MAAM,EAAEtB,IACpC,IAAK,IAAII,IAAI,GAAGA,IAAIkB,OAAO,MAAM,EAAElB,IAEjC,IAAIJ,MAAMqB,gBAAgBH,eAAed,KAAKgB,gBAAgBQ,OAAO,IAAI,CAACN,MAAM,CAAClB,EAAE,CAACJ,EAAE;QAG1F,IAAI4B,OAAO,MAAM,KAAKT,cAAc,MAAM;QAC1C,OAAOS;IACT;IAIQ,cAAc7C,IAAiB,EAAQ;QAC7C,IAAIA,KAAK,MAAM,KAAKR,KAAK,KAAK,CAACG,OAAO,oBAAoB,CAAC,IAAI,CAAC,OAAO,IAAI,IACzE,MAAM;QACR,IAAIsB,IAAS;QAEb,IAAK,IAAI6B,QAAQ,IAAI,CAAC,IAAI,GAAG,GAAGA,SAAS,GAAGA,SAAS,EAAG;YAEtD,IAAIA,AAAU,MAAVA,OAAaA,QAAQ;YACzB,IAAK,IAAIC,OAAO,GAAGA,OAAO,IAAI,CAAC,IAAI,EAAEA,OAEnC,IAAK,IAAI1B,IAAI,GAAGA,IAAI,GAAGA,IAAK;gBAC1B,MAAM5E,IAASqG,QAAQzB;gBACvB,MAAM2B,SAAmB,AAACF,CAAAA,QAAQ,IAAK,OAAO;gBAC9C,MAAMpG,IAASsG,SAAS,IAAI,CAAC,IAAI,GAAG,IAAID,OAAOA;gBAC/C,IAAI,CAAC,IAAI,CAAC,UAAU,CAACrG,EAAE,CAACD,EAAE,IAAIwE,IAAIjB,AAAc,IAAdA,KAAK,MAAM,EAAM;oBACjD,IAAI,CAAC,OAAO,CAACtD,EAAE,CAACD,EAAE,GAAG+E,OAAOxB,IAAI,CAACiB,MAAM,EAAE,EAAE,IAAKA,CAAAA,AAAI,IAAJA,CAAI;oBACpDA;gBACF;YAGF;QAEJ;QACA,IAAIA,MAAMjB,AAAc,IAAdA,KAAK,MAAM,EAAM,MAAM;IACnC;IAOQ,UAAUI,IAAS,EAAQ;QACjC,IAAIA,OAAO,KAAKA,OAAO,GAAG,MAAM;QAChC,IAAK,IAAI1D,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAC7B,IAAK,IAAID,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAK;YAClC,IAAIwG;YACJ,OAAQ7C;gBACN,KAAK;oBACH6C,SAAUxG,AAAAA,CAAAA,IAAIC,CAAAA,IAAK,MAAM;oBACzB;gBACF,KAAK;oBACHuG,SAASvG,IAAI,MAAM;oBACnB;gBACF,KAAK;oBACHuG,SAASxG,IAAI,MAAM;oBACnB;gBACF,KAAK;oBACHwG,SAAUxG,AAAAA,CAAAA,IAAIC,CAAAA,IAAK,MAAM;oBACzB;gBACF,KAAK;oBACHuG,SAAUzD,AAAAA,CAAAA,KAAK,KAAK,CAAC/C,IAAI,KAAK+C,KAAK,KAAK,CAAC9C,IAAI,EAAC,IAAK,MAAM;oBACzD;gBACF,KAAK;oBACHuG,SAAWxG,IAAIC,IAAK,IAAOD,IAAIC,IAAK,MAAO;oBAC3C;gBACF,KAAK;oBACHuG,SAAU,AAAExG,CAAAA,IAAIC,IAAK,IAAOD,IAAIC,IAAK,KAAM,MAAM;oBACjD;gBACF,KAAK;oBACHuG,SAAU,AAAExG,CAAAA,CAAAA,IAAIC,CAAAA,IAAK,IAAOD,IAAIC,IAAK,KAAM,MAAM;oBACjD;gBACF;oBACE,MAAM;YACV;YACA,IAAI,CAAC,IAAI,CAAC,UAAU,CAACA,EAAE,CAACD,EAAE,IAAIwG,QAAQ,IAAI,CAAC,OAAO,CAACvG,EAAE,CAACD,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAACC,EAAE,CAACD,EAAE;QAChF;IAEJ;IAIQ,kBAAuB;QAC7B,IAAIoG,SAAc;QAGlB,IAAK,IAAInG,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAK;YAClC,MAAMwG,aAAa;gBAAC;gBAAG;gBAAG;gBAAG;gBAAG;gBAAG;gBAAG;aAAE;YACxC,IAAIzB,QAAQ;YACZ,IAAI0B,OAAO;YACX,IAAK,IAAI1G,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAC7B,IAAI,IAAI,CAAC,OAAO,CAACC,EAAE,CAACD,EAAE,KAAKgF,OAAO;gBAChC0B;gBACA,IAAIA,AAAS,MAATA,MAAYN,UAAUlD,OAAO,UAAU;qBACtC,IAAIwD,OAAO,GAAGN;YACrB,OAAO;gBACLlD,OAAO,eAAe,CAACwD,MAAMD;gBAC7B,IAAI,CAACzB,SAAS9B,OAAO,oBAAoB,CAACuD,aAAaL,UAAUlD,OAAO,UAAU;gBAClF8B,QAAQ,IAAI,CAAC,OAAO,CAAC/E,EAAE,CAACD,EAAE;gBAC1B0G,OAAO;YACT;YAEFxD,OAAO,eAAe,CAACwD,MAAMD;YAC7B,IAAIzB,OAAO9B,OAAO,eAAe,CAAC,GAAGuD;YACrC,IAAIvD,OAAO,oBAAoB,CAACuD,aAAaL,UAAUlD,OAAO,UAAU;QAC1E;QAEA,IAAK,IAAIlD,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAK;YAClC,MAAMyG,aAAa;gBAAC;gBAAG;gBAAG;gBAAG;gBAAG;gBAAG;gBAAG;aAAE;YACxC,IAAIzB,QAAQ;YACZ,IAAI2B,OAAO;YACX,IAAK,IAAI1G,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAC7B,IAAI,IAAI,CAAC,OAAO,CAACA,EAAE,CAACD,EAAE,KAAKgF,OAAO;gBAChC2B;gBACA,IAAIA,AAAS,MAATA,MAAYP,UAAUlD,OAAO,UAAU;qBACtC,IAAIyD,OAAO,GAAGP;YACrB,OAAO;gBACLlD,OAAO,eAAe,CAACyD,MAAMF;gBAC7B,IAAI,CAACzB,SAAS9B,OAAO,oBAAoB,CAACuD,aAAaL,UAAUlD,OAAO,UAAU;gBAClF8B,QAAQ,IAAI,CAAC,OAAO,CAAC/E,EAAE,CAACD,EAAE;gBAC1B2G,OAAO;YACT;YAEFzD,OAAO,eAAe,CAACyD,MAAMF;YAC7B,IAAIzB,OAAO9B,OAAO,eAAe,CAAC,GAAGuD;YACrC,IAAIvD,OAAO,oBAAoB,CAACuD,aAAaL,UAAUlD,OAAO,UAAU;QAC1E;QAGA,IAAK,IAAIjD,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,GAAG,GAAGA,IACjC,IAAK,IAAID,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,GAAG,GAAGA,IAAK;YACtC,MAAMgF,QAAiB,IAAI,CAAC,OAAO,CAAC/E,EAAE,CAACD,EAAE;YACzC,IACEgF,UAAU,IAAI,CAAC,OAAO,CAAC/E,EAAE,CAACD,IAAI,EAAE,IAChCgF,UAAU,IAAI,CAAC,OAAO,CAAC/E,IAAI,EAAE,CAACD,EAAE,IAChCgF,UAAU,IAAI,CAAC,OAAO,CAAC/E,IAAI,EAAE,CAACD,IAAI,EAAE,EAEpCoG,UAAUlD,OAAO,UAAU;QAC/B;QAIF,IAAI0D,QAAa;QACjB,KAAK,MAAMC,OAAO,IAAI,CAAC,OAAO,CAC5B,KAAK,MAAM7B,SAAS6B,IAClB,IAAI7B,OAAO4B;QAGf,MAAME,QAAa,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;QAExC,MAAMb,IAASlD,KAAK,IAAI,CAACA,KAAK,GAAG,CAAC6D,AAAQ,KAARA,QAAaE,AAAQ,KAARA,SAAcA,SAAS;QACtEV,UAAUH,IAAI/C,OAAO,UAAU;QAC/B,OAAOkD;IACT;IAOQ,+BAA2C;QACjD,IAAI,AAAiB,MAAjB,IAAI,CAAC,OAAO,EAAQ,OAAO,EAAE;QAC5B;YACH,MAAMzB,WAAgB5B,KAAK,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK;YACrD,MAAMgE,OACJ,AAAiB,OAAjB,IAAI,CAAC,OAAO,GAAU,KAAKhE,AAAmD,IAAnDA,KAAK,IAAI,CAAE,KAAI,CAAC,IAAI,GAAG,EAAC,IAAM4B,CAAAA,AAAW,IAAXA,WAAe;YAC1E,MAAMyB,SAAqB;gBAAC;aAAE;YAC9B,IAAK,IAAIY,MAAM,IAAI,CAAC,IAAI,GAAG,GAAGZ,OAAO,MAAM,GAAGzB,UAAUqC,OAAOD,KAAMX,OAAO,MAAM,CAAC,GAAG,GAAGY;YACzF,OAAOZ;QACT;IACF;IAKA,OAAe,qBAAqBZ,GAAQ,EAAO;QACjD,IAAIA,MAAMtC,OAAO,WAAW,IAAIsC,MAAMtC,OAAO,WAAW,EAAE,MAAM;QAChE,IAAIkD,SAAe,MAAKZ,MAAM,GAAE,IAAKA,MAAM;QAC3C,IAAIA,OAAO,GAAG;YACZ,MAAMb,WAAgB5B,KAAK,KAAK,CAACyC,MAAM,KAAK;YAC5CY,UAAW,MAAKzB,WAAW,EAAC,IAAKA,WAAW;YAC5C,IAAIa,OAAO,GAAGY,UAAU;QAC1B;QACA,OAAOA;IACT;IAKA,OAAe,oBAAoBZ,GAAQ,EAAEpC,GAAc,EAAO;QAChE,OACEL,KAAK,KAAK,CAACG,OAAO,oBAAoB,CAACsC,OAAO,KAC9CtC,OAAO,uBAAuB,CAACE,IAAI,OAAO,CAAC,CAACoC,IAAI,GAC9CtC,OAAO,2BAA2B,CAACE,IAAI,OAAO,CAAC,CAACoC,IAAI;IAE1D;IAIA,OAAe,gBAAgByB,GAAQ,EAAEC,OAAmB,EAAQ;QAClEA,QAAQ,GAAG;QACXA,QAAQ,OAAO,CAACD;IAClB;IAKA,OAAe,qBAAqBR,UAAsB,EAAW;QACnE,MAAMU,IAASV,UAAU,CAAC,EAAE;QAC5B,OACEU,IAAI,KACJV,UAAU,CAAC,EAAE,KAAKU,KAClBV,UAAU,CAAC,EAAE,KAAKU,KAClBV,UAAU,CAAC,EAAE,KAAKU,KAClBV,UAAU,CAAC,EAAE,KAAKU,AAAI,IAAJA,KAClBpE,KAAK,GAAG,CAAC0D,UAAU,CAAC,EAAE,EAAEA,UAAU,CAAC,EAAE,KAAKU,AAAI,IAAJA;IAE9C;IA3bA,YACEtD,OAAY,EACZuD,oBAA+B,EAC/B7C,aAA0B,EAC1BZ,IAAS,CACT;QAhCF,yBAAgB,QAAhB;QAIA,yBAAgB,WAAiC,EAAE;QAGnD,yBAAiB,cAAoC,EAAE;QAMvD,yBAAgB,WAAhB;QAGA,yBAAgB,wBAAhB;QAKA,yBAAgB,QAAhB;QAaE,IAAIE,UAAUX,OAAO,WAAW,IAAIW,UAAUX,OAAO,WAAW,EAC9D,MAAM;QACR,IAAIS,OAAO,MAAMA,OAAO,GAAG,MAAM;QACjC,IAAI,CAAC,OAAO,GAAGE;QACf,IAAI,CAAC,oBAAoB,GAAGuD;QAC5B,IAAI,CAAC,IAAI,GAAGvD,AAAU,IAAVA,UAAc;QAG1B,MAAMgD,MAAsB,EAAE;QAC9B,IAAK,IAAIrC,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAKqC,IAAI,IAAI,CAAC;QAC7C,IAAK,IAAIrC,IAAI,GAAGA,IAAI,IAAI,CAAC,IAAI,EAAEA,IAAK;YAClC,IAAI,CAAC,OAAO,CAAC,IAAI,CAACqC,IAAI,KAAK;YAC3B,IAAI,CAAC,UAAU,CAAC,IAAI,CAACA,IAAI,KAAK;QAChC;QAGA,IAAI,CAAC,oBAAoB;QACzB,MAAMQ,eAA4B,IAAI,CAAC,mBAAmB,CAAC9C;QAC3D,IAAI,CAAC,aAAa,CAAC8C;QAGnB,IAAI1D,AAAS,OAATA,MAAa;YAEf,IAAI2D,aAAkB;YACtB,IAAK,IAAI9C,IAAI,GAAGA,IAAI,GAAGA,IAAK;gBAC1B,IAAI,CAAC,SAAS,CAACA;gBACf,IAAI,CAAC,cAAc,CAACA;gBACpB,MAAM+C,UAAe,IAAI,CAAC,eAAe;gBACzC,IAAIA,UAAUD,YAAY;oBACxB3D,OAAOa;oBACP8C,aAAaC;gBACf;gBACA,IAAI,CAAC,SAAS,CAAC/C;YACjB;QACF;QACA,IAAIb,OAAO,KAAKA,OAAO,GAAG,MAAM;QAChC,IAAI,CAAC,IAAI,GAAGA;QACZ,IAAI,CAAC,SAAS,CAACA;QACf,IAAI,CAAC,cAAc,CAACA;QAEpB,IAAI,CAAC,UAAU,GAAG,EAAE;IACtB;AA+cF;AA/DE,mBAvkBWT,QAukBY,eAAmB;AAE1C,mBAzkBWA,QAykBY,eAAmB;AAG1C,mBA5kBWA,QA4kBa,cAAkB;AAC1C,mBA7kBWA,QA6kBa,cAAkB;AAC1C,mBA9kBWA,QA8kBa,cAAkB;AAC1C,mBA/kBWA,QA+kBa,cAAkB;AAE1C,mBAjlBWA,QAilBa,2BAA6C;IAKnE;QACE;QAAI;QAAG;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAC3F;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACjE;IAED;QACE;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QACxF;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACrE;IAED;QACE;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QACxF;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACrE;IAED;QACE;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QACxF;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACrE;CAEF;AAED,mBA5mBWA,QA4mBa,+BAAiD;IAKvE;QACE;QAAI;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAI;QAAI;QAAI;QAAI;QACzF;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KAC7C;IAED;QACE;QAAI;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAC1F;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACrD;IAED;QACE;QAAI;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QACzF;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACzD;IAED;QACE;QAAI;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAG;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAC1F;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;QAAI;KACzD;CAEF;AAIH,SAAS6B,OAAO/E,CAAM,EAAEwE,CAAM;IAC5B,OAAQ,AAACxE,CAAAA,MAAMwE,IAAK,OAAO;AAC7B;AAeO,MAAMlB;IAMX,OAAc,UAAUC,IAAiB,EAAa;QACpD,MAAMY,KAAK,IAAIC;QACf,KAAK,MAAMC,KAAKd,KAAMY,GAAG,UAAU,CAACE,GAAG;QACvC,OAAO,IAAIf,UAAUkE,cAAc,IAAI,EAAEjE,KAAK,MAAM,EAAEY,GAAG,KAAK;IAChE;IAGA,OAAc,YAAYsD,MAAc,EAAa;QACnD,IAAI,CAACnE,UAAU,aAAa,CAAC,IAAI,CAACmE,SAAS,MAAM;QACjD,MAAMtD,KAAK,IAAIC;QACf,IAAK,IAAII,IAAI,GAAGA,IAAIiD,OAAO,MAAM,EAAI;YAEnC,MAAMN,IAASpE,KAAK,GAAG,CAAC0E,OAAO,MAAM,GAAGjD,GAAG;YAC3CL,GAAG,UAAU,CAACuD,SAASD,OAAO,MAAM,CAACjD,GAAG2C,IAAI,KAAKA,AAAI,IAAJA,IAAQ;YACzD3C,KAAK2C;QACP;QACA,OAAO,IAAI7D,UAAUkE,cAAc,OAAO,EAAEC,OAAO,MAAM,EAAEtD,GAAG,KAAK;IACrE;IAKA,OAAc,iBAAiBhB,IAAY,EAAa;QACtD,IAAI,CAACG,UAAU,kBAAkB,CAAC,IAAI,CAACH,OACrC,MAAM;QACR,MAAMgB,KAAK,IAAIC;QACf,IAAII;QACJ,IAAKA,IAAI,GAAGA,IAAI,KAAKrB,KAAK,MAAM,EAAEqB,KAAK,EAAG;YAExC,IAAImD,OAAYrE,AAAyD,KAAzDA,UAAU,oBAAoB,CAAC,OAAO,CAACH,KAAK,MAAM,CAACqB;YACnEmD,QAAQrE,UAAU,oBAAoB,CAAC,OAAO,CAACH,KAAK,MAAM,CAACqB,IAAI;YAC/DL,GAAG,UAAU,CAACwD,MAAM;QACtB;QACA,IAAInD,IAAIrB,KAAK,MAAM,EAEjBgB,GAAG,UAAU,CAACb,UAAU,oBAAoB,CAAC,OAAO,CAACH,KAAK,MAAM,CAACqB,KAAK;QACxE,OAAO,IAAIlB,UAAUkE,cAAc,YAAY,EAAErE,KAAK,MAAM,EAAEgB,GAAG,KAAK;IACxE;IAIA,OAAc,aAAahB,IAAY,EAAoB;QAEzD,IAAIA,AAAS,OAATA,MAAa,OAAO,EAAE;QACrB,IAAIG,UAAU,aAAa,CAAC,IAAI,CAACH,OAAO,OAAO;YAACG,UAAU,WAAW,CAACH;SAAM;QAC5E,IAAIG,UAAU,kBAAkB,CAAC,IAAI,CAACH,OAAO,OAAO;YAACG,UAAU,gBAAgB,CAACH;SAAM;QACtF,OAAO;YAACG,UAAU,SAAS,CAACA,UAAU,eAAe,CAACH;SAAO;IACpE;IAIA,OAAc,QAAQyE,SAAc,EAAa;QAC/C,MAAMzD,KAAK,IAAIC;QACf,IAAIwD,YAAY,GAAG,MAAM;QACpB,IAAIA,YAAY,KAAQzD,GAAG,UAAU,CAACyD,WAAW;aACjD,IAAIA,YAAY,OAAS;YAC5BzD,GAAG,UAAU,CAAC,GAAG;YACjBA,GAAG,UAAU,CAACyD,WAAW;QAC3B,OAAO,IAAIA,YAAY,SAAS;YAC9BzD,GAAG,UAAU,CAAC,GAAG;YACjBA,GAAG,UAAU,CAACyD,WAAW;QAC3B,OAAO,MAAM;QACb,OAAO,IAAItE,UAAUkE,cAAc,GAAG,EAAE,GAAGrD,GAAG,KAAK;IACrD;IA4BO,UAAsB;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK;IAC3B;IAIA,OAAc,aAAad,IAAsB,EAAEQ,OAAY,EAAU;QACvE,IAAIuC,SAAiB;QACrB,KAAK,MAAM5C,OAAOH,KAAM;YACtB,MAAMwE,SAAcrE,IAAI,IAAI,CAAC,gBAAgB,CAACK;YAC9C,IAAIL,IAAI,QAAQ,IAAI,KAAKqE,QAAQ,OAAOC;YACxC1B,UAAU,IAAIyB,SAASrE,IAAI,OAAO,CAAC,MAAM;QAC3C;QACA,OAAO4C;IACT;IAGA,OAAe,gBAAgB2B,GAAW,EAAe;QACvDA,MAAMC,UAAUD;QAChB,MAAM3B,SAAsB,EAAE;QAC9B,IAAK,IAAI5B,IAAI,GAAGA,IAAIuD,IAAI,MAAM,EAAEvD,IAC9B,IAAIuD,AAAkB,QAAlBA,IAAI,MAAM,CAACvD,IAAY4B,OAAO,IAAI,CAAC2B,IAAI,UAAU,CAACvD;aACjD;YACH4B,OAAO,IAAI,CAACsB,SAASK,IAAI,MAAM,CAACvD,IAAI,GAAG,IAAI;YAC3CA,KAAK;QACP;QAEF,OAAO4B;IACT;IAtCA,YAAmB6B,IAAmB,EAAEC,QAAa,EAAEC,OAAmB,CAAE;QAb5E,yBAAgB,QAAhB;QAKA,yBAAgB,YAAhB;QAGA,yBAAiB,WAAjB;QAME,IAAID,WAAW,GAAG,MAAM;QACxB,IAAI,CAAC,IAAI,GAAGD;QACZ,IAAI,CAAC,QAAQ,GAAGC;QAChB,IAAI,CAAC,OAAO,GAAGC,QAAQ,KAAK;IAC9B;AAoDF;AAZE,mBApIW7E,WAoIY,iBAAwB;AAM/C,mBA1IWA,WA0IY,sBAA6B;AAIpD,mBA9IWA,WA8Ia,wBACtB;AAUJ,MAAM0C;IAgCG,aAAazC,IAAiB,EAAe;QAElD,MAAM6C,SAAsB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAACgC,IAAM;QACzD,KAAK,MAAM/D,KAAKd,KAAM;YACpB,MAAM8E,SAAehE,IAAK+B,OAAO,KAAK;YACtCA,OAAO,IAAI,CAAC;YACZ,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAACkC,MAAM9D;gBAC/B4B,MAAM,CAAC5B,EAAE,IAAIwB,qBAAqB,QAAQ,CAACsC,MAAMD;YACnD;QACF;QACA,OAAOjC;IACT;IAIA,OAAe,SAASpG,CAAO,EAAEC,CAAO,EAAQ;QAC9C,IAAID,MAAM,MAAM,KAAKC,MAAM,MAAM,GAAG,MAAM;QAE1C,IAAIsI,IAAS;QACb,IAAK,IAAI/D,IAAI,GAAGA,KAAK,GAAGA,IAAK;YAC3B+D,IAAKA,KAAK,IAAOA,AAAAA,CAAAA,MAAM,KAAK;YAC5BA,KAAM,AAACtI,CAAAA,MAAMuE,IAAK,KAAKxE;QACzB;QACA,IAAIuI,MAAM,MAAM,GAAG,MAAM;QACzB,OAAOA;IACT;IAlDA,YAAmBC,MAAW,CAAE;QAJhC,yBAAiB,gBAA4B,EAAE;QAK7C,IAAIA,SAAS,KAAKA,SAAS,KAAK,MAAM;QACtC,MAAMC,QAAQ,IAAI,CAAC,YAAY;QAG/B,IAAK,IAAIjE,IAAI,GAAGA,IAAIgE,SAAS,GAAGhE,IAAKiE,MAAM,IAAI,CAAC;QAChDA,MAAM,IAAI,CAAC;QAKX,IAAIC,OAAO;QACX,IAAK,IAAIlE,IAAI,GAAGA,IAAIgE,QAAQhE,IAAK;YAE/B,IAAK,IAAII,IAAI,GAAGA,IAAI6D,MAAM,MAAM,EAAE7D,IAAK;gBACrC6D,KAAK,CAAC7D,EAAE,GAAGoB,qBAAqB,QAAQ,CAACyC,KAAK,CAAC7D,EAAE,EAAE8D;gBACnD,IAAI9D,IAAI,IAAI6D,MAAM,MAAM,EAAEA,KAAK,CAAC7D,EAAE,IAAI6D,KAAK,CAAC7D,IAAI,EAAE;YACpD;YACA8D,OAAO1C,qBAAqB,QAAQ,CAAC0C,MAAM;QAC7C;IACF;AA+BF;AAMA,MAAMtE;IAKG,WAAWuE,GAAQ,EAAEC,GAAQ,EAAQ;QAC1C,IAAIA,MAAM,KAAKA,MAAM,MAAMD,QAAQC,QAAQ,GAAG,MAAM;QACpD,IACE,IAAIpE,IAAIoE,MAAM,GACdpE,KAAK,GACLA,IAEA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAEmE,QAAQnE,IAAK;IAClC;;QAZA,yBAAO,SAAoB,EAAE;;AAa/B;AAOO,MAAMN;IAeX,YAAoB2E,OAAY,EAAEC,UAAe,CAAE;QAJnD,yBAAgB,WAAhB;QAEA,yBAAgB,cAAhB;QAGE,IAAI,CAAC,OAAO,GAAGD;QACf,IAAI,CAAC,UAAU,GAAGC;IACpB;AACF;AAhBE,mBAHW5E,WAGY,OAAM,IAAIA,UAAU,GAAG;AAC9C,mBAJWA,WAIY,UAAS,IAAIA,UAAU,GAAG;AACjD,mBALWA,WAKY,YAAW,IAAIA,UAAU,GAAG;AACnD,mBANWA,WAMY,QAAO,IAAIA,UAAU,GAAG;AAoB1C,MAAMsD;IAyBJ,iBAAiBhC,GAAQ,EAAO;QACrC,OAAO,IAAI,CAAC,gBAAgB,CAACzC,KAAK,KAAK,CAAEyC,AAAAA,CAAAA,MAAM,KAAK,IAAI;IAC1D;IAXA,YAAoBuD,QAAa,EAAEC,gBAAiC,CAAE;QAJtE,yBAAgB,YAAhB;QAEA,yBAAiB,oBAAjB;QAGE,IAAI,CAAC,QAAQ,GAAGD;QAChB,IAAI,CAAC,gBAAgB,GAAGC;IAC1B;AASF;AAzBE,mBAHWxB,eAGY,WAAU,IAAIA,cAAc,KAAK;IAAC;IAAI;IAAI;CAAG;AACpE,mBAJWA,eAIY,gBAAe,IAAIA,cAAc,KAAK;IAAC;IAAG;IAAI;CAAG;AACxE,mBALWA,eAKY,QAAO,IAAIA,cAAc,KAAK;IAAC;IAAG;IAAI;CAAG;AAChE,mBANWA,eAMY,SAAQ,IAAIA,cAAc,KAAK;IAAC;IAAG;IAAI;CAAG;AACjE,mBAPWA,eAOY,OAAM,IAAIA,cAAc,KAAK;IAAC;IAAG;IAAG;CAAE;ACj9B/D,MAAMyB,eAAe;AAGrB,MAAMC,2BAA2B;AAGjC,MAAMC,2BAA2B;AAGjC,MAAMC,qBAAqB;AA2BpB,SAASC,SACdlG,IAAY,EACZmG,eAAoC,EACpCC,eAAwB,EACxBC,aAAyB;IAEzB,IAAI,AAAgB,YAAhB,OAAOrG,MACT,MAAM,IAAIsG,UAAU;IAItB,MAAM/I,UAAqB;QACzB,GAAI,AAA2B,YAA3B,OAAO4I,mBAAgCA,AAAoB,SAApBA,kBAA2BA,kBAAkB,CAAC,CAAC;QAC1F,GAAI,AAAyB,YAAzB,OAAOE,iBAA8BA,AAAkB,SAAlBA,gBAAyBA,gBAAgB,CAAC,CAAC;QACpF,QACE,AAA2B,YAA3B,OAAOF,mBACPA,AAAoB,SAApBA,mBACA,AAAkC,YAAlC,OAAOA,gBAAgB,MAAM,GACzBA,gBAAgB,MAAM,GACrBA;QACP,WACE,AAA2B,YAA3B,OAAOA,mBACPA,AAAoB,SAApBA,mBACA,AAAqC,YAArC,OAAOA,gBAAgB,SAAS,GAC5BA,gBAAgB,SAAS,GACzBC;IACR;IAGA,MAAMG,YAAY;QAACxF,UAAU,GAAG;QAAEA,UAAU,MAAM;QAAEA,UAAU,QAAQ;QAAEA,UAAU,IAAI;KAAC;IAGvF,MAAMyF,kBAAqC;QACzC,QAAQ,AAA0B,YAA1B,OAAOjJ,QAAQ,MAAM,GAAgBA,QAAQ,MAAM,GAAGuI;QAC9D,WAAW,AAA6B,YAA7B,OAAOvI,QAAQ,SAAS,GAAgBA,QAAQ,SAAS,GAAG6I,mBAAmB;QAC1F,YAAY,CAAC,CAAC7I,QAAQ,UAAU,IAAI;QACpC,kBAAkB,CAAC,CAACA,QAAQ,gBAAgB,IAAI;QAChD,iBACE,AAAmC,YAAnC,OAAOA,QAAQ,eAAe,GAC1BA,QAAQ,eAAe,GACvByI;QACN,iBACE,AAAmC,YAAnC,OAAOzI,QAAQ,eAAe,GAC1BA,QAAQ,eAAe,GACvBwI;QACN,WAAW,AAA6B,YAA7B,OAAOxI,QAAQ,SAAS,GAAgBA,QAAQ,SAAS,GAAG0I;QACvE,QAAQ1I,QAAQ,MAAM,GAAGA,QAAQ,MAAM,CAAC,QAAQ,KAAK;QACrD,UAAU,AAA4B,YAA5B,OAAOA,QAAQ,QAAQ,GAAgBA,QAAQ,QAAQ,GAAG;QACpE,KAAK,AAAuB,YAAvB,OAAOA,QAAQ,GAAG,IAAiBgJ,SAAS,CAAChJ,QAAQ,GAAG,CAAC,GAAGA,QAAQ,GAAG,GAAG;QAC/E,aAAa,AAA+B,YAA/B,OAAOA,QAAQ,WAAW,GAAgBA,QAAQ,WAAW,GAAGkJ;IAC/E;IAGA,MAAMC,WAAwBvG,UAAU,YAAY,CAACH;IACrD,MAAM1C,SAAiByC,OAAO,cAAc,CAC1C2G,UACAH,SAAS,CAACC,gBAAgB,GAAG,CAAC,EAC9B,GACA,IACA,IACA;IAEF,MAAMG,UAAUtJ,2BAA2BC,QAAQkJ;IAEnD,OAAOG;AACT"}

package/dist/{types/qr.d.ts → qr.d.ts}

@@ -1,87 +1,79 @@
-declare type bit = number;
-declare type byte = number;
-declare type int = number;
-export declare class QrCode {
-    readonly version: int;
-    readonly errorCorrectionLevel: QrCode.Ecc;
-    readonly mask: int;
-    static encodeText(text: string, ecl: QrCode.Ecc): QrCode;
-    static encodeBinary(data: Array<byte>, ecl: QrCode.Ecc): QrCode;
-    static encodeSegments(segs: Array<QrSegment>, ecl: QrCode.Ecc, minVersion?: int, maxVersion?: int, mask?: int, boostEcl?: boolean): QrCode;
-    readonly size: int;
-    readonly modules: Array<Array<boolean>>;
-    private readonly isFunction;
-    constructor(version: int, errorCorrectionLevel: QrCode.Ecc, dataCodewords: Array<byte>, mask: int);
-    getModule(x: int, y: int): boolean;
-    drawCanvas(scale: int, border: int, canvas: HTMLCanvasElement): void;
-    toSvgString(border: int): string;
-    private drawFunctionPatterns;
-    private drawFormatBits;
-    private drawVersion;
-    private drawFinderPattern;
-    private drawAlignmentPattern;
-    private setFunctionModule;
-    private addEccAndInterleave;
-    private drawCodewords;
-    private applyMask;
-    private getPenaltyScore;
-    private getAlignmentPatternPositions;
-    private static getNumRawDataModules;
-    private static getNumDataCodewords;
-    private static addRunToHistory;
-    private static hasFinderLikePattern;
-    static readonly MIN_VERSION: int;
-    static readonly MAX_VERSION: int;
-    private static readonly PENALTY_N1;
-    private static readonly PENALTY_N2;
-    private static readonly PENALTY_N3;
-    private static readonly PENALTY_N4;
-    private static readonly ECC_CODEWORDS_PER_BLOCK;
-    private static readonly NUM_ERROR_CORRECTION_BLOCKS;
-}
-export declare class QrSegment {
-    readonly mode: QrSegment.Mode;
-    readonly numChars: int;
-    private readonly bitData;
-    static makeBytes(data: Array<byte>): QrSegment;
-    static makeNumeric(digits: string): QrSegment;
-    static makeAlphanumeric(text: string): QrSegment;
-    static makeSegments(text: string): Array<QrSegment>;
-    static makeEci(assignVal: int): QrSegment;
-    constructor(mode: QrSegment.Mode, numChars: int, bitData: Array<bit>);
-    getData(): Array<bit>;
-    static getTotalBits(segs: Array<QrSegment>, version: int): number;
-    private static toUtf8ByteArray;
-    static readonly NUMERIC_REGEX: RegExp;
-    static readonly ALPHANUMERIC_REGEX: RegExp;
-    private static readonly ALPHANUMERIC_CHARSET;
-}
-export declare namespace QrCode {
-    type int = number;
-    export class Ecc {
-        readonly ordinal: int;
-        readonly formatBits: int;
-        static readonly LOW: Ecc;
-        static readonly MEDIUM: Ecc;
-        static readonly QUARTILE: Ecc;
-        static readonly HIGH: Ecc;
-        private constructor();
-    }
-    export {};
-}
-export declare namespace QrSegment {
-    type int = number;
-    export class Mode {
-        readonly modeBits: int;
-        private readonly numBitsCharCount;
-        static readonly NUMERIC: Mode;
-        static readonly ALPHANUMERIC: Mode;
-        static readonly BYTE: Mode;
-        static readonly KANJI: Mode;
-        static readonly ECI: Mode;
-        private constructor();
-        numCharCountBits(ver: int): int;
-    }
-    export {};
-}
-export {};
+type bit = number;
+type byte = number;
+type int = number;
+export declare class QrCode {
+    static encodeText(text: string, ecl: QrCodeEcc): QrCode;
+    static encodeBinary(data: Array<byte>, ecl: QrCodeEcc): QrCode;
+    static encodeSegments(segs: Array<QrSegment>, ecl: QrCodeEcc, minVersion?: int, maxVersion?: int, mask?: int, boostEcl?: boolean): QrCode;
+    readonly size: int;
+    readonly modules: Array<Array<boolean>>;
+    private readonly isFunction;
+    readonly version: int;
+    readonly errorCorrectionLevel: QrCodeEcc;
+    readonly mask: int;
+    constructor(version: int, errorCorrectionLevel: QrCodeEcc, dataCodewords: Array<byte>, mask: int);
+    getModule(x: int, y: int): boolean;
+    toSvgString(border: int): string;
+    private drawFunctionPatterns;
+    private drawFormatBits;
+    private drawVersion;
+    private drawFinderPattern;
+    private drawAlignmentPattern;
+    private setFunctionModule;
+    private addEccAndInterleave;
+    private drawCodewords;
+    private applyMask;
+    private getPenaltyScore;
+    private getAlignmentPatternPositions;
+    private static getNumRawDataModules;
+    private static getNumDataCodewords;
+    private static addRunToHistory;
+    private static hasFinderLikePattern;
+    static readonly MIN_VERSION: int;
+    static readonly MAX_VERSION: int;
+    private static readonly PENALTY_N1;
+    private static readonly PENALTY_N2;
+    private static readonly PENALTY_N3;
+    private static readonly PENALTY_N4;
+    private static readonly ECC_CODEWORDS_PER_BLOCK;
+    private static readonly NUM_ERROR_CORRECTION_BLOCKS;
+}
+export declare class QrSegment {
+    static makeBytes(data: Array<byte>): QrSegment;
+    static makeNumeric(digits: string): QrSegment;
+    static makeAlphanumeric(text: string): QrSegment;
+    static makeSegments(text: string): Array<QrSegment>;
+    static makeEci(assignVal: int): QrSegment;
+    readonly mode: QrSegmentMode;
+    readonly numChars: int;
+    private readonly bitData;
+    constructor(mode: QrSegmentMode, numChars: int, bitData: Array<bit>);
+    getData(): Array<bit>;
+    static getTotalBits(segs: Array<QrSegment>, version: int): number;
+    private static toUtf8ByteArray;
+    static readonly NUMERIC_REGEX: RegExp;
+    static readonly ALPHANUMERIC_REGEX: RegExp;
+    private static readonly ALPHANUMERIC_CHARSET;
+}
+export declare class QrCodeEcc {
+    static readonly LOW: QrCodeEcc;
+    static readonly MEDIUM: QrCodeEcc;
+    static readonly QUARTILE: QrCodeEcc;
+    static readonly HIGH: QrCodeEcc;
+    readonly ordinal: int;
+    readonly formatBits: int;
+    private constructor();
+}
+export declare class QrSegmentMode {
+    static readonly NUMERIC: QrSegmentMode;
+    static readonly ALPHANUMERIC: QrSegmentMode;
+    static readonly BYTE: QrSegmentMode;
+    static readonly KANJI: QrSegmentMode;
+    static readonly ECI: QrSegmentMode;
+    readonly modeBits: int;
+    private readonly numBitsCharCount;
+    private constructor();
+    numCharCountBits(ver: int): int;
+}
+export {};
+//# sourceMappingURL=qr.d.ts.map

package/dist/qr.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"qr.d.ts","sourceRoot":"","sources":["../src/qr.ts"],"names":[],"mappings":"AAuBA,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,IAAI,GAAG,MAAM,CAAC;AACnB,KAAK,GAAG,GAAG,MAAM,CAAC;AAoBlB,qBAAa,MAAM;WAQH,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM;WAShD,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM;WAgBvD,cAAc,CAC1B,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,EACtB,GAAG,EAAE,SAAS,EACd,UAAU,GAAE,GAAO,EACnB,UAAU,GAAE,GAAQ,EACpB,IAAI,GAAE,GAAQ,EACd,QAAQ,GAAE,OAAc,GACvB,MAAM;IAoET,SAAgB,IAAI,EAAE,GAAG,CAAC;IAI1B,SAAgB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAM;IAGpD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IAMxD,SAAgB,OAAO,EAAE,GAAG,CAAC;IAG7B,SAAgB,oBAAoB,EAAE,SAAS,CAAC;IAKhD,SAAgB,IAAI,EAAE,GAAG,CAAC;gBAOxB,OAAO,EAAE,GAAG,EACZ,oBAAoB,EAAE,SAAS,EAC/B,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,EAC1B,IAAI,EAAE,GAAG;IAmDJ,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,OAAO;IAQlC,WAAW,CAAC,MAAM,EAAE,GAAG,GAAG,MAAM;IAsBvC,OAAO,CAAC,oBAAoB;IAoC5B,OAAO,CAAC,cAAc;IAuBtB,OAAO,CAAC,WAAW;IAqBnB,OAAO,CAAC,iBAAiB;IAczB,OAAO,CAAC,oBAAoB;IAS5B,OAAO,CAAC,iBAAiB;IASzB,OAAO,CAAC,mBAAmB;IAwC3B,OAAO,CAAC,aAAa;IA+BrB,OAAO,CAAC,SAAS;IAwCjB,OAAO,CAAC,eAAe;IA8EvB,OAAO,CAAC,4BAA4B;IAepC,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAcnC,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAUlC,OAAO,CAAC,MAAM,CAAC,eAAe;IAQ9B,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAenC,gBAAuB,WAAW,EAAE,GAAG,CAAK;IAE5C,gBAAuB,WAAW,EAAE,GAAG,CAAM;IAG7C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAU;IAC5C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAU;IAC5C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAW;IAC7C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAW;IAE7C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,uBAAuB,CAyB7C;IAEF,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,2BAA2B,CAyBjD;CACH;AAoBD,qBAAa,SAAS;WAMN,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS;WAOvC,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS;WAetC,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS;WAmBzC,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC;WAU5C,OAAO,CAAC,SAAS,EAAE,GAAG,GAAG,SAAS;IAiBhD,SAAgB,IAAI,EAAE,aAAa,CAAC;IAKpC,SAAgB,QAAQ,EAAE,GAAG,CAAC;IAG9B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAa;gBAKlB,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC;IAUnE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC;WAMd,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,GAAG,GAAG,MAAM;IAWxE,OAAO,CAAC,MAAM,CAAC,eAAe;IAkB9B,gBAAuB,aAAa,EAAE,MAAM,CAAc;IAM1D,gBAAuB,kBAAkB,EAAE,MAAM,CAA0B;IAI3E,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,oBAAoB,CACM;CACnD;AA8FD,qBAAa,SAAS;IAGpB,gBAAuB,GAAG,YAAuB;IACjD,gBAAuB,MAAM,YAAuB;IACpD,gBAAuB,QAAQ,YAAuB;IACtD,gBAAuB,IAAI,YAAuB;IAKlD,SAAgB,OAAO,EAAE,GAAG,CAAC;IAE7B,SAAgB,UAAU,EAAE,GAAG,CAAC;IAEhC,OAAO;CAIR;AAOD,qBAAa,aAAa;IAGxB,gBAAuB,OAAO,gBAAwC;IACtE,gBAAuB,YAAY,gBAAuC;IAC1E,gBAAuB,IAAI,gBAAuC;IAClE,gBAAuB,KAAK,gBAAuC;IACnE,gBAAuB,GAAG,gBAAqC;IAK/D,SAAgB,QAAQ,EAAE,GAAG,CAAC;IAE9B,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAkB;IAEnD,OAAO;IASA,gBAAgB,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;CAGvC"}

package/dist/svg.d.ts

@@ -0,0 +1,10 @@
+import type { QrCode } from './qr.ts';
+import type { RequiredQrOptions } from './types.ts';
+export declare const INC_TILE_SIZE: number;
+/**
+ * Converts QrCode instance to SVG code
+ * @param qrCode QrCode instance
+ * @param options Convertation options
+ */
+export declare const convertSegmentsToSvgString: (qrCode: QrCode, options: RequiredQrOptions) => string;
+//# sourceMappingURL=svg.d.ts.map

package/dist/svg.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"svg.d.ts","sourceRoot":"","sources":["../src/svg.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACtC,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAKpD,eAAO,MAAM,aAAa,QAAa,CAAC;AAmExC;;;;GAIG;AACH,eAAO,MAAM,0BAA0B,GAAI,QAAQ,MAAM,EAAE,SAAS,iBAAiB,KAAG,MA8PvF,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,57 @@
+export type QrOptions = {
+    /**
+     * Size of QR code
+     * @default 128
+     */
+    qrSize?: number | undefined;
+    /**
+     * Class name of root SVG element
+     */
+    className?: string | undefined;
+    /**
+     * Show VK logo in center of QR code
+     * @default false
+     */
+    isShowLogo?: boolean | undefined;
+    /**
+     * Show QR background
+     * @default false
+     */
+    isShowBackground?: boolean | undefined;
+    /**
+     * QR code background HEX color. Works if `isShowBackground` is enabled.
+     * @default "#ffffff"
+     */
+    backgroundColor?: string | undefined;
+    /**
+     * QR code HEX color
+     */
+    foregroundColor?: string | undefined;
+    /**
+     * Color of logo
+     * @default "#000000"
+     */
+    logoColor?: string | undefined;
+    /**
+     * Reference to logo as a reference IRI
+     */
+    logoData?: string | null | undefined;
+    /**
+     * SVG elements id postfix
+     */
+    suffix?: string | undefined;
+    /**
+     * ECC Level
+     */
+    ecc?: number | undefined;
+    /**
+     * Custom INC_TILE_SIZE
+     */
+    incTileSize?: number | undefined;
+};
+type NotUndefined<T> = {
+    [k in keyof T]-?: Exclude<T[k], undefined>;
+};
+export type RequiredQrOptions = NotUndefined<QrOptions>;
+export {};
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,SAAS,GAAG;IACtB;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAE5B;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAE/B;;;OAGG;IACH,UAAU,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAEjC;;;OAGG;IACH,gBAAgB,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAEvC;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAErC;;OAEG;IACH,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAErC;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAE/B;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC;IAErC;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAE5B;;OAEG;IACH,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAEzB;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAClC,CAAC;AAEF,KAAK,YAAY,CAAC,CAAC,IAAI;KAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;CAAE,CAAC;AAEtE,MAAM,MAAM,iBAAiB,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC"}

package/package.json

@@ -1,79 +1,57 @@
 {
-  "name": "@vkontakte/vk-qr",
-  "version": "2.0.13",
-  "description": "QR Code generator",
-  "main": "dist/cjs/index.js",
-  "browser": "dist/umd/qrCodeGenerator.js",
-  "module": "dist/es/index.js",
-  "jsxnext:main": "dist/es/index.js",
-  "umdName": "qrCodeGenerator",
-  "types": "dist/types/index.d.ts",
-  "files": [
-    "dist",
-    "src"
-  ],
-  "scripts": {
-    "test": "jest",
-    "watch": "rollup -c -w",
-    "build": "rimraf dist && NODE_ENV=production rollup -c",
-    "build:types": "rimraf dist/types && tsc src/index.ts",
-    "lint": "eslint src/*.ts",
-    "size": "size-limit",
-    "prepublish": "yarn build"
-  },
-  "keywords": [],
-  "author": "VK.com",
-  "license": "MIT",
-  "repository": "VKCOM/vk-qr",
-  "jest": {
-    "testMatch": [
-      "<rootDir>/tests/**/*.js"
-    ]
-  },
-  "devDependencies": {
-    "@babel/cli": "^7.5.0",
-    "@babel/core": "^7.5.4",
-    "@babel/preset-env": "^7.5.5",
-    "@babel/preset-typescript": "^7.3.3",
-    "@size-limit/preset-small-lib": "^4.12.0",
-    "@types/jest": "^24.0.15",
-    "@types/prettier": "^1.16.4",
-    "@typescript-eslint/eslint-plugin": "^2.0.0",
-    "@typescript-eslint/parser": "^2.0.0",
-    "babel-plugin-add-module-exports": "^0.2.1",
-    "convert-svg-to-png": "^0.5.0",
-    "cross-env": "^5.2.0",
-    "eslint": "^6.0.1",
-    "eslint-plugin-babel": "^4.1.2",
-    "eslint-plugin-import": "^2.18.0",
-    "eslint-plugin-prettier": "^3.1.0",
-    "fast-xml-parser": "^3.12.17",
-    "jest": "^24.9.0",
-    "jest-image-snapshot": "^2.9.0",
-    "js-beautify": "^1.10.0",
-    "prettier": "^1.18.2",
-    "rimraf": "^2.6.1",
-    "rollup": "^1.16.7",
-    "rollup-plugin-babel": "^4.3.3",
-    "rollup-plugin-bundle-size": "^1.0.3",
-    "rollup-plugin-commonjs": "^10.0.1",
-    "rollup-plugin-node-resolve": "^5.2.0",
-    "rollup-plugin-typescript2": "^0.22.0",
-    "rollup-plugin-uglify": "^6.0.2",
-    "size-limit": "^4.12.0",
-    "ts-node": "^8.3.0",
-    "typescript": "^3.5.3",
-    "xml-js": "^1.6.11"
-  },
-  "size-limit": [
-    {
-      "path": "dist/cjs/index.js"
-    },
-    {
-      "path": "dist/es/index.js"
-    },
-    {
-      "path": "dist/umd/qrCodeGenerator.js"
-    }
-  ]
+	"name": "@vkontakte/vk-qr",
+	"version": "3.0.0",
+	"description": "QR Code generator",
+	"type": "module",
+	"exports": {
+		".": {
+			"types": "./dist/index.d.ts",
+			"import": "./dist/index.js",
+			"default": "./dist/index.js"
+		},
+		"./package.json": "./package.json"
+	},
+	"main": "dist/index.js",
+	"module": "dist/index.js",
+	"types": "dist/index.d.ts",
+	"files": [
+		"dist",
+		"src"
+	],
+	"scripts": {
+		"test": "node --test tests/**/*.test.ts",
+		"test:update": "UPDATE_SNAPSHOTS=1 node --import tsx --test tests/**/*.test.ts",
+		"watch": "rslib --watch",
+		"build": "rslib",
+		"lint": "yarn lint:biome && yarn lint:types",
+		"size": "size-limit",
+		"lint:biome": "biome check",
+		"lint:biome:fix": "biome check --write",
+		"lint:types": "tsc -b",
+		"prepack": "yarn build"
+	},
+	"keywords": [],
+	"author": "vk.ru",
+	"license": "MIT",
+	"repository": "VKCOM/vk-qr",
+	"dependencies": {
+		"@swc/helpers": "^0.5.21"
+	},
+	"devDependencies": {
+		"@biomejs/biome": "^2.4.12",
+		"@rslib/core": "^0.21.2",
+		"@size-limit/preset-small-lib": "^12.1.0",
+		"@types/node": "^25.6.0",
+		"size-limit": "^12.1.0",
+		"typescript": "^6.0.3"
+	},
+	"size-limit": [
+		{
+			"path": "dist/index.js"
+		}
+	],
+	"publishConfig": {
+		"access": "public"
+	},
+	"packageManager": "yarn@1.22.22+sha512.a6b2f7906b721bba3d67d4aff083df04dad64c399707841b7acf00f6b133b7ac24255f2652fa22ae3534329dc6180534e98d17432037ff6fd140556e2bb3137e"
 }