@wecom/wecom-openclaw-cli 1.0.15 → 1.0.17

package/dist/node_modules/qrcode/lib/core/qrcode.js

@@ -0,0 +1,522 @@
+'use strict';
+
+var qrcode = require('../../../../_virtual/qrcode.js');
+var utils = require('./utils.js');
+var errorCorrectionLevel = require('./error-correction-level.js');
+var bitBuffer = require('./bit-buffer.js');
+var bitMatrix = require('./bit-matrix.js');
+var alignmentPattern = require('./alignment-pattern.js');
+var finderPattern = require('./finder-pattern.js');
+var maskPattern = require('./mask-pattern.js');
+var errorCorrectionCode = require('./error-correction-code.js');
+var reedSolomonEncoder = require('./reed-solomon-encoder.js');
+var version = require('./version.js');
+var formatInfo = require('./format-info.js');
+var mode = require('./mode.js');
+var segments = require('./segments.js');
+
+var hasRequiredQrcode;
+
+function requireQrcode () {
+	if (hasRequiredQrcode) return qrcode.__exports;
+	hasRequiredQrcode = 1;
+	const Utils = utils.__require();
+	const ECLevel = errorCorrectionLevel.__require();
+	const BitBuffer = bitBuffer.__require();
+	const BitMatrix = bitMatrix.__require();
+	const AlignmentPattern = alignmentPattern.__require();
+	const FinderPattern = finderPattern.__require();
+	const MaskPattern = maskPattern.__require();
+	const ECCode = errorCorrectionCode.__require();
+	const ReedSolomonEncoder = reedSolomonEncoder.__require();
+	const Version = version.__require();
+	const FormatInfo = formatInfo.__require();
+	const Mode = mode.__require();
+	const Segments = segments.__require();
+
+	/**
+	 * QRCode for JavaScript
+	 *
+	 * modified by Ryan Day for nodejs support
+	 * Copyright (c) 2011 Ryan Day
+	 *
+	 * Licensed under the MIT license:
+	 *   http://www.opensource.org/licenses/mit-license.php
+	 *
+	//---------------------------------------------------------------------
+	// QRCode for JavaScript
+	//
+	// Copyright (c) 2009 Kazuhiko Arase
+	//
+	// URL: http://www.d-project.com/
+	//
+	// Licensed under the MIT license:
+	//   http://www.opensource.org/licenses/mit-license.php
+	//
+	// The word "QR Code" is registered trademark of
+	// DENSO WAVE INCORPORATED
+	//   http://www.denso-wave.com/qrcode/faqpatent-e.html
+	//
+	//---------------------------------------------------------------------
+	*/
+
+	/**
+	 * Add finder patterns bits to matrix
+	 *
+	 * @param  {BitMatrix} matrix  Modules matrix
+	 * @param  {Number}    version QR Code version
+	 */
+	function setupFinderPattern (matrix, version) {
+	  const size = matrix.size;
+	  const pos = FinderPattern.getPositions(version);
+
+	  for (let i = 0; i < pos.length; i++) {
+	    const row = pos[i][0];
+	    const col = pos[i][1];
+
+	    for (let r = -1; r <= 7; r++) {
+	      if (row + r <= -1 || size <= row + r) continue
+
+	      for (let c = -1; c <= 7; c++) {
+	        if (col + c <= -1 || size <= col + c) continue
+
+	        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||
+	          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||
+	          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {
+	          matrix.set(row + r, col + c, true, true);
+	        } else {
+	          matrix.set(row + r, col + c, false, true);
+	        }
+	      }
+	    }
+	  }
+	}
+
+	/**
+	 * Add timing pattern bits to matrix
+	 *
+	 * Note: this function must be called before {@link setupAlignmentPattern}
+	 *
+	 * @param  {BitMatrix} matrix Modules matrix
+	 */
+	function setupTimingPattern (matrix) {
+	  const size = matrix.size;
+
+	  for (let r = 8; r < size - 8; r++) {
+	    const value = r % 2 === 0;
+	    matrix.set(r, 6, value, true);
+	    matrix.set(6, r, value, true);
+	  }
+	}
+
+	/**
+	 * Add alignment patterns bits to matrix
+	 *
+	 * Note: this function must be called after {@link setupTimingPattern}
+	 *
+	 * @param  {BitMatrix} matrix  Modules matrix
+	 * @param  {Number}    version QR Code version
+	 */
+	function setupAlignmentPattern (matrix, version) {
+	  const pos = AlignmentPattern.getPositions(version);
+
+	  for (let i = 0; i < pos.length; i++) {
+	    const row = pos[i][0];
+	    const col = pos[i][1];
+
+	    for (let r = -2; r <= 2; r++) {
+	      for (let c = -2; c <= 2; c++) {
+	        if (r === -2 || r === 2 || c === -2 || c === 2 ||
+	          (r === 0 && c === 0)) {
+	          matrix.set(row + r, col + c, true, true);
+	        } else {
+	          matrix.set(row + r, col + c, false, true);
+	        }
+	      }
+	    }
+	  }
+	}
+
+	/**
+	 * Add version info bits to matrix
+	 *
+	 * @param  {BitMatrix} matrix  Modules matrix
+	 * @param  {Number}    version QR Code version
+	 */
+	function setupVersionInfo (matrix, version) {
+	  const size = matrix.size;
+	  const bits = Version.getEncodedBits(version);
+	  let row, col, mod;
+
+	  for (let i = 0; i < 18; i++) {
+	    row = Math.floor(i / 3);
+	    col = i % 3 + size - 8 - 3;
+	    mod = ((bits >> i) & 1) === 1;
+
+	    matrix.set(row, col, mod, true);
+	    matrix.set(col, row, mod, true);
+	  }
+	}
+
+	/**
+	 * Add format info bits to matrix
+	 *
+	 * @param  {BitMatrix} matrix               Modules matrix
+	 * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level
+	 * @param  {Number}    maskPattern          Mask pattern reference value
+	 */
+	function setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {
+	  const size = matrix.size;
+	  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern);
+	  let i, mod;
+
+	  for (i = 0; i < 15; i++) {
+	    mod = ((bits >> i) & 1) === 1;
+
+	    // vertical
+	    if (i < 6) {
+	      matrix.set(i, 8, mod, true);
+	    } else if (i < 8) {
+	      matrix.set(i + 1, 8, mod, true);
+	    } else {
+	      matrix.set(size - 15 + i, 8, mod, true);
+	    }
+
+	    // horizontal
+	    if (i < 8) {
+	      matrix.set(8, size - i - 1, mod, true);
+	    } else if (i < 9) {
+	      matrix.set(8, 15 - i - 1 + 1, mod, true);
+	    } else {
+	      matrix.set(8, 15 - i - 1, mod, true);
+	    }
+	  }
+
+	  // fixed module
+	  matrix.set(size - 8, 8, 1, true);
+	}
+
+	/**
+	 * Add encoded data bits to matrix
+	 *
+	 * @param  {BitMatrix}  matrix Modules matrix
+	 * @param  {Uint8Array} data   Data codewords
+	 */
+	function setupData (matrix, data) {
+	  const size = matrix.size;
+	  let inc = -1;
+	  let row = size - 1;
+	  let bitIndex = 7;
+	  let byteIndex = 0;
+
+	  for (let col = size - 1; col > 0; col -= 2) {
+	    if (col === 6) col--;
+
+	    while (true) {
+	      for (let c = 0; c < 2; c++) {
+	        if (!matrix.isReserved(row, col - c)) {
+	          let dark = false;
+
+	          if (byteIndex < data.length) {
+	            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1);
+	          }
+
+	          matrix.set(row, col - c, dark);
+	          bitIndex--;
+
+	          if (bitIndex === -1) {
+	            byteIndex++;
+	            bitIndex = 7;
+	          }
+	        }
+	      }
+
+	      row += inc;
+
+	      if (row < 0 || size <= row) {
+	        row -= inc;
+	        inc = -inc;
+	        break
+	      }
+	    }
+	  }
+	}
+
+	/**
+	 * Create encoded codewords from data input
+	 *
+	 * @param  {Number}   version              QR Code version
+	 * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level
+	 * @param  {ByteData} data                 Data input
+	 * @return {Uint8Array}                    Buffer containing encoded codewords
+	 */
+	function createData (version, errorCorrectionLevel, segments) {
+	  // Prepare data buffer
+	  const buffer = new BitBuffer();
+
+	  segments.forEach(function (data) {
+	    // prefix data with mode indicator (4 bits)
+	    buffer.put(data.mode.bit, 4);
+
+	    // Prefix data with character count indicator.
+	    // The character count indicator is a string of bits that represents the
+	    // number of characters that are being encoded.
+	    // The character count indicator must be placed after the mode indicator
+	    // and must be a certain number of bits long, depending on the QR version
+	    // and data mode
+	    // @see {@link Mode.getCharCountIndicator}.
+	    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version));
+
+	    // add binary data sequence to buffer
+	    data.write(buffer);
+	  });
+
+	  // Calculate required number of bits
+	  const totalCodewords = Utils.getSymbolTotalCodewords(version);
+	  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel);
+	  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
+
+	  // Add a terminator.
+	  // If the bit string is shorter than the total number of required bits,
+	  // a terminator of up to four 0s must be added to the right side of the string.
+	  // If the bit string is more than four bits shorter than the required number of bits,
+	  // add four 0s to the end.
+	  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
+	    buffer.put(0, 4);
+	  }
+
+	  // If the bit string is fewer than four bits shorter, add only the number of 0s that
+	  // are needed to reach the required number of bits.
+
+	  // After adding the terminator, if the number of bits in the string is not a multiple of 8,
+	  // pad the string on the right with 0s to make the string's length a multiple of 8.
+	  while (buffer.getLengthInBits() % 8 !== 0) {
+	    buffer.putBit(0);
+	  }
+
+	  // Add pad bytes if the string is still shorter than the total number of required bits.
+	  // Extend the buffer to fill the data capacity of the symbol corresponding to
+	  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)
+	  // and 00010001 (0x11) alternately.
+	  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8;
+	  for (let i = 0; i < remainingByte; i++) {
+	    buffer.put(i % 2 ? 0x11 : 0xEC, 8);
+	  }
+
+	  return createCodewords(buffer, version, errorCorrectionLevel)
+	}
+
+	/**
+	 * Encode input data with Reed-Solomon and return codewords with
+	 * relative error correction bits
+	 *
+	 * @param  {BitBuffer} bitBuffer            Data to encode
+	 * @param  {Number}    version              QR Code version
+	 * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level
+	 * @return {Uint8Array}                     Buffer containing encoded codewords
+	 */
+	function createCodewords (bitBuffer, version, errorCorrectionLevel) {
+	  // Total codewords for this QR code version (Data + Error correction)
+	  const totalCodewords = Utils.getSymbolTotalCodewords(version);
+
+	  // Total number of error correction codewords
+	  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel);
+
+	  // Total number of data codewords
+	  const dataTotalCodewords = totalCodewords - ecTotalCodewords;
+
+	  // Total number of blocks
+	  const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel);
+
+	  // Calculate how many blocks each group should contain
+	  const blocksInGroup2 = totalCodewords % ecTotalBlocks;
+	  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2;
+
+	  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks);
+
+	  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks);
+	  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1;
+
+	  // Number of EC codewords is the same for both groups
+	  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1;
+
+	  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount
+	  const rs = new ReedSolomonEncoder(ecCount);
+
+	  let offset = 0;
+	  const dcData = new Array(ecTotalBlocks);
+	  const ecData = new Array(ecTotalBlocks);
+	  let maxDataSize = 0;
+	  const buffer = new Uint8Array(bitBuffer.buffer);
+
+	  // Divide the buffer into the required number of blocks
+	  for (let b = 0; b < ecTotalBlocks; b++) {
+	    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2;
+
+	    // extract a block of data from buffer
+	    dcData[b] = buffer.slice(offset, offset + dataSize);
+
+	    // Calculate EC codewords for this data block
+	    ecData[b] = rs.encode(dcData[b]);
+
+	    offset += dataSize;
+	    maxDataSize = Math.max(maxDataSize, dataSize);
+	  }
+
+	  // Create final data
+	  // Interleave the data and error correction codewords from each block
+	  const data = new Uint8Array(totalCodewords);
+	  let index = 0;
+	  let i, r;
+
+	  // Add data codewords
+	  for (i = 0; i < maxDataSize; i++) {
+	    for (r = 0; r < ecTotalBlocks; r++) {
+	      if (i < dcData[r].length) {
+	        data[index++] = dcData[r][i];
+	      }
+	    }
+	  }
+
+	  // Apped EC codewords
+	  for (i = 0; i < ecCount; i++) {
+	    for (r = 0; r < ecTotalBlocks; r++) {
+	      data[index++] = ecData[r][i];
+	    }
+	  }
+
+	  return data
+	}
+
+	/**
+	 * Build QR Code symbol
+	 *
+	 * @param  {String} data                 Input string
+	 * @param  {Number} version              QR Code version
+	 * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level
+	 * @param  {MaskPattern} maskPattern     Mask pattern
+	 * @return {Object}                      Object containing symbol data
+	 */
+	function createSymbol (data, version, errorCorrectionLevel, maskPattern) {
+	  let segments;
+
+	  if (Array.isArray(data)) {
+	    segments = Segments.fromArray(data);
+	  } else if (typeof data === 'string') {
+	    let estimatedVersion = version;
+
+	    if (!estimatedVersion) {
+	      const rawSegments = Segments.rawSplit(data);
+
+	      // Estimate best version that can contain raw splitted segments
+	      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel);
+	    }
+
+	    // Build optimized segments
+	    // If estimated version is undefined, try with the highest version
+	    segments = Segments.fromString(data, estimatedVersion || 40);
+	  } else {
+	    throw new Error('Invalid data')
+	  }
+
+	  // Get the min version that can contain data
+	  const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel);
+
+	  // If no version is found, data cannot be stored
+	  if (!bestVersion) {
+	    throw new Error('The amount of data is too big to be stored in a QR Code')
+	  }
+
+	  // If not specified, use min version as default
+	  if (!version) {
+	    version = bestVersion;
+
+	  // Check if the specified version can contain the data
+	  } else if (version < bestVersion) {
+	    throw new Error('\n' +
+	      'The chosen QR Code version cannot contain this amount of data.\n' +
+	      'Minimum version required to store current data is: ' + bestVersion + '.\n'
+	    )
+	  }
+
+	  const dataBits = createData(version, errorCorrectionLevel, segments);
+
+	  // Allocate matrix buffer
+	  const moduleCount = Utils.getSymbolSize(version);
+	  const modules = new BitMatrix(moduleCount);
+
+	  // Add function modules
+	  setupFinderPattern(modules, version);
+	  setupTimingPattern(modules);
+	  setupAlignmentPattern(modules, version);
+
+	  // Add temporary dummy bits for format info just to set them as reserved.
+	  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}
+	  // since the masking operation must be performed only on the encoding region.
+	  // These blocks will be replaced with correct values later in code.
+	  setupFormatInfo(modules, errorCorrectionLevel, 0);
+
+	  if (version >= 7) {
+	    setupVersionInfo(modules, version);
+	  }
+
+	  // Add data codewords
+	  setupData(modules, dataBits);
+
+	  if (isNaN(maskPattern)) {
+	    // Find best mask pattern
+	    maskPattern = MaskPattern.getBestMask(modules,
+	      setupFormatInfo.bind(null, modules, errorCorrectionLevel));
+	  }
+
+	  // Apply mask pattern
+	  MaskPattern.applyMask(maskPattern, modules);
+
+	  // Replace format info bits with correct values
+	  setupFormatInfo(modules, errorCorrectionLevel, maskPattern);
+
+	  return {
+	    modules: modules,
+	    version: version,
+	    errorCorrectionLevel: errorCorrectionLevel,
+	    maskPattern: maskPattern,
+	    segments: segments
+	  }
+	}
+
+	/**
+	 * QR Code
+	 *
+	 * @param {String | Array} data                 Input data
+	 * @param {Object} options                      Optional configurations
+	 * @param {Number} options.version              QR Code version
+	 * @param {String} options.errorCorrectionLevel Error correction level
+	 * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis
+	 */
+	qrcode.__exports.create = function create (data, options) {
+	  if (typeof data === 'undefined' || data === '') {
+	    throw new Error('No input text')
+	  }
+
+	  let errorCorrectionLevel = ECLevel.M;
+	  let version;
+	  let mask;
+
+	  if (typeof options !== 'undefined') {
+	    // Use higher error correction level as default
+	    errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M);
+	    version = Version.from(options.version);
+	    mask = MaskPattern.from(options.maskPattern);
+
+	    if (options.toSJISFunc) {
+	      Utils.setToSJISFunction(options.toSJISFunc);
+	    }
+	  }
+
+	  return createSymbol(data, version, errorCorrectionLevel, mask)
+	};
+	return qrcode.__exports;
+}
+
+exports.__require = requireQrcode;
+//# sourceMappingURL=qrcode.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"qrcode.js","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","qrcode"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAAA,CAAA,MAAM,KAAK,GAAGA,eAAA;AACd,CAAA,MAAM,OAAO,GAAGC,8BAAA;AAChB,CAAA,MAAM,SAAS,GAAGC,mBAAA;AAClB,CAAA,MAAM,SAAS,GAAGC,mBAAA;AAClB,CAAA,MAAM,gBAAgB,GAAGC,0BAAA;AACzB,CAAA,MAAM,aAAa,GAAGC,uBAAA;AACtB,CAAA,MAAM,WAAW,GAAGC,qBAAA;AACpB,CAAA,MAAM,MAAM,GAAGC,6BAAA;AACf,CAAA,MAAM,kBAAkB,GAAGC,4BAAA;AAC3B,CAAA,MAAM,OAAO,GAAGC,iBAAA;AAChB,CAAA,MAAM,UAAU,GAAGC,oBAAA;AACnB,CAAA,MAAM,IAAI,GAAGC,cAAA;AACb,CAAA,MAAM,QAAQ,GAAGC,kBAAA;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,kBAAkB,EAAE,MAAM,EAAE,OAAO,EAAE;AAC9C,GAAE,MAAM,IAAI,GAAG,MAAM,CAAC;AACtB,GAAE,MAAM,GAAG,GAAG,aAAa,CAAC,YAAY,CAAC,OAAO;;AAEhD,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;KACnC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACpB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;;AAExB,KAAI,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAClC,OAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,GAAG,CAAC,EAAE;;AAE5C,OAAM,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACpC,SAAQ,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,GAAG,CAAC,EAAE;;AAE9C,SAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACrD,YAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACpD,YAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;AAClD,WAAU,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI;AACjD,SAAA,CAAS,MAAM;AACf,WAAU,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI;AAClD,SAAA;AACA,OAAA;AACA,KAAA;AACA,GAAA;AACA,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,kBAAkB,EAAE,MAAM,EAAE;AACrC,GAAE,MAAM,IAAI,GAAG,MAAM,CAAC;;AAEtB,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACrC,KAAI,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK;KACxB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI;KAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI;AAChC,GAAA;AACA,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,qBAAqB,EAAE,MAAM,EAAE,OAAO,EAAE;AACjD,GAAE,MAAM,GAAG,GAAG,gBAAgB,CAAC,YAAY,CAAC,OAAO;;AAEnD,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;KACnC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;KACpB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;;AAExB,KAAI,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAClC,OAAM,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACpC,SAAQ,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC;YAC3C,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;AAChC,WAAU,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI;AACjD,SAAA,CAAS,MAAM;AACf,WAAU,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI;AAClD,SAAA;AACA,OAAA;AACA,KAAA;AACA,GAAA;AACA,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,gBAAgB,EAAE,MAAM,EAAE,OAAO,EAAE;AAC5C,GAAE,MAAM,IAAI,GAAG,MAAM,CAAC;AACtB,GAAE,MAAM,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,OAAO;AAC7C,GAAE,IAAI,GAAG,EAAE,GAAG,EAAE;;AAEhB,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;KAC3B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;KACtB,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG;KACzB,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;;KAE5B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;KAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;AAClC,GAAA;AACA,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,eAAe,EAAE,MAAM,EAAE,oBAAoB,EAAE,WAAW,EAAE;AACrE,GAAE,MAAM,IAAI,GAAG,MAAM,CAAC;GACpB,MAAM,IAAI,GAAG,UAAU,CAAC,cAAc,CAAC,oBAAoB,EAAE,WAAW;GACxE,IAAI,CAAC,EAAE;;GAEP,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;KACvB,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;;AAEhC;AACA,KAAI,IAAI,CAAC,GAAG,CAAC,EAAE;OACT,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI;AAChC,KAAA,CAAK,MAAM,IAAI,CAAC,GAAG,CAAC,EAAE;AACtB,OAAM,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI;AACpC,KAAA,CAAK,MAAM;AACX,OAAM,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI;AAC5C,KAAA;;AAEA;AACA,KAAI,IAAI,CAAC,GAAG,CAAC,EAAE;AACf,OAAM,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI;AAC3C,KAAA,CAAK,MAAM,IAAI,CAAC,GAAG,CAAC,EAAE;AACtB,OAAM,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI;AAC7C,KAAA,CAAK,MAAM;AACX,OAAM,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI;AACzC,KAAA;AACA,GAAA;;AAEA;AACA,GAAE,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI;AACjC,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE;AAClC,GAAE,MAAM,IAAI,GAAG,MAAM,CAAC;GACpB,IAAI,GAAG,GAAG;AACZ,GAAE,IAAI,GAAG,GAAG,IAAI,GAAG;GACjB,IAAI,QAAQ,GAAG;GACf,IAAI,SAAS,GAAG;;AAElB,GAAE,KAAK,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE;AAC9C,KAAI,IAAI,GAAG,KAAK,CAAC,EAAE,GAAG;;KAElB,OAAO,IAAI,EAAE;AACjB,OAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAClC,SAAQ,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE;WACpC,IAAI,IAAI,GAAG;;AAErB,WAAU,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE;AACvC,aAAY,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC;AAC9D,WAAA;;WAEU,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,IAAI;AACvC,WAAU,QAAQ;;AAElB,WAAU,IAAI,QAAQ,KAAK,EAAE,EAAE;AAC/B,aAAY,SAAS;AACrB,aAAY,QAAQ,GAAG;AACvB,WAAA;AACA,SAAA;AACA,OAAA;;AAEA,OAAM,GAAG,IAAI;;OAEP,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,EAAE;AAClC,SAAQ,GAAG,IAAI;SACP,GAAG,GAAG,CAAC;SACP;AACR,OAAA;AACA,KAAA;AACA,GAAA;AACA,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,UAAU,EAAE,OAAO,EAAE,oBAAoB,EAAE,QAAQ,EAAE;AAC9D;AACA,GAAE,MAAM,MAAM,GAAG,IAAI,SAAS;;AAE9B,GAAE,QAAQ,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE;AACnC;KACI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;;AAE/E;AACA,KAAI,IAAI,CAAC,KAAK,CAAC,MAAM;GACrB,CAAG;;AAEH;AACA,GAAE,MAAM,cAAc,GAAG,KAAK,CAAC,uBAAuB,CAAC,OAAO;GAC5D,MAAM,gBAAgB,GAAG,MAAM,CAAC,sBAAsB,CAAC,OAAO,EAAE,oBAAoB;AACtF,GAAE,MAAM,sBAAsB,GAAG,CAAC,cAAc,GAAG,gBAAgB,IAAI;;AAEvE;AACA;AACA;AACA;AACA;GACE,IAAI,MAAM,CAAC,eAAe,EAAE,GAAG,CAAC,IAAI,sBAAsB,EAAE;AAC9D,KAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AACnB,GAAA;;AAEA;AACA;;AAEA;AACA;GACE,OAAO,MAAM,CAAC,eAAe,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;AAC7C,KAAI,MAAM,CAAC,MAAM,CAAC,CAAC;AACnB,GAAA;;AAEA;AACA;AACA;AACA;GACE,MAAM,aAAa,GAAG,CAAC,sBAAsB,GAAG,MAAM,CAAC,eAAe,EAAE,IAAI;AAC9E,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;AAC1C,KAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC;AACrC,GAAA;;AAEA,GAAE,OAAO,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,oBAAoB;AAC9D,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,eAAe,EAAE,SAAS,EAAE,OAAO,EAAE,oBAAoB,EAAE;AACpE;AACA,GAAE,MAAM,cAAc,GAAG,KAAK,CAAC,uBAAuB,CAAC,OAAO;;AAE9D;GACE,MAAM,gBAAgB,GAAG,MAAM,CAAC,sBAAsB,CAAC,OAAO,EAAE,oBAAoB;;AAEtF;AACA,GAAE,MAAM,kBAAkB,GAAG,cAAc,GAAG;;AAE9C;GACE,MAAM,aAAa,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,oBAAoB;;AAE3E;AACA,GAAE,MAAM,cAAc,GAAG,cAAc,GAAG;AAC1C,GAAE,MAAM,cAAc,GAAG,aAAa,GAAG;;GAEvC,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,aAAa;;GAExE,MAAM,qBAAqB,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,GAAG,aAAa;AAC7E,GAAE,MAAM,qBAAqB,GAAG,qBAAqB,GAAG;;AAExD;AACA,GAAE,MAAM,OAAO,GAAG,sBAAsB,GAAG;;AAE3C;AACA,GAAE,MAAM,EAAE,GAAG,IAAI,kBAAkB,CAAC,OAAO;;GAEzC,IAAI,MAAM,GAAG;AACf,GAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa;AACxC,GAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa;GACtC,IAAI,WAAW,GAAG;GAClB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM;;AAEhD;AACA,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;KACtC,MAAM,QAAQ,GAAG,CAAC,GAAG,cAAc,GAAG,qBAAqB,GAAG;;AAElE;AACA,KAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,QAAQ;;AAEtD;AACA,KAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;;AAEnC,KAAI,MAAM,IAAI;KACV,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ;AAChD,GAAA;;AAEA;AACA;AACA,GAAE,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,cAAc;GAC1C,IAAI,KAAK,GAAG;GACZ,IAAI,CAAC,EAAE;;AAET;GACE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;KAChC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;OAClC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;SACxB,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,OAAA;AACA,KAAA;AACA,GAAA;;AAEA;GACE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;KAC5B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;OAClC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,KAAA;AACA,GAAA;;AAEA,GAAE,OAAO;AACT,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,YAAY,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE;AACzE,GAAE,IAAI;;AAEN,GAAE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC3B,KAAI,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,IAAI;AACtC,GAAA,CAAG,MAAM,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;KACnC,IAAI,gBAAgB,GAAG;;KAEvB,IAAI,CAAC,gBAAgB,EAAE;AAC3B,OAAM,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI;;AAEhD;OACM,gBAAgB,GAAG,OAAO,CAAC,qBAAqB,CAAC,WAAW,EAAE,oBAAoB;AACxF,KAAA;;AAEA;AACA;KACI,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,IAAI,EAAE;AAC/D,GAAA,CAAG,MAAM;AACT,KAAI,MAAM,IAAI,KAAK,CAAC,cAAc;AAClC,GAAA;;AAEA;GACE,MAAM,WAAW,GAAG,OAAO,CAAC,qBAAqB,CAAC,QAAQ,EAAE,oBAAoB;;AAElF;GACE,IAAI,CAAC,WAAW,EAAE;AACpB,KAAI,MAAM,IAAI,KAAK,CAAC,yDAAyD;AAC7E,GAAA;;AAEA;GACE,IAAI,CAAC,OAAO,EAAE;AAChB,KAAI,OAAO,GAAG;;AAEd;AACA,GAAA,CAAG,MAAM,IAAI,OAAO,GAAG,WAAW,EAAE;AACpC,KAAI,MAAM,IAAI,KAAK,CAAC,IAAI;AACxB,OAAM,kEAAkE;OAClE,qDAAqD,GAAG,WAAW,GAAG;AAC5E;AACA,GAAA;;GAEE,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,EAAE,oBAAoB,EAAE,QAAQ;;AAErE;AACA,GAAE,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,OAAO;AACjD,GAAE,MAAM,OAAO,GAAG,IAAI,SAAS,CAAC,WAAW;;AAE3C;AACA,GAAE,kBAAkB,CAAC,OAAO,EAAE,OAAO;GACnC,kBAAkB,CAAC,OAAO;AAC5B,GAAE,qBAAqB,CAAC,OAAO,EAAE,OAAO;;AAExC;AACA;AACA;AACA;AACA,GAAE,eAAe,CAAC,OAAO,EAAE,oBAAoB,EAAE,CAAC;;AAElD,GAAE,IAAI,OAAO,IAAI,CAAC,EAAE;AACpB,KAAI,gBAAgB,CAAC,OAAO,EAAE,OAAO;AACrC,GAAA;;AAEA;AACA,GAAE,SAAS,CAAC,OAAO,EAAE,QAAQ;;AAE7B,GAAE,IAAI,KAAK,CAAC,WAAW,CAAC,EAAE;AAC1B;AACA,KAAI,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,OAAO;OAC3C,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,oBAAoB,CAAC;AAC/D,GAAA;;AAEA;AACA,GAAE,WAAW,CAAC,SAAS,CAAC,WAAW,EAAE,OAAO;;AAE5C;AACA,GAAE,eAAe,CAAC,OAAO,EAAE,oBAAoB,EAAE,WAAW;;AAE5D,GAAE,OAAO;KACL,OAAO,EAAE,OAAO;KAChB,OAAO,EAAE,OAAO;KAChB,oBAAoB,EAAE,oBAAoB;KAC1C,WAAW,EAAE,WAAW;AAC5B,KAAI,QAAQ,EAAE;AACd;AACA,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAC,gBAAA,CAAA,MAAc,GAAG,SAAS,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE;GAC/C,IAAI,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,EAAE,EAAE;AAClD,KAAI,MAAM,IAAI,KAAK,CAAC,eAAe;AACnC,GAAA;;AAEA,GAAE,IAAI,oBAAoB,GAAG,OAAO,CAAC;AACrC,GAAE,IAAI;AACN,GAAE,IAAI;;AAEN,GAAE,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;AACtC;AACA,KAAI,oBAAoB,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC;KAC3E,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO;KACtC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW;;AAE/C,KAAI,IAAI,OAAO,CAAC,UAAU,EAAE;AAC5B,OAAM,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,UAAU;AAChD,KAAA;AACA,GAAA;;GAEE,OAAO,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,IAAI;AAC/D,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.js

