@ozdao/martyrs 0.2.585 → 0.2.587

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

@@ -1,149 +0,0 @@
-import { __exports as maskPattern } from "../../../../../../../_virtual/mask-pattern.js";
-var hasRequiredMaskPattern;
-function requireMaskPattern() {
-  if (hasRequiredMaskPattern) return maskPattern;
-  hasRequiredMaskPattern = 1;
-  (function(exports) {
-    exports.Patterns = {
-      PATTERN000: 0,
-      PATTERN001: 1,
-      PATTERN010: 2,
-      PATTERN011: 3,
-      PATTERN100: 4,
-      PATTERN101: 5,
-      PATTERN110: 6,
-      PATTERN111: 7
-    };
-    const PenaltyScores = {
-      N1: 3,
-      N2: 3,
-      N3: 40,
-      N4: 10
-    };
-    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++;
-        }
-      }
-      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 points * PenaltyScores.N3;
-    };
-    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:" + maskPattern2);
-      }
-    }
-    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 bestPattern;
-    };
-  })(maskPattern);
-  return maskPattern;
-}
-export {
-  requireMaskPattern as __require
-};
-//# sourceMappingURL=mask-pattern.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"mask-pattern.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n  PATTERN000: 0,\n  PATTERN001: 1,\n  PATTERN010: 2,\n  PATTERN011: 3,\n  PATTERN100: 4,\n  PATTERN101: 5,\n  PATTERN110: 6,\n  PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n  N1: 3,\n  N2: 3,\n  N3: 40,\n  N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param  {Number}  mask    Mask pattern\n * @return {Boolean}         true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param  {Number|String} value        Mask pattern value\n * @return {Number}                     Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n  return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n  const size = data.size\n  let points = 0\n  let sameCountCol = 0\n  let sameCountRow = 0\n  let lastCol = null\n  let lastRow = null\n\n  for (let row = 0; row < size; row++) {\n    sameCountCol = sameCountRow = 0\n    lastCol = lastRow = null\n\n    for (let col = 0; col < size; col++) {\n      let module = data.get(row, col)\n      if (module === lastCol) {\n        sameCountCol++\n      } else {\n        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n        lastCol = module\n        sameCountCol = 1\n      }\n\n      module = data.get(col, row)\n      if (module === lastRow) {\n        sameCountRow++\n      } else {\n        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n        lastRow = module\n        sameCountRow = 1\n      }\n    }\n\n    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n  }\n\n  return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n  const size = data.size\n  let points = 0\n\n  for (let row = 0; row < size - 1; row++) {\n    for (let col = 0; col < size - 1; col++) {\n      const last = data.get(row, col) +\n        data.get(row, col + 1) +\n        data.get(row + 1, col) +\n        data.get(row + 1, col + 1)\n\n      if (last === 4 || last === 0) points++\n    }\n  }\n\n  return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n  const size = data.size\n  let points = 0\n  let bitsCol = 0\n  let bitsRow = 0\n\n  for (let row = 0; row < size; row++) {\n    bitsCol = bitsRow = 0\n    for (let col = 0; col < size; col++) {\n      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n    }\n  }\n\n  return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n  let darkCount = 0\n  const modulesCount = data.data.length\n\n  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n  return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param  {Number} maskPattern Pattern reference value\n * @param  {Number} i           Row\n * @param  {Number} j           Column\n * @return {Boolean}            Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n  switch (maskPattern) {\n    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n    case exports.Patterns.PATTERN001: return i % 2 === 0\n    case exports.Patterns.PATTERN010: return j % 3 === 0\n    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n    default: throw new Error('bad maskPattern:' + maskPattern)\n  }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param  {Number}    pattern Pattern reference number\n * @param  {BitMatrix} data    BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n  const size = data.size\n\n  for (let col = 0; col < size; col++) {\n    for (let row = 0; row < size; row++) {\n      if (data.isReserved(row, col)) continue\n      data.xor(row, col, getMaskAt(pattern, row, col))\n    }\n  }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param  {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n  const numPatterns = Object.keys(exports.Patterns).length\n  let bestPattern = 0\n  let lowerPenalty = Infinity\n\n  for (let p = 0; p < numPatterns; p++) {\n    setupFormatFunc(p)\n    exports.applyMask(p, data)\n\n    // Calculate penalty\n    const penalty =\n      exports.getPenaltyN1(data) +\n      exports.getPenaltyN2(data) +\n      exports.getPenaltyN3(data) +\n      exports.getPenaltyN4(data)\n\n    // Undo previously applied mask\n    exports.applyMask(p, data)\n\n    if (penalty < lowerPenalty) {\n      lowerPenalty = penalty\n      bestPattern = p\n    }\n  }\n\n  return bestPattern\n}\n"],"names":["maskPattern"],"mappings":";;;;;;AAIA,YAAA,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,UAAM,gBAAgB;AAAA,MACpB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AAQA,YAAA,UAAkB,SAAS,QAAS,MAAM;AACxC,aAAO,QAAQ,QAAQ,SAAS,MAAM,CAAC,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ;AAAA,IAC7E;AASA,YAAA,OAAe,SAAS,KAAM,OAAO;AACnC,aAAO,QAAQ,QAAQ,KAAK,IAAI,SAAS,OAAO,EAAE,IAAI;AAAA,IACxD;AASA,YAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS;AACb,UAAI,eAAe;AACnB,UAAI,eAAe;AACnB,UAAI,UAAU;AACd,UAAI,UAAU;AAEd,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,uBAAe,eAAe;AAC9B,kBAAU,UAAU;AAEpB,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,cAAI,SAAS,KAAK,IAAI,KAAK,GAAG;AAC9B,cAAI,WAAW,SAAS;AACtB;AAAA,UACR,OAAa;AACL,gBAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,sBAAU;AACV,2BAAe;AAAA,UACvB;AAEM,mBAAS,KAAK,IAAI,KAAK,GAAG;AAC1B,cAAI,WAAW,SAAS;AACtB;AAAA,UACR,OAAa;AACL,gBAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,sBAAU;AACV,2BAAe;AAAA,UACvB;AAAA,QACA;AAEI,YAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,YAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AAAA,MACxE;AAEE,aAAO;AAAA,IACT;AAOA,YAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS;AAEb,eAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,iBAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,gBAAM,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,cAAI,SAAS,KAAK,SAAS,EAAG;AAAA,QACpC;AAAA,MACA;AAEE,aAAO,SAAS,cAAc;AAAA,IAChC;AAQA,YAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS;AACb,UAAI,UAAU;AACd,UAAI,UAAU;AAEd,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,kBAAU,UAAU;AACpB,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,oBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,cAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAE3D,oBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,cAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAAA,QACjE;AAAA,MACA;AAEE,aAAO,SAAS,cAAc;AAAA,IAChC;AAUA,YAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAI,YAAY;AAChB,YAAM,eAAe,KAAK,KAAK;AAE/B,eAAS,IAAI,GAAG,IAAI,cAAc,IAAK,cAAa,KAAK,KAAK,CAAC;AAE/D,YAAM,IAAI,KAAK,IAAI,KAAK,KAAM,YAAY,MAAM,eAAgB,CAAC,IAAI,EAAE;AAEvE,aAAO,IAAI,cAAc;AAAA,IAC3B;AAUA,aAAS,UAAWA,cAAa,GAAG,GAAG;AACrC,cAAQA,cAAW;AAAA,QACjB,KAAK,QAAQ,SAAS;AAAY,kBAAQ,IAAI,KAAK,MAAM;AAAA,QACzD,KAAK,QAAQ,SAAS;AAAY,iBAAO,IAAI,MAAM;AAAA,QACnD,KAAK,QAAQ,SAAS;AAAY,iBAAO,IAAI,MAAM;AAAA,QACnD,KAAK,QAAQ,SAAS;AAAY,kBAAQ,IAAI,KAAK,MAAM;AAAA,QACzD,KAAK,QAAQ,SAAS;AAAY,kBAAQ,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM;AAAA,QACzF,KAAK,QAAQ,SAAS;AAAY,iBAAQ,IAAI,IAAK,IAAK,IAAI,IAAK,MAAM;AAAA,QACvE,KAAK,QAAQ,SAAS;AAAY,kBAAS,IAAI,IAAK,IAAK,IAAI,IAAK,KAAK,MAAM;AAAA,QAC7E,KAAK,QAAQ,SAAS;AAAY,kBAAS,IAAI,IAAK,KAAK,IAAI,KAAK,KAAK,MAAM;AAAA,QAE7E;AAAS,gBAAM,IAAI,MAAM,qBAAqBA,YAAW;AAAA,MAC7D;AAAA,IACA;AAQA,YAAA,YAAoB,SAAS,UAAW,SAAS,MAAM;AACrD,YAAM,OAAO,KAAK;AAElB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,cAAI,KAAK,WAAW,KAAK,GAAG,EAAG;AAC/B,eAAK,IAAI,KAAK,KAAK,UAAU,SAAS,KAAK,GAAG,CAAC;AAAA,QACrD;AAAA,MACA;AAAA,IACA;AAQA,YAAA,cAAsB,SAAS,YAAa,MAAM,iBAAiB;AACjE,YAAM,cAAc,OAAO,KAAK,QAAQ,QAAQ,EAAE;AAClD,UAAI,cAAc;AAClB,UAAI,eAAe;AAEnB,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,wBAAgB,CAAC;AACjB,gBAAQ,UAAU,GAAG,IAAI;AAGzB,cAAM,UACJ,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI,IACzB,QAAQ,aAAa,IAAI;AAG3B,gBAAQ,UAAU,GAAG,IAAI;AAEzB,YAAI,UAAU,cAAc;AAC1B,yBAAe;AACf,wBAAc;AAAA,QACpB;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AAAA;;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"mode.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\n */\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["require$$0","require$$1","mode"],"mappings":";;;;;;;;AAAA,UAAM,eAAeA,oBAAA;AACrB,UAAM,QAAQC,aAAA;AASd,YAAA,UAAkB;AAAA,MAChB,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,IACrB;AAWA,YAAA,eAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB;AAOA,YAAA,OAAe;AAAA,MACb,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB;AAWA,YAAA,QAAgB;AAAA,MACd,IAAI;AAAA,MACJ,KAAK,KAAK;AAAA,MACV,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB;AAQA,YAAA,QAAgB;AAAA,MACd,KAAK;AAAA,IACP;AAUA,YAAA,wBAAgC,SAAS,sBAAuBC,OAAM,SAAS;AAC7E,UAAI,CAACA,MAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,KAAI;AAEzD,UAAI,CAAC,aAAa,QAAQ,OAAO,GAAG;AAClC,cAAM,IAAI,MAAM,sBAAsB,OAAO;AAAA,MACjD;AAEE,UAAI,WAAW,KAAK,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAAA,eAC7C,UAAU,GAAI,QAAOA,MAAK,OAAO,CAAC;AAC3C,aAAOA,MAAK,OAAO,CAAC;AAAA,IACtB;AAQA,YAAA,qBAA6B,SAAS,mBAAoB,SAAS;AACjE,UAAI,MAAM,YAAY,OAAO,EAAG,QAAO,QAAQ;AAAA,eACtC,MAAM,iBAAiB,OAAO,EAAG,QAAO,QAAQ;AAAA,eAChD,MAAM,UAAU,OAAO,EAAG,QAAO,QAAQ;AAAA,UAC7C,QAAO,QAAQ;AAAA,IACtB;AAQA,YAAA,WAAmB,SAAS,SAAUA,OAAM;AAC1C,UAAIA,SAAQA,MAAK,GAAI,QAAOA,MAAK;AACjC,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC;AAQA,YAAA,UAAkB,SAAS,QAASA,OAAM;AACxC,aAAOA,SAAQA,MAAK,OAAOA,MAAK;AAAA,IAClC;AAQA,aAAS,WAAY,QAAQ;AAC3B,UAAI,OAAO,WAAW,UAAU;AAC9B,cAAM,IAAI,MAAM,uBAAuB;AAAA,MAC3C;AAEE,YAAM,QAAQ,OAAO,YAAW;AAEhC,cAAQ,OAAK;AAAA,QACX,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB;AACE,gBAAM,IAAI,MAAM,mBAAmB,MAAM;AAAA,MAC/C;AAAA,IACA;AAUA,YAAA,OAAe,SAAS,KAAM,OAAO,cAAc;AACjD,UAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1B,eAAO;AAAA,MACX;AAEE,UAAI;AACF,eAAO,WAAW,KAAK;AAAA,MAC3B,SAAW,GAAG;AACV,eAAO;AAAA,MACX;AAAA,IACA;AAAA;;;","x_google_ignoreList":[0]}

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

