@genai-fi/base 4.3.7 → 4.3.9

package/dist/{browser-HW-wgeM2.js → browser-DWbgwj89.js}

@@ -1,14 +1,14 @@
-import { g as oe } from "./_commonjsHelpers-DaMA6jEr.js";
-var z = {}, Q, At;
-function ie() {
-  return At || (At = 1, Q = function() {
+import { g as ne } from "./_commonjsHelpers-DaMA6jEr.js";
+var z = {}, Q, pt;
+function re() {
+  return pt || (pt = 1, Q = function() {
     return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
   }), Q;
 }
-var W = {}, U = {}, Rt;
-function F() {
-  if (Rt) return U;
-  Rt = 1;
+var W = {}, U = {}, At;
+function _() {
+  if (At) return U;
+  At = 1;
   let r;
   const o = [
     0,
@@ -54,30 +54,30 @@ function F() {
     3532,
     3706
   ];
-  return U.getSymbolSize = function(n) {
-    if (!n) throw new Error('"version" cannot be null or undefined');
-    if (n < 1 || n > 40) throw new Error('"version" should be in range from 1 to 40');
-    return n * 4 + 17;
-  }, U.getSymbolTotalCodewords = function(n) {
-    return o[n];
+  return U.getSymbolSize = function(e) {
+    if (!e) throw new Error('"version" cannot be null or undefined');
+    if (e < 1 || e > 40) throw new Error('"version" should be in range from 1 to 40');
+    return e * 4 + 17;
+  }, U.getSymbolTotalCodewords = function(e) {
+    return o[e];
   }, U.getBCHDigit = function(i) {
-    let n = 0;
+    let e = 0;
     for (; i !== 0; )
-      n++, i >>>= 1;
-    return n;
-  }, U.setToSJISFunction = function(n) {
-    if (typeof n != "function")
+      e++, i >>>= 1;
+    return e;
+  }, U.setToSJISFunction = function(e) {
+    if (typeof e != "function")
       throw new Error('"toSJISFunc" is not a valid function.');
-    r = n;
+    r = e;
   }, U.isKanjiModeEnabled = function() {
     return typeof r < "u";
-  }, U.toSJIS = function(n) {
-    return r(n);
+  }, U.toSJIS = function(e) {
+    return r(e);
   }, U;
 }
-var Z = {}, It;
-function Et() {
-  return It || (It = 1, function(r) {
+var Z = {}, Rt;
+function Ct() {
+  return Rt || (Rt = 1, (function(r) {
     r.L = { bit: 1 }, r.M = { bit: 0 }, r.Q = { bit: 3 }, r.H = { bit: 2 };
     function o(i) {
       if (typeof i != "string")
@@ -99,21 +99,21 @@ function Et() {
           throw new Error("Unknown EC Level: " + i);
       }
     }
-    r.isValid = function(n) {
-      return n && typeof n.bit < "u" && n.bit >= 0 && n.bit < 4;
-    }, r.from = function(n, t) {
-      if (r.isValid(n))
-        return n;
+    r.isValid = function(e) {
+      return e && typeof e.bit < "u" && e.bit >= 0 && e.bit < 4;
+    }, r.from = function(e, t) {
+      if (r.isValid(e))
+        return e;
       try {
-        return o(n);
+        return o(e);
       } catch {
         return t;
       }
     };
-  }(Z)), Z;
+  })(Z)), Z;
 }
 var X, Tt;
-function ue() {
+function oe() {
   if (Tt) return X;
   Tt = 1;
   function r() {
@@ -125,8 +125,8 @@ function ue() {
       return (this.buffer[i] >>> 7 - o % 8 & 1) === 1;
     },
     put: function(o, i) {
-      for (let n = 0; n < i; n++)
-        this.putBit((o >>> i - n - 1 & 1) === 1);
+      for (let e = 0; e < i; e++)
+        this.putBit((o >>> i - e - 1 & 1) === 1);
     },
     getLengthInBits: function() {
       return this.length;
@@ -137,54 +137,54 @@ function ue() {
     }
   }, X = r, X;
 }
-var x, Nt;
-function se() {
-  if (Nt) return x;
-  Nt = 1;
+var x, It;
+function ie() {
+  if (It) return x;
+  It = 1;
   function r(o) {
     if (!o || o < 1)
       throw new Error("BitMatrix size must be defined and greater than 0");
     this.size = o, this.data = new Uint8Array(o * o), this.reservedBit = new Uint8Array(o * o);
   }
-  return r.prototype.set = function(o, i, n, t) {
-    const e = o * this.size + i;
-    this.data[e] = n, t && (this.reservedBit[e] = !0);
+  return r.prototype.set = function(o, i, e, t) {
+    const n = o * this.size + i;
+    this.data[n] = e, t && (this.reservedBit[n] = !0);
   }, r.prototype.get = function(o, i) {
     return this.data[o * this.size + i];
-  }, r.prototype.xor = function(o, i, n) {
-    this.data[o * this.size + i] ^= n;
+  }, r.prototype.xor = function(o, i, e) {
+    this.data[o * this.size + i] ^= e;
   }, r.prototype.isReserved = function(o, i) {
     return this.reservedBit[o * this.size + i];
   }, x = r, x;
 }
-var $ = {}, Mt;
-function ae() {
-  return Mt || (Mt = 1, function(r) {
-    const o = F().getSymbolSize;
-    r.getRowColCoords = function(n) {
-      if (n === 1) return [];
-      const t = Math.floor(n / 7) + 2, e = o(n), u = e === 145 ? 26 : Math.ceil((e - 13) / (2 * t - 2)) * 2, a = [e - 7];
+var $ = {}, Nt;
+function ue() {
+  return Nt || (Nt = 1, (function(r) {
+    const o = _().getSymbolSize;
+    r.getRowColCoords = function(e) {
+      if (e === 1) return [];
+      const t = Math.floor(e / 7) + 2, n = o(e), u = n === 145 ? 26 : Math.ceil((n - 13) / (2 * t - 2)) * 2, a = [n - 7];
       for (let s = 1; s < t - 1; s++)
         a[s] = a[s - 1] - u;
       return a.push(6), a.reverse();
-    }, r.getPositions = function(n) {
-      const t = [], e = r.getRowColCoords(n), u = e.length;
+    }, r.getPositions = function(e) {
+      const t = [], n = r.getRowColCoords(e), u = n.length;
       for (let a = 0; a < u; a++)
         for (let s = 0; s < u; s++)
           a === 0 && s === 0 || // top-left
           a === 0 && s === u - 1 || // bottom-left
-          a === u - 1 && s === 0 || t.push([e[a], e[s]]);
+          a === u - 1 && s === 0 || t.push([n[a], n[s]]);
       return t;
     };
-  }($)), $;
+  })($)), $;
 }
-var tt = {}, Pt;
-function ce() {
-  if (Pt) return tt;
-  Pt = 1;
-  const r = F().getSymbolSize, o = 7;
-  return tt.getPositions = function(n) {
-    const t = r(n);
+var tt = {}, Mt;
+function se() {
+  if (Mt) return tt;
+  Mt = 1;
+  const r = _().getSymbolSize, o = 7;
+  return tt.getPositions = function(e) {
+    const t = r(e);
     return [
       // top-left
       [0, 0],
@@ -195,9 +195,9 @@ function ce() {
     ];
   }, tt;
 }
-var et = {}, St;
-function fe() {
-  return St || (St = 1, function(r) {
+var et = {}, Pt;
+function ae() {
+  return Pt || (Pt = 1, (function(r) {
     r.Patterns = {
       PATTERN000: 0,
       PATTERN001: 1,
@@ -219,11 +219,11 @@ function fe() {
     }, r.from = function(t) {
       return r.isValid(t) ? parseInt(t, 10) : void 0;
     }, r.getPenaltyN1 = function(t) {
-      const e = t.size;
+      const n = t.size;
       let u = 0, a = 0, s = 0, c = null, d = null;
-      for (let B = 0; B < e; B++) {
+      for (let B = 0; B < n; B++) {
         a = s = 0, c = d = null;
-        for (let h = 0; h < e; h++) {
+        for (let h = 0; h < n; h++) {
           let f = t.get(B, h);
           f === c ? a++ : (a >= 5 && (u += o.N1 + (a - 5)), c = f, a = 1), f = t.get(h, B), f === d ? s++ : (s >= 5 && (u += o.N1 + (s - 5)), d = f, s = 1);
         }
@@ -231,73 +231,73 @@ function fe() {
       }
       return u;
     }, r.getPenaltyN2 = function(t) {
-      const e = t.size;
+      const n = t.size;
       let u = 0;
-      for (let a = 0; a < e - 1; a++)
-        for (let s = 0; s < e - 1; s++) {
+      for (let a = 0; a < n - 1; a++)
+        for (let s = 0; s < n - 1; s++) {
           const c = t.get(a, s) + t.get(a, s + 1) + t.get(a + 1, s) + t.get(a + 1, s + 1);
           (c === 4 || c === 0) && u++;
         }
       return u * o.N2;
     }, r.getPenaltyN3 = function(t) {
-      const e = t.size;
+      const n = t.size;
       let u = 0, a = 0, s = 0;
-      for (let c = 0; c < e; c++) {
+      for (let c = 0; c < n; c++) {
         a = s = 0;
-        for (let d = 0; d < e; d++)
+        for (let d = 0; d < n; d++)
           a = a << 1 & 2047 | t.get(c, d), d >= 10 && (a === 1488 || a === 93) && u++, s = s << 1 & 2047 | t.get(d, c), d >= 10 && (s === 1488 || s === 93) && u++;
       }
       return u * o.N3;
     }, r.getPenaltyN4 = function(t) {
-      let e = 0;
+      let n = 0;
       const u = t.data.length;
-      for (let s = 0; s < u; s++) e += t.data[s];
-      return Math.abs(Math.ceil(e * 100 / u / 5) - 10) * o.N4;
+      for (let s = 0; s < u; s++) n += t.data[s];
+      return Math.abs(Math.ceil(n * 100 / u / 5) - 10) * o.N4;
     };
-    function i(n, t, e) {
-      switch (n) {
+    function i(e, t, n) {
+      switch (e) {
         case r.Patterns.PATTERN000:
-          return (t + e) % 2 === 0;
+          return (t + n) % 2 === 0;
         case r.Patterns.PATTERN001:
           return t % 2 === 0;
         case r.Patterns.PATTERN010:
-          return e % 3 === 0;
+          return n % 3 === 0;
         case r.Patterns.PATTERN011:
-          return (t + e) % 3 === 0;
+          return (t + n) % 3 === 0;
         case r.Patterns.PATTERN100:
-          return (Math.floor(t / 2) + Math.floor(e / 3)) % 2 === 0;
+          return (Math.floor(t / 2) + Math.floor(n / 3)) % 2 === 0;
         case r.Patterns.PATTERN101:
-          return t * e % 2 + t * e % 3 === 0;
+          return t * n % 2 + t * n % 3 === 0;
         case r.Patterns.PATTERN110:
-          return (t * e % 2 + t * e % 3) % 2 === 0;
+          return (t * n % 2 + t * n % 3) % 2 === 0;
         case r.Patterns.PATTERN111:
-          return (t * e % 3 + (t + e) % 2) % 2 === 0;
+          return (t * n % 3 + (t + n) % 2) % 2 === 0;
         default:
-          throw new Error("bad maskPattern:" + n);
+          throw new Error("bad maskPattern:" + e);
       }
     }
-    r.applyMask = function(t, e) {
-      const u = e.size;
+    r.applyMask = function(t, n) {
+      const u = n.size;
       for (let a = 0; a < u; a++)
         for (let s = 0; s < u; s++)
-          e.isReserved(s, a) || e.xor(s, a, i(t, s, a));
-    }, r.getBestMask = function(t, e) {
+          n.isReserved(s, a) || n.xor(s, a, i(t, s, a));
+    }, r.getBestMask = function(t, n) {
       const u = Object.keys(r.Patterns).length;
       let a = 0, s = 1 / 0;
       for (let c = 0; c < u; c++) {
-        e(c), r.applyMask(c, t);
+        n(c), r.applyMask(c, t);
         const d = r.getPenaltyN1(t) + r.getPenaltyN2(t) + r.getPenaltyN3(t) + r.getPenaltyN4(t);
         r.applyMask(c, t), d < s && (s = d, a = c);
       }
       return a;
     };
-  }(et)), et;
+  })(et)), et;
 }
-var J = {}, bt;
-function Xt() {
-  if (bt) return J;
-  bt = 1;
-  const r = Et(), o = [
+var J = {}, St;
+function Wt() {
+  if (St) return J;
+  St = 1;
+  const r = Ct(), o = [
     // L  M  Q  H
     1,
     1,
@@ -622,8 +622,8 @@ function Xt() {
     2040,
     2430
   ];
-  return J.getBlocksCount = function(t, e) {
-    switch (e) {
+  return J.getBlocksCount = function(t, n) {
+    switch (n) {
       case r.L:
         return o[(t - 1) * 4 + 0];
       case r.M:
@@ -635,8 +635,8 @@ function Xt() {
       default:
         return;
     }
-  }, J.getTotalCodewordsCount = function(t, e) {
-    switch (e) {
+  }, J.getTotalCodewordsCount = function(t, n) {
+    switch (n) {
       case r.L:
         return i[(t - 1) * 4 + 0];
       case r.M:
@@ -650,107 +650,107 @@ function Xt() {
     }
   }, J;
 }
-var nt = {}, K = {}, Lt;
-function le() {
-  if (Lt) return K;
-  Lt = 1;
+var nt = {}, K = {}, bt;
+function ce() {
+  if (bt) return K;
+  bt = 1;
   const r = new Uint8Array(512), o = new Uint8Array(256);
-  return function() {
-    let n = 1;
+  return (function() {
+    let e = 1;
     for (let t = 0; t < 255; t++)
-      r[t] = n, o[n] = t, n <<= 1, n & 256 && (n ^= 285);
+      r[t] = e, o[e] = t, e <<= 1, e & 256 && (e ^= 285);
     for (let t = 255; t < 512; t++)
       r[t] = r[t - 255];
-  }(), K.log = function(n) {
-    if (n < 1) throw new Error("log(" + n + ")");
-    return o[n];
-  }, K.exp = function(n) {
-    return r[n];
-  }, K.mul = function(n, t) {
-    return n === 0 || t === 0 ? 0 : r[o[n] + o[t]];
+  })(), K.log = function(e) {
+    if (e < 1) throw new Error("log(" + e + ")");
+    return o[e];
+  }, K.exp = function(e) {
+    return r[e];
+  }, K.mul = function(e, t) {
+    return e === 0 || t === 0 ? 0 : r[o[e] + o[t]];
   }, K;
 }
-var Dt;
-function de() {
-  return Dt || (Dt = 1, function(r) {
-    const o = le();
-    r.mul = function(n, t) {
-      const e = new Uint8Array(n.length + t.length - 1);
-      for (let u = 0; u < n.length; u++)
+var Lt;
+function fe() {
+  return Lt || (Lt = 1, (function(r) {
+    const o = ce();
+    r.mul = function(e, t) {
+      const n = new Uint8Array(e.length + t.length - 1);
+      for (let u = 0; u < e.length; u++)
         for (let a = 0; a < t.length; a++)
-          e[u + a] ^= o.mul(n[u], t[a]);
-      return e;
-    }, r.mod = function(n, t) {
-      let e = new Uint8Array(n);
-      for (; e.length - t.length >= 0; ) {
-        const u = e[0];
+          n[u + a] ^= o.mul(e[u], t[a]);
+      return n;
+    }, r.mod = function(e, t) {
+      let n = new Uint8Array(e);
+      for (; n.length - t.length >= 0; ) {
+        const u = n[0];
         for (let s = 0; s < t.length; s++)
-          e[s] ^= o.mul(t[s], u);
+          n[s] ^= o.mul(t[s], u);
         let a = 0;
-        for (; a < e.length && e[a] === 0; ) a++;
-        e = e.slice(a);
+        for (; a < n.length && n[a] === 0; ) a++;
+        n = n.slice(a);
       }
-      return e;
-    }, r.generateECPolynomial = function(n) {
+      return n;
+    }, r.generateECPolynomial = function(e) {
       let t = new Uint8Array([1]);
-      for (let e = 0; e < n; e++)
-        t = r.mul(t, new Uint8Array([1, o.exp(e)]));
+      for (let n = 0; n < e; n++)
+        t = r.mul(t, new Uint8Array([1, o.exp(n)]));
       return t;
     };
-  }(nt)), nt;
+  })(nt)), nt;
 }
-var rt, vt;
-function ge() {
-  if (vt) return rt;
-  vt = 1;
-  const r = de();
+var rt, qt;
+function le() {
+  if (qt) return rt;
+  qt = 1;
+  const r = fe();
   function o(i) {
     this.genPoly = void 0, this.degree = i, this.degree && this.initialize(this.degree);
   }
-  return o.prototype.initialize = function(n) {
-    this.degree = n, this.genPoly = r.generateECPolynomial(this.degree);
-  }, o.prototype.encode = function(n) {
+  return o.prototype.initialize = function(e) {
+    this.degree = e, this.genPoly = r.generateECPolynomial(this.degree);
+  }, o.prototype.encode = function(e) {
     if (!this.genPoly)
       throw new Error("Encoder not initialized");
-    const t = new Uint8Array(n.length + this.degree);
-    t.set(n);
-    const e = r.mod(t, this.genPoly), u = this.degree - e.length;
+    const t = new Uint8Array(e.length + this.degree);
+    t.set(e);
+    const n = r.mod(t, this.genPoly), u = this.degree - n.length;
     if (u > 0) {
       const a = new Uint8Array(this.degree);
-      return a.set(e, u), a;
+      return a.set(n, u), a;
     }
-    return e;
+    return n;
   }, rt = o, rt;
 }
-var ot = {}, it = {}, ut = {}, qt;
-function xt() {
-  return qt || (qt = 1, ut.isValid = function(o) {
+var ot = {}, it = {}, ut = {}, Dt;
+function Zt() {
+  return Dt || (Dt = 1, ut.isValid = function(o) {
     return !isNaN(o) && o >= 1 && o <= 40;
   }), ut;
 }
-var L = {}, Ut;
-function $t() {
-  if (Ut) return L;
-  Ut = 1;
+var L = {}, vt;
+function Xt() {
+  if (vt) return L;
+  vt = 1;
   const r = "[0-9]+", o = "[A-Z $%*+\\-./:]+";
   let i = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
   i = i.replace(/u/g, "\\u");
-  const n = "(?:(?![A-Z0-9 $%*+\\-./:]|" + i + `)(?:.|[\r
+  const e = "(?:(?![A-Z0-9 $%*+\\-./:]|" + i + `)(?:.|[\r
 ]))+`;
-  L.KANJI = new RegExp(i, "g"), L.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), L.BYTE = new RegExp(n, "g"), L.NUMERIC = new RegExp(r, "g"), L.ALPHANUMERIC = new RegExp(o, "g");
-  const t = new RegExp("^" + i + "$"), e = new RegExp("^" + r + "$"), u = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+  L.KANJI = new RegExp(i, "g"), L.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), L.BYTE = new RegExp(e, "g"), L.NUMERIC = new RegExp(r, "g"), L.ALPHANUMERIC = new RegExp(o, "g");
+  const t = new RegExp("^" + i + "$"), n = new RegExp("^" + r + "$"), u = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
   return L.testKanji = function(s) {
     return t.test(s);
   }, L.testNumeric = function(s) {
-    return e.test(s);
+    return n.test(s);
   }, L.testAlphanumeric = function(s) {
     return u.test(s);
   }, L;
 }
-var Ft;
-function _() {
-  return Ft || (Ft = 1, function(r) {
-    const o = xt(), i = $t();
+var Ut;
+function F() {
+  return Ut || (Ut = 1, (function(r) {
+    const o = Zt(), i = Xt();
     r.NUMERIC = {
       id: "Numeric",
       bit: 1,
@@ -769,20 +769,20 @@ function _() {
       ccBits: [8, 10, 12]
     }, r.MIXED = {
       bit: -1
-    }, r.getCharCountIndicator = function(e, u) {
-      if (!e.ccBits) throw new Error("Invalid mode: " + e);
+    }, r.getCharCountIndicator = function(n, u) {
+      if (!n.ccBits) throw new Error("Invalid mode: " + n);
       if (!o.isValid(u))
         throw new Error("Invalid version: " + u);
-      return u >= 1 && u < 10 ? e.ccBits[0] : u < 27 ? e.ccBits[1] : e.ccBits[2];
-    }, r.getBestModeForData = function(e) {
-      return i.testNumeric(e) ? r.NUMERIC : i.testAlphanumeric(e) ? r.ALPHANUMERIC : i.testKanji(e) ? r.KANJI : r.BYTE;
-    }, r.toString = function(e) {
-      if (e && e.id) return e.id;
+      return u >= 1 && u < 10 ? n.ccBits[0] : u < 27 ? n.ccBits[1] : n.ccBits[2];
+    }, r.getBestModeForData = function(n) {
+      return i.testNumeric(n) ? r.NUMERIC : i.testAlphanumeric(n) ? r.ALPHANUMERIC : i.testKanji(n) ? r.KANJI : r.BYTE;
+    }, r.toString = function(n) {
+      if (n && n.id) return n.id;
       throw new Error("Invalid mode");
-    }, r.isValid = function(e) {
-      return e && e.bit && e.ccBits;
+    }, r.isValid = function(n) {
+      return n && n.bit && n.ccBits;
     };
-    function n(t) {
+    function e(t) {
       if (typeof t != "string")
         throw new Error("Param is not a string");
       switch (t.toLowerCase()) {
@@ -798,21 +798,21 @@ function _() {
           throw new Error("Unknown mode: " + t);
       }
     }
-    r.from = function(e, u) {
-      if (r.isValid(e))
-        return e;
+    r.from = function(n, u) {
+      if (r.isValid(n))
+        return n;
       try {
-        return n(e);
+        return e(n);
       } catch {
         return u;
       }
     };
-  }(it)), it;
+  })(it)), it;
 }
 var _t;
-function he() {
-  return _t || (_t = 1, function(r) {
-    const o = F(), i = Xt(), n = Et(), t = _(), e = xt(), u = 7973, a = o.getBCHDigit(u);
+function de() {
+  return _t || (_t = 1, (function(r) {
+    const o = _(), i = Wt(), e = Ct(), t = F(), n = Zt(), u = 7973, a = o.getBCHDigit(u);
     function s(h, f, N) {
       for (let M = 1; M <= 40; M++)
         if (f <= r.getCapacity(M, N, h))
@@ -834,28 +834,28 @@ function he() {
           return N;
     }
     r.from = function(f, N) {
-      return e.isValid(f) ? parseInt(f, 10) : N;
+      return n.isValid(f) ? parseInt(f, 10) : N;
     }, r.getCapacity = function(f, N, M) {
-      if (!e.isValid(f))
+      if (!n.isValid(f))
         throw new Error("Invalid QR Code version");
       typeof M > "u" && (M = t.BYTE);
       const S = o.getSymbolTotalCodewords(f), R = i.getTotalCodewordsCount(f, N), P = (S - R) * 8;
       if (M === t.MIXED) return P;
-      const I = P - c(M, f);
+      const T = P - c(M, f);
       switch (M) {
         case t.NUMERIC:
-          return Math.floor(I / 10 * 3);
+          return Math.floor(T / 10 * 3);
         case t.ALPHANUMERIC:
-          return Math.floor(I / 11 * 2);
+          return Math.floor(T / 11 * 2);
         case t.KANJI:
-          return Math.floor(I / 13);
+          return Math.floor(T / 13);
         case t.BYTE:
         default:
-          return Math.floor(I / 8);
+          return Math.floor(T / 8);
       }
     }, r.getBestVersionForData = function(f, N) {
       let M;
-      const S = n.from(N, n.M);
+      const S = e.from(N, e.M);
       if (Array.isArray(f)) {
         if (f.length > 1)
           return B(f, S);
@@ -866,55 +866,55 @@ function he() {
         M = f;
       return s(M.mode, M.getLength(), S);
     }, r.getEncodedBits = function(f) {
-      if (!e.isValid(f) || f < 7)
+      if (!n.isValid(f) || f < 7)
         throw new Error("Invalid QR Code version");
       let N = f << 12;
       for (; o.getBCHDigit(N) - a >= 0; )
         N ^= u << o.getBCHDigit(N) - a;
       return f << 12 | N;
     };
-  }(ot)), ot;
+  })(ot)), ot;
 }
-var st = {}, kt;
-function me() {
-  if (kt) return st;
-  kt = 1;
-  const r = F(), o = 1335, i = 21522, n = r.getBCHDigit(o);
-  return st.getEncodedBits = function(e, u) {
-    const a = e.bit << 3 | u;
+var st = {}, Ft;
+function ge() {
+  if (Ft) return st;
+  Ft = 1;
+  const r = _(), o = 1335, i = 21522, e = r.getBCHDigit(o);
+  return st.getEncodedBits = function(n, u) {
+    const a = n.bit << 3 | u;
     let s = a << 10;
-    for (; r.getBCHDigit(s) - n >= 0; )
-      s ^= o << r.getBCHDigit(s) - n;
+    for (; r.getBCHDigit(s) - e >= 0; )
+      s ^= o << r.getBCHDigit(s) - e;
     return (a << 10 | s) ^ i;
   }, st;
 }
-var at = {}, ct, zt;
-function we() {
-  if (zt) return ct;
-  zt = 1;
-  const r = _();
+var at = {}, ct, kt;
+function he() {
+  if (kt) return ct;
+  kt = 1;
+  const r = F();
   function o(i) {
     this.mode = r.NUMERIC, this.data = i.toString();
   }
-  return o.getBitsLength = function(n) {
-    return 10 * Math.floor(n / 3) + (n % 3 ? n % 3 * 3 + 1 : 0);
+  return o.getBitsLength = function(e) {
+    return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
   }, o.prototype.getLength = function() {
     return this.data.length;
   }, o.prototype.getBitsLength = function() {
     return o.getBitsLength(this.data.length);
-  }, o.prototype.write = function(n) {
-    let t, e, u;
+  }, o.prototype.write = function(e) {
+    let t, n, u;
     for (t = 0; t + 3 <= this.data.length; t += 3)
-      e = this.data.substr(t, 3), u = parseInt(e, 10), n.put(u, 10);
+      n = this.data.substr(t, 3), u = parseInt(n, 10), e.put(u, 10);
     const a = this.data.length - t;
-    a > 0 && (e = this.data.substr(t), u = parseInt(e, 10), n.put(u, a * 3 + 1));
+    a > 0 && (n = this.data.substr(t), u = parseInt(n, 10), e.put(u, a * 3 + 1));
   }, ct = o, ct;
 }
-var ft, Vt;
-function Ce() {
-  if (Vt) return ft;
-  Vt = 1;
-  const r = _(), o = [
+var ft, zt;
+function me() {
+  if (zt) return ft;
+  zt = 1;
+  const r = F(), o = [
     "0",
     "1",
     "2",
@@ -961,8 +961,8 @@ function Ce() {
     "/",
     ":"
   ];
-  function i(n) {
-    this.mode = r.ALPHANUMERIC, this.data = n;
+  function i(e) {
+    this.mode = r.ALPHANUMERIC, this.data = e;
   }
   return i.getBitsLength = function(t) {
     return 11 * Math.floor(t / 2) + 6 * (t % 2);
@@ -971,70 +971,40 @@ function Ce() {
   }, i.prototype.getBitsLength = function() {
     return i.getBitsLength(this.data.length);
   }, i.prototype.write = function(t) {
-    let e;
-    for (e = 0; e + 2 <= this.data.length; e += 2) {
-      let u = o.indexOf(this.data[e]) * 45;
-      u += o.indexOf(this.data[e + 1]), t.put(u, 11);
+    let n;
+    for (n = 0; n + 2 <= this.data.length; n += 2) {
+      let u = o.indexOf(this.data[n]) * 45;
+      u += o.indexOf(this.data[n + 1]), t.put(u, 11);
     }
-    this.data.length % 2 && t.put(o.indexOf(this.data[e]), 6);
+    this.data.length % 2 && t.put(o.indexOf(this.data[n]), 6);
   }, ft = i, ft;
 }
-var lt, Kt;
-function Ee() {
-  return Kt || (Kt = 1, lt = function(o) {
-    for (var i = [], n = o.length, t = 0; t < n; t++) {
-      var e = o.charCodeAt(t);
-      if (e >= 55296 && e <= 56319 && n > t + 1) {
-        var u = o.charCodeAt(t + 1);
-        u >= 56320 && u <= 57343 && (e = (e - 55296) * 1024 + u - 56320 + 65536, t += 1);
-      }
-      if (e < 128) {
-        i.push(e);
-        continue;
-      }
-      if (e < 2048) {
-        i.push(e >> 6 | 192), i.push(e & 63 | 128);
-        continue;
-      }
-      if (e < 55296 || e >= 57344 && e < 65536) {
-        i.push(e >> 12 | 224), i.push(e >> 6 & 63 | 128), i.push(e & 63 | 128);
-        continue;
-      }
-      if (e >= 65536 && e <= 1114111) {
-        i.push(e >> 18 | 240), i.push(e >> 12 & 63 | 128), i.push(e >> 6 & 63 | 128), i.push(e & 63 | 128);
-        continue;
-      }
-      i.push(239, 191, 189);
-    }
-    return new Uint8Array(i).buffer;
-  }), lt;
-}
-var dt, Ht;
-function ye() {
-  if (Ht) return dt;
-  Ht = 1;
-  const r = Ee(), o = _();
-  function i(n) {
-    this.mode = o.BYTE, typeof n == "string" && (n = r(n)), this.data = new Uint8Array(n);
+var lt, Vt;
+function we() {
+  if (Vt) return lt;
+  Vt = 1;
+  const r = F();
+  function o(i) {
+    this.mode = r.BYTE, typeof i == "string" ? this.data = new TextEncoder().encode(i) : this.data = new Uint8Array(i);
   }
-  return i.getBitsLength = function(t) {
-    return t * 8;
-  }, i.prototype.getLength = function() {
+  return o.getBitsLength = function(e) {
+    return e * 8;
+  }, o.prototype.getLength = function() {
     return this.data.length;
-  }, i.prototype.getBitsLength = function() {
-    return i.getBitsLength(this.data.length);
-  }, i.prototype.write = function(n) {
-    for (let t = 0, e = this.data.length; t < e; t++)
-      n.put(this.data[t], 8);
-  }, dt = i, dt;
+  }, o.prototype.getBitsLength = function() {
+    return o.getBitsLength(this.data.length);
+  }, o.prototype.write = function(i) {
+    for (let e = 0, t = this.data.length; e < t; e++)
+      i.put(this.data[e], 8);
+  }, lt = o, lt;
 }
-var gt, Jt;
-function Be() {
-  if (Jt) return gt;
-  Jt = 1;
-  const r = _(), o = F();
-  function i(n) {
-    this.mode = r.KANJI, this.data = n;
+var dt, Kt;
+function Ce() {
+  if (Kt) return dt;
+  Kt = 1;
+  const r = F(), o = _();
+  function i(e) {
+    this.mode = r.KANJI, this.data = e;
   }
   return i.getBitsLength = function(t) {
     return t * 13;
@@ -1042,52 +1012,52 @@ function Be() {
     return this.data.length;
   }, i.prototype.getBitsLength = function() {
     return i.getBitsLength(this.data.length);
-  }, i.prototype.write = function(n) {
+  }, i.prototype.write = function(e) {
     let t;
     for (t = 0; t < this.data.length; t++) {
-      let e = o.toSJIS(this.data[t]);
-      if (e >= 33088 && e <= 40956)
-        e -= 33088;
-      else if (e >= 57408 && e <= 60351)
-        e -= 49472;
+      let n = o.toSJIS(this.data[t]);
+      if (n >= 33088 && n <= 40956)
+        n -= 33088;
+      else if (n >= 57408 && n <= 60351)
+        n -= 49472;
       else
         throw new Error(
           "Invalid SJIS character: " + this.data[t] + `
 Make sure your charset is UTF-8`
         );
-      e = (e >>> 8 & 255) * 192 + (e & 255), n.put(e, 13);
+      n = (n >>> 8 & 255) * 192 + (n & 255), e.put(n, 13);
     }
-  }, gt = i, gt;
+  }, dt = i, dt;
 }
-var ht = { exports: {} }, Yt;
-function pe() {
-  return Yt || (Yt = 1, function(r) {
+var gt = { exports: {} }, Ht;
+function Ee() {
+  return Ht || (Ht = 1, (function(r) {
     var o = {
-      single_source_shortest_paths: function(i, n, t) {
-        var e = {}, u = {};
-        u[n] = 0;
+      single_source_shortest_paths: function(i, e, t) {
+        var n = {}, u = {};
+        u[e] = 0;
         var a = o.PriorityQueue.make();
-        a.push(n, 0);
+        a.push(e, 0);
         for (var s, c, d, B, h, f, N, M, S; !a.empty(); ) {
           s = a.pop(), c = s.value, B = s.cost, h = i[c] || {};
           for (d in h)
-            h.hasOwnProperty(d) && (f = h[d], N = B + f, M = u[d], S = typeof u[d] > "u", (S || M > N) && (u[d] = N, a.push(d, N), e[d] = c));
+            h.hasOwnProperty(d) && (f = h[d], N = B + f, M = u[d], S = typeof u[d] > "u", (S || M > N) && (u[d] = N, a.push(d, N), n[d] = c));
         }
         if (typeof t < "u" && typeof u[t] > "u") {
-          var R = ["Could not find a path from ", n, " to ", t, "."].join("");
+          var R = ["Could not find a path from ", e, " to ", t, "."].join("");
           throw new Error(R);
         }
-        return e;
+        return n;
       },
-      extract_shortest_path_from_predecessor_list: function(i, n) {
-        for (var t = [], e = n; e; )
-          t.push(e), i[e], e = i[e];
+      extract_shortest_path_from_predecessor_list: function(i, e) {
+        for (var t = [], n = e; n; )
+          t.push(n), i[n], n = i[n];
         return t.reverse(), t;
       },
-      find_path: function(i, n, t) {
-        var e = o.single_source_shortest_paths(i, n, t);
+      find_path: function(i, e, t) {
+        var n = o.single_source_shortest_paths(i, e, t);
         return o.extract_shortest_path_from_predecessor_list(
-          e,
+          n,
           t
         );
       },
@@ -1096,21 +1066,21 @@ function pe() {
        */
       PriorityQueue: {
         make: function(i) {
-          var n = o.PriorityQueue, t = {}, e;
+          var e = o.PriorityQueue, t = {}, n;
           i = i || {};
-          for (e in n)
-            n.hasOwnProperty(e) && (t[e] = n[e]);
-          return t.queue = [], t.sorter = i.sorter || n.default_sorter, t;
+          for (n in e)
+            e.hasOwnProperty(n) && (t[n] = e[n]);
+          return t.queue = [], t.sorter = i.sorter || e.default_sorter, t;
         },
-        default_sorter: function(i, n) {
-          return i.cost - n.cost;
+        default_sorter: function(i, e) {
+          return i.cost - e.cost;
         },
         /**
          * Add a new item to the queue and ensure the highest priority element
          * is at the front of the queue.
          */
-        push: function(i, n) {
-          var t = { value: i, cost: n };
+        push: function(i, e) {
+          var t = { value: i, cost: e };
           this.queue.push(t), this.queue.sort(this.sorter);
         },
         /**
@@ -1125,19 +1095,19 @@ function pe() {
       }
     };
     r.exports = o;
-  }(ht)), ht.exports;
+  })(gt)), gt.exports;
 }
-var jt;
-function Ae() {
-  return jt || (jt = 1, function(r) {
-    const o = _(), i = we(), n = Ce(), t = ye(), e = Be(), u = $t(), a = F(), s = pe();
+var Jt;
+function ye() {
+  return Jt || (Jt = 1, (function(r) {
+    const o = F(), i = he(), e = me(), t = we(), n = Ce(), u = Xt(), a = _(), s = Ee();
     function c(R) {
       return unescape(encodeURIComponent(R)).length;
     }
-    function d(R, P, I) {
+    function d(R, P, T) {
       const p = [];
       let b;
-      for (; (b = R.exec(I)) !== null; )
+      for (; (b = R.exec(T)) !== null; )
         p.push({
           data: b[0],
           index: b.index,
@@ -1147,9 +1117,9 @@ function Ae() {
       return p;
     }
     function B(R) {
-      const P = d(u.NUMERIC, o.NUMERIC, R), I = d(u.ALPHANUMERIC, o.ALPHANUMERIC, R);
+      const P = d(u.NUMERIC, o.NUMERIC, R), T = d(u.ALPHANUMERIC, o.ALPHANUMERIC, R);
       let p, b;
-      return a.isKanjiModeEnabled() ? (p = d(u.BYTE, o.BYTE, R), b = d(u.KANJI, o.KANJI, R)) : (p = d(u.BYTE_KANJI, o.BYTE, R), b = []), P.concat(I, p, b).sort(function(E, C) {
+      return a.isKanjiModeEnabled() ? (p = d(u.BYTE, o.BYTE, R), b = d(u.KANJI, o.KANJI, R)) : (p = d(u.BYTE_KANJI, o.BYTE, R), b = []), P.concat(T, p, b).sort(function(E, C) {
         return E.index - C.index;
       }).map(function(E) {
         return {
@@ -1164,23 +1134,23 @@ function Ae() {
         case o.NUMERIC:
           return i.getBitsLength(R);
         case o.ALPHANUMERIC:
-          return n.getBitsLength(R);
-        case o.KANJI:
           return e.getBitsLength(R);
+        case o.KANJI:
+          return n.getBitsLength(R);
         case o.BYTE:
           return t.getBitsLength(R);
       }
     }
     function f(R) {
-      return R.reduce(function(P, I) {
+      return R.reduce(function(P, T) {
         const p = P.length - 1 >= 0 ? P[P.length - 1] : null;
-        return p && p.mode === I.mode ? (P[P.length - 1].data += I.data, P) : (P.push(I), P);
+        return p && p.mode === T.mode ? (P[P.length - 1].data += T.data, P) : (P.push(T), P);
       }, []);
     }
     function N(R) {
       const P = [];
-      for (let I = 0; I < R.length; I++) {
-        const p = R[I];
+      for (let T = 0; T < R.length; T++) {
+        const p = R[T];
         switch (p.mode) {
           case o.NUMERIC:
             P.push([
@@ -1210,47 +1180,47 @@ function Ae() {
       return P;
     }
     function M(R, P) {
-      const I = {}, p = { start: {} };
+      const T = {}, p = { start: {} };
       let b = ["start"];
       for (let g = 0; g < R.length; g++) {
         const E = R[g], C = [];
         for (let l = 0; l < E.length; l++) {
           const A = E[l], m = "" + g + l;
-          C.push(m), I[m] = { node: A, lastCount: 0 }, p[m] = {};
+          C.push(m), T[m] = { node: A, lastCount: 0 }, p[m] = {};
           for (let y = 0; y < b.length; y++) {
             const w = b[y];
-            I[w] && I[w].node.mode === A.mode ? (p[w][m] = h(I[w].lastCount + A.length, A.mode) - h(I[w].lastCount, A.mode), I[w].lastCount += A.length) : (I[w] && (I[w].lastCount = A.length), p[w][m] = h(A.length, A.mode) + 4 + o.getCharCountIndicator(A.mode, P));
+            T[w] && T[w].node.mode === A.mode ? (p[w][m] = h(T[w].lastCount + A.length, A.mode) - h(T[w].lastCount, A.mode), T[w].lastCount += A.length) : (T[w] && (T[w].lastCount = A.length), p[w][m] = h(A.length, A.mode) + 4 + o.getCharCountIndicator(A.mode, P));
           }
         }
         b = C;
       }
       for (let g = 0; g < b.length; g++)
         p[b[g]].end = 0;
-      return { map: p, table: I };
+      return { map: p, table: T };
     }
     function S(R, P) {
-      let I;
+      let T;
       const p = o.getBestModeForData(R);
-      if (I = o.from(P, p), I !== o.BYTE && I.bit < p.bit)
-        throw new Error('"' + R + '" cannot be encoded with mode ' + o.toString(I) + `.
+      if (T = o.from(P, p), T !== o.BYTE && T.bit < p.bit)
+        throw new Error('"' + R + '" cannot be encoded with mode ' + o.toString(T) + `.
  Suggested mode is: ` + o.toString(p));
-      switch (I === o.KANJI && !a.isKanjiModeEnabled() && (I = o.BYTE), I) {
+      switch (T === o.KANJI && !a.isKanjiModeEnabled() && (T = o.BYTE), T) {
         case o.NUMERIC:
           return new i(R);
         case o.ALPHANUMERIC:
-          return new n(R);
-        case o.KANJI:
           return new e(R);
+        case o.KANJI:
+          return new n(R);
         case o.BYTE:
           return new t(R);
       }
     }
     r.fromArray = function(P) {
-      return P.reduce(function(I, p) {
-        return typeof p == "string" ? I.push(S(p, null)) : p.data && I.push(S(p.data, p.mode)), I;
+      return P.reduce(function(T, p) {
+        return typeof p == "string" ? T.push(S(p, null)) : p.data && T.push(S(p.data, p.mode)), T;
       }, []);
-    }, r.fromString = function(P, I) {
-      const p = B(P, a.isKanjiModeEnabled()), b = N(p), g = M(b, I), E = s.find_path(g.map, "start", "end"), C = [];
+    }, r.fromString = function(P, T) {
+      const p = B(P, a.isKanjiModeEnabled()), b = N(p), g = M(b, T), E = s.find_path(g.map, "start", "end"), C = [];
       for (let l = 1; l < E.length - 1; l++)
         C.push(g.table[E[l]].node);
       return r.fromArray(f(C));
@@ -1259,21 +1229,21 @@ function Ae() {
         B(P, a.isKanjiModeEnabled())
       );
     };
-  }(at)), at;
+  })(at)), at;
 }
-var Ot;
-function Re() {
-  if (Ot) return W;
-  Ot = 1;
-  const r = F(), o = Et(), i = ue(), n = se(), t = ae(), e = ce(), u = fe(), a = Xt(), s = ge(), c = he(), d = me(), B = _(), h = Ae();
+var Yt;
+function Be() {
+  if (Yt) return W;
+  Yt = 1;
+  const r = _(), o = Ct(), i = oe(), e = ie(), t = ue(), n = se(), u = ae(), a = Wt(), s = le(), c = de(), d = ge(), B = F(), h = ye();
   function f(g, E) {
-    const C = g.size, l = e.getPositions(E);
+    const C = g.size, l = n.getPositions(E);
     for (let A = 0; A < l.length; A++) {
       const m = l[A][0], y = l[A][1];
       for (let w = -1; w <= 7; w++)
         if (!(m + w <= -1 || C <= m + w))
-          for (let T = -1; T <= 7; T++)
-            y + T <= -1 || C <= y + T || (w >= 0 && w <= 6 && (T === 0 || T === 6) || T >= 0 && T <= 6 && (w === 0 || w === 6) || w >= 2 && w <= 4 && T >= 2 && T <= 4 ? g.set(m + w, y + T, !0, !0) : g.set(m + w, y + T, !1, !0));
+          for (let I = -1; I <= 7; I++)
+            y + I <= -1 || C <= y + I || (w >= 0 && w <= 6 && (I === 0 || I === 6) || I >= 0 && I <= 6 && (w === 0 || w === 6) || w >= 2 && w <= 4 && I >= 2 && I <= 4 ? g.set(m + w, y + I, !0, !0) : g.set(m + w, y + I, !1, !0));
     }
   }
   function N(g) {
@@ -1310,10 +1280,10 @@ function Re() {
     let l = -1, A = C - 1, m = 7, y = 0;
     for (let w = C - 1; w > 0; w -= 2)
       for (w === 6 && w--; ; ) {
-        for (let T = 0; T < 2; T++)
-          if (!g.isReserved(A, w - T)) {
-            let q = !1;
-            y < E.length && (q = (E[y] >>> m & 1) === 1), g.set(A, w - T, q), m--, m === -1 && (y++, m = 7);
+        for (let I = 0; I < 2; I++)
+          if (!g.isReserved(A, w - I)) {
+            let v = !1;
+            y < E.length && (v = (E[y] >>> m & 1) === 1), g.set(A, w - I, v), m--, m === -1 && (y++, m = 7);
           }
         if (A += l, A < 0 || C <= A) {
           A -= l, l = -l;
@@ -1321,37 +1291,37 @@ function Re() {
         }
       }
   }
-  function I(g, E, C) {
+  function T(g, E, C) {
     const l = new i();
-    C.forEach(function(T) {
-      l.put(T.mode.bit, 4), l.put(T.getLength(), B.getCharCountIndicator(T.mode, g)), T.write(l);
+    C.forEach(function(I) {
+      l.put(I.mode.bit, 4), l.put(I.getLength(), B.getCharCountIndicator(I.mode, g)), I.write(l);
     });
     const A = r.getSymbolTotalCodewords(g), m = a.getTotalCodewordsCount(g, E), y = (A - m) * 8;
     for (l.getLengthInBits() + 4 <= y && l.put(0, 4); l.getLengthInBits() % 8 !== 0; )
       l.putBit(0);
     const w = (y - l.getLengthInBits()) / 8;
-    for (let T = 0; T < w; T++)
-      l.put(T % 2 ? 17 : 236, 8);
+    for (let I = 0; I < w; I++)
+      l.put(I % 2 ? 17 : 236, 8);
     return p(l, g, E);
   }
   function p(g, E, C) {
-    const l = r.getSymbolTotalCodewords(E), A = a.getTotalCodewordsCount(E, C), m = l - A, y = a.getBlocksCount(E, C), w = l % y, T = y - w, q = Math.floor(l / y), V = Math.floor(m / y), ee = V + 1, yt = q - V, ne = new s(yt);
+    const l = r.getSymbolTotalCodewords(E), A = a.getTotalCodewordsCount(E, C), m = l - A, y = a.getBlocksCount(E, C), w = l % y, I = y - w, v = Math.floor(l / y), V = Math.floor(m / y), $t = V + 1, Et = v - V, te = new s(Et);
     let Y = 0;
-    const H = new Array(y), Bt = new Array(y);
+    const H = new Array(y), yt = new Array(y);
     let j = 0;
-    const re = new Uint8Array(g.buffer);
+    const ee = new Uint8Array(g.buffer);
     for (let k = 0; k < y; k++) {
-      const G = k < T ? V : ee;
-      H[k] = re.slice(Y, Y + G), Bt[k] = ne.encode(H[k]), Y += G, j = Math.max(j, G);
+      const G = k < I ? V : $t;
+      H[k] = ee.slice(Y, Y + G), yt[k] = te.encode(H[k]), Y += G, j = Math.max(j, G);
     }
     const O = new Uint8Array(l);
-    let pt = 0, D, v;
-    for (D = 0; D < j; D++)
-      for (v = 0; v < y; v++)
-        D < H[v].length && (O[pt++] = H[v][D]);
-    for (D = 0; D < yt; D++)
-      for (v = 0; v < y; v++)
-        O[pt++] = Bt[v][D];
+    let Bt = 0, q, D;
+    for (q = 0; q < j; q++)
+      for (D = 0; D < y; D++)
+        q < H[D].length && (O[Bt++] = H[D][q]);
+    for (q = 0; q < Et; q++)
+      for (D = 0; D < y; D++)
+        O[Bt++] = yt[D][q];
     return O;
   }
   function b(g, E, C, l) {
@@ -1359,12 +1329,12 @@ function Re() {
     if (Array.isArray(g))
       A = h.fromArray(g);
     else if (typeof g == "string") {
-      let q = E;
-      if (!q) {
+      let v = E;
+      if (!v) {
         const V = h.rawSplit(g);
-        q = c.getBestVersionForData(V, C);
+        v = c.getBestVersionForData(V, C);
       }
-      A = h.fromString(g, q || 40);
+      A = h.fromString(g, v || 40);
     } else
       throw new Error("Invalid data");
     const m = c.getBestVersionForData(A, C);
@@ -1379,12 +1349,12 @@ The chosen QR Code version cannot contain this amount of data.
 Minimum version required to store current data is: ` + m + `.
 `
       );
-    const y = I(E, C, A), w = r.getSymbolSize(E), T = new n(w);
-    return f(T, E), N(T), M(T, E), R(T, C, 0), E >= 7 && S(T, E), P(T, y), isNaN(l) && (l = u.getBestMask(
-      T,
-      R.bind(null, T, C)
-    )), u.applyMask(l, T), R(T, C, l), {
-      modules: T,
+    const y = T(E, C, A), w = r.getSymbolSize(E), I = new e(w);
+    return f(I, E), N(I), M(I, E), R(I, C, 0), E >= 7 && S(I, E), P(I, y), isNaN(l) && (l = u.getBestMask(
+      I,
+      R.bind(null, I, C)
+    )), u.applyMask(l, I), R(I, C, l), {
+      modules: I,
       version: E,
       errorCorrectionLevel: C,
       maskPattern: l,
@@ -1398,120 +1368,120 @@ Minimum version required to store current data is: ` + m + `.
     return typeof C < "u" && (l = o.from(C.errorCorrectionLevel, o.M), A = c.from(C.version), m = u.from(C.maskPattern), C.toSJISFunc && r.setToSJISFunction(C.toSJISFunc)), b(E, A, l, m);
   }, W;
 }
-var mt = {}, wt = {}, Gt;
-function te() {
-  return Gt || (Gt = 1, function(r) {
+var ht = {}, mt = {}, jt;
+function xt() {
+  return jt || (jt = 1, (function(r) {
     function o(i) {
       if (typeof i == "number" && (i = i.toString()), typeof i != "string")
         throw new Error("Color should be defined as hex string");
-      let n = i.slice().replace("#", "").split("");
-      if (n.length < 3 || n.length === 5 || n.length > 8)
+      let e = i.slice().replace("#", "").split("");
+      if (e.length < 3 || e.length === 5 || e.length > 8)
         throw new Error("Invalid hex color: " + i);
-      (n.length === 3 || n.length === 4) && (n = Array.prototype.concat.apply([], n.map(function(e) {
-        return [e, e];
-      }))), n.length === 6 && n.push("F", "F");
-      const t = parseInt(n.join(""), 16);
+      (e.length === 3 || e.length === 4) && (e = Array.prototype.concat.apply([], e.map(function(n) {
+        return [n, n];
+      }))), e.length === 6 && e.push("F", "F");
+      const t = parseInt(e.join(""), 16);
       return {
         r: t >> 24 & 255,
         g: t >> 16 & 255,
         b: t >> 8 & 255,
         a: t & 255,
-        hex: "#" + n.slice(0, 6).join("")
+        hex: "#" + e.slice(0, 6).join("")
       };
     }
-    r.getOptions = function(n) {
-      n || (n = {}), n.color || (n.color = {});
-      const t = typeof n.margin > "u" || n.margin === null || n.margin < 0 ? 4 : n.margin, e = n.width && n.width >= 21 ? n.width : void 0, u = n.scale || 4;
+    r.getOptions = function(e) {
+      e || (e = {}), e.color || (e.color = {});
+      const t = typeof e.margin > "u" || e.margin === null || e.margin < 0 ? 4 : e.margin, n = e.width && e.width >= 21 ? e.width : void 0, u = e.scale || 4;
       return {
-        width: e,
-        scale: e ? 4 : u,
+        width: n,
+        scale: n ? 4 : u,
         margin: t,
         color: {
-          dark: o(n.color.dark || "#000000ff"),
-          light: o(n.color.light || "#ffffffff")
+          dark: o(e.color.dark || "#000000ff"),
+          light: o(e.color.light || "#ffffffff")
         },
-        type: n.type,
-        rendererOpts: n.rendererOpts || {}
+        type: e.type,
+        rendererOpts: e.rendererOpts || {}
       };
-    }, r.getScale = function(n, t) {
-      return t.width && t.width >= n + t.margin * 2 ? t.width / (n + t.margin * 2) : t.scale;
-    }, r.getImageWidth = function(n, t) {
-      const e = r.getScale(n, t);
-      return Math.floor((n + t.margin * 2) * e);
-    }, r.qrToImageData = function(n, t, e) {
-      const u = t.modules.size, a = t.modules.data, s = r.getScale(u, e), c = Math.floor((u + e.margin * 2) * s), d = e.margin * s, B = [e.color.light, e.color.dark];
+    }, r.getScale = function(e, t) {
+      return t.width && t.width >= e + t.margin * 2 ? t.width / (e + t.margin * 2) : t.scale;
+    }, r.getImageWidth = function(e, t) {
+      const n = r.getScale(e, t);
+      return Math.floor((e + t.margin * 2) * n);
+    }, r.qrToImageData = function(e, t, n) {
+      const u = t.modules.size, a = t.modules.data, s = r.getScale(u, n), c = Math.floor((u + n.margin * 2) * s), d = n.margin * s, B = [n.color.light, n.color.dark];
       for (let h = 0; h < c; h++)
         for (let f = 0; f < c; f++) {
-          let N = (h * c + f) * 4, M = e.color.light;
+          let N = (h * c + f) * 4, M = n.color.light;
           if (h >= d && f >= d && h < c - d && f < c - d) {
             const S = Math.floor((h - d) / s), R = Math.floor((f - d) / s);
             M = B[a[S * u + R] ? 1 : 0];
           }
-          n[N++] = M.r, n[N++] = M.g, n[N++] = M.b, n[N] = M.a;
+          e[N++] = M.r, e[N++] = M.g, e[N++] = M.b, e[N] = M.a;
         }
     };
-  }(wt)), wt;
+  })(mt)), mt;
 }
-var Qt;
-function Ie() {
-  return Qt || (Qt = 1, function(r) {
-    const o = te();
-    function i(t, e, u) {
-      t.clearRect(0, 0, e.width, e.height), e.style || (e.style = {}), e.height = u, e.width = u, e.style.height = u + "px", e.style.width = u + "px";
+var Ot;
+function pe() {
+  return Ot || (Ot = 1, (function(r) {
+    const o = xt();
+    function i(t, n, u) {
+      t.clearRect(0, 0, n.width, n.height), n.style || (n.style = {}), n.height = u, n.width = u, n.style.height = u + "px", n.style.width = u + "px";
     }
-    function n() {
+    function e() {
       try {
         return document.createElement("canvas");
       } catch {
         throw new Error("You need to specify a canvas element");
       }
     }
-    r.render = function(e, u, a) {
+    r.render = function(n, u, a) {
       let s = a, c = u;
-      typeof s > "u" && (!u || !u.getContext) && (s = u, u = void 0), u || (c = n()), s = o.getOptions(s);
-      const d = o.getImageWidth(e.modules.size, s), B = c.getContext("2d"), h = B.createImageData(d, d);
-      return o.qrToImageData(h.data, e, s), i(B, c, d), B.putImageData(h, 0, 0), c;
-    }, r.renderToDataURL = function(e, u, a) {
+      typeof s > "u" && (!u || !u.getContext) && (s = u, u = void 0), u || (c = e()), s = o.getOptions(s);
+      const d = o.getImageWidth(n.modules.size, s), B = c.getContext("2d"), h = B.createImageData(d, d);
+      return o.qrToImageData(h.data, n, s), i(B, c, d), B.putImageData(h, 0, 0), c;
+    }, r.renderToDataURL = function(n, u, a) {
       let s = a;
       typeof s > "u" && (!u || !u.getContext) && (s = u, u = void 0), s || (s = {});
-      const c = r.render(e, u, s), d = s.type || "image/png", B = s.rendererOpts || {};
+      const c = r.render(n, u, s), d = s.type || "image/png", B = s.rendererOpts || {};
       return c.toDataURL(d, B.quality);
     };
-  }(mt)), mt;
+  })(ht)), ht;
 }
-var Ct = {}, Wt;
-function Te() {
-  if (Wt) return Ct;
-  Wt = 1;
-  const r = te();
-  function o(t, e) {
-    const u = t.a / 255, a = e + '="' + t.hex + '"';
-    return u < 1 ? a + " " + e + '-opacity="' + u.toFixed(2).slice(1) + '"' : a;
+var wt = {}, Gt;
+function Ae() {
+  if (Gt) return wt;
+  Gt = 1;
+  const r = xt();
+  function o(t, n) {
+    const u = t.a / 255, a = n + '="' + t.hex + '"';
+    return u < 1 ? a + " " + n + '-opacity="' + u.toFixed(2).slice(1) + '"' : a;
   }
-  function i(t, e, u) {
-    let a = t + e;
+  function i(t, n, u) {
+    let a = t + n;
     return typeof u < "u" && (a += " " + u), a;
   }
-  function n(t, e, u) {
+  function e(t, n, u) {
     let a = "", s = 0, c = !1, d = 0;
     for (let B = 0; B < t.length; B++) {
-      const h = Math.floor(B % e), f = Math.floor(B / e);
-      !h && !c && (c = !0), t[B] ? (d++, B > 0 && h > 0 && t[B - 1] || (a += c ? i("M", h + u, 0.5 + f + u) : i("m", s, 0), s = 0, c = !1), h + 1 < e && t[B + 1] || (a += i("h", d), d = 0)) : s++;
+      const h = Math.floor(B % n), f = Math.floor(B / n);
+      !h && !c && (c = !0), t[B] ? (d++, B > 0 && h > 0 && t[B - 1] || (a += c ? i("M", h + u, 0.5 + f + u) : i("m", s, 0), s = 0, c = !1), h + 1 < n && t[B + 1] || (a += i("h", d), d = 0)) : s++;
     }
     return a;
   }
-  return Ct.render = function(e, u, a) {
-    const s = r.getOptions(u), c = e.modules.size, d = e.modules.data, B = c + s.margin * 2, h = s.color.light.a ? "<path " + o(s.color.light, "fill") + ' d="M0 0h' + B + "v" + B + 'H0z"/>' : "", f = "<path " + o(s.color.dark, "stroke") + ' d="' + n(d, c, s.margin) + '"/>', N = 'viewBox="0 0 ' + B + " " + B + '"', S = '<svg xmlns="http://www.w3.org/2000/svg" ' + (s.width ? 'width="' + s.width + '" height="' + s.width + '" ' : "") + N + ' shape-rendering="crispEdges">' + h + f + `</svg>
+  return wt.render = function(n, u, a) {
+    const s = r.getOptions(u), c = n.modules.size, d = n.modules.data, B = c + s.margin * 2, h = s.color.light.a ? "<path " + o(s.color.light, "fill") + ' d="M0 0h' + B + "v" + B + 'H0z"/>' : "", f = "<path " + o(s.color.dark, "stroke") + ' d="' + e(d, c, s.margin) + '"/>', N = 'viewBox="0 0 ' + B + " " + B + '"', S = '<svg xmlns="http://www.w3.org/2000/svg" ' + (s.width ? 'width="' + s.width + '" height="' + s.width + '" ' : "") + N + ' shape-rendering="crispEdges">' + h + f + `</svg>
 `;
     return typeof a == "function" && a(null, S), S;
-  }, Ct;
+  }, wt;
 }
-var Zt;
-function Ne() {
-  if (Zt) return z;
-  Zt = 1;
-  const r = ie(), o = Re(), i = Ie(), n = Te();
-  function t(e, u, a, s, c) {
+var Qt;
+function Re() {
+  if (Qt) return z;
+  Qt = 1;
+  const r = re(), o = Be(), i = pe(), e = Ae();
+  function t(n, u, a, s, c) {
     const d = [].slice.call(arguments, 1), B = d.length, h = typeof d[B - 1] == "function";
     if (!h && !r())
       throw new Error("Callback required as last argument");
@@ -1525,7 +1495,7 @@ function Ne() {
       return B === 1 ? (a = u, u = s = void 0) : B === 2 && !u.getContext && (s = a, a = u, u = void 0), new Promise(function(f, N) {
         try {
           const M = o.create(a, s);
-          f(e(M, u, s));
+          f(n(M, u, s));
         } catch (M) {
           N(M);
         }
@@ -1533,17 +1503,17 @@ function Ne() {
     }
     try {
       const f = o.create(a, s);
-      c(null, e(f, u, s));
+      c(null, n(f, u, s));
     } catch (f) {
       c(f);
     }
   }
-  return z.create = o.create, z.toCanvas = t.bind(null, i.render), z.toDataURL = t.bind(null, i.renderToDataURL), z.toString = t.bind(null, function(e, u, a) {
-    return n.render(e, a);
+  return z.create = o.create, z.toCanvas = t.bind(null, i.render), z.toDataURL = t.bind(null, i.renderToDataURL), z.toString = t.bind(null, function(n, u, a) {
+    return e.render(n, a);
   }), z;
 }
-var Me = Ne();
-const Se = /* @__PURE__ */ oe(Me);
+var Te = Re();
+const Ne = /* @__PURE__ */ ne(Te);
 export {
-  Se as q
+  Ne as q
 };