@ozdao/prometheus-framework 0.2.330 → 0.2.332

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

@@ -1,83 +1,90 @@
 import { __exports as mode } from "../../../../_virtual/mode.js";
-import "./version-check.js";
-import "./regex.js";
-import { __exports as versionCheck } from "../../../../_virtual/version-check.js";
-import { __exports as regex } from "../../../../_virtual/regex.js";
-(function(exports) {
-  const VersionCheck = versionCheck;
-  const Regex = regex;
-  exports.NUMERIC = {
-    id: "Numeric",
-    bit: 1 << 0,
-    ccBits: [10, 12, 14]
-  };
-  exports.ALPHANUMERIC = {
-    id: "Alphanumeric",
-    bit: 1 << 1,
-    ccBits: [9, 11, 13]
-  };
-  exports.BYTE = {
-    id: "Byte",
-    bit: 1 << 2,
-    ccBits: [8, 16, 16]
-  };
-  exports.KANJI = {
-    id: "Kanji",
-    bit: 1 << 3,
-    ccBits: [8, 10, 12]
-  };
-  exports.MIXED = {
-    bit: -1
-  };
-  exports.getCharCountIndicator = function getCharCountIndicator(mode2, version) {
-    if (!mode2.ccBits) throw new Error("Invalid mode: " + mode2);
-    if (!VersionCheck.isValid(version)) {
-      throw new Error("Invalid version: " + version);
+import { __require as requireVersionCheck } from "./version-check.js";
+import { __require as requireRegex } from "./regex.js";
+var hasRequiredMode;
+function requireMode() {
+  if (hasRequiredMode) return mode;
+  hasRequiredMode = 1;
+  (function(exports) {
+    const VersionCheck = requireVersionCheck();
+    const Regex = requireRegex();
+    exports.NUMERIC = {
+      id: "Numeric",
+      bit: 1 << 0,
+      ccBits: [10, 12, 14]
+    };
+    exports.ALPHANUMERIC = {
+      id: "Alphanumeric",
+      bit: 1 << 1,
+      ccBits: [9, 11, 13]
+    };
+    exports.BYTE = {
+      id: "Byte",
+      bit: 1 << 2,
+      ccBits: [8, 16, 16]
+    };
+    exports.KANJI = {
+      id: "Kanji",
+      bit: 1 << 3,
+      ccBits: [8, 10, 12]
+    };
+    exports.MIXED = {
+      bit: -1
+    };
+    exports.getCharCountIndicator = function getCharCountIndicator(mode2, version) {
+      if (!mode2.ccBits) throw new Error("Invalid mode: " + mode2);
+      if (!VersionCheck.isValid(version)) {
+        throw new Error("Invalid version: " + version);
+      }
+      if (version >= 1 && version < 10) return mode2.ccBits[0];
+      else if (version < 27) return mode2.ccBits[1];
+      return mode2.ccBits[2];
+    };
+    exports.getBestModeForData = function getBestModeForData(dataStr) {
+      if (Regex.testNumeric(dataStr)) return exports.NUMERIC;
+      else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC;
+      else if (Regex.testKanji(dataStr)) return exports.KANJI;
+      else return exports.BYTE;
+    };
+    exports.toString = function toString(mode2) {
+      if (mode2 && mode2.id) return mode2.id;
+      throw new Error("Invalid mode");
+    };
+    exports.isValid = function isValid(mode2) {
+      return mode2 && mode2.bit && mode2.ccBits;
+    };
+    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.NUMERIC;
+        case "alphanumeric":
+          return exports.ALPHANUMERIC;
+        case "kanji":
+          return exports.KANJI;
+        case "byte":
+          return exports.BYTE;
+        default:
+          throw new Error("Unknown mode: " + string);
+      }
     }
-    if (version >= 1 && version < 10) return mode2.ccBits[0];
-    else if (version < 27) return mode2.ccBits[1];
-    return mode2.ccBits[2];
-  };
-  exports.getBestModeForData = function getBestModeForData(dataStr) {
-    if (Regex.testNumeric(dataStr)) return exports.NUMERIC;
-    else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC;
-    else if (Regex.testKanji(dataStr)) return exports.KANJI;
-    else return exports.BYTE;
-  };
-  exports.toString = function toString(mode2) {
-    if (mode2 && mode2.id) return mode2.id;
-    throw new Error("Invalid mode");
-  };
-  exports.isValid = function isValid(mode2) {
-    return mode2 && mode2.bit && mode2.ccBits;
-  };
-  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.NUMERIC;
-      case "alphanumeric":
-        return exports.ALPHANUMERIC;
-      case "kanji":
-        return exports.KANJI;
-      case "byte":
-        return exports.BYTE;
-      default:
-        throw new Error("Unknown mode: " + string);
-    }
-  }
-  exports.from = function from(value, defaultValue) {
-    if (exports.isValid(value)) {
-      return value;
-    }
-    try {
-      return fromString(value);
-    } catch (e) {
-      return defaultValue;
-    }
-  };
-})(mode);
+    exports.from = function from(value, defaultValue) {
+      if (exports.isValid(value)) {
+        return value;
+      }
+      try {
+        return fromString(value);
+      } catch (e) {
+        return defaultValue;
+      }
+    };
+  })(mode);
+  return mode;
+}
+export {
+  requireMode as __require
+};
 //# sourceMappingURL=mode.js.map

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

