@owp/core 2.1.5 → 2.1.7

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

@@ -0,0 +1 @@
+{"version":3,"file":"mask-pattern.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n  PATTERN000: 0,\n  PATTERN001: 1,\n  PATTERN010: 2,\n  PATTERN011: 3,\n  PATTERN100: 4,\n  PATTERN101: 5,\n  PATTERN110: 6,\n  PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n  N1: 3,\n  N2: 3,\n  N3: 40,\n  N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param  {Number}  mask    Mask pattern\n * @return {Boolean}         true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param  {Number|String} value        Mask pattern value\n * @return {Number}                     Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n  return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n  const size = data.size\n  let points = 0\n  let sameCountCol = 0\n  let sameCountRow = 0\n  let lastCol = null\n  let lastRow = null\n\n  for (let row = 0; row < size; row++) {\n    sameCountCol = sameCountRow = 0\n    lastCol = lastRow = null\n\n    for (let col = 0; col < size; col++) {\n      let module = data.get(row, col)\n      if (module === lastCol) {\n        sameCountCol++\n      } else {\n        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n        lastCol = module\n        sameCountCol = 1\n      }\n\n      module = data.get(col, row)\n      if (module === lastRow) {\n        sameCountRow++\n      } else {\n        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n        lastRow = module\n        sameCountRow = 1\n      }\n    }\n\n    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n  }\n\n  return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n  const size = data.size\n  let points = 0\n\n  for (let row = 0; row < size - 1; row++) {\n    for (let col = 0; col < size - 1; col++) {\n      const last = data.get(row, col) +\n        data.get(row, col + 1) +\n        data.get(row + 1, col) +\n        data.get(row + 1, col + 1)\n\n      if (last === 4 || last === 0) points++\n    }\n  }\n\n  return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n  const size = data.size\n  let points = 0\n  let bitsCol = 0\n  let bitsRow = 0\n\n  for (let row = 0; row < size; row++) {\n    bitsCol = bitsRow = 0\n    for (let col = 0; col < size; col++) {\n      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n    }\n  }\n\n  return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n  let darkCount = 0\n  const modulesCount = data.data.length\n\n  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n  return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param  {Number} maskPattern Pattern reference value\n * @param  {Number} i           Row\n * @param  {Number} j           Column\n * @return {Boolean}            Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n  switch (maskPattern) {\n    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n    case exports.Patterns.PATTERN001: return i % 2 === 0\n    case exports.Patterns.PATTERN010: return j % 3 === 0\n    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n    default: throw new Error('bad maskPattern:' + maskPattern)\n  }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param  {Number}    pattern Pattern reference number\n * @param  {BitMatrix} data    BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n  const size = data.size\n\n  for (let col = 0; col < size; col++) {\n    for (let row = 0; row < size; row++) {\n      if (data.isReserved(row, col)) continue\n      data.xor(row, col, getMaskAt(pattern, row, col))\n    }\n  }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param  {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n  const numPatterns = Object.keys(exports.Patterns).length\n  let bestPattern = 0\n  let lowerPenalty = Infinity\n\n  for (let p = 0; p < numPatterns; p++) {\n    setupFormatFunc(p)\n    exports.applyMask(p, data)\n\n    // Calculate penalty\n    const penalty =\n      exports.getPenaltyN1(data) +\n      exports.getPenaltyN2(data) +\n      exports.getPenaltyN3(data) +\n      exports.getPenaltyN4(data)\n\n    // Undo previously applied mask\n    exports.applyMask(p, data)\n\n    if (penalty < lowerPenalty) {\n      lowerPenalty = penalty\n      bestPattern = p\n    }\n  }\n\n  return bestPattern\n}\n"],"names":["exports","PenaltyScores","__name","mask","value","data","size","points","sameCountCol","sameCountRow","lastCol","lastRow","row","col","module","last","bitsCol","bitsRow","darkCount","modulesCount","i","getMaskAt","maskPattern","j","pattern","setupFormatFunc","numPatterns","bestPattern","lowerPenalty","p","penalty"],"mappings":";;;;;;AAIA,IAAAA,EAAA,WAAmB;AAAA,MACjB,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,IACd;AAMA,UAAMC,IAAgB;AAAA,MACpB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AAQA,IAAAD,EAAA,UAAkB,gBAAAE,EAAA,SAAkBC,GAAM;AACxC,aAAOA,KAAQ,QAAQA,MAAS,MAAM,CAAC,MAAMA,CAAI,KAAKA,KAAQ,KAAKA,KAAQ;AAAA,IAC7E,GAFkB,YAWlBH,EAAA,OAAe,gBAAAE,EAAA,SAAeE,GAAO;AACnC,aAAOJ,EAAQ,QAAQI,CAAK,IAAI,SAASA,GAAO,EAAE,IAAI;AAAA,IACxD,GAFe,SAWfJ,EAAA,eAAuB,gBAAAE,EAAA,SAAuBG,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS,GACTC,IAAe,GACfC,IAAe,GACfC,IAAU,MACVC,IAAU;AAEd,eAASC,IAAM,GAAGA,IAAMN,GAAMM,KAAO;AACnC,QAAAJ,IAAeC,IAAe,GAC9BC,IAAUC,IAAU;AAEpB,iBAASE,IAAM,GAAGA,IAAMP,GAAMO,KAAO;AACnC,cAAIC,IAAST,EAAK,IAAIO,GAAKC,CAAG;AAC9B,UAAIC,MAAWJ,IACbF,OAEIA,KAAgB,MAAGD,KAAUN,EAAc,MAAMO,IAAe,KACpEE,IAAUI,GACVN,IAAe,IAGjBM,IAAST,EAAK,IAAIQ,GAAKD,CAAG,GACtBE,MAAWH,IACbF,OAEIA,KAAgB,MAAGF,KAAUN,EAAc,MAAMQ,IAAe,KACpEE,IAAUG,GACVL,IAAe;AAAA,QAEvB;AAEI,QAAID,KAAgB,MAAGD,KAAUN,EAAc,MAAMO,IAAe,KAChEC,KAAgB,MAAGF,KAAUN,EAAc,MAAMQ,IAAe;AAAA,MACxE;AAEE,aAAOF;AAAA,IACT,GArCuB,iBA4CvBP,EAAA,eAAuB,gBAAAE,EAAA,SAAuBG,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS;AAEb,eAASK,IAAM,GAAGA,IAAMN,IAAO,GAAGM;AAChC,iBAASC,IAAM,GAAGA,IAAMP,IAAO,GAAGO,KAAO;AACvC,gBAAME,IAAOV,EAAK,IAAIO,GAAKC,CAAG,IAC5BR,EAAK,IAAIO,GAAKC,IAAM,CAAC,IACrBR,EAAK,IAAIO,IAAM,GAAGC,CAAG,IACrBR,EAAK,IAAIO,IAAM,GAAGC,IAAM,CAAC;AAE3B,WAAIE,MAAS,KAAKA,MAAS,MAAGR;AAAA,QACpC;AAGE,aAAOA,IAASN,EAAc;AAAA,IAChC,GAhBuB,iBAwBvBD,EAAA,eAAuB,gBAAAE,EAAA,SAAuBG,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS,GACTS,IAAU,GACVC,IAAU;AAEd,eAASL,IAAM,GAAGA,IAAMN,GAAMM,KAAO;AACnC,QAAAI,IAAUC,IAAU;AACpB,iBAASJ,IAAM,GAAGA,IAAMP,GAAMO;AAC5B,UAAAG,IAAYA,KAAW,IAAK,OAASX,EAAK,IAAIO,GAAKC,CAAG,GAClDA,KAAO,OAAOG,MAAY,QAASA,MAAY,OAAQT,KAE3DU,IAAYA,KAAW,IAAK,OAASZ,EAAK,IAAIQ,GAAKD,CAAG,GAClDC,KAAO,OAAOI,MAAY,QAASA,MAAY,OAAQV;AAAA,MAEjE;AAEE,aAAOA,IAASN,EAAc;AAAA,IAChC,GAlBuB,iBA4BvBD,EAAA,eAAuB,gBAAAE,EAAA,SAAuBG,GAAM;AAClD,UAAIa,IAAY;AAChB,YAAMC,IAAed,EAAK,KAAK;AAE/B,eAASe,IAAI,GAAGA,IAAID,GAAcC,IAAK,CAAAF,KAAab,EAAK,KAAKe,CAAC;AAI/D,aAFU,KAAK,IAAI,KAAK,KAAMF,IAAY,MAAMC,IAAgB,CAAC,IAAI,EAAE,IAE5DlB,EAAc;AAAA,IAC3B,GATuB;AAmBvB,aAASoB,EAAWC,GAAaF,GAAGG,GAAG;AACrC,cAAQD,GAAW;AAAA,QACjB,KAAKtB,EAAQ,SAAS;AAAY,kBAAQoB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKvB,EAAQ,SAAS;AAAY,iBAAOoB,IAAI,MAAM;AAAA,QACnD,KAAKpB,EAAQ,SAAS;AAAY,iBAAOuB,IAAI,MAAM;AAAA,QACnD,KAAKvB,EAAQ,SAAS;AAAY,kBAAQoB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKvB,EAAQ,SAAS;AAAY,kBAAQ,KAAK,MAAMoB,IAAI,CAAC,IAAI,KAAK,MAAMG,IAAI,CAAC,KAAK,MAAM;AAAA,QACzF,KAAKvB,EAAQ,SAAS;AAAY,iBAAQoB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,MAAM;AAAA,QACvE,KAAKvB,EAAQ,SAAS;AAAY,kBAASoB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,KAAK,MAAM;AAAA,QAC7E,KAAKvB,EAAQ,SAAS;AAAY,kBAASoB,IAAIG,IAAK,KAAKH,IAAIG,KAAK,KAAK,MAAM;AAAA,QAE7E;AAAS,gBAAM,IAAI,MAAM,qBAAqBD,CAAW;AAAA,MAC7D;AAAA,IACA;AAbS,IAAApB,EAAAmB,GAAA,cAqBTrB,EAAA,YAAoB,gBAAAE,EAAA,SAAoBsB,GAASnB,GAAM;AACrD,YAAMC,IAAOD,EAAK;AAElB,eAASQ,IAAM,GAAGA,IAAMP,GAAMO;AAC5B,iBAASD,IAAM,GAAGA,IAAMN,GAAMM;AAC5B,UAAIP,EAAK,WAAWO,GAAKC,CAAG,KAC5BR,EAAK,IAAIO,GAAKC,GAAKQ,EAAUG,GAASZ,GAAKC,CAAG,CAAC;AAAA,IAGrD,GAToB,cAiBpBb,EAAA,cAAsB,gBAAAE,EAAA,SAAsBG,GAAMoB,GAAiB;AACjE,YAAMC,IAAc,OAAO,KAAK1B,EAAQ,QAAQ,EAAE;AAClD,UAAI2B,IAAc,GACdC,IAAe;AAEnB,eAASC,IAAI,GAAGA,IAAIH,GAAaG,KAAK;AACpC,QAAAJ,EAAgBI,CAAC,GACjB7B,EAAQ,UAAU6B,GAAGxB,CAAI;AAGzB,cAAMyB,IACJ9B,EAAQ,aAAaK,CAAI,IACzBL,EAAQ,aAAaK,CAAI,IACzBL,EAAQ,aAAaK,CAAI,IACzBL,EAAQ,aAAaK,CAAI;AAG3B,QAAAL,EAAQ,UAAU6B,GAAGxB,CAAI,GAErByB,IAAUF,MACZA,IAAeE,GACfH,IAAcE;AAAA,MAEpB;AAEE,aAAOF;AAAA,IACT,GA1BsB;AAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mode.js

