@ozdao/prometheus-framework 0.2.199 → 0.2.200

package/dist/node_modules/qrcode/lib/core/mask-pattern.js

@@ -1,6 +1,6 @@
-import { __exports as T } from "../../../../_virtual/mask-pattern.js";
-(function(r) {
-  r.Patterns = {
+import { __exports as maskPattern } from "../../../../_virtual/mask-pattern.js";
+(function(exports) {
+  exports.Patterns = {
     PATTERN000: 0,
     PATTERN001: 1,
     PATTERN010: 2,
@@ -10,87 +10,131 @@ import { __exports as T } from "../../../../_virtual/mask-pattern.js";
     PATTERN110: 6,
     PATTERN111: 7
   };
-  const N = {
+  const PenaltyScores = {
     N1: 3,
     N2: 3,
     N3: 40,
     N4: 10
   };
-  r.isValid = function(t) {
-    return t != null && t !== "" && !isNaN(t) && t >= 0 && t <= 7;
-  }, r.from = function(t) {
-    return r.isValid(t) ? parseInt(t, 10) : void 0;
-  }, r.getPenaltyN1 = function(t) {
-    const l = t.size;
-    let s = 0, n = 0, e = 0, o = null, P = null;
-    for (let u = 0; u < l; u++) {
-      n = e = 0, o = P = null;
-      for (let c = 0; c < l; c++) {
-        let f = t.get(u, c);
-        f === o ? n++ : (n >= 5 && (s += N.N1 + (n - 5)), o = f, n = 1), f = t.get(c, u), f === P ? e++ : (e >= 5 && (s += N.N1 + (e - 5)), P = f, e = 1);
+  exports.isValid = function isValid(mask) {
+    return mask != null && mask !== "" && !isNaN(mask) && mask >= 0 && mask <= 7;
+  };
+  exports.from = function from(value) {
+    return exports.isValid(value) ? parseInt(value, 10) : void 0;
+  };
+  exports.getPenaltyN1 = function getPenaltyN1(data) {
+    const size = data.size;
+    let points = 0;
+    let sameCountCol = 0;
+    let sameCountRow = 0;
+    let lastCol = null;
+    let lastRow = null;
+    for (let row = 0; row < size; row++) {
+      sameCountCol = sameCountRow = 0;
+      lastCol = lastRow = null;
+      for (let col = 0; col < size; col++) {
+        let module = data.get(row, col);
+        if (module === lastCol) {
+          sameCountCol++;
+        } else {
+          if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+          lastCol = module;
+          sameCountCol = 1;
+        }
+        module = data.get(col, row);
+        if (module === lastRow) {
+          sameCountRow++;
+        } else {
+          if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+          lastRow = module;
+          sameCountRow = 1;
+        }
+      }
+      if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+      if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+    }
+    return points;
+  };
+  exports.getPenaltyN2 = function getPenaltyN2(data) {
+    const size = data.size;
+    let points = 0;
+    for (let row = 0; row < size - 1; row++) {
+      for (let col = 0; col < size - 1; col++) {
+        const last = data.get(row, col) + data.get(row, col + 1) + data.get(row + 1, col) + data.get(row + 1, col + 1);
+        if (last === 4 || last === 0) points++;
       }
-      n >= 5 && (s += N.N1 + (n - 5)), e >= 5 && (s += N.N1 + (e - 5));
     }
-    return s;
-  }, r.getPenaltyN2 = function(t) {
-    const l = t.size;
-    let s = 0;
-    for (let n = 0; n < l - 1; n++)
-      for (let e = 0; e < l - 1; e++) {
-        const o = t.get(n, e) + t.get(n, e + 1) + t.get(n + 1, e) + t.get(n + 1, e + 1);
-        (o === 4 || o === 0) && s++;
+    return points * PenaltyScores.N2;
+  };
+  exports.getPenaltyN3 = function getPenaltyN3(data) {
+    const size = data.size;
+    let points = 0;
+    let bitsCol = 0;
+    let bitsRow = 0;
+    for (let row = 0; row < size; row++) {
+      bitsCol = bitsRow = 0;
+      for (let col = 0; col < size; col++) {
+        bitsCol = bitsCol << 1 & 2047 | data.get(row, col);
+        if (col >= 10 && (bitsCol === 1488 || bitsCol === 93)) points++;
+        bitsRow = bitsRow << 1 & 2047 | data.get(col, row);
+        if (col >= 10 && (bitsRow === 1488 || bitsRow === 93)) points++;
       }
-    return s * N.N2;
-  }, r.getPenaltyN3 = function(t) {
-    const l = t.size;
-    let s = 0, n = 0, e = 0;
-    for (let o = 0; o < l; o++) {
-      n = e = 0;
-      for (let P = 0; P < l; P++)
-        n = n << 1 & 2047 | t.get(o, P), P >= 10 && (n === 1488 || n === 93) && s++, e = e << 1 & 2047 | t.get(P, o), P >= 10 && (e === 1488 || e === 93) && s++;
     }
-    return s * N.N3;
-  }, r.getPenaltyN4 = function(t) {
-    let l = 0;
-    const s = t.data.length;
-    for (let e = 0; e < s; e++) l += t.data[e];
-    return Math.abs(Math.ceil(l * 100 / s / 5) - 10) * N.N4;
+    return points * PenaltyScores.N3;
   };
-  function a(i, t, l) {
-    switch (i) {
-      case r.Patterns.PATTERN000:
-        return (t + l) % 2 === 0;
-      case r.Patterns.PATTERN001:
-        return t % 2 === 0;
-      case r.Patterns.PATTERN010:
-        return l % 3 === 0;
-      case r.Patterns.PATTERN011:
-        return (t + l) % 3 === 0;
-      case r.Patterns.PATTERN100:
-        return (Math.floor(t / 2) + Math.floor(l / 3)) % 2 === 0;
-      case r.Patterns.PATTERN101:
-        return t * l % 2 + t * l % 3 === 0;
-      case r.Patterns.PATTERN110:
-        return (t * l % 2 + t * l % 3) % 2 === 0;
-      case r.Patterns.PATTERN111:
-        return (t * l % 3 + (t + l) % 2) % 2 === 0;
+  exports.getPenaltyN4 = function getPenaltyN4(data) {
+    let darkCount = 0;
+    const modulesCount = data.data.length;
+    for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
+    const k = Math.abs(Math.ceil(darkCount * 100 / modulesCount / 5) - 10);
+    return k * PenaltyScores.N4;
+  };
+  function getMaskAt(maskPattern2, i, j) {
+    switch (maskPattern2) {
+      case exports.Patterns.PATTERN000:
+        return (i + j) % 2 === 0;
+      case exports.Patterns.PATTERN001:
+        return i % 2 === 0;
+      case exports.Patterns.PATTERN010:
+        return j % 3 === 0;
+      case exports.Patterns.PATTERN011:
+        return (i + j) % 3 === 0;
+      case exports.Patterns.PATTERN100:
+        return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0;
+      case exports.Patterns.PATTERN101:
+        return i * j % 2 + i * j % 3 === 0;
+      case exports.Patterns.PATTERN110:
+        return (i * j % 2 + i * j % 3) % 2 === 0;
+      case exports.Patterns.PATTERN111:
+        return (i * j % 3 + (i + j) % 2) % 2 === 0;
       default:
-        throw new Error("bad maskPattern:" + i);
+        throw new Error("bad maskPattern:" + maskPattern2);
     }
   }
-  r.applyMask = function(t, l) {
-    const s = l.size;
-    for (let n = 0; n < s; n++)
-      for (let e = 0; e < s; e++)
-        l.isReserved(e, n) || l.xor(e, n, a(t, e, n));
-  }, r.getBestMask = function(t, l) {
-    const s = Object.keys(r.Patterns).length;
-    let n = 0, e = 1 / 0;
-    for (let o = 0; o < s; o++) {
-      l(o), r.applyMask(o, t);
-      const P = r.getPenaltyN1(t) + r.getPenaltyN2(t) + r.getPenaltyN3(t) + r.getPenaltyN4(t);
-      r.applyMask(o, t), P < e && (e = P, n = o);
+  exports.applyMask = function applyMask(pattern, data) {
+    const size = data.size;
+    for (let col = 0; col < size; col++) {
+      for (let row = 0; row < size; row++) {
+        if (data.isReserved(row, col)) continue;
+        data.xor(row, col, getMaskAt(pattern, row, col));
+      }
+    }
+  };
+  exports.getBestMask = function getBestMask(data, setupFormatFunc) {
+    const numPatterns = Object.keys(exports.Patterns).length;
+    let bestPattern = 0;
+    let lowerPenalty = Infinity;
+    for (let p = 0; p < numPatterns; p++) {
+      setupFormatFunc(p);
+      exports.applyMask(p, data);
+      const penalty = exports.getPenaltyN1(data) + exports.getPenaltyN2(data) + exports.getPenaltyN3(data) + exports.getPenaltyN4(data);
+      exports.applyMask(p, data);
+      if (penalty < lowerPenalty) {
+        lowerPenalty = penalty;
+        bestPattern = p;
+      }
     }
-    return n;
+    return bestPattern;
   };
-})(T);
+})(maskPattern);
+//# sourceMappingURL=mask-pattern.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mask-pattern.js","sources":["../../../../../../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":["maskPattern"],"mappings":";;AAIA,UAAmB,WAAA;AAAA,IACjB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,EACb;AAMD,QAAM,gBAAgB;AAAA,IACpB,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACL;AAQD,UAAA,UAAkB,SAAS,QAAS,MAAM;AACxC,WAAO,QAAQ,QAAQ,SAAS,MAAM,CAAC,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ;AAAA,EAC5E;AASD,UAAA,OAAe,SAAS,KAAM,OAAO;AACnC,WAAO,QAAQ,QAAQ,KAAK,IAAI,SAAS,OAAO,EAAE,IAAI;AAAA,EACvD;AASD,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AACb,QAAI,eAAe;AACnB,QAAI,eAAe;AACnB,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,qBAAe,eAAe;AAC9B,gBAAU,UAAU;AAEpB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAI,SAAS,KAAK,IAAI,KAAK,GAAG;AAC9B,YAAI,WAAW,SAAS;AACtB;AAAA,QACR,OAAa;AACL,cAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,oBAAU;AACV,yBAAe;AAAA,QAChB;AAED,iBAAS,KAAK,IAAI,KAAK,GAAG;AAC1B,YAAI,WAAW,SAAS;AACtB;AAAA,QACR,OAAa;AACL,cAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,oBAAU;AACV,yBAAe;AAAA,QAChB;AAAA,MACF;AAED,UAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,UAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AAAA,IACrE;AAED,WAAO;AAAA,EACR;AAOD,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AAEb,aAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,eAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,cAAM,OAAO,KAAK,IAAI,KAAK,GAAG,IAC5B,KAAK,IAAI,KAAK,MAAM,CAAC,IACrB,KAAK,IAAI,MAAM,GAAG,GAAG,IACrB,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC;AAE3B,YAAI,SAAS,KAAK,SAAS,EAAG;AAAA,MAC/B;AAAA,IACF;AAED,WAAO,SAAS,cAAc;AAAA,EAC/B;AAQD,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AACb,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,gBAAU,UAAU;AACpB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,kBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAE3D,kBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAAA,MAC5D;AAAA,IACF;AAED,WAAO,SAAS,cAAc;AAAA,EAC/B;AAUD,UAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,QAAI,YAAY;AAChB,UAAM,eAAe,KAAK,KAAK;AAE/B,aAAS,IAAI,GAAG,IAAI,cAAc,IAAK,cAAa,KAAK,KAAK,CAAC;AAE/D,UAAM,IAAI,KAAK,IAAI,KAAK,KAAM,YAAY,MAAM,eAAgB,CAAC,IAAI,EAAE;AAEvE,WAAO,IAAI,cAAc;AAAA,EAC1B;AAUD,WAAS,UAAWA,cAAa,GAAG,GAAG;AACrC,YAAQA,cAAW;AAAA,MACjB,KAAK,QAAQ,SAAS;AAAY,gBAAQ,IAAI,KAAK,MAAM;AAAA,MACzD,KAAK,QAAQ,SAAS;AAAY,eAAO,IAAI,MAAM;AAAA,MACnD,KAAK,QAAQ,SAAS;AAAY,eAAO,IAAI,MAAM;AAAA,MACnD,KAAK,QAAQ,SAAS;AAAY,gBAAQ,IAAI,KAAK,MAAM;AAAA,MACzD,KAAK,QAAQ,SAAS;AAAY,gBAAQ,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM;AAAA,MACzF,KAAK,QAAQ,SAAS;AAAY,eAAQ,IAAI,IAAK,IAAK,IAAI,IAAK,MAAM;AAAA,MACvE,KAAK,QAAQ,SAAS;AAAY,gBAAS,IAAI,IAAK,IAAK,IAAI,IAAK,KAAK,MAAM;AAAA,MAC7E,KAAK,QAAQ,SAAS;AAAY,gBAAS,IAAI,IAAK,KAAK,IAAI,KAAK,KAAK,MAAM;AAAA,MAE7E;AAAS,cAAM,IAAI,MAAM,qBAAqBA,YAAW;AAAA,IAC1D;AAAA,EACF;AAQD,UAAA,YAAoB,SAAS,UAAW,SAAS,MAAM;AACrD,UAAM,OAAO,KAAK;AAElB,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAI,KAAK,WAAW,KAAK,GAAG,EAAG;AAC/B,aAAK,IAAI,KAAK,KAAK,UAAU,SAAS,KAAK,GAAG,CAAC;AAAA,MAChD;AAAA,IACF;AAAA,EACF;AAQD,UAAA,cAAsB,SAAS,YAAa,MAAM,iBAAiB;AACjE,UAAM,cAAc,OAAO,KAAK,QAAQ,QAAQ,EAAE;AAClD,QAAI,cAAc;AAClB,QAAI,eAAe;AAEnB,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,sBAAgB,CAAC;AACjB,cAAQ,UAAU,GAAG,IAAI;AAGzB,YAAM,UACJ,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI;AAG3B,cAAQ,UAAU,GAAG,IAAI;AAEzB,UAAI,UAAU,cAAc;AAC1B,uBAAe;AACf,sBAAc;AAAA,MACf;AAAA,IACF;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}

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

@@ -1 +1,84 @@
-"use strict";const a=require("../../../../_virtual/mode.cjs");require("./version-check.cjs");require("./regex.cjs");const f=require("../../../../_virtual/version-check.cjs"),o=require("../../../../_virtual/regex.cjs");(function(r){const c=f.__exports,e=o.__exports;r.NUMERIC={id:"Numeric",bit:1,ccBits:[10,12,14]},r.ALPHANUMERIC={id:"Alphanumeric",bit:2,ccBits:[9,11,13]},r.BYTE={id:"Byte",bit:4,ccBits:[8,16,16]},r.KANJI={id:"Kanji",bit:8,ccBits:[8,10,12]},r.MIXED={bit:-1},r.getCharCountIndicator=function(i,n){if(!i.ccBits)throw new Error("Invalid mode: "+i);if(!c.isValid(n))throw new Error("Invalid version: "+n);return n>=1&&n<10?i.ccBits[0]:n<27?i.ccBits[1]:i.ccBits[2]},r.getBestModeForData=function(i){return e.testNumeric(i)?r.NUMERIC:e.testAlphanumeric(i)?r.ALPHANUMERIC:e.testKanji(i)?r.KANJI:r.BYTE},r.toString=function(i){if(i&&i.id)return i.id;throw new Error("Invalid mode")},r.isValid=function(i){return i&&i.bit&&i.ccBits};function u(t){if(typeof t!="string")throw new Error("Param is not a string");switch(t.toLowerCase()){case"numeric":return r.NUMERIC;case"alphanumeric":return r.ALPHANUMERIC;case"kanji":return r.KANJI;case"byte":return r.BYTE;default:throw new Error("Unknown mode: "+t)}}r.from=function(i,n){if(r.isValid(i))return i;try{return u(i)}catch{return n}}})(a.__exports);
+"use strict";
+const mode = require("../../../../_virtual/mode.cjs");
+require("./version-check.cjs");
+require("./regex.cjs");
+const versionCheck = require("../../../../_virtual/version-check.cjs");
+const regex = require("../../../../_virtual/regex.cjs");
+(function(exports2) {
+  const VersionCheck = versionCheck.__exports;
+  const Regex = regex.__exports;
+  exports2.NUMERIC = {
+    id: "Numeric",
+    bit: 1 << 0,
+    ccBits: [10, 12, 14]
+  };
+  exports2.ALPHANUMERIC = {
+    id: "Alphanumeric",
+    bit: 1 << 1,
+    ccBits: [9, 11, 13]
+  };
+  exports2.BYTE = {
+    id: "Byte",
+    bit: 1 << 2,
+    ccBits: [8, 16, 16]
+  };
+  exports2.KANJI = {
+    id: "Kanji",
+    bit: 1 << 3,
+    ccBits: [8, 10, 12]
+  };
+  exports2.MIXED = {
+    bit: -1
+  };
+  exports2.getCharCountIndicator = function getCharCountIndicator(mode2, version) {
+    if (!mode2.ccBits) throw new Error("Invalid mode: " + mode2);
+    if (!VersionCheck.isValid(version)) {
+      throw new Error("Invalid version: " + version);
+    }
+    if (version >= 1 && version < 10) return mode2.ccBits[0];
+    else if (version < 27) return mode2.ccBits[1];
+    return mode2.ccBits[2];
+  };
+  exports2.getBestModeForData = function getBestModeForData(dataStr) {
+    if (Regex.testNumeric(dataStr)) return exports2.NUMERIC;
+    else if (Regex.testAlphanumeric(dataStr)) return exports2.ALPHANUMERIC;
+    else if (Regex.testKanji(dataStr)) return exports2.KANJI;
+    else return exports2.BYTE;
+  };
+  exports2.toString = function toString(mode2) {
+    if (mode2 && mode2.id) return mode2.id;
+    throw new Error("Invalid mode");
+  };
+  exports2.isValid = function isValid(mode2) {
+    return mode2 && mode2.bit && mode2.ccBits;
+  };
+  function fromString(string) {
+    if (typeof string !== "string") {
+      throw new Error("Param is not a string");
+    }
+    const lcStr = string.toLowerCase();
+    switch (lcStr) {
+      case "numeric":
+        return exports2.NUMERIC;
+      case "alphanumeric":
+        return exports2.ALPHANUMERIC;
+      case "kanji":
+        return exports2.KANJI;
+      case "byte":
+        return exports2.BYTE;
+      default:
+        throw new Error("Unknown mode: " + string);
+    }
+  }
+  exports2.from = function from(value, defaultValue) {
+    if (exports2.isValid(value)) {
+      return value;
+    }
+    try {
+      return fromString(value);
+    } catch (e) {
+      return defaultValue;
+    }
+  };
+})(mode.__exports);
+//# sourceMappingURL=mode.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mode.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\n */\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["require$$0","require$$1","exports","mode"],"mappings":";;;;;;;AAAA,QAAM,eAAeA,aAA0B;AAC/C,QAAM,QAAQC,MAAkB;AAShC,EAAAC,SAAkB,UAAA;AAAA,IAChB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,EACpB;AAWD,EAAAA,SAAuB,eAAA;AAAA,IACrB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAOD,EAAAA,SAAe,OAAA;AAAA,IACb,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAWD,EAAAA,SAAgB,QAAA;AAAA,IACd,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAQD,EAAAA,SAAgB,QAAA;AAAA,IACd,KAAK;AAAA,EACN;AAUD,EAAAA,SAAA,wBAAgC,SAAS,sBAAuBC,OAAM,SAAS;AAC7E,QAAI,CAACA,MAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,KAAI;AAEzD,QAAI,CAAC,aAAa,QAAQ,OAAO,GAAG;AAClC,YAAM,IAAI,MAAM,sBAAsB,OAAO;AAAA,IAC9C;AAED,QAAI,WAAW,KAAK,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAAA,aAC7C,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAC3C,WAAOA,MAAK,OAAO,CAAC;AAAA,EACrB;AAQD,EAAAD,SAAA,qBAA6B,SAAS,mBAAoB,SAAS;AACjE,QAAI,MAAM,YAAY,OAAO,EAAG,QAAOA,SAAQ;AAAA,aACtC,MAAM,iBAAiB,OAAO,EAAG,QAAOA,SAAQ;AAAA,aAChD,MAAM,UAAU,OAAO,EAAG,QAAOA,SAAQ;AAAA,QAC7C,QAAOA,SAAQ;AAAA,EACrB;AAQD,EAAAA,SAAA,WAAmB,SAAS,SAAUC,OAAM;AAC1C,QAAIA,SAAQA,MAAK,GAAI,QAAOA,MAAK;AACjC,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AAQD,EAAAD,SAAA,UAAkB,SAAS,QAASC,OAAM;AACxC,WAAOA,SAAQA,MAAK,OAAOA,MAAK;AAAA,EACjC;AAQD,WAAS,WAAY,QAAQ;AAC3B,QAAI,OAAO,WAAW,UAAU;AAC9B,YAAM,IAAI,MAAM,uBAAuB;AAAA,IACxC;AAED,UAAM,QAAQ,OAAO,YAAa;AAElC,YAAQ,OAAK;AAAA,MACX,KAAK;AACH,eAAOD,SAAQ;AAAA,MACjB,KAAK;AACH,eAAOA,SAAQ;AAAA,MACjB,KAAK;AACH,eAAOA,SAAQ;AAAA,MACjB,KAAK;AACH,eAAOA,SAAQ;AAAA,MACjB;AACE,cAAM,IAAI,MAAM,mBAAmB,MAAM;AAAA,IAC5C;AAAA,EACF;AAUD,EAAAA,SAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,QAAIA,SAAQ,QAAQ,KAAK,GAAG;AAC1B,aAAO;AAAA,IACR;AAED,QAAI;AACF,aAAO,WAAW,KAAK;AAAA,IACxB,SAAQ,GAAG;AACV,aAAO;AAAA,IACR;AAAA,EACH;;","x_google_ignoreList":[0]}

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

@@ -1,64 +1,83 @@
-import { __exports as a } from "../../../../_virtual/mode.js";
+import { __exports as mode } from "../../../../_virtual/mode.js";
 import "./version-check.js";
 import "./regex.js";
-import { __exports as o } from "../../../../_virtual/version-check.js";
-import { __exports as f } from "../../../../_virtual/regex.js";
-(function(r) {
-  const e = o, c = f;
-  r.NUMERIC = {
+import { __exports as versionCheck } from "../../../../_virtual/version-check.js";
+import { __exports as regex } from "../../../../_virtual/regex.js";
+(function(exports) {
+  const VersionCheck = versionCheck;
+  const Regex = regex;
+  exports.NUMERIC = {
     id: "Numeric",
-    bit: 1,
+    bit: 1 << 0,
     ccBits: [10, 12, 14]
-  }, r.ALPHANUMERIC = {
+  };
+  exports.ALPHANUMERIC = {
     id: "Alphanumeric",
-    bit: 2,
+    bit: 1 << 1,
     ccBits: [9, 11, 13]
-  }, r.BYTE = {
+  };
+  exports.BYTE = {
     id: "Byte",
-    bit: 4,
+    bit: 1 << 2,
     ccBits: [8, 16, 16]
-  }, r.KANJI = {
+  };
+  exports.KANJI = {
     id: "Kanji",
-    bit: 8,
+    bit: 1 << 3,
     ccBits: [8, 10, 12]
-  }, r.MIXED = {
+  };
+  exports.MIXED = {
     bit: -1
-  }, r.getCharCountIndicator = function(i, n) {
-    if (!i.ccBits) throw new Error("Invalid mode: " + i);
-    if (!e.isValid(n))
-      throw new Error("Invalid version: " + n);
-    return n >= 1 && n < 10 ? i.ccBits[0] : n < 27 ? i.ccBits[1] : i.ccBits[2];
-  }, r.getBestModeForData = function(i) {
-    return c.testNumeric(i) ? r.NUMERIC : c.testAlphanumeric(i) ? r.ALPHANUMERIC : c.testKanji(i) ? r.KANJI : r.BYTE;
-  }, r.toString = function(i) {
-    if (i && i.id) return i.id;
+  };
+  exports.getCharCountIndicator = function getCharCountIndicator(mode2, version) {
+    if (!mode2.ccBits) throw new Error("Invalid mode: " + mode2);
+    if (!VersionCheck.isValid(version)) {
+      throw new Error("Invalid version: " + version);
+    }
+    if (version >= 1 && version < 10) return mode2.ccBits[0];
+    else if (version < 27) return mode2.ccBits[1];
+    return mode2.ccBits[2];
+  };
+  exports.getBestModeForData = function getBestModeForData(dataStr) {
+    if (Regex.testNumeric(dataStr)) return exports.NUMERIC;
+    else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC;
+    else if (Regex.testKanji(dataStr)) return exports.KANJI;
+    else return exports.BYTE;
+  };
+  exports.toString = function toString(mode2) {
+    if (mode2 && mode2.id) return mode2.id;
     throw new Error("Invalid mode");
-  }, r.isValid = function(i) {
-    return i && i.bit && i.ccBits;
   };
-  function u(t) {
-    if (typeof t != "string")
+  exports.isValid = function isValid(mode2) {
+    return mode2 && mode2.bit && mode2.ccBits;
+  };
+  function fromString(string) {
+    if (typeof string !== "string") {
       throw new Error("Param is not a string");
-    switch (t.toLowerCase()) {
+    }
+    const lcStr = string.toLowerCase();
+    switch (lcStr) {
       case "numeric":
-        return r.NUMERIC;
+        return exports.NUMERIC;
       case "alphanumeric":
-        return r.ALPHANUMERIC;
+        return exports.ALPHANUMERIC;
       case "kanji":
-        return r.KANJI;
+        return exports.KANJI;
       case "byte":
-        return r.BYTE;
+        return exports.BYTE;
       default:
-        throw new Error("Unknown mode: " + t);
+        throw new Error("Unknown mode: " + string);
     }
   }
-  r.from = function(i, n) {
-    if (r.isValid(i))
-      return i;
+  exports.from = function from(value, defaultValue) {
+    if (exports.isValid(value)) {
+      return value;
+    }
     try {
-      return u(i);
-    } catch {
-      return n;
+      return fromString(value);
+    } catch (e) {
+      return defaultValue;
     }
   };
-})(a);
+})(mode);
+//# sourceMappingURL=mode.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mode.js","sources":["../../../../../../node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\n */\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["require$$0","require$$1","mode"],"mappings":";;;;;;AAAA,QAAM,eAAeA;AACrB,QAAM,QAAQC;AASd,UAAkB,UAAA;AAAA,IAChB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,EACpB;AAWD,UAAuB,eAAA;AAAA,IACrB,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAOD,UAAe,OAAA;AAAA,IACb,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAWD,UAAgB,QAAA;AAAA,IACd,IAAI;AAAA,IACJ,KAAK,KAAK;AAAA,IACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,EACnB;AAQD,UAAgB,QAAA;AAAA,IACd,KAAK;AAAA,EACN;AAUD,UAAA,wBAAgC,SAAS,sBAAuBC,OAAM,SAAS;AAC7E,QAAI,CAACA,MAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,KAAI;AAEzD,QAAI,CAAC,aAAa,QAAQ,OAAO,GAAG;AAClC,YAAM,IAAI,MAAM,sBAAsB,OAAO;AAAA,IAC9C;AAED,QAAI,WAAW,KAAK,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAAA,aAC7C,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAC3C,WAAOA,MAAK,OAAO,CAAC;AAAA,EACrB;AAQD,UAAA,qBAA6B,SAAS,mBAAoB,SAAS;AACjE,QAAI,MAAM,YAAY,OAAO,EAAG,QAAO,QAAQ;AAAA,aACtC,MAAM,iBAAiB,OAAO,EAAG,QAAO,QAAQ;AAAA,aAChD,MAAM,UAAU,OAAO,EAAG,QAAO,QAAQ;AAAA,QAC7C,QAAO,QAAQ;AAAA,EACrB;AAQD,UAAA,WAAmB,SAAS,SAAUA,OAAM;AAC1C,QAAIA,SAAQA,MAAK,GAAI,QAAOA,MAAK;AACjC,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AAQD,UAAA,UAAkB,SAAS,QAASA,OAAM;AACxC,WAAOA,SAAQA,MAAK,OAAOA,MAAK;AAAA,EACjC;AAQD,WAAS,WAAY,QAAQ;AAC3B,QAAI,OAAO,WAAW,UAAU;AAC9B,YAAM,IAAI,MAAM,uBAAuB;AAAA,IACxC;AAED,UAAM,QAAQ,OAAO,YAAa;AAElC,YAAQ,OAAK;AAAA,MACX,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB;AACE,cAAM,IAAI,MAAM,mBAAmB,MAAM;AAAA,IAC5C;AAAA,EACF;AAUD,UAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,QAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1B,aAAO;AAAA,IACR;AAED,QAAI;AACF,aAAO,WAAW,KAAK;AAAA,IACxB,SAAQ,GAAG;AACV,aAAO;AAAA,IACR;AAAA,EACH;;","x_google_ignoreList":[0]}

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

@@ -1 +1,35 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("./mode.cjs");const s=require("../../../../_virtual/mode.cjs"),u=s.__exports;function n(i){this.mode=u.NUMERIC,this.data=i.toString()}n.getBitsLength=function(t){return 10*Math.floor(t/3)+(t%3?t%3*3+1:0)};n.prototype.getLength=function(){return this.data.length};n.prototype.getBitsLength=function(){return n.getBitsLength(this.data.length)};n.prototype.write=function(t){let e,r,a;for(e=0;e+3<=this.data.length;e+=3)r=this.data.substr(e,3),a=parseInt(r,10),t.put(a,10);const o=this.data.length-e;o>0&&(r=this.data.substr(e),a=parseInt(r,10),t.put(a,o*3+1))};var g=n;exports.numericData=g;
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("./mode.cjs");
+const mode = require("../../../../_virtual/mode.cjs");
+const Mode = mode.__exports;
+function NumericData(data) {
+  this.mode = Mode.NUMERIC;
+  this.data = data.toString();
+}
+NumericData.getBitsLength = function getBitsLength(length) {
+  return 10 * Math.floor(length / 3) + (length % 3 ? length % 3 * 3 + 1 : 0);
+};
+NumericData.prototype.getLength = function getLength() {
+  return this.data.length;
+};
+NumericData.prototype.getBitsLength = function getBitsLength2() {
+  return NumericData.getBitsLength(this.data.length);
+};
+NumericData.prototype.write = function write(bitBuffer) {
+  let i, group, value;
+  for (i = 0; i + 3 <= this.data.length; i += 3) {
+    group = this.data.substr(i, 3);
+    value = parseInt(group, 10);
+    bitBuffer.put(value, 10);
+  }
+  const remainingNum = this.data.length - i;
+  if (remainingNum > 0) {
+    group = this.data.substr(i);
+    value = parseInt(group, 10);
+    bitBuffer.put(value, remainingNum * 3 + 1);
+  }
+};
+var numericData = NumericData;
+exports.numericData = numericData;
+//# sourceMappingURL=numeric-data.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"numeric-data.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["require$$0","getBitsLength"],"mappings":";;;;AAAA,MAAM,OAAOA,KAAiB;AAE9B,SAAS,YAAa,MAAM;AAC1B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO,KAAK,SAAU;AAC7B;AAEA,YAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAChF;AAEA,YAAY,UAAU,YAAY,SAAS,YAAa;AACtD,SAAO,KAAK,KAAK;AACnB;AAEA,YAAY,UAAU,gBAAgB,SAASC,iBAAiB;AAC9D,SAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AACnD;AAEA,YAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,MAAI,GAAG,OAAO;AAId,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,YAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,QAAM,eAAe,KAAK,KAAK,SAAS;AACxC,MAAI,eAAe,GAAG;AACpB,YAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,EAC1C;AACH;AAEA,IAAA,cAAiB;;","x_google_ignoreList":[0]}

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

@@ -1,26 +1,35 @@
 import "./mode.js";
-import { __exports as s } from "../../../../_virtual/mode.js";
-const g = s;
-function n(i) {
-  this.mode = g.NUMERIC, this.data = i.toString();
+import { __exports as mode } from "../../../../_virtual/mode.js";
+const Mode = mode;
+function NumericData(data) {
+  this.mode = Mode.NUMERIC;
+  this.data = data.toString();
 }
-n.getBitsLength = function(t) {
-  return 10 * Math.floor(t / 3) + (t % 3 ? t % 3 * 3 + 1 : 0);
+NumericData.getBitsLength = function getBitsLength(length) {
+  return 10 * Math.floor(length / 3) + (length % 3 ? length % 3 * 3 + 1 : 0);
 };
-n.prototype.getLength = function() {
+NumericData.prototype.getLength = function getLength() {
   return this.data.length;
 };
-n.prototype.getBitsLength = function() {
-  return n.getBitsLength(this.data.length);
+NumericData.prototype.getBitsLength = function getBitsLength2() {
+  return NumericData.getBitsLength(this.data.length);
 };
-n.prototype.write = function(t) {
-  let e, r, a;
-  for (e = 0; e + 3 <= this.data.length; e += 3)
-    r = this.data.substr(e, 3), a = parseInt(r, 10), t.put(a, 10);
-  const o = this.data.length - e;
-  o > 0 && (r = this.data.substr(e), a = parseInt(r, 10), t.put(a, o * 3 + 1));
+NumericData.prototype.write = function write(bitBuffer) {
+  let i, group, value;
+  for (i = 0; i + 3 <= this.data.length; i += 3) {
+    group = this.data.substr(i, 3);
+    value = parseInt(group, 10);
+    bitBuffer.put(value, 10);
+  }
+  const remainingNum = this.data.length - i;
+  if (remainingNum > 0) {
+    group = this.data.substr(i);
+    value = parseInt(group, 10);
+    bitBuffer.put(value, remainingNum * 3 + 1);
+  }
 };
-var p = n;
+var numericData = NumericData;
 export {
-  p as n
+  numericData as n
 };
+//# sourceMappingURL=numeric-data.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"numeric-data.js","sources":["../../../../../../node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["require$$0","getBitsLength"],"mappings":";;AAAA,MAAM,OAAOA;AAEb,SAAS,YAAa,MAAM;AAC1B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO,KAAK,SAAU;AAC7B;AAEA,YAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAChF;AAEA,YAAY,UAAU,YAAY,SAAS,YAAa;AACtD,SAAO,KAAK,KAAK;AACnB;AAEA,YAAY,UAAU,gBAAgB,SAASC,iBAAiB;AAC9D,SAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AACnD;AAEA,YAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,MAAI,GAAG,OAAO;AAId,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,YAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,QAAM,eAAe,KAAK,KAAK,SAAS;AACxC,MAAI,eAAe,GAAG;AACpB,YAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,YAAQ,SAAS,OAAO,EAAE;AAE1B,cAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,EAC1C;AACH;AAEA,IAAA,cAAiB;","x_google_ignoreList":[0]}

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

@@ -1 +1,37 @@
-"use strict";const c=require("../../../../_virtual/polynomial.cjs");require("./galois-field.cjs");const g=require("../../../../_virtual/galois-field.cjs");(function(o){const u=g.__exports;o.mul=function(l,n){const e=new Uint8Array(l.length+n.length-1);for(let r=0;r<l.length;r++)for(let t=0;t<n.length;t++)e[r+t]^=u.mul(l[r],n[t]);return e},o.mod=function(l,n){let e=new Uint8Array(l);for(;e.length-n.length>=0;){const r=e[0];for(let i=0;i<n.length;i++)e[i]^=u.mul(n[i],r);let t=0;for(;t<e.length&&e[t]===0;)t++;e=e.slice(t)}return e},o.generateECPolynomial=function(l){let n=new Uint8Array([1]);for(let e=0;e<l;e++)n=o.mul(n,new Uint8Array([1,u.exp(e)]));return n}})(c.__exports);
+"use strict";
+const polynomial = require("../../../../_virtual/polynomial.cjs");
+require("./galois-field.cjs");
+const galoisField = require("../../../../_virtual/galois-field.cjs");
+(function(exports2) {
+  const GF = galoisField.__exports;
+  exports2.mul = function mul(p1, p2) {
+    const coeff = new Uint8Array(p1.length + p2.length - 1);
+    for (let i = 0; i < p1.length; i++) {
+      for (let j = 0; j < p2.length; j++) {
+        coeff[i + j] ^= GF.mul(p1[i], p2[j]);
+      }
+    }
+    return coeff;
+  };
+  exports2.mod = function mod(divident, divisor) {
+    let result = new Uint8Array(divident);
+    while (result.length - divisor.length >= 0) {
+      const coeff = result[0];
+      for (let i = 0; i < divisor.length; i++) {
+        result[i] ^= GF.mul(divisor[i], coeff);
+      }
+      let offset = 0;
+      while (offset < result.length && result[offset] === 0) offset++;
+      result = result.slice(offset);
+    }
+    return result;
+  };
+  exports2.generateECPolynomial = function generateECPolynomial(degree) {
+    let poly = new Uint8Array([1]);
+    for (let i = 0; i < degree; i++) {
+      poly = exports2.mul(poly, new Uint8Array([1, GF.exp(i)]));
+    }
+    return poly;
+  };
+})(polynomial.__exports);
+//# sourceMappingURL=polynomial.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/polynomial.js"],"sourcesContent":["const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param  {Uint8Array} p1 Polynomial\n * @param  {Uint8Array} p2 Polynomial\n * @return {Uint8Array}    Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n  const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n  for (let i = 0; i < p1.length; i++) {\n    for (let j = 0; j < p2.length; j++) {\n      coeff[i + j] ^= GF.mul(p1[i], p2[j])\n    }\n  }\n\n  return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param  {Uint8Array} divident Polynomial\n * @param  {Uint8Array} divisor  Polynomial\n * @return {Uint8Array}          Remainder\n */\nexports.mod = function mod (divident, divisor) {\n  let result = new Uint8Array(divident)\n\n  while ((result.length - divisor.length) >= 0) {\n    const coeff = result[0]\n\n    for (let i = 0; i < divisor.length; i++) {\n      result[i] ^= GF.mul(divisor[i], coeff)\n    }\n\n    // remove all zeros from buffer head\n    let offset = 0\n    while (offset < result.length && result[offset] === 0) offset++\n    result = result.slice(offset)\n  }\n\n  return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param  {Number} degree Degree of the generator polynomial\n * @return {Uint8Array}    Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n  let poly = new Uint8Array([1])\n  for (let i = 0; i < degree; i++) {\n    poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n  }\n\n  return poly\n}\n"],"names":["require$$0","exports"],"mappings":";;;;;AAAA,QAAM,KAAKA,YAAyB;AASpC,EAAAC,SAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,UAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,cAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACpC;AAAA,IACF;AAED,WAAO;AAAA,EACR;AASD,EAAAA,SAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,QAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,WAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,YAAM,QAAQ,OAAO,CAAC;AAEtB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,MACtC;AAGD,UAAI,SAAS;AACb,aAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,eAAS,OAAO,MAAM,MAAM;AAAA,IAC7B;AAED,WAAO;AAAA,EACR;AASD,EAAAA,SAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,QAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAOA,SAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,IACxD;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}