@@ -1 +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","mode"],"mappings":";;;;;;AAAA,QAAM,eAAeA;AACrB,QAAM,QAAQC;AASd,UAAkB,UAAA;AAAA,IAChB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,EACpB;AAWD,UAAuB,eAAA;AAAA,IACrB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAOD,UAAe,OAAA;AAAA,IACb,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAWD,UAAgB,QAAA;AAAA,IACd,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAQD,UAAgB,QAAA;AAAA,IACd,KAAK;AAAA,EACN;AAUD,UAAA,wBAAgC,SAAS,sBAAuBC,OAAM,SAAS;AAC7E,QAAI,CAACA,MAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,KAAI;AAEzD,QAAI,CAAC,aAAa,QAAQ,OAAO,GAAG;AAClC,YAAM,IAAI,MAAM,sBAAsB,OAAO;AAAA,IAC9C;AAED,QAAI,WAAW,KAAK,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAAA,aAC7C,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAC3C,WAAOA,MAAK,OAAO,CAAC;AAAA,EACrB;AAQD,UAAA,qBAA6B,SAAS,mBAAoB,SAAS;AACjE,QAAI,MAAM,YAAY,OAAO,EAAG,QAAO,QAAQ;AAAA,aACtC,MAAM,iBAAiB,OAAO,EAAG,QAAO,QAAQ;AAAA,aAChD,MAAM,UAAU,OAAO,EAAG,QAAO,QAAQ;AAAA,QAC7C,QAAO,QAAQ;AAAA,EACrB;AAQD,UAAA,WAAmB,SAAS,SAAUA,OAAM;AAC1C,QAAIA,SAAQA,MAAK,GAAI,QAAOA,MAAK;AACjC,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AAQD,UAAA,UAAkB,SAAS,QAASA,OAAM;AACxC,WAAOA,SAAQA,MAAK,OAAOA,MAAK;AAAA,EACjC;AAQD,WAAS,WAAY,QAAQ;AAC3B,QAAI,OAAO,WAAW,UAAU;AAC9B,YAAM,IAAI,MAAM,uBAAuB;AAAA,IACxC;AAED,UAAM,QAAQ,OAAO,YAAa;AAElC,YAAQ,OAAK;AAAA,MACX,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB;AACE,cAAM,IAAI,MAAM,mBAAmB,MAAM;AAAA,IAC5C;AAAA,EACF;AAUD,UAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,QAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1B,aAAO;AAAA,IACR;AAED,QAAI;AACF,aAAO,WAAW,KAAK;AAAA,IACxB,SAAQ,GAAG;AACV,aAAO;AAAA,IACR;AAAA,EACH;;","x_google_ignoreList":[0]}
+{"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","mode"],"mappings":";;;;;;;;AAAA,UAAM,eAAeA,oBAAA;AACrB,UAAM,QAAQC,aAAA;AASd,YAAkB,UAAA;AAAA,MAChB,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,IACrB;AAWA,YAAuB,eAAA;AAAA,MACrB,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB;AAOA,YAAe,OAAA;AAAA,MACb,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB;AAWA,YAAgB,QAAA;AAAA,MACd,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB;AAQA,YAAgB,QAAA;AAAA,MACd,KAAK;AAAA,IACP;AAUA,YAAA,wBAAgC,SAAS,sBAAuBC,OAAM,SAAS;AAC7E,UAAI,CAACA,MAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,KAAI;AAEzD,UAAI,CAAC,aAAa,QAAQ,OAAO,GAAG;AAClC,cAAM,IAAI,MAAM,sBAAsB,OAAO;AAAA,MACjD;AAEE,UAAI,WAAW,KAAK,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAAA,eAC7C,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAC3C,aAAOA,MAAK,OAAO,CAAC;AAAA,IACtB;AAQA,YAAA,qBAA6B,SAAS,mBAAoB,SAAS;AACjE,UAAI,MAAM,YAAY,OAAO,EAAG,QAAO,QAAQ;AAAA,eACtC,MAAM,iBAAiB,OAAO,EAAG,QAAO,QAAQ;AAAA,eAChD,MAAM,UAAU,OAAO,EAAG,QAAO,QAAQ;AAAA,UAC7C,QAAO,QAAQ;AAAA,IACtB;AAQA,YAAA,WAAmB,SAAS,SAAUA,OAAM;AAC1C,UAAIA,SAAQA,MAAK,GAAI,QAAOA,MAAK;AACjC,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC;AAQA,YAAA,UAAkB,SAAS,QAASA,OAAM;AACxC,aAAOA,SAAQA,MAAK,OAAOA,MAAK;AAAA,IAClC;AAQA,aAAS,WAAY,QAAQ;AAC3B,UAAI,OAAO,WAAW,UAAU;AAC9B,cAAM,IAAI,MAAM,uBAAuB;AAAA,MAC3C;AAEE,YAAM,QAAQ,OAAO,YAAW;AAEhC,cAAQ,OAAK;AAAA,QACX,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB;AACE,gBAAM,IAAI,MAAM,mBAAmB,MAAM;AAAA,MAC/C;AAAA,IACA;AAUA,YAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,UAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1B,eAAO;AAAA,MACX;AAEE,UAAI;AACF,eAAO,WAAW,KAAK;AAAA,MACxB,SAAQ,GAAG;AACV,eAAO;AAAA,MACX;AAAA,IACA;AAAA;;;","x_google_ignoreList":[0]}

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

