@wecom/wecom-openclaw-cli 1.0.15 → 1.0.16

package/dist/node_modules/qrcode/lib/core/bit-matrix.js

@@ -0,0 +1,79 @@
+'use strict';
+
+/**
+ * Helper class to handle QR Code symbol modules
+ *
+ * @param {Number} size Symbol size
+ */
+
+var bitMatrix;
+var hasRequiredBitMatrix;
+
+function requireBitMatrix () {
+	if (hasRequiredBitMatrix) return bitMatrix;
+	hasRequiredBitMatrix = 1;
+	function BitMatrix (size) {
+	  if (!size || size < 1) {
+	    throw new Error('BitMatrix size must be defined and greater than 0')
+	  }
+
+	  this.size = size;
+	  this.data = new Uint8Array(size * size);
+	  this.reservedBit = new Uint8Array(size * size);
+	}
+
+	/**
+	 * Set bit value at specified location
+	 * If reserved flag is set, this bit will be ignored during masking process
+	 *
+	 * @param {Number}  row
+	 * @param {Number}  col
+	 * @param {Boolean} value
+	 * @param {Boolean} reserved
+	 */
+	BitMatrix.prototype.set = function (row, col, value, reserved) {
+	  const index = row * this.size + col;
+	  this.data[index] = value;
+	  if (reserved) this.reservedBit[index] = true;
+	};
+
+	/**
+	 * Returns bit value at specified location
+	 *
+	 * @param  {Number}  row
+	 * @param  {Number}  col
+	 * @return {Boolean}
+	 */
+	BitMatrix.prototype.get = function (row, col) {
+	  return this.data[row * this.size + col]
+	};
+
+	/**
+	 * Applies xor operator at specified location
+	 * (used during masking process)
+	 *
+	 * @param {Number}  row
+	 * @param {Number}  col
+	 * @param {Boolean} value
+	 */
+	BitMatrix.prototype.xor = function (row, col, value) {
+	  this.data[row * this.size + col] ^= value;
+	};
+
+	/**
+	 * Check if bit at specified location is reserved
+	 *
+	 * @param {Number}   row
+	 * @param {Number}   col
+	 * @return {Boolean}
+	 */
+	BitMatrix.prototype.isReserved = function (row, col) {
+	  return this.reservedBit[row * this.size + col]
+	};
+
+	bitMatrix = BitMatrix;
+	return bitMatrix;
+}
+
+exports.__require = requireBitMatrix;
+//# sourceMappingURL=bit-matrix.js.map

package/dist/node_modules/qrcode/lib/core/bit-matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-matrix.js","sources":["../../../../../node_modules/qrcode/lib/core/bit-matrix.js"],"sourcesContent":["/**\n * Helper class to handle QR Code symbol modules\n *\n * @param {Number} size Symbol size\n */\nfunction BitMatrix (size) {\n  if (!size || size < 1) {\n    throw new Error('BitMatrix size must be defined and greater than 0')\n  }\n\n  this.size = size\n  this.data = new Uint8Array(size * size)\n  this.reservedBit = new Uint8Array(size * size)\n}\n\n/**\n * Set bit value at specified location\n * If reserved flag is set, this bit will be ignored during masking process\n *\n * @param {Number}  row\n * @param {Number}  col\n * @param {Boolean} value\n * @param {Boolean} reserved\n */\nBitMatrix.prototype.set = function (row, col, value, reserved) {\n  const index = row * this.size + col\n  this.data[index] = value\n  if (reserved) this.reservedBit[index] = true\n}\n\n/**\n * Returns bit value at specified location\n *\n * @param  {Number}  row\n * @param  {Number}  col\n * @return {Boolean}\n */\nBitMatrix.prototype.get = function (row, col) {\n  return this.data[row * this.size + col]\n}\n\n/**\n * Applies xor operator at specified location\n * (used during masking process)\n *\n * @param {Number}  row\n * @param {Number}  col\n * @param {Boolean} value\n */\nBitMatrix.prototype.xor = function (row, col, value) {\n  this.data[row * this.size + col] ^= value\n}\n\n/**\n * Check if bit at specified location is reserved\n *\n * @param {Number}   row\n * @param {Number}   col\n * @return {Boolean}\n */\nBitMatrix.prototype.isReserved = function (row, col) {\n  return this.reservedBit[row * this.size + col]\n}\n\nmodule.exports = BitMatrix\n"],"names":[],"mappings":";;;;;;;;;;;;;;CAKA,SAAS,SAAS,EAAE,IAAI,EAAE;AAC1B,GAAE,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,EAAE;AACzB,KAAI,MAAM,IAAI,KAAK,CAAC,mDAAmD;AACvE,GAAA;;GAEE,IAAI,CAAC,IAAI,GAAG;GACZ,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,IAAI;GACtC,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,IAAI;AAC/C,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE;GAC7D,MAAM,KAAK,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG;AAClC,GAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;GACnB,IAAI,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG;AAC1C,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,GAAG,EAAE;GAC5C,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG;AACxC,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,CAAC,SAAS,CAAC,GAAG,GAAG,UAAU,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE;AACrD,GAAE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI;AACtC,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,CAAC,SAAS,CAAC,UAAU,GAAG,UAAU,GAAG,EAAE,GAAG,EAAE;GACnD,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG;AAC/C,CAAA;;AAEA,CAAA,SAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/byte-data.js

