@lglab/react-qr-code 1.2.2 → 1.3.0

package/dist/index.es.js

@@ -1,11 +1,11 @@
-import { jsx as C, jsxs as K, Fragment as rt } from "react/jsx-runtime";
-import { useMemo as T, useCallback as st, useRef as it, useImperativeHandle as at } from "react";
+import { jsx as w, jsxs as K, Fragment as st } from "react/jsx-runtime";
+import { useMemo as L, useCallback as it, useRef as at, useImperativeHandle as ct } from "react";
 /**
  * @license QR Code generator library (TypeScript)
  * Copyright (c) Project Nayuki.
  * SPDX-License-Identifier: MIT
  */
-var L;
+var v;
 ((r) => {
   const d = class d {
     /*-- Constructor (low level) and fields --*/
@@ -13,28 +13,28 @@ var L;
     // 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(t, o, n, a) {
-      if (this.version = t, this.errorCorrectionLevel = o, this.modules = [], this.isFunction = [], t < d.MIN_VERSION || t > d.MAX_VERSION)
+    constructor(o, t, e, c) {
+      if (this.version = o, this.errorCorrectionLevel = t, this.modules = [], this.isFunction = [], o < d.MIN_VERSION || o > d.MAX_VERSION)
         throw new RangeError("Version value out of range");
-      if (a < -1 || a > 7)
+      if (c < -1 || c > 7)
         throw new RangeError("Mask value out of range");
-      this.size = t * 4 + 17;
+      this.size = o * 4 + 17;
       let h = [];
-      for (let f = 0; f < this.size; f++)
+      for (let $ = 0; $ < this.size; $++)
         h.push(!1);
-      for (let f = 0; f < this.size; f++)
+      for (let $ = 0; $ < this.size; $++)
         this.modules.push(h.slice()), this.isFunction.push(h.slice());
       this.drawFunctionPatterns();
-      const $ = this.addEccAndInterleave(n);
-      if (this.drawCodewords($), a == -1) {
-        let f = 1e9;
+      const f = this.addEccAndInterleave(e);
+      if (this.drawCodewords(f), c == -1) {
+        let $ = 1e9;
         for (let p = 0; p < 8; p++) {
           this.applyMask(p), this.drawFormatBits(p);
           const M = this.getPenaltyScore();
-          M < f && (a = p, f = M), this.applyMask(p);
+          M < $ && (c = p, $ = M), this.applyMask(p);
         }
       }
-      e(0 <= a && a <= 7), this.mask = a, this.applyMask(a), this.drawFormatBits(a), this.isFunction = [];
+      n(0 <= c && c <= 7), this.mask = c, this.applyMask(c), this.drawFormatBits(c), this.isFunction = [];
     }
     /*-- Static factory functions (high level) --*/
     // Returns a QR Code representing the given Unicode text string at the given error correction level.
@@ -42,17 +42,17 @@ var L;
     // Unicode code points (not UTF-16 code units) if the low error correction level is used. 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 encodeText(t, o) {
-      const n = r.QrSegment.makeSegments(t);
-      return d.encodeSegments(n, o);
+    static encodeText(o, t) {
+      const e = r.QrSegment.makeSegments(o);
+      return d.encodeSegments(e, t);
     }
     // Returns a QR Code representing the given binary data at the given error correction level.
     // This function always encodes using the binary segment mode, not any text mode. The maximum number of
     // 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(t, o) {
-      const n = r.QrSegment.makeBytes(t);
-      return d.encodeSegments([n], o);
+    static encodeBinary(o, t) {
+      const e = r.QrSegment.makeBytes(o);
+      return d.encodeSegments([e], t);
     }
     /*-- Static factory functions (mid level) --*/
     // Returns a QR Code representing the given segments with the given encoding parameters.
@@ -64,43 +64,43 @@ var L;
     // 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(t, o, n = 1, a = 40, h = -1, $ = !0) {
-      if (!(d.MIN_VERSION <= n && n <= a && a <= d.MAX_VERSION) || h < -1 || h > 7)
+    static encodeSegments(o, t, e = 1, c = 40, h = -1, f = !0) {
+      if (!(d.MIN_VERSION <= e && e <= c && c <= d.MAX_VERSION) || h < -1 || h > 7)
         throw new RangeError("Invalid value");
-      let f, p;
-      for (f = n; ; f++) {
-        const R = d.getNumDataCodewords(f, o) * 8, w = l.getTotalBits(t, f);
-        if (w <= R) {
-          p = w;
+      let $, p;
+      for ($ = e; ; $++) {
+        const R = d.getNumDataCodewords($, t) * 8, I = l.getTotalBits(o, $);
+        if (I <= R) {
+          p = I;
           break;
         }
-        if (f >= a)
+        if ($ >= c)
           throw new RangeError("Data too long");
       }
       for (const R of [d.Ecc.MEDIUM, d.Ecc.QUARTILE, d.Ecc.HIGH])
-        $ && p <= d.getNumDataCodewords(f, R) * 8 && (o = R);
+        f && p <= d.getNumDataCodewords($, R) * 8 && (t = R);
       let M = [];
-      for (const R of t) {
-        c(R.mode.modeBits, 4, M), c(R.numChars, R.mode.numCharCountBits(f), M);
-        for (const w of R.getData())
-          M.push(w);
+      for (const R of o) {
+        a(R.mode.modeBits, 4, M), a(R.numChars, R.mode.numCharCountBits($), M);
+        for (const I of R.getData())
+          M.push(I);
       }
-      e(M.length == p);
-      const E = d.getNumDataCodewords(f, o) * 8;
-      e(M.length <= E), c(0, Math.min(4, E - M.length), M), c(0, (8 - M.length % 8) % 8, M), e(M.length % 8 == 0);
+      n(M.length == p);
+      const E = d.getNumDataCodewords($, t) * 8;
+      n(M.length <= E), a(0, Math.min(4, E - M.length), M), a(0, (8 - M.length % 8) % 8, M), n(M.length % 8 == 0);
       for (let R = 236; M.length < E; R ^= 253)
-        c(R, 8, M);
+        a(R, 8, M);
       let m = [];
       for (; m.length * 8 < M.length; )
         m.push(0);
-      return M.forEach((R, w) => m[w >>> 3] |= R << 7 - (w & 7)), new d(f, o, m, h);
+      return M.forEach((R, I) => m[I >>> 3] |= R << 7 - (I & 7)), new d($, t, m, h);
     }
     /*-- Accessor methods --*/
     // Returns the color of the module (pixel) at the given coordinates, which is false
     // for light or true for dark. The top left corner has the coordinates (x=0, y=0).
     // If the given coordinates are out of bounds, then false (light) is returned.
-    getModule(t, o) {
-      return 0 <= t && t < this.size && 0 <= o && o < this.size && this.modules[o][t];
+    getModule(o, t) {
+      return 0 <= o && o < this.size && 0 <= t && t < this.size && this.modules[t][o];
     }
     // Modified to expose modules for easy access
     getModules() {
@@ -109,33 +109,33 @@ var L;
     /*-- Private helper methods for constructor: Drawing function modules --*/
     // Reads this object's version field, and draws and marks all function modules.
     drawFunctionPatterns() {
-      for (let n = 0; n < this.size; n++)
-        this.setFunctionModule(6, n, n % 2 == 0), this.setFunctionModule(n, 6, n % 2 == 0);
+      for (let e = 0; e < this.size; e++)
+        this.setFunctionModule(6, e, e % 2 == 0), this.setFunctionModule(e, 6, e % 2 == 0);
       this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
-      const t = this.getAlignmentPatternPositions(), o = t.length;
-      for (let n = 0; n < o; n++)
-        for (let a = 0; a < o; a++)
-          n == 0 && a == 0 || n == 0 && a == o - 1 || n == o - 1 && a == 0 || this.drawAlignmentPattern(t[n], t[a]);
+      const o = this.getAlignmentPatternPositions(), t = o.length;
+      for (let e = 0; e < t; e++)
+        for (let c = 0; c < t; c++)
+          e == 0 && c == 0 || e == 0 && c == t - 1 || e == t - 1 && c == 0 || this.drawAlignmentPattern(o[e], o[c]);
       this.drawFormatBits(0), this.drawVersion();
     }
     // Draws two copies of the format bits (with its own error correction code)
     // based on the given mask and this object's error correction level field.
-    drawFormatBits(t) {
-      const o = this.errorCorrectionLevel.formatBits << 3 | t;
-      let n = o;
+    drawFormatBits(o) {
+      const t = this.errorCorrectionLevel.formatBits << 3 | o;
+      let e = t;
       for (let h = 0; h < 10; h++)
-        n = n << 1 ^ (n >>> 9) * 1335;
-      const a = (o << 10 | n) ^ 21522;
-      e(a >>> 15 == 0);
+        e = e << 1 ^ (e >>> 9) * 1335;
+      const c = (t << 10 | e) ^ 21522;
+      n(c >>> 15 == 0);
       for (let h = 0; h <= 5; h++)
-        this.setFunctionModule(8, h, s(a, h));
-      this.setFunctionModule(8, 7, s(a, 6)), this.setFunctionModule(8, 8, s(a, 7)), this.setFunctionModule(7, 8, s(a, 8));
+        this.setFunctionModule(8, h, s(c, h));
+      this.setFunctionModule(8, 7, s(c, 6)), this.setFunctionModule(8, 8, s(c, 7)), this.setFunctionModule(7, 8, s(c, 8));
       for (let h = 9; h < 15; h++)
-        this.setFunctionModule(14 - h, 8, s(a, h));
+        this.setFunctionModule(14 - h, 8, s(c, h));
       for (let h = 0; h < 8; h++)
-        this.setFunctionModule(this.size - 1 - h, 8, s(a, h));
+        this.setFunctionModule(this.size - 1 - h, 8, s(c, h));
       for (let h = 8; h < 15; h++)
-        this.setFunctionModule(8, this.size - 15 + h, s(a, h));
+        this.setFunctionModule(8, this.size - 15 + h, s(c, h));
       this.setFunctionModule(8, this.size - 8, !0);
     }
     // Draws two copies of the version bits (with its own error correction code),
@@ -143,144 +143,144 @@ var L;
     drawVersion() {
       if (this.version < 7)
         return;
-      let t = this.version;
-      for (let n = 0; n < 12; n++)
-        t = t << 1 ^ (t >>> 11) * 7973;
-      const o = this.version << 12 | t;
-      e(o >>> 18 == 0);
-      for (let n = 0; n < 18; n++) {
-        const a = s(o, n), h = this.size - 11 + n % 3, $ = Math.floor(n / 3);
-        this.setFunctionModule(h, $, a), this.setFunctionModule($, h, a);
+      let o = this.version;
+      for (let e = 0; e < 12; e++)
+        o = o << 1 ^ (o >>> 11) * 7973;
+      const t = this.version << 12 | o;
+      n(t >>> 18 == 0);
+      for (let e = 0; e < 18; e++) {
+        const c = s(t, e), h = this.size - 11 + e % 3, f = Math.floor(e / 3);
+        this.setFunctionModule(h, f, c), this.setFunctionModule(f, h, c);
       }
     }
     // Draws a 9*9 finder pattern including the border separator,
     // with the center module at (x, y). Modules can be out of bounds.
-    drawFinderPattern(t, o) {
-      for (let n = -4; n <= 4; n++)
-        for (let a = -4; a <= 4; a++) {
-          const h = Math.max(Math.abs(a), Math.abs(n)), $ = t + a, f = o + n;
-          0 <= $ && $ < this.size && 0 <= f && f < this.size && this.setFunctionModule($, f, h != 2 && h != 4);
+    drawFinderPattern(o, t) {
+      for (let e = -4; e <= 4; e++)
+        for (let c = -4; c <= 4; c++) {
+          const h = Math.max(Math.abs(c), Math.abs(e)), f = o + c, $ = t + e;
+          0 <= f && f < this.size && 0 <= $ && $ < this.size && this.setFunctionModule(f, $, h != 2 && h != 4);
         }
     }
     // Draws a 5*5 alignment pattern, with the center module
     // at (x, y). All modules must be in bounds.
-    drawAlignmentPattern(t, o) {
-      for (let n = -2; n <= 2; n++)
-        for (let a = -2; a <= 2; a++)
-          this.setFunctionModule(t + a, o + n, Math.max(Math.abs(a), Math.abs(n)) != 1);
+    drawAlignmentPattern(o, t) {
+      for (let e = -2; e <= 2; e++)
+        for (let c = -2; c <= 2; c++)
+          this.setFunctionModule(o + c, t + e, Math.max(Math.abs(c), Math.abs(e)) != 1);
     }
     // Sets the color of a module and marks it as a function module.
     // Only used by the constructor. Coordinates must be in bounds.
-    setFunctionModule(t, o, n) {
-      this.modules[o][t] = n, this.isFunction[o][t] = !0;
+    setFunctionModule(o, t, e) {
+      this.modules[t][o] = e, this.isFunction[t][o] = !0;
     }
     /*-- Private helper methods for constructor: Codewords and masking --*/
     // Returns a new byte string representing the given data with the appropriate error correction
     // codewords appended to it, based on this object's version and error correction level.
-    addEccAndInterleave(t) {
-      const o = this.version, n = this.errorCorrectionLevel;
-      if (t.length != d.getNumDataCodewords(o, n))
+    addEccAndInterleave(o) {
+      const t = this.version, e = this.errorCorrectionLevel;
+      if (o.length != d.getNumDataCodewords(t, e))
         throw new RangeError("Invalid argument");
-      const a = d.NUM_ERROR_CORRECTION_BLOCKS[n.ordinal][o], h = d.ECC_CODEWORDS_PER_BLOCK[n.ordinal][o], $ = Math.floor(d.getNumRawDataModules(o) / 8), f = a - $ % a, p = Math.floor($ / a);
+      const c = d.NUM_ERROR_CORRECTION_BLOCKS[e.ordinal][t], h = d.ECC_CODEWORDS_PER_BLOCK[e.ordinal][t], f = Math.floor(d.getNumRawDataModules(t) / 8), $ = c - f % c, p = Math.floor(f / c);
       let M = [];
       const E = d.reedSolomonComputeDivisor(h);
-      for (let R = 0, w = 0; R < a; R++) {
-        let A = t.slice(w, w + p - h + (R < f ? 0 : 1));
-        w += A.length;
-        const N = d.reedSolomonComputeRemainder(A, E);
-        R < f && A.push(0), M.push(A.concat(N));
+      for (let R = 0, I = 0; R < c; R++) {
+        let C = o.slice(I, I + p - h + (R < $ ? 0 : 1));
+        I += C.length;
+        const A = d.reedSolomonComputeRemainder(C, E);
+        R < $ && C.push(0), M.push(C.concat(A));
       }
       let m = [];
       for (let R = 0; R < M[0].length; R++)
-        M.forEach((w, A) => {
-          (R != p - h || A >= f) && m.push(w[R]);
+        M.forEach((I, C) => {
+          (R != p - h || C >= $) && m.push(I[R]);
         });
-      return e(m.length == $), m;
+      return n(m.length == f), m;
     }
     // 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.
-    drawCodewords(t) {
-      if (t.length != Math.floor(d.getNumRawDataModules(this.version) / 8))
+    drawCodewords(o) {
+      if (o.length != Math.floor(d.getNumRawDataModules(this.version) / 8))
         throw new RangeError("Invalid argument");
-      let o = 0;
-      for (let n = this.size - 1; n >= 1; n -= 2) {
-        n == 6 && (n = 5);
-        for (let a = 0; a < this.size; a++)
+      let t = 0;
+      for (let e = this.size - 1; e >= 1; e -= 2) {
+        e == 6 && (e = 5);
+        for (let c = 0; c < this.size; c++)
           for (let h = 0; h < 2; h++) {
-            const $ = n - h, p = (n + 1 & 2) == 0 ? this.size - 1 - a : a;
-            !this.isFunction[p][$] && o < t.length * 8 && (this.modules[p][$] = s(t[o >>> 3], 7 - (o & 7)), o++);
+            const f = e - h, p = (e + 1 & 2) == 0 ? this.size - 1 - c : c;
+            !this.isFunction[p][f] && t < o.length * 8 && (this.modules[p][f] = s(o[t >>> 3], 7 - (t & 7)), t++);
           }
       }
-      e(o == t.length * 8);
+      n(t == o.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
     // before masking. Due to the arithmetic of XOR, calling applyMask() with
     // the same mask value a second time will undo the mask. A final well-formed
     // QR Code needs exactly one (not zero, two, etc.) mask applied.
-    applyMask(t) {
-      if (t < 0 || t > 7)
+    applyMask(o) {
+      if (o < 0 || o > 7)
         throw new RangeError("Mask value out of range");
-      for (let o = 0; o < this.size; o++)
-        for (let n = 0; n < this.size; n++) {
-          let a;
-          switch (t) {
+      for (let t = 0; t < this.size; t++)
+        for (let e = 0; e < this.size; e++) {
+          let c;
+          switch (o) {
             case 0:
-              a = (n + o) % 2 == 0;
+              c = (e + t) % 2 == 0;
               break;
             case 1:
-              a = o % 2 == 0;
+              c = t % 2 == 0;
               break;
             case 2:
-              a = n % 3 == 0;
+              c = e % 3 == 0;
               break;
             case 3:
-              a = (n + o) % 3 == 0;
+              c = (e + t) % 3 == 0;
               break;
             case 4:
-              a = (Math.floor(n / 3) + Math.floor(o / 2)) % 2 == 0;
+              c = (Math.floor(e / 3) + Math.floor(t / 2)) % 2 == 0;
               break;
             case 5:
-              a = n * o % 2 + n * o % 3 == 0;
+              c = e * t % 2 + e * t % 3 == 0;
               break;
             case 6:
-              a = (n * o % 2 + n * o % 3) % 2 == 0;
+              c = (e * t % 2 + e * t % 3) % 2 == 0;
               break;
             case 7:
-              a = ((n + o) % 2 + n * o % 3) % 2 == 0;
+              c = ((e + t) % 2 + e * t % 3) % 2 == 0;
               break;
             default:
               throw new Error("Unreachable");
           }
-          !this.isFunction[o][n] && a && (this.modules[o][n] = !this.modules[o][n]);
+          !this.isFunction[t][e] && c && (this.modules[t][e] = !this.modules[t][e]);
         }
     }
     // Calculates and returns the penalty score based on state of this QR Code's current modules.
     // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.
     getPenaltyScore() {
-      let t = 0;
+      let o = 0;
       for (let h = 0; h < this.size; h++) {
-        let $ = !1, f = 0, p = [0, 0, 0, 0, 0, 0, 0];
+        let f = !1, $ = 0, p = [0, 0, 0, 0, 0, 0, 0];
         for (let M = 0; M < this.size; M++)
-          this.modules[h][M] == $ ? (f++, f == 5 ? t += d.PENALTY_N1 : f > 5 && t++) : (this.finderPenaltyAddHistory(f, p), $ || (t += this.finderPenaltyCountPatterns(p) * d.PENALTY_N3), $ = this.modules[h][M], f = 1);
-        t += this.finderPenaltyTerminateAndCount($, f, p) * d.PENALTY_N3;
+          this.modules[h][M] == f ? ($++, $ == 5 ? o += d.PENALTY_N1 : $ > 5 && o++) : (this.finderPenaltyAddHistory($, p), f || (o += this.finderPenaltyCountPatterns(p) * d.PENALTY_N3), f = this.modules[h][M], $ = 1);
+        o += this.finderPenaltyTerminateAndCount(f, $, p) * d.PENALTY_N3;
       }
       for (let h = 0; h < this.size; h++) {
-        let $ = !1, f = 0, p = [0, 0, 0, 0, 0, 0, 0];
+        let f = !1, $ = 0, p = [0, 0, 0, 0, 0, 0, 0];
         for (let M = 0; M < this.size; M++)
-          this.modules[M][h] == $ ? (f++, f == 5 ? t += d.PENALTY_N1 : f > 5 && t++) : (this.finderPenaltyAddHistory(f, p), $ || (t += this.finderPenaltyCountPatterns(p) * d.PENALTY_N3), $ = this.modules[M][h], f = 1);
-        t += this.finderPenaltyTerminateAndCount($, f, p) * d.PENALTY_N3;
+          this.modules[M][h] == f ? ($++, $ == 5 ? o += d.PENALTY_N1 : $ > 5 && o++) : (this.finderPenaltyAddHistory($, p), f || (o += this.finderPenaltyCountPatterns(p) * d.PENALTY_N3), f = this.modules[M][h], $ = 1);
+        o += this.finderPenaltyTerminateAndCount(f, $, p) * d.PENALTY_N3;
       }
       for (let h = 0; h < this.size - 1; h++)
-        for (let $ = 0; $ < this.size - 1; $++) {
-          const f = this.modules[h][$];
-          f == this.modules[h][$ + 1] && f == this.modules[h + 1][$] && f == this.modules[h + 1][$ + 1] && (t += d.PENALTY_N2);
+        for (let f = 0; f < this.size - 1; f++) {
+          const $ = this.modules[h][f];
+          $ == this.modules[h][f + 1] && $ == this.modules[h + 1][f] && $ == this.modules[h + 1][f + 1] && (o += d.PENALTY_N2);
         }
-      let o = 0;
+      let t = 0;
       for (const h of this.modules)
-        o = h.reduce(($, f) => $ + (f ? 1 : 0), o);
-      const n = this.size * this.size, a = Math.ceil(Math.abs(o * 20 - n * 10) / n) - 1;
-      return e(0 <= a && a <= 9), t += a * d.PENALTY_N4, e(0 <= t && t <= 2568888), t;
+        t = h.reduce((f, $) => f + ($ ? 1 : 0), t);
+      const e = this.size * this.size, c = Math.ceil(Math.abs(t * 20 - e * 10) / e) - 1;
+      return n(0 <= c && c <= 9), o += c * d.PENALTY_N4, n(0 <= o && o <= 2568888), o;
     }
     /*-- Private helper functions --*/
     // Returns an ascending list of positions of alignment patterns for this version number.
@@ -290,83 +290,83 @@ var L;
       if (this.version == 1)
         return [];
       {
-        const t = Math.floor(this.version / 7) + 2, o = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (t * 2 - 2)) * 2;
-        let n = [6];
-        for (let a = this.size - 7; n.length < t; a -= o)
-          n.splice(1, 0, a);
-        return n;
+        const o = Math.floor(this.version / 7) + 2, t = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (o * 2 - 2)) * 2;
+        let e = [6];
+        for (let c = this.size - 7; e.length < o; c -= t)
+          e.splice(1, 0, c);
+        return e;
       }
     }
     // Returns the number of data bits that can be stored in a QR Code of the given version number, after
     // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.
     // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
-    static getNumRawDataModules(t) {
-      if (t < d.MIN_VERSION || t > d.MAX_VERSION)
+    static getNumRawDataModules(o) {
+      if (o < d.MIN_VERSION || o > d.MAX_VERSION)
         throw new RangeError("Version number out of range");
-      let o = (16 * t + 128) * t + 64;
-      if (t >= 2) {
-        const n = Math.floor(t / 7) + 2;
-        o -= (25 * n - 10) * n - 55, t >= 7 && (o -= 36);
+      let t = (16 * o + 128) * o + 64;
+      if (o >= 2) {
+        const e = Math.floor(o / 7) + 2;
+        t -= (25 * e - 10) * e - 55, o >= 7 && (t -= 36);
       }
-      return e(208 <= o && o <= 29648), o;
+      return n(208 <= t && t <= 29648), t;
     }
     // 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.
     // This stateless pure function could be implemented as a (40*4)-cell lookup table.
-    static getNumDataCodewords(t, o) {
-      return Math.floor(d.getNumRawDataModules(t) / 8) - d.ECC_CODEWORDS_PER_BLOCK[o.ordinal][t] * d.NUM_ERROR_CORRECTION_BLOCKS[o.ordinal][t];
+    static getNumDataCodewords(o, t) {
+      return Math.floor(d.getNumRawDataModules(o) / 8) - d.ECC_CODEWORDS_PER_BLOCK[t.ordinal][o] * d.NUM_ERROR_CORRECTION_BLOCKS[t.ordinal][o];
     }
     // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be
     // implemented as a lookup table over all possible parameter values, instead of as an algorithm.
-    static reedSolomonComputeDivisor(t) {
-      if (t < 1 || t > 255)
+    static reedSolomonComputeDivisor(o) {
+      if (o < 1 || o > 255)
         throw new RangeError("Degree out of range");
-      let o = [];
-      for (let a = 0; a < t - 1; a++)
-        o.push(0);
-      o.push(1);
-      let n = 1;
-      for (let a = 0; a < t; a++) {
-        for (let h = 0; h < o.length; h++)
-          o[h] = d.reedSolomonMultiply(o[h], n), h + 1 < o.length && (o[h] ^= o[h + 1]);
-        n = d.reedSolomonMultiply(n, 2);
+      let t = [];
+      for (let c = 0; c < o - 1; c++)
+        t.push(0);
+      t.push(1);
+      let e = 1;
+      for (let c = 0; c < o; c++) {
+        for (let h = 0; h < t.length; h++)
+          t[h] = d.reedSolomonMultiply(t[h], e), h + 1 < t.length && (t[h] ^= t[h + 1]);
+        e = d.reedSolomonMultiply(e, 2);
       }
-      return o;
+      return t;
     }
     // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static reedSolomonComputeRemainder(t, o) {
-      let n = o.map((a) => 0);
-      for (const a of t) {
-        const h = a ^ n.shift();
-        n.push(0), o.forEach(($, f) => n[f] ^= d.reedSolomonMultiply($, h));
+    static reedSolomonComputeRemainder(o, t) {
+      let e = t.map((c) => 0);
+      for (const c of o) {
+        const h = c ^ e.shift();
+        e.push(0), t.forEach((f, $) => e[$] ^= d.reedSolomonMultiply(f, h));
       }
-      return n;
+      return e;
     }
     // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result
     // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
-    static reedSolomonMultiply(t, o) {
-      if (t >>> 8 || o >>> 8)
+    static reedSolomonMultiply(o, t) {
+      if (o >>> 8 || t >>> 8)
         throw new RangeError("Byte out of range");
-      let n = 0;
-      for (let a = 7; a >= 0; a--)
-        n = n << 1 ^ (n >>> 7) * 285, n ^= (o >>> a & 1) * t;
-      return e(n >>> 8 == 0), n;
+      let e = 0;
+      for (let c = 7; c >= 0; c--)
+        e = e << 1 ^ (e >>> 7) * 285, e ^= (t >>> c & 1) * o;
+      return n(e >>> 8 == 0), e;
     }
     // Can only be called immediately after a light run is added, and
     // returns either 0, 1, or 2. A helper function for getPenaltyScore().
-    finderPenaltyCountPatterns(t) {
-      const o = t[1];
-      e(o <= this.size * 3);
-      const n = o > 0 && t[2] == o && t[3] == o * 3 && t[4] == o && t[5] == o;
-      return (n && t[0] >= o * 4 && t[6] >= o ? 1 : 0) + (n && t[6] >= o * 4 && t[0] >= o ? 1 : 0);
+    finderPenaltyCountPatterns(o) {
+      const t = o[1];
+      n(t <= this.size * 3);
+      const e = t > 0 && o[2] == t && o[3] == t * 3 && o[4] == t && o[5] == t;
+      return (e && o[0] >= t * 4 && o[6] >= t ? 1 : 0) + (e && o[6] >= t * 4 && o[0] >= t ? 1 : 0);
     }
     // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
-    finderPenaltyTerminateAndCount(t, o, n) {
-      return t && (this.finderPenaltyAddHistory(o, n), o = 0), o += this.size, this.finderPenaltyAddHistory(o, n), this.finderPenaltyCountPatterns(n);
+    finderPenaltyTerminateAndCount(o, t, e) {
+      return o && (this.finderPenaltyAddHistory(t, e), t = 0), t += this.size, this.finderPenaltyAddHistory(t, e), this.finderPenaltyCountPatterns(e);
     }
     // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
-    finderPenaltyAddHistory(t, o) {
-      o[0] == 0 && (t += this.size), o.pop(), o.unshift(t);
+    finderPenaltyAddHistory(o, t) {
+      t[0] == 0 && (o += this.size), t.pop(), t.unshift(o);
     }
   };
   d.MIN_VERSION = 1, d.MAX_VERSION = 40, d.PENALTY_N1 = 3, d.PENALTY_N2 = 3, d.PENALTY_N3 = 40, d.PENALTY_N4 = 10, d.ECC_CODEWORDS_PER_BLOCK = [
@@ -394,17 +394,17 @@ var L;
   ];
   let i = d;
   r.QrCode = i;
-  function c(g, t, o) {
-    if (t < 0 || t > 31 || g >>> t)
+  function a(N, o, t) {
+    if (o < 0 || o > 31 || N >>> o)
       throw new RangeError("Value out of range");
-    for (let n = t - 1; n >= 0; n--)
-      o.push(g >>> n & 1);
+    for (let e = o - 1; e >= 0; e--)
+      t.push(N >>> e & 1);
   }
-  function s(g, t) {
-    return (g >>> t & 1) != 0;
+  function s(N, o) {
+    return (N >>> o & 1) != 0;
   }
-  function e(g) {
-    if (!g)
+  function n(N) {
+    if (!N)
       throw new Error("Assertion error");
   }
   const u = class u {
@@ -412,76 +412,76 @@ var L;
     // 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,
     // but the constraint isn't checked. The given bit buffer is cloned and stored.
-    constructor(t, o, n) {
-      if (this.mode = t, this.numChars = o, this.bitData = n, o < 0)
+    constructor(o, t, e) {
+      if (this.mode = o, this.numChars = t, this.bitData = e, t < 0)
         throw new RangeError("Invalid argument");
-      this.bitData = n.slice();
+      this.bitData = e.slice();
     }
     /*-- Static factory functions (mid level) --*/
     // Returns a segment representing the given binary data encoded in
     // byte mode. All input byte arrays are acceptable. Any text string
     // can be converted to UTF-8 bytes and encoded as a byte mode segment.
-    static makeBytes(t) {
-      let o = [];
-      for (const n of t)
-        c(n, 8, o);
-      return new u(u.Mode.BYTE, t.length, o);
+    static makeBytes(o) {
+      let t = [];
+      for (const e of o)
+        a(e, 8, t);
+      return new u(u.Mode.BYTE, o.length, t);
     }
     // Returns a segment representing the given string of decimal digits encoded in numeric mode.
-    static makeNumeric(t) {
-      if (!u.isNumeric(t))
+    static makeNumeric(o) {
+      if (!u.isNumeric(o))
         throw new RangeError("String contains non-numeric characters");
-      let o = [];
-      for (let n = 0; n < t.length; ) {
-        const a = Math.min(t.length - n, 3);
-        c(parseInt(t.substring(n, n + a), 10), a * 3 + 1, o), n += a;
+      let t = [];
+      for (let e = 0; e < o.length; ) {
+        const c = Math.min(o.length - e, 3);
+        a(parseInt(o.substring(e, e + c), 10), c * 3 + 1, t), e += c;
       }
-      return new u(u.Mode.NUMERIC, t.length, o);
+      return new u(u.Mode.NUMERIC, o.length, t);
     }
     // 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(t) {
-      if (!u.isAlphanumeric(t))
+    static makeAlphanumeric(o) {
+      if (!u.isAlphanumeric(o))
         throw new RangeError("String contains unencodable characters in alphanumeric mode");
-      let o = [], n;
-      for (n = 0; n + 2 <= t.length; n += 2) {
-        let a = u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n)) * 45;
-        a += u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n + 1)), c(a, 11, o);
+      let t = [], e;
+      for (e = 0; e + 2 <= o.length; e += 2) {
+        let c = u.ALPHANUMERIC_CHARSET.indexOf(o.charAt(e)) * 45;
+        c += u.ALPHANUMERIC_CHARSET.indexOf(o.charAt(e + 1)), a(c, 11, t);
       }
-      return n < t.length && c(u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n)), 6, o), new u(u.Mode.ALPHANUMERIC, t.length, o);
+      return e < o.length && a(u.ALPHANUMERIC_CHARSET.indexOf(o.charAt(e)), 6, t), new u(u.Mode.ALPHANUMERIC, o.length, t);
     }
     // 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(t) {
-      return t == "" ? [] : u.isNumeric(t) ? [u.makeNumeric(t)] : u.isAlphanumeric(t) ? [u.makeAlphanumeric(t)] : [u.makeBytes(u.toUtf8ByteArray(t))];
+    static makeSegments(o) {
+      return o == "" ? [] : u.isNumeric(o) ? [u.makeNumeric(o)] : u.isAlphanumeric(o) ? [u.makeAlphanumeric(o)] : [u.makeBytes(u.toUtf8ByteArray(o))];
     }
     // Returns a segment representing an Extended Channel Interpretation
     // (ECI) designator with the given assignment value.
-    static makeEci(t) {
-      let o = [];
-      if (t < 0)
+    static makeEci(o) {
+      let t = [];
+      if (o < 0)
         throw new RangeError("ECI assignment value out of range");
-      if (t < 128)
-        c(t, 8, o);
-      else if (t < 16384)
-        c(2, 2, o), c(t, 14, o);
-      else if (t < 1e6)
-        c(6, 3, o), c(t, 21, o);
+      if (o < 128)
+        a(o, 8, t);
+      else if (o < 16384)
+        a(2, 2, t), a(o, 14, t);
+      else if (o < 1e6)
+        a(6, 3, t), a(o, 21, t);
       else
         throw new RangeError("ECI assignment value out of range");
-      return new u(u.Mode.ECI, 0, o);
+      return new u(u.Mode.ECI, 0, t);
     }
     // 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(t) {
-      return u.NUMERIC_REGEX.test(t);
+    static isNumeric(o) {
+      return u.NUMERIC_REGEX.test(o);
     }
     // 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(t) {
-      return u.ALPHANUMERIC_REGEX.test(t);
+    static isAlphanumeric(o) {
+      return u.ALPHANUMERIC_REGEX.test(o);
     }
     /*-- Methods --*/
     // Returns a new copy of the data bits of this segment.
@@ -490,29 +490,29 @@ var L;
     }
     // (Package-private) Calculates and returns the number of bits needed to encode the given segments at
     // the given version. The result is infinity if a segment has too many characters to fit its length field.
-    static getTotalBits(t, o) {
-      let n = 0;
-      for (const a of t) {
-        const h = a.mode.numCharCountBits(o);
-        if (a.numChars >= 1 << h)
+    static getTotalBits(o, t) {
+      let e = 0;
+      for (const c of o) {
+        const h = c.mode.numCharCountBits(t);
+        if (c.numChars >= 1 << h)
           return 1 / 0;
-        n += 4 + h + a.bitData.length;
+        e += 4 + h + c.bitData.length;
       }
-      return n;
+      return e;
     }
     // Returns a new array of bytes representing the given string encoded in UTF-8.
-    static toUtf8ByteArray(t) {
-      t = encodeURI(t);
-      let o = [];
-      for (let n = 0; n < t.length; n++)
-        t.charAt(n) != "%" ? o.push(t.charCodeAt(n)) : (o.push(parseInt(t.substring(n + 1, n + 3), 16)), n += 2);
-      return o;
+    static toUtf8ByteArray(o) {
+      o = encodeURI(o);
+      let t = [];
+      for (let e = 0; e < o.length; e++)
+        o.charAt(e) != "%" ? t.push(o.charCodeAt(e)) : (t.push(parseInt(o.substring(e + 1, e + 3), 16)), e += 2);
+      return t;
     }
   };
   u.NUMERIC_REGEX = /^[0-9]*$/, u.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, u.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
   let l = u;
   r.QrSegment = l;
-})(L || (L = {}));
+})(v || (v = {}));
 ((r) => {
   ((i) => {
     const s = class s {
@@ -523,10 +523,10 @@ var L;
       }
     };
     s.LOW = new s(0, 1), s.MEDIUM = new s(1, 0), s.QUARTILE = new s(2, 3), s.HIGH = new s(3, 2);
-    let c = s;
-    i.Ecc = c;
+    let a = s;
+    i.Ecc = a;
   })(r.QrCode || (r.QrCode = {}));
-})(L || (L = {}));
+})(v || (v = {}));
 ((r) => {
   ((i) => {
     const s = class s {
@@ -542,16 +542,16 @@ var L;
       }
     };
     s.NUMERIC = new s(1, [10, 12, 14]), s.ALPHANUMERIC = new s(2, [9, 11, 13]), s.BYTE = new s(4, [8, 16, 16]), s.KANJI = new s(8, [8, 10, 12]), s.ECI = new s(7, [0, 0, 0]);
-    let c = s;
-    i.Mode = c;
+    let a = s;
+    i.Mode = a;
   })(r.QrSegment || (r.QrSegment = {}));
-})(L || (L = {}));
-const S = L, ct = {
+})(v || (v = {}));
+const S = v, lt = {
   L: S.QrCode.Ecc.LOW,
   M: S.QrCode.Ecc.MEDIUM,
   Q: S.QrCode.Ecc.QUARTILE,
   H: S.QrCode.Ecc.HIGH
-}, lt = 128, ht = "M", ut = 1, dt = 4, W = 5, H = "#000000", ft = "square", $t = "square", pt = "square", mt = "react-qr-code", U = "react-qr-code-gradient", F = "react-qr-code-bg-gradient", Et = 0.1, I = 7, v = 3, B = [
+}, ht = 128, ut = "M", dt = 1, $t = 4, W = 5, _ = "#000000", ft = "square", pt = "square", mt = "square", Et = "react-qr-code", b = "react-qr-code-gradient", F = "react-qr-code-bg-gradient", Mt = 0.1, g = 7, O = 3, B = [
   [1, 1, 1, 1, 1, 1, 1],
   [1, 0, 0, 0, 0, 0, 1],
   [1, 0, 0, 0, 0, 0, 1],
@@ -569,7 +569,7 @@ const S = L, ct = {
   "leaf-sm": [0, 90, -90],
   leaf: [0, 90, -90],
   "leaf-lg": [0, 90, -90]
-}, Y = {
+}, Q = {
   "rounded-sm": 3,
   rounded: 4,
   "rounded-lg": 5,
@@ -582,7 +582,7 @@ const S = L, ct = {
   "outpoint-sm": 3,
   outpoint: 4,
   "outpoint-lg": 5
-}, G = {
+}, k = {
   square: 0,
   diamond: 0,
   circle: 3,
@@ -598,7 +598,7 @@ const S = L, ct = {
   "outpoint-sm": 1.5,
   outpoint: 2,
   "outpoint-lg": 2.3
-}, z = [
+}, H = [
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 1, 1, 1, 0, 0],
@@ -606,29 +606,29 @@ const S = L, ct = {
   [0, 0, 1, 1, 1, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0]
-], Mt = /\.?0+$/;
-function Rt(r) {
-  return r.toFixed(7).replace(Mt, "");
+], Rt = /\.?0+$/;
+function gt(r) {
+  return r.toFixed(7).replace(Rt, "");
 }
 const tt = (r) => {
-  const i = r % 360 * (Math.PI / 180), c = Math.max(0, Math.min(100, 50 - 50 * Math.cos(i))), s = Math.max(0, Math.min(100, 50 - 50 * Math.sin(i))), e = Math.max(0, Math.min(100, 50 + 50 * Math.cos(i))), l = Math.max(0, Math.min(100, 50 + 50 * Math.sin(i)));
+  const i = r % 360 * (Math.PI / 180), a = Math.max(0, Math.min(100, 50 - 50 * Math.cos(i))), s = Math.max(0, Math.min(100, 50 - 50 * Math.sin(i))), n = Math.max(0, Math.min(100, 50 + 50 * Math.cos(i))), l = Math.max(0, Math.min(100, 50 + 50 * Math.sin(i)));
   return {
-    x1: `${c}%`,
+    x1: `${a}%`,
     y1: `${s}%`,
-    x2: `${e}%`,
+    x2: `${n}%`,
     y2: `${l}%`
   };
-}, et = (r, i, c, s) => {
-  const e = c / 2, l = e / 2, d = Math.PI / s;
+}, et = (r, i, a, s) => {
+  const n = a / 2, l = n / 2, d = Math.PI / s;
   let u = "";
-  for (let g = 0; g < 2 * s; g++) {
-    const t = g * d - Math.PI / 2, o = g % 2 === 0 ? e : l, n = r + o * Math.cos(t), a = i + o * Math.sin(t);
-    u += `${g === 0 ? "M" : "L"} ${n},${a} `;
+  for (let N = 0; N < 2 * s; N++) {
+    const o = N * d - Math.PI / 2, t = N % 2 === 0 ? n : l, e = r + t * Math.cos(o), c = i + t * Math.sin(o);
+    u += `${N === 0 ? "M" : "L"} ${e},${c} `;
   }
   return u + "Z";
-}, ot = (r, i, c) => {
-  const s = c / 8;
-  return `M ${r + c} ${i + s * 3} 
+}, ot = (r, i, a, s) => `M ${r} ${i}Q ${r + s} ${i + a / 2}, ${r} ${i + a}Q ${r + a / 2} ${i + a - s}, ${r + a} ${i + a}Q ${r + a - s} ${i + a / 2}, ${r + a} ${i}Q ${r + a / 2} ${i + s}, ${r} ${i}Z`, nt = (r, i, a) => {
+  const s = a / 8;
+  return `M ${r + a} ${i + s * 3} 
    V ${i + s}
    h -${s}
    V ${i}
@@ -658,8 +658,8 @@ const tt = (r) => {
    V ${i + s * 3}
    h ${s}
    Z`;
-}, nt = (r, i, c) => {
-  let s = !1, e = 0;
+}, rt = (r, i, a) => {
+  let s = !1, n = 0;
   return [
     "M",
     1,
@@ -771,18 +771,18 @@ const tt = (r) => {
     1,
     0.3262506,
     "z"
-  ].map((l) => typeof l == "string" ? (e = 0, s = l.toUpperCase() == l, l) : (e++, l = l * c, s && (l += e % 2 == 1 ? r : i), Rt(l))).join(" ");
-}, x = {
+  ].map((l) => typeof l == "string" ? (n = 0, s = l.toUpperCase() == l, l) : (n++, l = l * a, s && (l += n % 2 == 1 ? r : i), gt(l))).join(" ");
+}, q = {
   "data-testid": "background"
-}, gt = ({ background: r, numCells: i }) => {
-  var s, e;
+}, Nt = ({ background: r, numCells: i }) => {
+  var s, n;
   if (!r)
     return null;
   if (typeof r == "string")
-    return /* @__PURE__ */ C("path", { fill: r, d: `M0,0 h${i}v${i}H0z`, ...x });
-  const c = tt((r == null ? void 0 : r.rotation) || 0);
-  return /* @__PURE__ */ K(rt, { children: [
-    /* @__PURE__ */ C("defs", { children: r.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: F, gradientUnits: "userSpaceOnUse", ...c, children: (s = r.stops) == null ? void 0 : s.map((l, d) => /* @__PURE__ */ C("stop", { offset: l.offset, stopColor: l.color }, d)) }) : /* @__PURE__ */ C(
+    return /* @__PURE__ */ w("path", { fill: r, d: `M0,0 h${i}v${i}H0z`, ...q });
+  const a = tt((r == null ? void 0 : r.rotation) || 0);
+  return /* @__PURE__ */ K(st, { children: [
+    /* @__PURE__ */ w("defs", { children: r.type === "linear" ? /* @__PURE__ */ w("linearGradient", { id: F, gradientUnits: "userSpaceOnUse", ...a, children: (s = r.stops) == null ? void 0 : s.map((l, d) => /* @__PURE__ */ w("stop", { offset: l.offset, stopColor: l.color }, d)) }) : /* @__PURE__ */ w(
       "radialGradient",
       {
         id: F,
@@ -790,224 +790,231 @@ const tt = (r) => {
         cx: "50%",
         cy: "50%",
         r: "50%",
-        children: (e = r.stops) == null ? void 0 : e.map((l, d) => /* @__PURE__ */ C("stop", { offset: l.offset, stopColor: l.color }, d))
+        children: (n = r.stops) == null ? void 0 : n.map((l, d) => /* @__PURE__ */ w("stop", { offset: l.offset, stopColor: l.color }, d))
       }
     ) }),
-    /* @__PURE__ */ C(
+    /* @__PURE__ */ w(
       "path",
       {
         fill: `url(#${F})`,
         d: `M0,0 h${i}v${i}H0z`,
-        ...x
+        ...q
       }
     )
   ] });
-}, wt = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond" || r === "hashtag", At = (r, i) => r === "square-sm" ? 0.75 : i ? Math.random() * (1 - 0.75) + 0.75 : 1, b = (r, i, c) => {
+}, It = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond" || r === "hashtag", Ct = (r, i) => r === "square-sm" ? 0.75 : i ? Math.random() * (1 - 0.75) + 0.75 : 1, D = (r, i, a) => {
   const s = {
-    left: r === 0 ? !1 : c[i][r - 1],
-    right: r === c[i].length - 1 ? !1 : c[i][r + 1],
-    top: i === 0 ? !1 : c[i - 1][r],
-    bottom: i === c.length - 1 ? !1 : c[i + 1][r]
+    left: r === 0 ? !1 : a[i][r - 1],
+    right: r === a[i].length - 1 ? !1 : a[i][r + 1],
+    top: i === 0 ? !1 : a[i - 1][r],
+    bottom: i === a.length - 1 ? !1 : a[i + 1][r]
   };
   return {
     ...s,
     count: Object.values(s).filter(Boolean).length
   };
-}, y = (r, i, c) => `M${r},${i}h${c}v${c}h-${c}Z`, D = (r, i, c) => `M${r},${i + c / 2}a${c / 2},${c / 2} 0 1,0 ${c},0a${c / 2},${c / 2} 0 1,0 -${c},0Z`, Ct = (r, i, c) => `M${r},${i + c / 2}l${c / 2},-${c / 2}l${c / 2},${c / 2}l-${c / 2},${c / 2}Z`, Nt = (r, i) => `M ${r} ${i} 
+}, U = (r, i, a) => `M${r},${i}h${a}v${a}h-${a}Z`, y = (r, i, a) => `M${r},${i + a / 2}a${a / 2},${a / 2} 0 1,0 ${a},0a${a / 2},${a / 2} 0 1,0 -${a},0Z`, wt = (r, i, a) => `M${r},${i + a / 2}l${a / 2},-${a / 2}l${a / 2},${a / 2}l-${a / 2},${a / 2}Z`, At = (r, i) => `M ${r} ${i} 
    v 1 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, q = (r, i) => `M ${r + 1} ${i} 
+   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, Y = (r, i) => `M ${r + 1} ${i} 
    v 1 
    h -1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, j = (r, i) => `M ${r} ${i} 
+   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, G = (r, i) => `M ${r} ${i} 
    v 1 
    h 0.5 
    a 0.5 0.5, 0, 0, 0, 0.5 -0.5
    v -0.5
-   h -1`, It = (r, i) => `M ${r + 1} ${i} 
+   h -1`, Pt = (r, i) => `M ${r + 1} ${i} 
    v 1 
    h -0.5 
    a 0.5 0.5, 0, 0, 1, -0.5 -0.5 
    v -0.5 
-   h 1`, V = (r, i) => `M ${r} ${i} 
+   h 1`, j = (r, i) => `M ${r} ${i} 
    v 1 
    h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0 -1`, X = (r, i) => `M ${r + 1} ${i} 
+   a 0.5 0.5, 0, 0, 0, 0 -1`, V = (r, i) => `M ${r + 1} ${i} 
    v 1 
    h -0.5 
-   a 0.5 0.5, 0, 0, 1, 0 -1`, Z = (r, i) => `M ${r} ${i + 1} 
+   a 0.5 0.5, 0, 0, 1, 0 -1`, X = (r, i) => `M ${r} ${i + 1} 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -1 0`, Q = (r, i) => `M ${r} ${i} 
+   a 0.5 0.5, 0, 0, 0, -1 0`, Z = (r, i) => `M ${r} ${i} 
    h 1 
    v 0.5 
-   a 0.5 0.5, 0, 0, 1, -1 0`, Pt = (r, i, c) => `M ${r + 1} ${i}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}`, vt = ({
+   a 0.5 0.5, 0, 0, 1, -1 0`, Ot = (r, i, a) => `M ${r + 1} ${i}h -${a / 2}a ${a / 2.5} ${a / 2.5}, 0, 0, 0, ${-a / 2.5} ${a / 2.5}v ${a / 2}h ${a / 2}a ${a / 2.5} ${a / 2.5}, 0, 0, 0, ${a / 2.5} ${-a / 2.5}`, Tt = ({
   x: r,
   y: i,
-  numCells: c
+  numCells: a
 }) => {
-  var s, e, l;
-  return !!((s = z[r]) != null && s[i] || (e = z[r - c + 7]) != null && e[i] || (l = z[r]) != null && l[i - c + 7]);
-}, Tt = ({
+  var s, n, l;
+  return !!((s = H[r]) != null && s[i] || (n = H[r - a + 7]) != null && n[i] || (l = H[r]) != null && l[i - a + 7]);
+}, Lt = ({
   x: r,
   y: i,
-  radius: c
+  radius: a
 }) => {
-  const s = v - c, e = c / 2, l = v - e;
-  return `M ${r} ${i + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${l}v ${-l}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}H ${r}z`;
-}, Lt = ({
+  const s = O - a, n = a / 2, l = O - n;
+  return `M ${r} ${i + n}v ${s}a ${n} ${n}, 0, 0, 0, ${n} ${n}h ${l}v ${-l}a ${n} ${n}, 0, 0, 0, ${-n} ${-n}h ${-s}H ${r}z`;
+}, vt = ({
   x: r,
   y: i,
-  radius: c
+  radius: a
 }) => {
-  const s = v - c, e = c / 2, l = v - e;
-  return `M ${r} ${i + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${l}v ${-l}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}a ${e} ${e}, 0, 0, 0, ${-e} ${e}`;
-}, Ot = ({
+  const s = O - a, n = a / 2, l = O - n;
+  return `M ${r} ${i + n}v ${s}a ${n} ${n}, 0, 0, 0, ${n} ${n}h ${l}v ${-l}a ${n} ${n}, 0, 0, 0, ${-n} ${-n}h ${-s}a ${n} ${n}, 0, 0, 0, ${-n} ${n}`;
+}, St = ({
   x: r,
   y: i,
-  numCells: c
+  numCells: a
 }) => {
-  var s, e, l;
-  return !!((s = B[r]) != null && s[i] || (e = B[r - c + 7]) != null && e[i] || (l = B[r]) != null && l[i - c + 7]);
-}, St = ({
+  var s, n, l;
+  return !!((s = B[r]) != null && s[i] || (n = B[r - a + 7]) != null && n[i] || (l = B[r]) != null && l[i - a + 7]);
+}, Ut = ({
   x: r,
   y: i,
-  radius: c
+  radius: a
 }) => {
-  const s = I - c, e = c / 2;
-  return `M ${r} ${i + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${s}a ${e} ${e}, 0, 0, 0, ${e} ${-e}v ${-s}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}a ${e} ${e}, 0, 0, 0, ${-e} ${e}M ${r + e} ${i + 1}h ${s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${e - 1}v ${s}a ${e - 1} ${e - 1}, 0, 0, 1, ${-(e - 1)} ${e - 1}h ${-s}a ${e - 1} ${e - 1}, 0, 0, 1, ${-(e - 1)} ${-(e - 1)}v ${-s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${-(e - 1)}`;
-}, yt = ({
+  const s = g - a, n = a / 2;
+  return `M ${r} ${i + n}v ${s}a ${n} ${n}, 0, 0, 0, ${n} ${n}h ${s}a ${n} ${n}, 0, 0, 0, ${n} ${-n}v ${-s}a ${n} ${n}, 0, 0, 0, ${-n} ${-n}h ${-s}a ${n} ${n}, 0, 0, 0, ${-n} ${n}M ${r + n} ${i + 1}h ${s}a ${n - 1} ${n - 1}, 0, 0, 1, ${n - 1} ${n - 1}v ${s}a ${n - 1} ${n - 1}, 0, 0, 1, ${-(n - 1)} ${n - 1}h ${-s}a ${n - 1} ${n - 1}, 0, 0, 1, ${-(n - 1)} ${-(n - 1)}v ${-s}a ${n - 1} ${n - 1}, 0, 0, 1, ${n - 1} ${-(n - 1)}`;
+}, bt = ({
   x: r,
   y: i,
-  radius: c
+  radius: a
 }) => {
-  const s = I - c, e = c / 2, l = I - e;
-  return `M ${r} ${i + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${l}v ${-l}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}H ${r}zM ${r + e} ${i + 1}h ${s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${e - 1}v ${l - 1}h ${-(l - 1)}a ${e - 1} ${e - 1}, 0, 0, 1, ${-(e - 1)} ${-(e - 1)}v ${-(l - 1)}z`;
-}, Ut = ({
+  const s = g - a, n = a / 2, l = g - n;
+  return `M ${r} ${i + n}v ${s}a ${n} ${n}, 0, 0, 0, ${n} ${n}h ${l}v ${-l}a ${n} ${n}, 0, 0, 0, ${-n} ${-n}h ${-s}H ${r}zM ${r + n} ${i + 1}h ${s}a ${n - 1} ${n - 1}, 0, 0, 1, ${n - 1} ${n - 1}v ${l - 1}h ${-(l - 1)}a ${n - 1} ${n - 1}, 0, 0, 1, ${-(n - 1)} ${-(n - 1)}v ${-(l - 1)}z`;
+}, Dt = ({
   x: r,
   y: i,
-  radius: c
+  radius: a
 }) => {
-  const s = I - c, e = c / 2, l = I - e;
-  return `M ${r} ${i + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${l}v ${-l}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}a ${e} ${e}, 0, 0, 0, ${-e} ${e}M ${r + e} ${i + 1}h ${s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${e - 1}v ${l - 1}h ${-(l - 1)}a ${e - 1} ${e - 1}, 0, 0, 1, ${-(e - 1)} ${-(e - 1)}v ${-s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${-(e - 1)}`;
-}, bt = (r) => ({
-  color: (r == null ? void 0 : r.color) || H,
-  style: (r == null ? void 0 : r.style) || pt,
+  const s = g - a, n = a / 2, l = g - n;
+  return `M ${r} ${i + n}v ${s}a ${n} ${n}, 0, 0, 0, ${n} ${n}h ${l}v ${-l}a ${n} ${n}, 0, 0, 0, ${-n} ${-n}h ${-s}a ${n} ${n}, 0, 0, 0, ${-n} ${n}M ${r + n} ${i + 1}h ${s}a ${n - 1} ${n - 1}, 0, 0, 1, ${n - 1} ${n - 1}v ${l - 1}h ${-(l - 1)}a ${n - 1} ${n - 1}, 0, 0, 1, ${-(n - 1)} ${-(n - 1)}v ${-s}a ${n - 1} ${n - 1}, 0, 0, 1, ${n - 1} ${-(n - 1)}`;
+}, yt = (r) => ({
+  color: (r == null ? void 0 : r.color) || _,
+  style: (r == null ? void 0 : r.style) || mt,
   randomSize: (r == null ? void 0 : r.randomSize) || !1
-}), Dt = (r) => ({
-  color: (r == null ? void 0 : r.color) || H,
-  style: (r == null ? void 0 : r.style) || ft
 }), Ft = (r) => ({
-  color: (r == null ? void 0 : r.color) || H,
-  style: (r == null ? void 0 : r.style) || $t
-}), Bt = ({
+  color: (r == null ? void 0 : r.color) || _,
+  style: (r == null ? void 0 : r.style) || ft
+}), Bt = (r) => ({
+  color: (r == null ? void 0 : r.color) || _,
+  style: (r == null ? void 0 : r.style) || pt
+}), Ht = ({
   modules: r,
   margin: i,
-  settings: c,
+  settings: a,
   gradient: s
 }) => {
-  const { color: e, style: l, randomSize: d } = T(
-    () => bt(c),
-    [c]
-  ), u = [], g = r.length, t = wt(l) && d, o = st(
-    () => At(l, t),
-    [l, t]
+  const { color: n, style: l, randomSize: d } = L(
+    () => yt(a),
+    [a]
+  ), u = [], N = r.length, o = It(l) && d, t = it(
+    () => Ct(l, o),
+    [l, o]
   );
-  return r.forEach((n, a) => {
-    n.forEach((h, $) => {
-      if (Ot({ x: $, y: a, numCells: g }) || vt({ x: $, y: a, numCells: g }))
+  return r.forEach((e, c) => {
+    e.forEach((h, f) => {
+      if (St({ x: f, y: c, numCells: N }) || Tt({ x: f, y: c, numCells: N }))
         return;
-      const f = o(), p = 1 * f, M = (1 - 1 * f) / 2, E = $ + i + M, m = a + i + M;
+      const $ = t(), p = 1 * $, M = (1 - 1 * $) / 2, E = f + i + M, m = c + i + M;
       if (h) {
         if (l === "square" || l === "square-sm")
-          u.push(y(E, m, p));
+          u.push(U(E, m, p));
+        else if (l === "pinched-square")
+          u.push(ot(E, m, p, 0.25));
         else if (l === "circle")
-          u.push(D(E, m, p));
+          u.push(y(E, m, p));
         else if (l === "diamond")
-          u.push(Ct(E, m, p));
+          u.push(wt(E, m, p));
         else if (l === "star")
           u.push(
             et(E + p / 2, m + p / 2, p * 1.1, W)
           );
         else if (l === "heart")
-          u.push(nt(E, m, p));
+          u.push(rt(E, m, p));
         else if (l === "hashtag")
-          u.push(ot(E, m, p));
+          u.push(nt(E, m, p));
         else if (l === "rounded") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, a, r);
-          P === 0 ? u.push(D(E, m, 1)) : P > 2 || R && w || A && N ? u.push(y(E, m, 1)) : P === 2 ? R && A ? u.push(j(E, m)) : A && w ? u.push(It(E, m)) : w && N ? u.push(q(E, m)) : u.push(Nt(E, m)) : A ? u.push(Q(E, m)) : w ? u.push(X(E, m)) : N ? u.push(Z(E, m)) : u.push(V(E, m));
+          const { left: R, right: I, top: C, bottom: A, count: P } = D(f, c, r);
+          P === 0 ? u.push(y(E, m, 1)) : P > 2 || R && I || C && A ? u.push(U(E, m, 1)) : P === 2 ? R && C ? u.push(G(E, m)) : C && I ? u.push(Pt(E, m)) : I && A ? u.push(Y(E, m)) : u.push(At(E, m)) : C ? u.push(Z(E, m)) : I ? u.push(V(E, m)) : A ? u.push(X(E, m)) : u.push(j(E, m));
         } else if (l === "leaf") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, a, r);
+          const { left: R, right: I, top: C, bottom: A, count: P } = D(f, c, r);
           if (P === 0)
-            u.push(Pt(E, m, p));
-          else if (!R && !A) {
-            u.push(q(E, m));
+            u.push(Ot(E, m, p));
+          else if (!R && !C) {
+            u.push(Y(E, m));
             return;
-          } else !w && !N ? u.push(j(E, m)) : u.push(y(E, m, 1));
+          } else !I && !A ? u.push(G(E, m)) : u.push(U(E, m, 1));
         } else if (l === "vertical-line") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, a, r);
-          P === 0 || R && !(A || N) || w && !(A || N) ? u.push(D(E, m, 1)) : A && N ? u.push(y(E, m, 1)) : A && !N ? u.push(Q(E, m)) : N && !A && u.push(Z(E, m));
+          const { left: R, right: I, top: C, bottom: A, count: P } = D(f, c, r);
+          P === 0 || R && !(C || A) || I && !(C || A) ? u.push(y(E, m, 1)) : C && A ? u.push(U(E, m, 1)) : C && !A ? u.push(Z(E, m)) : A && !C && u.push(X(E, m));
         } else if (l === "horizontal-line") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, a, r);
-          P === 0 || A && !(R || w) || N && !(R || w) ? u.push(D(E, m, 1)) : R && w ? u.push(y(E, m, 1)) : R && !w ? u.push(V(E, m)) : w && !R && u.push(X(E, m));
+          const { left: R, right: I, top: C, bottom: A, count: P } = D(f, c, r);
+          P === 0 || C && !(R || I) || A && !(R || I) ? u.push(y(E, m, 1)) : R && I ? u.push(U(E, m, 1)) : R && !I ? u.push(j(E, m)) : I && !R && u.push(V(E, m));
         }
       }
     });
-  }), /* @__PURE__ */ C(
+  }), /* @__PURE__ */ w(
     "path",
     {
-      fill: s ? `url(#${U})` : e,
+      fill: s ? `url(#${b})` : n,
       d: u.join(""),
       shapeRendering: l === "square" ? "crispEdges" : "geometricPrecision",
       "data-testid": "data-modules"
     }
   );
-}, O = {
+}, T = {
   "data-testid": "finder-patterns-inner"
-}, zt = ({
+}, _t = ({
   modules: r,
   margin: i,
-  settings: c,
+  settings: a,
   gradient: s
 }) => {
-  const { color: e, style: l } = T(
-    () => Ft(c),
-    [c]
-  ), d = s ? `url(#${U})` : e, u = T(
+  const { color: n, style: l } = L(
+    () => Bt(a),
+    [a]
+  ), d = s ? `url(#${b})` : n, u = L(
     () => [
       { x: i + 2, y: i + 2 },
-      { x: r.length + i - I + 2, y: i + 2 },
-      { x: i + 2, y: r.length + i - I + 2 }
+      { x: r.length + i - g + 2, y: i + 2 },
+      { x: i + 2, y: r.length + i - g + 2 }
     ],
     [i, r.length]
-  ), g = (t, o) => `finder-patterns-inner-${l}-${t}-${o}`;
+  ), N = (o, t) => `finder-patterns-inner-${l}-${o}-${t}`;
   if (l === "rounded-sm" || l === "rounded" || l === "rounded-lg" || l === "circle" || l === "square")
-    return u.map((t) => {
-      const { x: o, y: n } = t;
-      return /* @__PURE__ */ C(
+    return u.map((o) => {
+      const { x: t, y: e } = o;
+      return /* @__PURE__ */ w(
         "rect",
         {
-          x: o,
-          y: n,
-          width: v,
-          height: v,
+          x: t,
+          y: e,
+          width: O,
+          height: O,
           fill: d,
-          rx: G[l],
-          ...O
+          rx: k[l],
+          ...T
         },
-        g(o, n)
+        N(t, e)
       );
     });
+  if (l === "pinched-square")
+    return u.map((o) => {
+      const { x: t, y: e } = o, c = ot(t, e, O, 0.25);
+      return /* @__PURE__ */ w("path", { fill: d, d: c, ...T }, N(t, e));
+    });
   if (l === "diamond")
-    return u.map((t) => {
-      const { x: o, y: n } = t, a = Math.sqrt(1.5), h = v / a, $ = h - h / a;
-      return /* @__PURE__ */ C(
+    return u.map((o) => {
+      const { x: t, y: e } = o, c = Math.sqrt(1.5), h = O / c, f = h - h / c;
+      return /* @__PURE__ */ w(
         "rect",
         {
-          x: o + $ / 2,
-          y: n + $ / 2,
+          x: t + f / 2,
+          y: e + f / 2,
           width: h,
           height: h,
           fill: d,
@@ -1016,257 +1023,266 @@ const tt = (r) => {
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...O
+          ...T
         },
-        g(o, n)
+        N(t, e)
       );
     });
   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 t = l === "leaf-sm" || l === "leaf" || l === "leaf-lg" ? Tt : Lt;
-    return u.map((o, n) => ({
-      ...o,
-      rotation: J[l][n]
-    })).map(({ x: o, y: n, rotation: a }) => {
-      const h = t({
-        x: o,
-        y: n,
-        radius: G[l]
+    const o = l === "leaf-sm" || l === "leaf" || l === "leaf-lg" ? Lt : vt;
+    return u.map((t, e) => ({
+      ...t,
+      rotation: J[l][e]
+    })).map(({ x: t, y: e, rotation: c }) => {
+      const h = o({
+        x: t,
+        y: e,
+        radius: k[l]
       });
-      return /* @__PURE__ */ C(
+      return /* @__PURE__ */ w(
         "path",
         {
           fill: d,
           d: h,
           style: {
-            transform: `rotate(${a}deg)`,
+            transform: `rotate(${c}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...O
+          ...T
         },
-        g(o, n)
+        N(t, e)
       );
     });
   }
   if (l === "heart")
-    return u.map(({ x: t, y: o }) => /* @__PURE__ */ C(
+    return u.map(({ x: o, y: t }) => /* @__PURE__ */ w(
       "path",
       {
         fill: d,
-        d: nt(t, o, v),
-        ...O
+        d: rt(o, t, O),
+        ...T
       },
-      g(t, o)
+      N(o, t)
     ));
   if (l === "star")
-    return u.map(({ x: t, y: o }) => {
-      const n = t + v / 2, a = o + v / 2, h = et(n, a, v * 1.2, W);
-      return /* @__PURE__ */ C("path", { fill: d, d: h, ...O }, g(t, o));
+    return u.map(({ x: o, y: t }) => {
+      const e = o + O / 2, c = t + O / 2, h = et(e, c, O * 1.2, W);
+      return /* @__PURE__ */ w("path", { fill: d, d: h, ...T }, N(o, t));
     });
   if (l === "hashtag")
-    return u.map(({ x: t, y: o }) => {
-      const n = ot(t - 0.25, o - 0.25, 3.5);
-      return /* @__PURE__ */ C("path", { fill: d, d: n, ...O }, g(t, o));
+    return u.map(({ x: o, y: t }) => {
+      const e = nt(o - 0.25, t - 0.25, 3.5);
+      return /* @__PURE__ */ w("path", { fill: d, d: e, ...T }, N(o, t));
     });
-}, _ = {
+}, x = {
   "data-testid": "finder-patterns-outer"
-}, Ht = ({
+}, zt = ({
   modules: r,
   margin: i,
-  settings: c,
+  settings: a,
   gradient: s
 }) => {
-  const { style: e, color: l } = T(
-    () => Dt(c),
-    [c]
-  ), d = s ? `url(#${U})` : l, u = [], g = T(
+  const { style: n, color: l } = L(
+    () => Ft(a),
+    [a]
+  ), d = s ? `url(#${b})` : l, u = [], N = L(
     () => [
       { x: i, y: i },
-      { x: r.length + i - I, y: i },
-      { x: i, y: r.length + i - I }
+      { x: r.length + i - g, y: i },
+      { x: i, y: r.length + i - g }
     ],
     [i, r.length]
   );
-  if (["rounded-sm", "rounded", "rounded-lg", "circle", "square"].includes(e)) {
-    for (const t of g) {
-      const { x: o, y: n } = t;
-      e === "rounded-sm" || e === "rounded" || e === "rounded-lg" ? u.push(
-        St({
-          x: o,
-          y: n,
-          radius: Y[e]
+  if ([
+    "rounded-sm",
+    "rounded",
+    "rounded-lg",
+    "circle",
+    "square",
+    "pinched-square"
+  ].includes(n)) {
+    for (const o of N) {
+      const { x: t, y: e } = o;
+      n === "rounded-sm" || n === "rounded" || n === "rounded-lg" ? u.push(
+        Ut({
+          x: t,
+          y: e,
+          radius: Q[n]
         })
-      ) : e === "circle" ? u.push(
-        `M ${o + I / 2} ${n}a ${I / 2} ${I / 2} 0 1 0 0.01 0zzm 0 1a ${I / 2 - 1} ${I / 2 - 1} 0 1 1 -0.01 0Z`
+      ) : n === "circle" ? u.push(
+        `M ${t + g / 2} ${e}a ${g / 2} ${g / 2} 0 1 0 0.01 0zzm 0 1a ${g / 2 - 1} ${g / 2 - 1} 0 1 1 -0.01 0Z`
+      ) : n === "pinched-square" ? u.push(
+        `M ${t} ${e}Q ${t + 0.5} ${e + g / 2}, ${t} ${e + g}Q ${t + g / 2} ${e + g - 0.5}, ${t + g} ${e + g}Q ${t + g - 0.5} ${e + g / 2}, ${t + g} ${e}Q ${t + g / 2} ${e + 0.5}, ${t} ${e}zM ${t + 1} ${e + 1}Q ${t + g / 2} ${e + 1.25}, ${t + g - 1} ${e + 1}Q ${t + g - 1.25} ${e + g / 2}, ${t + g - 1} ${e + g - 1}Q ${t + g / 2} ${e + g - 1.25}, ${t + 1} ${e + g - 1}Q ${t + 1.25} ${e + g / 2}, ${t + 1} ${e + 1}z`
       ) : u.push(
-        `M ${o} ${n}v ${I}h ${I}v -7zM ${o + 1} ${n + 1}h ${I - 2 * 1}v ${I - 2 * 1}h ${-7 + 2 * 1}z`
+        `M ${t} ${e}v ${g}h ${g}v -7zM ${t + 1} ${e + 1}h ${g - 2}v ${g - 2}h -5z`
       );
     }
-    return /* @__PURE__ */ C("path", { fill: d, d: u.join(""), ..._ });
+    return /* @__PURE__ */ w("path", { fill: d, d: u.join(""), ...x });
   }
-  if (e === "inpoint-sm" || e === "inpoint" || e === "inpoint-lg" || e === "outpoint-sm" || e === "outpoint" || e === "outpoint-lg" || e === "leaf-sm" || e === "leaf" || e === "leaf-lg") {
-    const t = e === "leaf-sm" || e === "leaf" || e === "leaf-lg" ? yt : Ut;
-    return g.map((o, n) => ({
-      ...o,
-      rotation: J[e][n]
-    })).map(({ x: o, y: n, rotation: a }) => {
-      const h = t({
-        x: o,
-        y: n,
-        radius: Y[e]
+  if (n === "inpoint-sm" || n === "inpoint" || n === "inpoint-lg" || n === "outpoint-sm" || n === "outpoint" || n === "outpoint-lg" || n === "leaf-sm" || n === "leaf" || n === "leaf-lg") {
+    const o = n === "leaf-sm" || n === "leaf" || n === "leaf-lg" ? bt : Dt;
+    return N.map((t, e) => ({
+      ...t,
+      rotation: J[n][e]
+    })).map(({ x: t, y: e, rotation: c }) => {
+      const h = o({
+        x: t,
+        y: e,
+        radius: Q[n]
       });
-      return /* @__PURE__ */ C(
+      return /* @__PURE__ */ w(
         "path",
         {
           fill: d,
           d: h,
           style: {
-            transform: `rotate(${a}deg)`,
+            transform: `rotate(${c}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ..._
+          ...x
         },
-        `finder-patterns-outer-${e}-${o}-${n}`
+        `finder-patterns-outer-${n}-${t}-${e}`
       );
     });
   }
-}, kt = ({ gradient: r }) => {
-  var c, s;
+}, Qt = ({ gradient: r }) => {
+  var a, s;
   if (!r)
     return null;
   const i = tt((r == null ? void 0 : r.rotation) || 0);
-  return /* @__PURE__ */ C("defs", { children: r.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: U, gradientUnits: "userSpaceOnUse", ...i, children: (c = r.stops) == null ? void 0 : c.map((e, l) => /* @__PURE__ */ C("stop", { offset: e.offset, stopColor: e.color }, l)) }) : /* @__PURE__ */ C(
+  return /* @__PURE__ */ w("defs", { children: r.type === "linear" ? /* @__PURE__ */ w("linearGradient", { id: b, gradientUnits: "userSpaceOnUse", ...i, children: (a = r.stops) == null ? void 0 : a.map((n, l) => /* @__PURE__ */ w("stop", { offset: n.offset, stopColor: n.color }, l)) }) : /* @__PURE__ */ w(
     "radialGradient",
     {
-      id: U,
+      id: b,
       gradientUnits: "userSpaceOnUse",
       cx: "50%",
       cy: "50%",
       r: "50%",
-      children: (s = r.stops) == null ? void 0 : s.map((e, l) => /* @__PURE__ */ C("stop", { offset: e.offset, stopColor: e.color }, l))
+      children: (s = r.stops) == null ? void 0 : s.map((n, l) => /* @__PURE__ */ w("stop", { offset: n.offset, stopColor: n.color }, l))
     }
   ) });
-}, Yt = (r, i) => r.slice().map((c, s) => s < i.y || s >= i.y + i.h ? c : c.map((e, l) => l < i.x || l >= i.x + i.w ? e : !1)), Gt = (r, i, c, s) => {
+}, kt = (r, i) => r.slice().map((a, s) => s < i.y || s >= i.y + i.h ? a : a.map((n, l) => l < i.x || l >= i.x + i.w ? n : !1)), qt = (r, i, a, s) => {
   if (s == null)
     return null;
-  const e = r.length + c * 2, l = Math.floor(i * Et), d = e / i, u = (s.width || l) * d, g = (s.height || l) * d, t = s.x == null ? r.length / 2 - u / 2 : s.x * d, o = s.y == null ? r.length / 2 - g / 2 : s.y * d, n = s.opacity == null ? 1 : s.opacity;
-  let a = null;
+  const n = r.length + a * 2, l = Math.floor(i * Mt), d = n / i, u = (s.width || l) * d, N = (s.height || l) * d, o = s.x == null ? r.length / 2 - u / 2 : s.x * d, t = s.y == null ? r.length / 2 - N / 2 : s.y * d, e = s.opacity == null ? 1 : s.opacity;
+  let c = null;
   if (s.excavate) {
-    const $ = Math.floor(t), f = Math.floor(o), p = Math.ceil(u + t - $), M = Math.ceil(g + o - f);
-    a = { x: $, y: f, w: p, h: M };
+    const f = Math.floor(o), $ = Math.floor(t), p = Math.ceil(u + o - f), M = Math.ceil(N + t - $);
+    c = { x: f, y: $, w: p, h: M };
   }
   const h = s.crossOrigin;
-  return { x: t, y: o, h: g, w: u, excavation: a, opacity: n, crossOrigin: h };
-}, xt = (r) => r != null ? Math.max(Math.floor(r), 0) : dt, qt = ({
+  return { x: o, y: t, h: N, w: u, excavation: c, opacity: e, crossOrigin: h };
+}, Yt = (r) => r != null ? Math.max(Math.floor(r), 0) : $t, Gt = ({
   value: r,
   level: i,
-  minVersion: c,
+  minVersion: a,
   marginSize: s,
-  imageSettings: e,
+  imageSettings: n,
   size: l,
   boostLevel: d
 }) => {
-  const u = T(() => {
-    const h = (Array.isArray(r) ? r : [r]).reduce(($, f) => ($.push(...S.QrSegment.makeSegments(f)), $), []);
+  const u = L(() => {
+    const h = (Array.isArray(r) ? r : [r]).reduce((f, $) => (f.push(...S.QrSegment.makeSegments($)), f), []);
     return S.QrCode.encodeSegments(
       h,
-      ct[i],
-      c,
+      lt[i],
+      a,
       void 0,
       void 0,
       d
     );
-  }, [r, i, c, d]), { cells: g, margin: t, numCells: o, calculatedImageSettings: n } = T(() => {
-    const a = u.getModules(), h = xt(s), $ = a.length + h * 2, f = Gt(a, l, h, e);
+  }, [r, i, a, d]), { cells: N, margin: o, numCells: t, calculatedImageSettings: e } = L(() => {
+    const c = u.getModules(), h = Yt(s), f = c.length + h * 2, $ = qt(c, l, h, n);
     return {
-      cells: a,
+      cells: c,
       margin: h,
-      numCells: $,
-      calculatedImageSettings: f
+      numCells: f,
+      calculatedImageSettings: $
     };
-  }, [u, l, e, s]);
+  }, [u, l, n, s]);
   return {
     qrcode: u,
-    margin: t,
-    cells: g,
-    numCells: o,
-    calculatedImageSettings: n
+    margin: o,
+    cells: N,
+    numCells: t,
+    calculatedImageSettings: e
   };
-}, jt = ({ svgRef: r, fileSize: i, fileName: c }) => {
+}, jt = ({ svgRef: r, fileSize: i, fileName: a }) => {
   if (!r.current) return;
   const s = r.current.cloneNode(!0);
   s.setAttribute("width", i.toString()), s.setAttribute("height", i.toString());
-  const e = new XMLSerializer(), l = new Blob([e.serializeToString(s)], {
+  const n = new XMLSerializer(), l = new Blob([n.serializeToString(s)], {
     type: "image/svg+xml"
   }), d = URL.createObjectURL(l), u = document.createElement("a");
-  u.href = d, u.download = `${c}.svg`, document.body.appendChild(u), u.click(), document.body.removeChild(u), URL.revokeObjectURL(d);
+  u.href = d, u.download = `${a}.svg`, document.body.appendChild(u), u.click(), document.body.removeChild(u), URL.revokeObjectURL(d);
 }, Vt = ({
   svgRef: r,
   fileSize: i,
-  fileName: c,
+  fileName: a,
   fileFormat: s,
-  imageSettings: e,
+  imageSettings: n,
   calculatedImageSettings: l,
   size: d,
   numCells: u,
-  margin: g
+  margin: N
 }) => {
   if (!r.current) return;
-  const t = document.createElement("canvas"), o = t.getContext("2d");
-  if (!o) return;
-  t.width = i, t.height = i;
-  const n = new XMLSerializer().serializeToString(r.current), a = new Blob([n], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(a), $ = new Image();
-  $.crossOrigin = "anonymous", $.src = h, $.onload = () => {
-    if (o.drawImage($, 0, 0, i, i), URL.revokeObjectURL(h), e != null && e.src && l) {
-      const f = new Image();
-      f.crossOrigin = "anonymous", f.src = e.src, f.onload = () => {
-        const p = i / d, M = u / i, E = e.width * p, m = e.x ? (l.x + g) / M : (i - E) / 2, R = e.y ? (l.y + g) / M : (i - E) / 2;
-        o.drawImage(f, m, R, E, E);
-        const w = s === "png" ? "image/png" : "image/jpeg", A = document.createElement("a");
-        A.href = t.toDataURL(w), A.download = `${c}.${s}`, document.body.appendChild(A), A.click(), document.body.removeChild(A);
-      }, f.onerror = (p) => console.error("Error loading logo:", p);
+  const o = document.createElement("canvas"), t = o.getContext("2d");
+  if (!t) return;
+  o.width = i, o.height = i;
+  const e = new XMLSerializer().serializeToString(r.current), c = new Blob([e], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(c), f = new Image();
+  f.crossOrigin = "anonymous", f.src = h, f.onload = () => {
+    if (t.drawImage(f, 0, 0, i, i), URL.revokeObjectURL(h), n != null && n.src && l) {
+      const $ = new Image();
+      $.crossOrigin = "anonymous", $.src = n.src, $.onload = () => {
+        const p = i / d, M = u / i, E = n.width * p, m = n.x ? (l.x + N) / M : (i - E) / 2, R = n.y ? (l.y + N) / M : (i - E) / 2;
+        t.drawImage($, m, R, E, E);
+        const I = s === "png" ? "image/png" : "image/jpeg", C = document.createElement("a");
+        C.href = o.toDataURL(I), C.download = `${a}.${s}`, document.body.appendChild(C), C.click(), document.body.removeChild(C);
+      }, $.onerror = (p) => console.error("Error loading logo:", p);
     } else {
-      const f = s === "png" ? "image/png" : "image/jpeg", p = document.createElement("a");
-      p.href = t.toDataURL(f), p.download = `${c}.${s}`, document.body.appendChild(p), p.click(), document.body.removeChild(p);
+      const $ = s === "png" ? "image/png" : "image/jpeg", p = document.createElement("a");
+      p.href = o.toDataURL($), p.download = `${a}.${s}`, document.body.appendChild(p), p.click(), document.body.removeChild(p);
     }
-  }, $.onerror = (f) => console.error("Error loading QR code:", f);
+  }, f.onerror = ($) => console.error("Error loading QR code:", $);
 }, Xt = (r) => {
   const {
     ref: i,
-    value: c,
-    size: s = lt,
-    level: e = ht,
+    value: a,
+    size: s = ht,
+    level: n = ut,
     background: l,
     gradient: d,
-    minVersion: u = ut,
-    boostLevel: g,
-    marginSize: t,
-    finderPatternOuterSettings: o,
-    finderPatternInnerSettings: n,
-    dataModulesSettings: a,
+    minVersion: u = dt,
+    boostLevel: N,
+    marginSize: o,
+    finderPatternOuterSettings: t,
+    finderPatternInnerSettings: e,
+    dataModulesSettings: c,
     imageSettings: h,
-    svgProps: $
-  } = r, f = it(null), { margin: p, cells: M, numCells: E, calculatedImageSettings: m } = qt({
-    value: c,
-    level: e,
+    svgProps: f
+  } = r, $ = at(null), { margin: p, cells: M, numCells: E, calculatedImageSettings: m } = Gt({
+    value: a,
+    level: n,
     minVersion: u,
-    boostLevel: g,
-    marginSize: t,
+    boostLevel: N,
+    marginSize: o,
     imageSettings: h,
     size: s
   });
-  at(i, () => ({
-    svg: f.current,
+  ct(i, () => ({
+    svg: $.current,
     download: ({
-      name: N = mt,
+      name: A = Et,
       format: P = "svg",
-      size: k = 500
+      size: z = 500
     }) => {
-      f.current && (P === "svg" ? jt({ svgRef: f, fileSize: k, fileName: N }) : Vt({
-        svgRef: f,
-        fileSize: k,
-        fileName: N,
+      $.current && (P === "svg" ? jt({ svgRef: $, fileSize: z, fileName: A }) : Vt({
+        svgRef: $,
+        fileSize: z,
+        fileName: A,
         fileFormat: P,
         imageSettings: h,
         calculatedImageSettings: m,
@@ -1276,8 +1292,8 @@ const tt = (r) => {
       }));
     }
   }));
-  let R = M, w = null;
-  h != null && m != null && (m.excavation != null && (R = Yt(M, m.excavation)), w = /* @__PURE__ */ C(
+  let R = M, I = null;
+  h != null && m != null && (m.excavation != null && (R = kt(M, m.excavation)), I = /* @__PURE__ */ w(
     "image",
     {
       href: h.src,
@@ -1290,7 +1306,7 @@ const tt = (r) => {
       crossOrigin: m.crossOrigin
     }
   ));
-  const A = {
+  const C = {
     modules: R,
     margin: p,
     gradient: d
@@ -1301,17 +1317,17 @@ const tt = (r) => {
       height: s,
       width: s,
       viewBox: `0 0 ${E} ${E}`,
-      ref: f,
+      ref: $,
       role: "img",
-      "aria-label": ($ == null ? void 0 : $["aria-label"]) || "QR Code",
-      ...$,
+      "aria-label": (f == null ? void 0 : f["aria-label"]) || "QR Code",
+      ...f,
       children: [
-        /* @__PURE__ */ C(kt, { gradient: d }),
-        /* @__PURE__ */ C(gt, { background: l, numCells: E }),
-        /* @__PURE__ */ C(Ht, { settings: o, ...A }),
-        /* @__PURE__ */ C(zt, { settings: n, ...A }),
-        /* @__PURE__ */ C(Bt, { settings: a, ...A }),
-        w
+        /* @__PURE__ */ w(Qt, { gradient: d }),
+        /* @__PURE__ */ w(Nt, { background: l, numCells: E }),
+        /* @__PURE__ */ w(zt, { settings: t, ...C }),
+        /* @__PURE__ */ w(_t, { settings: e, ...C }),
+        /* @__PURE__ */ w(Ht, { settings: c, ...C }),
+        I
       ]
     }
   );