@lglab/react-qr-code 1.2.1 → 1.2.2

package/dist/index.es.js

@@ -1,11 +1,11 @@
-import { jsx as C, jsxs as V, Fragment as nt } from "react/jsx-runtime";
-import { useMemo as L, useCallback as rt, useRef as st, useImperativeHandle as it } from "react";
+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";
 /**
  * @license QR Code generator library (TypeScript)
  * Copyright (c) Project Nayuki.
  * SPDX-License-Identifier: MIT
  */
-var O;
+var L;
 ((r) => {
   const d = class d {
     /*-- Constructor (low level) and fields --*/
@@ -13,12 +13,12 @@ var O;
     // 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, o, n, i) {
-      if (this.version = e, this.errorCorrectionLevel = o, this.modules = [], this.isFunction = [], e < d.MIN_VERSION || e > d.MAX_VERSION)
+    constructor(t, o, n, a) {
+      if (this.version = t, this.errorCorrectionLevel = o, this.modules = [], this.isFunction = [], t < d.MIN_VERSION || t > d.MAX_VERSION)
         throw new RangeError("Version value out of range");
-      if (i < -1 || i > 7)
+      if (a < -1 || a > 7)
         throw new RangeError("Mask value out of range");
-      this.size = e * 4 + 17;
+      this.size = t * 4 + 17;
       let h = [];
       for (let f = 0; f < this.size; f++)
         h.push(!1);
@@ -26,15 +26,15 @@ var O;
         this.modules.push(h.slice()), this.isFunction.push(h.slice());
       this.drawFunctionPatterns();
       const $ = this.addEccAndInterleave(n);
-      if (this.drawCodewords($), i == -1) {
+      if (this.drawCodewords($), a == -1) {
         let f = 1e9;
         for (let p = 0; p < 8; p++) {
           this.applyMask(p), this.drawFormatBits(p);
           const M = this.getPenaltyScore();
-          M < f && (i = p, f = M), this.applyMask(p);
+          M < f && (a = p, f = M), this.applyMask(p);
         }
       }
-      t(0 <= i && i <= 7), this.mask = i, this.applyMask(i), this.drawFormatBits(i), this.isFunction = [];
+      e(0 <= a && a <= 7), this.mask = a, this.applyMask(a), this.drawFormatBits(a), this.isFunction = [];
     }
     /*-- Static factory functions (high level) --*/
     // Returns a QR Code representing the given Unicode text string at the given error correction level.
@@ -42,16 +42,16 @@ var O;
     // 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(e, o) {
-      const n = r.QrSegment.makeSegments(e);
+    static encodeText(t, o) {
+      const n = r.QrSegment.makeSegments(t);
       return d.encodeSegments(n, o);
     }
     // 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(e, o) {
-      const n = r.QrSegment.makeBytes(e);
+    static encodeBinary(t, o) {
+      const n = r.QrSegment.makeBytes(t);
       return d.encodeSegments([n], o);
     }
     /*-- Static factory functions (mid level) --*/
@@ -64,32 +64,32 @@ var O;
     // 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, o, n = 1, i = 40, h = -1, $ = !0) {
-      if (!(d.MIN_VERSION <= n && n <= i && i <= d.MAX_VERSION) || h < -1 || h > 7)
+    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)
         throw new RangeError("Invalid value");
       let f, p;
       for (f = n; ; f++) {
-        const R = d.getNumDataCodewords(f, o) * 8, w = c.getTotalBits(e, f);
+        const R = d.getNumDataCodewords(f, o) * 8, w = l.getTotalBits(t, f);
         if (w <= R) {
           p = w;
           break;
         }
-        if (f >= i)
+        if (f >= a)
           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);
       let M = [];
-      for (const R of e) {
-        l(R.mode.modeBits, 4, M), l(R.numChars, R.mode.numCharCountBits(f), 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);
       }
-      t(M.length == p);
+      e(M.length == p);
       const E = d.getNumDataCodewords(f, o) * 8;
-      t(M.length <= E), l(0, Math.min(4, E - M.length), M), l(0, (8 - M.length % 8) % 8, M), t(M.length % 8 == 0);
+      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);
       for (let R = 236; M.length < E; R ^= 253)
-        l(R, 8, M);
+        c(R, 8, M);
       let m = [];
       for (; m.length * 8 < M.length; )
         m.push(0);
@@ -99,8 +99,8 @@ var O;
     // 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(e, o) {
-      return 0 <= e && e < this.size && 0 <= o && o < this.size && this.modules[o][e];
+    getModule(t, o) {
+      return 0 <= t && t < this.size && 0 <= o && o < this.size && this.modules[o][t];
     }
     // Modified to expose modules for easy access
     getModules() {
@@ -112,30 +112,30 @@ var O;
       for (let n = 0; n < this.size; n++)
         this.setFunctionModule(6, n, n % 2 == 0), this.setFunctionModule(n, 6, n % 2 == 0);
       this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
-      const e = this.getAlignmentPatternPositions(), o = e.length;
+      const t = this.getAlignmentPatternPositions(), o = t.length;
       for (let n = 0; n < o; n++)
-        for (let i = 0; i < o; i++)
-          n == 0 && i == 0 || n == 0 && i == o - 1 || n == o - 1 && i == 0 || this.drawAlignmentPattern(e[n], e[i]);
+        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]);
       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(e) {
-      const o = this.errorCorrectionLevel.formatBits << 3 | e;
+    drawFormatBits(t) {
+      const o = this.errorCorrectionLevel.formatBits << 3 | t;
       let n = o;
       for (let h = 0; h < 10; h++)
         n = n << 1 ^ (n >>> 9) * 1335;
-      const i = (o << 10 | n) ^ 21522;
-      t(i >>> 15 == 0);
+      const a = (o << 10 | n) ^ 21522;
+      e(a >>> 15 == 0);
       for (let h = 0; h <= 5; h++)
-        this.setFunctionModule(8, h, a(i, h));
-      this.setFunctionModule(8, 7, a(i, 6)), this.setFunctionModule(8, 8, a(i, 7)), this.setFunctionModule(7, 8, a(i, 8));
+        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));
       for (let h = 9; h < 15; h++)
-        this.setFunctionModule(14 - h, 8, a(i, h));
+        this.setFunctionModule(14 - h, 8, s(a, h));
       for (let h = 0; h < 8; h++)
-        this.setFunctionModule(this.size - 1 - h, 8, a(i, h));
+        this.setFunctionModule(this.size - 1 - h, 8, s(a, h));
       for (let h = 8; h < 15; h++)
-        this.setFunctionModule(8, this.size - 15 + h, a(i, h));
+        this.setFunctionModule(8, this.size - 15 + h, s(a, h));
       this.setFunctionModule(8, this.size - 8, !0);
     }
     // Draws two copies of the version bits (with its own error correction code),
