asterui 0.12.0 → 0.12.2

package/dist/index122.js

@@ -1,19 +1,27 @@
-import { __exports as e } from "./index138.js";
-import { __require as f } from "./index112.js";
-var s;
-function m() {
-  if (s) return e;
-  s = 1;
-  const r = f(), i = 1335, a = 21522, o = r.getBCHDigit(i);
-  return e.getEncodedBits = function(u, c) {
-    const n = u.bit << 3 | c;
-    let t = n << 10;
-    for (; r.getBCHDigit(t) - o >= 0; )
-      t ^= i << r.getBCHDigit(t) - o;
-    return (n << 10 | t) ^ a;
-  }, e;
+import { __exports as u } from "./index137.js";
+import { __require as a } from "./index118.js";
+var l;
+function p() {
+  return l ? u : (l = 1, (function(s) {
+    const c = a().getSymbolSize;
+    s.getRowColCoords = function(r) {
+      if (r === 1) return [];
+      const i = Math.floor(r / 7) + 2, e = c(r), n = e === 145 ? 26 : Math.ceil((e - 13) / (2 * i - 2)) * 2, t = [e - 7];
+      for (let o = 1; o < i - 1; o++)
+        t[o] = t[o - 1] - n;
+      return t.push(6), t.reverse();
+    }, s.getPositions = function(r) {
+      const i = [], e = s.getRowColCoords(r), n = e.length;
+      for (let t = 0; t < n; t++)
+        for (let o = 0; o < n; o++)
+          t === 0 && o === 0 || // top-left
+          t === 0 && o === n - 1 || // bottom-left
+          t === n - 1 && o === 0 || i.push([e[t], e[o]]);
+      return i;
+    };
+  })(u), u);
 }
 export {
-  m as __require
+  p as __require
 };
 //# sourceMappingURL=index122.js.map

package/dist/index122.js.map

@@ -1 +1 @@
-{"version":3,"file":"index122.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/format-info.js"],"sourcesContent":["const Utils = require('./utils')\n\nconst G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)\nconst G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)\nconst G15_BCH = Utils.getBCHDigit(G15)\n\n/**\n * Returns format information with relative error correction bits\n *\n * The format information is a 15-bit sequence containing 5 data bits,\n * with 10 error correction bits calculated using the (15, 5) BCH code.\n *\n * @param  {Number} errorCorrectionLevel Error correction level\n * @param  {Number} mask                 Mask pattern\n * @return {Number}                      Encoded format information bits\n */\nexports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {\n  const data = ((errorCorrectionLevel.bit << 3) | mask)\n  let d = data << 10\n\n  while (Utils.getBCHDigit(d) - G15_BCH >= 0) {\n    d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))\n  }\n\n  // xor final data with mask pattern in order to ensure that\n  // no combination of Error Correction Level and data mask pattern\n  // will result in an all-zero data string\n  return ((data << 10) | d) ^ G15_MASK\n}\n"],"names":["Utils","require$$0","G15","G15_MASK","G15_BCH","formatInfo","errorCorrectionLevel","mask","data","d"],"mappings":";;;;;;AAAA,QAAMA,IAAQC,EAAA,GAERC,IAAO,MACPC,IAAY,OACZC,IAAUJ,EAAM,YAAYE,CAAG;AAYrC,SAAAG,EAAA,iBAAyB,SAAyBC,GAAsBC,GAAM;AAC5E,UAAMC,IAASF,EAAqB,OAAO,IAAKC;AAChD,QAAIE,IAAID,KAAQ;AAEhB,WAAOR,EAAM,YAAYS,CAAC,IAAIL,KAAW;AACvC,MAAAK,KAAMP,KAAQF,EAAM,YAAYS,CAAC,IAAIL;AAMvC,YAASI,KAAQ,KAAMC,KAAKN;AAAA,EAC9B;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index122.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alignment-pattern.js"],"sourcesContent":["/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nconst getSymbolSize = require('./utils').getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n  if (version === 1) return []\n\n  const posCount = Math.floor(version / 7) + 2\n  const size = getSymbolSize(version)\n  const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n  const positions = [size - 7] // Last coord is always (size - 7)\n\n  for (let i = 1; i < posCount - 1; i++) {\n    positions[i] = positions[i - 1] - intervals\n  }\n\n  positions.push(6) // First coord is always 6\n\n  return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * let pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const coords = []\n  const pos = exports.getRowColCoords(version)\n  const posLength = pos.length\n\n  for (let i = 0; i < posLength; i++) {\n    for (let j = 0; j < posLength; j++) {\n      // Skip if position is occupied by finder patterns\n      if ((i === 0 && j === 0) || // top-left\n          (i === 0 && j === posLength - 1) || // bottom-left\n          (i === posLength - 1 && j === 0)) { // top-right\n        continue\n      }\n\n      coords.push([pos[i], pos[j]])\n    }\n  }\n\n  return coords\n}\n"],"names":["getSymbolSize","require$$0","exports","version","posCount","size","intervals","positions","i","coords","pos","posLength","j"],"mappings":";;;;;AAUA,UAAMA,IAAgBC,IAAmB;AAgBzCC,IAAAA,EAAA,kBAA0B,SAA0BC,GAAS;AAC3D,UAAIA,MAAY,EAAG,QAAO,CAAA;AAE1B,YAAMC,IAAW,KAAK,MAAMD,IAAU,CAAC,IAAI,GACrCE,IAAOL,EAAcG,CAAO,GAC5BG,IAAYD,MAAS,MAAM,KAAK,KAAK,MAAMA,IAAO,OAAO,IAAID,IAAW,EAAE,IAAI,GAC9EG,IAAY,CAACF,IAAO,CAAC;AAE3B,eAASG,IAAI,GAAGA,IAAIJ,IAAW,GAAGI;AAChC,QAAAD,EAAUC,CAAC,IAAID,EAAUC,IAAI,CAAC,IAAIF;AAGpC,aAAAC,EAAU,KAAK,CAAC,GAETA,EAAU,QAAO;AAAA,IAC1B,GAsBAL,EAAA,eAAuB,SAAuBC,GAAS;AACrD,YAAMM,IAAS,CAAA,GACTC,IAAMR,EAAQ,gBAAgBC,CAAO,GACrCQ,IAAYD,EAAI;AAEtB,eAASF,IAAI,GAAGA,IAAIG,GAAWH;AAC7B,iBAASI,IAAI,GAAGA,IAAID,GAAWC;AAE7B,UAAKJ,MAAM,KAAKI,MAAM;AAAA,UACjBJ,MAAM,KAAKI,MAAMD,IAAY;AAAA,UAC7BH,MAAMG,IAAY,KAAKC,MAAM,KAIlCH,EAAO,KAAK,CAACC,EAAIF,CAAC,GAAGE,EAAIE,CAAC,CAAC,CAAC;AAIhC,aAAOH;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}

