@lglab/react-qr-code 1.4.5 → 1.4.9

package/dist/index.es.js

@@ -1,42 +1,42 @@
-import { jsx as C, jsxs as K, Fragment as st } from "react/jsx-runtime";
-import { useMemo as v, useCallback as it, useId as at, forwardRef as ct, useRef as lt, useImperativeHandle as ht } from "react";
+import { jsx as C, jsxs as K, Fragment as rt } from "react/jsx-runtime";
+import { useMemo as L, useCallback as it, useId as at, forwardRef as ct, useRef as lt, useImperativeHandle as ht } from "react";
 const ut = /\.?0+$/;
-function dt(o) {
-  return o.toFixed(7).replace(ut, "");
+function dt(s) {
+  return s.toFixed(7).replace(ut, "");
 }
-const W = (o) => {
-  const a = o % 360 * (Math.PI / 180), c = Math.max(0, Math.min(100, 50 - 50 * Math.cos(a))), i = Math.max(0, Math.min(100, 50 - 50 * Math.sin(a))), r = Math.max(0, Math.min(100, 50 + 50 * Math.cos(a))), u = Math.max(0, Math.min(100, 50 + 50 * Math.sin(a)));
+const W = (s) => {
+  const a = s % 360 * (Math.PI / 180), c = Math.max(0, Math.min(100, 50 - 50 * Math.cos(a))), i = Math.max(0, Math.min(100, 50 - 50 * Math.sin(a))), o = Math.max(0, Math.min(100, 50 + 50 * Math.cos(a))), u = Math.max(0, Math.min(100, 50 + 50 * Math.sin(a)));
   return {
     x1: `${c}%`,
     y1: `${i}%`,
-    x2: `${r}%`,
+    x2: `${o}%`,
     y2: `${u}%`
   };
-}, J = (o, a, c, i) => {
-  const r = c / 2, u = r / 2, l = Math.PI / i;
-  let p = "";
+}, J = (s, a, c, i) => {
+  const o = c / 2, u = o / 2, l = Math.PI / i;
+  let m = "";
   for (let f = 0; f < 2 * i; f++) {
-    const e = f * l - Math.PI / 2, n = f % 2 === 0 ? r : u, t = o + n * Math.cos(e), s = a + n * Math.sin(e);
-    p += `${f === 0 ? "M" : "L"} ${t},${s} `;
+    const e = f * l - Math.PI / 2, n = f % 2 === 0 ? o : u, t = s + n * Math.cos(e), r = a + n * Math.sin(e);
+    m += `${f === 0 ? "M" : "L"} ${t},${r} `;
   }
-  return p + "Z";
-}, tt = (o, a, c, i) => `M ${o} ${a}Q ${o + i} ${a + c / 2}, ${o} ${a + c}Q ${o + c / 2} ${a + c - i}, ${o + c} ${a + c}Q ${o + c - i} ${a + c / 2}, ${o + c} ${a}Q ${o + c / 2} ${a + i}, ${o} ${a}Z`, et = (o, a, c) => {
+  return m + "Z";
+}, tt = (s, a, c, i) => `M ${s} ${a}Q ${s + i} ${a + c / 2}, ${s} ${a + c}Q ${s + c / 2} ${a + c - i}, ${s + c} ${a + c}Q ${s + c - i} ${a + c / 2}, ${s + c} ${a}Q ${s + c / 2} ${a + i}, ${s} ${a}Z`, et = (s, a, c) => {
   const i = c / 8;
-  return `M ${o + c} ${a + i * 3} 
+  return `M ${s + c} ${a + i * 3} 
    V ${a + i}
    h -${i}
    V ${a}
-   H ${o + i * 5}
+   H ${s + i * 5}
    v ${i}
-   H ${o + i * 3}
+   H ${s + i * 3}
    V ${a}
-   H ${o + i}
+   H ${s + i}
    v ${i}
-   H ${o}
+   H ${s}
    v ${i * 2}
    h ${i}
    v ${i * 2}
-   H ${o}
+   H ${s}
    v ${i * 2}
    h ${i}
    v ${i}
@@ -52,8 +52,8 @@ const W = (o) => {
    V ${a + i * 3}
    h ${i}
    Z`;
-}, ot = (o, a, c) => {
-  let i = !1, r = 0;
+}, nt = (s, a, c) => {
+  let i = !1, o = 0;
   return [
     "M",
     1,
@@ -165,18 +165,17 @@ const W = (o) => {
     1,
     0.3262506,
     "z"
-  ].map((u) => typeof u == "string" ? (r = 0, i = u.toUpperCase() == u, u) : (r++, u = u * c, i && (u += r % 2 == 1 ? o : a), dt(u))).join(" ");
-}, Q = {
+  ].map((u) => typeof u == "string" ? (o = 0, i = u.toUpperCase() == u, u) : (o++, u = u * c, i && (u += o % 2 == 1 ? s : a), dt(u))).join(" ");
+}, k = {
   "data-testid": "background"
-}, $t = ({ background: o, bgGradientId: a, numCells: c }) => {
-  var r, u;
-  if (!o)
+}, $t = ({ background: s, bgGradientId: a, numCells: c }) => {
+  if (!s)
     return null;
-  if (typeof o == "string")
-    return /* @__PURE__ */ C("path", { fill: o, d: `M0,0 h${c}v${c}H0z`, ...Q });
-  const i = W((o == null ? void 0 : o.rotation) || 0);
-  return /* @__PURE__ */ K(st, { children: [
-    /* @__PURE__ */ C("defs", { children: o.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: a, gradientUnits: "userSpaceOnUse", ...i, children: (r = o.stops) == null ? void 0 : r.map((l, p) => /* @__PURE__ */ C("stop", { offset: l.offset, stopColor: l.color }, p)) }) : /* @__PURE__ */ C(
+  if (typeof s == "string")
+    return /* @__PURE__ */ C("path", { fill: s, d: `M0,0 h${c}v${c}H0z`, ...k });
+  const i = W(s?.rotation || 0);
+  return /* @__PURE__ */ K(rt, { children: [
+    /* @__PURE__ */ C("defs", { children: s.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: a, gradientUnits: "userSpaceOnUse", ...i, children: s.stops?.map((o, u) => /* @__PURE__ */ C("stop", { offset: o.offset, stopColor: o.color }, u)) }) : /* @__PURE__ */ C(
       "radialGradient",
       {
         id: a,
@@ -184,7 +183,7 @@ const W = (o) => {
         cx: "50%",
         cy: "50%",
         r: "50%",
-        children: (u = o.stops) == null ? void 0 : u.map((l, p) => /* @__PURE__ */ C("stop", { offset: l.offset, stopColor: l.color }, p))
+        children: s.stops?.map((o, u) => /* @__PURE__ */ C("stop", { offset: o.offset, stopColor: o.color }, u))
       }
     ) }),
     /* @__PURE__ */ C(
@@ -192,28 +191,23 @@ const W = (o) => {
       {
         fill: `url(#${a})`,
         d: `M0,0 h${c}v${c}H0z`,
-        ...Q
+        ...k
       }
     )
   ] });
 };
-/**
- * @license QR Code generator library (TypeScript)
- * Copyright (c) Project Nayuki.
- * SPDX-License-Identifier: MIT
- */
 var S;
