@lglab/react-qr-code 1.0.0 → 1.1.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 I, jsxs as Z } from "react/jsx-runtime";
+import { useMemo as T, useCallback as K, useRef as V, useImperativeHandle as _ } from "react";
 /**
  * @license QR Code generator library (TypeScript)
  * Copyright (c) Project Nayuki.
  * SPDX-License-Identifier: MIT
  */
-var T;
+var L;
 ((r) => {
-  const l = class l {
+  const c = class c {
     /*-- 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, n, o, i) {
+      if (this.version = e, this.errorCorrectionLevel = n, this.modules = [], this.isFunction = [], e < c.MIN_VERSION || e > c.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 u = 0; u < this.size; u++)
         h.push(!1);
-      for (let d = 0; d < this.size; d++)
+      for (let u = 0; u < this.size; u++)
         this.modules.push(h.slice()), this.isFunction.push(h.slice());
       this.drawFunctionPatterns();
-      const p = this.addEccAndInterleave(n);
+      const p = this.addEccAndInterleave(o);
       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);
+        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);
         }
       }
-      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, n) {
+      const o = r.QrSegment.makeSegments(e);
+      return c.encodeSegments(o, n);
     }
     // 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, n) {
+      const o = r.QrSegment.makeBytes(e);
+      return c.encodeSegments([o], n);
     }
     /*-- 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, n, o = 1, i = 40, h = -1, p = !0) {
+      if (!(c.MIN_VERSION <= o && o <= i && i <= c.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 u, M;
+      for (u = o; ; u++) {
+        const g = c.getNumDataCodewords(u, n) * 8, R = d.getTotalBits(e, u);
+        if (R <= g) {
+          M = R;
           break;
         }
-        if (d >= i)
+        if (u >= 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 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);
       }
-      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);
+      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 < u.length; )
+      for (; A.length * 8 < f.length; )
         A.push(0);
-      return u.forEach((m, g) => A[g >>> 3] |= m << 7 - (g & 7)), new l(d, o, A, h);
+      return f.forEach((g, R) => A[R >>> 3] |= g << 7 - (R & 7)), new c(u, n, A, 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, n) {
+      return 0 <= e && e < this.size && 0 <= n && n < this.size && this.modules[n][e];
     }
     // Modified to expose modules for easy access
     getModules() {
@@ -109,24 +109,24 @@ var T;
     /*-- Private helper methods for constructor: Drawing function modules --*/
     // Reads this object's version field, and draws and marks all function modules.
     drawFunctionPatterns() {
-      for (let n = 0; n < this.size; n++)
-        this.setFunctionModule(6, n, n % 2 == 0), this.setFunctionModule(n, 6, n % 2 == 0);
+      for (let o = 0; o < this.size; o++)
+        this.setFunctionModule(6, o, o % 2 == 0), this.setFunctionModule(o, 6, o % 2 == 0);
       this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
-      const t = this.getAlignmentPatternPositions(), o = t.length;
-      for (let n = 0; n < o; n++)
-        for (let 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]);
+      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]);
       this.drawFormatBits(0), this.drawVersion();
     }
     // Draws two copies of the format bits (with its own error correction code)
     // based on the given mask and this object's error correction level field.
-    drawFormatBits(t) {
-      const o = this.errorCorrectionLevel.formatBits << 3 | t;
-      let n = o;
+    drawFormatBits(e) {
+      const n = this.errorCorrectionLevel.formatBits << 3 | e;
+      let o = n;
       for (let h = 0; h < 10; h++)
-        n = n << 1 ^ (n >>> 9) * 1335;
-      const i = (o << 10 | n) ^ 21522;
-      e(i >>> 15 == 0);
+        o = o << 1 ^ (o >>> 9) * 1335;
+      const i = (n << 10 | o) ^ 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));
@@ -143,144 +143,144 @@ var T;
     drawVersion() {
       if (this.version < 7)
         return;
-      let t = this.version;
-      for (let n = 0; n < 12; n++)
-        t = t << 1 ^ (t >>> 11) * 7973;
-      const o = this.version << 12 | t;
-      e(o >>> 18 == 0);
-      for (let n = 0; n < 18; n++) {
-        const i = s(o, n), h = this.size - 11 + n % 3, p = Math.floor(n / 3);
+      let e = this.version;
+      for (let o = 0; o < 12; o++)
+        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);
       }
     }
     // Draws a 9*9 finder pattern including the border separator,
     // with the center module at (x, y). Modules can be out of bounds.