@@ -0,0 +1,45 @@
+'use strict';
+
+var mode = require('./mode.js');
+
+var byteData;
+var hasRequiredByteData;
+
+function requireByteData () {
+	if (hasRequiredByteData) return byteData;
+	hasRequiredByteData = 1;
+	const Mode = mode.__require();
+
+	function ByteData (data) {
+	  this.mode = Mode.BYTE;
+	  if (typeof (data) === 'string') {
+	    this.data = new TextEncoder().encode(data);
+	  } else {
+	    this.data = new Uint8Array(data);
+	  }
+	}
+
+	ByteData.getBitsLength = function getBitsLength (length) {
+	  return length * 8
+	};
+
+	ByteData.prototype.getLength = function getLength () {
+	  return this.data.length
+	};
+
+	ByteData.prototype.getBitsLength = function getBitsLength () {
+	  return ByteData.getBitsLength(this.data.length)
+	};
+
+	ByteData.prototype.write = function (bitBuffer) {
+	  for (let i = 0, l = this.data.length; i < l; i++) {
+	    bitBuffer.put(this.data[i], 8);
+	  }
+	};
+
+	byteData = ByteData;
+	return byteData;
+}
+
+exports.__require = requireByteData;
+//# sourceMappingURL=byte-data.js.map

package/dist/node_modules/qrcode/lib/core/byte-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"byte-data.js","sources":["../../../../../node_modules/qrcode/lib/core/byte-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction ByteData (data) {\n  this.mode = Mode.BYTE\n  if (typeof (data) === 'string') {\n    this.data = new TextEncoder().encode(data)\n  } else {\n    this.data = new Uint8Array(data)\n  }\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n  return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n  return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n  for (let i = 0, l = this.data.length; i < l; i++) {\n    bitBuffer.put(this.data[i], 8)\n  }\n}\n\nmodule.exports = ByteData\n"],"names":["require$$0"],"mappings":";;;;;;;;;;AAAA,CAAA,MAAM,IAAI,GAAGA,cAAA;;CAEb,SAAS,QAAQ,EAAE,IAAI,EAAE;AACzB,GAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACnB,GAAE,IAAI,QAAQ,IAAI,CAAC,KAAK,QAAQ,EAAE;KAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI;AAC7C,GAAA,CAAG,MAAM;AACT,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI;AACnC,GAAA;AACA,CAAA;;AAEA,CAAA,QAAQ,CAAC,aAAa,GAAG,SAAS,aAAa,EAAE,MAAM,EAAE;GACvD,OAAO,MAAM,GAAG;AAClB,CAAA;;AAEA,CAAA,QAAQ,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,SAAS,IAAI;AACrD,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAA;;AAEA,CAAA,QAAQ,CAAC,SAAS,CAAC,aAAa,GAAG,SAAS,aAAa,IAAI;GAC3D,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;AAChD,CAAA;;AAEA,CAAA,QAAQ,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,SAAS,EAAE;GAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;KAChD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AACjC,GAAA;AACA,CAAA;;AAEA,CAAA,QAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/error-correction-code.js

