asterui 0.11.0 → 0.12.1

package/dist/index115.js.map

@@ -1 +1 @@
-{"version":3,"file":"index115.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-code.js"],"sourcesContent":["const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L  M  Q  H\r\n  1, 1, 1, 1,\r\n  1, 1, 1, 1,\r\n  1, 1, 2, 2,\r\n  1, 2, 2, 4,\r\n  1, 2, 4, 4,\r\n  2, 4, 4, 4,\r\n  2, 4, 6, 5,\r\n  2, 4, 6, 6,\r\n  2, 5, 8, 8,\r\n  4, 5, 8, 8,\r\n  4, 5, 8, 11,\r\n  4, 8, 10, 11,\r\n  4, 9, 12, 16,\r\n  4, 9, 16, 16,\r\n  6, 10, 12, 18,\r\n  6, 10, 17, 16,\r\n  6, 11, 16, 19,\r\n  6, 13, 18, 21,\r\n  7, 14, 21, 25,\r\n  8, 16, 20, 25,\r\n  8, 17, 23, 25,\r\n  9, 17, 23, 34,\r\n  9, 18, 25, 30,\r\n  10, 20, 27, 32,\r\n  12, 21, 29, 35,\r\n  12, 23, 34, 37,\r\n  12, 25, 34, 40,\r\n  13, 26, 35, 42,\r\n  14, 28, 38, 45,\r\n  15, 29, 40, 48,\r\n  16, 31, 43, 51,\r\n  17, 33, 45, 54,\r\n  18, 35, 48, 57,\r\n  19, 37, 51, 60,\r\n  19, 38, 53, 63,\r\n  20, 40, 56, 66,\r\n  21, 43, 59, 70,\r\n  22, 45, 62, 74,\r\n  24, 47, 65, 77,\r\n  25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L  M  Q  H\r\n  7, 10, 13, 17,\r\n  10, 16, 22, 28,\r\n  15, 26, 36, 44,\r\n  20, 36, 52, 64,\r\n  26, 48, 72, 88,\r\n  36, 64, 96, 112,\r\n  40, 72, 108, 130,\r\n  48, 88, 132, 156,\r\n  60, 110, 160, 192,\r\n  72, 130, 192, 224,\r\n  80, 150, 224, 264,\r\n  96, 176, 260, 308,\r\n  104, 198, 288, 352,\r\n  120, 216, 320, 384,\r\n  132, 240, 360, 432,\r\n  144, 280, 408, 480,\r\n  168, 308, 448, 532,\r\n  180, 338, 504, 588,\r\n  196, 364, 546, 650,\r\n  224, 416, 600, 700,\r\n  224, 442, 644, 750,\r\n  252, 476, 690, 816,\r\n  270, 504, 750, 900,\r\n  300, 560, 810, 960,\r\n  312, 588, 870, 1050,\r\n  336, 644, 952, 1110,\r\n  360, 700, 1020, 1200,\r\n  390, 728, 1050, 1260,\r\n  420, 784, 1140, 1350,\r\n  450, 812, 1200, 1440,\r\n  480, 868, 1290, 1530,\r\n  510, 924, 1350, 1620,\r\n  540, 980, 1440, 1710,\r\n  570, 1036, 1530, 1800,\r\n  570, 1064, 1590, 1890,\r\n  600, 1120, 1680, 1980,\r\n  630, 1204, 1770, 2100,\r\n  660, 1260, 1860, 2220,\r\n  720, 1316, 1950, 2310,\r\n  750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n"],"names":["ECLevel","require$$0","EC_BLOCKS_TABLE","EC_CODEWORDS_TABLE","errorCorrectionCode","version","errorCorrectionLevel"],"mappings":";;;;;;AAAA,QAAMA,IAAUC,EAAA,GAEVC,IAAkB;AAAA;AAAA,IAEtB;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,KAGRC,IAAqB;AAAA;AAAA,IAEzB;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAK;AAAA,IACb;AAAA,IAAI;AAAA,IAAI;AAAA,IAAK;AAAA,IACb;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA;AAWnB,SAAAC,EAAA,iBAAyB,SAAyBC,GAASC,GAAsB;AAC/E,YAAQA,GAAoB;AAAA,MAC1B,KAAKN,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C;AACE;AAAA;EAEN,GAUAD,EAAA,yBAAiC,SAAiCC,GAASC,GAAsB;AAC/F,YAAQA,GAAoB;AAAA,MAC1B,KAAKN,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD;AACE;AAAA;EAEN;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index115.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n  this.buffer = []\n  this.length = 0\n}\n\nBitBuffer.prototype = {\n\n  get: function (index) {\n    const bufIndex = Math.floor(index / 8)\n    return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n  },\n\n  put: function (num, length) {\n    for (let i = 0; i < length; i++) {\n      this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n    }\n  },\n\n  getLengthInBits: function () {\n    return this.length\n  },\n\n  putBit: function (bit) {\n    const bufIndex = Math.floor(this.length / 8)\n    if (this.buffer.length <= bufIndex) {\n      this.buffer.push(0)\n    }\n\n    if (bit) {\n      this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n    }\n\n    this.length++\n  }\n}\n\nmodule.exports = BitBuffer\n"],"names":["BitBuffer","index","bufIndex","num","length","i","bit","bitBuffer"],"mappings":";;;;AAAA,WAASA,IAAa;AACpB,SAAK,SAAS,CAAA,GACd,KAAK,SAAS;AAAA,EAChB;AAEA,SAAAA,EAAU,YAAY;AAAA,IAEpB,KAAK,SAAUC,GAAO;AACpB,YAAMC,IAAW,KAAK,MAAMD,IAAQ,CAAC;AACrC,cAAS,KAAK,OAAOC,CAAQ,MAAO,IAAID,IAAQ,IAAM,OAAO;AAAA,IACjE;AAAA,IAEE,KAAK,SAAUE,GAAKC,GAAQ;AAC1B,eAASC,IAAI,GAAGA,IAAID,GAAQC;AAC1B,aAAK,QAASF,MAASC,IAASC,IAAI,IAAM,OAAO,CAAC;AAAA,IAExD;AAAA,IAEE,iBAAiB,WAAY;AAC3B,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAAQ,SAAUC,GAAK;AACrB,YAAMJ,IAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,MAAI,KAAK,OAAO,UAAUA,KACxB,KAAK,OAAO,KAAK,CAAC,GAGhBI,MACF,KAAK,OAAOJ,CAAQ,KAAM,QAAU,KAAK,SAAS,IAGpD,KAAK;AAAA,IACT;AAAA,EACA,GAEAK,IAAiBP;;","x_google_ignoreList":[0]}