@@ -143,49 +143,49 @@ var O;
     drawVersion() {
       if (this.version < 7)
         return;
-      let e = this.version;
+      let t = this.version;
       for (let n = 0; n < 12; n++)
-        e = e << 1 ^ (e >>> 11) * 7973;
-      const o = this.version << 12 | e;
-      t(o >>> 18 == 0);
+        t = t << 1 ^ (t >>> 11) * 7973;
+      const o = this.version << 12 | t;
+      e(o >>> 18 == 0);
       for (let n = 0; n < 18; n++) {
-        const i = a(o, n), h = this.size - 11 + n % 3, $ = Math.floor(n / 3);
-        this.setFunctionModule(h, $, i), this.setFunctionModule($, h, i);
+        const a = s(o, n), h = this.size - 11 + n % 3, $ = Math.floor(n / 3);
+        this.setFunctionModule(h, $, a), this.setFunctionModule($, h, a);
       }
     }
     // 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, o) {
+    drawFinderPattern(t, o) {
       for (let n = -4; n <= 4; n++)
-        for (let i = -4; i <= 4; i++) {
-          const h = Math.max(Math.abs(i), Math.abs(n)), $ = e + i, f = o + 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);
         }
     }
     // Draws a 5*5 alignment pattern, with the center module
     // at (x, y). All modules must be in bounds.
-    drawAlignmentPattern(e, o) {
+    drawAlignmentPattern(t, o) {
       for (let n = -2; n <= 2; n++)
-        for (let i = -2; i <= 2; i++)
-          this.setFunctionModule(e + i, o + n, Math.max(Math.abs(i), Math.abs(n)) != 1);
+        for (let a = -2; a <= 2; a++)
+          this.setFunctionModule(t + a, o + n, Math.max(Math.abs(a), Math.abs(n)) != 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(e, o, n) {
-      this.modules[o][e] = n, this.isFunction[o][e] = !0;
+    setFunctionModule(t, o, n) {
+      this.modules[o][t] = n, this.isFunction[o][t] = !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(e) {
+    addEccAndInterleave(t) {
       const o = this.version, n = this.errorCorrectionLevel;
-      if (e.length != d.getNumDataCodewords(o, n))
+      if (t.length != d.getNumDataCodewords(o, n))
         throw new RangeError("Invalid argument");
-      const i = d.NUM_ERROR_CORRECTION_BLOCKS[n.ordinal][o], h = d.ECC_CODEWORDS_PER_BLOCK[n.ordinal][o], $ = Math.floor(d.getNumRawDataModules(o) / 8), f = i - $ % i, p = Math.floor($ / i);
+      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);
       let M = [];
       const E = d.reedSolomonComputeDivisor(h);
-      for (let R = 0, w = 0; R < i; R++) {
-        let A = e.slice(w, w + p - h + (R < f ? 0 : 1));
+      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));
@@ -195,92 +195,92 @@ var O;
         M.forEach((w, A) => {
           (R != p - h || A >= f) && m.push(w[R]);
         });
-      return t(m.length == $), m;
+      return e(m.length == $), 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(e) {
-      if (e.length != Math.floor(d.getNumRawDataModules(this.version) / 8))
+    drawCodewords(t) {
+      if (t.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 i = 0; i < this.size; i++)
+        for (let a = 0; a < this.size; a++)
           for (let h = 0; h < 2; h++) {
-            const $ = n - h, p = (n + 1 & 2) == 0 ? this.size - 1 - i : i;
-            !this.isFunction[p][$] && o < e.length * 8 && (this.modules[p][$] = a(e[o >>> 3], 7 - (o & 7)), o++);
+            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++);
           }
       }
-      t(o == e.length * 8);
+      e(o == t.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(e) {
-      if (e < 0 || e > 7)
+    applyMask(t) {
+      if (t < 0 || t > 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 i;
-          switch (e) {
+          let a;
+          switch (t) {
             case 0:
-              i = (n + o) % 2 == 0;
+              a = (n + o) % 2 == 0;
               break;
             case 1:
-              i = o % 2 == 0;
+              a = o % 2 == 0;
               break;
             case 2:
-              i = n % 3 == 0;
+              a = n % 3 == 0;
               break;
             case 3:
-              i = (n + o) % 3 == 0;
+              a = (n + o) % 3 == 0;
               break;
             case 4:
-              i = (Math.floor(n / 3) + Math.floor(o / 2)) % 2 == 0;
+              a = (Math.floor(n / 3) + Math.floor(o / 2)) % 2 == 0;
               break;
             case 5:
-              i = n * o % 2 + n * o % 3 == 0;
+              a = n * o % 2 + n * o % 3 == 0;
               break;
             case 6:
-              i = (n * o % 2 + n * o % 3) % 2 == 0;
+              a = (n * o % 2 + n * o % 3) % 2 == 0;
               break;
             case 7:
-              i = ((n + o) % 2 + n * o % 3) % 2 == 0;
+              a = ((n + o) % 2 + n * o % 3) % 2 == 0;
               break;
             default:
               throw new Error("Unreachable");
           }
-          !this.isFunction[o][n] && i && (this.modules[o][n] = !this.modules[o][n]);
+          !this.isFunction[o][n] && a && (this.modules[o][n] = !this.modules[o][n]);
         }
     }
     // 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 e = 0;
+      let t = 0;
       for (let h = 0; h < this.size; h++) {
         let $ = !1, f = 0, p = [0, 0, 0, 0, 0, 0, 0];
         for (let M = 0; M < this.size; M++)
-          this.modules[h][M] == $ ? (f++, f == 5 ? e += d.PENALTY_N1 : f > 5 && e++) : (this.finderPenaltyAddHistory(f, p), $ || (e += this.finderPenaltyCountPatterns(p) * d.PENALTY_N3), $ = this.modules[h][M], f = 1);
-        e += this.finderPenaltyTerminateAndCount($, f, p) * d.PENALTY_N3;
+          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;
       }
       for (let h = 0; h < this.size; h++) {
         let $ = !1, f = 0, p = [0, 0, 0, 0, 0, 0, 0];
         for (let M = 0; M < this.size; M++)
-          this.modules[M][h] == $ ? (f++, f == 5 ? e += d.PENALTY_N1 : f > 5 && e++) : (this.finderPenaltyAddHistory(f, p), $ || (e += this.finderPenaltyCountPatterns(p) * d.PENALTY_N3), $ = this.modules[M][h], f = 1);
-        e += this.finderPenaltyTerminateAndCount($, f, p) * d.PENALTY_N3;
+          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;
       }
       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] && (e += d.PENALTY_N2);
+          f == this.modules[h][$ + 1] && f == this.modules[h + 1][$] && f == this.modules[h + 1][$ + 1] && (t += d.PENALTY_N2);
         }
       let o = 0;
       for (const h of this.modules)
         o = h.reduce(($, f) => $ + (f ? 1 : 0), o);
-      const n = this.size * this.size, i = Math.ceil(Math.abs(o * 20 - n * 10) / n) - 1;
-      return t(0 <= i && i <= 9), e += i * d.PENALTY_N4, t(0 <= e && e <= 2568888), e;
+      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;
     }
     /*-- Private helper functions --*/
     // Returns an ascending list of positions of alignment patterns for this version number.
@@ -290,43 +290,43 @@ var O;
       if (this.version == 1)
         return [];
       {
-        const e = Math.floor(this.version / 7) + 2, o = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2;
+        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 i = this.size - 7; n.length < e; i -= o)
-          n.splice(1, 0, i);
+        for (let a = this.size - 7; n.length < t; a -= o)
+          n.splice(1, 0, a);
         return n;
       }
     }
     // 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(e) {
-      if (e < d.MIN_VERSION || e > d.MAX_VERSION)
+    static getNumRawDataModules(t) {
+      if (t < d.MIN_VERSION || t > d.MAX_VERSION)
         throw new RangeError("Version number out of range");
-      let o = (16 * e + 128) * e + 64;
-      if (e >= 2) {
-        const n = Math.floor(e / 7) + 2;
-        o -= (25 * n - 10) * n - 55, e >= 7 && (o -= 36);
+      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);
       }
-      return t(208 <= o && o <= 29648), o;
+      return e(208 <= o && o <= 29648), o;
     }
     // 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(e, o) {
-      return Math.floor(d.getNumRawDataModules(e) / 8) - d.ECC_CODEWORDS_PER_BLOCK[o.ordinal][e] * d.NUM_ERROR_CORRECTION_BLOCKS[o.ordinal][e];
+    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];
     }
     // 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(e) {