@@ -0,0 +1,150 @@
+'use strict';
+
+var errorCorrectionCode = require('../../../../_virtual/error-correction-code.js');
+var errorCorrectionLevel = require('./error-correction-level.js');
+
+var hasRequiredErrorCorrectionCode;
+
+function requireErrorCorrectionCode () {
+	if (hasRequiredErrorCorrectionCode) return errorCorrectionCode.__exports;
+	hasRequiredErrorCorrectionCode = 1;
+	const ECLevel = errorCorrectionLevel.__require();
+
+	const EC_BLOCKS_TABLE = [
+	// L  M  Q  H
+	  1, 1, 1, 1,
+	  1, 1, 1, 1,
+	  1, 1, 2, 2,
+	  1, 2, 2, 4,
+	  1, 2, 4, 4,
+	  2, 4, 4, 4,
+	  2, 4, 6, 5,
+	  2, 4, 6, 6,
+	  2, 5, 8, 8,
+	  4, 5, 8, 8,
+	  4, 5, 8, 11,
+	  4, 8, 10, 11,
+	  4, 9, 12, 16,
+	  4, 9, 16, 16,
+	  6, 10, 12, 18,
+	  6, 10, 17, 16,
+	  6, 11, 16, 19,
+	  6, 13, 18, 21,
+	  7, 14, 21, 25,
+	  8, 16, 20, 25,
+	  8, 17, 23, 25,
+	  9, 17, 23, 34,
+	  9, 18, 25, 30,
+	  10, 20, 27, 32,
+	  12, 21, 29, 35,
+	  12, 23, 34, 37,
+	  12, 25, 34, 40,
+	  13, 26, 35, 42,
+	  14, 28, 38, 45,
+	  15, 29, 40, 48,
+	  16, 31, 43, 51,
+	  17, 33, 45, 54,
+	  18, 35, 48, 57,
+	  19, 37, 51, 60,
+	  19, 38, 53, 63,
+	  20, 40, 56, 66,
+	  21, 43, 59, 70,
+	  22, 45, 62, 74,
+	  24, 47, 65, 77,
+	  25, 49, 68, 81
+	];
+
+	const EC_CODEWORDS_TABLE = [
+	// L  M  Q  H
+	  7, 10, 13, 17,
+	  10, 16, 22, 28,
+	  15, 26, 36, 44,
+	  20, 36, 52, 64,
+	  26, 48, 72, 88,
+	  36, 64, 96, 112,
+	  40, 72, 108, 130,
+	  48, 88, 132, 156,
+	  60, 110, 160, 192,
+	  72, 130, 192, 224,
+	  80, 150, 224, 264,
+	  96, 176, 260, 308,
+	  104, 198, 288, 352,
+	  120, 216, 320, 384,
+	  132, 240, 360, 432,
+	  144, 280, 408, 480,
+	  168, 308, 448, 532,
+	  180, 338, 504, 588,
+	  196, 364, 546, 650,
+	  224, 416, 600, 700,
+	  224, 442, 644, 750,
+	  252, 476, 690, 816,
+	  270, 504, 750, 900,
+	  300, 560, 810, 960,
+	  312, 588, 870, 1050,
+	  336, 644, 952, 1110,
+	  360, 700, 1020, 1200,
+	  390, 728, 1050, 1260,
+	  420, 784, 1140, 1350,
+	  450, 812, 1200, 1440,
+	  480, 868, 1290, 1530,
+	  510, 924, 1350, 1620,
+	  540, 980, 1440, 1710,
+	  570, 1036, 1530, 1800,
+	  570, 1064, 1590, 1890,
+	  600, 1120, 1680, 1980,
+	  630, 1204, 1770, 2100,
+	  660, 1260, 1860, 2220,
+	  720, 1316, 1950, 2310,
+	  750, 1372, 2040, 2430
+	];
+
+	/**
+	 * Returns the number of error correction block that the QR Code should contain
+	 * for the specified version and error correction level.
+	 *
+	 * @param  {Number} version              QR Code version
+	 * @param  {Number} errorCorrectionLevel Error correction level
+	 * @return {Number}                      Number of error correction blocks
+	 */
+	errorCorrectionCode.__exports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {
+	  switch (errorCorrectionLevel) {
+	    case ECLevel.L:
+	      return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]
+	    case ECLevel.M:
+	      return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]
+	    case ECLevel.Q:
+	      return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]
+	    case ECLevel.H:
+	      return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]
+	    default:
+	      return undefined
+	  }
+	};
+
+	/**
+	 * Returns the number of error correction codewords to use for the specified
+	 * version and error correction level.
+	 *
+	 * @param  {Number} version              QR Code version
+	 * @param  {Number} errorCorrectionLevel Error correction level
+	 * @return {Number}                      Number of error correction codewords
+	 */
+	errorCorrectionCode.__exports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {
+	  switch (errorCorrectionLevel) {
+	    case ECLevel.L:
+	      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]
+	    case ECLevel.M:
+	      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]
+	    case ECLevel.Q:
+	      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]
+	    case ECLevel.H:
+	      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]
+	    default:
+	      return undefined
+	  }
+	};
+	return errorCorrectionCode.__exports;
+}
+
+exports.__require = requireErrorCorrectionCode;
+//# sourceMappingURL=error-correction-code.js.map