-    drawFinderPattern(t, o) {
-      for (let n = -4; n <= 4; n++)
+    drawFinderPattern(e, n) {
+      for (let o = -4; o <= 4; o++)
         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(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);
         }
     }
     // Draws a 5*5 alignment pattern, with the center module
     // at (x, y). All modules must be in bounds.
-    drawAlignmentPattern(t, o) {
-      for (let n = -2; n <= 2; n++)
+    drawAlignmentPattern(e, n) {
+      for (let o = -2; o <= 2; o++)
         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, n + o, Math.max(Math.abs(i), Math.abs(o)) != 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, n, o) {
+      this.modules[n][e] = o, this.isFunction[n][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) {
-      const o = this.version, n = this.errorCorrectionLevel;
-      if (t.length != l.getNumDataCodewords(o, n))
+    addEccAndInterleave(e) {
+      const n = this.version, o = this.errorCorrectionLevel;
+      if (e.length != c.getNumDataCodewords(n, o))
         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 = 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));
       }
       let A = [];
-      for (let m = 0; m < u[0].length; m++)
-        u.forEach((g, N) => {
-          (m != R - h || N >= d) && A.push(g[m]);
+      for (let g = 0; g < f[0].length; g++)
+        f.forEach((R, w) => {
+          (g != M - h || w >= u) && A.push(R[g]);
         });
-      return e(A.length == p), A;
+      return t(A.length == p), A;
     }
     // 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(c.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);
+      let n = 0;
+      for (let o = this.size - 1; o >= 1; o -= 2) {
+        o == 6 && (o = 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 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++);
           }
       }
-      e(o == t.length * 8);
+      t(n == e.length * 8);
     }
     // XORs the codeword modules in this QR Code with the given mask pattern.
     // The function modules must be marked and the codeword bits must be drawn
     // 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++) {
+      for (let n = 0; n < this.size; n++)
+        for (let o = 0; o < this.size; o++) {
           let i;
-          switch (t) {
+          switch (e) {
             case 0:
-              i = (n + o) % 2 == 0;
+              i = (o + n) % 2 == 0;
               break;
             case 1:
-              i = o % 2 == 0;
+              i = n % 2 == 0;
               break;
             case 2:
-              i = n % 3 == 0;
+              i = o % 3 == 0;
               break;
             case 3:
-              i = (n + o) % 3 == 0;
+              i = (o + n) % 3 == 0;
               break;
             case 4:
-              i = (Math.floor(n / 3) + Math.floor(o / 2)) % 2 == 0;
+              i = (Math.floor(o / 3) + Math.floor(n / 2)) % 2 == 0;
               break;
             case 5:
-              i = n * o % 2 + n * o % 3 == 0;
+              i = o * n % 2 + o * n % 3 == 0;
               break;
             case 6:
-              i = (n * o % 2 + n * o % 3) % 2 == 0;
+              i = (o * n % 2 + o * n % 3) % 2 == 0;
               break;
             case 7:
-              i = ((n + o) % 2 + n * o % 3) % 2 == 0;
+              i = ((o + n) % 2 + o * n % 3) % 2 == 0;
               break;
             default:
               throw new Error("Unreachable");
           }
-          !this.isFunction[o][n] && i && (this.modules[o][n] = !this.modules[o][n]);
+          !this.isFunction[n][o] && i && (this.modules[n][o] = !this.modules[n][o]);
         }
     }
     // 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 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;
       }
       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 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;
       }
       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);
+          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);
         }
-      let o = 0;
+      let n = 0;
       for (const h of this.modules)
-        o = h.reduce((p, d) => p + (d ? 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;
+        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;
     }
     /*-- Private helper functions --*/
     // Returns an ascending list of positions of alignment patterns for this version number.
@@ -290,86 +290,86 @@ 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;
-        let n = [6];
-        for (let i = this.size - 7; n.length < t; i -= o)
-          n.splice(1, 0, i);
-        return n;
+        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;
       }
     }
     // 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 < c.MIN_VERSION || e > c.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 n = (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);
       }