-      if (e < 1 || e > 255)
+    static reedSolomonComputeDivisor(t) {
+      if (t < 1 || t > 255)
         throw new RangeError("Degree out of range");
       let o = [];
-      for (let i = 0; i < e - 1; i++)
+      for (let a = 0; a < t - 1; a++)
         o.push(0);
       o.push(1);
       let n = 1;
-      for (let i = 0; i < e; i++) {
+      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);
@@ -334,39 +334,39 @@ var O;
       return o;
     }
     // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static reedSolomonComputeRemainder(e, o) {
-      let n = o.map((i) => 0);
-      for (const i of e) {
-        const h = i ^ n.shift();
+    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));
       }
       return n;
     }
     // 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(e, o) {
-      if (e >>> 8 || o >>> 8)
+    static reedSolomonMultiply(t, o) {
+      if (t >>> 8 || o >>> 8)
         throw new RangeError("Byte out of range");
       let n = 0;
-      for (let i = 7; i >= 0; i--)
-        n = n << 1 ^ (n >>> 7) * 285, n ^= (o >>> i & 1) * e;
-      return t(n >>> 8 == 0), n;
+      for (let a = 7; a >= 0; a--)
+        n = n << 1 ^ (n >>> 7) * 285, n ^= (o >>> a & 1) * t;
+      return e(n >>> 8 == 0), n;
     }
     // 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 o = e[1];
-      t(o <= this.size * 3);
-      const n = o > 0 && e[2] == o && e[3] == o * 3 && e[4] == o && e[5] == o;
-      return (n && e[0] >= o * 4 && e[6] >= o ? 1 : 0) + (n && e[6] >= o * 4 && e[0] >= o ? 1 : 0);
+    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);
     }
     // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
