asterui 0.10.2 → 0.11.0

package/dist/index103.js.map

@@ -1 +1 @@
-{"version":3,"file":"index103.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","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":";;;;AAIAA,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;AAQAD,IAAAA,EAAA,UAAkB,SAAkBE,GAAM;AACxC,aAAOA,KAAQ,QAAQA,MAAS,MAAM,CAAC,MAAMA,CAAI,KAAKA,KAAQ,KAAKA,KAAQ;AAAA,IAC7E,GASAF,EAAA,OAAe,SAAeG,GAAO;AACnC,aAAOH,EAAQ,QAAQG,CAAK,IAAI,SAASA,GAAO,EAAE,IAAI;AAAA,IACxD,GASAH,EAAA,eAAuB,SAAuBI,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,KAAUL,EAAc,MAAMM,IAAe,KACpEE,IAAUI,GACVN,IAAe,IAGjBM,IAAST,EAAK,IAAIQ,GAAKD,CAAG,GACtBE,MAAWH,IACbF,OAEIA,KAAgB,MAAGF,KAAUL,EAAc,MAAMO,IAAe,KACpEE,IAAUG,GACVL,IAAe;AAAA,QAEvB;AAEI,QAAID,KAAgB,MAAGD,KAAUL,EAAc,MAAMM,IAAe,KAChEC,KAAgB,MAAGF,KAAUL,EAAc,MAAMO,IAAe;AAAA,MACxE;AAEE,aAAOF;AAAA,IACT,GAOAN,EAAA,eAAuB,SAAuBI,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,IAASL,EAAc;AAAA,IAChC,GAQAD,EAAA,eAAuB,SAAuBI,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,IAASL,EAAc;AAAA,IAChC,GAUAD,EAAA,eAAuB,SAAuBI,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,IAE5DjB,EAAc;AAAA,IAC3B;AAUA,aAASmB,EAAWC,GAAaF,GAAGG,GAAG;AACrC,cAAQD,GAAW;AAAA,QACjB,KAAKrB,EAAQ,SAAS;AAAY,kBAAQmB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKtB,EAAQ,SAAS;AAAY,iBAAOmB,IAAI,MAAM;AAAA,QACnD,KAAKnB,EAAQ,SAAS;AAAY,iBAAOsB,IAAI,MAAM;AAAA,QACnD,KAAKtB,EAAQ,SAAS;AAAY,kBAAQmB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKtB,EAAQ,SAAS;AAAY,kBAAQ,KAAK,MAAMmB,IAAI,CAAC,IAAI,KAAK,MAAMG,IAAI,CAAC,KAAK,MAAM;AAAA,QACzF,KAAKtB,EAAQ,SAAS;AAAY,iBAAQmB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,MAAM;AAAA,QACvE,KAAKtB,EAAQ,SAAS;AAAY,kBAASmB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,KAAK,MAAM;AAAA,QAC7E,KAAKtB,EAAQ,SAAS;AAAY,kBAASmB,IAAIG,IAAK,KAAKH,IAAIG,KAAK,KAAK,MAAM;AAAA,QAE7E;AAAS,gBAAM,IAAI,MAAM,qBAAqBD,CAAW;AAAA,MAC7D;AAAA,IACA;AAQArB,IAAAA,EAAA,YAAoB,SAAoBuB,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,GAQAZ,EAAA,cAAsB,SAAsBI,GAAMoB,GAAiB;AACjE,YAAMC,IAAc,OAAO,KAAKzB,EAAQ,QAAQ,EAAE;AAClD,UAAI0B,IAAc,GACdC,IAAe;AAEnB,eAASC,IAAI,GAAGA,IAAIH,GAAaG,KAAK;AACpC,QAAAJ,EAAgBI,CAAC,GACjB5B,EAAQ,UAAU4B,GAAGxB,CAAI;AAGzB,cAAMyB,IACJ7B,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI;AAG3BJ,QAAAA,EAAQ,UAAU4B,GAAGxB,CAAI,GAErByB,IAAUF,MACZA,IAAeE,GACfH,IAAcE;AAAA,MAEpB;AAEE,aAAOF;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index103.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js"],"sourcesContent":["// can-promise has a crash in some versions of react native that dont have\n// standard global objects\n// https://github.com/soldair/node-qrcode/issues/157\n\nmodule.exports = function () {\n  return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then\n}\n"],"names":["canPromise"],"mappings":";;sBAIAA,IAAiB,WAAY;AAC3B,WAAO,OAAO,WAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU;AAAA,EACjF;;","x_google_ignoreList":[0]}