package/dist/index123.js

@@ -1,69 +1,23 @@
-import { __exports as c } from "./index139.js";
-import { __require as o } from "./index137.js";
-import { __require as s } from "./index140.js";
-var u;
-function E() {
-  return u ? c : (u = 1, (function(i) {
-    const a = o(), e = s();
-    i.NUMERIC = {
-      id: "Numeric",
-      bit: 1,
-      ccBits: [10, 12, 14]
-    }, i.ALPHANUMERIC = {
-      id: "Alphanumeric",
-      bit: 2,
-      ccBits: [9, 11, 13]
-    }, i.BYTE = {
-      id: "Byte",
-      bit: 4,
-      ccBits: [8, 16, 16]
-    }, i.KANJI = {
-      id: "Kanji",
-      bit: 8,
-      ccBits: [8, 10, 12]
-    }, i.MIXED = {
-      bit: -1
-    }, i.getCharCountIndicator = function(r, n) {
-      if (!r.ccBits) throw new Error("Invalid mode: " + r);
-      if (!a.isValid(n))
-        throw new Error("Invalid version: " + n);
-      return n >= 1 && n < 10 ? r.ccBits[0] : n < 27 ? r.ccBits[1] : r.ccBits[2];
-    }, i.getBestModeForData = function(r) {
-      return e.testNumeric(r) ? i.NUMERIC : e.testAlphanumeric(r) ? i.ALPHANUMERIC : e.testKanji(r) ? i.KANJI : i.BYTE;
-    }, i.toString = function(r) {
-      if (r && r.id) return r.id;
-      throw new Error("Invalid mode");
-    }, i.isValid = function(r) {
-      return r && r.bit && r.ccBits;
-    };
-    function f(t) {
-      if (typeof t != "string")
-        throw new Error("Param is not a string");
-      switch (t.toLowerCase()) {
-        case "numeric":
-          return i.NUMERIC;
-        case "alphanumeric":
-          return i.ALPHANUMERIC;
-        case "kanji":
-          return i.KANJI;
-        case "byte":
-          return i.BYTE;
-        default:
-          throw new Error("Unknown mode: " + t);
-      }
-    }
-    i.from = function(r, n) {
-      if (i.isValid(r))
-        return r;
-      try {
-        return f(r);
-      } catch {
-        return n;
-      }
-    };
-  })(c), c);
+import { __exports as e } from "./index138.js";
+import { __require as s } from "./index118.js";
+var i;
+function f() {
+  if (i) return e;
+  i = 1;
+  const n = s().getSymbolSize, r = 7;
+  return e.getPositions = function(o) {
+    const t = n(o);
+    return [
+      // top-left
+      [0, 0],
+      // top-right
+      [t - r, 0],
+      // bottom-left
+      [0, t - r]
+    ];
+  }, e;
 }
 export {
-  E as __require
+  f as __require
 };
 //# sourceMappingURL=index123.js.map

package/dist/index123.js.map

@@ -1 +1 @@
-{"version":3,"file":"index123.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\n */\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["VersionCheck","require$$0","Regex","require$$1","exports","mode","version","dataStr","fromString","string","value","defaultValue"],"mappings":";;;;;;AAAA,UAAMA,IAAeC,EAAA,GACfC,IAAQC,EAAA;AASdC,IAAAA,EAAA,UAAkB;AAAA,MAChB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,IACrB,GAWAA,EAAA,eAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAOAA,EAAA,OAAe;AAAA,MACb,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAWAA,EAAA,QAAgB;AAAA,MACd,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAQAA,EAAA,QAAgB;AAAA,MACd,KAAK;AAAA,IACP,GAUAA,EAAA,wBAAgC,SAAgCC,GAAMC,GAAS;AAC7E,UAAI,CAACD,EAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,CAAI;AAEzD,UAAI,CAACL,EAAa,QAAQM,CAAO;AAC/B,cAAM,IAAI,MAAM,sBAAsBA,CAAO;AAG/C,aAAIA,KAAW,KAAKA,IAAU,KAAWD,EAAK,OAAO,CAAC,IAC7CC,IAAU,KAAWD,EAAK,OAAO,CAAC,IACpCA,EAAK,OAAO,CAAC;AAAA,IACtB,GAQAD,EAAA,qBAA6B,SAA6BG,GAAS;AACjE,aAAIL,EAAM,YAAYK,CAAO,IAAUH,EAAQ,UACtCF,EAAM,iBAAiBK,CAAO,IAAUH,EAAQ,eAChDF,EAAM,UAAUK,CAAO,IAAUH,EAAQ,QACtCA,EAAQ;AAAA,IACtB,GAQAA,EAAA,WAAmB,SAAmBC,GAAM;AAC1C,UAAIA,KAAQA,EAAK,GAAI,QAAOA,EAAK;AACjC,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC,GAQAD,EAAA,UAAkB,SAAkBC,GAAM;AACxC,aAAOA,KAAQA,EAAK,OAAOA,EAAK;AAAA,IAClC;AAQA,aAASG,EAAYC,GAAQ;AAC3B,UAAI,OAAOA,KAAW;AACpB,cAAM,IAAI,MAAM,uBAAuB;AAKzC,cAFcA,EAAO,YAAW,GAEnB;AAAA,QACX,KAAK;AACH,iBAAOL,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB;AACE,gBAAM,IAAI,MAAM,mBAAmBK,CAAM;AAAA,MAC/C;AAAA,IACA;AAUAL,IAAAA,EAAA,OAAe,SAAeM,GAAOC,GAAc;AACjD,UAAIP,EAAQ,QAAQM,CAAK;AACvB,eAAOA;AAGT,UAAI;AACF,eAAOF,EAAWE,CAAK;AAAA,MAC3B,QAAc;AACV,eAAOC;AAAA,MACX;AAAA,IACA;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index123.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/finder-pattern.js"],"sourcesContent":["const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param  {Number} version QR Code version\n * @return {Array}          Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n  const size = getSymbolSize(version)\n\n  return [\n    // top-left\n    [0, 0],\n    // top-right\n    [size - FINDER_PATTERN_SIZE, 0],\n    // bottom-left\n    [0, size - FINDER_PATTERN_SIZE]\n  ]\n}\n"],"names":["getSymbolSize","require$$0","FINDER_PATTERN_SIZE","finderPattern","version","size"],"mappings":";;;;;;AAAA,QAAMA,IAAgBC,IAAmB,eACnCC,IAAsB;AAS5B,SAAAC,EAAA,eAAuB,SAAuBC,GAAS;AACrD,UAAMC,IAAOL,EAAcI,CAAO;AAElC,WAAO;AAAA;AAAA,MAEL,CAAC,GAAG,CAAC;AAAA;AAAA,MAEL,CAACC,IAAOH,GAAqB,CAAC;AAAA;AAAA,MAE9B,CAAC,GAAGG,IAAOH,CAAmB;AAAA,IAClC;AAAA,EACA;;","x_google_ignoreList":[0]}

package/dist/index124.js

@@ -1,147 +1,103 @@
-import { __exports as N } from "./index141.js";
-import { __require as T } from "./index123.js";
-import { __require as Y } from "./index142.js";
-import { __require as L } from "./index143.js";
-import { __require as y } from "./index144.js";
-import { __require as D } from "./index145.js";
-import { __require as j } from "./index140.js";
-import { __require as k } from "./index112.js";
-import { __require as J } from "./index146.js";
-var b;
-function V() {
-  return b ? N : (b = 1, (function(m) {
-    const r = T(), I = Y(), B = L(), _ = y(), q = D(), c = j(), p = k(), R = J();
-    function C(n) {
-      return unescape(encodeURIComponent(n)).length;
-    }
-    function h(n, o, t) {
-      const e = [];
-      let s;
-      for (; (s = n.exec(t)) !== null; )
-        e.push({
-          data: s[0],
-          index: s.index,
-          mode: o,
-          length: s[0].length
-        });
-      return e;
-    }
-    function M(n) {
-      const o = h(c.NUMERIC, r.NUMERIC, n), t = h(c.ALPHANUMERIC, r.ALPHANUMERIC, n);
-      let e, s;
-      return p.isKanjiModeEnabled() ? (e = h(c.BYTE, r.BYTE, n), s = h(c.KANJI, r.KANJI, n)) : (e = h(c.BYTE_KANJI, r.BYTE, n), s = []), o.concat(t, e, s).sort(function(a, l) {
-        return a.index - l.index;
-      }).map(function(a) {
-        return {
-          data: a.data,
-          mode: a.mode,
-          length: a.length
-        };
-      });
-    }
-    function E(n, o) {
-      switch (o) {
-        case r.NUMERIC:
-          return I.getBitsLength(n);
-        case r.ALPHANUMERIC:
-          return B.getBitsLength(n);
-        case r.KANJI:
-          return q.getBitsLength(n);
-        case r.BYTE:
-          return _.getBitsLength(n);
-      }
-    }
-    function U(n) {
-      return n.reduce(function(o, t) {
-        const e = o.length - 1 >= 0 ? o[o.length - 1] : null;
-        return e && e.mode === t.mode ? (o[o.length - 1].data += t.data, o) : (o.push(t), o);
-      }, []);
-    }
-    function w(n) {
-      const o = [];
-      for (let t = 0; t < n.length; t++) {
-        const e = n[t];
-        switch (e.mode) {
-          case r.NUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.ALPHANUMERIC, length: e.length },
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.ALPHANUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.KANJI:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-            break;
-          case r.BYTE:
-            o.push([
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
+import { __exports as c } from "./index139.js";
+var T;
+function R() {
+  return T ? c : (T = 1, (function(r) {
+    r.Patterns = {
+      PATTERN000: 0,
+      PATTERN001: 1,
+      PATTERN010: 2,
+      PATTERN011: 3,
+      PATTERN100: 4,
+      PATTERN101: 5,
+      PATTERN110: 6,
+      PATTERN111: 7
+    };
+    const u = {
+      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, i = null, o = null;
+      for (let f = 0; f < l; f++) {
+        n = e = 0, i = o = null;
+        for (let N = 0; N < l; N++) {
+          let a = t.get(f, N);
+          a === i ? n++ : (n >= 5 && (s += u.N1 + (n - 5)), i = a, n = 1), a = t.get(N, f), a === o ? e++ : (e >= 5 && (s += u.N1 + (e - 5)), o = a, e = 1);
         }
+        n >= 5 && (s += u.N1 + (n - 5)), e >= 5 && (s += u.N1 + (e - 5));
       }
-      return o;
-    }
-    function K(n, o) {
-      const t = {}, e = { start: {} };
-      let s = ["start"];
-      for (let i = 0; i < n.length; i++) {
-        const a = n[i], l = [];
-        for (let g = 0; g < a.length; g++) {
-          const u = a[g], f = "" + i + g;
-          l.push(f), t[f] = { node: u, lastCount: 0 }, e[f] = {};
-          for (let A = 0; A < s.length; A++) {
-            const d = s[A];
-            t[d] && t[d].node.mode === u.mode ? (e[d][f] = E(t[d].lastCount + u.length, u.mode) - E(t[d].lastCount, u.mode), t[d].lastCount += u.length) : (t[d] && (t[d].lastCount = u.length), e[d][f] = E(u.length, u.mode) + 4 + r.getCharCountIndicator(u.mode, o));
-          }
+      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 i = t.get(n, e) + t.get(n, e + 1) + t.get(n + 1, e) + t.get(n + 1, e + 1);
+          (i === 4 || i === 0) && s++;
         }
-        s = l;
+      return s * u.N2;
+    }, r.getPenaltyN3 = function(t) {
+      const l = t.size;
+      let s = 0, n = 0, e = 0;
+      for (let i = 0; i < l; i++) {
+        n = e = 0;
+        for (let o = 0; o < l; o++)
+          n = n << 1 & 2047 | t.get(i, o), o >= 10 && (n === 1488 || n === 93) && s++, e = e << 1 & 2047 | t.get(o, i), o >= 10 && (e === 1488 || e === 93) && s++;
       }
-      for (let i = 0; i < s.length; i++)
-        e[s[i]].end = 0;
-      return { map: e, table: t };
-    }
-    function S(n, o) {
-      let t;
-      const e = r.getBestModeForData(n);
-      if (t = r.from(o, e), t !== r.BYTE && t.bit < e.bit)
-        throw new Error('"' + n + '" cannot be encoded with mode ' + r.toString(t) + `.
- Suggested mode is: ` + r.toString(e));
-      switch (t === r.KANJI && !p.isKanjiModeEnabled() && (t = r.BYTE), t) {
-        case r.NUMERIC:
-          return new I(n);
-        case r.ALPHANUMERIC:
-          return new B(n);
-        case r.KANJI:
-          return new q(n);
-        case r.BYTE:
-          return new _(n);
+      return s * u.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) * u.N4;
+    };
+    function g(P, t, l) {
+      switch (P) {
+        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;
+        default:
+          throw new Error("bad maskPattern:" + P);
       }
     }
-    m.fromArray = function(o) {
-      return o.reduce(function(t, e) {
-        return typeof e == "string" ? t.push(S(e, null)) : e.data && t.push(S(e.data, e.mode)), t;
-      }, []);
-    }, m.fromString = function(o, t) {
-      const e = M(o, p.isKanjiModeEnabled()), s = w(e), i = K(s, t), a = R.find_path(i.map, "start", "end"), l = [];
-      for (let g = 1; g < a.length - 1; g++)
-        l.push(i.table[a[g]].node);
-      return m.fromArray(U(l));
-    }, m.rawSplit = function(o) {
-      return m.fromArray(
-        M(o, p.isKanjiModeEnabled())
-      );
+    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, g(t, e, n));
+    }, r.getBestMask = function(t, l) {
+      const s = Object.keys(r.Patterns).length;
+      let n = 0, e = 1 / 0;
+      for (let i = 0; i < s; i++) {
+        l(i), r.applyMask(i, t);
+        const o = r.getPenaltyN1(t) + r.getPenaltyN2(t) + r.getPenaltyN3(t) + r.getPenaltyN4(t);
+        r.applyMask(i, t), o < e && (e = o, n = i);
+      }
+      return n;
     };
-  })(N), N);
+  })(c), c);
 }
 export {
-  V as __require
+  R as __require
 };
 //# sourceMappingURL=index124.js.map

package/dist/index124.js.map

@@ -1 +1 @@
-{"version":3,"file":"index124.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/segments.js"],"sourcesContent":["const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param  {String} str Input string\n * @return {Number}     Number of byte\n */\nfunction getStringByteLength (str) {\n  return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param  {Mode}   mode Segment mode\n * @param  {String} str  String to process\n * @return {Array}       Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n  const segments = []\n  let result\n\n  while ((result = regex.exec(str)) !== null) {\n    segments.push({\n      data: result[0],\n      index: result.index,\n      mode: mode,\n      length: result[0].length\n    })\n  }\n\n  return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param  {String} dataStr Input string\n * @return {Array}          Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n  const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n  const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n  let byteSegs\n  let kanjiSegs\n\n  if (Utils.isKanjiModeEnabled()) {\n    byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n    kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n  } else {\n    byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n    kanjiSegs = []\n  }\n\n  const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n  return segs\n    .sort(function (s1, s2) {\n      return s1.index - s2.index\n    })\n    .map(function (obj) {\n      return {\n        data: obj.data,\n        mode: obj.mode,\n        length: obj.length\n      }\n    })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param  {Number} length String length\n * @param  {Mode} mode     Segment mode\n * @return {Number}        Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n  switch (mode) {\n    case Mode.NUMERIC:\n      return NumericData.getBitsLength(length)\n    case Mode.ALPHANUMERIC:\n      return AlphanumericData.getBitsLength(length)\n    case Mode.KANJI:\n      return KanjiData.getBitsLength(length)\n    case Mode.BYTE:\n      return ByteData.getBitsLength(length)\n  }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction mergeSegments (segs) {\n  return segs.reduce(function (acc, curr) {\n    const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n    if (prevSeg && prevSeg.mode === curr.mode) {\n      acc[acc.length - 1].data += curr.data\n      return acc\n    }\n\n    acc.push(curr)\n    return acc\n  }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction buildNodes (segs) {\n  const nodes = []\n  for (let i = 0; i < segs.length; i++) {\n    const seg = segs[i]\n\n    switch (seg.mode) {\n      case Mode.NUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.ALPHANUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.KANJI:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n        break\n      case Mode.BYTE:\n        nodes.push([\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n    }\n  }\n\n  return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param  {Array} nodes    Array of object with segments data\n * @param  {Number} version QR Code version\n * @return {Object}         Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n  const table = {}\n  const graph = { start: {} }\n  let prevNodeIds = ['start']\n\n  for (let i = 0; i < nodes.length; i++) {\n    const nodeGroup = nodes[i]\n    const currentNodeIds = []\n\n    for (let j = 0; j < nodeGroup.length; j++) {\n      const node = nodeGroup[j]\n      const key = '' + i + j\n\n      currentNodeIds.push(key)\n      table[key] = { node: node, lastCount: 0 }\n      graph[key] = {}\n\n      for (let n = 0; n < prevNodeIds.length; n++) {\n        const prevNodeId = prevNodeIds[n]\n\n        if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n          graph[prevNodeId][key] =\n            getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n            getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n          table[prevNodeId].lastCount += node.length\n        } else {\n          if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n          graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n            4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n        }\n      }\n    }\n\n    prevNodeIds = currentNodeIds\n  }\n\n  for (let n = 0; n < prevNodeIds.length; n++) {\n    graph[prevNodeIds[n]].end = 0\n  }\n\n  return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param  {String} data             Input data\n * @param  {Mode | String} modesHint Data mode\n * @return {Segment}                 Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n  let mode\n  const bestMode = Mode.getBestModeForData(data)\n\n  mode = Mode.from(modesHint, bestMode)\n\n  // Make sure data can be encoded\n  if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n    throw new Error('\"' + data + '\"' +\n      ' cannot be encoded with mode ' + Mode.toString(mode) +\n      '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n  }\n\n  // Use Mode.BYTE if Kanji support is disabled\n  if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n    mode = Mode.BYTE\n  }\n\n  switch (mode) {\n    case Mode.NUMERIC:\n      return new NumericData(data)\n\n    case Mode.ALPHANUMERIC:\n      return new AlphanumericData(data)\n\n    case Mode.KANJI:\n      return new KanjiData(data)\n\n    case Mode.BYTE:\n      return new ByteData(data)\n  }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param  {Array} array Array of objects with segments data\n * @return {Array}       Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n  return array.reduce(function (acc, seg) {\n    if (typeof seg === 'string') {\n      acc.push(buildSingleSegment(seg, null))\n    } else if (seg.data) {\n      acc.push(buildSingleSegment(seg.data, seg.mode))\n    }\n\n    return acc\n  }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param  {String} data    Input string\n * @param  {Number} version QR Code version\n * @return {Array}          Array of segments\n */\nexports.fromString = function fromString (data, version) {\n  const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n  const nodes = buildNodes(segs)\n  const graph = buildGraph(nodes, version)\n  const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n  const optimizedSegs = []\n  for (let i = 1; i < path.length - 1; i++) {\n    optimizedSegs.push(graph.table[path[i]].node)\n  }\n\n  return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param  {string} data Input string\n * @return {Array}       Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n  return exports.fromArray(\n    getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n  )\n}\n"],"names":["Mode","require$$0","NumericData","require$$1","AlphanumericData","require$$2","ByteData","require$$3","KanjiData","require$$4","Regex","require$$5","Utils","require$$6","dijkstra","require$$7","getStringByteLength","str","getSegments","regex","mode","segments","result","getSegmentsFromString","dataStr","numSegs","alphaNumSegs","byteSegs","kanjiSegs","s1","s2","obj","getSegmentBitsLength","length","mergeSegments","segs","acc","curr","prevSeg","buildNodes","nodes","i","seg","buildGraph","version","table","graph","prevNodeIds","nodeGroup","currentNodeIds","j","node","key","n","prevNodeId","buildSingleSegment","data","modesHint","bestMode","exports","array","path","optimizedSegs"],"mappings":";;;;;;;;;;;;AAAA,UAAMA,IAAOC,EAAA,GACPC,IAAcC,EAAA,GACdC,IAAmBC,EAAA,GACnBC,IAAWC,EAAA,GACXC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAWC,EAAA;AAQjB,aAASC,EAAqBC,GAAK;AACjC,aAAO,SAAS,mBAAmBA,CAAG,CAAC,EAAE;AAAA,IAC3C;AAUA,aAASC,EAAaC,GAAOC,GAAMH,GAAK;AACtC,YAAMI,IAAW,CAAA;AACjB,UAAIC;AAEJ,cAAQA,IAASH,EAAM,KAAKF,CAAG,OAAO;AACpC,QAAAI,EAAS,KAAK;AAAA,UACZ,MAAMC,EAAO,CAAC;AAAA,UACd,OAAOA,EAAO;AAAA,UACd,MAAMF;AAAA,UACN,QAAQE,EAAO,CAAC,EAAE;AAAA,SACnB;AAGH,aAAOD;AAAA,IACT;AASA,aAASE,EAAuBC,GAAS;AACvC,YAAMC,IAAUP,EAAYR,EAAM,SAASV,EAAK,SAASwB,CAAO,GAC1DE,IAAeR,EAAYR,EAAM,cAAcV,EAAK,cAAcwB,CAAO;AAC/E,UAAIG,GACAC;AAEJ,aAAIhB,EAAM,wBACRe,IAAWT,EAAYR,EAAM,MAAMV,EAAK,MAAMwB,CAAO,GACrDI,IAAYV,EAAYR,EAAM,OAAOV,EAAK,OAAOwB,CAAO,MAExDG,IAAWT,EAAYR,EAAM,YAAYV,EAAK,MAAMwB,CAAO,GAC3DI,IAAY,CAAA,IAGDH,EAAQ,OAAOC,GAAcC,GAAUC,CAAS,EAG1D,KAAK,SAAUC,GAAIC,GAAI;AACtB,eAAOD,EAAG,QAAQC,EAAG;AAAA,MAC3B,CAAK,EACA,IAAI,SAAUC,GAAK;AAClB,eAAO;AAAA,UACL,MAAMA,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA,EAAI;AAAA,QACpB;AAAA,MACA,CAAK;AAAA,IACL;AAUA,aAASC,EAAsBC,GAAQb,GAAM;AAC3C,cAAQA,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAOE,EAAY,cAAc+B,CAAM;AAAA,QACzC,KAAKjC,EAAK;AACR,iBAAOI,EAAiB,cAAc6B,CAAM;AAAA,QAC9C,KAAKjC,EAAK;AACR,iBAAOQ,EAAU,cAAcyB,CAAM;AAAA,QACvC,KAAKjC,EAAK;AACR,iBAAOM,EAAS,cAAc2B,CAAM;AAAA,MAC1C;AAAA,IACA;AAQA,aAASC,EAAeC,GAAM;AAC5B,aAAOA,EAAK,OAAO,SAAUC,GAAKC,GAAM;AACtC,cAAMC,IAAUF,EAAI,SAAS,KAAK,IAAIA,EAAIA,EAAI,SAAS,CAAC,IAAI;AAC5D,eAAIE,KAAWA,EAAQ,SAASD,EAAK,QACnCD,EAAIA,EAAI,SAAS,CAAC,EAAE,QAAQC,EAAK,MAC1BD,MAGTA,EAAI,KAAKC,CAAI,GACND;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP;AAkBA,aAASG,EAAYJ,GAAM;AACzB,YAAMK,IAAQ,CAAA;AACd,eAASC,IAAI,GAAGA,IAAIN,EAAK,QAAQM,KAAK;AACpC,cAAMC,IAAMP,EAAKM,CAAC;AAElB,gBAAQC,EAAI,MAAI;AAAA,UACd,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,cAAc,QAAQ0C,EAAI,OAAM;AAAA,cAC7D,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cACT,EAAE,MAAME,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AAAA,QACT;AAAA,MACA;AAEE,aAAOF;AAAA,IACT;AAcA,aAASG,EAAYH,GAAOI,GAAS;AACnC,YAAMC,IAAQ,CAAA,GACRC,IAAQ,EAAE,OAAO,CAAA,EAAE;AACzB,UAAIC,IAAc,CAAC,OAAO;AAE1B,eAAS,IAAI,GAAG,IAAIP,EAAM,QAAQ,KAAK;AACrC,cAAMQ,IAAYR,EAAM,CAAC,GACnBS,IAAiB,CAAA;AAEvB,iBAASC,IAAI,GAAGA,IAAIF,EAAU,QAAQE,KAAK;AACzC,gBAAMC,IAAOH,EAAUE,CAAC,GAClBE,IAAM,KAAK,IAAIF;AAErB,UAAAD,EAAe,KAAKG,CAAG,GACvBP,EAAMO,CAAG,IAAI,EAAE,MAAMD,GAAM,WAAW,EAAC,GACvCL,EAAMM,CAAG,IAAI,CAAA;AAEb,mBAASC,IAAI,GAAGA,IAAIN,EAAY,QAAQM,KAAK;AAC3C,kBAAMC,IAAaP,EAAYM,CAAC;AAEhC,YAAIR,EAAMS,CAAU,KAAKT,EAAMS,CAAU,EAAE,KAAK,SAASH,EAAK,QAC5DL,EAAMQ,CAAU,EAAEF,CAAG,IACnBpB,EAAqBa,EAAMS,CAAU,EAAE,YAAYH,EAAK,QAAQA,EAAK,IAAI,IACzEnB,EAAqBa,EAAMS,CAAU,EAAE,WAAWH,EAAK,IAAI,GAE7DN,EAAMS,CAAU,EAAE,aAAaH,EAAK,WAEhCN,EAAMS,CAAU,MAAGT,EAAMS,CAAU,EAAE,YAAYH,EAAK,SAE1DL,EAAMQ,CAAU,EAAEF,CAAG,IAAIpB,EAAqBmB,EAAK,QAAQA,EAAK,IAAI,IAClE,IAAInD,EAAK,sBAAsBmD,EAAK,MAAMP,CAAO;AAAA,UAE7D;AAAA,QACA;AAEI,QAAAG,IAAcE;AAAA,MAClB;AAEE,eAASI,IAAI,GAAGA,IAAIN,EAAY,QAAQM;AACtC,QAAAP,EAAMC,EAAYM,CAAC,CAAC,EAAE,MAAM;AAG9B,aAAO,EAAE,KAAKP,GAAO,OAAOD,EAAK;AAAA,IACnC;AAUA,aAASU,EAAoBC,GAAMC,GAAW;AAC5C,UAAIrC;AACJ,YAAMsC,IAAW1D,EAAK,mBAAmBwD,CAAI;AAK7C,UAHApC,IAAOpB,EAAK,KAAKyD,GAAWC,CAAQ,GAGhCtC,MAASpB,EAAK,QAAQoB,EAAK,MAAMsC,EAAS;AAC5C,cAAM,IAAI,MAAM,MAAMF,IAAO,mCACOxD,EAAK,SAASoB,CAAI,IACpD;AAAA,wBAA4BpB,EAAK,SAAS0D,CAAQ,CAAC;AAQvD,cAJItC,MAASpB,EAAK,SAAS,CAACY,EAAM,mBAAkB,MAClDQ,IAAOpB,EAAK,OAGNoB,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAO,IAAIE,EAAYsD,CAAI;AAAA,QAE7B,KAAKxD,EAAK;AACR,iBAAO,IAAII,EAAiBoD,CAAI;AAAA,QAElC,KAAKxD,EAAK;AACR,iBAAO,IAAIQ,EAAUgD,CAAI;AAAA,QAE3B,KAAKxD,EAAK;AACR,iBAAO,IAAIM,EAASkD,CAAI;AAAA,MAC9B;AAAA,IACA;AAiBAG,IAAAA,EAAA,YAAoB,SAAoBC,GAAO;AAC7C,aAAOA,EAAM,OAAO,SAAUxB,GAAKM,GAAK;AACtC,eAAI,OAAOA,KAAQ,WACjBN,EAAI,KAAKmB,EAAmBb,GAAK,IAAI,CAAC,IAC7BA,EAAI,QACbN,EAAI,KAAKmB,EAAmBb,EAAI,MAAMA,EAAI,IAAI,CAAC,GAG1CN;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP,GAUAuB,EAAA,aAAqB,SAAqBH,GAAMZ,GAAS;AACvD,YAAMT,IAAOZ,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE,GAE7D4B,IAAQD,EAAWJ,CAAI,GACvBW,IAAQH,EAAWH,GAAOI,CAAO,GACjCiB,IAAO/C,EAAS,UAAUgC,EAAM,KAAK,SAAS,KAAK,GAEnDgB,IAAgB,CAAA;AACtB,eAASrB,IAAI,GAAGA,IAAIoB,EAAK,SAAS,GAAGpB;AACnC,QAAAqB,EAAc,KAAKhB,EAAM,MAAMe,EAAKpB,CAAC,CAAC,EAAE,IAAI;AAG9C,aAAOkB,EAAQ,UAAUzB,EAAc4B,CAAa,CAAC;AAAA,IACvD,GAYAH,EAAA,WAAmB,SAAmBH,GAAM;AAC1C,aAAOG,EAAQ;AAAA,QACbpC,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE;AAAA,MAC1D;AAAA,IACA;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index124.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n  PATTERN000: 0,\n  PATTERN001: 1,\n  PATTERN010: 2,\n  PATTERN011: 3,\n  PATTERN100: 4,\n  PATTERN101: 5,\n  PATTERN110: 6,\n  PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n  N1: 3,\n  N2: 3,\n  N3: 40,\n  N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param  {Number}  mask    Mask pattern\n * @return {Boolean}         true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param  {Number|String} value        Mask pattern value\n * @return {Number}                     Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n  return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n  const size = data.size\n  let points = 0\n  let sameCountCol = 0\n  let sameCountRow = 0\n  let lastCol = null\n  let lastRow = null\n\n  for (let row = 0; row < size; row++) {\n    sameCountCol = sameCountRow = 0\n    lastCol = lastRow = null\n\n    for (let col = 0; col < size; col++) {\n      let module = data.get(row, col)\n      if (module === lastCol) {\n        sameCountCol++\n      } else {\n        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n        lastCol = module\n        sameCountCol = 1\n      }\n\n      module = data.get(col, row)\n      if (module === lastRow) {\n        sameCountRow++\n      } else {\n        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n        lastRow = module\n        sameCountRow = 1\n      }\n    }\n\n    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n  }\n\n  return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n  const size = data.size\n  let points = 0\n\n  for (let row = 0; row < size - 1; row++) {\n    for (let col = 0; col < size - 1; col++) {\n      const last = data.get(row, col) +\n        data.get(row, col + 1) +\n        data.get(row + 1, col) +\n        data.get(row + 1, col + 1)\n\n      if (last === 4 || last === 0) points++\n    }\n  }\n\n  return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n  const size = data.size\n  let points = 0\n  let bitsCol = 0\n  let bitsRow = 0\n\n  for (let row = 0; row < size; row++) {\n    bitsCol = bitsRow = 0\n    for (let col = 0; col < size; col++) {\n      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n    }\n  }\n\n  return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n  let darkCount = 0\n  const modulesCount = data.data.length\n\n  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n  return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param  {Number} maskPattern Pattern reference value\n * @param  {Number} i           Row\n * @param  {Number} j           Column\n * @return {Boolean}            Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n  switch (maskPattern) {\n    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n    case exports.Patterns.PATTERN001: return i % 2 === 0\n    case exports.Patterns.PATTERN010: return j % 3 === 0\n    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n    default: throw new Error('bad maskPattern:' + maskPattern)\n  }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param  {Number}    pattern Pattern reference number\n * @param  {BitMatrix} data    BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n  const size = data.size\n\n  for (let col = 0; col < size; col++) {\n    for (let row = 0; row < size; row++) {\n      if (data.isReserved(row, col)) continue\n      data.xor(row, col, getMaskAt(pattern, row, col))\n    }\n  }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param  {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n  const numPatterns = Object.keys(exports.Patterns).length\n  let bestPattern = 0\n  let lowerPenalty = Infinity\n\n  for (let p = 0; p < numPatterns; p++) {\n    setupFormatFunc(p)\n    exports.applyMask(p, data)\n\n    // Calculate penalty\n    const penalty =\n      exports.getPenaltyN1(data) +\n      exports.getPenaltyN2(data) +\n      exports.getPenaltyN3(data) +\n      exports.getPenaltyN4(data)\n\n    // Undo previously applied mask\n    exports.applyMask(p, data)\n\n    if (penalty < lowerPenalty) {\n      lowerPenalty = penalty\n      bestPattern = p\n    }\n  }\n\n  return bestPattern\n}\n"],"names":["exports","PenaltyScores","mask","value","data","size","points","sameCountCol","sameCountRow","lastCol","lastRow","row","col","module","last","bitsCol","bitsRow","darkCount","modulesCount","i","getMaskAt","maskPattern","j","pattern","setupFormatFunc","numPatterns","bestPattern","lowerPenalty","p","penalty"],"mappings":";;;;AAIAA,IAAAA,EAAA,WAAmB;AAAA,MACjB,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,IACd;AAMA,UAAMC,IAAgB;AAAA,MACpB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AAQAD,IAAAA,EAAA,UAAkB,SAAkBE,GAAM;AACxC,aAAOA,KAAQ,QAAQA,MAAS,MAAM,CAAC,MAAMA,CAAI,KAAKA,KAAQ,KAAKA,KAAQ;AAAA,IAC7E,GASAF,EAAA,OAAe,SAAeG,GAAO;AACnC,aAAOH,EAAQ,QAAQG,CAAK,IAAI,SAASA,GAAO,EAAE,IAAI;AAAA,IACxD,GASAH,EAAA,eAAuB,SAAuBI,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS,GACTC,IAAe,GACfC,IAAe,GACfC,IAAU,MACVC,IAAU;AAEd,eAASC,IAAM,GAAGA,IAAMN,GAAMM,KAAO;AACnC,QAAAJ,IAAeC,IAAe,GAC9BC,IAAUC,IAAU;AAEpB,iBAASE,IAAM,GAAGA,IAAMP,GAAMO,KAAO;AACnC,cAAIC,IAAST,EAAK,IAAIO,GAAKC,CAAG;AAC9B,UAAIC,MAAWJ,IACbF,OAEIA,KAAgB,MAAGD,KAAUL,EAAc,MAAMM,IAAe,KACpEE,IAAUI,GACVN,IAAe,IAGjBM,IAAST,EAAK,IAAIQ,GAAKD,CAAG,GACtBE,MAAWH,IACbF,OAEIA,KAAgB,MAAGF,KAAUL,EAAc,MAAMO,IAAe,KACpEE,IAAUG,GACVL,IAAe;AAAA,QAEvB;AAEI,QAAID,KAAgB,MAAGD,KAAUL,EAAc,MAAMM,IAAe,KAChEC,KAAgB,MAAGF,KAAUL,EAAc,MAAMO,IAAe;AAAA,MACxE;AAEE,aAAOF;AAAA,IACT,GAOAN,EAAA,eAAuB,SAAuBI,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS;AAEb,eAASK,IAAM,GAAGA,IAAMN,IAAO,GAAGM;AAChC,iBAASC,IAAM,GAAGA,IAAMP,IAAO,GAAGO,KAAO;AACvC,gBAAME,IAAOV,EAAK,IAAIO,GAAKC,CAAG,IAC5BR,EAAK,IAAIO,GAAKC,IAAM,CAAC,IACrBR,EAAK,IAAIO,IAAM,GAAGC,CAAG,IACrBR,EAAK,IAAIO,IAAM,GAAGC,IAAM,CAAC;AAE3B,WAAIE,MAAS,KAAKA,MAAS,MAAGR;AAAA,QACpC;AAGE,aAAOA,IAASL,EAAc;AAAA,IAChC,GAQAD,EAAA,eAAuB,SAAuBI,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS,GACTS,IAAU,GACVC,IAAU;AAEd,eAASL,IAAM,GAAGA,IAAMN,GAAMM,KAAO;AACnC,QAAAI,IAAUC,IAAU;AACpB,iBAASJ,IAAM,GAAGA,IAAMP,GAAMO;AAC5B,UAAAG,IAAYA,KAAW,IAAK,OAASX,EAAK,IAAIO,GAAKC,CAAG,GAClDA,KAAO,OAAOG,MAAY,QAASA,MAAY,OAAQT,KAE3DU,IAAYA,KAAW,IAAK,OAASZ,EAAK,IAAIQ,GAAKD,CAAG,GAClDC,KAAO,OAAOI,MAAY,QAASA,MAAY,OAAQV;AAAA,MAEjE;AAEE,aAAOA,IAASL,EAAc;AAAA,IAChC,GAUAD,EAAA,eAAuB,SAAuBI,GAAM;AAClD,UAAIa,IAAY;AAChB,YAAMC,IAAed,EAAK,KAAK;AAE/B,eAASe,IAAI,GAAGA,IAAID,GAAcC,IAAK,CAAAF,KAAab,EAAK,KAAKe,CAAC;AAI/D,aAFU,KAAK,IAAI,KAAK,KAAMF,IAAY,MAAMC,IAAgB,CAAC,IAAI,EAAE,IAE5DjB,EAAc;AAAA,IAC3B;AAUA,aAASmB,EAAWC,GAAaF,GAAGG,GAAG;AACrC,cAAQD,GAAW;AAAA,QACjB,KAAKrB,EAAQ,SAAS;AAAY,kBAAQmB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKtB,EAAQ,SAAS;AAAY,iBAAOmB,IAAI,MAAM;AAAA,QACnD,KAAKnB,EAAQ,SAAS;AAAY,iBAAOsB,IAAI,MAAM;AAAA,QACnD,KAAKtB,EAAQ,SAAS;AAAY,kBAAQmB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKtB,EAAQ,SAAS;AAAY,kBAAQ,KAAK,MAAMmB,IAAI,CAAC,IAAI,KAAK,MAAMG,IAAI,CAAC,KAAK,MAAM;AAAA,QACzF,KAAKtB,EAAQ,SAAS;AAAY,iBAAQmB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,MAAM;AAAA,QACvE,KAAKtB,EAAQ,SAAS;AAAY,kBAASmB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,KAAK,MAAM;AAAA,QAC7E,KAAKtB,EAAQ,SAAS;AAAY,kBAASmB,IAAIG,IAAK,KAAKH,IAAIG,KAAK,KAAK,MAAM;AAAA,QAE7E;AAAS,gBAAM,IAAI,MAAM,qBAAqBD,CAAW;AAAA,MAC7D;AAAA,IACA;AAQArB,IAAAA,EAAA,YAAoB,SAAoBuB,GAASnB,GAAM;AACrD,YAAMC,IAAOD,EAAK;AAElB,eAASQ,IAAM,GAAGA,IAAMP,GAAMO;AAC5B,iBAASD,IAAM,GAAGA,IAAMN,GAAMM;AAC5B,UAAIP,EAAK,WAAWO,GAAKC,CAAG,KAC5BR,EAAK,IAAIO,GAAKC,GAAKQ,EAAUG,GAASZ,GAAKC,CAAG,CAAC;AAAA,IAGrD,GAQAZ,EAAA,cAAsB,SAAsBI,GAAMoB,GAAiB;AACjE,YAAMC,IAAc,OAAO,KAAKzB,EAAQ,QAAQ,EAAE;AAClD,UAAI0B,IAAc,GACdC,IAAe;AAEnB,eAASC,IAAI,GAAGA,IAAIH,GAAaG,KAAK;AACpC,QAAAJ,EAAgBI,CAAC,GACjB5B,EAAQ,UAAU4B,GAAGxB,CAAI;AAGzB,cAAMyB,IACJ7B,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI;AAG3BJ,QAAAA,EAAQ,UAAU4B,GAAGxB,CAAI,GAErByB,IAAUF,MACZA,IAAeE,GACfH,IAAcE;AAAA,MAEpB;AAEE,aAAOF;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}