-    finderPenaltyTerminateAndCount(e, o, n) {
-      return e && (this.finderPenaltyAddHistory(o, n), o = 0), o += this.size, this.finderPenaltyAddHistory(o, n), this.finderPenaltyCountPatterns(n);
+    finderPenaltyTerminateAndCount(t, o, n) {
+      return t && (this.finderPenaltyAddHistory(o, n), o = 0), o += this.size, this.finderPenaltyAddHistory(o, n), this.finderPenaltyCountPatterns(n);
     }
     // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
-    finderPenaltyAddHistory(e, o) {
-      o[0] == 0 && (e += this.size), o.pop(), o.unshift(e);
+    finderPenaltyAddHistory(t, o) {
+      o[0] == 0 && (t += this.size), o.pop(), o.unshift(t);
     }
   };
   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 = [
@@ -392,18 +392,18 @@ var O;
     [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]
     // High
   ];
-  let s = d;
-  r.QrCode = s;
-  function l(g, e, o) {
-    if (e < 0 || e > 31 || g >>> e)
+  let i = d;
+  r.QrCode = i;
+  function c(g, t, o) {
+    if (t < 0 || t > 31 || g >>> t)
       throw new RangeError("Value out of range");
-    for (let n = e - 1; n >= 0; n--)
+    for (let n = t - 1; n >= 0; n--)
       o.push(g >>> n & 1);
   }
-  function a(g, e) {
-    return (g >>> e & 1) != 0;
+  function s(g, t) {
+    return (g >>> t & 1) != 0;
   }
-  function t(g) {
+  function e(g) {
     if (!g)
       throw new Error("Assertion error");
   }
@@ -412,8 +412,8 @@ var O;
     // 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(e, o, n) {
-      if (this.mode = e, this.numChars = o, this.bitData = n, o < 0)
+    constructor(t, o, n) {
+      if (this.mode = t, this.numChars = o, this.bitData = n, o < 0)
         throw new RangeError("Invalid argument");
       this.bitData = n.slice();
     }
@@ -421,67 +421,67 @@ var O;
     // 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(e) {
+    static makeBytes(t) {
       let o = [];
-      for (const n of e)
-        l(n, 8, o);
-      return new u(u.Mode.BYTE, e.length, o);
+      for (const n of t)
+        c(n, 8, o);
+      return new u(u.Mode.BYTE, t.length, o);
     }
     // Returns a segment representing the given string of decimal digits encoded in numeric mode.
-    static makeNumeric(e) {
-      if (!u.isNumeric(e))
+    static makeNumeric(t) {
+      if (!u.isNumeric(t))
         throw new RangeError("String contains non-numeric characters");
       let o = [];
-      for (let n = 0; n < e.length; ) {
-        const i = Math.min(e.length - n, 3);
-        l(parseInt(e.substring(n, n + i), 10), i * 3 + 1, o), n += i;
+      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;
       }
-      return new u(u.Mode.NUMERIC, e.length, o);
+      return new u(u.Mode.NUMERIC, t.length, o);
     }
     // 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 (!u.isAlphanumeric(e))
+    static makeAlphanumeric(t) {
+      if (!u.isAlphanumeric(t))
         throw new RangeError("String contains unencodable characters in alphanumeric mode");
       let o = [], n;
-      for (n = 0; n + 2 <= e.length; n += 2) {
-        let i = u.ALPHANUMERIC_CHARSET.indexOf(e.charAt(n)) * 45;
-        i += u.ALPHANUMERIC_CHARSET.indexOf(e.charAt(n + 1)), l(i, 11, o);
+      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);
       }
-      return n < e.length && l(u.ALPHANUMERIC_CHARSET.indexOf(e.charAt(n)), 6, o), new u(u.Mode.ALPHANUMERIC, e.length, o);
+      return n < t.length && c(u.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n)), 6, o), new u(u.Mode.ALPHANUMERIC, t.length, o);
     }
     // 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 == "" ? [] : u.isNumeric(e) ? [u.makeNumeric(e)] : u.isAlphanumeric(e) ? [u.makeAlphanumeric(e)] : [u.makeBytes(u.toUtf8ByteArray(e))];
+    static makeSegments(t) {
+      return t == "" ? [] : u.isNumeric(t) ? [u.makeNumeric(t)] : u.isAlphanumeric(t) ? [u.makeAlphanumeric(t)] : [u.makeBytes(u.toUtf8ByteArray(t))];
     }
     // Returns a segment representing an Extended Channel Interpretation
     // (ECI) designator with the given assignment value.
-    static makeEci(e) {
+    static makeEci(t) {
       let o = [];
-      if (e < 0)
+      if (t < 0)
         throw new RangeError("ECI assignment value out of range");
-      if (e < 128)
-        l(e, 8, o);
-      else if (e < 16384)
-        l(2, 2, o), l(e, 14, o);
-      else if (e < 1e6)
-        l(6, 3, o), l(e, 21, o);
+      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);
       else
         throw new RangeError("ECI assignment value out of range");
       return new u(u.Mode.ECI, 0, o);
     }
     // 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 u.NUMERIC_REGEX.test(e);
+    static isNumeric(t) {
+      return u.NUMERIC_REGEX.test(t);
     }
     // 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 u.ALPHANUMERIC_REGEX.test(e);
+    static isAlphanumeric(t) {
+      return u.ALPHANUMERIC_REGEX.test(t);
     }
     /*-- Methods --*/
     // Returns a new copy of the data bits of this segment.
@@ -490,68 +490,68 @@ var O;
     }
     // (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(e, o) {
+    static getTotalBits(t, o) {
       let n = 0;
-      for (const i of e) {
-        const h = i.mode.numCharCountBits(o);
-        if (i.numChars >= 1 << h)
+      for (const a of t) {
+        const h = a.mode.numCharCountBits(o);
+        if (a.numChars >= 1 << h)
           return 1 / 0;
-        n += 4 + h + i.bitData.length;
+        n += 4 + h + a.bitData.length;
       }
       return n;
     }
     // Returns a new array of bytes representing the given string encoded in UTF-8.
-    static toUtf8ByteArray(e) {
-      e = encodeURI(e);
+    static toUtf8ByteArray(t) {
+      t = encodeURI(t);
       let o = [];
-      for (let n = 0; n < e.length; n++)
-        e.charAt(n) != "%" ? o.push(e.charCodeAt(n)) : (o.push(parseInt(e.substring(n + 1, n + 3), 16)), n += 2);
+      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;
     }
   };
   u.NUMERIC_REGEX = /^[0-9]*$/, u.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, u.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-  let c = u;
-  r.QrSegment = c;
-})(O || (O = {}));
+  let l = u;
+  r.QrSegment = l;
+})(L || (L = {}));
 ((r) => {
-  ((s) => {
-    const a = class a {
+  ((i) => {
+    const s = class s {
       // The QR Code can tolerate about 30% erroneous codewords
       /*-- Constructor and fields --*/
-      constructor(c, d) {
-        this.ordinal = c, this.formatBits = d;
+      constructor(l, d) {
+        this.ordinal = l, this.formatBits = d;
       }
     };
-    a.LOW = new a(0, 1), a.MEDIUM = new a(1, 0), a.QUARTILE = new a(2, 3), a.HIGH = new a(3, 2);
-    let l = a;
-    s.Ecc = 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;
   })(r.QrCode || (r.QrCode = {}));
-})(O || (O = {}));
+})(L || (L = {}));
 ((r) => {
-  ((s) => {
-    const a = class a {
+  ((i) => {
+    const s = class s {
       /*-- Constructor and fields --*/
-      constructor(c, d) {
-        this.modeBits = c, this.numBitsCharCount = d;
+      constructor(l, d) {
+        this.modeBits = l, this.numBitsCharCount = d;
       }
       /*-- Method --*/
       // (Package-private) Returns the bit width of the character count field for a segment in
       // this mode in a QR Code at the given version number. The result is in the range [0, 16].
-      numCharCountBits(c) {
-        return this.numBitsCharCount[Math.floor((c + 7) / 17)];
+      numCharCountBits(l) {
+        return this.numBitsCharCount[Math.floor((l + 7) / 17)];
       }
     };
-    a.NUMERIC = new a(1, [10, 12, 14]), a.ALPHANUMERIC = new a(2, [9, 11, 13]), a.BYTE = new a(4, [8, 16, 16]), a.KANJI = new a(8, [8, 10, 12]), a.ECI = new a(7, [0, 0, 0]);
-    let l = a;
-    s.Mode = 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;
   })(r.QrSegment || (r.QrSegment = {}));
-})(O || (O = {}));
-const y = O, at = {
-  L: y.QrCode.Ecc.LOW,
-  M: y.QrCode.Ecc.MEDIUM,
-  Q: y.QrCode.Ecc.QUARTILE,
-  H: y.QrCode.Ecc.HIGH
-}, lt = 128, ct = "M", ht = 1, ut = 4, W = 5, x = "#000000", dt = "square", ft = "square", $t = "square", pt = "react-qr-code", U = "react-qr-code-gradient", F = "react-qr-code-bg-gradient", mt = 0.1, I = 7, T = 3, B = [
+})(L || (L = {}));
+const S = L, ct = {
+  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 = [
   [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 y = O, at = {
   "leaf-sm": [0, 90, -90],
   leaf: [0, 90, -90],
   "leaf-lg": [0, 90, -90]
-}, H = {
+}, Y = {
   "rounded-sm": 3,
   rounded: 4,
   "rounded-lg": 5,
@@ -582,7 +582,7 @@ const y = O, at = {
   "outpoint-sm": 3,
   outpoint: 4,
   "outpoint-lg": 5
-}, Y = {
+}, G = {
   square: 0,
   diamond: 0,
   circle: 3,
@@ -606,28 +606,60 @@ const y = O, at = {
   [0, 0, 1, 1, 1, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0]
-], Et = /\.?0+$/;
-function Mt(r) {
-  return r.toFixed(7).replace(Et, "");
+], Mt = /\.?0+$/;
+function Rt(r) {
+  return r.toFixed(7).replace(Mt, "");
 }
 const tt = (r) => {
-  const s = r % 360 * (Math.PI / 180), l = Math.max(0, Math.min(100, 50 - 50 * Math.cos(s))), a = Math.max(0, Math.min(100, 50 - 50 * Math.sin(s))), t = Math.max(0, Math.min(100, 50 + 50 * Math.cos(s))), c = Math.max(0, Math.min(100, 50 + 50 * Math.sin(s)));
+  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)));
   return {
-    x1: `${l}%`,
-    y1: `${a}%`,
-    x2: `${t}%`,
-    y2: `${c}%`
+    x1: `${c}%`,
+    y1: `${s}%`,
+    x2: `${e}%`,
+    y2: `${l}%`
   };
-}, et = (r, s, l, a) => {
-  const t = l / 2, c = t / 2, d = Math.PI / a;
+}, et = (r, i, c, s) => {
+  const e = c / 2, l = e / 2, d = Math.PI / s;
   let u = "";
-  for (let g = 0; g < 2 * a; g++) {
-    const e = g * d - Math.PI / 2, o = g % 2 === 0 ? t : c, n = r + o * Math.cos(e), i = s + o * Math.sin(e);
-    u += `${g === 0 ? "M" : "L"} ${n},${i} `;
+  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} `;
   }
   return u + "Z";
-}, ot = (r, s, l) => {
-  let a = !1, t = 0;
+}, ot = (r, i, c) => {
+  const s = c / 8;
+  return `M ${r + c} ${i + s * 3} 
+   V ${i + s}
+   h -${s}
+   V ${i}
+   H ${r + s * 5}
+   v ${s}
+   H ${r + s * 3}
+   V ${i}
+   H ${r + s}
+   v ${s}
+   H ${r}
+   v ${s * 2}
+   h ${s}
+   v ${s * 2}
+   H ${r}
+   v ${s * 2}
+   h ${s}
+   v ${s}
+   h ${s * 2}
+   v -${s}
+   h ${s * 2}
+   v ${s}
+   h ${s * 2}
+   v -${s}
+   h ${s}
+   V ${i + s * 5}
+   h -${s}
+   V ${i + s * 3}
+   h ${s}
+   Z`;
+}, nt = (r, i, c) => {
+  let s = !1, e = 0;
   return [
     "M",
     1,
@@ -739,18 +771,18 @@ const tt = (r) => {
     1,
     0.3262506,
     "z"
-  ].map((c) => typeof c == "string" ? (t = 0, a = c.toUpperCase() == c, c) : (t++, c = c * l, a && (c += t % 2 == 1 ? r : s), Mt(c))).join(" ");
-}, G = {
+  ].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 = {
   "data-testid": "background"
-}, Rt = ({ background: r, numCells: s }) => {
-  var a, t;
+}, gt = ({ background: r, numCells: i }) => {
+  var s, e;
   if (!r)
     return null;
   if (typeof r == "string")
-    return /* @__PURE__ */ C("path", { fill: r, d: `M0,0 h${s}v${s}H0z`, ...G });
-  const l = tt((r == null ? void 0 : r.rotation) || 0);
-  return /* @__PURE__ */ V(nt, { children: [
-    /* @__PURE__ */ C("defs", { children: r.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: F, gradientUnits: "userSpaceOnUse", ...l, children: (a = r.stops) == null ? void 0 : a.map((c, d) => /* @__PURE__ */ C("stop", { offset: c.offset, stopColor: c.color }, d)) }) : /* @__PURE__ */ C(
+    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(
       "radialGradient",
       {
         id: F,
@@ -758,217 +790,219 @@ const tt = (r) => {
         cx: "50%",
         cy: "50%",
         r: "50%",
-        children: (t = r.stops) == null ? void 0 : t.map((c, d) => /* @__PURE__ */ C("stop", { offset: c.offset, stopColor: c.color }, d))
+        children: (e = r.stops) == null ? void 0 : e.map((l, d) => /* @__PURE__ */ C("stop", { offset: l.offset, stopColor: l.color }, d))
       }
     ) }),
     /* @__PURE__ */ C(
       "path",
       {
         fill: `url(#${F})`,
-        d: `M0,0 h${s}v${s}H0z`,
-        ...G
+        d: `M0,0 h${i}v${i}H0z`,
+        ...x
       }
     )
   ] });
-}, gt = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond", wt = (r, s) => r === "square-sm" ? 0.75 : s ? Math.random() * (1 - 0.75) + 0.75 : 1, b = (r, s, l) => {
-  const a = {
-    left: r === 0 ? !1 : l[s][r - 1],
-    right: r === l[s].length - 1 ? !1 : l[s][r + 1],
-    top: s === 0 ? !1 : l[s - 1][r],
-    bottom: s === l.length - 1 ? !1 : l[s + 1][r]
+}, 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) => {
+  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]
   };
   return {
-    ...a,
-    count: Object.values(a).filter(Boolean).length
+    ...s,
+    count: Object.values(s).filter(Boolean).length
   };
-}, v = (r, s, l) => `M${r},${s}h${l}v${l}h-${l}Z`, D = (r, s, l) => `M${r},${s + l / 2}a${l / 2},${l / 2} 0 1,0 ${l},0a${l / 2},${l / 2} 0 1,0 -${l},0Z`, At = (r, s, l) => `M${r},${s + l / 2}l${l / 2},-${l / 2}l${l / 2},${l / 2}l-${l / 2},${l / 2}Z`, Ct = (r, s) => `M ${r} ${s} 
+}, 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} 
    v 1 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, q = (r, s) => `M ${r + 1} ${s} 
+   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, q = (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, s) => `M ${r} ${s} 
+   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, j = (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`, Nt = (r, s) => `M ${r + 1} ${s} 
+   h -1`, It = (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`, X = (r, s) => `M ${r} ${s} 
+   h 1`, V = (r, i) => `M ${r} ${i} 
    v 1 
    h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0 -1`, Q = (r, s) => `M ${r + 1} ${s} 
+   a 0.5 0.5, 0, 0, 0, 0 -1`, X = (r, i) => `M ${r + 1} ${i} 
    v 1 
    h -0.5 
-   a 0.5 0.5, 0, 0, 1, 0 -1`, Z = (r, s) => `M ${r} ${s + 1} 
+   a 0.5 0.5, 0, 0, 1, 0 -1`, Z = (r, i) => `M ${r} ${i + 1} 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -1 0`, _ = (r, s) => `M ${r} ${s} 
+   a 0.5 0.5, 0, 0, 0, -1 0`, Q = (r, i) => `M ${r} ${i} 
    h 1 
    v 0.5 
-   a 0.5 0.5, 0, 0, 1, -1 0`, It = (r, s, l) => `M ${r + 1} ${s}h -${l / 2}a ${l / 2.5} ${l / 2.5}, 0, 0, 0, ${-l / 2.5} ${l / 2.5}v ${l / 2}h ${l / 2}a ${l / 2.5} ${l / 2.5}, 0, 0, 0, ${l / 2.5} ${-l / 2.5}`, Pt = ({
+   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 = ({
   x: r,
-  y: s,
-  numCells: l
+  y: i,
+  numCells: c
 }) => {
-  var a, t, c;
-  return !!((a = z[r]) != null && a[s] || (t = z[r - l + 7]) != null && t[s] || (c = z[r]) != null && c[s - l + 7]);
+  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 = ({
   x: r,
-  y: s,
-  radius: l
+  y: i,
+  radius: c
 }) => {
-  const a = T - l, t = l / 2, c = T - t;
-  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${c}v ${-c}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}H ${r}z`;
+  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 = ({
   x: r,
-  y: s,
-  radius: l
+  y: i,
+  radius: c
 }) => {
-  const a = T - l, t = l / 2, c = T - t;
-  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${c}v ${-c}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}a ${t} ${t}, 0, 0, 0, ${-t} ${t}`;
+  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 = ({
   x: r,
-  y: s,
-  numCells: l
+  y: i,
+  numCells: c
 }) => {
-  var a, t, c;
-  return !!((a = B[r]) != null && a[s] || (t = B[r - l + 7]) != null && t[s] || (c = B[r]) != null && c[s - l + 7]);
-}, yt = ({
+  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 = ({
   x: r,
-  y: s,
-  radius: l
+  y: i,
+  radius: c
 }) => {
-  const a = I - l, t = l / 2;
-  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${a}a ${t} ${t}, 0, 0, 0, ${t} ${-t}v ${-a}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}a ${t} ${t}, 0, 0, 0, ${-t} ${t}M ${r + t} ${s + 1}h ${a}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${t - 1}v ${a}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${t - 1}h ${-a}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-a}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${-(t - 1)}`;
-}, vt = ({
+  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 = ({
   x: r,
-  y: s,
-  radius: l
+  y: i,
+  radius: c
 }) => {
-  const a = I - l, t = l / 2, c = I - t;
-  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${c}v ${-c}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}H ${r}zM ${r + t} ${s + 1}h ${a}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${t - 1}v ${c - 1}h ${-(c - 1)}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-(c - 1)}z`;
-}, St = ({
+  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 = ({
   x: r,
-  y: s,
-  radius: l
+  y: i,
+  radius: c
 }) => {
-  const a = I - l, t = l / 2, c = I - t;
-  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${c}v ${-c}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}a ${t} ${t}, 0, 0, 0, ${-t} ${t}M ${r + t} ${s + 1}h ${a}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${t - 1}v ${c - 1}h ${-(c - 1)}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-a}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${-(t - 1)}`;
-}, Ut = (r) => ({
-  color: (r == null ? void 0 : r.color) || x,
-  style: (r == null ? void 0 : r.style) || $t,
+  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,
   randomSize: (r == null ? void 0 : r.randomSize) || !1
-}), bt = (r) => ({
-  color: (r == null ? void 0 : r.color) || x,
-  style: (r == null ? void 0 : r.style) || dt
 }), Dt = (r) => ({
-  color: (r == null ? void 0 : r.color) || x,
+  color: (r == null ? void 0 : r.color) || H,
   style: (r == null ? void 0 : r.style) || ft
-}), Ft = ({
+}), Ft = (r) => ({
+  color: (r == null ? void 0 : r.color) || H,
+  style: (r == null ? void 0 : r.style) || $t
+}), Bt = ({
   modules: r,
-  margin: s,
-  settings: l,
-  gradient: a
+  margin: i,
+  settings: c,
+  gradient: s
 }) => {
-  const { color: t, style: c, randomSize: d } = L(
-    () => Ut(l),
-    [l]
-  ), u = [], g = r.length, e = gt(c) && d, o = rt(
-    () => wt(c, e),
-    [c, e]
+  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]
   );
-  return r.forEach((n, i) => {
+  return r.forEach((n, a) => {
     n.forEach((h, $) => {
-      if (Ot({ x: $, y: i, numCells: g }) || Pt({ x: $, y: i, numCells: g }))
+      if (Ot({ x: $, y: a, numCells: g }) || vt({ x: $, y: a, numCells: g }))
         return;
-      const f = o(), p = 1 * f, M = (1 - 1 * f) / 2, E = $ + s + M, m = i + s + M;
+      const f = o(), p = 1 * f, M = (1 - 1 * f) / 2, E = $ + i + M, m = a + i + M;
       if (h) {
-        if (c === "square" || c === "square-sm")
-          u.push(v(E, m, p));
-        else if (c === "circle")
+        if (l === "square" || l === "square-sm")
+          u.push(y(E, m, p));
+        else if (l === "circle")
           u.push(D(E, m, p));
-        else if (c === "diamond")
-          u.push(At(E, m, p));
-        else if (c === "star")
+        else if (l === "diamond")
+          u.push(Ct(E, m, p));
+        else if (l === "star")
           u.push(
             et(E + p / 2, m + p / 2, p * 1.1, W)
           );
-        else if (c === "heart")
+        else if (l === "heart")
+          u.push(nt(E, m, p));
+        else if (l === "hashtag")
           u.push(ot(E, m, p));
-        else if (c === "rounded") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, i, r);
-          P === 0 ? u.push(D(E, m, 1)) : P > 2 || R && w || A && N ? u.push(v(E, m, 1)) : P === 2 ? R && A ? u.push(j(E, m)) : A && w ? u.push(Nt(E, m)) : w && N ? u.push(q(E, m)) : u.push(Ct(E, m)) : A ? u.push(_(E, m)) : w ? u.push(Q(E, m)) : N ? u.push(Z(E, m)) : u.push(X(E, m));
-        } else if (c === "leaf") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, i, r);
+        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));
+        } else if (l === "leaf") {
+          const { left: R, right: w, top: A, bottom: N, count: P } = b($, a, r);
           if (P === 0)
-            u.push(It(E, m, p));
+            u.push(Pt(E, m, p));
           else if (!R && !A) {
             u.push(q(E, m));
             return;
-          } else !w && !N ? u.push(j(E, m)) : u.push(v(E, m, 1));
-        } else if (c === "vertical-line") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, i, r);
-          P === 0 || R && !(A || N) || w && !(A || N) ? u.push(D(E, m, 1)) : A && N ? u.push(v(E, m, 1)) : A && !N ? u.push(_(E, m)) : N && !A && u.push(Z(E, m));
-        } else if (c === "horizontal-line") {
-          const { left: R, right: w, top: A, bottom: N, count: P } = b($, i, r);
-          P === 0 || A && !(R || w) || N && !(R || w) ? u.push(D(E, m, 1)) : R && w ? u.push(v(E, m, 1)) : R && !w ? u.push(X(E, m)) : w && !R && u.push(Q(E, m));
+          } else !w && !N ? u.push(j(E, m)) : u.push(y(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));
+        } 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));
         }
       }
     });
   }), /* @__PURE__ */ C(
     "path",
     {
-      fill: a ? `url(#${U})` : t,
+      fill: s ? `url(#${U})` : e,
       d: u.join(""),
-      shapeRendering: c === "square" ? "crispEdges" : "geometricPrecision",
+      shapeRendering: l === "square" ? "crispEdges" : "geometricPrecision",
       "data-testid": "data-modules"
     }
   );