package/dist/index104.js

@@ -1,363 +1,155 @@
-import { __exports as u } from "./index119.js";
-import { __require as a } from "./index98.js";
-var c;
-function i() {
-  if (c) return u;
-  c = 1;
-  const e = a(), t = [
-    // L  M  Q  H
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    2,
-    2,
-    1,
-    2,
-    2,
-    4,
-    1,
-    2,
-    4,
-    4,
-    2,
-    4,
-    4,
-    4,
-    2,
-    4,
-    6,
-    5,
-    2,
-    4,
-    6,
-    6,
-    2,
-    5,
-    8,
-    8,
-    4,
-    5,
-    8,
-    8,
-    4,
-    5,
-    8,
-    11,
-    4,
-    8,
-    10,
-    11,
-    4,
-    9,
-    12,
-    16,
-    4,
-    9,
-    16,
-    16,
-    6,
-    10,
-    12,
-    18,
-    6,
-    10,
-    17,
-    16,
-    6,
-    11,
-    16,
-    19,
-    6,
-    13,
-    18,
-    21,
-    7,
-    14,
-    21,
-    25,
-    8,
-    16,
-    20,
-    25,
-    8,
-    17,
-    23,
-    25,
-    9,
-    17,
-    23,
-    34,
-    9,
-    18,
-    25,
-    30,
-    10,
-    20,
-    27,
-    32,
-    12,
-    21,
-    29,
-    35,
-    12,
-    23,
-    34,
-    37,
-    12,
-    25,
-    34,
-    40,
-    13,
-    26,
-    35,
-    42,
-    14,
-    28,
-    38,
-    45,
-    15,
-    29,
-    40,
-    48,
-    16,
-    31,
-    43,
-    51,
-    17,
-    33,
-    45,
-    54,
-    18,
-    35,
-    48,
-    57,
-    19,
-    37,
-    51,
-    60,
-    19,
-    38,
-    53,
-    63,
-    20,
-    40,
-    56,
-    66,
-    21,
-    43,
-    59,
-    70,
-    22,
-    45,
-    62,
-    74,
-    24,
-    47,
-    65,
-    77,
-    25,
-    49,
-    68,
-    81
-  ], o = [
-    // L  M  Q  H
-    7,
-    10,
-    13,
-    17,
-    10,
-    16,
-    22,
-    28,
-    15,
-    26,
-    36,
-    44,
-    20,
-    36,
-    52,
-    64,
-    26,
-    48,
-    72,
-    88,
-    36,
-    64,
-    96,
-    112,
-    40,
-    72,
-    108,
-    130,
-    48,
-    88,
-    132,
-    156,
-    60,
-    110,
-    160,
-    192,
-    72,
-    130,
-    192,
-    224,
-    80,
-    150,
-    224,
-    264,
-    96,
-    176,
-    260,
-    308,
-    104,
-    198,
-    288,
-    352,
-    120,
-    216,
-    320,
-    384,
-    132,
-    240,
-    360,
-    432,
-    144,
-    280,
-    408,
-    480,
-    168,
-    308,
-    448,
-    532,
-    180,
-    338,
-    504,
-    588,
-    196,
-    364,
-    546,
-    650,
-    224,
-    416,
-    600,
-    700,
-    224,
-    442,
-    644,
-    750,
-    252,
-    476,
-    690,
-    816,
-    270,
-    504,
-    750,
-    900,
-    300,
-    560,
-    810,
-    960,
-    312,
-    588,
-    870,
-    1050,
-    336,
-    644,
-    952,
-    1110,
-    360,
-    700,
-    1020,
-    1200,
-    390,
-    728,
-    1050,
-    1260,
-    420,
-    784,
-    1140,
-    1350,
-    450,
-    812,
-    1200,
-    1440,
-    480,
-    868,
-    1290,
-    1530,
-    510,
-    924,
-    1350,
-    1620,
-    540,
-    980,
-    1440,
-    1710,
-    570,
-    1036,
-    1530,
-    1800,
-    570,
-    1064,
-    1590,
-    1890,
-    600,
-    1120,
-    1680,
-    1980,
-    630,
-    1204,
-    1770,
-    2100,
-    660,
-    1260,
-    1860,
-    2220,
-    720,
-    1316,
-    1950,
-    2310,
-    750,
-    1372,
-    2040,
-    2430
-  ];
-  return u.getBlocksCount = function(r, n) {
-    switch (n) {
-      case e.L:
-        return t[(r - 1) * 4 + 0];
-      case e.M:
-        return t[(r - 1) * 4 + 1];
-      case e.Q:
-        return t[(r - 1) * 4 + 2];
-      case e.H:
-        return t[(r - 1) * 4 + 3];
-      default:
-        return;
+import { __exports as M } from "./index107.js";
+import { __require as Y } from "./index108.js";
+import { __require as Z } from "./index109.js";
+import { __require as $ } from "./index110.js";
+import { __require as x } from "./index111.js";
+import { __require as v } from "./index112.js";
+import { __require as ee } from "./index113.js";
+import { __require as te } from "./index114.js";
+import { __require as oe } from "./index115.js";
+import { __require as re } from "./index116.js";
+import { __require as ne } from "./index117.js";
+import { __require as se } from "./index118.js";
+import { __require as ie } from "./index119.js";
+import { __require as ue } from "./index120.js";
+var F;
+function Be() {
+  if (F) return M;
+  F = 1;
+  const g = Y(), q = Z(), A = $(), k = x(), P = v(), D = ee(), _ = te(), h = oe(), V = re(), w = ne(), R = se(), G = ie(), C = ue();
+  function Q(r, u) {
+    const n = r.size, e = D.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));
     }
-  }, u.getTotalCodewordsCount = function(r, n) {
-    switch (n) {
-      case e.L:
-        return o[(r - 1) * 4 + 0];
-      case e.M:
-        return o[(r - 1) * 4 + 1];
-      case e.Q:
-        return o[(r - 1) * 4 + 2];
-      case e.H:
-        return o[(r - 1) * 4 + 3];
-      default:
-        return;
+  }
+  function U(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);
     }
-  }, u;
+  }
+  function J(r, u) {
+    const n = P.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);
+    }
+  }
+  function N(r, u) {
+    const n = r.size, e = w.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);
+  }
+  function b(r, u, n) {
+    const e = r.size, c = R.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);
+  }
+  function L(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 a = !1;
+            o < u.length && (a = (u[o] >>> t & 1) === 1), r.set(c, i - s, a), t--, t === -1 && (o++, t = 7);
+          }
+        if (c += e, c < 0 || n <= c) {
+          c -= e, e = -e;
+          break;
+        }
+      }
+  }
+  function j(r, u, n) {
+    const e = new A();
+    n.forEach(function(s) {
+      e.put(s.mode.bit, 4), e.put(s.getLength(), G.getCharCountIndicator(s.mode, r)), s.write(e);
+    });
+    const c = g.getSymbolTotalCodewords(r), t = h.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 H(e, r, u);
+  }
+  function H(r, u, n) {
+    const e = g.getSymbolTotalCodewords(u), c = h.getTotalCodewordsCount(u, n), t = e - c, o = h.getBlocksCount(u, n), i = e % o, s = o - i, a = Math.floor(e / o), m = Math.floor(t / o), O = m + 1, E = a - m, W = new V(E);
+    let B = 0;
+    const p = new Array(o), z = new Array(o);
+    let S = 0;
+    const X = new Uint8Array(r.buffer);
+    for (let d = 0; d < o; d++) {
+      const y = d < s ? m : O;
+      p[d] = X.slice(B, B + y), z[d] = W.encode(p[d]), B += y, S = Math.max(S, y);
+    }
+    const I = new Uint8Array(e);
+    let T = 0, f, l;
+    for (f = 0; f < S; f++)
+      for (l = 0; l < o; l++)
+        f < p[l].length && (I[T++] = p[l][f]);
+    for (f = 0; f < E; f++)
+      for (l = 0; l < o; l++)
+        I[T++] = z[l][f];
+    return I;
+  }
+  function K(r, u, n, e) {
+    let c;
+    if (Array.isArray(r))
+      c = C.fromArray(r);
+    else if (typeof r == "string") {
+      let a = u;
+      if (!a) {
+        const m = C.rawSplit(r);
+        a = w.getBestVersionForData(m, n);
+      }
+      c = C.fromString(r, a || 40);
+    } else
+      throw new Error("Invalid data");
+    const t = w.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 = j(u, n, c), i = g.getSymbolSize(u), s = new k(i);
+    return Q(s, u), U(s), J(s, u), b(s, n, 0), u >= 7 && N(s, u), L(s, o), isNaN(e) && (e = _.getBestMask(
+      s,
+      b.bind(null, s, n)
+    )), _.applyMask(e, s), b(s, n, e), {
+      modules: s,
+      version: u,
+      errorCorrectionLevel: n,
+      maskPattern: e,
+      segments: c
+    };
+  }
+  return M.create = function(u, n) {
+    if (typeof u > "u" || u === "")
+      throw new Error("No input text");
+    let e = q.M, c, t;
+    return typeof n < "u" && (e = q.from(n.errorCorrectionLevel, q.M), c = w.from(n.version), t = _.from(n.maskPattern), n.toSJISFunc && g.setToSJISFunction(n.toSJISFunc)), K(u, c, e, t);
+  }, M;
 }
 export {
-  i as __require
+  Be as __require
 };
 //# sourceMappingURL=index104.js.map

