@ozdao/prometheus-framework 0.2.330 → 0.2.331

package/dist/node_modules/qrcode/lib/core/galois-field.js

@@ -1,32 +1,38 @@
 import { __exports as galoisField } from "../../../../_virtual/galois-field.js";
-const EXP_TABLE = new Uint8Array(512);
-const LOG_TABLE = new Uint8Array(256);
-(function initTables() {
-  let x = 1;
-  for (let i = 0; i < 255; i++) {
-    EXP_TABLE[i] = x;
-    LOG_TABLE[x] = i;
-    x <<= 1;
-    if (x & 256) {
-      x ^= 285;
+var hasRequiredGaloisField;
+function requireGaloisField() {
+  if (hasRequiredGaloisField) return galoisField;
+  hasRequiredGaloisField = 1;
+  const EXP_TABLE = new Uint8Array(512);
+  const LOG_TABLE = new Uint8Array(256);
+  (function initTables() {
+    let x = 1;
+    for (let i = 0; i < 255; i++) {
+      EXP_TABLE[i] = x;
+      LOG_TABLE[x] = i;
+      x <<= 1;
+      if (x & 256) {
+        x ^= 285;
+      }
     }
-  }
-  for (let i = 255; i < 512; i++) {
-    EXP_TABLE[i] = EXP_TABLE[i - 255];
-  }
-})();
-galoisField.log = function log(n) {
-  if (n < 1) throw new Error("log(" + n + ")");
-  return LOG_TABLE[n];
-};
-galoisField.exp = function exp(n) {
-  return EXP_TABLE[n];
-};
-galoisField.mul = function mul(x, y) {
-  if (x === 0 || y === 0) return 0;
-  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]];
-};
+    for (let i = 255; i < 512; i++) {
+      EXP_TABLE[i] = EXP_TABLE[i - 255];
+    }
+  })();
+  galoisField.log = function log(n) {
+    if (n < 1) throw new Error("log(" + n + ")");
+    return LOG_TABLE[n];
+  };
+  galoisField.exp = function exp(n) {
+    return EXP_TABLE[n];
+  };
+  galoisField.mul = function mul(x, y) {
+    if (x === 0 || y === 0) return 0;
+    return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]];
+  };
+  return galoisField;
+}
 export {
-  galoisField as default
+  requireGaloisField as __require
 };
 //# sourceMappingURL=galois-field.js.map

package/dist/node_modules/qrcode/lib/core/galois-field.js.map

@@ -1 +1 @@
-{"version":3,"file":"galois-field.js","sources":["../../../../../../node_modules/qrcode/lib/core/galois-field.js"],"sourcesContent":["const EXP_TABLE = new Uint8Array(512)\nconst LOG_TABLE = new Uint8Array(256)\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n  let x = 1\n  for (let i = 0; i < 255; i++) {\n    EXP_TABLE[i] = x\n    LOG_TABLE[x] = i\n\n    x <<= 1 // multiply by 2\n\n    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n    // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n      x ^= 0x11D\n    }\n  }\n\n  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n  // stay inside the bounds (because we will mainly use this table for the multiplication of\n  // two GF numbers, no more).\n  // @see {@link mul}\n  for (let i = 255; i < 512; i++) {\n    EXP_TABLE[i] = EXP_TABLE[i - 255]\n  }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n  if (n < 1) throw new Error('log(' + n + ')')\n  return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n  return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param  {Number} x\n * @param  {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n  if (x === 0 || y === 0) return 0\n\n  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n  // @see {@link initTables}\n  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n"],"names":[],"mappings":";AAAA,MAAM,YAAY,IAAI,WAAW,GAAG;AACpC,MAAM,YAAY,IAAI,WAAW,GAAG;AAAA,CASlC,SAAS,aAAc;AACvB,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,cAAU,CAAC,IAAI;AACf,cAAU,CAAC,IAAI;AAEf,UAAM;AAIN,QAAI,IAAI,KAAO;AACb,WAAK;AAAA,IACN;AAAA,EACF;AAMD,WAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,cAAU,CAAC,IAAI,UAAU,IAAI,GAAG;AAAA,EACjC;AACH;AAQA,YAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,MAAI,IAAI,EAAG,OAAM,IAAI,MAAM,SAAS,IAAI,GAAG;AAC3C,SAAO,UAAU,CAAC;AACpB;AAQA,YAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,SAAO,UAAU,CAAC;AACpB;AASA,YAAA,MAAc,SAAS,IAAK,GAAG,GAAG;AAChC,MAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAI/B,SAAO,UAAU,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AAC9C;","x_google_ignoreList":[0]}
+{"version":3,"file":"galois-field.js","sources":["../../../../../../node_modules/qrcode/lib/core/galois-field.js"],"sourcesContent":["const EXP_TABLE = new Uint8Array(512)\nconst LOG_TABLE = new Uint8Array(256)\n/**\n * Precompute the log and anti-log tables for faster computation later\n *\n * For each possible value in the galois field 2^8, we will pre-compute\n * the logarithm and anti-logarithm (exponential) of this value\n *\n * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}\n */\n;(function initTables () {\n  let x = 1\n  for (let i = 0; i < 255; i++) {\n    EXP_TABLE[i] = x\n    LOG_TABLE[x] = i\n\n    x <<= 1 // multiply by 2\n\n    // The QR code specification says to use byte-wise modulo 100011101 arithmetic.\n    // This means that when a number is 256 or larger, it should be XORed with 0x11D.\n    if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)\n      x ^= 0x11D\n    }\n  }\n\n  // Optimization: double the size of the anti-log table so that we don't need to mod 255 to\n  // stay inside the bounds (because we will mainly use this table for the multiplication of\n  // two GF numbers, no more).\n  // @see {@link mul}\n  for (let i = 255; i < 512; i++) {\n    EXP_TABLE[i] = EXP_TABLE[i - 255]\n  }\n}())\n\n/**\n * Returns log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.log = function log (n) {\n  if (n < 1) throw new Error('log(' + n + ')')\n  return LOG_TABLE[n]\n}\n\n/**\n * Returns anti-log value of n inside Galois Field\n *\n * @param  {Number} n\n * @return {Number}\n */\nexports.exp = function exp (n) {\n  return EXP_TABLE[n]\n}\n\n/**\n * Multiplies two number inside Galois Field\n *\n * @param  {Number} x\n * @param  {Number} y\n * @return {Number}\n */\nexports.mul = function mul (x, y) {\n  if (x === 0 || y === 0) return 0\n\n  // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized\n  // @see {@link initTables}\n  return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]\n}\n"],"names":[],"mappings":";;;;;AAAA,QAAM,YAAY,IAAI,WAAW,GAAG;AACpC,QAAM,YAAY,IAAI,WAAW,GAAG;AASnC,GAAC,SAAS,aAAc;AACvB,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,gBAAU,CAAC,IAAI;AACf,gBAAU,CAAC,IAAI;AAEf,YAAM;AAIN,UAAI,IAAI,KAAO;AACb,aAAK;AAAA,MACX;AAAA,IACA;AAME,aAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,gBAAU,CAAC,IAAI,UAAU,IAAI,GAAG;AAAA,IACpC;AAAA,EACA,GAAG;AAQH,cAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,QAAI,IAAI,EAAG,OAAM,IAAI,MAAM,SAAS,IAAI,GAAG;AAC3C,WAAO,UAAU,CAAC;AAAA,EACpB;AAQA,cAAA,MAAc,SAAS,IAAK,GAAG;AAC7B,WAAO,UAAU,CAAC;AAAA,EACpB;AASA,cAAA,MAAc,SAAS,IAAK,GAAG,GAAG;AAChC,QAAI,MAAM,KAAK,MAAM,EAAG,QAAO;AAI/B,WAAO,UAAU,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;AAAA,EAC9C;;;","x_google_ignoreList":[0]}

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

