@forgeflowai/chat/chat.bundle.es.js

This is an embeddable Chat widget for n8n. It allows the execution of AI-Powered Workflows through a Chat window.

function ds(t, e) {
  const n = /* @__PURE__ */ Object.create(null), r = t.split(",");
  for (let s = 0; s < r.length; s++)
    n[r[s]] = !0;
  return e ? (s) => !!n[s.toLowerCase()] : (s) => !!n[s];
}
const ue = {}, Bt = [], Je = () => {
}, vl = () => !1, xl = /^on[^a-z]/, or = (t) => xl.test(t), gs = (t) => t.startsWith("onUpdate:"), me = Object.assign, ms = (t, e) => {
  const n = t.indexOf(e);
  n > -1 && t.splice(n, 1);
}, yl = Object.prototype.hasOwnProperty, se = (t, e) => yl.call(t, e), Z = Array.isArray, $t = (t) => cr(t) === "[object Map]", qc = (t) => cr(t) === "[object Set]", ee = (t) => typeof t == "function", _e = (t) => typeof t == "string", _s = (t) => typeof t == "symbol", fe = (t) => t !== null && typeof t == "object", Mc = (t) => fe(t) && ee(t.then) && ee(t.catch), Nc = Object.prototype.toString, cr = (t) => Nc.call(t), kl = (t) => cr(t).slice(8, -1), Ic = (t) => cr(t) === "[object Object]", bs = (t) => _e(t) && t !== "NaN" && t[0] !== "-" && "" + parseInt(t, 10) === t, Hn = /* @__PURE__ */ ds(
  // the leading comma is intentional so empty string "" is also included
  ",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), ir = (t) => {
  const e = /* @__PURE__ */ Object.create(null);
  return (n) => e[n] || (e[n] = t(n));
}, El = /-(\w)/g, Gt = ir((t) => t.replace(El, (e, n) => n ? n.toUpperCase() : "")), wl = /\B([A-Z])/g, Mt = ir(
  (t) => t.replace(wl, "-$1").toLowerCase()
), Fc = ir(
  (t) => t.charAt(0).toUpperCase() + t.slice(1)
), Sr = ir(
  (t) => t ? `on${Fc(t)}` : ""
), bn = (t, e) => !Object.is(t, e), jn = (t, e) => {
  for (let n = 0; n < t.length; n++)
    t[n](e);
}, Gn = (t, e, n) => {
  Object.defineProperty(t, e, {
    configurable: !0,
    enumerable: !1,
    value: n
  });
}, Xr = (t) => {
  const e = parseFloat(t);
  return isNaN(e) ? t : e;
}, Cl = (t) => {
  const e = _e(t) ? Number(t) : NaN;
  return isNaN(e) ? t : e;
};
let Qs;
const Qr = () => Qs || (Qs = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
function vs(t) {
  if (Z(t)) {
    const e = {};
    for (let n = 0; n < t.length; n++) {
      const r = t[n], s = _e(r) ? Tl(r) : vs(r);
      if (s)
        for (const o in s)
          e[o] = s[o];
    }
    return e;
  } else {
    if (_e(t))
      return t;
    if (fe(t))
      return t;
  }
}
const Al = /;(?![^(]*\))/g, Sl = /:([^]+)/, Dl = /\/\*[^]*?\*\//g;
function Tl(t) {
  const e = {};
  return t.replace(Dl, "").split(Al).forEach((n) => {
    if (n) {
      const r = n.split(Sl);
      r.length > 1 && (e[r[0].trim()] = r[1].trim());
    }
  }), e;
}
function Sn(t) {
  let e = "";
  if (_e(t))
    e = t;
  else if (Z(t))
    for (let n = 0; n < t.length; n++) {
      const r = Sn(t[n]);
      r && (e += r + " ");
    }
  else if (fe(t))
    for (const n in t)
      t[n] && (e += n + " ");
  return e.trim();
}
const Rl = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", ql = /* @__PURE__ */ ds(Rl);
function Lc(t) {
  return !!t || t === "";
}
const Zn = (t) => _e(t) ? t : t == null ? "" : Z(t) || fe(t) && (t.toString === Nc || !ee(t.toString)) ? JSON.stringify(t, Oc, 2) : String(t), Oc = (t, e) => e && e.__v_isRef ? Oc(t, e.value) : $t(e) ? {
  [`Map(${e.size})`]: [...e.entries()].reduce((n, [r, s]) => (n[`${r} =>`] = s, n), {})
} : qc(e) ? {
  [`Set(${e.size})`]: [...e.values()]
} : fe(e) && !Z(e) && !Ic(e) ? String(e) : e;
let Be;
class Ml {
  constructor(e = !1) {
    this.detached = e, this._active = !0, this.effects = [], this.cleanups = [], this.parent = Be, !e && Be && (this.index = (Be.scopes || (Be.scopes = [])).push(
      this
    ) - 1);
  }
  get active() {
    return this._active;
  }
  run(e) {
    if (this._active) {
      const n = Be;
      try {
        return Be = this, e();
      } finally {
        Be = n;
      }
    }
  }
  /**
   * This should only be called on non-detached scopes
   * @internal
   */
  on() {
    Be = this;
  }
  /**
   * This should only be called on non-detached scopes
   * @internal
   */
  off() {
    Be = this.parent;
  }
  stop(e) {
    if (this._active) {
      let n, r;
      for (n = 0, r = this.effects.length; n < r; n++)
        this.effects[n].stop();
      for (n = 0, r = this.cleanups.length; n < r; n++)
        this.cleanups[n]();
      if (this.scopes)
        for (n = 0, r = this.scopes.length; n < r; n++)
          this.scopes[n].stop(!0);
      if (!this.detached && this.parent && !e) {
        const s = this.parent.scopes.pop();
        s && s !== this && (this.parent.scopes[this.index] = s, s.index = this.index);
      }
      this.parent = void 0, this._active = !1;
    }
  }
}
function Nl(t, e = Be) {
  e && e.active && e.effects.push(t);
}
function Il() {
  return Be;
}
const xs = (t) => {
  const e = new Set(t);
  return e.w = 0, e.n = 0, e;
}, Pc = (t) => (t.w & ht) > 0, Bc = (t) => (t.n & ht) > 0, Fl = ({ deps: t }) => {
  if (t.length)
    for (let e = 0; e < t.length; e++)
      t[e].w |= ht;
}, Ll = (t) => {
  const { deps: e } = t;
  if (e.length) {
    let n = 0;
    for (let r = 0; r < e.length; r++) {
      const s = e[r];
      Pc(s) && !Bc(s) ? s.delete(t) : e[n++] = s, s.w &= ~ht, s.n &= ~ht;
    }
    e.length = n;
  }
}, Kn = /* @__PURE__ */ new WeakMap();
let un = 0, ht = 1;
const es = 30;
let $e;
const At = Symbol(""), ts = Symbol("");
class ys {
  constructor(e, n = null, r) {
    this.fn = e, this.scheduler = n, this.active = !0, this.deps = [], this.parent = void 0, Nl(this, r);
  }
  run() {
    if (!this.active)
      return this.fn();
    let e = $e, n = at;
    for (; e; ) {
      if (e === this)
        return;
      e = e.parent;
    }
    try {
      return this.parent = $e, $e = this, at = !0, ht = 1 << ++un, un <= es ? Fl(this) : eo(this), this.fn();
    } finally {
      un <= es && Ll(this), ht = 1 << --un, $e = this.parent, at = n, this.parent = void 0, this.deferStop && this.stop();
    }
  }
  stop() {
    $e === this ? this.deferStop = !0 : this.active && (eo(this), this.onStop && this.onStop(), this.active = !1);
  }
}
function eo(t) {
  const { deps: e } = t;
  if (e.length) {
    for (let n = 0; n < e.length; n++)
      e[n].delete(t);
    e.length = 0;
  }
}
let at = !0;
const $c = [];
function Yt() {
  $c.push(at), at = !1;
}
function Xt() {
  const t = $c.pop();
  at = t === void 0 ? !0 : t;
}
function qe(t, e, n) {
  if (at && $e) {
    let r = Kn.get(t);
    r || Kn.set(t, r = /* @__PURE__ */ new Map());
    let s = r.get(n);
    s || r.set(n, s = xs()), zc(s);
  }
}
function zc(t, e) {
  let n = !1;
  un <= es ? Bc(t) || (t.n |= ht, n = !Pc(t)) : n = !t.has($e), n && (t.add($e), $e.deps.push(t));
}
function tt(t, e, n, r, s, o) {
  const c = Kn.get(t);
  if (!c)
    return;
  let i = [];
  if (e === "clear")
    i = [...c.values()];
  else if (n === "length" && Z(t)) {
    const l = Number(r);
    c.forEach((a, u) => {
      (u === "length" || u >= l) && i.push(a);
    });
  } else
    switch (n !== void 0 && i.push(c.get(n)), e) {
      case "add":
        Z(t) ? bs(n) && i.push(c.get("length")) : (i.push(c.get(At)), $t(t) && i.push(c.get(ts)));
        break;
      case "delete":
        Z(t) || (i.push(c.get(At)), $t(t) && i.push(c.get(ts)));
        break;
      case "set":
        $t(t) && i.push(c.get(At));
        break;
    }
  if (i.length === 1)
    i[0] && ns(i[0]);
  else {
    const l = [];
    for (const a of i)
      a && l.push(...a);
    ns(xs(l));
  }
}
function ns(t, e) {
  const n = Z(t) ? t : [...t];
  for (const r of n)
    r.computed && to(r);
  for (const r of n)
    r.computed || to(r);
}
function to(t, e) {
  (t !== $e || t.allowRecurse) && (t.scheduler ? t.scheduler() : t.run());
}
function Ol(t, e) {
  var n;
  return (n = Kn.get(t)) == null ? void 0 : n.get(e);
}
const Pl = /* @__PURE__ */ ds("__proto__,__v_isRef,__isVue"), Uc = new Set(
  /* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((t) => t !== "arguments" && t !== "caller").map((t) => Symbol[t]).filter(_s)
), Bl = /* @__PURE__ */ ks(), $l = /* @__PURE__ */ ks(!1, !0), zl = /* @__PURE__ */ ks(!0), no = /* @__PURE__ */ Ul();
function Ul() {
  const t = {};
  return ["includes", "indexOf", "lastIndexOf"].forEach((e) => {
    t[e] = function(...n) {
      const r = ce(this);
      for (let o = 0, c = this.length; o < c; o++)
        qe(r, "get", o + "");
      const s = r[e](...n);
      return s === -1 || s === !1 ? r[e](...n.map(ce)) : s;
    };
  }), ["push", "pop", "shift", "unshift", "splice"].forEach((e) => {
    t[e] = function(...n) {
      Yt();
      const r = ce(this)[e].apply(this, n);
      return Xt(), r;
    };
  }), t;
}
function Hl(t) {
  const e = ce(this);
  return qe(e, "has", t), e.hasOwnProperty(t);
}
function ks(t = !1, e = !1) {
  return function(r, s, o) {
    if (s === "__v_isReactive")
      return !t;
    if (s === "__v_isReadonly")
      return t;
    if (s === "__v_isShallow")
      return e;
    if (s === "__v_raw" && o === (t ? e ? oa : Zc : e ? Gc : Vc).get(r))
      return r;
    const c = Z(r);
    if (!t) {
      if (c && se(no, s))
        return Reflect.get(no, s, o);
      if (s === "hasOwnProperty")
        return Hl;
    }
    const i = Reflect.get(r, s, o);
    return (_s(s) ? Uc.has(s) : Pl(s)) || (t || qe(r, "get", s), e) ? i : ye(i) ? c && bs(s) ? i : i.value : fe(i) ? t ? Kc(i) : Cs(i) : i;
  };
}
const jl = /* @__PURE__ */ Hc(), Vl = /* @__PURE__ */ Hc(!0);
function Hc(t = !1) {
  return function(n, r, s, o) {
    let c = n[r];
    if (Zt(c) && ye(c) && !ye(s))
      return !1;
    if (!t && (!Wn(s) && !Zt(s) && (c = ce(c), s = ce(s)), !Z(n) && ye(c) && !ye(s)))
      return c.value = s, !0;
    const i = Z(n) && bs(r) ? Number(r) < n.length : se(n, r), l = Reflect.set(n, r, s, o);
    return n === ce(o) && (i ? bn(s, c) && tt(n, "set", r, s) : tt(n, "add", r, s)), l;
  };
}
function Gl(t, e) {
  const n = se(t, e);
  t[e];
  const r = Reflect.deleteProperty(t, e);
  return r && n && tt(t, "delete", e, void 0), r;
}
function Zl(t, e) {
  const n = Reflect.has(t, e);
  return (!_s(e) || !Uc.has(e)) && qe(t, "has", e), n;
}
function Kl(t) {
  return qe(t, "iterate", Z(t) ? "length" : At), Reflect.ownKeys(t);
}
const jc = {
  get: Bl,
  set: jl,
  deleteProperty: Gl,
  has: Zl,
  ownKeys: Kl
}, Wl = {
  get: zl,
  set(t, e) {
    return !0;
  },
  deleteProperty(t, e) {
    return !0;
  }
}, Jl = /* @__PURE__ */ me(
  {},
  jc,
  {
    get: $l,
    set: Vl
  }
), Es = (t) => t, lr = (t) => Reflect.getPrototypeOf(t);
function Mn(t, e, n = !1, r = !1) {
  t = t.__v_raw;
  const s = ce(t), o = ce(e);
  n || (e !== o && qe(s, "get", e), qe(s, "get", o));
  const { has: c } = lr(s), i = r ? Es : n ? Ss : vn;
  if (c.call(s, e))
    return i(t.get(e));
  if (c.call(s, o))
    return i(t.get(o));
  t !== s && t.get(e);
}
function Nn(t, e = !1) {
  const n = this.__v_raw, r = ce(n), s = ce(t);
  return e || (t !== s && qe(r, "has", t), qe(r, "has", s)), t === s ? n.has(t) : n.has(t) || n.has(s);
}
function In(t, e = !1) {
  return t = t.__v_raw, !e && qe(ce(t), "iterate", At), Reflect.get(t, "size", t);
}
function ro(t) {
  t = ce(t);
  const e = ce(this);
  return lr(e).has.call(e, t) || (e.add(t), tt(e, "add", t, t)), this;
}
function so(t, e) {
  e = ce(e);
  const n = ce(this), { has: r, get: s } = lr(n);
  let o = r.call(n, t);
  o || (t = ce(t), o = r.call(n, t));
  const c = s.call(n, t);
  return n.set(t, e), o ? bn(e, c) && tt(n, "set", t, e) : tt(n, "add", t, e), this;
}
function oo(t) {
  const e = ce(this), { has: n, get: r } = lr(e);
  let s = n.call(e, t);
  s || (t = ce(t), s = n.call(e, t)), r && r.call(e, t);
  const o = e.delete(t);
  return s && tt(e, "delete", t, void 0), o;
}
function co() {
  const t = ce(this), e = t.size !== 0, n = t.clear();
  return e && tt(t, "clear", void 0, void 0), n;
}
function Fn(t, e) {
  return function(r, s) {
    const o = this, c = o.__v_raw, i = ce(c), l = e ? Es : t ? Ss : vn;
    return !t && qe(i, "iterate", At), c.forEach((a, u) => r.call(s, l(a), l(u), o));
  };
}
function Ln(t, e, n) {
  return function(...r) {
    const s = this.__v_raw, o = ce(s), c = $t(o), i = t === "entries" || t === Symbol.iterator && c, l = t === "keys" && c, a = s[t](...r), u = n ? Es : e ? Ss : vn;
    return !e && qe(
      o,
      "iterate",
      l ? ts : At
    ), {
      // iterator protocol
      next() {
        const { value: f, done: h } = a.next();
        return h ? { value: f, done: h } : {
          value: i ? [u(f[0]), u(f[1])] : u(f),
          done: h
        };
      },
      // iterable protocol
      [Symbol.iterator]() {
        return this;
      }
    };
  };
}
function rt(t) {
  return function(...e) {
    return t === "delete" ? !1 : this;
  };
}
function Yl() {
  const t = {
    get(o) {
      return Mn(this, o);
    },
    get size() {
      return In(this);
    },
    has: Nn,
    add: ro,
    set: so,
    delete: oo,
    clear: co,
    forEach: Fn(!1, !1)
  }, e = {
    get(o) {
      return Mn(this, o, !1, !0);
    },
    get size() {
      return In(this);
    },
    has: Nn,
    add: ro,
    set: so,
    delete: oo,
    clear: co,
    forEach: Fn(!1, !0)
  }, n = {
    get(o) {
      return Mn(this, o, !0);
    },
    get size() {
      return In(this, !0);
    },
    has(o) {
      return Nn.call(this, o, !0);
    },
    add: rt("add"),
    set: rt("set"),
    delete: rt("delete"),
    clear: rt("clear"),
    forEach: Fn(!0, !1)
  }, r = {
    get(o) {
      return Mn(this, o, !0, !0);
    },
    get size() {
      return In(this, !0);
    },
    has(o) {
      return Nn.call(this, o, !0);
    },
    add: rt("add"),
    set: rt("set"),
    delete: rt("delete"),
    clear: rt("clear"),
    forEach: Fn(!0, !0)
  };
  return ["keys", "values", "entries", Symbol.iterator].forEach((o) => {
    t[o] = Ln(
      o,
      !1,
      !1
    ), n[o] = Ln(
      o,
      !0,
      !1
    ), e[o] = Ln(
      o,
      !1,
      !0
    ), r[o] = Ln(
      o,
      !0,
      !0
    );
  }), [
    t,
    n,
    e,
    r
  ];
}
const [
  Xl,
  Ql,
  ea,
  ta
] = /* @__PURE__ */ Yl();
function ws(t, e) {
  const n = e ? t ? ta : ea : t ? Ql : Xl;
  return (r, s, o) => s === "__v_isReactive" ? !t : s === "__v_isReadonly" ? t : s === "__v_raw" ? r : Reflect.get(
    se(n, s) && s in r ? n : r,
    s,
    o
  );
}
const na = {
  get: /* @__PURE__ */ ws(!1, !1)
}, ra = {
  get: /* @__PURE__ */ ws(!1, !0)
}, sa = {
  get: /* @__PURE__ */ ws(!0, !1)
}, Vc = /* @__PURE__ */ new WeakMap(), Gc = /* @__PURE__ */ new WeakMap(), Zc = /* @__PURE__ */ new WeakMap(), oa = /* @__PURE__ */ new WeakMap();
function ca(t) {
  switch (t) {
    case "Object":
    case "Array":
      return 1;
    case "Map":
    case "Set":
    case "WeakMap":
    case "WeakSet":
      return 2;
    default:
      return 0;
  }
}
function ia(t) {
  return t.__v_skip || !Object.isExtensible(t) ? 0 : ca(kl(t));
}
function Cs(t) {
  return Zt(t) ? t : As(
    t,
    !1,
    jc,
    na,
    Vc
  );
}
function la(t) {
  return As(
    t,
    !1,
    Jl,
    ra,
    Gc
  );
}
function Kc(t) {
  return As(
    t,
    !0,
    Wl,
    sa,
    Zc
  );
}
function As(t, e, n, r, s) {
  if (!fe(t) || t.__v_raw && !(e && t.__v_isReactive))
    return t;
  const o = s.get(t);
  if (o)
    return o;
  const c = ia(t);
  if (c === 0)
    return t;
  const i = new Proxy(
    t,
    c === 2 ? r : n
  );
  return s.set(t, i), i;
}
function zt(t) {
  return Zt(t) ? zt(t.__v_raw) : !!(t && t.__v_isReactive);
}
function Zt(t) {
  return !!(t && t.__v_isReadonly);
}
function Wn(t) {
  return !!(t && t.__v_isShallow);
}
function Wc(t) {
  return zt(t) || Zt(t);
}
function ce(t) {
  const e = t && t.__v_raw;
  return e ? ce(e) : t;
}
function Jc(t) {
  return Gn(t, "__v_skip", !0), t;
}
const vn = (t) => fe(t) ? Cs(t) : t, Ss = (t) => fe(t) ? Kc(t) : t;
function Yc(t) {
  at && $e && (t = ce(t), zc(t.dep || (t.dep = xs())));
}
function Xc(t, e) {
  t = ce(t);
  const n = t.dep;
  n && ns(n);
}
function ye(t) {
  return !!(t && t.__v_isRef === !0);
}
function Ut(t) {
  return aa(t, !1);
}
function aa(t, e) {
  return ye(t) ? t : new ua(t, e);
}
class ua {
  constructor(e, n) {
    this.__v_isShallow = n, this.dep = void 0, this.__v_isRef = !0, this._rawValue = n ? e : ce(e), this._value = n ? e : vn(e);
  }
  get value() {
    return Yc(this), this._value;
  }
  set value(e) {
    const n = this.__v_isShallow || Wn(e) || Zt(e);
    e = n ? e : ce(e), bn(e, this._rawValue) && (this._rawValue = e, this._value = n ? e : vn(e), Xc(this));
  }
}
function ge(t) {
  return ye(t) ? t.value : t;
}
const fa = {
  get: (t, e, n) => ge(Reflect.get(t, e, n)),
  set: (t, e, n, r) => {
    const s = t[e];
    return ye(s) && !ye(n) ? (s.value = n, !0) : Reflect.set(t, e, n, r);
  }
};
function Qc(t) {
  return zt(t) ? t : new Proxy(t, fa);
}
function ha(t) {
  const e = Z(t) ? new Array(t.length) : {};
  for (const n in t)
    e[n] = da(t, n);
  return e;
}
class pa {
  constructor(e, n, r) {
    this._object = e, this._key = n, this._defaultValue = r, this.__v_isRef = !0;
  }
  get value() {
    const e = this._object[this._key];
    return e === void 0 ? this._defaultValue : e;
  }
  set value(e) {
    this._object[this._key] = e;
  }
  get dep() {
    return Ol(ce(this._object), this._key);
  }
}
function da(t, e, n) {
  const r = t[e];
  return ye(r) ? r : new pa(
    t,
    e,
    n
  );
}
class ga {
  constructor(e, n, r, s) {
    this._setter = n, this.dep = void 0, this.__v_isRef = !0, this.__v_isReadonly = !1, this._dirty = !0, this.effect = new ys(e, () => {
      this._dirty || (this._dirty = !0, Xc(this));
    }), this.effect.computed = this, this.effect.active = this._cacheable = !s, this.__v_isReadonly = r;
  }
  get value() {
    const e = ce(this);
    return Yc(e), (e._dirty || !e._cacheable) && (e._dirty = !1, e._value = e.effect.run()), e._value;
  }
  set value(e) {
    this._setter(e);
  }
}
function ma(t, e, n = !1) {
  let r, s;
  const o = ee(t);
  return o ? (r = t, s = Je) : (r = t.get, s = t.set), new ga(r, s, o || !s, n);
}
function ut(t, e, n, r) {
  let s;
  try {
    s = r ? t(...r) : t();
  } catch (o) {
    ar(o, e, n);
  }
  return s;
}
function Fe(t, e, n, r) {
  if (ee(t)) {
    const o = ut(t, e, n, r);
    return o && Mc(o) && o.catch((c) => {
      ar(c, e, n);
    }), o;
  }
  const s = [];
  for (let o = 0; o < t.length; o++)
    s.push(Fe(t[o], e, n, r));
  return s;
}
function ar(t, e, n, r = !0) {
  const s = e ? e.vnode : null;
  if (e) {
    let o = e.parent;
    const c = e.proxy, i = n;
    for (; o; ) {
      const a = o.ec;
      if (a) {
        for (let u = 0; u < a.length; u++)
          if (a[u](t, c, i) === !1)
            return;
      }
      o = o.parent;
    }
    const l = e.appContext.config.errorHandler;
    if (l) {
      ut(
        l,
        null,
        10,
        [t, c, i]
      );
      return;
    }
  }
  _a(t, n, s, r);
}
function _a(t, e, n, r = !0) {
  console.error(t);
}
let xn = !1, rs = !1;
const ke = [];
let Ze = 0;
const Ht = [];
let et = null, yt = 0;
const ei = /* @__PURE__ */ Promise.resolve();
let Ds = null;
function Kt(t) {
  const e = Ds || ei;
  return t ? e.then(this ? t.bind(this) : t) : e;
}
function ba(t) {
  let e = Ze + 1, n = ke.length;
  for (; e < n; ) {
    const r = e + n >>> 1;
    yn(ke[r]) < t ? e = r + 1 : n = r;
  }
  return e;
}
function Ts(t) {
  (!ke.length || !ke.includes(
    t,
    xn && t.allowRecurse ? Ze + 1 : Ze
  )) && (t.id == null ? ke.push(t) : ke.splice(ba(t.id), 0, t), ti());
}
function ti() {
  !xn && !rs && (rs = !0, Ds = ei.then(ri));
}
function va(t) {
  const e = ke.indexOf(t);
  e > Ze && ke.splice(e, 1);
}
function xa(t) {
  Z(t) ? Ht.push(...t) : (!et || !et.includes(
    t,
    t.allowRecurse ? yt + 1 : yt
  )) && Ht.push(t), ti();
}
function io(t, e = xn ? Ze + 1 : 0) {
  for (; e < ke.length; e++) {
    const n = ke[e];
    n && n.pre && (ke.splice(e, 1), e--, n());
  }
}
function ni(t) {
  if (Ht.length) {
    const e = [...new Set(Ht)];
    if (Ht.length = 0, et) {
      et.push(...e);
      return;
    }
    for (et = e, et.sort((n, r) => yn(n) - yn(r)), yt = 0; yt < et.length; yt++)
      et[yt]();
    et = null, yt = 0;
  }
}
const yn = (t) => t.id == null ? 1 / 0 : t.id, ya = (t, e) => {
  const n = yn(t) - yn(e);
  if (n === 0) {
    if (t.pre && !e.pre)
      return -1;
    if (e.pre && !t.pre)
      return 1;
  }
  return n;
};
function ri(t) {
  rs = !1, xn = !0, ke.sort(ya);
  try {
    for (Ze = 0; Ze < ke.length; Ze++) {
      const e = ke[Ze];
      e && e.active !== !1 && ut(e, null, 14);
    }
  } finally {
    Ze = 0, ke.length = 0, ni(), xn = !1, Ds = null, (ke.length || Ht.length) && ri();
  }
}
function ka(t, e, ...n) {
  if (t.isUnmounted)
    return;
  const r = t.vnode.props || ue;
  let s = n;
  const o = e.startsWith("update:"), c = o && e.slice(7);
  if (c && c in r) {
    const u = `${c === "modelValue" ? "model" : c}Modifiers`, { number: f, trim: h } = r[u] || ue;
    h && (s = n.map((d) => _e(d) ? d.trim() : d)), f && (s = n.map(Xr));
  }
  let i, l = r[i = Sr(e)] || // also try camelCase event handler (#2249)
  r[i = Sr(Gt(e))];
  !l && o && (l = r[i = Sr(Mt(e))]), l && Fe(
    l,
    t,
    6,
    s
  );
  const a = r[i + "Once"];
  if (a) {
    if (!t.emitted)
      t.emitted = {};
    else if (t.emitted[i])
      return;
    t.emitted[i] = !0, Fe(
      a,
      t,
      6,
      s
    );
  }
}
function si(t, e, n = !1) {
  const r = e.emitsCache, s = r.get(t);
  if (s !== void 0)
    return s;
  const o = t.emits;
  let c = {}, i = !1;
  if (!ee(t)) {
    const l = (a) => {
      const u = si(a, e, !0);
      u && (i = !0, me(c, u));
    };
    !n && e.mixins.length && e.mixins.forEach(l), t.extends && l(t.extends), t.mixins && t.mixins.forEach(l);
  }
  return !o && !i ? (fe(t) && r.set(t, null), null) : (Z(o) ? o.forEach((l) => c[l] = null) : me(c, o), fe(t) && r.set(t, c), c);
}
function ur(t, e) {
  return !t || !or(e) ? !1 : (e = e.slice(2).replace(/Once$/, ""), se(t, e[0].toLowerCase() + e.slice(1)) || se(t, Mt(e)) || se(t, e));
}
let Ee = null, oi = null;
function Jn(t) {
  const e = Ee;
  return Ee = t, oi = t && t.type.__scopeId || null, e;
}
function ft(t, e = Ee, n) {
  if (!e || t._n)
    return t;
  const r = (...s) => {
    r._d && xo(-1);
    const o = Jn(e);
    let c;
    try {
      c = t(...s);
    } finally {
      Jn(o), r._d && xo(1);
    }
    return c;
  };
  return r._n = !0, r._c = !0, r._d = !0, r;
}
function Dr(t) {
  const {
    type: e,
    vnode: n,
    proxy: r,
    withProxy: s,
    props: o,
    propsOptions: [c],
    slots: i,
    attrs: l,
    emit: a,
    render: u,
    renderCache: f,
    data: h,
    setupState: d,
    ctx: k,
    inheritAttrs: b
  } = t;
  let I, T;
  const C = Jn(t);
  try {
    if (n.shapeFlag & 4) {
      const A = s || r;
      I = Ge(
        u.call(
          A,
          A,
          f,
          o,
          d,
          h,
          k
        )
      ), T = l;
    } else {
      const A = e;
      I = Ge(
        A.length > 1 ? A(
          o,
          { attrs: l, slots: i, emit: a }
        ) : A(
          o,
          null
          /* we know it doesn't need it */
        )
      ), T = e.props ? l : Ea(l);
    }
  } catch (A) {
    gn.length = 0, ar(A, t, 1), I = pe(Le);
  }
  let N = I;
  if (T && b !== !1) {
    const A = Object.keys(T), { shapeFlag: j } = N;
    A.length && j & 7 && (c && A.some(gs) && (T = wa(
      T,
      c
    )), N = pt(N, T));
  }
  return n.dirs && (N = pt(N), N.dirs = N.dirs ? N.dirs.concat(n.dirs) : n.dirs), n.transition && (N.transition = n.transition), I = N, Jn(C), I;
}
const Ea = (t) => {
  let e;
  for (const n in t)
    (n === "class" || n === "style" || or(n)) && ((e || (e = {}))[n] = t[n]);
  return e;
}, wa = (t, e) => {
  const n = {};
  for (const r in t)
    (!gs(r) || !(r.slice(9) in e)) && (n[r] = t[r]);
  return n;
};
function Ca(t, e, n) {
  const { props: r, children: s, component: o } = t, { props: c, children: i, patchFlag: l } = e, a = o.emitsOptions;
  if (e.dirs || e.transition)
    return !0;
  if (n && l >= 0) {
    if (l & 1024)
      return !0;
    if (l & 16)
      return r ? lo(r, c, a) : !!c;
    if (l & 8) {
      const u = e.dynamicProps;
      for (let f = 0; f < u.length; f++) {
        const h = u[f];
        if (c[h] !== r[h] && !ur(a, h))
          return !0;
      }
    }
  } else
    return (s || i) && (!i || !i.$stable) ? !0 : r === c ? !1 : r ? c ? lo(r, c, a) : !0 : !!c;
  return !1;
}
function lo(t, e, n) {
  const r = Object.keys(e);
  if (r.length !== Object.keys(t).length)
    return !0;
  for (let s = 0; s < r.length; s++) {
    const o = r[s];
    if (e[o] !== t[o] && !ur(n, o))
      return !0;
  }
  return !1;
}
function Aa({ vnode: t, parent: e }, n) {
  for (; e && e.subTree === t; )
    (t = e.vnode).el = n, e = e.parent;
}
const Sa = (t) => t.__isSuspense;
function Da(t, e) {
  e && e.pendingBranch ? Z(t) ? e.effects.push(...t) : e.effects.push(t) : xa(t);
}
const On = {};
function Tr(t, e, n) {
  return ci(t, e, n);
}
function ci(t, e, { immediate: n, deep: r, flush: s, onTrack: o, onTrigger: c } = ue) {
  var i;
  const l = Il() === ((i = xe) == null ? void 0 : i.scope) ? xe : null;
  let a, u = !1, f = !1;
  if (ye(t) ? (a = () => t.value, u = Wn(t)) : zt(t) ? (a = () => t, r = !0) : Z(t) ? (f = !0, u = t.some((A) => zt(A) || Wn(A)), a = () => t.map((A) => {
    if (ye(A))
      return A.value;
    if (zt(A))
      return wt(A);
    if (ee(A))
      return ut(A, l, 2);
  })) : ee(t) ? e ? a = () => ut(t, l, 2) : a = () => {
    if (!(l && l.isUnmounted))
      return h && h(), Fe(
        t,
        l,
        3,
        [d]
      );
  } : a = Je, e && r) {
    const A = a;
    a = () => wt(A());
  }
  let h, d = (A) => {
    h = C.onStop = () => {
      ut(A, l, 4);
    };
  }, k;
  if (En)
    if (d = Je, e ? n && Fe(e, l, 3, [
      a(),
      f ? [] : void 0,
      d
    ]) : a(), s === "sync") {
      const A = ku();
      k = A.__watcherHandles || (A.__watcherHandles = []);
    } else
      return Je;
  let b = f ? new Array(t.length).fill(On) : On;
  const I = () => {
    if (C.active)
      if (e) {
        const A = C.run();
        (r || u || (f ? A.some(
          (j, q) => bn(j, b[q])
        ) : bn(A, b))) && (h && h(), Fe(e, l, 3, [
          A,
          // pass undefined as the old value when it's changed for the first time
          b === On ? void 0 : f && b[0] === On ? [] : b,
          d
        ]), b = A);
      } else
        C.run();
  };
  I.allowRecurse = !!e;
  let T;
  s === "sync" ? T = I : s === "post" ? T = () => Te(I, l && l.suspense) : (I.pre = !0, l && (I.id = l.uid), T = () => Ts(I));
  const C = new ys(a, T);
  e ? n ? I() : b = C.run() : s === "post" ? Te(
    C.run.bind(C),
    l && l.suspense
  ) : C.run();
  const N = () => {
    C.stop(), l && l.scope && ms(l.scope.effects, C);
  };
  return k && k.push(N), N;
}
function Ta(t, e, n) {
  const r = this.proxy, s = _e(t) ? t.includes(".") ? ii(r, t) : () => r[t] : t.bind(r, r);
  let o;
  ee(e) ? o = e : (o = e.handler, n = e);
  const c = xe;
  Wt(this);
  const i = ci(s, o.bind(r), n);
  return c ? Wt(c) : St(), i;
}
function ii(t, e) {
  const n = e.split(".");
  return () => {
    let r = t;
    for (let s = 0; s < n.length && r; s++)
      r = r[n[s]];
    return r;
  };
}
function wt(t, e) {
  if (!fe(t) || t.__v_skip || (e = e || /* @__PURE__ */ new Set(), e.has(t)))
    return t;
  if (e.add(t), ye(t))
    wt(t.value, e);
  else if (Z(t))
    for (let n = 0; n < t.length; n++)
      wt(t[n], e);
  else if (qc(t) || $t(t))
    t.forEach((n) => {
      wt(n, e);
    });
  else if (Ic(t))
    for (const n in t)
      wt(t[n], e);
  return t;
}
function li(t, e) {
  const n = Ee;
  if (n === null)
    return t;
  const r = gr(n) || n.proxy, s = t.dirs || (t.dirs = []);
  for (let o = 0; o < e.length; o++) {
    let [c, i, l, a = ue] = e[o];
    c && (ee(c) && (c = {
      mounted: c,
      updated: c
    }), c.deep && wt(i), s.push({
      dir: c,
      instance: r,
      value: i,
      oldValue: void 0,
      arg: l,
      modifiers: a
    }));
  }
  return t;
}
function mt(t, e, n, r) {
  const s = t.dirs, o = e && e.dirs;
  for (let c = 0; c < s.length; c++) {
    const i = s[c];
    o && (i.oldValue = o[c].value);
    let l = i.dir[r];
    l && (Yt(), Fe(l, n, 8, [
      t.el,
      i,
      t,
      e
    ]), Xt());
  }
}
function Ra() {
  const t = {
    isMounted: !1,
    isLeaving: !1,
    isUnmounting: !1,
    leavingVNodes: /* @__PURE__ */ new Map()
  };
  return Dn(() => {
    t.isMounted = !0;
  }), Rs(() => {
    t.isUnmounting = !0;
  }), t;
}
const Ie = [Function, Array], ai = {
  mode: String,
  appear: Boolean,
  persisted: Boolean,
  // enter
  onBeforeEnter: Ie,
  onEnter: Ie,
  onAfterEnter: Ie,
  onEnterCancelled: Ie,
  // leave
  onBeforeLeave: Ie,
  onLeave: Ie,
  onAfterLeave: Ie,
  onLeaveCancelled: Ie,
  // appear
  onBeforeAppear: Ie,
  onAppear: Ie,
  onAfterAppear: Ie,
  onAppearCancelled: Ie
}, qa = {
  name: "BaseTransition",
  props: ai,
  setup(t, { slots: e }) {
    const n = gu(), r = Ra();
    let s;
    return () => {
      const o = e.default && fi(e.default(), !0);
      if (!o || !o.length)
        return;
      let c = o[0];
      if (o.length > 1) {
        for (const b of o)
          if (b.type !== Le) {
            c = b;
            break;
          }
      }
      const i = ce(t), { mode: l } = i;
      if (r.isLeaving)
        return Rr(c);
      const a = ao(c);
      if (!a)
        return Rr(c);
      const u = ss(
        a,
        i,
        r,
        n
      );
      os(a, u);
      const f = n.subTree, h = f && ao(f);
      let d = !1;
      const { getTransitionKey: k } = a.type;
      if (k) {
        const b = k();
        s === void 0 ? s = b : b !== s && (s = b, d = !0);
      }
      if (h && h.type !== Le && (!kt(a, h) || d)) {
        const b = ss(
          h,
          i,
          r,
          n
        );
        if (os(h, b), l === "out-in")
          return r.isLeaving = !0, b.afterLeave = () => {
            r.isLeaving = !1, n.update.active !== !1 && n.update();
          }, Rr(c);
        l === "in-out" && a.type !== Le && (b.delayLeave = (I, T, C) => {
          const N = ui(
            r,
            h
          );
          N[String(h.key)] = h, I._leaveCb = () => {
            T(), I._leaveCb = void 0, delete u.delayedLeave;
          }, u.delayedLeave = C;
        });
      }
      return c;
    };
  }
}, Ma = qa;
function ui(t, e) {
  const { leavingVNodes: n } = t;
  let r = n.get(e.type);
  return r || (r = /* @__PURE__ */ Object.create(null), n.set(e.type, r)), r;
}
function ss(t, e, n, r) {
  const {
    appear: s,
    mode: o,
    persisted: c = !1,
    onBeforeEnter: i,
    onEnter: l,
    onAfterEnter: a,
    onEnterCancelled: u,
    onBeforeLeave: f,
    onLeave: h,
    onAfterLeave: d,
    onLeaveCancelled: k,
    onBeforeAppear: b,
    onAppear: I,
    onAfterAppear: T,
    onAppearCancelled: C
  } = e, N = String(t.key), A = ui(n, t), j = ($, X) => {
    $ && Fe(
      $,
      r,
      9,
      X
    );
  }, q = ($, X) => {
    const z = X[1];
    j($, X), Z($) ? $.every((J) => J.length <= 1) && z() : $.length <= 1 && z();
  }, W = {
    mode: o,
    persisted: c,
    beforeEnter($) {
      let X = i;
      if (!n.isMounted)
        if (s)
          X = b || i;
        else
          return;
      $._leaveCb && $._leaveCb(
        !0
        /* cancelled */
      );
      const z = A[N];
      z && kt(t, z) && z.el._leaveCb && z.el._leaveCb(), j(X, [$]);
    },
    enter($) {
      let X = l, z = a, J = u;
      if (!n.isMounted)
        if (s)
          X = I || l, z = T || a, J = C || u;
        else
          return;
      let B = !1;
      const re = $._enterCb = (D) => {
        B || (B = !0, D ? j(J, [$]) : j(z, [$]), W.delayedLeave && W.delayedLeave(), $._enterCb = void 0);
      };
      X ? q(X, [$, re]) : re();
    },
    leave($, X) {
      const z = String(t.key);
      if ($._enterCb && $._enterCb(
        !0
        /* cancelled */
      ), n.isUnmounting)
        return X();
      j(f, [$]);
      let J = !1;
      const B = $._leaveCb = (re) => {
        J || (J = !0, X(), re ? j(k, [$]) : j(d, [$]), $._leaveCb = void 0, A[z] === t && delete A[z]);
      };
      A[z] = t, h ? q(h, [$, B]) : B();
    },
    clone($) {
      return ss($, e, n, r);
    }
  };
  return W;
}
function Rr(t) {
  if (fr(t))
    return t = pt(t), t.children = null, t;
}
function ao(t) {
  return fr(t) ? t.children ? t.children[0] : void 0 : t;
}
function os(t, e) {
  t.shapeFlag & 6 && t.component ? os(t.component.subTree, e) : t.shapeFlag & 128 ? (t.ssContent.transition = e.clone(t.ssContent), t.ssFallback.transition = e.clone(t.ssFallback)) : t.transition = e;
}
function fi(t, e = !1, n) {
  let r = [], s = 0;
  for (let o = 0; o < t.length; o++) {
    let c = t[o];
    const i = n == null ? c.key : String(n) + String(c.key != null ? c.key : o);
    c.type === Re ? (c.patchFlag & 128 && s++, r = r.concat(
      fi(c.children, e, i)
    )) : (e || c.type !== Le) && r.push(i != null ? pt(c, { key: i }) : c);
  }
  if (s > 1)
    for (let o = 0; o < r.length; o++)
      r[o].patchFlag = -2;
  return r;
}
function Ue(t, e) {
  return ee(t) ? (
    // #8326: extend call and options.name access are considered side-effects
    // by Rollup, so we have to wrap it in a pure-annotated IIFE.
    me({ name: t.name }, e, { setup: t })
  ) : t;
}
const hn = (t) => !!t.type.__asyncLoader, fr = (t) => t.type.__isKeepAlive;
function Na(t, e) {
  hi(t, "a", e);
}
function Ia(t, e) {
  hi(t, "da", e);
}
function hi(t, e, n = xe) {
  const r = t.__wdc || (t.__wdc = () => {
    let s = n;
    for (; s; ) {
      if (s.isDeactivated)
        return;
      s = s.parent;
    }
    return t();
  });
  if (hr(e, r, n), n) {
    let s = n.parent;
    for (; s && s.parent; )
      fr(s.parent.vnode) && Fa(r, e, n, s), s = s.parent;
  }
}
function Fa(t, e, n, r) {
  const s = hr(
    e,
    t,
    r,
    !0
    /* prepend */
  );
  pi(() => {
    ms(r[e], s);
  }, n);
}
function hr(t, e, n = xe, r = !1) {
  if (n) {
    const s = n[t] || (n[t] = []), o = e.__weh || (e.__weh = (...c) => {
      if (n.isUnmounted)
        return;
      Yt(), Wt(n);
      const i = Fe(e, n, t, c);
      return St(), Xt(), i;
    });
    return r ? s.unshift(o) : s.push(o), o;
  }
}
const nt = (t) => (e, n = xe) => (
  // post-create lifecycle registrations are noops during SSR (except for serverPrefetch)
  (!En || t === "sp") && hr(t, (...r) => e(...r), n)
), La = nt("bm"), Dn = nt("m"), Oa = nt("bu"), Pa = nt("u"), Rs = nt("bum"), pi = nt("um"), Ba = nt("sp"), $a = nt(
  "rtg"
), za = nt(
  "rtc"
);
function Ua(t, e = xe) {
  hr("ec", t, e);
}
const Ha = Symbol.for("v-ndc");
function uo(t, e, n, r) {
  let s;
  const o = n && n[r];
  if (Z(t) || _e(t)) {
    s = new Array(t.length);
    for (let c = 0, i = t.length; c < i; c++)
      s[c] = e(t[c], c, void 0, o && o[c]);
  } else if (typeof t == "number") {
    s = new Array(t);
    for (let c = 0; c < t; c++)
      s[c] = e(c + 1, c, void 0, o && o[c]);
  } else if (fe(t))
    if (t[Symbol.iterator])
      s = Array.from(
        t,
        (c, i) => e(c, i, void 0, o && o[i])
      );
    else {
      const c = Object.keys(t);
      s = new Array(c.length);
      for (let i = 0, l = c.length; i < l; i++) {
        const a = c[i];
        s[i] = e(t[a], a, i, o && o[i]);
      }
    }
  else
    s = [];
  return n && (n[r] = s), s;
}
function pn(t, e, n = {}, r, s) {
  if (Ee.isCE || Ee.parent && hn(Ee.parent) && Ee.parent.isCE)
    return e !== "default" && (n.name = e), pe("slot", n, r && r());
  let o = t[e];
  o && o._c && (o._d = !1), oe();
  const c = o && di(o(n)), i = Se(
    Re,
    {
      key: n.key || // slot content array of a dynamic conditional slot may have a branch
      // key attached in the `createSlots` helper, respect that
      c && c.key || `_${e}`
    },
    c || (r ? r() : []),
    c && t._ === 1 ? 64 : -2
  );
  return !s && i.scopeId && (i.slotScopeIds = [i.scopeId + "-s"]), o && o._c && (o._d = !0), i;
}
function di(t) {
  return t.some((e) => Qn(e) ? !(e.type === Le || e.type === Re && !di(e.children)) : !0) ? t : null;
}
const cs = (t) => t ? Ci(t) ? gr(t) || t.proxy : cs(t.parent) : null, dn = (
  // Move PURE marker to new line to workaround compiler discarding it
  // due to type annotation
  /* @__PURE__ */ me(/* @__PURE__ */ Object.create(null), {
    $: (t) => t,
    $el: (t) => t.vnode.el,
    $data: (t) => t.data,
    $props: (t) => t.props,
    $attrs: (t) => t.attrs,
    $slots: (t) => t.slots,
    $refs: (t) => t.refs,
    $parent: (t) => cs(t.parent),
    $root: (t) => cs(t.root),
    $emit: (t) => t.emit,
    $options: (t) => qs(t),
    $forceUpdate: (t) => t.f || (t.f = () => Ts(t.update)),
    $nextTick: (t) => t.n || (t.n = Kt.bind(t.proxy)),
    $watch: (t) => Ta.bind(t)
  })
), qr = (t, e) => t !== ue && !t.__isScriptSetup && se(t, e), ja = {
  get({ _: t }, e) {
    const { ctx: n, setupState: r, data: s, props: o, accessCache: c, type: i, appContext: l } = t;
    let a;
    if (e[0] !== "$") {
      const d = c[e];
      if (d !== void 0)
        switch (d) {
          case 1:
            return r[e];
          case 2:
            return s[e];
          case 4:
            return n[e];
          case 3:
            return o[e];
        }
      else {
        if (qr(r, e))
          return c[e] = 1, r[e];
        if (s !== ue && se(s, e))
          return c[e] = 2, s[e];
        if (
          // only cache other properties when instance has declared (thus stable)
          // props
          (a = t.propsOptions[0]) && se(a, e)
        )
          return c[e] = 3, o[e];
        if (n !== ue && se(n, e))
          return c[e] = 4, n[e];
        is && (c[e] = 0);
      }
    }
    const u = dn[e];
    let f, h;
    if (u)
      return e === "$attrs" && qe(t, "get", e), u(t);
    if (
      // css module (injected by vue-loader)
      (f = i.__cssModules) && (f = f[e])
    )
      return f;
    if (n !== ue && se(n, e))
      return c[e] = 4, n[e];
    if (
      // global properties
      h = l.config.globalProperties, se(h, e)
    )
      return h[e];
  },
  set({ _: t }, e, n) {
    const { data: r, setupState: s, ctx: o } = t;
    return qr(s, e) ? (s[e] = n, !0) : r !== ue && se(r, e) ? (r[e] = n, !0) : se(t.props, e) || e[0] === "$" && e.slice(1) in t ? !1 : (o[e] = n, !0);
  },
  has({
    _: { data: t, setupState: e, accessCache: n, ctx: r, appContext: s, propsOptions: o }
  }, c) {
    let i;
    return !!n[c] || t !== ue && se(t, c) || qr(e, c) || (i = o[0]) && se(i, c) || se(r, c) || se(dn, c) || se(s.config.globalProperties, c);
  },
  defineProperty(t, e, n) {
    return n.get != null ? t._.accessCache[e] = 0 : se(n, "value") && this.set(t, e, n.value, null), Reflect.defineProperty(t, e, n);
  }
};
function fo(t) {
  return Z(t) ? t.reduce(
    (e, n) => (e[n] = null, e),
    {}
  ) : t;
}
let is = !0;
function Va(t) {
  const e = qs(t), n = t.proxy, r = t.ctx;
  is = !1, e.beforeCreate && ho(e.beforeCreate, t, "bc");
  const {
    // state
    data: s,
    computed: o,
    methods: c,
    watch: i,
    provide: l,
    inject: a,
    // lifecycle
    created: u,
    beforeMount: f,
    mounted: h,
    beforeUpdate: d,
    updated: k,
    activated: b,
    deactivated: I,
    beforeDestroy: T,
    beforeUnmount: C,
    destroyed: N,
    unmounted: A,
    render: j,
    renderTracked: q,
    renderTriggered: W,
    errorCaptured: $,
    serverPrefetch: X,
    // public API
    expose: z,
    inheritAttrs: J,
    // assets
    components: B,
    directives: re,
    filters: D
  } = e;
  if (a && Ga(a, r, null), c)
    for (const v in c) {
      const S = c[v];
      ee(S) && (r[v] = S.bind(n));
    }
  if (s) {
    const v = s.call(n, n);
    fe(v) && (t.data = Cs(v));
  }
  if (is = !0, o)
    for (const v in o) {
      const S = o[v], G = ee(S) ? S.bind(n, n) : ee(S.get) ? S.get.bind(n, n) : Je, te = !ee(S) && ee(S.set) ? S.set.bind(n) : Je, ie = Tt({
        get: G,
        set: te
      });
      Object.defineProperty(r, v, {
        enumerable: !0,
        configurable: !0,
        get: () => ie.value,
        set: (ae) => ie.value = ae
      });
    }
  if (i)
    for (const v in i)
      gi(i[v], r, n, v);
  if (l) {
    const v = ee(l) ? l.call(n) : l;
    Reflect.ownKeys(v).forEach((S) => {
      Xa(S, v[S]);
    });
  }
  u && ho(u, t, "c");
  function V(v, S) {
    Z(S) ? S.forEach((G) => v(G.bind(n))) : S && v(S.bind(n));
  }
  if (V(La, f), V(Dn, h), V(Oa, d), V(Pa, k), V(Na, b), V(Ia, I), V(Ua, $), V(za, q), V($a, W), V(Rs, C), V(pi, A), V(Ba, X), Z(z))
    if (z.length) {
      const v = t.exposed || (t.exposed = {});
      z.forEach((S) => {
        Object.defineProperty(v, S, {
          get: () => n[S],
          set: (G) => n[S] = G
        });
      });
    } else
      t.exposed || (t.exposed = {});
  j && t.render === Je && (t.render = j), J != null && (t.inheritAttrs = J), B && (t.components = B), re && (t.directives = re);
}
function Ga(t, e, n = Je) {
  Z(t) && (t = ls(t));
  for (const r in t) {
    const s = t[r];
    let o;
    fe(s) ? "default" in s ? o = jt(
      s.from || r,
      s.default,
      !0
      /* treat default function as factory */
    ) : o = jt(s.from || r) : o = jt(s), ye(o) ? Object.defineProperty(e, r, {
      enumerable: !0,
      configurable: !0,
      get: () => o.value,
      set: (c) => o.value = c
    }) : e[r] = o;
  }
}
function ho(t, e, n) {
  Fe(
    Z(t) ? t.map((r) => r.bind(e.proxy)) : t.bind(e.proxy),
    e,
    n
  );
}
function gi(t, e, n, r) {
  const s = r.includes(".") ? ii(n, r) : () => n[r];
  if (_e(t)) {
    const o = e[t];
    ee(o) && Tr(s, o);
  } else if (ee(t))
    Tr(s, t.bind(n));
  else if (fe(t))
    if (Z(t))
      t.forEach((o) => gi(o, e, n, r));
    else {
      const o = ee(t.handler) ? t.handler.bind(n) : e[t.handler];
      ee(o) && Tr(s, o, t);
    }
}
function qs(t) {
  const e = t.type, { mixins: n, extends: r } = e, {
    mixins: s,
    optionsCache: o,
    config: { optionMergeStrategies: c }
  } = t.appContext, i = o.get(e);
  let l;
  return i ? l = i : !s.length && !n && !r ? l = e : (l = {}, s.length && s.forEach(
    (a) => Yn(l, a, c, !0)
  ), Yn(l, e, c)), fe(e) && o.set(e, l), l;
}
function Yn(t, e, n, r = !1) {
  const { mixins: s, extends: o } = e;
  o && Yn(t, o, n, !0), s && s.forEach(
    (c) => Yn(t, c, n, !0)
  );
  for (const c in e)
    if (!(r && c === "expose")) {
      const i = Za[c] || n && n[c];
      t[c] = i ? i(t[c], e[c]) : e[c];
    }
  return t;
}
const Za = {
  data: po,
  props: go,
  emits: go,
  // objects
  methods: fn,
  computed: fn,
  // lifecycle
  beforeCreate: Ae,
  created: Ae,
  beforeMount: Ae,
  mounted: Ae,
  beforeUpdate: Ae,
  updated: Ae,
  beforeDestroy: Ae,
  beforeUnmount: Ae,
  destroyed: Ae,
  unmounted: Ae,
  activated: Ae,
  deactivated: Ae,
  errorCaptured: Ae,
  serverPrefetch: Ae,
  // assets
  components: fn,
  directives: fn,
  // watch
  watch: Wa,
  // provide / inject
  provide: po,
  inject: Ka
};
function po(t, e) {
  return e ? t ? function() {
    return me(
      ee(t) ? t.call(this, this) : t,
      ee(e) ? e.call(this, this) : e
    );
  } : e : t;
}
function Ka(t, e) {
  return fn(ls(t), ls(e));
}
function ls(t) {
  if (Z(t)) {
    const e = {};
    for (let n = 0; n < t.length; n++)
      e[t[n]] = t[n];
    return e;
  }
  return t;
}
function Ae(t, e) {
  return t ? [...new Set([].concat(t, e))] : e;
}
function fn(t, e) {
  return t ? me(/* @__PURE__ */ Object.create(null), t, e) : e;
}
function go(t, e) {
  return t ? Z(t) && Z(e) ? [.../* @__PURE__ */ new Set([...t, ...e])] : me(
    /* @__PURE__ */ Object.create(null),
    fo(t),
    fo(e ?? {})
  ) : e;
}
function Wa(t, e) {
  if (!t)
    return e;
  if (!e)
    return t;
  const n = me(/* @__PURE__ */ Object.create(null), t);
  for (const r in e)
    n[r] = Ae(t[r], e[r]);
  return n;
}
function mi() {
  return {
    app: null,
    config: {
      isNativeTag: vl,
      performance: !1,
      globalProperties: {},
      optionMergeStrategies: {},
      errorHandler: void 0,
      warnHandler: void 0,
      compilerOptions: {}
    },
    mixins: [],
    components: {},
    directives: {},
    provides: /* @__PURE__ */ Object.create(null),
    optionsCache: /* @__PURE__ */ new WeakMap(),
    propsCache: /* @__PURE__ */ new WeakMap(),
    emitsCache: /* @__PURE__ */ new WeakMap()
  };
}
let Ja = 0;
function Ya(t, e) {
  return function(r, s = null) {
    ee(r) || (r = me({}, r)), s != null && !fe(s) && (s = null);
    const o = mi(), c = /* @__PURE__ */ new Set();
    let i = !1;
    const l = o.app = {
      _uid: Ja++,
      _component: r,
      _props: s,
      _container: null,
      _context: o,
      _instance: null,
      version: Eu,
      get config() {
        return o.config;
      },
      set config(a) {
      },
      use(a, ...u) {
        return c.has(a) || (a && ee(a.install) ? (c.add(a), a.install(l, ...u)) : ee(a) && (c.add(a), a(l, ...u))), l;
      },
      mixin(a) {
        return o.mixins.includes(a) || o.mixins.push(a), l;
      },
      component(a, u) {
        return u ? (o.components[a] = u, l) : o.components[a];
      },
      directive(a, u) {
        return u ? (o.directives[a] = u, l) : o.directives[a];
      },
      mount(a, u, f) {
        if (!i) {
          const h = pe(
            r,
            s
          );
          return h.appContext = o, u && e ? e(h, a) : t(h, a, f), i = !0, l._container = a, a.__vue_app__ = l, gr(h.component) || h.component.proxy;
        }
      },
      unmount() {
        i && (t(null, l._container), delete l._container.__vue_app__);
      },
      provide(a, u) {
        return o.provides[a] = u, l;
      },
      runWithContext(a) {
        Xn = l;
        try {
          return a();
        } finally {
          Xn = null;
        }
      }
    };
    return l;
  };
}
let Xn = null;
function Xa(t, e) {
  if (xe) {
    let n = xe.provides;
    const r = xe.parent && xe.parent.provides;
    r === n && (n = xe.provides = Object.create(r)), n[t] = e;
  }
}
function jt(t, e, n = !1) {
  const r = xe || Ee;
  if (r || Xn) {
    const s = r ? r.parent == null ? r.vnode.appContext && r.vnode.appContext.provides : r.parent.provides : Xn._context.provides;
    if (s && t in s)
      return s[t];
    if (arguments.length > 1)
      return n && ee(e) ? e.call(r && r.proxy) : e;
  }
}
function Qa(t, e, n, r = !1) {
  const s = {}, o = {};
  Gn(o, dr, 1), t.propsDefaults = /* @__PURE__ */ Object.create(null), _i(t, e, s, o);
  for (const c in t.propsOptions[0])
    c in s || (s[c] = void 0);
  n ? t.props = r ? s : la(s) : t.type.props ? t.props = s : t.props = o, t.attrs = o;
}
function eu(t, e, n, r) {
  const {
    props: s,
    attrs: o,
    vnode: { patchFlag: c }
  } = t, i = ce(s), [l] = t.propsOptions;
  let a = !1;
  if (
    // always force full diff in dev
    // - #1942 if hmr is enabled with sfc component
    // - vite#872 non-sfc component used by sfc component
    (r || c > 0) && !(c & 16)
  ) {
    if (c & 8) {
      const u = t.vnode.dynamicProps;
      for (let f = 0; f < u.length; f++) {
        let h = u[f];
        if (ur(t.emitsOptions, h))
          continue;
        const d = e[h];
        if (l)
          if (se(o, h))
            d !== o[h] && (o[h] = d, a = !0);
          else {
            const k = Gt(h);
            s[k] = as(
              l,
              i,
              k,
              d,
              t,
              !1
              /* isAbsent */
            );
          }
        else
          d !== o[h] && (o[h] = d, a = !0);
      }
    }
  } else {
    _i(t, e, s, o) && (a = !0);
    let u;
    for (const f in i)
      (!e || // for camelCase
      !se(e, f) && // it's possible the original props was passed in as kebab-case
      // and converted to camelCase (#955)
      ((u = Mt(f)) === f || !se(e, u))) && (l ? n && // for camelCase
      (n[f] !== void 0 || // for kebab-case
      n[u] !== void 0) && (s[f] = as(
        l,
        i,
        f,
        void 0,
        t,
        !0
        /* isAbsent */
      )) : delete s[f]);
    if (o !== i)
      for (const f in o)
        (!e || !se(e, f)) && (delete o[f], a = !0);
  }
  a && tt(t, "set", "$attrs");
}
function _i(t, e, n, r) {
  const [s, o] = t.propsOptions;
  let c = !1, i;
  if (e)
    for (let l in e) {
      if (Hn(l))
        continue;
      const a = e[l];
      let u;
      s && se(s, u = Gt(l)) ? !o || !o.includes(u) ? n[u] = a : (i || (i = {}))[u] = a : ur(t.emitsOptions, l) || (!(l in r) || a !== r[l]) && (r[l] = a, c = !0);
    }
  if (o) {
    const l = ce(n), a = i || ue;
    for (let u = 0; u < o.length; u++) {
      const f = o[u];
      n[f] = as(
        s,
        l,
        f,
        a[f],
        t,
        !se(a, f)
      );
    }
  }
  return c;
}
function as(t, e, n, r, s, o) {
  const c = t[n];
  if (c != null) {
    const i = se(c, "default");
    if (i && r === void 0) {
      const l = c.default;
      if (c.type !== Function && !c.skipFactory && ee(l)) {
        const { propsDefaults: a } = s;
        n in a ? r = a[n] : (Wt(s), r = a[n] = l.call(
          null,
          e
        ), St());
      } else
        r = l;
    }
    c[
      0
      /* shouldCast */
    ] && (o && !i ? r = !1 : c[
      1
      /* shouldCastTrue */
    ] && (r === "" || r === Mt(n)) && (r = !0));
  }
  return r;
}
function bi(t, e, n = !1) {
  const r = e.propsCache, s = r.get(t);
  if (s)
    return s;
  const o = t.props, c = {}, i = [];
  let l = !1;
  if (!ee(t)) {
    const u = (f) => {
      l = !0;
      const [h, d] = bi(f, e, !0);
      me(c, h), d && i.push(...d);
    };
    !n && e.mixins.length && e.mixins.forEach(u), t.extend