@ozdao/martyrs 0.2.488 → 0.2.491

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

@@ -0,0 +1 @@
+{"version":3,"file":"error-correction-code.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-code.js"],"sourcesContent":["const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L  M  Q  H\r\n  1, 1, 1, 1,\r\n  1, 1, 1, 1,\r\n  1, 1, 2, 2,\r\n  1, 2, 2, 4,\r\n  1, 2, 4, 4,\r\n  2, 4, 4, 4,\r\n  2, 4, 6, 5,\r\n  2, 4, 6, 6,\r\n  2, 5, 8, 8,\r\n  4, 5, 8, 8,\r\n  4, 5, 8, 11,\r\n  4, 8, 10, 11,\r\n  4, 9, 12, 16,\r\n  4, 9, 16, 16,\r\n  6, 10, 12, 18,\r\n  6, 10, 17, 16,\r\n  6, 11, 16, 19,\r\n  6, 13, 18, 21,\r\n  7, 14, 21, 25,\r\n  8, 16, 20, 25,\r\n  8, 17, 23, 25,\r\n  9, 17, 23, 34,\r\n  9, 18, 25, 30,\r\n  10, 20, 27, 32,\r\n  12, 21, 29, 35,\r\n  12, 23, 34, 37,\r\n  12, 25, 34, 40,\r\n  13, 26, 35, 42,\r\n  14, 28, 38, 45,\r\n  15, 29, 40, 48,\r\n  16, 31, 43, 51,\r\n  17, 33, 45, 54,\r\n  18, 35, 48, 57,\r\n  19, 37, 51, 60,\r\n  19, 38, 53, 63,\r\n  20, 40, 56, 66,\r\n  21, 43, 59, 70,\r\n  22, 45, 62, 74,\r\n  24, 47, 65, 77,\r\n  25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L  M  Q  H\r\n  7, 10, 13, 17,\r\n  10, 16, 22, 28,\r\n  15, 26, 36, 44,\r\n  20, 36, 52, 64,\r\n  26, 48, 72, 88,\r\n  36, 64, 96, 112,\r\n  40, 72, 108, 130,\r\n  48, 88, 132, 156,\r\n  60, 110, 160, 192,\r\n  72, 130, 192, 224,\r\n  80, 150, 224, 264,\r\n  96, 176, 260, 308,\r\n  104, 198, 288, 352,\r\n  120, 216, 320, 384,\r\n  132, 240, 360, 432,\r\n  144, 280, 408, 480,\r\n  168, 308, 448, 532,\r\n  180, 338, 504, 588,\r\n  196, 364, 546, 650,\r\n  224, 416, 600, 700,\r\n  224, 442, 644, 750,\r\n  252, 476, 690, 816,\r\n  270, 504, 750, 900,\r\n  300, 560, 810, 960,\r\n  312, 588, 870, 1050,\r\n  336, 644, 952, 1110,\r\n  360, 700, 1020, 1200,\r\n  390, 728, 1050, 1260,\r\n  420, 784, 1140, 1350,\r\n  450, 812, 1200, 1440,\r\n  480, 868, 1290, 1530,\r\n  510, 924, 1350, 1620,\r\n  540, 980, 1440, 1710,\r\n  570, 1036, 1530, 1800,\r\n  570, 1064, 1590, 1890,\r\n  600, 1120, 1680, 1980,\r\n  630, 1204, 1770, 2100,\r\n  660, 1260, 1860, 2220,\r\n  720, 1316, 1950, 2310,\r\n  750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,UAAUA,4BAAmC;AAEnD,QAAM,kBAAkB;AAAA;AAAA,IAEtB;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,EACb;AAED,QAAM,qBAAqB;AAAA;AAAA,IAEzB;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAK;AAAA,IACb;AAAA,IAAI;AAAA,IAAI;AAAA,IAAK;AAAA,IACb;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,EAClB;AAUD,sBAAA,iBAAyB,SAAS,eAAgB,SAAS,sBAAsB;AAC/E,YAAQ,sBAAoB;AAAA,MAC1B,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C;AACE,eAAO;AAAA,IACV;AAAA,EACF;AAUD,sBAAA,yBAAiC,SAAS,uBAAwB,SAAS,sBAAsB;AAC/F,YAAQ,sBAAoB;AAAA,MAC1B,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD;AACE,eAAO;AAAA,IACV;AAAA,EACH;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-level.cjs

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

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-level.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"error-correction-level.cjs","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-level.js"],"sourcesContent":["exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'l':\n    case 'low':\n      return exports.L\n\n    case 'm':\n    case 'medium':\n      return exports.M\n\n    case 'q':\n    case 'quartile':\n      return exports.Q\n\n    case 'h':\n    case 'high':\n      return exports.H\n\n    default:\n      throw new Error('Unknown EC Level: ' + string)\n  }\n}\n\nexports.isValid = function isValid (level) {\n  return level && typeof level.bit !== 'undefined' &&\n    level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["exports"],"mappings":";;;;;;;;AAAA,IAAAA,SAAY,IAAA,EAAE,KAAK,EAAC;AACpB,IAAAA,SAAY,IAAA,EAAE,KAAK,EAAC;AACpB,IAAAA,SAAY,IAAA,EAAE,KAAK,EAAC;AACpB,IAAAA,SAAY,IAAA,EAAE,KAAK,EAAC;AAEpB,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;AAAA,QACL,KAAK;AACH,iBAAOA,SAAQ;AAAA,QAEjB,KAAK;AAAA,QACL,KAAK;AACH,iBAAOA,SAAQ;AAAA,QAEjB,KAAK;AAAA,QACL,KAAK;AACH,iBAAOA,SAAQ;AAAA,QAEjB,KAAK;AAAA,QACL,KAAK;AACH,iBAAOA,SAAQ;AAAA,QAEjB;AACE,gBAAM,IAAI,MAAM,uBAAuB,MAAM;AAAA,MACnD;AAAA,IACA;AAEA,IAAAA,SAAA,UAAkB,SAAS,QAAS,OAAO;AACzC,aAAO,SAAS,OAAO,MAAM,QAAQ,eACnC,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,IAClC;AAEA,IAAAA,SAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,UAAIA,SAAQ,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/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-level.js

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"error-correction-level.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-level.js"],"sourcesContent":["exports.L = { bit: 1 }\nexports.M = { bit: 0 }\nexports.Q = { bit: 3 }\nexports.H = { bit: 2 }\n\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'l':\n    case 'low':\n      return exports.L\n\n    case 'm':\n    case 'medium':\n      return exports.M\n\n    case 'q':\n    case 'quartile':\n      return exports.Q\n\n    case 'h':\n    case 'high':\n      return exports.H\n\n    default:\n      throw new Error('Unknown EC Level: ' + string)\n  }\n}\n\nexports.isValid = function isValid (level) {\n  return level && typeof level.bit !== 'undefined' &&\n    level.bit >= 0 && level.bit < 4\n}\n\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":[],"mappings":";;;;;;AAAA,YAAY,IAAA,EAAE,KAAK,EAAC;AACpB,YAAY,IAAA,EAAE,KAAK,EAAC;AACpB,YAAY,IAAA,EAAE,KAAK,EAAC;AACpB,YAAY,IAAA,EAAE,KAAK,EAAC;AAEpB,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;AAAA,QACL,KAAK;AACH,iBAAO,QAAQ;AAAA,QAEjB,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,QAAQ;AAAA,QAEjB,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,QAAQ;AAAA,QAEjB,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,QAAQ;AAAA,QAEjB;AACE,gBAAM,IAAI,MAAM,uBAAuB,MAAM;AAAA,MACnD;AAAA,IACA;AAEA,YAAA,UAAkB,SAAS,QAAS,OAAO;AACzC,aAAO,SAAS,OAAO,MAAM,QAAQ,eACnC,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,IAClC;AAEA,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/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/finder-pattern.cjs

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const finderPattern = require("../../../../../../../_virtual/finder-pattern.cjs");
+const utils = require("./utils.cjs");
+var hasRequiredFinderPattern;
+function requireFinderPattern() {
+  if (hasRequiredFinderPattern) return finderPattern.__exports;
+  hasRequiredFinderPattern = 1;
+  const getSymbolSize = utils.__require().getSymbolSize;
+  const FINDER_PATTERN_SIZE = 7;
+  finderPattern.__exports.getPositions = function getPositions(version) {
+    const size = getSymbolSize(version);
+    return [
+      // top-left
+      [0, 0],
+      // top-right
+      [size - FINDER_PATTERN_SIZE, 0],
+      // bottom-left
+      [0, size - FINDER_PATTERN_SIZE]
+    ];
+  };
+  return finderPattern.__exports;
+}
+exports.__require = requireFinderPattern;
+//# sourceMappingURL=finder-pattern.cjs.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/finder-pattern.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"finder-pattern.cjs","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/finder-pattern.js"],"sourcesContent":["const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const size = getSymbolSize(version)\n\n  return [\n    // top-left\n    [0, 0],\n    // top-right\n    [size - FINDER_PATTERN_SIZE, 0],\n    // bottom-left\n    [0, size - FINDER_PATTERN_SIZE]\n  ]\n}\n"],"names":["require$$0","finderPattern"],"mappings":";;;;;;;;AAAA,QAAM,gBAAgBA,MAAAA,YAAmB;AACzC,QAAM,sBAAsB;AAS5BC,gBAAAA,UAAA,eAAuB,SAAS,aAAc,SAAS;AACrD,UAAM,OAAO,cAAc,OAAO;AAElC,WAAO;AAAA;AAAA,MAEL,CAAC,GAAG,CAAC;AAAA;AAAA,MAEL,CAAC,OAAO,qBAAqB,CAAC;AAAA;AAAA,MAE9B,CAAC,GAAG,OAAO,mBAAmB;AAAA,IAClC;AAAA,EACA;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,25 @@
+import { __exports as finderPattern } from "../../../../../../../_virtual/finder-pattern.js";
+import { __require as requireUtils } from "./utils.js";
+var hasRequiredFinderPattern;
+function requireFinderPattern() {
+  if (hasRequiredFinderPattern) return finderPattern;
+  hasRequiredFinderPattern = 1;
+  const getSymbolSize = requireUtils().getSymbolSize;
+  const FINDER_PATTERN_SIZE = 7;
+  finderPattern.getPositions = function getPositions(version) {
+    const size = getSymbolSize(version);
+    return [
+      // top-left
+      [0, 0],
+      // top-right
+      [size - FINDER_PATTERN_SIZE, 0],
+      // bottom-left
+      [0, size - FINDER_PATTERN_SIZE]
+    ];
+  };
+  return finderPattern;
+}
+export {
+  requireFinderPattern as __require
+};
+//# sourceMappingURL=finder-pattern.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"finder-pattern.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/finder-pattern.js"],"sourcesContent":["const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const size = getSymbolSize(version)\n\n  return [\n    // top-left\n    [0, 0],\n    // top-right\n    [size - FINDER_PATTERN_SIZE, 0],\n    // bottom-left\n    [0, size - FINDER_PATTERN_SIZE]\n  ]\n}\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,gBAAgBA,eAAmB;AACzC,QAAM,sBAAsB;AAS5B,gBAAA,eAAuB,SAAS,aAAc,SAAS;AACrD,UAAM,OAAO,cAAc,OAAO;AAElC,WAAO;AAAA;AAAA,MAEL,CAAC,GAAG,CAAC;AAAA;AAAA,MAEL,CAAC,OAAO,qBAAqB,CAAC;AAAA;AAAA,MAE9B,CAAC,GAAG,OAAO,mBAAmB;AAAA,IAClC;AAAA,EACA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/format-info.cjs

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const formatInfo = require("../../../../../../../_virtual/format-info.cjs");
+const utils = require("./utils.cjs");
+var hasRequiredFormatInfo;
+function requireFormatInfo() {
+  if (hasRequiredFormatInfo) return formatInfo.__exports;
+  hasRequiredFormatInfo = 1;
+  const Utils = utils.__require();
+  const G15 = 1 << 10 | 1 << 8 | 1 << 5 | 1 << 4 | 1 << 2 | 1 << 1 | 1 << 0;
+  const G15_MASK = 1 << 14 | 1 << 12 | 1 << 10 | 1 << 4 | 1 << 1;
+  const G15_BCH = Utils.getBCHDigit(G15);
+  formatInfo.__exports.getEncodedBits = function getEncodedBits(errorCorrectionLevel, mask) {
+    const data = errorCorrectionLevel.bit << 3 | mask;
+    let d = data << 10;
+    while (Utils.getBCHDigit(d) - G15_BCH >= 0) {
+      d ^= G15 << Utils.getBCHDigit(d) - G15_BCH;
+    }
+    return (data << 10 | d) ^ G15_MASK;
+  };
+  return formatInfo.__exports;
+}
+exports.__require = requireFormatInfo;
+//# sourceMappingURL=format-info.cjs.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/format-info.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"format-info.cjs","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/format-info.js"],"sourcesContent":["const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param  {Number} errorCorrectionLevel Error correction level\n * @param  {Number} mask                 Mask pattern\n * @return {Number}                      Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n  const data = ((errorCorrectionLevel.bit << 3) | mask)\n  let d = data << 10\n\n  while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n    d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n  }\n\n  // xor final data with mask pattern in order to ensure that\n  // no combination of Error Correction Level and data mask pattern\n  // will result in an all-zero data string\n  return ((data << 10) | d) ^ G15_MASK\n}\n"],"names":["require$$0","formatInfo"],"mappings":";;;;;;;;AAAA,QAAM,QAAQA,MAAA,UAAA;AAEd,QAAM,MAAO,KAAK,KAAO,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK;AACrF,QAAM,WAAY,KAAK,KAAO,KAAK,KAAO,KAAK,KAAO,KAAK,IAAM,KAAK;AACtE,QAAM,UAAU,MAAM,YAAY,GAAG;AAYrCC,aAAAA,UAAA,iBAAyB,SAAS,eAAgB,sBAAsB,MAAM;AAC5E,UAAM,OAAS,qBAAqB,OAAO,IAAK;AAChD,QAAI,IAAI,QAAQ;AAEhB,WAAO,MAAM,YAAY,CAAC,IAAI,WAAW,GAAG;AAC1C,WAAM,OAAQ,MAAM,YAAY,CAAC,IAAI;AAAA,IACzC;AAKE,YAAS,QAAQ,KAAM,KAAK;AAAA,EAC9B;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,24 @@
+import { __exports as formatInfo } from "../../../../../../../_virtual/format-info.js";
+import { __require as requireUtils } from "./utils.js";
+var hasRequiredFormatInfo;
+function requireFormatInfo() {
+  if (hasRequiredFormatInfo) return formatInfo;
+  hasRequiredFormatInfo = 1;
+  const Utils = requireUtils();
+  const G15 = 1 << 10 | 1 << 8 | 1 << 5 | 1 << 4 | 1 << 2 | 1 << 1 | 1 << 0;
+  const G15_MASK = 1 << 14 | 1 << 12 | 1 << 10 | 1 << 4 | 1 << 1;
+  const G15_BCH = Utils.getBCHDigit(G15);
+  formatInfo.getEncodedBits = function getEncodedBits(errorCorrectionLevel, mask) {
+    const data = errorCorrectionLevel.bit << 3 | mask;
+    let d = data << 10;
+    while (Utils.getBCHDigit(d) - G15_BCH >= 0) {
+      d ^= G15 << Utils.getBCHDigit(d) - G15_BCH;
+    }
+    return (data << 10 | d) ^ G15_MASK;
+  };
+  return formatInfo;
+}
+export {
+  requireFormatInfo as __require
+};
+//# sourceMappingURL=format-info.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"format-info.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/format-info.js"],"sourcesContent":["const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param  {Number} errorCorrectionLevel Error correction level\n * @param  {Number} mask                 Mask pattern\n * @return {Number}                      Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n  const data = ((errorCorrectionLevel.bit << 3) | mask)\n  let d = data << 10\n\n  while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n    d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n  }\n\n  // xor final data with mask pattern in order to ensure that\n  // no combination of Error Correction Level and data mask pattern\n  // will result in an all-zero data string\n  return ((data << 10) | d) ^ G15_MASK\n}\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,QAAQA,aAAA;AAEd,QAAM,MAAO,KAAK,KAAO,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK,IAAM,KAAK;AACrF,QAAM,WAAY,KAAK,KAAO,KAAK,KAAO,KAAK,KAAO,KAAK,IAAM,KAAK;AACtE,QAAM,UAAU,MAAM,YAAY,GAAG;AAYrC,aAAA,iBAAyB,SAAS,eAAgB,sBAAsB,MAAM;AAC5E,UAAM,OAAS,qBAAqB,OAAO,IAAK;AAChD,QAAI,IAAI,QAAQ;AAEhB,WAAO,MAAM,YAAY,CAAC,IAAI,WAAW,GAAG;AAC1C,WAAM,OAAQ,MAAM,YAAY,CAAC,IAAI;AAAA,IACzC;AAKE,YAAS,QAAQ,KAAM,KAAK;AAAA,EAC9B;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/galois-field.cjs

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const galoisField = require("../../../../../../../_virtual/galois-field.cjs");
+var hasRequiredGaloisField;
+function requireGaloisField() {
+  if (hasRequiredGaloisField) return galoisField.__exports;
+  hasRequiredGaloisField = 1;
+  const EXP_TABLE = new Uint8Array(512);
+  const LOG_TABLE = new Uint8Array(256);
+  (function initTables() {
+    let x = 1;
+    for (let i = 0; i < 255; i++) {
+      EXP_TABLE[i] = x;
+      LOG_TABLE[x] = i;
+      x <<= 1;
+      if (x & 256) {
+        x ^= 285;
+      }
+    }
+    for (let i = 255; i < 512; i++) {
+      EXP_TABLE[i] = EXP_TABLE[i - 255];
+    }
+  })();
+  galoisField.__exports.log = function log(n) {
+    if (n < 1) throw new Error("log(" + n + ")");
+    return LOG_TABLE[n];
+  };
+  galoisField.__exports.exp = function exp(n) {
+    return EXP_TABLE[n];
+  };
+  galoisField.__exports.mul = function mul(x, y) {
+    if (x === 0 || y === 0) return 0;
+    return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]];
+  };
+  return galoisField.__exports;
+}
+exports.__require = requireGaloisField;
+//# sourceMappingURL=galois-field.cjs.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/galois-field.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"galois-field.cjs","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/galois-field.js"],"sourcesContent":["const EXP_TABLE = new Uint8Array(512)\nconst LOG_TABLE = new Uint8Array(256)\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n  let x = 1\n  for (let i = 0; i < 255; i++) {\n    EXP_TABLE[i] = x\n    LOG_TABLE[x] = i\n\n    x <<= 1 // multiply by 2\n\n    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n    // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n      x ^= 0x11D\n    }\n  }\n\n  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n  // stay inside the bounds (because we will mainly use this table for the multiplication of\n  // two GF numbers, no more).\n  // @see {@link mul}\n  for (let i = 255; i < 512; i++) {\n    EXP_TABLE[i] = EXP_TABLE[i - 255]\n  }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n  if (n < 1) throw new Error('log(' + n + ')')\n  return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n  return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param  {Number} x\n * @param  {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n  if (x === 0 || y === 0) return 0\n\n  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n  // @see {@link initTables}\n  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n"],"names":["galoisField"],"mappings":";;;;;;;AAAA,QAAM,YAAY,IAAI,WAAW,GAAG;AACpC,QAAM,YAAY,IAAI,WAAW,GAAG;AASnC,GAAC,SAAS,aAAc;AACvB,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,gBAAU,CAAC,IAAI;AACf,gBAAU,CAAC,IAAI;AAEf,YAAM;AAIN,UAAI,IAAI,KAAO;AACb,aAAK;AAAA,MACX;AAAA,IACA;AAME,aAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,gBAAU,CAAC,IAAI,UAAU,IAAI,GAAG;AAAA,IACpC;AAAA,EACA,GAAG;AAQHA,cAAAA,UAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,QAAI,IAAI,EAAG,OAAM,IAAI,MAAM,SAAS,IAAI,GAAG;AAC3C,WAAO,UAAU,CAAC;AAAA,EACpB;AAQAA,cAAAA,UAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,WAAO,UAAU,CAAC;AAAA,EACpB;AASAA,cAAAA,UAAA,MAAc,SAAS,IAAK,GAAG,GAAG;AAChC,QAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAI/B,WAAO,UAAU,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AAAA,EAC9C;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,38 @@
+import { __exports as galoisField } from "../../../../../../../_virtual/galois-field.js";
+var hasRequiredGaloisField;
+function requireGaloisField() {
+  if (hasRequiredGaloisField) return galoisField;
+  hasRequiredGaloisField = 1;
+  const EXP_TABLE = new Uint8Array(512);
+  const LOG_TABLE = new Uint8Array(256);
+  (function initTables() {
+    let x = 1;
+    for (let i = 0; i < 255; i++) {
+      EXP_TABLE[i] = x;
+      LOG_TABLE[x] = i;
+      x <<= 1;
+      if (x & 256) {
+        x ^= 285;
+      }
+    }
+    for (let i = 255; i < 512; i++) {
+      EXP_TABLE[i] = EXP_TABLE[i - 255];
+    }
+  })();
+  galoisField.log = function log(n) {
+    if (n < 1) throw new Error("log(" + n + ")");
+    return LOG_TABLE[n];
+  };
+  galoisField.exp = function exp(n) {
+    return EXP_TABLE[n];
+  };
+  galoisField.mul = function mul(x, y) {
+    if (x === 0 || y === 0) return 0;
+    return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]];
+  };
+  return galoisField;
+}
+export {
+  requireGaloisField as __require
+};
+//# sourceMappingURL=galois-field.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"galois-field.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/galois-field.js"],"sourcesContent":["const EXP_TABLE = new Uint8Array(512)\nconst LOG_TABLE = new Uint8Array(256)\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n  let x = 1\n  for (let i = 0; i < 255; i++) {\n    EXP_TABLE[i] = x\n    LOG_TABLE[x] = i\n\n    x <<= 1 // multiply by 2\n\n    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n    // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n      x ^= 0x11D\n    }\n  }\n\n  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n  // stay inside the bounds (because we will mainly use this table for the multiplication of\n  // two GF numbers, no more).\n  // @see {@link mul}\n  for (let i = 255; i < 512; i++) {\n    EXP_TABLE[i] = EXP_TABLE[i - 255]\n  }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n  if (n < 1) throw new Error('log(' + n + ')')\n  return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n  return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param  {Number} x\n * @param  {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n  if (x === 0 || y === 0) return 0\n\n  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n  // @see {@link initTables}\n  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n"],"names":[],"mappings":";;;;;AAAA,QAAM,YAAY,IAAI,WAAW,GAAG;AACpC,QAAM,YAAY,IAAI,WAAW,GAAG;AASnC,GAAC,SAAS,aAAc;AACvB,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,gBAAU,CAAC,IAAI;AACf,gBAAU,CAAC,IAAI;AAEf,YAAM;AAIN,UAAI,IAAI,KAAO;AACb,aAAK;AAAA,MACX;AAAA,IACA;AAME,aAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,gBAAU,CAAC,IAAI,UAAU,IAAI,GAAG;AAAA,IACpC;AAAA,EACA,GAAG;AAQH,cAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,QAAI,IAAI,EAAG,OAAM,IAAI,MAAM,SAAS,IAAI,GAAG;AAC3C,WAAO,UAAU,CAAC;AAAA,EACpB;AAQA,cAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,WAAO,UAAU,CAAC;AAAA,EACpB;AASA,cAAA,MAAc,SAAS,IAAK,GAAG,GAAG;AAChC,QAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAI/B,WAAO,UAAU,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AAAA,EAC9C;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/kanji-data.cjs

