@lglab/react-qr-code 1.1.0 → 1.2.1

package/dist/index.es.js

@@ -1,37 +1,37 @@
-import { jsx as I, jsxs as Z } from "react/jsx-runtime";
-import { useMemo as T, useCallback as K, useRef as V, useImperativeHandle as _ } from "react";
+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";
 /**
  * @license QR Code generator library (TypeScript)
  * Copyright (c) Project Nayuki.
  * SPDX-License-Identifier: MIT
  */
-var L;
+var O;
 ((r) => {
-  const c = class c {
+  const d = class d {
     /*-- Constructor (low level) and fields --*/
     // Creates a new QR Code with the given version number,
     // error correction level, data codeword bytes, and mask number.
     // This is a low-level API that most users should not use directly.
     // A mid-level API is the encodeSegments() function.
-    constructor(e, n, o, i) {
-      if (this.version = e, this.errorCorrectionLevel = n, this.modules = [], this.isFunction = [], e < c.MIN_VERSION || e > c.MAX_VERSION)
+    constructor(e, o, n, i) {
+      if (this.version = e, this.errorCorrectionLevel = o, this.modules = [], this.isFunction = [], e < d.MIN_VERSION || e > d.MAX_VERSION)
         throw new RangeError("Version value out of range");
       if (i < -1 || i > 7)
         throw new RangeError("Mask value out of range");
       this.size = e * 4 + 17;
       let h = [];
-      for (let u = 0; u < this.size; u++)
+      for (let f = 0; f < this.size; f++)
         h.push(!1);
-      for (let u = 0; u < this.size; u++)
+      for (let f = 0; f < this.size; f++)
         this.modules.push(h.slice()), this.isFunction.push(h.slice());
       this.drawFunctionPatterns();
-      const p = this.addEccAndInterleave(o);
-      if (this.drawCodewords(p), i == -1) {
-        let u = 1e9;
-        for (let M = 0; M < 8; M++) {
-          this.applyMask(M), this.drawFormatBits(M);
-          const f = this.getPenaltyScore();
-          f < u && (i = M, u = f), this.applyMask(M);
+      const $ = this.addEccAndInterleave(n);
+      if (this.drawCodewords($), i == -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);
         }
       }
       t(0 <= i && i <= 7), this.mask = i, this.applyMask(i), this.drawFormatBits(i), this.isFunction = [];
@@ -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(e, n) {
-      const o = r.QrSegment.makeSegments(e);
-      return c.encodeSegments(o, n);
+    static encodeText(e, o) {
+      const n = r.QrSegment.makeSegments(e);
+      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, n) {
-      const o = r.QrSegment.makeBytes(e);
-      return c.encodeSegments([o], n);
+    static encodeBinary(e, o) {
+      const n = r.QrSegment.makeBytes(e);
+      return d.encodeSegments([n], o);
     }
     /*-- 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(e, n, o = 1, i = 40, h = -1, p = !0) {
-      if (!(c.MIN_VERSION <= o && o <= i && i <= c.MAX_VERSION) || h < -1 || h > 7)
+    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)
         throw new RangeError("Invalid value");
-      let u, M;
-      for (u = o; ; u++) {
-        const g = c.getNumDataCodewords(u, n) * 8, R = d.getTotalBits(e, u);
-        if (R <= g) {
-          M = R;
+      let f, p;
+      for (f = n; ; f++) {
+        const R = d.getNumDataCodewords(f, o) * 8, w = c.getTotalBits(e, f);
+        if (w <= R) {
+          p = w;
           break;
         }
-        if (u >= i)
+        if (f >= i)
           throw new RangeError("Data too long");
       }
-      for (const g of [c.Ecc.MEDIUM, c.Ecc.QUARTILE, c.Ecc.HIGH])
-        p && M <= c.getNumDataCodewords(u, g) * 8 && (n = g);
-      let f = [];
-      for (const g of e) {
-        l(g.mode.modeBits, 4, f), l(g.numChars, g.mode.numCharCountBits(u), f);
-        for (const R of g.getData())
-          f.push(R);
+      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 w of R.getData())
+          M.push(w);
       }
-      t(f.length == M);
-      const E = c.getNumDataCodewords(u, n) * 8;
-      t(f.length <= E), l(0, Math.min(4, E - f.length), f), l(0, (8 - f.length % 8) % 8, f), t(f.length % 8 == 0);
-      for (let g = 236; f.length < E; g ^= 253)
-        l(g, 8, f);
-      let A = [];
-      for (; A.length * 8 < f.length; )
-        A.push(0);
-      return f.forEach((g, R) => A[R >>> 3] |= g << 7 - (R & 7)), new c(u, n, A, h);
+      t(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);
+      for (let R = 236; M.length < E; R ^= 253)
+        l(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);
     }
     /*-- 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(e, n) {
-      return 0 <= e && e < this.size && 0 <= n && n < this.size && this.modules[n][e];
+    getModule(e, o) {
+      return 0 <= e && e < this.size && 0 <= o && o < this.size && this.modules[o][e];
     }
     // 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 o = 0; o < this.size; o++)
-        this.setFunctionModule(6, o, o % 2 == 0), this.setFunctionModule(o, 6, o % 2 == 0);
+      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(), n = e.length;
-      for (let o = 0; o < n; o++)
-        for (let i = 0; i < n; i++)
-          o == 0 && i == 0 || o == 0 && i == n - 1 || o == n - 1 && i == 0 || this.drawAlignmentPattern(e[o], e[i]);
+      const e = this.getAlignmentPatternPositions(), o = e.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]);
       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 n = this.errorCorrectionLevel.formatBits << 3 | e;
-      let o = n;
+      const o = this.errorCorrectionLevel.formatBits << 3 | e;
+      let n = o;
       for (let h = 0; h < 10; h++)
-        o = o << 1 ^ (o >>> 9) * 1335;
-      const i = (n << 10 | o) ^ 21522;
+        n = n << 1 ^ (n >>> 9) * 1335;
+      const i = (o << 10 | n) ^ 21522;
       t(i >>> 15 == 0);
       for (let h = 0; h <= 5; h++)
-        this.setFunctionModule(8, h, s(i, h));
-      this.setFunctionModule(8, 7, s(i, 6)), this.setFunctionModule(8, 8, s(i, 7)), this.setFunctionModule(7, 8, s(i, 8));
+        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));
       for (let h = 9; h < 15; h++)
-        this.setFunctionModule(14 - h, 8, s(i, h));
+        this.setFunctionModule(14 - h, 8, a(i, h));
       for (let h = 0; h < 8; h++)
-        this.setFunctionModule(this.size - 1 - h, 8, s(i, h));
+        this.setFunctionModule(this.size - 1 - h, 8, a(i, h));
       for (let h = 8; h < 15; h++)
-        this.setFunctionModule(8, this.size - 15 + h, s(i, h));
+        this.setFunctionModule(8, this.size - 15 + h, a(i, h));
       this.setFunctionModule(8, this.size - 8, !0);
     }
     // Draws two copies of the version bits (with its own error correction code),
@@ -144,74 +144,74 @@ var L;
       if (this.version < 7)
         return;
       let e = this.version;
-      for (let o = 0; o < 12; o++)
+      for (let n = 0; n < 12; n++)
         e = e << 1 ^ (e >>> 11) * 7973;
-      const n = this.version << 12 | e;
-      t(n >>> 18 == 0);
-      for (let o = 0; o < 18; o++) {
-        const i = s(n, o), h = this.size - 11 + o % 3, p = Math.floor(o / 3);
-        this.setFunctionModule(h, p, i), this.setFunctionModule(p, h, i);
+      const o = this.version << 12 | e;
+      t(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);
       }
     }
     // Draws a 9*9 finder pattern including the border separator,
     // with the center module at (x, y). Modules can be out of bounds.
-    drawFinderPattern(e, n) {
-      for (let o = -4; o <= 4; o++)
+    drawFinderPattern(e, o) {
+      for (let n = -4; n <= 4; n++)
         for (let i = -4; i <= 4; i++) {
-          const h = Math.max(Math.abs(i), Math.abs(o)), p = e + i, u = n + o;
-          0 <= p && p < this.size && 0 <= u && u < this.size && this.setFunctionModule(p, u, h != 2 && h != 4);
+          const h = Math.max(Math.abs(i), Math.abs(n)), $ = e + i, 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, n) {
-      for (let o = -2; o <= 2; o++)
+    drawAlignmentPattern(e, o) {
+      for (let n = -2; n <= 2; n++)
         for (let i = -2; i <= 2; i++)
-          this.setFunctionModule(e + i, n + o, Math.max(Math.abs(i), Math.abs(o)) != 1);
+          this.setFunctionModule(e + i, o + n, Math.max(Math.abs(i), 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, n, o) {
-      this.modules[n][e] = o, this.isFunction[n][e] = !0;
+    setFunctionModule(e, o, n) {
+      this.modules[o][e] = n, this.isFunction[o][e] = !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) {
-      const n = this.version, o = this.errorCorrectionLevel;
-      if (e.length != c.getNumDataCodewords(n, o))
+      const o = this.version, n = this.errorCorrectionLevel;
+      if (e.length != d.getNumDataCodewords(o, n))
         throw new RangeError("Invalid argument");
-      const i = c.NUM_ERROR_CORRECTION_BLOCKS[o.ordinal][n], h = c.ECC_CODEWORDS_PER_BLOCK[o.ordinal][n], p = Math.floor(c.getNumRawDataModules(n) / 8), u = i - p % i, M = Math.floor(p / i);
-      let f = [];
-      const E = c.reedSolomonComputeDivisor(h);
-      for (let g = 0, R = 0; g < i; g++) {
-        let w = e.slice(R, R + M - h + (g < u ? 0 : 1));
-        R += w.length;
-        const N = c.reedSolomonComputeRemainder(w, E);
-        g < u && w.push(0), f.push(w.concat(N));
+      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);
+      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));
+        w += A.length;
+        const N = d.reedSolomonComputeRemainder(A, E);
+        R < f && A.push(0), M.push(A.concat(N));
       }
-      let A = [];
-      for (let g = 0; g < f[0].length; g++)
-        f.forEach((R, w) => {
-          (g != M - h || w >= u) && A.push(R[g]);
+      let m = [];
+      for (let R = 0; R < M[0].length; R++)
+        M.forEach((w, A) => {
+          (R != p - h || A >= f) && m.push(w[R]);
         });
-      return t(A.length == p), A;
+      return t(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(c.getNumRawDataModules(this.version) / 8))
+      if (e.length != Math.floor(d.getNumRawDataModules(this.version) / 8))
         throw new RangeError("Invalid argument");
-      let n = 0;
-      for (let o = this.size - 1; o >= 1; o -= 2) {
-        o == 6 && (o = 5);
+      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 h = 0; h < 2; h++) {
-            const p = o - h, M = (o + 1 & 2) == 0 ? this.size - 1 - i : i;
-            !this.isFunction[M][p] && n < e.length * 8 && (this.modules[M][p] = s(e[n >>> 3], 7 - (n & 7)), n++);
+            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++);
           }
       }
-      t(n == e.length * 8);
+      t(o == e.length * 8);
     }
     // XORs the codeword modules in this QR Code with the given mask pattern.
     // The function modules must be marked and the codeword bits must be drawn
@@ -221,38 +221,38 @@ var L;
     applyMask(e) {
       if (e < 0 || e > 7)
         throw new RangeError("Mask value out of range");
-      for (let n = 0; n < this.size; n++)
-        for (let o = 0; o < this.size; o++) {
+      for (let o = 0; o < this.size; o++)
+        for (let n = 0; n < this.size; n++) {
           let i;
           switch (e) {
             case 0:
-              i = (o + n) % 2 == 0;
+              i = (n + o) % 2 == 0;
               break;
             case 1:
-              i = n % 2 == 0;
+              i = o % 2 == 0;
               break;
             case 2:
-              i = o % 3 == 0;
+              i = n % 3 == 0;
               break;
             case 3:
-              i = (o + n) % 3 == 0;
+              i = (n + o) % 3 == 0;
               break;
             case 4:
-              i = (Math.floor(o / 3) + Math.floor(n / 2)) % 2 == 0;
+              i = (Math.floor(n / 3) + Math.floor(o / 2)) % 2 == 0;
               break;
             case 5:
-              i = o * n % 2 + o * n % 3 == 0;
+              i = n * o % 2 + n * o % 3 == 0;
               break;
             case 6:
-              i = (o * n % 2 + o * n % 3) % 2 == 0;
+              i = (n * o % 2 + n * o % 3) % 2 == 0;
               break;
             case 7:
-              i = ((o + n) % 2 + o * n % 3) % 2 == 0;
+              i = ((n + o) % 2 + n * o % 3) % 2 == 0;
               break;
             default:
               throw new Error("Unreachable");
           }
-          !this.isFunction[n][o] && i && (this.modules[n][o] = !this.modules[n][o]);
+          !this.isFunction[o][n] && i && (this.modules[o][n] = !this.modules[o][n]);
         }
     }
     // Calculates and returns the penalty score based on state of this QR Code's current modules.
@@ -260,27 +260,27 @@ var L;
     getPenaltyScore() {
       let e = 0;
       for (let h = 0; h < this.size; h++) {
-        let p = !1, u = 0, M = [0, 0, 0, 0, 0, 0, 0];
-        for (let f = 0; f < this.size; f++)
-          this.modules[h][f] == p ? (u++, u == 5 ? e += c.PENALTY_N1 : u > 5 && e++) : (this.finderPenaltyAddHistory(u, M), p || (e += this.finderPenaltyCountPatterns(M) * c.PENALTY_N3), p = this.modules[h][f], u = 1);
-        e += this.finderPenaltyTerminateAndCount(p, u, M) * c.PENALTY_N3;
+        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;
       }
       for (let h = 0; h < this.size; h++) {
-        let p = !1, u = 0, M = [0, 0, 0, 0, 0, 0, 0];
-        for (let f = 0; f < this.size; f++)
-          this.modules[f][h] == p ? (u++, u == 5 ? e += c.PENALTY_N1 : u > 5 && e++) : (this.finderPenaltyAddHistory(u, M), p || (e += this.finderPenaltyCountPatterns(M) * c.PENALTY_N3), p = this.modules[f][h], u = 1);
-        e += this.finderPenaltyTerminateAndCount(p, u, M) * c.PENALTY_N3;
+        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;
       }
       for (let h = 0; h < this.size - 1; h++)
-        for (let p = 0; p < this.size - 1; p++) {
-          const u = this.modules[h][p];
-          u == this.modules[h][p + 1] && u == this.modules[h + 1][p] && u == this.modules[h + 1][p + 1] && (e += c.PENALTY_N2);
+        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);
         }
-      let n = 0;
+      let o = 0;
       for (const h of this.modules)
-        n = h.reduce((p, u) => p + (u ? 1 : 0), n);
-      const o = this.size * this.size, i = Math.ceil(Math.abs(n * 20 - o * 10) / o) - 1;
-      return t(0 <= i && i <= 9), e += i * c.PENALTY_N4, t(0 <= e && e <= 2568888), e;
+        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;
     }
     /*-- Private helper functions --*/
     // Returns an ascending list of positions of alignment patterns for this version number.
@@ -290,86 +290,86 @@ var L;
       if (this.version == 1)
         return [];
       {
-        const e = Math.floor(this.version / 7) + 2, n = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2;
-        let o = [6];
-        for (let i = this.size - 7; o.length < e; i -= n)
-          o.splice(1, 0, i);
-        return o;
+        const e = Math.floor(this.version / 7) + 2, o = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2;
+        let n = [6];
+        for (let i = this.size - 7; n.length < e; i -= o)
+          n.splice(1, 0, i);
+        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 < c.MIN_VERSION || e > c.MAX_VERSION)
+      if (e < d.MIN_VERSION || e > d.MAX_VERSION)
         throw new RangeError("Version number out of range");
-      let n = (16 * e + 128) * e + 64;
+      let o = (16 * e + 128) * e + 64;
       if (e >= 2) {
-        const o = Math.floor(e / 7) + 2;
-        n -= (25 * o - 10) * o - 55, e >= 7 && (n -= 36);
+        const n = Math.floor(e / 7) + 2;
+        o -= (25 * n - 10) * n - 55, e >= 7 && (o -= 36);
       }
-      return t(208 <= n && n <= 29648), n;
+      return t(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, n) {
-      return Math.floor(c.getNumRawDataModules(e) / 8) - c.ECC_CODEWORDS_PER_BLOCK[n.ordinal][e] * c.NUM_ERROR_CORRECTION_BLOCKS[n.ordinal][e];
+    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];
     }
     // 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)
         throw new RangeError("Degree out of range");
-      let n = [];
+      let o = [];
       for (let i = 0; i < e - 1; i++)
-        n.push(0);
-      n.push(1);
-      let o = 1;
+        o.push(0);
+      o.push(1);
+      let n = 1;
       for (let i = 0; i < e; i++) {
-        for (let h = 0; h < n.length; h++)
-          n[h] = c.reedSolomonMultiply(n[h], o), h + 1 < n.length && (n[h] ^= n[h + 1]);
-        o = c.reedSolomonMultiply(o, 2);
+        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);
       }
-      return n;
+      return o;
     }
     // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static reedSolomonComputeRemainder(e, n) {
-      let o = n.map((i) => 0);
+    static reedSolomonComputeRemainder(e, o) {
+      let n = o.map((i) => 0);
       for (const i of e) {
-        const h = i ^ o.shift();
-        o.push(0), n.forEach((p, u) => o[u] ^= c.reedSolomonMultiply(p, h));
+        const h = i ^ n.shift();
+        n.push(0), o.forEach(($, f) => n[f] ^= d.reedSolomonMultiply($, h));
       }
-      return o;
+      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, n) {
-      if (e >>> 8 || n >>> 8)
+    static reedSolomonMultiply(e, o) {
+      if (e >>> 8 || o >>> 8)
         throw new RangeError("Byte out of range");
-      let o = 0;
+      let n = 0;
       for (let i = 7; i >= 0; i--)
-        o = o << 1 ^ (o >>> 7) * 285, o ^= (n >>> i & 1) * e;
-      return t(o >>> 8 == 0), o;
+        n = n << 1 ^ (n >>> 7) * 285, n ^= (o >>> i & 1) * e;
+      return t(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 n = e[1];
-      t(n <= this.size * 3);
-      const o = n > 0 && e[2] == n && e[3] == n * 3 && e[4] == n && e[5] == n;
-      return (o && e[0] >= n * 4 && e[6] >= n ? 1 : 0) + (o && e[6] >= n * 4 && e[0] >= n ? 1 : 0);
+      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);
     }
     // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
-    finderPenaltyTerminateAndCount(e, n, o) {
-      return e && (this.finderPenaltyAddHistory(n, o), n = 0), n += this.size, this.finderPenaltyAddHistory(n, o), this.finderPenaltyCountPatterns(o);
+    finderPenaltyTerminateAndCount(e, o, n) {
+      return e && (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, n) {
-      n[0] == 0 && (e += this.size), n.pop(), n.unshift(e);
+    finderPenaltyAddHistory(e, o) {
+      o[0] == 0 && (e += this.size), o.pop(), o.unshift(e);
     }
   };
-  c.MIN_VERSION = 1, c.MAX_VERSION = 40, c.PENALTY_N1 = 3, c.PENALTY_N2 = 3, c.PENALTY_N3 = 40, c.PENALTY_N4 = 10, c.ECC_CODEWORDS_PER_BLOCK = [
+  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 = [
     // Version: (note that index 0 is for padding, and is set to an illegal value)
     //0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
     [-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
@@ -380,7 +380,7 @@ var L;
     // Quartile
     [-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30]
     // High
-  ], c.NUM_ERROR_CORRECTION_BLOCKS = [
+  ], d.NUM_ERROR_CORRECTION_BLOCKS = [
     // Version: (note that index 0 is for padding, and is set to an illegal value)
     //0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
     [-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],
@@ -392,96 +392,96 @@ var L;
     [-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 a = c;
-  r.QrCode = a;
-  function l(m, e, n) {
-    if (e < 0 || e > 31 || m >>> e)
+  let s = d;
+  r.QrCode = s;
+  function l(g, e, o) {
+    if (e < 0 || e > 31 || g >>> e)
       throw new RangeError("Value out of range");
-    for (let o = e - 1; o >= 0; o--)
-      n.push(m >>> o & 1);
+    for (let n = e - 1; n >= 0; n--)
+      o.push(g >>> n & 1);
   }
-  function s(m, e) {
-    return (m >>> e & 1) != 0;
+  function a(g, e) {
+    return (g >>> e & 1) != 0;
   }
-  function t(m) {
-    if (!m)
+  function t(g) {
+    if (!g)
       throw new Error("Assertion error");
   }
-  const $ = class $ {
+  const u = class u {
     /*-- Constructor (low level) and fields --*/
     // Creates a new QR Code segment with the given attributes and data.
     // The character count (numChars) must agree with the mode and the bit buffer length,
     // but the constraint isn't checked. The given bit buffer is cloned and stored.
-    constructor(e, n, o) {
-      if (this.mode = e, this.numChars = n, this.bitData = o, n < 0)
+    constructor(e, o, n) {
+      if (this.mode = e, this.numChars = o, this.bitData = n, o < 0)
         throw new RangeError("Invalid argument");
-      this.bitData = o.slice();
+      this.bitData = n.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(e) {
-      let n = [];
-      for (const o of e)
-        l(o, 8, n);
-      return new $($.Mode.BYTE, e.length, n);
+      let o = [];
+      for (const n of e)
+        l(n, 8, o);
+      return new u(u.Mode.BYTE, e.length, o);
     }
     // Returns a segment representing the given string of decimal digits encoded in numeric mode.
     static makeNumeric(e) {
-      if (!$.isNumeric(e))
+      if (!u.isNumeric(e))
         throw new RangeError("String contains non-numeric characters");
-      let n = [];
-      for (let o = 0; o < e.length; ) {
-        const i = Math.min(e.length - o, 3);
-        l(parseInt(e.substring(o, o + i), 10), i * 3 + 1, n), o += i;
+      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;
       }
-      return new $($.Mode.NUMERIC, e.length, n);
+      return new u(u.Mode.NUMERIC, e.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 (!$.isAlphanumeric(e))
+      if (!u.isAlphanumeric(e))
         throw new RangeError("String contains unencodable characters in alphanumeric mode");
-      let n = [], o;
-      for (o = 0; o + 2 <= e.length; o += 2) {
-        let i = $.ALPHANUMERIC_CHARSET.indexOf(e.charAt(o)) * 45;
-        i += $.ALPHANUMERIC_CHARSET.indexOf(e.charAt(o + 1)), l(i, 11, n);
+      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);
       }
-      return o < e.length && l($.ALPHANUMERIC_CHARSET.indexOf(e.charAt(o)), 6, n), new $($.Mode.ALPHANUMERIC, e.length, n);
+      return n < e.length && l(u.ALPHANUMERIC_CHARSET.indexOf(e.charAt(n)), 6, o), new u(u.Mode.ALPHANUMERIC, e.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 == "" ? [] : $.isNumeric(e) ? [$.makeNumeric(e)] : $.isAlphanumeric(e) ? [$.makeAlphanumeric(e)] : [$.makeBytes($.toUtf8ByteArray(e))];
+      return e == "" ? [] : u.isNumeric(e) ? [u.makeNumeric(e)] : u.isAlphanumeric(e) ? [u.makeAlphanumeric(e)] : [u.makeBytes(u.toUtf8ByteArray(e))];
     }
     // Returns a segment representing an Extended Channel Interpretation
     // (ECI) designator with the given assignment value.
     static makeEci(e) {
-      let n = [];
+      let o = [];
       if (e < 0)
         throw new RangeError("ECI assignment value out of range");
       if (e < 128)
-        l(e, 8, n);
+        l(e, 8, o);
       else if (e < 16384)
-        l(2, 2, n), l(e, 14, n);
+        l(2, 2, o), l(e, 14, o);
       else if (e < 1e6)
-        l(6, 3, n), l(e, 21, n);
+        l(6, 3, o), l(e, 21, o);
       else
         throw new RangeError("ECI assignment value out of range");
-      return new $($.Mode.ECI, 0, n);
+      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 $.NUMERIC_REGEX.test(e);
+      return u.NUMERIC_REGEX.test(e);
     }
     // Tests whether the given string can be encoded as a segment in alphanumeric mode.
     // A string is encodable iff each character is in the following set: 0 to 9, A to Z
     // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
     static isAlphanumeric(e) {
-      return $.ALPHANUMERIC_REGEX.test(e);
+      return u.ALPHANUMERIC_REGEX.test(e);
     }
     /*-- Methods --*/
     // Returns a new copy of the data bits of this segment.
@@ -490,68 +490,68 @@ 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(e, n) {
-      let o = 0;
+    static getTotalBits(e, o) {
+      let n = 0;
       for (const i of e) {
-        const h = i.mode.numCharCountBits(n);
+        const h = i.mode.numCharCountBits(o);
         if (i.numChars >= 1 << h)
           return 1 / 0;
-        o += 4 + h + i.bitData.length;
+        n += 4 + h + i.bitData.length;
       }
-      return o;
+      return n;
     }
     // Returns a new array of bytes representing the given string encoded in UTF-8.
     static toUtf8ByteArray(e) {
       e = encodeURI(e);
-      let n = [];
-      for (let o = 0; o < e.length; o++)
-        e.charAt(o) != "%" ? n.push(e.charCodeAt(o)) : (n.push(parseInt(e.substring(o + 1, o + 3), 16)), o += 2);
-      return n;
+      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);
+      return o;
     }
   };
-  $.NUMERIC_REGEX = /^[0-9]*$/, $.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, $.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-  let d = $;
-  r.QrSegment = d;
-})(L || (L = {}));
+  u.NUMERIC_REGEX = /^[0-9]*$/, u.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, u.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+  let c = u;
+  r.QrSegment = c;
+})(O || (O = {}));
 ((r) => {
-  ((a) => {
-    const s = class s {
+  ((s) => {
+    const a = class a {
       // The QR Code can tolerate about 30% erroneous codewords
       /*-- Constructor and fields --*/
-      constructor(d, c) {
-        this.ordinal = d, this.formatBits = c;
+      constructor(c, d) {
+        this.ordinal = c, this.formatBits = d;
       }
     };
-    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 l = s;
-    a.Ecc = l;
+    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;
   })(r.QrCode || (r.QrCode = {}));
-})(L || (L = {}));
+})(O || (O = {}));
 ((r) => {
-  ((a) => {
-    const s = class s {
+  ((s) => {
+    const a = class a {
       /*-- Constructor and fields --*/
-      constructor(d, c) {
-        this.modeBits = d, this.numBitsCharCount = c;
+      constructor(c, d) {
+        this.modeBits = c, 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(d) {
-        return this.numBitsCharCount[Math.floor((d + 7) / 17)];
+      numCharCountBits(c) {
+        return this.numBitsCharCount[Math.floor((c + 7) / 17)];
       }
     };
-    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 l = s;
-    a.Mode = l;
+    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;
   })(r.QrSegment || (r.QrSegment = {}));
-})(L || (L = {}));
-const b = L, W = {
-  L: b.QrCode.Ecc.LOW,
-  M: b.QrCode.Ecc.MEDIUM,
-  Q: b.QrCode.Ecc.QUARTILE,
-  H: b.QrCode.Ecc.HIGH
-}, J = 128, tt = "M", et = "#FFFFFF", ot = 1, nt = 4, x = 5, D = "#000000", rt = "square", st = "square", it = "square", at = 0.1, C = 7, P = 3, y = [
+})(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 = [
   [1, 1, 1, 1, 1, 1, 1],
   [1, 0, 0, 0, 0, 0, 1],
   [1, 0, 0, 0, 0, 0, 1],
@@ -559,7 +559,7 @@ const b = L, W = {
   [1, 0, 0, 0, 0, 0, 1],
   [1, 0, 0, 0, 0, 0, 1],
   [1, 1, 1, 1, 1, 1, 1]
-], X = {
+], J = {
   "inpoint-sm": [0, 90, -90],
   inpoint: [0, 90, -90],
   "inpoint-lg": [0, 90, -90],
@@ -569,7 +569,7 @@ const b = L, W = {
   "leaf-sm": [0, 90, -90],
   leaf: [0, 90, -90],
   "leaf-lg": [0, 90, -90]
-}, U = {
+}, H = {
   "rounded-sm": 3,
   rounded: 4,
   "rounded-lg": 5,
@@ -582,7 +582,7 @@ const b = L, W = {
   "outpoint-sm": 3,
   outpoint: 4,
   "outpoint-lg": 5
-}, B = {
+}, Y = {
   square: 0,
   diamond: 0,
   circle: 3,
@@ -598,7 +598,7 @@ const b = L, W = {
   "outpoint-sm": 1.5,
   outpoint: 2,
   "outpoint-lg": 2.3
-}, F = [
+}, z = [
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 1, 1, 1, 0, 0],
@@ -606,120 +606,28 @@ const b = L, W = {
   [0, 0, 1, 1, 1, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0]
-], lt = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond", v = (r, a, l) => {
-  const s = {
-    left: r === 0 ? 0 : l[a][r - 1],
-    right: r === l[a].length - 1 ? 0 : l[a][r + 1],
-    top: a === 0 ? 0 : l[a - 1][r],
-    bottom: a === l.length - 1 ? 0 : l[a + 1][r]
-  };
+], Et = /\.?0+$/;
+function Mt(r) {
+  return r.toFixed(7).replace(Et, "");
+}
+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)));
   return {
-    ...s,
-    count: Object.values(s).filter(Boolean).length
+    x1: `${l}%`,
+    y1: `${a}%`,
+    x2: `${t}%`,
+    y2: `${c}%`
   };
-}, O = (r, a, l) => `M${r},${a}h${l}v${l}h-${l}Z`, S = (r, a, l) => `M${r},${a + l / 2}a${l / 2},${l / 2} 0 1,0 ${l},0a${l / 2},${l / 2} 0 1,0 -${l},0Z`, ct = (r, a, l) => `M${r},${a + l / 2}l${l / 2},-${l / 2}l${l / 2},${l / 2}l-${l / 2},${l / 2}Z`, ht = (r, a) => `M ${r} ${a} 
-   v 1 
-   h 1 
-   v -0.5 
-   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, z = (r, a) => `M ${r + 1} ${a} 
-   v 1 
-   h -1 
-   v -0.5 
-   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, k = (r, a) => `M ${r} ${a} 
-   v 1 
-   h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0.5 -0.5
-   v -0.5
-   h -1`, ut = (r, a) => `M ${r + 1} ${a} 
-   v 1 
-   h -0.5 
-   a 0.5 0.5, 0, 0, 1, -0.5 -0.5 
-   v -0.5 
-   h 1`, Y = (r, a) => `M ${r} ${a} 
-   v 1 
-   h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0 -1`, H = (r, a) => `M ${r + 1} ${a} 
-   v 1 
-   h -0.5 
-   a 0.5 0.5, 0, 0, 1, 0 -1`, j = (r, a) => `M ${r} ${a + 1} 
-   h 1 
-   v -0.5 
-   a 0.5 0.5, 0, 0, 0, -1 0`, q = (r, a) => `M ${r} ${a} 
-   h 1 
-   v 0.5 
-   a 0.5 0.5, 0, 0, 1, -1 0`, dt = (r, a, l) => `M ${r + 1} ${a}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}`, ft = ({
-  x: r,
-  y: a,
-  numCells: l
-}) => {
-  var s, t, d;
-  return !!((s = F[r]) != null && s[a] || (t = F[r - l + 7]) != null && t[a] || (d = F[r]) != null && d[a - l + 7]);
-}, $t = ({
-  x: r,
-  y: a,
-  radius: l
-}) => {
-  const s = P - l, t = l / 2, d = P - t;
-  return `M ${r} ${a + t}v ${s}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${d}v ${-d}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-s}H ${r}z`;
-}, pt = ({
-  x: r,
-  y: a,
-  radius: l
-}) => {
-  const s = P - l, t = l / 2, d = P - t;
-  return `M ${r} ${a + t}v ${s}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${d}v ${-d}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-s}a ${t} ${t}, 0, 0, 0, ${-t} ${t}`;
-}, mt = ({
-  x: r,
-  y: a,
-  numCells: l
-}) => {
-  var s, t, d;
-  return !!((s = y[r]) != null && s[a] || (t = y[r - l + 7]) != null && t[a] || (d = y[r]) != null && d[a - l + 7]);
-}, Et = ({
-  x: r,
-  y: a,
-  radius: l
-}) => {
-  const s = C - l, t = l / 2;
-  return `M ${r} ${a + t}v ${s}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${s}a ${t} ${t}, 0, 0, 0, ${t} ${-t}v ${-s}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-s}a ${t} ${t}, 0, 0, 0, ${-t} ${t}M ${r + t} ${a + 1}h ${s}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${t - 1}v ${s}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${t - 1}h ${-s}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-s}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${-(t - 1)}`;
-}, gt = ({
-  x: r,
-  y: a,
-  radius: l
-}) => {
-  const s = C - l, t = l / 2, d = C - t;
-  return `M ${r} ${a + t}v ${s}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${d}v ${-d}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-s}H ${r}zM ${r + t} ${a + 1}h ${s}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${t - 1}v ${d - 1}h ${-(d - 1)}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-(d - 1)}z`;
-}, Mt = ({
-  x: r,
-  y: a,
-  radius: l
-}) => {
-  const s = C - l, t = l / 2, d = C - t;
-  return `M ${r} ${a + t}v ${s}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${d}v ${-d}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-s}a ${t} ${t}, 0, 0, 0, ${-t} ${t}M ${r + t} ${a + 1}h ${s}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${t - 1}v ${d - 1}h ${-(d - 1)}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-s}a ${t - 1} ${t - 1}, 0, 0, 1, ${t - 1} ${-(t - 1)}`;
-}, Rt = (r) => ({
-  color: (r == null ? void 0 : r.color) || D,
-  style: (r == null ? void 0 : r.style) || it,
-  randomSize: (r == null ? void 0 : r.randomSize) || !1
-}), wt = (r) => ({
-  color: (r == null ? void 0 : r.color) || D,
-  style: (r == null ? void 0 : r.style) || rt
-}), At = (r) => ({
-  color: (r == null ? void 0 : r.color) || D,
-  style: (r == null ? void 0 : r.style) || st
-}), Ct = /\.?0+$/;
-function Nt(r) {
-  return r.toFixed(7).replace(Ct, "");
-}
-const G = (r, a, l, s) => {
-  const t = l / 2, d = t / 2, c = Math.PI / s;
-  let $ = "";
-  for (let m = 0; m < 2 * s; m++) {
-    const e = m * c - Math.PI / 2, n = m % 2 === 0 ? t : d, o = r + n * Math.cos(e), i = a + n * Math.sin(e);
-    $ += `${m === 0 ? "M" : "L"} ${o},${i} `;
+}, et = (r, s, l, a) => {
+  const t = l / 2, c = t / 2, d = Math.PI / a;
+  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} `;
   }
-  return $ + "Z";
-}, Q = (r, a, l) => {
-  let s = !1, t = 0;
+  return u + "Z";
+}, ot = (r, s, l) => {
+  let a = !1, t = 0;
   return [
     "M",
     1,
@@ -831,380 +739,545 @@ const G = (r, a, l, s) => {
     1,
     0.3262506,
     "z"
-  ].map((d) => typeof d == "string" ? (t = 0, s = d.toUpperCase() == d, d) : (t++, d = d * l, s && (d += t % 2 == 1 ? r : a), Nt(d))).join(" ");
-}, It = ({
+  ].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 = {
+  "data-testid": "background"
+}, Rt = ({ background: r, numCells: s }) => {
+  var a, t;
+  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(
+      "radialGradient",
+      {
+        id: F,
+        gradientUnits: "userSpaceOnUse",
+        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))
+      }
+    ) }),
+    /* @__PURE__ */ C(
+      "path",
+      {
+        fill: `url(#${F})`,
+        d: `M0,0 h${s}v${s}H0z`,
+        ...G
+      }
+    )
+  ] });
+}, 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]
+  };
+  return {
+    ...a,
+    count: Object.values(a).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} 
+   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} 
+   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} 
+   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} 
+   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} 
+   v 1 
+   h 0.5 
+   a 0.5 0.5, 0, 0, 0, 0 -1`, Q = (r, s) => `M ${r + 1} ${s} 
+   v 1 
+   h -0.5 
+   a 0.5 0.5, 0, 0, 1, 0 -1`, Z = (r, s) => `M ${r} ${s + 1} 
+   h 1 
+   v -0.5 
+   a 0.5 0.5, 0, 0, 0, -1 0`, _ = (r, s) => `M ${r} ${s} 
+   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 = ({
+  x: r,
+  y: s,
+  numCells: l
+}) => {
+  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]);
+}, Tt = ({
+  x: r,
+  y: s,
+  radius: l
+}) => {
+  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`;
+}, Lt = ({
+  x: r,
+  y: s,
+  radius: l
+}) => {
+  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}`;
+}, Ot = ({
+  x: r,
+  y: s,
+  numCells: l
+}) => {
+  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 = ({
+  x: r,
+  y: s,
+  radius: l
+}) => {
+  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 = ({
+  x: r,
+  y: s,
+  radius: l
+}) => {
+  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 = ({
+  x: r,
+  y: s,
+  radius: l
+}) => {
+  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,
+  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,
+  style: (r == null ? void 0 : r.style) || ft
+}), Ft = ({
   modules: r,
-  margin: a,
-  settings: l
+  margin: s,
+  settings: l,
+  gradient: a
 }) => {
-  const { color: s, style: t, randomSize: d } = T(
-    () => Rt(l),
+  const { color: t, style: c, randomSize: d } = L(
+    () => Ut(l),
     [l]
-  ), c = [], $ = r.length, m = lt(t) && d, e = K(() => t === "square-sm" ? 0.75 : m ? Math.random() * (1 - 0.75) + 0.75 : 1, [t, m]);
-  return r.forEach((n, o) => {
-    n.forEach((i, h) => {
-      if (mt({ x: h, y: o, numCells: $ }) || ft({ x: h, y: o, numCells: $ }))
+  ), u = [], g = r.length, e = gt(c) && d, o = rt(
+    () => wt(c, e),
+    [c, e]
+  );
+  return r.forEach((n, i) => {
+    n.forEach((h, $) => {
+      if (Ot({ x: $, y: i, numCells: g }) || Pt({ x: $, y: i, numCells: g }))
         return;
-      const p = e(), u = 1 * p, M = (1 - 1 * p) / 2, f = h + a + M, E = o + a + M;
-      if (i) {
-        if (t === "square" || t === "square-sm")
-          c.push(O(f, E, u));
-        else if (t === "circle")
-          c.push(S(f, E, u));
-        else if (t === "diamond")
-          c.push(ct(f, E, u));
-        else if (t === "star")
-          c.push(
-            G(f + u / 2, E + u / 2, u * 1.1, x)
+      const f = o(), p = 1 * f, M = (1 - 1 * f) / 2, E = $ + s + M, m = i + s + M;
+      if (h) {
+        if (c === "square" || c === "square-sm")
+          u.push(v(E, m, p));
+        else if (c === "circle")
+          u.push(D(E, m, p));
+        else if (c === "diamond")
+          u.push(At(E, m, p));
+        else if (c === "star")
+          u.push(
+            et(E + p / 2, m + p / 2, p * 1.1, W)
           );
-        else if (t === "heart")
-          c.push(Q(f, E, u));
-        else if (t === "rounded") {
-          const { left: A, right: g, top: R, bottom: w, count: N } = v(h, o, r);
-          N === 0 ? c.push(S(f, E, 1)) : N > 2 || A && g || R && w ? c.push(O(f, E, 1)) : N === 2 ? A && R ? c.push(k(f, E)) : R && g ? c.push(ut(f, E)) : g && w ? c.push(z(f, E)) : c.push(ht(f, E)) : R ? c.push(q(f, E)) : g ? c.push(H(f, E)) : w ? c.push(j(f, E)) : c.push(Y(f, E));
-        } else if (t === "leaf") {
-          const { left: A, right: g, top: R, bottom: w, count: N } = v(h, o, r);
-          if (N === 0)
-            c.push(dt(f, E, u));
-          else if (!A && !R) {
-            c.push(z(f, E));
+        else if (c === "heart")
+          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);
+          if (P === 0)
+            u.push(It(E, m, p));
+          else if (!R && !A) {
+            u.push(q(E, m));
             return;
-          } else !g && !w ? c.push(k(f, E)) : c.push(O(f, E, 1));
-        } else if (t === "vertical-line") {
-          const { left: A, right: g, top: R, bottom: w, count: N } = v(h, o, r);
-          N === 0 || A && !(R || w) || g && !(R || w) ? c.push(S(f, E, 1)) : R && w ? c.push(O(f, E, 1)) : R && !w ? c.push(q(f, E)) : w && !R && c.push(j(f, E));
-        } else if (t === "horizontal-line") {
-          const { left: A, right: g, top: R, bottom: w, count: N } = v(h, o, r);
-          N === 0 || R && !(A || g) || w && !(A || g) ? c.push(S(f, E, 1)) : A && g ? c.push(O(f, E, 1)) : A && !g ? c.push(Y(f, E)) : g && !A && c.push(H(f, E));
+          } 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));
         }
       }
     });
-  }), /* @__PURE__ */ I(
+  }), /* @__PURE__ */ C(
     "path",
     {
-      fill: s,
-      d: c.join(""),
-      shapeRendering: t === "square" ? "crispEdges" : "geometricPrecision"
+      fill: a ? `url(#${U})` : t,
+      d: u.join(""),
+      shapeRendering: c === "square" ? "crispEdges" : "geometricPrecision",
+      "data-testid": "data-modules"
     }
   );
-}, Pt = ({
+}, S = {
+  "data-testid": "finder-patterns-inner"
+}, Bt = ({
   modules: r,
-  margin: a,
-  settings: l
+  margin: s,
+  settings: l,
+  gradient: a
 }) => {
-  const { color: s, style: t } = T(
-    () => At(l),
+  const { color: t, style: c } = L(
+    () => Dt(l),
     [l]
-  ), d = T(
+  ), d = a ? `url(#${U})` : t, u = L(
     () => [
-      { x: a + 2, y: a + 2 },
-      { x: r.length + a - C + 2, y: a + 2 },
-      { x: a + 2, y: r.length + a - C + 2 }
+      { x: s + 2, y: s + 2 },
+      { x: r.length + s - I + 2, y: s + 2 },
+      { x: s + 2, y: r.length + s - I + 2 }
     ],
-    [a, r.length]
-  ), c = ($, m) => `finder-patterns-inner-${t}-${$}-${m}`;
-  if (t === "rounded-sm" || t === "rounded" || t === "rounded-lg" || t === "circle" || t === "square")
-    return d.map(($) => {
-      const { x: m, y: e } = $;
-      return /* @__PURE__ */ I(
+    [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;
+      return /* @__PURE__ */ C(
         "rect",
         {
-          x: m,
-          y: e,
-          width: P,
-          height: P,
-          fill: s,
-          rx: B[t]
+          x: o,
+          y: n,
+          width: T,
+          height: T,
+          fill: d,
+          rx: Y[c],
+          ...S
         },
-        c(m, e)
+        g(o, n)
       );
     });
-  if (t === "diamond")
-    return d.map(($) => {
-      const { x: m, y: e } = $, n = Math.sqrt(1.5), o = P / n, i = o - o / n;
-      return /* @__PURE__ */ I(
+  if (c === "diamond")
+    return u.map((e) => {
+      const { x: o, y: n } = e, i = Math.sqrt(1.5), h = T / i, $ = h - h / i;
+      return /* @__PURE__ */ C(
         "rect",
         {
-          x: m + i / 2,
-          y: e + i / 2,
-          width: o,
-          height: o,
-          fill: s,
+          x: o + $ / 2,
+          y: n + $ / 2,
+          width: h,
+          height: h,
+          fill: d,
           style: {
             transform: "rotate(45deg)",
             transformOrigin: "center",
             transformBox: "fill-box"
-          }
+          },
+          ...S
         },
-        c(m, e)
+        g(o, n)
       );
     });
-  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 $ = t === "leaf-sm" || t === "leaf" || t === "leaf-lg" ? $t : pt;
-    return d.map((m, e) => ({
-      ...m,
-      rotation: X[t][e]
-    })).map(({ x: m, y: e, rotation: n }) => {
-      const o = $({
-        x: m,
-        y: e,
-        radius: B[t]
+  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;
+    return u.map((o, n) => ({
+      ...o,
+      rotation: J[c][n]
+    })).map(({ x: o, y: n, rotation: i }) => {
+      const h = e({
+        x: o,
+        y: n,
+        radius: Y[c]
       });
-      return /* @__PURE__ */ I(
+      return /* @__PURE__ */ C(
         "path",
         {
-          fill: s,
-          d: o,
+          fill: d,
+          d: h,
           style: {
-            transform: `rotate(${n}deg)`,
+            transform: `rotate(${i}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
-          }
+          },
+          ...S
         },
-        c(m, e)
+        g(o, n)
       );
     });
   }
-  return t === "heart" ? d.map(({ x: $, y: m }) => /* @__PURE__ */ I("path", { fill: s, d: Q($, m, P) }, c($, m))) : t === "star" ? d.map(({ x: $, y: m }) => {
-    const e = $ + P / 2, n = m + P / 2, o = G(e, n, P * 1.2, x);
-    return /* @__PURE__ */ I("path", { fill: s, d: o }, c($, m));
-  }) : null;
-}, Tt = ({
+  if (c === "heart")
+    return u.map(({ x: e, y: o }) => /* @__PURE__ */ C(
+      "path",
+      {
+        fill: d,
+        d: ot(e, o, T),
+        ...S
+      },
+      g(e, 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));
+    });
+}, K = {
+  "data-testid": "finder-patterns-outer"
+}, zt = ({
   modules: r,
-  margin: a,
-  settings: l
+  margin: s,
+  settings: l,
+  gradient: a
 }) => {
-  const { style: s, color: t } = T(
-    () => wt(l),
+  const { style: t, color: c } = L(
+    () => bt(l),
     [l]
-  ), d = [], c = T(
+  ), d = a ? `url(#${U})` : c, u = [], g = L(
     () => [
-      { x: a, y: a },
-      { x: r.length + a - C, y: a },
-      { x: a, y: r.length + a - C }
+      { x: s, y: s },
+      { x: r.length + s - I, y: s },
+      { x: s, y: r.length + s - I }
     ],
-    [a, r.length]
+    [s, r.length]
   );
-  if (console.log("modules.length", r.length), console.log("coordinates", c), ["rounded-sm", "rounded", "rounded-lg", "circle", "square"].includes(s)) {
-    for (const $ of c) {
-      const { x: m, y: e } = $;
-      s === "rounded-sm" || s === "rounded" || s === "rounded-lg" ? d.push(
-        Et({
-          x: m,
-          y: e,
-          radius: U[s]
+  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({
+          x: o,
+          y: n,
+          radius: H[t]
         })
-      ) : s === "circle" ? d.push(
-        `M ${m + C / 2} ${e}a ${C / 2} ${C / 2} 0 1 0 0.01 0zzm 0 1a ${C / 2 - 1} ${C / 2 - 1} 0 1 1 -0.01 0Z`
-      ) : d.push(
-        `M ${m} ${e}v ${C}h ${C}v -7zM ${m + 1} ${e + 1}h ${C - 2 * 1}v ${C - 2 * 1}h ${-7 + 2 * 1}z`
+      ) : t === "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__ */ I("path", { fill: t, d: d.join("") });
+    return /* @__PURE__ */ C("path", { fill: d, d: u.join(""), ...K });
   }
-  if (s === "inpoint-sm" || s === "inpoint" || s === "inpoint-lg" || s === "outpoint-sm" || s === "outpoint" || s === "outpoint-lg" || s === "leaf-sm" || s === "leaf" || s === "leaf-lg") {
-    const $ = s === "leaf-sm" || s === "leaf" || s === "leaf-lg" ? gt : Mt;
-    return c.map((m, e) => ({
-      ...m,
-      rotation: X[s][e]
-    })).map(({ x: m, y: e, rotation: n }) => {
-      const o = $({
-        x: m,
-        y: e,
-        radius: U[s]
+  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;
+    return g.map((o, n) => ({
+      ...o,
+      rotation: J[t][n]
+    })).map(({ x: o, y: n, rotation: i }) => {
+      const h = e({
+        x: o,
+        y: n,
+        radius: H[t]
       });
-      return /* @__PURE__ */ I(
+      return /* @__PURE__ */ C(
         "path",
         {
-          fill: t,
-          d: o,
+          fill: d,
+          d: h,
           style: {
-            transform: `rotate(${n}deg)`,
+            transform: `rotate(${i}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
-          }
+          },
+          ...K
         },
-        `finder-patterns-outer-${s}-${m}-${e}`
+        `finder-patterns-outer-${t}-${o}-${n}`
       );
     });
   }
-  return null;
-}, Lt = (r, a) => r.slice().map((l, s) => s < a.y || s >= a.y + a.h ? l : l.map((t, d) => d < a.x || d >= a.x + a.w ? t : !1)), bt = (r, a, l, s) => {
-  if (s == null)
+}, xt = ({ gradient: r }) => {
+  var l, a;
+  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(
+    "radialGradient",
+    {
+      id: U,
+      gradientUnits: "userSpaceOnUse",
+      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))
+    }
+  ) });
+}, 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)
     return null;
-  const t = r.length + l * 2, d = Math.floor(a * at), c = t / a, $ = (s.width || d) * c, m = (s.height || d) * c, e = s.x == null ? r.length / 2 - $ / 2 : s.x * c, n = s.y == null ? r.length / 2 - m / 2 : s.y * c, o = s.opacity == null ? 1 : s.opacity;
+  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 (s.excavate) {
-    const p = Math.floor(e), u = Math.floor(n), M = Math.ceil($ + e - p), f = Math.ceil(m + n - u);
-    i = { x: p, y: u, w: M, h: f };
+  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 h = s.crossOrigin;
-  return { x: e, y: n, h: m, w: $, excavation: i, opacity: o, crossOrigin: h };
-}, Ot = (r) => r != null ? Math.max(Math.floor(r), 0) : nt, vt = ({
+  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 = ({
   value: r,
-  level: a,
+  level: s,
   minVersion: l,
-  marginSize: s,
+  marginSize: a,
   imageSettings: t,
-  size: d,
-  boostLevel: c
+  size: c,
+  boostLevel: d
 }) => {
-  const $ = T(() => {
-    const h = (Array.isArray(r) ? r : [r]).reduce((p, u) => (p.push(...b.QrSegment.makeSegments(u)), p), []);
-    return b.QrCode.encodeSegments(
+  const u = L(() => {
+    const h = (Array.isArray(r) ? r : [r]).reduce(($, f) => ($.push(...y.QrSegment.makeSegments(f)), $), []);
+    return y.QrCode.encodeSegments(
       h,
-      W[a],
+      at[s],
       l,
       void 0,
       void 0,
-      c
+      d
     );
-  }, [r, a, l, c]), { cells: m, margin: e, numCells: n, calculatedImageSettings: o } = T(() => {
-    const i = $.getModules(), h = Ot(s), p = i.length + h * 2, u = bt(i, d, h, t);
+  }, [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);
     return {
       cells: i,
       margin: h,
-      numCells: p,
-      calculatedImageSettings: u
+      numCells: $,
+      calculatedImageSettings: f
     };
-  }, [$, d, t, s]);
+  }, [u, c, t, a]);
   return {
-    qrcode: $,
+    qrcode: u,
     margin: e,
-    cells: m,
-    numCells: n,
-    calculatedImageSettings: o
+    cells: g,
+    numCells: o,
+    calculatedImageSettings: n
   };
-}, St = ({ svgRef: r, fileSize: a, fileName: l }) => {
+}, qt = ({ svgRef: r, fileSize: s, fileName: l }) => {
   if (!r.current) return;
-  const s = r.current.cloneNode(!0);
-  s.setAttribute("width", a.toString()), s.setAttribute("height", a.toString());
-  const t = new XMLSerializer(), d = new Blob([t.serializeToString(s)], {
+  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)], {
     type: "image/svg+xml"
-  }), c = URL.createObjectURL(d), $ = document.createElement("a");
-  $.href = c, $.download = `${l}.svg`, document.body.appendChild($), $.click(), document.body.removeChild($), URL.revokeObjectURL(c);
-}, yt = ({
+  }), 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 = ({
   svgRef: r,
-  fileSize: a,
+  fileSize: s,
   fileName: l,
-  fileFormat: s,
+  fileFormat: a,
   imageSettings: t,
-  calculatedImageSettings: d,
-  size: c,
-  numCells: $,
-  margin: m
+  calculatedImageSettings: c,
+  size: d,
+  numCells: u,
+  margin: g
 }) => {
   if (!r.current) return;
-  const e = document.createElement("canvas"), n = e.getContext("2d");
-  if (!n) return;
-  e.width = a, e.height = a;
-  const o = new XMLSerializer().serializeToString(r.current), i = new Blob([o], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(i), p = new Image();
-  p.crossOrigin = "anonymous", p.src = h, p.onload = () => {
-    if (n.drawImage(p, 0, 0, a, a), URL.revokeObjectURL(h), t != null && t.src && d) {
-      const u = new Image();
-      u.crossOrigin = "anonymous", u.src = t.src, u.onload = () => {
-        const M = a / c, f = $ / a, E = t.width * M, A = t.x ? (d.x + m) / f : (a - E) / 2, g = t.y ? (d.y + m) / f : (a - E) / 2;
-        n.drawImage(u, A, g, E, E);
-        const R = s === "png" ? "image/png" : "image/jpeg", w = document.createElement("a");
-        w.href = e.toDataURL(R), w.download = `${l}.${s}`, document.body.appendChild(w), w.click(), document.body.removeChild(w);
-      }, u.onerror = (M) => console.error("Error loading logo:", M);
+  const e = document.createElement("canvas"), o = e.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();
+  $.crossOrigin = "anonymous", $.src = h, $.onload = () => {
+    if (o.drawImage($, 0, 0, s, s), URL.revokeObjectURL(h), t != null && t.src && c) {
+      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;
+        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);
+      }, f.onerror = (p) => console.error("Error loading logo:", p);
     } else {
-      const u = s === "png" ? "image/png" : "image/jpeg", M = document.createElement("a");
-      M.href = e.toDataURL(u), M.download = `${l}.${s}`, document.body.appendChild(M), M.click(), document.body.removeChild(M);
+      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);
     }
-  }, p.onerror = (u) => console.error("Error loading QR code:", u);
-}, Ft = (r) => {
+  }, $.onerror = (f) => console.error("Error loading QR code:", f);
+}, Xt = (r) => {
   const {
-    ref: a,
+    ref: s,
     value: l,
-    size: s = J,
-    level: t = tt,
-    bgColor: d = et,
-    minVersion: c = ot,
-    boostLevel: $,
-    marginSize: m,
-    finderPatternOuterSettings: e,
+    size: a = lt,
+    level: t = ct,
+    background: c,
+    gradient: d,
+    minVersion: u = ht,
+    boostLevel: g,
+    marginSize: e,
+    finderPatternOuterSettings: o,
     finderPatternInnerSettings: n,
-    dataModulesSettings: o,
-    imageSettings: i,
-    svgProps: h
-  } = r, p = V(null), { margin: u, cells: M, numCells: f, calculatedImageSettings: E } = vt({
+    dataModulesSettings: i,
+    imageSettings: h,
+    svgProps: $
+  } = r, f = st(null), { margin: p, cells: M, numCells: E, calculatedImageSettings: m } = Gt({
     value: l,
     level: t,
-    minVersion: c,
-    boostLevel: $,
-    marginSize: m,
-    imageSettings: i,
-    size: s
+    minVersion: u,
+    boostLevel: g,
+    marginSize: e,
+    imageSettings: h,
+    size: a
   });
-  _(a, () => ({
-    svg: p.current,
+  it(s, () => ({
+    svg: f.current,
     download: ({
-      name: R = "qr-code",
-      format: w = "svg",
-      size: N = 500
+      name: N = pt,
+      format: P = "svg",
+      size: k = 500
     }) => {
-      p.current && (w === "svg" ? St({ svgRef: p, fileSize: N, fileName: R }) : yt({
-        svgRef: p,
-        fileSize: N,
-        fileName: R,
-        fileFormat: w,
-        imageSettings: i,
-        calculatedImageSettings: E,
-        size: s,
-        numCells: f,
-        margin: u
+      f.current && (P === "svg" ? qt({ svgRef: f, fileSize: k, fileName: N }) : jt({
+        svgRef: f,
+        fileSize: k,
+        fileName: N,
+        fileFormat: P,
+        imageSettings: h,
+        calculatedImageSettings: m,
+        size: a,
+        numCells: E,
+        margin: p
       }));
     }
   }));
-  let A = M, g = null;
-  return i != null && E != null && (E.excavation != null && (A = Lt(M, E.excavation)), g = /* @__PURE__ */ I(
+  let R = M, w = null;
+  h != null && m != null && (m.excavation != null && (R = kt(M, m.excavation)), w = /* @__PURE__ */ C(
     "image",
     {
-      href: i.src,
-      height: E.h,
-      width: E.w,
-      x: E.x + u,
-      y: E.y + u,
+      href: h.src,
+      height: m.h,
+      width: m.w,
+      x: m.x + p,
+      y: m.y + p,
       preserveAspectRatio: "none",
-      opacity: E.opacity,
-      crossOrigin: E.crossOrigin
+      opacity: m.opacity,
+      crossOrigin: m.crossOrigin
     }
-  )), /* @__PURE__ */ Z(
+  ));
+  const A = {
+    modules: R,
+    margin: p,
+    gradient: d
+  };
+  return /* @__PURE__ */ V(
     "svg",
     {
-      height: s,
-      width: s,
-      viewBox: `0 0 ${f} ${f}`,
-      ref: p,
+      height: a,
+      width: a,
+      viewBox: `0 0 ${E} ${E}`,
+      ref: f,
       role: "img",
-      "aria-label": (h == null ? void 0 : h["aria-label"]) || "QR Code",
-      ...h,
+      "aria-label": ($ == null ? void 0 : $["aria-label"]) || "QR Code",
+      ...$,
       children: [
-        /* @__PURE__ */ I("path", { fill: d, d: `M0,0 h${f}v${f}H0z` }),
-        /* @__PURE__ */ I(
-          Tt,
-          {
-            modules: A,
-            margin: u,
-            settings: e
-          }
-        ),
-        /* @__PURE__ */ I(
-          Pt,
-          {
-            modules: A,
-            margin: u,
-            settings: n
-          }
-        ),
-        /* @__PURE__ */ I(It, { modules: A, margin: u, settings: o }),
-        g
+        /* @__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 }),
+        w
       ]
     }
   );
 };
-Ft.displayName = "ReactQRCode";
+Xt.displayName = "ReactQRCode";
 export {
-  Ft as ReactQRCode
+  Xt as ReactQRCode
 };