react-tech-ui 1.0.0

package/dist/chunks/QRCode-BRcujxUT.js

@@ -0,0 +1,1535 @@
+import { j as T } from "./jsx-runtime-C6iVud2f.js";
+import { useState as Lt, useRef as Ut, useCallback as Dt, useEffect as dt } from "react";
+import { c as vt } from "./index-CcykAxZN.js";
+var H = {}, Ft = function() {
+  return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
+}, wt = {}, I = {};
+let ct;
+const kt = [
+  0,
+  // Not used
+  26,
+  44,
+  70,
+  100,
+  134,
+  172,
+  196,
+  242,
+  292,
+  346,
+  404,
+  466,
+  532,
+  581,
+  655,
+  733,
+  815,
+  901,
+  991,
+  1085,
+  1156,
+  1258,
+  1364,
+  1474,
+  1588,
+  1706,
+  1828,
+  1921,
+  2051,
+  2185,
+  2323,
+  2465,
+  2611,
+  2761,
+  2876,
+  3034,
+  3196,
+  3362,
+  3532,
+  3706
+];
+I.getSymbolSize = function(t) {
+  if (!t) throw new Error('"version" cannot be null or undefined');
+  if (t < 1 || t > 40) throw new Error('"version" should be in range from 1 to 40');
+  return t * 4 + 17;
+};
+I.getSymbolTotalCodewords = function(t) {
+  return kt[t];
+};
+I.getBCHDigit = function(e) {
+  let t = 0;
+  for (; e !== 0; )
+    t++, e >>>= 1;
+  return t;
+};
+I.setToSJISFunction = function(t) {
+  if (typeof t != "function")
+    throw new Error('"toSJISFunc" is not a valid function.');
+  ct = t;
+};
+I.isKanjiModeEnabled = function() {
+  return typeof ct < "u";
+};
+I.toSJIS = function(t) {
+  return ct(t);
+};
+var $ = {};
+(function(e) {
+  e.L = { bit: 1 }, e.M = { bit: 0 }, e.Q = { bit: 3 }, e.H = { bit: 2 };
+  function t(i) {
+    if (typeof i != "string")
+      throw new Error("Param is not a string");
+    switch (i.toLowerCase()) {
+      case "l":
+      case "low":
+        return e.L;
+      case "m":
+      case "medium":
+        return e.M;
+      case "q":
+      case "quartile":
+        return e.Q;
+      case "h":
+      case "high":
+        return e.H;
+      default:
+        throw new Error("Unknown EC Level: " + i);
+    }
+  }
+  e.isValid = function(r) {
+    return r && typeof r.bit < "u" && r.bit >= 0 && r.bit < 4;
+  }, e.from = function(r, n) {
+    if (e.isValid(r))
+      return r;
+    try {
+      return t(r);
+    } catch {
+      return n;
+    }
+  };
+})($);
+function yt() {
+  this.buffer = [], this.length = 0;
+}
+yt.prototype = {
+  get: function(e) {
+    const t = Math.floor(e / 8);
+    return (this.buffer[t] >>> 7 - e % 8 & 1) === 1;
+  },
+  put: function(e, t) {
+    for (let i = 0; i < t; i++)
+      this.putBit((e >>> t - i - 1 & 1) === 1);
+  },
+  getLengthInBits: function() {
+    return this.length;
+  },
+  putBit: function(e) {
+    const t = Math.floor(this.length / 8);
+    this.buffer.length <= t && this.buffer.push(0), e && (this.buffer[t] |= 128 >>> this.length % 8), this.length++;
+  }
+};
+var jt = yt;
+function q(e) {
+  if (!e || e < 1)
+    throw new Error("BitMatrix size must be defined and greater than 0");
+  this.size = e, this.data = new Uint8Array(e * e), this.reservedBit = new Uint8Array(e * e);
+}
+q.prototype.set = function(e, t, i, r) {
+  const n = e * this.size + t;
+  this.data[n] = i, r && (this.reservedBit[n] = !0);
+};
+q.prototype.get = function(e, t) {
+  return this.data[e * this.size + t];
+};
+q.prototype.xor = function(e, t, i) {
+  this.data[e * this.size + t] ^= i;
+};
+q.prototype.isReserved = function(e, t) {
+  return this.reservedBit[e * this.size + t];
+};
+var zt = q, Et = {};
+(function(e) {
+  const t = I.getSymbolSize;
+  e.getRowColCoords = function(r) {
+    if (r === 1) return [];
+    const n = Math.floor(r / 7) + 2, o = t(r), s = o === 145 ? 26 : Math.ceil((o - 13) / (2 * n - 2)) * 2, a = [o - 7];
+    for (let c = 1; c < n - 1; c++)
+      a[c] = a[c - 1] - s;
+    return a.push(6), a.reverse();
+  }, e.getPositions = function(r) {
+    const n = [], o = e.getRowColCoords(r), s = o.length;
+    for (let a = 0; a < s; a++)
+      for (let c = 0; c < s; c++)
+        a === 0 && c === 0 || // top-left
+        a === 0 && c === s - 1 || // bottom-left
+        a === s - 1 && c === 0 || n.push([o[a], o[c]]);
+    return n;
+  };
+})(Et);
+var Ct = {};
+const Ht = I.getSymbolSize, gt = 7;
+Ct.getPositions = function(t) {
+  const i = Ht(t);
+  return [
+    // top-left
+    [0, 0],
+    // top-right
+    [i - gt, 0],
+    // bottom-left
+    [0, i - gt]
+  ];
+};
+var pt = {};
+(function(e) {
+  e.Patterns = {
+    PATTERN000: 0,
+    PATTERN001: 1,
+    PATTERN010: 2,
+    PATTERN011: 3,
+    PATTERN100: 4,
+    PATTERN101: 5,
+    PATTERN110: 6,
+    PATTERN111: 7
+  };
+  const t = {
+    N1: 3,
+    N2: 3,
+    N3: 40,
+    N4: 10
+  };
+  e.isValid = function(n) {
+    return n != null && n !== "" && !isNaN(n) && n >= 0 && n <= 7;
+  }, e.from = function(n) {
+    return e.isValid(n) ? parseInt(n, 10) : void 0;
+  }, e.getPenaltyN1 = function(n) {
+    const o = n.size;
+    let s = 0, a = 0, c = 0, u = null, l = null;
+    for (let p = 0; p < o; p++) {
+      a = c = 0, u = l = null;
+      for (let m = 0; m < o; m++) {
+        let f = n.get(p, m);
+        f === u ? a++ : (a >= 5 && (s += t.N1 + (a - 5)), u = f, a = 1), f = n.get(m, p), f === l ? c++ : (c >= 5 && (s += t.N1 + (c - 5)), l = f, c = 1);
+      }
+      a >= 5 && (s += t.N1 + (a - 5)), c >= 5 && (s += t.N1 + (c - 5));
+    }
+    return s;
+  }, e.getPenaltyN2 = function(n) {
+    const o = n.size;
+    let s = 0;
+    for (let a = 0; a < o - 1; a++)
+      for (let c = 0; c < o - 1; c++) {
+        const u = n.get(a, c) + n.get(a, c + 1) + n.get(a + 1, c) + n.get(a + 1, c + 1);
+        (u === 4 || u === 0) && s++;
+      }
+    return s * t.N2;
+  }, e.getPenaltyN3 = function(n) {
+    const o = n.size;
+    let s = 0, a = 0, c = 0;
+    for (let u = 0; u < o; u++) {
+      a = c = 0;
+      for (let l = 0; l < o; l++)
+        a = a << 1 & 2047 | n.get(u, l), l >= 10 && (a === 1488 || a === 93) && s++, c = c << 1 & 2047 | n.get(l, u), l >= 10 && (c === 1488 || c === 93) && s++;
+    }
+    return s * t.N3;
+  }, e.getPenaltyN4 = function(n) {
+    let o = 0;
+    const s = n.data.length;
+    for (let c = 0; c < s; c++) o += n.data[c];
+    return Math.abs(Math.ceil(o * 100 / s / 5) - 10) * t.N4;
+  };
+  function i(r, n, o) {
+    switch (r) {
+      case e.Patterns.PATTERN000:
+        return (n + o) % 2 === 0;
+      case e.Patterns.PATTERN001:
+        return n % 2 === 0;
+      case e.Patterns.PATTERN010:
+        return o % 3 === 0;
+      case e.Patterns.PATTERN011:
+        return (n + o) % 3 === 0;
+      case e.Patterns.PATTERN100:
+        return (Math.floor(n / 2) + Math.floor(o / 3)) % 2 === 0;
+      case e.Patterns.PATTERN101:
+        return n * o % 2 + n * o % 3 === 0;
+      case e.Patterns.PATTERN110:
+        return (n * o % 2 + n * o % 3) % 2 === 0;
+      case e.Patterns.PATTERN111:
+        return (n * o % 3 + (n + o) % 2) % 2 === 0;
+      default:
+        throw new Error("bad maskPattern:" + r);
+    }
+  }
+  e.applyMask = function(n, o) {
+    const s = o.size;
+    for (let a = 0; a < s; a++)
+      for (let c = 0; c < s; c++)
+        o.isReserved(c, a) || o.xor(c, a, i(n, c, a));
+  }, e.getBestMask = function(n, o) {
+    const s = Object.keys(e.Patterns).length;
+    let a = 0, c = 1 / 0;
+    for (let u = 0; u < s; u++) {
+      o(u), e.applyMask(u, n);
+      const l = e.getPenaltyN1(n) + e.getPenaltyN2(n) + e.getPenaltyN3(n) + e.getPenaltyN4(n);
+      e.applyMask(u, n), l < c && (c = l, a = u);
+    }
+    return a;
+  };
+})(pt);
+var Q = {};
+const _ = $, K = [
+  // L  M  Q  H
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  1,
+  2,
+  2,
+  1,
+  2,
+  2,
+  4,
+  1,
+  2,
+  4,
+  4,
+  2,
+  4,
+  4,
+  4,
+  2,
+  4,
+  6,
+  5,
+  2,
+  4,
+  6,
+  6,
+  2,
+  5,
+  8,
+  8,
+  4,
+  5,
+  8,
+  8,
+  4,
+  5,
+  8,
+  11,
+  4,
+  8,
+  10,
+  11,
+  4,
+  9,
+  12,
+  16,
+  4,
+  9,
+  16,
+  16,
+  6,
+  10,
+  12,
+  18,
+  6,
+  10,
+  17,
+  16,
+  6,
+  11,
+  16,
+  19,
+  6,
+  13,
+  18,
+  21,
+  7,
+  14,
+  21,
+  25,
+  8,
+  16,
+  20,
+  25,
+  8,
+  17,
+  23,
+  25,
+  9,
+  17,
+  23,
+  34,
+  9,
+  18,
+  25,
+  30,
+  10,
+  20,
+  27,
+  32,
+  12,
+  21,
+  29,
+  35,
+  12,
+  23,
+  34,
+  37,
+  12,
+  25,
+  34,
+  40,
+  13,
+  26,
+  35,
+  42,
+  14,
+  28,
+  38,
+  45,
+  15,
+  29,
+  40,
+  48,
+  16,
+  31,
+  43,
+  51,
+  17,
+  33,
+  45,
+  54,
+  18,
+  35,
+  48,
+  57,
+  19,
+  37,
+  51,
+  60,
+  19,
+  38,
+  53,
+  63,
+  20,
+  40,
+  56,
+  66,
+  21,
+  43,
+  59,
+  70,
+  22,
+  45,
+  62,
+  74,
+  24,
+  47,
+  65,
+  77,
+  25,
+  49,
+  68,
+  81
+], V = [
+  // L  M  Q  H
+  7,
+  10,
+  13,
+  17,
+  10,
+  16,
+  22,
+  28,
+  15,
+  26,
+  36,
+  44,
+  20,
+  36,
+  52,
+  64,
+  26,
+  48,
+  72,
+  88,
+  36,
+  64,
+  96,
+  112,
+  40,
+  72,
+  108,
+  130,
+  48,
+  88,
+  132,
+  156,
+  60,
+  110,
+  160,
+  192,
+  72,
+  130,
+  192,
+  224,
+  80,
+  150,
+  224,
+  264,
+  96,
+  176,
+  260,
+  308,
+  104,
+  198,
+  288,
+  352,
+  120,
+  216,
+  320,
+  384,
+  132,
+  240,
+  360,
+  432,
+  144,
+  280,
+  408,
+  480,
+  168,
+  308,
+  448,
+  532,
+  180,
+  338,
+  504,
+  588,
+  196,
+  364,
+  546,
+  650,
+  224,
+  416,
+  600,
+  700,
+  224,
+  442,
+  644,
+  750,
+  252,
+  476,
+  690,
+  816,
+  270,
+  504,
+  750,
+  900,
+  300,
+  560,
+  810,
+  960,
+  312,
+  588,
+  870,
+  1050,
+  336,
+  644,
+  952,
+  1110,
+  360,
+  700,
+  1020,
+  1200,
+  390,
+  728,
+  1050,
+  1260,
+  420,
+  784,
+  1140,
+  1350,
+  450,
+  812,
+  1200,
+  1440,
+  480,
+  868,
+  1290,
+  1530,
+  510,
+  924,
+  1350,
+  1620,
+  540,
+  980,
+  1440,
+  1710,
+  570,
+  1036,
+  1530,
+  1800,
+  570,
+  1064,
+  1590,
+  1890,
+  600,
+  1120,
+  1680,
+  1980,
+  630,
+  1204,
+  1770,
+  2100,
+  660,
+  1260,
+  1860,
+  2220,
+  720,
+  1316,
+  1950,
+  2310,
+  750,
+  1372,
+  2040,
+  2430
+];
+Q.getBlocksCount = function(t, i) {
+  switch (i) {
+    case _.L:
+      return K[(t - 1) * 4 + 0];
+    case _.M:
+      return K[(t - 1) * 4 + 1];
+    case _.Q:
+      return K[(t - 1) * 4 + 2];
+    case _.H:
+      return K[(t - 1) * 4 + 3];
+    default:
+      return;
+  }
+};
+Q.getTotalCodewordsCount = function(t, i) {
+  switch (i) {
+    case _.L:
+      return V[(t - 1) * 4 + 0];
+    case _.M:
+      return V[(t - 1) * 4 + 1];
+    case _.Q:
+      return V[(t - 1) * 4 + 2];
+    case _.H:
+      return V[(t - 1) * 4 + 3];
+    default:
+      return;
+  }
+};
+var Bt = {}, G = {};
+const j = new Uint8Array(512), O = new Uint8Array(256);
+(function() {
+  let t = 1;
+  for (let i = 0; i < 255; i++)
+    j[i] = t, O[t] = i, t <<= 1, t & 256 && (t ^= 285);
+  for (let i = 255; i < 512; i++)
+    j[i] = j[i - 255];
+})();
+G.log = function(t) {
+  if (t < 1) throw new Error("log(" + t + ")");
+  return O[t];
+};
+G.exp = function(t) {
+  return j[t];
+};
+G.mul = function(t, i) {
+  return t === 0 || i === 0 ? 0 : j[O[t] + O[i]];
+};
+(function(e) {
+  const t = G;
+  e.mul = function(r, n) {
+    const o = new Uint8Array(r.length + n.length - 1);
+    for (let s = 0; s < r.length; s++)
+      for (let a = 0; a < n.length; a++)
+        o[s + a] ^= t.mul(r[s], n[a]);
+    return o;
+  }, e.mod = function(r, n) {
+    let o = new Uint8Array(r);
+    for (; o.length - n.length >= 0; ) {
+      const s = o[0];
+      for (let c = 0; c < n.length; c++)
+        o[c] ^= t.mul(n[c], s);
+      let a = 0;
+      for (; a < o.length && o[a] === 0; ) a++;
+      o = o.slice(a);
+    }
+    return o;
+  }, e.generateECPolynomial = function(r) {
+    let n = new Uint8Array([1]);
+    for (let o = 0; o < r; o++)
+      n = e.mul(n, new Uint8Array([1, t.exp(o)]));
+    return n;
+  };
+})(Bt);
+const Nt = Bt;
+function at(e) {
+  this.genPoly = void 0, this.degree = e, this.degree && this.initialize(this.degree);
+}
+at.prototype.initialize = function(t) {
+  this.degree = t, this.genPoly = Nt.generateECPolynomial(this.degree);
+};
+at.prototype.encode = function(t) {
+  if (!this.genPoly)
+    throw new Error("Encoder not initialized");
+  const i = new Uint8Array(t.length + this.degree);
+  i.set(t);
+  const r = Nt.mod(i, this.genPoly), n = this.degree - r.length;
+  if (n > 0) {
+    const o = new Uint8Array(this.degree);
+    return o.set(r, n), o;
+  }
+  return r;
+};
+var qt = at, At = {}, L = {}, ut = {};
+ut.isValid = function(t) {
+  return !isNaN(t) && t >= 1 && t <= 40;
+};
+var S = {};
+const Tt = "[0-9]+", Kt = "[A-Z $%*+\\-./:]+";
+let z = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
+z = z.replace(/u/g, "\\u");
+const Vt = "(?:(?![A-Z0-9 $%*+\\-./:]|" + z + `)(?:.|[\r
+]))+`;
+S.KANJI = new RegExp(z, "g");
+S.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g");
+S.BYTE = new RegExp(Vt, "g");
+S.NUMERIC = new RegExp(Tt, "g");
+S.ALPHANUMERIC = new RegExp(Kt, "g");
+const Jt = new RegExp("^" + z + "$"), Ot = new RegExp("^" + Tt + "$"), Yt = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
+S.testKanji = function(t) {
+  return Jt.test(t);
+};
+S.testNumeric = function(t) {
+  return Ot.test(t);
+};
+S.testAlphanumeric = function(t) {
+  return Yt.test(t);
+};
+(function(e) {
+  const t = ut, i = S;
+  e.NUMERIC = {
+    id: "Numeric",
+    bit: 1,
+    ccBits: [10, 12, 14]
+  }, e.ALPHANUMERIC = {
+    id: "Alphanumeric",
+    bit: 2,
+    ccBits: [9, 11, 13]
+  }, e.BYTE = {
+    id: "Byte",
+    bit: 4,
+    ccBits: [8, 16, 16]
+  }, e.KANJI = {
+    id: "Kanji",
+    bit: 8,
+    ccBits: [8, 10, 12]
+  }, e.MIXED = {
+    bit: -1
+  }, e.getCharCountIndicator = function(o, s) {
+    if (!o.ccBits) throw new Error("Invalid mode: " + o);
+    if (!t.isValid(s))
+      throw new Error("Invalid version: " + s);
+    return s >= 1 && s < 10 ? o.ccBits[0] : s < 27 ? o.ccBits[1] : o.ccBits[2];
+  }, e.getBestModeForData = function(o) {
+    return i.testNumeric(o) ? e.NUMERIC : i.testAlphanumeric(o) ? e.ALPHANUMERIC : i.testKanji(o) ? e.KANJI : e.BYTE;
+  }, e.toString = function(o) {
+    if (o && o.id) return o.id;
+    throw new Error("Invalid mode");
+  }, e.isValid = function(o) {
+    return o && o.bit && o.ccBits;
+  };
+  function r(n) {
+    if (typeof n != "string")
+      throw new Error("Param is not a string");
+    switch (n.toLowerCase()) {
+      case "numeric":
+        return e.NUMERIC;
+      case "alphanumeric":
+        return e.ALPHANUMERIC;
+      case "kanji":
+        return e.KANJI;
+      case "byte":
+        return e.BYTE;
+      default:
+        throw new Error("Unknown mode: " + n);
+    }
+  }
+  e.from = function(o, s) {
+    if (e.isValid(o))
+      return o;
+    try {
+      return r(o);
+    } catch {
+      return s;
+    }
+  };
+})(L);
+(function(e) {
+  const t = I, i = Q, r = $, n = L, o = ut, s = 7973, a = t.getBCHDigit(s);
+  function c(m, f, w) {
+    for (let y = 1; y <= 40; y++)
+      if (f <= e.getCapacity(y, w, m))
+        return y;
+  }
+  function u(m, f) {
+    return n.getCharCountIndicator(m, f) + 4;
+  }
+  function l(m, f) {
+    let w = 0;
+    return m.forEach(function(y) {
+      const B = u(y.mode, f);
+      w += B + y.getBitsLength();
+    }), w;
+  }
+  function p(m, f) {
+    for (let w = 1; w <= 40; w++)
+      if (l(m, w) <= e.getCapacity(w, f, n.MIXED))
+        return w;
+  }
+  e.from = function(f, w) {
+    return o.isValid(f) ? parseInt(f, 10) : w;
+  }, e.getCapacity = function(f, w, y) {
+    if (!o.isValid(f))
+      throw new Error("Invalid QR Code version");
+    typeof y > "u" && (y = n.BYTE);
+    const B = t.getSymbolTotalCodewords(f), d = i.getTotalCodewordsCount(f, w), E = (B - d) * 8;
+    if (y === n.MIXED) return E;
+    const h = E - u(y, f);
+    switch (y) {
+      case n.NUMERIC:
+        return Math.floor(h / 10 * 3);
+      case n.ALPHANUMERIC:
+        return Math.floor(h / 11 * 2);
+      case n.KANJI:
+        return Math.floor(h / 13);
+      case n.BYTE:
+      default:
+        return Math.floor(h / 8);
+    }
+  }, e.getBestVersionForData = function(f, w) {
+    let y;
+    const B = r.from(w, r.M);
+    if (Array.isArray(f)) {
+      if (f.length > 1)
+        return p(f, B);
+      if (f.length === 0)
+        return 1;
+      y = f[0];
+    } else
+      y = f;
+    return c(y.mode, y.getLength(), B);
+  }, e.getEncodedBits = function(f) {
+    if (!o.isValid(f) || f < 7)
+      throw new Error("Invalid QR Code version");
+    let w = f << 12;
+    for (; t.getBCHDigit(w) - a >= 0; )
+      w ^= s << t.getBCHDigit(w) - a;
+    return f << 12 | w;
+  };
+})(At);
+var It = {};
+const rt = I, Mt = 1335, $t = 21522, ht = rt.getBCHDigit(Mt);
+It.getEncodedBits = function(t, i) {
+  const r = t.bit << 3 | i;
+  let n = r << 10;
+  for (; rt.getBCHDigit(n) - ht >= 0; )
+    n ^= Mt << rt.getBCHDigit(n) - ht;
+  return (r << 10 | n) ^ $t;
+};
+var bt = {};
+const Qt = L;
+function U(e) {
+  this.mode = Qt.NUMERIC, this.data = e.toString();
+}
+U.getBitsLength = function(t) {
+  return 10 * Math.floor(t / 3) + (t % 3 ? t % 3 * 3 + 1 : 0);
+};
+U.prototype.getLength = function() {
+  return this.data.length;
+};
+U.prototype.getBitsLength = function() {
+  return U.getBitsLength(this.data.length);
+};
+U.prototype.write = function(t) {
+  let i, r, n;
+  for (i = 0; i + 3 <= this.data.length; i += 3)
+    r = this.data.substr(i, 3), n = parseInt(r, 10), t.put(n, 10);
+  const o = this.data.length - i;
+  o > 0 && (r = this.data.substr(i), n = parseInt(r, 10), t.put(n, o * 3 + 1));
+};
+var Gt = U;
+const Wt = L, X = [
+  "0",
+  "1",
+  "2",
+  "3",
+  "4",
+  "5",
+  "6",
+  "7",
+  "8",
+  "9",
+  "A",
+  "B",
+  "C",
+  "D",
+  "E",
+  "F",
+  "G",
+  "H",
+  "I",
+  "J",
+  "K",
+  "L",
+  "M",
+  "N",
+  "O",
+  "P",
+  "Q",
+  "R",
+  "S",
+  "T",
+  "U",
+  "V",
+  "W",
+  "X",
+  "Y",
+  "Z",
+  " ",
+  "$",
+  "%",
+  "*",
+  "+",
+  "-",
+  ".",
+  "/",
+  ":"
+];
+function D(e) {
+  this.mode = Wt.ALPHANUMERIC, this.data = e;
+}
+D.getBitsLength = function(t) {
+  return 11 * Math.floor(t / 2) + 6 * (t % 2);
+};
+D.prototype.getLength = function() {
+  return this.data.length;
+};
+D.prototype.getBitsLength = function() {
+  return D.getBitsLength(this.data.length);
+};
+D.prototype.write = function(t) {
+  let i;
+  for (i = 0; i + 2 <= this.data.length; i += 2) {
+    let r = X.indexOf(this.data[i]) * 45;
+    r += X.indexOf(this.data[i + 1]), t.put(r, 11);
+  }
+  this.data.length % 2 && t.put(X.indexOf(this.data[i]), 6);
+};
+var Zt = D;
+const Xt = L;
+function v(e) {
+  this.mode = Xt.BYTE, typeof e == "string" ? this.data = new TextEncoder().encode(e) : this.data = new Uint8Array(e);
+}
+v.getBitsLength = function(t) {
+  return t * 8;
+};
+v.prototype.getLength = function() {
+  return this.data.length;
+};
+v.prototype.getBitsLength = function() {
+  return v.getBitsLength(this.data.length);
+};
+v.prototype.write = function(e) {
+  for (let t = 0, i = this.data.length; t < i; t++)
+    e.put(this.data[t], 8);
+};
+var xt = v;
+const te = L, ee = I;
+function F(e) {
+  this.mode = te.KANJI, this.data = e;
+}
+F.getBitsLength = function(t) {
+  return t * 13;
+};
+F.prototype.getLength = function() {
+  return this.data.length;
+};
+F.prototype.getBitsLength = function() {
+  return F.getBitsLength(this.data.length);
+};
+F.prototype.write = function(e) {
+  let t;
+  for (t = 0; t < this.data.length; t++) {
+    let i = ee.toSJIS(this.data[t]);
+    if (i >= 33088 && i <= 40956)
+      i -= 33088;
+    else if (i >= 57408 && i <= 60351)
+      i -= 49472;
+    else
+      throw new Error(
+        "Invalid SJIS character: " + this.data[t] + `
+Make sure your charset is UTF-8`
+      );
+    i = (i >>> 8 & 255) * 192 + (i & 255), e.put(i, 13);
+  }
+};
+var ne = F, St = { exports: {} };
+(function(e) {
+  var t = {
+    single_source_shortest_paths: function(i, r, n) {
+      var o = {}, s = {};
+      s[r] = 0;
+      var a = t.PriorityQueue.make();
+      a.push(r, 0);
+      for (var c, u, l, p, m, f, w, y, B; !a.empty(); ) {
+        c = a.pop(), u = c.value, p = c.cost, m = i[u] || {};
+        for (l in m)
+          m.hasOwnProperty(l) && (f = m[l], w = p + f, y = s[l], B = typeof s[l] > "u", (B || y > w) && (s[l] = w, a.push(l, w), o[l] = u));
+      }
+      if (typeof n < "u" && typeof s[n] > "u") {
+        var d = ["Could not find a path from ", r, " to ", n, "."].join("");
+        throw new Error(d);
+      }
+      return o;
+    },
+    extract_shortest_path_from_predecessor_list: function(i, r) {
+      for (var n = [], o = r; o; )
+        n.push(o), i[o], o = i[o];
+      return n.reverse(), n;
+    },
+    find_path: function(i, r, n) {
+      var o = t.single_source_shortest_paths(i, r, n);
+      return t.extract_shortest_path_from_predecessor_list(
+        o,
+        n
+      );
+    },
+    /**
+     * A very naive priority queue implementation.
+     */
+    PriorityQueue: {
+      make: function(i) {
+        var r = t.PriorityQueue, n = {}, o;
+        i = i || {};
+        for (o in r)
+          r.hasOwnProperty(o) && (n[o] = r[o]);
+        return n.queue = [], n.sorter = i.sorter || r.default_sorter, n;
+      },
+      default_sorter: function(i, r) {
+        return i.cost - r.cost;
+      },
+      /**
+       * Add a new item to the queue and ensure the highest priority element
+       * is at the front of the queue.
+       */
+      push: function(i, r) {
+        var n = { value: i, cost: r };
+        this.queue.push(n), this.queue.sort(this.sorter);
+      },
+      /**
+       * Return the highest priority element in the queue.
+       */
+      pop: function() {
+        return this.queue.shift();
+      },
+      empty: function() {
+        return this.queue.length === 0;
+      }
+    }
+  };
+  e.exports = t;
+})(St);
+var re = St.exports;
+(function(e) {
+  const t = L, i = Gt, r = Zt, n = xt, o = ne, s = S, a = I, c = re;
+  function u(d) {
+    return unescape(encodeURIComponent(d)).length;
+  }
+  function l(d, E, h) {
+    const g = [];
+    let C;
+    for (; (C = d.exec(h)) !== null; )
+      g.push({
+        data: C[0],
+        index: C.index,
+        mode: E,
+        length: C[0].length
+      });
+    return g;
+  }
+  function p(d) {
+    const E = l(s.NUMERIC, t.NUMERIC, d), h = l(s.ALPHANUMERIC, t.ALPHANUMERIC, d);
+    let g, C;
+    return a.isKanjiModeEnabled() ? (g = l(s.BYTE, t.BYTE, d), C = l(s.KANJI, t.KANJI, d)) : (g = l(s.BYTE_KANJI, t.BYTE, d), C = []), E.concat(h, g, C).sort(function(A, M) {
+      return A.index - M.index;
+    }).map(function(A) {
+      return {
+        data: A.data,
+        mode: A.mode,
+        length: A.length
+      };
+    });
+  }
+  function m(d, E) {
+    switch (E) {
+      case t.NUMERIC:
+        return i.getBitsLength(d);
+      case t.ALPHANUMERIC:
+        return r.getBitsLength(d);
+      case t.KANJI:
+        return o.getBitsLength(d);
+      case t.BYTE:
+        return n.getBitsLength(d);
+    }
+  }
+  function f(d) {
+    return d.reduce(function(E, h) {
+      const g = E.length - 1 >= 0 ? E[E.length - 1] : null;
+      return g && g.mode === h.mode ? (E[E.length - 1].data += h.data, E) : (E.push(h), E);
+    }, []);
+  }
+  function w(d) {
+    const E = [];
+    for (let h = 0; h < d.length; h++) {
+      const g = d[h];
+      switch (g.mode) {
+        case t.NUMERIC:
+          E.push([
+            g,
+            { data: g.data, mode: t.ALPHANUMERIC, length: g.length },
+            { data: g.data, mode: t.BYTE, length: g.length }
+          ]);
+          break;
+        case t.ALPHANUMERIC:
+          E.push([
+            g,
+            { data: g.data, mode: t.BYTE, length: g.length }
+          ]);
+          break;
+        case t.KANJI:
+          E.push([
+            g,
+            { data: g.data, mode: t.BYTE, length: u(g.data) }
+          ]);
+          break;
+        case t.BYTE:
+          E.push([
+            { data: g.data, mode: t.BYTE, length: u(g.data) }
+          ]);
+      }
+    }
+    return E;
+  }
+  function y(d, E) {
+    const h = {}, g = { start: {} };
+    let C = ["start"];
+    for (let N = 0; N < d.length; N++) {
+      const A = d[N], M = [];
+      for (let R = 0; R < A.length; R++) {
+        const b = A[R], k = "" + N + R;
+        M.push(k), h[k] = { node: b, lastCount: 0 }, g[k] = {};
+        for (let Z = 0; Z < C.length; Z++) {
+          const P = C[Z];
+          h[P] && h[P].node.mode === b.mode ? (g[P][k] = m(h[P].lastCount + b.length, b.mode) - m(h[P].lastCount, b.mode), h[P].lastCount += b.length) : (h[P] && (h[P].lastCount = b.length), g[P][k] = m(b.length, b.mode) + 4 + t.getCharCountIndicator(b.mode, E));
+        }
+      }
+      C = M;
+    }
+    for (let N = 0; N < C.length; N++)
+      g[C[N]].end = 0;
+    return { map: g, table: h };
+  }
+  function B(d, E) {
+    let h;
+    const g = t.getBestModeForData(d);
+    if (h = t.from(E, g), h !== t.BYTE && h.bit < g.bit)
+      throw new Error('"' + d + '" cannot be encoded with mode ' + t.toString(h) + `.
+ Suggested mode is: ` + t.toString(g));
+    switch (h === t.KANJI && !a.isKanjiModeEnabled() && (h = t.BYTE), h) {
+      case t.NUMERIC:
+        return new i(d);
+      case t.ALPHANUMERIC:
+        return new r(d);
+      case t.KANJI:
+        return new o(d);
+      case t.BYTE:
+        return new n(d);
+    }
+  }
+  e.fromArray = function(E) {
+    return E.reduce(function(h, g) {
+      return typeof g == "string" ? h.push(B(g, null)) : g.data && h.push(B(g.data, g.mode)), h;
+    }, []);
+  }, e.fromString = function(E, h) {
+    const g = p(E, a.isKanjiModeEnabled()), C = w(g), N = y(C, h), A = c.find_path(N.map, "start", "end"), M = [];
+    for (let R = 1; R < A.length - 1; R++)
+      M.push(N.table[A[R]].node);
+    return e.fromArray(f(M));
+  }, e.rawSplit = function(E) {
+    return e.fromArray(
+      p(E, a.isKanjiModeEnabled())
+    );
+  };
+})(bt);
+const W = I, x = $, oe = jt, ie = zt, se = Et, ce = Ct, ot = pt, it = Q, ae = qt, Y = At, ue = It, le = L, tt = bt;
+function fe(e, t) {
+  const i = e.size, r = ce.getPositions(t);
+  for (let n = 0; n < r.length; n++) {
+    const o = r[n][0], s = r[n][1];
+    for (let a = -1; a <= 7; a++)
+      if (!(o + a <= -1 || i <= o + a))
+        for (let c = -1; c <= 7; c++)
+          s + c <= -1 || i <= s + c || (a >= 0 && a <= 6 && (c === 0 || c === 6) || c >= 0 && c <= 6 && (a === 0 || a === 6) || a >= 2 && a <= 4 && c >= 2 && c <= 4 ? e.set(o + a, s + c, !0, !0) : e.set(o + a, s + c, !1, !0));
+  }
+}
+function de(e) {
+  const t = e.size;
+  for (let i = 8; i < t - 8; i++) {
+    const r = i % 2 === 0;
+    e.set(i, 6, r, !0), e.set(6, i, r, !0);
+  }
+}
+function ge(e, t) {
+  const i = se.getPositions(t);
+  for (let r = 0; r < i.length; r++) {
+    const n = i[r][0], o = i[r][1];
+    for (let s = -2; s <= 2; s++)
+      for (let a = -2; a <= 2; a++)
+        s === -2 || s === 2 || a === -2 || a === 2 || s === 0 && a === 0 ? e.set(n + s, o + a, !0, !0) : e.set(n + s, o + a, !1, !0);
+  }
+}
+function he(e, t) {
+  const i = e.size, r = Y.getEncodedBits(t);
+  let n, o, s;
+  for (let a = 0; a < 18; a++)
+    n = Math.floor(a / 3), o = a % 3 + i - 8 - 3, s = (r >> a & 1) === 1, e.set(n, o, s, !0), e.set(o, n, s, !0);
+}
+function et(e, t, i) {
+  const r = e.size, n = ue.getEncodedBits(t, i);
+  let o, s;
+  for (o = 0; o < 15; o++)
+    s = (n >> o & 1) === 1, o < 6 ? e.set(o, 8, s, !0) : o < 8 ? e.set(o + 1, 8, s, !0) : e.set(r - 15 + o, 8, s, !0), o < 8 ? e.set(8, r - o - 1, s, !0) : o < 9 ? e.set(8, 15 - o - 1 + 1, s, !0) : e.set(8, 15 - o - 1, s, !0);
+  e.set(r - 8, 8, 1, !0);
+}
+function me(e, t) {
+  const i = e.size;
+  let r = -1, n = i - 1, o = 7, s = 0;
+  for (let a = i - 1; a > 0; a -= 2)
+    for (a === 6 && a--; ; ) {
+      for (let c = 0; c < 2; c++)
+        if (!e.isReserved(n, a - c)) {
+          let u = !1;
+          s < t.length && (u = (t[s] >>> o & 1) === 1), e.set(n, a - c, u), o--, o === -1 && (s++, o = 7);
+        }
+      if (n += r, n < 0 || i <= n) {
+        n -= r, r = -r;
+        break;
+      }
+    }
+}
+function we(e, t, i) {
+  const r = new oe();
+  i.forEach(function(c) {
+    r.put(c.mode.bit, 4), r.put(c.getLength(), le.getCharCountIndicator(c.mode, e)), c.write(r);
+  });
+  const n = W.getSymbolTotalCodewords(e), o = it.getTotalCodewordsCount(e, t), s = (n - o) * 8;
+  for (r.getLengthInBits() + 4 <= s && r.put(0, 4); r.getLengthInBits() % 8 !== 0; )
+    r.putBit(0);
+  const a = (s - r.getLengthInBits()) / 8;
+  for (let c = 0; c < a; c++)
+    r.put(c % 2 ? 17 : 236, 8);
+  return ye(r, e, t);
+}
+function ye(e, t, i) {
+  const r = W.getSymbolTotalCodewords(t), n = it.getTotalCodewordsCount(t, i), o = r - n, s = it.getBlocksCount(t, i), a = r % s, c = s - a, u = Math.floor(r / s), l = Math.floor(o / s), p = l + 1, m = u - l, f = new ae(m);
+  let w = 0;
+  const y = new Array(s), B = new Array(s);
+  let d = 0;
+  const E = new Uint8Array(e.buffer);
+  for (let A = 0; A < s; A++) {
+    const M = A < c ? l : p;
+    y[A] = E.slice(w, w + M), B[A] = f.encode(y[A]), w += M, d = Math.max(d, M);
+  }
+  const h = new Uint8Array(r);
+  let g = 0, C, N;
+  for (C = 0; C < d; C++)
+    for (N = 0; N < s; N++)
+      C < y[N].length && (h[g++] = y[N][C]);
+  for (C = 0; C < m; C++)
+    for (N = 0; N < s; N++)
+      h[g++] = B[N][C];
+  return h;
+}
+function Ee(e, t, i, r) {
+  let n;
+  if (Array.isArray(e))
+    n = tt.fromArray(e);
+  else if (typeof e == "string") {
+    let u = t;
+    if (!u) {
+      const l = tt.rawSplit(e);
+      u = Y.getBestVersionForData(l, i);
+    }
+    n = tt.fromString(e, u || 40);
+  } else
+    throw new Error("Invalid data");
+  const o = Y.getBestVersionForData(n, i);
+  if (!o)
+    throw new Error("The amount of data is too big to be stored in a QR Code");
+  if (!t)
+    t = o;
+  else if (t < o)
+    throw new Error(
+      `
+The chosen QR Code version cannot contain this amount of data.
+Minimum version required to store current data is: ` + o + `.
+`
+    );
+  const s = we(t, i, n), a = W.getSymbolSize(t), c = new ie(a);
+  return fe(c, t), de(c), ge(c, t), et(c, i, 0), t >= 7 && he(c, t), me(c, s), isNaN(r) && (r = ot.getBestMask(
+    c,
+    et.bind(null, c, i)
+  )), ot.applyMask(r, c), et(c, i, r), {
+    modules: c,
+    version: t,
+    errorCorrectionLevel: i,
+    maskPattern: r,
+    segments: n
+  };
+}
+wt.create = function(t, i) {
+  if (typeof t > "u" || t === "")
+    throw new Error("No input text");
+  let r = x.M, n, o;
+  return typeof i < "u" && (r = x.from(i.errorCorrectionLevel, x.M), n = Y.from(i.version), o = ot.from(i.maskPattern), i.toSJISFunc && W.setToSJISFunction(i.toSJISFunc)), Ee(t, n, r, o);
+};
+var Pt = {}, lt = {};
+(function(e) {
+  function t(i) {
+    if (typeof i == "number" && (i = i.toString()), typeof i != "string")
+      throw new Error("Color should be defined as hex string");
+    let r = i.slice().replace("#", "").split("");
+    if (r.length < 3 || r.length === 5 || r.length > 8)
+      throw new Error("Invalid hex color: " + i);
+    (r.length === 3 || r.length === 4) && (r = Array.prototype.concat.apply([], r.map(function(o) {
+      return [o, o];
+    }))), r.length === 6 && r.push("F", "F");
+    const n = parseInt(r.join(""), 16);
+    return {
+      r: n >> 24 & 255,
+      g: n >> 16 & 255,
+      b: n >> 8 & 255,
+      a: n & 255,
+      hex: "#" + r.slice(0, 6).join("")
+    };
+  }
+  e.getOptions = function(r) {
+    r || (r = {}), r.color || (r.color = {});
+    const n = typeof r.margin > "u" || r.margin === null || r.margin < 0 ? 4 : r.margin, o = r.width && r.width >= 21 ? r.width : void 0, s = r.scale || 4;
+    return {
+      width: o,
+      scale: o ? 4 : s,
+      margin: n,
+      color: {
+        dark: t(r.color.dark || "#000000ff"),
+        light: t(r.color.light || "#ffffffff")
+      },
+      type: r.type,
+      rendererOpts: r.rendererOpts || {}
+    };
+  }, e.getScale = function(r, n) {
+    return n.width && n.width >= r + n.margin * 2 ? n.width / (r + n.margin * 2) : n.scale;
+  }, e.getImageWidth = function(r, n) {
+    const o = e.getScale(r, n);
+    return Math.floor((r + n.margin * 2) * o);
+  }, e.qrToImageData = function(r, n, o) {
+    const s = n.modules.size, a = n.modules.data, c = e.getScale(s, o), u = Math.floor((s + o.margin * 2) * c), l = o.margin * c, p = [o.color.light, o.color.dark];
+    for (let m = 0; m < u; m++)
+      for (let f = 0; f < u; f++) {
+        let w = (m * u + f) * 4, y = o.color.light;
+        if (m >= l && f >= l && m < u - l && f < u - l) {
+          const B = Math.floor((m - l) / c), d = Math.floor((f - l) / c);
+          y = p[a[B * s + d] ? 1 : 0];
+        }
+        r[w++] = y.r, r[w++] = y.g, r[w++] = y.b, r[w] = y.a;
+      }
+  };
+})(lt);
+(function(e) {
+  const t = lt;
+  function i(n, o, s) {
+    n.clearRect(0, 0, o.width, o.height), o.style || (o.style = {}), o.height = s, o.width = s, o.style.height = s + "px", o.style.width = s + "px";
+  }
+  function r() {
+    try {
+      return document.createElement("canvas");
+    } catch {
+      throw new Error("You need to specify a canvas element");
+    }
+  }
+  e.render = function(o, s, a) {
+    let c = a, u = s;
+    typeof c > "u" && (!s || !s.getContext) && (c = s, s = void 0), s || (u = r()), c = t.getOptions(c);
+    const l = t.getImageWidth(o.modules.size, c), p = u.getContext("2d"), m = p.createImageData(l, l);
+    return t.qrToImageData(m.data, o, c), i(p, u, l), p.putImageData(m, 0, 0), u;
+  }, e.renderToDataURL = function(o, s, a) {
+    let c = a;
+    typeof c > "u" && (!s || !s.getContext) && (c = s, s = void 0), c || (c = {});
+    const u = e.render(o, s, c), l = c.type || "image/png", p = c.rendererOpts || {};
+    return u.toDataURL(l, p.quality);
+  };
+})(Pt);
+var Rt = {};
+const Ce = lt;
+function mt(e, t) {
+  const i = e.a / 255, r = t + '="' + e.hex + '"';
+  return i < 1 ? r + " " + t + '-opacity="' + i.toFixed(2).slice(1) + '"' : r;
+}
+function nt(e, t, i) {
+  let r = e + t;
+  return typeof i < "u" && (r += " " + i), r;
+}
+function pe(e, t, i) {
+  let r = "", n = 0, o = !1, s = 0;
+  for (let a = 0; a < e.length; a++) {
+    const c = Math.floor(a % t), u = Math.floor(a / t);
+    !c && !o && (o = !0), e[a] ? (s++, a > 0 && c > 0 && e[a - 1] || (r += o ? nt("M", c + i, 0.5 + u + i) : nt("m", n, 0), n = 0, o = !1), c + 1 < t && e[a + 1] || (r += nt("h", s), s = 0)) : n++;
+  }
+  return r;
+}
+Rt.render = function(t, i, r) {
+  const n = Ce.getOptions(i), o = t.modules.size, s = t.modules.data, a = o + n.margin * 2, c = n.color.light.a ? "<path " + mt(n.color.light, "fill") + ' d="M0 0h' + a + "v" + a + 'H0z"/>' : "", u = "<path " + mt(n.color.dark, "stroke") + ' d="' + pe(s, o, n.margin) + '"/>', l = 'viewBox="0 0 ' + a + " " + a + '"', m = '<svg xmlns="http://www.w3.org/2000/svg" ' + (n.width ? 'width="' + n.width + '" height="' + n.width + '" ' : "") + l + ' shape-rendering="crispEdges">' + c + u + `</svg>
+`;
+  return typeof r == "function" && r(null, m), m;
+};
+const Be = Ft, st = wt, _t = Pt, Ne = Rt;
+function ft(e, t, i, r, n) {
+  const o = [].slice.call(arguments, 1), s = o.length, a = typeof o[s - 1] == "function";
+  if (!a && !Be())
+    throw new Error("Callback required as last argument");
+  if (a) {
+    if (s < 2)
+      throw new Error("Too few arguments provided");
+    s === 2 ? (n = i, i = t, t = r = void 0) : s === 3 && (t.getContext && typeof n > "u" ? (n = r, r = void 0) : (n = r, r = i, i = t, t = void 0));
+  } else {
+    if (s < 1)
+      throw new Error("Too few arguments provided");
+    return s === 1 ? (i = t, t = r = void 0) : s === 2 && !t.getContext && (r = i, i = t, t = void 0), new Promise(function(c, u) {
+      try {
+        const l = st.create(i, r);
+        c(e(l, t, r));
+      } catch (l) {
+        u(l);
+      }
+    });
+  }
+  try {
+    const c = st.create(i, r);
+    n(null, e(c, t, r));
+  } catch (c) {
+    n(c);
+  }
+}
+H.create = st.create;
+H.toCanvas = ft.bind(null, _t.render);
+H.toDataURL = ft.bind(null, _t.renderToDataURL);
+H.toString = ft.bind(null, function(e, t, i) {
+  return Ne.render(e, i);
+});
+function J(e) {
+  if (!e.startsWith("var(")) return e;
+  const t = e.match(/var\(\s*(--[^,\s)]+)/);
+  return t && getComputedStyle(document.documentElement).getPropertyValue(t[1]).trim() || e;
+}
+const Ae = ({
+  value: e,
+  size: t = 200,
+  variant: i = "default",
+  color: r,
+  bgColor: n,
+  level: o = "M",
+  includeMargin: s = !1,
+  icon: a,
+  iconSize: c = 40,
+  title: u,
+  description: l,
+  className: p,
+  style: m
+}) => {
+  const [f, w] = Lt(""), y = Ut(null), B = Dt(async () => {
+    if (e)
+      try {
+        const d = r ? r.startsWith("var(") ? J(r) : r : J("var(--tech-primary)"), E = n ? n.startsWith("var(") ? J(n) : n : J("var(--tech-bg-medium)"), h = {
+          width: t,
+          margin: s ? 4 : 1,
+          errorCorrectionLevel: a ? "H" : o,
+          color: {
+            dark: d,
+            light: E
+          }
+        }, g = await H.toDataURL(e, h);
+        w(g);
+      } catch (d) {
+        console.error("QR Code generation failed:", d);
+      }
+  }, [e, t, o, s, r, n, a]);
+  return dt(() => {
+    B();
+  }, [B]), dt(() => {
+    const d = new MutationObserver(() => {
+      B();
+    });
+    return d.observe(document.documentElement, {
+      attributes: !0,
+      attributeFilter: ["style"]
+    }), () => d.disconnect();
+  }, [B]), /* @__PURE__ */ T.jsxs(
+    "div",
+    {
+      ref: y,
+      className: vt("tech-qrcode", `tech-qrcode--${i}`, p),
+      style: m,
+      children: [
+        /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__scan-line" }),
+        /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__corner tech-qrcode__corner--tl" }),
+        /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__corner tech-qrcode__corner--tr" }),
+        /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__corner tech-qrcode__corner--bl" }),
+        /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__corner tech-qrcode__corner--br" }),
+        /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__frame", children: /* @__PURE__ */ T.jsxs("div", { className: "tech-qrcode__inner", children: [
+          f && /* @__PURE__ */ T.jsx(
+            "img",
+            {
+              src: f,
+              alt: "QR Code",
+              className: "tech-qrcode__image",
+              style: { width: t, height: t }
+            }
+          ),
+          a && /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__icon", style: { width: c, height: c }, children: /* @__PURE__ */ T.jsx("img", { src: a, alt: "icon", style: { width: "100%", height: "100%", objectFit: "contain" } }) })
+        ] }) }),
+        (u || l) && /* @__PURE__ */ T.jsxs("div", { className: "tech-qrcode__info", children: [
+          u && /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__title", children: u }),
+          l && /* @__PURE__ */ T.jsx("div", { className: "tech-qrcode__desc", children: l })
+        ] })
+      ]
+    }
+  );
+};
+Ae.displayName = "QRCode";
+export {
+  Ae as Q
+};