-((o) => {
+((s) => {
   const l = class l {
     /*-- Constructor (low level) and fields --*/
     // Creates a new QR Code with the given version number,
     // error correction level, data codeword bytes, and mask number.
     // This is a low-level API that most users should not use directly.
     // A mid-level API is the encodeSegments() function.
-    constructor(e, n, t, s) {
+    constructor(e, n, t, r) {
       if (this.version = e, this.errorCorrectionLevel = n, this.modules = [], this.isFunction = [], e < l.MIN_VERSION || e > l.MAX_VERSION)
         throw new RangeError("Version value out of range");
-      if (s < -1 || s > 7)
+      if (r < -1 || r > 7)
         throw new RangeError("Mask value out of range");
       this.size = e * 4 + 17;
       let h = [];
@@ -223,15 +217,15 @@ var S;
         this.modules.push(h.slice()), this.isFunction.push(h.slice());
       this.drawFunctionPatterns();
       const $ = this.addEccAndInterleave(t);
-      if (this.drawCodewords($), s == -1) {
+      if (this.drawCodewords($), r == -1) {
         let d = 1e9;
-        for (let R = 0; R < 8; R++) {
-          this.applyMask(R), this.drawFormatBits(R);
-          const E = this.getPenaltyScore();
-          E < d && (s = R, d = E), this.applyMask(R);
+        for (let M = 0; M < 8; M++) {
+          this.applyMask(M), this.drawFormatBits(M);
+          const g = this.getPenaltyScore();
+          g < d && (r = M, d = g), this.applyMask(M);
         }
       }
-      r(0 <= s && s <= 7), this.mask = s, this.applyMask(s), this.drawFormatBits(s), this.isFunction = [];
+      o(0 <= r && r <= 7), this.mask = r, this.applyMask(r), this.drawFormatBits(r), this.isFunction = [];
     }
     /*-- Static factory functions (high level) --*/
     // Returns a QR Code representing the given Unicode text string at the given error correction level.
@@ -240,7 +234,7 @@ var S;
     // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the
     // ecl argument if it can be done without increasing the version.
     static encodeText(e, n) {
-      const t = o.QrSegment.makeSegments(e);
+      const t = s.QrSegment.makeSegments(e);
       return l.encodeSegments(t, n);
     }
     // Returns a QR Code representing the given binary data at the given error correction level.
@@ -248,7 +242,7 @@ var S;
     // bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.
     // The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.
     static encodeBinary(e, n) {
-      const t = o.QrSegment.makeBytes(e);
+      const t = s.QrSegment.makeBytes(e);
       return l.encodeSegments([t], n);
     }
     /*-- Static factory functions (mid level) --*/
@@ -261,36 +255,36 @@ var S;
     // This function allows the user to create a custom sequence of segments that switches
     // between modes (such as alphanumeric and byte) to encode text in less space.
     // This is a mid-level API; the high-level API is encodeText() and encodeBinary().
-    static encodeSegments(e, n, t = 1, s = 40, h = -1, $ = !0) {
-      if (!(l.MIN_VERSION <= t && t <= s && s <= l.MAX_VERSION) || h < -1 || h > 7)
+    static encodeSegments(e, n, t = 1, r = 40, h = -1, $ = !0) {
+      if (!(l.MIN_VERSION <= t && t <= r && r <= l.MAX_VERSION) || h < -1 || h > 7)
         throw new RangeError("Invalid value");
-      let d, R;
+      let d, M;
       for (d = t; ; d++) {
-        const m = l.getNumDataCodewords(d, n) * 8, g = u.getTotalBits(e, d);
-        if (g <= m) {
-          R = g;
+        const p = l.getNumDataCodewords(d, n) * 8, N = u.getTotalBits(e, d);
+        if (N <= p) {
+          M = N;
           break;
         }
-        if (d >= s)
+        if (d >= r)
           throw new RangeError("Data too long");
       }
-      for (const m of [l.Ecc.MEDIUM, l.Ecc.QUARTILE, l.Ecc.HIGH])
-        $ && R <= l.getNumDataCodewords(d, m) * 8 && (n = m);
-      let E = [];
-      for (const m of e) {
-        c(m.mode.modeBits, 4, E), c(m.numChars, m.mode.numCharCountBits(d), E);
-        for (const g of m.getData())
-          E.push(g);
+      for (const p of [l.Ecc.MEDIUM, l.Ecc.QUARTILE, l.Ecc.HIGH])
+        $ && M <= l.getNumDataCodewords(d, p) * 8 && (n = p);
+      let g = [];
+      for (const p of e) {
+        c(p.mode.modeBits, 4, g), c(p.numChars, p.mode.numCharCountBits(d), g);
+        for (const N of p.getData())
+          g.push(N);
       }
-      r(E.length == R);
+      o(g.length == M);
       const A = l.getNumDataCodewords(d, n) * 8;
-      r(E.length <= A), c(0, Math.min(4, A - E.length), E), c(0, (8 - E.length % 8) % 8, E), r(E.length % 8 == 0);
-      for (let m = 236; E.length < A; m ^= 253)
-        c(m, 8, E);
-      let M = [];
-      for (; M.length * 8 < E.length; )
-        M.push(0);
-      return E.forEach((m, g) => M[g >>> 3] |= m << 7 - (g & 7)), new l(d, n, M, h);
+      o(g.length <= A), c(0, Math.min(4, A - g.length), g), c(0, (8 - g.length % 8) % 8, g), o(g.length % 8 == 0);
+      for (let p = 236; g.length < A; p ^= 253)
+        c(p, 8, g);
+      let E = [];
+      for (; E.length * 8 < g.length; )
+        E.push(0);
+      return g.forEach((p, N) => E[N >>> 3] |= p << 7 - (N & 7)), new l(d, n, E, h);
     }
     /*-- Accessor methods --*/
     // Returns the color of the module (pixel) at the given coordinates, which is false
@@ -311,8 +305,8 @@ var S;
       this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
       const e = this.getAlignmentPatternPositions(), n = e.length;
       for (let t = 0; t < n; t++)
-        for (let s = 0; s < n; s++)
-          t == 0 && s == 0 || t == 0 && s == n - 1 || t == n - 1 && s == 0 || this.drawAlignmentPattern(e[t], e[s]);
+        for (let r = 0; r < n; r++)
+          t == 0 && r == 0 || t == 0 && r == n - 1 || t == n - 1 && r == 0 || this.drawAlignmentPattern(e[t], e[r]);
       this.drawFormatBits(0), this.drawVersion();
     }
     // Draws two copies of the format bits (with its own error correction code)
@@ -322,17 +316,17 @@ var S;
       let t = n;
       for (let h = 0; h < 10; h++)
         t = t << 1 ^ (t >>> 9) * 1335;
-      const s = (n << 10 | t) ^ 21522;
-      r(s >>> 15 == 0);
+      const r = (n << 10 | t) ^ 21522;
+      o(r >>> 15 == 0);
       for (let h = 0; h <= 5; h++)
-        this.setFunctionModule(8, h, i(s, h));
-      this.setFunctionModule(8, 7, i(s, 6)), this.setFunctionModule(8, 8, i(s, 7)), this.setFunctionModule(7, 8, i(s, 8));
+        this.setFunctionModule(8, h, i(r, h));
+      this.setFunctionModule(8, 7, i(r, 6)), this.setFunctionModule(8, 8, i(r, 7)), this.setFunctionModule(7, 8, i(r, 8));
       for (let h = 9; h < 15; h++)
-        this.setFunctionModule(14 - h, 8, i(s, h));
+        this.setFunctionModule(14 - h, 8, i(r, h));
       for (let h = 0; h < 8; h++)
-        this.setFunctionModule(this.size - 1 - h, 8, i(s, h));
+        this.setFunctionModule(this.size - 1 - h, 8, i(r, h));
       for (let h = 8; h < 15; h++)
-        this.setFunctionModule(8, this.size - 15 + h, i(s, h));
+        this.setFunctionModule(8, this.size - 15 + h, i(r, h));
       this.setFunctionModule(8, this.size - 8, !0);
     }
     // Draws two copies of the version bits (with its own error correction code),
@@ -344,18 +338,18 @@ var S;
       for (let t = 0; t < 12; t++)
         e = e << 1 ^ (e >>> 11) * 7973;
       const n = this.version << 12 | e;
-      r(n >>> 18 == 0);
+      o(n >>> 18 == 0);
       for (let t = 0; t < 18; t++) {
-        const s = i(n, t), h = this.size - 11 + t % 3, $ = Math.floor(t / 3);
-        this.setFunctionModule(h, $, s), this.setFunctionModule($, h, s);
+        const r = i(n, t), h = this.size - 11 + t % 3, $ = Math.floor(t / 3);
+        this.setFunctionModule(h, $, r), this.setFunctionModule($, h, r);
       }
     }
     // Draws a 9*9 finder pattern including the border separator,
     // with the center module at (x, y). Modules can be out of bounds.
     drawFinderPattern(e, n) {
       for (let t = -4; t <= 4; t++)
-        for (let s = -4; s <= 4; s++) {
-          const h = Math.max(Math.abs(s), Math.abs(t)), $ = e + s, d = n + t;
+        for (let r = -4; r <= 4; r++) {
+          const h = Math.max(Math.abs(r), Math.abs(t)), $ = e + r, d = n + t;
           0 <= $ && $ < this.size && 0 <= d && d < this.size && this.setFunctionModule($, d, h != 2 && h != 4);
         }
     }
@@ -363,8 +357,8 @@ var S;
     // at (x, y). All modules must be in bounds.
     drawAlignmentPattern(e, n) {
       for (let t = -2; t <= 2; t++)
-        for (let s = -2; s <= 2; s++)
-          this.setFunctionModule(e + s, n + t, Math.max(Math.abs(s), Math.abs(t)) != 1);
+        for (let r = -2; r <= 2; r++)
+          this.setFunctionModule(e + r, n + t, Math.max(Math.abs(r), Math.abs(t)) != 1);
     }
     // Sets the color of a module and marks it as a function module.
     // Only used by the constructor. Coordinates must be in bounds.
@@ -378,21 +372,21 @@ var S;
       const n = this.version, t = this.errorCorrectionLevel;
       if (e.length != l.getNumDataCodewords(n, t))
         throw new RangeError("Invalid argument");
-      const s = l.NUM_ERROR_CORRECTION_BLOCKS[t.ordinal][n], h = l.ECC_CODEWORDS_PER_BLOCK[t.ordinal][n], $ = Math.floor(l.getNumRawDataModules(n) / 8), d = s - $ % s, R = Math.floor($ / s);
-      let E = [];
+      const r = l.NUM_ERROR_CORRECTION_BLOCKS[t.ordinal][n], h = l.ECC_CODEWORDS_PER_BLOCK[t.ordinal][n], $ = Math.floor(l.getNumRawDataModules(n) / 8), d = r - $ % r, M = Math.floor($ / r);
+      let g = [];
       const A = l.reedSolomonComputeDivisor(h);
-      for (let m = 0, g = 0; m < s; m++) {
-        let I = e.slice(g, g + R - h + (m < d ? 0 : 1));
-        g += I.length;
+      for (let p = 0, N = 0; p < r; p++) {
+        let I = e.slice(N, N + M - h + (p < d ? 0 : 1));
+        N += I.length;
         const w = l.reedSolomonComputeRemainder(I, A);
-        m < d && I.push(0), E.push(I.concat(w));
+        p < d && I.push(0), g.push(I.concat(w));
       }
-      let M = [];
-      for (let m = 0; m < E[0].length; m++)
-        E.forEach((g, I) => {
-          (m != R - h || I >= d) && M.push(g[m]);
+      let E = [];
+      for (let p = 0; p < g[0].length; p++)
+        g.forEach((N, I) => {
+          (p != M - h || I >= d) && E.push(N[p]);
         });
-      return r(M.length == $), M;
+      return o(E.length == $), E;
     }
     // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire
     // data area of this QR Code. Function modules need to be marked off before this is called.
@@ -402,13 +396,13 @@ var S;
       let n = 0;
       for (let t = this.size - 1; t >= 1; t -= 2) {
         t == 6 && (t = 5);
-        for (let s = 0; s < this.size; s++)
+        for (let r = 0; r < this.size; r++)
           for (let h = 0; h < 2; h++) {
-            const $ = t - h, R = (t + 1 & 2) == 0 ? this.size - 1 - s : s;
-            !this.isFunction[R][$] && n < e.length * 8 && (this.modules[R][$] = i(e[n >>> 3], 7 - (n & 7)), n++);
+            const $ = t - h, M = (t + 1 & 2) == 0 ? this.size - 1 - r : r;
+            !this.isFunction[M][$] && n < e.length * 8 && (this.modules[M][$] = i(e[n >>> 3], 7 - (n & 7)), n++);
           }
       }
-      r(n == e.length * 8);
+      o(n == e.length * 8);
     }
     // XORs the codeword modules in this QR Code with the given mask pattern.
     // The function modules must be marked and the codeword bits must be drawn
@@ -420,36 +414,36 @@ var S;
         throw new RangeError("Mask value out of range");
       for (let n = 0; n < this.size; n++)
         for (let t = 0; t < this.size; t++) {
-          let s;
+          let r;
           switch (e) {
             case 0:
-              s = (t + n) % 2 == 0;
+              r = (t + n) % 2 == 0;
               break;
             case 1:
-              s = n % 2 == 0;
+              r = n % 2 == 0;
               break;
             case 2:
-              s = t % 3 == 0;
+              r = t % 3 == 0;
               break;
             case 3:
-              s = (t + n) % 3 == 0;
+              r = (t + n) % 3 == 0;
               break;
             case 4:
-              s = (Math.floor(t / 3) + Math.floor(n / 2)) % 2 == 0;
+              r = (Math.floor(t / 3) + Math.floor(n / 2)) % 2 == 0;
               break;
             case 5:
-              s = t * n % 2 + t * n % 3 == 0;
+              r = t * n % 2 + t * n % 3 == 0;
               break;
             case 6:
-              s = (t * n % 2 + t * n % 3) % 2 == 0;
+              r = (t * n % 2 + t * n % 3) % 2 == 0;
               break;
             case 7:
-              s = ((t + n) % 2 + t * n % 3) % 2 == 0;
+              r = ((t + n) % 2 + t * n % 3) % 2 == 0;
               break;
             default:
               throw new Error("Unreachable");
           }
-          !this.isFunction[n][t] && s && (this.modules[n][t] = !this.modules[n][t]);
+          !this.isFunction[n][t] && r && (this.modules[n][t] = !this.modules[n][t]);
         }
     }
     // Calculates and returns the penalty score based on state of this QR Code's current modules.
@@ -457,16 +451,16 @@ var S;
     getPenaltyScore() {
       let e = 0;
       for (let h = 0; h < this.size; h++) {
-        let $ = !1, d = 0, R = [0, 0, 0, 0, 0, 0, 0];
-        for (let E = 0; E < this.size; E++)
-          this.modules[h][E] == $ ? (d++, d == 5 ? e += l.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, R), $ || (e += this.finderPenaltyCountPatterns(R) * l.PENALTY_N3), $ = this.modules[h][E], d = 1);
-        e += this.finderPenaltyTerminateAndCount($, d, R) * l.PENALTY_N3;
+        let $ = !1, d = 0, M = [0, 0, 0, 0, 0, 0, 0];
+        for (let g = 0; g < this.size; g++)
+          this.modules[h][g] == $ ? (d++, d == 5 ? e += l.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, M), $ || (e += this.finderPenaltyCountPatterns(M) * l.PENALTY_N3), $ = this.modules[h][g], d = 1);
+        e += this.finderPenaltyTerminateAndCount($, d, M) * l.PENALTY_N3;
       }
       for (let h = 0; h < this.size; h++) {
-        let $ = !1, d = 0, R = [0, 0, 0, 0, 0, 0, 0];
-        for (let E = 0; E < this.size; E++)
-          this.modules[E][h] == $ ? (d++, d == 5 ? e += l.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, R), $ || (e += this.finderPenaltyCountPatterns(R) * l.PENALTY_N3), $ = this.modules[E][h], d = 1);
-        e += this.finderPenaltyTerminateAndCount($, d, R) * l.PENALTY_N3;
+        let $ = !1, d = 0, M = [0, 0, 0, 0, 0, 0, 0];
+        for (let g = 0; g < this.size; g++)
+          this.modules[g][h] == $ ? (d++, d == 5 ? e += l.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, M), $ || (e += this.finderPenaltyCountPatterns(M) * l.PENALTY_N3), $ = this.modules[g][h], d = 1);
+        e += this.finderPenaltyTerminateAndCount($, d, M) * l.PENALTY_N3;
       }
       for (let h = 0; h < this.size - 1; h++)
         for (let $ = 0; $ < this.size - 1; $++) {
@@ -476,8 +470,8 @@ var S;
       let n = 0;
       for (const h of this.modules)
         n = h.reduce(($, d) => $ + (d ? 1 : 0), n);
-      const t = this.size * this.size, s = Math.ceil(Math.abs(n * 20 - t * 10) / t) - 1;
-      return r(0 <= s && s <= 9), e += s * l.PENALTY_N4, r(0 <= e && e <= 2568888), e;
+      const t = this.size * this.size, r = Math.ceil(Math.abs(n * 20 - t * 10) / t) - 1;
+      return o(0 <= r && r <= 9), e += r * l.PENALTY_N4, o(0 <= e && e <= 2568888), e;
     }
     /*-- Private helper functions --*/
     // Returns an ascending list of positions of alignment patterns for this version number.
@@ -489,8 +483,8 @@ var S;
       {
         const e = Math.floor(this.version / 7) + 2, n = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2;
         let t = [6];
-        for (let s = this.size - 7; t.length < e; s -= n)
-          t.splice(1, 0, s);
+        for (let r = this.size - 7; t.length < e; r -= n)
+          t.splice(1, 0, r);
         return t;
       }
     }
@@ -505,7 +499,7 @@ var S;
         const t = Math.floor(e / 7) + 2;
         n -= (25 * t - 10) * t - 55, e >= 7 && (n -= 36);
       }
-      return r(208 <= n && n <= 29648), n;
+      return o(208 <= n && n <= 29648), n;
     }
     // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any
     // QR Code of the given version number and error correction level, with remainder bits discarded.
@@ -519,11 +513,11 @@ var S;
       if (e < 1 || e > 255)
         throw new RangeError("Degree out of range");
       let n = [];
-      for (let s = 0; s < e - 1; s++)
+      for (let r = 0; r < e - 1; r++)
         n.push(0);
       n.push(1);
       let t = 1;
-      for (let s = 0; s < e; s++) {
+      for (let r = 0; r < e; r++) {
         for (let h = 0; h < n.length; h++)
           n[h] = l.reedSolomonMultiply(n[h], t), h + 1 < n.length && (n[h] ^= n[h + 1]);
         t = l.reedSolomonMultiply(t, 2);
@@ -532,9 +526,9 @@ var S;
     }
     // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
     static reedSolomonComputeRemainder(e, n) {
-      let t = n.map((s) => 0);
-      for (const s of e) {
-        const h = s ^ t.shift();
+      let t = n.map((r) => 0);
+      for (const r of e) {
+        const h = r ^ t.shift();
         t.push(0), n.forEach(($, d) => t[d] ^= l.reedSolomonMultiply($, h));
       }
       return t;
@@ -545,15 +539,15 @@ var S;
       if (e >>> 8 || n >>> 8)
         throw new RangeError("Byte out of range");
       let t = 0;
-      for (let s = 7; s >= 0; s--)
-        t = t << 1 ^ (t >>> 7) * 285, t ^= (n >>> s & 1) * e;
-      return r(t >>> 8 == 0), t;
+      for (let r = 7; r >= 0; r--)
+        t = t << 1 ^ (t >>> 7) * 285, t ^= (n >>> r & 1) * e;
+      return o(t >>> 8 == 0), t;
     }
     // Can only be called immediately after a light run is added, and
     // returns either 0, 1, or 2. A helper function for getPenaltyScore().
     finderPenaltyCountPatterns(e) {
       const n = e[1];
-      r(n <= this.size * 3);
+      o(n <= this.size * 3);
       const t = n > 0 && e[2] == n && e[3] == n * 3 && e[4] == n && e[5] == n;
       return (t && e[0] >= n * 4 && e[6] >= n ? 1 : 0) + (t && e[6] >= n * 4 && e[0] >= n ? 1 : 0);
     }
@@ -590,7 +584,7 @@ var S;
     // High
   ];
   let a = l;
-  o.QrCode = a;
+  s.QrCode = a;
   function c(f, e, n) {
     if (e < 0 || e > 31 || f >>> e)
       throw new RangeError("Value out of range");
@@ -600,11 +594,11 @@ var S;
   function i(f, e) {
     return (f >>> e & 1) != 0;
   }
-  function r(f) {
+  function o(f) {
     if (!f)
       throw new Error("Assertion error");
   }
-  const p = class p {
+  const m = class m {
     /*-- Constructor (low level) and fields --*/
     // Creates a new QR Code segment with the given attributes and data.
     // The character count (numChars) must agree with the mode and the bit buffer length,
@@ -622,36 +616,36 @@ var S;
       let n = [];
       for (const t of e)
         c(t, 8, n);
-      return new p(p.Mode.BYTE, e.length, n);
+      return new m(m.Mode.BYTE, e.length, n);
     }
     // Returns a segment representing the given string of decimal digits encoded in numeric mode.
     static makeNumeric(e) {
-      if (!p.isNumeric(e))
+      if (!m.isNumeric(e))
         throw new RangeError("String contains non-numeric characters");
       let n = [];
       for (let t = 0; t < e.length; ) {
-        const s = Math.min(e.length - t, 3);
-        c(parseInt(e.substring(t, t + s), 10), s * 3 + 1, n), t += s;
+        const r = Math.min(e.length - t, 3);
+        c(parseInt(e.substring(t, t + r), 10), r * 3 + 1, n), t += r;
       }
-      return new p(p.Mode.NUMERIC, e.length, n);
+      return new m(m.Mode.NUMERIC, e.length, n);
     }
     // Returns a segment representing the given text string encoded in alphanumeric mode.
     // The characters allowed are: 0 to 9, A to Z (uppercase only), space,
     // dollar, percent, asterisk, plus, hyphen, period, slash, colon.
     static makeAlphanumeric(e) {
-      if (!p.isAlphanumeric(e))
+      if (!m.isAlphanumeric(e))
         throw new RangeError("String contains unencodable characters in alphanumeric mode");
       let n = [], t;
       for (t = 0; t + 2 <= e.length; t += 2) {
-        let s = p.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t)) * 45;
-        s += p.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t + 1)), c(s, 11, n);
+        let r = m.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t)) * 45;
+        r += m.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t + 1)), c(r, 11, n);
       }