@@ -0,0 +1,72 @@
+var s = Object.defineProperty;
+var n = (i, c) => s(i, "name", { value: c, configurable: !0 });
+import { __exports as a } from "../../../../../../../_virtual/mode.js";
+import { __require as d } from "./version-check.js";
+import { __require as h } from "./regex.js";
+var f;
+function C() {
+  return f ? a : (f = 1, (function(i) {
+    const c = d(), u = h();
+    i.NUMERIC = {
+      id: "Numeric",
+      bit: 1,
+      ccBits: [10, 12, 14]
+    }, i.ALPHANUMERIC = {
+      id: "Alphanumeric",
+      bit: 2,
+      ccBits: [9, 11, 13]
+    }, i.BYTE = {
+      id: "Byte",
+      bit: 4,
+      ccBits: [8, 16, 16]
+    }, i.KANJI = {
+      id: "Kanji",
+      bit: 8,
+      ccBits: [8, 10, 12]
+    }, i.MIXED = {
+      bit: -1
+    }, i.getCharCountIndicator = /* @__PURE__ */ n(function(r, e) {
+      if (!r.ccBits) throw new Error("Invalid mode: " + r);
+      if (!c.isValid(e))
+        throw new Error("Invalid version: " + e);
+      return e >= 1 && e < 10 ? r.ccBits[0] : e < 27 ? r.ccBits[1] : r.ccBits[2];
+    }, "getCharCountIndicator"), i.getBestModeForData = /* @__PURE__ */ n(function(r) {
+      return u.testNumeric(r) ? i.NUMERIC : u.testAlphanumeric(r) ? i.ALPHANUMERIC : u.testKanji(r) ? i.KANJI : i.BYTE;
+    }, "getBestModeForData"), i.toString = /* @__PURE__ */ n(function(r) {
+      if (r && r.id) return r.id;
+      throw new Error("Invalid mode");
+    }, "toString"), i.isValid = /* @__PURE__ */ n(function(r) {
+      return r && r.bit && r.ccBits;
+    }, "isValid");
+    function o(t) {
+      if (typeof t != "string")
+        throw new Error("Param is not a string");
+      switch (t.toLowerCase()) {
+        case "numeric":
+          return i.NUMERIC;
+        case "alphanumeric":
+          return i.ALPHANUMERIC;
+        case "kanji":
+          return i.KANJI;
+        case "byte":
+          return i.BYTE;
+        default:
+          throw new Error("Unknown mode: " + t);
+      }
+    }
+    n(o, "fromString"), i.from = /* @__PURE__ */ n(function(r, e) {
+      if (i.isValid(r))
+        return r;
+      try {
+        return o(r);
+      } catch {
+        return e;
+      }
+    }, "from");
+  })(a), a);
+}
+n(C, "requireMode");
+export {
+  C as __require
+};
+//# sourceMappingURL=mode.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/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":["VersionCheck","require$$0","Regex","require$$1","exports","__name","mode","version","dataStr","fromString","string","value","defaultValue"],"mappings":";;;;;;;;AAAA,UAAMA,IAAeC,EAAA,GACfC,IAAQC,EAAA;AASd,IAAAC,EAAA,UAAkB;AAAA,MAChB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,IACrB,GAWAA,EAAA,eAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAOAA,EAAA,OAAe;AAAA,MACb,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAWAA,EAAA,QAAgB;AAAA,MACd,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAQAA,EAAA,QAAgB;AAAA,MACd,KAAK;AAAA,IACP,GAUAA,EAAA,wBAAgC,gBAAAC,EAAA,SAAgCC,GAAMC,GAAS;AAC7E,UAAI,CAACD,EAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,CAAI;AAEzD,UAAI,CAACN,EAAa,QAAQO,CAAO;AAC/B,cAAM,IAAI,MAAM,sBAAsBA,CAAO;AAG/C,aAAIA,KAAW,KAAKA,IAAU,KAAWD,EAAK,OAAO,CAAC,IAC7CC,IAAU,KAAWD,EAAK,OAAO,CAAC,IACpCA,EAAK,OAAO,CAAC;AAAA,IACtB,GAVgC,0BAkBhCF,EAAA,qBAA6B,gBAAAC,EAAA,SAA6BG,GAAS;AACjE,aAAIN,EAAM,YAAYM,CAAO,IAAUJ,EAAQ,UACtCF,EAAM,iBAAiBM,CAAO,IAAUJ,EAAQ,eAChDF,EAAM,UAAUM,CAAO,IAAUJ,EAAQ,QACtCA,EAAQ;AAAA,IACtB,GAL6B,uBAa7BA,EAAA,WAAmB,gBAAAC,EAAA,SAAmBC,GAAM;AAC1C,UAAIA,KAAQA,EAAK,GAAI,QAAOA,EAAK;AACjC,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC,GAHmB,aAWnBF,EAAA,UAAkB,gBAAAC,EAAA,SAAkBC,GAAM;AACxC,aAAOA,KAAQA,EAAK,OAAOA,EAAK;AAAA,IAClC,GAFkB;AAUlB,aAASG,EAAYC,GAAQ;AAC3B,UAAI,OAAOA,KAAW;AACpB,cAAM,IAAI,MAAM,uBAAuB;AAKzC,cAFcA,EAAO,YAAW,GAEnB;AAAA,QACX,KAAK;AACH,iBAAON,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB;AACE,gBAAM,IAAI,MAAM,mBAAmBM,CAAM;AAAA,MAC/C;AAAA,IACA;AAnBS,IAAAL,EAAAI,GAAA,eA6BTL,EAAA,OAAe,gBAAAC,EAAA,SAAeM,GAAOC,GAAc;AACjD,UAAIR,EAAQ,QAAQO,CAAK;AACvB,eAAOA;AAGT,UAAI;AACF,eAAOF,EAAWE,CAAK;AAAA,MAC3B,QAAc;AACV,eAAOC;AAAA,MACX;AAAA,IACA,GAVe;AAAA;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,30 @@
+var p = Object.defineProperty;
+var e = (o, t) => p(o, "name", { value: t, configurable: !0 });
+import { __require as c } from "./mode.js";
+var s, h;
+function m() {
+  if (h) return s;
+  h = 1;
+  const o = c();
+  function t(n) {
+    this.mode = o.NUMERIC, this.data = n.toString();
+  }
+  return e(t, "NumericData"), t.getBitsLength = /* @__PURE__ */ e(function(r) {
+    return 10 * Math.floor(r / 3) + (r % 3 ? r % 3 * 3 + 1 : 0);
+  }, "getBitsLength"), t.prototype.getLength = /* @__PURE__ */ e(function() {
+    return this.data.length;
+  }, "getLength"), t.prototype.getBitsLength = /* @__PURE__ */ e(function() {
+    return t.getBitsLength(this.data.length);
+  }, "getBitsLength"), t.prototype.write = /* @__PURE__ */ e(function(r) {
+    let i, a, u;
+    for (i = 0; i + 3 <= this.data.length; i += 3)
+      a = this.data.substr(i, 3), u = parseInt(a, 10), r.put(u, 10);
+    const g = this.data.length - i;
+    g > 0 && (a = this.data.substr(i), u = parseInt(a, 10), r.put(u, g * 3 + 1));
+  }, "write"), s = t, s;
+}
+e(m, "requireNumericData");
+export {
+  m as __require
+};
+//# sourceMappingURL=numeric-data.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"numeric-data.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/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":["Mode","require$$0","NumericData","data","__name","length","bitBuffer","group","value","remainingNum","numericData"],"mappings":";;;;;;;AAAA,QAAMA,IAAOC,EAAA;AAEb,WAASC,EAAaC,GAAM;AAC1B,SAAK,OAAOH,EAAK,SACjB,KAAK,OAAOG,EAAK,SAAQ;AAAA,EAC3B;AAHS,SAAAC,EAAAF,GAAA,gBAKTA,EAAY,gBAAgB,gBAAAE,EAAA,SAAwBC,GAAQ;AAC1D,WAAO,KAAK,KAAK,MAAMA,IAAS,CAAC,KAAMA,IAAS,IAAOA,IAAS,IAAK,IAAI,IAAK;AAAA,EAChF,GAF4B,kBAI5BH,EAAY,UAAU,YAAY,gBAAAE,EAAA,WAAsB;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB,GAFkC,cAIlCF,EAAY,UAAU,gBAAgB,gBAAAE,EAAA,WAA0B;AAC9D,WAAOF,EAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD,GAFsC,kBAItCA,EAAY,UAAU,QAAQ,gBAAAE,EAAA,SAAgBE,GAAW;AACvD,QAAI,GAAGC,GAAOC;AAId,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK;AAC1C,MAAAD,IAAQ,KAAK,KAAK,OAAO,GAAG,CAAC,GAC7BC,IAAQ,SAASD,GAAO,EAAE,GAE1BD,EAAU,IAAIE,GAAO,EAAE;AAKzB,UAAMC,IAAe,KAAK,KAAK,SAAS;AACxC,IAAIA,IAAe,MACjBF,IAAQ,KAAK,KAAK,OAAO,CAAC,GAC1BC,IAAQ,SAASD,GAAO,EAAE,GAE1BD,EAAU,IAAIE,GAAOC,IAAe,IAAI,CAAC;AAAA,EAE7C,GArB8B,UAuB9BC,IAAiBR;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/polynomial.js

