@ozdao/prometheus-framework 0.2.199 → 0.2.201

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

@@ -1,6 +1,7 @@
 import "./mode.js";
-import { __exports as h } from "../../../../_virtual/mode.js";
-const r = h, i = [
+import { __exports as mode } from "../../../../_virtual/mode.js";
+const Mode = mode;
+const ALPHA_NUM_CHARS = [
   "0",
   "1",
   "2",
@@ -47,27 +48,32 @@ const r = h, i = [
   "/",
   ":"
 ];
-function e(n) {
-  this.mode = r.ALPHANUMERIC, this.data = n;
+function AlphanumericData(data) {
+  this.mode = Mode.ALPHANUMERIC;
+  this.data = data;
 }
-e.getBitsLength = function(a) {
-  return 11 * Math.floor(a / 2) + 6 * (a % 2);
+AlphanumericData.getBitsLength = function getBitsLength(length) {
+  return 11 * Math.floor(length / 2) + 6 * (length % 2);
 };
-e.prototype.getLength = function() {
+AlphanumericData.prototype.getLength = function getLength() {
   return this.data.length;
 };
-e.prototype.getBitsLength = function() {
-  return e.getBitsLength(this.data.length);
+AlphanumericData.prototype.getBitsLength = function getBitsLength2() {
+  return AlphanumericData.getBitsLength(this.data.length);
 };
-e.prototype.write = function(a) {
-  let t;
-  for (t = 0; t + 2 <= this.data.length; t += 2) {
-    let o = i.indexOf(this.data[t]) * 45;
-    o += i.indexOf(this.data[t + 1]), a.put(o, 11);
+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);
   }
-  this.data.length % 2 && a.put(i.indexOf(this.data[t]), 6);
 };
-var d = e;
+var alphanumericData = AlphanumericData;
 export {
-  d as a
+  alphanumericData as a
 };
+//# sourceMappingURL=alphanumeric-data.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"alphanumeric-data.js","sources":["../../../../../../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","getBitsLength"],"mappings":";;AAAA,MAAM,OAAOA;AAWb,MAAM,kBAAkB;AAAA,EACtB;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC7C;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAC5D;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAAA,EAAK;AAC1C;AAEA,SAAS,iBAAkB,MAAM;AAC/B,OAAK,OAAO,KAAK;AACjB,OAAK,OAAO;AACd;AAEA,iBAAiB,gBAAgB,SAAS,cAAe,QAAQ;AAC/D,SAAO,KAAK,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,SAAS;AACrD;AAEA,iBAAiB,UAAU,YAAY,SAAS,YAAa;AAC3D,SAAO,KAAK,KAAK;AACnB;AAEA,iBAAiB,UAAU,gBAAgB,SAASC,iBAAiB;AACnE,SAAO,iBAAiB,cAAc,KAAK,KAAK,MAAM;AACxD;AAEA,iBAAiB,UAAU,QAAQ,SAAS,MAAO,WAAW;AAC5D,MAAI;AAIJ,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG;AAE7C,QAAI,QAAQ,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,IAAI;AAGpD,aAAS,gBAAgB,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC;AAGjD,cAAU,IAAI,OAAO,EAAE;AAAA,EACxB;AAID,MAAI,KAAK,KAAK,SAAS,GAAG;AACxB,cAAU,IAAI,gBAAgB,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC;AAAA,EACvD;AACH;AAEA,IAAA,mBAAiB;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/bit-buffer.cjs

@@ -1 +1,33 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(){this.buffer=[],this.length=0}i.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++}};var n=i;exports.bitBuffer=n;
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+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++;
+  }
+};
+var bitBuffer = BitBuffer;
+exports.bitBuffer = bitBuffer;
+//# sourceMappingURL=bit-buffer.cjs.map

package/dist/node_modules/qrcode/lib/core/bit-buffer.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-buffer.cjs","sources":["../../../../../../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,SAAS,YAAa;AACpB,OAAK,SAAS,CAAE;AAChB,OAAK,SAAS;AAChB;AAEA,UAAU,YAAY;AAAA,EAEpB,KAAK,SAAU,OAAO;AACpB,UAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,YAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,EAC9D;AAAA,EAED,KAAK,SAAU,KAAK,QAAQ;AAC1B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,IACnD;AAAA,EACF;AAAA,EAED,iBAAiB,WAAY;AAC3B,WAAO,KAAK;AAAA,EACb;AAAA,EAED,QAAQ,SAAU,KAAK;AACrB,UAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,QAAI,KAAK,OAAO,UAAU,UAAU;AAClC,WAAK,OAAO,KAAK,CAAC;AAAA,IACnB;AAED,QAAI,KAAK;AACP,WAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,IACnD;AAED,SAAK;AAAA,EACN;AACH;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}

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