@@ -1,41 +1,46 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-require("./mode.cjs");
-require("./utils.cjs");
-const utils = require("../../../../_virtual/utils.cjs");
-const mode = require("../../../../_virtual/mode.cjs");
-const Mode = mode.__exports;
-const Utils = utils.__exports;
-function KanjiData(data) {
-  this.mode = Mode.KANJI;
-  this.data = data;
-}
-KanjiData.getBitsLength = function getBitsLength(length) {
-  return length * 13;
-};
-KanjiData.prototype.getLength = function getLength() {
-  return this.data.length;
-};
-KanjiData.prototype.getBitsLength = function getBitsLength2() {
-  return KanjiData.getBitsLength(this.data.length);
-};
-KanjiData.prototype.write = function(bitBuffer) {
-  let i;
-  for (i = 0; i < this.data.length; i++) {
-    let value = Utils.toSJIS(this.data[i]);
-    if (value >= 33088 && value <= 40956) {
-      value -= 33088;
-    } else if (value >= 57408 && value <= 60351) {
-      value -= 49472;
-    } else {
-      throw new Error(
-        "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
-      );
-    }
-    value = (value >>> 8 & 255) * 192 + (value & 255);
-    bitBuffer.put(value, 13);
+const mode = require("./mode.cjs");
+const utils = require("./utils.cjs");
+var kanjiData;
+var hasRequiredKanjiData;
+function requireKanjiData() {
+  if (hasRequiredKanjiData) return kanjiData;
+  hasRequiredKanjiData = 1;
+  const Mode = mode.__require();
+  const Utils = utils.__require();
+  function KanjiData(data) {
+    this.mode = Mode.KANJI;
+    this.data = data;
   }
-};
-var kanjiData = KanjiData;
-exports.kanjiData = kanjiData;
+  KanjiData.getBitsLength = function getBitsLength(length) {
+    return length * 13;
+  };
+  KanjiData.prototype.getLength = function getLength() {
+    return this.data.length;
+  };
+  KanjiData.prototype.getBitsLength = function getBitsLength() {
+    return KanjiData.getBitsLength(this.data.length);
+  };
+  KanjiData.prototype.write = function(bitBuffer) {
+    let i;
+    for (i = 0; i < this.data.length; i++) {
+      let value = Utils.toSJIS(this.data[i]);
+      if (value >= 33088 && value <= 40956) {
+        value -= 33088;
+      } else if (value >= 57408 && value <= 60351) {
+        value -= 49472;
+      } else {
+        throw new Error(
+          "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
+        );
+      }
+      value = (value >>> 8 & 255) * 192 + (value & 255);
+      bitBuffer.put(value, 13);
+    }
+  };
+  kanjiData = KanjiData;
+  return kanjiData;
+}
+exports.__require = requireKanjiData;
 //# sourceMappingURL=kanji-data.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"kanji-data.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1","getBitsLength"],"mappings":";;;;;;AAAA,MAAM,OAAOA,KAAiB;AAC9B,MAAM,QAAQC,MAAkB;AAEhC,SAAS,UAAW,MAAM;AACxB,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO;AACd;AAEA,UAAU,gBAAgB,SAAS,cAAe,QAAQ;AACxD,SAAO,SAAS;AAClB;AAEA,UAAU,UAAU,YAAY,SAAS,YAAa;AACpD,SAAO,KAAK,KAAK;AACnB;AAEA,UAAU,UAAU,gBAAgB,SAASC,iBAAiB;AAC5D,SAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AACjD;AAEA,UAAU,UAAU,QAAQ,SAAU,WAAW;AAC/C,MAAI;AAKJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,QAAI,QAAQ,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,QAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,eAAS;AAAA,IAGV,WAAU,SAAS,SAAU,SAAS,OAAQ;AAE7C,eAAS;AAAA,IACf,OAAW;AACL,YAAM,IAAI;AAAA,QACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,MACX;AAAA,IACpC;AAID,aAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AACH;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"kanji-data.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;AAAA,QAAM,OAAOA,KAAA,UAAA;AACb,QAAM,QAAQC,MAAA,UAAA;AAEd,WAAS,UAAW,MAAM;AACxB,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,YAAU,gBAAgB,SAAS,cAAe,QAAQ;AACxD,WAAO,SAAS;AAAA,EAClB;AAEA,YAAU,UAAU,YAAY,SAAS,YAAa;AACpD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,YAAU,UAAU,gBAAgB,SAAS,gBAAiB;AAC5D,WAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AAAA,EACjD;AAEA,YAAU,UAAU,QAAQ,SAAU,WAAW;AAC/C,QAAI;AAKJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,UAAI,QAAQ,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,UAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,iBAAS;AAAA,MAGV,WAAU,SAAS,SAAU,SAAS,OAAQ;AAE7C,iBAAS;AAAA,MACf,OAAW;AACL,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,QACX;AAAA,MACzC;AAII,eAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAAA,EACA;AAEA,cAAiB;;;;","x_google_ignoreList":[0]}

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

@@ -1,41 +1,46 @@
-import "./mode.js";
-import "./utils.js";
-import { __exports as utils } from "../../../../_virtual/utils.js";
-import { __exports as mode } from "../../../../_virtual/mode.js";
-const Mode = mode;
-const Utils = utils;
-function KanjiData(data) {
-  this.mode = Mode.KANJI;
-  this.data = data;
-}
-KanjiData.getBitsLength = function getBitsLength(length) {
-  return length * 13;
-};
-KanjiData.prototype.getLength = function getLength() {
-  return this.data.length;
-};
-KanjiData.prototype.getBitsLength = function getBitsLength2() {
-  return KanjiData.getBitsLength(this.data.length);
-};
-KanjiData.prototype.write = function(bitBuffer) {
-  let i;
-  for (i = 0; i < this.data.length; i++) {
-    let value = Utils.toSJIS(this.data[i]);
-    if (value >= 33088 && value <= 40956) {
-      value -= 33088;
-    } else if (value >= 57408 && value <= 60351) {
-      value -= 49472;
-    } else {
-      throw new Error(
-        "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
-      );
-    }
-    value = (value >>> 8 & 255) * 192 + (value & 255);
-    bitBuffer.put(value, 13);
+import { __require as requireMode } from "./mode.js";
+import { __require as requireUtils } from "./utils.js";
+var kanjiData;
+var hasRequiredKanjiData;
+function requireKanjiData() {
+  if (hasRequiredKanjiData) return kanjiData;
+  hasRequiredKanjiData = 1;
+  const Mode = requireMode();
+  const Utils = requireUtils();
+  function KanjiData(data) {
+    this.mode = Mode.KANJI;
+    this.data = data;
   }
-};
-var kanjiData = KanjiData;
+  KanjiData.getBitsLength = function getBitsLength(length) {
+    return length * 13;
+  };
+  KanjiData.prototype.getLength = function getLength() {
+    return this.data.length;
+  };
+  KanjiData.prototype.getBitsLength = function getBitsLength() {
+    return KanjiData.getBitsLength(this.data.length);
+  };
+  KanjiData.prototype.write = function(bitBuffer) {
+    let i;
+    for (i = 0; i < this.data.length; i++) {
+      let value = Utils.toSJIS(this.data[i]);
+      if (value >= 33088 && value <= 40956) {
+        value -= 33088;
+      } else if (value >= 57408 && value <= 60351) {
+        value -= 49472;
+      } else {
+        throw new Error(
+          "Invalid SJIS character: " + this.data[i] + "\nMake sure your charset is UTF-8"
+        );
+      }
+      value = (value >>> 8 & 255) * 192 + (value & 255);
+      bitBuffer.put(value, 13);
+    }
+  };
+  kanjiData = KanjiData;
+  return kanjiData;
+}
 export {
-  kanjiData as k
+  requireKanjiData as __require
 };
 //# sourceMappingURL=kanji-data.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"kanji-data.js","sources":["../../../../../../node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1","getBitsLength"],"mappings":";;;;AAAA,MAAM,OAAOA;AACb,MAAM,QAAQC;AAEd,SAAS,UAAW,MAAM;AACxB,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO;AACd;AAEA,UAAU,gBAAgB,SAAS,cAAe,QAAQ;AACxD,SAAO,SAAS;AAClB;AAEA,UAAU,UAAU,YAAY,SAAS,YAAa;AACpD,SAAO,KAAK,KAAK;AACnB;AAEA,UAAU,UAAU,gBAAgB,SAASC,iBAAiB;AAC5D,SAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AACjD;AAEA,UAAU,UAAU,QAAQ,SAAU,WAAW;AAC/C,MAAI;AAKJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,QAAI,QAAQ,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,QAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,eAAS;AAAA,IAGV,WAAU,SAAS,SAAU,SAAS,OAAQ;AAE7C,eAAS;AAAA,IACf,OAAW;AACL,YAAM,IAAI;AAAA,QACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,MACX;AAAA,IACpC;AAID,aAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AACH;AAEA,IAAA,YAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"kanji-data.js","sources":["../../../../../../node_modules/qrcode/lib/core/kanji-data.js"],"sourcesContent":["const Mode = require('./mode')\nconst Utils = require('./utils')\n\nfunction KanjiData (data) {\n  this.mode = Mode.KANJI\n  this.data = data\n}\n\nKanjiData.getBitsLength = function getBitsLength (length) {\n  return length * 13\n}\n\nKanjiData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nKanjiData.prototype.getBitsLength = function getBitsLength () {\n  return KanjiData.getBitsLength(this.data.length)\n}\n\nKanjiData.prototype.write = function (bitBuffer) {\n  let i\n\n  // In the Shift JIS system, Kanji characters are represented by a two byte combination.\n  // These byte values are shifted from the JIS X 0208 values.\n  // JIS X 0208 gives details of the shift coded representation.\n  for (i = 0; i < this.data.length; i++) {\n    let value = Utils.toSJIS(this.data[i])\n\n    // For characters with Shift JIS values from 0x8140 to 0x9FFC:\n    if (value >= 0x8140 && value <= 0x9FFC) {\n      // Subtract 0x8140 from Shift JIS value\n      value -= 0x8140\n\n    // For characters with Shift JIS values from 0xE040 to 0xEBBF\n    } else if (value >= 0xE040 && value <= 0xEBBF) {\n      // Subtract 0xC140 from Shift JIS value\n      value -= 0xC140\n    } else {\n      throw new Error(\n        'Invalid SJIS character: ' + this.data[i] + '\\n' +\n        'Make sure your charset is UTF-8')\n    }\n\n    // Multiply most significant byte of result by 0xC0\n    // and add least significant byte to product\n    value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)\n\n    // Convert result to a 13-bit binary string\n    bitBuffer.put(value, 13)\n  }\n}\n\nmodule.exports = KanjiData\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;AAAA,QAAM,OAAOA,YAAA;AACb,QAAM,QAAQC,aAAA;AAEd,WAAS,UAAW,MAAM;AACxB,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,YAAU,gBAAgB,SAAS,cAAe,QAAQ;AACxD,WAAO,SAAS;AAAA,EAClB;AAEA,YAAU,UAAU,YAAY,SAAS,YAAa;AACpD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,YAAU,UAAU,gBAAgB,SAAS,gBAAiB;AAC5D,WAAO,UAAU,cAAc,KAAK,KAAK,MAAM;AAAA,EACjD;AAEA,YAAU,UAAU,QAAQ,SAAU,WAAW;AAC/C,QAAI;AAKJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACrC,UAAI,QAAQ,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAGrC,UAAI,SAAS,SAAU,SAAS,OAAQ;AAEtC,iBAAS;AAAA,MAGV,WAAU,SAAS,SAAU,SAAS,OAAQ;AAE7C,iBAAS;AAAA,MACf,OAAW;AACL,cAAM,IAAI;AAAA,UACR,6BAA6B,KAAK,KAAK,CAAC,IAAI;AAAA,QACX;AAAA,MACzC;AAII,eAAW,UAAU,IAAK,OAAQ,OAAS,QAAQ;AAGnD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAAA,EACA;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

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

@@ -1,141 +1,149 @@
 "use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const maskPattern = require("../../../../_virtual/mask-pattern.cjs");
-(function(exports2) {
-  exports2.Patterns = {
-    PATTERN000: 0,
-    PATTERN001: 1,
-    PATTERN010: 2,
-    PATTERN011: 3,
-    PATTERN100: 4,
-    PATTERN101: 5,
-    PATTERN110: 6,
-    PATTERN111: 7
-  };
-  const PenaltyScores = {
-    N1: 3,
-    N2: 3,
-    N3: 40,
-    N4: 10
-  };
-  exports2.isValid = function isValid(mask) {
-    return mask != null && mask !== "" && !isNaN(mask) && mask >= 0 && mask <= 7;
-  };
-  exports2.from = function from(value) {
-    return exports2.isValid(value) ? parseInt(value, 10) : void 0;
-  };
-  exports2.getPenaltyN1 = function getPenaltyN1(data) {
-    const size = data.size;
-    let points = 0;
-    let sameCountCol = 0;
-    let sameCountRow = 0;
-    let lastCol = null;
-    let lastRow = null;
-    for (let row = 0; row < size; row++) {
-      sameCountCol = sameCountRow = 0;
-      lastCol = lastRow = null;
-      for (let col = 0; col < size; col++) {
-        let module2 = data.get(row, col);
-        if (module2 === lastCol) {
-          sameCountCol++;
-        } else {
-          if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
-          lastCol = module2;
-          sameCountCol = 1;
+var hasRequiredMaskPattern;
+function requireMaskPattern() {
+  if (hasRequiredMaskPattern) return maskPattern.__exports;
+  hasRequiredMaskPattern = 1;
+  (function(exports2) {
+    exports2.Patterns = {
+      PATTERN000: 0,
+      PATTERN001: 1,
+      PATTERN010: 2,
+      PATTERN011: 3,
+      PATTERN100: 4,
+      PATTERN101: 5,
+      PATTERN110: 6,
+      PATTERN111: 7
+    };
+    const PenaltyScores = {
+      N1: 3,
+      N2: 3,
+      N3: 40,
+      N4: 10
+    };
+    exports2.isValid = function isValid(mask) {
+      return mask != null && mask !== "" && !isNaN(mask) && mask >= 0 && mask <= 7;
+    };
+    exports2.from = function from(value) {
+      return exports2.isValid(value) ? parseInt(value, 10) : void 0;
+    };
+    exports2.getPenaltyN1 = function getPenaltyN1(data) {
+      const size = data.size;
+      let points = 0;
+      let sameCountCol = 0;
+      let sameCountRow = 0;
+      let lastCol = null;
+      let lastRow = null;
+      for (let row = 0; row < size; row++) {
+        sameCountCol = sameCountRow = 0;
+        lastCol = lastRow = null;
+        for (let col = 0; col < size; col++) {
+          let module2 = data.get(row, col);
+          if (module2 === lastCol) {
+            sameCountCol++;
+          } else {
+            if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+            lastCol = module2;
+            sameCountCol = 1;
+          }
+          module2 = data.get(col, row);
+          if (module2 === lastRow) {
+            sameCountRow++;
+          } else {
+            if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+            lastRow = module2;
+            sameCountRow = 1;
+          }
         }
-        module2 = data.get(col, row);
-        if (module2 === lastRow) {
-          sameCountRow++;
-        } else {
-          if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
-          lastRow = module2;
-          sameCountRow = 1;
+        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
+        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
+      }
+      return points;
+    };
+    exports2.getPenaltyN2 = function getPenaltyN2(data) {
+      const size = data.size;
+      let points = 0;
+      for (let row = 0; row < size - 1; row++) {
+        for (let col = 0; col < size - 1; col++) {
+          const last = data.get(row, col) + data.get(row, col + 1) + data.get(row + 1, col) + data.get(row + 1, col + 1);
+          if (last === 4 || last === 0) points++;
         }
       }
-      if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5);
-      if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5);
-    }
-    return points;
-  };
-  exports2.getPenaltyN2 = function getPenaltyN2(data) {
-    const size = data.size;
-    let points = 0;
-    for (let row = 0; row < size - 1; row++) {
-      for (let col = 0; col < size - 1; col++) {
-        const last = data.get(row, col) + data.get(row, col + 1) + data.get(row + 1, col) + data.get(row + 1, col + 1);
-        if (last === 4 || last === 0) points++;
+      return points * PenaltyScores.N2;
+    };
+    exports2.getPenaltyN3 = function getPenaltyN3(data) {
+      const size = data.size;
+      let points = 0;
+      let bitsCol = 0;
+      let bitsRow = 0;
+      for (let row = 0; row < size; row++) {
+        bitsCol = bitsRow = 0;
+        for (let col = 0; col < size; col++) {
+          bitsCol = bitsCol << 1 & 2047 | data.get(row, col);
+          if (col >= 10 && (bitsCol === 1488 || bitsCol === 93)) points++;
+          bitsRow = bitsRow << 1 & 2047 | data.get(col, row);
+          if (col >= 10 && (bitsRow === 1488 || bitsRow === 93)) points++;
+        }
       }
-    }
-    return points * PenaltyScores.N2;
-  };
-  exports2.getPenaltyN3 = function getPenaltyN3(data) {
-    const size = data.size;
-    let points = 0;
-    let bitsCol = 0;
-    let bitsRow = 0;
-    for (let row = 0; row < size; row++) {
-      bitsCol = bitsRow = 0;
-      for (let col = 0; col < size; col++) {
-        bitsCol = bitsCol << 1 & 2047 | data.get(row, col);
-        if (col >= 10 && (bitsCol === 1488 || bitsCol === 93)) points++;
-        bitsRow = bitsRow << 1 & 2047 | data.get(col, row);
-        if (col >= 10 && (bitsRow === 1488 || bitsRow === 93)) points++;
+      return points * PenaltyScores.N3;
+    };
+    exports2.getPenaltyN4 = function getPenaltyN4(data) {
+      let darkCount = 0;
+      const modulesCount = data.data.length;
+      for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
+      const k = Math.abs(Math.ceil(darkCount * 100 / modulesCount / 5) - 10);
+      return k * PenaltyScores.N4;
+    };
+    function getMaskAt(maskPattern2, i, j) {
+      switch (maskPattern2) {
+        case exports2.Patterns.PATTERN000:
+          return (i + j) % 2 === 0;
+        case exports2.Patterns.PATTERN001:
+          return i % 2 === 0;
+        case exports2.Patterns.PATTERN010:
+          return j % 3 === 0;
+        case exports2.Patterns.PATTERN011:
+          return (i + j) % 3 === 0;
+        case exports2.Patterns.PATTERN100:
+          return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0;
+        case exports2.Patterns.PATTERN101:
+          return i * j % 2 + i * j % 3 === 0;
+        case exports2.Patterns.PATTERN110:
+          return (i * j % 2 + i * j % 3) % 2 === 0;
+        case exports2.Patterns.PATTERN111:
+          return (i * j % 3 + (i + j) % 2) % 2 === 0;
+        default:
+          throw new Error("bad maskPattern:" + maskPattern2);
       }
     }
-    return points * PenaltyScores.N3;
-  };
-  exports2.getPenaltyN4 = function getPenaltyN4(data) {
-    let darkCount = 0;
-    const modulesCount = data.data.length;
-    for (let i = 0; i < modulesCount; i++) darkCount += data.data[i];
-    const k = Math.abs(Math.ceil(darkCount * 100 / modulesCount / 5) - 10);
-    return k * PenaltyScores.N4;
-  };
-  function getMaskAt(maskPattern2, i, j) {
-    switch (maskPattern2) {
-      case exports2.Patterns.PATTERN000:
-        return (i + j) % 2 === 0;
-      case exports2.Patterns.PATTERN001:
-        return i % 2 === 0;
-      case exports2.Patterns.PATTERN010:
-        return j % 3 === 0;
-      case exports2.Patterns.PATTERN011:
-        return (i + j) % 3 === 0;
-      case exports2.Patterns.PATTERN100:
-        return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0;
-      case exports2.Patterns.PATTERN101:
-        return i * j % 2 + i * j % 3 === 0;
-      case exports2.Patterns.PATTERN110:
-        return (i * j % 2 + i * j % 3) % 2 === 0;
-      case exports2.Patterns.PATTERN111:
-        return (i * j % 3 + (i + j) % 2) % 2 === 0;
-      default:
-        throw new Error("bad maskPattern:" + maskPattern2);
-    }
-  }
-  exports2.applyMask = function applyMask(pattern, data) {
-    const size = data.size;
-    for (let col = 0; col < size; col++) {
-      for (let row = 0; row < size; row++) {
-        if (data.isReserved(row, col)) continue;
-        data.xor(row, col, getMaskAt(pattern, row, col));
+    exports2.applyMask = function applyMask(pattern, data) {
+      const size = data.size;
+      for (let col = 0; col < size; col++) {
+        for (let row = 0; row < size; row++) {
+          if (data.isReserved(row, col)) continue;
+          data.xor(row, col, getMaskAt(pattern, row, col));
+        }
       }
-    }
-  };
-  exports2.getBestMask = function getBestMask(data, setupFormatFunc) {
-    const numPatterns = Object.keys(exports2.Patterns).length;
-    let bestPattern = 0;
-    let lowerPenalty = Infinity;
-    for (let p = 0; p < numPatterns; p++) {
-      setupFormatFunc(p);
-      exports2.applyMask(p, data);
-      const penalty = exports2.getPenaltyN1(data) + exports2.getPenaltyN2(data) + exports2.getPenaltyN3(data) + exports2.getPenaltyN4(data);
-      exports2.applyMask(p, data);
-      if (penalty < lowerPenalty) {
-        lowerPenalty = penalty;
-        bestPattern = p;
+    };
+    exports2.getBestMask = function getBestMask(data, setupFormatFunc) {
+      const numPatterns = Object.keys(exports2.Patterns).length;
+      let bestPattern = 0;
+      let lowerPenalty = Infinity;
+      for (let p = 0; p < numPatterns; p++) {
+        setupFormatFunc(p);
+        exports2.applyMask(p, data);
+        const penalty = exports2.getPenaltyN1(data) + exports2.getPenaltyN2(data) + exports2.getPenaltyN3(data) + exports2.getPenaltyN4(data);
+        exports2.applyMask(p, data);
+        if (penalty < lowerPenalty) {
+          lowerPenalty = penalty;
+          bestPattern = p;
+        }
       }
-    }
-    return bestPattern;
-  };
-})(maskPattern.__exports);
+      return bestPattern;
+    };
+  })(maskPattern.__exports);
+  return maskPattern.__exports;
+}
+exports.__require = requireMaskPattern;
 //# sourceMappingURL=mask-pattern.cjs.map

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

@@ -1 +1 @@
-{"version":3,"file":"mask-pattern.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n  PATTERN000: 0,\n  PATTERN001: 1,\n  PATTERN010: 2,\n  PATTERN011: 3,\n  PATTERN100: 4,\n  PATTERN101: 5,\n  PATTERN110: 6,\n  PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n  N1: 3,\n  N2: 3,\n  N3: 40,\n  N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param  {Number}  mask    Mask pattern\n * @return {Boolean}         true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param  {Number|String} value        Mask pattern value\n * @return {Number}                     Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n  return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n  const size = data.size\n  let points = 0\n  let sameCountCol = 0\n  let sameCountRow = 0\n  let lastCol = null\n  let lastRow = null\n\n  for (let row = 0; row < size; row++) {\n    sameCountCol = sameCountRow = 0\n    lastCol = lastRow = null\n\n    for (let col = 0; col < size; col++) {\n      let module = data.get(row, col)\n      if (module === lastCol) {\n        sameCountCol++\n      } else {\n        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n        lastCol = module\n        sameCountCol = 1\n      }\n\n      module = data.get(col, row)\n      if (module === lastRow) {\n        sameCountRow++\n      } else {\n        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n        lastRow = module\n        sameCountRow = 1\n      }\n    }\n\n    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n  }\n\n  return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n  const size = data.size\n  let points = 0\n\n  for (let row = 0; row < size - 1; row++) {\n    for (let col = 0; col < size - 1; col++) {\n      const last = data.get(row, col) +\n        data.get(row, col + 1) +\n        data.get(row + 1, col) +\n        data.get(row + 1, col + 1)\n\n      if (last === 4 || last === 0) points++\n    }\n  }\n\n  return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n  const size = data.size\n  let points = 0\n  let bitsCol = 0\n  let bitsRow = 0\n\n  for (let row = 0; row < size; row++) {\n    bitsCol = bitsRow = 0\n    for (let col = 0; col < size; col++) {\n      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n    }\n  }\n\n  return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n  let darkCount = 0\n  const modulesCount = data.data.length\n\n  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n  return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param  {Number} maskPattern Pattern reference value\n * @param  {Number} i           Row\n * @param  {Number} j           Column\n * @return {Boolean}            Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n  switch (maskPattern) {\n    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n    case exports.Patterns.PATTERN001: return i % 2 === 0\n    case exports.Patterns.PATTERN010: return j % 3 === 0\n    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n    default: throw new Error('bad maskPattern:' + maskPattern)\n  }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param  {Number}    pattern Pattern reference number\n * @param  {BitMatrix} data    BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n  const size = data.size\n\n  for (let col = 0; col < size; col++) {\n    for (let row = 0; row < size; row++) {\n      if (data.isReserved(row, col)) continue\n      data.xor(row, col, getMaskAt(pattern, row, col))\n    }\n  }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param  {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n  const numPatterns = Object.keys(exports.Patterns).length\n  let bestPattern = 0\n  let lowerPenalty = Infinity\n\n  for (let p = 0; p < numPatterns; p++) {\n    setupFormatFunc(p)\n    exports.applyMask(p, data)\n\n    // Calculate penalty\n    const penalty =\n      exports.getPenaltyN1(data) +\n      exports.getPenaltyN2(data) +\n      exports.getPenaltyN3(data) +\n      exports.getPenaltyN4(data)\n\n    // Undo previously applied mask\n    exports.applyMask(p, data)\n\n    if (penalty < lowerPenalty) {\n      lowerPenalty = penalty\n      bestPattern = p\n    }\n  }\n\n  return bestPattern\n}\n"],"names":["exports","module","maskPattern"],"mappings":";;;AAIA,EAAAA,SAAmB,WAAA;AAAA,IACjB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,YAAY;AAAA,EACb;AAMD,QAAM,gBAAgB;AAAA,IACpB,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACL;AAQD,EAAAA,SAAA,UAAkB,SAAS,QAAS,MAAM;AACxC,WAAO,QAAQ,QAAQ,SAAS,MAAM,CAAC,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ;AAAA,EAC5E;AASD,EAAAA,SAAA,OAAe,SAAS,KAAM,OAAO;AACnC,WAAOA,SAAQ,QAAQ,KAAK,IAAI,SAAS,OAAO,EAAE,IAAI;AAAA,EACvD;AASD,EAAAA,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AACb,QAAI,eAAe;AACnB,QAAI,eAAe;AACnB,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,qBAAe,eAAe;AAC9B,gBAAU,UAAU;AAEpB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAIC,UAAS,KAAK,IAAI,KAAK,GAAG;AAC9B,YAAIA,YAAW,SAAS;AACtB;AAAA,QACR,OAAa;AACL,cAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,oBAAUA;AACV,yBAAe;AAAA,QAChB;AAED,QAAAA,UAAS,KAAK,IAAI,KAAK,GAAG;AAC1B,YAAIA,YAAW,SAAS;AACtB;AAAA,QACR,OAAa;AACL,cAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,oBAAUA;AACV,yBAAe;AAAA,QAChB;AAAA,MACF;AAED,UAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,UAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AAAA,IACrE;AAED,WAAO;AAAA,EACR;AAOD,EAAAD,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AAEb,aAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,eAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,cAAM,OAAO,KAAK,IAAI,KAAK,GAAG,IAC5B,KAAK,IAAI,KAAK,MAAM,CAAC,IACrB,KAAK,IAAI,MAAM,GAAG,GAAG,IACrB,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC;AAE3B,YAAI,SAAS,KAAK,SAAS,EAAG;AAAA,MAC/B;AAAA,IACF;AAED,WAAO,SAAS,cAAc;AAAA,EAC/B;AAQD,EAAAA,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS;AACb,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,gBAAU,UAAU;AACpB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,kBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAE3D,kBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAAA,MAC5D;AAAA,IACF;AAED,WAAO,SAAS,cAAc;AAAA,EAC/B;AAUD,EAAAA,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,QAAI,YAAY;AAChB,UAAM,eAAe,KAAK,KAAK;AAE/B,aAAS,IAAI,GAAG,IAAI,cAAc,IAAK,cAAa,KAAK,KAAK,CAAC;AAE/D,UAAM,IAAI,KAAK,IAAI,KAAK,KAAM,YAAY,MAAM,eAAgB,CAAC,IAAI,EAAE;AAEvE,WAAO,IAAI,cAAc;AAAA,EAC1B;AAUD,WAAS,UAAWE,cAAa,GAAG,GAAG;AACrC,YAAQA,cAAW;AAAA,MACjB,KAAKF,SAAQ,SAAS;AAAY,gBAAQ,IAAI,KAAK,MAAM;AAAA,MACzD,KAAKA,SAAQ,SAAS;AAAY,eAAO,IAAI,MAAM;AAAA,MACnD,KAAKA,SAAQ,SAAS;AAAY,eAAO,IAAI,MAAM;AAAA,MACnD,KAAKA,SAAQ,SAAS;AAAY,gBAAQ,IAAI,KAAK,MAAM;AAAA,MACzD,KAAKA,SAAQ,SAAS;AAAY,gBAAQ,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM;AAAA,MACzF,KAAKA,SAAQ,SAAS;AAAY,eAAQ,IAAI,IAAK,IAAK,IAAI,IAAK,MAAM;AAAA,MACvE,KAAKA,SAAQ,SAAS;AAAY,gBAAS,IAAI,IAAK,IAAK,IAAI,IAAK,KAAK,MAAM;AAAA,MAC7E,KAAKA,SAAQ,SAAS;AAAY,gBAAS,IAAI,IAAK,KAAK,IAAI,KAAK,KAAK,MAAM;AAAA,MAE7E;AAAS,cAAM,IAAI,MAAM,qBAAqBE,YAAW;AAAA,IAC1D;AAAA,EACF;AAQD,EAAAF,SAAA,YAAoB,SAAS,UAAW,SAAS,MAAM;AACrD,UAAM,OAAO,KAAK;AAElB,aAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,YAAI,KAAK,WAAW,KAAK,GAAG,EAAG;AAC/B,aAAK,IAAI,KAAK,KAAK,UAAU,SAAS,KAAK,GAAG,CAAC;AAAA,MAChD;AAAA,IACF;AAAA,EACF;AAQD,EAAAA,SAAA,cAAsB,SAAS,YAAa,MAAM,iBAAiB;AACjE,UAAM,cAAc,OAAO,KAAKA,SAAQ,QAAQ,EAAE;AAClD,QAAI,cAAc;AAClB,QAAI,eAAe;AAEnB,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,sBAAgB,CAAC;AACjB,MAAAA,SAAQ,UAAU,GAAG,IAAI;AAGzB,YAAM,UACJA,SAAQ,aAAa,IAAI,IACzBA,SAAQ,aAAa,IAAI,IACzBA,SAAQ,aAAa,IAAI,IACzBA,SAAQ,aAAa,IAAI;AAG3B,MAAAA,SAAQ,UAAU,GAAG,IAAI;AAEzB,UAAI,UAAU,cAAc;AAC1B,uBAAe;AACf,sBAAc;AAAA,MACf;AAAA,IACF;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"mask-pattern.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n  PATTERN000: 0,\n  PATTERN001: 1,\n  PATTERN010: 2,\n  PATTERN011: 3,\n  PATTERN100: 4,\n  PATTERN101: 5,\n  PATTERN110: 6,\n  PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n  N1: 3,\n  N2: 3,\n  N3: 40,\n  N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param  {Number}  mask    Mask pattern\n * @return {Boolean}         true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n  return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param  {Number|String} value        Mask pattern value\n * @return {Number}                     Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n  return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n  const size = data.size\n  let points = 0\n  let sameCountCol = 0\n  let sameCountRow = 0\n  let lastCol = null\n  let lastRow = null\n\n  for (let row = 0; row < size; row++) {\n    sameCountCol = sameCountRow = 0\n    lastCol = lastRow = null\n\n    for (let col = 0; col < size; col++) {\n      let module = data.get(row, col)\n      if (module === lastCol) {\n        sameCountCol++\n      } else {\n        if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n        lastCol = module\n        sameCountCol = 1\n      }\n\n      module = data.get(col, row)\n      if (module === lastRow) {\n        sameCountRow++\n      } else {\n        if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n        lastRow = module\n        sameCountRow = 1\n      }\n    }\n\n    if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n    if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n  }\n\n  return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n  const size = data.size\n  let points = 0\n\n  for (let row = 0; row < size - 1; row++) {\n    for (let col = 0; col < size - 1; col++) {\n      const last = data.get(row, col) +\n        data.get(row, col + 1) +\n        data.get(row + 1, col) +\n        data.get(row + 1, col + 1)\n\n      if (last === 4 || last === 0) points++\n    }\n  }\n\n  return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n  const size = data.size\n  let points = 0\n  let bitsCol = 0\n  let bitsRow = 0\n\n  for (let row = 0; row < size; row++) {\n    bitsCol = bitsRow = 0\n    for (let col = 0; col < size; col++) {\n      bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n      if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n      bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n      if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n    }\n  }\n\n  return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n  let darkCount = 0\n  const modulesCount = data.data.length\n\n  for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n  const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n  return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param  {Number} maskPattern Pattern reference value\n * @param  {Number} i           Row\n * @param  {Number} j           Column\n * @return {Boolean}            Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n  switch (maskPattern) {\n    case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n    case exports.Patterns.PATTERN001: return i % 2 === 0\n    case exports.Patterns.PATTERN010: return j % 3 === 0\n    case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n    case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n    case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n    case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n    case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n    default: throw new Error('bad maskPattern:' + maskPattern)\n  }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param  {Number}    pattern Pattern reference number\n * @param  {BitMatrix} data    BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n  const size = data.size\n\n  for (let col = 0; col < size; col++) {\n    for (let row = 0; row < size; row++) {\n      if (data.isReserved(row, col)) continue\n      data.xor(row, col, getMaskAt(pattern, row, col))\n    }\n  }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param  {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n  const numPatterns = Object.keys(exports.Patterns).length\n  let bestPattern = 0\n  let lowerPenalty = Infinity\n\n  for (let p = 0; p < numPatterns; p++) {\n    setupFormatFunc(p)\n    exports.applyMask(p, data)\n\n    // Calculate penalty\n    const penalty =\n      exports.getPenaltyN1(data) +\n      exports.getPenaltyN2(data) +\n      exports.getPenaltyN3(data) +\n      exports.getPenaltyN4(data)\n\n    // Undo previously applied mask\n    exports.applyMask(p, data)\n\n    if (penalty < lowerPenalty) {\n      lowerPenalty = penalty\n      bestPattern = p\n    }\n  }\n\n  return bestPattern\n}\n"],"names":["exports","module","maskPattern"],"mappings":";;;;;;;;AAIA,IAAAA,SAAmB,WAAA;AAAA,MACjB,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,IACd;AAMA,UAAM,gBAAgB;AAAA,MACpB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AAQA,IAAAA,SAAA,UAAkB,SAAS,QAAS,MAAM;AACxC,aAAO,QAAQ,QAAQ,SAAS,MAAM,CAAC,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ;AAAA,IAC7E;AASA,IAAAA,SAAA,OAAe,SAAS,KAAM,OAAO;AACnC,aAAOA,SAAQ,QAAQ,KAAK,IAAI,SAAS,OAAO,EAAE,IAAI;AAAA,IACxD;AASA,IAAAA,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS;AACb,UAAI,eAAe;AACnB,UAAI,eAAe;AACnB,UAAI,UAAU;AACd,UAAI,UAAU;AAEd,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,uBAAe,eAAe;AAC9B,kBAAU,UAAU;AAEpB,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,cAAIC,UAAS,KAAK,IAAI,KAAK,GAAG;AAC9B,cAAIA,YAAW,SAAS;AACtB;AAAA,UACR,OAAa;AACL,gBAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,sBAAUA;AACV,2BAAe;AAAA,UACvB;AAEM,UAAAA,UAAS,KAAK,IAAI,KAAK,GAAG;AAC1B,cAAIA,YAAW,SAAS;AACtB;AAAA,UACR,OAAa;AACL,gBAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,sBAAUA;AACV,2BAAe;AAAA,UACvB;AAAA,QACA;AAEI,YAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AACpE,YAAI,gBAAgB,EAAG,WAAU,cAAc,MAAM,eAAe;AAAA,MACxE;AAEE,aAAO;AAAA,IACT;AAOA,IAAAD,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS;AAEb,eAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,iBAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO;AACvC,gBAAM,OAAO,KAAK,IAAI,KAAK,GAAG,IAC5B,KAAK,IAAI,KAAK,MAAM,CAAC,IACrB,KAAK,IAAI,MAAM,GAAG,GAAG,IACrB,KAAK,IAAI,MAAM,GAAG,MAAM,CAAC;AAE3B,cAAI,SAAS,KAAK,SAAS,EAAG;AAAA,QACpC;AAAA,MACA;AAEE,aAAO,SAAS,cAAc;AAAA,IAChC;AAQA,IAAAA,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,YAAM,OAAO,KAAK;AAClB,UAAI,SAAS;AACb,UAAI,UAAU;AACd,UAAI,UAAU;AAEd,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,kBAAU,UAAU;AACpB,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,oBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,cAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAE3D,oBAAY,WAAW,IAAK,OAAS,KAAK,IAAI,KAAK,GAAG;AACtD,cAAI,OAAO,OAAO,YAAY,QAAS,YAAY,IAAQ;AAAA,QACjE;AAAA,MACA;AAEE,aAAO,SAAS,cAAc;AAAA,IAChC;AAUA,IAAAA,SAAA,eAAuB,SAAS,aAAc,MAAM;AAClD,UAAI,YAAY;AAChB,YAAM,eAAe,KAAK,KAAK;AAE/B,eAAS,IAAI,GAAG,IAAI,cAAc,IAAK,cAAa,KAAK,KAAK,CAAC;AAE/D,YAAM,IAAI,KAAK,IAAI,KAAK,KAAM,YAAY,MAAM,eAAgB,CAAC,IAAI,EAAE;AAEvE,aAAO,IAAI,cAAc;AAAA,IAC3B;AAUA,aAAS,UAAWE,cAAa,GAAG,GAAG;AACrC,cAAQA,cAAW;AAAA,QACjB,KAAKF,SAAQ,SAAS;AAAY,kBAAQ,IAAI,KAAK,MAAM;AAAA,QACzD,KAAKA,SAAQ,SAAS;AAAY,iBAAO,IAAI,MAAM;AAAA,QACnD,KAAKA,SAAQ,SAAS;AAAY,iBAAO,IAAI,MAAM;AAAA,QACnD,KAAKA,SAAQ,SAAS;AAAY,kBAAQ,IAAI,KAAK,MAAM;AAAA,QACzD,KAAKA,SAAQ,SAAS;AAAY,kBAAQ,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,MAAM;AAAA,QACzF,KAAKA,SAAQ,SAAS;AAAY,iBAAQ,IAAI,IAAK,IAAK,IAAI,IAAK,MAAM;AAAA,QACvE,KAAKA,SAAQ,SAAS;AAAY,kBAAS,IAAI,IAAK,IAAK,IAAI,IAAK,KAAK,MAAM;AAAA,QAC7E,KAAKA,SAAQ,SAAS;AAAY,kBAAS,IAAI,IAAK,KAAK,IAAI,KAAK,KAAK,MAAM;AAAA,QAE7E;AAAS,gBAAM,IAAI,MAAM,qBAAqBE,YAAW;AAAA,MAC7D;AAAA,IACA;AAQA,IAAAF,SAAA,YAAoB,SAAS,UAAW,SAAS,MAAM;AACrD,YAAM,OAAO,KAAK;AAElB,eAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,iBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,cAAI,KAAK,WAAW,KAAK,GAAG,EAAG;AAC/B,eAAK,IAAI,KAAK,KAAK,UAAU,SAAS,KAAK,GAAG,CAAC;AAAA,QACrD;AAAA,MACA;AAAA,IACA;AAQA,IAAAA,SAAA,cAAsB,SAAS,YAAa,MAAM,iBAAiB;AACjE,YAAM,cAAc,OAAO,KAAKA,SAAQ,QAAQ,EAAE;AAClD,UAAI,cAAc;AAClB,UAAI,eAAe;AAEnB,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,wBAAgB,CAAC;AACjB,QAAAA,SAAQ,UAAU,GAAG,IAAI;AAGzB,cAAM,UACJA,SAAQ,aAAa,IAAI,IACzBA,SAAQ,aAAa,IAAI,IACzBA,SAAQ,aAAa,IAAI,IACzBA,SAAQ,aAAa,IAAI;AAG3B,QAAAA,SAAQ,UAAU,GAAG,IAAI;AAEzB,YAAI,UAAU,cAAc;AAC1B,yBAAe;AACf,wBAAc;AAAA,QACpB;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AAAA;;;;","x_google_ignoreList":[0]}