@@ -1,35 +1,41 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-require("./mode.cjs");
-const mode = require("../../../../_virtual/mode.cjs");
-const Mode = mode.__exports;
-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 getBitsLength2() {
-  return NumericData.getBitsLength(this.data.length);
-};
-NumericData.prototype.write = function write(bitBuffer) {
-  let i, group, value;
-  for (i = 0; i + 3 <= this.data.length; i += 3) {
-    group = this.data.substr(i, 3);
-    value = parseInt(group, 10);
-    bitBuffer.put(value, 10);
-  }
-  const remainingNum = this.data.length - i;
-  if (remainingNum > 0) {
-    group = this.data.substr(i);
-    value = parseInt(group, 10);
-    bitBuffer.put(value, remainingNum * 3 + 1);
+const mode = require("./mode.cjs");
+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();
   }
-};
-var numericData = NumericData;
-exports.numericData = numericData;
+  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;
+    for (i = 0; i + 3 <= this.data.length; i += 3) {
+      group = this.data.substr(i, 3);
+      value = parseInt(group, 10);
+      bitBuffer.put(value, 10);
+    }
+    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.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"numeric-data.cjs","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","getBitsLength"],"mappings":";;;;AAAA,MAAM,OAAOA,KAAiB;AAE9B,SAAS,YAAa,MAAM;AAC1B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO,KAAK,SAAU;AAC7B;AAEA,YAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAChF;AAEA,YAAY,UAAU,YAAY,SAAS,YAAa;AACtD,SAAO,KAAK,KAAK;AACnB;AAEA,YAAY,UAAU,gBAAgB,SAASC,iBAAiB;AAC9D,SAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AACnD;AAEA,YAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,MAAI,GAAG,OAAO;AAId,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,YAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,QAAM,eAAe,KAAK,KAAK,SAAS;AACxC,MAAI,eAAe,GAAG;AACpB,YAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,EAC1C;AACH;AAEA,IAAA,cAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"numeric-data.cjs","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,QAAM,OAAOA,KAAA,UAAA;AAEb,WAAS,YAAa,MAAM;AAC1B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO,KAAK,SAAQ;AAAA,EAC3B;AAEA,cAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAAA,EAChF;AAEA,cAAY,UAAU,YAAY,SAAS,YAAa;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,cAAY,UAAU,gBAAgB,SAAS,gBAAiB;AAC9D,WAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD;AAEA,cAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,QAAI,GAAG,OAAO;AAId,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,cAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,cAAQ,SAAS,OAAO,EAAE;AAE1B,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,QAAI,eAAe,GAAG;AACpB,cAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,cAAQ,SAAS,OAAO,EAAE;AAE1B,gBAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,IAC7C;AAAA,EACA;AAEA,gBAAiB;;;;","x_google_ignoreList":[0]}

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