package/dist/node_modules/qrcode/lib/core/error-correction-code.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"error-correction-code.js","sources":["../../../../../node_modules/qrcode/lib/core/error-correction-code.js"],"sourcesContent":["const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L  M  Q  H\r\n  1, 1, 1, 1,\r\n  1, 1, 1, 1,\r\n  1, 1, 2, 2,\r\n  1, 2, 2, 4,\r\n  1, 2, 4, 4,\r\n  2, 4, 4, 4,\r\n  2, 4, 6, 5,\r\n  2, 4, 6, 6,\r\n  2, 5, 8, 8,\r\n  4, 5, 8, 8,\r\n  4, 5, 8, 11,\r\n  4, 8, 10, 11,\r\n  4, 9, 12, 16,\r\n  4, 9, 16, 16,\r\n  6, 10, 12, 18,\r\n  6, 10, 17, 16,\r\n  6, 11, 16, 19,\r\n  6, 13, 18, 21,\r\n  7, 14, 21, 25,\r\n  8, 16, 20, 25,\r\n  8, 17, 23, 25,\r\n  9, 17, 23, 34,\r\n  9, 18, 25, 30,\r\n  10, 20, 27, 32,\r\n  12, 21, 29, 35,\r\n  12, 23, 34, 37,\r\n  12, 25, 34, 40,\r\n  13, 26, 35, 42,\r\n  14, 28, 38, 45,\r\n  15, 29, 40, 48,\r\n  16, 31, 43, 51,\r\n  17, 33, 45, 54,\r\n  18, 35, 48, 57,\r\n  19, 37, 51, 60,\r\n  19, 38, 53, 63,\r\n  20, 40, 56, 66,\r\n  21, 43, 59, 70,\r\n  22, 45, 62, 74,\r\n  24, 47, 65, 77,\r\n  25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L  M  Q  H\r\n  7, 10, 13, 17,\r\n  10, 16, 22, 28,\r\n  15, 26, 36, 44,\r\n  20, 36, 52, 64,\r\n  26, 48, 72, 88,\r\n  36, 64, 96, 112,\r\n  40, 72, 108, 130,\r\n  48, 88, 132, 156,\r\n  60, 110, 160, 192,\r\n  72, 130, 192, 224,\r\n  80, 150, 224, 264,\r\n  96, 176, 260, 308,\r\n  104, 198, 288, 352,\r\n  120, 216, 320, 384,\r\n  132, 240, 360, 432,\r\n  144, 280, 408, 480,\r\n  168, 308, 448, 532,\r\n  180, 338, 504, 588,\r\n  196, 364, 546, 650,\r\n  224, 416, 600, 700,\r\n  224, 442, 644, 750,\r\n  252, 476, 690, 816,\r\n  270, 504, 750, 900,\r\n  300, 560, 810, 960,\r\n  312, 588, 870, 1050,\r\n  336, 644, 952, 1110,\r\n  360, 700, 1020, 1200,\r\n  390, 728, 1050, 1260,\r\n  420, 784, 1140, 1350,\r\n  450, 812, 1200, 1440,\r\n  480, 868, 1290, 1530,\r\n  510, 924, 1350, 1620,\r\n  540, 980, 1440, 1710,\r\n  570, 1036, 1530, 1800,\r\n  570, 1064, 1590, 1890,\r\n  600, 1120, 1680, 1980,\r\n  630, 1204, 1770, 2100,\r\n  660, 1260, 1860, 2220,\r\n  720, 1316, 1950, 2310,\r\n  750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n"],"names":["require$$0","errorCorrectionCode"],"mappings":";;;;;;;;;;CAAA,MAAM,OAAO,GAAGA,8BAAA,GAAmC;AACnD;AACA,CAAA,MAAM,eAAe,GAAG;AACxB;AACA,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AACZ,GAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;AACb,GAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE;AACd,GAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE;AACd,GAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE;AACd,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;GACf;AACD;AACA,CAAA,MAAM,kBAAkB,GAAG;AAC3B;AACA,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AACf,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAChB,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG;AACjB,GAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG;AAClB,GAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG;AAClB,GAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACnB,GAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACnB,GAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACnB,GAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACnB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;AACpB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;AACrB,GAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;AACrB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;AACtB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AACvB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AACvB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AACvB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AACvB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AACvB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;AACvB,GAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;GACtB;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAC,6BAAA,CAAA,cAAsB,GAAG,SAAS,cAAc,EAAE,OAAO,EAAE,oBAAoB,EAAE;AACjF,GAAE,QAAQ,oBAAoB;KAC1B,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,eAAe,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC/C,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,eAAe,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC/C,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,eAAe,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC/C,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,eAAe,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAC/C;AACJ,OAAM,OAAO,SAAS;IACnB;CACH,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,6BAAA,CAAA,sBAA8B,GAAG,SAAS,sBAAsB,EAAE,OAAO,EAAE,oBAAoB,EAAE;AACjG,GAAE,QAAQ,oBAAoB;KAC1B,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,kBAAkB,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAClD,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,kBAAkB,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAClD,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,kBAAkB,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAClD,KAAK,OAAO,CAAC,CAAC;OACZ,OAAO,kBAAkB,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAClD;AACJ,OAAM,OAAO,SAAS;IACnB;AACH,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/error-correction-level.js

