@lglab/react-qr-code 1.4.9 → 1.5.0

package/dist/index.es.js

@@ -1,1342 +1,1709 @@
-import { jsx as C, jsxs as K, Fragment as rt } from "react/jsx-runtime";
-import { useMemo as L, useCallback as it, useId as at, forwardRef as ct, useRef as lt, useImperativeHandle as ht } from "react";
-const ut = /\.?0+$/;
-function dt(s) {
-  return s.toFixed(7).replace(ut, "");
+import { forwardRef as e, useCallback as t, useId as n, useImperativeHandle as r, useMemo as i, useRef as a } from "react";
+import { Fragment as o, jsx as s, jsxs as c } from "react/jsx-runtime";
+//#region src/utils/svg.ts
+var l = /\.?0+$/;
+function u(e) {
+	return e.toFixed(7).replace(l, "");
 }
-const W = (s) => {
-  const a = s % 360 * (Math.PI / 180), c = Math.max(0, Math.min(100, 50 - 50 * Math.cos(a))), i = Math.max(0, Math.min(100, 50 - 50 * Math.sin(a))), o = Math.max(0, Math.min(100, 50 + 50 * Math.cos(a))), u = Math.max(0, Math.min(100, 50 + 50 * Math.sin(a)));
-  return {
-    x1: `${c}%`,
-    y1: `${i}%`,
-    x2: `${o}%`,
-    y2: `${u}%`
-  };
-}, J = (s, a, c, i) => {
-  const o = c / 2, u = o / 2, l = Math.PI / i;
-  let m = "";
-  for (let f = 0; f < 2 * i; f++) {
-    const e = f * l - Math.PI / 2, n = f % 2 === 0 ? o : u, t = s + n * Math.cos(e), r = a + n * Math.sin(e);
-    m += `${f === 0 ? "M" : "L"} ${t},${r} `;
-  }
-  return m + "Z";
-}, tt = (s, a, c, i) => `M ${s} ${a}Q ${s + i} ${a + c / 2}, ${s} ${a + c}Q ${s + c / 2} ${a + c - i}, ${s + c} ${a + c}Q ${s + c - i} ${a + c / 2}, ${s + c} ${a}Q ${s + c / 2} ${a + i}, ${s} ${a}Z`, et = (s, a, c) => {
-  const i = c / 8;
-  return `M ${s + c} ${a + i * 3} 
-   V ${a + i}
-   h -${i}
-   V ${a}
-   H ${s + i * 5}
-   v ${i}
-   H ${s + i * 3}
-   V ${a}
-   H ${s + i}
-   v ${i}
-   H ${s}
-   v ${i * 2}
-   h ${i}
-   v ${i * 2}
-   H ${s}
-   v ${i * 2}
-   h ${i}
-   v ${i}
-   h ${i * 2}
-   v -${i}
-   h ${i * 2}
-   v ${i}
-   h ${i * 2}
-   v -${i}
-   h ${i}
-   V ${a + i * 5}
-   h -${i}
-   V ${a + i * 3}
-   h ${i}
+var d = (e) => {
+	let t = e % 360 * (Math.PI / 180), n = Math.max(0, Math.min(100, 50 - 50 * Math.cos(t))), r = Math.max(0, Math.min(100, 50 - 50 * Math.sin(t))), i = Math.max(0, Math.min(100, 50 + 50 * Math.cos(t))), a = Math.max(0, Math.min(100, 50 + 50 * Math.sin(t)));
+	return {
+		x1: `${n}%`,
+		y1: `${r}%`,
+		x2: `${i}%`,
+		y2: `${a}%`
+	};
+}, f = (e, t, n, r) => {
+	let i = n / 2, a = i / 2, o = Math.PI / r, s = "";
+	for (let n = 0; n < 2 * r; n++) {
+		let r = n * o - Math.PI / 2, c = n % 2 == 0 ? i : a, l = e + c * Math.cos(r), u = t + c * Math.sin(r);
+		s += `${n === 0 ? "M" : "L"} ${l},${u} `;
+	}
+	return s + "Z";
+}, p = (e, t, n, r) => `M ${e} ${t}Q ${e + r} ${t + n / 2}, ${e} ${t + n}Q ${e + n / 2} ${t + n - r}, ${e + n} ${t + n}Q ${e + n - r} ${t + n / 2}, ${e + n} ${t}Q ${e + n / 2} ${t + r}, ${e} ${t}Z`, m = .15, h = .1, g = .7, _ = 4, v = (e, t, n) => {
+	let r = n * m, i = n * h, a = n - r * 2, o = `M${e},${t + r}h${n}v${a}h${-n}Z`, s = n * g, c = e + (n - s) / 2, l = (s - i) / (_ - 1);
+	return o + Array.from({ length: _ }, (e, a) => {
+		let o = c + l * a;
+		return `M${o},${t}h${i}v${r}h${-i}ZM${o},${t + n - r}h${i}v${r}h${-i}Z`;
+	}).join("");
+}, y = (e, t, n) => {
+	let r = n / 8;
+	return `M ${e + n} ${t + r * 3} 
+   V ${t + r}
+   h -${r}
+   V ${t}
+   H ${e + r * 5}
+   v ${r}
+   H ${e + r * 3}
+   V ${t}
+   H ${e + r}
+   v ${r}
+   H ${e}
+   v ${r * 2}
+   h ${r}
+   v ${r * 2}
+   H ${e}
+   v ${r * 2}
+   h ${r}
+   v ${r}
+   h ${r * 2}
+   v -${r}
+   h ${r * 2}
+   v ${r}
+   h ${r * 2}
+   v -${r}
+   h ${r}
+   V ${t + r * 5}
+   h -${r}
+   V ${t + r * 3}
+   h ${r}
    Z`;
-}, nt = (s, a, c) => {
-  let i = !1, o = 0;
-  return [
-    "M",
-    1,
-    0.3262506,
-    "c",
-    0,
-    0.0383376,
-    -64626e-7,
-    0.0758377,
-    -0.0193751,
-    0.1125001,
-    "s",
-    -0.0356247,
-    0.076875,
-    -0.0681248,
-    0.1206252,
-    "c",
-    -0.0325,
-    0.0437499,
-    -0.0762503,
-    0.0931247,
-    -0.1312501,
-    0.1481249,
-    "C",
-    0.7262502,
-    0.7625008,
-    0.6566626,
-    0.8279132,
-    0.5724999,
-    0.9037505,
-    "L",
-    0.5,
-    0.9687506,
-    "L",
-    0.4275001,
-    0.9037505,
-    "C",
-    0.3433374,
-    0.8279132,
-    0.2737499,
-    0.7625005,
-    0.21875,
-    0.7075007,
-    "C",
-    0.1637501,
-    0.6525008,
-    0.1199999,
-    0.6031258,
-    0.0874999,
-    0.5593758,
-    "S",
-    0.0322876,
-    0.4754133,
-    0.0193751,
-    0.4387506,
-    "S",
-    0,
-    0.3645881,
-    0,
-    0.3262506,
-    "c",
-    0,
-    -0.0783374,
-    0.0262499,
-    -0.1437498,
-    0.07875,
-    -0.1962499,
-    "s",
-    0.1179124,
-    -0.07875,
-    0.1962499,
-    -0.07875,
-    "c",
-    0.0433376,
-    0,
-    0.0845875,
-    91625e-7,
-    0.12375,
-    0.0274999,
-    "S",
-    0.4716623,
-    0.1229131,
-    0.5,
-    0.1562506,
-    "c",
-    0.0283374,
-    -0.0333375,
-    0.0620874,
-    -0.0591625,
-    0.1012502,
-    -0.0775,
-    "c",
-    0.0391627,
-    -0.0183375,
-    0.0804126,
-    -0.0274999,
-    0.12375,
-    -0.0274999,
-    "c",
-    0.0783374,
-    0,
-    0.1437497,
-    0.0262499,
-    0.1962501,
-    0.07875,
-    "S",
-    1,
-    0.2479131,
-    1,
-    0.3262506,
-    "z"
-  ].map((u) => typeof u == "string" ? (o = 0, i = u.toUpperCase() == u, u) : (o++, u = u * c, i && (u += o % 2 == 1 ? s : a), dt(u))).join(" ");
-}, k = {
-  "data-testid": "background"
-}, $t = ({ background: s, bgGradientId: a, numCells: c }) => {
-  if (!s)
-    return null;
-  if (typeof s == "string")
-    return /* @__PURE__ */ C("path", { fill: s, d: `M0,0 h${c}v${c}H0z`, ...k });
-  const i = W(s?.rotation || 0);
-  return /* @__PURE__ */ K(rt, { children: [
-    /* @__PURE__ */ C("defs", { children: s.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: a, gradientUnits: "userSpaceOnUse", ...i, children: s.stops?.map((o, u) => /* @__PURE__ */ C("stop", { offset: o.offset, stopColor: o.color }, u)) }) : /* @__PURE__ */ C(
-      "radialGradient",
-      {
-        id: a,
-        gradientUnits: "userSpaceOnUse",
-        cx: "50%",
-        cy: "50%",
-        r: "50%",
-        children: s.stops?.map((o, u) => /* @__PURE__ */ C("stop", { offset: o.offset, stopColor: o.color }, u))
-      }
-    ) }),
-    /* @__PURE__ */ C(
-      "path",
-      {
-        fill: `url(#${a})`,
-        d: `M0,0 h${c}v${c}H0z`,
-        ...k
-      }
-    )
-  ] });
-};
-var S;
-((s) => {
-  const l = class l {
-    /*-- Constructor (low level) and fields --*/
-    // Creates a new QR Code with the given version number,
-    // error correction level, data codeword bytes, and mask number.
-    // This is a low-level API that most users should not use directly.
-    // A mid-level API is the encodeSegments() function.
-    constructor(e, n, t, r) {
-      if (this.version = e, this.errorCorrectionLevel = n, this.modules = [], this.isFunction = [], e < l.MIN_VERSION || e > l.MAX_VERSION)
-        throw new RangeError("Version value out of range");
-      if (r < -1 || r > 7)
-        throw new RangeError("Mask value out of range");
-      this.size = e * 4 + 17;
-      let h = [];
-      for (let d = 0; d < this.size; d++)
-        h.push(!1);
-      for (let d = 0; d < this.size; d++)
-        this.modules.push(h.slice()), this.isFunction.push(h.slice());
-      this.drawFunctionPatterns();
-      const $ = this.addEccAndInterleave(t);
-      if (this.drawCodewords($), r == -1) {
-        let d = 1e9;
-        for (let M = 0; M < 8; M++) {
-          this.applyMask(M), this.drawFormatBits(M);
-          const g = this.getPenaltyScore();
-          g < d && (r = M, d = g), this.applyMask(M);
-        }
-      }
-      o(0 <= r && r <= 7), this.mask = r, this.applyMask(r), this.drawFormatBits(r), this.isFunction = [];
-    }
-    /*-- Static factory functions (high level) --*/
-    // Returns a QR Code representing the given Unicode text string at the given error correction level.
-    // As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer
-    // Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible
-    // QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the
-    // ecl argument if it can be done without increasing the version.
-    static encodeText(e, n) {
-      const t = s.QrSegment.makeSegments(e);
-      return l.encodeSegments(t, 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(e, n) {
-      const t = s.QrSegment.makeBytes(e);
-      return l.encodeSegments([t], n);
-    }
-    /*-- Static factory functions (mid level) --*/
-    // Returns a QR Code representing the given segments with the given encoding parameters.
-    // The smallest possible QR Code version within the given range is automatically
-    // chosen for the output. Iff boostEcl is true, then the ECC level of the result
-    // may be higher than the ecl argument if it can be done without increasing the
-    // version. The mask number is either between 0 to 7 (inclusive) to force that
-    // mask, or -1 to automatically choose an appropriate mask (which may be slow).
-    // This function allows the user to create a custom sequence of segments that switches
-    // between modes (such as alphanumeric and byte) to encode text in less space.
-    // This is a mid-level API; the high-level API is encodeText() and encodeBinary().
-    static encodeSegments(e, n, t = 1, r = 40, h = -1, $ = !0) {
-      if (!(l.MIN_VERSION <= t && t <= r && r <= l.MAX_VERSION) || h < -1 || h > 7)
-        throw new RangeError("Invalid value");
-      let d, M;
-      for (d = t; ; d++) {
-        const p = l.getNumDataCodewords(d, n) * 8, N = u.getTotalBits(e, d);
-        if (N <= p) {
-          M = N;
-          break;
-        }
-        if (d >= r)
-          throw new RangeError("Data too long");
-      }
-      for (const p of [l.Ecc.MEDIUM, l.Ecc.QUARTILE, l.Ecc.HIGH])
-        $ && M <= l.getNumDataCodewords(d, p) * 8 && (n = p);
-      let g = [];
-      for (const p of e) {
-        c(p.mode.modeBits, 4, g), c(p.numChars, p.mode.numCharCountBits(d), g);
-        for (const N of p.getData())
-          g.push(N);
-      }
-      o(g.length == M);
-      const A = l.getNumDataCodewords(d, n) * 8;
-      o(g.length <= A), c(0, Math.min(4, A - g.length), g), c(0, (8 - g.length % 8) % 8, g), o(g.length % 8 == 0);
-      for (let p = 236; g.length < A; p ^= 253)
-        c(p, 8, g);
-      let E = [];
-      for (; E.length * 8 < g.length; )
-        E.push(0);
-      return g.forEach((p, N) => E[N >>> 3] |= p << 7 - (N & 7)), new l(d, n, E, h);
-    }
-    /*-- Accessor methods --*/
-    // Returns the color of the module (pixel) at the given coordinates, which is false
-    // for light or true for dark. The top left corner has the coordinates (x=0, y=0).
-    // If the given coordinates are out of bounds, then false (light) is returned.
-    getModule(e, n) {
-      return 0 <= e && e < this.size && 0 <= n && n < this.size && this.modules[n][e];
-    }
-    // Modified to expose modules for easy access
-    getModules() {
-      return this.modules;
-    }
-    /*-- Private helper methods for constructor: Drawing function modules --*/
-    // Reads this object's version field, and draws and marks all function modules.
-    drawFunctionPatterns() {
-      for (let t = 0; t < this.size; t++)
-        this.setFunctionModule(6, t, t % 2 == 0), this.setFunctionModule(t, 6, t % 2 == 0);
-      this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
-      const e = this.getAlignmentPatternPositions(), n = e.length;
-      for (let t = 0; t < n; t++)
-        for (let r = 0; r < n; r++)
-          t == 0 && r == 0 || t == 0 && r == n - 1 || t == n - 1 && r == 0 || this.drawAlignmentPattern(e[t], e[r]);
-      this.drawFormatBits(0), this.drawVersion();
-    }
-    // Draws two copies of the format bits (with its own error correction code)
-    // based on the given mask and this object's error correction level field.
-    drawFormatBits(e) {
-      const n = this.errorCorrectionLevel.formatBits << 3 | e;
-      let t = n;
-      for (let h = 0; h < 10; h++)
-        t = t << 1 ^ (t >>> 9) * 1335;
-      const r = (n << 10 | t) ^ 21522;
-      o(r >>> 15 == 0);
-      for (let h = 0; h <= 5; h++)
-        this.setFunctionModule(8, h, i(r, h));
-      this.setFunctionModule(8, 7, i(r, 6)), this.setFunctionModule(8, 8, i(r, 7)), this.setFunctionModule(7, 8, i(r, 8));
-      for (let h = 9; h < 15; h++)
-        this.setFunctionModule(14 - h, 8, i(r, h));
-      for (let h = 0; h < 8; h++)
-        this.setFunctionModule(this.size - 1 - h, 8, i(r, h));
-      for (let h = 8; h < 15; h++)
-        this.setFunctionModule(8, this.size - 15 + h, i(r, h));
-      this.setFunctionModule(8, this.size - 8, !0);
-    }
-    // Draws two copies of the version bits (with its own error correction code),
-    // based on this object's version field, iff 7 <= version <= 40.
-    drawVersion() {
-      if (this.version < 7)
-        return;
-      let e = this.version;
-      for (let t = 0; t < 12; t++)
-        e = e << 1 ^ (e >>> 11) * 7973;
-      const n = this.version << 12 | e;
-      o(n >>> 18 == 0);
-      for (let t = 0; t < 18; t++) {
-        const r = i(n, t), h = this.size - 11 + t % 3, $ = Math.floor(t / 3);
-        this.setFunctionModule(h, $, r), this.setFunctionModule($, h, r);
-      }
-    }
-    // Draws a 9*9 finder pattern including the border separator,
-    // with the center module at (x, y). Modules can be out of bounds.
-    drawFinderPattern(e, n) {
-      for (let t = -4; t <= 4; t++)
-        for (let r = -4; r <= 4; r++) {
-          const h = Math.max(Math.abs(r), Math.abs(t)), $ = e + r, d = n + t;
-          0 <= $ && $ < this.size && 0 <= d && d < this.size && this.setFunctionModule($, d, h != 2 && h != 4);
-        }
-    }
-    // Draws a 5*5 alignment pattern, with the center module
-    // at (x, y). All modules must be in bounds.
-    drawAlignmentPattern(e, n) {
-      for (let t = -2; t <= 2; t++)
-        for (let r = -2; r <= 2; r++)
-          this.setFunctionModule(e + r, n + t, Math.max(Math.abs(r), Math.abs(t)) != 1);
-    }
-    // Sets the color of a module and marks it as a function module.
-    // Only used by the constructor. Coordinates must be in bounds.
-    setFunctionModule(e, n, t) {
-      this.modules[n][e] = t, 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(e) {
-      const n = this.version, t = this.errorCorrectionLevel;
-      if (e.length != l.getNumDataCodewords(n, t))
-        throw new RangeError("Invalid argument");
-      const r = l.NUM_ERROR_CORRECTION_BLOCKS[t.ordinal][n], h = l.ECC_CODEWORDS_PER_BLOCK[t.ordinal][n], $ = Math.floor(l.getNumRawDataModules(n) / 8), d = r - $ % r, M = Math.floor($ / r);
-      let g = [];
-      const A = l.reedSolomonComputeDivisor(h);
-      for (let p = 0, N = 0; p < r; p++) {
-        let I = e.slice(N, N + M - h + (p < d ? 0 : 1));
-        N += I.length;
-        const w = l.reedSolomonComputeRemainder(I, A);
-        p < d && I.push(0), g.push(I.concat(w));
-      }
-      let E = [];
-      for (let p = 0; p < g[0].length; p++)
-        g.forEach((N, I) => {
-          (p != M - h || I >= d) && E.push(N[p]);
-        });
-      return o(E.length == $), E;
-    }
-    // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire
-    // data area of this QR Code. Function modules need to be marked off before this is called.
-    drawCodewords(e) {
-      if (e.length != Math.floor(l.getNumRawDataModules(this.version) / 8))
-        throw new RangeError("Invalid argument");
-      let n = 0;
-      for (let t = this.size - 1; t >= 1; t -= 2) {
-        t == 6 && (t = 5);
-        for (let r = 0; r < this.size; r++)
-          for (let h = 0; h < 2; h++) {
-            const $ = t - h, M = (t + 1 & 2) == 0 ? this.size - 1 - r : r;
-            !this.isFunction[M][$] && n < e.length * 8 && (this.modules[M][$] = i(e[n >>> 3], 7 - (n & 7)), n++);
-          }
-      }
-      o(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(e) {
-      if (e < 0 || e > 7)
-        throw new RangeError("Mask value out of range");
-      for (let n = 0; n < this.size; n++)
-        for (let t = 0; t < this.size; t++) {
-          let r;
-          switch (e) {
-            case 0:
-              r = (t + n) % 2 == 0;
-              break;
-            case 1:
-              r = n % 2 == 0;
-              break;
-            case 2:
-              r = t % 3 == 0;
-              break;
-            case 3:
-              r = (t + n) % 3 == 0;
-              break;
-            case 4:
-              r = (Math.floor(t / 3) + Math.floor(n / 2)) % 2 == 0;
-              break;
-            case 5:
-              r = t * n % 2 + t * n % 3 == 0;
-              break;
-            case 6:
-              r = (t * n % 2 + t * n % 3) % 2 == 0;
-              break;
-            case 7:
-              r = ((t + n) % 2 + t * n % 3) % 2 == 0;
-              break;
-            default:
-              throw new Error("Unreachable");
-          }
-          !this.isFunction[n][t] && r && (this.modules[n][t] = !this.modules[n][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 e = 0;
-      for (let h = 0; h < this.size; h++) {
-        let $ = !1, d = 0, M = [0, 0, 0, 0, 0, 0, 0];
-        for (let g = 0; g < this.size; g++)
-          this.modules[h][g] == $ ? (d++, d == 5 ? e += l.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, M), $ || (e += this.finderPenaltyCountPatterns(M) * l.PENALTY_N3), $ = this.modules[h][g], d = 1);
-        e += this.finderPenaltyTerminateAndCount($, d, M) * l.PENALTY_N3;
-      }
-      for (let h = 0; h < this.size; h++) {
-        let $ = !1, d = 0, M = [0, 0, 0, 0, 0, 0, 0];
-        for (let g = 0; g < this.size; g++)
-          this.modules[g][h] == $ ? (d++, d == 5 ? e += l.PENALTY_N1 : d > 5 && e++) : (this.finderPenaltyAddHistory(d, M), $ || (e += this.finderPenaltyCountPatterns(M) * l.PENALTY_N3), $ = this.modules[g][h], d = 1);
-        e += this.finderPenaltyTerminateAndCount($, d, M) * l.PENALTY_N3;
-      }
-      for (let h = 0; h < this.size - 1; h++)
-        for (let $ = 0; $ < this.size - 1; $++) {
-          const d = this.modules[h][$];
-          d == this.modules[h][$ + 1] && d == this.modules[h + 1][$] && d == this.modules[h + 1][$ + 1] && (e += l.PENALTY_N2);
-        }
-      let n = 0;
-      for (const h of this.modules)
-        n = h.reduce(($, d) => $ + (d ? 1 : 0), n);
-      const t = this.size * this.size, r = Math.ceil(Math.abs(n * 20 - t * 10) / t) - 1;
-      return o(0 <= r && r <= 9), e += r * l.PENALTY_N4, o(0 <= e && e <= 2568888), e;
-    }
-    /*-- Private helper functions --*/
-    // Returns an ascending list of positions of alignment patterns for this version number.
-    // Each position is in the range [0,177), and are used on both the x and y axes.
-    // This could be implemented as lookup table of 40 variable-length lists of integers.
-    getAlignmentPatternPositions() {
-      if (this.version == 1)
-        return [];
-      {
-        const e = Math.floor(this.version / 7) + 2, n = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2;
-        let t = [6];
-        for (let r = this.size - 7; t.length < e; r -= n)
-          t.splice(1, 0, r);
-        return 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(e) {
-      if (e < l.MIN_VERSION || e > l.MAX_VERSION)
-        throw new RangeError("Version number out of range");
-      let n = (16 * e + 128) * e + 64;
-      if (e >= 2) {
-        const t = Math.floor(e / 7) + 2;
-        n -= (25 * t - 10) * t - 55, e >= 7 && (n -= 36);
-      }
-      return o(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(e, n) {
-      return Math.floor(l.getNumRawDataModules(e) / 8) - l.ECC_CODEWORDS_PER_BLOCK[n.ordinal][e] * l.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(e) {
-      if (e < 1 || e > 255)
-        throw new RangeError("Degree out of range");
-      let n = [];
-      for (let r = 0; r < e - 1; r++)
-        n.push(0);
-      n.push(1);
-      let t = 1;
-      for (let r = 0; r < e; r++) {
-        for (let h = 0; h < n.length; h++)
-          n[h] = l.reedSolomonMultiply(n[h], t), h + 1 < n.length && (n[h] ^= n[h + 1]);
-        t = l.reedSolomonMultiply(t, 2);
-      }
-      return n;
-    }
-    // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
-    static reedSolomonComputeRemainder(e, n) {
-      let t = n.map((r) => 0);
-      for (const r of e) {
-        const h = r ^ t.shift();
-        t.push(0), n.forEach(($, d) => t[d] ^= l.reedSolomonMultiply($, h));
-      }
-      return t;
-    }
-    // Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result
-    // are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
-    static reedSolomonMultiply(e, n) {
-      if (e >>> 8 || n >>> 8)
-        throw new RangeError("Byte out of range");
-      let t = 0;
-      for (let r = 7; r >= 0; r--)
-        t = t << 1 ^ (t >>> 7) * 285, t ^= (n >>> r & 1) * e;
-      return o(t >>> 8 == 0), t;
-    }
-    // Can only be called immediately after a light run is added, and
-    // returns either 0, 1, or 2. A helper function for getPenaltyScore().
-    finderPenaltyCountPatterns(e) {
-      const n = e[1];
-      o(n <= this.size * 3);
-      const t = n > 0 && e[2] == n && e[3] == n * 3 && e[4] == n && e[5] == n;
-      return (t && e[0] >= n * 4 && e[6] >= n ? 1 : 0) + (t && 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(e, n, t) {
-      return e && (this.finderPenaltyAddHistory(n, t), n = 0), n += this.size, this.finderPenaltyAddHistory(n, t), this.finderPenaltyCountPatterns(t);
-    }
-    // Pushes the given value to the front and drops the last value. A helper function for getPenaltyScore().
-    finderPenaltyAddHistory(e, n) {
-      n[0] == 0 && (e += this.size), n.pop(), n.unshift(e);
-    }
-  };
-  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 = [
-    // 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],
-    // Low
-    [-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],
-    // Medium
-    [-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],
-    // 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 = [
-    // 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],
-    // Low
-    [-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],
-    // Medium
-    [-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],
-    // Quartile
-    [-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81]
-    // High
-  ];
-  let a = l;
-  s.QrCode = a;
-  function c(f, e, n) {
-    if (e < 0 || e > 31 || f >>> e)
-      throw new RangeError("Value out of range");
-    for (let t = e - 1; t >= 0; t--)
-      n.push(f >>> t & 1);
-  }
-  function i(f, e) {
-    return (f >>> e & 1) != 0;
-  }
-  function o(f) {
-    if (!f)
-      throw new Error("Assertion error");
-  }
-  const m = class m {
-    /*-- Constructor (low level) and fields --*/
-    // Creates a new QR Code segment with the given attributes and data.
-    // The character count (numChars) must agree with the mode and the bit buffer length,
-    // but the constraint isn't checked. The given bit buffer is cloned and stored.
-    constructor(e, n, t) {
-      if (this.mode = e, this.numChars = n, this.bitData = t, n < 0)
-        throw new RangeError("Invalid argument");
-      this.bitData = t.slice();
-    }
-    /*-- Static factory functions (mid level) --*/
-    // Returns a segment representing the given binary data encoded in
-    // byte mode. All input byte arrays are acceptable. Any text string
-    // can be converted to UTF-8 bytes and encoded as a byte mode segment.
-    static makeBytes(e) {
-      let n = [];
-      for (const t of e)
-        c(t, 8, n);
-      return new m(m.Mode.BYTE, e.length, n);
-    }
-    // Returns a segment representing the given string of decimal digits encoded in numeric mode.
-    static makeNumeric(e) {
-      if (!m.isNumeric(e))
-        throw new RangeError("String contains non-numeric characters");
-      let n = [];
-      for (let t = 0; t < e.length; ) {
-        const r = Math.min(e.length - t, 3);
-        c(parseInt(e.substring(t, t + r), 10), r * 3 + 1, n), t += r;
-      }
-      return new m(m.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(e) {
-      if (!m.isAlphanumeric(e))
-        throw new RangeError("String contains unencodable characters in alphanumeric mode");
-      let n = [], t;
-      for (t = 0; t + 2 <= e.length; t += 2) {
-        let r = m.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t)) * 45;
-        r += m.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t + 1)), c(r, 11, n);
-      }
-      return t < e.length && c(m.ALPHANUMERIC_CHARSET.indexOf(e.charAt(t)), 6, n), new m(m.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(e) {
-      return e == "" ? [] : m.isNumeric(e) ? [m.makeNumeric(e)] : m.isAlphanumeric(e) ? [m.makeAlphanumeric(e)] : [m.makeBytes(m.toUtf8ByteArray(e))];
-    }
-    // Returns a segment representing an Extended Channel Interpretation
-    // (ECI) designator with the given assignment value.
-    static makeEci(e) {
-      let n = [];
-      if (e < 0)
-        throw new RangeError("ECI assignment value out of range");
-      if (e < 128)
-        c(e, 8, n);
-      else if (e < 16384)
-        c(2, 2, n), c(e, 14, n);
-      else if (e < 1e6)
-        c(6, 3, n), c(e, 21, n);
-      else
-        throw new RangeError("ECI assignment value out of range");
-      return new m(m.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(e) {
-      return m.NUMERIC_REGEX.test(e);
-    }
-    // Tests whether the given string can be encoded as a segment in alphanumeric mode.
-    // A string is encodable iff each character is in the following set: 0 to 9, A to Z
-    // (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
-    static isAlphanumeric(e) {
-      return m.ALPHANUMERIC_REGEX.test(e);
-    }
-    /*-- Methods --*/
-    // Returns a new copy of the data bits of this segment.
-    getData() {
-      return this.bitData.slice();
-    }
-    // (Package-private) Calculates and returns the number of bits needed to encode the given segments at
-    // the given version. The result is infinity if a segment has too many characters to fit its length field.
-    static getTotalBits(e, n) {
-      let t = 0;
-      for (const r of e) {
-        const h = r.mode.numCharCountBits(n);
-        if (r.numChars >= 1 << h)
-          return 1 / 0;
-        t += 4 + h + r.bitData.length;
-      }
-      return t;
-    }
-    // Returns a new array of bytes representing the given string encoded in UTF-8.
-    static toUtf8ByteArray(e) {
-      e = encodeURI(e);
-      let n = [];
-      for (let t = 0; t < e.length; t++)
-        e.charAt(t) != "%" ? n.push(e.charCodeAt(t)) : (n.push(parseInt(e.substring(t + 1, t + 3), 16)), t += 2);
-      return n;
-    }
-  };
-  m.NUMERIC_REGEX = /^[0-9]*$/, m.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/, m.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
-  let u = m;
-  s.QrSegment = u;
-})(S || (S = {}));
-((s) => {
-  ((a) => {
-    const i = class i {
-      // The QR Code can tolerate about 30% erroneous codewords
-      /*-- Constructor and fields --*/
-      constructor(u, l) {
-        this.ordinal = u, this.formatBits = l;
-      }
-    };
-    i.LOW = new i(0, 1), i.MEDIUM = new i(1, 0), i.QUARTILE = new i(2, 3), i.HIGH = new i(3, 2);
-    let c = i;
-    a.Ecc = c;
-  })(s.QrCode || (s.QrCode = {}));
-})(S || (S = {}));
-((s) => {
-  ((a) => {
-    const i = class i {
-      /*-- Constructor and fields --*/
-      constructor(u, l) {
-        this.modeBits = u, this.numBitsCharCount = l;
-      }
-      /*-- 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(u) {
-        return this.numBitsCharCount[Math.floor((u + 7) / 17)];
-      }
-    };
-    i.NUMERIC = new i(1, [10, 12, 14]), i.ALPHANUMERIC = new i(2, [9, 11, 13]), i.BYTE = new i(4, [8, 16, 16]), i.KANJI = new i(8, [8, 10, 12]), i.ECI = new i(7, [0, 0, 0]);
-    let c = i;
-    a.Mode = c;
-  })(s.QrSegment || (s.QrSegment = {}));
-})(S || (S = {}));
-const b = S, ft = {
-  L: b.QrCode.Ecc.LOW,
-  M: b.QrCode.Ecc.MEDIUM,
-  Q: b.QrCode.Ecc.QUARTILE,
-  H: b.QrCode.Ecc.HIGH
-}, pt = 128, mt = "M", gt = 1, Et = 4, ot = 5, H = "#000000", Mt = "square", Rt = "square", Nt = "square", It = "react-qr-code", Ct = "react-qr-code-gradient", wt = "react-qr-code-bg-gradient", At = 0.1, R = 7, T = 3, y = [
-  [1, 1, 1, 1, 1, 1, 1],
-  [1, 0, 0, 0, 0, 0, 1],
-  [1, 0, 0, 0, 0, 0, 1],
-  [1, 0, 0, 0, 0, 0, 1],
-  [1, 0, 0, 0, 0, 0, 1],
-  [1, 0, 0, 0, 0, 0, 1],
-  [1, 1, 1, 1, 1, 1, 1]
-], st = {
-  "inpoint-sm": [0, 90, -90],
-  inpoint: [0, 90, -90],
-  "inpoint-lg": [0, 90, -90],
-  "outpoint-sm": [180, -90, 90],
-  outpoint: [180, -90, 90],
-  "outpoint-lg": [180, -90, 90],
-  "leaf-sm": [0, 90, -90],
-  leaf: [0, 90, -90],
-  "leaf-lg": [0, 90, -90]
-}, Q = {
-  "rounded-sm": 3,
-  rounded: 4,
-  "rounded-lg": 5,
-  "leaf-sm": 3,
-  leaf: 4,
-  "leaf-lg": 5,
-  "inpoint-sm": 3,
-  inpoint: 4,
-  "inpoint-lg": 5,
-  "outpoint-sm": 3,
-  outpoint: 4,
-  "outpoint-lg": 5
-}, q = {
-  square: 0,
-  diamond: 0,
-  circle: 3,
-  "rounded-sm": 0.5,
-  rounded: 0.9,
-  "rounded-lg": 1.1,
-  "leaf-sm": 1.5,
-  leaf: 2,
-  "leaf-lg": 2.3,
-  "inpoint-sm": 1.5,
-  inpoint: 2,
-  "inpoint-lg": 2.3,
-  "outpoint-sm": 1.5,
-  outpoint: 2,
-  "outpoint-lg": 2.3
-}, B = [
-  [0, 0, 0, 0, 0, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0],
-  [0, 0, 1, 1, 1, 0, 0],
-  [0, 0, 1, 1, 1, 0, 0],
-  [0, 0, 1, 1, 1, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0]
-], Pt = (s) => s === "square" || s === "pinched-square" || s === "circle" || s === "star" || s === "heart" || s === "diamond" || s === "hashtag", Ot = (s, a) => s === "square-sm" ? 0.75 : a ? Math.random() * (1 - 0.75) + 0.75 : 1, D = (s, a, c) => {
-  const i = {
-    left: s === 0 ? !1 : c[a][s - 1],
-    right: s === c[a].length - 1 ? !1 : c[a][s + 1],
-    top: a === 0 ? !1 : c[a - 1][s],
-    bottom: a === c.length - 1 ? !1 : c[a + 1][s]
-  };
-  return {
-    ...i,
-    count: Object.values(i).filter(Boolean).length
-  };
-}, U = (s, a, c) => `M${s},${a}h${c}v${c}h-${c}Z`, F = (s, a, c) => `M${s},${a + c / 2}a${c / 2},${c / 2} 0 1,0 ${c},0a${c / 2},${c / 2} 0 1,0 -${c},0Z`, Tt = (s, a, c) => `M${s},${a + c / 2}l${c / 2},-${c / 2}l${c / 2},${c / 2}l-${c / 2},${c / 2}Z`, vt = (s, a) => `M ${s} ${a} 
+}, b = (e, t, n) => {
+	let r = !1, i = 0;
+	return [
+		"M",
+		1,
+		.3262506,
+		"c",
+		0,
+		.0383376,
+		-.0064626,
+		.0758377,
+		-.0193751,
+		.1125001,
+		"s",
+		-.0356247,
+		.076875,
+		-.0681248,
+		.1206252,
+		"c",
+		-.0325,
+		.0437499,
+		-.0762503,
+		.0931247,
+		-.1312501,
+		.1481249,
+		"C",
+		.7262502,
+		.7625008,
+		.6566626,
+		.8279132,
+		.5724999,
+		.9037505,
+		"L",
+		.5,
+		.9687506,
+		"L",
+		.4275001,
+		.9037505,
+		"C",
+		.3433374,
+		.8279132,
+		.2737499,
+		.7625005,
+		.21875,
+		.7075007,
+		"C",
+		.1637501,
+		.6525008,
+		.1199999,
+		.6031258,
+		.0874999,
+		.5593758,
+		"S",
+		.0322876,
+		.4754133,
+		.0193751,
+		.4387506,
+		"S",
+		0,
+		.3645881,
+		0,
+		.3262506,
+		"c",
+		0,
+		-.0783374,
+		.0262499,
+		-.1437498,
+		.07875,
+		-.1962499,
+		"s",
+		.1179124,
+		-.07875,
+		.1962499,
+		-.07875,
+		"c",
+		.0433376,
+		0,
+		.0845875,
+		.0091625,
+		.12375,
+		.0274999,
+		"S",
+		.4716623,
+		.1229131,
+		.5,
+		.1562506,
+		"c",
+		.0283374,
+		-.0333375,
+		.0620874,
+		-.0591625,
+		.1012502,
+		-.0775,
+		"c",
+		.0391627,
+		-.0183375,
+		.0804126,
+		-.0274999,
+		.12375,
+		-.0274999,
+		"c",
+		.0783374,
+		0,
+		.1437497,
+		.0262499,
+		.1962501,
+		.07875,
+		"S",
+		1,
+		.2479131,
+		1,
+		.3262506,
+		"z"
+	].map((a) => typeof a == "string" ? (i = 0, r = a.toUpperCase() == a, a) : (i++, a *= n, r && (a += i % 2 == 1 ? e : t), u(a))).join(" ");
+}, x = { "data-testid": "background" }, ee = ({ background: e, bgGradientId: t, numCells: n }) => {
+	if (!e) return null;
+	if (typeof e == "string") return /* @__PURE__ */ s("path", {
+		fill: e,
+		d: `M0,0 h${n}v${n}H0z`,
+		...x
+	});
+	let r = d(e?.rotation || 0);
+	return /* @__PURE__ */ c(o, { children: [/* @__PURE__ */ s("defs", { children: e.type === "linear" ? /* @__PURE__ */ s("linearGradient", {
+		id: t,
+		gradientUnits: "userSpaceOnUse",
+		...r,
+		children: e.stops?.map((e, t) => /* @__PURE__ */ s("stop", {
+			offset: e.offset,
+			stopColor: e.color
+		}, t))
+	}) : /* @__PURE__ */ s("radialGradient", {
+		id: t,
+		gradientUnits: "userSpaceOnUse",
+		cx: "50%",
+		cy: "50%",
+		r: "50%",
+		children: e.stops?.map((e, t) => /* @__PURE__ */ s("stop", {
+			offset: e.offset,
+			stopColor: e.color
+		}, t))
+	}) }), /* @__PURE__ */ s("path", {
+		fill: `url(#${t})`,
+		d: `M0,0 h${n}v${n}H0z`,
+		...x
+	})] });
+}, S;
+(function(e) {
+	class t {
+		static encodeText(e, n) {
+			let r = S.QrSegment.makeSegments(e);
+			return t.encodeSegments(r, n);
+		}
+		static encodeBinary(e, n) {
+			let r = S.QrSegment.makeBytes(e);
+			return t.encodeSegments([r], n);
+		}
+		static encodeSegments(e, r, o = 1, s = 40, c = -1, l = !0) {
+			if (!(t.MIN_VERSION <= o && o <= s && s <= t.MAX_VERSION) || c < -1 || c > 7) throw RangeError("Invalid value");
+			let u, d;
+			for (u = o;; u++) {
+				let n = t.getNumDataCodewords(u, r) * 8, i = a.getTotalBits(e, u);
+				if (i <= n) {
+					d = i;
+					break;
+				}
+				if (u >= s) throw RangeError("Data too long");
+			}
+			for (let e of [
+				t.Ecc.MEDIUM,
+				t.Ecc.QUARTILE,
+				t.Ecc.HIGH
+			]) l && d <= t.getNumDataCodewords(u, e) * 8 && (r = e);
+			let f = [];
+			for (let t of e) {
+				n(t.mode.modeBits, 4, f), n(t.numChars, t.mode.numCharCountBits(u), f);
+				for (let e of t.getData()) f.push(e);
+			}
+			i(f.length == d);
+			let p = t.getNumDataCodewords(u, r) * 8;
+			i(f.length <= p), n(0, Math.min(4, p - f.length), f), n(0, (8 - f.length % 8) % 8, f), i(f.length % 8 == 0);
+			for (let e = 236; f.length < p; e ^= 253) n(e, 8, f);
+			let m = [];
+			for (; m.length * 8 < f.length;) m.push(0);
+			return f.forEach((e, t) => m[t >>> 3] |= e << 7 - (t & 7)), new t(u, r, m, c);
+		}
+		constructor(e, n, r, a) {
+			if (this.version = e, this.errorCorrectionLevel = n, this.modules = [], this.isFunction = [], e < t.MIN_VERSION || e > t.MAX_VERSION) throw RangeError("Version value out of range");
+			if (a < -1 || a > 7) throw RangeError("Mask value out of range");
+			this.size = e * 4 + 17;
+			let o = [];
+			for (let e = 0; e < this.size; e++) o.push(!1);
+			for (let e = 0; e < this.size; e++) this.modules.push(o.slice()), this.isFunction.push(o.slice());
+			this.drawFunctionPatterns();
+			let s = this.addEccAndInterleave(r);
+			if (this.drawCodewords(s), a == -1) {
+				let e = 1e9;
+				for (let t = 0; t < 8; t++) {
+					this.applyMask(t), this.drawFormatBits(t);
+					let n = this.getPenaltyScore();
+					n < e && (a = t, e = n), this.applyMask(t);
+				}
+			}
+			i(0 <= a && a <= 7), this.mask = a, this.applyMask(a), this.drawFormatBits(a), this.isFunction = [];
+		}
+		getModule(e, t) {
+			return 0 <= e && e < this.size && 0 <= t && t < this.size && this.modules[t][e];
+		}
+		getModules() {
+			return this.modules;
+		}
+		drawFunctionPatterns() {
+			for (let e = 0; e < this.size; e++) this.setFunctionModule(6, e, e % 2 == 0), this.setFunctionModule(e, 6, e % 2 == 0);
+			this.drawFinderPattern(3, 3), this.drawFinderPattern(this.size - 4, 3), this.drawFinderPattern(3, this.size - 4);
+			let e = this.getAlignmentPatternPositions(), t = e.length;
+			for (let n = 0; n < t; n++) for (let r = 0; r < t; r++) n == 0 && r == 0 || n == 0 && r == t - 1 || n == t - 1 && r == 0 || this.drawAlignmentPattern(e[n], e[r]);
+			this.drawFormatBits(0), this.drawVersion();
+		}
+		drawFormatBits(e) {
+			let t = this.errorCorrectionLevel.formatBits << 3 | e, n = t;
+			for (let e = 0; e < 10; e++) n = n << 1 ^ (n >>> 9) * 1335;
+			let a = (t << 10 | n) ^ 21522;
+			i(a >>> 15 == 0);
+			for (let e = 0; e <= 5; e++) this.setFunctionModule(8, e, r(a, e));
+			this.setFunctionModule(8, 7, r(a, 6)), this.setFunctionModule(8, 8, r(a, 7)), this.setFunctionModule(7, 8, r(a, 8));
+			for (let e = 9; e < 15; e++) this.setFunctionModule(14 - e, 8, r(a, e));
+			for (let e = 0; e < 8; e++) this.setFunctionModule(this.size - 1 - e, 8, r(a, e));
+			for (let e = 8; e < 15; e++) this.setFunctionModule(8, this.size - 15 + e, r(a, e));
+			this.setFunctionModule(8, this.size - 8, !0);
+		}
+		drawVersion() {
+			if (this.version < 7) return;
+			let e = this.version;
+			for (let t = 0; t < 12; t++) e = e << 1 ^ (e >>> 11) * 7973;
+			let t = this.version << 12 | e;
+			i(t >>> 18 == 0);
+			for (let e = 0; e < 18; e++) {
+				let n = r(t, e), i = this.size - 11 + e % 3, a = Math.floor(e / 3);
+				this.setFunctionModule(i, a, n), this.setFunctionModule(a, i, n);
+			}
+		}
+		drawFinderPattern(e, t) {
+			for (let n = -4; n <= 4; n++) for (let r = -4; r <= 4; r++) {
+				let i = Math.max(Math.abs(r), Math.abs(n)), a = e + r, o = t + n;
+				0 <= a && a < this.size && 0 <= o && o < this.size && this.setFunctionModule(a, o, i != 2 && i != 4);
+			}
+		}
+		drawAlignmentPattern(e, t) {
+			for (let n = -2; n <= 2; n++) for (let r = -2; r <= 2; r++) this.setFunctionModule(e + r, t + n, Math.max(Math.abs(r), Math.abs(n)) != 1);
+		}
+		setFunctionModule(e, t, n) {
+			this.modules[t][e] = n, this.isFunction[t][e] = !0;
+		}
+		addEccAndInterleave(e) {
+			let n = this.version, r = this.errorCorrectionLevel;
+			if (e.length != t.getNumDataCodewords(n, r)) throw RangeError("Invalid argument");
+			let a = t.NUM_ERROR_CORRECTION_BLOCKS[r.ordinal][n], o = t.ECC_CODEWORDS_PER_BLOCK[r.ordinal][n], s = Math.floor(t.getNumRawDataModules(n) / 8), c = a - s % a, l = Math.floor(s / a), u = [], d = t.reedSolomonComputeDivisor(o);
+			for (let n = 0, r = 0; n < a; n++) {
+				let i = e.slice(r, r + l - o + (n < c ? 0 : 1));
+				r += i.length;
+				let a = t.reedSolomonComputeRemainder(i, d);
+				n < c && i.push(0), u.push(i.concat(a));
+			}
+			let f = [];
+			for (let e = 0; e < u[0].length; e++) u.forEach((t, n) => {
+				(e != l - o || n >= c) && f.push(t[e]);
+			});
+			return i(f.length == s), f;
+		}
+		drawCodewords(e) {
+			if (e.length != Math.floor(t.getNumRawDataModules(this.version) / 8)) throw RangeError("Invalid argument");
+			let n = 0;
+			for (let t = this.size - 1; t >= 1; t -= 2) {
+				t == 6 && (t = 5);
+				for (let i = 0; i < this.size; i++) for (let a = 0; a < 2; a++) {
+					let o = t - a, s = t + 1 & 2 ? i : this.size - 1 - i;
+					!this.isFunction[s][o] && n < e.length * 8 && (this.modules[s][o] = r(e[n >>> 3], 7 - (n & 7)), n++);
+				}
+			}
+			i(n == e.length * 8);
+		}
+		applyMask(e) {
+			if (e < 0 || e > 7) throw RangeError("Mask value out of range");
+			for (let t = 0; t < this.size; t++) for (let n = 0; n < this.size; n++) {
+				let r;
+				switch (e) {
+					case 0:
+						r = (n + t) % 2 == 0;
+						break;
+					case 1:
+						r = t % 2 == 0;
+						break;
+					case 2:
+						r = n % 3 == 0;
+						break;
+					case 3:
+						r = (n + t) % 3 == 0;
+						break;
+					case 4:
+						r = (Math.floor(n / 3) + Math.floor(t / 2)) % 2 == 0;
+						break;
+					case 5:
+						r = n * t % 2 + n * t % 3 == 0;
+						break;
+					case 6:
+						r = (n * t % 2 + n * t % 3) % 2 == 0;
+						break;
+					case 7:
+						r = ((n + t) % 2 + n * t % 3) % 2 == 0;
+						break;
+					default: throw Error("Unreachable");
+				}
+				!this.isFunction[t][n] && r && (this.modules[t][n] = !this.modules[t][n]);
+			}
+		}
+		getPenaltyScore() {
+			let e = 0;
+			for (let n = 0; n < this.size; n++) {
+				let r = !1, i = 0, a = [
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0
+				];
+				for (let o = 0; o < this.size; o++) this.modules[n][o] == r ? (i++, i == 5 ? e += t.PENALTY_N1 : i > 5 && e++) : (this.finderPenaltyAddHistory(i, a), r || (e += this.finderPenaltyCountPatterns(a) * t.PENALTY_N3), r = this.modules[n][o], i = 1);
+				e += this.finderPenaltyTerminateAndCount(r, i, a) * t.PENALTY_N3;
+			}
+			for (let n = 0; n < this.size; n++) {
+				let r = !1, i = 0, a = [
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0
+				];
+				for (let o = 0; o < this.size; o++) this.modules[o][n] == r ? (i++, i == 5 ? e += t.PENALTY_N1 : i > 5 && e++) : (this.finderPenaltyAddHistory(i, a), r || (e += this.finderPenaltyCountPatterns(a) * t.PENALTY_N3), r = this.modules[o][n], i = 1);
+				e += this.finderPenaltyTerminateAndCount(r, i, a) * t.PENALTY_N3;
+			}
+			for (let n = 0; n < this.size - 1; n++) for (let r = 0; r < this.size - 1; r++) {
+				let i = this.modules[n][r];
+				i == this.modules[n][r + 1] && i == this.modules[n + 1][r] && i == this.modules[n + 1][r + 1] && (e += t.PENALTY_N2);
+			}
+			let n = 0;
+			for (let e of this.modules) n = e.reduce((e, t) => e + +!!t, n);
+			let r = this.size * this.size, a = Math.ceil(Math.abs(n * 20 - r * 10) / r) - 1;
+			return i(0 <= a && a <= 9), e += a * t.PENALTY_N4, i(0 <= e && e <= 2568888), e;
+		}
+		getAlignmentPatternPositions() {
+			if (this.version == 1) return [];
+			{
+				let e = Math.floor(this.version / 7) + 2, t = this.version == 32 ? 26 : Math.ceil((this.version * 4 + 4) / (e * 2 - 2)) * 2, n = [6];
+				for (let r = this.size - 7; n.length < e; r -= t) n.splice(1, 0, r);
+				return n;
+			}
+		}
+		static getNumRawDataModules(e) {
+			if (e < t.MIN_VERSION || e > t.MAX_VERSION) throw RangeError("Version number out of range");
+			let n = (16 * e + 128) * e + 64;
+			if (e >= 2) {
+				let t = Math.floor(e / 7) + 2;
+				n -= (25 * t - 10) * t - 55, e >= 7 && (n -= 36);
+			}
+			return i(208 <= n && n <= 29648), n;
+		}
+		static getNumDataCodewords(e, n) {
+			return Math.floor(t.getNumRawDataModules(e) / 8) - t.ECC_CODEWORDS_PER_BLOCK[n.ordinal][e] * t.NUM_ERROR_CORRECTION_BLOCKS[n.ordinal][e];
+		}
+		static reedSolomonComputeDivisor(e) {
+			if (e < 1 || e > 255) throw RangeError("Degree out of range");
+			let n = [];
+			for (let t = 0; t < e - 1; t++) n.push(0);
+			n.push(1);
+			let r = 1;
+			for (let i = 0; i < e; i++) {
+				for (let e = 0; e < n.length; e++) n[e] = t.reedSolomonMultiply(n[e], r), e + 1 < n.length && (n[e] ^= n[e + 1]);
+				r = t.reedSolomonMultiply(r, 2);
+			}
+			return n;
+		}
+		static reedSolomonComputeRemainder(e, n) {
+			let r = n.map((e) => 0);
+			for (let i of e) {
+				let e = i ^ r.shift();
+				r.push(0), n.forEach((n, i) => r[i] ^= t.reedSolomonMultiply(n, e));
+			}
+			return r;
+		}
+		static reedSolomonMultiply(e, t) {
+			if (e >>> 8 || t >>> 8) throw RangeError("Byte out of range");
+			let n = 0;
+			for (let r = 7; r >= 0; r--) n = n << 1 ^ (n >>> 7) * 285, n ^= (t >>> r & 1) * e;
+			return i(n >>> 8 == 0), n;
+		}
+		finderPenaltyCountPatterns(e) {
+			let t = e[1];
+			i(t <= this.size * 3);
+			let n = t > 0 && e[2] == t && e[3] == t * 3 && e[4] == t && e[5] == t;
+			return (n && e[0] >= t * 4 && e[6] >= t ? 1 : 0) + (n && e[6] >= t * 4 && e[0] >= t ? 1 : 0);
+		}
+		finderPenaltyTerminateAndCount(e, t, n) {
+			return e && (this.finderPenaltyAddHistory(t, n), t = 0), t += this.size, this.finderPenaltyAddHistory(t, n), this.finderPenaltyCountPatterns(n);
+		}
+		finderPenaltyAddHistory(e, t) {
+			t[0] == 0 && (e += this.size), t.pop(), t.unshift(e);
+		}
+		static {
+			this.MIN_VERSION = 1;
+		}
+		static {
+			this.MAX_VERSION = 40;
+		}
+		static {
+			this.PENALTY_N1 = 3;
+		}
+		static {
+			this.PENALTY_N2 = 3;
+		}
+		static {
+			this.PENALTY_N3 = 40;
+		}
+		static {
+			this.PENALTY_N4 = 10;
+		}
+		static {
+			this.ECC_CODEWORDS_PER_BLOCK = [
+				[
+					-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
+				],
+				[
+					-1,
+					10,
+					16,
+					26,
+					18,
+					24,
+					16,
+					18,
+					22,
+					22,
+					26,
+					30,
+					22,
+					22,
+					24,
+					24,
+					28,
+					28,
+					26,
+					26,
+					26,
+					26,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28,
+					28
+				],
+				[
+					-1,
+					13,
+					22,
+					18,
+					26,
+					18,
+					24,
+					18,
+					22,
+					20,
+					24,
+					28,
+					26,
+					24,
+					20,
+					30,
+					24,
+					28,
+					28,
+					26,
+					30,
+					28,
+					30,
+					30,
+					30,
+					30,
+					28,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30,
+					30
+				],
+				[
+					-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
+				]
+			];
+		}
+		static {
+			this.NUM_ERROR_CORRECTION_BLOCKS = [
+				[
+					-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
+				],
+				[
+					-1,
+					1,
+					1,
+					1,
+					2,
+					2,
+					4,
+					4,
+					4,
+					5,
+					5,
+					5,
+					8,
+					9,
+					9,
+					10,
+					10,
+					11,
+					13,
+					14,
+					16,
+					17,
+					17,
+					18,
+					20,
+					21,
+					23,
+					25,
+					26,
+					28,
+					29,
+					31,
+					33,
+					35,
+					37,
+					38,
+					40,
+					43,
+					45,
+					47,
+					49
+				],
+				[
+					-1,
+					1,
+					1,
+					2,
+					2,
+					4,
+					4,
+					6,
+					6,
+					8,
+					8,
+					8,
+					10,
+					12,
+					16,
+					12,
+					17,
+					16,
+					18,
+					21,
+					20,
+					23,
+					23,
+					25,
+					27,
+					29,
+					34,
+					34,
+					35,
+					38,
+					40,
+					43,
+					45,
+					48,
+					51,
+					53,
+					56,
+					59,
+					62,
+					65,
+					68
+				],
+				[
+					-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
+				]
+			];
+		}
+	}
+	e.QrCode = t;
+	function n(e, t, n) {
+		if (t < 0 || t > 31 || e >>> t) throw RangeError("Value out of range");
+		for (let r = t - 1; r >= 0; r--) n.push(e >>> r & 1);
+	}
+	function r(e, t) {
+		return (e >>> t & 1) != 0;
+	}
+	function i(e) {
+		if (!e) throw Error("Assertion error");
+	}
+	class a {
+		static makeBytes(e) {
+			let t = [];
+			for (let r of e) n(r, 8, t);
+			return new a(a.Mode.BYTE, e.length, t);
+		}
+		static makeNumeric(e) {
+			if (!a.isNumeric(e)) throw RangeError("String contains non-numeric characters");
+			let t = [];
+			for (let r = 0; r < e.length;) {
+				let i = Math.min(e.length - r, 3);
+				n(parseInt(e.substring(r, r + i), 10), i * 3 + 1, t), r += i;
+			}
+			return new a(a.Mode.NUMERIC, e.length, t);
+		}
+		static makeAlphanumeric(e) {
+			if (!a.isAlphanumeric(e)) throw RangeError("String contains unencodable characters in alphanumeric mode");
+			let t = [], r;
+			for (r = 0; r + 2 <= e.length; r += 2) {
+				let i = a.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r)) * 45;
+				i += a.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r + 1)), n(i, 11, t);
+			}
+			return r < e.length && n(a.ALPHANUMERIC_CHARSET.indexOf(e.charAt(r)), 6, t), new a(a.Mode.ALPHANUMERIC, e.length, t);
+		}
+		static makeSegments(e) {
+			return e == "" ? [] : a.isNumeric(e) ? [a.makeNumeric(e)] : a.isAlphanumeric(e) ? [a.makeAlphanumeric(e)] : [a.makeBytes(a.toUtf8ByteArray(e))];
+		}
+		static makeEci(e) {
+			let t = [];
+			if (e < 0) throw RangeError("ECI assignment value out of range");
+			if (e < 128) n(e, 8, t);
+			else if (e < 16384) n(2, 2, t), n(e, 14, t);
+			else if (e < 1e6) n(6, 3, t), n(e, 21, t);
+			else throw RangeError("ECI assignment value out of range");
+			return new a(a.Mode.ECI, 0, t);
+		}
+		static isNumeric(e) {
+			return a.NUMERIC_REGEX.test(e);
+		}
+		static isAlphanumeric(e) {
+			return a.ALPHANUMERIC_REGEX.test(e);
+		}
+		constructor(e, t, n) {
+			if (this.mode = e, this.numChars = t, this.bitData = n, t < 0) throw RangeError("Invalid argument");
+			this.bitData = n.slice();
+		}
+		getData() {
+			return this.bitData.slice();
+		}
+		static getTotalBits(e, t) {
+			let n = 0;
+			for (let r of e) {
+				let e = r.mode.numCharCountBits(t);
+				if (r.numChars >= 1 << e) return Infinity;
+				n += 4 + e + r.bitData.length;
+			}
+			return n;
+		}
+		static toUtf8ByteArray(e) {
+			e = encodeURI(e);
+			let t = [];
+			for (let n = 0; n < e.length; n++) e.charAt(n) == "%" ? (t.push(parseInt(e.substring(n + 1, n + 3), 16)), n += 2) : t.push(e.charCodeAt(n));
+			return t;
+		}
+		static {
+			this.NUMERIC_REGEX = /^[0-9]*$/;
+		}
+		static {
+			this.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/;
+		}
+		static {
+			this.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+		}
+	}
+	e.QrSegment = a;
+})(S ||= {}), (function(e) {
+	let t;
+	(function(e) {
+		class t {
+			static {
+				this.LOW = new t(0, 1);
+			}
+			static {
+				this.MEDIUM = new t(1, 0);
+			}
+			static {
+				this.QUARTILE = new t(2, 3);
+			}
+			static {
+				this.HIGH = new t(3, 2);
+			}
+			constructor(e, t) {
+				this.ordinal = e, this.formatBits = t;
+			}
+		}
+		e.Ecc = t;
+	})(t ||= e.QrCode ||= {});
+})(S ||= {}), (function(e) {
+	let t;
+	(function(e) {
+		class t {
+			static {
+				this.NUMERIC = new t(1, [
+					10,
+					12,
+					14
+				]);
+			}
+			static {
+				this.ALPHANUMERIC = new t(2, [
+					9,
+					11,
+					13
+				]);
+			}
+			static {
+				this.BYTE = new t(4, [
+					8,
+					16,
+					16
+				]);
+			}
+			static {
+				this.KANJI = new t(8, [
+					8,
+					10,
+					12
+				]);
+			}
+			static {
+				this.ECI = new t(7, [
+					0,
+					0,
+					0
+				]);
+			}
+			constructor(e, t) {
+				this.modeBits = e, this.numBitsCharCount = t;
+			}
+			numCharCountBits(e) {
+				return this.numBitsCharCount[Math.floor((e + 7) / 17)];
+			}
+		}
+		e.Mode = t;
+	})(t ||= e.QrSegment ||= {});
+})(S ||= {});
+var C = S, w = {
+	L: C.QrCode.Ecc.LOW,
+	M: C.QrCode.Ecc.MEDIUM,
+	Q: C.QrCode.Ecc.QUARTILE,
+	H: C.QrCode.Ecc.HIGH
+}, T = .5, E = .5, te = "react-qr-code", D = "react-qr-code-gradient", O = "react-qr-code-bg-gradient", ne = .1, k = [
+	[
+		1,
+		1,
+		1,
+		1,
+		1,
+		1,
+		1
+	],
+	[
+		1,
+		0,
+		0,
+		0,
+		0,
+		0,
+		1
+	],
+	[
+		1,
+		0,
+		0,
+		0,
+		0,
+		0,
+		1
+	],
+	[
+		1,
+		0,
+		0,
+		0,
+		0,
+		0,
+		1
+	],
+	[
+		1,
+		0,
+		0,
+		0,
+		0,
+		0,
+		1
+	],
+	[
+		1,
+		0,
+		0,
+		0,
+		0,
+		0,
+		1
+	],
+	[
+		1,
+		1,
+		1,
+		1,
+		1,
+		1,
+		1
+	]
+], A = {
+	"inpoint-sm": [
+		0,
+		90,
+		-90
+	],
+	inpoint: [
+		0,
+		90,
+		-90
+	],
+	"inpoint-lg": [
+		0,
+		90,
+		-90
+	],
+	"outpoint-sm": [
+		180,
+		-90,
+		90
+	],
+	outpoint: [
+		180,
+		-90,
+		90
+	],
+	"outpoint-lg": [
+		180,
+		-90,
+		90
+	],
+	"leaf-sm": [
+		0,
+		90,
+		-90
+	],
+	leaf: [
+		0,
+		90,
+		-90
+	],
+	"leaf-lg": [
+		0,
+		90,
+		-90
+	]
+}, j = {
+	"rounded-sm": 3,
+	rounded: 4,
+	"rounded-lg": 5,
+	"leaf-sm": 3,
+	leaf: 4,
+	"leaf-lg": 5,
+	"inpoint-sm": 3,
+	inpoint: 4,
+	"inpoint-lg": 5,
+	"outpoint-sm": 3,
+	outpoint: 4,
+	"outpoint-lg": 5
+}, M = {
+	square: 0,
+	diamond: 0,
+	circle: 3,
+	"rounded-sm": .5,
+	rounded: .9,
+	"rounded-lg": 1.1,
+	"leaf-sm": 1.5,
+	leaf: 2,
+	"leaf-lg": 2.3,
+	"inpoint-sm": 1.5,
+	inpoint: 2,
+	"inpoint-lg": 2.3,
+	"outpoint-sm": 1.5,
+	outpoint: 2,
+	"outpoint-lg": 2.3
+}, N = [
+	[
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0
+	],
+	[
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0
+	],
+	[
+		0,
+		0,
+		1,
+		1,
+		1,
+		0,
+		0
+	],
+	[
+		0,
+		0,
+		1,
+		1,
+		1,
+		0,
+		0
+	],
+	[
+		0,
+		0,
+		1,
+		1,
+		1,
+		0,
+		0
+	],
+	[
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0
+	],
+	[
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0
+	]
+], P = ({ x: e, y: t, numCells: n }) => !!(N[e]?.[t] || N[e - n + 7]?.[t] || N[e]?.[t - n + 7]), re = ({ x: e, y: t, radius: n }) => {
+	let r = 3 - n, i = n / 2, a = 3 - i;
+	return `M ${e} ${t + i}v ${r}a ${i} ${i}, 0, 0, 0, ${i} ${i}h ${a}v ${-a}a ${i} ${i}, 0, 0, 0, ${-i} ${-i}h ${-r}H ${e}z`;
+}, F = ({ x: e, y: t, radius: n }) => {
+	let r = 3 - n, i = n / 2, a = 3 - i;
+	return `M ${e} ${t + i}v ${r}a ${i} ${i}, 0, 0, 0, ${i} ${i}h ${a}v ${-a}a ${i} ${i}, 0, 0, 0, ${-i} ${-i}h ${-r}a ${i} ${i}, 0, 0, 0, ${-i} ${i}`;
+}, I = ({ x: e, y: t, numCells: n }) => !!(k[e]?.[t] || k[e - n + 7]?.[t] || k[e]?.[t - n + 7]), ie = ({ x: e, y: t, radius: n }) => {
+	let r = 7 - n, i = n / 2;
+	return `M ${e} ${t + i}v ${r}a ${i} ${i}, 0, 0, 0, ${i} ${i}h ${r}a ${i} ${i}, 0, 0, 0, ${i} ${-i}v ${-r}a ${i} ${i}, 0, 0, 0, ${-i} ${-i}h ${-r}a ${i} ${i}, 0, 0, 0, ${-i} ${i}M ${e + i} ${t + 1}h ${r}a ${i - 1} ${i - 1}, 0, 0, 1, ${i - 1} ${i - 1}v ${r}a ${i - 1} ${i - 1}, 0, 0, 1, ${-(i - 1)} ${i - 1}h ${-r}a ${i - 1} ${i - 1}, 0, 0, 1, ${-(i - 1)} ${-(i - 1)}v ${-r}a ${i - 1} ${i - 1}, 0, 0, 1, ${i - 1} ${-(i - 1)}`;
+}, ae = ({ x: e, y: t, radius: n }) => {
+	let r = 7 - n, i = n / 2, a = 7 - i;
+	return `M ${e} ${t + i}v ${r}a ${i} ${i}, 0, 0, 0, ${i} ${i}h ${a}v ${-a}a ${i} ${i}, 0, 0, 0, ${-i} ${-i}h ${-r}H ${e}zM ${e + i} ${t + 1}h ${r}a ${i - 1} ${i - 1}, 0, 0, 1, ${i - 1} ${i - 1}v ${a - 1}h ${-(a - 1)}a ${i - 1} ${i - 1}, 0, 0, 1, ${-(i - 1)} ${-(i - 1)}v ${-(a - 1)}z`;
+}, oe = ({ x: e, y: t, radius: n }) => {
+	let r = 7 - n, i = n / 2, a = 7 - i;
+	return `M ${e} ${t + i}v ${r}a ${i} ${i}, 0, 0, 0, ${i} ${i}h ${a}v ${-a}a ${i} ${i}, 0, 0, 0, ${-i} ${-i}h ${-r}a ${i} ${i}, 0, 0, 0, ${-i} ${i}M ${e + i} ${t + 1}h ${r}a ${i - 1} ${i - 1}, 0, 0, 1, ${i - 1} ${i - 1}v ${a - 1}h ${-(a - 1)}a ${i - 1} ${i - 1}, 0, 0, 1, ${-(i - 1)} ${-(i - 1)}v ${-r}a ${i - 1} ${i - 1}, 0, 0, 1, ${i - 1} ${-(i - 1)}`;
+}, se = (e) => e === "square" || e === "pinched-square" || e === "circle" || e === "star" || e === "heart" || e === "diamond" || e === "hashtag", ce = (e, t) => e === "square-sm" ? .75 : t ? Math.random() * .25 + .75 : 1, L = (e, t, n) => {
+	let r = {
+		left: e === 0 ? !1 : n[t][e - 1],
+		right: e === n[t].length - 1 ? !1 : n[t][e + 1],
+		top: t === 0 ? !1 : n[t - 1][e],
+		bottom: t === n.length - 1 ? !1 : n[t + 1][e]
+	};
+	return {
+		...r,
+		count: Object.values(r).filter(Boolean).length
+	};
+}, R = ({ x: e, y: t, modules: n, numCells: r }) => t >= 0 && t < n.length && e >= 0 && e < n[t].length && n[t][e] && !I({
+	x: e,
+	y: t,
+	numCells: r
+}) && !P({
+	x: e,
+	y: t,
+	numCells: r
+}), le = (e, t, n, r) => {
+	let i = {
+		left: R({
+			x: e - 1,
+			y: t,
+			modules: n,
+			numCells: r
+		}),
+		right: R({
+			x: e + 1,
+			y: t,
+			modules: n,
+			numCells: r
+		}),
+		top: R({
+			x: e,
+			y: t - 1,
+			modules: n,
+			numCells: r
+		}),
+		bottom: R({
+			x: e,
+			y: t + 1,
+			modules: n,
+			numCells: r
+		})
+	};
+	return {
+		...i,
+		count: Object.values(i).filter(Boolean).length
+	};
+}, z = (e, t, n, r) => `M${e},${t}h${n}v${r}h${-n}Z`, B = (e, t, n) => z(e, t, n, n), V = (e, t, n) => `M${e},${t + n / 2}a${n / 2},${n / 2} 0 1,0 ${n},0a${n / 2},${n / 2} 0 1,0 -${n},0Z`, H = (e, t, n) => `M${e},${t + n / 2}l${n / 2},-${n / 2}l${n / 2},${n / 2}l-${n / 2},${n / 2}Z`, U = (e, t, n) => `M${e - n},${t}a${n},${n} 0 1,1 ${n * 2},0a${n},${n} 0 1,1 ${-n * 2},0Z`, ue = ({ count: e }) => e === 1, de = (e, t) => `M ${e} ${t} 
    v 1 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, Y = (s, a) => `M ${s + 1} ${a} 
+   a 0.5 0.5, 0, 0, 0, -0.5 -0.5`, W = (e, t) => `M ${e + 1} ${t} 
    v 1 
    h -1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, G = (s, a) => `M ${s} ${a} 
+   a 0.5 0.5, 0, 0, 1, 0.5 -0.5`, G = (e, t) => `M ${e} ${t} 
    v 1 
    h 0.5 
    a 0.5 0.5, 0, 0, 0, 0.5 -0.5
    v -0.5
-   h -1`, Lt = (s, a) => `M ${s + 1} ${a} 
+   h -1`, K = (e, t) => `M ${e + 1} ${t} 
    v 1 
    h -0.5 
    a 0.5 0.5, 0, 0, 1, -0.5 -0.5 
    v -0.5 
-   h 1`, j = (s, a) => `M ${s} ${a} 
+   h 1`, q = (e, t) => `M ${e} ${t} 
    v 1 
    h 0.5 
-   a 0.5 0.5, 0, 0, 0, 0 -1`, V = (s, a) => `M ${s + 1} ${a} 
+   a 0.5 0.5, 0, 0, 0, 0 -1`, J = (e, t) => `M ${e + 1} ${t} 
    v 1 
    h -0.5 
-   a 0.5 0.5, 0, 0, 1, 0 -1`, X = (s, a) => `M ${s} ${a + 1} 
+   a 0.5 0.5, 0, 0, 1, 0 -1`, Y = (e, t) => `M ${e} ${t + 1} 
    h 1 
    v -0.5 
-   a 0.5 0.5, 0, 0, 0, -1 0`, Z = (s, a) => `M ${s} ${a} 
+   a 0.5 0.5, 0, 0, 0, -1 0`, X = (e, t) => `M ${e} ${t} 
    h 1 
    v 0.5 
-   a 0.5 0.5, 0, 0, 1, -1 0`, St = (s, a, c) => `M ${s + 1} ${a}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}`, bt = ({
-  x: s,
-  y: a,
-  numCells: c
-}) => !!(B[s]?.[a] || B[s - c + 7]?.[a] || B[s]?.[a - c + 7]), Ut = ({
-  x: s,
-  y: a,
-  radius: c
-}) => {
-  const i = T - c, o = c / 2, u = T - o;
-  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}H ${s}z`;
-}, Dt = ({
-  x: s,
-  y: a,
-  radius: c
-}) => {
-  const i = T - c, o = c / 2, u = T - o;
-  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${o}`;
-}, Ft = ({
-  x: s,
-  y: a,
-  numCells: c
-}) => !!(y[s]?.[a] || y[s - c + 7]?.[a] || y[s]?.[a - c + 7]), yt = ({
-  x: s,
-  y: a,
-  radius: c
-}) => {
-  const i = R - c, o = c / 2;
-  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${i}a ${o} ${o}, 0, 0, 0, ${o} ${-o}v ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${o}M ${s + o} ${a + 1}h ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${o - 1}v ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${o - 1}h ${-i}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${-(o - 1)}v ${-i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${-(o - 1)}`;
-}, Bt = ({
-  x: s,
-  y: a,
-  radius: c
-}) => {
-  const i = R - c, o = c / 2, u = R - o;
-  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}H ${s}zM ${s + o} ${a + 1}h ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${o - 1}v ${u - 1}h ${-(u - 1)}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${-(o - 1)}v ${-(u - 1)}z`;
-}, Ht = ({
-  x: s,
-  y: a,
-  radius: c
-}) => {
-  const i = R - c, o = c / 2, u = R - o;
-  return `M ${s} ${a + o}v ${i}a ${o} ${o}, 0, 0, 0, ${o} ${o}h ${u}v ${-u}a ${o} ${o}, 0, 0, 0, ${-o} ${-o}h ${-i}a ${o} ${o}, 0, 0, 0, ${-o} ${o}M ${s + o} ${a + 1}h ${i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${o - 1}v ${u - 1}h ${-(u - 1)}a ${o - 1} ${o - 1}, 0, 0, 1, ${-(o - 1)} ${-(o - 1)}v ${-i}a ${o - 1} ${o - 1}, 0, 0, 1, ${o - 1} ${-(o - 1)}`;
-}, _t = (s) => ({
-  color: s?.color || H,
-  style: s?.style || Nt,
-  randomSize: s?.randomSize || !1
-}), zt = (s) => ({
-  color: s?.color || H,
-  style: s?.style || Mt
-}), kt = (s) => ({
-  color: s?.color || H,
-  style: s?.style || Rt
-}), Qt = ({
-  modules: s,
-  margin: a,
-  settings: c,
-  gradient: i,
-  gradientId: o
-}) => {
-  const { color: u, style: l, randomSize: m } = L(
-    () => _t(c),
-    [c]
-  ), f = [], e = s.length, n = Pt(l) && m, t = it(
-    () => Ot(l, n),
-    [l, n]
-  );
-  return s.forEach((r, h) => {
-    r.forEach(($, d) => {
-      if (Ft({ x: d, y: h, numCells: e }) || bt({ x: d, y: h, numCells: e }))
-        return;
-      const M = t(), g = 1 * M, A = (1 - 1 * M) / 2, E = d + a + A, p = h + a + A;
-      if ($) {
-        if (l === "square" || l === "square-sm")
-          f.push(U(E, p, g));
-        else if (l === "pinched-square")
-          f.push(tt(E, p, g, 0.25));
-        else if (l === "circle")
-          f.push(F(E, p, g));
-        else if (l === "diamond")
-          f.push(Tt(E, p, g));
-        else if (l === "star")
-          f.push(
-            J(E + g / 2, p + g / 2, g * 1.1, ot)
-          );
-        else if (l === "heart")
-          f.push(nt(E, p, g));
-        else if (l === "hashtag")
-          f.push(et(E, p, g));
-        else if (l === "rounded") {
-          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
-          O === 0 ? f.push(F(E, p, 1)) : O > 2 || N && I || w && P ? f.push(U(E, p, 1)) : O === 2 ? N && w ? f.push(G(E, p)) : w && I ? f.push(Lt(E, p)) : I && P ? f.push(Y(E, p)) : f.push(vt(E, p)) : w ? f.push(Z(E, p)) : I ? f.push(V(E, p)) : P ? f.push(X(E, p)) : f.push(j(E, p));
-        } else if (l === "leaf") {
-          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
-          if (O === 0)
-            f.push(St(E, p, g));
-          else if (!N && !w) {
-            f.push(Y(E, p));
-            return;
-          } else !I && !P ? f.push(G(E, p)) : f.push(U(E, p, 1));
-        } else if (l === "vertical-line") {
-          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
-          O === 0 || N && !(w || P) || I && !(w || P) ? f.push(F(E, p, 1)) : w && P ? f.push(U(E, p, 1)) : w && !P ? f.push(Z(E, p)) : P && !w && f.push(X(E, p));
-        } else if (l === "horizontal-line") {
-          const { left: N, right: I, top: w, bottom: P, count: O } = D(d, h, s);
-          O === 0 || w && !(N || I) || P && !(N || I) ? f.push(F(E, p, 1)) : N && I ? f.push(U(E, p, 1)) : N && !I ? f.push(j(E, p)) : I && !N && f.push(V(E, p));
-        }
-      }
-    });
-  }), /* @__PURE__ */ C(
-    "path",
-    {
-      fill: i ? `url(#${o})` : u,
-      d: f.join(""),
-      shapeRendering: l === "square" ? "crispEdges" : "geometricPrecision",
-      "data-testid": "data-modules"
-    }
-  );
-}, v = {
-  "data-testid": "finder-patterns-inner"
-}, qt = ({
-  modules: s,
-  margin: a,
-  settings: c,
-  gradient: i,
-  gradientId: o
-}) => {
-  const { color: u, style: l } = L(
-    () => kt(c),
-    [c]
-  ), m = i ? `url(#${o})` : u, f = L(
-    () => [
-      { x: a + 2, y: a + 2 },
-      { x: s.length + a - R + 2, y: a + 2 },
-      { x: a + 2, y: s.length + a - R + 2 }
-    ],
-    [a, s.length]
-  ), e = (n, t) => `finder-patterns-inner-${l}-${n}-${t}`;
-  if (l === "rounded-sm" || l === "rounded" || l === "rounded-lg" || l === "circle" || l === "square")
-    return f.map((n) => {
-      const { x: t, y: r } = n;
-      return /* @__PURE__ */ C(
-        "rect",
-        {
-          x: t,
-          y: r,
-          width: T,
-          height: T,
-          fill: m,
-          rx: q[l],
-          ...v
-        },
-        e(t, r)
-      );
-    });
-  if (l === "pinched-square")
-    return f.map((n) => {
-      const { x: t, y: r } = n, h = tt(t, r, T, 0.25);
-      return /* @__PURE__ */ C("path", { fill: m, d: h, ...v }, e(t, r));
-    });
-  if (l === "diamond")
-    return f.map((n) => {
-      const { x: t, y: r } = n, h = Math.sqrt(1.5), $ = T / h, d = $ - $ / h;
-      return /* @__PURE__ */ C(
-        "rect",
-        {
-          x: t + d / 2,
-          y: r + d / 2,
-          width: $,
-          height: $,
-          fill: m,
-          style: {
-            transform: "rotate(45deg)",
-            transformOrigin: "center",
-            transformBox: "fill-box"
-          },
-          ...v
-        },
-        e(t, r)
-      );
-    });
-  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 n = l === "leaf-sm" || l === "leaf" || l === "leaf-lg" ? Ut : Dt;
-    return f.map((t, r) => ({
-      ...t,
-      rotation: st[l][r]
-    })).map(({ x: t, y: r, rotation: h }) => {
-      const $ = n({
-        x: t,
-        y: r,
-        radius: q[l]
-      });
-      return /* @__PURE__ */ C(
-        "path",
-        {
-          fill: m,
-          d: $,
-          style: {
-            transform: `rotate(${h}deg)`,
-            transformOrigin: "center",
-            transformBox: "fill-box"
-          },
-          ...v
-        },
-        e(t, r)
-      );
-    });
-  }
-  if (l === "heart")
-    return f.map(({ x: n, y: t }) => /* @__PURE__ */ C(
-      "path",
-      {
-        fill: m,
-        d: nt(n, t, T),
-        ...v
-      },
-      e(n, t)
-    ));
-  if (l === "star")
-    return f.map(({ x: n, y: t }) => {
-      const r = n + T / 2, h = t + T / 2, $ = J(r, h, T * 1.2, ot);
-      return /* @__PURE__ */ C("path", { fill: m, d: $, ...v }, e(n, t));
-    });
-  if (l === "hashtag")
-    return f.map(({ x: n, y: t }) => {
-      const r = et(n - 0.25, t - 0.25, 3.5);
-      return /* @__PURE__ */ C("path", { fill: m, d: r, ...v }, e(n, t));
-    });
-}, x = {
-  "data-testid": "finder-patterns-outer"
-}, Yt = ({
-  modules: s,
-  margin: a,
-  settings: c,
-  gradient: i,
-  gradientId: o
-}) => {
-  const { style: u, color: l } = L(
-    () => zt(c),
-    [c]
-  ), m = i ? `url(#${o})` : l, f = [], e = L(
-    () => [
-      { x: a, y: a },
-      { x: s.length + a - R, y: a },
-      { x: a, y: s.length + a - R }
-    ],
-    [a, s.length]
-  );
-  if ([
-    "rounded-sm",
-    "rounded",
-    "rounded-lg",
-    "circle",
-    "square",
-    "pinched-square"
-  ].includes(u)) {
-    for (const n of e) {
-      const { x: t, y: r } = n;
-      u === "rounded-sm" || u === "rounded" || u === "rounded-lg" ? f.push(
-        yt({
-          x: t,
-          y: r,
-          radius: Q[u]
-        })
-      ) : u === "circle" ? f.push(
-        `M ${t + R / 2} ${r}a ${R / 2} ${R / 2} 0 1 0 0.01 0zzm 0 1a ${R / 2 - 1} ${R / 2 - 1} 0 1 1 -0.01 0Z`
-      ) : u === "pinched-square" ? f.push(
-        `M ${t} ${r}Q ${t + 0.5} ${r + R / 2}, ${t} ${r + R}Q ${t + R / 2} ${r + R - 0.5}, ${t + R} ${r + R}Q ${t + R - 0.5} ${r + R / 2}, ${t + R} ${r}Q ${t + R / 2} ${r + 0.5}, ${t} ${r}zM ${t + 1} ${r + 1}Q ${t + R / 2} ${r + 1.25}, ${t + R - 1} ${r + 1}Q ${t + R - 1.25} ${r + R / 2}, ${t + R - 1} ${r + R - 1}Q ${t + R / 2} ${r + R - 1.25}, ${t + 1} ${r + R - 1}Q ${t + 1.25} ${r + R / 2}, ${t + 1} ${r + 1}z`
-      ) : f.push(
-        `M ${t} ${r}v ${R}h ${R}v ${-R}zM ${t + 1} ${r + 1}h ${R - 2}v ${R - 2}h ${-R + 2}z`
-      );
-    }
-    return /* @__PURE__ */ C("path", { fill: m, d: f.join(""), ...x });
-  }
-  if (u === "inpoint-sm" || u === "inpoint" || u === "inpoint-lg" || u === "outpoint-sm" || u === "outpoint" || u === "outpoint-lg" || u === "leaf-sm" || u === "leaf" || u === "leaf-lg") {
-    const n = u === "leaf-sm" || u === "leaf" || u === "leaf-lg" ? Bt : Ht;
-    return e.map((t, r) => ({
-      ...t,
-      rotation: st[u][r]
-    })).map(({ x: t, y: r, rotation: h }) => {
-      const $ = n({
-        x: t,
-        y: r,
-        radius: Q[u]
-      });
-      return /* @__PURE__ */ C(
-        "path",
-        {
-          fill: m,
-          d: $,
-          style: {
-            transform: `rotate(${h}deg)`,
-            transformOrigin: "center",
-            transformBox: "fill-box"
-          },
-          ...x
-        },
-        `finder-patterns-outer-${u}-${t}-${r}`
-      );
-    });
-  }
-}, Gt = ({ gradient: s, gradientId: a }) => {
-  if (!s)
-    return null;
-  const c = W(s?.rotation || 0);
-  return /* @__PURE__ */ C("defs", { children: s.type === "linear" ? /* @__PURE__ */ C("linearGradient", { id: a, gradientUnits: "userSpaceOnUse", ...c, children: s.stops?.map((i, o) => /* @__PURE__ */ C("stop", { offset: i.offset, stopColor: i.color }, o)) }) : /* @__PURE__ */ C(
-    "radialGradient",
-    {
-      id: a,
-      gradientUnits: "userSpaceOnUse",
-      cx: "50%",
-      cy: "50%",
-      r: "50%",
-      children: s.stops?.map((i, o) => /* @__PURE__ */ C("stop", { offset: i.offset, stopColor: i.color }, o))
-    }
-  ) });
-}, jt = () => {
-  const s = at();
-  return {
-    gradientId: `${Ct}-${s}`,
-    bgGradientId: `${wt}-${s}`
-  };
-}, Vt = (s, a) => s.slice().map((c, i) => i < a.y || i >= a.y + a.h ? c : c.map((o, u) => u < a.x || u >= a.x + a.w ? o : !1)), Xt = (s, a, c, i) => {
-  if (i == null)
-    return null;
-  const o = s.length + c * 2, u = Math.floor(a * At), l = o / a, m = (i.width || u) * l, f = (i.height || u) * l, e = i.x == null ? s.length / 2 - m / 2 : i.x * l, n = i.y == null ? s.length / 2 - f / 2 : i.y * l, t = i.opacity == null ? 1 : i.opacity;
-  let r = null;
-  if (i.excavate) {
-    const $ = Math.floor(e), d = Math.floor(n), M = Math.ceil(m + e - $), g = Math.ceil(f + n - d);
-    r = { x: $, y: d, w: M, h: g };
-  }
-  const h = i.crossOrigin;
-  return { x: e, y: n, h: f, w: m, excavation: r, opacity: t, crossOrigin: h };
-}, Zt = (s) => s != null ? Math.max(Math.floor(s), 0) : Et, xt = ({
-  value: s,
-  level: a,
-  minVersion: c,
-  marginSize: i,
-  imageSettings: o,
-  size: u,
-  boostLevel: l
-}) => {
-  const m = L(() => {
-    const h = (Array.isArray(s) ? s : [s]).reduce(($, d) => ($.push(...b.QrSegment.makeSegments(d)), $), []);
-    return b.QrCode.encodeSegments(
-      h,
-      ft[a],
-      c,
-      void 0,
-      void 0,
-      l
-    );
-  }, [s, a, c, l]), { cells: f, margin: e, numCells: n, calculatedImageSettings: t } = L(() => {
-    const r = m.getModules(), h = Zt(i), $ = r.length + h * 2, d = Xt(r, u, h, o);
-    return {
-      cells: r,
-      margin: h,
-      numCells: $,
-      calculatedImageSettings: d
-    };
-  }, [m, u, o, i]);
-  return {
-    qrcode: m,
-    margin: e,
-    cells: f,
-    numCells: n,
-    calculatedImageSettings: t
-  };
-}, Kt = ({ svgRef: s, fileSize: a, fileName: c }) => {
-  if (!s.current) return;
-  const i = s.current.cloneNode(!0);
-  i.setAttribute("width", a.toString()), i.setAttribute("height", a.toString());
-  const o = new XMLSerializer(), u = new Blob([o.serializeToString(i)], {
-    type: "image/svg+xml"
-  }), l = URL.createObjectURL(u), m = document.createElement("a");
-  m.href = l, m.download = `${c}.svg`, document.body.appendChild(m), m.click(), document.body.removeChild(m), URL.revokeObjectURL(l);
-}, Wt = ({
-  svgRef: s,
-  fileSize: a,
-  fileName: c,
-  fileFormat: i,
-  imageSettings: o,
-  calculatedImageSettings: u,
-  size: l,
-  numCells: m,
-  margin: f
-}) => {
-  if (!s.current) return;
-  const e = document.createElement("canvas"), n = e.getContext("2d");
-  if (!n) return;
-  e.width = a, e.height = a;
-  const t = new XMLSerializer().serializeToString(s.current), r = new Blob([t], { type: "image/svg+xml;charset=utf-8" }), h = URL.createObjectURL(r), $ = new Image();
-  $.crossOrigin = "anonymous", $.src = h, $.onload = () => {
-    if (n.drawImage($, 0, 0, a, a), URL.revokeObjectURL(h), o?.src && u) {
-      const d = new Image();
-      d.crossOrigin = "anonymous", d.src = o.src, d.onload = () => {
-        const M = a / l, g = m / a, A = o.width * M, E = o.x ? (u.x + f) / g : (a - A) / 2, p = o.y ? (u.y + f) / g : (a - A) / 2;
-        n.drawImage(d, E, p, A, A);
-        const N = i === "png" ? "image/png" : "image/jpeg", I = document.createElement("a");
-        I.href = e.toDataURL(N), I.download = `${c}.${i}`, document.body.appendChild(I), I.click(), document.body.removeChild(I);
-      }, d.onerror = (M) => console.error("Error loading logo:", M);
-    } else {
-      const d = i === "png" ? "image/png" : "image/jpeg", M = document.createElement("a");
-      M.href = e.toDataURL(d), M.download = `${c}.${i}`, document.body.appendChild(M), M.click(), document.body.removeChild(M);
-    }
-  }, $.onerror = (d) => console.error("Error loading QR code:", d);
-}, Jt = ct((s, a) => {
-  const {
-    value: c,
-    size: i = pt,
-    level: o = mt,
-    background: u,
-    gradient: l,
-    minVersion: m = gt,
-    boostLevel: f,
-    marginSize: e,
-    finderPatternOuterSettings: n,
-    finderPatternInnerSettings: t,
-    dataModulesSettings: r,
-    imageSettings: h,
-    svgProps: $
-  } = s, d = lt(null), { gradientId: M, bgGradientId: g } = jt(), { margin: A, cells: E, numCells: p, calculatedImageSettings: N } = xt({
-    value: c,
-    level: o,
-    minVersion: m,
-    boostLevel: f,
-    marginSize: e,
-    imageSettings: h,
-    size: i
-  });
-  ht(a, () => ({
-    svg: d.current,
-    download: ({
-      name: O = It,
-      format: _ = "svg",
-      size: z = 500
-    }) => {
-      d.current && (_ === "svg" ? Kt({ svgRef: d, fileSize: z, fileName: O }) : Wt({
-        svgRef: d,
-        fileSize: z,
-        fileName: O,
-        fileFormat: _,
-        imageSettings: h,
-        calculatedImageSettings: N,
-        size: i,
-        numCells: p,
-        margin: A
-      }));
-    }
-  }));
-  let I = E, w = null;
-  h != null && N != null && (N.excavation != null && (I = Vt(E, N.excavation)), w = /* @__PURE__ */ C(
-    "image",
-    {
-      href: h.src,
-      height: N.h,
-      width: N.w,
-      x: N.x + A,
-      y: N.y + A,
-      preserveAspectRatio: "none",
-      opacity: N.opacity,
-      crossOrigin: N.crossOrigin
-    }
-  ));
-  const P = {
-    modules: I,
-    margin: A,
-    gradient: l,
-    gradientId: M
-  };
-  return /* @__PURE__ */ K(
-    "svg",
-    {
-      height: i,
-      width: i,
-      viewBox: `0 0 ${p} ${p}`,
-      ref: d,
-      role: "img",
-      "aria-label": $?.["aria-label"] || "QR Code",
-      ...$,
-      children: [
-        /* @__PURE__ */ C(Gt, { gradient: l, gradientId: M }),
-        /* @__PURE__ */ C(
-          $t,
-          {
-            background: u,
-            bgGradientId: g,
-            numCells: p
-          }
-        ),
-        /* @__PURE__ */ C(Yt, { settings: n, ...P }),
-        /* @__PURE__ */ C(qt, { settings: t, ...P }),
-        /* @__PURE__ */ C(Qt, { settings: r, ...P }),
-        w
-      ]
-    }
-  );
+   a 0.5 0.5, 0, 0, 1, -1 0`, fe = (e, t, n) => `M ${e + 1} ${t}h -${n / 2}a ${n / 2.5} ${n / 2.5}, 0, 0, 0, ${-n / 2.5} ${n / 2.5}v ${n / 2}h ${n / 2}a ${n / 2.5} ${n / 2.5}, 0, 0, 0, ${n / 2.5} ${-n / 2.5}`, pe = (e) => ({
+	color: e?.color || "#000000",
+	style: e?.style || "square",
+	randomSize: e?.randomSize || !1
+}), me = (e) => ({
+	color: e?.color || "#000000",
+	style: e?.style || "square"
+}), he = (e) => ({
+	color: e?.color || "#000000",
+	style: e?.style || "square"
+}), ge = ({ modules: e, margin: n, settings: r, gradient: a, gradientId: o }) => {
+	let { color: c, style: l, randomSize: u } = i(() => pe(r), [r]), d = [], m = e.length, h = se(l) && u, g = t(() => ce(l, h), [l, h]);
+	return e.forEach((t, r) => {
+		t.forEach((t, i) => {
+			if (I({
+				x: i,
+				y: r,
+				numCells: m
+			}) || P({
+				x: i,
+				y: r,
+				numCells: m
+			})) return;
+			let a = g(), o = 1 * a, s = (1 - 1 * a) / 2, c = i + n + s, u = r + n + s;
+			if (t) {
+				if (l === "circuit-board") {
+					let t = i + n + .5, a = r + n + .5, o = T / 2, s = 1 + T, c = le(i, r, e, m), { right: l, bottom: u, count: f } = c;
+					if (l && d.push(z(t - o, a - o, s, T)), u && d.push(z(t - o, a - o, T, s)), f === 0) {
+						let e = .75, t = (1 - e) / 2;
+						d.push(B(i + n + t, r + n + t, e));
+					} else ue({
+						...c,
+						count: f
+					}) && d.push(U(t, a, E));
+				} else if (l === "square" || l === "square-sm") d.push(B(c, u, o));
+				else if (l === "pinched-square") d.push(p(c, u, o, .25));
+				else if (l === "circle") d.push(V(c, u, o));
+				else if (l === "diamond") d.push(H(c, u, o));
+				else if (l === "star") d.push(f(c + o / 2, u + o / 2, o * 1.1, 5));
+				else if (l === "heart") d.push(b(c, u, o));
+				else if (l === "hashtag") d.push(y(c, u, o));
+				else if (l === "rounded") {
+					let { left: t, right: n, top: a, bottom: o, count: s } = L(i, r, e);
+					s === 0 ? d.push(V(c, u, 1)) : s > 2 || t && n || a && o ? d.push(B(c, u, 1)) : s === 2 ? t && a ? d.push(G(c, u)) : a && n ? d.push(K(c, u)) : n && o ? d.push(W(c, u)) : d.push(de(c, u)) : a ? d.push(X(c, u)) : n ? d.push(J(c, u)) : o ? d.push(Y(c, u)) : d.push(q(c, u));
+				} else if (l === "leaf") {
+					let { left: t, right: n, top: a, bottom: s, count: l } = L(i, r, e);
+					if (l === 0) d.push(fe(c, u, o));
+					else if (!t && !a) {
+						d.push(W(c, u));
+						return;
+					} else !n && !s ? d.push(G(c, u)) : d.push(B(c, u, 1));
+				} else if (l === "vertical-line") {
+					let { left: t, right: n, top: a, bottom: o, count: s } = L(i, r, e);
+					s === 0 || t && !(a || o) || n && !(a || o) ? d.push(V(c, u, 1)) : a && o ? d.push(B(c, u, 1)) : a && !o ? d.push(X(c, u)) : o && !a && d.push(Y(c, u));
+				} else if (l === "horizontal-line") {
+					let { left: t, right: n, top: a, bottom: o, count: s } = L(i, r, e);
+					s === 0 || a && !(t || n) || o && !(t || n) ? d.push(V(c, u, 1)) : t && n ? d.push(B(c, u, 1)) : t && !n ? d.push(q(c, u)) : n && !t && d.push(J(c, u));
+				}
+			}
+		});
+	}), /* @__PURE__ */ s("path", {
+		fill: a ? `url(#${o})` : c,
+		d: d.join(""),
+		shapeRendering: l === "square" ? "crispEdges" : "geometricPrecision",
+		"data-testid": "data-modules"
+	});
+}, Z = { "data-testid": "finder-patterns-inner" }, _e = ({ modules: e, margin: t, settings: n, gradient: r, gradientId: a }) => {
+	let { color: o, style: c } = i(() => he(n), [n]), l = r ? `url(#${a})` : o, u = i(() => [
+		{
+			x: t + 2,
+			y: t + 2
+		},
+		{
+			x: e.length + t - 7 + 2,
+			y: t + 2
+		},
+		{
+			x: t + 2,
+			y: e.length + t - 7 + 2
+		}
+	], [t, e.length]), d = (e, t) => `finder-patterns-inner-${c}-${e}-${t}`;
+	if (c === "rounded-sm" || c === "rounded" || c === "rounded-lg" || c === "circle" || c === "square") return u.map((e) => {
+		let { x: t, y: n } = e;
+		return /* @__PURE__ */ s("rect", {
+			x: t,
+			y: n,
+			width: 3,
+			height: 3,
+			fill: l,
+			rx: M[c],
+			...Z
+		}, d(t, n));
+	});
+	if (c === "pinched-square") return u.map((e) => {
+		let { x: t, y: n } = e;
+		return /* @__PURE__ */ s("path", {
+			fill: l,
+			d: p(t, n, 3, .25),
+			...Z
+		}, d(t, n));
+	});
+	if (c === "diamond") return u.map((e) => {
+		let { x: t, y: n } = e, r = Math.sqrt(1.5), i = 3 / r, a = i - i / r;
+		return /* @__PURE__ */ s("rect", {
+			x: t + a / 2,
+			y: n + a / 2,
+			width: i,
+			height: i,
+			fill: l,
+			style: {
+				transform: "rotate(45deg)",
+				transformOrigin: "center",
+				transformBox: "fill-box"
+			},
+			...Z
+		}, d(t, n));
+	});
+	if (c === "inpoint-sm" || c === "inpoint" || c === "inpoint-lg" || c === "outpoint-sm" || c === "outpoint" || c === "outpoint-lg" || c === "leaf-sm" || c === "leaf" || c === "leaf-lg") {
+		let e = c === "leaf-sm" || c === "leaf" || c === "leaf-lg" ? re : F;
+		return u.map((e, t) => ({
+			...e,
+			rotation: A[c][t]
+		})).map(({ x: t, y: n, rotation: r }) => /* @__PURE__ */ s("path", {
+			fill: l,
+			d: e({
+				x: t,
+				y: n,
+				radius: M[c]
+			}),
+			style: {
+				transform: `rotate(${r}deg)`,
+				transformOrigin: "center",
+				transformBox: "fill-box"
+			},
+			...Z
+		}, d(t, n)));
+	}
+	if (c === "heart") return u.map(({ x: e, y: t }) => /* @__PURE__ */ s("path", {
+		fill: l,
+		d: b(e, t, 3),
+		...Z
+	}, d(e, t)));
+	if (c === "star") return u.map(({ x: e, y: t }) => /* @__PURE__ */ s("path", {
+		fill: l,
+		d: f(e + 3 / 2, t + 3 / 2, 3 * 1.2, 5),
+		...Z
+	}, d(e, t)));
+	if (c === "microchip") return u.map(({ x: e, y: t }) => /* @__PURE__ */ s("path", {
+		fill: l,
+		d: v(e, t, 3),
+		...Z
+	}, d(e, t)));
+	if (c === "hashtag") return u.map(({ x: e, y: t }) => /* @__PURE__ */ s("path", {
+		fill: l,
+		d: y(e - .25, t - .25, 3.5),
+		...Z
+	}, d(e, t)));
+}, Q = { "data-testid": "finder-patterns-outer" }, ve = ({ modules: e, margin: t, settings: n, gradient: r, gradientId: a }) => {
+	let { style: o, color: c } = i(() => me(n), [n]), l = r ? `url(#${a})` : c, u = [], d = i(() => [
+		{
+			x: t,
+			y: t
+		},
+		{
+			x: e.length + t - 7,
+			y: t
+		},
+		{
+			x: t,
+			y: e.length + t - 7
+		}
+	], [t, e.length]);
+	if ([
+		"rounded-sm",
+		"rounded",
+		"rounded-lg",
+		"circle",
+		"square",
+		"pinched-square"
+	].includes(o)) {
+		for (let e of d) {
+			let { x: t, y: n } = e;
+			if (o === "rounded-sm" || o === "rounded" || o === "rounded-lg") u.push(ie({
+				x: t,
+				y: n,
+				radius: j[o]
+			}));
+			else if (o === "circle") u.push(`M ${t + 7 / 2} ${n}a ${7 / 2} ${7 / 2} 0 1 0 0.01 0zzm 0 1a ${7 / 2 - 1} ${7 / 2 - 1} 0 1 1 -0.01 0Z`);
+			else if (o === "pinched-square") {
+				let e = .5, r = 1.25;
+				u.push(`M ${t} ${n}Q ${t + e} ${n + 7 / 2}, ${t} ${n + 7}Q ${t + 7 / 2} ${n + 7 - e}, ${t + 7} ${n + 7}Q ${t + 7 - e} ${n + 7 / 2}, ${t + 7} ${n}Q ${t + 7 / 2} ${n + e}, ${t} ${n}zM ${t + 1} ${n + 1}Q ${t + 7 / 2} ${n + r}, ${t + 7 - 1} ${n + 1}Q ${t + 7 - r} ${n + 7 / 2}, ${t + 7 - 1} ${n + 7 - 1}Q ${t + 7 / 2} ${n + 7 - r}, ${t + 1} ${n + 7 - 1}Q ${t + r} ${n + 7 / 2}, ${t + 1} ${n + 1}z`);
+			} else u.push(`M ${t} ${n}v 7h 7v -7zM ${t + 1} ${n + 1}h 5v 5h -5z`);
+		}
+		return /* @__PURE__ */ s("path", {
+			fill: l,
+			d: u.join(""),
+			...Q
+		});
+	}
+	if (o === "inpoint-sm" || o === "inpoint" || o === "inpoint-lg" || o === "outpoint-sm" || o === "outpoint" || o === "outpoint-lg" || o === "leaf-sm" || o === "leaf" || o === "leaf-lg") {
+		let e = o === "leaf-sm" || o === "leaf" || o === "leaf-lg" ? ae : oe;
+		return d.map((e, t) => ({
+			...e,
+			rotation: A[o][t]
+		})).map(({ x: t, y: n, rotation: r }) => /* @__PURE__ */ s("path", {
+			fill: l,
+			d: e({
+				x: t,
+				y: n,
+				radius: j[o]
+			}),
+			style: {
+				transform: `rotate(${r}deg)`,
+				transformOrigin: "center",
+				transformBox: "fill-box"
+			},
+			...Q
+		}, `finder-patterns-outer-${o}-${t}-${n}`));
+	}
+}, ye = ({ gradient: e, gradientId: t }) => {
+	if (!e) return null;
+	let n = d(e?.rotation || 0);
+	return /* @__PURE__ */ s("defs", { children: e.type === "linear" ? /* @__PURE__ */ s("linearGradient", {
+		id: t,
+		gradientUnits: "userSpaceOnUse",
+		...n,
+		children: e.stops?.map((e, t) => /* @__PURE__ */ s("stop", {
+			offset: e.offset,
+			stopColor: e.color
+		}, t))
+	}) : /* @__PURE__ */ s("radialGradient", {
+		id: t,
+		gradientUnits: "userSpaceOnUse",
+		cx: "50%",
+		cy: "50%",
+		r: "50%",
+		children: e.stops?.map((e, t) => /* @__PURE__ */ s("stop", {
+			offset: e.offset,
+			stopColor: e.color
+		}, t))
+	}) });
+}, be = () => {
+	let e = n();
+	return {
+		gradientId: `${D}-${e}`,
+		bgGradientId: `${O}-${e}`
+	};
+}, xe = (e, t) => e.slice().map((e, n) => n < t.y || n >= t.y + t.h ? e : e.map((e, n) => n < t.x || n >= t.x + t.w ? e : !1)), Se = (e, t, n, r) => {
+	if (r == null) return null;
+	let i = e.length + n * 2, a = Math.floor(t * ne), o = i / t, s = (r.width || a) * o, c = (r.height || a) * o, l = r.x == null ? e.length / 2 - s / 2 : r.x * o, u = r.y == null ? e.length / 2 - c / 2 : r.y * o, d = r.opacity == null ? 1 : r.opacity, f = null;
+	if (r.excavate) {
+		let e = Math.floor(l), t = Math.floor(u);
+		f = {
+			x: e,
+			y: t,
+			w: Math.ceil(s + l - e),
+			h: Math.ceil(c + u - t)
+		};
+	}
+	let p = r.crossOrigin;
+	return {
+		x: l,
+		y: u,
+		h: c,
+		w: s,
+		excavation: f,
+		opacity: d,
+		crossOrigin: p
+	};
+}, Ce = (e) => e == null ? 4 : Math.max(Math.floor(e), 0), we = ({ value: e, level: t, minVersion: n, marginSize: r, imageSettings: a, size: o, boostLevel: s }) => {
+	let c = i(() => {
+		let r = (Array.isArray(e) ? e : [e]).reduce((e, t) => (e.push(...C.QrSegment.makeSegments(t)), e), []);
+		return C.QrCode.encodeSegments(r, w[t], n, void 0, void 0, s);
+	}, [
+		e,
+		t,
+		n,
+		s
+	]), { cells: l, margin: u, numCells: d, calculatedImageSettings: f } = i(() => {
+		let e = c.getModules(), t = Ce(r);
+		return {
+			cells: e,
+			margin: t,
+			numCells: e.length + t * 2,
+			calculatedImageSettings: Se(e, o, t, a)
+		};
+	}, [
+		c,
+		o,
+		a,
+		r
+	]);
+	return {
+		qrcode: c,
+		margin: u,
+		cells: l,
+		numCells: d,
+		calculatedImageSettings: f
+	};
+}, Te = ({ svgRef: e, fileSize: t, fileName: n }) => {
+	if (!e.current) return;
+	let r = e.current.cloneNode(!0);
+	r.setAttribute("width", t.toString()), r.setAttribute("height", t.toString());
+	let i = new XMLSerializer(), a = new Blob([i.serializeToString(r)], { type: "image/svg+xml" }), o = URL.createObjectURL(a), s = document.createElement("a");
+	s.href = o, s.download = `${n}.svg`, document.body.appendChild(s), s.click(), document.body.removeChild(s), URL.revokeObjectURL(o);
+}, Ee = ({ svgRef: e, fileSize: t, fileName: n, fileFormat: r, imageSettings: i, calculatedImageSettings: a, size: o, numCells: s, margin: c }) => {
+	if (!e.current) return;
+	let l = document.createElement("canvas"), u = l.getContext("2d");
+	if (!u) return;
+	l.width = t, l.height = t;
+	let d = new XMLSerializer().serializeToString(e.current), f = new Blob([d], { type: "image/svg+xml;charset=utf-8" }), p = URL.createObjectURL(f), m = new Image();
+	m.crossOrigin = "anonymous", m.src = p, m.onload = () => {
+		if (u.drawImage(m, 0, 0, t, t), URL.revokeObjectURL(p), i?.src && a) {
+			let e = new Image();
+			e.crossOrigin = "anonymous", e.src = i.src, e.onload = () => {
+				let d = t / o, f = s / t, p = i.width * d, m = i.x ? (a.x + c) / f : (t - p) / 2, h = i.y ? (a.y + c) / f : (t - p) / 2;
+				u.drawImage(e, m, h, p, p);
+				let g = r === "png" ? "image/png" : "image/jpeg", _ = document.createElement("a");
+				_.href = l.toDataURL(g), _.download = `${n}.${r}`, document.body.appendChild(_), _.click(), document.body.removeChild(_);
+			}, e.onerror = (e) => console.error("Error loading logo:", e);
+		} else {
+			let e = r === "png" ? "image/png" : "image/jpeg", t = document.createElement("a");
+			t.href = l.toDataURL(e), t.download = `${n}.${r}`, document.body.appendChild(t), t.click(), document.body.removeChild(t);
+		}
+	}, m.onerror = (e) => console.error("Error loading QR code:", e);
+}, $ = e((e, t) => {
+	let { value: n, size: i = 128, level: o = "M", background: l, gradient: u, minVersion: d = 1, boostLevel: f, marginSize: p, finderPatternOuterSettings: m, finderPatternInnerSettings: h, dataModulesSettings: g, imageSettings: _, svgProps: v } = e, y = a(null), { gradientId: b, bgGradientId: x } = be(), { margin: S, cells: C, numCells: w, calculatedImageSettings: T } = we({
+		value: n,
+		level: o,
+		minVersion: d,
+		boostLevel: f,
+		marginSize: p,
+		imageSettings: _,
+		size: i
+	});
+	r(t, () => ({
+		svg: y.current,
+		download: ({ name: e = te, format: t = "svg", size: n = 500 }) => {
+			y.current && (t === "svg" ? Te({
+				svgRef: y,
+				fileSize: n,
+				fileName: e
+			}) : Ee({
+				svgRef: y,
+				fileSize: n,
+				fileName: e,
+				fileFormat: t,
+				imageSettings: _,
+				calculatedImageSettings: T,
+				size: i,
+				numCells: w,
+				margin: S
+			}));
+		}
+	}));
+	let E = C, D = null;
+	_ != null && T != null && (T.excavation != null && (E = xe(C, T.excavation)), D = /* @__PURE__ */ s("image", {
+		href: _.src,
+		height: T.h,
+		width: T.w,
+		x: T.x + S,
+		y: T.y + S,
+		preserveAspectRatio: "none",
+		opacity: T.opacity,
+		crossOrigin: T.crossOrigin
+	}));
+	let O = {
+		modules: E,
+		margin: S,
+		gradient: u,
+		gradientId: b
+	};
+	return /* @__PURE__ */ c("svg", {
+		height: i,
+		width: i,
+		viewBox: `0 0 ${w} ${w}`,
+		ref: y,
+		role: "img",
+		"aria-label": v?.["aria-label"] || "QR Code",
+		...v,
+		children: [
+			/* @__PURE__ */ s(ye, {
+				gradient: u,
+				gradientId: b
+			}),
+			/* @__PURE__ */ s(ee, {
+				background: l,
+				bgGradientId: x,
+				numCells: w
+			}),
+			/* @__PURE__ */ s(ve, {
+				settings: m,
+				...O
+			}),
+			/* @__PURE__ */ s(_e, {
+				settings: h,
+				...O
+			}),
+			/* @__PURE__ */ s(ge, {
+				settings: g,
+				...O
+			}),
+			D
+		]
+	});
 });
-Jt.displayName = "ReactQRCode";
-export {
-  Jt as ReactQRCode
-};
+$.displayName = "ReactQRCode";
+//#endregion
+export { $ as ReactQRCode };