@@ -0,0 +1,46 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const mode = require("./mode.cjs");
+const utils = require("./utils.cjs");
+var kanjiData;
+var hasRequiredKanjiData;
+function requireKanjiData() {
+  if (hasRequiredKanjiData) return kanjiData;
+  hasRequiredKanjiData = 1;
+  const Mode = mode.__require();
+  const Utils = utils.__require();
+  function KanjiData(data) {
+    this.mode = Mode.KANJI;
+    this.data = data;
+  }
+  KanjiData.getBitsLength = function getBitsLength(length) {
+    return length * 13;
+  };
+  KanjiData.prototype.getLength = function getLength() {
+    return this.data.length;
+  };
+  KanjiData.prototype.getBitsLength = function getBitsLength() {
+    return KanjiData.getBitsLength(this.data.length);
+  };
+  KanjiData.prototype.write = function(bitBuffer) {
+    let i;
+    for (i = 0; i < this.data.length; i++) {
+      let value = Utils.toSJIS(this.data[i]);
+      if (value >= 33088 && value <= 40956) {
+        value -= 33088;
+      } else if (value >= 57408 && value <= 60351) {
+        value -= 49472;
+      } else {
+        throw new Error(
+          "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
+        );
+      }
+      value = (value >>> 8 & 255) * 192 + (value & 255);
+      bitBuffer.put(value, 13);
+    }
+  };
+  kanjiData = KanjiData;
+  return kanjiData;
+}
+exports.__require = requireKanjiData;
+//# sourceMappingURL=kanji-data.cjs.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/kanji-data.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"kanji-data.cjs","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;AAAA,QAAM,OAAOA,KAAA,UAAA;AACb,QAAM,QAAQC,MAAA,UAAA;AAEd,WAAS,UAAW,MAAM;AACxB,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,YAAU,gBAAgB,SAAS,cAAe,QAAQ;AACxD,WAAO,SAAS;AAAA,EAClB;AAEA,YAAU,UAAU,YAAY,SAAS,YAAa;AACpD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,YAAU,UAAU,gBAAgB,SAAS,gBAAiB;AAC5D,WAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AAAA,EACjD;AAEA,YAAU,UAAU,QAAQ,SAAU,WAAW;AAC/C,QAAI;AAKJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,UAAI,QAAQ,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,UAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,iBAAS;AAAA,MAGV,WAAU,SAAS,SAAU,SAAS,OAAQ;AAE7C,iBAAS;AAAA,MACf,OAAW;AACL,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,QACX;AAAA,MACzC;AAII,eAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAAA,EACA;AAEA,cAAiB;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,46 @@
+import { __require as requireMode } from "./mode.js";
+import { __require as requireUtils } from "./utils.js";
+var kanjiData;
+var hasRequiredKanjiData;
+function requireKanjiData() {
+  if (hasRequiredKanjiData) return kanjiData;
+  hasRequiredKanjiData = 1;
+  const Mode = requireMode();
+  const Utils = requireUtils();
+  function KanjiData(data) {
+    this.mode = Mode.KANJI;
+    this.data = data;
+  }
+  KanjiData.getBitsLength = function getBitsLength(length) {
+    return length * 13;
+  };
+  KanjiData.prototype.getLength = function getLength() {
+    return this.data.length;
+  };
+  KanjiData.prototype.getBitsLength = function getBitsLength() {
+    return KanjiData.getBitsLength(this.data.length);
+  };
+  KanjiData.prototype.write = function(bitBuffer) {
+    let i;
+    for (i = 0; i < this.data.length; i++) {
+      let value = Utils.toSJIS(this.data[i]);
+      if (value >= 33088 && value <= 40956) {
+        value -= 33088;
+      } else if (value >= 57408 && value <= 60351) {
+        value -= 49472;
+      } else {
+        throw new Error(
+          "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
+        );
+      }
+      value = (value >>> 8 & 255) * 192 + (value & 255);
+      bitBuffer.put(value, 13);
+    }
+  };
+  kanjiData = KanjiData;
+  return kanjiData;
+}
+export {
+  requireKanjiData as __require
+};
+//# sourceMappingURL=kanji-data.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"kanji-data.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;AAAA,QAAM,OAAOA,YAAA;AACb,QAAM,QAAQC,aAAA;AAEd,WAAS,UAAW,MAAM;AACxB,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,YAAU,gBAAgB,SAAS,cAAe,QAAQ;AACxD,WAAO,SAAS;AAAA,EAClB;AAEA,YAAU,UAAU,YAAY,SAAS,YAAa;AACpD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,YAAU,UAAU,gBAAgB,SAAS,gBAAiB;AAC5D,WAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AAAA,EACjD;AAEA,YAAU,UAAU,QAAQ,SAAU,WAAW;AAC/C,QAAI;AAKJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,UAAI,QAAQ,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,UAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,iBAAS;AAAA,MAGV,WAAU,SAAS,SAAU,SAAS,OAAQ;AAE7C,iBAAS;AAAA,MACf,OAAW;AACL,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,QACX;AAAA,MACzC;AAII,eAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAAA,EACA;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mask-pattern.cjs