@@ -0,0 +1,66 @@
+'use strict';
+
+var errorCorrectionLevel = require('../../../../_virtual/error-correction-level.js');
+
+var hasRequiredErrorCorrectionLevel;
+
+function requireErrorCorrectionLevel () {
+	if (hasRequiredErrorCorrectionLevel) return errorCorrectionLevel.__exports;
+	hasRequiredErrorCorrectionLevel = 1;
+	(function (exports$1) {
+		exports$1.L = { bit: 1 };
+		exports$1.M = { bit: 0 };
+		exports$1.Q = { bit: 3 };
+		exports$1.H = { bit: 2 };
+
+		function fromString (string) {
+		  if (typeof string !== 'string') {
+		    throw new Error('Param is not a string')
+		  }
+
+		  const lcStr = string.toLowerCase();
+
+		  switch (lcStr) {
+		    case 'l':
+		    case 'low':
+		      return exports$1.L
+
+		    case 'm':
+		    case 'medium':
+		      return exports$1.M
+
+		    case 'q':
+		    case 'quartile':
+		      return exports$1.Q
+
+		    case 'h':
+		    case 'high':
+		      return exports$1.H
+
+		    default:
+		      throw new Error('Unknown EC Level: ' + string)
+		  }
+		}
+
+		exports$1.isValid = function isValid (level) {
+		  return level && typeof level.bit !== 'undefined' &&
+		    level.bit >= 0 && level.bit < 4
+		};
+
+		exports$1.from = function from (value, defaultValue) {
+		  if (exports$1.isValid(value)) {
+		    return value
+		  }
+
+		  try {
+		    return fromString(value)
+		  } catch (e) {
+		    return defaultValue
+		  }
+		}; 
+	} (errorCorrectionLevel.__exports));
+	return errorCorrectionLevel.__exports;
+}
+
+exports.__require = requireErrorCorrectionLevel;
+//# sourceMappingURL=error-correction-level.js.map

