@ozdao/martyrs 0.2.584 → 0.2.586

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js

@@ -1,14 +0,0 @@
-var canPromise;
-var hasRequiredCanPromise;
-function requireCanPromise() {
-  if (hasRequiredCanPromise) return canPromise;
-  hasRequiredCanPromise = 1;
-  canPromise = function() {
-    return typeof Promise === "function" && Promise.prototype && Promise.prototype.then;
-  };
-  return canPromise;
-}
-export {
-  requireCanPromise as __require
-};
-//# sourceMappingURL=can-promise.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"can-promise.js","sources":["../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js"],"sourcesContent":["// can-promise has a crash in some versions of react native that dont have\n// standard global objects\n// https://github.com/soldair/node-qrcode/issues/157\n\nmodule.exports = function () {\n  return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then\n}\n"],"names":[],"mappings":";;;;;AAIA,eAAiB,WAAY;AAC3B,WAAO,OAAO,YAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU;AAAA,EACjF;;;","x_google_ignoreList":[0]}

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

@@ -1,43 +0,0 @@
-import { __exports as alignmentPattern } from "../../../../../../../_virtual/alignment-pattern.js";
-import { __require as requireUtils } from "./utils.js";
-var hasRequiredAlignmentPattern;
-function requireAlignmentPattern() {
-  if (hasRequiredAlignmentPattern) return alignmentPattern;
-  hasRequiredAlignmentPattern = 1;
-  (function(exports) {
-    const getSymbolSize = requireUtils().getSymbolSize;
-    exports.getRowColCoords = function getRowColCoords(version) {
-      if (version === 1) return [];
-      const posCount = Math.floor(version / 7) + 2;
-      const size = getSymbolSize(version);
-      const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2;
-      const positions = [size - 7];
-      for (let i = 1; i < posCount - 1; i++) {
-        positions[i] = positions[i - 1] - intervals;
-      }
-      positions.push(6);
-      return positions.reverse();
-    };
-    exports.getPositions = function getPositions(version) {
-      const coords = [];
-      const pos = exports.getRowColCoords(version);
-      const posLength = pos.length;
-      for (let i = 0; i < posLength; i++) {
-        for (let j = 0; j < posLength; j++) {
-          if (i === 0 && j === 0 || // top-left
-          i === 0 && j === posLength - 1 || // bottom-left
-          i === posLength - 1 && j === 0) {
-            continue;
-          }
-          coords.push([pos[i], pos[j]]);
-        }
-      }
-      return coords;
-    };
-  })(alignmentPattern);
-  return alignmentPattern;
-}
-export {
-  requireAlignmentPattern as __require
-};
-//# sourceMappingURL=alignment-pattern.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"alignment-pattern.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":["require$$0"],"mappings":";;;;;;;AAUA,UAAM,gBAAgBA,eAAmB;AAgBzC,YAAA,kBAA0B,SAAS,gBAAiB,SAAS;AAC3D,UAAI,YAAY,EAAG,QAAO,CAAA;AAE1B,YAAM,WAAW,KAAK,MAAM,UAAU,CAAC,IAAI;AAC3C,YAAM,OAAO,cAAc,OAAO;AAClC,YAAM,YAAY,SAAS,MAAM,KAAK,KAAK,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,IAAI;AACpF,YAAM,YAAY,CAAC,OAAO,CAAC;AAE3B,eAAS,IAAI,GAAG,IAAI,WAAW,GAAG,KAAK;AACrC,kBAAU,CAAC,IAAI,UAAU,IAAI,CAAC,IAAI;AAAA,MACtC;AAEE,gBAAU,KAAK,CAAC;AAEhB,aAAO,UAAU,QAAO;AAAA,IAC1B;AAsBA,YAAA,eAAuB,SAAS,aAAc,SAAS;AACrD,YAAM,SAAS,CAAA;AACf,YAAM,MAAM,QAAQ,gBAAgB,OAAO;AAC3C,YAAM,YAAY,IAAI;AAEtB,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAElC,cAAK,MAAM,KAAK,MAAM;AAAA,UACjB,MAAM,KAAK,MAAM,YAAY;AAAA,UAC7B,MAAM,YAAY,KAAK,MAAM,GAAI;AACpC;AAAA,UACR;AAEM,iBAAO,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,QAClC;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AAAA;;;","x_google_ignoreList":[0]}

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