@@ -1,41 +0,0 @@
-import { __require as requireMode } from "./mode.js";
-var numericData;
-var hasRequiredNumericData;
-function requireNumericData() {
-  if (hasRequiredNumericData) return numericData;
-  hasRequiredNumericData = 1;
-  const Mode = requireMode();
-  function NumericData(data) {
-    this.mode = Mode.NUMERIC;
-    this.data = data.toString();
-  }
-  NumericData.getBitsLength = function getBitsLength(length) {
-    return 10 * Math.floor(length / 3) + (length % 3 ? length % 3 * 3 + 1 : 0);
-  };
-  NumericData.prototype.getLength = function getLength() {
-    return this.data.length;
-  };
-  NumericData.prototype.getBitsLength = function getBitsLength() {
-    return NumericData.getBitsLength(this.data.length);
-  };
-  NumericData.prototype.write = function write(bitBuffer) {
-    let i, group, value;
-    for (i = 0; i + 3 <= this.data.length; i += 3) {
-      group = this.data.substr(i, 3);
-      value = parseInt(group, 10);
-      bitBuffer.put(value, 10);
-    }
-    const remainingNum = this.data.length - i;
-    if (remainingNum > 0) {
-      group = this.data.substr(i);
-      value = parseInt(group, 10);
-      bitBuffer.put(value, remainingNum * 3 + 1);
-    }
-  };
-  numericData = NumericData;
-  return numericData;
-}
-export {
-  requireNumericData as __require
-};
-//# sourceMappingURL=numeric-data.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"numeric-data.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/numeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction NumericData (data) {\n  this.mode = Mode.NUMERIC\n  this.data = data.toString()\n}\n\nNumericData.getBitsLength = function getBitsLength (length) {\n  return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)\n}\n\nNumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nNumericData.prototype.getBitsLength = function getBitsLength () {\n  return NumericData.getBitsLength(this.data.length)\n}\n\nNumericData.prototype.write = function write (bitBuffer) {\n  let i, group, value\n\n  // The input data string is divided into groups of three digits,\n  // and each group is converted to its 10-bit binary equivalent.\n  for (i = 0; i + 3 <= this.data.length; i += 3) {\n    group = this.data.substr(i, 3)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, 10)\n  }\n\n  // If the number of input digits is not an exact multiple of three,\n  // the final one or two digits are converted to 4 or 7 bits respectively.\n  const remainingNum = this.data.length - i\n  if (remainingNum > 0) {\n    group = this.data.substr(i)\n    value = parseInt(group, 10)\n\n    bitBuffer.put(value, remainingNum * 3 + 1)\n  }\n}\n\nmodule.exports = NumericData\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,OAAOA,YAAA;AAEb,WAAS,YAAa,MAAM;AAC1B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO,KAAK,SAAQ;AAAA,EAC3B;AAEA,cAAY,gBAAgB,SAAS,cAAe,QAAQ;AAC1D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,KAAM,SAAS,IAAO,SAAS,IAAK,IAAI,IAAK;AAAA,EAChF;AAEA,cAAY,UAAU,YAAY,SAAS,YAAa;AACtD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,cAAY,UAAU,gBAAgB,SAAS,gBAAiB;AAC9D,WAAO,YAAY,cAAc,KAAK,KAAK,MAAM;AAAA,EACnD;AAEA,cAAY,UAAU,QAAQ,SAAS,MAAO,WAAW;AACvD,QAAI,GAAG,OAAO;AAId,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAC7C,cAAQ,KAAK,KAAK,OAAO,GAAG,CAAC;AAC7B,cAAQ,SAAS,OAAO,EAAE;AAE1B,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,QAAI,eAAe,GAAG;AACpB,cAAQ,KAAK,KAAK,OAAO,CAAC;AAC1B,cAAQ,SAAS,OAAO,EAAE;AAE1B,gBAAU,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,IAC7C;AAAA,EACA;AAEA,gBAAiB;;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polynomial.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/polynomial.js"],"sourcesContent":["const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param  {Uint8Array} p1 Polynomial\n * @param  {Uint8Array} p2 Polynomial\n * @return {Uint8Array}    Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n  const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n  for (let i = 0; i < p1.length; i++) {\n    for (let j = 0; j < p2.length; j++) {\n      coeff[i + j] ^= GF.mul(p1[i], p2[j])\n    }\n  }\n\n  return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param  {Uint8Array} divident Polynomial\n * @param  {Uint8Array} divisor  Polynomial\n * @return {Uint8Array}          Remainder\n */\nexports.mod = function mod (divident, divisor) {\n  let result = new Uint8Array(divident)\n\n  while ((result.length - divisor.length) >= 0) {\n    const coeff = result[0]\n\n    for (let i = 0; i < divisor.length; i++) {\n      result[i] ^= GF.mul(divisor[i], coeff)\n    }\n\n    // remove all zeros from buffer head\n    let offset = 0\n    while (offset < result.length && result[offset] === 0) offset++\n    result = result.slice(offset)\n  }\n\n  return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param  {Number} degree Degree of the generator polynomial\n * @return {Uint8Array}    Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n  let poly = new Uint8Array([1])\n  for (let i = 0; i < degree; i++) {\n    poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n  }\n\n  return poly\n}\n"],"names":["require$$0"],"mappings":";;;;;;;AAAA,UAAM,KAAKA,mBAAA;AASX,YAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,YAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,gBAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,QACzC;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AASA,YAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,UAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,aAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,cAAM,QAAQ,OAAO,CAAC;AAEtB,iBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,iBAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,QAC3C;AAGI,YAAI,SAAS;AACb,eAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,iBAAS,OAAO,MAAM,MAAM;AAAA,MAChC;AAEE,aAAO;AAAA,IACT;AASA,YAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,UAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAO,QAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,MAC3D;AAEE,aAAO;AAAA,IACT;AAAA;;;","x_google_ignoreList":[0]}

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