package/dist/index104.js.map

@@ -1 +1 @@
-{"version":3,"file":"index104.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":["ECLevel","require$$0","EC_BLOCKS_TABLE","EC_CODEWORDS_TABLE","errorCorrectionCode","version","errorCorrectionLevel"],"mappings":";;;;;;AAAA,QAAMA,IAAUC,EAAA,GAEVC,IAAkB;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,KAGRC,IAAqB;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;AAWnB,SAAAC,EAAA,iBAAyB,SAAyBC,GAASC,GAAsB;AAC/E,YAAQA,GAAoB;AAAA,MAC1B,KAAKN,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C;AACE;AAAA;EAEN,GAUAD,EAAA,yBAAiC,SAAiCC,GAASC,GAAsB;AAC/F,YAAQA,GAAoB;AAAA,MAC1B,KAAKN,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD;AACE;AAAA;EAEN;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index104.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","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,EAAA,GACZC,IAAmBC,EAAA,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;AASA,WAASC,EAAoBT,GAAQ;AACnC,UAAME,IAAOF,EAAO;AAEpB,aAASO,IAAI,GAAGA,IAAIL,IAAO,GAAGK,KAAK;AACjC,YAAMG,IAAQH,IAAI,MAAM;AACxB,MAAAP,EAAO,IAAIO,GAAG,GAAGG,GAAO,EAAI,GAC5BV,EAAO,IAAI,GAAGO,GAAGG,GAAO,EAAI;AAAA,IAChC;AAAA,EACA;AAUA,WAASC,EAAuBX,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;AAQA,WAASI,EAAkBZ,GAAQC,GAAS;AAC1C,UAAMC,IAAOF,EAAO,MACda,IAAOtB,EAAQ,eAAeU,CAAO;AAC3C,QAAII,GAAKC,GAAKQ;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI;AACtB,MAAAT,IAAM,KAAK,MAAM,IAAI,CAAC,GACtBC,IAAM,IAAI,IAAIJ,IAAO,IAAI,GACzBY,KAAQD,KAAQ,IAAK,OAAO,GAE5Bb,EAAO,IAAIK,GAAKC,GAAKQ,GAAK,EAAI,GAC9Bd,EAAO,IAAIM,GAAKD,GAAKS,GAAK,EAAI;AAAA,EAElC;AASA,WAASC,EAAiBf,GAAQgB,GAAsBC,GAAa;AACnE,UAAMf,IAAOF,EAAO,MACda,IAAOpB,EAAW,eAAeuB,GAAsBC,CAAW;AACxE,QAAIb,GAAGU;AAEP,SAAKV,IAAI,GAAGA,IAAI,IAAIA;AAClB,MAAAU,KAAQD,KAAQT,IAAK,OAAO,GAGxBA,IAAI,IACNJ,EAAO,IAAII,GAAG,GAAGU,GAAK,EAAI,IACjBV,IAAI,IACbJ,EAAO,IAAII,IAAI,GAAG,GAAGU,GAAK,EAAI,IAE9Bd,EAAO,IAAIE,IAAO,KAAKE,GAAG,GAAGU,GAAK,EAAI,GAIpCV,IAAI,IACNJ,EAAO,IAAI,GAAGE,IAAOE,IAAI,GAAGU,GAAK,EAAI,IAC5BV,IAAI,IACbJ,EAAO,IAAI,GAAG,KAAKI,IAAI,IAAI,GAAGU,GAAK,EAAI,IAEvCd,EAAO,IAAI,GAAG,KAAKI,IAAI,GAAGU,GAAK,EAAI;AAKvC,IAAAd,EAAO,IAAIE,IAAO,GAAG,GAAG,GAAG,EAAI;AAAA,EACjC;AAQA,WAASgB,EAAWlB,GAAQmB,GAAM;AAChC,UAAMjB,IAAOF,EAAO;AACpB,QAAIoB,IAAM,IACNf,IAAMH,IAAO,GACbmB,IAAW,GACXC,IAAY;AAEhB,aAAShB,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,gBAAIe,IAAO;AAEX,YAAID,IAAYH,EAAK,WACnBI,KAAUJ,EAAKG,CAAS,MAAMD,IAAY,OAAO,IAGnDrB,EAAO,IAAIK,GAAKC,IAAME,GAAGe,CAAI,GAC7BF,KAEIA,MAAa,OACfC,KACAD,IAAW;AAAA,UAEvB;AAKM,YAFAhB,KAAOe,GAEHf,IAAM,KAAKH,KAAQG,GAAK;AAC1B,UAAAA,KAAOe,GACPA,IAAM,CAACA;AACP;AAAA,QACR;AAAA,MACA;AAAA,EAEA;AAUA,WAASI,EAAYvB,GAASe,GAAsBS,GAAU;AAE5D,UAAMC,IAAS,IAAIjD,EAAS;AAE5B,IAAAgD,EAAS,QAAQ,SAAUN,GAAM;AAE/B,MAAAO,EAAO,IAAIP,EAAK,KAAK,KAAK,CAAC,GAS3BO,EAAO,IAAIP,EAAK,UAAS,GAAIxB,EAAK,sBAAsBwB,EAAK,MAAMlB,CAAO,CAAC,GAG3EkB,EAAK,MAAMO,CAAM;AAAA,IACrB,CAAG;AAGD,UAAMC,IAAiBtD,EAAM,wBAAwB4B,CAAO,GACtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,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,aAAStB,IAAI,GAAGA,IAAI0B,GAAe1B;AACjC,MAAAsB,EAAO,IAAItB,IAAI,IAAI,KAAO,KAAM,CAAC;AAGnC,WAAO2B,EAAgBL,GAAQzB,GAASe,CAAoB;AAAA,EAC9D;AAWA,WAASe,EAAiBC,GAAW/B,GAASe,GAAsB;AAElE,UAAMW,IAAiBtD,EAAM,wBAAwB4B,CAAO,GAGtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAG9EiB,IAAqBN,IAAiBC,GAGtCM,IAAgB/C,EAAO,eAAec,GAASe,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,IAAIpD,EAAmBmD,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,GACR5C,GAAGG;AAGP,SAAKH,IAAI,GAAGA,IAAIyC,GAAazC;AAC3B,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAIH,IAAIuC,EAAOpC,CAAC,EAAE,WAChBY,EAAK6B,GAAO,IAAIL,EAAOpC,CAAC,EAAEH,CAAC;AAMjC,SAAKA,IAAI,GAAGA,IAAIoC,GAASpC;AACvB,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAAY,EAAK6B,GAAO,IAAIJ,EAAOrC,CAAC,EAAEH,CAAC;AAI/B,WAAOe;AAAA,EACT;AAWA,WAAS8B,EAAc9B,GAAMlB,GAASe,GAAsBC,GAAa;AACvE,QAAIQ;AAEJ,QAAI,MAAM,QAAQN,CAAI;AACpB,MAAAM,IAAW5B,EAAS,UAAUsB,CAAI;AAAA,aACzB,OAAOA,KAAS,UAAU;AACnC,UAAI+B,IAAmBjD;AAEvB,UAAI,CAACiD,GAAkB;AACrB,cAAMC,IAActD,EAAS,SAASsB,CAAI;AAG1C,QAAA+B,IAAmB3D,EAAQ,sBAAsB4D,GAAanC,CAAoB;AAAA,MACxF;AAII,MAAAS,IAAW5B,EAAS,WAAWsB,GAAM+B,KAAoB,EAAE;AAAA,IAC/D;AACI,YAAM,IAAI,MAAM,cAAc;AAIhC,UAAME,IAAc7D,EAAQ,sBAAsBkC,GAAUT,CAAoB;AAGhF,QAAI,CAACoC;AACH,YAAM,IAAI,MAAM,yDAAyD;AAI3E,QAAI,CAACnD;AACH,MAAAA,IAAUmD;AAAA,aAGDnD,IAAUmD;AACnB,YAAM,IAAI;AAAA,QAAM;AAAA;AAAA,uDAE0CA,IAAc;AAAA;AAAA,MAC5E;AAGE,UAAMC,IAAW7B,EAAWvB,GAASe,GAAsBS,CAAQ,GAG7D6B,IAAcjF,EAAM,cAAc4B,CAAO,GACzCsD,IAAU,IAAI5E,EAAU2E,CAAW;AAGzC,WAAAvD,EAAmBwD,GAAStD,CAAO,GACnCQ,EAAmB8C,CAAO,GAC1B5C,EAAsB4C,GAAStD,CAAO,GAMtCc,EAAgBwC,GAASvC,GAAsB,CAAC,GAE5Cf,KAAW,KACbW,EAAiB2C,GAAStD,CAAO,GAInCiB,EAAUqC,GAASF,CAAQ,GAEvB,MAAMpC,CAAW,MAEnBA,IAAchC,EAAY;AAAA,MAAYsE;AAAA,MACpCxC,EAAgB,KAAK,MAAMwC,GAASvC,CAAoB;AAAA,IAAC,IAI7D/B,EAAY,UAAUgC,GAAasC,CAAO,GAG1CxC,EAAgBwC,GAASvC,GAAsBC,CAAW,GAEnD;AAAA,MACL,SAASsC;AAAA,MACT,SAAStD;AAAA,MACT,sBAAsBe;AAAA,MACtB,aAAaC;AAAA,MACb,UAAUQ;AAAA,IACd;AAAA,EACA;AAWA,SAAA+B,EAAA,SAAiB,SAAiBrC,GAAMsC,GAAS;AAC/C,QAAI,OAAOtC,IAAS,OAAeA,MAAS;AAC1C,YAAM,IAAI,MAAM,eAAe;AAGjC,QAAIH,IAAuBzC,EAAQ,GAC/B0B,GACAyD;AAEJ,WAAI,OAAOD,IAAY,QAErBzC,IAAuBzC,EAAQ,KAAKkF,EAAQ,sBAAsBlF,EAAQ,CAAC,GAC3E0B,IAAUV,EAAQ,KAAKkE,EAAQ,OAAO,GACtCC,IAAOzE,EAAY,KAAKwE,EAAQ,WAAW,GAEvCA,EAAQ,cACVpF,EAAM,kBAAkBoF,EAAQ,UAAU,IAIvCR,EAAa9B,GAAMlB,GAASe,GAAsB0C,CAAI;AAAA,EAC/D;;","x_google_ignoreList":[0]}