@@ -0,0 +1,71 @@
+'use strict';
+
+var polynomial = require('./polynomial.js');
+
+var reedSolomonEncoder;
+var hasRequiredReedSolomonEncoder;
+
+function requireReedSolomonEncoder () {
+	if (hasRequiredReedSolomonEncoder) return reedSolomonEncoder;
+	hasRequiredReedSolomonEncoder = 1;
+	const Polynomial = polynomial.__require();
+
+	function ReedSolomonEncoder (degree) {
+	  this.genPoly = undefined;
+	  this.degree = degree;
+
+	  if (this.degree) this.initialize(this.degree);
+	}
+
+	/**
+	 * Initialize the encoder.
+	 * The input param should correspond to the number of error correction codewords.
+	 *
+	 * @param  {Number} degree
+	 */
+	ReedSolomonEncoder.prototype.initialize = function initialize (degree) {
+	  // create an irreducible generator polynomial
+	  this.degree = degree;
+	  this.genPoly = Polynomial.generateECPolynomial(this.degree);
+	};
+
+	/**
+	 * Encodes a chunk of data
+	 *
+	 * @param  {Uint8Array} data Buffer containing input data
+	 * @return {Uint8Array}      Buffer containing encoded data
+	 */
+	ReedSolomonEncoder.prototype.encode = function encode (data) {
+	  if (!this.genPoly) {
+	    throw new Error('Encoder not initialized')
+	  }
+
+	  // Calculate EC for this data block
+	  // extends data size to data+genPoly size
+	  const paddedData = new Uint8Array(data.length + this.degree);
+	  paddedData.set(data);
+
+	  // The error correction codewords are the remainder after dividing the data codewords
+	  // by a generator polynomial
+	  const remainder = Polynomial.mod(paddedData, this.genPoly);
+
+	  // return EC data blocks (last n byte, where n is the degree of genPoly)
+	  // If coefficients number in remainder are less than genPoly degree,
+	  // pad with 0s to the left to reach the needed number of coefficients
+	  const start = this.degree - remainder.length;
+	  if (start > 0) {
+	    const buff = new Uint8Array(this.degree);
+	    buff.set(remainder, start);
+
+	    return buff
+	  }
+
+	  return remainder
+	};
+
+	reedSolomonEncoder = ReedSolomonEncoder;
+	return reedSolomonEncoder;
+}
+
+exports.__require = requireReedSolomonEncoder;
+//# sourceMappingURL=reed-solomon-encoder.js.map

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon-encoder.js","sources":["../../../../../node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"names":["require$$0"],"mappings":";;;;;;;;;;AAAA,CAAA,MAAM,UAAU,GAAGA,oBAAA;;CAEnB,SAAS,kBAAkB,EAAE,MAAM,EAAE;GACnC,IAAI,CAAC,OAAO,GAAG;GACf,IAAI,CAAC,MAAM,GAAG;;GAEd,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM;AAC9C,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;CACA,kBAAkB,CAAC,SAAS,CAAC,UAAU,GAAG,SAAS,UAAU,EAAE,MAAM,EAAE;AACvE;GACE,IAAI,CAAC,MAAM,GAAG;GACd,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM;AAC5D,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;CACA,kBAAkB,CAAC,SAAS,CAAC,MAAM,GAAG,SAAS,MAAM,EAAE,IAAI,EAAE;AAC7D,GAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACrB,KAAI,MAAM,IAAI,KAAK,CAAC,yBAAyB;AAC7C,GAAA;;AAEA;AACA;AACA,GAAE,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;AAC7D,GAAE,UAAU,CAAC,GAAG,CAAC,IAAI;;AAErB;AACA;GACE,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO;;AAE3D;AACA;AACA;GACE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;AACxC,GAAE,IAAI,KAAK,GAAG,CAAC,EAAE;KACb,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM;AAC3C,KAAI,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK;;AAE7B,KAAI,OAAO;AACX,GAAA;;AAEA,GAAE,OAAO;AACT,CAAA;;AAEA,CAAA,kBAAc,GAAG;;;;;;","x_google_ignoreList":[0]}