@@ -1,35 +1,41 @@
-import "./mode.js";
-import { __exports as mode } from "../../../../_virtual/mode.js";
-const Mode = mode;
-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 getBitsLength2() {
-  return NumericData.getBitsLength(this.data.length);
-};
-NumericData.prototype.write = function write(bitBuffer) {
-  let i, group, value;
-  for (i = 0; i + 3 <= this.data.length; i += 3) {
-    group = this.data.substr(i, 3);
-    value = parseInt(group, 10);
-    bitBuffer.put(value, 10);
+import { __require as requireMode } from "./mode.js";
+var numericData;
+var hasRequiredNumericData;
+function requireNumericData() {
+  if (hasRequiredNumericData) return numericData;
+  hasRequiredNumericData = 1;
+  const Mode = requireMode();
+  function NumericData(data) {
+    this.mode = Mode.NUMERIC;
+    this.data = data.toString();
   }
-  const remainingNum = this.data.length - i;
-  if (remainingNum > 0) {
-    group = this.data.substr(i);
-    value = parseInt(group, 10);
-    bitBuffer.put(value, remainingNum * 3 + 1);
-  }
-};
-var numericData = NumericData;
+  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;
+    for (i = 0; i + 3 <= this.data.length; i += 3) {
+      group = this.data.substr(i, 3);
+      value = parseInt(group, 10);
+      bitBuffer.put(value, 10);
+    }
+    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;
+}
 export {
-  numericData as n
+  requireNumericData as __require
 };
 //# sourceMappingURL=numeric-data.js.map

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

@@ -1 +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","getBitsLength"],"mappings":";;AAAA,MAAM,OAAOA;AAEb,SAAS,YAAa,MAAM;AAC1B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO,KAAK,SAAU;AAC7B;AAEA,YAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAChF;AAEA,YAAY,UAAU,YAAY,SAAS,YAAa;AACtD,SAAO,KAAK,KAAK;AACnB;AAEA,YAAY,UAAU,gBAAgB,SAASC,iBAAiB;AAC9D,SAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AACnD;AAEA,YAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,MAAI,GAAG,OAAO;AAId,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,YAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,QAAM,eAAe,KAAK,KAAK,SAAS;AACxC,MAAI,eAAe,GAAG;AACpB,YAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,EAC1C;AACH;AAEA,IAAA,cAAiB;","x_google_ignoreList":[0]}
+{"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,QAAM,OAAOA,YAAA;AAEb,WAAS,YAAa,MAAM;AAC1B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO,KAAK,SAAQ;AAAA,EAC3B;AAEA,cAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAAA,EAChF;AAEA,cAAY,UAAU,YAAY,SAAS,YAAa;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,cAAY,UAAU,gBAAgB,SAAS,gBAAiB;AAC9D,WAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD;AAEA,cAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,QAAI,GAAG,OAAO;AAId,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,cAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,cAAQ,SAAS,OAAO,EAAE;AAE1B,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,QAAI,eAAe,GAAG;AACpB,cAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,cAAQ,SAAS,OAAO,EAAE;AAE1B,gBAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,IAC7C;AAAA,EACA;AAEA,gBAAiB;;;","x_google_ignoreList":[0]}

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

@@ -1,37 +1,44 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const polynomial = require("../../../../_virtual/polynomial.cjs");
-require("./galois-field.cjs");
-const galoisField = require("../../../../_virtual/galois-field.cjs");
-(function(exports2) {
-  const GF = galoisField.__exports;
-  exports2.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]);
+const galoisField = require("./galois-field.cjs");
+var hasRequiredPolynomial;
+function requirePolynomial() {
+  if (hasRequiredPolynomial) return polynomial.__exports;
+  hasRequiredPolynomial = 1;
+  (function(exports2) {
+    const GF = galoisField.__require();
+    exports2.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;
-  };
-  exports2.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);
+      return coeff;
+    };
+    exports2.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);
+        }
+        let offset = 0;
+        while (offset < result.length && result[offset] === 0) offset++;
+        result = result.slice(offset);
       }