package/dist/index105.js

@@ -1,28 +1,33 @@
-import { __require as h } from "./index120.js";
-var o, a;
-function g() {
-  if (a) return o;
-  a = 1;
-  const t = h();
-  function n(i) {
-    this.genPoly = void 0, this.degree = i, this.degree && this.initialize(this.degree);
-  }
-  return n.prototype.initialize = function(e) {
-    this.degree = e, this.genPoly = t.generateECPolynomial(this.degree);
-  }, n.prototype.encode = function(e) {
-    if (!this.genPoly)
-      throw new Error("Encoder not initialized");
-    const d = new Uint8Array(e.length + this.degree);
-    d.set(e);
-    const r = t.mod(d, this.genPoly), s = this.degree - r.length;
-    if (s > 0) {
-      const l = new Uint8Array(this.degree);
-      return l.set(r, s), l;
+import { __exports as a } from "./index121.js";
+import { __require as h } from "./index122.js";
+var p;
+function C() {
+  return p ? a : (p = 1, (function(u) {
+    const f = h();
+    function m(d, r, e) {
+      d.clearRect(0, 0, r.width, r.height), r.style || (r.style = {}), r.height = e, r.width = e, r.style.height = e + "px", r.style.width = e + "px";
     }
-    return r;
-  }, o = n, o;
+    function s() {
+      try {
+        return document.createElement("canvas");
+      } catch {
+        throw new Error("You need to specify a canvas element");
+      }
+    }
+    u.render = function(r, e, l) {
+      let t = l, n = e;
+      typeof t > "u" && (!e || !e.getContext) && (t = e, e = void 0), e || (n = s()), t = f.getOptions(t);
+      const i = f.getImageWidth(r.modules.size, t), o = n.getContext("2d"), g = o.createImageData(i, i);
+      return f.qrToImageData(g.data, r, t), m(o, n, i), o.putImageData(g, 0, 0), n;
+    }, u.renderToDataURL = function(r, e, l) {
+      let t = l;
+      typeof t > "u" && (!e || !e.getContext) && (t = e, e = void 0), t || (t = {});
+      const n = u.render(r, e, t), i = t.type || "image/png", o = t.rendererOpts || {};
+      return n.toDataURL(i, o.quality);
+    };
+  })(a), a);
 }
 export {
-  g as __require
+  C as __require
 };
 //# sourceMappingURL=index105.js.map