@ozdao/prometheus-framework 0.2.330 → 0.2.332

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

@@ -1 +1 @@
-{"version":3,"file":"alignment-pattern.js","sources":["../../../../../../node_modules/qrcode/lib/core/alignment-pattern.js"],"sourcesContent":["/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nconst getSymbolSize = require('./utils').getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n  if (version === 1) return []\n\n  const posCount = Math.floor(version / 7) + 2\n  const size = getSymbolSize(version)\n  const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n  const positions = [size - 7] // Last coord is always (size - 7)\n\n  for (let i = 1; i < posCount - 1; i++) {\n    positions[i] = positions[i - 1] - intervals\n  }\n\n  positions.push(6) // First coord is always 6\n\n  return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * let pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const coords = []\n  const pos = exports.getRowColCoords(version)\n  const posLength = pos.length\n\n  for (let i = 0; i < posLength; i++) {\n    for (let j = 0; j < posLength; j++) {\n      // Skip if position is occupied by finder patterns\n      if ((i === 0 && j === 0) || // top-left\n          (i === 0 && j === posLength - 1) || // bottom-left\n          (i === posLength - 1 && j === 0)) { // top-right\n        continue\n      }\n\n      coords.push([pos[i], pos[j]])\n    }\n  }\n\n  return coords\n}\n"],"names":["require$$0"],"mappings":";;;;AAUA,QAAM,gBAAgBA,MAAmB;AAgBzC,UAAA,kBAA0B,SAAS,gBAAiB,SAAS;AAC3D,QAAI,YAAY,EAAG,QAAO,CAAE;AAE5B,UAAM,WAAW,KAAK,MAAM,UAAU,CAAC,IAAI;AAC3C,UAAM,OAAO,cAAc,OAAO;AAClC,UAAM,YAAY,SAAS,MAAM,KAAK,KAAK,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,IAAI;AACpF,UAAM,YAAY,CAAC,OAAO,CAAC;AAE3B,aAAS,IAAI,GAAG,IAAI,WAAW,GAAG,KAAK;AACrC,gBAAU,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI;AAAA,IACnC;AAED,cAAU,KAAK,CAAC;AAEhB,WAAO,UAAU,QAAS;AAAA,EAC3B;AAsBD,UAAA,eAAuB,SAAS,aAAc,SAAS;AACrD,UAAM,SAAS,CAAE;AACjB,UAAM,MAAM,QAAQ,gBAAgB,OAAO;AAC3C,UAAM,YAAY,IAAI;AAEtB,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAElC,YAAK,MAAM,KAAK,MAAM;AAAA,QACjB,MAAM,KAAK,MAAM,YAAY;AAAA,QAC7B,MAAM,YAAY,KAAK,MAAM,GAAI;AACpC;AAAA,QACD;AAED,eAAO,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,MAC7B;AAAA,IACF;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"alignment-pattern.js","sources":["../../../../../../node_modules/qrcode/lib/core/alignment-pattern.js"],"sourcesContent":["/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nconst getSymbolSize = require('./utils').getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n  if (version === 1) return []\n\n  const posCount = Math.floor(version / 7) + 2\n  const size = getSymbolSize(version)\n  const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n  const positions = [size - 7] // Last coord is always (size - 7)\n\n  for (let i = 1; i < posCount - 1; i++) {\n    positions[i] = positions[i - 1] - intervals\n  }\n\n  positions.push(6) // First coord is always 6\n\n  return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * let pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const coords = []\n  const pos = exports.getRowColCoords(version)\n  const posLength = pos.length\n\n  for (let i = 0; i < posLength; i++) {\n    for (let j = 0; j < posLength; j++) {\n      // Skip if position is occupied by finder patterns\n      if ((i === 0 && j === 0) || // top-left\n          (i === 0 && j === posLength - 1) || // bottom-left\n          (i === posLength - 1 && j === 0)) { // top-right\n        continue\n      }\n\n      coords.push([pos[i], pos[j]])\n    }\n  }\n\n  return coords\n}\n"],"names":["require$$0"],"mappings":";;;;;;;AAUA,UAAM,gBAAgBA,eAAmB;AAgBzC,YAAA,kBAA0B,SAAS,gBAAiB,SAAS;AAC3D,UAAI,YAAY,EAAG,QAAO,CAAA;AAE1B,YAAM,WAAW,KAAK,MAAM,UAAU,CAAC,IAAI;AAC3C,YAAM,OAAO,cAAc,OAAO;AAClC,YAAM,YAAY,SAAS,MAAM,KAAK,KAAK,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,IAAI;AACpF,YAAM,YAAY,CAAC,OAAO,CAAC;AAE3B,eAAS,IAAI,GAAG,IAAI,WAAW,GAAG,KAAK;AACrC,kBAAU,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI;AAAA,MACtC;AAEE,gBAAU,KAAK,CAAC;AAEhB,aAAO,UAAU,QAAO;AAAA,IAC1B;AAsBA,YAAA,eAAuB,SAAS,aAAc,SAAS;AACrD,YAAM,SAAS,CAAA;AACf,YAAM,MAAM,QAAQ,gBAAgB,OAAO;AAC3C,YAAM,YAAY,IAAI;AAEtB,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAElC,cAAK,MAAM,KAAK,MAAM;AAAA,UACjB,MAAM,KAAK,MAAM,YAAY;AAAA,UAC7B,MAAM,YAAY,KAAK,MAAM,GAAI;AACpC;AAAA,UACR;AAEM,iBAAO,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,QAClC;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/alphanumeric-data.cjs

@@ -1,79 +1,85 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-require("./mode.cjs");
-const mode = require("../../../../_virtual/mode.cjs");
-const Mode = mode.__exports;
-const ALPHA_NUM_CHARS = [
-  "0",
-  "1",
-  "2",
-  "3",
-  "4",
-  "5",
-  "6",
-  "7",
-  "8",
-  "9",
-  "A",
-  "B",
-  "C",
-  "D",
-  "E",
-  "F",
-  "G",
-  "H",
-  "I",
-  "J",
-  "K",
-  "L",
-  "M",
-  "N",
-  "O",
-  "P",
-  "Q",
-  "R",
-  "S",
-  "T",
-  "U",
-  "V",
-  "W",
-  "X",
-  "Y",
-  "Z",
-  " ",
-  "$",
-  "%",
-  "*",
-  "+",
-  "-",
-  ".",
-  "/",
-  ":"
-];
-function AlphanumericData(data) {
-  this.mode = Mode.ALPHANUMERIC;
-  this.data = data;
-}
-AlphanumericData.getBitsLength = function getBitsLength(length) {
-  return 11 * Math.floor(length / 2) + 6 * (length % 2);
-};
-AlphanumericData.prototype.getLength = function getLength() {
-  return this.data.length;
-};
-AlphanumericData.prototype.getBitsLength = function getBitsLength2() {
-  return AlphanumericData.getBitsLength(this.data.length);
-};
-AlphanumericData.prototype.write = function write(bitBuffer) {
-  let i;
-  for (i = 0; i + 2 <= this.data.length; i += 2) {
-    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
-    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
-    bitBuffer.put(value, 11);
-  }
-  if (this.data.length % 2) {
-    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
+const mode = require("./mode.cjs");
+var alphanumericData;
+var hasRequiredAlphanumericData;
+function requireAlphanumericData() {
+  if (hasRequiredAlphanumericData) return alphanumericData;
+  hasRequiredAlphanumericData = 1;
+  const Mode = mode.__require();
+  const ALPHA_NUM_CHARS = [
+    "0",
+    "1",
+    "2",
+    "3",
+    "4",
+    "5",
+    "6",
+    "7",
+    "8",
+    "9",
+    "A",
+    "B",
+    "C",
+    "D",
+    "E",
+    "F",
+    "G",
+    "H",
+    "I",
+    "J",
+    "K",
+    "L",
+    "M",
+    "N",
+    "O",
+    "P",
+    "Q",
+    "R",
+    "S",
+    "T",
+    "U",
+    "V",
+    "W",
+    "X",
+    "Y",
+    "Z",
+    " ",
+    "$",
+    "%",
+    "*",
+    "+",
+    "-",
+    ".",
+    "/",
+    ":"
+  ];
+  function AlphanumericData(data) {
+    this.mode = Mode.ALPHANUMERIC;
+    this.data = data;
   }
-};
-var alphanumericData = AlphanumericData;
-exports.alphanumericData = alphanumericData;
+  AlphanumericData.getBitsLength = function getBitsLength(length) {
+    return 11 * Math.floor(length / 2) + 6 * (length % 2);
+  };
+  AlphanumericData.prototype.getLength = function getLength() {
+    return this.data.length;
+  };
+  AlphanumericData.prototype.getBitsLength = function getBitsLength() {
+    return AlphanumericData.getBitsLength(this.data.length);
+  };
+  AlphanumericData.prototype.write = function write(bitBuffer) {
+    let i;
+    for (i = 0; i + 2 <= this.data.length; i += 2) {
+      let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
+      value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
+      bitBuffer.put(value, 11);
+    }
+    if (this.data.length % 2) {
+      bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
+    }
+  };
+  alphanumericData = AlphanumericData;
+  return alphanumericData;
+}
+exports.__require = requireAlphanumericData;
 //# sourceMappingURL=alphanumeric-data.cjs.map

package/dist/node_modules/qrcode/lib/core/alphanumeric-data.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"alphanumeric-data.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["require$$0","getBitsLength"],"mappings":";;;;AAAA,MAAM,OAAOA,KAAiB;AAW9B,MAAM,kBAAkB;AAAA,EACtB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC7C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAC1C;AAEA,SAAS,iBAAkB,MAAM;AAC/B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO;AACd;AAEA,iBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AACrD;AAEA,iBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,SAAO,KAAK,KAAK;AACnB;AAEA,iBAAiB,UAAU,gBAAgB,SAASC,iBAAiB;AACnE,SAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AACxD;AAEA,iBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,MAAI;AAIJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,QAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,aAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,MAAI,KAAK,KAAK,SAAS,GAAG;AACxB,cAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,EACvD;AACH;AAEA,IAAA,mBAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"alphanumeric-data.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["require$$0"],"mappings":";;;;;;;;AAAA,QAAM,OAAOA,KAAA,UAAA;AAWb,QAAM,kBAAkB;AAAA,IACtB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC7C;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,EAC1C;AAEA,WAAS,iBAAkB,MAAM;AAC/B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,mBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AAAA,EACrD;AAEA,mBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,mBAAiB,UAAU,gBAAgB,SAAS,gBAAiB;AACnE,WAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD;AAEA,mBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,QAAI;AAIJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,UAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,eAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,QAAI,KAAK,KAAK,SAAS,GAAG;AACxB,gBAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,IAC1D;AAAA,EACA;AAEA,qBAAiB;;;;","x_google_ignoreList":[0]}

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

@@ -1,79 +1,85 @@
-import "./mode.js";
-import { __exports as mode } from "../../../../_virtual/mode.js";
-const Mode = mode;
-const ALPHA_NUM_CHARS = [
-  "0",
-  "1",
-  "2",
-  "3",
-  "4",
-  "5",
-  "6",
-  "7",
-  "8",
-  "9",
-  "A",
-  "B",
-  "C",
-  "D",
-  "E",
-  "F",
-  "G",
-  "H",
-  "I",
-  "J",
-  "K",
-  "L",
-  "M",
-  "N",
-  "O",
-  "P",
-  "Q",
-  "R",
-  "S",
-  "T",
-  "U",
-  "V",
-  "W",
-  "X",
-  "Y",
-  "Z",
-  " ",
-  "$",
-  "%",
-  "*",
-  "+",
-  "-",
-  ".",
-  "/",
-  ":"
-];
-function AlphanumericData(data) {
-  this.mode = Mode.ALPHANUMERIC;
-  this.data = data;
-}
-AlphanumericData.getBitsLength = function getBitsLength(length) {
-  return 11 * Math.floor(length / 2) + 6 * (length % 2);
-};
-AlphanumericData.prototype.getLength = function getLength() {
-  return this.data.length;
-};
-AlphanumericData.prototype.getBitsLength = function getBitsLength2() {
-  return AlphanumericData.getBitsLength(this.data.length);
-};
-AlphanumericData.prototype.write = function write(bitBuffer) {
-  let i;
-  for (i = 0; i + 2 <= this.data.length; i += 2) {
-    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
-    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
-    bitBuffer.put(value, 11);
+import { __require as requireMode } from "./mode.js";
+var alphanumericData;
+var hasRequiredAlphanumericData;
+function requireAlphanumericData() {
+  if (hasRequiredAlphanumericData) return alphanumericData;
+  hasRequiredAlphanumericData = 1;
+  const Mode = requireMode();
+  const ALPHA_NUM_CHARS = [
+    "0",
+    "1",
+    "2",
+    "3",
+    "4",
+    "5",
+    "6",
+    "7",
+    "8",
+    "9",
+    "A",
+    "B",
+    "C",
+    "D",
+    "E",
+    "F",
+    "G",
+    "H",
+    "I",
+    "J",
+    "K",
+    "L",
+    "M",
+    "N",
+    "O",
+    "P",
+    "Q",
+    "R",
+    "S",
+    "T",
+    "U",
+    "V",
+    "W",
+    "X",
+    "Y",
+    "Z",
+    " ",
+    "$",
+    "%",
+    "*",
+    "+",
+    "-",
+    ".",
+    "/",
+    ":"
+  ];
+  function AlphanumericData(data) {
+    this.mode = Mode.ALPHANUMERIC;
+    this.data = data;
   }
-  if (this.data.length % 2) {
-    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
-  }
-};
-var alphanumericData = AlphanumericData;
+  AlphanumericData.getBitsLength = function getBitsLength(length) {
+    return 11 * Math.floor(length / 2) + 6 * (length % 2);
+  };
+  AlphanumericData.prototype.getLength = function getLength() {
+    return this.data.length;
+  };
+  AlphanumericData.prototype.getBitsLength = function getBitsLength() {
+    return AlphanumericData.getBitsLength(this.data.length);
+  };
+  AlphanumericData.prototype.write = function write(bitBuffer) {
+    let i;
+    for (i = 0; i + 2 <= this.data.length; i += 2) {
+      let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
+      value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
+      bitBuffer.put(value, 11);
+    }
+    if (this.data.length % 2) {
+      bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
+    }
+  };
+  alphanumericData = AlphanumericData;
+  return alphanumericData;
+}
 export {
-  alphanumericData as a
+  requireAlphanumericData as __require
 };
 //# sourceMappingURL=alphanumeric-data.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"alphanumeric-data.js","sources":["../../../../../../node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["require$$0","getBitsLength"],"mappings":";;AAAA,MAAM,OAAOA;AAWb,MAAM,kBAAkB;AAAA,EACtB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC7C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAC1C;AAEA,SAAS,iBAAkB,MAAM;AAC/B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO;AACd;AAEA,iBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AACrD;AAEA,iBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,SAAO,KAAK,KAAK;AACnB;AAEA,iBAAiB,UAAU,gBAAgB,SAASC,iBAAiB;AACnE,SAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AACxD;AAEA,iBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,MAAI;AAIJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,QAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,aAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,MAAI,KAAK,KAAK,SAAS,GAAG;AACxB,cAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,EACvD;AACH;AAEA,IAAA,mBAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"alphanumeric-data.js","sources":["../../../../../../node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,OAAOA,YAAA;AAWb,QAAM,kBAAkB;AAAA,IACtB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC7C;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,EAC1C;AAEA,WAAS,iBAAkB,MAAM;AAC/B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,mBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AAAA,EACrD;AAEA,mBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,mBAAiB,UAAU,gBAAgB,SAAS,gBAAiB;AACnE,WAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD;AAEA,mBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,QAAI;AAIJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,UAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,eAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,QAAI,KAAK,KAAK,SAAS,GAAG;AACxB,gBAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,IAC1D;AAAA,EACA;AAEA,qBAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/bit-buffer.cjs

@@ -1,33 +1,40 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-function BitBuffer() {
-  this.buffer = [];
-  this.length = 0;
-}
-BitBuffer.prototype = {
-  get: function(index) {
-    const bufIndex = Math.floor(index / 8);
-    return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
-  },
-  put: function(num, length) {
-    for (let i = 0; i < length; i++) {
-      this.putBit((num >>> length - i - 1 & 1) === 1);
-    }
-  },
-  getLengthInBits: function() {
-    return this.length;
-  },
-  putBit: function(bit) {
-    const bufIndex = Math.floor(this.length / 8);
-    if (this.buffer.length <= bufIndex) {
-      this.buffer.push(0);
-    }
-    if (bit) {
-      this.buffer[bufIndex] |= 128 >>> this.length % 8;
-    }
-    this.length++;
+var bitBuffer;
+var hasRequiredBitBuffer;
+function requireBitBuffer() {
+  if (hasRequiredBitBuffer) return bitBuffer;
+  hasRequiredBitBuffer = 1;
+  function BitBuffer() {
+    this.buffer = [];
+    this.length = 0;
   }
-};
-var bitBuffer = BitBuffer;
-exports.bitBuffer = bitBuffer;
+  BitBuffer.prototype = {
+    get: function(index) {
+      const bufIndex = Math.floor(index / 8);
+      return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
+    },
+    put: function(num, length) {
+      for (let i = 0; i < length; i++) {
+        this.putBit((num >>> length - i - 1 & 1) === 1);
+      }
+    },
+    getLengthInBits: function() {
+      return this.length;
+    },
+    putBit: function(bit) {
+      const bufIndex = Math.floor(this.length / 8);
+      if (this.buffer.length <= bufIndex) {
+        this.buffer.push(0);
+      }
+      if (bit) {
+        this.buffer[bufIndex] |= 128 >>> this.length % 8;
+      }
+      this.length++;
+    }
+  };
+  bitBuffer = BitBuffer;
+  return bitBuffer;
+}
+exports.__require = requireBitBuffer;
 //# sourceMappingURL=bit-buffer.cjs.map

package/dist/node_modules/qrcode/lib/core/bit-buffer.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"bit-buffer.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n  this.buffer = []\n  this.length = 0\n}\n\nBitBuffer.prototype = {\n\n  get: function (index) {\n    const bufIndex = Math.floor(index / 8)\n    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n  },\n\n  put: function (num, length) {\n    for (let i = 0; i < length; i++) {\n      this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n    }\n  },\n\n  getLengthInBits: function () {\n    return this.length\n  },\n\n  putBit: function (bit) {\n    const bufIndex = Math.floor(this.length / 8)\n    if (this.buffer.length <= bufIndex) {\n      this.buffer.push(0)\n    }\n\n    if (bit) {\n      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n    }\n\n    this.length++\n  }\n}\n\nmodule.exports = BitBuffer\n"],"names":[],"mappings":";;AAAA,SAAS,YAAa;AACpB,OAAK,SAAS,CAAE;AAChB,OAAK,SAAS;AAChB;AAEA,UAAU,YAAY;AAAA,EAEpB,KAAK,SAAU,OAAO;AACpB,UAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,YAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,EAC9D;AAAA,EAED,KAAK,SAAU,KAAK,QAAQ;AAC1B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,IACnD;AAAA,EACF;AAAA,EAED,iBAAiB,WAAY;AAC3B,WAAO,KAAK;AAAA,EACb;AAAA,EAED,QAAQ,SAAU,KAAK;AACrB,UAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,QAAI,KAAK,OAAO,UAAU,UAAU;AAClC,WAAK,OAAO,KAAK,CAAC;AAAA,IACnB;AAED,QAAI,KAAK;AACP,WAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,IACnD;AAED,SAAK;AAAA,EACN;AACH;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"bit-buffer.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n  this.buffer = []\n  this.length = 0\n}\n\nBitBuffer.prototype = {\n\n  get: function (index) {\n    const bufIndex = Math.floor(index / 8)\n    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n  },\n\n  put: function (num, length) {\n    for (let i = 0; i < length; i++) {\n      this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n    }\n  },\n\n  getLengthInBits: function () {\n    return this.length\n  },\n\n  putBit: function (bit) {\n    const bufIndex = Math.floor(this.length / 8)\n    if (this.buffer.length <= bufIndex) {\n      this.buffer.push(0)\n    }\n\n    if (bit) {\n      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n    }\n\n    this.length++\n  }\n}\n\nmodule.exports = BitBuffer\n"],"names":[],"mappings":";;;;;;;AAAA,WAAS,YAAa;AACpB,SAAK,SAAS,CAAA;AACd,SAAK,SAAS;AAAA,EAChB;AAEA,YAAU,YAAY;AAAA,IAEpB,KAAK,SAAU,OAAO;AACpB,YAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,cAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,IAC9D;AAAA,IAED,KAAK,SAAU,KAAK,QAAQ;AAC1B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,MACxD;AAAA,IACG;AAAA,IAED,iBAAiB,WAAY;AAC3B,aAAO,KAAK;AAAA,IACb;AAAA,IAED,QAAQ,SAAU,KAAK;AACrB,YAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,UAAI,KAAK,OAAO,UAAU,UAAU;AAClC,aAAK,OAAO,KAAK,CAAC;AAAA,MACxB;AAEI,UAAI,KAAK;AACP,aAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,MACxD;AAEI,WAAK;AAAA,IACT;AAAA,EACA;AAEA,cAAiB;;;;","x_google_ignoreList":[0]}

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

@@ -1,33 +1,40 @@
-function BitBuffer() {
-  this.buffer = [];
-  this.length = 0;
-}
-BitBuffer.prototype = {
-  get: function(index) {
-    const bufIndex = Math.floor(index / 8);
-    return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
-  },
-  put: function(num, length) {
-    for (let i = 0; i < length; i++) {
-      this.putBit((num >>> length - i - 1 & 1) === 1);
-    }
-  },
-  getLengthInBits: function() {
-    return this.length;
-  },
-  putBit: function(bit) {
-    const bufIndex = Math.floor(this.length / 8);
-    if (this.buffer.length <= bufIndex) {
-      this.buffer.push(0);
-    }
-    if (bit) {
-      this.buffer[bufIndex] |= 128 >>> this.length % 8;
-    }
-    this.length++;
+var bitBuffer;
+var hasRequiredBitBuffer;
+function requireBitBuffer() {
+  if (hasRequiredBitBuffer) return bitBuffer;
+  hasRequiredBitBuffer = 1;
+  function BitBuffer() {
+    this.buffer = [];
+    this.length = 0;
   }
-};
-var bitBuffer = BitBuffer;
+  BitBuffer.prototype = {
+    get: function(index) {
+      const bufIndex = Math.floor(index / 8);
+      return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
+    },
+    put: function(num, length) {
+      for (let i = 0; i < length; i++) {
+        this.putBit((num >>> length - i - 1 & 1) === 1);
+      }
+    },
+    getLengthInBits: function() {
+      return this.length;
+    },
+    putBit: function(bit) {
+      const bufIndex = Math.floor(this.length / 8);
+      if (this.buffer.length <= bufIndex) {
+        this.buffer.push(0);
+      }
+      if (bit) {
+        this.buffer[bufIndex] |= 128 >>> this.length % 8;
+      }
+      this.length++;
+    }
+  };
+  bitBuffer = BitBuffer;
+  return bitBuffer;
+}
 export {
-  bitBuffer as b
+  requireBitBuffer as __require
 };
 //# sourceMappingURL=bit-buffer.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"bit-buffer.js","sources":["../../../../../../node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n  this.buffer = []\n  this.length = 0\n}\n\nBitBuffer.prototype = {\n\n  get: function (index) {\n    const bufIndex = Math.floor(index / 8)\n    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n  },\n\n  put: function (num, length) {\n    for (let i = 0; i < length; i++) {\n      this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n    }\n  },\n\n  getLengthInBits: function () {\n    return this.length\n  },\n\n  putBit: function (bit) {\n    const bufIndex = Math.floor(this.length / 8)\n    if (this.buffer.length <= bufIndex) {\n      this.buffer.push(0)\n    }\n\n    if (bit) {\n      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n    }\n\n    this.length++\n  }\n}\n\nmodule.exports = BitBuffer\n"],"names":[],"mappings":"AAAA,SAAS,YAAa;AACpB,OAAK,SAAS,CAAE;AAChB,OAAK,SAAS;AAChB;AAEA,UAAU,YAAY;AAAA,EAEpB,KAAK,SAAU,OAAO;AACpB,UAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,YAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,EAC9D;AAAA,EAED,KAAK,SAAU,KAAK,QAAQ;AAC1B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,IACnD;AAAA,EACF;AAAA,EAED,iBAAiB,WAAY;AAC3B,WAAO,KAAK;AAAA,EACb;AAAA,EAED,QAAQ,SAAU,KAAK;AACrB,UAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,QAAI,KAAK,OAAO,UAAU,UAAU;AAClC,WAAK,OAAO,KAAK,CAAC;AAAA,IACnB;AAED,QAAI,KAAK;AACP,WAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,IACnD;AAED,SAAK;AAAA,EACN;AACH;AAEA,IAAA,YAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"bit-buffer.js","sources":["../../../../../../node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n  this.buffer = []\n  this.length = 0\n}\n\nBitBuffer.prototype = {\n\n  get: function (index) {\n    const bufIndex = Math.floor(index / 8)\n    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n  },\n\n  put: function (num, length) {\n    for (let i = 0; i < length; i++) {\n      this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n    }\n  },\n\n  getLengthInBits: function () {\n    return this.length\n  },\n\n  putBit: function (bit) {\n    const bufIndex = Math.floor(this.length / 8)\n    if (this.buffer.length <= bufIndex) {\n      this.buffer.push(0)\n    }\n\n    if (bit) {\n      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n    }\n\n    this.length++\n  }\n}\n\nmodule.exports = BitBuffer\n"],"names":[],"mappings":";;;;;AAAA,WAAS,YAAa;AACpB,SAAK,SAAS,CAAA;AACd,SAAK,SAAS;AAAA,EAChB;AAEA,YAAU,YAAY;AAAA,IAEpB,KAAK,SAAU,OAAO;AACpB,YAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,cAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,IAC9D;AAAA,IAED,KAAK,SAAU,KAAK,QAAQ;AAC1B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,MACxD;AAAA,IACG;AAAA,IAED,iBAAiB,WAAY;AAC3B,aAAO,KAAK;AAAA,IACb;AAAA,IAED,QAAQ,SAAU,KAAK;AACrB,YAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,UAAI,KAAK,OAAO,UAAU,UAAU;AAClC,aAAK,OAAO,KAAK,CAAC;AAAA,MACxB;AAEI,UAAI,KAAK;AACP,aAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,MACxD;AAEI,WAAK;AAAA,IACT;AAAA,EACA;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

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

@@ -1,27 +1,34 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-function BitMatrix(size) {
-  if (!size || size < 1) {
-    throw new Error("BitMatrix size must be defined and greater than 0");
+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);
   }
-  this.size = size;
-  this.data = new Uint8Array(size * size);
-  this.reservedBit = new Uint8Array(size * size);
+  BitMatrix.prototype.set = function(row, col, value, reserved) {
+    const index = row * this.size + col;
+    this.data[index] = value;
+    if (reserved) this.reservedBit[index] = true;
+  };
+  BitMatrix.prototype.get = function(row, col) {
+    return this.data[row * this.size + col];
+  };
+  BitMatrix.prototype.xor = function(row, col, value) {
+    this.data[row * this.size + col] ^= value;
+  };
+  BitMatrix.prototype.isReserved = function(row, col) {
+    return this.reservedBit[row * this.size + col];
+  };
+  bitMatrix = BitMatrix;
+  return bitMatrix;
 }
-BitMatrix.prototype.set = function(row, col, value, reserved) {
-  const index = row * this.size + col;
-  this.data[index] = value;
-  if (reserved) this.reservedBit[index] = true;
-};
-BitMatrix.prototype.get = function(row, col) {
-  return this.data[row * this.size + col];
-};
-BitMatrix.prototype.xor = function(row, col, value) {
-  this.data[row * this.size + col] ^= value;
-};
-BitMatrix.prototype.isReserved = function(row, col) {
-  return this.reservedBit[row * this.size + col];
-};
-var bitMatrix = BitMatrix;
-exports.bitMatrix = bitMatrix;
+exports.__require = requireBitMatrix;
 //# sourceMappingURL=bit-matrix.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"bit-matrix.cjs","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":";;AAKA,SAAS,UAAW,MAAM;AACxB,MAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACpE;AAED,OAAK,OAAO;AACZ,OAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,OAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAC/C;AAWA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,QAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,OAAK,KAAK,KAAK,IAAI;AACnB,MAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAC1C;AASA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,SAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AACxC;AAUA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,OAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AACtC;AASA,UAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,SAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAC/C;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"bit-matrix.cjs","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":";;;;;;;AAKA,WAAS,UAAW,MAAM;AACxB,QAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACvE;AAEE,SAAK,OAAO;AACZ,SAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,SAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAAA,EAC/C;AAWA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,UAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,SAAK,KAAK,KAAK,IAAI;AACnB,QAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAAA,EAC1C;AASA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,WAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AAAA,EACxC;AAUA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,SAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AAAA,EACtC;AASA,YAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,WAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAAA,EAC/C;AAEA,cAAiB;;;;","x_google_ignoreList":[0]}