package/dist/index116.js

@@ -1,28 +1,24 @@
-import { __require as h } from "./index130.js";
-var o, a;
-function g() {
-  if (a) return o;
-  a = 1;
-  const t = h();
-  function n(i) {
-    this.genPoly = void 0, this.degree = i, this.degree && this.initialize(this.degree);
+var n, s;
+function h() {
+  if (s) return n;
+  s = 1;
+  function i(t) {
+    if (!t || t < 1)
+      throw new Error("BitMatrix size must be defined and greater than 0");
+    this.size = t, this.data = new Uint8Array(t * t), this.reservedBit = new Uint8Array(t * t);
   }
-  return n.prototype.initialize = function(e) {
-    this.degree = e, this.genPoly = t.generateECPolynomial(this.degree);
-  }, n.prototype.encode = function(e) {
-    if (!this.genPoly)
-      throw new Error("Encoder not initialized");
-    const d = new Uint8Array(e.length + this.degree);
-    d.set(e);
-    const r = t.mod(d, this.genPoly), s = this.degree - r.length;
-    if (s > 0) {
-      const l = new Uint8Array(this.degree);
-      return l.set(r, s), l;
-    }
-    return r;
-  }, o = n, o;
+  return i.prototype.set = function(t, r, e, o) {
+    const a = t * this.size + r;
+    this.data[a] = e, o && (this.reservedBit[a] = !0);
+  }, i.prototype.get = function(t, r) {
+    return this.data[t * this.size + r];
+  }, i.prototype.xor = function(t, r, e) {
+    this.data[t * this.size + r] ^= e;
+  }, i.prototype.isReserved = function(t, r) {
+    return this.reservedBit[t * this.size + r];
+  }, n = i, n;
 }
 export {
-  g as __require
+  h as __require
 };
 //# sourceMappingURL=index116.js.map

package/dist/index116.js.map

@@ -1 +1 @@
-{"version":3,"file":"index116.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"names":["Polynomial","require$$0","ReedSolomonEncoder","degree","data","paddedData","remainder","start","buff","reedSolomonEncoder"],"mappings":";;;;;AAAA,QAAMA,IAAaC,EAAA;AAEnB,WAASC,EAAoBC,GAAQ;AACnC,SAAK,UAAU,QACf,KAAK,SAASA,GAEV,KAAK,UAAQ,KAAK,WAAW,KAAK,MAAM;AAAA,EAC9C;AAQA,SAAAD,EAAmB,UAAU,aAAa,SAAqBC,GAAQ;AAErE,SAAK,SAASA,GACd,KAAK,UAAUH,EAAW,qBAAqB,KAAK,MAAM;AAAA,EAC5D,GAQAE,EAAmB,UAAU,SAAS,SAAiBE,GAAM;AAC3D,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,yBAAyB;AAK3C,UAAMC,IAAa,IAAI,WAAWD,EAAK,SAAS,KAAK,MAAM;AAC3D,IAAAC,EAAW,IAAID,CAAI;AAInB,UAAME,IAAYN,EAAW,IAAIK,GAAY,KAAK,OAAO,GAKnDE,IAAQ,KAAK,SAASD,EAAU;AACtC,QAAIC,IAAQ,GAAG;AACb,YAAMC,IAAO,IAAI,WAAW,KAAK,MAAM;AACvC,aAAAA,EAAK,IAAIF,GAAWC,CAAK,GAElBC;AAAA,IACX;AAEE,WAAOF;AAAA,EACT,GAEAG,IAAiBP;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index116.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-matrix.js"],"sourcesContent":["/**\n * Helper class to handle QR Code symbol modules\n *\n * @param {Number} size Symbol size\n */\nfunction BitMatrix (size) {\n  if (!size || size < 1) {\n    throw new Error('BitMatrix size must be defined and greater than 0')\n  }\n\n  this.size = size\n  this.data = new Uint8Array(size * size)\n  this.reservedBit = new Uint8Array(size * size)\n}\n\n/**\n * Set bit value at specified location\n * If reserved flag is set, this bit will be ignored during masking process\n *\n * @param {Number}  row\n * @param {Number}  col\n * @param {Boolean} value\n * @param {Boolean} reserved\n */\nBitMatrix.prototype.set = function (row, col, value, reserved) {\n  const index = row * this.size + col\n  this.data[index] = value\n  if (reserved) this.reservedBit[index] = true\n}\n\n/**\n * Returns bit value at specified location\n *\n * @param  {Number}  row\n * @param  {Number}  col\n * @return {Boolean}\n */\nBitMatrix.prototype.get = function (row, col) {\n  return this.data[row * this.size + col]\n}\n\n/**\n * Applies xor operator at specified location\n * (used during masking process)\n *\n * @param {Number}  row\n * @param {Number}  col\n * @param {Boolean} value\n */\nBitMatrix.prototype.xor = function (row, col, value) {\n  this.data[row * this.size + col] ^= value\n}\n\n/**\n * Check if bit at specified location is reserved\n *\n * @param {Number}   row\n * @param {Number}   col\n * @return {Boolean}\n */\nBitMatrix.prototype.isReserved = function (row, col) {\n  return this.reservedBit[row * this.size + col]\n}\n\nmodule.exports = BitMatrix\n"],"names":["BitMatrix","size","row","col","value","reserved","index","bitMatrix"],"mappings":";;;;AAKA,WAASA,EAAWC,GAAM;AACxB,QAAI,CAACA,KAAQA,IAAO;AAClB,YAAM,IAAI,MAAM,mDAAmD;AAGrE,SAAK,OAAOA,GACZ,KAAK,OAAO,IAAI,WAAWA,IAAOA,CAAI,GACtC,KAAK,cAAc,IAAI,WAAWA,IAAOA,CAAI;AAAA,EAC/C;AAWA,SAAAD,EAAU,UAAU,MAAM,SAAUE,GAAKC,GAAKC,GAAOC,GAAU;AAC7D,UAAMC,IAAQJ,IAAM,KAAK,OAAOC;AAChC,SAAK,KAAKG,CAAK,IAAIF,GACfC,MAAU,KAAK,YAAYC,CAAK,IAAI;AAAA,EAC1C,GASAN,EAAU,UAAU,MAAM,SAAUE,GAAKC,GAAK;AAC5C,WAAO,KAAK,KAAKD,IAAM,KAAK,OAAOC,CAAG;AAAA,EACxC,GAUAH,EAAU,UAAU,MAAM,SAAUE,GAAKC,GAAKC,GAAO;AACnD,SAAK,KAAKF,IAAM,KAAK,OAAOC,CAAG,KAAKC;AAAA,EACtC,GASAJ,EAAU,UAAU,aAAa,SAAUE,GAAKC,GAAK;AACnD,WAAO,KAAK,YAAYD,IAAM,KAAK,OAAOC,CAAG;AAAA,EAC/C,GAEAI,IAAiBP;;","x_google_ignoreList":[0]}

package/dist/index117.js

@@ -1,76 +1,27 @@
-import { __exports as f } from "./index131.js";
-import { __require as M } from "./index108.js";
-import { __require as w } from "./index115.js";
-import { __require as D } from "./index109.js";
-import { __require as p } from "./index119.js";
-import { __require as y } from "./index132.js";
-var B;
-function H() {
-  return B ? f : (B = 1, (function(i) {
-    const u = M(), m = w(), l = D(), n = p(), a = y(), d = 7973, g = u.getBCHDigit(d);
-    function E(o, e, r) {
-      for (let t = 1; t <= 40; t++)
-        if (e <= i.getCapacity(t, r, o))
-          return t;
-    }
-    function C(o, e) {
-      return n.getCharCountIndicator(o, e) + 4;
-    }
-    function _(o, e) {
-      let r = 0;
-      return o.forEach(function(t) {
-        const s = C(t.mode, e);
-        r += s + t.getBitsLength();
-      }), r;
-    }
-    function q(o, e) {
-      for (let r = 1; r <= 40; r++)
-        if (_(o, r) <= i.getCapacity(r, e, n.MIXED))
-          return r;
-    }
-    i.from = function(e, r) {
-      return a.isValid(e) ? parseInt(e, 10) : r;
-    }, i.getCapacity = function(e, r, t) {
-      if (!a.isValid(e))
-        throw new Error("Invalid QR Code version");
-      typeof t > "u" && (t = n.BYTE);
-      const s = u.getSymbolTotalCodewords(e), V = m.getTotalCodewordsCount(e, r), h = (s - V) * 8;
-      if (t === n.MIXED) return h;
-      const c = h - C(t, e);
-      switch (t) {
-        case n.NUMERIC:
-          return Math.floor(c / 10 * 3);
-        case n.ALPHANUMERIC:
-          return Math.floor(c / 11 * 2);
-        case n.KANJI:
-          return Math.floor(c / 13);
-        case n.BYTE:
-        default:
-          return Math.floor(c / 8);
-      }
-    }, i.getBestVersionForData = function(e, r) {
-      let t;
-      const s = l.from(r, l.M);
-      if (Array.isArray(e)) {
-        if (e.length > 1)
-          return q(e, s);
-        if (e.length === 0)
-          return 1;
-        t = e[0];
-      } else
-        t = e;
-      return E(t.mode, t.getLength(), s);
-    }, i.getEncodedBits = function(e) {
-      if (!a.isValid(e) || e < 7)
-        throw new Error("Invalid QR Code version");
-      let r = e << 12;
-      for (; u.getBCHDigit(r) - g >= 0; )
-        r ^= d << u.getBCHDigit(r) - g;
-      return e << 12 | r;
+import { __exports as u } from "./index132.js";
+import { __require as a } from "./index113.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;
     };
-  })(f), f);
+  })(u), u);
 }
 export {
-  H as __require
+  p as __require
 };
 //# sourceMappingURL=index117.js.map

