@ozdao/prometheus-framework 0.2.330 → 0.2.332

package/dist/node_modules/qrcode/lib/core/qrcode.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"qrcode.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n *   http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n//   http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n//   http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n  const size = matrix.size\n  const pos = FinderPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -1; r <= 7; r++) {\n      if (row + r <= -1 || size <= row + r) continue\n\n      for (let c = -1; c <= 7; c++) {\n        if (col + c <= -1 || size <= col + c) continue\n\n        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param  {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n  const size = matrix.size\n\n  for (let r = 8; r < size - 8; r++) {\n    const value = r % 2 === 0\n    matrix.set(r, 6, value, true)\n    matrix.set(6, r, value, true)\n  }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n  const pos = AlignmentPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -2; r <= 2; r++) {\n      for (let c = -2; c <= 2; c++) {\n        if (r === -2 || r === 2 || c === -2 || c === 2 ||\n          (r === 0 && c === 0)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n  const size = matrix.size\n  const bits = Version.getEncodedBits(version)\n  let row, col, mod\n\n  for (let i = 0; i < 18; i++) {\n    row = Math.floor(i / 3)\n    col = i % 3 + size - 8 - 3\n    mod = ((bits >> i) & 1) === 1\n\n    matrix.set(row, col, mod, true)\n    matrix.set(col, row, mod, true)\n  }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param  {BitMatrix} matrix               Modules matrix\n * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level\n * @param  {Number}    maskPattern          Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n  const size = matrix.size\n  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n  let i, mod\n\n  for (i = 0; i < 15; i++) {\n    mod = ((bits >> i) & 1) === 1\n\n    // vertical\n    if (i < 6) {\n      matrix.set(i, 8, mod, true)\n    } else if (i < 8) {\n      matrix.set(i + 1, 8, mod, true)\n    } else {\n      matrix.set(size - 15 + i, 8, mod, true)\n    }\n\n    // horizontal\n    if (i < 8) {\n      matrix.set(8, size - i - 1, mod, true)\n    } else if (i < 9) {\n      matrix.set(8, 15 - i - 1 + 1, mod, true)\n    } else {\n      matrix.set(8, 15 - i - 1, mod, true)\n    }\n  }\n\n  // fixed module\n  matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param  {BitMatrix}  matrix Modules matrix\n * @param  {Uint8Array} data   Data codewords\n */\nfunction setupData (matrix, data) {\n  const size = matrix.size\n  let inc = -1\n  let row = size - 1\n  let bitIndex = 7\n  let byteIndex = 0\n\n  for (let col = size - 1; col > 0; col -= 2) {\n    if (col === 6) col--\n\n    while (true) {\n      for (let c = 0; c < 2; c++) {\n        if (!matrix.isReserved(row, col - c)) {\n          let dark = false\n\n          if (byteIndex < data.length) {\n            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n          }\n\n          matrix.set(row, col - c, dark)\n          bitIndex--\n\n          if (bitIndex === -1) {\n            byteIndex++\n            bitIndex = 7\n          }\n        }\n      }\n\n      row += inc\n\n      if (row < 0 || size <= row) {\n        row -= inc\n        inc = -inc\n        break\n      }\n    }\n  }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param  {Number}   version              QR Code version\n * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level\n * @param  {ByteData} data                 Data input\n * @return {Uint8Array}                    Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n  // Prepare data buffer\n  const buffer = new BitBuffer()\n\n  segments.forEach(function (data) {\n    // prefix data with mode indicator (4 bits)\n    buffer.put(data.mode.bit, 4)\n\n    // Prefix data with character count indicator.\n    // The character count indicator is a string of bits that represents the\n    // number of characters that are being encoded.\n    // The character count indicator must be placed after the mode indicator\n    // and must be a certain number of bits long, depending on the QR version\n    // and data mode\n    // @see {@link Mode.getCharCountIndicator}.\n    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n    // add binary data sequence to buffer\n    data.write(buffer)\n  })\n\n  // Calculate required number of bits\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n  // Add a terminator.\n  // If the bit string is shorter than the total number of required bits,\n  // a terminator of up to four 0s must be added to the right side of the string.\n  // If the bit string is more than four bits shorter than the required number of bits,\n  // add four 0s to the end.\n  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n    buffer.put(0, 4)\n  }\n\n  // If the bit string is fewer than four bits shorter, add only the number of 0s that\n  // are needed to reach the required number of bits.\n\n  // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n  // pad the string on the right with 0s to make the string's length a multiple of 8.\n  while (buffer.getLengthInBits() % 8 !== 0) {\n    buffer.putBit(0)\n  }\n\n  // Add pad bytes if the string is still shorter than the total number of required bits.\n  // Extend the buffer to fill the data capacity of the symbol corresponding to\n  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n  // and 00010001 (0x11) alternately.\n  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n  for (let i = 0; i < remainingByte; i++) {\n    buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n  }\n\n  return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param  {BitBuffer} bitBuffer            Data to encode\n * @param  {Number}    version              QR Code version\n * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array}                     Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n  // Total codewords for this QR code version (Data + Error correction)\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n  // Total number of error correction codewords\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n  // Total number of data codewords\n  const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n  // Total number of blocks\n  const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n  // Calculate how many blocks each group should contain\n  const blocksInGroup2 = totalCodewords % ecTotalBlocks\n  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n  // Number of EC codewords is the same for both groups\n  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n  const rs = new ReedSolomonEncoder(ecCount)\n\n  let offset = 0\n  const dcData = new Array(ecTotalBlocks)\n  const ecData = new Array(ecTotalBlocks)\n  let maxDataSize = 0\n  const buffer = new Uint8Array(bitBuffer.buffer)\n\n  // Divide the buffer into the required number of blocks\n  for (let b = 0; b < ecTotalBlocks; b++) {\n    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n    // extract a block of data from buffer\n    dcData[b] = buffer.slice(offset, offset + dataSize)\n\n    // Calculate EC codewords for this data block\n    ecData[b] = rs.encode(dcData[b])\n\n    offset += dataSize\n    maxDataSize = Math.max(maxDataSize, dataSize)\n  }\n\n  // Create final data\n  // Interleave the data and error correction codewords from each block\n  const data = new Uint8Array(totalCodewords)\n  let index = 0\n  let i, r\n\n  // Add data codewords\n  for (i = 0; i < maxDataSize; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      if (i < dcData[r].length) {\n        data[index++] = dcData[r][i]\n      }\n    }\n  }\n\n  // Apped EC codewords\n  for (i = 0; i < ecCount; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      data[index++] = ecData[r][i]\n    }\n  }\n\n  return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param  {String} data                 Input string\n * @param  {Number} version              QR Code version\n * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param  {MaskPattern} maskPattern     Mask pattern\n * @return {Object}                      Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n  let segments\n\n  if (Array.isArray(data)) {\n    segments = Segments.fromArray(data)\n  } else if (typeof data === 'string') {\n    let estimatedVersion = version\n\n    if (!estimatedVersion) {\n      const rawSegments = Segments.rawSplit(data)\n\n      // Estimate best version that can contain raw splitted segments\n      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n    }\n\n    // Build optimized segments\n    // If estimated version is undefined, try with the highest version\n    segments = Segments.fromString(data, estimatedVersion || 40)\n  } else {\n    throw new Error('Invalid data')\n  }\n\n  // Get the min version that can contain data\n  const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n  // If no version is found, data cannot be stored\n  if (!bestVersion) {\n    throw new Error('The amount of data is too big to be stored in a QR Code')\n  }\n\n  // If not specified, use min version as default\n  if (!version) {\n    version = bestVersion\n\n  // Check if the specified version can contain the data\n  } else if (version < bestVersion) {\n    throw new Error('\\n' +\n      'The chosen QR Code version cannot contain this amount of data.\\n' +\n      'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n    )\n  }\n\n  const dataBits = createData(version, errorCorrectionLevel, segments)\n\n  // Allocate matrix buffer\n  const moduleCount = Utils.getSymbolSize(version)\n  const modules = new BitMatrix(moduleCount)\n\n  // Add function modules\n  setupFinderPattern(modules, version)\n  setupTimingPattern(modules)\n  setupAlignmentPattern(modules, version)\n\n  // Add temporary dummy bits for format info just to set them as reserved.\n  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n  // since the masking operation must be performed only on the encoding region.\n  // These blocks will be replaced with correct values later in code.\n  setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n  if (version >= 7) {\n    setupVersionInfo(modules, version)\n  }\n\n  // Add data codewords\n  setupData(modules, dataBits)\n\n  if (isNaN(maskPattern)) {\n    // Find best mask pattern\n    maskPattern = MaskPattern.getBestMask(modules,\n      setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n  }\n\n  // Apply mask pattern\n  MaskPattern.applyMask(maskPattern, modules)\n\n  // Replace format info bits with correct values\n  setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n  return {\n    modules: modules,\n    version: version,\n    errorCorrectionLevel: errorCorrectionLevel,\n    maskPattern: maskPattern,\n    segments: segments\n  }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data                 Input data\n * @param {Object} options                      Optional configurations\n * @param {Number} options.version              QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n  if (typeof data === 'undefined' || data === '') {\n    throw new Error('No input text')\n  }\n\n  let errorCorrectionLevel = ECLevel.M\n  let version\n  let mask\n\n  if (typeof options !== 'undefined') {\n    // Use higher error correction level as default\n    errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n    version = Version.from(options.version)\n    mask = MaskPattern.from(options.maskPattern)\n\n    if (options.toSJISFunc) {\n      Utils.setToSJISFunction(options.toSJISFunc)\n    }\n  }\n\n  return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","require$$11","require$$12","version","errorCorrectionLevel","maskPattern","segments","bitBuffer","qrcode"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,MAAM,QAAQA,MAAkB;AAChC,MAAM,UAAUC,qBAAmC;AACnD,MAAM,YAAYC,UAAuB;AACzC,MAAM,YAAYC,UAAuB;AACzC,MAAM,mBAAmBC,iBAA8B;AACvD,MAAM,gBAAgBC,cAA2B;AACjD,MAAM,cAAcC,YAAyB;AAC7C,MAAM,SAASC,oBAAkC;AACjD,MAAM,qBAAqBC,mBAAiC;AAC5D,MAAM,UAAUC,QAAoB;AACpC,MAAM,aAAaC,WAAwB;AAC3C,MAAM,OAAOC,KAAiB;AAC9B,MAAM,WAAWC,SAAqB;AAkCtC,SAAS,mBAAoB,QAAQC,UAAS;AAC5C,QAAM,OAAO,OAAO;AACpB,QAAM,MAAM,cAAc,aAAaA,QAAO;AAE9C,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,UAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,YAAK,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACxC,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACtC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAI;AACxC,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACH;AASA,SAAS,mBAAoB,QAAQ;AACnC,QAAM,OAAO,OAAO;AAEpB,WAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,UAAM,QAAQ,IAAI,MAAM;AACxB,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAC5B,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAAA,EAC7B;AACH;AAUA,SAAS,sBAAuB,QAAQA,UAAS;AAC/C,QAAM,MAAM,iBAAiB,aAAaA,QAAO;AAEjD,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAC1C,MAAM,KAAK,MAAM,GAAI;AACtB,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACH;AAQA,SAAS,iBAAkB,QAAQA,UAAS;AAC1C,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,QAAQ,eAAeA,QAAO;AAC3C,MAAI,KAAK,KAAK;AAEd,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,KAAK,MAAM,IAAI,CAAC;AACtB,UAAM,IAAI,IAAI,OAAO,IAAI;AACzB,WAAQ,QAAQ,IAAK,OAAO;AAE5B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAC9B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAAA,EAC/B;AACH;AASA,SAAS,gBAAiB,QAAQC,uBAAsBC,cAAa;AACnE,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,WAAW,eAAeD,uBAAsBC,YAAW;AACxE,MAAI,GAAG;AAEP,OAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACvB,WAAQ,QAAQ,IAAK,OAAO;AAG5B,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IAChC,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IACpC,OAAW;AACL,aAAO,IAAI,OAAO,KAAK,GAAG,GAAG,KAAK,IAAI;AAAA,IACvC;AAGD,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,OAAO,IAAI,GAAG,KAAK,IAAI;AAAA,IAC3C,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AAAA,IAC7C,OAAW;AACL,aAAO,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,IACpC;AAAA,EACF;AAGD,SAAO,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI;AACjC;AAQA,SAAS,UAAW,QAAQ,MAAM;AAChC,QAAM,OAAO,OAAO;AACpB,MAAI,MAAM;AACV,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,WAAS,MAAM,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG;AAC1C,QAAI,QAAQ,EAAG;AAEf,WAAO,MAAM;AACX,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,OAAO,WAAW,KAAK,MAAM,CAAC,GAAG;AACpC,cAAI,OAAO;AAEX,cAAI,YAAY,KAAK,QAAQ;AAC3B,oBAAU,KAAK,SAAS,MAAM,WAAY,OAAO;AAAA,UAClD;AAED,iBAAO,IAAI,KAAK,MAAM,GAAG,IAAI;AAC7B;AAEA,cAAI,aAAa,IAAI;AACnB;AACA,uBAAW;AAAA,UACZ;AAAA,QACF;AAAA,MACF;AAED,aAAO;AAEP,UAAI,MAAM,KAAK,QAAQ,KAAK;AAC1B,eAAO;AACP,cAAM,CAAC;AACP;AAAA,MACD;AAAA,IACF;AAAA,EACF;AACH;AAUA,SAAS,WAAYF,UAASC,uBAAsBE,WAAU;AAE5D,QAAM,SAAS,IAAI,UAAW;AAE9B,EAAAA,UAAS,QAAQ,SAAU,MAAM;AAE/B,WAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAS3B,WAAO,IAAI,KAAK,UAAW,GAAE,KAAK,sBAAsB,KAAK,MAAMH,QAAO,CAAC;AAG3E,SAAK,MAAM,MAAM;AAAA,EACrB,CAAG;AAGD,QAAM,iBAAiB,MAAM,wBAAwBA,QAAO;AAC5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AACpF,QAAM,0BAA0B,iBAAiB,oBAAoB;AAOrE,MAAI,OAAO,oBAAoB,KAAK,wBAAwB;AAC1D,WAAO,IAAI,GAAG,CAAC;AAAA,EAChB;AAOD,SAAO,OAAO,oBAAoB,MAAM,GAAG;AACzC,WAAO,OAAO,CAAC;AAAA,EAChB;AAMD,QAAM,iBAAiB,yBAAyB,OAAO,gBAAiB,KAAI;AAC5E,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,WAAO,IAAI,IAAI,IAAI,KAAO,KAAM,CAAC;AAAA,EAClC;AAED,SAAO,gBAAgB,QAAQD,UAASC,qBAAoB;AAC9D;AAWA,SAAS,gBAAiBG,YAAWJ,UAASC,uBAAsB;AAElE,QAAM,iBAAiB,MAAM,wBAAwBD,QAAO;AAG5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AAGpF,QAAM,qBAAqB,iBAAiB;AAG5C,QAAM,gBAAgB,OAAO,eAAeD,UAASC,qBAAoB;AAGzE,QAAM,iBAAiB,iBAAiB;AACxC,QAAM,iBAAiB,gBAAgB;AAEvC,QAAM,yBAAyB,KAAK,MAAM,iBAAiB,aAAa;AAExE,QAAM,wBAAwB,KAAK,MAAM,qBAAqB,aAAa;AAC3E,QAAM,wBAAwB,wBAAwB;AAGtD,QAAM,UAAU,yBAAyB;AAGzC,QAAM,KAAK,IAAI,mBAAmB,OAAO;AAEzC,MAAI,SAAS;AACb,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,MAAI,cAAc;AAClB,QAAM,SAAS,IAAI,WAAWG,WAAU,MAAM;AAG9C,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,UAAM,WAAW,IAAI,iBAAiB,wBAAwB;AAG9D,WAAO,CAAC,IAAI,OAAO,MAAM,QAAQ,SAAS,QAAQ;AAGlD,WAAO,CAAC,IAAI,GAAG,OAAO,OAAO,CAAC,CAAC;AAE/B,cAAU;AACV,kBAAc,KAAK,IAAI,aAAa,QAAQ;AAAA,EAC7C;AAID,QAAM,OAAO,IAAI,WAAW,cAAc;AAC1C,MAAI,QAAQ;AACZ,MAAI,GAAG;AAGP,OAAK,IAAI,GAAG,IAAI,aAAa,KAAK;AAChC,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,UAAI,IAAI,OAAO,CAAC,EAAE,QAAQ;AACxB,aAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAGD,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,WAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IAC5B;AAAA,EACF;AAED,SAAO;AACT;AAWA,SAAS,aAAc,MAAMJ,UAASC,uBAAsBC,cAAa;AACvE,MAAIC;AAEJ,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,IAAAA,YAAW,SAAS,UAAU,IAAI;AAAA,EACtC,WAAa,OAAO,SAAS,UAAU;AACnC,QAAI,mBAAmBH;AAEvB,QAAI,CAAC,kBAAkB;AACrB,YAAM,cAAc,SAAS,SAAS,IAAI;AAG1C,yBAAmB,QAAQ,sBAAsB,aAAaC,qBAAoB;AAAA,IACnF;AAID,IAAAE,YAAW,SAAS,WAAW,MAAM,oBAAoB,EAAE;AAAA,EAC/D,OAAS;AACL,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AAGD,QAAM,cAAc,QAAQ,sBAAsBA,WAAUF,qBAAoB;AAGhF,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AAGD,MAAI,CAACD,UAAS;AACZ,IAAAA,WAAU;AAAA,EAGd,WAAaA,WAAU,aAAa;AAChC,UAAM,IAAI;AAAA,MAAM,0HAE0C,cAAc;AAAA,IACvE;AAAA,EACF;AAED,QAAM,WAAW,WAAWA,UAASC,uBAAsBE,SAAQ;AAGnE,QAAM,cAAc,MAAM,cAAcH,QAAO;AAC/C,QAAM,UAAU,IAAI,UAAU,WAAW;AAGzC,qBAAmB,SAASA,QAAO;AACnC,qBAAmB,OAAO;AAC1B,wBAAsB,SAASA,QAAO;AAMtC,kBAAgB,SAASC,uBAAsB,CAAC;AAEhD,MAAID,YAAW,GAAG;AAChB,qBAAiB,SAASA,QAAO;AAAA,EAClC;AAGD,YAAU,SAAS,QAAQ;AAE3B,MAAI,MAAME,YAAW,GAAG;AAEtB,IAAAA,eAAc,YAAY;AAAA,MAAY;AAAA,MACpC,gBAAgB,KAAK,MAAM,SAASD,qBAAoB;AAAA,IAAC;AAAA,EAC5D;AAGD,cAAY,UAAUC,cAAa,OAAO;AAG1C,kBAAgB,SAASD,uBAAsBC,YAAW;AAE1D,SAAO;AAAA,IACL;AAAA,IACA,SAASF;AAAA,IACT,sBAAsBC;AAAA,IACtB,aAAaC;AAAA,IACb,UAAUC;AAAA,EACX;AACH;AAWAE,OAAA,UAAA,SAAiB,SAAS,OAAQ,MAAM,SAAS;AAC/C,MAAI,OAAO,SAAS,eAAe,SAAS,IAAI;AAC9C,UAAM,IAAI,MAAM,eAAe;AAAA,EAChC;AAED,MAAIJ,wBAAuB,QAAQ;AACnC,MAAID;AACJ,MAAI;AAEJ,MAAI,OAAO,YAAY,aAAa;AAElC,IAAAC,wBAAuB,QAAQ,KAAK,QAAQ,sBAAsB,QAAQ,CAAC;AAC3E,IAAAD,WAAU,QAAQ,KAAK,QAAQ,OAAO;AACtC,WAAO,YAAY,KAAK,QAAQ,WAAW;AAE3C,QAAI,QAAQ,YAAY;AACtB,YAAM,kBAAkB,QAAQ,UAAU;AAAA,IAC3C;AAAA,EACF;AAED,SAAO,aAAa,MAAMA,UAASC,uBAAsB,IAAI;AAC/D;;","x_google_ignoreList":[0]}
+{"version":3,"file":"qrcode.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n *   http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n//   http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n//   http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n  const size = matrix.size\n  const pos = FinderPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -1; r <= 7; r++) {\n      if (row + r <= -1 || size <= row + r) continue\n\n      for (let c = -1; c <= 7; c++) {\n        if (col + c <= -1 || size <= col + c) continue\n\n        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param  {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n  const size = matrix.size\n\n  for (let r = 8; r < size - 8; r++) {\n    const value = r % 2 === 0\n    matrix.set(r, 6, value, true)\n    matrix.set(6, r, value, true)\n  }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n  const pos = AlignmentPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -2; r <= 2; r++) {\n      for (let c = -2; c <= 2; c++) {\n        if (r === -2 || r === 2 || c === -2 || c === 2 ||\n          (r === 0 && c === 0)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n  const size = matrix.size\n  const bits = Version.getEncodedBits(version)\n  let row, col, mod\n\n  for (let i = 0; i < 18; i++) {\n    row = Math.floor(i / 3)\n    col = i % 3 + size - 8 - 3\n    mod = ((bits >> i) & 1) === 1\n\n    matrix.set(row, col, mod, true)\n    matrix.set(col, row, mod, true)\n  }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param  {BitMatrix} matrix               Modules matrix\n * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level\n * @param  {Number}    maskPattern          Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n  const size = matrix.size\n  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n  let i, mod\n\n  for (i = 0; i < 15; i++) {\n    mod = ((bits >> i) & 1) === 1\n\n    // vertical\n    if (i < 6) {\n      matrix.set(i, 8, mod, true)\n    } else if (i < 8) {\n      matrix.set(i + 1, 8, mod, true)\n    } else {\n      matrix.set(size - 15 + i, 8, mod, true)\n    }\n\n    // horizontal\n    if (i < 8) {\n      matrix.set(8, size - i - 1, mod, true)\n    } else if (i < 9) {\n      matrix.set(8, 15 - i - 1 + 1, mod, true)\n    } else {\n      matrix.set(8, 15 - i - 1, mod, true)\n    }\n  }\n\n  // fixed module\n  matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param  {BitMatrix}  matrix Modules matrix\n * @param  {Uint8Array} data   Data codewords\n */\nfunction setupData (matrix, data) {\n  const size = matrix.size\n  let inc = -1\n  let row = size - 1\n  let bitIndex = 7\n  let byteIndex = 0\n\n  for (let col = size - 1; col > 0; col -= 2) {\n    if (col === 6) col--\n\n    while (true) {\n      for (let c = 0; c < 2; c++) {\n        if (!matrix.isReserved(row, col - c)) {\n          let dark = false\n\n          if (byteIndex < data.length) {\n            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n          }\n\n          matrix.set(row, col - c, dark)\n          bitIndex--\n\n          if (bitIndex === -1) {\n            byteIndex++\n            bitIndex = 7\n          }\n        }\n      }\n\n      row += inc\n\n      if (row < 0 || size <= row) {\n        row -= inc\n        inc = -inc\n        break\n      }\n    }\n  }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param  {Number}   version              QR Code version\n * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level\n * @param  {ByteData} data                 Data input\n * @return {Uint8Array}                    Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n  // Prepare data buffer\n  const buffer = new BitBuffer()\n\n  segments.forEach(function (data) {\n    // prefix data with mode indicator (4 bits)\n    buffer.put(data.mode.bit, 4)\n\n    // Prefix data with character count indicator.\n    // The character count indicator is a string of bits that represents the\n    // number of characters that are being encoded.\n    // The character count indicator must be placed after the mode indicator\n    // and must be a certain number of bits long, depending on the QR version\n    // and data mode\n    // @see {@link Mode.getCharCountIndicator}.\n    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n    // add binary data sequence to buffer\n    data.write(buffer)\n  })\n\n  // Calculate required number of bits\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n  // Add a terminator.\n  // If the bit string is shorter than the total number of required bits,\n  // a terminator of up to four 0s must be added to the right side of the string.\n  // If the bit string is more than four bits shorter than the required number of bits,\n  // add four 0s to the end.\n  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n    buffer.put(0, 4)\n  }\n\n  // If the bit string is fewer than four bits shorter, add only the number of 0s that\n  // are needed to reach the required number of bits.\n\n  // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n  // pad the string on the right with 0s to make the string's length a multiple of 8.\n  while (buffer.getLengthInBits() % 8 !== 0) {\n    buffer.putBit(0)\n  }\n\n  // Add pad bytes if the string is still shorter than the total number of required bits.\n  // Extend the buffer to fill the data capacity of the symbol corresponding to\n  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n  // and 00010001 (0x11) alternately.\n  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n  for (let i = 0; i < remainingByte; i++) {\n    buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n  }\n\n  return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param  {BitBuffer} bitBuffer            Data to encode\n * @param  {Number}    version              QR Code version\n * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array}                     Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n  // Total codewords for this QR code version (Data + Error correction)\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n  // Total number of error correction codewords\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n  // Total number of data codewords\n  const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n  // Total number of blocks\n  const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n  // Calculate how many blocks each group should contain\n  const blocksInGroup2 = totalCodewords % ecTotalBlocks\n  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n  // Number of EC codewords is the same for both groups\n  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n  const rs = new ReedSolomonEncoder(ecCount)\n\n  let offset = 0\n  const dcData = new Array(ecTotalBlocks)\n  const ecData = new Array(ecTotalBlocks)\n  let maxDataSize = 0\n  const buffer = new Uint8Array(bitBuffer.buffer)\n\n  // Divide the buffer into the required number of blocks\n  for (let b = 0; b < ecTotalBlocks; b++) {\n    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n    // extract a block of data from buffer\n    dcData[b] = buffer.slice(offset, offset + dataSize)\n\n    // Calculate EC codewords for this data block\n    ecData[b] = rs.encode(dcData[b])\n\n    offset += dataSize\n    maxDataSize = Math.max(maxDataSize, dataSize)\n  }\n\n  // Create final data\n  // Interleave the data and error correction codewords from each block\n  const data = new Uint8Array(totalCodewords)\n  let index = 0\n  let i, r\n\n  // Add data codewords\n  for (i = 0; i < maxDataSize; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      if (i < dcData[r].length) {\n        data[index++] = dcData[r][i]\n      }\n    }\n  }\n\n  // Apped EC codewords\n  for (i = 0; i < ecCount; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      data[index++] = ecData[r][i]\n    }\n  }\n\n  return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param  {String} data                 Input string\n * @param  {Number} version              QR Code version\n * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param  {MaskPattern} maskPattern     Mask pattern\n * @return {Object}                      Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n  let segments\n\n  if (Array.isArray(data)) {\n    segments = Segments.fromArray(data)\n  } else if (typeof data === 'string') {\n    let estimatedVersion = version\n\n    if (!estimatedVersion) {\n      const rawSegments = Segments.rawSplit(data)\n\n      // Estimate best version that can contain raw splitted segments\n      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n    }\n\n    // Build optimized segments\n    // If estimated version is undefined, try with the highest version\n    segments = Segments.fromString(data, estimatedVersion || 40)\n  } else {\n    throw new Error('Invalid data')\n  }\n\n  // Get the min version that can contain data\n  const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n  // If no version is found, data cannot be stored\n  if (!bestVersion) {\n    throw new Error('The amount of data is too big to be stored in a QR Code')\n  }\n\n  // If not specified, use min version as default\n  if (!version) {\n    version = bestVersion\n\n  // Check if the specified version can contain the data\n  } else if (version < bestVersion) {\n    throw new Error('\\n' +\n      'The chosen QR Code version cannot contain this amount of data.\\n' +\n      'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n    )\n  }\n\n  const dataBits = createData(version, errorCorrectionLevel, segments)\n\n  // Allocate matrix buffer\n  const moduleCount = Utils.getSymbolSize(version)\n  const modules = new BitMatrix(moduleCount)\n\n  // Add function modules\n  setupFinderPattern(modules, version)\n  setupTimingPattern(modules)\n  setupAlignmentPattern(modules, version)\n\n  // Add temporary dummy bits for format info just to set them as reserved.\n  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n  // since the masking operation must be performed only on the encoding region.\n  // These blocks will be replaced with correct values later in code.\n  setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n  if (version >= 7) {\n    setupVersionInfo(modules, version)\n  }\n\n  // Add data codewords\n  setupData(modules, dataBits)\n\n  if (isNaN(maskPattern)) {\n    // Find best mask pattern\n    maskPattern = MaskPattern.getBestMask(modules,\n      setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n  }\n\n  // Apply mask pattern\n  MaskPattern.applyMask(maskPattern, modules)\n\n  // Replace format info bits with correct values\n  setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n  return {\n    modules: modules,\n    version: version,\n    errorCorrectionLevel: errorCorrectionLevel,\n    maskPattern: maskPattern,\n    segments: segments\n  }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data                 Input data\n * @param {Object} options                      Optional configurations\n * @param {Number} options.version              QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n  if (typeof data === 'undefined' || data === '') {\n    throw new Error('No input text')\n  }\n\n  let errorCorrectionLevel = ECLevel.M\n  let version\n  let mask\n\n  if (typeof options !== 'undefined') {\n    // Use higher error correction level as default\n    errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n    version = Version.from(options.version)\n    mask = MaskPattern.from(options.maskPattern)\n\n    if (options.toSJISFunc) {\n      Utils.setToSJISFunction(options.toSJISFunc)\n    }\n  }\n\n  return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","require$$11","require$$12","version","errorCorrectionLevel","maskPattern","segments","bitBuffer","qrcode"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,QAAM,QAAQA,MAAA,UAAA;AACd,QAAM,UAAUC,qBAAA,UAAA;AAChB,QAAM,YAAYC,UAAA,UAAA;AAClB,QAAM,YAAYC,UAAA,UAAA;AAClB,QAAM,mBAAmBC,iBAAA,UAAA;AACzB,QAAM,gBAAgBC,cAAA,UAAA;AACtB,QAAM,cAAcC,YAAA,UAAA;AACpB,QAAM,SAASC,oBAAA,UAAA;AACf,QAAM,qBAAqBC,mBAAA,UAAA;AAC3B,QAAM,UAAUC,QAAA,UAAA;AAChB,QAAM,aAAaC,WAAA,UAAA;AACnB,QAAM,OAAOC,KAAA,UAAA;AACb,QAAM,WAAWC,SAAA,UAAA;AAkCjB,WAAS,mBAAoB,QAAQC,UAAS;AAC5C,UAAM,OAAO,OAAO;AACpB,UAAM,MAAM,cAAc,aAAaA,QAAO;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,YAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,iBAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,cAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,cAAK,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACxC,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACtC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAI;AACxC,mBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,UACjD,OAAe;AACL,mBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,UAClD;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAAA,EACA;AASA,WAAS,mBAAoB,QAAQ;AACnC,UAAM,OAAO,OAAO;AAEpB,aAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,YAAM,QAAQ,IAAI,MAAM;AACxB,aAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAC5B,aAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAAA,IAChC;AAAA,EACA;AAUA,WAAS,sBAAuB,QAAQA,UAAS;AAC/C,UAAM,MAAM,iBAAiB,aAAaA,QAAO;AAEjD,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,YAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,iBAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,cAAI,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAC1C,MAAM,KAAK,MAAM,GAAI;AACtB,mBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,UACjD,OAAe;AACL,mBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,UAClD;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAAA,EACA;AAQA,WAAS,iBAAkB,QAAQA,UAAS;AAC1C,UAAM,OAAO,OAAO;AACpB,UAAM,OAAO,QAAQ,eAAeA,QAAO;AAC3C,QAAI,KAAK,KAAK;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,KAAK,MAAM,IAAI,CAAC;AACtB,YAAM,IAAI,IAAI,OAAO,IAAI;AACzB,aAAQ,QAAQ,IAAK,OAAO;AAE5B,aAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAC9B,aAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAAA,IAClC;AAAA,EACA;AASA,WAAS,gBAAiB,QAAQC,uBAAsBC,cAAa;AACnE,UAAM,OAAO,OAAO;AACpB,UAAM,OAAO,WAAW,eAAeD,uBAAsBC,YAAW;AACxE,QAAI,GAAG;AAEP,SAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACvB,aAAQ,QAAQ,IAAK,OAAO;AAG5B,UAAI,IAAI,GAAG;AACT,eAAO,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,MAChC,WAAe,IAAI,GAAG;AAChB,eAAO,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,MACpC,OAAW;AACL,eAAO,IAAI,OAAO,KAAK,GAAG,GAAG,KAAK,IAAI;AAAA,MAC5C;AAGI,UAAI,IAAI,GAAG;AACT,eAAO,IAAI,GAAG,OAAO,IAAI,GAAG,KAAK,IAAI;AAAA,MAC3C,WAAe,IAAI,GAAG;AAChB,eAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AAAA,MAC7C,OAAW;AACL,eAAO,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,MACzC;AAAA,IACA;AAGE,WAAO,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI;AAAA,EACjC;AAQA,WAAS,UAAW,QAAQ,MAAM;AAChC,UAAM,OAAO,OAAO;AACpB,QAAI,MAAM;AACV,QAAI,MAAM,OAAO;AACjB,QAAI,WAAW;AACf,QAAI,YAAY;AAEhB,aAAS,MAAM,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG;AAC1C,UAAI,QAAQ,EAAG;AAEf,aAAO,MAAM;AACX,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,CAAC,OAAO,WAAW,KAAK,MAAM,CAAC,GAAG;AACpC,gBAAI,OAAO;AAEX,gBAAI,YAAY,KAAK,QAAQ;AAC3B,sBAAU,KAAK,SAAS,MAAM,WAAY,OAAO;AAAA,YAC7D;AAEU,mBAAO,IAAI,KAAK,MAAM,GAAG,IAAI;AAC7B;AAEA,gBAAI,aAAa,IAAI;AACnB;AACA,yBAAW;AAAA,YACvB;AAAA,UACA;AAAA,QACA;AAEM,eAAO;AAEP,YAAI,MAAM,KAAK,QAAQ,KAAK;AAC1B,iBAAO;AACP,gBAAM,CAAC;AACP;AAAA,QACR;AAAA,MACA;AAAA,IACA;AAAA,EACA;AAUA,WAAS,WAAYF,UAASC,uBAAsBE,WAAU;AAE5D,UAAM,SAAS,IAAI,UAAS;AAE5B,IAAAA,UAAS,QAAQ,SAAU,MAAM;AAE/B,aAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAS3B,aAAO,IAAI,KAAK,UAAW,GAAE,KAAK,sBAAsB,KAAK,MAAMH,QAAO,CAAC;AAG3E,WAAK,MAAM,MAAM;AAAA,IAClB,CAAA;AAGD,UAAM,iBAAiB,MAAM,wBAAwBA,QAAO;AAC5D,UAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AACpF,UAAM,0BAA0B,iBAAiB,oBAAoB;AAOrE,QAAI,OAAO,oBAAoB,KAAK,wBAAwB;AAC1D,aAAO,IAAI,GAAG,CAAC;AAAA,IACnB;AAOE,WAAO,OAAO,oBAAoB,MAAM,GAAG;AACzC,aAAO,OAAO,CAAC;AAAA,IACnB;AAME,UAAM,iBAAiB,yBAAyB,OAAO,gBAAe,KAAM;AAC5E,aAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,aAAO,IAAI,IAAI,IAAI,KAAO,KAAM,CAAC;AAAA,IACrC;AAEE,WAAO,gBAAgB,QAAQD,UAASC,qBAAoB;AAAA,EAC9D;AAWA,WAAS,gBAAiBG,YAAWJ,UAASC,uBAAsB;AAElE,UAAM,iBAAiB,MAAM,wBAAwBD,QAAO;AAG5D,UAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AAGpF,UAAM,qBAAqB,iBAAiB;AAG5C,UAAM,gBAAgB,OAAO,eAAeD,UAASC,qBAAoB;AAGzE,UAAM,iBAAiB,iBAAiB;AACxC,UAAM,iBAAiB,gBAAgB;AAEvC,UAAM,yBAAyB,KAAK,MAAM,iBAAiB,aAAa;AAExE,UAAM,wBAAwB,KAAK,MAAM,qBAAqB,aAAa;AAC3E,UAAM,wBAAwB,wBAAwB;AAGtD,UAAM,UAAU,yBAAyB;AAGzC,UAAM,KAAK,IAAI,mBAAmB,OAAO;AAEzC,QAAI,SAAS;AACb,UAAM,SAAS,IAAI,MAAM,aAAa;AACtC,UAAM,SAAS,IAAI,MAAM,aAAa;AACtC,QAAI,cAAc;AAClB,UAAM,SAAS,IAAI,WAAWG,WAAU,MAAM;AAG9C,aAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,YAAM,WAAW,IAAI,iBAAiB,wBAAwB;AAG9D,aAAO,CAAC,IAAI,OAAO,MAAM,QAAQ,SAAS,QAAQ;AAGlD,aAAO,CAAC,IAAI,GAAG,OAAO,OAAO,CAAC,CAAC;AAE/B,gBAAU;AACV,oBAAc,KAAK,IAAI,aAAa,QAAQ;AAAA,IAChD;AAIE,UAAM,OAAO,IAAI,WAAW,cAAc;AAC1C,QAAI,QAAQ;AACZ,QAAI,GAAG;AAGP,SAAK,IAAI,GAAG,IAAI,aAAa,KAAK;AAChC,WAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,YAAI,IAAI,OAAO,CAAC,EAAE,QAAQ;AACxB,eAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,QACnC;AAAA,MACA;AAAA,IACA;AAGE,SAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,WAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,aAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,MACjC;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AAWA,WAAS,aAAc,MAAMJ,UAASC,uBAAsBC,cAAa;AACvE,QAAIC;AAEJ,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,MAAAA,YAAW,SAAS,UAAU,IAAI;AAAA,IACtC,WAAa,OAAO,SAAS,UAAU;AACnC,UAAI,mBAAmBH;AAEvB,UAAI,CAAC,kBAAkB;AACrB,cAAM,cAAc,SAAS,SAAS,IAAI;AAG1C,2BAAmB,QAAQ,sBAAsB,aAAaC,qBAAoB;AAAA,MACxF;AAII,MAAAE,YAAW,SAAS,WAAW,MAAM,oBAAoB,EAAE;AAAA,IAC/D,OAAS;AACL,YAAM,IAAI,MAAM,cAAc;AAAA,IAClC;AAGE,UAAM,cAAc,QAAQ,sBAAsBA,WAAUF,qBAAoB;AAGhF,QAAI,CAAC,aAAa;AAChB,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC7E;AAGE,QAAI,CAACD,UAAS;AACZ,MAAAA,WAAU;AAAA,IAGd,WAAaA,WAAU,aAAa;AAChC,YAAM,IAAI;AAAA,QAAM,0HAE0C,cAAc;AAAA,MAC5E;AAAA,IACA;AAEE,UAAM,WAAW,WAAWA,UAASC,uBAAsBE,SAAQ;AAGnE,UAAM,cAAc,MAAM,cAAcH,QAAO;AAC/C,UAAM,UAAU,IAAI,UAAU,WAAW;AAGzC,uBAAmB,SAASA,QAAO;AACnC,uBAAmB,OAAO;AAC1B,0BAAsB,SAASA,QAAO;AAMtC,oBAAgB,SAASC,uBAAsB,CAAC;AAEhD,QAAID,YAAW,GAAG;AAChB,uBAAiB,SAASA,QAAO;AAAA,IACrC;AAGE,cAAU,SAAS,QAAQ;AAE3B,QAAI,MAAME,YAAW,GAAG;AAEtB,MAAAA,eAAc,YAAY;AAAA,QAAY;AAAA,QACpC,gBAAgB,KAAK,MAAM,SAASD,qBAAoB;AAAA,MAAC;AAAA,IAC/D;AAGE,gBAAY,UAAUC,cAAa,OAAO;AAG1C,oBAAgB,SAASD,uBAAsBC,YAAW;AAE1D,WAAO;AAAA,MACL;AAAA,MACA,SAASF;AAAA,MACT,sBAAsBC;AAAA,MACtB,aAAaC;AAAA,MACb,UAAUC;AAAA,IACd;AAAA,EACA;AAWAE,SAAAA,UAAA,SAAiB,SAAS,OAAQ,MAAM,SAAS;AAC/C,QAAI,OAAO,SAAS,eAAe,SAAS,IAAI;AAC9C,YAAM,IAAI,MAAM,eAAe;AAAA,IACnC;AAEE,QAAIJ,wBAAuB,QAAQ;AACnC,QAAID;AACJ,QAAI;AAEJ,QAAI,OAAO,YAAY,aAAa;AAElC,MAAAC,wBAAuB,QAAQ,KAAK,QAAQ,sBAAsB,QAAQ,CAAC;AAC3E,MAAAD,WAAU,QAAQ,KAAK,QAAQ,OAAO;AACtC,aAAO,YAAY,KAAK,QAAQ,WAAW;AAE3C,UAAI,QAAQ,YAAY;AACtB,cAAM,kBAAkB,QAAQ,UAAU;AAAA,MAChD;AAAA,IACA;AAEE,WAAO,aAAa,MAAMA,UAASC,uBAAsB,IAAI;AAAA,EAC/D;;;;","x_google_ignoreList":[0]}