import { shallowRef as ne, watch as re, createElementBlock as oe, openBlock as ie, createElementVNode as se, unref as ue } from "vue";
import { getDefaultExportFromCjs as ae, toRef as ce, isClient as le } from "./composables-BAZQlC3e.js";
var z = {}, G, Bt;
function fe() {
  return Bt || (Bt = 1, G = function() {
    return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
  }), G;
}
var $ = {}, q = {}, Rt;
function U() {
  if (Rt) return q;
  Rt = 1;
  let r;
  const o = [
    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
  ];
  return q.getSymbolSize = function(e) {
    if (!e) throw new Error('"version" cannot be null or undefined');
    if (e < 1 || e > 40) throw new Error('"version" should be in range from 1 to 40');
    return e * 4 + 17;
  }, q.getSymbolTotalCodewords = function(e) {
    return o[e];
  }, q.getBCHDigit = function(i) {
    let e = 0;
    for (; i !== 0; )
      e++, i >>>= 1;
    return e;
  }, q.setToSJISFunction = function(e) {
    if (typeof e != "function")
      throw new Error('"toSJISFunc" is not a valid function.');
    r = e;
  }, q.isKanjiModeEnabled = function() {
    return typeof r < "u";
  }, q.toSJIS = function(e) {
    return r(e);
  }, q;
}
var W = {}, At;
function Ct() {
  return At || (At = 1, function(r) {
    r.L = { bit: 1 }, r.M = { bit: 0 }, r.Q = { bit: 3 }, r.H = { bit: 2 };
    function o(i) {
      if (typeof i != "string")
        throw new Error("Param is not a string");
      switch (i.toLowerCase()) {
        case "l":
        case "low":
          return r.L;
        case "m":
        case "medium":
          return r.M;
        case "q":
        case "quartile":
          return r.Q;
        case "h":
        case "high":
          return r.H;
        default:
          throw new Error("Unknown EC Level: " + i);
      }
    }
    r.isValid = function(e) {
      return e && typeof e.bit < "u" && e.bit >= 0 && e.bit < 4;
    }, r.from = function(e, t) {
      if (r.isValid(e))
        return e;
      try {
        return o(e);
      } catch {
        return t;
      }
    };
  }(W)), W;
}
var Z, Nt;
function de() {
  if (Nt) return Z;
  Nt = 1;
  function r() {
    this.buffer = [], this.length = 0;
  }
  return r.prototype = {
    get: function(o) {
      const i = Math.floor(o / 8);
      return (this.buffer[i] >>> 7 - o % 8 & 1) === 1;
    },
    put: function(o, i) {
      for (let e = 0; e < i; e++)
        this.putBit((o >>> i - e - 1 & 1) === 1);
    },
    getLengthInBits: function() {
      return this.length;
    },
    putBit: function(o) {
      const i = Math.floor(this.length / 8);
      this.buffer.length <= i && this.buffer.push(0), o && (this.buffer[i] |= 128 >>> this.length % 8), this.length++;
    }
  }, Z = r, Z;
}
var X, Tt;
function ge() {
  if (Tt) return X;
  Tt = 1;
  function r(o) {
    if (!o || o < 1)
      throw new Error("BitMatrix size must be defined and greater than 0");
    this.size = o, this.data = new Uint8Array(o * o), this.reservedBit = new Uint8Array(o * o);
  }
  return r.prototype.set = function(o, i, e, t) {
    const n = o * this.size + i;
    this.data[n] = e, t && (this.reservedBit[n] = !0);
  }, r.prototype.get = function(o, i) {
    return this.data[o * this.size + i];
  }, r.prototype.xor = function(o, i, e) {
    this.data[o * this.size + i] ^= e;
  }, r.prototype.isReserved = function(o, i) {
    return this.reservedBit[o * this.size + i];
  }, X = r, X;
}
var x = {}, It;
function he() {
  return It || (It = 1, function(r) {
    const o = U().getSymbolSize;
    r.getRowColCoords = function(e) {
      if (e === 1) return [];
      const t = Math.floor(e / 7) + 2, n = o(e), s = n === 145 ? 26 : Math.ceil((n - 13) / (2 * t - 2)) * 2, a = [n - 7];
      for (let u = 1; u < t - 1; u++)
        a[u] = a[u - 1] - s;
      return a.push(6), a.reverse();
    }, r.getPositions = function(e) {
      const t = [], n = r.getRowColCoords(e), s = n.length;
      for (let a = 0; a < s; a++)
        for (let u = 0; u < s; u++)
          a === 0 && u === 0 || // top-left
          a === 0 && u === s - 1 || // bottom-left
          a === s - 1 && u === 0 || t.push([n[a], n[u]]);
      return t;
    };
  }(x)), x;
}
var tt = {}, Mt;
function me() {
  if (Mt) return tt;
  Mt = 1;
  const r = U().getSymbolSize, o = 7;
  return tt.getPositions = function(e) {
    const t = r(e);
    return [
      // top-left
      [0, 0],
      // top-right
      [t - o, 0],
      // bottom-left
      [0, t - o]
    ];
  }, tt;
}
var et = {}, Pt;
function we() {
  return Pt || (Pt = 1, function(r) {
    r.Patterns = {
      PATTERN000: 0,
      PATTERN001: 1,
      PATTERN010: 2,
      PATTERN011: 3,
      PATTERN100: 4,
      PATTERN101: 5,
      PATTERN110: 6,
      PATTERN111: 7
    };
    const o = {
      N1: 3,
      N2: 3,
      N3: 40,
      N4: 10
    };
    r.isValid = function(t) {
      return t != null && t !== "" && !isNaN(t) && t >= 0 && t <= 7;
    }, r.from = function(t) {
      return r.isValid(t) ? parseInt(t, 10) : void 0;
    }, r.getPenaltyN1 = function(t) {
      const n = t.size;
      let s = 0, a = 0, u = 0, c = null, d = null;
      for (let p = 0; p < n; p++) {
        a = u = 0, c = d = null;
        for (let h = 0; h < n; h++) {
          let l = t.get(p, h);
          l === c ? a++ : (a >= 5 && (s += o.N1 + (a - 5)), c = l, a = 1), l = t.get(h, p), l === d ? u++ : (u >= 5 && (s += o.N1 + (u - 5)), d = l, u = 1);
        }
        a >= 5 && (s += o.N1 + (a - 5)), u >= 5 && (s += o.N1 + (u - 5));
      }
      return s;
    }, r.getPenaltyN2 = function(t) {
      const n = t.size;
      let s = 0;
      for (let a = 0; a < n - 1; a++)
        for (let u = 0; u < n - 1; u++) {
          const c = t.get(a, u) + t.get(a, u + 1) + t.get(a + 1, u) + t.get(a + 1, u + 1);
          (c === 4 || c === 0) && s++;
        }
      return s * o.N2;
    }, r.getPenaltyN3 = function(t) {
      const n = t.size;
      let s = 0, a = 0, u = 0;
      for (let c = 0; c < n; c++) {
        a = u = 0;
        for (let d = 0; d < n; d++)
          a = a << 1 & 2047 | t.get(c, d), d >= 10 && (a === 1488 || a === 93) && s++, u = u << 1 & 2047 | t.get(d, c), d >= 10 && (u === 1488 || u === 93) && s++;
      }
      return s * o.N3;
    }, r.getPenaltyN4 = function(t) {
      let n = 0;
      const s = t.data.length;
      for (let u = 0; u < s; u++) n += t.data[u];
      return Math.abs(Math.ceil(n * 100 / s / 5) - 10) * o.N4;
    };
    function i(e, t, n) {
      switch (e) {
        case r.Patterns.PATTERN000:
          return (t + n) % 2 === 0;
        case r.Patterns.PATTERN001:
          return t % 2 === 0;
        case r.Patterns.PATTERN010:
          return n % 3 === 0;
        case r.Patterns.PATTERN011:
          return (t + n) % 3 === 0;
        case r.Patterns.PATTERN100:
          return (Math.floor(t / 2) + Math.floor(n / 3)) % 2 === 0;
        case r.Patterns.PATTERN101:
          return t * n % 2 + t * n % 3 === 0;
        case r.Patterns.PATTERN110:
          return (t * n % 2 + t * n % 3) % 2 === 0;
        case r.Patterns.PATTERN111:
          return (t * n % 3 + (t + n) % 2) % 2 === 0;
        default:
          throw new Error("bad maskPattern:" + e);
      }
    }
    r.applyMask = function(t, n) {
      const s = n.size;
      for (let a = 0; a < s; a++)
        for (let u = 0; u < s; u++)
          n.isReserved(u, a) || n.xor(u, a, i(t, u, a));
    }, r.getBestMask = function(t, n) {
      const s = Object.keys(r.Patterns).length;
      let a = 0, u = 1 / 0;
      for (let c = 0; c < s; c++) {
        n(c), r.applyMask(c, t);
        const d = r.getPenaltyN1(t) + r.getPenaltyN2(t) + r.getPenaltyN3(t) + r.getPenaltyN4(t);
        r.applyMask(c, t), d < u && (u = d, a = c);
      }
      return a;
    };
  }(et)), et;
}
var J = {}, St;
function $t() {
  if (St) return J;
  St = 1;
  const r = Ct(), o = [
    // 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
  ], i = [
    // 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
  ];
  return J.getBlocksCount = function(t, n) {
    switch (n) {
      case r.L:
        return o[(t - 1) * 4 + 0];
      case r.M:
        return o[(t - 1) * 4 + 1];
      case r.Q:
        return o[(t - 1) * 4 + 2];
      case r.H:
        return o[(t - 1) * 4 + 3];
      default:
        return;
    }
  }, J.getTotalCodewordsCount = function(t, n) {
    switch (n) {
      case r.L:
        return i[(t - 1) * 4 + 0];
      case r.M:
        return i[(t - 1) * 4 + 1];
      case r.Q:
        return i[(t - 1) * 4 + 2];
      case r.H:
        return i[(t - 1) * 4 + 3];
      default:
        return;
    }
  }, J;
}
var nt = {}, K = {}, bt;
function Ce() {
  if (bt) return K;
  bt = 1;
  const r = new Uint8Array(512), o = new Uint8Array(256);
  return function() {
    let e = 1;
    for (let t = 0; t < 255; t++)
      r[t] = e, o[e] = t, e <<= 1, e & 256 && (e ^= 285);
    for (let t = 255; t < 512; t++)
      r[t] = r[t - 255];
  }(), K.log = function(e) {
    if (e < 1) throw new Error("log(" + e + ")");
    return o[e];
  }, K.exp = function(e) {
    return r[e];
  }, K.mul = function(e, t) {
    return e === 0 || t === 0 ? 0 : r[o[e] + o[t]];
  }, K;
}
var Lt;
function ye() {
  return Lt || (Lt = 1, function(r) {
    const o = Ce();
    r.mul = function(e, t) {
      const n = new Uint8Array(e.length + t.length - 1);
      for (let s = 0; s < e.length; s++)
        for (let a = 0; a < t.length; a++)
          n[s + a] ^= o.mul(e[s], t[a]);
      return n;
    }, r.mod = function(e, t) {
      let n = new Uint8Array(e);
      for (; n.length - t.length >= 0; ) {
        const s = n[0];
        for (let u = 0; u < t.length; u++)
          n[u] ^= o.mul(t[u], s);
        let a = 0;
        for (; a < n.length && n[a] === 0; ) a++;
        n = n.slice(a);
      }
      return n;
    }, r.generateECPolynomial = function(e) {
      let t = new Uint8Array([1]);
      for (let n = 0; n < e; n++)
        t = r.mul(t, new Uint8Array([1, o.exp(n)]));
      return t;
    };
  }(nt)), nt;
}
var rt, _t;
function Ee() {
  if (_t) return rt;
  _t = 1;
  const r = ye();
  function o(i) {
    this.genPoly = void 0, this.degree = i, this.degree && this.initialize(this.degree);
  }
  return o.prototype.initialize = function(e) {
    this.degree = e, this.genPoly = r.generateECPolynomial(this.degree);
  }, o.prototype.encode = function(e) {
    if (!this.genPoly)
      throw new Error("Encoder not initialized");
    const t = new Uint8Array(e.length + this.degree);
    t.set(e);
    const n = r.mod(t, this.genPoly), s = this.degree - n.length;
    if (s > 0) {
      const a = new Uint8Array(this.degree);
      return a.set(n, s), a;
    }
    return n;
  }, rt = o, rt;
}
var ot = {}, it = {}, st = {}, vt;
function Wt() {
  return vt || (vt = 1, st.isValid = function(o) {
    return !isNaN(o) && o >= 1 && o <= 40;
  }), st;
}
var L = {}, Dt;
function Zt() {
  if (Dt) return L;
  Dt = 1;
  const r = "[0-9]+", o = "[A-Z $%*+\\-./:]+";
  let i = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
  i = i.replace(/u/g, "\\u");
  const e = "(?:(?![A-Z0-9 $%*+\\-./:]|" + i + `)(?:.|[\r
]))+`;
  L.KANJI = new RegExp(i, "g"), L.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), L.BYTE = new RegExp(e, "g"), L.NUMERIC = new RegExp(r, "g"), L.ALPHANUMERIC = new RegExp(o, "g");
  const t = new RegExp("^" + i + "$"), n = new RegExp("^" + r + "$"), s = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
  return L.testKanji = function(u) {
    return t.test(u);
  }, L.testNumeric = function(u) {
    return n.test(u);
  }, L.testAlphanumeric = function(u) {
    return s.test(u);
  }, L;
}
var qt;
function F() {
  return qt || (qt = 1, function(r) {
    const o = Wt(), i = Zt();
    r.NUMERIC = {
      id: "Numeric",
      bit: 1,
      ccBits: [10, 12, 14]
    }, r.ALPHANUMERIC = {
      id: "Alphanumeric",
      bit: 2,
      ccBits: [9, 11, 13]
    }, r.BYTE = {
      id: "Byte",
      bit: 4,
      ccBits: [8, 16, 16]
    }, r.KANJI = {
      id: "Kanji",
      bit: 8,
      ccBits: [8, 10, 12]
    }, r.MIXED = {
      bit: -1
    }, r.getCharCountIndicator = function(n, s) {
      if (!n.ccBits) throw new Error("Invalid mode: " + n);
      if (!o.isValid(s))
        throw new Error("Invalid version: " + s);
      return s >= 1 && s < 10 ? n.ccBits[0] : s < 27 ? n.ccBits[1] : n.ccBits[2];
    }, r.getBestModeForData = function(n) {
      return i.testNumeric(n) ? r.NUMERIC : i.testAlphanumeric(n) ? r.ALPHANUMERIC : i.testKanji(n) ? r.KANJI : r.BYTE;
    }, r.toString = function(n) {
      if (n && n.id) return n.id;
      throw new Error("Invalid mode");
    }, r.isValid = function(n) {
      return n && n.bit && n.ccBits;
    };
    function e(t) {
      if (typeof t != "string")
        throw new Error("Param is not a string");
      switch (t.toLowerCase()) {
        case "numeric":
          return r.NUMERIC;
        case "alphanumeric":
          return r.ALPHANUMERIC;
        case "kanji":
          return r.KANJI;
        case "byte":
          return r.BYTE;
        default:
          throw new Error("Unknown mode: " + t);
      }
    }
    r.from = function(n, s) {
      if (r.isValid(n))
        return n;
      try {
        return e(n);
      } catch {
        return s;
      }
    };
  }(it)), it;
}
var Ut;
function pe() {
  return Ut || (Ut = 1, function(r) {
    const o = U(), i = $t(), e = Ct(), t = F(), n = Wt(), s = 7973, a = o.getBCHDigit(s);
    function u(h, l, I) {
      for (let M = 1; M <= 40; M++)
        if (l <= r.getCapacity(M, I, h))
          return M;
    }
    function c(h, l) {
      return t.getCharCountIndicator(h, l) + 4;
    }
    function d(h, l) {
      let I = 0;
      return h.forEach(function(M) {
        const S = c(M.mode, l);
        I += S + M.getBitsLength();
      }), I;
    }
    function p(h, l) {
      for (let I = 1; I <= 40; I++)
        if (d(h, I) <= r.getCapacity(I, l, t.MIXED))
          return I;
    }
    r.from = function(l, I) {
      return n.isValid(l) ? parseInt(l, 10) : I;
    }, r.getCapacity = function(l, I, M) {
      if (!n.isValid(l))
        throw new Error("Invalid QR Code version");
      typeof M > "u" && (M = t.BYTE);
      const S = o.getSymbolTotalCodewords(l), A = i.getTotalCodewordsCount(l, I), P = (S - A) * 8;
      if (M === t.MIXED) return P;
      const N = P - c(M, l);
      switch (M) {
        case t.NUMERIC:
          return Math.floor(N / 10 * 3);
        case t.ALPHANUMERIC:
          return Math.floor(N / 11 * 2);
        case t.KANJI:
          return Math.floor(N / 13);
        case t.BYTE:
        default:
          return Math.floor(N / 8);
      }
    }, r.getBestVersionForData = function(l, I) {
      let M;
      const S = e.from(I, e.M);
      if (Array.isArray(l)) {
        if (l.length > 1)
          return p(l, S);
        if (l.length === 0)
          return 1;
        M = l[0];
      } else
        M = l;
      return u(M.mode, M.getLength(), S);
    }, r.getEncodedBits = function(l) {
      if (!n.isValid(l) || l < 7)
        throw new Error("Invalid QR Code version");
      let I = l << 12;
      for (; o.getBCHDigit(I) - a >= 0; )
        I ^= s << o.getBCHDigit(I) - a;
      return l << 12 | I;
    };
  }(ot)), ot;
}
var ut = {}, Ft;
function Be() {
  if (Ft) return ut;
  Ft = 1;
  const r = U(), o = 1335, i = 21522, e = r.getBCHDigit(o);
  return ut.getEncodedBits = function(n, s) {
    const a = n.bit << 3 | s;
    let u = a << 10;
    for (; r.getBCHDigit(u) - e >= 0; )
      u ^= o << r.getBCHDigit(u) - e;
    return (a << 10 | u) ^ i;
  }, ut;
}
var at = {}, ct, kt;
function Re() {
  if (kt) return ct;
  kt = 1;
  const r = F();
  function o(i) {
    this.mode = r.NUMERIC, this.data = i.toString();
  }
  return o.getBitsLength = function(e) {
    return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
  }, o.prototype.getLength = function() {
    return this.data.length;
  }, o.prototype.getBitsLength = function() {
    return o.getBitsLength(this.data.length);
  }, o.prototype.write = function(e) {
    let t, n, s;
    for (t = 0; t + 3 <= this.data.length; t += 3)
      n = this.data.substr(t, 3), s = parseInt(n, 10), e.put(s, 10);
    const a = this.data.length - t;
    a > 0 && (n = this.data.substr(t), s = parseInt(n, 10), e.put(s, a * 3 + 1));
  }, ct = o, ct;
}
var lt, zt;
function Ae() {
  if (zt) return lt;
  zt = 1;
  const r = F(), o = [
    "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 i(e) {
    this.mode = r.ALPHANUMERIC, this.data = e;
  }
  return i.getBitsLength = function(t) {
    return 11 * Math.floor(t / 2) + 6 * (t % 2);
  }, i.prototype.getLength = function() {
    return this.data.length;
  }, i.prototype.getBitsLength = function() {
    return i.getBitsLength(this.data.length);
  }, i.prototype.write = function(t) {
    let n;
    for (n = 0; n + 2 <= this.data.length; n += 2) {
      let s = o.indexOf(this.data[n]) * 45;
      s += o.indexOf(this.data[n + 1]), t.put(s, 11);
    }
    this.data.length % 2 && t.put(o.indexOf(this.data[n]), 6);
  }, lt = i, lt;
}
var ft, Vt;
function Ne() {
  if (Vt) return ft;
  Vt = 1;
  const r = F();
  function o(i) {
    this.mode = r.BYTE, typeof i == "string" ? this.data = new TextEncoder().encode(i) : this.data = new Uint8Array(i);
  }
  return o.getBitsLength = function(e) {
    return e * 8;
  }, o.prototype.getLength = function() {
    return this.data.length;
  }, o.prototype.getBitsLength = function() {
    return o.getBitsLength(this.data.length);
  }, o.prototype.write = function(i) {
    for (let e = 0, t = this.data.length; e < t; e++)
      i.put(this.data[e], 8);
  }, ft = o, ft;
}
var dt, Kt;
function Te() {
  if (Kt) return dt;
  Kt = 1;
  const r = F(), o = U();
  function i(e) {
    this.mode = r.KANJI, this.data = e;
  }
  return i.getBitsLength = function(t) {
    return t * 13;
  }, i.prototype.getLength = function() {
    return this.data.length;
  }, i.prototype.getBitsLength = function() {
    return i.getBitsLength(this.data.length);
  }, i.prototype.write = function(e) {
    let t;
    for (t = 0; t < this.data.length; t++) {
      let n = o.toSJIS(this.data[t]);
      if (n >= 33088 && n <= 40956)
        n -= 33088;
      else if (n >= 57408 && n <= 60351)
        n -= 49472;
      else
        throw new Error(
          "Invalid SJIS character: " + this.data[t] + `
Make sure your charset is UTF-8`
        );
      n = (n >>> 8 & 255) * 192 + (n & 255), e.put(n, 13);
    }
  }, dt = i, dt;
}
var gt = { exports: {} }, Ht;
function Ie() {
  return Ht || (Ht = 1, function(r) {
    var o = {
      single_source_shortest_paths: function(i, e, t) {
        var n = {}, s = {};
        s[e] = 0;
        var a = o.PriorityQueue.make();
        a.push(e, 0);
        for (var u, c, d, p, h, l, I, M, S; !a.empty(); ) {
          u = a.pop(), c = u.value, p = u.cost, h = i[c] || {};
          for (d in h)
            h.hasOwnProperty(d) && (l = h[d], I = p + l, M = s[d], S = typeof s[d] > "u", (S || M > I) && (s[d] = I, a.push(d, I), n[d] = c));
        }
        if (typeof t < "u" && typeof s[t] > "u") {
          var A = ["Could not find a path from ", e, " to ", t, "."].join("");
          throw new Error(A);
        }
        return n;
      },
      extract_shortest_path_from_predecessor_list: function(i, e) {
        for (var t = [], n = e; n; )
          t.push(n), i[n], n = i[n];
        return t.reverse(), t;
      },
      find_path: function(i, e, t) {
        var n = o.single_source_shortest_paths(i, e, t);
        return o.extract_shortest_path_from_predecessor_list(
          n,
          t
        );
      },
      /**
       * A very naive priority queue implementation.
       */
      PriorityQueue: {
        make: function(i) {
          var e = o.PriorityQueue, t = {}, n;
          i = i || {};
          for (n in e)
            e.hasOwnProperty(n) && (t[n] = e[n]);
          return t.queue = [], t.sorter = i.sorter || e.default_sorter, t;
        },
        default_sorter: function(i, e) {
          return i.cost - e.cost;
        },
        /**
         * Add a new item to the queue and ensure the highest priority element
         * is at the front of the queue.
         */
        push: function(i, e) {
          var t = { value: i, cost: e };
          this.queue.push(t), 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;
        }
      }
    };
    r.exports = o;
  }(gt)), gt.exports;
}
var Jt;
function Me() {
  return Jt || (Jt = 1, function(r) {
    const o = F(), i = Re(), e = Ae(), t = Ne(), n = Te(), s = Zt(), a = U(), u = Ie();
    function c(A) {
      return unescape(encodeURIComponent(A)).length;
    }
    function d(A, P, N) {
      const B = [];
      let b;
      for (; (b = A.exec(N)) !== null; )
        B.push({
          data: b[0],
          index: b.index,
          mode: P,
          length: b[0].length
        });
      return B;
    }
    function p(A) {
      const P = d(s.NUMERIC, o.NUMERIC, A), N = d(s.ALPHANUMERIC, o.ALPHANUMERIC, A);
      let B, b;
      return a.isKanjiModeEnabled() ? (B = d(s.BYTE, o.BYTE, A), b = d(s.KANJI, o.KANJI, A)) : (B = d(s.BYTE_KANJI, o.BYTE, A), b = []), P.concat(N, B, b).sort(function(y, C) {
        return y.index - C.index;
      }).map(function(y) {
        return {
          data: y.data,
          mode: y.mode,
          length: y.length
        };
      });
    }
    function h(A, P) {
      switch (P) {
        case o.NUMERIC:
          return i.getBitsLength(A);
        case o.ALPHANUMERIC:
          return e.getBitsLength(A);
        case o.KANJI:
          return n.getBitsLength(A);
        case o.BYTE:
          return t.getBitsLength(A);
      }
    }
    function l(A) {
      return A.reduce(function(P, N) {
        const B = P.length - 1 >= 0 ? P[P.length - 1] : null;
        return B && B.mode === N.mode ? (P[P.length - 1].data += N.data, P) : (P.push(N), P);
      }, []);
    }
    function I(A) {
      const P = [];
      for (let N = 0; N < A.length; N++) {
        const B = A[N];
        switch (B.mode) {
          case o.NUMERIC:
            P.push([
              B,
              { data: B.data, mode: o.ALPHANUMERIC, length: B.length },
              { data: B.data, mode: o.BYTE, length: B.length }
            ]);
            break;
          case o.ALPHANUMERIC:
            P.push([
              B,
              { data: B.data, mode: o.BYTE, length: B.length }
            ]);
            break;
          case o.KANJI:
            P.push([
              B,
              { data: B.data, mode: o.BYTE, length: c(B.data) }
            ]);
            break;
          case o.BYTE:
            P.push([
              { data: B.data, mode: o.BYTE, length: c(B.data) }
            ]);
        }
      }
      return P;
    }
    function M(A, P) {
      const N = {}, B = { start: {} };
      let b = ["start"];
      for (let g = 0; g < A.length; g++) {
        const y = A[g], C = [];
        for (let f = 0; f < y.length; f++) {
          const R = y[f], m = "" + g + f;
          C.push(m), N[m] = { node: R, lastCount: 0 }, B[m] = {};
          for (let E = 0; E < b.length; E++) {
            const w = b[E];
            N[w] && N[w].node.mode === R.mode ? (B[w][m] = h(N[w].lastCount + R.length, R.mode) - h(N[w].lastCount, R.mode), N[w].lastCount += R.length) : (N[w] && (N[w].lastCount = R.length), B[w][m] = h(R.length, R.mode) + 4 + o.getCharCountIndicator(R.mode, P));
          }
        }
        b = C;
      }
      for (let g = 0; g < b.length; g++)
        B[b[g]].end = 0;
      return { map: B, table: N };
    }
    function S(A, P) {
      let N;
      const B = o.getBestModeForData(A);
      if (N = o.from(P, B), N !== o.BYTE && N.bit < B.bit)
        throw new Error('"' + A + '" cannot be encoded with mode ' + o.toString(N) + `.
 Suggested mode is: ` + o.toString(B));
      switch (N === o.KANJI && !a.isKanjiModeEnabled() && (N = o.BYTE), N) {
        case o.NUMERIC:
          return new i(A);
        case o.ALPHANUMERIC:
          return new e(A);
        case o.KANJI:
          return new n(A);
        case o.BYTE:
          return new t(A);
      }
    }
    r.fromArray = function(P) {
      return P.reduce(function(N, B) {
        return typeof B == "string" ? N.push(S(B, null)) : B.data && N.push(S(B.data, B.mode)), N;
      }, []);
    }, r.fromString = function(P, N) {
      const B = p(P, a.isKanjiModeEnabled()), b = I(B), g = M(b, N), y = u.find_path(g.map, "start", "end"), C = [];
      for (let f = 1; f < y.length - 1; f++)
        C.push(g.table[y[f]].node);
      return r.fromArray(l(C));
    }, r.rawSplit = function(P) {
      return r.fromArray(
        p(P, a.isKanjiModeEnabled())
      );
    };
  }(at)), at;
}
var Yt;
function Pe() {
  if (Yt) return $;
  Yt = 1;
  const r = U(), o = Ct(), i = de(), e = ge(), t = he(), n = me(), s = we(), a = $t(), u = Ee(), c = pe(), d = Be(), p = F(), h = Me();
  function l(g, y) {
    const C = g.size, f = n.getPositions(y);
    for (let R = 0; R < f.length; R++) {
      const m = f[R][0], E = f[R][1];
      for (let w = -1; w <= 7; w++)
        if (!(m + w <= -1 || C <= m + w))
          for (let T = -1; T <= 7; T++)
            E + T <= -1 || C <= E + T || (w >= 0 && w <= 6 && (T === 0 || T === 6) || T >= 0 && T <= 6 && (w === 0 || w === 6) || w >= 2 && w <= 4 && T >= 2 && T <= 4 ? g.set(m + w, E + T, !0, !0) : g.set(m + w, E + T, !1, !0));
    }
  }
  function I(g) {
    const y = g.size;
    for (let C = 8; C < y - 8; C++) {
      const f = C % 2 === 0;
      g.set(C, 6, f, !0), g.set(6, C, f, !0);
    }
  }
  function M(g, y) {
    const C = t.getPositions(y);
    for (let f = 0; f < C.length; f++) {
      const R = C[f][0], m = C[f][1];
      for (let E = -2; E <= 2; E++)
        for (let w = -2; w <= 2; w++)
          E === -2 || E === 2 || w === -2 || w === 2 || E === 0 && w === 0 ? g.set(R + E, m + w, !0, !0) : g.set(R + E, m + w, !1, !0);
    }
  }
  function S(g, y) {
    const C = g.size, f = c.getEncodedBits(y);
    let R, m, E;
    for (let w = 0; w < 18; w++)
      R = Math.floor(w / 3), m = w % 3 + C - 8 - 3, E = (f >> w & 1) === 1, g.set(R, m, E, !0), g.set(m, R, E, !0);
  }
  function A(g, y, C) {
    const f = g.size, R = d.getEncodedBits(y, C);
    let m, E;
    for (m = 0; m < 15; m++)
      E = (R >> m & 1) === 1, m < 6 ? g.set(m, 8, E, !0) : m < 8 ? g.set(m + 1, 8, E, !0) : g.set(f - 15 + m, 8, E, !0), m < 8 ? g.set(8, f - m - 1, E, !0) : m < 9 ? g.set(8, 15 - m - 1 + 1, E, !0) : g.set(8, 15 - m - 1, E, !0);
    g.set(f - 8, 8, 1, !0);
  }
  function P(g, y) {
    const C = g.size;
    let f = -1, R = C - 1, m = 7, E = 0;
    for (let w = C - 1; w > 0; w -= 2)
      for (w === 6 && w--; ; ) {
        for (let T = 0; T < 2; T++)
          if (!g.isReserved(R, w - T)) {
            let D = !1;
            E < y.length && (D = (y[E] >>> m & 1) === 1), g.set(R, w - T, D), m--, m === -1 && (E++, m = 7);
          }
        if (R += f, R < 0 || C <= R) {
          R -= f, f = -f;
          break;
        }
      }
  }
  function N(g, y, C) {
    const f = new i();
    C.forEach(function(T) {
      f.put(T.mode.bit, 4), f.put(T.getLength(), p.getCharCountIndicator(T.mode, g)), T.write(f);
    });
    const R = r.getSymbolTotalCodewords(g), m = a.getTotalCodewordsCount(g, y), E = (R - m) * 8;
    for (f.getLengthInBits() + 4 <= E && f.put(0, 4); f.getLengthInBits() % 8 !== 0; )
      f.putBit(0);
    const w = (E - f.getLengthInBits()) / 8;
    for (let T = 0; T < w; T++)
      f.put(T % 2 ? 17 : 236, 8);
    return B(f, g, y);
  }
  function B(g, y, C) {
    const f = r.getSymbolTotalCodewords(y), R = a.getTotalCodewordsCount(y, C), m = f - R, E = a.getBlocksCount(y, C), w = f % E, T = E - w, D = Math.floor(f / E), V = Math.floor(m / E), xt = V + 1, yt = D - V, te = new u(yt);
    let Y = 0;
    const H = new Array(E), Et = new Array(E);
    let j = 0;
    const ee = new Uint8Array(g.buffer);
    for (let k = 0; k < E; k++) {
      const Q = k < T ? V : xt;
      H[k] = ee.slice(Y, Y + Q), Et[k] = te.encode(H[k]), Y += Q, j = Math.max(j, Q);
    }
    const O = new Uint8Array(f);
    let pt = 0, _, v;
    for (_ = 0; _ < j; _++)
      for (v = 0; v < E; v++)
        _ < H[v].length && (O[pt++] = H[v][_]);
    for (_ = 0; _ < yt; _++)
      for (v = 0; v < E; v++)
        O[pt++] = Et[v][_];
    return O;
  }
  function b(g, y, C, f) {
    let R;
    if (Array.isArray(g))
      R = h.fromArray(g);
    else if (typeof g == "string") {
      let D = y;
      if (!D) {
        const V = h.rawSplit(g);
        D = c.getBestVersionForData(V, C);
      }
      R = h.fromString(g, D || 40);
    } else
      throw new Error("Invalid data");
    const m = c.getBestVersionForData(R, C);
    if (!m)
      throw new Error("The amount of data is too big to be stored in a QR Code");
    if (!y)
      y = m;
    else if (y < m)
      throw new Error(
        `
The chosen QR Code version cannot contain this amount of data.
Minimum version required to store current data is: ` + m + `.
`
      );
    const E = N(y, C, R), w = r.getSymbolSize(y), T = new e(w);
    return l(T, y), I(T), M(T, y), A(T, C, 0), y >= 7 && S(T, y), P(T, E), isNaN(f) && (f = s.getBestMask(
      T,
      A.bind(null, T, C)
    )), s.applyMask(f, T), A(T, C, f), {
      modules: T,
      version: y,
      errorCorrectionLevel: C,
      maskPattern: f,
      segments: R
    };
  }
  return $.create = function(y, C) {
    if (typeof y > "u" || y === "")
      throw new Error("No input text");
    let f = o.M, R, m;
    return typeof C < "u" && (f = o.from(C.errorCorrectionLevel, o.M), R = c.from(C.version), m = s.from(C.maskPattern), C.toSJISFunc && r.setToSJISFunction(C.toSJISFunc)), b(y, R, f, m);
  }, $;
}
var ht = {}, mt = {}, jt;
function Xt() {
  return jt || (jt = 1, function(r) {
    function o(i) {
      if (typeof i == "number" && (i = i.toString()), typeof i != "string")
        throw new Error("Color should be defined as hex string");
      let e = i.slice().replace("#", "").split("");
      if (e.length < 3 || e.length === 5 || e.length > 8)
        throw new Error("Invalid hex color: " + i);
      (e.length === 3 || e.length === 4) && (e = Array.prototype.concat.apply([], e.map(function(n) {
        return [n, n];
      }))), e.length === 6 && e.push("F", "F");
      const t = parseInt(e.join(""), 16);
      return {
        r: t >> 24 & 255,
        g: t >> 16 & 255,
        b: t >> 8 & 255,
        a: t & 255,
        hex: "#" + e.slice(0, 6).join("")
      };
    }
    r.getOptions = function(e) {
      e || (e = {}), e.color || (e.color = {});
      const t = typeof e.margin > "u" || e.margin === null || e.margin < 0 ? 4 : e.margin, n = e.width && e.width >= 21 ? e.width : void 0, s = e.scale || 4;
      return {
        width: n,
        scale: n ? 4 : s,
        margin: t,
        color: {
          dark: o(e.color.dark || "#000000ff"),
          light: o(e.color.light || "#ffffffff")
        },
        type: e.type,
        rendererOpts: e.rendererOpts || {}
      };
    }, r.getScale = function(e, t) {
      return t.width && t.width >= e + t.margin * 2 ? t.width / (e + t.margin * 2) : t.scale;
    }, r.getImageWidth = function(e, t) {
      const n = r.getScale(e, t);
      return Math.floor((e + t.margin * 2) * n);
    }, r.qrToImageData = function(e, t, n) {
      const s = t.modules.size, a = t.modules.data, u = r.getScale(s, n), c = Math.floor((s + n.margin * 2) * u), d = n.margin * u, p = [n.color.light, n.color.dark];
      for (let h = 0; h < c; h++)
        for (let l = 0; l < c; l++) {
          let I = (h * c + l) * 4, M = n.color.light;
          if (h >= d && l >= d && h < c - d && l < c - d) {
            const S = Math.floor((h - d) / u), A = Math.floor((l - d) / u);
            M = p[a[S * s + A] ? 1 : 0];
          }
          e[I++] = M.r, e[I++] = M.g, e[I++] = M.b, e[I] = M.a;
        }
    };
  }(mt)), mt;
}
var Ot;
function Se() {
  return Ot || (Ot = 1, function(r) {
    const o = Xt();
    function i(t, n, s) {
      t.clearRect(0, 0, n.width, n.height), n.style || (n.style = {}), n.height = s, n.width = s, n.style.height = s + "px", n.style.width = s + "px";
    }
    function e() {
      try {
        return document.createElement("canvas");
      } catch {
        throw new Error("You need to specify a canvas element");
      }
    }
    r.render = function(n, s, a) {
      let u = a, c = s;
      typeof u > "u" && (!s || !s.getContext) && (u = s, s = void 0), s || (c = e()), u = o.getOptions(u);
      const d = o.getImageWidth(n.modules.size, u), p = c.getContext("2d"), h = p.createImageData(d, d);
      return o.qrToImageData(h.data, n, u), i(p, c, d), p.putImageData(h, 0, 0), c;
    }, r.renderToDataURL = function(n, s, a) {
      let u = a;
      typeof u > "u" && (!s || !s.getContext) && (u = s, s = void 0), u || (u = {});
      const c = r.render(n, s, u), d = u.type || "image/png", p = u.rendererOpts || {};
      return c.toDataURL(d, p.quality);
    };
  }(ht)), ht;
}
var wt = {}, Qt;
function be() {
  if (Qt) return wt;
  Qt = 1;
  const r = Xt();
  function o(t, n) {
    const s = t.a / 255, a = n + '="' + t.hex + '"';
    return s < 1 ? a + " " + n + '-opacity="' + s.toFixed(2).slice(1) + '"' : a;
  }
  function i(t, n, s) {
    let a = t + n;
    return typeof s < "u" && (a += " " + s), a;
  }
  function e(t, n, s) {
    let a = "", u = 0, c = !1, d = 0;
    for (let p = 0; p < t.length; p++) {
      const h = Math.floor(p % n), l = Math.floor(p / n);
      !h && !c && (c = !0), t[p] ? (d++, p > 0 && h > 0 && t[p - 1] || (a += c ? i("M", h + s, 0.5 + l + s) : i("m", u, 0), u = 0, c = !1), h + 1 < n && t[p + 1] || (a += i("h", d), d = 0)) : u++;
    }
    return a;
  }
  return wt.render = function(n, s, a) {
    const u = r.getOptions(s), c = n.modules.size, d = n.modules.data, p = c + u.margin * 2, h = u.color.light.a ? "<path " + o(u.color.light, "fill") + ' d="M0 0h' + p + "v" + p + 'H0z"/>' : "", l = "<path " + o(u.color.dark, "stroke") + ' d="' + e(d, c, u.margin) + '"/>', I = 'viewBox="0 0 ' + p + " " + p + '"', S = '<svg xmlns="http://www.w3.org/2000/svg" ' + (u.width ? 'width="' + u.width + '" height="' + u.width + '" ' : "") + I + ' shape-rendering="crispEdges">' + h + l + `</svg>
`;
    return typeof a == "function" && a(null, S), S;
  }, wt;
}
var Gt;
function Le() {
  if (Gt) return z;
  Gt = 1;
  const r = fe(), o = Pe(), i = Se(), e = be();
  function t(n, s, a, u, c) {
    const d = [].slice.call(arguments, 1), p = d.length, h = typeof d[p - 1] == "function";
    if (!h && !r())
      throw new Error("Callback required as last argument");
    if (h) {
      if (p < 2)
        throw new Error("Too few arguments provided");
      p === 2 ? (c = a, a = s, s = u = void 0) : p === 3 && (s.getContext && typeof c > "u" ? (c = u, u = void 0) : (c = u, u = a, a = s, s = void 0));
    } else {
      if (p < 1)
        throw new Error("Too few arguments provided");
      return p === 1 ? (a = s, s = u = void 0) : p === 2 && !s.getContext && (u = a, a = s, s = void 0), new Promise(function(l, I) {
        try {
          const M = o.create(a, u);
          l(n(M, s, u));
        } catch (M) {
          I(M);
        }
      });
    }
    try {
      const l = o.create(a, u);
      c(null, n(l, s, u));
    } catch (l) {
      c(l);
    }
  }
  return z.create = o.create, z.toCanvas = t.bind(null, i.render), z.toDataURL = t.bind(null, i.renderToDataURL), z.toString = t.bind(null, function(n, s, a) {
    return e.render(n, a);
  }), z;
}
var _e = Le();
const ve = /* @__PURE__ */ ae(_e);
function De(r, o) {
  const i = ce(r), e = ne("");
  return re(
    i,
    async (t) => {
      i.value && le && (e.value = await ve.toDataURL(t, o));
    },
    { immediate: !0 }
  ), e;
}
const qe = { class: "min-w-16 flex flex-col items-center" }, Ue = ["src"], ze = {
  __name: "QrShow",
  props: {
    data: { type: String, default: "" },
    size: { type: Number, default: 400 },
    margin: { type: Number, default: 1 }
  },
  setup(r) {
    const o = r, i = De(() => o.data, {
      errorCorrectionLevel: "Q",
      scale: 8,
      margin: 4
    });
    return (e, t) => (ie(), oe("div", qe, [
      se("img", {
        src: ue(i),
        alt: "QR Code"
      }, null, 8, Ue)
    ]));
  }
};
export {
  ze as default
};
//# sourceMappingURL=QrShow-BnaSf0Vr.js.map