@@ -0,0 +1,38 @@
+var h = Object.defineProperty;
+var u = (r, i) => h(r, "name", { value: i, configurable: !0 });
+import { __exports as a } from "../../../../../../../_virtual/polynomial.js";
+import { __require as g } from "./galois-field.js";
+var c;
+function _() {
+  return c ? a : (c = 1, (function(r) {
+    const i = g();
+    r.mul = /* @__PURE__ */ u(function(t, n) {
+      const e = new Uint8Array(t.length + n.length - 1);
+      for (let o = 0; o < t.length; o++)
+        for (let l = 0; l < n.length; l++)
+          e[o + l] ^= i.mul(t[o], n[l]);
+      return e;
+    }, "mul"), r.mod = /* @__PURE__ */ u(function(t, n) {
+      let e = new Uint8Array(t);
+      for (; e.length - n.length >= 0; ) {
+        const o = e[0];
+        for (let f = 0; f < n.length; f++)
+          e[f] ^= i.mul(n[f], o);
+        let l = 0;
+        for (; l < e.length && e[l] === 0; ) l++;
+        e = e.slice(l);
+      }
+      return e;
+    }, "mod"), r.generateECPolynomial = /* @__PURE__ */ u(function(t) {
+      let n = new Uint8Array([1]);
+      for (let e = 0; e < t; e++)
+        n = r.mul(n, new Uint8Array([1, i.exp(e)]));
+      return n;
+    }, "generateECPolynomial");
+  })(a), a);
+}
+u(_, "requirePolynomial");
+export {
+  _ as __require
+};
+//# sourceMappingURL=polynomial.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/polynomial.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/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":["GF","require$$0","exports","__name","p1","p2","coeff","i","j","divident","divisor","result","offset","degree","poly"],"mappings":";;;;;;;AAAA,UAAMA,IAAKC,EAAA;AASX,IAAAC,EAAA,MAAc,gBAAAC,EAAA,SAAcC,GAAIC,GAAI;AAClC,YAAMC,IAAQ,IAAI,WAAWF,EAAG,SAASC,EAAG,SAAS,CAAC;AAEtD,eAASE,IAAI,GAAGA,IAAIH,EAAG,QAAQG;AAC7B,iBAASC,IAAI,GAAGA,IAAIH,EAAG,QAAQG;AAC7B,UAAAF,EAAMC,IAAIC,CAAC,KAAKR,EAAG,IAAII,EAAGG,CAAC,GAAGF,EAAGG,CAAC,CAAC;AAIvC,aAAOF;AAAA,IACT,GAVc,QAmBdJ,EAAA,MAAc,gBAAAC,EAAA,SAAcM,GAAUC,GAAS;AAC7C,UAAIC,IAAS,IAAI,WAAWF,CAAQ;AAEpC,aAAQE,EAAO,SAASD,EAAQ,UAAW,KAAG;AAC5C,cAAMJ,IAAQK,EAAO,CAAC;AAEtB,iBAASJ,IAAI,GAAGA,IAAIG,EAAQ,QAAQH;AAClC,UAAAI,EAAOJ,CAAC,KAAKP,EAAG,IAAIU,EAAQH,CAAC,GAAGD,CAAK;AAIvC,YAAIM,IAAS;AACb,eAAOA,IAASD,EAAO,UAAUA,EAAOC,CAAM,MAAM,IAAG,CAAAA;AACvD,QAAAD,IAASA,EAAO,MAAMC,CAAM;AAAA,MAChC;AAEE,aAAOD;AAAA,IACT,GAjBc,QA0BdT,EAAA,uBAA+B,gBAAAC,EAAA,SAA+BU,GAAQ;AACpE,UAAIC,IAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,eAASP,IAAI,GAAGA,IAAIM,GAAQN;AAC1B,QAAAO,IAAOZ,EAAQ,IAAIY,GAAM,IAAI,WAAW,CAAC,GAAGd,EAAG,IAAIO,CAAC,CAAC,CAAC,CAAC;AAGzD,aAAOO;AAAA,IACT,GAP+B;AAAA;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,166 @@
+var Z = Object.defineProperty;
+var f = (m, w) => Z(m, "name", { value: w, configurable: !0 });
+import { __exports as E } from "../../../../../../../_virtual/qrcode.js";
+import { __require as $ } from "./utils.js";
+import { __require as x } from "./error-correction-level.js";
+import { __require as v } from "./bit-buffer.js";
+import { __require as ee } from "./bit-matrix.js";
+import { __require as te } from "./alignment-pattern.js";
+import { __require as oe } from "./finder-pattern.js";
+import { __require as re } from "./mask-pattern.js";
+import { __require as ne } from "./error-correction-code.js";
+import { __require as se } from "./reed-solomon-encoder.js";
+import { __require as ie } from "./version.js";
+import { __require as ue } from "./format-info.js";
+import { __require as ce } from "./mode.js";
+import { __require as fe } from "./segments.js";
+var A;
+function ye() {
+  if (A) return E;
+  A = 1;
+  const m = $(), w = x(), k = v(), P = ee(), D = te(), V = oe(), h = re(), C = ne(), R = se(), q = ie(), G = ue(), Q = ce(), b = fe();
+  function U(r, u) {
+    const n = r.size, e = V.getPositions(u);
+    for (let c = 0; c < e.length; c++) {
+      const t = e[c][0], o = e[c][1];
+      for (let i = -1; i <= 7; i++)
+        if (!(t + i <= -1 || n <= t + i))
+          for (let s = -1; s <= 7; s++)
+            o + s <= -1 || n <= o + s || (i >= 0 && i <= 6 && (s === 0 || s === 6) || s >= 0 && s <= 6 && (i === 0 || i === 6) || i >= 2 && i <= 4 && s >= 2 && s <= 4 ? r.set(t + i, o + s, !0, !0) : r.set(t + i, o + s, !1, !0));
+    }
+  }
+  f(U, "setupFinderPattern");
+  function J(r) {
+    const u = r.size;
+    for (let n = 8; n < u - 8; n++) {
+      const e = n % 2 === 0;
+      r.set(n, 6, e, !0), r.set(6, n, e, !0);
+    }
+  }
+  f(J, "setupTimingPattern");
+  function N(r, u) {
+    const n = D.getPositions(u);
+    for (let e = 0; e < n.length; e++) {
+      const c = n[e][0], t = n[e][1];
+      for (let o = -2; o <= 2; o++)
+        for (let i = -2; i <= 2; i++)
+          o === -2 || o === 2 || i === -2 || i === 2 || o === 0 && i === 0 ? r.set(c + o, t + i, !0, !0) : r.set(c + o, t + i, !1, !0);
+    }
+  }
+  f(N, "setupAlignmentPattern");
+  function L(r, u) {
+    const n = r.size, e = q.getEncodedBits(u);
+    let c, t, o;
+    for (let i = 0; i < 18; i++)
+      c = Math.floor(i / 3), t = i % 3 + n - 8 - 3, o = (e >> i & 1) === 1, r.set(c, t, o, !0), r.set(t, c, o, !0);
+  }
+  f(L, "setupVersionInfo");
+  function B(r, u, n) {
+    const e = r.size, c = G.getEncodedBits(u, n);
+    let t, o;
+    for (t = 0; t < 15; t++)
+      o = (c >> t & 1) === 1, t < 6 ? r.set(t, 8, o, !0) : t < 8 ? r.set(t + 1, 8, o, !0) : r.set(e - 15 + t, 8, o, !0), t < 8 ? r.set(8, e - t - 1, o, !0) : t < 9 ? r.set(8, 15 - t - 1 + 1, o, !0) : r.set(8, 15 - t - 1, o, !0);
+    r.set(e - 8, 8, 1, !0);
+  }
+  f(B, "setupFormatInfo");
+  function j(r, u) {
+    const n = r.size;
+    let e = -1, c = n - 1, t = 7, o = 0;
+    for (let i = n - 1; i > 0; i -= 2)
+      for (i === 6 && i--; ; ) {
+        for (let s = 0; s < 2; s++)
+          if (!r.isReserved(c, i - s)) {
+            let d = !1;
+            o < u.length && (d = (u[o] >>> t & 1) === 1), r.set(c, i - s, d), t--, t === -1 && (o++, t = 7);
+          }
+        if (c += e, c < 0 || n <= c) {
+          c -= e, e = -e;
+          break;
+        }
+      }
+  }
+  f(j, "setupData");
+  function H(r, u, n) {
+    const e = new k();
+    n.forEach(function(s) {
+      e.put(s.mode.bit, 4), e.put(s.getLength(), Q.getCharCountIndicator(s.mode, r)), s.write(e);
+    });
+    const c = m.getSymbolTotalCodewords(r), t = C.getTotalCodewordsCount(r, u), o = (c - t) * 8;
+    for (e.getLengthInBits() + 4 <= o && e.put(0, 4); e.getLengthInBits() % 8 !== 0; )
+      e.putBit(0);
+    const i = (o - e.getLengthInBits()) / 8;
+    for (let s = 0; s < i; s++)
+      e.put(s % 2 ? 17 : 236, 8);
+    return K(e, r, u);
+  }
+  f(H, "createData");
+  function K(r, u, n) {
+    const e = m.getSymbolTotalCodewords(u), c = C.getTotalCodewordsCount(u, n), t = e - c, o = C.getBlocksCount(u, n), i = e % o, s = o - i, d = Math.floor(e / o), p = Math.floor(t / o), W = p + 1, z = d - p, X = new R(z);
+    let S = 0;
+    const _ = new Array(o), T = new Array(o);
+    let I = 0;
+    const Y = new Uint8Array(r.buffer);
+    for (let g = 0; g < o; g++) {
+      const M = g < s ? p : W;
+      _[g] = Y.slice(S, S + M), T[g] = X.encode(_[g]), S += M, I = Math.max(I, M);
+    }
+    const y = new Uint8Array(e);
+    let F = 0, l, a;
+    for (l = 0; l < I; l++)
+      for (a = 0; a < o; a++)
+        l < _[a].length && (y[F++] = _[a][l]);
+    for (l = 0; l < z; l++)
+      for (a = 0; a < o; a++)
+        y[F++] = T[a][l];
+    return y;
+  }
+  f(K, "createCodewords");
+  function O(r, u, n, e) {
+    let c;
+    if (Array.isArray(r))
+      c = b.fromArray(r);
+    else if (typeof r == "string") {
+      let d = u;
+      if (!d) {
+        const p = b.rawSplit(r);
+        d = q.getBestVersionForData(p, n);
+      }
+      c = b.fromString(r, d || 40);
+    } else
+      throw new Error("Invalid data");
+    const t = q.getBestVersionForData(c, n);
+    if (!t)
+      throw new Error("The amount of data is too big to be stored in a QR Code");
+    if (!u)
+      u = t;
+    else if (u < t)
+      throw new Error(
+        `
+The chosen QR Code version cannot contain this amount of data.
+Minimum version required to store current data is: ` + t + `.
+`
+      );
+    const o = H(u, n, c), i = m.getSymbolSize(u), s = new P(i);
+    return U(s, u), J(s), N(s, u), B(s, n, 0), u >= 7 && L(s, u), j(s, o), isNaN(e) && (e = h.getBestMask(
+      s,
+      B.bind(null, s, n)
+    )), h.applyMask(e, s), B(s, n, e), {
+      modules: s,
+      version: u,
+      errorCorrectionLevel: n,
+      maskPattern: e,
+      segments: c
+    };
+  }
+  return f(O, "createSymbol"), E.create = /* @__PURE__ */ f(function(u, n) {
+    if (typeof u > "u" || u === "")
+      throw new Error("No input text");
+    let e = w.M, c, t;
+    return typeof n < "u" && (e = w.from(n.errorCorrectionLevel, w.M), c = q.from(n.version), t = h.from(n.maskPattern), n.toSJISFunc && m.setToSJISFunction(n.toSJISFunc)), O(u, c, e, t);
+  }, "create"), E;
+}
+f(ye, "requireQrcode");
+export {
+  ye as __require
+};
+//# sourceMappingURL=qrcode.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"qrcode.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n *   http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n//   http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n//   http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n  const size = matrix.size\n  const pos = FinderPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -1; r <= 7; r++) {\n      if (row + r <= -1 || size <= row + r) continue\n\n      for (let c = -1; c <= 7; c++) {\n        if (col + c <= -1 || size <= col + c) continue\n\n        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param  {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n  const size = matrix.size\n\n  for (let r = 8; r < size - 8; r++) {\n    const value = r % 2 === 0\n    matrix.set(r, 6, value, true)\n    matrix.set(6, r, value, true)\n  }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n  const pos = AlignmentPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -2; r <= 2; r++) {\n      for (let c = -2; c <= 2; c++) {\n        if (r === -2 || r === 2 || c === -2 || c === 2 ||\n          (r === 0 && c === 0)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n  const size = matrix.size\n  const bits = Version.getEncodedBits(version)\n  let row, col, mod\n\n  for (let i = 0; i < 18; i++) {\n    row = Math.floor(i / 3)\n    col = i % 3 + size - 8 - 3\n    mod = ((bits >> i) & 1) === 1\n\n    matrix.set(row, col, mod, true)\n    matrix.set(col, row, mod, true)\n  }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param  {BitMatrix} matrix               Modules matrix\n * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level\n * @param  {Number}    maskPattern          Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n  const size = matrix.size\n  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n  let i, mod\n\n  for (i = 0; i < 15; i++) {\n    mod = ((bits >> i) & 1) === 1\n\n    // vertical\n    if (i < 6) {\n      matrix.set(i, 8, mod, true)\n    } else if (i < 8) {\n      matrix.set(i + 1, 8, mod, true)\n    } else {\n      matrix.set(size - 15 + i, 8, mod, true)\n    }\n\n    // horizontal\n    if (i < 8) {\n      matrix.set(8, size - i - 1, mod, true)\n    } else if (i < 9) {\n      matrix.set(8, 15 - i - 1 + 1, mod, true)\n    } else {\n      matrix.set(8, 15 - i - 1, mod, true)\n    }\n  }\n\n  // fixed module\n  matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param  {BitMatrix}  matrix Modules matrix\n * @param  {Uint8Array} data   Data codewords\n */\nfunction setupData (matrix, data) {\n  const size = matrix.size\n  let inc = -1\n  let row = size - 1\n  let bitIndex = 7\n  let byteIndex = 0\n\n  for (let col = size - 1; col > 0; col -= 2) {\n    if (col === 6) col--\n\n    while (true) {\n      for (let c = 0; c < 2; c++) {\n        if (!matrix.isReserved(row, col - c)) {\n          let dark = false\n\n          if (byteIndex < data.length) {\n            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n          }\n\n          matrix.set(row, col - c, dark)\n          bitIndex--\n\n          if (bitIndex === -1) {\n            byteIndex++\n            bitIndex = 7\n          }\n        }\n      }\n\n      row += inc\n\n      if (row < 0 || size <= row) {\n        row -= inc\n        inc = -inc\n        break\n      }\n    }\n  }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param  {Number}   version              QR Code version\n * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level\n * @param  {ByteData} data                 Data input\n * @return {Uint8Array}                    Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n  // Prepare data buffer\n  const buffer = new BitBuffer()\n\n  segments.forEach(function (data) {\n    // prefix data with mode indicator (4 bits)\n    buffer.put(data.mode.bit, 4)\n\n    // Prefix data with character count indicator.\n    // The character count indicator is a string of bits that represents the\n    // number of characters that are being encoded.\n    // The character count indicator must be placed after the mode indicator\n    // and must be a certain number of bits long, depending on the QR version\n    // and data mode\n    // @see {@link Mode.getCharCountIndicator}.\n    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n    // add binary data sequence to buffer\n    data.write(buffer)\n  })\n\n  // Calculate required number of bits\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n  // Add a terminator.\n  // If the bit string is shorter than the total number of required bits,\n  // a terminator of up to four 0s must be added to the right side of the string.\n  // If the bit string is more than four bits shorter than the required number of bits,\n  // add four 0s to the end.\n  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n    buffer.put(0, 4)\n  }\n\n  // If the bit string is fewer than four bits shorter, add only the number of 0s that\n  // are needed to reach the required number of bits.\n\n  // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n  // pad the string on the right with 0s to make the string's length a multiple of 8.\n  while (buffer.getLengthInBits() % 8 !== 0) {\n    buffer.putBit(0)\n  }\n\n  // Add pad bytes if the string is still shorter than the total number of required bits.\n  // Extend the buffer to fill the data capacity of the symbol corresponding to\n  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n  // and 00010001 (0x11) alternately.\n  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n  for (let i = 0; i < remainingByte; i++) {\n    buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n  }\n\n  return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param  {BitBuffer} bitBuffer            Data to encode\n * @param  {Number}    version              QR Code version\n * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array}                     Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n  // Total codewords for this QR code version (Data + Error correction)\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n  // Total number of error correction codewords\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n  // Total number of data codewords\n  const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n  // Total number of blocks\n  const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n  // Calculate how many blocks each group should contain\n  const blocksInGroup2 = totalCodewords % ecTotalBlocks\n  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n  // Number of EC codewords is the same for both groups\n  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n  const rs = new ReedSolomonEncoder(ecCount)\n\n  let offset = 0\n  const dcData = new Array(ecTotalBlocks)\n  const ecData = new Array(ecTotalBlocks)\n  let maxDataSize = 0\n  const buffer = new Uint8Array(bitBuffer.buffer)\n\n  // Divide the buffer into the required number of blocks\n  for (let b = 0; b < ecTotalBlocks; b++) {\n    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n    // extract a block of data from buffer\n    dcData[b] = buffer.slice(offset, offset + dataSize)\n\n    // Calculate EC codewords for this data block\n    ecData[b] = rs.encode(dcData[b])\n\n    offset += dataSize\n    maxDataSize = Math.max(maxDataSize, dataSize)\n  }\n\n  // Create final data\n  // Interleave the data and error correction codewords from each block\n  const data = new Uint8Array(totalCodewords)\n  let index = 0\n  let i, r\n\n  // Add data codewords\n  for (i = 0; i < maxDataSize; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      if (i < dcData[r].length) {\n        data[index++] = dcData[r][i]\n      }\n    }\n  }\n\n  // Apped EC codewords\n  for (i = 0; i < ecCount; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      data[index++] = ecData[r][i]\n    }\n  }\n\n  return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param  {String} data                 Input string\n * @param  {Number} version              QR Code version\n * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param  {MaskPattern} maskPattern     Mask pattern\n * @return {Object}                      Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n  let segments\n\n  if (Array.isArray(data)) {\n    segments = Segments.fromArray(data)\n  } else if (typeof data === 'string') {\n    let estimatedVersion = version\n\n    if (!estimatedVersion) {\n      const rawSegments = Segments.rawSplit(data)\n\n      // Estimate best version that can contain raw splitted segments\n      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n    }\n\n    // Build optimized segments\n    // If estimated version is undefined, try with the highest version\n    segments = Segments.fromString(data, estimatedVersion || 40)\n  } else {\n    throw new Error('Invalid data')\n  }\n\n  // Get the min version that can contain data\n  const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n  // If no version is found, data cannot be stored\n  if (!bestVersion) {\n    throw new Error('The amount of data is too big to be stored in a QR Code')\n  }\n\n  // If not specified, use min version as default\n  if (!version) {\n    version = bestVersion\n\n  // Check if the specified version can contain the data\n  } else if (version < bestVersion) {\n    throw new Error('\\n' +\n      'The chosen QR Code version cannot contain this amount of data.\\n' +\n      'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n    )\n  }\n\n  const dataBits = createData(version, errorCorrectionLevel, segments)\n\n  // Allocate matrix buffer\n  const moduleCount = Utils.getSymbolSize(version)\n  const modules = new BitMatrix(moduleCount)\n\n  // Add function modules\n  setupFinderPattern(modules, version)\n  setupTimingPattern(modules)\n  setupAlignmentPattern(modules, version)\n\n  // Add temporary dummy bits for format info just to set them as reserved.\n  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n  // since the masking operation must be performed only on the encoding region.\n  // These blocks will be replaced with correct values later in code.\n  setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n  if (version >= 7) {\n    setupVersionInfo(modules, version)\n  }\n\n  // Add data codewords\n  setupData(modules, dataBits)\n\n  if (isNaN(maskPattern)) {\n    // Find best mask pattern\n    maskPattern = MaskPattern.getBestMask(modules,\n      setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n  }\n\n  // Apply mask pattern\n  MaskPattern.applyMask(maskPattern, modules)\n\n  // Replace format info bits with correct values\n  setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n  return {\n    modules: modules,\n    version: version,\n    errorCorrectionLevel: errorCorrectionLevel,\n    maskPattern: maskPattern,\n    segments: segments\n  }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data                 Input data\n * @param {Object} options                      Optional configurations\n * @param {Number} options.version              QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n  if (typeof data === 'undefined' || data === '') {\n    throw new Error('No input text')\n  }\n\n  let errorCorrectionLevel = ECLevel.M\n  let version\n  let mask\n\n  if (typeof options !== 'undefined') {\n    // Use higher error correction level as default\n    errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n    version = Version.from(options.version)\n    mask = MaskPattern.from(options.maskPattern)\n\n    if (options.toSJISFunc) {\n      Utils.setToSJISFunction(options.toSJISFunc)\n    }\n  }\n\n  return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"names":["Utils","require$$0","ECLevel","require$$1","BitBuffer","require$$2","BitMatrix","require$$3","AlignmentPattern","require$$4","FinderPattern","require$$5","MaskPattern","require$$6","ECCode","require$$7","ReedSolomonEncoder","require$$8","Version","require$$9","FormatInfo","require$$10","Mode","require$$11","Segments","require$$12","setupFinderPattern","matrix","version","size","pos","i","row","col","r","c","__name","setupTimingPattern","value","setupAlignmentPattern","setupVersionInfo","bits","mod","setupFormatInfo","errorCorrectionLevel","maskPattern","setupData","data","inc","bitIndex","byteIndex","dark","createData","segments","buffer","totalCodewords","ecTotalCodewords","dataTotalCodewordsBits","remainingByte","createCodewords","bitBuffer","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","offset","dcData","ecData","maxDataSize","b","dataSize","index","createSymbol","estimatedVersion","rawSegments","bestVersion","dataBits","moduleCount","modules","qrcode","options","mask"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,QAAMA,IAAQC,EAAA,GACRC,IAAUC,EAAA,GACVC,IAAYC,EAAA,GACZC,IAAYC,GAAA,GACZC,IAAmBC,GAAA,GACnBC,IAAgBC,GAAA,GAChBC,IAAcC,GAAA,GACdC,IAASC,GAAA,GACTC,IAAqBC,GAAA,GACrBC,IAAUC,GAAA,GACVC,IAAaC,GAAA,GACbC,IAAOC,GAAA,GACPC,IAAWC,GAAA;AAkCjB,WAASC,EAAoBC,GAAQC,GAAS;AAC5C,UAAMC,IAAOF,EAAO,MACdG,IAAMpB,EAAc,aAAakB,CAAO;AAE9C,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAI,EAAAF,IAAME,KAAK,MAAML,KAAQG,IAAME;AAEnC,mBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAIF,IAAME,KAAK,MAAMN,KAAQI,IAAME,MAE9BD,KAAK,KAAKA,KAAK,MAAMC,MAAM,KAAKA,MAAM,MACxCA,KAAK,KAAKA,KAAK,MAAMD,MAAM,KAAKA,MAAM,MACtCA,KAAK,KAAKA,KAAK,KAAKC,KAAK,KAAKA,KAAK,IACpCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AAxBS,EAAAC,EAAAV,GAAA;AAiCT,WAASW,EAAoBV,GAAQ;AACnC,UAAME,IAAOF,EAAO;AAEpB,aAASO,IAAI,GAAGA,IAAIL,IAAO,GAAGK,KAAK;AACjC,YAAMI,IAAQJ,IAAI,MAAM;AACxB,MAAAP,EAAO,IAAIO,GAAG,GAAGI,GAAO,EAAI,GAC5BX,EAAO,IAAI,GAAGO,GAAGI,GAAO,EAAI;AAAA,IAChC;AAAA,EACA;AARS,EAAAF,EAAAC,GAAA;AAkBT,WAASE,EAAuBZ,GAAQC,GAAS;AAC/C,UAAME,IAAMtB,EAAiB,aAAaoB,CAAO;AAEjD,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,iBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,UAAID,MAAM,MAAMA,MAAM,KAAKC,MAAM,MAAMA,MAAM,KAC1CD,MAAM,KAAKC,MAAM,IAClBR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AAlBS,EAAAC,EAAAG,GAAA;AA0BT,WAASC,EAAkBb,GAAQC,GAAS;AAC1C,UAAMC,IAAOF,EAAO,MACdc,IAAOvB,EAAQ,eAAeU,CAAO;AAC3C,QAAII,GAAKC,GAAKS;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI;AACtB,MAAAV,IAAM,KAAK,MAAM,IAAI,CAAC,GACtBC,IAAM,IAAI,IAAIJ,IAAO,IAAI,GACzBa,KAAQD,KAAQ,IAAK,OAAO,GAE5Bd,EAAO,IAAIK,GAAKC,GAAKS,GAAK,EAAI,GAC9Bf,EAAO,IAAIM,GAAKD,GAAKU,GAAK,EAAI;AAAA,EAElC;AAbS,EAAAN,EAAAI,GAAA;AAsBT,WAASG,EAAiBhB,GAAQiB,GAAsBC,GAAa;AACnE,UAAMhB,IAAOF,EAAO,MACdc,IAAOrB,EAAW,eAAewB,GAAsBC,CAAW;AACxE,QAAId,GAAGW;AAEP,SAAKX,IAAI,GAAGA,IAAI,IAAIA;AAClB,MAAAW,KAAQD,KAAQV,IAAK,OAAO,GAGxBA,IAAI,IACNJ,EAAO,IAAII,GAAG,GAAGW,GAAK,EAAI,IACjBX,IAAI,IACbJ,EAAO,IAAII,IAAI,GAAG,GAAGW,GAAK,EAAI,IAE9Bf,EAAO,IAAIE,IAAO,KAAKE,GAAG,GAAGW,GAAK,EAAI,GAIpCX,IAAI,IACNJ,EAAO,IAAI,GAAGE,IAAOE,IAAI,GAAGW,GAAK,EAAI,IAC5BX,IAAI,IACbJ,EAAO,IAAI,GAAG,KAAKI,IAAI,IAAI,GAAGW,GAAK,EAAI,IAEvCf,EAAO,IAAI,GAAG,KAAKI,IAAI,GAAGW,GAAK,EAAI;AAKvC,IAAAf,EAAO,IAAIE,IAAO,GAAG,GAAG,GAAG,EAAI;AAAA,EACjC;AA7BS,EAAAO,EAAAO,GAAA;AAqCT,WAASG,EAAWnB,GAAQoB,GAAM;AAChC,UAAMlB,IAAOF,EAAO;AACpB,QAAIqB,IAAM,IACNhB,IAAMH,IAAO,GACboB,IAAW,GACXC,IAAY;AAEhB,aAASjB,IAAMJ,IAAO,GAAGI,IAAM,GAAGA,KAAO;AAGvC,WAFIA,MAAQ,KAAGA,SAEF;AACX,iBAASE,IAAI,GAAGA,IAAI,GAAGA;AACrB,cAAI,CAACR,EAAO,WAAWK,GAAKC,IAAME,CAAC,GAAG;AACpC,gBAAIgB,IAAO;AAEX,YAAID,IAAYH,EAAK,WACnBI,KAAUJ,EAAKG,CAAS,MAAMD,IAAY,OAAO,IAGnDtB,EAAO,IAAIK,GAAKC,IAAME,GAAGgB,CAAI,GAC7BF,KAEIA,MAAa,OACfC,KACAD,IAAW;AAAA,UAEvB;AAKM,YAFAjB,KAAOgB,GAEHhB,IAAM,KAAKH,KAAQG,GAAK;AAC1B,UAAAA,KAAOgB,GACPA,IAAM,CAACA;AACP;AAAA,QACR;AAAA,MACA;AAAA,EAEA;AAtCS,EAAAZ,EAAAU,GAAA;AAgDT,WAASM,EAAYxB,GAASgB,GAAsBS,GAAU;AAE5D,UAAMC,IAAS,IAAIlD,EAAS;AAE5B,IAAAiD,EAAS,QAAQ,SAAUN,GAAM;AAE/B,MAAAO,EAAO,IAAIP,EAAK,KAAK,KAAK,CAAC,GAS3BO,EAAO,IAAIP,EAAK,UAAS,GAAIzB,EAAK,sBAAsByB,EAAK,MAAMnB,CAAO,CAAC,GAG3EmB,EAAK,MAAMO,CAAM;AAAA,IACrB,CAAG;AAGD,UAAMC,IAAiBvD,EAAM,wBAAwB4B,CAAO,GACtD4B,IAAmB1C,EAAO,uBAAuBc,GAASgB,CAAoB,GAC9Ea,KAA0BF,IAAiBC,KAAoB;AAgBrE,SATIF,EAAO,oBAAoB,KAAKG,KAClCH,EAAO,IAAI,GAAG,CAAC,GAQVA,EAAO,oBAAoB,MAAM;AACtC,MAAAA,EAAO,OAAO,CAAC;AAOjB,UAAMI,KAAiBD,IAAyBH,EAAO,gBAAe,KAAM;AAC5E,aAASvB,IAAI,GAAGA,IAAI2B,GAAe3B;AACjC,MAAAuB,EAAO,IAAIvB,IAAI,IAAI,KAAO,KAAM,CAAC;AAGnC,WAAO4B,EAAgBL,GAAQ1B,GAASgB,CAAoB;AAAA,EAC9D;AAtDS,EAAAR,EAAAgB,GAAA;AAiET,WAASO,EAAiBC,GAAWhC,GAASgB,GAAsB;AAElE,UAAMW,IAAiBvD,EAAM,wBAAwB4B,CAAO,GAGtD4B,IAAmB1C,EAAO,uBAAuBc,GAASgB,CAAoB,GAG9EiB,IAAqBN,IAAiBC,GAGtCM,IAAgBhD,EAAO,eAAec,GAASgB,CAAoB,GAGnEmB,IAAiBR,IAAiBO,GAClCE,IAAiBF,IAAgBC,GAEjCE,IAAyB,KAAK,MAAMV,IAAiBO,CAAa,GAElEI,IAAwB,KAAK,MAAML,IAAqBC,CAAa,GACrEK,IAAwBD,IAAwB,GAGhDE,IAAUH,IAAyBC,GAGnCG,IAAK,IAAIrD,EAAmBoD,CAAO;AAEzC,QAAIE,IAAS;AACb,UAAMC,IAAS,IAAI,MAAMT,CAAa,GAChCU,IAAS,IAAI,MAAMV,CAAa;AACtC,QAAIW,IAAc;AAClB,UAAMnB,IAAS,IAAI,WAAWM,EAAU,MAAM;AAG9C,aAASc,IAAI,GAAGA,IAAIZ,GAAeY,KAAK;AACtC,YAAMC,IAAWD,IAAIV,IAAiBE,IAAwBC;AAG9D,MAAAI,EAAOG,CAAC,IAAIpB,EAAO,MAAMgB,GAAQA,IAASK,CAAQ,GAGlDH,EAAOE,CAAC,IAAIL,EAAG,OAAOE,EAAOG,CAAC,CAAC,GAE/BJ,KAAUK,GACVF,IAAc,KAAK,IAAIA,GAAaE,CAAQ;AAAA,IAChD;AAIE,UAAM5B,IAAO,IAAI,WAAWQ,CAAc;AAC1C,QAAIqB,IAAQ,GACR7C,GAAGG;AAGP,SAAKH,IAAI,GAAGA,IAAI0C,GAAa1C;AAC3B,WAAKG,IAAI,GAAGA,IAAI4B,GAAe5B;AAC7B,QAAIH,IAAIwC,EAAOrC,CAAC,EAAE,WAChBa,EAAK6B,GAAO,IAAIL,EAAOrC,CAAC,EAAEH,CAAC;AAMjC,SAAKA,IAAI,GAAGA,IAAIqC,GAASrC;AACvB,WAAKG,IAAI,GAAGA,IAAI4B,GAAe5B;AAC7B,QAAAa,EAAK6B,GAAO,IAAIJ,EAAOtC,CAAC,EAAEH,CAAC;AAI/B,WAAOgB;AAAA,EACT;AAvES,EAAAX,EAAAuB,GAAA;AAkFT,WAASkB,EAAc9B,GAAMnB,GAASgB,GAAsBC,GAAa;AACvE,QAAIQ;AAEJ,QAAI,MAAM,QAAQN,CAAI;AACpB,MAAAM,IAAW7B,EAAS,UAAUuB,CAAI;AAAA,aACzB,OAAOA,KAAS,UAAU;AACnC,UAAI+B,IAAmBlD;AAEvB,UAAI,CAACkD,GAAkB;AACrB,cAAMC,IAAcvD,EAAS,SAASuB,CAAI;AAG1C,QAAA+B,IAAmB5D,EAAQ,sBAAsB6D,GAAanC,CAAoB;AAAA,MACxF;AAII,MAAAS,IAAW7B,EAAS,WAAWuB,GAAM+B,KAAoB,EAAE;AAAA,IAC/D;AACI,YAAM,IAAI,MAAM,cAAc;AAIhC,UAAME,IAAc9D,EAAQ,sBAAsBmC,GAAUT,CAAoB;AAGhF,QAAI,CAACoC;AACH,YAAM,IAAI,MAAM,yDAAyD;AAI3E,QAAI,CAACpD;AACH,MAAAA,IAAUoD;AAAA,aAGDpD,IAAUoD;AACnB,YAAM,IAAI;AAAA,QAAM;AAAA;AAAA,uDAE0CA,IAAc;AAAA;AAAA,MAC5E;AAGE,UAAMC,IAAW7B,EAAWxB,GAASgB,GAAsBS,CAAQ,GAG7D6B,IAAclF,EAAM,cAAc4B,CAAO,GACzCuD,IAAU,IAAI7E,EAAU4E,CAAW;AAGzC,WAAAxD,EAAmByD,GAASvD,CAAO,GACnCS,EAAmB8C,CAAO,GAC1B5C,EAAsB4C,GAASvD,CAAO,GAMtCe,EAAgBwC,GAASvC,GAAsB,CAAC,GAE5ChB,KAAW,KACbY,EAAiB2C,GAASvD,CAAO,GAInCkB,EAAUqC,GAASF,CAAQ,GAEvB,MAAMpC,CAAW,MAEnBA,IAAcjC,EAAY;AAAA,MAAYuE;AAAA,MACpCxC,EAAgB,KAAK,MAAMwC,GAASvC,CAAoB;AAAA,IAAC,IAI7DhC,EAAY,UAAUiC,GAAasC,CAAO,GAG1CxC,EAAgBwC,GAASvC,GAAsBC,CAAW,GAEnD;AAAA,MACL,SAASsC;AAAA,MACT,SAASvD;AAAA,MACT,sBAAsBgB;AAAA,MACtB,aAAaC;AAAA,MACb,UAAUQ;AAAA,IACd;AAAA,EACA;AArFS,SAAAjB,EAAAyC,GAAA,iBAgGTO,EAAA,SAAiB,gBAAAhD,EAAA,SAAiBW,GAAMsC,GAAS;AAC/C,QAAI,OAAOtC,IAAS,OAAeA,MAAS;AAC1C,YAAM,IAAI,MAAM,eAAe;AAGjC,QAAIH,IAAuB1C,EAAQ,GAC/B0B,GACA0D;AAEJ,WAAI,OAAOD,IAAY,QAErBzC,IAAuB1C,EAAQ,KAAKmF,EAAQ,sBAAsBnF,EAAQ,CAAC,GAC3E0B,IAAUV,EAAQ,KAAKmE,EAAQ,OAAO,GACtCC,IAAO1E,EAAY,KAAKyE,EAAQ,WAAW,GAEvCA,EAAQ,cACVrF,EAAM,kBAAkBqF,EAAQ,UAAU,IAIvCR,EAAa9B,GAAMnB,GAASgB,GAAsB0C,CAAI;AAAA,EAC/D,GArBiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/reed-solomon-encoder.js