-}, S = {
+}, O = {
   "data-testid": "finder-patterns-inner"
-}, Bt = ({
+}, zt = ({
   modules: r,
-  margin: s,
-  settings: l,
-  gradient: a
+  margin: i,
+  settings: c,
+  gradient: s
 }) => {
-  const { color: t, style: c } = L(
-    () => Dt(l),
-    [l]
-  ), d = a ? `url(#${U})` : t, u = L(
+  const { color: e, style: l } = T(
+    () => Ft(c),
+    [c]
+  ), d = s ? `url(#${U})` : e, u = T(
     () => [
-      { x: s + 2, y: s + 2 },
-      { x: r.length + s - I + 2, y: s + 2 },
-      { x: s + 2, y: r.length + s - I + 2 }
+      { x: i + 2, y: i + 2 },
+      { x: r.length + i - I + 2, y: i + 2 },
+      { x: i + 2, y: r.length + i - I + 2 }
     ],
-    [s, r.length]
-  ), g = (e, o) => `finder-patterns-inner-${c}-${e}-${o}`;
-  if (c === "rounded-sm" || c === "rounded" || c === "rounded-lg" || c === "circle" || c === "square")
-    return u.map((e) => {
-      const { x: o, y: n } = e;
+    [i, r.length]
+  ), g = (t, o) => `finder-patterns-inner-${l}-${t}-${o}`;
+  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(
         "rect",
         {
           x: o,
           y: n,
-          width: T,
-          height: T,
+          width: v,
+          height: v,
           fill: d,
-          rx: Y[c],
-          ...S
+          rx: G[l],
+          ...O
         },
         g(o, n)
       );
     });
-  if (c === "diamond")
-    return u.map((e) => {
-      const { x: o, y: n } = e, i = Math.sqrt(1.5), h = T / i, $ = h - h / i;
+  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(
         "rect",
         {
@@ -982,21 +1016,21 @@ const tt = (r) => {
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...S
+          ...O
         },
         g(o, n)
       );
     });
-  if (c === "inpoint-sm" || c === "inpoint" || c === "inpoint-lg" || c === "outpoint-sm" || c === "outpoint" || c === "outpoint-lg" || c === "leaf-sm" || c === "leaf" || c === "leaf-lg") {
-    const e = c === "leaf-sm" || c === "leaf" || c === "leaf-lg" ? Tt : Lt;
+  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[c][n]
-    })).map(({ x: o, y: n, rotation: i }) => {
-      const h = e({
+      rotation: J[l][n]
+    })).map(({ x: o, y: n, rotation: a }) => {
+      const h = t({
         x: o,
         y: n,
-        radius: Y[c]
+        radius: G[l]
       });
       return /* @__PURE__ */ C(
         "path",
@@ -1004,77 +1038,82 @@ const tt = (r) => {
           fill: d,
           d: h,
           style: {
-            transform: `rotate(${i}deg)`,
+            transform: `rotate(${a}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...S
+          ...O
         },
         g(o, n)
       );
     });
   }
-  if (c === "heart")
-    return u.map(({ x: e, y: o }) => /* @__PURE__ */ C(
+  if (l === "heart")
+    return u.map(({ x: t, y: o }) => /* @__PURE__ */ C(
       "path",
       {
         fill: d,
-        d: ot(e, o, T),
-        ...S
+        d: nt(t, o, v),
+        ...O
       },
-      g(e, o)
+      g(t, o)
     ));
-  if (c === "star")
-    return u.map(({ x: e, y: o }) => {
-      const n = e + T / 2, i = o + T / 2, h = et(n, i, T * 1.2, W);
-      return /* @__PURE__ */ C("path", { fill: d, d: h, ...S }, g(e, o));
+  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));
     });
-}, K = {
+  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));
+    });
+}, _ = {
   "data-testid": "finder-patterns-outer"
-}, zt = ({
+}, Ht = ({
   modules: r,
-  margin: s,
-  settings: l,
-  gradient: a
+  margin: i,
+  settings: c,
+  gradient: s
 }) => {
-  const { style: t, color: c } = L(
-    () => bt(l),
-    [l]
-  ), d = a ? `url(#${U})` : c, u = [], g = L(
+  const { style: e, color: l } = T(
+    () => Dt(c),
+    [c]
+  ), d = s ? `url(#${U})` : l, u = [], g = T(
     () => [
-      { x: s, y: s },
-      { x: r.length + s - I, y: s },
-      { x: s, y: r.length + s - I }
+      { x: i, y: i },
+      { x: r.length + i - I, y: i },
+      { x: i, y: r.length + i - I }
     ],
-    [s, r.length]
+    [i, r.length]
   );
-  if (["rounded-sm", "rounded", "rounded-lg", "circle", "square"].includes(t)) {
-    for (const e of g) {
-      const { x: o, y: n } = e;
-      t === "rounded-sm" || t === "rounded" || t === "rounded-lg" ? u.push(
-        yt({
+  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: H[t]
+          radius: Y[e]
         })
-      ) : t === "circle" ? u.push(
+      ) : 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`
       ) : 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`
       );
     }
-    return /* @__PURE__ */ C("path", { fill: d, d: u.join(""), ...K });
+    return /* @__PURE__ */ C("path", { fill: d, d: u.join(""), ..._ });
   }
-  if (t === "inpoint-sm" || t === "inpoint" || t === "inpoint-lg" || t === "outpoint-sm" || t === "outpoint" || t === "outpoint-lg" || t === "leaf-sm" || t === "leaf" || t === "leaf-lg") {
-    const e = t === "leaf-sm" || t === "leaf" || t === "leaf-lg" ? vt : St;
+  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[t][n]
-    })).map(({ x: o, y: n, rotation: i }) => {
-      const h = e({
+      rotation: J[e][n]
+    })).map(({ x: o, y: n, rotation: a }) => {
+      const h = t({
         x: o,
         y: n,
-        radius: H[t]
+        radius: Y[e]
       });
       return /* @__PURE__ */ C(
         "path",
@@ -1082,22 +1121,22 @@ const tt = (r) => {
           fill: d,
           d: h,
           style: {
-            transform: `rotate(${i}deg)`,
+            transform: `rotate(${a}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           },
-          ...K
+          ..._
         },
-        `finder-patterns-outer-${t}-${o}-${n}`
+        `finder-patterns-outer-${e}-${o}-${n}`
       );
     });
   }
-}, xt = ({ gradient: r }) => {
-  var l, a;
+}, kt = ({ gradient: r }) => {
+  var c, s;
   if (!r)
     return null;
-  const s = tt((r == null ? void 0 : r.rotation) || 0);
-  return /* @__PURE__ */ C("defs", { children: r.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: U, gradientUnits: "userSpaceOnUse", ...s, children: (l = r.stops) == null ? void 0 : l.map((t, c) => /* @__PURE__ */ C("stop", { offset: t.offset, stopColor: t.color }, c)) }) : /* @__PURE__ */ C(
+  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(
     "radialGradient",
     {
       id: U,
@@ -1105,140 +1144,140 @@ const tt = (r) => {
       cx: "50%",
       cy: "50%",
       r: "50%",
-      children: (a = r.stops) == null ? void 0 : a.map((t, c) => /* @__PURE__ */ C("stop", { offset: t.offset, stopColor: t.color }, c))
+      children: (s = r.stops) == null ? void 0 : s.map((e, l) => /* @__PURE__ */ C("stop", { offset: e.offset, stopColor: e.color }, l))
     }
   ) });
-}, kt = (r, s) => r.slice().map((l, a) => a < s.y || a >= s.y + s.h ? l : l.map((t, c) => c < s.x || c >= s.x + s.w ? t : !1)), Ht = (r, s, l, a) => {
-  if (a == null)
+}, 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) => {
+  if (s == null)
     return null;
-  const t = r.length + l * 2, c = Math.floor(s * mt), d = t / s, u = (a.width || c) * d, g = (a.height || c) * d, e = a.x == null ? r.length / 2 - u / 2 : a.x * d, o = a.y == null ? r.length / 2 - g / 2 : a.y * d, n = a.opacity == null ? 1 : a.opacity;
-  let i = null;
-  if (a.excavate) {
-    const $ = Math.floor(e), f = Math.floor(o), p = Math.ceil(u + e - $), M = Math.ceil(g + o - f);
-    i = { x: $, y: f, w: p, h: M };
+  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;
+  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 h = a.crossOrigin;
-  return { x: e, y: o, h: g, w: u, excavation: i, opacity: n, crossOrigin: h };
-}, Yt = (r) => r != null ? Math.max(Math.floor(r), 0) : ut, Gt = ({
+  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 = ({
   value: r,
-  level: s,
-  minVersion: l,
-  marginSize: a,
-  imageSettings: t,
-  size: c,
+  level: i,
+  minVersion: c,
+  marginSize: s,
+  imageSettings: e,
+  size: l,
   boostLevel: d
 }) => {
-  const u = L(() => {
-    const h = (Array.isArray(r) ? r : [r]).reduce(($, f) => ($.push(...y.QrSegment.makeSegments(f)), $), []);
-    return y.QrCode.encodeSegments(
+  const u = T(() => {
+    const h = (Array.isArray(r) ? r : [r]).reduce(($, f) => ($.push(...S.QrSegment.makeSegments(f)), $), []);
+    return S.QrCode.encodeSegments(
       h,
-      at[s],
-      l,
+      ct[i],
+      c,
       void 0,
       void 0,
       d
     );
-  }, [r, s, l, d]), { cells: g, margin: e, numCells: o, calculatedImageSettings: n } = L(() => {
-    const i = u.getModules(), h = Yt(a), $ = i.length + h * 2, f = Ht(i, c, h, t);
+  }, [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);
     return {
-      cells: i,
+      cells: a,
       margin: h,
       numCells: $,
       calculatedImageSettings: f
     };
-  }, [u, c, t, a]);
+  }, [u, l, e, s]);
   return {
     qrcode: u,
-    margin: e,
+    margin: t,
     cells: g,
     numCells: o,
     calculatedImageSettings: n
   };
-}, qt = ({ svgRef: r, fileSize: s, fileName: l }) => {
+}, jt = ({ svgRef: r, fileSize: i, fileName: c }) => {
   if (!r.current) return;
-  const a = r.current.cloneNode(!0);
-  a.setAttribute("width", s.toString()), a.setAttribute("height", s.toString());
-  const t = new XMLSerializer(), c = new Blob([t.serializeToString(a)], {
+  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)], {
     type: "image/svg+xml"
-  }), d = URL.createObjectURL(c), u = document.createElement("a");
-  u.href = d, u.download = `${l}.svg`, document.body.appendChild(u), u.click(), document.body.removeChild(u), URL.revokeObjectURL(d);
-}, jt = ({
+  }), 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);
+}, Vt = ({
   svgRef: r,
-  fileSize: s,
-  fileName: l,
-  fileFormat: a,
-  imageSettings: t,
-  calculatedImageSettings: c,
+  fileSize: i,
+  fileName: c,
+  fileFormat: s,
+  imageSettings: e,
+  calculatedImageSettings: l,
   size: d,
   numCells: u,
   margin: g
 }) => {
   if (!r.current) return;
-  const e = document.createElement("canvas"), o = e.getContext("2d");
+  const t = document.createElement("canvas"), o = t.getContext("2d");
   if (!o) return;
-  e.width = s, e.height = s;
-  const n = new XMLSerializer().serializeToString(r.current), i = new Blob([n], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(i), $ = new Image();
+  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, s, s), URL.revokeObjectURL(h), t != null && t.src && c) {
+    if (o.drawImage($, 0, 0, i, i), URL.revokeObjectURL(h), e != null && e.src && l) {
       const f = new Image();
-      f.crossOrigin = "anonymous", f.src = t.src, f.onload = () => {
-        const p = s / d, M = u / s, E = t.width * p, m = t.x ? (c.x + g) / M : (s - E) / 2, R = t.y ? (c.y + g) / M : (s - E) / 2;
+      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 = a === "png" ? "image/png" : "image/jpeg", A = document.createElement("a");
-        A.href = e.toDataURL(w), A.download = `${l}.${a}`, document.body.appendChild(A), A.click(), document.body.removeChild(A);
+        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);
     } else {
-      const f = a === "png" ? "image/png" : "image/jpeg", p = document.createElement("a");
-      p.href = e.toDataURL(f), p.download = `${l}.${a}`, document.body.appendChild(p), p.click(), document.body.removeChild(p);
+      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);
     }
   }, $.onerror = (f) => console.error("Error loading QR code:", f);
 }, Xt = (r) => {
   const {
-    ref: s,
-    value: l,
-    size: a = lt,
-    level: t = ct,
-    background: c,
+    ref: i,
+    value: c,
+    size: s = lt,
+    level: e = ht,
+    background: l,
     gradient: d,
-    minVersion: u = ht,
+    minVersion: u = ut,
     boostLevel: g,
-    marginSize: e,
+    marginSize: t,
     finderPatternOuterSettings: o,
     finderPatternInnerSettings: n,
-    dataModulesSettings: i,
+    dataModulesSettings: a,
     imageSettings: h,
     svgProps: $
-  } = r, f = st(null), { margin: p, cells: M, numCells: E, calculatedImageSettings: m } = Gt({
-    value: l,
-    level: t,
+  } = r, f = it(null), { margin: p, cells: M, numCells: E, calculatedImageSettings: m } = qt({
+    value: c,
+    level: e,
     minVersion: u,
     boostLevel: g,
-    marginSize: e,
+    marginSize: t,
     imageSettings: h,
-    size: a
+    size: s
   });
-  it(s, () => ({
+  at(i, () => ({
     svg: f.current,
     download: ({
-      name: N = pt,
+      name: N = mt,
       format: P = "svg",
       size: k = 500
     }) => {
-      f.current && (P === "svg" ? qt({ svgRef: f, fileSize: k, fileName: N }) : jt({
+      f.current && (P === "svg" ? jt({ svgRef: f, fileSize: k, fileName: N }) : Vt({
         svgRef: f,
         fileSize: k,
         fileName: N,
         fileFormat: P,
         imageSettings: h,
         calculatedImageSettings: m,
-        size: a,
+        size: s,
         numCells: E,
         margin: p
       }));
     }
   }));
   let R = M, w = null;
-  h != null && m != null && (m.excavation != null && (R = kt(M, m.excavation)), w = /* @__PURE__ */ C(
+  h != null && m != null && (m.excavation != null && (R = Yt(M, m.excavation)), w = /* @__PURE__ */ C(
     "image",
     {
       href: h.src,
@@ -1256,22 +1295,22 @@ const tt = (r) => {
     margin: p,
     gradient: d
   };
-  return /* @__PURE__ */ V(
+  return /* @__PURE__ */ K(
     "svg",
     {
-      height: a,
-      width: a,
+      height: s,
+      width: s,
       viewBox: `0 0 ${E} ${E}`,
       ref: f,
       role: "img",
       "aria-label": ($ == null ? void 0 : $["aria-label"]) || "QR Code",
       ...$,
       children: [
-        /* @__PURE__ */ C(xt, { gradient: d }),
-        /* @__PURE__ */ C(Rt, { background: c, numCells: E }),
-        /* @__PURE__ */ C(zt, { settings: o, ...A }),
-        /* @__PURE__ */ C(Bt, { settings: n, ...A }),
-        /* @__PURE__ */ C(Ft, { settings: i, ...A }),
+        /* @__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
       ]
     }