@wecom/wecom-openclaw-cli 1.0.15 → 1.0.16

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

@@ -0,0 +1,251 @@
+'use strict';
+
+var maskPattern = require('../../../../_virtual/mask-pattern.js');
+
+/**
+ * Data mask pattern reference
+ * @type {Object}
+ */
+
+var hasRequiredMaskPattern;
+
+function requireMaskPattern () {
+	if (hasRequiredMaskPattern) return maskPattern.__exports;
+	hasRequiredMaskPattern = 1;
+	(function (exports$1) {
+		exports$1.Patterns = {
+		  PATTERN000: 0,
+		  PATTERN001: 1,
+		  PATTERN010: 2,
+		  PATTERN011: 3,
+		  PATTERN100: 4,
+		  PATTERN101: 5,
+		  PATTERN110: 6,
+		  PATTERN111: 7
+		};
+
+		/**
+		 * Weighted penalty scores for the undesirable features
+		 * @type {Object}
+		 */
+		const PenaltyScores = {
+		  N1: 3,
+		  N2: 3,
+		  N3: 40,
+		  N4: 10
+		};
+
+		/**
+		 * Check if mask pattern value is valid
+		 *
+		 * @param  {Number}  mask    Mask pattern
+		 * @return {Boolean}         true if valid, false otherwise
+		 */
+		exports$1.isValid = function isValid (mask) {
+		  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7
+		};
+
+		/**
+		 * Returns mask pattern from a value.
+		 * If value is not valid, returns undefined
+		 *
+		 * @param  {Number|String} value        Mask pattern value
+		 * @return {Number}                     Valid mask pattern or undefined
+		 */
+		exports$1.from = function from (value) {
+		  return exports$1.isValid(value) ? parseInt(value, 10) : undefined
+		};
+
+		/**
+		* Find adjacent modules in row/column with the same color
+		* and assign a penalty value.
+		*
+		* Points: N1 + i
+		* i is the amount by which the number of adjacent modules of the same color exceeds 5
+		*/
+		exports$1.getPenaltyN1 = function getPenaltyN1 (data) {
+		  const size = data.size;
+		  let points = 0;
+		  let sameCountCol = 0;
+		  let sameCountRow = 0;
+		  let lastCol = null;
+		  let lastRow = null;
+
+		  for (let row = 0; row < size; row++) {
+		    sameCountCol = sameCountRow = 0;
+		    lastCol = lastRow = null;
+
+		    for (let col = 0; col < size; col++) {
+		      let module = data.get(row, col);
+		      if (module === lastCol) {
+		        sameCountCol++;
+		      } else {
+		        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+		        lastCol = module;
+		        sameCountCol = 1;
+		      }
+
+		      module = data.get(col, row);
+		      if (module === lastRow) {
+		        sameCountRow++;
+		      } else {
+		        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+		        lastRow = module;
+		        sameCountRow = 1;
+		      }
+		    }
+
+		    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+		    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+		  }
+
+		  return points
+		};
+
+		/**
+		 * Find 2x2 blocks with the same color and assign a penalty value
+		 *
+		 * Points: N2 * (m - 1) * (n - 1)
+		 */
+		exports$1.getPenaltyN2 = function getPenaltyN2 (data) {
+		  const size = data.size;
+		  let points = 0;
+
+		  for (let row = 0; row < size - 1; row++) {
+		    for (let col = 0; col < size - 1; col++) {
+		      const last = data.get(row, col) +
+		        data.get(row, col + 1) +
+		        data.get(row + 1, col) +
+		        data.get(row + 1, col + 1);
+
+		      if (last === 4 || last === 0) points++;
+		    }
+		  }
+
+		  return points * PenaltyScores.N2
+		};
+
+		/**
+		 * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,
+		 * preceded or followed by light area 4 modules wide
+		 *
+		 * Points: N3 * number of pattern found
+		 */
+		exports$1.getPenaltyN3 = function getPenaltyN3 (data) {
+		  const size = data.size;
+		  let points = 0;
+		  let bitsCol = 0;
+		  let bitsRow = 0;
+
+		  for (let row = 0; row < size; row++) {
+		    bitsCol = bitsRow = 0;
+		    for (let col = 0; col < size; col++) {
+		      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col);
+		      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++;
+
+		      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row);
+		      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++;
+		    }
+		  }
+
+		  return points * PenaltyScores.N3
+		};
+
+		/**
+		 * Calculate proportion of dark modules in entire symbol
+		 *
+		 * Points: N4 * k
+		 *
+		 * k is the rating of the deviation of the proportion of dark modules
+		 * in the symbol from 50% in steps of 5%
+		 */
+		exports$1.getPenaltyN4 = function getPenaltyN4 (data) {
+		  let darkCount = 0;
+		  const modulesCount = data.data.length;
+
+		  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
+
+		  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10);
+
+		  return k * PenaltyScores.N4
+		};
+
+		/**
+		 * Return mask value at given position
+		 *
+		 * @param  {Number} maskPattern Pattern reference value
+		 * @param  {Number} i           Row
+		 * @param  {Number} j           Column
+		 * @return {Boolean}            Mask value
+		 */
+		function getMaskAt (maskPattern, i, j) {
+		  switch (maskPattern) {
+		    case exports$1.Patterns.PATTERN000: return (i + j) % 2 === 0
+		    case exports$1.Patterns.PATTERN001: return i % 2 === 0
+		    case exports$1.Patterns.PATTERN010: return j % 3 === 0
+		    case exports$1.Patterns.PATTERN011: return (i + j) % 3 === 0
+		    case exports$1.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0
+		    case exports$1.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0
+		    case exports$1.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0
+		    case exports$1.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0
+
+		    default: throw new Error('bad maskPattern:' + maskPattern)
+		  }
+		}
+
+		/**
+		 * Apply a mask pattern to a BitMatrix
+		 *
+		 * @param  {Number}    pattern Pattern reference number
+		 * @param  {BitMatrix} data    BitMatrix data
+		 */
+		exports$1.applyMask = function applyMask (pattern, data) {
+		  const size = data.size;
+
+		  for (let col = 0; col < size; col++) {
+		    for (let row = 0; row < size; row++) {
+		      if (data.isReserved(row, col)) continue
+		      data.xor(row, col, getMaskAt(pattern, row, col));
+		    }
+		  }
+		};
+
+		/**
+		 * Returns the best mask pattern for data
+		 *
+		 * @param  {BitMatrix} data
+		 * @return {Number} Mask pattern reference number
+		 */
+		exports$1.getBestMask = function getBestMask (data, setupFormatFunc) {
+		  const numPatterns = Object.keys(exports$1.Patterns).length;
+		  let bestPattern = 0;
+		  let lowerPenalty = Infinity;
+
+		  for (let p = 0; p < numPatterns; p++) {
+		    setupFormatFunc(p);
+		    exports$1.applyMask(p, data);
+
+		    // Calculate penalty
+		    const penalty =
+		      exports$1.getPenaltyN1(data) +
+		      exports$1.getPenaltyN2(data) +
+		      exports$1.getPenaltyN3(data) +
+		      exports$1.getPenaltyN4(data);
+
+		    // Undo previously applied mask
+		    exports$1.applyMask(p, data);
+
+		    if (penalty < lowerPenalty) {
+		      lowerPenalty = penalty;
+		      bestPattern = p;
+		    }
+		  }
+
+		  return bestPattern
+		}; 
+	} (maskPattern.__exports));
+	return maskPattern.__exports;
+}
+
+exports.__require = requireMaskPattern;
+//# sourceMappingURL=mask-pattern.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mask-pattern.js","sources":["../../../../../node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n  PATTERN000: 0,\n  PATTERN001: 1,\n  PATTERN010: 2,\n  PATTERN011: 3,\n  PATTERN100: 4,\n  PATTERN101: 5,\n  PATTERN110: 6,\n  PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n  N1: 3,\n  N2: 3,\n  N3: 40,\n  N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param  {Number}  mask    Mask pattern\n * @return {Boolean}         true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param  {Number|String} value        Mask pattern value\n * @return {Number}                     Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n  return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n  const size = data.size\n  let points = 0\n  let sameCountCol = 0\n  let sameCountRow = 0\n  let lastCol = null\n  let lastRow = null\n\n  for (let row = 0; row < size; row++) {\n    sameCountCol = sameCountRow = 0\n    lastCol = lastRow = null\n\n    for (let col = 0; col < size; col++) {\n      let module = data.get(row, col)\n      if (module === lastCol) {\n        sameCountCol++\n      } else {\n        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n        lastCol = module\n        sameCountCol = 1\n      }\n\n      module = data.get(col, row)\n      if (module === lastRow) {\n        sameCountRow++\n      } else {\n        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n        lastRow = module\n        sameCountRow = 1\n      }\n    }\n\n    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n  }\n\n  return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n  const size = data.size\n  let points = 0\n\n  for (let row = 0; row < size - 1; row++) {\n    for (let col = 0; col < size - 1; col++) {\n      const last = data.get(row, col) +\n        data.get(row, col + 1) +\n        data.get(row + 1, col) +\n        data.get(row + 1, col + 1)\n\n      if (last === 4 || last === 0) points++\n    }\n  }\n\n  return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n  const size = data.size\n  let points = 0\n  let bitsCol = 0\n  let bitsRow = 0\n\n  for (let row = 0; row < size; row++) {\n    bitsCol = bitsRow = 0\n    for (let col = 0; col < size; col++) {\n      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n    }\n  }\n\n  return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n  let darkCount = 0\n  const modulesCount = data.data.length\n\n  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n  return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param  {Number} maskPattern Pattern reference value\n * @param  {Number} i           Row\n * @param  {Number} j           Column\n * @return {Boolean}            Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n  switch (maskPattern) {\n    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n    case exports.Patterns.PATTERN001: return i % 2 === 0\n    case exports.Patterns.PATTERN010: return j % 3 === 0\n    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n    default: throw new Error('bad maskPattern:' + maskPattern)\n  }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param  {Number}    pattern Pattern reference number\n * @param  {BitMatrix} data    BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n  const size = data.size\n\n  for (let col = 0; col < size; col++) {\n    for (let row = 0; row < size; row++) {\n      if (data.isReserved(row, col)) continue\n      data.xor(row, col, getMaskAt(pattern, row, col))\n    }\n  }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param  {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n  const numPatterns = Object.keys(exports.Patterns).length\n  let bestPattern = 0\n  let lowerPenalty = Infinity\n\n  for (let p = 0; p < numPatterns; p++) {\n    setupFormatFunc(p)\n    exports.applyMask(p, data)\n\n    // Calculate penalty\n    const penalty =\n      exports.getPenaltyN1(data) +\n      exports.getPenaltyN2(data) +\n      exports.getPenaltyN3(data) +\n      exports.getPenaltyN4(data)\n\n    // Undo previously applied mask\n    exports.applyMask(p, data)\n\n    if (penalty < lowerPenalty) {\n      lowerPenalty = penalty\n      bestPattern = p\n    }\n  }\n\n  return bestPattern\n}\n"],"names":["exports"],"mappings":";;;;;;;;;;;;;;;EAIAA,SAAA,CAAA,QAAA,GAAmB;IACjB,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;AACf,IAAE,UAAU,EAAE;AACd;;AAEA;AACA;AACA;AACA;AACA,EAAA,MAAM,aAAa,GAAG;IACpB,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,EAAE;AACR,IAAE,EAAE,EAAE;AACN;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,OAAA,GAAkB,SAAS,OAAO,EAAE,IAAI,EAAE;IACxC,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;AAC7E,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,IAAA,GAAe,SAAS,IAAI,EAAE,KAAK,EAAE;AACrC,IAAE,OAAOA,SAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG;AACxD,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,YAAA,GAAuB,SAAS,YAAY,EAAE,IAAI,EAAE;AACpD,IAAE,MAAM,IAAI,GAAG,IAAI,CAAC;IAClB,IAAI,MAAM,GAAG;IACb,IAAI,YAAY,GAAG;IACnB,IAAI,YAAY,GAAG;IACnB,IAAI,OAAO,GAAG;IACd,IAAI,OAAO,GAAG;;AAEhB,IAAE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;MACnC,YAAY,GAAG,YAAY,GAAG;MAC9B,OAAO,GAAG,OAAO,GAAG;;AAExB,MAAI,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;QACnC,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG;AACpC,QAAM,IAAI,MAAM,KAAK,OAAO,EAAE;AAC9B,UAAQ,YAAY;AACpB,QAAA,CAAO,MAAM;AACb,UAAQ,IAAI,YAAY,IAAI,CAAC,EAAE,MAAM,IAAI,aAAa,CAAC,EAAE,IAAI,YAAY,GAAG,CAAC;AAC7E,UAAQ,OAAO,GAAG;AAClB,UAAQ,YAAY,GAAG;AACvB,QAAA;;QAEM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG;AAChC,QAAM,IAAI,MAAM,KAAK,OAAO,EAAE;AAC9B,UAAQ,YAAY;AACpB,QAAA,CAAO,MAAM;AACb,UAAQ,IAAI,YAAY,IAAI,CAAC,EAAE,MAAM,IAAI,aAAa,CAAC,EAAE,IAAI,YAAY,GAAG,CAAC;AAC7E,UAAQ,OAAO,GAAG;AAClB,UAAQ,YAAY,GAAG;AACvB,QAAA;AACA,MAAA;;AAEA,MAAI,IAAI,YAAY,IAAI,CAAC,EAAE,MAAM,IAAI,aAAa,CAAC,EAAE,IAAI,YAAY,GAAG,CAAC;AACzE,MAAI,IAAI,YAAY,IAAI,CAAC,EAAE,MAAM,IAAI,aAAa,CAAC,EAAE,IAAI,YAAY,GAAG,CAAC;AACzE,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,YAAA,GAAuB,SAAS,YAAY,EAAE,IAAI,EAAE;AACpD,IAAE,MAAM,IAAI,GAAG,IAAI,CAAC;IAClB,IAAI,MAAM,GAAG;;AAEf,IAAE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;AAC3C,MAAI,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC;UAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC;UACtB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC;UACtB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;;QAE3B,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM;AAC1C,MAAA;AACA,IAAA;;AAEA,IAAE,OAAO,MAAM,GAAG,aAAa,CAAC;AAChC,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,YAAA,GAAuB,SAAS,YAAY,EAAE,IAAI,EAAE;AACpD,IAAE,MAAM,IAAI,GAAG,IAAI,CAAC;IAClB,IAAI,MAAM,GAAG;IACb,IAAI,OAAO,GAAG;IACd,IAAI,OAAO,GAAG;;AAEhB,IAAE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;MACnC,OAAO,GAAG,OAAO,GAAG;AACxB,MAAI,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AACzC,QAAM,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG;AAC5D,QAAM,IAAI,GAAG,IAAI,EAAE,KAAK,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,KAAK,CAAC,EAAE,MAAM;;AAEvE,QAAM,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG;AAC5D,QAAM,IAAI,GAAG,IAAI,EAAE,KAAK,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,KAAK,CAAC,EAAE,MAAM;AACvE,MAAA;AACA,IAAA;;AAEA,IAAE,OAAO,MAAM,GAAG,aAAa,CAAC;AAChC,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,YAAA,GAAuB,SAAS,YAAY,EAAE,IAAI,EAAE;IAClD,IAAI,SAAS,GAAG;AAClB,IAAE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC;;AAEjC,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;;IAE/D,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,YAAY,IAAI,CAAC,CAAC,GAAG,EAAE;;AAEzE,IAAE,OAAO,CAAC,GAAG,aAAa,CAAC;AAC3B,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAA,SAAS,SAAS,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE;AACvC,IAAE,QAAQ,WAAW;AACrB,MAAI,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK;MACzD,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK;MACnD,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK;AACvD,MAAI,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK;AAC7D,MAAI,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK;MACzF,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK;MACvE,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;MAC7E,KAAKA,SAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;;AAEjF,MAAI,SAAS,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,WAAW;AAC7D;AACA,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,SAAA,GAAoB,SAAS,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE;AACvD,IAAE,MAAM,IAAI,GAAG,IAAI,CAAC;;AAEpB,IAAE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AACvC,MAAI,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;QACnC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;AACrC,QAAM,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC;AACrD,MAAA;AACA,IAAA;AACA,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,WAAA,GAAsB,SAAS,WAAW,EAAE,IAAI,EAAE,eAAe,EAAE;IACjE,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAACA,SAAO,CAAC,QAAQ,CAAC,CAAC;IAClD,IAAI,WAAW,GAAG;IAClB,IAAI,YAAY,GAAG;;AAErB,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;MACpC,eAAe,CAAC,CAAC;AACrB,MAAIA,SAAO,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI;;AAE7B;AACA,MAAI,MAAM,OAAO;AACjB,QAAMA,SAAO,CAAC,YAAY,CAAC,IAAI,CAAC;AAChC,QAAMA,SAAO,CAAC,YAAY,CAAC,IAAI,CAAC;AAChC,QAAMA,SAAO,CAAC,YAAY,CAAC,IAAI,CAAC;AAChC,QAAMA,SAAO,CAAC,YAAY,CAAC,IAAI;;AAE/B;AACA,MAAIA,SAAO,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI;;AAE7B,MAAI,IAAI,OAAO,GAAG,YAAY,EAAE;AAChC,QAAM,YAAY,GAAG;AACrB,QAAM,WAAW,GAAG;AACpB,MAAA;AACA,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA,EAAA;;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,185 @@
+'use strict';
+
+var mode = require('../../../../_virtual/mode.js');
+var versionCheck = require('./version-check.js');
+var regex = require('./regex.js');
+
+var hasRequiredMode;
+
+function requireMode () {
+	if (hasRequiredMode) return mode.__exports;
+	hasRequiredMode = 1;
+	(function (exports$1) {
+		const VersionCheck = versionCheck.__require();
+		const Regex = regex.__require();
+
+		/**
+		 * Numeric mode encodes data from the decimal digit set (0 - 9)
+		 * (byte values 30HEX to 39HEX).
+		 * Normally, 3 data characters are represented by 10 bits.
+		 *
+		 * @type {Object}
+		 */
+		exports$1.NUMERIC = {
+		  id: 'Numeric',
+		  bit: 1 << 0,
+		  ccBits: [10, 12, 14]
+		};
+
+		/**
+		 * Alphanumeric mode encodes data from a set of 45 characters,
+		 * i.e. 10 numeric digits (0 - 9),
+		 *      26 alphabetic characters (A - Z),
+		 *   and 9 symbols (SP, $, %, *, +, -, ., /, :).
+		 * Normally, two input characters are represented by 11 bits.
+		 *
+		 * @type {Object}
+		 */
+		exports$1.ALPHANUMERIC = {
+		  id: 'Alphanumeric',
+		  bit: 1 << 1,
+		  ccBits: [9, 11, 13]
+		};
+
+		/**
+		 * In byte mode, data is encoded at 8 bits per character.
+		 *
+		 * @type {Object}
+		 */
+		exports$1.BYTE = {
+		  id: 'Byte',
+		  bit: 1 << 2,
+		  ccBits: [8, 16, 16]
+		};
+
+		/**
+		 * The Kanji mode efficiently encodes Kanji characters in accordance with
+		 * the Shift JIS system based on JIS X 0208.
+		 * The Shift JIS values are shifted from the JIS X 0208 values.
+		 * JIS X 0208 gives details of the shift coded representation.
+		 * Each two-byte character value is compacted to a 13-bit binary codeword.
+		 *
+		 * @type {Object}
+		 */
+		exports$1.KANJI = {
+		  id: 'Kanji',
+		  bit: 1 << 3,
+		  ccBits: [8, 10, 12]
+		};
+
+		/**
+		 * Mixed mode will contain a sequences of data in a combination of any of
+		 * the modes described above
+		 *
+		 * @type {Object}
+		 */
+		exports$1.MIXED = {
+		  bit: -1
+		};
+
+		/**
+		 * Returns the number of bits needed to store the data length
+		 * according to QR Code specifications.
+		 *
+		 * @param  {Mode}   mode    Data mode
+		 * @param  {Number} version QR Code version
+		 * @return {Number}         Number of bits
+		 */
+		exports$1.getCharCountIndicator = function getCharCountIndicator (mode, version) {
+		  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)
+
+		  if (!VersionCheck.isValid(version)) {
+		    throw new Error('Invalid version: ' + version)
+		  }
+
+		  if (version >= 1 && version < 10) return mode.ccBits[0]
+		  else if (version < 27) return mode.ccBits[1]
+		  return mode.ccBits[2]
+		};
+
+		/**
+		 * Returns the most efficient mode to store the specified data
+		 *
+		 * @param  {String} dataStr Input data string
+		 * @return {Mode}           Best mode
+		 */
+		exports$1.getBestModeForData = function getBestModeForData (dataStr) {
+		  if (Regex.testNumeric(dataStr)) return exports$1.NUMERIC
+		  else if (Regex.testAlphanumeric(dataStr)) return exports$1.ALPHANUMERIC
+		  else if (Regex.testKanji(dataStr)) return exports$1.KANJI
+		  else return exports$1.BYTE
+		};
+
+		/**
+		 * Return mode name as string
+		 *
+		 * @param {Mode} mode Mode object
+		 * @returns {String}  Mode name
+		 */
+		exports$1.toString = function toString (mode) {
+		  if (mode && mode.id) return mode.id
+		  throw new Error('Invalid mode')
+		};
+
+		/**
+		 * Check if input param is a valid mode object
+		 *
+		 * @param   {Mode}    mode Mode object
+		 * @returns {Boolean} True if valid mode, false otherwise
+		 */
+		exports$1.isValid = function isValid (mode) {
+		  return mode && mode.bit && mode.ccBits
+		};
+
+		/**
+		 * Get mode object from its name
+		 *
+		 * @param   {String} string Mode name
+		 * @returns {Mode}          Mode object
+		 */
+		function fromString (string) {
+		  if (typeof string !== 'string') {
+		    throw new Error('Param is not a string')
+		  }
+
+		  const lcStr = string.toLowerCase();
+
+		  switch (lcStr) {
+		    case 'numeric':
+		      return exports$1.NUMERIC
+		    case 'alphanumeric':
+		      return exports$1.ALPHANUMERIC
+		    case 'kanji':
+		      return exports$1.KANJI
+		    case 'byte':
+		      return exports$1.BYTE
+		    default:
+		      throw new Error('Unknown mode: ' + string)
+		  }
+		}
+
+		/**
+		 * Returns mode from a value.
+		 * If value is not a valid mode, returns defaultValue
+		 *
+		 * @param  {Mode|String} value        Encoding mode
+		 * @param  {Mode}        defaultValue Fallback value
+		 * @return {Mode}                     Encoding mode
+		 */
+		exports$1.from = function from (value, defaultValue) {
+		  if (exports$1.isValid(value)) {
+		    return value
+		  }
+
+		  try {
+		    return fromString(value)
+		  } catch (e) {
+		    return defaultValue
+		  }
+		}; 
+	} (mode.__exports));
+	return mode.__exports;
+}
+
+exports.__require = requireMode;
+//# sourceMappingURL=mode.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mode.js","sources":["../../../../../node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\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 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\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":["require$$0","require$$1","exports"],"mappings":";;;;;;;;;;;;AAAA,EAAA,MAAM,YAAY,GAAGA,sBAAA;AACrB,EAAA,MAAM,KAAK,GAAGC,eAAA;;AAEd;AACA;AACA;AACA;AACA;AACA;AACA;EACAC,SAAA,CAAA,OAAA,GAAkB;IAChB,EAAE,EAAE,SAAS;AACf,IAAE,GAAG,EAAE,CAAC,IAAI,CAAC;AACb,IAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;AACrB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACAA,SAAA,CAAA,YAAA,GAAuB;IACrB,EAAE,EAAE,cAAc;AACpB,IAAE,GAAG,EAAE,CAAC,IAAI,CAAC;AACb,IAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;AACpB;;AAEA;AACA;AACA;AACA;AACA;EACAA,SAAA,CAAA,IAAA,GAAe;IACb,EAAE,EAAE,MAAM;AACZ,IAAE,GAAG,EAAE,CAAC,IAAI,CAAC;AACb,IAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;AACpB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACAA,SAAA,CAAA,KAAA,GAAgB;IACd,EAAE,EAAE,OAAO;AACb,IAAE,GAAG,EAAE,CAAC,IAAI,CAAC;AACb,IAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;AACpB;;AAEA;AACA;AACA;AACA;AACA;AACA;EACAA,SAAA,CAAA,KAAA,GAAgB;IACd,GAAG,EAAE;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,qBAAA,GAAgC,SAAS,qBAAqB,EAAE,IAAI,EAAE,OAAO,EAAE;AAC/E,IAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI;;IAEzD,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AACtC,MAAI,MAAM,IAAI,KAAK,CAAC,mBAAmB,GAAG,OAAO;AACjD,IAAA;;AAEA,IAAE,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,EAAE,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;SACjD,IAAI,OAAO,GAAG,EAAE,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;AAC7C,IAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;AACtB,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,kBAAA,GAA6B,SAAS,kBAAkB,EAAE,OAAO,EAAE;IACjE,IAAI,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,OAAOA,SAAO,CAAC;SAC1C,IAAI,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,OAAOA,SAAO,CAAC;SACpD,IAAI,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,OAAOA,SAAO,CAAC;SAC7C,OAAOA,SAAO,CAAC;AACtB,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,QAAA,GAAmB,SAAS,QAAQ,EAAE,IAAI,EAAE;IAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE,OAAO,IAAI,CAAC;AACnC,IAAE,MAAM,IAAI,KAAK,CAAC,cAAc;AAChC,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,OAAA,GAAkB,SAAS,OAAO,EAAE,IAAI,EAAE;IACxC,OAAO,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC;AAClC,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;EACA,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,SAAS;QACZ,OAAOA,SAAO,CAAC;AACrB,MAAI,KAAK,cAAc;QACjB,OAAOA,SAAO,CAAC;AACrB,MAAI,KAAK,OAAO;QACV,OAAOA,SAAO,CAAC;AACrB,MAAI,KAAK,MAAM;QACT,OAAOA,SAAO,CAAC;MACjB;AACJ,QAAM,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,MAAM;AAC/C;AACA,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,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/numeric-data.js