@@ -0,0 +1,149 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const maskPattern = require("../../../../../../../_virtual/mask-pattern.cjs");
+var hasRequiredMaskPattern;
+function requireMaskPattern() {
+  if (hasRequiredMaskPattern) return maskPattern.__exports;
+  hasRequiredMaskPattern = 1;
+  (function(exports2) {
+    exports2.Patterns = {
+      PATTERN000: 0,
+      PATTERN001: 1,
+      PATTERN010: 2,
+      PATTERN011: 3,
+      PATTERN100: 4,
+      PATTERN101: 5,
+      PATTERN110: 6,
+      PATTERN111: 7
+    };
+    const PenaltyScores = {
+      N1: 3,
+      N2: 3,
+      N3: 40,
+      N4: 10
+    };
+    exports2.isValid = function isValid(mask) {
+      return mask != null && mask !== "" && !isNaN(mask) && mask >= 0 && mask <= 7;
+    };
+    exports2.from = function from(value) {
+      return exports2.isValid(value) ? parseInt(value, 10) : void 0;
+    };
+    exports2.getPenaltyN1 = function getPenaltyN1(data) {
+      const size = data.size;
+      let points = 0;
+      let sameCountCol = 0;
+      let sameCountRow = 0;
+      let lastCol = null;
+      let lastRow = null;
+      for (let row = 0; row < size; row++) {
+        sameCountCol = sameCountRow = 0;
+        lastCol = lastRow = null;
+        for (let col = 0; col < size; col++) {
+          let module2 = data.get(row, col);
+          if (module2 === lastCol) {
+            sameCountCol++;
+          } else {
+            if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+            lastCol = module2;
+            sameCountCol = 1;
+          }
+          module2 = data.get(col, row);
+          if (module2 === lastRow) {
+            sameCountRow++;
+          } else {
+            if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+            lastRow = module2;
+            sameCountRow = 1;
+          }
+        }
+        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+      }
+      return points;
+    };
+    exports2.getPenaltyN2 = function getPenaltyN2(data) {
+      const size = data.size;
+      let points = 0;
+      for (let row = 0; row < size - 1; row++) {
+        for (let col = 0; col < size - 1; col++) {
+          const last = data.get(row, col) + data.get(row, col + 1) + data.get(row + 1, col) + data.get(row + 1, col + 1);
+          if (last === 4 || last === 0) points++;
+        }
+      }
+      return points * PenaltyScores.N2;
+    };
+    exports2.getPenaltyN3 = function getPenaltyN3(data) {
+      const size = data.size;
+      let points = 0;
+      let bitsCol = 0;
+      let bitsRow = 0;
+      for (let row = 0; row < size; row++) {
+        bitsCol = bitsRow = 0;
+        for (let col = 0; col < size; col++) {
+          bitsCol = bitsCol << 1 & 2047 | data.get(row, col);
+          if (col >= 10 && (bitsCol === 1488 || bitsCol === 93)) points++;
+          bitsRow = bitsRow << 1 & 2047 | data.get(col, row);
+          if (col >= 10 && (bitsRow === 1488 || bitsRow === 93)) points++;
+        }
+      }
+      return points * PenaltyScores.N3;
+    };
+    exports2.getPenaltyN4 = function getPenaltyN4(data) {
+      let darkCount = 0;
+      const modulesCount = data.data.length;
+      for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
+      const k = Math.abs(Math.ceil(darkCount * 100 / modulesCount / 5) - 10);
+      return k * PenaltyScores.N4;
+    };
+    function getMaskAt(maskPattern2, i, j) {
+      switch (maskPattern2) {
+        case exports2.Patterns.PATTERN000:
+          return (i + j) % 2 === 0;
+        case exports2.Patterns.PATTERN001:
+          return i % 2 === 0;
+        case exports2.Patterns.PATTERN010:
+          return j % 3 === 0;
+        case exports2.Patterns.PATTERN011:
+          return (i + j) % 3 === 0;
+        case exports2.Patterns.PATTERN100:
+          return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0;
+        case exports2.Patterns.PATTERN101:
+          return i * j % 2 + i * j % 3 === 0;
+        case exports2.Patterns.PATTERN110:
+          return (i * j % 2 + i * j % 3) % 2 === 0;
+        case exports2.Patterns.PATTERN111:
+          return (i * j % 3 + (i + j) % 2) % 2 === 0;
+        default:
+          throw new Error("bad maskPattern:" + maskPattern2);
+      }
+    }
+    exports2.applyMask = function applyMask(pattern, data) {
+      const size = data.size;
+      for (let col = 0; col < size; col++) {
+        for (let row = 0; row < size; row++) {
+          if (data.isReserved(row, col)) continue;
+          data.xor(row, col, getMaskAt(pattern, row, col));
+        }
+      }
+    };
+    exports2.getBestMask = function getBestMask(data, setupFormatFunc) {
+      const numPatterns = Object.keys(exports2.Patterns).length;
+      let bestPattern = 0;
+      let lowerPenalty = Infinity;
+      for (let p = 0; p < numPatterns; p++) {
+        setupFormatFunc(p);
+        exports2.applyMask(p, data);
+        const penalty = exports2.getPenaltyN1(data) + exports2.getPenaltyN2(data) + exports2.getPenaltyN3(data) + exports2.getPenaltyN4(data);
+        exports2.applyMask(p, data);
+        if (penalty < lowerPenalty) {
+          lowerPenalty = penalty;
+          bestPattern = p;
+        }
+      }
+      return bestPattern;
+    };
+  })(maskPattern.__exports);
+  return maskPattern.__exports;
+}
+exports.__require = requireMaskPattern;
+//# sourceMappingURL=mask-pattern.cjs.map