package/dist/index117.js.map

@@ -1 +1 @@
-{"version":3,"file":"index117.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/version.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECCode = require('./error-correction-code')\nconst ECLevel = require('./error-correction-level')\nconst Mode = require('./mode')\nconst VersionCheck = require('./version-check')\n\n// Generator polynomial used to encode version information\nconst G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)\nconst G18_BCH = Utils.getBCHDigit(G18)\n\nfunction getBestVersionForDataLength (mode, length, errorCorrectionLevel) {\n  for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n    if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {\n      return currentVersion\n    }\n  }\n\n  return undefined\n}\n\nfunction getReservedBitsCount (mode, version) {\n  // Character count indicator + mode indicator bits\n  return Mode.getCharCountIndicator(mode, version) + 4\n}\n\nfunction getTotalBitsFromDataArray (segments, version) {\n  let totalBits = 0\n\n  segments.forEach(function (data) {\n    const reservedBits = getReservedBitsCount(data.mode, version)\n    totalBits += reservedBits + data.getBitsLength()\n  })\n\n  return totalBits\n}\n\nfunction getBestVersionForMixedData (segments, errorCorrectionLevel) {\n  for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {\n    const length = getTotalBitsFromDataArray(segments, currentVersion)\n    if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {\n      return currentVersion\n    }\n  }\n\n  return undefined\n}\n\n/**\n * Returns version number from a value.\n * If value is not a valid version, returns defaultValue\n *\n * @param  {Number|String} value        QR Code version\n * @param  {Number}        defaultValue Fallback value\n * @return {Number}                     QR Code version number\n */\nexports.from = function from (value, defaultValue) {\n  if (VersionCheck.isValid(value)) {\n    return parseInt(value, 10)\n  }\n\n  return defaultValue\n}\n\n/**\n * Returns how much data can be stored with the specified QR code version\n * and error correction level\n *\n * @param  {Number} version              QR Code version (1-40)\n * @param  {Number} errorCorrectionLevel Error correction level\n * @param  {Mode}   mode                 Data mode\n * @return {Number}                      Quantity of storable data\n */\nexports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid QR Code version')\n  }\n\n  // Use Byte mode as default\n  if (typeof mode === 'undefined') mode = Mode.BYTE\n\n  // Total codewords for this QR code version (Data + Error correction)\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n  // Total number of error correction codewords\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n  // Total number of data codewords\n  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n  if (mode === Mode.MIXED) return dataTotalCodewordsBits\n\n  const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)\n\n  // Return max number of storable codewords\n  switch (mode) {\n    case Mode.NUMERIC:\n      return Math.floor((usableBits / 10) * 3)\n\n    case Mode.ALPHANUMERIC:\n      return Math.floor((usableBits / 11) * 2)\n\n    case Mode.KANJI:\n      return Math.floor(usableBits / 13)\n\n    case Mode.BYTE:\n    default:\n      return Math.floor(usableBits / 8)\n  }\n}\n\n/**\n * Returns the minimum version needed to contain the amount of data\n *\n * @param  {Segment} data                    Segment of data\n * @param  {Number} [errorCorrectionLevel=H] Error correction level\n * @param  {Mode} mode                       Data mode\n * @return {Number}                          QR Code version\n */\nexports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {\n  let seg\n\n  const ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)\n\n  if (Array.isArray(data)) {\n    if (data.length > 1) {\n      return getBestVersionForMixedData(data, ecl)\n    }\n\n    if (data.length === 0) {\n      return 1\n    }\n\n    seg = data[0]\n  } else {\n    seg = data\n  }\n\n  return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)\n}\n\n/**\n * Returns version information with relative error correction bits\n *\n * The version information is included in QR Code symbols of version 7 or larger.\n * It consists of an 18-bit sequence containing 6 data bits,\n * with 12 error correction bits calculated using the (18, 6) Golay code.\n *\n * @param  {Number} version QR Code version\n * @return {Number}         Encoded version info bits\n */\nexports.getEncodedBits = function getEncodedBits (version) {\n  if (!VersionCheck.isValid(version) || version < 7) {\n    throw new Error('Invalid QR Code version')\n  }\n\n  let d = version << 12\n\n  while (Utils.getBCHDigit(d) - G18_BCH >= 0) {\n    d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))\n  }\n\n  return (version << 12) | d\n}\n"],"names":["Utils","require$$0","ECCode","require$$1","ECLevel","require$$2","Mode","require$$3","VersionCheck","require$$4","G18","G18_BCH","getBestVersionForDataLength","mode","length","errorCorrectionLevel","currentVersion","exports","getReservedBitsCount","version","getTotalBitsFromDataArray","segments","totalBits","data","reservedBits","getBestVersionForMixedData","value","defaultValue","totalCodewords","ecTotalCodewords","dataTotalCodewordsBits","usableBits","seg","ecl","d"],"mappings":";;;;;;;;;AAAA,UAAMA,IAAQC,EAAA,GACRC,IAASC,EAAA,GACTC,IAAUC,EAAA,GACVC,IAAOC,EAAA,GACPC,IAAeC,EAAA,GAGfC,IAAO,MACPC,IAAUX,EAAM,YAAYU,CAAG;AAErC,aAASE,EAA6BC,GAAMC,GAAQC,GAAsB;AACxE,eAASC,IAAiB,GAAGA,KAAkB,IAAIA;AACjD,YAAIF,KAAUG,EAAQ,YAAYD,GAAgBD,GAAsBF,CAAI;AAC1E,iBAAOG;AAAA,IAKb;AAEA,aAASE,EAAsBL,GAAMM,GAAS;AAE5C,aAAOb,EAAK,sBAAsBO,GAAMM,CAAO,IAAI;AAAA,IACrD;AAEA,aAASC,EAA2BC,GAAUF,GAAS;AACrD,UAAIG,IAAY;AAEhB,aAAAD,EAAS,QAAQ,SAAUE,GAAM;AAC/B,cAAMC,IAAeN,EAAqBK,EAAK,MAAMJ,CAAO;AAC5D,QAAAG,KAAaE,IAAeD,EAAK,cAAa;AAAA,MAClD,CAAG,GAEMD;AAAA,IACT;AAEA,aAASG,EAA4BJ,GAAUN,GAAsB;AACnE,eAASC,IAAiB,GAAGA,KAAkB,IAAIA;AAEjD,YADeI,EAA0BC,GAAUL,CAAc,KACnDC,EAAQ,YAAYD,GAAgBD,GAAsBT,EAAK,KAAK;AAChF,iBAAOU;AAAA,IAKb;AAUAC,IAAAA,EAAA,OAAe,SAAeS,GAAOC,GAAc;AACjD,aAAInB,EAAa,QAAQkB,CAAK,IACrB,SAASA,GAAO,EAAE,IAGpBC;AAAA,IACT,GAWAV,EAAA,cAAsB,SAAsBE,GAASJ,GAAsBF,GAAM;AAC/E,UAAI,CAACL,EAAa,QAAQW,CAAO;AAC/B,cAAM,IAAI,MAAM,yBAAyB;AAI3C,MAAI,OAAON,IAAS,QAAaA,IAAOP,EAAK;AAG7C,YAAMsB,IAAiB5B,EAAM,wBAAwBmB,CAAO,GAGtDU,IAAmB3B,EAAO,uBAAuBiB,GAASJ,CAAoB,GAG9Ee,KAA0BF,IAAiBC,KAAoB;AAErE,UAAIhB,MAASP,EAAK,MAAO,QAAOwB;AAEhC,YAAMC,IAAaD,IAAyBZ,EAAqBL,GAAMM,CAAO;AAG9E,cAAQN,GAAI;AAAA,QACV,KAAKP,EAAK;AACR,iBAAO,KAAK,MAAOyB,IAAa,KAAM,CAAC;AAAA,QAEzC,KAAKzB,EAAK;AACR,iBAAO,KAAK,MAAOyB,IAAa,KAAM,CAAC;AAAA,QAEzC,KAAKzB,EAAK;AACR,iBAAO,KAAK,MAAMyB,IAAa,EAAE;AAAA,QAEnC,KAAKzB,EAAK;AAAA,QACV;AACE,iBAAO,KAAK,MAAMyB,IAAa,CAAC;AAAA,MACtC;AAAA,IACA,GAUAd,EAAA,wBAAgC,SAAgCM,GAAMR,GAAsB;AAC1F,UAAIiB;AAEJ,YAAMC,IAAM7B,EAAQ,KAAKW,GAAsBX,EAAQ,CAAC;AAExD,UAAI,MAAM,QAAQmB,CAAI,GAAG;AACvB,YAAIA,EAAK,SAAS;AAChB,iBAAOE,EAA2BF,GAAMU,CAAG;AAG7C,YAAIV,EAAK,WAAW;AAClB,iBAAO;AAGT,QAAAS,IAAMT,EAAK,CAAC;AAAA,MAChB;AACI,QAAAS,IAAMT;AAGR,aAAOX,EAA4BoB,EAAI,MAAMA,EAAI,UAAS,GAAIC,CAAG;AAAA,IACnE,GAYAhB,EAAA,iBAAyB,SAAyBE,GAAS;AACzD,UAAI,CAACX,EAAa,QAAQW,CAAO,KAAKA,IAAU;AAC9C,cAAM,IAAI,MAAM,yBAAyB;AAG3C,UAAIe,IAAIf,KAAW;AAEnB,aAAOnB,EAAM,YAAYkC,CAAC,IAAIvB,KAAW;AACvC,QAAAuB,KAAMxB,KAAQV,EAAM,YAAYkC,CAAC,IAAIvB;AAGvC,aAAQQ,KAAW,KAAMe;AAAA,IAC3B;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index117.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/index118.js

@@ -1,19 +1,23 @@
 import { __exports as e } from "./index133.js";
-import { __require as f } from "./index108.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;
+import { __require as s } from "./index113.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 {
-  m as __require
+  f as __require
 };
 //# sourceMappingURL=index118.js.map

package/dist/index118.js.map

@@ -1 +1 @@
-{"version":3,"file":"index118.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":"index118.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/index119.js

@@ -1,69 +1,103 @@
 import { __exports as c } from "./index134.js";
-import { __require as o } from "./index132.js";
-import { __require as s } from "./index135.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;
+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
     };
-    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;
+    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 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++;
+        }
+      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++;
+      }
+      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("Unknown mode: " + t);
+          throw new Error("bad maskPattern:" + P);
       }
     }
-    i.from = function(r, n) {
-      if (i.isValid(r))
-        return r;
-      try {
-        return f(r);
-      } catch {
-        return n;
+    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;
     };
   })(c), c);
 }
 export {
-  E as __require
+  R as __require
 };
 //# sourceMappingURL=index119.js.map

package/dist/index119.js.map

@@ -1 +1 @@
-{"version":3,"file":"index119.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":"index119.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]}