@@ -0,0 +1,31 @@
+var c = Object.defineProperty;
+var n = (i, e) => c(i, "name", { value: e, configurable: !0 });
+import { __require as g } from "./polynomial.js";
+var d, h;
+function m() {
+  if (h) return d;
+  h = 1;
+  const i = g();
+  function e(o) {
+    this.genPoly = void 0, this.degree = o, this.degree && this.initialize(this.degree);
+  }
+  return n(e, "ReedSolomonEncoder"), e.prototype.initialize = /* @__PURE__ */ n(function(r) {
+    this.degree = r, this.genPoly = i.generateECPolynomial(this.degree);
+  }, "initialize"), e.prototype.encode = /* @__PURE__ */ n(function(r) {
+    if (!this.genPoly)
+      throw new Error("Encoder not initialized");
+    const s = new Uint8Array(r.length + this.degree);
+    s.set(r);
+    const t = i.mod(s, this.genPoly), l = this.degree - t.length;
+    if (l > 0) {
+      const a = new Uint8Array(this.degree);
+      return a.set(t, l), a;
+    }
+    return t;
+  }, "encode"), d = e, d;
+}
+n(m, "requireReedSolomonEncoder");
+export {
+  m as __require
+};
+//# sourceMappingURL=reed-solomon-encoder.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/reed-solomon-encoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon-encoder.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"names":["Polynomial","require$$0","ReedSolomonEncoder","degree","__name","data","paddedData","remainder","start","buff","reedSolomonEncoder"],"mappings":";;;;;;;AAAA,QAAMA,IAAaC,EAAA;AAEnB,WAASC,EAAoBC,GAAQ;AACnC,SAAK,UAAU,QACf,KAAK,SAASA,GAEV,KAAK,UAAQ,KAAK,WAAW,KAAK,MAAM;AAAA,EAC9C;AALS,SAAAC,EAAAF,GAAA,uBAaTA,EAAmB,UAAU,aAAa,gBAAAE,EAAA,SAAqBD,GAAQ;AAErE,SAAK,SAASA,GACd,KAAK,UAAUH,EAAW,qBAAqB,KAAK,MAAM;AAAA,EAC5D,GAJ0C,eAY1CE,EAAmB,UAAU,SAAS,gBAAAE,EAAA,SAAiBC,GAAM;AAC3D,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,yBAAyB;AAK3C,UAAMC,IAAa,IAAI,WAAWD,EAAK,SAAS,KAAK,MAAM;AAC3D,IAAAC,EAAW,IAAID,CAAI;AAInB,UAAME,IAAYP,EAAW,IAAIM,GAAY,KAAK,OAAO,GAKnDE,IAAQ,KAAK,SAASD,EAAU;AACtC,QAAIC,IAAQ,GAAG;AACb,YAAMC,IAAO,IAAI,WAAW,KAAK,MAAM;AACvC,aAAAA,EAAK,IAAIF,GAAWC,CAAK,GAElBC;AAAA,IACX;AAEE,WAAOF;AAAA,EACT,GA1BsC,WA4BtCG,IAAiBR;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/regex.js

