@ozdao/prometheus-framework 0.2.199 → 0.2.200

package/dist/node_modules/qrcode/lib/core/qrcode.js

@@ -1,159 +1,283 @@
-import { __exports as P } from "../../../../_virtual/qrcode.js";
+import { __exports as qrcode } from "../../../../_virtual/qrcode.js";
 import "./utils.js";
 import "./error-correction-level.js";
-import { b as D } from "./bit-buffer.js";
-import { b as x } from "./bit-matrix.js";
+import { b as bitBuffer } from "./bit-buffer.js";
+import { b as bitMatrix } from "./bit-matrix.js";
 import "./alignment-pattern.js";
 import "./finder-pattern.js";
 import "./mask-pattern.js";
 import "./error-correction-code.js";
-import { r as V } from "./reed-solomon-encoder.js";
+import { r as reedSolomonEncoder } from "./reed-solomon-encoder.js";
 import "./version.js";
 import "./format-info.js";
 import "./mode.js";
 import "./segments.js";
-import { __exports as G } from "../../../../_virtual/utils.js";
-import { __exports as R } from "../../../../_virtual/error-correction-level.js";
-import { __exports as J } from "../../../../_virtual/mask-pattern.js";
-import { __exports as N } from "../../../../_virtual/version.js";
-import { __exports as U } from "../../../../_virtual/segments.js";
-import { __exports as q } from "../../../../_virtual/alignment-pattern.js";
-import { __exports as Q } from "../../../../_virtual/finder-pattern.js";
-import { __exports as L } from "../../../../_virtual/error-correction-code.js";
-import { __exports as j } from "../../../../_virtual/format-info.js";
-import { __exports as H } from "../../../../_virtual/mode.js";
-const w = G, I = R, K = D, O = x, W = q, X = Q, y = J, z = L, Y = V, g = N, Z = j, $ = H, S = U;
-function v(s, f) {
-  const n = s.size, t = X.getPositions(f);
-  for (let c = 0; c < t.length; c++) {
-    const e = t[c][0], o = t[c][1];
-    for (let i = -1; i <= 7; i++)
-      if (!(e + i <= -1 || n <= e + i))
-        for (let r = -1; r <= 7; r++)
-          o + r <= -1 || n <= o + r || (i >= 0 && i <= 6 && (r === 0 || r === 6) || r >= 0 && r <= 6 && (i === 0 || i === 6) || i >= 2 && i <= 4 && r >= 2 && r <= 4 ? s.set(e + i, o + r, !0, !0) : s.set(e + i, o + r, !1, !0));
+import { __exports as utils } from "../../../../_virtual/utils.js";
+import { __exports as errorCorrectionLevel } from "../../../../_virtual/error-correction-level.js";
+import { __exports as maskPattern } from "../../../../_virtual/mask-pattern.js";
+import { __exports as version } from "../../../../_virtual/version.js";
+import { __exports as segments } from "../../../../_virtual/segments.js";
+import { __exports as alignmentPattern } from "../../../../_virtual/alignment-pattern.js";
+import { __exports as finderPattern } from "../../../../_virtual/finder-pattern.js";
+import { __exports as errorCorrectionCode } from "../../../../_virtual/error-correction-code.js";
+import { __exports as formatInfo } from "../../../../_virtual/format-info.js";
+import { __exports as mode } from "../../../../_virtual/mode.js";
+const Utils = utils;
+const ECLevel = errorCorrectionLevel;
+const BitBuffer = bitBuffer;
+const BitMatrix = bitMatrix;
+const AlignmentPattern = alignmentPattern;
+const FinderPattern = finderPattern;
+const MaskPattern = maskPattern;
+const ECCode = errorCorrectionCode;
+const ReedSolomonEncoder = reedSolomonEncoder;
+const Version = version;
+const FormatInfo = formatInfo;
+const Mode = mode;
+const Segments = segments;
+function setupFinderPattern(matrix, version2) {
+  const size = matrix.size;
+  const pos = FinderPattern.getPositions(version2);
+  for (let i = 0; i < pos.length; i++) {
+    const row = pos[i][0];
+    const col = pos[i][1];
+    for (let r = -1; r <= 7; r++) {
+      if (row + r <= -1 || size <= row + r) continue;
+      for (let c = -1; c <= 7; c++) {
+        if (col + c <= -1 || size <= col + c) continue;
+        if (r >= 0 && r <= 6 && (c === 0 || c === 6) || c >= 0 && c <= 6 && (r === 0 || r === 6) || r >= 2 && r <= 4 && c >= 2 && c <= 4) {
+          matrix.set(row + r, col + c, true, true);
+        } else {
+          matrix.set(row + r, col + c, false, true);
+        }
+      }
+    }
   }
 }
-function tt(s) {
-  const f = s.size;
-  for (let n = 8; n < f - 8; n++) {
-    const t = n % 2 === 0;
-    s.set(n, 6, t, !0), s.set(6, n, t, !0);
+function setupTimingPattern(matrix) {
+  const size = matrix.size;
+  for (let r = 8; r < size - 8; r++) {
+    const value = r % 2 === 0;
+    matrix.set(r, 6, value, true);
+    matrix.set(6, r, value, true);
   }
 }
-function et(s, f) {
-  const n = W.getPositions(f);
-  for (let t = 0; t < n.length; t++) {
-    const c = n[t][0], e = n[t][1];
-    for (let o = -2; o <= 2; o++)
-      for (let i = -2; i <= 2; i++)
-        o === -2 || o === 2 || i === -2 || i === 2 || o === 0 && i === 0 ? s.set(c + o, e + i, !0, !0) : s.set(c + o, e + i, !1, !0);
+function setupAlignmentPattern(matrix, version2) {
+  const pos = AlignmentPattern.getPositions(version2);
+  for (let i = 0; i < pos.length; i++) {
+    const row = pos[i][0];
+    const col = pos[i][1];
+    for (let r = -2; r <= 2; r++) {
+      for (let c = -2; c <= 2; c++) {
+        if (r === -2 || r === 2 || c === -2 || c === 2 || r === 0 && c === 0) {
+          matrix.set(row + r, col + c, true, true);
+        } else {
+          matrix.set(row + r, col + c, false, true);
+        }
+      }
+    }
   }
 }
-function ot(s, f) {
-  const n = s.size, t = g.getEncodedBits(f);
-  let c, e, o;
-  for (let i = 0; i < 18; i++)
-    c = Math.floor(i / 3), e = i % 3 + n - 8 - 3, o = (t >> i & 1) === 1, s.set(c, e, o, !0), s.set(e, c, o, !0);
+function setupVersionInfo(matrix, version2) {
+  const size = matrix.size;
+  const bits = Version.getEncodedBits(version2);
+  let row, col, mod;
+  for (let i = 0; i < 18; i++) {
+    row = Math.floor(i / 3);
+    col = i % 3 + size - 8 - 3;
+    mod = (bits >> i & 1) === 1;
+    matrix.set(row, col, mod, true);
+    matrix.set(col, row, mod, true);
+  }
 }
-function B(s, f, n) {
-  const t = s.size, c = Z.getEncodedBits(f, n);
-  let e, o;
-  for (e = 0; e < 15; e++)
-    o = (c >> e & 1) === 1, e < 6 ? s.set(e, 8, o, !0) : e < 8 ? s.set(e + 1, 8, o, !0) : s.set(t - 15 + e, 8, o, !0), e < 8 ? s.set(8, t - e - 1, o, !0) : e < 9 ? s.set(8, 15 - e - 1 + 1, o, !0) : s.set(8, 15 - e - 1, o, !0);
-  s.set(t - 8, 8, 1, !0);
+function setupFormatInfo(matrix, errorCorrectionLevel2, maskPattern2) {
+  const size = matrix.size;
+  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel2, maskPattern2);
+  let i, mod;
+  for (i = 0; i < 15; i++) {
+    mod = (bits >> i & 1) === 1;
+    if (i < 6) {
+      matrix.set(i, 8, mod, true);
+    } else if (i < 8) {
+      matrix.set(i + 1, 8, mod, true);
+    } else {
+      matrix.set(size - 15 + i, 8, mod, true);
+    }
+    if (i < 8) {
+      matrix.set(8, size - i - 1, mod, true);
+    } else if (i < 9) {
+      matrix.set(8, 15 - i - 1 + 1, mod, true);
+    } else {
+      matrix.set(8, 15 - i - 1, mod, true);
+    }
+  }
+  matrix.set(size - 8, 8, 1, true);
 }
-function st(s, f) {
-  const n = s.size;
-  let t = -1, c = n - 1, e = 7, o = 0;
-  for (let i = n - 1; i > 0; i -= 2)
-    for (i === 6 && i--; ; ) {
-      for (let r = 0; r < 2; r++)
-        if (!s.isReserved(c, i - r)) {
-          let u = !1;
-          o < f.length && (u = (f[o] >>> e & 1) === 1), s.set(c, i - r, u), e--, e === -1 && (o++, e = 7);
+function setupData(matrix, data) {
+  const size = matrix.size;
+  let inc = -1;
+  let row = size - 1;
+  let bitIndex = 7;
+  let byteIndex = 0;
+  for (let col = size - 1; col > 0; col -= 2) {
+    if (col === 6) col--;
+    while (true) {
+      for (let c = 0; c < 2; c++) {
+        if (!matrix.isReserved(row, col - c)) {
+          let dark = false;
+          if (byteIndex < data.length) {
+            dark = (data[byteIndex] >>> bitIndex & 1) === 1;
+          }
+          matrix.set(row, col - c, dark);
+          bitIndex--;
+          if (bitIndex === -1) {
+            byteIndex++;
+            bitIndex = 7;
+          }
         }
-      if (c += t, c < 0 || n <= c) {
-        c -= t, t = -t;
+      }
+      row += inc;
+      if (row < 0 || size <= row) {
+        row -= inc;
+        inc = -inc;
         break;
       }
     }
+  }
 }
-function nt(s, f, n) {
-  const t = new K();
-  n.forEach(function(r) {
-    t.put(r.mode.bit, 4), t.put(r.getLength(), $.getCharCountIndicator(r.mode, s)), r.write(t);
+function createData(version2, errorCorrectionLevel2, segments2) {
+  const buffer = new BitBuffer();
+  segments2.forEach(function(data) {
+    buffer.put(data.mode.bit, 4);
+    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version2));
+    data.write(buffer);
   });
-  const c = w.getSymbolTotalCodewords(s), e = z.getTotalCodewordsCount(s, f), o = (c - e) * 8;
-  for (t.getLengthInBits() + 4 <= o && t.put(0, 4); t.getLengthInBits() % 8 !== 0; )
-    t.putBit(0);
-  const i = (o - t.getLengthInBits()) / 8;
-  for (let r = 0; r < i; r++)
-    t.put(r % 2 ? 17 : 236, 8);
-  return rt(t, s, f);
+  const totalCodewords = Utils.getSymbolTotalCodewords(version2);
+  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
+  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
+    buffer.put(0, 4);
+  }
+  while (buffer.getLengthInBits() % 8 !== 0) {
+    buffer.putBit(0);
+  }
+  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8;
+  for (let i = 0; i < remainingByte; i++) {
+    buffer.put(i % 2 ? 17 : 236, 8);
+  }
+  return createCodewords(buffer, version2, errorCorrectionLevel2);
 }
-function rt(s, f, n) {
-  const t = w.getSymbolTotalCodewords(f), c = z.getTotalCodewordsCount(f, n), e = t - c, o = z.getBlocksCount(f, n), i = t % o, r = o - i, u = Math.floor(t / o), m = Math.floor(e / o), k = m + 1, M = u - m, A = new Y(M);
-  let C = 0;
-  const p = new Array(o), T = new Array(o);
-  let b = 0;
-  const F = new Uint8Array(s.buffer);
-  for (let d = 0; d < o; d++) {
-    const _ = d < r ? m : k;
-    p[d] = F.slice(C, C + _), T[d] = A.encode(p[d]), C += _, b = Math.max(b, _);
-  }
-  const h = new Uint8Array(t);
-  let E = 0, l, a;
-  for (l = 0; l < b; l++)
-    for (a = 0; a < o; a++)
-      l < p[a].length && (h[E++] = p[a][l]);
-  for (l = 0; l < M; l++)
-    for (a = 0; a < o; a++)
-      h[E++] = T[a][l];
-  return h;
+function createCodewords(bitBuffer2, version2, errorCorrectionLevel2) {
+  const totalCodewords = Utils.getSymbolTotalCodewords(version2);
+  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+  const dataTotalCodewords = totalCodewords - ecTotalCodewords;
+  const ecTotalBlocks = ECCode.getBlocksCount(version2, errorCorrectionLevel2);
+  const blocksInGroup2 = totalCodewords % ecTotalBlocks;
+  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2;
+  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks);
+  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks);
+  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1;
+  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1;
+  const rs = new ReedSolomonEncoder(ecCount);
+  let offset = 0;
+  const dcData = new Array(ecTotalBlocks);
+  const ecData = new Array(ecTotalBlocks);
+  let maxDataSize = 0;
+  const buffer = new Uint8Array(bitBuffer2.buffer);
+  for (let b = 0; b < ecTotalBlocks; b++) {
+    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2;
+    dcData[b] = buffer.slice(offset, offset + dataSize);
+    ecData[b] = rs.encode(dcData[b]);
+    offset += dataSize;
+    maxDataSize = Math.max(maxDataSize, dataSize);
+  }
+  const data = new Uint8Array(totalCodewords);
+  let index = 0;
+  let i, r;
+  for (i = 0; i < maxDataSize; i++) {
+    for (r = 0; r < ecTotalBlocks; r++) {
+      if (i < dcData[r].length) {
+        data[index++] = dcData[r][i];
+      }
+    }
+  }
+  for (i = 0; i < ecCount; i++) {
+    for (r = 0; r < ecTotalBlocks; r++) {
+      data[index++] = ecData[r][i];
+    }
+  }
+  return data;
 }
-function it(s, f, n, t) {
-  let c;
-  if (Array.isArray(s))
-    c = S.fromArray(s);
-  else if (typeof s == "string") {
-    let u = f;
-    if (!u) {
-      const m = S.rawSplit(s);
-      u = g.getBestVersionForData(m, n);
+function createSymbol(data, version2, errorCorrectionLevel2, maskPattern2) {
+  let segments2;
+  if (Array.isArray(data)) {
+    segments2 = Segments.fromArray(data);
+  } else if (typeof data === "string") {
+    let estimatedVersion = version2;
+    if (!estimatedVersion) {
+      const rawSegments = Segments.rawSplit(data);
+      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel2);
     }
-    c = S.fromString(s, u || 40);
-  } else
+    segments2 = Segments.fromString(data, estimatedVersion || 40);
+  } else {
     throw new Error("Invalid data");
-  const e = g.getBestVersionForData(c, n);
-  if (!e)
+  }
+  const bestVersion = Version.getBestVersionForData(segments2, errorCorrectionLevel2);
+  if (!bestVersion) {
     throw new Error("The amount of data is too big to be stored in a QR Code");
-  if (!f)
-    f = e;
-  else if (f < e)
+  }
+  if (!version2) {
+    version2 = bestVersion;
+  } else if (version2 < bestVersion) {
     throw new Error(
-      `
-The chosen QR Code version cannot contain this amount of data.
-Minimum version required to store current data is: ` + e + `.
-`
+      "\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: " + bestVersion + ".\n"
     );
-  const o = nt(f, n, c), i = w.getSymbolSize(f), r = new O(i);
-  return v(r, f), tt(r), et(r, f), B(r, n, 0), f >= 7 && ot(r, f), st(r, o), isNaN(t) && (t = y.getBestMask(
-    r,
-    B.bind(null, r, n)
-  )), y.applyMask(t, r), B(r, n, t), {
-    modules: r,
-    version: f,
-    errorCorrectionLevel: n,
-    maskPattern: t,
-    segments: c
+  }
+  const dataBits = createData(version2, errorCorrectionLevel2, segments2);
+  const moduleCount = Utils.getSymbolSize(version2);
+  const modules = new BitMatrix(moduleCount);
+  setupFinderPattern(modules, version2);
+  setupTimingPattern(modules);
+  setupAlignmentPattern(modules, version2);
+  setupFormatInfo(modules, errorCorrectionLevel2, 0);
+  if (version2 >= 7) {
+    setupVersionInfo(modules, version2);
+  }
+  setupData(modules, dataBits);
+  if (isNaN(maskPattern2)) {
+    maskPattern2 = MaskPattern.getBestMask(
+      modules,
+      setupFormatInfo.bind(null, modules, errorCorrectionLevel2)
+    );
+  }
+  MaskPattern.applyMask(maskPattern2, modules);
+  setupFormatInfo(modules, errorCorrectionLevel2, maskPattern2);
+  return {
+    modules,
+    version: version2,
+    errorCorrectionLevel: errorCorrectionLevel2,
+    maskPattern: maskPattern2,
+    segments: segments2
   };
 }
-P.create = function(f, n) {
-  if (typeof f > "u" || f === "")
+qrcode.create = function create(data, options) {
+  if (typeof data === "undefined" || data === "") {
     throw new Error("No input text");
-  let t = I.M, c, e;
-  return typeof n < "u" && (t = I.from(n.errorCorrectionLevel, I.M), c = g.from(n.version), e = y.from(n.maskPattern), n.toSJISFunc && w.setToSJISFunction(n.toSJISFunc)), it(f, c, t, e);
+  }
+  let errorCorrectionLevel2 = ECLevel.M;
+  let version2;
+  let mask;
+  if (typeof options !== "undefined") {
+    errorCorrectionLevel2 = ECLevel.from(options.errorCorrectionLevel, ECLevel.M);
+    version2 = Version.from(options.version);
+    mask = MaskPattern.from(options.maskPattern);
+    if (options.toSJISFunc) {
+      Utils.setToSJISFunction(options.toSJISFunc);
+    }
+  }
+  return createSymbol(data, version2, errorCorrectionLevel2, mask);
 };
 export {
-  P as default
+  qrcode as default
 };
+//# sourceMappingURL=qrcode.js.map

package/dist/node_modules/qrcode/lib/core/qrcode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"qrcode.js","sources":["../../../../../../node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n *   http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n//   http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n//   http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n  const size = matrix.size\n  const pos = FinderPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -1; r <= 7; r++) {\n      if (row + r <= -1 || size <= row + r) continue\n\n      for (let c = -1; c <= 7; c++) {\n        if (col + c <= -1 || size <= col + c) continue\n\n        if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n          (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n          (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param  {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n  const size = matrix.size\n\n  for (let r = 8; r < size - 8; r++) {\n    const value = r % 2 === 0\n    matrix.set(r, 6, value, true)\n    matrix.set(6, r, value, true)\n  }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n  const pos = AlignmentPattern.getPositions(version)\n\n  for (let i = 0; i < pos.length; i++) {\n    const row = pos[i][0]\n    const col = pos[i][1]\n\n    for (let r = -2; r <= 2; r++) {\n      for (let c = -2; c <= 2; c++) {\n        if (r === -2 || r === 2 || c === -2 || c === 2 ||\n          (r === 0 && c === 0)) {\n          matrix.set(row + r, col + c, true, true)\n        } else {\n          matrix.set(row + r, col + c, false, true)\n        }\n      }\n    }\n  }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param  {BitMatrix} matrix  Modules matrix\n * @param  {Number}    version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n  const size = matrix.size\n  const bits = Version.getEncodedBits(version)\n  let row, col, mod\n\n  for (let i = 0; i < 18; i++) {\n    row = Math.floor(i / 3)\n    col = i % 3 + size - 8 - 3\n    mod = ((bits >> i) & 1) === 1\n\n    matrix.set(row, col, mod, true)\n    matrix.set(col, row, mod, true)\n  }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param  {BitMatrix} matrix               Modules matrix\n * @param  {ErrorCorrectionLevel}    errorCorrectionLevel Error correction level\n * @param  {Number}    maskPattern          Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n  const size = matrix.size\n  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n  let i, mod\n\n  for (i = 0; i < 15; i++) {\n    mod = ((bits >> i) & 1) === 1\n\n    // vertical\n    if (i < 6) {\n      matrix.set(i, 8, mod, true)\n    } else if (i < 8) {\n      matrix.set(i + 1, 8, mod, true)\n    } else {\n      matrix.set(size - 15 + i, 8, mod, true)\n    }\n\n    // horizontal\n    if (i < 8) {\n      matrix.set(8, size - i - 1, mod, true)\n    } else if (i < 9) {\n      matrix.set(8, 15 - i - 1 + 1, mod, true)\n    } else {\n      matrix.set(8, 15 - i - 1, mod, true)\n    }\n  }\n\n  // fixed module\n  matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param  {BitMatrix}  matrix Modules matrix\n * @param  {Uint8Array} data   Data codewords\n */\nfunction setupData (matrix, data) {\n  const size = matrix.size\n  let inc = -1\n  let row = size - 1\n  let bitIndex = 7\n  let byteIndex = 0\n\n  for (let col = size - 1; col > 0; col -= 2) {\n    if (col === 6) col--\n\n    while (true) {\n      for (let c = 0; c < 2; c++) {\n        if (!matrix.isReserved(row, col - c)) {\n          let dark = false\n\n          if (byteIndex < data.length) {\n            dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n          }\n\n          matrix.set(row, col - c, dark)\n          bitIndex--\n\n          if (bitIndex === -1) {\n            byteIndex++\n            bitIndex = 7\n          }\n        }\n      }\n\n      row += inc\n\n      if (row < 0 || size <= row) {\n        row -= inc\n        inc = -inc\n        break\n      }\n    }\n  }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param  {Number}   version              QR Code version\n * @param  {ErrorCorrectionLevel}   errorCorrectionLevel Error correction level\n * @param  {ByteData} data                 Data input\n * @return {Uint8Array}                    Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n  // Prepare data buffer\n  const buffer = new BitBuffer()\n\n  segments.forEach(function (data) {\n    // prefix data with mode indicator (4 bits)\n    buffer.put(data.mode.bit, 4)\n\n    // Prefix data with character count indicator.\n    // The character count indicator is a string of bits that represents the\n    // number of characters that are being encoded.\n    // The character count indicator must be placed after the mode indicator\n    // and must be a certain number of bits long, depending on the QR version\n    // and data mode\n    // @see {@link Mode.getCharCountIndicator}.\n    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n    // add binary data sequence to buffer\n    data.write(buffer)\n  })\n\n  // Calculate required number of bits\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n  // Add a terminator.\n  // If the bit string is shorter than the total number of required bits,\n  // a terminator of up to four 0s must be added to the right side of the string.\n  // If the bit string is more than four bits shorter than the required number of bits,\n  // add four 0s to the end.\n  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n    buffer.put(0, 4)\n  }\n\n  // If the bit string is fewer than four bits shorter, add only the number of 0s that\n  // are needed to reach the required number of bits.\n\n  // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n  // pad the string on the right with 0s to make the string's length a multiple of 8.\n  while (buffer.getLengthInBits() % 8 !== 0) {\n    buffer.putBit(0)\n  }\n\n  // Add pad bytes if the string is still shorter than the total number of required bits.\n  // Extend the buffer to fill the data capacity of the symbol corresponding to\n  // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n  // and 00010001 (0x11) alternately.\n  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n  for (let i = 0; i < remainingByte; i++) {\n    buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n  }\n\n  return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param  {BitBuffer} bitBuffer            Data to encode\n * @param  {Number}    version              QR Code version\n * @param  {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array}                     Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n  // Total codewords for this QR code version (Data + Error correction)\n  const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n  // Total number of error correction codewords\n  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n  // Total number of data codewords\n  const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n  // Total number of blocks\n  const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n  // Calculate how many blocks each group should contain\n  const blocksInGroup2 = totalCodewords % ecTotalBlocks\n  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n  // Number of EC codewords is the same for both groups\n  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n  // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n  const rs = new ReedSolomonEncoder(ecCount)\n\n  let offset = 0\n  const dcData = new Array(ecTotalBlocks)\n  const ecData = new Array(ecTotalBlocks)\n  let maxDataSize = 0\n  const buffer = new Uint8Array(bitBuffer.buffer)\n\n  // Divide the buffer into the required number of blocks\n  for (let b = 0; b < ecTotalBlocks; b++) {\n    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n    // extract a block of data from buffer\n    dcData[b] = buffer.slice(offset, offset + dataSize)\n\n    // Calculate EC codewords for this data block\n    ecData[b] = rs.encode(dcData[b])\n\n    offset += dataSize\n    maxDataSize = Math.max(maxDataSize, dataSize)\n  }\n\n  // Create final data\n  // Interleave the data and error correction codewords from each block\n  const data = new Uint8Array(totalCodewords)\n  let index = 0\n  let i, r\n\n  // Add data codewords\n  for (i = 0; i < maxDataSize; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      if (i < dcData[r].length) {\n        data[index++] = dcData[r][i]\n      }\n    }\n  }\n\n  // Apped EC codewords\n  for (i = 0; i < ecCount; i++) {\n    for (r = 0; r < ecTotalBlocks; r++) {\n      data[index++] = ecData[r][i]\n    }\n  }\n\n  return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param  {String} data                 Input string\n * @param  {Number} version              QR Code version\n * @param  {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param  {MaskPattern} maskPattern     Mask pattern\n * @return {Object}                      Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n  let segments\n\n  if (Array.isArray(data)) {\n    segments = Segments.fromArray(data)\n  } else if (typeof data === 'string') {\n    let estimatedVersion = version\n\n    if (!estimatedVersion) {\n      const rawSegments = Segments.rawSplit(data)\n\n      // Estimate best version that can contain raw splitted segments\n      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n    }\n\n    // Build optimized segments\n    // If estimated version is undefined, try with the highest version\n    segments = Segments.fromString(data, estimatedVersion || 40)\n  } else {\n    throw new Error('Invalid data')\n  }\n\n  // Get the min version that can contain data\n  const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n  // If no version is found, data cannot be stored\n  if (!bestVersion) {\n    throw new Error('The amount of data is too big to be stored in a QR Code')\n  }\n\n  // If not specified, use min version as default\n  if (!version) {\n    version = bestVersion\n\n  // Check if the specified version can contain the data\n  } else if (version < bestVersion) {\n    throw new Error('\\n' +\n      'The chosen QR Code version cannot contain this amount of data.\\n' +\n      'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n    )\n  }\n\n  const dataBits = createData(version, errorCorrectionLevel, segments)\n\n  // Allocate matrix buffer\n  const moduleCount = Utils.getSymbolSize(version)\n  const modules = new BitMatrix(moduleCount)\n\n  // Add function modules\n  setupFinderPattern(modules, version)\n  setupTimingPattern(modules)\n  setupAlignmentPattern(modules, version)\n\n  // Add temporary dummy bits for format info just to set them as reserved.\n  // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n  // since the masking operation must be performed only on the encoding region.\n  // These blocks will be replaced with correct values later in code.\n  setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n  if (version >= 7) {\n    setupVersionInfo(modules, version)\n  }\n\n  // Add data codewords\n  setupData(modules, dataBits)\n\n  if (isNaN(maskPattern)) {\n    // Find best mask pattern\n    maskPattern = MaskPattern.getBestMask(modules,\n      setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n  }\n\n  // Apply mask pattern\n  MaskPattern.applyMask(maskPattern, modules)\n\n  // Replace format info bits with correct values\n  setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n  return {\n    modules: modules,\n    version: version,\n    errorCorrectionLevel: errorCorrectionLevel,\n    maskPattern: maskPattern,\n    segments: segments\n  }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data                 Input data\n * @param {Object} options                      Optional configurations\n * @param {Number} options.version              QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc         Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n  if (typeof data === 'undefined' || data === '') {\n    throw new Error('No input text')\n  }\n\n  let errorCorrectionLevel = ECLevel.M\n  let version\n  let mask\n\n  if (typeof options !== 'undefined') {\n    // Use higher error correction level as default\n    errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n    version = Version.from(options.version)\n    mask = MaskPattern.from(options.maskPattern)\n\n    if (options.toSJISFunc) {\n      Utils.setToSJISFunction(options.toSJISFunc)\n    }\n  }\n\n  return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","require$$11","require$$12","version","errorCorrectionLevel","maskPattern","segments","bitBuffer"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAAA,MAAM,QAAQA;AACd,MAAM,UAAUC;AAChB,MAAM,YAAYC;AAClB,MAAM,YAAYC;AAClB,MAAM,mBAAmBC;AACzB,MAAM,gBAAgBC;AACtB,MAAM,cAAcC;AACpB,MAAM,SAASC;AACf,MAAM,qBAAqBC;AAC3B,MAAM,UAAUC;AAChB,MAAM,aAAaC;AACnB,MAAM,OAAOC;AACb,MAAM,WAAWC;AAkCjB,SAAS,mBAAoB,QAAQC,UAAS;AAC5C,QAAM,OAAO,OAAO;AACpB,QAAM,MAAM,cAAc,aAAaA,QAAO;AAE9C,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,UAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,YAAK,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACxC,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACtC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAI;AACxC,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACH;AASA,SAAS,mBAAoB,QAAQ;AACnC,QAAM,OAAO,OAAO;AAEpB,WAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,UAAM,QAAQ,IAAI,MAAM;AACxB,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAC5B,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAAA,EAC7B;AACH;AAUA,SAAS,sBAAuB,QAAQA,UAAS;AAC/C,QAAM,MAAM,iBAAiB,aAAaA,QAAO;AAEjD,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAC1C,MAAM,KAAK,MAAM,GAAI;AACtB,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACH;AAQA,SAAS,iBAAkB,QAAQA,UAAS;AAC1C,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,QAAQ,eAAeA,QAAO;AAC3C,MAAI,KAAK,KAAK;AAEd,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,KAAK,MAAM,IAAI,CAAC;AACtB,UAAM,IAAI,IAAI,OAAO,IAAI;AACzB,WAAQ,QAAQ,IAAK,OAAO;AAE5B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAC9B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAAA,EAC/B;AACH;AASA,SAAS,gBAAiB,QAAQC,uBAAsBC,cAAa;AACnE,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,WAAW,eAAeD,uBAAsBC,YAAW;AACxE,MAAI,GAAG;AAEP,OAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACvB,WAAQ,QAAQ,IAAK,OAAO;AAG5B,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IAChC,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IACpC,OAAW;AACL,aAAO,IAAI,OAAO,KAAK,GAAG,GAAG,KAAK,IAAI;AAAA,IACvC;AAGD,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,OAAO,IAAI,GAAG,KAAK,IAAI;AAAA,IAC3C,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AAAA,IAC7C,OAAW;AACL,aAAO,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,IACpC;AAAA,EACF;AAGD,SAAO,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI;AACjC;AAQA,SAAS,UAAW,QAAQ,MAAM;AAChC,QAAM,OAAO,OAAO;AACpB,MAAI,MAAM;AACV,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,WAAS,MAAM,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG;AAC1C,QAAI,QAAQ,EAAG;AAEf,WAAO,MAAM;AACX,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,OAAO,WAAW,KAAK,MAAM,CAAC,GAAG;AACpC,cAAI,OAAO;AAEX,cAAI,YAAY,KAAK,QAAQ;AAC3B,oBAAU,KAAK,SAAS,MAAM,WAAY,OAAO;AAAA,UAClD;AAED,iBAAO,IAAI,KAAK,MAAM,GAAG,IAAI;AAC7B;AAEA,cAAI,aAAa,IAAI;AACnB;AACA,uBAAW;AAAA,UACZ;AAAA,QACF;AAAA,MACF;AAED,aAAO;AAEP,UAAI,MAAM,KAAK,QAAQ,KAAK;AAC1B,eAAO;AACP,cAAM,CAAC;AACP;AAAA,MACD;AAAA,IACF;AAAA,EACF;AACH;AAUA,SAAS,WAAYF,UAASC,uBAAsBE,WAAU;AAE5D,QAAM,SAAS,IAAI,UAAW;AAE9B,EAAAA,UAAS,QAAQ,SAAU,MAAM;AAE/B,WAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAS3B,WAAO,IAAI,KAAK,UAAW,GAAE,KAAK,sBAAsB,KAAK,MAAMH,QAAO,CAAC;AAG3E,SAAK,MAAM,MAAM;AAAA,EACrB,CAAG;AAGD,QAAM,iBAAiB,MAAM,wBAAwBA,QAAO;AAC5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AACpF,QAAM,0BAA0B,iBAAiB,oBAAoB;AAOrE,MAAI,OAAO,oBAAoB,KAAK,wBAAwB;AAC1D,WAAO,IAAI,GAAG,CAAC;AAAA,EAChB;AAOD,SAAO,OAAO,oBAAoB,MAAM,GAAG;AACzC,WAAO,OAAO,CAAC;AAAA,EAChB;AAMD,QAAM,iBAAiB,yBAAyB,OAAO,gBAAiB,KAAI;AAC5E,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,WAAO,IAAI,IAAI,IAAI,KAAO,KAAM,CAAC;AAAA,EAClC;AAED,SAAO,gBAAgB,QAAQD,UAASC,qBAAoB;AAC9D;AAWA,SAAS,gBAAiBG,YAAWJ,UAASC,uBAAsB;AAElE,QAAM,iBAAiB,MAAM,wBAAwBD,QAAO;AAG5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AAGpF,QAAM,qBAAqB,iBAAiB;AAG5C,QAAM,gBAAgB,OAAO,eAAeD,UAASC,qBAAoB;AAGzE,QAAM,iBAAiB,iBAAiB;AACxC,QAAM,iBAAiB,gBAAgB;AAEvC,QAAM,yBAAyB,KAAK,MAAM,iBAAiB,aAAa;AAExE,QAAM,wBAAwB,KAAK,MAAM,qBAAqB,aAAa;AAC3E,QAAM,wBAAwB,wBAAwB;AAGtD,QAAM,UAAU,yBAAyB;AAGzC,QAAM,KAAK,IAAI,mBAAmB,OAAO;AAEzC,MAAI,SAAS;AACb,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,MAAI,cAAc;AAClB,QAAM,SAAS,IAAI,WAAWG,WAAU,MAAM;AAG9C,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,UAAM,WAAW,IAAI,iBAAiB,wBAAwB;AAG9D,WAAO,CAAC,IAAI,OAAO,MAAM,QAAQ,SAAS,QAAQ;AAGlD,WAAO,CAAC,IAAI,GAAG,OAAO,OAAO,CAAC,CAAC;AAE/B,cAAU;AACV,kBAAc,KAAK,IAAI,aAAa,QAAQ;AAAA,EAC7C;AAID,QAAM,OAAO,IAAI,WAAW,cAAc;AAC1C,MAAI,QAAQ;AACZ,MAAI,GAAG;AAGP,OAAK,IAAI,GAAG,IAAI,aAAa,KAAK;AAChC,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,UAAI,IAAI,OAAO,CAAC,EAAE,QAAQ;AACxB,aAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAGD,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,WAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IAC5B;AAAA,EACF;AAED,SAAO;AACT;AAWA,SAAS,aAAc,MAAMJ,UAASC,uBAAsBC,cAAa;AACvE,MAAIC;AAEJ,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,IAAAA,YAAW,SAAS,UAAU,IAAI;AAAA,EACtC,WAAa,OAAO,SAAS,UAAU;AACnC,QAAI,mBAAmBH;AAEvB,QAAI,CAAC,kBAAkB;AACrB,YAAM,cAAc,SAAS,SAAS,IAAI;AAG1C,yBAAmB,QAAQ,sBAAsB,aAAaC,qBAAoB;AAAA,IACnF;AAID,IAAAE,YAAW,SAAS,WAAW,MAAM,oBAAoB,EAAE;AAAA,EAC/D,OAAS;AACL,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AAGD,QAAM,cAAc,QAAQ,sBAAsBA,WAAUF,qBAAoB;AAGhF,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AAGD,MAAI,CAACD,UAAS;AACZ,IAAAA,WAAU;AAAA,EAGd,WAAaA,WAAU,aAAa;AAChC,UAAM,IAAI;AAAA,MAAM,0HAE0C,cAAc;AAAA,IACvE;AAAA,EACF;AAED,QAAM,WAAW,WAAWA,UAASC,uBAAsBE,SAAQ;AAGnE,QAAM,cAAc,MAAM,cAAcH,QAAO;AAC/C,QAAM,UAAU,IAAI,UAAU,WAAW;AAGzC,qBAAmB,SAASA,QAAO;AACnC,qBAAmB,OAAO;AAC1B,wBAAsB,SAASA,QAAO;AAMtC,kBAAgB,SAASC,uBAAsB,CAAC;AAEhD,MAAID,YAAW,GAAG;AAChB,qBAAiB,SAASA,QAAO;AAAA,EAClC;AAGD,YAAU,SAAS,QAAQ;AAE3B,MAAI,MAAME,YAAW,GAAG;AAEtB,IAAAA,eAAc,YAAY;AAAA,MAAY;AAAA,MACpC,gBAAgB,KAAK,MAAM,SAASD,qBAAoB;AAAA,IAAC;AAAA,EAC5D;AAGD,cAAY,UAAUC,cAAa,OAAO;AAG1C,kBAAgB,SAASD,uBAAsBC,YAAW;AAE1D,SAAO;AAAA,IACL;AAAA,IACA,SAASF;AAAA,IACT,sBAAsBC;AAAA,IACtB,aAAaC;AAAA,IACb,UAAUC;AAAA,EACX;AACH;AAWA,OAAA,SAAiB,SAAS,OAAQ,MAAM,SAAS;AAC/C,MAAI,OAAO,SAAS,eAAe,SAAS,IAAI;AAC9C,UAAM,IAAI,MAAM,eAAe;AAAA,EAChC;AAED,MAAIF,wBAAuB,QAAQ;AACnC,MAAID;AACJ,MAAI;AAEJ,MAAI,OAAO,YAAY,aAAa;AAElC,IAAAC,wBAAuB,QAAQ,KAAK,QAAQ,sBAAsB,QAAQ,CAAC;AAC3E,IAAAD,WAAU,QAAQ,KAAK,QAAQ,OAAO;AACtC,WAAO,YAAY,KAAK,QAAQ,WAAW;AAE3C,QAAI,QAAQ,YAAY;AACtB,YAAM,kBAAkB,QAAQ,UAAU;AAAA,IAC3C;AAAA,EACF;AAED,SAAO,aAAa,MAAMA,UAASC,uBAAsB,IAAI;AAC/D;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.cjs

@@ -1 +1,32 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("./polynomial.cjs");const l=require("../../../../_virtual/polynomial.cjs"),s=l.__exports;function i(t){this.genPoly=void 0,this.degree=t,this.degree&&this.initialize(this.degree)}i.prototype.initialize=function(e){this.degree=e,this.genPoly=s.generateECPolynomial(this.degree)};i.prototype.encode=function(e){if(!this.genPoly)throw new Error("Encoder not initialized");const o=new Uint8Array(e.length+this.degree);o.set(e);const n=s.mod(o,this.genPoly),r=this.degree-n.length;if(r>0){const d=new Uint8Array(this.degree);return d.set(n,r),d}return n};var c=i;exports.reedSolomonEncoder=c;
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("./polynomial.cjs");
+const polynomial = require("../../../../_virtual/polynomial.cjs");
+const Polynomial = polynomial.__exports;
+function ReedSolomonEncoder(degree) {
+  this.genPoly = void 0;
+  this.degree = degree;
+  if (this.degree) this.initialize(this.degree);
+}
+ReedSolomonEncoder.prototype.initialize = function initialize(degree) {
+  this.degree = degree;
+  this.genPoly = Polynomial.generateECPolynomial(this.degree);
+};
+ReedSolomonEncoder.prototype.encode = function encode(data) {
+  if (!this.genPoly) {
+    throw new Error("Encoder not initialized");
+  }
+  const paddedData = new Uint8Array(data.length + this.degree);
+  paddedData.set(data);
+  const remainder = Polynomial.mod(paddedData, this.genPoly);
+  const start = this.degree - remainder.length;
+  if (start > 0) {
+    const buff = new Uint8Array(this.degree);
+    buff.set(remainder, start);
+    return buff;
+  }
+  return remainder;
+};
+var reedSolomonEncoder = ReedSolomonEncoder;
+exports.reedSolomonEncoder = reedSolomonEncoder;
+//# sourceMappingURL=reed-solomon-encoder.cjs.map

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon-encoder.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"names":["require$$0"],"mappings":";;;;AAAA,MAAM,aAAaA,WAAuB;AAE1C,SAAS,mBAAoB,QAAQ;AACnC,OAAK,UAAU;AACf,OAAK,SAAS;AAEd,MAAI,KAAK,OAAQ,MAAK,WAAW,KAAK,MAAM;AAC9C;AAQA,mBAAmB,UAAU,aAAa,SAAS,WAAY,QAAQ;AAErE,OAAK,SAAS;AACd,OAAK,UAAU,WAAW,qBAAqB,KAAK,MAAM;AAC5D;AAQA,mBAAmB,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3D,MAAI,CAAC,KAAK,SAAS;AACjB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAID,QAAM,aAAa,IAAI,WAAW,KAAK,SAAS,KAAK,MAAM;AAC3D,aAAW,IAAI,IAAI;AAInB,QAAM,YAAY,WAAW,IAAI,YAAY,KAAK,OAAO;AAKzD,QAAM,QAAQ,KAAK,SAAS,UAAU;AACtC,MAAI,QAAQ,GAAG;AACb,UAAM,OAAO,IAAI,WAAW,KAAK,MAAM;AACvC,SAAK,IAAI,WAAW,KAAK;AAEzB,WAAO;AAAA,EACR;AAED,SAAO;AACT;AAEA,IAAA,qBAAiB;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.js

@@ -1,25 +1,32 @@
 import "./polynomial.js";
-import { __exports as l } from "../../../../_virtual/polynomial.js";
-const d = l;
-function n(t) {
-  this.genPoly = void 0, this.degree = t, this.degree && this.initialize(this.degree);
+import { __exports as polynomial } from "../../../../_virtual/polynomial.js";
+const Polynomial = polynomial;
+function ReedSolomonEncoder(degree) {
+  this.genPoly = void 0;
+  this.degree = degree;
+  if (this.degree) this.initialize(this.degree);
 }
-n.prototype.initialize = function(e) {
-  this.degree = e, this.genPoly = d.generateECPolynomial(this.degree);
+ReedSolomonEncoder.prototype.initialize = function initialize(degree) {
+  this.degree = degree;
+  this.genPoly = Polynomial.generateECPolynomial(this.degree);
 };
-n.prototype.encode = function(e) {
-  if (!this.genPoly)
+ReedSolomonEncoder.prototype.encode = function encode(data) {
+  if (!this.genPoly) {
     throw new Error("Encoder not initialized");
-  const o = new Uint8Array(e.length + this.degree);
-  o.set(e);
-  const i = d.mod(o, this.genPoly), r = this.degree - i.length;
-  if (r > 0) {
-    const s = new Uint8Array(this.degree);
-    return s.set(i, r), s;
   }
-  return i;
+  const paddedData = new Uint8Array(data.length + this.degree);
+  paddedData.set(data);
+  const remainder = Polynomial.mod(paddedData, this.genPoly);
+  const start = this.degree - remainder.length;
+  if (start > 0) {
+    const buff = new Uint8Array(this.degree);
+    buff.set(remainder, start);
+    return buff;
+  }
+  return remainder;
 };
-var g = n;
+var reedSolomonEncoder = ReedSolomonEncoder;
 export {
-  g as r
+  reedSolomonEncoder as r
 };
+//# sourceMappingURL=reed-solomon-encoder.js.map

package/dist/node_modules/qrcode/lib/core/reed-solomon-encoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reed-solomon-encoder.js","sources":["../../../../../../node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"names":["require$$0"],"mappings":";;AAAA,MAAM,aAAaA;AAEnB,SAAS,mBAAoB,QAAQ;AACnC,OAAK,UAAU;AACf,OAAK,SAAS;AAEd,MAAI,KAAK,OAAQ,MAAK,WAAW,KAAK,MAAM;AAC9C;AAQA,mBAAmB,UAAU,aAAa,SAAS,WAAY,QAAQ;AAErE,OAAK,SAAS;AACd,OAAK,UAAU,WAAW,qBAAqB,KAAK,MAAM;AAC5D;AAQA,mBAAmB,UAAU,SAAS,SAAS,OAAQ,MAAM;AAC3D,MAAI,CAAC,KAAK,SAAS;AACjB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAID,QAAM,aAAa,IAAI,WAAW,KAAK,SAAS,KAAK,MAAM;AAC3D,aAAW,IAAI,IAAI;AAInB,QAAM,YAAY,WAAW,IAAI,YAAY,KAAK,OAAO;AAKzD,QAAM,QAAQ,KAAK,SAAS,UAAU;AACtC,MAAI,QAAQ,GAAG;AACb,UAAM,OAAO,IAAI,WAAW,KAAK,MAAM;AACvC,SAAK,IAAI,WAAW,KAAK;AAEzB,WAAO;AAAA,EACR;AAED,SAAO;AACT;AAEA,IAAA,qBAAiB;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/regex.cjs

@@ -1,2 +1,27 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const e=require("../../../../_virtual/regex.cjs"),r="[0-9]+",s="[A-Z $%*+\\-./:]+";let t="(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";t=t.replace(/u/g,"\\u");const o="(?:(?![A-Z0-9 $%*+\\-./:]|"+t+`)(?:.|[\r
-]))+`;e.__exports.KANJI=new RegExp(t,"g");e.__exports.BYTE_KANJI=new RegExp("[^A-Z0-9 $%*+\\-./:]+","g");e.__exports.BYTE=new RegExp(o,"g");e.__exports.NUMERIC=new RegExp(r,"g");e.__exports.ALPHANUMERIC=new RegExp(s,"g");const _=new RegExp("^"+t+"$"),p=new RegExp("^"+r+"$"),c=new RegExp("^[A-Z0-9 $%*+\\-./:]+$");e.__exports.testKanji=function(u){return _.test(u)};e.__exports.testNumeric=function(u){return p.test(u)};e.__exports.testAlphanumeric=function(u){return c.test(u)};exports.default=e.__exports;
+"use strict";
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: "Module" } });
+const regex = require("../../../../_virtual/regex.cjs");
+const numeric = "[0-9]+";
+const alphanumeric = "[A-Z $%*+\\-./:]+";
+let kanji = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+kanji = kanji.replace(/u/g, "\\u");
+const byte = "(?:(?![A-Z0-9 $%*+\\-./:]|" + kanji + ")(?:.|[\r\n]))+";
+regex.__exports.KANJI = new RegExp(kanji, "g");
+regex.__exports.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g");
+regex.__exports.BYTE = new RegExp(byte, "g");
+regex.__exports.NUMERIC = new RegExp(numeric, "g");
+regex.__exports.ALPHANUMERIC = new RegExp(alphanumeric, "g");
+const TEST_KANJI = new RegExp("^" + kanji + "$");
+const TEST_NUMERIC = new RegExp("^" + numeric + "$");
+const TEST_ALPHANUMERIC = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+regex.__exports.testKanji = function testKanji(str) {
+  return TEST_KANJI.test(str);
+};
+regex.__exports.testNumeric = function testNumeric(str) {
+  return TEST_NUMERIC.test(str);
+};
+regex.__exports.testAlphanumeric = function testAlphanumeric(str) {
+  return TEST_ALPHANUMERIC.test(str);
+};
+exports.default = regex.__exports;
+//# sourceMappingURL=regex.cjs.map

package/dist/node_modules/qrcode/lib/core/regex.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.cjs","sources":["../../../../../../node_modules/qrcode/lib/core/regex.js"],"sourcesContent":["const numeric = '[0-9]+'\nconst alphanumeric = '[A-Z $%*+\\\\-./:]+'\nlet kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +\n  '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +\n  '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +\n  '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'\nkanji = kanji.replace(/u/g, '\\\\u')\n\nconst byte = '(?:(?![A-Z0-9 $%*+\\\\-./:]|' + kanji + ')(?:.|[\\r\\n]))+'\n\nexports.KANJI = new RegExp(kanji, 'g')\nexports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\\\-./:]+', 'g')\nexports.BYTE = new RegExp(byte, 'g')\nexports.NUMERIC = new RegExp(numeric, 'g')\nexports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')\n\nconst TEST_KANJI = new RegExp('^' + kanji + '$')\nconst TEST_NUMERIC = new RegExp('^' + numeric + '$')\nconst TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\\\-./:]+$')\n\nexports.testKanji = function testKanji (str) {\n  return TEST_KANJI.test(str)\n}\n\nexports.testNumeric = function testNumeric (str) {\n  return TEST_NUMERIC.test(str)\n}\n\nexports.testAlphanumeric = function testAlphanumeric (str) {\n  return TEST_ALPHANUMERIC.test(str)\n}\n"],"names":["regex"],"mappings":";;;AAAA,MAAM,UAAU;AAChB,MAAM,eAAe;AACrB,IAAI,QAAQ;AAIZ,QAAQ,MAAM,QAAQ,MAAM,KAAK;AAEjC,MAAM,OAAO,+BAA+B,QAAQ;AAEpDA,MAAA,UAAA,QAAgB,IAAI,OAAO,OAAO,GAAG;AACrCA,MAAA,UAAA,aAAqB,IAAI,OAAO,yBAAyB,GAAG;AAC5DA,MAAA,UAAA,OAAe,IAAI,OAAO,MAAM,GAAG;AACnCA,MAAA,UAAA,UAAkB,IAAI,OAAO,SAAS,GAAG;AACzCA,MAAA,UAAA,eAAuB,IAAI,OAAO,cAAc,GAAG;AAEnD,MAAM,aAAa,IAAI,OAAO,MAAM,QAAQ,GAAG;AAC/C,MAAM,eAAe,IAAI,OAAO,MAAM,UAAU,GAAG;AACnD,MAAM,oBAAoB,IAAI,OAAO,wBAAwB;AAE7DA,MAAAA,UAAA,YAAoB,SAAS,UAAW,KAAK;AAC3C,SAAO,WAAW,KAAK,GAAG;AAC5B;AAEAA,MAAAA,UAAA,cAAsB,SAAS,YAAa,KAAK;AAC/C,SAAO,aAAa,KAAK,GAAG;AAC9B;AAEAA,MAAAA,UAAA,mBAA2B,SAAS,iBAAkB,KAAK;AACzD,SAAO,kBAAkB,KAAK,GAAG;AACnC;;","x_google_ignoreList":[0]}