@@ -1,279 +0,0 @@
-import { __exports as qrcode } from "../../../../../../../_virtual/qrcode.js";
-import { __require as requireUtils } from "./utils.js";
-import { __require as requireErrorCorrectionLevel } from "./error-correction-level.js";
-import { __require as requireBitBuffer } from "./bit-buffer.js";
-import { __require as requireBitMatrix } from "./bit-matrix.js";
-import { __require as requireAlignmentPattern } from "./alignment-pattern.js";
-import { __require as requireFinderPattern } from "./finder-pattern.js";
-import { __require as requireMaskPattern } from "./mask-pattern.js";
-import { __require as requireErrorCorrectionCode } from "./error-correction-code.js";
-import { __require as requireReedSolomonEncoder } from "./reed-solomon-encoder.js";
-import { __require as requireVersion } from "./version.js";
-import { __require as requireFormatInfo } from "./format-info.js";
-import { __require as requireMode } from "./mode.js";
-import { __require as requireSegments } from "./segments.js";
-var hasRequiredQrcode;
-function requireQrcode() {
-  if (hasRequiredQrcode) return qrcode;
-  hasRequiredQrcode = 1;
-  const Utils = requireUtils();
-  const ECLevel = requireErrorCorrectionLevel();
-  const BitBuffer = requireBitBuffer();
-  const BitMatrix = requireBitMatrix();
-  const AlignmentPattern = requireAlignmentPattern();
-  const FinderPattern = requireFinderPattern();
-  const MaskPattern = requireMaskPattern();
-  const ECCode = requireErrorCorrectionCode();
-  const ReedSolomonEncoder = requireReedSolomonEncoder();
-  const Version = requireVersion();
-  const FormatInfo = requireFormatInfo();
-  const Mode = requireMode();
-  const Segments = requireSegments();
-  function setupFinderPattern(matrix, version) {
-    const size = matrix.size;
-    const pos = FinderPattern.getPositions(version);
-    for (let i = 0; i < pos.length; i++) {
-      const row = pos[i][0];
-      const col = pos[i][1];
-      for (let r = -1; r <= 7; r++) {
-        if (row + r <= -1 || size <= row + r) continue;
-        for (let c = -1; c <= 7; c++) {
-          if (col + c <= -1 || size <= col + c) continue;
-          if (r >= 0 && r <= 6 && (c === 0 || c === 6) || c >= 0 && c <= 6 && (r === 0 || r === 6) || r >= 2 && r <= 4 && c >= 2 && c <= 4) {
-            matrix.set(row + r, col + c, true, true);
-          } else {
-            matrix.set(row + r, col + c, false, true);
-          }
-        }
-      }
-    }
-  }
-  function setupTimingPattern(matrix) {
-    const size = matrix.size;
-    for (let r = 8; r < size - 8; r++) {
-      const value = r % 2 === 0;
-      matrix.set(r, 6, value, true);
-      matrix.set(6, r, value, true);
-    }
-  }
-  function setupAlignmentPattern(matrix, version) {
-    const pos = AlignmentPattern.getPositions(version);
-    for (let i = 0; i < pos.length; i++) {
-      const row = pos[i][0];
-      const col = pos[i][1];
-      for (let r = -2; r <= 2; r++) {
-        for (let c = -2; c <= 2; c++) {
-          if (r === -2 || r === 2 || c === -2 || c === 2 || r === 0 && c === 0) {
-            matrix.set(row + r, col + c, true, true);
-          } else {
-            matrix.set(row + r, col + c, false, true);
-          }
-        }
-      }
-    }
-  }
-  function setupVersionInfo(matrix, version) {
-    const size = matrix.size;
-    const bits = Version.getEncodedBits(version);
-    let row, col, mod;
-    for (let i = 0; i < 18; i++) {
-      row = Math.floor(i / 3);
-      col = i % 3 + size - 8 - 3;
-      mod = (bits >> i & 1) === 1;
-      matrix.set(row, col, mod, true);
-      matrix.set(col, row, mod, true);
-    }
-  }
-  function setupFormatInfo(matrix, errorCorrectionLevel, maskPattern) {
-    const size = matrix.size;
-    const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern);
-    let i, mod;
-    for (i = 0; i < 15; i++) {
-      mod = (bits >> i & 1) === 1;
-      if (i < 6) {
-        matrix.set(i, 8, mod, true);
-      } else if (i < 8) {
-        matrix.set(i + 1, 8, mod, true);
-      } else {
-        matrix.set(size - 15 + i, 8, mod, true);
-      }
-      if (i < 8) {
-        matrix.set(8, size - i - 1, mod, true);
-      } else if (i < 9) {
-        matrix.set(8, 15 - i - 1 + 1, mod, true);
-      } else {
-        matrix.set(8, 15 - i - 1, mod, true);
-      }
-    }
-    matrix.set(size - 8, 8, 1, true);
-  }
-  function setupData(matrix, data) {
-    const size = matrix.size;
-    let inc = -1;
-    let row = size - 1;
-    let bitIndex = 7;
-    let byteIndex = 0;
-    for (let col = size - 1; col > 0; col -= 2) {
-      if (col === 6) col--;
-      while (true) {
-        for (let c = 0; c < 2; c++) {
-          if (!matrix.isReserved(row, col - c)) {
-            let dark = false;
-            if (byteIndex < data.length) {
-              dark = (data[byteIndex] >>> bitIndex & 1) === 1;
-            }
-            matrix.set(row, col - c, dark);
-            bitIndex--;
-            if (bitIndex === -1) {
-              byteIndex++;
-              bitIndex = 7;
-            }
-          }
-        }
-        row += inc;
-        if (row < 0 || size <= row) {
-          row -= inc;
-          inc = -inc;
-          break;
-        }
-      }
-    }
-  }
-  function createData(version, errorCorrectionLevel, segments) {
-    const buffer = new BitBuffer();
-    segments.forEach(function(data) {
-      buffer.put(data.mode.bit, 4);
-      buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version));
-      data.write(buffer);
-    });
-    const totalCodewords = Utils.getSymbolTotalCodewords(version);
-    const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel);
-    const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
-    if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
-      buffer.put(0, 4);
-    }
-    while (buffer.getLengthInBits() % 8 !== 0) {
-      buffer.putBit(0);
-    }
-    const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8;
-    for (let i = 0; i < remainingByte; i++) {
-      buffer.put(i % 2 ? 17 : 236, 8);
-    }
-    return createCodewords(buffer, version, errorCorrectionLevel);
-  }
-  function createCodewords(bitBuffer, version, errorCorrectionLevel) {
-    const totalCodewords = Utils.getSymbolTotalCodewords(version);
-    const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel);
-    const dataTotalCodewords = totalCodewords - ecTotalCodewords;
-    const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel);
-    const blocksInGroup2 = totalCodewords % ecTotalBlocks;
-    const blocksInGroup1 = ecTotalBlocks - blocksInGroup2;
-    const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks);
-    const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks);
-    const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1;
-    const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1;
-    const rs = new ReedSolomonEncoder(ecCount);
-    let offset = 0;
-    const dcData = new Array(ecTotalBlocks);
-    const ecData = new Array(ecTotalBlocks);
-    let maxDataSize = 0;
-    const buffer = new Uint8Array(bitBuffer.buffer);
-    for (let b = 0; b < ecTotalBlocks; b++) {
-      const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2;
-      dcData[b] = buffer.slice(offset, offset + dataSize);
-      ecData[b] = rs.encode(dcData[b]);
-      offset += dataSize;
-      maxDataSize = Math.max(maxDataSize, dataSize);
-    }
-    const data = new Uint8Array(totalCodewords);
-    let index = 0;
-    let i, r;
-    for (i = 0; i < maxDataSize; i++) {
-      for (r = 0; r < ecTotalBlocks; r++) {
-        if (i < dcData[r].length) {
-          data[index++] = dcData[r][i];
-        }
-      }
-    }
-    for (i = 0; i < ecCount; i++) {
-      for (r = 0; r < ecTotalBlocks; r++) {
-        data[index++] = ecData[r][i];
-      }
-    }
-    return data;
-  }
-  function createSymbol(data, version, errorCorrectionLevel, maskPattern) {
-    let segments;
-    if (Array.isArray(data)) {
-      segments = Segments.fromArray(data);
-    } else if (typeof data === "string") {
-      let estimatedVersion = version;
-      if (!estimatedVersion) {
-        const rawSegments = Segments.rawSplit(data);
-        estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel);
-      }
-      segments = Segments.fromString(data, estimatedVersion || 40);
-    } else {
-      throw new Error("Invalid data");
-    }
-    const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel);
-    if (!bestVersion) {
-      throw new Error("The amount of data is too big to be stored in a QR Code");
-    }
-    if (!version) {
-      version = bestVersion;
-    } else if (version < bestVersion) {
-      throw new Error(
-        "\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: " + bestVersion + ".\n"
-      );
-    }
-    const dataBits = createData(version, errorCorrectionLevel, segments);
-    const moduleCount = Utils.getSymbolSize(version);
-    const modules = new BitMatrix(moduleCount);
-    setupFinderPattern(modules, version);
-    setupTimingPattern(modules);
-    setupAlignmentPattern(modules, version);
-    setupFormatInfo(modules, errorCorrectionLevel, 0);
-    if (version >= 7) {
-      setupVersionInfo(modules, version);
-    }
-    setupData(modules, dataBits);
-    if (isNaN(maskPattern)) {
-      maskPattern = MaskPattern.getBestMask(
-        modules,
-        setupFormatInfo.bind(null, modules, errorCorrectionLevel)
-      );
-    }
-    MaskPattern.applyMask(maskPattern, modules);
-    setupFormatInfo(modules, errorCorrectionLevel, maskPattern);
-    return {
-      modules,
-      version,
-      errorCorrectionLevel,
-      maskPattern,
-      segments
-    };
-  }
-  qrcode.create = function create(data, options) {
-    if (typeof data === "undefined" || data === "") {
-      throw new Error("No input text");
-    }
-    let errorCorrectionLevel = ECLevel.M;
-    let version;
-    let mask;
-    if (typeof options !== "undefined") {
-      errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M);
-      version = Version.from(options.version);
-      mask = MaskPattern.from(options.maskPattern);
-      if (options.toSJISFunc) {
-        Utils.setToSJISFunction(options.toSJISFunc);
-      }
-    }
-    return createSymbol(data, version, errorCorrectionLevel, mask);
-  };
-  return qrcode;
-}
-export {
-  requireQrcode as __require
-};
-//# sourceMappingURL=qrcode.js.map