@@ -1,24 +1,33 @@
-function n() {
-  this.buffer = [], this.length = 0;
+function BitBuffer() {
+  this.buffer = [];
+  this.length = 0;
 }
-n.prototype = {
-  get: function(f) {
-    const t = Math.floor(f / 8);
-    return (this.buffer[t] >>> 7 - f % 8 & 1) === 1;
+BitBuffer.prototype = {
+  get: function(index) {
+    const bufIndex = Math.floor(index / 8);
+    return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) === 1;
   },
-  put: function(f, t) {
-    for (let i = 0; i < t; i++)
-      this.putBit((f >>> t - i - 1 & 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(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++;
+  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++;
   }
 };
-var e = n;
+var bitBuffer = BitBuffer;
 export {
-  e as b
+  bitBuffer as b
 };
+//# sourceMappingURL=bit-buffer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bit-buffer.js","sources":["../../../../../../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,SAAS,YAAa;AACpB,OAAK,SAAS,CAAE;AAChB,OAAK,SAAS;AAChB;AAEA,UAAU,YAAY;AAAA,EAEpB,KAAK,SAAU,OAAO;AACpB,UAAM,WAAW,KAAK,MAAM,QAAQ,CAAC;AACrC,YAAS,KAAK,OAAO,QAAQ,MAAO,IAAI,QAAQ,IAAM,OAAO;AAAA,EAC9D;AAAA,EAED,KAAK,SAAU,KAAK,QAAQ;AAC1B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAK,QAAS,QAAS,SAAS,IAAI,IAAM,OAAO,CAAC;AAAA,IACnD;AAAA,EACF;AAAA,EAED,iBAAiB,WAAY;AAC3B,WAAO,KAAK;AAAA,EACb;AAAA,EAED,QAAQ,SAAU,KAAK;AACrB,UAAM,WAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,QAAI,KAAK,OAAO,UAAU,UAAU;AAClC,WAAK,OAAO,KAAK,CAAC;AAAA,IACnB;AAED,QAAI,KAAK;AACP,WAAK,OAAO,QAAQ,KAAM,QAAU,KAAK,SAAS;AAAA,IACnD;AAED,SAAK;AAAA,EACN;AACH;AAEA,IAAA,YAAiB;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/bit-matrix.cjs

@@ -1 +1,27 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function e(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)}e.prototype.set=function(t,i,r,s){const n=t*this.size+i;this.data[n]=r,s&&(this.reservedBit[n]=!0)};e.prototype.get=function(t,i){return this.data[t*this.size+i]};e.prototype.xor=function(t,i,r){this.data[t*this.size+i]^=r};e.prototype.isReserved=function(t,i){return this.reservedBit[t*this.size+i]};var o=e;exports.bitMatrix=o;
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+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];
+};
+var bitMatrix = BitMatrix;
+exports.bitMatrix = bitMatrix;
+//# sourceMappingURL=bit-matrix.cjs.map

package/dist/node_modules/qrcode/lib/core/bit-matrix.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-matrix.cjs","sources":["../../../../../../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,SAAS,UAAW,MAAM;AACxB,MAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACpE;AAED,OAAK,OAAO;AACZ,OAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,OAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAC/C;AAWA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,QAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,OAAK,KAAK,KAAK,IAAI;AACnB,MAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAC1C;AASA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,SAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AACxC;AAUA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,OAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AACtC;AASA,UAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,SAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAC/C;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}

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

@@ -1,22 +1,27 @@
-function r(t) {
-  if (!t || t < 1)
+function BitMatrix(size) {
+  if (!size || size < 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);
+  }
+  this.size = size;
+  this.data = new Uint8Array(size * size);
+  this.reservedBit = new Uint8Array(size * size);
 }
-r.prototype.set = function(t, i, e, s) {
-  const n = t * this.size + i;
-  this.data[n] = e, s && (this.reservedBit[n] = !0);
+BitMatrix.prototype.set = function(row, col, value, reserved) {
+  const index = row * this.size + col;
+  this.data[index] = value;
+  if (reserved) this.reservedBit[index] = true;
 };
-r.prototype.get = function(t, i) {
-  return this.data[t * this.size + i];
+BitMatrix.prototype.get = function(row, col) {
+  return this.data[row * this.size + col];
 };
-r.prototype.xor = function(t, i, e) {
-  this.data[t * this.size + i] ^= e;
+BitMatrix.prototype.xor = function(row, col, value) {
+  this.data[row * this.size + col] ^= value;
 };
-r.prototype.isReserved = function(t, i) {
-  return this.reservedBit[t * this.size + i];
+BitMatrix.prototype.isReserved = function(row, col) {
+  return this.reservedBit[row * this.size + col];
 };
-var a = r;
+var bitMatrix = BitMatrix;
 export {
-  a as b
+  bitMatrix as b
 };
+//# sourceMappingURL=bit-matrix.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bit-matrix.js","sources":["../../../../../../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,SAAS,UAAW,MAAM;AACxB,MAAI,CAAC,QAAQ,OAAO,GAAG;AACrB,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACpE;AAED,OAAK,OAAO;AACZ,OAAK,OAAO,IAAI,WAAW,OAAO,IAAI;AACtC,OAAK,cAAc,IAAI,WAAW,OAAO,IAAI;AAC/C;AAWA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO,UAAU;AAC7D,QAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,OAAK,KAAK,KAAK,IAAI;AACnB,MAAI,SAAU,MAAK,YAAY,KAAK,IAAI;AAC1C;AASA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,SAAO,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AACxC;AAUA,UAAU,UAAU,MAAM,SAAU,KAAK,KAAK,OAAO;AACnD,OAAK,KAAK,MAAM,KAAK,OAAO,GAAG,KAAK;AACtC;AASA,UAAU,UAAU,aAAa,SAAU,KAAK,KAAK;AACnD,SAAO,KAAK,YAAY,MAAM,KAAK,OAAO,GAAG;AAC/C;AAEA,IAAA,YAAiB;","x_google_ignoreList":[0]}

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

@@ -1 +1,30 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("./mode.cjs");const o=require("../../../../_virtual/mode.cjs"),r=o.__exports;function e(t){this.mode=r.BYTE,typeof t=="string"?this.data=new TextEncoder().encode(t):this.data=new Uint8Array(t)}e.getBitsLength=function(n){return n*8};e.prototype.getLength=function(){return this.data.length};e.prototype.getBitsLength=function(){return e.getBitsLength(this.data.length)};e.prototype.write=function(t){for(let n=0,i=this.data.length;n<i;n++)t.put(this.data[n],8)};var g=e;exports.byteData=g;
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("./mode.cjs");
+const mode = require("../../../../_virtual/mode.cjs");
+const Mode = mode.__exports;
+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 getBitsLength2() {
+  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);
+  }
+};
+var byteData = ByteData;
+exports.byteData = byteData;
+//# sourceMappingURL=byte-data.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"byte-data.cjs","sources":["../../../../../../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","getBitsLength"],"mappings":";;;;AAAA,MAAM,OAAOA,KAAiB;AAE9B,SAAS,SAAU,MAAM;AACvB,OAAK,OAAO,KAAK;AACjB,MAAI,OAAQ,SAAU,UAAU;AAC9B,SAAK,OAAO,IAAI,YAAW,EAAG,OAAO,IAAI;AAAA,EAC7C,OAAS;AACL,SAAK,OAAO,IAAI,WAAW,IAAI;AAAA,EAChC;AACH;AAEA,SAAS,gBAAgB,SAAS,cAAe,QAAQ;AACvD,SAAO,SAAS;AAClB;AAEA,SAAS,UAAU,YAAY,SAAS,YAAa;AACnD,SAAO,KAAK,KAAK;AACnB;AAEA,SAAS,UAAU,gBAAgB,SAASC,iBAAiB;AAC3D,SAAO,SAAS,cAAc,KAAK,KAAK,MAAM;AAChD;AAEA,SAAS,UAAU,QAAQ,SAAU,WAAW;AAC9C,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK;AAChD,cAAU,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,EAC9B;AACH;AAEA,IAAA,WAAiB;;","x_google_ignoreList":[0]}

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

@@ -1,23 +1,30 @@
 import "./mode.js";
-import { __exports as o } from "../../../../_virtual/mode.js";
-const r = o;
-function e(t) {
-  this.mode = r.BYTE, typeof t == "string" ? this.data = new TextEncoder().encode(t) : this.data = new Uint8Array(t);
+import { __exports as mode } from "../../../../_virtual/mode.js";
+const Mode = mode;
+function ByteData(data) {
+  this.mode = Mode.BYTE;
+  if (typeof data === "string") {
+    this.data = new TextEncoder().encode(data);
+  } else {
+    this.data = new Uint8Array(data);
+  }
 }
-e.getBitsLength = function(n) {
-  return n * 8;
+ByteData.getBitsLength = function getBitsLength(length) {
+  return length * 8;
 };
-e.prototype.getLength = function() {
+ByteData.prototype.getLength = function getLength() {
   return this.data.length;
 };
-e.prototype.getBitsLength = function() {
-  return e.getBitsLength(this.data.length);
+ByteData.prototype.getBitsLength = function getBitsLength2() {
+  return ByteData.getBitsLength(this.data.length);
 };
-e.prototype.write = function(t) {
-  for (let n = 0, i = this.data.length; n < i; n++)
-    t.put(this.data[n], 8);
+ByteData.prototype.write = function(bitBuffer) {
+  for (let i = 0, l = this.data.length; i < l; i++) {
+    bitBuffer.put(this.data[i], 8);
+  }
 };
-var h = e;
+var byteData = ByteData;
 export {
-  h as b
+  byteData as b
 };
+//# sourceMappingURL=byte-data.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"byte-data.js","sources":["../../../../../../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","getBitsLength"],"mappings":";;AAAA,MAAM,OAAOA;AAEb,SAAS,SAAU,MAAM;AACvB,OAAK,OAAO,KAAK;AACjB,MAAI,OAAQ,SAAU,UAAU;AAC9B,SAAK,OAAO,IAAI,YAAW,EAAG,OAAO,IAAI;AAAA,EAC7C,OAAS;AACL,SAAK,OAAO,IAAI,WAAW,IAAI;AAAA,EAChC;AACH;AAEA,SAAS,gBAAgB,SAAS,cAAe,QAAQ;AACvD,SAAO,SAAS;AAClB;AAEA,SAAS,UAAU,YAAY,SAAS,YAAa;AACnD,SAAO,KAAK,KAAK;AACnB;AAEA,SAAS,UAAU,gBAAgB,SAASC,iBAAiB;AAC3D,SAAO,SAAS,cAAc,KAAK,KAAK,MAAM;AAChD;AAEA,SAAS,UAAU,QAAQ,SAAU,WAAW;AAC9C,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK;AAChD,cAAU,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,EAC9B;AACH;AAEA,IAAA,WAAiB;","x_google_ignoreList":[0]}