-      return e(208 <= o && o <= 29648), o;
+      return t(208 <= n && n <= 29648), n;
     }
     // Returns the number of 8-bit data (i.e. not error correction) codewords contained in any
     // QR Code of the given version number and error correction level, with remainder bits discarded.
     // 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, n) {
+      return Math.floor(c.getNumRawDataModules(e) / 8) - c.ECC_CODEWORDS_PER_BLOCK[n.ordinal][e] * c.NUM_ERROR_CORRECTION_BLOCKS[n.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++)
-        o.push(0);
-      o.push(1);
-      let n = 1;
-      for (let i = 0; i < t; 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);
+      let n = [];
+      for (let i = 0; i < e - 1; i++)
+        n.push(0);
+      n.push(1);
+      let o = 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);
       }
-      return o;
+      return n;
     }
     // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static reedSolomonComputeRemainder(t, o) {
-      let n = o.map((i) => 0);
-      for (const i of t) {
-        const h = i ^ n.shift();
-        n.push(0), o.forEach((p, d) => n[d] ^= l.reedSolomonMultiply(p, h));
+    static reedSolomonComputeRemainder(e, n) {
+      let o = n.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));
       }
-      return n;
+      return o;
     }
     // 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, n) {
+      if (e >>> 8 || n >>> 8)
         throw new RangeError("Byte out of range");
-      let n = 0;
+      let o = 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;
+        o = o << 1 ^ (o >>> 7) * 285, o ^= (n >>> i & 1) * e;
+      return t(o >>> 8 == 0), o;
     }
     // 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 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);
     }
     // 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, n, o) {
+      return e && (this.finderPenaltyAddHistory(n, o), n = 0), n += this.size, this.finderPenaltyAddHistory(n, o), this.finderPenaltyCountPatterns(o);
     }
     // 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, n) {
