@lglab/react-qr-code 1.0.1 → 1.2.0

package/dist/index.es.js

@@ -1,40 +1,40 @@
-import { jsx as w, jsxs as j } from "react/jsx-runtime";
-import { useMemo as S, useCallback as x } from "react";
+import { jsx as N, jsxs as Q, Fragment as tt } from "react/jsx-runtime";
+import { useMemo as L, useCallback as et, useRef as ot, useImperativeHandle as nt } from "react";
 /**
  * @license QR Code generator library (TypeScript)
  * Copyright (c) Project Nayuki.
  * SPDX-License-Identifier: MIT
  */
-var T;
+var O;
 ((r) => {
-  const l = class l {
+  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(t, o, n, i) {
-      if (this.version = t, this.errorCorrectionLevel = o, this.modules = [], this.isFunction = [], t < l.MIN_VERSION || t > l.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 = t * 4 + 17;
+      this.size = e * 4 + 17;
       let h = [];
-      for (let d = 0; d < this.size; d++)
+      for (let f = 0; f < this.size; f++)
         h.push(!1);
-      for (let d = 0; d < this.size; d++)
+      for (let f = 0; f < this.size; f++)
         this.modules.push(h.slice()), this.isFunction.push(h.slice());
       this.drawFunctionPatterns();
-      const p = this.addEccAndInterleave(n);
-      if (this.drawCodewords(p), i == -1) {
-        let d = 1e9;
-        for (let R = 0; R < 8; R++) {
-          this.applyMask(R), this.drawFormatBits(R);
-          const u = this.getPenaltyScore();
-          u < d && (i = R, d = u), this.applyMask(R);
+      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);
         }
       }
-      e(0 <= i && i <= 7), this.mask = i, this.applyMask(i), this.drawFormatBits(i), this.isFunction = [];
+      t(0 <= i && i <= 7), this.mask = i, this.applyMask(i), this.drawFormatBits(i), this.isFunction = [];
     }
     /*-- Static factory functions (high level) --*/
     // Returns a QR Code representing the given Unicode text string at the given error correction level.
@@ -42,17 +42,17 @@ var T;
     // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible
     // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the
     // ecl argument if it can be done without increasing the version.
-    static encodeText(t, o) {
-      const n = r.QrSegment.makeSegments(t);
-      return l.encodeSegments(n, o);
+    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(t, o) {
-      const n = r.QrSegment.makeBytes(t);
-      return l.encodeSegments([n], o);
+    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 T;
     // This function allows the user to create a custom sequence of segments that switches
     // between modes (such as alphanumeric and byte) to encode text in less space.
     // This is a mid-level API; the high-level API is encodeText() and encodeBinary().
-    static encodeSegments(t, o, n = 1, i = 40, h = -1, p = !0) {
-      if (!(l.MIN_VERSION <= n && n <= i && i <= l.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 d, R;
-      for (d = n; ; d++) {
-        const m = l.getNumDataCodewords(d, o) * 8, g = f.getTotalBits(t, d);
-        if (g <= m) {
-          R = g;
+      let f, p;
+      for (f = n; ; f++) {
+        const R = d.getNumDataCodewords(f, o) * 8, A = l.getTotalBits(e, f);
+        if (A <= R) {
+          p = A;
           break;
         }
-        if (d >= i)
+        if (f >= i)
           throw new RangeError("Data too long");
       }
-      for (const m of [l.Ecc.MEDIUM, l.Ecc.QUARTILE, l.Ecc.HIGH])
-        p && R <= l.getNumDataCodewords(d, m) * 8 && (o = m);
-      let u = [];
-      for (const m of t) {
-        a(m.mode.modeBits, 4, u), a(m.numChars, m.mode.numCharCountBits(d), u);
-        for (const g of m.getData())
-          u.push(g);
+      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) {
+        c(R.mode.modeBits, 4, M), c(R.numChars, R.mode.numCharCountBits(f), M);
+        for (const A of R.getData())
+          M.push(A);
       }
-      e(u.length == R);
-      const M = l.getNumDataCodewords(d, o) * 8;
-      e(u.length <= M), a(0, Math.min(4, M - u.length), u), a(0, (8 - u.length % 8) % 8, u), e(u.length % 8 == 0);
-      for (let m = 236; u.length < M; m ^= 253)
-        a(m, 8, u);
-      let A = [];
-      for (; A.length * 8 < u.length; )
-        A.push(0);
-      return u.forEach((m, g) => A[g >>> 3] |= m << 7 - (g & 7)), new l(d, o, A, h);
+      t(M.length == p);
+      const E = d.getNumDataCodewords(f, o) * 8;
+      t(M.length <= E), c(0, Math.min(4, E - M.length), M), c(0, (8 - M.length % 8) % 8, M), t(M.length % 8 == 0);
+      for (let R = 236; M.length < E; R ^= 253)
+        c(R, 8, M);
+      let m = [];
+      for (; m.length * 8 < M.length; )
+        m.push(0);
+      return M.forEach((R, A) => m[A >>> 3] |= R << 7 - (A & 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(t, o) {
-      return 0 <= t && t < this.size && 0 <= o && o < this.size && this.modules[o][t];
+    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() {
@@ -112,30 +112,30 @@ var T;
       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 t = this.getAlignmentPatternPositions(), o = t.length;
+      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(t[n], t[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(t) {
-      const o = this.errorCorrectionLevel.formatBits << 3 | t;
+    drawFormatBits(e) {
+      const o = this.errorCorrectionLevel.formatBits << 3 | e;
       let n = o;
       for (let h = 0; h < 10; h++)
         n = n << 1 ^ (n >>> 9) * 1335;
       const i = (o << 10 | n) ^ 21522;
-      e(i >>> 15 == 0);
+      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),
@@ -143,88 +143,88 @@ var T;
     drawVersion() {
       if (this.version < 7)
         return;
-      let t = this.version;
+      let e = this.version;
       for (let n = 0; n < 12; n++)
-        t = t << 1 ^ (t >>> 11) * 7973;
-      const o = this.version << 12 | t;
-      e(o >>> 18 == 0);
+        e = e << 1 ^ (e >>> 11) * 7973;
+      const o = this.version << 12 | e;
+      t(o >>> 18 == 0);
       for (let n = 0; n < 18; n++) {
-        const i = s(o, n), h = this.size - 11 + n % 3, p = Math.floor(n / 3);
-        this.setFunctionModule(h, p, i), this.setFunctionModule(p, h, i);
+        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(t, 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(n)), p = t + i, d = o + n;
-          0 <= p && p < this.size && 0 <= d && d < this.size && this.setFunctionModule(p, d, 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(t, o) {
+    drawAlignmentPattern(e, o) {
       for (let n = -2; n <= 2; n++)
         for (let i = -2; i <= 2; i++)
-          this.setFunctionModule(t + i, o + n, Math.max(Math.abs(i), Math.abs(n)) != 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(t, o, n) {
-      this.modules[o][t] = n, this.isFunction[o][t] = !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(t) {
+    addEccAndInterleave(e) {
       const o = this.version, n = this.errorCorrectionLevel;
-      if (t.length != l.getNumDataCodewords(o, n))
+      if (e.length != d.getNumDataCodewords(o, n))
         throw new RangeError("Invalid argument");
-      const i = l.NUM_ERROR_CORRECTION_BLOCKS[n.ordinal][o], h = l.ECC_CODEWORDS_PER_BLOCK[n.ordinal][o], p = Math.floor(l.getNumRawDataModules(o) / 8), d = i - p % i, R = Math.floor(p / i);
-      let u = [];
-      const M = l.reedSolomonComputeDivisor(h);
-      for (let m = 0, g = 0; m < i; m++) {
-        let N = t.slice(g, g + R - h + (m < d ? 0 : 1));
-        g += N.length;
-        const I = l.reedSolomonComputeRemainder(N, M);
-        m < d && N.push(0), u.push(N.concat(I));
+      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, A = 0; R < i; R++) {
+        let w = e.slice(A, A + p - h + (R < f ? 0 : 1));
+        A += w.length;
+        const C = d.reedSolomonComputeRemainder(w, E);
+        R < f && w.push(0), M.push(w.concat(C));
       }
-      let A = [];
-      for (let m = 0; m < u[0].length; m++)
-        u.forEach((g, N) => {
-          (m != R - h || N >= d) && A.push(g[m]);
+      let m = [];
+      for (let R = 0; R < M[0].length; R++)
+        M.forEach((A, w) => {
+          (R != p - h || w >= f) && m.push(A[R]);
         });
-      return e(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(t) {
-      if (t.length != Math.floor(l.getNumRawDataModules(this.version) / 8))
+    drawCodewords(e) {
+      if (e.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 h = 0; h < 2; h++) {
-            const p = n - h, R = (n + 1 & 2) == 0 ? this.size - 1 - i : i;
-            !this.isFunction[R][p] && o < t.length * 8 && (this.modules[R][p] = s(t[o >>> 3], 7 - (o & 7)), o++);
+            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++);
           }
       }
-      e(o == t.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
     // before masking. Due to the arithmetic of XOR, calling applyMask() with
     // the same mask value a second time will undo the mask. A final well-formed
     // QR Code needs exactly one (not zero, two, etc.) mask applied.
-    applyMask(t) {
-      if (t < 0 || t > 7)
+    applyMask(e) {
+      if (e < 0 || e > 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 (t) {
+          switch (e) {
             case 0:
               i = (n + o) % 2 == 0;
               break;
@@ -258,29 +258,29 @@ var T;
     // Calculates and returns the penalty score based on state of this QR Code's current modules.
     // This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.
     getPenaltyScore() {
-      let t = 0;
+      let e = 0;
       for (let h = 0; h < this.size; h++) {
-        let p = !1, d = 0, R = [0, 0, 0, 0, 0, 0, 0];
-        for (let u = 0; u < this.size; u++)
-          this.modules[h][u] == p ? (d++, d == 5 ? t += l.PENALTY_N1 : d > 5 && t++) : (this.finderPenaltyAddHistory(d, R), p || (t += this.finderPenaltyCountPatterns(R) * l.PENALTY_N3), p = this.modules[h][u], d = 1);
-        t += this.finderPenaltyTerminateAndCount(p, d, R) * l.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, d = 0, R = [0, 0, 0, 0, 0, 0, 0];
-        for (let u = 0; u < this.size; u++)
-          this.modules[u][h] == p ? (d++, d == 5 ? t += l.PENALTY_N1 : d > 5 && t++) : (this.finderPenaltyAddHistory(d, R), p || (t += this.finderPenaltyCountPatterns(R) * l.PENALTY_N3), p = this.modules[u][h], d = 1);
-        t += this.finderPenaltyTerminateAndCount(p, d, R) * l.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 d = this.modules[h][p];
-          d == this.modules[h][p + 1] && d == this.modules[h + 1][p] && d == this.modules[h + 1][p + 1] && (t += l.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 o = 0;
       for (const h of this.modules)
-        o = h.reduce((p, d) => p + (d ? 1 : 0), o);
+        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 e(0 <= i && i <= 9), t += i * l.PENALTY_N4, e(0 <= t && t <= 2568888), t;
+      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,9 +290,9 @@ var T;
       if (this.version == 1)
         return [];
       {
-        const t = Math.floor(this.version / 7) + 2, o = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (t * 2 - 2)) * 2;
+        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 < t; i -= o)
+        for (let i = this.size - 7; n.length < e; i -= o)
           n.splice(1, 0, i);
         return n;
       }
@@ -300,76 +300,76 @@ var T;
     // Returns the number of data bits that can be stored in a QR Code of the given version number, after
     // all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.
     // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
-    static getNumRawDataModules(t) {
-      if (t < l.MIN_VERSION || t > l.MAX_VERSION)
+    static getNumRawDataModules(e) {
+      if (e < d.MIN_VERSION || e > d.MAX_VERSION)
         throw new RangeError("Version number out of range");
-      let o = (16 * t + 128) * t + 64;
-      if (t >= 2) {
-        const n = Math.floor(t / 7) + 2;
-        o -= (25 * n - 10) * n - 55, t >= 7 && (o -= 36);
+      let 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);
       }
-      return e(208 <= o && o <= 29648), o;
+      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(t, o) {
-      return Math.floor(l.getNumRawDataModules(t) / 8) - l.ECC_CODEWORDS_PER_BLOCK[o.ordinal][t] * l.NUM_ERROR_CORRECTION_BLOCKS[o.ordinal][t];
+    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(t) {
-      if (t < 1 || t > 255)
+    static reedSolomonComputeDivisor(e) {
+      if (e < 1 || e > 255)
         throw new RangeError("Degree out of range");
       let o = [];
-      for (let i = 0; i < t - 1; i++)
+      for (let i = 0; i < e - 1; i++)
         o.push(0);
       o.push(1);
       let n = 1;
-      for (let i = 0; i < t; i++) {
+      for (let i = 0; i < e; i++) {
         for (let h = 0; h < o.length; h++)
-          o[h] = l.reedSolomonMultiply(o[h], n), h + 1 < o.length && (o[h] ^= o[h + 1]);
-        n = l.reedSolomonMultiply(n, 2);
+          o[h] = d.reedSolomonMultiply(o[h], n), h + 1 < o.length && (o[h] ^= o[h + 1]);
+        n = d.reedSolomonMultiply(n, 2);
       }
       return o;
     }
     // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static reedSolomonComputeRemainder(t, o) {
+    static reedSolomonComputeRemainder(e, o) {
       let n = o.map((i) => 0);
-      for (const i of t) {
+      for (const i of e) {
         const h = i ^ n.shift();
-        n.push(0), o.forEach((p, d) => n[d] ^= l.reedSolomonMultiply(p, h));
+        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(t, o) {
-      if (t >>> 8 || o >>> 8)
+    static reedSolomonMultiply(e, o) {
+      if (e >>> 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) * t;
-      return e(n >>> 8 == 0), n;
+        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(t) {
-      const o = t[1];
-      e(o <= this.size * 3);
-      const n = o > 0 && t[2] == o && t[3] == o * 3 && t[4] == o && t[5] == o;
-      return (n && t[0] >= o * 4 && t[6] >= o ? 1 : 0) + (n && t[6] >= o * 4 && t[0] >= o ? 1 : 0);
+    finderPenaltyCountPatterns(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);
     }
     // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
-    finderPenaltyTerminateAndCount(t, o, n) {
-      return t && (this.finderPenaltyAddHistory(o, n), o = 0), o += this.size, this.finderPenaltyAddHistory(o, n), this.finderPenaltyCountPatterns(n);
+    finderPenaltyTerminateAndCount(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(t, o) {
-      o[0] == 0 && (t += this.size), o.pop(), o.unshift(t);
+    finderPenaltyAddHistory(e, o) {
+      o[0] == 0 && (e += this.size), o.pop(), o.unshift(e);
     }
   };
-  l.MIN_VERSION = 1, l.MAX_VERSION = 40, l.PENALTY_N1 = 3, l.PENALTY_N2 = 3, l.PENALTY_N3 = 40, l.PENALTY_N4 = 10, l.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 T;
     // 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
-  ], l.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,28 +392,28 @@ var T;
     [-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 c = l;
-  r.QrCode = c;
-  function a(E, t, o) {
-    if (t < 0 || t > 31 || E >>> t)
+  let s = d;
+  r.QrCode = s;
+  function c(g, e, o) {
+    if (e < 0 || e > 31 || g >>> e)
       throw new RangeError("Value out of range");
-    for (let n = t - 1; n >= 0; n--)
-      o.push(E >>> n & 1);
+    for (let n = e - 1; n >= 0; n--)
+      o.push(g >>> n & 1);
   }
-  function s(E, t) {
-    return (E >>> t & 1) != 0;
+  function a(g, e) {
+    return (g >>> e & 1) != 0;
   }
-  function e(E) {
-    if (!E)
+  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(t, o, n) {
-      if (this.mode = t, this.numChars = o, this.bitData = n, o < 0)
+    constructor(e, o, n) {
+      if (this.mode = e, this.numChars = o, this.bitData = n, o < 0)
         throw new RangeError("Invalid argument");
       this.bitData = n.slice();
     }
@@ -421,67 +421,67 @@ var T;
     // Returns a segment representing the given binary data encoded in
     // byte mode. All input byte arrays are acceptable. Any text string
     // can be converted to UTF-8 bytes and encoded as a byte mode segment.
-    static makeBytes(t) {
+    static makeBytes(e) {
       let o = [];
-      for (const n of t)
-        a(n, 8, o);
-      return new $($.Mode.BYTE, t.length, o);
+      for (const n of e)
+        c(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(t) {
-      if (!$.isNumeric(t))
+    static makeNumeric(e) {
+      if (!u.isNumeric(e))
         throw new RangeError("String contains non-numeric characters");
       let o = [];
-      for (let n = 0; n < t.length; ) {
-        const i = Math.min(t.length - n, 3);
-        a(parseInt(t.substring(n, n + i), 10), i * 3 + 1, o), n += i;
+      for (let n = 0; n < e.length; ) {
+        const i = Math.min(e.length - n, 3);
+        c(parseInt(e.substring(n, n + i), 10), i * 3 + 1, o), n += i;
       }
-      return new $($.Mode.NUMERIC, t.length, o);
+      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(t) {
-      if (!$.isAlphanumeric(t))
+    static makeAlphanumeric(e) {
+      if (!u.isAlphanumeric(e))
         throw new RangeError("String contains unencodable characters in alphanumeric mode");
       let o = [], n;
-      for (n = 0; n + 2 <= t.length; n += 2) {
-        let i = $.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n)) * 45;
-        i += $.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n + 1)), a(i, 11, o);
+      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)), c(i, 11, o);
       }
-      return n < t.length && a($.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n)), 6, o), new $($.Mode.ALPHANUMERIC, t.length, o);
+      return n < e.length && c(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(t) {
-      return t == "" ? [] : $.isNumeric(t) ? [$.makeNumeric(t)] : $.isAlphanumeric(t) ? [$.makeAlphanumeric(t)] : [$.makeBytes($.toUtf8ByteArray(t))];
+    static makeSegments(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(t) {
+    static makeEci(e) {
       let o = [];
-      if (t < 0)
+      if (e < 0)
         throw new RangeError("ECI assignment value out of range");
-      if (t < 128)
-        a(t, 8, o);
-      else if (t < 16384)
-        a(2, 2, o), a(t, 14, o);
-      else if (t < 1e6)
-        a(6, 3, o), a(t, 21, o);
+      if (e < 128)
+        c(e, 8, o);
+      else if (e < 16384)
+        c(2, 2, o), c(e, 14, o);
+      else if (e < 1e6)
+        c(6, 3, o), c(e, 21, o);
       else
         throw new RangeError("ECI assignment value out of range");
-      return new $($.Mode.ECI, 0, o);
+      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(t) {
-      return $.NUMERIC_REGEX.test(t);
+    static isNumeric(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(t) {
-      return $.ALPHANUMERIC_REGEX.test(t);
+    static isAlphanumeric(e) {
+      return u.ALPHANUMERIC_REGEX.test(e);
     }
     /*-- Methods --*/
     // Returns a new copy of the data bits of this segment.
@@ -490,9 +490,9 @@ var T;
     }
     // (Package-private) Calculates and returns the number of bits needed to encode the given segments at
     // the given version. The result is infinity if a segment has too many characters to fit its length field.
-    static getTotalBits(t, o) {
+    static getTotalBits(e, o) {
       let n = 0;
-      for (const i of t) {
+      for (const i of e) {
         const h = i.mode.numCharCountBits(o);
         if (i.numChars >= 1 << h)
           return 1 / 0;
@@ -501,57 +501,57 @@ var T;
       return n;
     }
     // Returns a new array of bytes representing the given string encoded in UTF-8.
-    static toUtf8ByteArray(t) {
-      t = encodeURI(t);
+    static toUtf8ByteArray(e) {
+      e = encodeURI(e);
       let o = [];
-      for (let n = 0; n < t.length; n++)
-        t.charAt(n) != "%" ? o.push(t.charCodeAt(n)) : (o.push(parseInt(t.substring(n + 1, n + 3), 16)), n += 2);
+      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 f = $;
-  r.QrSegment = f;
-})(T || (T = {}));
+  u.NUMERIC_REGEX = /^[0-9]*$/, u.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, u.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+  let l = u;
+  r.QrSegment = l;
+})(O || (O = {}));
 ((r) => {
-  ((c) => {
-    const s = class s {
+  ((s) => {
+    const a = class a {
       // The QR Code can tolerate about 30% erroneous codewords
       /*-- Constructor and fields --*/
-      constructor(f, l) {
-        this.ordinal = f, this.formatBits = l;
+      constructor(l, d) {
+        this.ordinal = l, 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 a = s;
-    c.Ecc = a;
+    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 c = a;
+    s.Ecc = c;
   })(r.QrCode || (r.QrCode = {}));
-})(T || (T = {}));
+})(O || (O = {}));
 ((r) => {
-  ((c) => {
-    const s = class s {
+  ((s) => {
+    const a = class a {
       /*-- Constructor and fields --*/
-      constructor(f, l) {
-        this.modeBits = f, this.numBitsCharCount = l;
+      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(f) {
-        return this.numBitsCharCount[Math.floor((f + 7) / 17)];
+      numCharCountBits(l) {
+        return this.numBitsCharCount[Math.floor((l + 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 a = s;
-    c.Mode = a;
+    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 c = a;
+    s.Mode = c;
   })(r.QrSegment || (r.QrSegment = {}));
-})(T || (T = {}));
-const F = T, _ = {
-  L: F.QrCode.Ecc.LOW,
-  M: F.QrCode.Ecc.MEDIUM,
-  Q: F.QrCode.Ecc.QUARTILE,
-  H: F.QrCode.Ecc.HIGH
-}, V = 128, W = "M", J = "#FFFFFF", tt = 1, et = 4, X = 5, y = "#000000", nt = "square", ot = "square", rt = "square", st = 0.1, C = 7, P = 3, b = [
+})(O || (O = {}));
+const v = O, rt = {
+  L: v.QrCode.Ecc.LOW,
+  M: v.QrCode.Ecc.MEDIUM,
+  Q: v.QrCode.Ecc.QUARTILE,
+  H: v.QrCode.Ecc.HIGH
+}, st = 128, it = "M", at = "#FFFFFF", ct = 1, lt = 4, Z = 5, z = "#000000", ht = "square", ut = "square", dt = "square", ft = "react-qr-code", S = "react-qr-code-gradient", D = "react-qr-code-bg-gradient", $t = 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 F = T, _ = {
   [1, 0, 0, 0, 0, 0, 1],
   [1, 0, 0, 0, 0, 0, 1],
   [1, 1, 1, 1, 1, 1, 1]
-], Z = {
+], K = {
   "inpoint-sm": [0, 90, -90],
   inpoint: [0, 90, -90],
   "inpoint-lg": [0, 90, -90],
@@ -569,7 +569,7 @@ const F = T, _ = {
   "leaf-sm": [0, 90, -90],
   leaf: [0, 90, -90],
   "leaf-lg": [0, 90, -90]
-}, B = {
+}, H = {
   "rounded-sm": 3,
   rounded: 4,
   "rounded-lg": 5,
@@ -582,7 +582,7 @@ const F = T, _ = {
   "outpoint-sm": 3,
   outpoint: 4,
   "outpoint-lg": 5
-}, U = {
+}, k = {
   square: 0,
   diamond: 0,
   circle: 3,
@@ -598,7 +598,7 @@ const F = T, _ = {
   "outpoint-sm": 1.5,
   outpoint: 2,
   "outpoint-lg": 2.3
-}, v = [
+}, B = [
   [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 F = T, _ = {
   [0, 0, 1, 1, 1, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0]
-], it = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond", L = (r, c, a) => {
-  const s = {
-    left: r === 0 ? 0 : a[c][r - 1],
-    right: r === a[c].length - 1 ? 0 : a[c][r + 1],
-    top: c === 0 ? 0 : a[c - 1][r],
-    bottom: c === a.length - 1 ? 0 : a[c + 1][r]
-  };
+], pt = /\.?0+$/;
+function mt(r) {
+  return r.toFixed(7).replace(pt, "");
+}
+const V = (r) => {
+  const s = r % 360 * (Math.PI / 180), c = 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))), l = Math.max(0, Math.min(100, 50 + 50 * Math.sin(s)));
   return {
-    ...s,
-    count: Object.values(s).filter(Boolean).length
+    x1: `${c}%`,
+    y1: `${a}%`,
+    x2: `${t}%`,
+    y2: `${l}%`
   };
-}, O = (r, c, a) => `M${r},${c}h${a}v${a}h-${a}Z`, D = (r, c, a) => `M${r},${c + a / 2}a${a / 2},${a / 2} 0 1,0 ${a},0a${a / 2},${a / 2} 0 1,0 -${a},0Z`, at = (r, c, a) => `M${r},${c + a / 2}l${a / 2},-${a / 2}l${a / 2},${a / 2}l-${a / 2},${a / 2}Z`, lt = (r, c) => `M ${r} ${c} 
-   v 1 
-   h 1 
-   v -0.5 
-   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, z = (r, c) => `M ${r + 1} ${c} 
-   v 1 
-   h -1 
-   v -0.5 
-   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, k = (r, c) => `M ${r} ${c} 
-   v 1 
-   h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0.5 -0.5
-   v -0.5
-   h -1`, ct = (r, c) => `M ${r + 1} ${c} 
-   v 1 
-   h -0.5 
-   a 0.5 0.5, 0, 0, 1, -0.5 -0.5 
-   v -0.5 
-   h 1`, Y = (r, c) => `M ${r} ${c} 
-   v 1 
-   h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0 -1`, H = (r, c) => `M ${r + 1} ${c} 
-   v 1 
-   h -0.5 
-   a 0.5 0.5, 0, 0, 1, 0 -1`, q = (r, c) => `M ${r} ${c + 1} 
-   h 1 
-   v -0.5 
-   a 0.5 0.5, 0, 0, 0, -1 0`, G = (r, c) => `M ${r} ${c} 
-   h 1 
-   v 0.5 
-   a 0.5 0.5, 0, 0, 1, -1 0`, ht = (r, c, a) => `M ${r + 1} ${c}h -${a / 2}a ${a / 2.5} ${a / 2.5}, 0, 0, 0, ${-a / 2.5} ${a / 2.5}v ${a / 2}h ${a / 2}a ${a / 2.5} ${a / 2.5}, 0, 0, 0, ${a / 2.5} ${-a / 2.5}`, ut = ({
-  x: r,
-  y: c,
-  numCells: a
-}) => {
-  var s, e, f;
-  return !!((s = v[r]) != null && s[c] || (e = v[r - a + 7]) != null && e[c] || (f = v[r]) != null && f[c - a + 7]);
-}, ft = ({
-  x: r,
-  y: c,
-  radius: a
-}) => {
-  const s = P - a, e = a / 2, f = P - e;
-  return `M ${r} ${c + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${f}v ${-f}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}H ${r}z`;
-}, dt = ({
-  x: r,
-  y: c,
-  radius: a
-}) => {
-  const s = P - a, e = a / 2, f = P - e;
-  return `M ${r} ${c + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${f}v ${-f}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}a ${e} ${e}, 0, 0, 0, ${-e} ${e}`;
-}, $t = ({
-  x: r,
-  y: c,
-  numCells: a
-}) => {
-  var s, e, f;
-  return !!((s = b[r]) != null && s[c] || (e = b[r - a + 7]) != null && e[c] || (f = b[r]) != null && f[c - a + 7]);
-}, pt = ({
-  x: r,
-  y: c,
-  radius: a
-}) => {
-  const s = C - a, e = a / 2;
-  return `M ${r} ${c + 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} ${c + 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)}`;
-}, Et = ({
-  x: r,
-  y: c,
-  radius: a
-}) => {
-  const s = C - a, e = a / 2, f = C - e;
-  return `M ${r} ${c + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${f}v ${-f}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}H ${r}zM ${r + e} ${c + 1}h ${s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${e - 1}v ${f - 1}h ${-(f - 1)}a ${e - 1} ${e - 1}, 0, 0, 1, ${-(e - 1)} ${-(e - 1)}v ${-(f - 1)}z`;
-}, mt = ({
-  x: r,
-  y: c,
-  radius: a
-}) => {
-  const s = C - a, e = a / 2, f = C - e;
-  return `M ${r} ${c + e}v ${s}a ${e} ${e}, 0, 0, 0, ${e} ${e}h ${f}v ${-f}a ${e} ${e}, 0, 0, 0, ${-e} ${-e}h ${-s}a ${e} ${e}, 0, 0, 0, ${-e} ${e}M ${r + e} ${c + 1}h ${s}a ${e - 1} ${e - 1}, 0, 0, 1, ${e - 1} ${e - 1}v ${f - 1}h ${-(f - 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)}`;
-}, Mt = (r) => ({
-  color: (r == null ? void 0 : r.color) || y,
-  style: (r == null ? void 0 : r.style) || rt,
-  randomSize: (r == null ? void 0 : r.randomSize) || !1
-}), Rt = (r) => ({
-  color: (r == null ? void 0 : r.color) || y,
-  style: (r == null ? void 0 : r.style) || nt
-}), gt = (r) => ({
-  color: (r == null ? void 0 : r.color) || y,
-  style: (r == null ? void 0 : r.style) || ot
-}), At = /\.?0+$/;
-function Nt(r) {
-  return r.toFixed(7).replace(At, "");
-}
-const K = (r, c, a, s) => {
-  const e = a / 2, f = e / 2, l = Math.PI / s;
-  let $ = "";
-  for (let E = 0; E < 2 * s; E++) {
-    const t = E * l - Math.PI / 2, o = E % 2 === 0 ? e : f, n = r + o * Math.cos(t), i = c + o * Math.sin(t);
-    $ += `${E === 0 ? "M" : "L"} ${n},${i} `;
+}, W = (r, s, c, a) => {
+  const t = c / 2, l = 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 : l, n = r + o * Math.cos(e), i = s + o * Math.sin(e);
+    u += `${g === 0 ? "M" : "L"} ${n},${i} `;
   }
-  return $ + "Z";
-}, Q = (r, c, a) => {
-  let s = !1, e = 0;
+  return u + "Z";
+}, J = (r, s, c) => {
+  let a = !1, t = 0;
   return [
     "M",
     1,
@@ -831,322 +739,514 @@ const K = (r, c, a, s) => {
     1,
     0.3262506,
     "z"
-  ].map((f) => typeof f == "string" ? (e = 0, s = f.toUpperCase() == f, f) : (e++, f = f * a, s && (f += e % 2 == 1 ? r : c), Nt(f))).join(" ");
+  ].map((l) => typeof l == "string" ? (t = 0, a = l.toUpperCase() == l, l) : (t++, l = l * c, a && (l += t % 2 == 1 ? r : s), mt(l))).join(" ");
+}, Et = ({ background: r, numCells: s }) => {
+  var a, t;
+  if (!r)
+    return /* @__PURE__ */ N("path", { fill: at, d: `M0,0 h${s}v${s}H0z` });
+  if (typeof r == "string")
+    return /* @__PURE__ */ N("path", { fill: r, d: `M0,0 h${s}v${s}H0z` });
+  const c = V((r == null ? void 0 : r.rotation) || 0);
+  return /* @__PURE__ */ Q(tt, { children: [
+    /* @__PURE__ */ N("defs", { children: r.type === "linear" ? /* @__PURE__ */ N("linearGradient", { id: D, gradientUnits: "userSpaceOnUse", ...c, children: (a = r.stops) == null ? void 0 : a.map((l, d) => /* @__PURE__ */ N("stop", { offset: l.offset, stopColor: l.color }, d)) }) : /* @__PURE__ */ N(
+      "radialGradient",
+      {
+        id: D,
+        gradientUnits: "userSpaceOnUse",
+        cx: "50%",
+        cy: "50%",
+        r: "50%",
+        children: (t = r.stops) == null ? void 0 : t.map((l, d) => /* @__PURE__ */ N("stop", { offset: l.offset, stopColor: l.color }, d))
+      }
+    ) }),
+    /* @__PURE__ */ N("path", { fill: `url(#${D})`, d: `M0,0 h${s}v${s}H0z` })
+  ] });
+}, Mt = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond", F = (r, s, c) => {
+  const a = {
+    left: r === 0 ? 0 : c[s][r - 1],
+    right: r === c[s].length - 1 ? 0 : c[s][r + 1],
+    top: s === 0 ? 0 : c[s - 1][r],
+    bottom: s === c.length - 1 ? 0 : c[s + 1][r]
+  };
+  return {
+    ...a,
+    count: Object.values(a).filter(Boolean).length
+  };
+}, y = (r, s, c) => `M${r},${s}h${c}v${c}h-${c}Z`, U = (r, s, c) => `M${r},${s + c / 2}a${c / 2},${c / 2} 0 1,0 ${c},0a${c / 2},${c / 2} 0 1,0 -${c},0Z`, Rt = (r, s, c) => `M${r},${s + c / 2}l${c / 2},-${c / 2}l${c / 2},${c / 2}l-${c / 2},${c / 2}Z`, gt = (r, s) => `M ${r} ${s} 
+   v 1 
+   h 1 
+   v -0.5 
+   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, G = (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`, Y = (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`, At = (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`, q = (r, s) => `M ${r} ${s} 
+   v 1 
+   h 0.5 
+   a 0.5 0.5, 0, 0, 0, 0 -1`, j = (r, s) => `M ${r + 1} ${s} 
+   v 1 
+   h -0.5 
+   a 0.5 0.5, 0, 0, 1, 0 -1`, X = (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`, wt = (r, s, c) => `M ${r + 1} ${s}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}`, Nt = ({
+  x: r,
+  y: s,
+  numCells: c
+}) => {
+  var a, t, l;
+  return !!((a = B[r]) != null && a[s] || (t = B[r - c + 7]) != null && t[s] || (l = B[r]) != null && l[s - c + 7]);
 }, Ct = ({
+  x: r,
+  y: s,
+  radius: c
+}) => {
+  const a = T - c, t = c / 2, l = T - t;
+  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${l}v ${-l}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}H ${r}z`;
+}, It = ({
+  x: r,
+  y: s,
+  radius: c
+}) => {
+  const a = T - c, t = c / 2, l = T - t;
+  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${l}v ${-l}a ${t} ${t}, 0, 0, 0, ${-t} ${-t}h ${-a}a ${t} ${t}, 0, 0, 0, ${-t} ${t}`;
+}, Pt = ({
+  x: r,
+  y: s,
+  numCells: c
+}) => {
+  var a, t, l;
+  return !!((a = b[r]) != null && a[s] || (t = b[r - c + 7]) != null && t[s] || (l = b[r]) != null && l[s - c + 7]);
+}, Tt = ({
+  x: r,
+  y: s,
+  radius: c
+}) => {
+  const a = I - c, t = c / 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)}`;
+}, Lt = ({
+  x: r,
+  y: s,
+  radius: c
+}) => {
+  const a = I - c, t = c / 2, l = I - t;
+  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${l}v ${-l}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 ${l - 1}h ${-(l - 1)}a ${t - 1} ${t - 1}, 0, 0, 1, ${-(t - 1)} ${-(t - 1)}v ${-(l - 1)}z`;
+}, Ot = ({
+  x: r,
+  y: s,
+  radius: c
+}) => {
+  const a = I - c, t = c / 2, l = I - t;
+  return `M ${r} ${s + t}v ${a}a ${t} ${t}, 0, 0, 0, ${t} ${t}h ${l}v ${-l}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 ${l - 1}h ${-(l - 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)}`;
+}, vt = (r) => ({
+  color: (r == null ? void 0 : r.color) || z,
+  style: (r == null ? void 0 : r.style) || dt,
+  randomSize: (r == null ? void 0 : r.randomSize) || !1
+}), yt = (r) => ({
+  color: (r == null ? void 0 : r.color) || z,
+  style: (r == null ? void 0 : r.style) || ht
+}), St = (r) => ({
+  color: (r == null ? void 0 : r.color) || z,
+  style: (r == null ? void 0 : r.style) || ut
+}), Ft = ({
   modules: r,
-  margin: c,
-  settings: a
+  margin: s,
+  settings: c,
+  gradient: a
 }) => {
-  const { color: s, style: e, randomSize: f } = S(
-    () => Mt(a),
-    [a]
-  ), l = [], $ = r.length, E = it(e) && f, t = x(() => e === "square-sm" ? 0.75 : E ? Math.random() * (1 - 0.75) + 0.75 : 1, [e, E]);
-  return r.forEach((o, n) => {
-    o.forEach((i, h) => {
-      if ($t({ x: h, y: n, numCells: $ }) || ut({ x: h, y: n, numCells: $ }))
+  const { color: t, style: l, randomSize: d } = L(
+    () => vt(c),
+    [c]
+  ), u = [], g = r.length, e = Mt(l) && d, o = et(() => l === "square-sm" ? 0.75 : e ? Math.random() * (1 - 0.75) + 0.75 : 1, [l, e]);
+  return r.forEach((n, i) => {
+    n.forEach((h, $) => {
+      if (Pt({ x: $, y: i, numCells: g }) || Nt({ x: $, y: i, numCells: g }))
         return;
-      const p = t(), d = 1 * p, R = (1 - 1 * p) / 2, u = h + c + R, M = n + c + R;
-      if (i) {
-        if (e === "square" || e === "square-sm")
-          l.push(O(u, M, d));
-        else if (e === "circle")
-          l.push(D(u, M, d));
-        else if (e === "diamond")
-          l.push(at(u, M, d));
-        else if (e === "star")
-          l.push(
-            K(u + d / 2, M + d / 2, d * 1.1, X)
+      const f = o(), p = 1 * f, M = (1 - 1 * f) / 2, E = $ + s + M, m = i + s + M;
+      if (h) {
+        if (l === "square" || l === "square-sm")
+          u.push(y(E, m, p));
+        else if (l === "circle")
+          u.push(U(E, m, p));
+        else if (l === "diamond")
+          u.push(Rt(E, m, p));
+        else if (l === "star")
+          u.push(
+            W(E + p / 2, m + p / 2, p * 1.1, Z)
           );
-        else if (e === "heart")
-          l.push(Q(u, M, d));
-        else if (e === "rounded") {
-          const { left: A, right: m, top: g, bottom: N, count: I } = L(h, n, r);
-          I === 0 ? l.push(D(u, M, 1)) : I > 2 || A && m || g && N ? l.push(O(u, M, 1)) : I === 2 ? A && g ? l.push(k(u, M)) : g && m ? l.push(ct(u, M)) : m && N ? l.push(z(u, M)) : l.push(lt(u, M)) : g ? l.push(G(u, M)) : m ? l.push(H(u, M)) : N ? l.push(q(u, M)) : l.push(Y(u, M));
-        } else if (e === "leaf") {
-          const { left: A, right: m, top: g, bottom: N, count: I } = L(h, n, r);
-          if (I === 0)
-            l.push(ht(u, M, d));
-          else if (!A && !g) {
-            l.push(z(u, M));
+        else if (l === "heart")
+          u.push(J(E, m, p));
+        else if (l === "rounded") {
+          const { left: R, right: A, top: w, bottom: C, count: P } = F($, i, r);
+          P === 0 ? u.push(U(E, m, 1)) : P > 2 || R && A || w && C ? u.push(y(E, m, 1)) : P === 2 ? R && w ? u.push(Y(E, m)) : w && A ? u.push(At(E, m)) : A && C ? u.push(G(E, m)) : u.push(gt(E, m)) : w ? u.push(_(E, m)) : A ? u.push(j(E, m)) : C ? u.push(X(E, m)) : u.push(q(E, m));
+        } else if (l === "leaf") {
+          const { left: R, right: A, top: w, bottom: C, count: P } = F($, i, r);
+          if (P === 0)
+            u.push(wt(E, m, p));
+          else if (!R && !w) {
+            u.push(G(E, m));
             return;
-          } else !m && !N ? l.push(k(u, M)) : l.push(O(u, M, 1));
-        } else if (e === "vertical-line") {
-          const { left: A, right: m, top: g, bottom: N, count: I } = L(h, n, r);
-          I === 0 || A && !(g || N) || m && !(g || N) ? l.push(D(u, M, 1)) : g && N ? l.push(O(u, M, 1)) : g && !N ? l.push(G(u, M)) : N && !g && l.push(q(u, M));
-        } else if (e === "horizontal-line") {
-          const { left: A, right: m, top: g, bottom: N, count: I } = L(h, n, r);
-          I === 0 || g && !(A || m) || N && !(A || m) ? l.push(D(u, M, 1)) : A && m ? l.push(O(u, M, 1)) : A && !m ? l.push(Y(u, M)) : m && !A && l.push(H(u, M));
+          } else !A && !C ? u.push(Y(E, m)) : u.push(y(E, m, 1));
+        } else if (l === "vertical-line") {
+          const { left: R, right: A, top: w, bottom: C, count: P } = F($, i, r);
+          P === 0 || R && !(w || C) || A && !(w || C) ? u.push(U(E, m, 1)) : w && C ? u.push(y(E, m, 1)) : w && !C ? u.push(_(E, m)) : C && !w && u.push(X(E, m));
+        } else if (l === "horizontal-line") {
+          const { left: R, right: A, top: w, bottom: C, count: P } = F($, i, r);
+          P === 0 || w && !(R || A) || C && !(R || A) ? u.push(U(E, m, 1)) : R && A ? u.push(y(E, m, 1)) : R && !A ? u.push(q(E, m)) : A && !R && u.push(j(E, m));
         }
       }
     });
-  }), /* @__PURE__ */ w(
+  }), /* @__PURE__ */ N(
     "path",
     {
-      fill: s,
-      d: l.join(""),
-      shapeRendering: e === "square" ? "crispEdges" : "geometricPrecision"
+      fill: a ? `url(#${S})` : t,
+      d: u.join(""),
+      shapeRendering: l === "square" ? "crispEdges" : "geometricPrecision"
     }
   );
-}, wt = ({
+}, Ut = ({
   modules: r,
-  margin: c,
-  settings: a
+  margin: s,
+  settings: c,
+  gradient: a
 }) => {
-  const { color: s, style: e } = S(
-    () => gt(a),
-    [a]
-  ), f = S(
+  const { color: t, style: l } = L(
+    () => St(c),
+    [c]
+  ), d = a ? `url(#${S})` : t, u = L(
     () => [
-      { x: c + 2, y: c + 2 },
-      { x: r.length + c - C + 2, y: c + 2 },
-      { x: c + 2, y: r.length + c - 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 }
     ],
-    [c, r.length]
-  ), l = ($, E) => `finder-patterns-inner-${e}-${$}-${E}`;
-  if (e === "rounded-sm" || e === "rounded" || e === "rounded-lg" || e === "circle" || e === "square")
-    return f.map(($) => {
-      const { x: E, y: t } = $;
-      return /* @__PURE__ */ w(
+    [s, r.length]
+  ), g = (e, o) => `finder-patterns-inner-${l}-${e}-${o}`;
+  if (l === "rounded-sm" || l === "rounded" || l === "rounded-lg" || l === "circle" || l === "square")
+    return u.map((e) => {
+      const { x: o, y: n } = e;
+      return /* @__PURE__ */ N(
         "rect",
         {
-          x: E,
-          y: t,
-          width: P,
-          height: P,
-          fill: s,
-          rx: U[e]
+          x: o,
+          y: n,
+          width: T,
+          height: T,
+          fill: d,
+          rx: k[l]
         },
-        l(E, t)
+        g(o, n)
       );
     });
-  if (e === "diamond")
-    return f.map(($) => {
-      const { x: E, y: t } = $, o = Math.sqrt(1.5), n = P / o, i = n - n / o;
-      return /* @__PURE__ */ w(
+  if (l === "diamond")
+    return u.map((e) => {
+      const { x: o, y: n } = e, i = Math.sqrt(1.5), h = T / i, $ = h - h / i;
+      return /* @__PURE__ */ N(
         "rect",
         {
-          x: E + i / 2,
-          y: t + i / 2,
-          width: n,
-          height: n,
-          fill: s,
+          x: o + $ / 2,
+          y: n + $ / 2,
+          width: h,
+          height: h,
+          fill: d,
           style: {
             transform: "rotate(45deg)",
             transformOrigin: "center",
             transformBox: "fill-box"
           }
         },
-        l(E, t)
+        g(o, n)
       );
     });
-  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 $ = e === "leaf-sm" || e === "leaf" || e === "leaf-lg" ? ft : dt;
-    return f.map((E, t) => ({
-      ...E,
-      rotation: Z[e][t]
-    })).map(({ x: E, y: t, rotation: o }) => {
-      const n = $({
-        x: E,
-        y: t,
-        radius: U[e]
+  if (l === "inpoint-sm" || l === "inpoint" || l === "inpoint-lg" || l === "outpoint-sm" || l === "outpoint" || l === "outpoint-lg" || l === "leaf-sm" || l === "leaf" || l === "leaf-lg") {
+    const e = l === "leaf-sm" || l === "leaf" || l === "leaf-lg" ? Ct : It;
+    return u.map((o, n) => ({
+      ...o,
+      rotation: K[l][n]
+    })).map(({ x: o, y: n, rotation: i }) => {
+      const h = e({
+        x: o,
+        y: n,
+        radius: k[l]
       });
-      return /* @__PURE__ */ w(
+      return /* @__PURE__ */ N(
         "path",
         {
-          fill: s,
-          d: n,
+          fill: d,
+          d: h,
           style: {
-            transform: `rotate(${o}deg)`,
+            transform: `rotate(${i}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           }
         },
-        l(E, t)
+        g(o, n)
       );
     });
   }
-  return e === "heart" ? f.map(({ x: $, y: E }) => /* @__PURE__ */ w("path", { fill: s, d: Q($, E, P) }, l($, E))) : e === "star" ? f.map(({ x: $, y: E }) => {
-    const t = $ + P / 2, o = E + P / 2, n = K(t, o, P * 1.2, X);
-    return /* @__PURE__ */ w("path", { fill: s, d: n }, l($, E));
+  return l === "heart" ? u.map(({ x: e, y: o }) => /* @__PURE__ */ N("path", { fill: d, d: J(e, o, T) }, g(e, o))) : l === "star" ? u.map(({ x: e, y: o }) => {
+    const n = e + T / 2, i = o + T / 2, h = W(n, i, T * 1.2, Z);
+    return /* @__PURE__ */ N("path", { fill: d, d: h }, g(e, o));
   }) : null;
-}, It = ({
+}, Dt = ({
   modules: r,
-  margin: c,
-  settings: a
+  margin: s,
+  settings: c,
+  gradient: a
 }) => {
-  const { style: s, color: e } = S(
-    () => Rt(a),
-    [a]
-  ), f = [], l = S(
+  const { style: t, color: l } = L(
+    () => yt(c),
+    [c]
+  ), d = a ? `url(#${S})` : l, u = [], g = L(
     () => [
-      { x: c, y: c },
-      { x: r.length + c - C, y: c },
-      { x: c, y: r.length + c - C }
+      { x: s, y: s },
+      { x: r.length + s - I, y: s },
+      { x: s, y: r.length + s - I }
     ],
-    [c, r.length]
+    [s, r.length]
   );
-  if (console.log("modules.length", r.length), console.log("coordinates", l), ["rounded-sm", "rounded", "rounded-lg", "circle", "square"].includes(s)) {
-    for (const $ of l) {
-      const { x: E, y: t } = $;
-      s === "rounded-sm" || s === "rounded" || s === "rounded-lg" ? f.push(
-        pt({
-          x: E,
-          y: t,
-          radius: B[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(
+        Tt({
+          x: o,
+          y: n,
+          radius: H[t]
         })
-      ) : s === "circle" ? f.push(
-        `M ${E + C / 2} ${t}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`
-      ) : f.push(
-        `M ${E} ${t}v ${C}h ${C}v -7zM ${E + 1} ${t + 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__ */ w("path", { fill: e, d: f.join("") });
+    return /* @__PURE__ */ N("path", { fill: d, d: u.join("") });
   }
-  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" ? Et : mt;
-    return l.map((E, t) => ({
-      ...E,
-      rotation: Z[s][t]
-    })).map(({ x: E, y: t, rotation: o }) => {
-      const n = $({
-        x: E,
-        y: t,
-        radius: B[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" ? Lt : Ot;
+    return g.map((o, n) => ({
+      ...o,
+      rotation: K[t][n]
+    })).map(({ x: o, y: n, rotation: i }) => {
+      const h = e({
+        x: o,
+        y: n,
+        radius: H[t]
       });
-      return /* @__PURE__ */ w(
+      return /* @__PURE__ */ N(
         "path",
         {
-          fill: e,
-          d: n,
+          fill: d,
+          d: h,
           style: {
-            transform: `rotate(${o}deg)`,
+            transform: `rotate(${i}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           }
         },
-        `finder-patterns-outer-${s}-${E}-${t}`
+        `finder-patterns-outer-${t}-${o}-${n}`
       );
     });
   }
   return null;
-}, Pt = (r, c) => r.slice().map((a, s) => s < c.y || s >= c.y + c.h ? a : a.map((e, f) => f < c.x || f >= c.x + c.w ? e : !1)), St = (r, c, a, s) => {
-  if (s == null)
+}, bt = ({ gradient: r }) => {
+  var c, a;
+  if (!r)
+    return null;
+  const s = V((r == null ? void 0 : r.rotation) || 0);
+  return /* @__PURE__ */ N("defs", { children: r.type === "linear" ? /* @__PURE__ */ N("linearGradient", { id: S, gradientUnits: "userSpaceOnUse", ...s, children: (c = r.stops) == null ? void 0 : c.map((t, l) => /* @__PURE__ */ N("stop", { offset: t.offset, stopColor: t.color }, l)) }) : /* @__PURE__ */ N(
+    "radialGradient",
+    {
+      id: S,
+      gradientUnits: "userSpaceOnUse",
+      cx: "50%",
+      cy: "50%",
+      r: "50%",
+      children: (a = r.stops) == null ? void 0 : a.map((t, l) => /* @__PURE__ */ N("stop", { offset: t.offset, stopColor: t.color }, l))
+    }
+  ) });
+}, Bt = (r, s) => r.slice().map((c, a) => a < s.y || a >= s.y + s.h ? c : c.map((t, l) => l < s.x || l >= s.x + s.w ? t : !1)), zt = (r, s, c, a) => {
+  if (a == null)
     return null;
-  const e = r.length + a * 2, f = Math.floor(c * st), l = e / c, $ = (s.width || f) * l, E = (s.height || f) * l, t = s.x == null ? r.length / 2 - $ / 2 : s.x * l, o = s.y == null ? r.length / 2 - E / 2 : s.y * l, n = s.opacity == null ? 1 : s.opacity;
+  const t = r.length + c * 2, l = Math.floor(s * $t), d = t / s, u = (a.width || l) * d, g = (a.height || l) * 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(t), d = Math.floor(o), R = Math.ceil($ + t - p), u = Math.ceil(E + o - d);
-    i = { x: p, y: d, w: R, h: u };
+  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: t, y: o, h: E, w: $, excavation: i, opacity: n, crossOrigin: h };
-}, Tt = (r) => r != null ? Math.max(Math.floor(r), 0) : et, Ft = ({
+  const h = a.crossOrigin;
+  return { x: e, y: o, h: g, w: u, excavation: i, opacity: n, crossOrigin: h };
+}, xt = (r) => r != null ? Math.max(Math.floor(r), 0) : lt, Ht = ({
   value: r,
-  level: c,
-  minVersion: a,
-  marginSize: s,
-  imageSettings: e,
-  size: f,
-  boostLevel: l
+  level: s,
+  minVersion: c,
+  marginSize: a,
+  imageSettings: t,
+  size: l,
+  boostLevel: d
 }) => {
-  const $ = S(() => {
-    const h = (Array.isArray(r) ? r : [r]).reduce((p, d) => (p.push(...F.QrSegment.makeSegments(d)), p), []);
-    return F.QrCode.encodeSegments(
+  const u = L(() => {
+    const h = (Array.isArray(r) ? r : [r]).reduce(($, f) => ($.push(...v.QrSegment.makeSegments(f)), $), []);
+    return v.QrCode.encodeSegments(
       h,
-      _[c],
-      a,
+      rt[s],
+      c,
       void 0,
       void 0,
-      l
+      d
     );
-  }, [r, c, a, l]), { cells: E, margin: t, numCells: o, calculatedImageSettings: n } = S(() => {
-    const i = $.getModules(), h = Tt(s), p = i.length + h * 2, d = St(i, f, h, e);
+  }, [r, s, c, d]), { cells: g, margin: e, numCells: o, calculatedImageSettings: n } = L(() => {
+    const i = u.getModules(), h = xt(a), $ = i.length + h * 2, f = zt(i, l, h, t);
     return {
       cells: i,
       margin: h,
-      numCells: p,
-      calculatedImageSettings: d
+      numCells: $,
+      calculatedImageSettings: f
     };
-  }, [$, f, e, s]);
+  }, [u, l, t, a]);
   return {
-    qrcode: $,
-    margin: t,
-    cells: E,
+    qrcode: u,
+    margin: e,
+    cells: g,
     numCells: o,
     calculatedImageSettings: n
   };
-}, Ot = (r) => {
+}, kt = ({ svgRef: r, fileSize: s, 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(), l = new Blob([t.serializeToString(a)], {
+    type: "image/svg+xml"
+  }), d = URL.createObjectURL(l), u = document.createElement("a");
+  u.href = d, u.download = `${c}.svg`, document.body.appendChild(u), u.click(), document.body.removeChild(u), URL.revokeObjectURL(d);
+}, Gt = ({
+  svgRef: r,
+  fileSize: s,
+  fileName: c,
+  fileFormat: a,
+  imageSettings: t,
+  calculatedImageSettings: l,
+  size: d,
+  numCells: u,
+  margin: g
+}) => {
+  if (!r.current) return;
+  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 && 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 ? (l.x + g) / M : (s - E) / 2, R = t.y ? (l.y + g) / M : (s - E) / 2;
+        o.drawImage(f, m, R, E, E);
+        const A = a === "png" ? "image/png" : "image/jpeg", w = document.createElement("a");
+        w.href = e.toDataURL(A), w.download = `${c}.${a}`, document.body.appendChild(w), w.click(), document.body.removeChild(w);
+      }, 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 = `${c}.${a}`, document.body.appendChild(p), p.click(), document.body.removeChild(p);
+    }
+  }, $.onerror = (f) => console.error("Error loading QR code:", f);
+}, Yt = (r) => {
   const {
-    ref: c,
-    value: a,
-    size: s = V,
-    level: e = W,
-    bgColor: f = J,
-    minVersion: l = tt,
-    boostLevel: $,
-    marginSize: E,
-    finderPatternOuterSettings: t,
-    finderPatternInnerSettings: o,
-    dataModulesSettings: n,
-    imageSettings: i,
-    svgProps: h
-  } = r, { margin: p, cells: d, numCells: R, calculatedImageSettings: u } = Ft({
-    value: a,
-    level: e,
-    minVersion: l,
-    boostLevel: $,
-    marginSize: E,
-    imageSettings: i,
-    size: s
+    ref: s,
+    value: c,
+    size: a = st,
+    level: t = it,
+    background: l,
+    gradient: d,
+    minVersion: u = ct,
+    boostLevel: g,
+    marginSize: e,
+    finderPatternOuterSettings: o,
+    finderPatternInnerSettings: n,
+    dataModulesSettings: i,
+    imageSettings: h,
+    svgProps: $
+  } = r, f = ot(null), { margin: p, cells: M, numCells: E, calculatedImageSettings: m } = Ht({
+    value: c,
+    level: t,
+    minVersion: u,
+    boostLevel: g,
+    marginSize: e,
+    imageSettings: h,
+    size: a
   });
-  let M = d, A = null;
-  return i != null && u != null && (u.excavation != null && (M = Pt(d, u.excavation)), A = /* @__PURE__ */ w(
+  nt(s, () => ({
+    svg: f.current,
+    download: ({
+      name: C = ft,
+      format: P = "svg",
+      size: x = 500
+    }) => {
+      f.current && (P === "svg" ? kt({ svgRef: f, fileSize: x, fileName: C }) : Gt({
+        svgRef: f,
+        fileSize: x,
+        fileName: C,
+        fileFormat: P,
+        imageSettings: h,
+        calculatedImageSettings: m,
+        size: a,
+        numCells: E,
+        margin: p
+      }));
+    }
+  }));
+  let R = M, A = null;
+  h != null && m != null && (m.excavation != null && (R = Bt(M, m.excavation)), A = /* @__PURE__ */ N(
     "image",
     {
-      href: i.src,
-      height: u.h,
-      width: u.w,
-      x: u.x + p,
-      y: u.y + p,
+      href: h.src,
+      height: m.h,
+      width: m.w,
+      x: m.x + p,
+      y: m.y + p,
       preserveAspectRatio: "none",
-      opacity: u.opacity,
-      crossOrigin: u.crossOrigin
+      opacity: m.opacity,
+      crossOrigin: m.crossOrigin
     }
-  )), /* @__PURE__ */ j(
+  ));
+  const w = {
+    modules: R,
+    margin: p,
+    gradient: d
+  };
+  return /* @__PURE__ */ Q(
     "svg",
     {
-      height: s,
-      width: s,
-      viewBox: `0 0 ${R} ${R}`,
-      ref: c,
+      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__ */ w("path", { fill: f, d: `M0,0 h${R}v${R}H0z` }),
-        /* @__PURE__ */ w(
-          It,
-          {
-            modules: M,
-            margin: p,
-            settings: t
-          }
-        ),
-        /* @__PURE__ */ w(
-          wt,
-          {
-            modules: M,
-            margin: p,
-            settings: o
-          }
-        ),
-        /* @__PURE__ */ w(Ct, { modules: M, margin: p, settings: n }),
+        /* @__PURE__ */ N(bt, { gradient: d }),
+        /* @__PURE__ */ N(Et, { background: l, numCells: E }),
+        /* @__PURE__ */ N(Dt, { settings: o, ...w }),
+        /* @__PURE__ */ N(Ut, { settings: n, ...w }),
+        /* @__PURE__ */ N(Ft, { settings: i, ...w }),
         A
       ]
     }
   );
 };
-Ot.displayName = "ReactQRCode";
+Yt.displayName = "ReactQRCode";
 export {
-  Ot as ReactQRCode
+  Yt as ReactQRCode
 };