package/dist/node_modules/qrcode/lib/core/error-correction-level.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"error-correction-level.js","sources":["../../../../../node_modules/qrcode/lib/core/error-correction-level.js"],"sourcesContent":["exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'l':\n    case 'low':\n      return exports.L\n\n    case 'm':\n    case 'medium':\n      return exports.M\n\n    case 'q':\n    case 'quartile':\n      return exports.Q\n\n    case 'h':\n    case 'high':\n      return exports.H\n\n    default:\n      throw new Error('Unknown EC Level: ' + string)\n  }\n}\n\nexports.isValid = function isValid (level) {\n  return level && typeof level.bit !== 'undefined' &&\n    level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["exports"],"mappings":";;;;;;;;;;EAAAA,SAAA,CAAA,CAAA,GAAY,EAAE,GAAG,EAAE,CAAC;EACpBA,SAAA,CAAA,CAAA,GAAY,EAAE,GAAG,EAAE,CAAC;EACpBA,SAAA,CAAA,CAAA,GAAY,EAAE,GAAG,EAAE,CAAC;EACpBA,SAAA,CAAA,CAAA,GAAY,EAAE,GAAG,EAAE,CAAC;;EAEpB,SAAS,UAAU,EAAE,MAAM,EAAE;AAC7B,IAAE,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;AAClC,MAAI,MAAM,IAAI,KAAK,CAAC,uBAAuB;AAC3C,IAAA;;AAEA,IAAE,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW;;AAElC,IAAE,QAAQ,KAAK;AACf,MAAI,KAAK,GAAG;AACZ,MAAI,KAAK,KAAK;QACR,OAAOA,SAAO,CAAC;;AAErB,MAAI,KAAK,GAAG;AACZ,MAAI,KAAK,QAAQ;QACX,OAAOA,SAAO,CAAC;;AAErB,MAAI,KAAK,GAAG;AACZ,MAAI,KAAK,UAAU;QACb,OAAOA,SAAO,CAAC;;AAErB,MAAI,KAAK,GAAG;AACZ,MAAI,KAAK,MAAM;QACT,OAAOA,SAAO,CAAC;;MAEjB;AACJ,QAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,MAAM;AACnD;AACA,EAAA;;AAEA,EAAAA,SAAA,CAAA,OAAA,GAAkB,SAAS,OAAO,EAAE,KAAK,EAAE;IACzC,OAAO,KAAK,IAAI,OAAO,KAAK,CAAC,GAAG,KAAK,WAAW;MAC9C,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,GAAG;AAClC,EAAA;;AAEA,EAAAA,SAAA,CAAA,IAAA,GAAe,SAAS,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE;AACnD,IAAE,IAAIA,SAAO,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC9B,MAAI,OAAO;AACX,IAAA;;AAEA,IAAE,IAAI;MACF,OAAO,UAAU,CAAC,KAAK;IAC3B,CAAG,CAAC,OAAO,CAAC,EAAE;AACd,MAAI,OAAO;AACX,IAAA;AACA,EAAA,EAAA;;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/finder-pattern.js

@@ -0,0 +1,37 @@
+'use strict';
+
+var finderPattern = require('../../../../_virtual/finder-pattern.js');
+var utils = require('./utils.js');
+
+var hasRequiredFinderPattern;
+
+function requireFinderPattern () {
+	if (hasRequiredFinderPattern) return finderPattern.__exports;
+	hasRequiredFinderPattern = 1;
+	const getSymbolSize = utils.__require().getSymbolSize;
+	const FINDER_PATTERN_SIZE = 7;
+
+	/**
+	 * Returns an array containing the positions of each finder pattern.
+	 * Each array's element represent the top-left point of the pattern as (x, y) coordinates
+	 *
+	 * @param  {Number} version QR Code version
+	 * @return {Array}          Array of coordinates
+	 */
+	finderPattern.__exports.getPositions = function getPositions (version) {
+	  const size = getSymbolSize(version);
+
+	  return [
+	    // top-left
+	    [0, 0],
+	    // top-right
+	    [size - FINDER_PATTERN_SIZE, 0],
+	    // bottom-left
+	    [0, size - FINDER_PATTERN_SIZE]
+	  ]
+	};
+	return finderPattern.__exports;
+}
+
+exports.__require = requireFinderPattern;
+//# sourceMappingURL=finder-pattern.js.map

package/dist/node_modules/qrcode/lib/core/finder-pattern.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finder-pattern.js","sources":["../../../../../node_modules/qrcode/lib/core/finder-pattern.js"],"sourcesContent":["const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const size = getSymbolSize(version)\n\n  return [\n    // top-left\n    [0, 0],\n    // top-right\n    [size - FINDER_PATTERN_SIZE, 0],\n    // bottom-left\n    [0, size - FINDER_PATTERN_SIZE]\n  ]\n}\n"],"names":["require$$0","finderPattern"],"mappings":";;;;;;;;;;CAAA,MAAM,aAAa,GAAGA,eAAA,EAAkB,CAAC;AACzC,CAAA,MAAM,mBAAmB,GAAG;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAC,uBAAA,CAAA,YAAoB,GAAG,SAAS,YAAY,EAAE,OAAO,EAAE;AACvD,GAAE,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO;;AAEpC,GAAE,OAAO;AACT;AACA,KAAI,CAAC,CAAC,EAAE,CAAC,CAAC;AACV;AACA,KAAI,CAAC,IAAI,GAAG,mBAAmB,EAAE,CAAC,CAAC;AACnC;AACA,KAAI,CAAC,CAAC,EAAE,IAAI,GAAG,mBAAmB;AAClC;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/format-info.js

@@ -0,0 +1,44 @@
+'use strict';
+
+var formatInfo = require('../../../../_virtual/format-info.js');
+var utils = require('./utils.js');
+
+var hasRequiredFormatInfo;
+
+function requireFormatInfo () {
+	if (hasRequiredFormatInfo) return formatInfo.__exports;
+	hasRequiredFormatInfo = 1;
+	const Utils = utils.__require();
+
+	const G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0);
+	const G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1);
+	const G15_BCH = Utils.getBCHDigit(G15);
+
+	/**
+	 * Returns format information with relative error correction bits
+	 *
+	 * The format information is a 15-bit sequence containing 5 data bits,
+	 * with 10 error correction bits calculated using the (15, 5) BCH code.
+	 *
+	 * @param  {Number} errorCorrectionLevel Error correction level
+	 * @param  {Number} mask                 Mask pattern
+	 * @return {Number}                      Encoded format information bits
+	 */
+	formatInfo.__exports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {
+	  const data = ((errorCorrectionLevel.bit << 3) | mask);
+	  let d = data << 10;
+
+	  while (Utils.getBCHDigit(d) - G15_BCH >= 0) {
+	    d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH));
+	  }
+
+	  // xor final data with mask pattern in order to ensure that
+	  // no combination of Error Correction Level and data mask pattern
+	  // will result in an all-zero data string
+	  return ((data << 10) | d) ^ G15_MASK
+	};
+	return formatInfo.__exports;
+}
+
+exports.__require = requireFormatInfo;
+//# sourceMappingURL=format-info.js.map

package/dist/node_modules/qrcode/lib/core/format-info.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format-info.js","sources":["../../../../../node_modules/qrcode/lib/core/format-info.js"],"sourcesContent":["const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param  {Number} errorCorrectionLevel Error correction level\n * @param  {Number} mask                 Mask pattern\n * @return {Number}                      Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n  const data = ((errorCorrectionLevel.bit << 3) | mask)\n  let d = data << 10\n\n  while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n    d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n  }\n\n  // xor final data with mask pattern in order to ensure that\n  // no combination of Error Correction Level and data mask pattern\n  // will result in an all-zero data string\n  return ((data << 10) | d) ^ G15_MASK\n}\n"],"names":["require$$0","formatInfo"],"mappings":";;;;;;;;;;AAAA,CAAA,MAAM,KAAK,GAAGA,eAAA;;AAEd,CAAA,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;CACtF,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AACvE,CAAA,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAC,oBAAA,CAAA,cAAsB,GAAG,SAAS,cAAc,EAAE,oBAAoB,EAAE,IAAI,EAAE;GAC5E,MAAM,IAAI,IAAI,CAAC,oBAAoB,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI;AACtD,GAAE,IAAI,CAAC,GAAG,IAAI,IAAI;;GAEhB,OAAO,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE;AAC9C,KAAI,CAAC,KAAK,GAAG,KAAK,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;AACjD,GAAA;;AAEA;AACA;AACA;GACE,OAAO,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,IAAI;AAC9B,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/galois-field.js

