asterui 0.12.1 → 0.12.2

package/dist/index120.js

@@ -1,363 +1,29 @@
-import { __exports as u } from "./index135.js";
-import { __require as a } from "./index114.js";
-var c;
-function i() {
-  if (c) return u;
-  c = 1;
-  const e = a(), t = [
-    // L  M  Q  H
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    1,
-    2,
-    2,
-    1,
-    2,
-    2,
-    4,
-    1,
-    2,
-    4,
-    4,
-    2,
-    4,
-    4,
-    4,
-    2,
-    4,
-    6,
-    5,
-    2,
-    4,
-    6,
-    6,
-    2,
-    5,
-    8,
-    8,
-    4,
-    5,
-    8,
-    8,
-    4,
-    5,
-    8,
-    11,
-    4,
-    8,
-    10,
-    11,
-    4,
-    9,
-    12,
-    16,
-    4,
-    9,
-    16,
-    16,
-    6,
-    10,
-    12,
-    18,
-    6,
-    10,
-    17,
-    16,
-    6,
-    11,
-    16,
-    19,
-    6,
-    13,
-    18,
-    21,
-    7,
-    14,
-    21,
-    25,
-    8,
-    16,
-    20,
-    25,
-    8,
-    17,
-    23,
-    25,
-    9,
-    17,
-    23,
-    34,
-    9,
-    18,
-    25,
-    30,
-    10,
-    20,
-    27,
-    32,
-    12,
-    21,
-    29,
-    35,
-    12,
-    23,
-    34,
-    37,
-    12,
-    25,
-    34,
-    40,
-    13,
-    26,
-    35,
-    42,
-    14,
-    28,
-    38,
-    45,
-    15,
-    29,
-    40,
-    48,
-    16,
-    31,
-    43,
-    51,
-    17,
-    33,
-    45,
-    54,
-    18,
-    35,
-    48,
-    57,
-    19,
-    37,
-    51,
-    60,
-    19,
-    38,
-    53,
-    63,
-    20,
-    40,
-    56,
-    66,
-    21,
-    43,
-    59,
-    70,
-    22,
-    45,
-    62,
-    74,
-    24,
-    47,
-    65,
-    77,
-    25,
-    49,
-    68,
-    81
-  ], o = [
-    // L  M  Q  H
-    7,
-    10,
-    13,
-    17,
-    10,
-    16,
-    22,
-    28,
-    15,
-    26,
-    36,
-    44,
-    20,
-    36,
-    52,
-    64,
-    26,
-    48,
-    72,
-    88,
-    36,
-    64,
-    96,
-    112,
-    40,
-    72,
-    108,
-    130,
-    48,
-    88,
-    132,
-    156,
-    60,
-    110,
-    160,
-    192,
-    72,
-    130,
-    192,
-    224,
-    80,
-    150,
-    224,
-    264,
-    96,
-    176,
-    260,
-    308,
-    104,
-    198,
-    288,
-    352,
-    120,
-    216,
-    320,
-    384,
-    132,
-    240,
-    360,
-    432,
-    144,
-    280,
-    408,
-    480,
-    168,
-    308,
-    448,
-    532,
-    180,
-    338,
-    504,
-    588,
-    196,
-    364,
-    546,
-    650,
-    224,
-    416,
-    600,
-    700,
-    224,
-    442,
-    644,
-    750,
-    252,
-    476,
-    690,
-    816,
-    270,
-    504,
-    750,
-    900,
-    300,
-    560,
-    810,
-    960,
-    312,
-    588,
-    870,
-    1050,
-    336,
-    644,
-    952,
-    1110,
-    360,
-    700,
-    1020,
-    1200,
-    390,
-    728,
-    1050,
-    1260,
-    420,
-    784,
-    1140,
-    1350,
-    450,
-    812,
-    1200,
-    1440,
-    480,
-    868,
-    1290,
-    1530,
-    510,
-    924,
-    1350,
-    1620,
-    540,
-    980,
-    1440,
-    1710,
-    570,
-    1036,
-    1530,
-    1800,
-    570,
-    1064,
-    1590,
-    1890,
-    600,
-    1120,
-    1680,
-    1980,
-    630,
-    1204,
-    1770,
-    2100,
-    660,
-    1260,
-    1860,
-    2220,
-    720,
-    1316,
-    1950,
-    2310,
-    750,
-    1372,
-    2040,
-    2430
-  ];
-  return u.getBlocksCount = function(r, n) {
-    switch (n) {
-      case e.L:
-        return t[(r - 1) * 4 + 0];
-      case e.M:
-        return t[(r - 1) * 4 + 1];
-      case e.Q:
-        return t[(r - 1) * 4 + 2];
-      case e.H:
-        return t[(r - 1) * 4 + 3];
-      default:
-        return;
+var i, u;
+function n() {
+  if (u) return i;
+  u = 1;
+  function r() {
+    this.buffer = [], this.length = 0;
+  }
+  return r.prototype = {
+    get: function(f) {
+      const t = Math.floor(f / 8);
+      return (this.buffer[t] >>> 7 - f % 8 & 1) === 1;
+    },
+    put: function(f, t) {
+      for (let e = 0; e < t; e++)
+        this.putBit((f >>> t - e - 1 & 1) === 1);
+    },
+    getLengthInBits: function() {
+      return this.length;
+    },
+    putBit: function(f) {
+      const t = Math.floor(this.length / 8);
+      this.buffer.length <= t && this.buffer.push(0), f && (this.buffer[t] |= 128 >>> this.length % 8), this.length++;
     }
-  }, u.getTotalCodewordsCount = function(r, n) {
-    switch (n) {
-      case e.L:
-        return o[(r - 1) * 4 + 0];
-      case e.M:
-        return o[(r - 1) * 4 + 1];
-      case e.Q:
-        return o[(r - 1) * 4 + 2];
-      case e.H:
-        return o[(r - 1) * 4 + 3];
-      default:
-        return;
-    }
-  }, u;
+  }, i = r, i;
 }
 export {
-  i as __require
+  n as __require
 };
 //# sourceMappingURL=index120.js.map

package/dist/index120.js.map

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

@@ -1,28 +1,24 @@
-import { __require as h } from "./index136.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=index121.js.map

package/dist/index121.js.map

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

@@ -1,76 +1,27 @@
-import { __exports as f } from "./index137.js";
-import { __require as M } from "./index113.js";
-import { __require as w } from "./index120.js";
-import { __require as D } from "./index114.js";
-import { __require as p } from "./index124.js";
-import { __require as y } from "./index138.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 "./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;
     };
-  })(f), f);
+  })(u), u);
 }
 export {
-  H 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/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":"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]}