asterui 0.10.3 → 0.12.0

package/dist/index108.js

@@ -1,69 +1,155 @@
-import { __exports as c } from "./index123.js";
-import { __require as o } from "./index121.js";
-import { __require as s } from "./index124.js";
-var u;
-function E() {
-  return u ? c : (u = 1, (function(i) {
-    const a = o(), e = s();
-    i.NUMERIC = {
-      id: "Numeric",
-      bit: 1,
-      ccBits: [10, 12, 14]
-    }, i.ALPHANUMERIC = {
-      id: "Alphanumeric",
-      bit: 2,
-      ccBits: [9, 11, 13]
-    }, i.BYTE = {
-      id: "Byte",
-      bit: 4,
-      ccBits: [8, 16, 16]
-    }, i.KANJI = {
-      id: "Kanji",
-      bit: 8,
-      ccBits: [8, 10, 12]
-    }, i.MIXED = {
-      bit: -1
-    }, i.getCharCountIndicator = function(r, n) {
-      if (!r.ccBits) throw new Error("Invalid mode: " + r);
-      if (!a.isValid(n))
-        throw new Error("Invalid version: " + n);
-      return n >= 1 && n < 10 ? r.ccBits[0] : n < 27 ? r.ccBits[1] : r.ccBits[2];
-    }, i.getBestModeForData = function(r) {
-      return e.testNumeric(r) ? i.NUMERIC : e.testAlphanumeric(r) ? i.ALPHANUMERIC : e.testKanji(r) ? i.KANJI : i.BYTE;
-    }, i.toString = function(r) {
-      if (r && r.id) return r.id;
-      throw new Error("Invalid mode");
-    }, i.isValid = function(r) {
-      return r && r.bit && r.ccBits;
-    };
-    function f(t) {
-      if (typeof t != "string")
-        throw new Error("Param is not a string");
-      switch (t.toLowerCase()) {
-        case "numeric":
-          return i.NUMERIC;
-        case "alphanumeric":
-          return i.ALPHANUMERIC;
-        case "kanji":
-          return i.KANJI;
-        case "byte":
-          return i.BYTE;
-        default:
-          throw new Error("Unknown mode: " + t);
+import { __exports as M } from "./index111.js";
+import { __require as Y } from "./index112.js";
+import { __require as Z } from "./index113.js";
+import { __require as $ } from "./index114.js";
+import { __require as x } from "./index115.js";
+import { __require as v } from "./index116.js";
+import { __require as ee } from "./index117.js";
+import { __require as te } from "./index118.js";
+import { __require as oe } from "./index119.js";
+import { __require as re } from "./index120.js";
+import { __require as ne } from "./index121.js";
+import { __require as se } from "./index122.js";
+import { __require as ie } from "./index123.js";
+import { __require as ue } from "./index124.js";
+var F;
+function Be() {
+  if (F) return M;
+  F = 1;
+  const g = Y(), q = Z(), A = $(), k = x(), P = v(), D = ee(), _ = te(), h = oe(), V = re(), w = ne(), R = se(), G = ie(), C = ue();
+  function Q(r, u) {
+    const n = r.size, e = D.getPositions(u);
+    for (let c = 0; c < e.length; c++) {
+      const t = e[c][0], o = e[c][1];
+      for (let i = -1; i <= 7; i++)
+        if (!(t + i <= -1 || n <= t + i))
+          for (let s = -1; s <= 7; s++)
+            o + s <= -1 || n <= o + s || (i >= 0 && i <= 6 && (s === 0 || s === 6) || s >= 0 && s <= 6 && (i === 0 || i === 6) || i >= 2 && i <= 4 && s >= 2 && s <= 4 ? r.set(t + i, o + s, !0, !0) : r.set(t + i, o + s, !1, !0));
+    }
+  }
+  function U(r) {
+    const u = r.size;
+    for (let n = 8; n < u - 8; n++) {
+      const e = n % 2 === 0;
+      r.set(n, 6, e, !0), r.set(6, n, e, !0);
+    }
+  }
+  function J(r, u) {
+    const n = P.getPositions(u);
+    for (let e = 0; e < n.length; e++) {
+      const c = n[e][0], t = n[e][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 ? r.set(c + o, t + i, !0, !0) : r.set(c + o, t + i, !1, !0);
+    }
+  }
+  function N(r, u) {
+    const n = r.size, e = w.getEncodedBits(u);
+    let c, t, o;
+    for (let i = 0; i < 18; i++)
+      c = Math.floor(i / 3), t = i % 3 + n - 8 - 3, o = (e >> i & 1) === 1, r.set(c, t, o, !0), r.set(t, c, o, !0);
+  }
+  function b(r, u, n) {
+    const e = r.size, c = R.getEncodedBits(u, n);
+    let t, o;
+    for (t = 0; t < 15; t++)
+      o = (c >> t & 1) === 1, t < 6 ? r.set(t, 8, o, !0) : t < 8 ? r.set(t + 1, 8, o, !0) : r.set(e - 15 + t, 8, o, !0), t < 8 ? r.set(8, e - t - 1, o, !0) : t < 9 ? r.set(8, 15 - t - 1 + 1, o, !0) : r.set(8, 15 - t - 1, o, !0);
+    r.set(e - 8, 8, 1, !0);
+  }
+  function L(r, u) {
+    const n = r.size;
+    let e = -1, c = n - 1, t = 7, o = 0;
+    for (let i = n - 1; i > 0; i -= 2)
+      for (i === 6 && i--; ; ) {
+        for (let s = 0; s < 2; s++)
+          if (!r.isReserved(c, i - s)) {
+            let a = !1;
+            o < u.length && (a = (u[o] >>> t & 1) === 1), r.set(c, i - s, a), t--, t === -1 && (o++, t = 7);
+          }
+        if (c += e, c < 0 || n <= c) {
+          c -= e, e = -e;
+          break;
+        }
       }
+  }
+  function j(r, u, n) {
+    const e = new A();
+    n.forEach(function(s) {
+      e.put(s.mode.bit, 4), e.put(s.getLength(), G.getCharCountIndicator(s.mode, r)), s.write(e);
+    });
+    const c = g.getSymbolTotalCodewords(r), t = h.getTotalCodewordsCount(r, u), o = (c - t) * 8;
+    for (e.getLengthInBits() + 4 <= o && e.put(0, 4); e.getLengthInBits() % 8 !== 0; )
+      e.putBit(0);
+    const i = (o - e.getLengthInBits()) / 8;
+    for (let s = 0; s < i; s++)
+      e.put(s % 2 ? 17 : 236, 8);
+    return H(e, r, u);
+  }
+  function H(r, u, n) {
+    const e = g.getSymbolTotalCodewords(u), c = h.getTotalCodewordsCount(u, n), t = e - c, o = h.getBlocksCount(u, n), i = e % o, s = o - i, a = Math.floor(e / o), m = Math.floor(t / o), O = m + 1, E = a - m, W = new V(E);
+    let B = 0;
+    const p = new Array(o), z = new Array(o);
+    let S = 0;
+    const X = new Uint8Array(r.buffer);
+    for (let d = 0; d < o; d++) {
+      const y = d < s ? m : O;
+      p[d] = X.slice(B, B + y), z[d] = W.encode(p[d]), B += y, S = Math.max(S, y);
     }
-    i.from = function(r, n) {
-      if (i.isValid(r))
-        return r;
-      try {
-        return f(r);
-      } catch {
-        return n;
+    const I = new Uint8Array(e);
+    let T = 0, f, l;
+    for (f = 0; f < S; f++)
+      for (l = 0; l < o; l++)
+        f < p[l].length && (I[T++] = p[l][f]);
+    for (f = 0; f < E; f++)
+      for (l = 0; l < o; l++)
+        I[T++] = z[l][f];
+    return I;
+  }
+  function K(r, u, n, e) {
+    let c;
+    if (Array.isArray(r))
+      c = C.fromArray(r);
+    else if (typeof r == "string") {
+      let a = u;
+      if (!a) {
+        const m = C.rawSplit(r);
+        a = w.getBestVersionForData(m, n);
       }
+      c = C.fromString(r, a || 40);
+    } else
+      throw new Error("Invalid data");
+    const t = w.getBestVersionForData(c, n);
+    if (!t)
+      throw new Error("The amount of data is too big to be stored in a QR Code");
+    if (!u)
+      u = t;
+    else if (u < t)
+      throw new Error(
+        `
+The chosen QR Code version cannot contain this amount of data.
+Minimum version required to store current data is: ` + t + `.
+`
+      );
+    const o = j(u, n, c), i = g.getSymbolSize(u), s = new k(i);
+    return Q(s, u), U(s), J(s, u), b(s, n, 0), u >= 7 && N(s, u), L(s, o), isNaN(e) && (e = _.getBestMask(
+      s,
+      b.bind(null, s, n)
+    )), _.applyMask(e, s), b(s, n, e), {
+      modules: s,
+      version: u,
+      errorCorrectionLevel: n,
+      maskPattern: e,
+      segments: c
     };
-  })(c), c);
+  }
+  return M.create = function(u, n) {
+    if (typeof u > "u" || u === "")
+      throw new Error("No input text");
+    let e = q.M, c, t;
+    return typeof n < "u" && (e = q.from(n.errorCorrectionLevel, q.M), c = w.from(n.version), t = _.from(n.maskPattern), n.toSJISFunc && g.setToSJISFunction(n.toSJISFunc)), K(u, c, e, t);
+  }, M;
 }
 export {
-  E as __require
+  Be as __require
 };
 //# sourceMappingURL=index108.js.map

package/dist/index108.js.map

@@ -1 +1 @@
-{"version":3,"file":"index108.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mode.js"],"sourcesContent":["const VersionCheck = require('./version-check')\nconst Regex = require('./regex')\n\n/**\n * Numeric mode encodes data from the decimal digit set (0 - 9)\n * (byte values 30HEX to 39HEX).\n * Normally, 3 data characters are represented by 10 bits.\n *\n * @type {Object}\n */\nexports.NUMERIC = {\n  id: 'Numeric',\n  bit: 1 << 0,\n  ccBits: [10, 12, 14]\n}\n\n/**\n * Alphanumeric mode encodes data from a set of 45 characters,\n * i.e. 10 numeric digits (0 - 9),\n *      26 alphabetic characters (A - Z),\n *   and 9 symbols (SP, $, %, *, +, -, ., /, :).\n * Normally, two input characters are represented by 11 bits.\n *\n * @type {Object}\n */\nexports.ALPHANUMERIC = {\n  id: 'Alphanumeric',\n  bit: 1 << 1,\n  ccBits: [9, 11, 13]\n}\n\n/**\n * In byte mode, data is encoded at 8 bits per character.\n *\n * @type {Object}\n */\nexports.BYTE = {\n  id: 'Byte',\n  bit: 1 << 2,\n  ccBits: [8, 16, 16]\n}\n\n/**\n * The Kanji mode efficiently encodes Kanji characters in accordance with\n * the Shift JIS system based on JIS X 0208.\n * The Shift JIS values are shifted from the JIS X 0208 values.\n * JIS X 0208 gives details of the shift coded representation.\n * Each two-byte character value is compacted to a 13-bit binary codeword.\n *\n * @type {Object}\n */\nexports.KANJI = {\n  id: 'Kanji',\n  bit: 1 << 3,\n  ccBits: [8, 10, 12]\n}\n\n/**\n * Mixed mode will contain a sequences of data in a combination of any of\n * the modes described above\n *\n * @type {Object}\n */\nexports.MIXED = {\n  bit: -1\n}\n\n/**\n * Returns the number of bits needed to store the data length\n * according to QR Code specifications.\n *\n * @param  {Mode}   mode    Data mode\n * @param  {Number} version QR Code version\n * @return {Number}         Number of bits\n */\nexports.getCharCountIndicator = function getCharCountIndicator (mode, version) {\n  if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)\n\n  if (!VersionCheck.isValid(version)) {\n    throw new Error('Invalid version: ' + version)\n  }\n\n  if (version >= 1 && version < 10) return mode.ccBits[0]\n  else if (version < 27) return mode.ccBits[1]\n  return mode.ccBits[2]\n}\n\n/**\n * Returns the most efficient mode to store the specified data\n *\n * @param  {String} dataStr Input data string\n * @return {Mode}           Best mode\n */\nexports.getBestModeForData = function getBestModeForData (dataStr) {\n  if (Regex.testNumeric(dataStr)) return exports.NUMERIC\n  else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC\n  else if (Regex.testKanji(dataStr)) return exports.KANJI\n  else return exports.BYTE\n}\n\n/**\n * Return mode name as string\n *\n * @param {Mode} mode Mode object\n * @returns {String}  Mode name\n */\nexports.toString = function toString (mode) {\n  if (mode && mode.id) return mode.id\n  throw new Error('Invalid mode')\n}\n\n/**\n * Check if input param is a valid mode object\n *\n * @param   {Mode}    mode Mode object\n * @returns {Boolean} True if valid mode, false otherwise\n */\nexports.isValid = function isValid (mode) {\n  return mode && mode.bit && mode.ccBits\n}\n\n/**\n * Get mode object from its name\n *\n * @param   {String} string Mode name\n * @returns {Mode}          Mode object\n */\nfunction fromString (string) {\n  if (typeof string !== 'string') {\n    throw new Error('Param is not a string')\n  }\n\n  const lcStr = string.toLowerCase()\n\n  switch (lcStr) {\n    case 'numeric':\n      return exports.NUMERIC\n    case 'alphanumeric':\n      return exports.ALPHANUMERIC\n    case 'kanji':\n      return exports.KANJI\n    case 'byte':\n      return exports.BYTE\n    default:\n      throw new Error('Unknown mode: ' + string)\n  }\n}\n\n/**\n * Returns mode from a value.\n * If value is not a valid mode, returns defaultValue\n *\n * @param  {Mode|String} value        Encoding mode\n * @param  {Mode}        defaultValue Fallback value\n * @return {Mode}                     Encoding mode\n */\nexports.from = function from (value, defaultValue) {\n  if (exports.isValid(value)) {\n    return value\n  }\n\n  try {\n    return fromString(value)\n  } catch (e) {\n    return defaultValue\n  }\n}\n"],"names":["VersionCheck","require$$0","Regex","require$$1","exports","mode","version","dataStr","fromString","string","value","defaultValue"],"mappings":";;;;;;AAAA,UAAMA,IAAeC,EAAA,GACfC,IAAQC,EAAA;AASdC,IAAAA,EAAA,UAAkB;AAAA,MAChB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,IAAI,IAAI,EAAE;AAAA,IACrB,GAWAA,EAAA,eAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAOAA,EAAA,OAAe;AAAA,MACb,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAWAA,EAAA,QAAgB;AAAA,MACd,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,QAAQ,CAAC,GAAG,IAAI,EAAE;AAAA,IACpB,GAQAA,EAAA,QAAgB;AAAA,MACd,KAAK;AAAA,IACP,GAUAA,EAAA,wBAAgC,SAAgCC,GAAMC,GAAS;AAC7E,UAAI,CAACD,EAAK,OAAQ,OAAM,IAAI,MAAM,mBAAmBA,CAAI;AAEzD,UAAI,CAACL,EAAa,QAAQM,CAAO;AAC/B,cAAM,IAAI,MAAM,sBAAsBA,CAAO;AAG/C,aAAIA,KAAW,KAAKA,IAAU,KAAWD,EAAK,OAAO,CAAC,IAC7CC,IAAU,KAAWD,EAAK,OAAO,CAAC,IACpCA,EAAK,OAAO,CAAC;AAAA,IACtB,GAQAD,EAAA,qBAA6B,SAA6BG,GAAS;AACjE,aAAIL,EAAM,YAAYK,CAAO,IAAUH,EAAQ,UACtCF,EAAM,iBAAiBK,CAAO,IAAUH,EAAQ,eAChDF,EAAM,UAAUK,CAAO,IAAUH,EAAQ,QACtCA,EAAQ;AAAA,IACtB,GAQAA,EAAA,WAAmB,SAAmBC,GAAM;AAC1C,UAAIA,KAAQA,EAAK,GAAI,QAAOA,EAAK;AACjC,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC,GAQAD,EAAA,UAAkB,SAAkBC,GAAM;AACxC,aAAOA,KAAQA,EAAK,OAAOA,EAAK;AAAA,IAClC;AAQA,aAASG,EAAYC,GAAQ;AAC3B,UAAI,OAAOA,KAAW;AACpB,cAAM,IAAI,MAAM,uBAAuB;AAKzC,cAFcA,EAAO,YAAW,GAEnB;AAAA,QACX,KAAK;AACH,iBAAOL,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB,KAAK;AACH,iBAAOA,EAAQ;AAAA,QACjB;AACE,gBAAM,IAAI,MAAM,mBAAmBK,CAAM;AAAA,MAC/C;AAAA,IACA;AAUAL,IAAAA,EAAA,OAAe,SAAeM,GAAOC,GAAc;AACjD,UAAIP,EAAQ,QAAQM,CAAK;AACvB,eAAOA;AAGT,UAAI;AACF,eAAOF,EAAWE,CAAK;AAAA,MAC3B,QAAc;AACV,eAAOC;AAAA,MACX;AAAA,IACA;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index108.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/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":["Utils","require$$0","ECLevel","require$$1","BitBuffer","require$$2","BitMatrix","require$$3","AlignmentPattern","require$$4","FinderPattern","require$$5","MaskPattern","require$$6","ECCode","require$$7","ReedSolomonEncoder","require$$8","Version","require$$9","FormatInfo","require$$10","Mode","require$$11","Segments","require$$12","setupFinderPattern","matrix","version","size","pos","i","row","col","r","c","setupTimingPattern","value","setupAlignmentPattern","setupVersionInfo","bits","mod","setupFormatInfo","errorCorrectionLevel","maskPattern","setupData","data","inc","bitIndex","byteIndex","dark","createData","segments","buffer","totalCodewords","ecTotalCodewords","dataTotalCodewordsBits","remainingByte","createCodewords","bitBuffer","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","offset","dcData","ecData","maxDataSize","b","dataSize","index","createSymbol","estimatedVersion","rawSegments","bestVersion","dataBits","moduleCount","modules","qrcode","options","mask"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,QAAMA,IAAQC,EAAA,GACRC,IAAUC,EAAA,GACVC,IAAYC,EAAA,GACZC,IAAYC,EAAA,GACZC,IAAmBC,EAAA,GACnBC,IAAgBC,GAAA,GAChBC,IAAcC,GAAA,GACdC,IAASC,GAAA,GACTC,IAAqBC,GAAA,GACrBC,IAAUC,GAAA,GACVC,IAAaC,GAAA,GACbC,IAAOC,GAAA,GACPC,IAAWC,GAAA;AAkCjB,WAASC,EAAoBC,GAAQC,GAAS;AAC5C,UAAMC,IAAOF,EAAO,MACdG,IAAMpB,EAAc,aAAakB,CAAO;AAE9C,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAI,EAAAF,IAAME,KAAK,MAAML,KAAQG,IAAME;AAEnC,mBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAIF,IAAME,KAAK,MAAMN,KAAQI,IAAME,MAE9BD,KAAK,KAAKA,KAAK,MAAMC,MAAM,KAAKA,MAAM,MACxCA,KAAK,KAAKA,KAAK,MAAMD,MAAM,KAAKA,MAAM,MACtCA,KAAK,KAAKA,KAAK,KAAKC,KAAK,KAAKA,KAAK,IACpCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AASA,WAASC,EAAoBT,GAAQ;AACnC,UAAME,IAAOF,EAAO;AAEpB,aAASO,IAAI,GAAGA,IAAIL,IAAO,GAAGK,KAAK;AACjC,YAAMG,IAAQH,IAAI,MAAM;AACxB,MAAAP,EAAO,IAAIO,GAAG,GAAGG,GAAO,EAAI,GAC5BV,EAAO,IAAI,GAAGO,GAAGG,GAAO,EAAI;AAAA,IAChC;AAAA,EACA;AAUA,WAASC,EAAuBX,GAAQC,GAAS;AAC/C,UAAME,IAAMtB,EAAiB,aAAaoB,CAAO;AAEjD,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,iBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,UAAID,MAAM,MAAMA,MAAM,KAAKC,MAAM,MAAMA,MAAM,KAC1CD,MAAM,KAAKC,MAAM,IAClBR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AAQA,WAASI,EAAkBZ,GAAQC,GAAS;AAC1C,UAAMC,IAAOF,EAAO,MACda,IAAOtB,EAAQ,eAAeU,CAAO;AAC3C,QAAII,GAAKC,GAAKQ;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI;AACtB,MAAAT,IAAM,KAAK,MAAM,IAAI,CAAC,GACtBC,IAAM,IAAI,IAAIJ,IAAO,IAAI,GACzBY,KAAQD,KAAQ,IAAK,OAAO,GAE5Bb,EAAO,IAAIK,GAAKC,GAAKQ,GAAK,EAAI,GAC9Bd,EAAO,IAAIM,GAAKD,GAAKS,GAAK,EAAI;AAAA,EAElC;AASA,WAASC,EAAiBf,GAAQgB,GAAsBC,GAAa;AACnE,UAAMf,IAAOF,EAAO,MACda,IAAOpB,EAAW,eAAeuB,GAAsBC,CAAW;AACxE,QAAIb,GAAGU;AAEP,SAAKV,IAAI,GAAGA,IAAI,IAAIA;AAClB,MAAAU,KAAQD,KAAQT,IAAK,OAAO,GAGxBA,IAAI,IACNJ,EAAO,IAAII,GAAG,GAAGU,GAAK,EAAI,IACjBV,IAAI,IACbJ,EAAO,IAAII,IAAI,GAAG,GAAGU,GAAK,EAAI,IAE9Bd,EAAO,IAAIE,IAAO,KAAKE,GAAG,GAAGU,GAAK,EAAI,GAIpCV,IAAI,IACNJ,EAAO,IAAI,GAAGE,IAAOE,IAAI,GAAGU,GAAK,EAAI,IAC5BV,IAAI,IACbJ,EAAO,IAAI,GAAG,KAAKI,IAAI,IAAI,GAAGU,GAAK,EAAI,IAEvCd,EAAO,IAAI,GAAG,KAAKI,IAAI,GAAGU,GAAK,EAAI;AAKvC,IAAAd,EAAO,IAAIE,IAAO,GAAG,GAAG,GAAG,EAAI;AAAA,EACjC;AAQA,WAASgB,EAAWlB,GAAQmB,GAAM;AAChC,UAAMjB,IAAOF,EAAO;AACpB,QAAIoB,IAAM,IACNf,IAAMH,IAAO,GACbmB,IAAW,GACXC,IAAY;AAEhB,aAAShB,IAAMJ,IAAO,GAAGI,IAAM,GAAGA,KAAO;AAGvC,WAFIA,MAAQ,KAAGA,SAEF;AACX,iBAASE,IAAI,GAAGA,IAAI,GAAGA;AACrB,cAAI,CAACR,EAAO,WAAWK,GAAKC,IAAME,CAAC,GAAG;AACpC,gBAAIe,IAAO;AAEX,YAAID,IAAYH,EAAK,WACnBI,KAAUJ,EAAKG,CAAS,MAAMD,IAAY,OAAO,IAGnDrB,EAAO,IAAIK,GAAKC,IAAME,GAAGe,CAAI,GAC7BF,KAEIA,MAAa,OACfC,KACAD,IAAW;AAAA,UAEvB;AAKM,YAFAhB,KAAOe,GAEHf,IAAM,KAAKH,KAAQG,GAAK;AAC1B,UAAAA,KAAOe,GACPA,IAAM,CAACA;AACP;AAAA,QACR;AAAA,MACA;AAAA,EAEA;AAUA,WAASI,EAAYvB,GAASe,GAAsBS,GAAU;AAE5D,UAAMC,IAAS,IAAIjD,EAAS;AAE5B,IAAAgD,EAAS,QAAQ,SAAUN,GAAM;AAE/B,MAAAO,EAAO,IAAIP,EAAK,KAAK,KAAK,CAAC,GAS3BO,EAAO,IAAIP,EAAK,UAAS,GAAIxB,EAAK,sBAAsBwB,EAAK,MAAMlB,CAAO,CAAC,GAG3EkB,EAAK,MAAMO,CAAM;AAAA,IACrB,CAAG;AAGD,UAAMC,IAAiBtD,EAAM,wBAAwB4B,CAAO,GACtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAC9Ea,KAA0BF,IAAiBC,KAAoB;AAgBrE,SATIF,EAAO,oBAAoB,KAAKG,KAClCH,EAAO,IAAI,GAAG,CAAC,GAQVA,EAAO,oBAAoB,MAAM;AACtC,MAAAA,EAAO,OAAO,CAAC;AAOjB,UAAMI,KAAiBD,IAAyBH,EAAO,gBAAe,KAAM;AAC5E,aAAStB,IAAI,GAAGA,IAAI0B,GAAe1B;AACjC,MAAAsB,EAAO,IAAItB,IAAI,IAAI,KAAO,KAAM,CAAC;AAGnC,WAAO2B,EAAgBL,GAAQzB,GAASe,CAAoB;AAAA,EAC9D;AAWA,WAASe,EAAiBC,GAAW/B,GAASe,GAAsB;AAElE,UAAMW,IAAiBtD,EAAM,wBAAwB4B,CAAO,GAGtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAG9EiB,IAAqBN,IAAiBC,GAGtCM,IAAgB/C,EAAO,eAAec,GAASe,CAAoB,GAGnEmB,IAAiBR,IAAiBO,GAClCE,IAAiBF,IAAgBC,GAEjCE,IAAyB,KAAK,MAAMV,IAAiBO,CAAa,GAElEI,IAAwB,KAAK,MAAML,IAAqBC,CAAa,GACrEK,IAAwBD,IAAwB,GAGhDE,IAAUH,IAAyBC,GAGnCG,IAAK,IAAIpD,EAAmBmD,CAAO;AAEzC,QAAIE,IAAS;AACb,UAAMC,IAAS,IAAI,MAAMT,CAAa,GAChCU,IAAS,IAAI,MAAMV,CAAa;AACtC,QAAIW,IAAc;AAClB,UAAMnB,IAAS,IAAI,WAAWM,EAAU,MAAM;AAG9C,aAASc,IAAI,GAAGA,IAAIZ,GAAeY,KAAK;AACtC,YAAMC,IAAWD,IAAIV,IAAiBE,IAAwBC;AAG9D,MAAAI,EAAOG,CAAC,IAAIpB,EAAO,MAAMgB,GAAQA,IAASK,CAAQ,GAGlDH,EAAOE,CAAC,IAAIL,EAAG,OAAOE,EAAOG,CAAC,CAAC,GAE/BJ,KAAUK,GACVF,IAAc,KAAK,IAAIA,GAAaE,CAAQ;AAAA,IAChD;AAIE,UAAM5B,IAAO,IAAI,WAAWQ,CAAc;AAC1C,QAAIqB,IAAQ,GACR5C,GAAGG;AAGP,SAAKH,IAAI,GAAGA,IAAIyC,GAAazC;AAC3B,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAIH,IAAIuC,EAAOpC,CAAC,EAAE,WAChBY,EAAK6B,GAAO,IAAIL,EAAOpC,CAAC,EAAEH,CAAC;AAMjC,SAAKA,IAAI,GAAGA,IAAIoC,GAASpC;AACvB,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAAY,EAAK6B,GAAO,IAAIJ,EAAOrC,CAAC,EAAEH,CAAC;AAI/B,WAAOe;AAAA,EACT;AAWA,WAAS8B,EAAc9B,GAAMlB,GAASe,GAAsBC,GAAa;AACvE,QAAIQ;AAEJ,QAAI,MAAM,QAAQN,CAAI;AACpB,MAAAM,IAAW5B,EAAS,UAAUsB,CAAI;AAAA,aACzB,OAAOA,KAAS,UAAU;AACnC,UAAI+B,IAAmBjD;AAEvB,UAAI,CAACiD,GAAkB;AACrB,cAAMC,IAActD,EAAS,SAASsB,CAAI;AAG1C,QAAA+B,IAAmB3D,EAAQ,sBAAsB4D,GAAanC,CAAoB;AAAA,MACxF;AAII,MAAAS,IAAW5B,EAAS,WAAWsB,GAAM+B,KAAoB,EAAE;AAAA,IAC/D;AACI,YAAM,IAAI,MAAM,cAAc;AAIhC,UAAME,IAAc7D,EAAQ,sBAAsBkC,GAAUT,CAAoB;AAGhF,QAAI,CAACoC;AACH,YAAM,IAAI,MAAM,yDAAyD;AAI3E,QAAI,CAACnD;AACH,MAAAA,IAAUmD;AAAA,aAGDnD,IAAUmD;AACnB,YAAM,IAAI;AAAA,QAAM;AAAA;AAAA,uDAE0CA,IAAc;AAAA;AAAA,MAC5E;AAGE,UAAMC,IAAW7B,EAAWvB,GAASe,GAAsBS,CAAQ,GAG7D6B,IAAcjF,EAAM,cAAc4B,CAAO,GACzCsD,IAAU,IAAI5E,EAAU2E,CAAW;AAGzC,WAAAvD,EAAmBwD,GAAStD,CAAO,GACnCQ,EAAmB8C,CAAO,GAC1B5C,EAAsB4C,GAAStD,CAAO,GAMtCc,EAAgBwC,GAASvC,GAAsB,CAAC,GAE5Cf,KAAW,KACbW,EAAiB2C,GAAStD,CAAO,GAInCiB,EAAUqC,GAASF,CAAQ,GAEvB,MAAMpC,CAAW,MAEnBA,IAAchC,EAAY;AAAA,MAAYsE;AAAA,MACpCxC,EAAgB,KAAK,MAAMwC,GAASvC,CAAoB;AAAA,IAAC,IAI7D/B,EAAY,UAAUgC,GAAasC,CAAO,GAG1CxC,EAAgBwC,GAASvC,GAAsBC,CAAW,GAEnD;AAAA,MACL,SAASsC;AAAA,MACT,SAAStD;AAAA,MACT,sBAAsBe;AAAA,MACtB,aAAaC;AAAA,MACb,UAAUQ;AAAA,IACd;AAAA,EACA;AAWA,SAAA+B,EAAA,SAAiB,SAAiBrC,GAAMsC,GAAS;AAC/C,QAAI,OAAOtC,IAAS,OAAeA,MAAS;AAC1C,YAAM,IAAI,MAAM,eAAe;AAGjC,QAAIH,IAAuBzC,EAAQ,GAC/B0B,GACAyD;AAEJ,WAAI,OAAOD,IAAY,QAErBzC,IAAuBzC,EAAQ,KAAKkF,EAAQ,sBAAsBlF,EAAQ,CAAC,GAC3E0B,IAAUV,EAAQ,KAAKkE,EAAQ,OAAO,GACtCC,IAAOzE,EAAY,KAAKwE,EAAQ,WAAW,GAEvCA,EAAQ,cACVpF,EAAM,kBAAkBoF,EAAQ,UAAU,IAIvCR,EAAa9B,GAAMlB,GAASe,GAAsB0C,CAAI;AAAA,EAC/D;;","x_google_ignoreList":[0]}

package/dist/index109.js

@@ -1,147 +1,33 @@
-import { __exports as N } from "./index125.js";
-import { __require as T } from "./index108.js";
-import { __require as Y } from "./index126.js";
-import { __require as L } from "./index127.js";
-import { __require as y } from "./index128.js";
-import { __require as D } from "./index129.js";
-import { __require as j } from "./index124.js";
-import { __require as k } from "./index97.js";
-import { __require as J } from "./index130.js";
-var b;
-function V() {
-  return b ? N : (b = 1, (function(m) {
-    const r = T(), I = Y(), B = L(), _ = y(), q = D(), c = j(), p = k(), R = J();
-    function C(n) {
-      return unescape(encodeURIComponent(n)).length;
-    }
-    function h(n, o, t) {
-      const e = [];
-      let s;
-      for (; (s = n.exec(t)) !== null; )
-        e.push({
-          data: s[0],
-          index: s.index,
-          mode: o,
-          length: s[0].length
-        });
-      return e;
-    }
-    function M(n) {
-      const o = h(c.NUMERIC, r.NUMERIC, n), t = h(c.ALPHANUMERIC, r.ALPHANUMERIC, n);
-      let e, s;
-      return p.isKanjiModeEnabled() ? (e = h(c.BYTE, r.BYTE, n), s = h(c.KANJI, r.KANJI, n)) : (e = h(c.BYTE_KANJI, r.BYTE, n), s = []), o.concat(t, e, s).sort(function(a, l) {
-        return a.index - l.index;
-      }).map(function(a) {
-        return {
-          data: a.data,
-          mode: a.mode,
-          length: a.length
-        };
-      });
-    }
-    function E(n, o) {
-      switch (o) {
-        case r.NUMERIC:
-          return I.getBitsLength(n);
-        case r.ALPHANUMERIC:
-          return B.getBitsLength(n);
-        case r.KANJI:
-          return q.getBitsLength(n);
-        case r.BYTE:
-          return _.getBitsLength(n);
-      }
-    }
-    function U(n) {
-      return n.reduce(function(o, t) {
-        const e = o.length - 1 >= 0 ? o[o.length - 1] : null;
-        return e && e.mode === t.mode ? (o[o.length - 1].data += t.data, o) : (o.push(t), o);
-      }, []);
-    }
-    function w(n) {
-      const o = [];
-      for (let t = 0; t < n.length; t++) {
-        const e = n[t];
-        switch (e.mode) {
-          case r.NUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.ALPHANUMERIC, length: e.length },
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.ALPHANUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.KANJI:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-            break;
-          case r.BYTE:
-            o.push([
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-        }
-      }
-      return o;
-    }
-    function K(n, o) {
-      const t = {}, e = { start: {} };
-      let s = ["start"];
-      for (let i = 0; i < n.length; i++) {
-        const a = n[i], l = [];
-        for (let g = 0; g < a.length; g++) {
-          const u = a[g], f = "" + i + g;
-          l.push(f), t[f] = { node: u, lastCount: 0 }, e[f] = {};
-          for (let A = 0; A < s.length; A++) {
-            const d = s[A];
-            t[d] && t[d].node.mode === u.mode ? (e[d][f] = E(t[d].lastCount + u.length, u.mode) - E(t[d].lastCount, u.mode), t[d].lastCount += u.length) : (t[d] && (t[d].lastCount = u.length), e[d][f] = E(u.length, u.mode) + 4 + r.getCharCountIndicator(u.mode, o));
-          }
-        }
-        s = l;
-      }
-      for (let i = 0; i < s.length; i++)
-        e[s[i]].end = 0;
-      return { map: e, table: t };
-    }
-    function S(n, o) {
-      let t;
-      const e = r.getBestModeForData(n);
-      if (t = r.from(o, e), t !== r.BYTE && t.bit < e.bit)
-        throw new Error('"' + n + '" cannot be encoded with mode ' + r.toString(t) + `.
- Suggested mode is: ` + r.toString(e));
-      switch (t === r.KANJI && !p.isKanjiModeEnabled() && (t = r.BYTE), t) {
-        case r.NUMERIC:
-          return new I(n);
-        case r.ALPHANUMERIC:
-          return new B(n);
-        case r.KANJI:
-          return new q(n);
-        case r.BYTE:
-          return new _(n);
+import { __exports as a } from "./index125.js";
+import { __require as h } from "./index126.js";
+var p;
+function C() {
+  return p ? a : (p = 1, (function(u) {
+    const f = h();
+    function m(d, r, e) {
+      d.clearRect(0, 0, r.width, r.height), r.style || (r.style = {}), r.height = e, r.width = e, r.style.height = e + "px", r.style.width = e + "px";
+    }
+    function s() {
+      try {
+        return document.createElement("canvas");
+      } catch {
+        throw new Error("You need to specify a canvas element");
       }
     }
-    m.fromArray = function(o) {
-      return o.reduce(function(t, e) {
-        return typeof e == "string" ? t.push(S(e, null)) : e.data && t.push(S(e.data, e.mode)), t;
-      }, []);
-    }, m.fromString = function(o, t) {
-      const e = M(o, p.isKanjiModeEnabled()), s = w(e), i = K(s, t), a = R.find_path(i.map, "start", "end"), l = [];
-      for (let g = 1; g < a.length - 1; g++)
-        l.push(i.table[a[g]].node);
-      return m.fromArray(U(l));
-    }, m.rawSplit = function(o) {
-      return m.fromArray(
-        M(o, p.isKanjiModeEnabled())
-      );
+    u.render = function(r, e, l) {
+      let t = l, n = e;
+      typeof t > "u" && (!e || !e.getContext) && (t = e, e = void 0), e || (n = s()), t = f.getOptions(t);
+      const i = f.getImageWidth(r.modules.size, t), o = n.getContext("2d"), g = o.createImageData(i, i);
+      return f.qrToImageData(g.data, r, t), m(o, n, i), o.putImageData(g, 0, 0), n;
+    }, u.renderToDataURL = function(r, e, l) {
+      let t = l;
+      typeof t > "u" && (!e || !e.getContext) && (t = e, e = void 0), t || (t = {});
+      const n = u.render(r, e, t), i = t.type || "image/png", o = t.rendererOpts || {};
+      return n.toDataURL(i, o.quality);
     };
-  })(N), N);
+  })(a), a);
 }
 export {
-  V as __require
+  C as __require
 };
 //# sourceMappingURL=index109.js.map

package/dist/index109.js.map

@@ -1 +1 @@
-{"version":3,"file":"index109.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/segments.js"],"sourcesContent":["const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param  {String} str Input string\n * @return {Number}     Number of byte\n */\nfunction getStringByteLength (str) {\n  return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param  {Mode}   mode Segment mode\n * @param  {String} str  String to process\n * @return {Array}       Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n  const segments = []\n  let result\n\n  while ((result = regex.exec(str)) !== null) {\n    segments.push({\n      data: result[0],\n      index: result.index,\n      mode: mode,\n      length: result[0].length\n    })\n  }\n\n  return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param  {String} dataStr Input string\n * @return {Array}          Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n  const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n  const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n  let byteSegs\n  let kanjiSegs\n\n  if (Utils.isKanjiModeEnabled()) {\n    byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n    kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n  } else {\n    byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n    kanjiSegs = []\n  }\n\n  const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n  return segs\n    .sort(function (s1, s2) {\n      return s1.index - s2.index\n    })\n    .map(function (obj) {\n      return {\n        data: obj.data,\n        mode: obj.mode,\n        length: obj.length\n      }\n    })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param  {Number} length String length\n * @param  {Mode} mode     Segment mode\n * @return {Number}        Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n  switch (mode) {\n    case Mode.NUMERIC:\n      return NumericData.getBitsLength(length)\n    case Mode.ALPHANUMERIC:\n      return AlphanumericData.getBitsLength(length)\n    case Mode.KANJI:\n      return KanjiData.getBitsLength(length)\n    case Mode.BYTE:\n      return ByteData.getBitsLength(length)\n  }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction mergeSegments (segs) {\n  return segs.reduce(function (acc, curr) {\n    const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n    if (prevSeg && prevSeg.mode === curr.mode) {\n      acc[acc.length - 1].data += curr.data\n      return acc\n    }\n\n    acc.push(curr)\n    return acc\n  }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction buildNodes (segs) {\n  const nodes = []\n  for (let i = 0; i < segs.length; i++) {\n    const seg = segs[i]\n\n    switch (seg.mode) {\n      case Mode.NUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.ALPHANUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.KANJI:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n        break\n      case Mode.BYTE:\n        nodes.push([\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n    }\n  }\n\n  return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param  {Array} nodes    Array of object with segments data\n * @param  {Number} version QR Code version\n * @return {Object}         Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n  const table = {}\n  const graph = { start: {} }\n  let prevNodeIds = ['start']\n\n  for (let i = 0; i < nodes.length; i++) {\n    const nodeGroup = nodes[i]\n    const currentNodeIds = []\n\n    for (let j = 0; j < nodeGroup.length; j++) {\n      const node = nodeGroup[j]\n      const key = '' + i + j\n\n      currentNodeIds.push(key)\n      table[key] = { node: node, lastCount: 0 }\n      graph[key] = {}\n\n      for (let n = 0; n < prevNodeIds.length; n++) {\n        const prevNodeId = prevNodeIds[n]\n\n        if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n          graph[prevNodeId][key] =\n            getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n            getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n          table[prevNodeId].lastCount += node.length\n        } else {\n          if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n          graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n            4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n        }\n      }\n    }\n\n    prevNodeIds = currentNodeIds\n  }\n\n  for (let n = 0; n < prevNodeIds.length; n++) {\n    graph[prevNodeIds[n]].end = 0\n  }\n\n  return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param  {String} data             Input data\n * @param  {Mode | String} modesHint Data mode\n * @return {Segment}                 Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n  let mode\n  const bestMode = Mode.getBestModeForData(data)\n\n  mode = Mode.from(modesHint, bestMode)\n\n  // Make sure data can be encoded\n  if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n    throw new Error('\"' + data + '\"' +\n      ' cannot be encoded with mode ' + Mode.toString(mode) +\n      '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n  }\n\n  // Use Mode.BYTE if Kanji support is disabled\n  if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n    mode = Mode.BYTE\n  }\n\n  switch (mode) {\n    case Mode.NUMERIC:\n      return new NumericData(data)\n\n    case Mode.ALPHANUMERIC:\n      return new AlphanumericData(data)\n\n    case Mode.KANJI:\n      return new KanjiData(data)\n\n    case Mode.BYTE:\n      return new ByteData(data)\n  }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param  {Array} array Array of objects with segments data\n * @return {Array}       Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n  return array.reduce(function (acc, seg) {\n    if (typeof seg === 'string') {\n      acc.push(buildSingleSegment(seg, null))\n    } else if (seg.data) {\n      acc.push(buildSingleSegment(seg.data, seg.mode))\n    }\n\n    return acc\n  }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param  {String} data    Input string\n * @param  {Number} version QR Code version\n * @return {Array}          Array of segments\n */\nexports.fromString = function fromString (data, version) {\n  const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n  const nodes = buildNodes(segs)\n  const graph = buildGraph(nodes, version)\n  const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n  const optimizedSegs = []\n  for (let i = 1; i < path.length - 1; i++) {\n    optimizedSegs.push(graph.table[path[i]].node)\n  }\n\n  return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param  {string} data Input string\n * @return {Array}       Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n  return exports.fromArray(\n    getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n  )\n}\n"],"names":["Mode","require$$0","NumericData","require$$1","AlphanumericData","require$$2","ByteData","require$$3","KanjiData","require$$4","Regex","require$$5","Utils","require$$6","dijkstra","require$$7","getStringByteLength","str","getSegments","regex","mode","segments","result","getSegmentsFromString","dataStr","numSegs","alphaNumSegs","byteSegs","kanjiSegs","s1","s2","obj","getSegmentBitsLength","length","mergeSegments","segs","acc","curr","prevSeg","buildNodes","nodes","i","seg","buildGraph","version","table","graph","prevNodeIds","nodeGroup","currentNodeIds","j","node","key","n","prevNodeId","buildSingleSegment","data","modesHint","bestMode","exports","array","path","optimizedSegs"],"mappings":";;;;;;;;;;;;AAAA,UAAMA,IAAOC,EAAA,GACPC,IAAcC,EAAA,GACdC,IAAmBC,EAAA,GACnBC,IAAWC,EAAA,GACXC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAWC,EAAA;AAQjB,aAASC,EAAqBC,GAAK;AACjC,aAAO,SAAS,mBAAmBA,CAAG,CAAC,EAAE;AAAA,IAC3C;AAUA,aAASC,EAAaC,GAAOC,GAAMH,GAAK;AACtC,YAAMI,IAAW,CAAA;AACjB,UAAIC;AAEJ,cAAQA,IAASH,EAAM,KAAKF,CAAG,OAAO;AACpC,QAAAI,EAAS,KAAK;AAAA,UACZ,MAAMC,EAAO,CAAC;AAAA,UACd,OAAOA,EAAO;AAAA,UACd,MAAMF;AAAA,UACN,QAAQE,EAAO,CAAC,EAAE;AAAA,SACnB;AAGH,aAAOD;AAAA,IACT;AASA,aAASE,EAAuBC,GAAS;AACvC,YAAMC,IAAUP,EAAYR,EAAM,SAASV,EAAK,SAASwB,CAAO,GAC1DE,IAAeR,EAAYR,EAAM,cAAcV,EAAK,cAAcwB,CAAO;AAC/E,UAAIG,GACAC;AAEJ,aAAIhB,EAAM,wBACRe,IAAWT,EAAYR,EAAM,MAAMV,EAAK,MAAMwB,CAAO,GACrDI,IAAYV,EAAYR,EAAM,OAAOV,EAAK,OAAOwB,CAAO,MAExDG,IAAWT,EAAYR,EAAM,YAAYV,EAAK,MAAMwB,CAAO,GAC3DI,IAAY,CAAA,IAGDH,EAAQ,OAAOC,GAAcC,GAAUC,CAAS,EAG1D,KAAK,SAAUC,GAAIC,GAAI;AACtB,eAAOD,EAAG,QAAQC,EAAG;AAAA,MAC3B,CAAK,EACA,IAAI,SAAUC,GAAK;AAClB,eAAO;AAAA,UACL,MAAMA,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA,EAAI;AAAA,QACpB;AAAA,MACA,CAAK;AAAA,IACL;AAUA,aAASC,EAAsBC,GAAQb,GAAM;AAC3C,cAAQA,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAOE,EAAY,cAAc+B,CAAM;AAAA,QACzC,KAAKjC,EAAK;AACR,iBAAOI,EAAiB,cAAc6B,CAAM;AAAA,QAC9C,KAAKjC,EAAK;AACR,iBAAOQ,EAAU,cAAcyB,CAAM;AAAA,QACvC,KAAKjC,EAAK;AACR,iBAAOM,EAAS,cAAc2B,CAAM;AAAA,MAC1C;AAAA,IACA;AAQA,aAASC,EAAeC,GAAM;AAC5B,aAAOA,EAAK,OAAO,SAAUC,GAAKC,GAAM;AACtC,cAAMC,IAAUF,EAAI,SAAS,KAAK,IAAIA,EAAIA,EAAI,SAAS,CAAC,IAAI;AAC5D,eAAIE,KAAWA,EAAQ,SAASD,EAAK,QACnCD,EAAIA,EAAI,SAAS,CAAC,EAAE,QAAQC,EAAK,MAC1BD,MAGTA,EAAI,KAAKC,CAAI,GACND;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP;AAkBA,aAASG,EAAYJ,GAAM;AACzB,YAAMK,IAAQ,CAAA;AACd,eAASC,IAAI,GAAGA,IAAIN,EAAK,QAAQM,KAAK;AACpC,cAAMC,IAAMP,EAAKM,CAAC;AAElB,gBAAQC,EAAI,MAAI;AAAA,UACd,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,cAAc,QAAQ0C,EAAI,OAAM;AAAA,cAC7D,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cACT,EAAE,MAAME,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AAAA,QACT;AAAA,MACA;AAEE,aAAOF;AAAA,IACT;AAcA,aAASG,EAAYH,GAAOI,GAAS;AACnC,YAAMC,IAAQ,CAAA,GACRC,IAAQ,EAAE,OAAO,CAAA,EAAE;AACzB,UAAIC,IAAc,CAAC,OAAO;AAE1B,eAAS,IAAI,GAAG,IAAIP,EAAM,QAAQ,KAAK;AACrC,cAAMQ,IAAYR,EAAM,CAAC,GACnBS,IAAiB,CAAA;AAEvB,iBAASC,IAAI,GAAGA,IAAIF,EAAU,QAAQE,KAAK;AACzC,gBAAMC,IAAOH,EAAUE,CAAC,GAClBE,IAAM,KAAK,IAAIF;AAErB,UAAAD,EAAe,KAAKG,CAAG,GACvBP,EAAMO,CAAG,IAAI,EAAE,MAAMD,GAAM,WAAW,EAAC,GACvCL,EAAMM,CAAG,IAAI,CAAA;AAEb,mBAASC,IAAI,GAAGA,IAAIN,EAAY,QAAQM,KAAK;AAC3C,kBAAMC,IAAaP,EAAYM,CAAC;AAEhC,YAAIR,EAAMS,CAAU,KAAKT,EAAMS,CAAU,EAAE,KAAK,SAASH,EAAK,QAC5DL,EAAMQ,CAAU,EAAEF,CAAG,IACnBpB,EAAqBa,EAAMS,CAAU,EAAE,YAAYH,EAAK,QAAQA,EAAK,IAAI,IACzEnB,EAAqBa,EAAMS,CAAU,EAAE,WAAWH,EAAK,IAAI,GAE7DN,EAAMS,CAAU,EAAE,aAAaH,EAAK,WAEhCN,EAAMS,CAAU,MAAGT,EAAMS,CAAU,EAAE,YAAYH,EAAK,SAE1DL,EAAMQ,CAAU,EAAEF,CAAG,IAAIpB,EAAqBmB,EAAK,QAAQA,EAAK,IAAI,IAClE,IAAInD,EAAK,sBAAsBmD,EAAK,MAAMP,CAAO;AAAA,UAE7D;AAAA,QACA;AAEI,QAAAG,IAAcE;AAAA,MAClB;AAEE,eAASI,IAAI,GAAGA,IAAIN,EAAY,QAAQM;AACtC,QAAAP,EAAMC,EAAYM,CAAC,CAAC,EAAE,MAAM;AAG9B,aAAO,EAAE,KAAKP,GAAO,OAAOD,EAAK;AAAA,IACnC;AAUA,aAASU,EAAoBC,GAAMC,GAAW;AAC5C,UAAIrC;AACJ,YAAMsC,IAAW1D,EAAK,mBAAmBwD,CAAI;AAK7C,UAHApC,IAAOpB,EAAK,KAAKyD,GAAWC,CAAQ,GAGhCtC,MAASpB,EAAK,QAAQoB,EAAK,MAAMsC,EAAS;AAC5C,cAAM,IAAI,MAAM,MAAMF,IAAO,mCACOxD,EAAK,SAASoB,CAAI,IACpD;AAAA,wBAA4BpB,EAAK,SAAS0D,CAAQ,CAAC;AAQvD,cAJItC,MAASpB,EAAK,SAAS,CAACY,EAAM,mBAAkB,MAClDQ,IAAOpB,EAAK,OAGNoB,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAO,IAAIE,EAAYsD,CAAI;AAAA,QAE7B,KAAKxD,EAAK;AACR,iBAAO,IAAII,EAAiBoD,CAAI;AAAA,QAElC,KAAKxD,EAAK;AACR,iBAAO,IAAIQ,EAAUgD,CAAI;AAAA,QAE3B,KAAKxD,EAAK;AACR,iBAAO,IAAIM,EAASkD,CAAI;AAAA,MAC9B;AAAA,IACA;AAiBAG,IAAAA,EAAA,YAAoB,SAAoBC,GAAO;AAC7C,aAAOA,EAAM,OAAO,SAAUxB,GAAKM,GAAK;AACtC,eAAI,OAAOA,KAAQ,WACjBN,EAAI,KAAKmB,EAAmBb,GAAK,IAAI,CAAC,IAC7BA,EAAI,QACbN,EAAI,KAAKmB,EAAmBb,EAAI,MAAMA,EAAI,IAAI,CAAC,GAG1CN;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP,GAUAuB,EAAA,aAAqB,SAAqBH,GAAMZ,GAAS;AACvD,YAAMT,IAAOZ,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE,GAE7D4B,IAAQD,EAAWJ,CAAI,GACvBW,IAAQH,EAAWH,GAAOI,CAAO,GACjCiB,IAAO/C,EAAS,UAAUgC,EAAM,KAAK,SAAS,KAAK,GAEnDgB,IAAgB,CAAA;AACtB,eAASrB,IAAI,GAAGA,IAAIoB,EAAK,SAAS,GAAGpB;AACnC,QAAAqB,EAAc,KAAKhB,EAAM,MAAMe,EAAKpB,CAAC,CAAC,EAAE,IAAI;AAG9C,aAAOkB,EAAQ,UAAUzB,EAAc4B,CAAa,CAAC;AAAA,IACvD,GAYAH,EAAA,WAAmB,SAAmBH,GAAM;AAC1C,aAAOG,EAAQ;AAAA,QACbpC,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE;AAAA,MAC1D;AAAA,IACA;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index109.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/renderer/canvas.js"],"sourcesContent":["const Utils = require('./utils')\n\nfunction clearCanvas (ctx, canvas, size) {\n  ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n  if (!canvas.style) canvas.style = {}\n  canvas.height = size\n  canvas.width = size\n  canvas.style.height = size + 'px'\n  canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n  try {\n    return document.createElement('canvas')\n  } catch (e) {\n    throw new Error('You need to specify a canvas element')\n  }\n}\n\nexports.render = function render (qrData, canvas, options) {\n  let opts = options\n  let canvasEl = canvas\n\n  if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n    opts = canvas\n    canvas = undefined\n  }\n\n  if (!canvas) {\n    canvasEl = getCanvasElement()\n  }\n\n  opts = Utils.getOptions(opts)\n  const size = Utils.getImageWidth(qrData.modules.size, opts)\n\n  const ctx = canvasEl.getContext('2d')\n  const image = ctx.createImageData(size, size)\n  Utils.qrToImageData(image.data, qrData, opts)\n\n  clearCanvas(ctx, canvasEl, size)\n  ctx.putImageData(image, 0, 0)\n\n  return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n  let opts = options\n\n  if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n    opts = canvas\n    canvas = undefined\n  }\n\n  if (!opts) opts = {}\n\n  const canvasEl = exports.render(qrData, canvas, opts)\n\n  const type = opts.type || 'image/png'\n  const rendererOpts = opts.rendererOpts || {}\n\n  return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n"],"names":["Utils","require$$0","clearCanvas","ctx","canvas","size","getCanvasElement","exports","qrData","options","opts","canvasEl","image","type","rendererOpts"],"mappings":";;;;;AAAA,UAAMA,IAAQC,EAAA;AAEd,aAASC,EAAaC,GAAKC,GAAQC,GAAM;AACvC,MAAAF,EAAI,UAAU,GAAG,GAAGC,EAAO,OAAOA,EAAO,MAAM,GAE1CA,EAAO,UAAOA,EAAO,QAAQ,CAAA,IAClCA,EAAO,SAASC,GAChBD,EAAO,QAAQC,GACfD,EAAO,MAAM,SAASC,IAAO,MAC7BD,EAAO,MAAM,QAAQC,IAAO;AAAA,IAC9B;AAEA,aAASC,IAAoB;AAC3B,UAAI;AACF,eAAO,SAAS,cAAc,QAAQ;AAAA,MAC1C,QAAc;AACV,cAAM,IAAI,MAAM,sCAAsC;AAAA,MAC1D;AAAA,IACA;AAEAC,IAAAA,EAAA,SAAiB,SAAiBC,GAAQJ,GAAQK,GAAS;AACzD,UAAIC,IAAOD,GACPE,IAAWP;AAEf,MAAI,OAAOM,IAAS,QAAgB,CAACN,KAAU,CAACA,EAAO,gBACrDM,IAAON,GACPA,IAAS,SAGNA,MACHO,IAAWL,EAAgB,IAG7BI,IAAOV,EAAM,WAAWU,CAAI;AAC5B,YAAML,IAAOL,EAAM,cAAcQ,EAAO,QAAQ,MAAME,CAAI,GAEpDP,IAAMQ,EAAS,WAAW,IAAI,GAC9BC,IAAQT,EAAI,gBAAgBE,GAAMA,CAAI;AAC5C,aAAAL,EAAM,cAAcY,EAAM,MAAMJ,GAAQE,CAAI,GAE5CR,EAAYC,GAAKQ,GAAUN,CAAI,GAC/BF,EAAI,aAAaS,GAAO,GAAG,CAAC,GAErBD;AAAA,IACT,GAEAJ,EAAA,kBAA0B,SAA0BC,GAAQJ,GAAQK,GAAS;AAC3E,UAAIC,IAAOD;AAEX,MAAI,OAAOC,IAAS,QAAgB,CAACN,KAAU,CAACA,EAAO,gBACrDM,IAAON,GACPA,IAAS,SAGNM,MAAMA,IAAO,CAAA;AAElB,YAAMC,IAAWJ,EAAQ,OAAOC,GAAQJ,GAAQM,CAAI,GAE9CG,IAAOH,EAAK,QAAQ,aACpBI,IAAeJ,EAAK,gBAAgB,CAAA;AAE1C,aAAOC,EAAS,UAAUE,GAAMC,EAAa,OAAO;AAAA,IACtD;AAAA;;","x_google_ignoreList":[0]}