@@ -0,0 +1,83 @@
+'use strict';
+
+var galoisField = require('../../../../_virtual/galois-field.js');
+
+var hasRequiredGaloisField;
+
+function requireGaloisField () {
+	if (hasRequiredGaloisField) return galoisField.__exports;
+	hasRequiredGaloisField = 1;
+	const EXP_TABLE = new Uint8Array(512);
+	const LOG_TABLE = new Uint8Array(256)
+	/**
+	 * Precompute the log and anti-log tables for faster computation later
+	 *
+	 * For each possible value in the galois field 2^8, we will pre-compute
+	 * the logarithm and anti-logarithm (exponential) of this value
+	 *
+	 * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}
+	 */
+	;(function initTables () {
+	  let x = 1;
+	  for (let i = 0; i < 255; i++) {
+	    EXP_TABLE[i] = x;
+	    LOG_TABLE[x] = i;
+
+	    x <<= 1; // multiply by 2
+
+	    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.
+	    // This means that when a number is 256 or larger, it should be XORed with 0x11D.
+	    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)
+	      x ^= 0x11D;
+	    }
+	  }
+
+	  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to
+	  // stay inside the bounds (because we will mainly use this table for the multiplication of
+	  // two GF numbers, no more).
+	  // @see {@link mul}
+	  for (let i = 255; i < 512; i++) {
+	    EXP_TABLE[i] = EXP_TABLE[i - 255];
+	  }
+	}());
+
+	/**
+	 * Returns log value of n inside Galois Field
+	 *
+	 * @param  {Number} n
+	 * @return {Number}
+	 */
+	galoisField.__exports.log = function log (n) {
+	  if (n < 1) throw new Error('log(' + n + ')')
+	  return LOG_TABLE[n]
+	};
+
+	/**
+	 * Returns anti-log value of n inside Galois Field
+	 *
+	 * @param  {Number} n
+	 * @return {Number}
+	 */
+	galoisField.__exports.exp = function exp (n) {
+	  return EXP_TABLE[n]
+	};
+
+	/**
+	 * Multiplies two number inside Galois Field
+	 *
+	 * @param  {Number} x
+	 * @param  {Number} y
+	 * @return {Number}
+	 */
+	galoisField.__exports.mul = function mul (x, y) {
+	  if (x === 0 || y === 0) return 0
+
+	  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized
+	  // @see {@link initTables}
+	  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]
+	};
+	return galoisField.__exports;
+}
+
+exports.__require = requireGaloisField;
+//# sourceMappingURL=galois-field.js.map

package/dist/node_modules/qrcode/lib/core/galois-field.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"galois-field.js","sources":["../../../../../node_modules/qrcode/lib/core/galois-field.js"],"sourcesContent":["const EXP_TABLE = new Uint8Array(512)\nconst LOG_TABLE = new Uint8Array(256)\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n  let x = 1\n  for (let i = 0; i < 255; i++) {\n    EXP_TABLE[i] = x\n    LOG_TABLE[x] = i\n\n    x <<= 1 // multiply by 2\n\n    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n    // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n      x ^= 0x11D\n    }\n  }\n\n  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n  // stay inside the bounds (because we will mainly use this table for the multiplication of\n  // two GF numbers, no more).\n  // @see {@link mul}\n  for (let i = 255; i < 512; i++) {\n    EXP_TABLE[i] = EXP_TABLE[i - 255]\n  }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n  if (n < 1) throw new Error('log(' + n + ')')\n  return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n  return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param  {Number} x\n * @param  {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n  if (x === 0 || y === 0) return 0\n\n  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n  // @see {@link initTables}\n  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n"],"names":["galoisField"],"mappings":";;;;;;;;;AAAA,CAAA,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,GAAG;AACpC,CAAA,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,GAAG;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACC,CAAC,SAAS,UAAU,IAAI;GACvB,IAAI,CAAC,GAAG;AACV,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChC,KAAI,SAAS,CAAC,CAAC,CAAC,GAAG;AACnB,KAAI,SAAS,CAAC,CAAC,CAAC,GAAG;;KAEf,CAAC,KAAK,EAAC;;AAEX;AACA;AACA,KAAI,IAAI,CAAC,GAAG,KAAK,EAAE;AACnB,OAAM,CAAC,IAAI;AACX,KAAA;AACA,GAAA;;AAEA;AACA;AACA;AACA;AACA,GAAE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;KAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,GAAG;AACpC,GAAA;AACA,CAAA,CAAC,EAAE;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,qBAAA,CAAA,GAAW,GAAG,SAAS,GAAG,EAAE,CAAC,EAAE;AAC/B,GAAE,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,GAAG;GAC3C,OAAO,SAAS,CAAC,CAAC;AACpB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,qBAAA,CAAA,GAAW,GAAG,SAAS,GAAG,EAAE,CAAC,EAAE;GAC7B,OAAO,SAAS,CAAC,CAAC;AACpB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAAA,qBAAA,CAAA,GAAW,GAAG,SAAS,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE;GAChC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO;;AAEjC;AACA;GACE,OAAO,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;AAC9C,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/kanji-data.js