@@ -1,85 +0,0 @@
-import { __require as requireMode } from "./mode.js";
-var alphanumericData;
-var hasRequiredAlphanumericData;
-function requireAlphanumericData() {
-  if (hasRequiredAlphanumericData) return alphanumericData;
-  hasRequiredAlphanumericData = 1;
-  const Mode = requireMode();
-  const ALPHA_NUM_CHARS = [
-    "0",
-    "1",
-    "2",
-    "3",
-    "4",
-    "5",
-    "6",
-    "7",
-    "8",
-    "9",
-    "A",
-    "B",
-    "C",
-    "D",
-    "E",
-    "F",
-    "G",
-    "H",
-    "I",
-    "J",
-    "K",
-    "L",
-    "M",
-    "N",
-    "O",
-    "P",
-    "Q",
-    "R",
-    "S",
-    "T",
-    "U",
-    "V",
-    "W",
-    "X",
-    "Y",
-    "Z",
-    " ",
-    "$",
-    "%",
-    "*",
-    "+",
-    "-",
-    ".",
-    "/",
-    ":"
-  ];
-  function AlphanumericData(data) {
-    this.mode = Mode.ALPHANUMERIC;
-    this.data = data;
-  }
-  AlphanumericData.getBitsLength = function getBitsLength(length) {
-    return 11 * Math.floor(length / 2) + 6 * (length % 2);
-  };
-  AlphanumericData.prototype.getLength = function getLength() {
-    return this.data.length;
-  };
-  AlphanumericData.prototype.getBitsLength = function getBitsLength() {
-    return AlphanumericData.getBitsLength(this.data.length);
-  };
-  AlphanumericData.prototype.write = function write(bitBuffer) {
-    let i;
-    for (i = 0; i + 2 <= this.data.length; i += 2) {
-      let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45;
-      value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1]);
-      bitBuffer.put(value, 11);
-    }
-    if (this.data.length % 2) {
-      bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6);
-    }
-  };
-  alphanumericData = AlphanumericData;
-  return alphanumericData;
-}
-export {
-  requireAlphanumericData as __require
-};
-//# sourceMappingURL=alphanumeric-data.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"alphanumeric-data.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alphanumeric-data.js"],"sourcesContent":["const Mode = require('./mode')\n\n/**\n * Array of characters available in alphanumeric mode\n *\n * As per QR Code specification, to each character\n * is assigned a value from 0 to 44 which in this case coincides\n * with the array index\n *\n * @type {Array}\n */\nconst ALPHA_NUM_CHARS = [\n  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',\n  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',\n  ' ', '$', '%', '*', '+', '-', '.', '/', ':'\n]\n\nfunction AlphanumericData (data) {\n  this.mode = Mode.ALPHANUMERIC\n  this.data = data\n}\n\nAlphanumericData.getBitsLength = function getBitsLength (length) {\n  return 11 * Math.floor(length / 2) + 6 * (length % 2)\n}\n\nAlphanumericData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nAlphanumericData.prototype.getBitsLength = function getBitsLength () {\n  return AlphanumericData.getBitsLength(this.data.length)\n}\n\nAlphanumericData.prototype.write = function write (bitBuffer) {\n  let i\n\n  // Input data characters are divided into groups of two characters\n  // and encoded as 11-bit binary codes.\n  for (i = 0; i + 2 <= this.data.length; i += 2) {\n    // The character value of the first character is multiplied by 45\n    let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45\n\n    // The character value of the second digit is added to the product\n    value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])\n\n    // The sum is then stored as 11-bit binary number\n    bitBuffer.put(value, 11)\n  }\n\n  // If the number of input data characters is not a multiple of two,\n  // the character value of the final character is encoded as a 6-bit binary number.\n  if (this.data.length % 2) {\n    bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)\n  }\n}\n\nmodule.exports = AlphanumericData\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,OAAOA,YAAA;AAWb,QAAM,kBAAkB;AAAA,IACtB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC7C;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAC5D;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,EAC1C;AAEA,WAAS,iBAAkB,MAAM;AAC/B,SAAK,OAAO,KAAK;AACjB,SAAK,OAAO;AAAA,EACd;AAEA,mBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,WAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AAAA,EACrD;AAEA,mBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,mBAAiB,UAAU,gBAAgB,SAAS,gBAAiB;AACnE,WAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AAAA,EACxD;AAEA,mBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,QAAI;AAIJ,SAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,UAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,eAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,gBAAU,IAAI,OAAO,EAAE;AAAA,IAC3B;AAIE,QAAI,KAAK,KAAK,SAAS,GAAG;AACxB,gBAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,IAC1D;AAAA,EACA;AAEA,qBAAiB;;;","x_google_ignoreList":[0]}

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