-      let offset = 0;
-      while (offset < result.length && result[offset] === 0) offset++;
-      result = result.slice(offset);
-    }
-    return result;
-  };
-  exports2.generateECPolynomial = function generateECPolynomial(degree) {
-    let poly = new Uint8Array([1]);
-    for (let i = 0; i < degree; i++) {
-      poly = exports2.mul(poly, new Uint8Array([1, GF.exp(i)]));
-    }
-    return poly;
-  };
-})(polynomial.__exports);
+      return result;
+    };
+    exports2.generateECPolynomial = function generateECPolynomial(degree) {
+      let poly = new Uint8Array([1]);
+      for (let i = 0; i < degree; i++) {
+        poly = exports2.mul(poly, new Uint8Array([1, GF.exp(i)]));
+      }
+      return poly;
+    };
+  })(polynomial.__exports);
+  return polynomial.__exports;
+}
+exports.__require = requirePolynomial;
 //# sourceMappingURL=polynomial.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"polynomial.cjs","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,QAAM,KAAKA,YAAyB;AASpC,EAAAC,SAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,UAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,cAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACpC;AAAA,IACF;AAED,WAAO;AAAA,EACR;AASD,EAAAA,SAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,QAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,WAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,YAAM,QAAQ,OAAO,CAAC;AAEtB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,MACtC;AAGD,UAAI,SAAS;AACb,aAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,eAAS,OAAO,MAAM,MAAM;AAAA,IAC7B;AAED,WAAO;AAAA,EACR;AASD,EAAAA,SAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,QAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAOA,SAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,IACxD;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"polynomial.cjs","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,UAAM,KAAKA,YAAA,UAAA;AASX,IAAAC,SAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,YAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,gBAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,QACzC;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AASA,IAAAA,SAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,UAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,aAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,cAAM,QAAQ,OAAO,CAAC;AAEtB,iBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,iBAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,QAC3C;AAGI,YAAI,SAAS;AACb,eAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,iBAAS,OAAO,MAAM,MAAM;AAAA,MAChC;AAEE,aAAO;AAAA,IACT;AASA,IAAAA,SAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,UAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAOA,SAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,MAC3D;AAEE,aAAO;AAAA,IACT;AAAA;;;;","x_google_ignoreList":[0]}

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

@@ -1,36 +1,44 @@
 import { __exports as polynomial } from "../../../../_virtual/polynomial.js";
-import "./galois-field.js";
-import { __exports as galoisField } from "../../../../_virtual/galois-field.js";
-(function(exports) {
-  const GF = galoisField;
-  exports.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]);
+import { __require as requireGaloisField } from "./galois-field.js";
+var hasRequiredPolynomial;
+function requirePolynomial() {
+  if (hasRequiredPolynomial) return polynomial;
+  hasRequiredPolynomial = 1;
+  (function(exports) {
+    const GF = requireGaloisField();
+    exports.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;
-  };
-  exports.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);
+      return coeff;
+    };
+    exports.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);
+        }
+        let offset = 0;
+        while (offset < result.length && result[offset] === 0) offset++;
+        result = result.slice(offset);
       }
-      let offset = 0;
-      while (offset < result.length && result[offset] === 0) offset++;
-      result = result.slice(offset);
-    }
-    return result;
-  };
-  exports.generateECPolynomial = function generateECPolynomial(degree) {
-    let poly = new Uint8Array([1]);
-    for (let i = 0; i < degree; i++) {
-      poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]));
-    }
-    return poly;
-  };
-})(polynomial);
+      return result;
+    };
+    exports.generateECPolynomial = function generateECPolynomial(degree) {
+      let poly = new Uint8Array([1]);
+      for (let i = 0; i < degree; i++) {
+        poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]));
+      }
+      return poly;
+    };
+  })(polynomial);
+  return polynomial;
+}
+export {
+  requirePolynomial as __require
+};
 //# sourceMappingURL=polynomial.js.map

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

@@ -1 +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"],"mappings":";;;;AAAA,QAAM,KAAKA;AASX,UAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,UAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,cAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACpC;AAAA,IACF;AAED,WAAO;AAAA,EACR;AASD,UAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,QAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,WAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,YAAM,QAAQ,OAAO,CAAC;AAEtB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,MACtC;AAGD,UAAI,SAAS;AACb,aAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,eAAS,OAAO,MAAM,MAAM;AAAA,IAC7B;AAED,WAAO;AAAA,EACR;AASD,UAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,QAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAO,QAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,IACxD;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}
+{"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"],"mappings":";;;;;;;AAAA,UAAM,KAAKA,mBAAA;AASX,YAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,YAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,gBAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,QACzC;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AASA,YAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,UAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,aAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,cAAM,QAAQ,OAAO,CAAC;AAEtB,iBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,iBAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,QAC3C;AAGI,YAAI,SAAS;AACb,eAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,iBAAS,OAAO,MAAM,MAAM;AAAA,MAChC;AAEE,aAAO;AAAA,IACT;AASA,YAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,UAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAO,QAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,MAC3D;AAEE,aAAO;AAAA,IACT;AAAA;;;","x_google_ignoreList":[0]}