@@ -0,0 +1,58 @@
+'use strict';
+
+var mode = require('./mode.js');
+
+var numericData;
+var hasRequiredNumericData;
+
+function requireNumericData () {
+	if (hasRequiredNumericData) return numericData;
+	hasRequiredNumericData = 1;
+	const Mode = mode.__require();
+
+	function NumericData (data) {
+	  this.mode = Mode.NUMERIC;
+	  this.data = data.toString();
+	}
+
+	NumericData.getBitsLength = function getBitsLength (length) {
+	  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)
+	};
+
+	NumericData.prototype.getLength = function getLength () {
+	  return this.data.length
+	};
+
+	NumericData.prototype.getBitsLength = function getBitsLength () {
+	  return NumericData.getBitsLength(this.data.length)
+	};
+
+	NumericData.prototype.write = function write (bitBuffer) {
+	  let i, group, value;
+
+	  // The input data string is divided into groups of three digits,
+	  // and each group is converted to its 10-bit binary equivalent.
+	  for (i = 0; i + 3 <= this.data.length; i += 3) {
+	    group = this.data.substr(i, 3);
+	    value = parseInt(group, 10);
+
+	    bitBuffer.put(value, 10);
+	  }
+
+	  // If the number of input digits is not an exact multiple of three,
+	  // the final one or two digits are converted to 4 or 7 bits respectively.
+	  const remainingNum = this.data.length - i;
+	  if (remainingNum > 0) {
+	    group = this.data.substr(i);
+	    value = parseInt(group, 10);
+
+	    bitBuffer.put(value, remainingNum * 3 + 1);
+	  }
+	};
+
+	numericData = NumericData;
+	return numericData;
+}
+
+exports.__require = requireNumericData;
+//# sourceMappingURL=numeric-data.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"numeric-data.js","sources":["../../../../../node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["require$$0"],"mappings":";;;;;;;;;;AAAA,CAAA,MAAM,IAAI,GAAGA,cAAA;;CAEb,SAAS,WAAW,EAAE,IAAI,EAAE;AAC5B,GAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACnB,GAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ;AAC3B,CAAA;;AAEA,CAAA,WAAW,CAAC,aAAa,GAAG,SAAS,aAAa,EAAE,MAAM,EAAE;GAC1D,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;AACjF,CAAA;;AAEA,CAAA,WAAW,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,SAAS,IAAI;AACxD,GAAE,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAA;;AAEA,CAAA,WAAW,CAAC,SAAS,CAAC,aAAa,GAAG,SAAS,aAAa,IAAI;GAC9D,OAAO,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;AACnD,CAAA;;CAEA,WAAW,CAAC,SAAS,CAAC,KAAK,GAAG,SAAS,KAAK,EAAE,SAAS,EAAE;AACzD,GAAE,IAAI,CAAC,EAAE,KAAK,EAAE;;AAEhB;AACA;AACA,GAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;KAC7C,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;AACjC,KAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE;;AAE9B,KAAI,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE;AAC3B,GAAA;;AAEA;AACA;GACE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG;AAC1C,GAAE,IAAI,YAAY,GAAG,CAAC,EAAE;KACpB,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9B,KAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE;;KAE1B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,GAAG,CAAC;AAC7C,GAAA;AACA,CAAA;;AAEA,CAAA,WAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,79 @@
+'use strict';
+
+var polynomial = require('../../../../_virtual/polynomial.js');
+var galoisField = require('./galois-field.js');
+
+var hasRequiredPolynomial;
+
+function requirePolynomial () {
+	if (hasRequiredPolynomial) return polynomial.__exports;
+	hasRequiredPolynomial = 1;
+	(function (exports$1) {
+		const GF = galoisField.__require();
+
+		/**
+		 * Multiplies two polynomials inside Galois Field
+		 *
+		 * @param  {Uint8Array} p1 Polynomial
+		 * @param  {Uint8Array} p2 Polynomial
+		 * @return {Uint8Array}    Product of p1 and p2
+		 */
+		exports$1.mul = function mul (p1, p2) {
+		  const coeff = new Uint8Array(p1.length + p2.length - 1);
+
+		  for (let i = 0; i < p1.length; i++) {
+		    for (let j = 0; j < p2.length; j++) {
+		      coeff[i + j] ^= GF.mul(p1[i], p2[j]);
+		    }
+		  }
+
+		  return coeff
+		};
+
+		/**
+		 * Calculate the remainder of polynomials division
+		 *
+		 * @param  {Uint8Array} divident Polynomial
+		 * @param  {Uint8Array} divisor  Polynomial
+		 * @return {Uint8Array}          Remainder
+		 */
+		exports$1.mod = function mod (divident, divisor) {
+		  let result = new Uint8Array(divident);
+
+		  while ((result.length - divisor.length) >= 0) {
+		    const coeff = result[0];
+
+		    for (let i = 0; i < divisor.length; i++) {
+		      result[i] ^= GF.mul(divisor[i], coeff);
+		    }
+
+		    // remove all zeros from buffer head
+		    let offset = 0;
+		    while (offset < result.length && result[offset] === 0) offset++;
+		    result = result.slice(offset);
+		  }
+
+		  return result
+		};
+
+		/**
+		 * Generate an irreducible generator polynomial of specified degree
+		 * (used by Reed-Solomon encoder)
+		 *
+		 * @param  {Number} degree Degree of the generator polynomial
+		 * @return {Uint8Array}    Buffer containing polynomial coefficients
+		 */
+		exports$1.generateECPolynomial = function generateECPolynomial (degree) {
+		  let poly = new Uint8Array([1]);
+		  for (let i = 0; i < degree; i++) {
+		    poly = exports$1.mul(poly, new Uint8Array([1, GF.exp(i)]));
+		  }
+
+		  return poly
+		}; 
+	} (polynomial.__exports));
+	return polynomial.__exports;
+}
+
+exports.__require = requirePolynomial;
+//# sourceMappingURL=polynomial.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.js","sources":["../../../../../node_modules/qrcode/lib/core/polynomial.js"],"sourcesContent":["const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param  {Uint8Array} p1 Polynomial\n * @param  {Uint8Array} p2 Polynomial\n * @return {Uint8Array}    Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n  const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n  for (let i = 0; i < p1.length; i++) {\n    for (let j = 0; j < p2.length; j++) {\n      coeff[i + j] ^= GF.mul(p1[i], p2[j])\n    }\n  }\n\n  return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param  {Uint8Array} divident Polynomial\n * @param  {Uint8Array} divisor  Polynomial\n * @return {Uint8Array}          Remainder\n */\nexports.mod = function mod (divident, divisor) {\n  let result = new Uint8Array(divident)\n\n  while ((result.length - divisor.length) >= 0) {\n    const coeff = result[0]\n\n    for (let i = 0; i < divisor.length; i++) {\n      result[i] ^= GF.mul(divisor[i], coeff)\n    }\n\n    // remove all zeros from buffer head\n    let offset = 0\n    while (offset < result.length && result[offset] === 0) offset++\n    result = result.slice(offset)\n  }\n\n  return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param  {Number} degree Degree of the generator polynomial\n * @return {Uint8Array}    Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n  let poly = new Uint8Array([1])\n  for (let i = 0; i < degree; i++) {\n    poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n  }\n\n  return poly\n}\n"],"names":["require$$0","exports"],"mappings":";;;;;;;;;;;AAAA,EAAA,MAAM,EAAE,GAAGA,qBAAA;;AAEX;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAC,SAAA,CAAA,GAAA,GAAc,SAAS,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE;AACpC,IAAE,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC;;AAExD,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACtC,MAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACxC,QAAM,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AACzC,MAAA;AACA,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,GAAA,GAAc,SAAS,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE;AAC/C,IAAE,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ;;IAEpC,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;AAChD,MAAI,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC;;AAE1B,MAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,QAAM,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK;AAC3C,MAAA;;AAEA;MACI,IAAI,MAAM,GAAG;AACjB,MAAI,OAAO,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM;AACjE,MAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM;AAChC,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAAA,SAAA,CAAA,oBAAA,GAA+B,SAAS,oBAAoB,EAAE,MAAM,EAAE;IACpE,IAAI,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,IAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;MAC/B,IAAI,GAAGA,SAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3D,IAAA;;AAEA,IAAE,OAAO;AACT,EAAA,EAAA;;;;;;;","x_google_ignoreList":[0]}