@@ -1,40 +0,0 @@
-var bitBuffer;
-var hasRequiredBitBuffer;
-function requireBitBuffer() {
-  if (hasRequiredBitBuffer) return bitBuffer;
-  hasRequiredBitBuffer = 1;
-  function BitBuffer() {
-    this.buffer = [];
-    this.length = 0;
-  }
-  BitBuffer.prototype = {
-    get: function(index) {
-      const bufIndex = Math.floor(index / 8);
-      return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
-    },
-    put: function(num, length) {
-      for (let i = 0; i < length; i++) {
-        this.putBit((num >>> length - i - 1 & 1) === 1);
-      }
-    },
-    getLengthInBits: function() {
-      return this.length;
-    },
-    putBit: function(bit) {
-      const bufIndex = Math.floor(this.length / 8);
-      if (this.buffer.length <= bufIndex) {
-        this.buffer.push(0);
-      }
-      if (bit) {
-        this.buffer[bufIndex] |= 128 >>> this.length % 8;
-      }
-      this.length++;
-    }
-  };
-  bitBuffer = BitBuffer;
-  return bitBuffer;
-}
-export {
-  requireBitBuffer as __require
-};
-//# sourceMappingURL=bit-buffer.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-buffer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bit-buffer.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":[],"mappings":";;;;;AAAA,WAAS,YAAa;AACpB,SAAK,SAAS,CAAA;AACd,SAAK,SAAS;AAAA,EAChB;AAEA,YAAU,YAAY;AAAA,IAEpB,KAAK,SAAU,OAAO;AACpB,YAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,cAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,IACjE;AAAA,IAEE,KAAK,SAAU,KAAK,QAAQ;AAC1B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,MACxD;AAAA,IACA;AAAA,IAEE,iBAAiB,WAAY;AAC3B,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAAQ,SAAU,KAAK;AACrB,YAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,UAAI,KAAK,OAAO,UAAU,UAAU;AAClC,aAAK,OAAO,KAAK,CAAC;AAAA,MACxB;AAEI,UAAI,KAAK;AACP,aAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,MACxD;AAEI,WAAK;AAAA,IACT;AAAA,EACA;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

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