+      n[0] == 0 && (e += this.size), n.pop(), n.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 = [
+  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 = [
     // 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 = [
+  ], c.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,19 +392,19 @@ 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 a = c;
+  r.QrCode = a;
+  function l(m, e, n) {
+    if (e < 0 || e > 31 || m >>> e)
       throw new RangeError("Value out of range");
-    for (let n = t - 1; n >= 0; n--)
-      o.push(E >>> n & 1);
+    for (let o = e - 1; o >= 0; o--)
+      n.push(m >>> o & 1);
   }
-  function s(E, t) {
-    return (E >>> t & 1) != 0;
+  function s(m, e) {
+    return (m >>> e & 1) != 0;
   }
-  function e(E) {
-    if (!E)
+  function t(m) {
+    if (!m)
       throw new Error("Assertion error");
   }
   const $ = class $ {
@@ -412,76 +412,76 @@ var T;
     // 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, n, o) {
+      if (this.mode = e, this.numChars = n, this.bitData = o, n < 0)
         throw new RangeError("Invalid argument");
-      this.bitData = n.slice();
+      this.bitData = o.slice();
     }
     /*-- Static factory functions (mid level) --*/
     // Returns a segment representing the given binary data encoded in
     // byte mode. All input byte arrays are acceptable. Any text string
     // can be converted to UTF-8 bytes and encoded as a byte mode segment.
-    static makeBytes(t) {
-      let o = [];
-      for (const n of t)
-        a(n, 8, o);
-      return new $($.Mode.BYTE, t.length, o);
+    static makeBytes(e) {
+      let n = [];
+      for (const o of e)
+        l(o, 8, n);
+      return new $($.Mode.BYTE, e.length, n);
     }
     // Returns a segment representing the given string of decimal digits encoded in numeric mode.
-    static makeNumeric(t) {
-      if (!$.isNumeric(t))
+    static makeNumeric(e) {
+      if (!$.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;
+      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;
       }
-      return new $($.Mode.NUMERIC, t.length, o);
+      return new $($.Mode.NUMERIC, e.length, n);
     }
     // Returns a segment representing the given text string encoded in alphanumeric mode.
     // The characters allowed are: 0 to 9, A to Z (uppercase only), space,
     // dollar, percent, asterisk, plus, hyphen, period, slash, colon.
-    static makeAlphanumeric(t) {
-      if (!$.isAlphanumeric(t))
+    static makeAlphanumeric(e) {
+      if (!$.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);
+      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);
       }
-      return n < t.length && a($.ALPHANUMERIC_CHARSET.indexOf(t.charAt(n)), 6, o), new $($.Mode.ALPHANUMERIC, t.length, o);
+      return o < e.length && l($.ALPHANUMERIC_CHARSET.indexOf(e.charAt(o)), 6, n), new $($.Mode.ALPHANUMERIC, e.length, n);
     }
     // Returns a new mutable list of zero or more segments to represent the given Unicode text string.
     // The result may use various segment modes and switch modes to optimize the length of the bit stream.
-    static makeSegments(t) {
-      return t == "" ? [] : $.isNumeric(t) ? [$.makeNumeric(t)] : $.isAlphanumeric(t) ? [$.makeAlphanumeric(t)] : [$.makeBytes($.toUtf8ByteArray(t))];
+    static makeSegments(e) {
+      return e == "" ? [] : $.isNumeric(e) ? [$.makeNumeric(e)] : $.isAlphanumeric(e) ? [$.makeAlphanumeric(e)] : [$.makeBytes($.toUtf8ByteArray(e))];
     }
     // Returns a segment representing an Extended Channel Interpretation
     // (ECI) designator with the given assignment value.
-    static makeEci(t) {
-      let o = [];
-      if (t < 0)
+    static makeEci(e) {
+      let n = [];
+      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)
+        l(e, 8, n);
+      else if (e < 16384)
+        l(2, 2, n), l(e, 14, n);
+      else if (e < 1e6)
+        l(6, 3, n), l(e, 21, n);
       else
         throw new RangeError("ECI assignment value out of range");
-      return new $($.Mode.ECI, 0, o);
+      return new $($.Mode.ECI, 0, n);
     }
     // Tests whether the given string can be encoded as a segment in numeric mode.
     // A string is encodable iff each character is in the range 0 to 9.
-    static isNumeric(t) {
-      return $.NUMERIC_REGEX.test(t);
+    static isNumeric(e) {
+      return $.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 $.ALPHANUMERIC_REGEX.test(e);
     }
     /*-- Methods --*/
     // Returns a new copy of the data bits of this segment.
@@ -490,68 +490,68 @@ 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) {
-      let n = 0;
-      for (const i of t) {
-        const h = i.mode.numCharCountBits(o);
+    static getTotalBits(e, n) {
+      let o = 0;
+      for (const i of e) {
+        const h = i.mode.numCharCountBits(n);
         if (i.numChars >= 1 << h)
           return 1 / 0;
-        n += 4 + h + i.bitData.length;
+        o += 4 + h + i.bitData.length;
       }
-      return n;
+      return o;
     }
     // Returns a new array of bytes representing the given string encoded in UTF-8.
-    static toUtf8ByteArray(t) {
-      t = encodeURI(t);
-      let o = [];
-      for (let n = 0; n < t.length; n++)
-        t.charAt(n) != "%" ? o.push(t.charCodeAt(n)) : (o.push(parseInt(t.substring(n + 1, n + 3), 16)), n += 2);
-      return o;
+    static toUtf8ByteArray(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;
     }
   };
   $.NUMERIC_REGEX = /^[0-9]*$/, $.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, $.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-  let f = $;
-  r.QrSegment = f;
-})(T || (T = {}));
+  let d = $;
+  r.QrSegment = d;
+})(L || (L = {}));
 ((r) => {
-  ((c) => {
+  ((a) => {
     const s = class s {
       // The QR Code can tolerate about 30% erroneous codewords
       /*-- Constructor and fields --*/
-      constructor(f, l) {
-        this.ordinal = f, this.formatBits = l;
+      constructor(d, c) {
+        this.ordinal = d, this.formatBits = c;
       }
     };
     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;
+    let l = s;
+    a.Ecc = l;
   })(r.QrCode || (r.QrCode = {}));
-})(T || (T = {}));
+})(L || (L = {}));
 ((r) => {
-  ((c) => {
+  ((a) => {
     const s = class s {
       /*-- Constructor and fields --*/
-      constructor(f, l) {
-        this.modeBits = f, this.numBitsCharCount = l;
+      constructor(d, c) {
+        this.modeBits = d, this.numBitsCharCount = c;
       }
       /*-- 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(d) {
+        return this.numBitsCharCount[Math.floor((d + 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;
+    let l = s;
+    a.Mode = l;
   })(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 = [
+})(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 = [
   [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 = {
+], X = {
   "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 = {
+}, U = {
   "rounded-sm": 3,
   rounded: 4,
   "rounded-lg": 5,
@@ -582,7 +582,7 @@ const F = T, _ = {
   "outpoint-sm": 3,
   outpoint: 4,
   "outpoint-lg": 5
-}, U = {
+}, B = {
   square: 0,
   diamond: 0,
   circle: 3,
@@ -598,7 +598,7 @@ const F = T, _ = {
   "outpoint-sm": 1.5,
   outpoint: 2,
   "outpoint-lg": 2.3
-}, v = [
+}, F = [
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 0, 0, 0, 0, 0],
   [0, 0, 1, 1, 1, 0, 0],
@@ -606,120 +606,120 @@ 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) => {
+], lt = (r) => r === "square" || r === "circle" || r === "star" || r === "heart" || r === "diamond", v = (r, a, l) => {
   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]
+    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]
   };
   return {
     ...s,
     count: Object.values(s).filter(Boolean).length
   };
-}, 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} 
+}, 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, c) => `M ${r + 1} ${c} 
+   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, c) => `M ${r} ${c} 
+   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`, ct = (r, c) => `M ${r + 1} ${c} 
+   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, c) => `M ${r} ${c} 
+   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, c) => `M ${r + 1} ${c} 
+   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`, q = (r, c) => `M ${r} ${c + 1} 
+   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`, G = (r, c) => `M ${r} ${c} 
+   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`, 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 = ({
+   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: c,
-  numCells: a
+  y: a,
+  numCells: l
 }) => {
-  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 = ({
+  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: c,
-  radius: a
+  y: a,
+  radius: l
 }) => {
-  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 = ({
+  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: c,
-  radius: a
+  y: a,
+  radius: l
 }) => {
-  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 = ({
+  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: c,
-  numCells: a
+  y: a,
+  numCells: l
 }) => {
-  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 = ({
+  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: c,
-  radius: a
+  y: a,
+  radius: l
 }) => {
-  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 = ({
+  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: c,
-  radius: a
+  y: a,
+  radius: l
 }) => {
-  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 = ({
+  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: c,
-  radius: a
+  y: a,
+  radius: l
 }) => {
-  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,
+  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
-}), 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+$/;
+}), 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(At, "");
+  return r.toFixed(7).replace(Ct, "");
 }
-const K = (r, c, a, s) => {
-  const e = a / 2, f = e / 2, l = Math.PI / s;
+const G = (r, a, l, s) => {
+  const t = l / 2, d = t / 2, c = 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} `;
+  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} `;
   }
   return $ + "Z";
-}, Q = (r, c, a) => {
-  let s = !1, e = 0;
+}, Q = (r, a, l) => {
+  let s = !1, t = 0;
   return [
     "M",
     1,
@@ -831,104 +831,104 @@ 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(" ");
-}, Ct = ({
+  ].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 = ({
   modules: r,
-  margin: c,
-  settings: a
+  margin: a,
+  settings: l
 }) => {
-  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: s, style: t, randomSize: d } = T(
+    () => Rt(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: $ }))
         return;
-      const p = t(), d = 1 * p, R = (1 - 1 * p) / 2, u = h + c + R, M = n + c + R;
+      const p = e(), u = 1 * p, M = (1 - 1 * p) / 2, f = h + a + M, E = o + a + M;
       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)
+        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)
           );
-        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 (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));
             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 !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));
         }
       }
     });
-  }), /* @__PURE__ */ w(
+  }), /* @__PURE__ */ I(
     "path",
     {
       fill: s,
-      d: l.join(""),
-      shapeRendering: e === "square" ? "crispEdges" : "geometricPrecision"
+      d: c.join(""),
+      shapeRendering: t === "square" ? "crispEdges" : "geometricPrecision"
     }
   );
-}, wt = ({
+}, Pt = ({
   modules: r,
-  margin: c,
-  settings: a
+  margin: a,
+  settings: l
 }) => {
-  const { color: s, style: e } = S(
-    () => gt(a),
-    [a]
-  ), f = S(
+  const { color: s, style: t } = T(
+    () => At(l),
+    [l]
+  ), d = T(
     () => [
-      { x: c + 2, y: c + 2 },
-      { x: r.length - c + 1, y: c + 2 },
-      { x: c + 2, y: r.length - c + 1 }
+      { x: a + 2, y: a + 2 },
+      { x: r.length + a - C + 2, y: a + 2 },
+      { x: a + 2, y: r.length + a - C + 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(
+    [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(
         "rect",
         {
-          x: E,
-          y: t,
+          x: m,
+          y: e,
           width: P,
           height: P,
           fill: s,
-          rx: U[e]
+          rx: B[t]
         },
-        l(E, t)
+        c(m, e)
       );
     });
-  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 (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(
         "rect",
         {
-          x: E + i / 2,
-          y: t + i / 2,
-          width: n,
-          height: n,
+          x: m + i / 2,
+          y: e + i / 2,
+          width: o,
+          height: o,
           fill: s,
           style: {
             transform: "rotate(45deg)",
@@ -936,217 +936,275 @@ const K = (r, c, a, s) => {
             transformBox: "fill-box"
           }
         },
-        l(E, t)
+        c(m, e)
       );
     });
-  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 (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]
       });
-      return /* @__PURE__ */ w(
+      return /* @__PURE__ */ I(
         "path",
         {
           fill: s,
-          d: n,
+          d: o,
           style: {
-            transform: `rotate(${o}deg)`,
+            transform: `rotate(${n}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           }
         },
-        l(E, t)
+        c(m, e)
       );
     });
   }
-  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 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;
-}, It = ({
+}, Tt = ({
   modules: r,
-  margin: c,
-  settings: a
+  margin: a,
+  settings: l
 }) => {
-  const { style: s, color: e } = S(
-    () => Rt(a),
-    [a]
-  ), f = [], l = S(
+  const { style: s, color: t } = T(
+    () => wt(l),
+    [l]
+  ), d = [], c = T(
     () => [
-      { x: c, y: c },
-      { x: r.length - c - 1, y: c },
-      { x: c, y: r.length - c - 1 }
+      { x: a, y: a },
+      { x: r.length + a - C, y: a },
+      { x: a, y: r.length + a - C }
     ],
-    [c, r.length]
+    [a, r.length]
   );
-  if (["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 (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]
         })
-      ) : 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`
+      ) : 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`
       );
     }
-    return /* @__PURE__ */ w("path", { fill: e, d: f.join("") });
+    return /* @__PURE__ */ I("path", { fill: t, d: d.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]
+    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]
       });
-      return /* @__PURE__ */ w(
+      return /* @__PURE__ */ I(
         "path",
         {
-          fill: e,
-          d: n,
+          fill: t,
+          d: o,
           style: {
-            transform: `rotate(${o}deg)`,
+            transform: `rotate(${n}deg)`,
             transformOrigin: "center",
             transformBox: "fill-box"
           }
         },
-        `finder-patterns-outer-${s}-${E}-${t}`
+        `finder-patterns-outer-${s}-${m}-${e}`
       );
     });
   }
   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) => {
+}, 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)
     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 + 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;
   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 };
+    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 };
   }
   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 = ({
+  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 = ({
   value: r,
-  level: c,
-  minVersion: a,
+  level: a,
+  minVersion: l,
   marginSize: s,
-  imageSettings: e,
-  size: f,
-  boostLevel: l
+  imageSettings: t,
+  size: d,
+  boostLevel: c
 }) => {
-  const $ = S(() => {
-    const h = (Array.isArray(r) ? r : [r]).reduce((p, d) => (p.push(...F.QrSegment.makeSegments(d)), p), []);
-    return F.QrCode.encodeSegments(
+  const $ = T(() => {
+    const h = (Array.isArray(r) ? r : [r]).reduce((p, u) => (p.push(...b.QrSegment.makeSegments(u)), p), []);
+    return b.QrCode.encodeSegments(
       h,
-      _[c],
-      a,
+      W[a],
+      l,
       void 0,
       void 0,
-      l
+      c
     );
-  }, [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, 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);
     return {
       cells: i,
       margin: h,
       numCells: p,
-      calculatedImageSettings: d
+      calculatedImageSettings: u
     };
-  }, [$, f, e, s]);
+  }, [$, d, t, s]);
   return {
     qrcode: $,
-    margin: t,
-    cells: E,
-    numCells: o,
-    calculatedImageSettings: n
+    margin: e,
+    cells: m,
+    numCells: n,
+    calculatedImageSettings: o
   };
-}, Ot = (r) => {
+}, St = ({ svgRef: r, fileSize: a, 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)], {
+    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 = ({
+  svgRef: r,
+  fileSize: a,
+  fileName: l,
+  fileFormat: s,
+  imageSettings: t,
+  calculatedImageSettings: d,
+  size: c,
+  numCells: $,
+  margin: m
+}) => {
+  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);
+    } 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);
+    }
+  }, p.onerror = (u) => console.error("Error loading QR code:", u);
+}, Ft = (r) => {
   const {
-    ref: c,
-    value: a,
-    size: s = V,
-    level: e = W,
-    bgColor: f = J,
-    minVersion: l = tt,
+    ref: a,
+    value: l,
+    size: s = J,
+    level: t = tt,
+    bgColor: d = et,
+    minVersion: c = ot,
     boostLevel: $,
-    marginSize: E,
-    finderPatternOuterSettings: t,
-    finderPatternInnerSettings: o,
-    dataModulesSettings: n,
+    marginSize: m,
+    finderPatternOuterSettings: e,
+    finderPatternInnerSettings: n,
+    dataModulesSettings: o,
     imageSettings: i,
     svgProps: h
-  } = r, { margin: p, cells: d, numCells: R, calculatedImageSettings: u } = Ft({
-    value: a,
-    level: e,
-    minVersion: l,
+  } = r, p = V(null), { margin: u, cells: M, numCells: f, calculatedImageSettings: E } = vt({
+    value: l,
+    level: t,
+    minVersion: c,
     boostLevel: $,
-    marginSize: E,
+    marginSize: m,
     imageSettings: i,
     size: s
   });
-  let M = d, A = null;
-  return i != null && u != null && (u.excavation != null && (M = Pt(d, u.excavation)), A = /* @__PURE__ */ w(
+  _(a, () => ({
+    svg: p.current,
+    download: ({
+      name: R = "qr-code",
+      format: w = "svg",
+      size: N = 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
+      }));
+    }
+  }));
+  let A = M, g = null;
+  return i != null && E != null && (E.excavation != null && (A = Lt(M, E.excavation)), g = /* @__PURE__ */ I(
     "image",
     {
       href: i.src,
-      height: u.h,
-      width: u.w,
-      x: u.x + p,
-      y: u.y + p,
+      height: E.h,
+      width: E.w,
+      x: E.x + u,
+      y: E.y + u,
       preserveAspectRatio: "none",
-      opacity: u.opacity,
-      crossOrigin: u.crossOrigin
+      opacity: E.opacity,
+      crossOrigin: E.crossOrigin
     }
-  )), /* @__PURE__ */ j(
+  )), /* @__PURE__ */ Z(
     "svg",
     {
       height: s,
       width: s,
-      viewBox: `0 0 ${R} ${R}`,
-      ref: c,
+      viewBox: `0 0 ${f} ${f}`,
+      ref: p,
       role: "img",
       "aria-label": (h == null ? void 0 : h["aria-label"]) || "QR Code",
       ...h,
       children: [
-        /* @__PURE__ */ w("path", { fill: f, d: `M0,0 h${R}v${R}H0z` }),
-        /* @__PURE__ */ w(
-          It,
+        /* @__PURE__ */ I("path", { fill: d, d: `M0,0 h${f}v${f}H0z` }),
+        /* @__PURE__ */ I(
+          Tt,
           {
-            modules: M,
-            margin: p,
-            settings: t
+            modules: A,
+            margin: u,
+            settings: e
           }
         ),
-        /* @__PURE__ */ w(
-          wt,
+        /* @__PURE__ */ I(
+          Pt,
           {
-            modules: M,
-            margin: p,
-            settings: o
+            modules: A,
+            margin: u,
+            settings: n
           }
         ),
-        /* @__PURE__ */ w(Ct, { modules: M, margin: p, settings: n }),
-        A
+        /* @__PURE__ */ I(It, { modules: A, margin: u, settings: o }),
+        g
       ]
     }
   );
 };
-Ot.displayName = "ReactQRCode";
+Ft.displayName = "ReactQRCode";
 export {
-  Ot as ReactQRCode
+  Ft as ReactQRCode
 };