@@ -0,0 +1,27 @@
+var R = Object.defineProperty;
+var n = (r, s) => R(r, "name", { value: s, configurable: !0 });
+import { __exports as e } from "../../../../../../../_virtual/regex.js";
+var i;
+function a() {
+  if (i) return e;
+  i = 1;
+  const r = "[0-9]+", s = "[A-Z $%*+\\-./:]+";
+  let u = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+  u = u.replace(/u/g, "\\u");
+  const c = "(?:(?![A-Z0-9 $%*+\\-./:]|" + u + `)(?:.|[\r
+]))+`;
+  e.KANJI = new RegExp(u, "g"), e.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), e.BYTE = new RegExp(c, "g"), e.NUMERIC = new RegExp(r, "g"), e.ALPHANUMERIC = new RegExp(s, "g");
+  const g = new RegExp("^" + u + "$"), A = new RegExp("^" + r + "$"), p = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+  return e.testKanji = /* @__PURE__ */ n(function(t) {
+    return g.test(t);
+  }, "testKanji"), e.testNumeric = /* @__PURE__ */ n(function(t) {
+    return A.test(t);
+  }, "testNumeric"), e.testAlphanumeric = /* @__PURE__ */ n(function(t) {
+    return p.test(t);
+  }, "testAlphanumeric"), e;
+}
+n(a, "requireRegex");
+export {
+  a as __require
+};
+//# sourceMappingURL=regex.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","sources":["../../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/regex.js"],"sourcesContent":["const numeric = '[0-9]+'\nconst alphanumeric = '[A-Z $%*+\\\\-./:]+'\nlet kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nconst byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ')(?:.|[\\r\\n]))+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nconst TEST_KANJI = new RegExp('^' + kanji + '$')\nconst TEST_NUMERIC = new RegExp('^' + numeric + '$')\nconst TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n  return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n  return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n  return TEST_ALPHANUMERIC.test(str)\n}\n"],"names":["numeric","alphanumeric","kanji","byte","regex","TEST_KANJI","TEST_NUMERIC","TEST_ALPHANUMERIC","__name","str"],"mappings":";;;;;;;AAAA,QAAMA,IAAU,UACVC,IAAe;AACrB,MAAIC,IAAQ;AAIZ,EAAAA,IAAQA,EAAM,QAAQ,MAAM,KAAK;AAEjC,QAAMC,IAAO,+BAA+BD,IAAQ;AAAA;AAEpD,EAAAE,EAAA,QAAgB,IAAI,OAAOF,GAAO,GAAG,GACrCE,EAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG,GAC5DA,EAAA,OAAe,IAAI,OAAOD,GAAM,GAAG,GACnCC,EAAA,UAAkB,IAAI,OAAOJ,GAAS,GAAG,GACzCI,EAAA,eAAuB,IAAI,OAAOH,GAAc,GAAG;AAEnD,QAAMI,IAAa,IAAI,OAAO,MAAMH,IAAQ,GAAG,GACzCI,IAAe,IAAI,OAAO,MAAMN,IAAU,GAAG,GAC7CO,IAAoB,IAAI,OAAO,wBAAwB;AAE7D,SAAAH,EAAA,YAAoB,gBAAAI,EAAA,SAAoBC,GAAK;AAC3C,WAAOJ,EAAW,KAAKI,CAAG;AAAA,EAC5B,GAFoB,cAIpBL,EAAA,cAAsB,gBAAAI,EAAA,SAAsBC,GAAK;AAC/C,WAAOH,EAAa,KAAKG,CAAG;AAAA,EAC9B,GAFsB,gBAItBL,EAAA,mBAA2B,gBAAAI,EAAA,SAA2BC,GAAK;AACzD,WAAOF,EAAkB,KAAKE,CAAG;AAAA,EACnC,GAF2B;;;","x_google_ignoreList":[0]}