-      return t < e.length && c(p.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t)), 6, n), new p(p.Mode.ALPHANUMERIC, e.length, n);
+      return t < e.length && c(m.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t)), 6, n), new m(m.Mode.ALPHANUMERIC, e.length, n);
     }
     // Returns a new mutable list of zero or more segments to represent the given Unicode text string.
     // The result may use various segment modes and switch modes to optimize the length of the bit stream.
     static makeSegments(e) {
-      return e == "" ? [] : p.isNumeric(e) ? [p.makeNumeric(e)] : p.isAlphanumeric(e) ? [p.makeAlphanumeric(e)] : [p.makeBytes(p.toUtf8ByteArray(e))];
+      return e == "" ? [] : m.isNumeric(e) ? [m.makeNumeric(e)] : m.isAlphanumeric(e) ? [m.makeAlphanumeric(e)] : [m.makeBytes(m.toUtf8ByteArray(e))];
     }
     // Returns a segment representing an Extended Channel Interpretation
     // (ECI) designator with the given assignment value.
@@ -667,18 +661,18 @@ var S;
         c(6, 3, n), c(e, 21, n);
       else
         throw new RangeError("ECI assignment value out of range");
-      return new p(p.Mode.ECI, 0, n);
+      return new m(m.Mode.ECI, 0, n);
     }
     // Tests whether the given string can be encoded as a segment in numeric mode.
     // A string is encodable iff each character is in the range 0 to 9.
     static isNumeric(e) {
-      return p.NUMERIC_REGEX.test(e);
+      return m.NUMERIC_REGEX.test(e);
     }
     // Tests whether the given string can be encoded as a segment in alphanumeric mode.
     // A string is encodable iff each character is in the following set: 0 to 9, A to Z
     // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
     static isAlphanumeric(e) {
-      return p.ALPHANUMERIC_REGEX.test(e);
+      return m.ALPHANUMERIC_REGEX.test(e);
     }
     /*-- Methods --*/
     // Returns a new copy of the data bits of this segment.