@@ -1,34 +0,0 @@
-var bitMatrix;
-var hasRequiredBitMatrix;
-function requireBitMatrix() {
-  if (hasRequiredBitMatrix) return bitMatrix;
-  hasRequiredBitMatrix = 1;
-  function BitMatrix(size) {
-    if (!size || size < 1) {
-      throw new Error("BitMatrix size must be defined and greater than 0");
-    }
-    this.size = size;
-    this.data = new Uint8Array(size * size);
-    this.reservedBit = new Uint8Array(size * size);
-  }
-  BitMatrix.prototype.set = function(row, col, value, reserved) {
-    const index = row * this.size + col;
-    this.data[index] = value;
-    if (reserved) this.reservedBit[index] = true;
-  };
-  BitMatrix.prototype.get = function(row, col) {
-    return this.data[row * this.size + col];
-  };
-  BitMatrix.prototype.xor = function(row, col, value) {
-    this.data[row * this.size + col] ^= value;
-  };
-  BitMatrix.prototype.isReserved = function(row, col) {
-    return this.reservedBit[row * this.size + col];
-  };
-  bitMatrix = BitMatrix;
-  return bitMatrix;
-}
-export {
-  requireBitMatrix as __require
-};
-//# sourceMappingURL=bit-matrix.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-matrix.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bit-matrix.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":[],"mappings":";;;;;AAKA,WAAS,UAAW,MAAM;AACxB,QAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACvE;AAEE,SAAK,OAAO;AACZ,SAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,SAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAAA,EAC/C;AAWA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,UAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,SAAK,KAAK,KAAK,IAAI;AACnB,QAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAAA,EAC1C;AASA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,WAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AAAA,EACxC;AAUA,YAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,SAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AAAA,EACtC;AASA,YAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,WAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAAA,EAC/C;AAEA,cAAiB;;;","x_google_ignoreList":[0]}

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

@@ -1,36 +0,0 @@
-import { __require as requireMode } from "./mode.js";
-var byteData;
-var hasRequiredByteData;
-function requireByteData() {
-  if (hasRequiredByteData) return byteData;
-  hasRequiredByteData = 1;
-  const Mode = requireMode();
-  function ByteData(data) {
-    this.mode = Mode.BYTE;
-    if (typeof data === "string") {
-      this.data = new TextEncoder().encode(data);
-    } else {
-      this.data = new Uint8Array(data);
-    }
-  }
-  ByteData.getBitsLength = function getBitsLength(length) {
-    return length * 8;
-  };
-  ByteData.prototype.getLength = function getLength() {
-    return this.data.length;
-  };
-  ByteData.prototype.getBitsLength = function getBitsLength() {
-    return ByteData.getBitsLength(this.data.length);
-  };
-  ByteData.prototype.write = function(bitBuffer) {
-    for (let i = 0, l = this.data.length; i < l; i++) {
-      bitBuffer.put(this.data[i], 8);
-    }
-  };
-  byteData = ByteData;
-  return byteData;
-}
-export {
-  requireByteData as __require
-};
-//# sourceMappingURL=byte-data.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"byte-data.js","sources":["../../../../../../../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/byte-data.js"],"sourcesContent":["const Mode = require('./mode')\n\nfunction ByteData (data) {\n  this.mode = Mode.BYTE\n  if (typeof (data) === 'string') {\n    this.data = new TextEncoder().encode(data)\n  } else {\n    this.data = new Uint8Array(data)\n  }\n}\n\nByteData.getBitsLength = function getBitsLength (length) {\n  return length * 8\n}\n\nByteData.prototype.getLength = function getLength () {\n  return this.data.length\n}\n\nByteData.prototype.getBitsLength = function getBitsLength () {\n  return ByteData.getBitsLength(this.data.length)\n}\n\nByteData.prototype.write = function (bitBuffer) {\n  for (let i = 0, l = this.data.length; i < l; i++) {\n    bitBuffer.put(this.data[i], 8)\n  }\n}\n\nmodule.exports = ByteData\n"],"names":["require$$0"],"mappings":";;;;;;AAAA,QAAM,OAAOA,YAAA;AAEb,WAAS,SAAU,MAAM;AACvB,SAAK,OAAO,KAAK;AACjB,QAAI,OAAQ,SAAU,UAAU;AAC9B,WAAK,OAAO,IAAI,YAAW,EAAG,OAAO,IAAI;AAAA,IAC7C,OAAS;AACL,WAAK,OAAO,IAAI,WAAW,IAAI;AAAA,IACnC;AAAA,EACA;AAEA,WAAS,gBAAgB,SAAS,cAAe,QAAQ;AACvD,WAAO,SAAS;AAAA,EAClB;AAEA,WAAS,UAAU,YAAY,SAAS,YAAa;AACnD,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,WAAS,UAAU,gBAAgB,SAAS,gBAAiB;AAC3D,WAAO,SAAS,cAAc,KAAK,KAAK,MAAM;AAAA,EAChD;AAEA,WAAS,UAAU,QAAQ,SAAU,WAAW;AAC9C,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK;AAChD,gBAAU,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,IACjC;AAAA,EACA;AAEA,aAAiB;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-code.js