@@ -0,0 +1,70 @@
+'use strict';
+
+var mode = require('./mode.js');
+var utils = require('./utils.js');
+
+var kanjiData;
+var hasRequiredKanjiData;
+
+function requireKanjiData () {
+	if (hasRequiredKanjiData) return kanjiData;
+	hasRequiredKanjiData = 1;
+	const Mode = mode.__require();
+	const Utils = utils.__require();
+
+	function KanjiData (data) {
+	  this.mode = Mode.KANJI;
+	  this.data = data;
+	}
+
+	KanjiData.getBitsLength = function getBitsLength (length) {
+	  return length * 13
+	};
+
+	KanjiData.prototype.getLength = function getLength () {
+	  return this.data.length
+	};
+
+	KanjiData.prototype.getBitsLength = function getBitsLength () {
+	  return KanjiData.getBitsLength(this.data.length)
+	};
+
+	KanjiData.prototype.write = function (bitBuffer) {
+	  let i;
+
+	  // In the Shift JIS system, Kanji characters are represented by a two byte combination.
+	  // These byte values are shifted from the JIS X 0208 values.
+	  // JIS X 0208 gives details of the shift coded representation.
+	  for (i = 0; i < this.data.length; i++) {
+	    let value = Utils.toSJIS(this.data[i]);
+
+	    // For characters with Shift JIS values from 0x8140 to 0x9FFC:
+	    if (value >= 0x8140 && value <= 0x9FFC) {
+	      // Subtract 0x8140 from Shift JIS value
+	      value -= 0x8140;
+
+	    // For characters with Shift JIS values from 0xE040 to 0xEBBF
+	    } else if (value >= 0xE040 && value <= 0xEBBF) {
+	      // Subtract 0xC140 from Shift JIS value
+	      value -= 0xC140;
+	    } else {
+	      throw new Error(
+	        'Invalid SJIS character: ' + this.data[i] + '\n' +
+	        'Make sure your charset is UTF-8')
+	    }
+
+	    // Multiply most significant byte of result by 0xC0
+	    // and add least significant byte to product
+	    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff);
+
+	    // Convert result to a 13-bit binary string
+	    bitBuffer.put(value, 13);
+	  }
+	};
+
+	kanjiData = KanjiData;
+	return kanjiData;
+}
+
+exports.__require = requireKanjiData;
+//# sourceMappingURL=kanji-data.js.map

package/dist/node_modules/qrcode/lib/core/kanji-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kanji-data.js","sources":["../../../../../node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;;AAAA,CAAA,MAAM,IAAI,GAAGA,cAAA;AACb,CAAA,MAAM,KAAK,GAAGC,eAAA;;CAEd,SAAS,SAAS,EAAE,IAAI,EAAE;AAC1B,GAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;GACjB,IAAI,CAAC,IAAI,GAAG;AACd,CAAA;;AAEA,CAAA,SAAS,CAAC,aAAa,GAAG,SAAS,aAAa,EAAE,MAAM,EAAE;GACxD,OAAO,MAAM,GAAG;AAClB,CAAA;;AAEA,CAAA,SAAS,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,SAAS,IAAI;AACtD,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAA;;AAEA,CAAA,SAAS,CAAC,SAAS,CAAC,aAAa,GAAG,SAAS,aAAa,IAAI;GAC5D,OAAO,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;AACjD,CAAA;;AAEA,CAAA,SAAS,CAAC,SAAS,CAAC,KAAK,GAAG,UAAU,SAAS,EAAE;AACjD,GAAE,IAAI;;AAEN;AACA;AACA;AACA,GAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,KAAI,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;;AAEzC;KACI,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,EAAE;AAC5C;AACA,OAAM,KAAK,IAAI;;AAEf;KACA,CAAK,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,EAAE;AACnD;AACA,OAAM,KAAK,IAAI;AACf,KAAA,CAAK,MAAM;OACL,MAAM,IAAI,KAAK;SACb,0BAA0B,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;AACxD,SAAQ,iCAAiC;AACzC,KAAA;;AAEA;AACA;AACA,KAAI,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,GAAG,IAAI;;AAE3D;AACA,KAAI,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE;AAC3B,GAAA;AACA,CAAA;;AAEA,CAAA,SAAc,GAAG;;;;;;","x_google_ignoreList":[0]}