@@ -689,11 +683,11 @@ var S;
     // the given version. The result is infinity if a segment has too many characters to fit its length field.
     static getTotalBits(e, n) {
       let t = 0;
-      for (const s of e) {
-        const h = s.mode.numCharCountBits(n);
-        if (s.numChars >= 1 << h)
+      for (const r of e) {
+        const h = r.mode.numCharCountBits(n);
+        if (r.numChars >= 1 << h)
           return 1 / 0;
-        t += 4 + h + s.bitData.length;
+        t += 4 + h + r.bitData.length;
       }
       return t;
     }
@@ -706,11 +700,11 @@ var S;
       return n;
     }
   };
-  p.NUMERIC_REGEX = /^[0-9]*$/, p.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, p.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-  let u = p;
-  o.QrSegment = u;
+  m.NUMERIC_REGEX = /^[0-9]*$/, m.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, m.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+  let u = m;
+  s.QrSegment = u;
 })(S || (S = {}));
-((o) => {
+((s) => {
   ((a) => {
     const i = class i {
       // The QR Code can tolerate about 30% erroneous codewords
@@ -722,9 +716,9 @@ var S;
     i.LOW = new i(0, 1), i.MEDIUM = new i(1, 0), i.QUARTILE = new i(2, 3), i.HIGH = new i(3, 2);
     let c = i;
     a.Ecc = c;
-  })(o.QrCode || (o.QrCode = {}));
+  })(s.QrCode || (s.QrCode = {}));
 })(S || (S = {}));
-((o) => {
+((s) => {
   ((a) => {
     const i = class i {
       /*-- Constructor and fields --*/
@@ -741,14 +735,14 @@ var S;
     i.NUMERIC = new i(1, [10, 12, 14]), i.ALPHANUMERIC = new i(2, [9, 11, 13]), i.BYTE = new i(4, [8, 16, 16]), i.KANJI = new i(8, [8, 10, 12]), i.ECI = new i(7, [0, 0, 0]);
     let c = i;
     a.Mode = c;
-  })(o.QrSegment || (o.QrSegment = {}));
+  })(s.QrSegment || (s.QrSegment = {}));
 })(S || (S = {}));
-const U = S, ft = {
-  L: U.QrCode.Ecc.LOW,
-  M: U.QrCode.Ecc.MEDIUM,
-  Q: U.QrCode.Ecc.QUARTILE,
-  H: U.QrCode.Ecc.HIGH
-}, pt = 128, mt = "M", Et = 1, Mt = 4, nt = 5, H = "#000000", Rt = "square", gt = "square", Nt = "square", It = "react-qr-code", Ct = "react-qr-code-gradient", wt = "react-qr-code-bg-gradient", At = 0.1, N = 7, T = 3, y = [
+const b = S, ft = {
+  L: b.QrCode.Ecc.LOW,
+  M: b.QrCode.Ecc.MEDIUM,
+  Q: b.QrCode.Ecc.QUARTILE,
+  H: b.QrCode.Ecc.HIGH
+}, pt = 128, mt = "M", gt = 1, Et = 4, ot = 5, H = "#000000", Mt = "square", Rt = "square", Nt = "square", It = "react-qr-code", Ct = "react-qr-code-gradient", wt = "react-qr-code-bg-gradient", At = 0.1, R = 7, T = 3, y = [
   [1, 1, 1, 1, 1, 1, 1],
   [1, 0, 0, 0, 0, 0, 1],
   [1, 0, 0, 0, 0, 0, 1],
@@ -756,7 +750,7 @@ const U = S, ft = {
   [1, 0, 0, 0, 0, 0, 1],
   [1, 0, 0, 0, 0, 0, 1],
   [1, 1, 1, 1, 1, 1, 1]
-], rt = {
+], st = {
   "inpoint-sm": [0, 90, -90],
   inpoint: [0, 90, -90],
   "inpoint-lg": [0, 90, -90],
@@ -766,7 +760,7 @@ const U = S, ft = {
   "leaf-sm": [0, 90, -90],
   leaf: [0, 90, -90],
   "leaf-lg": [0, 90, -90]
-}, k = {
+}, Q = {
   "rounded-sm": 3,
   rounded: 4,
   "rounded-lg": 5,
@@ -803,258 +797,252 @@ const U = S, ft = {
   [0, 0, 1, 1, 1, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0]
-], Pt = (o) => o === "square" || o === "pinched-square" || o === "circle" || o === "star" || o === "heart" || o === "diamond" || o === "hashtag", Ot = (o, a) => o === "square-sm" ? 0.75 : a ? Math.random() * (1 - 0.75) + 0.75 : 1, D = (o, a, c) => {
+], Pt = (s) => s === "square" || s === "pinched-square" || s === "circle" || s === "star" || s === "heart" || s === "diamond" || s === "hashtag", Ot = (s, a) => s === "square-sm" ? 0.75 : a ? Math.random() * (1 - 0.75) + 0.75 : 1, D = (s, a, c) => {
   const i = {
-    left: o === 0 ? !1 : c[a][o - 1],
-    right: o === c[a].length - 1 ? !1 : c[a][o + 1],
-    top: a === 0 ? !1 : c[a - 1][o],
-    bottom: a === c.length - 1 ? !1 : c[a + 1][o]
+    left: s === 0 ? !1 : c[a][s - 1],
+    right: s === c[a].length - 1 ? !1 : c[a][s + 1],
+    top: a === 0 ? !1 : c[a - 1][s],
+    bottom: a === c.length - 1 ? !1 : c[a + 1][s]
   };
   return {
     ...i,
     count: Object.values(i).filter(Boolean).length
   };
-}, b = (o, a, c) => `M${o},${a}h${c}v${c}h-${c}Z`, F = (o, a, c) => `M${o},${a + c / 2}a${c / 2},${c / 2} 0 1,0 ${c},0a${c / 2},${c / 2} 0 1,0 -${c},0Z`, Tt = (o, a, c) => `M${o},${a + c / 2}l${c / 2},-${c / 2}l${c / 2},${c / 2}l-${c / 2},${c / 2}Z`, Lt = (o, a) => `M ${o} ${a} 
+}, U = (s, a, c) => `M${s},${a}h${c}v${c}h-${c}Z`, F = (s, a, c) => `M${s},${a + c / 2}a${c / 2},${c / 2} 0 1,0 ${c},0a${c / 2},${c / 2} 0 1,0 -${c},0Z`, Tt = (s, a, c) => `M${s},${a + c / 2}l${c / 2},-${c / 2}l${c / 2},${c / 2}l-${c / 2},${c / 2}Z`, vt = (s, a) => `M ${s} ${a} 
    v 1 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, Y = (o, a) => `M ${o + 1} ${a} 
+   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, Y = (s, a) => `M ${s + 1} ${a} 
    v 1 
    h -1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, G = (o, a) => `M ${o} ${a} 
+   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, G = (s, a) => `M ${s} ${a} 
    v 1 
    h 0.5 
    a 0.5 0.5, 0, 0, 0, 0.5 -0.5
    v -0.5
-   h -1`, vt = (o, a) => `M ${o + 1} ${a} 
+   h -1`, Lt = (s, a) => `M ${s + 1} ${a} 
    v 1 
    h -0.5 
    a 0.5 0.5, 0, 0, 1, -0.5 -0.5 
    v -0.5 
-   h 1`, j = (o, a) => `M ${o} ${a} 
+   h 1`, j = (s, a) => `M ${s} ${a} 
    v 1 
    h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0 -1`, V = (o, a) => `M ${o + 1} ${a} 
+   a 0.5 0.5, 0, 0, 0, 0 -1`, V = (s, a) => `M ${s + 1} ${a} 
    v 1 
    h -0.5 
-   a 0.5 0.5, 0, 0, 1, 0 -1`, X = (o, a) => `M ${o} ${a + 1} 
+   a 0.5 0.5, 0, 0, 1, 0 -1`, X = (s, a) => `M ${s} ${a + 1} 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -1 0`, Z = (o, a) => `M ${o} ${a} 
+   a 0.5 0.5, 0, 0, 0, -1 0`, Z = (s, a) => `M ${s} ${a} 
    h 1 
    v 0.5 
-   a 0.5 0.5, 0, 0, 1, -1 0`, St = (o, a, c) => `M ${o + 1} ${a}h -${c / 2}a ${c / 2.5} ${c / 2.5}, 0, 0, 0, ${-c / 2.5} ${c / 2.5}v ${c / 2}h ${c / 2}a ${c / 2.5} ${c / 2.5}, 0, 0, 0, ${c / 2.5} ${-c / 2.5}`, Ut = ({
-  x: o,
+   a 0.5 0.5, 0, 0, 1, -1 0`, St = (s, a, c) => `M ${s + 1} ${a}h -${c / 2}a ${c / 2.5} ${c / 2.5}, 0, 0, 0, ${-c / 2.5} ${c / 2.5}v ${c / 2}h ${c / 2}a ${c / 2.5} ${c / 2.5}, 0, 0, 0, ${c / 2.5} ${-c / 2.5}`, bt = ({
+  x: s,
   y: a,
   numCells: c
-}) => {
-  var i, r, u;
-  return !!((i = B[o]) != null && i[a] || (r = B[o - c + 7]) != null && r[a] || (u = B[o]) != null && u[a - c + 7]);
-}, bt = ({
-  x: o,
+}) => !!(B[s]?.[a] || B[s - c + 7]?.[a] || B[s]?.[a - c + 7]), Ut = ({
+  x: s,
   y: a,
   radius: c
 }) => {
-  const i = T - c, r = c / 2, u = T - r;
-  return `M ${o} ${a + r}v ${i}a ${r} ${r}, 0, 0, 0, ${r} ${r}h ${u}v ${-u}a ${r} ${r}, 0, 0, 0, ${-r} ${-r}h ${-i}H ${o}z`;
+  const i = T - c, o = c / 2, u = T - o;
+  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}H ${s}z`;
 }, Dt = ({
-  x: o,
+  x: s,
   y: a,
   radius: c
 }) => {
-  const i = T - c, r = c / 2, u = T - r;
-  return `M ${o} ${a + r}v ${i}a ${r} ${r}, 0, 0, 0, ${r} ${r}h ${u}v ${-u}a ${r} ${r}, 0, 0, 0, ${-r} ${-r}h ${-i}a ${r} ${r}, 0, 0, 0, ${-r} ${r}`;
+  const i = T - c, o = c / 2, u = T - o;
+  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${o}`;
 }, Ft = ({
-  x: o,
+  x: s,
   y: a,
   numCells: c
-}) => {
-  var i, r, u;
-  return !!((i = y[o]) != null && i[a] || (r = y[o - c + 7]) != null && r[a] || (u = y[o]) != null && u[a - c + 7]);
-}, yt = ({
-  x: o,
+}) => !!(y[s]?.[a] || y[s - c + 7]?.[a] || y[s]?.[a - c + 7]), yt = ({
+  x: s,
   y: a,
   radius: c
 }) => {
-  const i = N - c, r = c / 2;
-  return `M ${o} ${a + r}v ${i}a ${r} ${r}, 0, 0, 0, ${r} ${r}h ${i}a ${r} ${r}, 0, 0, 0, ${r} ${-r}v ${-i}a ${r} ${r}, 0, 0, 0, ${-r} ${-r}h ${-i}a ${r} ${r}, 0, 0, 0, ${-r} ${r}M ${o + r} ${a + 1}h ${i}a ${r - 1} ${r - 1}, 0, 0, 1, ${r - 1} ${r - 1}v ${i}a ${r - 1} ${r - 1}, 0, 0, 1, ${-(r - 1)} ${r - 1}h ${-i}a ${r - 1} ${r - 1}, 0, 0, 1, ${-(r - 1)} ${-(r - 1)}v ${-i}a ${r - 1} ${r - 1}, 0, 0, 1, ${r - 1} ${-(r - 1)}`;
+  const i = R - c, o = c / 2;
+  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${i}a ${o} ${o}, 0, 0, 0, ${o} ${-o}v ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${o}M ${s + o} ${a + 1}h ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${o - 1}v ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${o - 1}h ${-i}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${-(o - 1)}v ${-i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${-(o - 1)}`;
 }, Bt = ({
-  x: o,
+  x: s,
   y: a,
   radius: c
 }) => {
-  const i = N - c, r = c / 2, u = N - r;
-  return `M ${o} ${a + r}v ${i}a ${r} ${r}, 0, 0, 0, ${r} ${r}h ${u}v ${-u}a ${r} ${r}, 0, 0, 0, ${-r} ${-r}h ${-i}H ${o}zM ${o + r} ${a + 1}h ${i}a ${r - 1} ${r - 1}, 0, 0, 1, ${r - 1} ${r - 1}v ${u - 1}h ${-(u - 1)}a ${r - 1} ${r - 1}, 0, 0, 1, ${-(r - 1)} ${-(r - 1)}v ${-(u - 1)}z`;
+  const i = R - c, o = c / 2, u = R - o;
+  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}H ${s}zM ${s + o} ${a + 1}h ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${o - 1}v ${u - 1}h ${-(u - 1)}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${-(o - 1)}v ${-(u - 1)}z`;
 }, Ht = ({
-  x: o,
+  x: s,
   y: a,
   radius: c
 }) => {
-  const i = N - c, r = c / 2, u = N - r;
-  return `M ${o} ${a + r}v ${i}a ${r} ${r}, 0, 0, 0, ${r} ${r}h ${u}v ${-u}a ${r} ${r}, 0, 0, 0, ${-r} ${-r}h ${-i}a ${r} ${r}, 0, 0, 0, ${-r} ${r}M ${o + r} ${a + 1}h ${i}a ${r - 1} ${r - 1}, 0, 0, 1, ${r - 1} ${r - 1}v ${u - 1}h ${-(u - 1)}a ${r - 1} ${r - 1}, 0, 0, 1, ${-(r - 1)} ${-(r - 1)}v ${-i}a ${r - 1} ${r - 1}, 0, 0, 1, ${r - 1} ${-(r - 1)}`;
-}, _t = (o) => ({
-  color: (o == null ? void 0 : o.color) || H,
-  style: (o == null ? void 0 : o.style) || Nt,
-  randomSize: (o == null ? void 0 : o.randomSize) || !1
-}), zt = (o) => ({
-  color: (o == null ? void 0 : o.color) || H,
-  style: (o == null ? void 0 : o.style) || Rt
-}), Qt = (o) => ({
-  color: (o == null ? void 0 : o.color) || H,
-  style: (o == null ? void 0 : o.style) || gt
-}), kt = ({
-  modules: o,
+  const i = R - c, o = c / 2, u = R - o;
+  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${o}M ${s + o} ${a + 1}h ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${o - 1}v ${u - 1}h ${-(u - 1)}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${-(o - 1)}v ${-i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${-(o - 1)}`;
+}, _t = (s) => ({
+  color: s?.color || H,
+  style: s?.style || Nt,
+  randomSize: s?.randomSize || !1
+}), zt = (s) => ({
+  color: s?.color || H,
+  style: s?.style || Mt
+}), kt = (s) => ({
+  color: s?.color || H,
+  style: s?.style || Rt
+}), Qt = ({
+  modules: s,
   margin: a,
   settings: c,
   gradient: i,
-  gradientId: r
+  gradientId: o
 }) => {
-  const { color: u, style: l, randomSize: p } = v(
+  const { color: u, style: l, randomSize: m } = L(
     () => _t(c),
     [c]
-  ), f = [], e = o.length, n = Pt(l) && p, t = it(
+  ), f = [], e = s.length, n = Pt(l) && m, t = it(
     () => Ot(l, n),
     [l, n]
   );
-  return o.forEach((s, h) => {
-    s.forEach(($, d) => {
-      if (Ft({ x: d, y: h, numCells: e }) || Ut({ x: d, y: h, numCells: e }))
+  return s.forEach((r, h) => {
+    r.forEach(($, d) => {
+      if (Ft({ x: d, y: h, numCells: e }) || bt({ x: d, y: h, numCells: e }))
         return;
-      const R = t(), E = 1 * R, A = (1 - 1 * R) / 2, M = d + a + A, m = h + a + A;
+      const M = t(), g = 1 * M, A = (1 - 1 * M) / 2, E = d + a + A, p = h + a + A;
       if ($) {
         if (l === "square" || l === "square-sm")
-          f.push(b(M, m, E));
+          f.push(U(E, p, g));
         else if (l === "pinched-square")
-          f.push(tt(M, m, E, 0.25));
+          f.push(tt(E, p, g, 0.25));
         else if (l === "circle")
-          f.push(F(M, m, E));
+          f.push(F(E, p, g));
         else if (l === "diamond")
-          f.push(Tt(M, m, E));
+          f.push(Tt(E, p, g));
         else if (l === "star")
           f.push(
-            J(M + E / 2, m + E / 2, E * 1.1, nt)
+            J(E + g / 2, p + g / 2, g * 1.1, ot)
           );
         else if (l === "heart")
-          f.push(ot(M, m, E));
+          f.push(nt(E, p, g));
         else if (l === "hashtag")
-          f.push(et(M, m, E));
+          f.push(et(E, p, g));
         else if (l === "rounded") {
-          const { left: g, right: I, top: w, bottom: P, count: O } = D(d, h, o);
-          O === 0 ? f.push(F(M, m, 1)) : O > 2 || g && I || w && P ? f.push(b(M, m, 1)) : O === 2 ? g && w ? f.push(G(M, m)) : w && I ? f.push(vt(M, m)) : I && P ? f.push(Y(M, m)) : f.push(Lt(M, m)) : w ? f.push(Z(M, m)) : I ? f.push(V(M, m)) : P ? f.push(X(M, m)) : f.push(j(M, m));
+          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
+          O === 0 ? f.push(F(E, p, 1)) : O > 2 || N && I || w && P ? f.push(U(E, p, 1)) : O === 2 ? N && w ? f.push(G(E, p)) : w && I ? f.push(Lt(E, p)) : I && P ? f.push(Y(E, p)) : f.push(vt(E, p)) : w ? f.push(Z(E, p)) : I ? f.push(V(E, p)) : P ? f.push(X(E, p)) : f.push(j(E, p));
         } else if (l === "leaf") {
-          const { left: g, right: I, top: w, bottom: P, count: O } = D(d, h, o);
+          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
           if (O === 0)
-            f.push(St(M, m, E));
-          else if (!g && !w) {
-            f.push(Y(M, m));
+            f.push(St(E, p, g));
+          else if (!N && !w) {
+            f.push(Y(E, p));
             return;
-          } else !I && !P ? f.push(G(M, m)) : f.push(b(M, m, 1));
+          } else !I && !P ? f.push(G(E, p)) : f.push(U(E, p, 1));
         } else if (l === "vertical-line") {
-          const { left: g, right: I, top: w, bottom: P, count: O } = D(d, h, o);
-          O === 0 || g && !(w || P) || I && !(w || P) ? f.push(F(M, m, 1)) : w && P ? f.push(b(M, m, 1)) : w && !P ? f.push(Z(M, m)) : P && !w && f.push(X(M, m));
+          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
+          O === 0 || N && !(w || P) || I && !(w || P) ? f.push(F(E, p, 1)) : w && P ? f.push(U(E, p, 1)) : w && !P ? f.push(Z(E, p)) : P && !w && f.push(X(E, p));
         } else if (l === "horizontal-line") {
-          const { left: g, right: I, top: w, bottom: P, count: O } = D(d, h, o);
-          O === 0 || w && !(g || I) || P && !(g || I) ? f.push(F(M, m, 1)) : g && I ? f.push(b(M, m, 1)) : g && !I ? f.push(j(M, m)) : I && !g && f.push(V(M, m));
+          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
+          O === 0 || w && !(N || I) || P && !(N || I) ? f.push(F(E, p, 1)) : N && I ? f.push(U(E, p, 1)) : N && !I ? f.push(j(E, p)) : I && !N && f.push(V(E, p));
         }
       }
     });
   }), /* @__PURE__ */ C(
     "path",
     {
-      fill: i ? `url(#${r})` : u,
+      fill: i ? `url(#${o})` : u,
       d: f.join(""),
       shapeRendering: l === "square" ? "crispEdges" : "geometricPrecision",
       "data-testid": "data-modules"
     }
   );
-}, L = {
+}, v = {
   "data-testid": "finder-patterns-inner"
 }, qt = ({
-  modules: o,
+  modules: s,
   margin: a,
   settings: c,
   gradient: i,
-  gradientId: r
+  gradientId: o
 }) => {
-  const { color: u, style: l } = v(
-    () => Qt(c),
+  const { color: u, style: l } = L(
+    () => kt(c),
     [c]
-  ), p = i ? `url(#${r})` : u, f = v(
+  ), m = i ? `url(#${o})` : u, f = L(
     () => [
       { x: a + 2, y: a + 2 },
-      { x: o.length + a - N + 2, y: a + 2 },
-      { x: a + 2, y: o.length + a - N + 2 }
+      { x: s.length + a - R + 2, y: a + 2 },
+      { x: a + 2, y: s.length + a - R + 2 }
     ],
-    [a, o.length]
+    [a, s.length]
   ), e = (n, t) => `finder-patterns-inner-${l}-${n}-${t}`;
   if (l === "rounded-sm" || l === "rounded" || l === "rounded-lg" || l === "circle" || l === "square")
     return f.map((n) => {
-      const { x: t, y: s } = n;
+      const { x: t, y: r } = n;
       return /* @__PURE__ */ C(
         "rect",
         {
           x: t,
-          y: s,
+          y: r,
           width: T,
           height: T,
-          fill: p,
+          fill: m,
           rx: q[l],
-          ...L
+          ...v
         },
-        e(t, s)
+        e(t, r)
       );
     });
   if (l === "pinched-square")
     return f.map((n) => {
-      const { x: t, y: s } = n, h = tt(t, s, T, 0.25);
-      return /* @__PURE__ */ C("path", { fill: p, d: h, ...L }, e(t, s));
+      const { x: t, y: r } = n, h = tt(t, r, T, 0.25);
+      return /* @__PURE__ */ C("path", { fill: m, d: h, ...v }, e(t, r));
     });
   if (l === "diamond")
     return f.map((n) => {
-      const { x: t, y: s } = n, h = Math.sqrt(1.5), $ = T / h, d = $ - $ / h;
+      const { x: t, y: r } = n, h = Math.sqrt(1.5), $ = T / h, d = $ - $ / h;
       return /* @__PURE__ */ C(
         "rect",
         {
           x: t + d / 2,
-          y: s + d / 2,
+          y: r + d / 2,
           width: $,
           height: $,
-          fill: p,
+          fill: m,
           style: {
             transform: "rotate(45deg)",
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...L
+          ...v
         },
-        e(t, s)
+        e(t, r)
       );
     });
   if (l === "inpoint-sm" || l === "inpoint" || l === "inpoint-lg" || l === "outpoint-sm" || l === "outpoint" || l === "outpoint-lg" || l === "leaf-sm" || l === "leaf" || l === "leaf-lg") {
-    const n = l === "leaf-sm" || l === "leaf" || l === "leaf-lg" ? bt : Dt;
-    return f.map((t, s) => ({
+    const n = l === "leaf-sm" || l === "leaf" || l === "leaf-lg" ? Ut : Dt;
+    return f.map((t, r) => ({
       ...t,
-      rotation: rt[l][s]
-    })).map(({ x: t, y: s, rotation: h }) => {
+      rotation: st[l][r]
+    })).map(({ x: t, y: r, rotation: h }) => {
       const $ = n({
         x: t,
-        y: s,
+        y: r,
         radius: q[l]
       });
       return /* @__PURE__ */ C(
         "path",
         {
-          fill: p,
+          fill: m,
           d: $,
           style: {
             transform: `rotate(${h}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...L
+          ...v
         },
-        e(t, s)
+        e(t, r)
       );
     });
   }
@@ -1062,41 +1050,41 @@ const U = S, ft = {
     return f.map(({ x: n, y: t }) => /* @__PURE__ */ C(
       "path",
       {
-        fill: p,
-        d: ot(n, t, T),
-        ...L
+        fill: m,
+        d: nt(n, t, T),
+        ...v
       },
       e(n, t)
     ));
   if (l === "star")
     return f.map(({ x: n, y: t }) => {
-      const s = n + T / 2, h = t + T / 2, $ = J(s, h, T * 1.2, nt);
-      return /* @__PURE__ */ C("path", { fill: p, d: $, ...L }, e(n, t));
+      const r = n + T / 2, h = t + T / 2, $ = J(r, h, T * 1.2, ot);
+      return /* @__PURE__ */ C("path", { fill: m, d: $, ...v }, e(n, t));
     });
   if (l === "hashtag")
     return f.map(({ x: n, y: t }) => {
-      const s = et(n - 0.25, t - 0.25, 3.5);
-      return /* @__PURE__ */ C("path", { fill: p, d: s, ...L }, e(n, t));
+      const r = et(n - 0.25, t - 0.25, 3.5);
+      return /* @__PURE__ */ C("path", { fill: m, d: r, ...v }, e(n, t));
     });
 }, x = {
   "data-testid": "finder-patterns-outer"
 }, Yt = ({
-  modules: o,
+  modules: s,
   margin: a,
   settings: c,
   gradient: i,
-  gradientId: r
+  gradientId: o
 }) => {
-  const { style: u, color: l } = v(
+  const { style: u, color: l } = L(
     () => zt(c),
     [c]
-  ), p = i ? `url(#${r})` : l, f = [], e = v(
+  ), m = i ? `url(#${o})` : l, f = [], e = L(
     () => [
       { x: a, y: a },
-      { x: o.length + a - N, y: a },
-      { x: a, y: o.length + a - N }
+      { x: s.length + a - R, y: a },
+      { x: a, y: s.length + a - R }
     ],
-    [a, o.length]
+    [a, s.length]
   );
   if ([
     "rounded-sm",
@@ -1107,38 +1095,38 @@ const U = S, ft = {
     "pinched-square"
   ].includes(u)) {
     for (const n of e) {
-      const { x: t, y: s } = n;
+      const { x: t, y: r } = n;
       u === "rounded-sm" || u === "rounded" || u === "rounded-lg" ? f.push(
         yt({
           x: t,
-          y: s,
-          radius: k[u]
+          y: r,
+          radius: Q[u]
         })
       ) : u === "circle" ? f.push(
-        `M ${t + N / 2} ${s}a ${N / 2} ${N / 2} 0 1 0 0.01 0zzm 0 1a ${N / 2 - 1} ${N / 2 - 1} 0 1 1 -0.01 0Z`
+        `M ${t + R / 2} ${r}a ${R / 2} ${R / 2} 0 1 0 0.01 0zzm 0 1a ${R / 2 - 1} ${R / 2 - 1} 0 1 1 -0.01 0Z`
       ) : u === "pinched-square" ? f.push(
-        `M ${t} ${s}Q ${t + 0.5} ${s + N / 2}, ${t} ${s + N}Q ${t + N / 2} ${s + N - 0.5}, ${t + N} ${s + N}Q ${t + N - 0.5} ${s + N / 2}, ${t + N} ${s}Q ${t + N / 2} ${s + 0.5}, ${t} ${s}zM ${t + 1} ${s + 1}Q ${t + N / 2} ${s + 1.25}, ${t + N - 1} ${s + 1}Q ${t + N - 1.25} ${s + N / 2}, ${t + N - 1} ${s + N - 1}Q ${t + N / 2} ${s + N - 1.25}, ${t + 1} ${s + N - 1}Q ${t + 1.25} ${s + N / 2}, ${t + 1} ${s + 1}z`
+        `M ${t} ${r}Q ${t + 0.5} ${r + R / 2}, ${t} ${r + R}Q ${t + R / 2} ${r + R - 0.5}, ${t + R} ${r + R}Q ${t + R - 0.5} ${r + R / 2}, ${t + R} ${r}Q ${t + R / 2} ${r + 0.5}, ${t} ${r}zM ${t + 1} ${r + 1}Q ${t + R / 2} ${r + 1.25}, ${t + R - 1} ${r + 1}Q ${t + R - 1.25} ${r + R / 2}, ${t + R - 1} ${r + R - 1}Q ${t + R / 2} ${r + R - 1.25}, ${t + 1} ${r + R - 1}Q ${t + 1.25} ${r + R / 2}, ${t + 1} ${r + 1}z`
       ) : f.push(
-        `M ${t} ${s}v ${N}h ${N}v -7zM ${t + 1} ${s + 1}h ${N - 2}v ${N - 2}h -5z`
+        `M ${t} ${r}v ${R}h ${R}v ${-R}zM ${t + 1} ${r + 1}h ${R - 2}v ${R - 2}h ${-R + 2}z`
       );
     }
-    return /* @__PURE__ */ C("path", { fill: p, d: f.join(""), ...x });
+    return /* @__PURE__ */ C("path", { fill: m, d: f.join(""), ...x });
   }
   if (u === "inpoint-sm" || u === "inpoint" || u === "inpoint-lg" || u === "outpoint-sm" || u === "outpoint" || u === "outpoint-lg" || u === "leaf-sm" || u === "leaf" || u === "leaf-lg") {
     const n = u === "leaf-sm" || u === "leaf" || u === "leaf-lg" ? Bt : Ht;
-    return e.map((t, s) => ({
+    return e.map((t, r) => ({
       ...t,
-      rotation: rt[u][s]
-    })).map(({ x: t, y: s, rotation: h }) => {
+      rotation: st[u][r]
+    })).map(({ x: t, y: r, rotation: h }) => {
       const $ = n({
         x: t,
-        y: s,
-        radius: k[u]
+        y: r,
+        radius: Q[u]
       });
       return /* @__PURE__ */ C(
         "path",
         {
-          fill: p,
+          fill: m,
           d: $,
           style: {
             transform: `rotate(${h}deg)`,
@@ -1147,16 +1135,15 @@ const U = S, ft = {
           },
           ...x
         },
-        `finder-patterns-outer-${u}-${t}-${s}`
+        `finder-patterns-outer-${u}-${t}-${r}`
       );
     });
   }
-}, Gt = ({ gradient: o, gradientId: a }) => {
-  var i, r;
-  if (!o)
+}, Gt = ({ gradient: s, gradientId: a }) => {
+  if (!s)
     return null;
-  const c = W((o == null ? void 0 : o.rotation) || 0);
-  return /* @__PURE__ */ C("defs", { children: o.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: a, gradientUnits: "userSpaceOnUse", ...c, children: (i = o.stops) == null ? void 0 : i.map((u, l) => /* @__PURE__ */ C("stop", { offset: u.offset, stopColor: u.color }, l)) }) : /* @__PURE__ */ C(
+  const c = W(s?.rotation || 0);
+  return /* @__PURE__ */ C("defs", { children: s.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: a, gradientUnits: "userSpaceOnUse", ...c, children: s.stops?.map((i, o) => /* @__PURE__ */ C("stop", { offset: i.offset, stopColor: i.color }, o)) }) : /* @__PURE__ */ C(
     "radialGradient",
     {
       id: a,
@@ -1164,38 +1151,38 @@ const U = S, ft = {
       cx: "50%",
       cy: "50%",
       r: "50%",
-      children: (r = o.stops) == null ? void 0 : r.map((u, l) => /* @__PURE__ */ C("stop", { offset: u.offset, stopColor: u.color }, l))
+      children: s.stops?.map((i, o) => /* @__PURE__ */ C("stop", { offset: i.offset, stopColor: i.color }, o))
     }
   ) });
 }, jt = () => {
-  const o = at();
+  const s = at();
   return {
-    gradientId: `${Ct}-${o}`,
-    bgGradientId: `${wt}-${o}`
+    gradientId: `${Ct}-${s}`,
+    bgGradientId: `${wt}-${s}`
   };
-}, Vt = (o, a) => o.slice().map((c, i) => i < a.y || i >= a.y + a.h ? c : c.map((r, u) => u < a.x || u >= a.x + a.w ? r : !1)), Xt = (o, a, c, i) => {
+}, Vt = (s, a) => s.slice().map((c, i) => i < a.y || i >= a.y + a.h ? c : c.map((o, u) => u < a.x || u >= a.x + a.w ? o : !1)), Xt = (s, a, c, i) => {
   if (i == null)
     return null;
-  const r = o.length + c * 2, u = Math.floor(a * At), l = r / a, p = (i.width || u) * l, f = (i.height || u) * l, e = i.x == null ? o.length / 2 - p / 2 : i.x * l, n = i.y == null ? o.length / 2 - f / 2 : i.y * l, t = i.opacity == null ? 1 : i.opacity;
-  let s = null;
+  const o = s.length + c * 2, u = Math.floor(a * At), l = o / a, m = (i.width || u) * l, f = (i.height || u) * l, e = i.x == null ? s.length / 2 - m / 2 : i.x * l, n = i.y == null ? s.length / 2 - f / 2 : i.y * l, t = i.opacity == null ? 1 : i.opacity;
+  let r = null;
   if (i.excavate) {
-    const $ = Math.floor(e), d = Math.floor(n), R = Math.ceil(p + e - $), E = Math.ceil(f + n - d);
-    s = { x: $, y: d, w: R, h: E };
+    const $ = Math.floor(e), d = Math.floor(n), M = Math.ceil(m + e - $), g = Math.ceil(f + n - d);
+    r = { x: $, y: d, w: M, h: g };
   }
   const h = i.crossOrigin;
-  return { x: e, y: n, h: f, w: p, excavation: s, opacity: t, crossOrigin: h };
-}, Zt = (o) => o != null ? Math.max(Math.floor(o), 0) : Mt, xt = ({
-  value: o,
+  return { x: e, y: n, h: f, w: m, excavation: r, opacity: t, crossOrigin: h };
+}, Zt = (s) => s != null ? Math.max(Math.floor(s), 0) : Et, xt = ({
+  value: s,
   level: a,
   minVersion: c,
   marginSize: i,
-  imageSettings: r,
+  imageSettings: o,
   size: u,
   boostLevel: l
 }) => {
-  const p = v(() => {
-    const h = (Array.isArray(o) ? o : [o]).reduce(($, d) => ($.push(...U.QrSegment.makeSegments(d)), $), []);
-    return U.QrCode.encodeSegments(
+  const m = L(() => {
+    const h = (Array.isArray(s) ? s : [s]).reduce(($, d) => ($.push(...b.QrSegment.makeSegments(d)), $), []);
+    return b.QrCode.encodeSegments(
       h,
       ft[a],
       c,
@@ -1203,79 +1190,79 @@ const U = S, ft = {
       void 0,
       l
     );
-  }, [o, a, c, l]), { cells: f, margin: e, numCells: n, calculatedImageSettings: t } = v(() => {
-    const s = p.getModules(), h = Zt(i), $ = s.length + h * 2, d = Xt(s, u, h, r);
+  }, [s, a, c, l]), { cells: f, margin: e, numCells: n, calculatedImageSettings: t } = L(() => {
+    const r = m.getModules(), h = Zt(i), $ = r.length + h * 2, d = Xt(r, u, h, o);
     return {
-      cells: s,
+      cells: r,
       margin: h,
       numCells: $,
       calculatedImageSettings: d
     };
-  }, [p, u, r, i]);
+  }, [m, u, o, i]);
   return {
-    qrcode: p,
+    qrcode: m,
     margin: e,
     cells: f,
     numCells: n,
     calculatedImageSettings: t
   };
-}, Kt = ({ svgRef: o, fileSize: a, fileName: c }) => {
-  if (!o.current) return;
-  const i = o.current.cloneNode(!0);
+}, Kt = ({ svgRef: s, fileSize: a, fileName: c }) => {
+  if (!s.current) return;
+  const i = s.current.cloneNode(!0);
   i.setAttribute("width", a.toString()), i.setAttribute("height", a.toString());
-  const r = new XMLSerializer(), u = new Blob([r.serializeToString(i)], {
+  const o = new XMLSerializer(), u = new Blob([o.serializeToString(i)], {
     type: "image/svg+xml"
-  }), l = URL.createObjectURL(u), p = document.createElement("a");
-  p.href = l, p.download = `${c}.svg`, document.body.appendChild(p), p.click(), document.body.removeChild(p), URL.revokeObjectURL(l);
+  }), l = URL.createObjectURL(u), m = document.createElement("a");
+  m.href = l, m.download = `${c}.svg`, document.body.appendChild(m), m.click(), document.body.removeChild(m), URL.revokeObjectURL(l);
 }, Wt = ({
-  svgRef: o,
+  svgRef: s,
   fileSize: a,
   fileName: c,
   fileFormat: i,
-  imageSettings: r,
+  imageSettings: o,
   calculatedImageSettings: u,
   size: l,
-  numCells: p,
+  numCells: m,
   margin: f
 }) => {
-  if (!o.current) return;
+  if (!s.current) return;
   const e = document.createElement("canvas"), n = e.getContext("2d");
   if (!n) return;
   e.width = a, e.height = a;
-  const t = new XMLSerializer().serializeToString(o.current), s = new Blob([t], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(s), $ = new Image();
+  const t = new XMLSerializer().serializeToString(s.current), r = new Blob([t], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(r), $ = new Image();
   $.crossOrigin = "anonymous", $.src = h, $.onload = () => {
-    if (n.drawImage($, 0, 0, a, a), URL.revokeObjectURL(h), r != null && r.src && u) {
+    if (n.drawImage($, 0, 0, a, a), URL.revokeObjectURL(h), o?.src && u) {
       const d = new Image();
-      d.crossOrigin = "anonymous", d.src = r.src, d.onload = () => {
-        const R = a / l, E = p / a, A = r.width * R, M = r.x ? (u.x + f) / E : (a - A) / 2, m = r.y ? (u.y + f) / E : (a - A) / 2;
-        n.drawImage(d, M, m, A, A);
-        const g = i === "png" ? "image/png" : "image/jpeg", I = document.createElement("a");
-        I.href = e.toDataURL(g), I.download = `${c}.${i}`, document.body.appendChild(I), I.click(), document.body.removeChild(I);
-      }, d.onerror = (R) => console.error("Error loading logo:", R);
+      d.crossOrigin = "anonymous", d.src = o.src, d.onload = () => {
+        const M = a / l, g = m / a, A = o.width * M, E = o.x ? (u.x + f) / g : (a - A) / 2, p = o.y ? (u.y + f) / g : (a - A) / 2;
+        n.drawImage(d, E, p, A, A);
+        const N = i === "png" ? "image/png" : "image/jpeg", I = document.createElement("a");
+        I.href = e.toDataURL(N), I.download = `${c}.${i}`, document.body.appendChild(I), I.click(), document.body.removeChild(I);
+      }, d.onerror = (M) => console.error("Error loading logo:", M);
     } else {
-      const d = i === "png" ? "image/png" : "image/jpeg", R = document.createElement("a");
-      R.href = e.toDataURL(d), R.download = `${c}.${i}`, document.body.appendChild(R), R.click(), document.body.removeChild(R);
+      const d = i === "png" ? "image/png" : "image/jpeg", M = document.createElement("a");
+      M.href = e.toDataURL(d), M.download = `${c}.${i}`, document.body.appendChild(M), M.click(), document.body.removeChild(M);
     }
   }, $.onerror = (d) => console.error("Error loading QR code:", d);
-}, Jt = ct((o, a) => {
+}, Jt = ct((s, a) => {
   const {
     value: c,
     size: i = pt,
-    level: r = mt,
+    level: o = mt,
     background: u,
     gradient: l,
-    minVersion: p = Et,
+    minVersion: m = gt,
     boostLevel: f,
     marginSize: e,
     finderPatternOuterSettings: n,
     finderPatternInnerSettings: t,
-    dataModulesSettings: s,
+    dataModulesSettings: r,
     imageSettings: h,
     svgProps: $
-  } = o, d = lt(null), { gradientId: R, bgGradientId: E } = jt(), { margin: A, cells: M, numCells: m, calculatedImageSettings: g } = xt({
+  } = s, d = lt(null), { gradientId: M, bgGradientId: g } = jt(), { margin: A, cells: E, numCells: p, calculatedImageSettings: N } = xt({
     value: c,
-    level: r,
-    minVersion: p,
+    level: o,
+    minVersion: m,
     boostLevel: f,
     marginSize: e,
     imageSettings: h,
@@ -1294,56 +1281,56 @@ const U = S, ft = {
         fileName: O,
         fileFormat: _,
         imageSettings: h,
-        calculatedImageSettings: g,
+        calculatedImageSettings: N,
         size: i,
-        numCells: m,
+        numCells: p,
         margin: A
       }));
     }
   }));
-  let I = M, w = null;
-  h != null && g != null && (g.excavation != null && (I = Vt(M, g.excavation)), w = /* @__PURE__ */ C(
+  let I = E, w = null;
+  h != null && N != null && (N.excavation != null && (I = Vt(E, N.excavation)), w = /* @__PURE__ */ C(
     "image",
     {
       href: h.src,
-      height: g.h,
-      width: g.w,
-      x: g.x + A,
-      y: g.y + A,
+      height: N.h,
+      width: N.w,
+      x: N.x + A,
+      y: N.y + A,
       preserveAspectRatio: "none",
-      opacity: g.opacity,
-      crossOrigin: g.crossOrigin
+      opacity: N.opacity,
+      crossOrigin: N.crossOrigin
     }
   ));
   const P = {
     modules: I,
     margin: A,
     gradient: l,
-    gradientId: R
+    gradientId: M
   };
   return /* @__PURE__ */ K(
     "svg",
     {
       height: i,
       width: i,
-      viewBox: `0 0 ${m} ${m}`,
+      viewBox: `0 0 ${p} ${p}`,
       ref: d,
       role: "img",
-      "aria-label": ($ == null ? void 0 : $["aria-label"]) || "QR Code",
+      "aria-label": $?.["aria-label"] || "QR Code",
       ...$,
       children: [
-        /* @__PURE__ */ C(Gt, { gradient: l, gradientId: R }),
+        /* @__PURE__ */ C(Gt, { gradient: l, gradientId: M }),
         /* @__PURE__ */ C(
           $t,
           {
             background: u,
-            bgGradientId: E,
-            numCells: m
+            bgGradientId: g,
+            numCells: p
           }
         ),
         /* @__PURE__ */ C(Yt, { settings: n, ...P }),
         /* @__PURE__ */ C(qt, { settings: t, ...P }),
-        /* @__PURE__ */ C(kt, { settings: s, ...P }),
+        /* @__PURE__ */ C(Qt, { settings: r, ...P }),
         w
       ]
     }