@@ -1,367 +0,0 @@
-import { __exports as errorCorrectionCode } from "../../../../../../../_virtual/error-correction-code.js";
-import { __require as requireErrorCorrectionLevel } from "./error-correction-level.js";
-var hasRequiredErrorCorrectionCode;
-function requireErrorCorrectionCode() {
-  if (hasRequiredErrorCorrectionCode) return errorCorrectionCode;
-  hasRequiredErrorCorrectionCode = 1;
-  const ECLevel = requireErrorCorrectionLevel();
-  const EC_BLOCKS_TABLE = [
-    // 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
-  ];
-  const EC_CODEWORDS_TABLE = [
-    // 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
-  ];
-  errorCorrectionCode.getBlocksCount = function getBlocksCount(version, errorCorrectionLevel) {
-    switch (errorCorrectionLevel) {
-      case ECLevel.L:
-        return EC_BLOCKS_TABLE[(version - 1) * 4 + 0];
-      case ECLevel.M:
-        return EC_BLOCKS_TABLE[(version - 1) * 4 + 1];
-      case ECLevel.Q:
-        return EC_BLOCKS_TABLE[(version - 1) * 4 + 2];
-      case ECLevel.H:
-        return EC_BLOCKS_TABLE[(version - 1) * 4 + 3];
-      default:
-        return void 0;
-    }
-  };
-  errorCorrectionCode.getTotalCodewordsCount = function getTotalCodewordsCount(version, errorCorrectionLevel) {
-    switch (errorCorrectionLevel) {
-      case ECLevel.L:
-        return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0];
-      case ECLevel.M:
-        return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1];
-      case ECLevel.Q:
-        return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2];
-      case ECLevel.H:
-        return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3];
-      default:
-        return void 0;
-    }
-  };
-  return errorCorrectionCode;
-}
-export {
-  requireErrorCorrectionCode as __require
-};
-//# sourceMappingURL=error-correction-code.js.map

package/dist/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-code.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"error-correction-code.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":["require$$0"],"mappings":";;;;;;AAAA,QAAM,UAAUA,4BAAA;AAEhB,QAAM,kBAAkB;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;AAGd,QAAM,qBAAqB;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,sBAAA,iBAAyB,SAAS,eAAgB,SAAS,sBAAsB;AAC/E,YAAQ,sBAAoB;AAAA,MAC1B,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAK,QAAQ;AACX,eAAO,iBAAiB,UAAU,KAAK,IAAI,CAAC;AAAA,MAC9C;AACE,eAAO;AAAA;EAEb;AAUA,sBAAA,yBAAiC,SAAS,uBAAwB,SAAS,sBAAsB;AAC/F,YAAQ,sBAAoB;AAAA,MAC1B,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,oBAAoB,UAAU,KAAK,IAAI,CAAC;AAAA,MACjD;AACE,eAAO;AAAA;EAEb;;;","x_google_ignoreList":[0]}