gptx-chatbot-ui
Version:
Integrate chatbots into third-party pages via gptx-chatbot-ui
1,934 lines • 759 kB
JavaScript
var w2 = Object.defineProperty, S2 = Object.defineProperties;
var E2 = Object.getOwnPropertyDescriptors;
var Ys = Object.getOwnPropertySymbols;
var A2 = Object.prototype.hasOwnProperty, k2 = Object.prototype.propertyIsEnumerable;
var Ks = (e, t, r) => t in e ? w2(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r, Ot = (e, t) => {
for (var r in t || (t = {}))
A2.call(t, r) && Ks(e, r, t[r]);
if (Ys)
for (var r of Ys(t))
k2.call(t, r) && Ks(e, r, t[r]);
return e;
}, er = (e, t) => S2(e, E2(t));
var dt = (e, t, r) => new Promise((o, n) => {
var i = (a) => {
try {
l(r.next(a));
} catch (s) {
n(s);
}
}, u = (a) => {
try {
l(r.throw(a));
} catch (s) {
n(s);
}
}, l = (a) => a.done ? o(a.value) : Promise.resolve(a.value).then(i, u);
l((r = r.apply(e, t)).next());
});
import "highlight.js";
/**
* @vue/shared v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function os(e) {
const t = /* @__PURE__ */ Object.create(null);
for (const r of e.split(",")) t[r] = 1;
return (r) => r in t;
}
const Re = {}, mn = [], ir = () => {
}, T2 = () => !1, Zu = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), ns = (e) => e.startsWith("onUpdate:"), at = Object.assign, is = (e, t) => {
const r = e.indexOf(t);
r > -1 && e.splice(r, 1);
}, D2 = Object.prototype.hasOwnProperty, Ie = (e, t) => D2.call(e, t), ve = Array.isArray, vn = (e) => Xu(e) === "[object Map]", yd = (e) => Xu(e) === "[object Set]", me = (e) => typeof e == "function", Je = (e) => typeof e == "string", Xr = (e) => typeof e == "symbol", Ve = (e) => e !== null && typeof e == "object", _d = (e) => (Ve(e) || me(e)) && me(e.then) && me(e.catch), wd = Object.prototype.toString, Xu = (e) => wd.call(e), P2 = (e) => Xu(e).slice(8, -1), Sd = (e) => Xu(e) === "[object Object]", us = (e) => Je(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, ti = /* @__PURE__ */ os(
// the leading comma is intentional so empty string "" is also included
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), Qu = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return (r) => t[r] || (t[r] = e(r));
}, F2 = /-(\w)/g, _o = Qu(
(e) => e.replace(F2, (t, r) => r ? r.toUpperCase() : "")
), M2 = /\B([A-Z])/g, Xo = Qu(
(e) => e.replace(M2, "-$1").toLowerCase()
), Ed = Qu((e) => e.charAt(0).toUpperCase() + e.slice(1)), Dl = Qu(
(e) => e ? `on${Ed(e)}` : ""
), Co = (e, t) => !Object.is(e, t), Pl = (e, ...t) => {
for (let r = 0; r < e.length; r++)
e[r](...t);
}, Ad = (e, t, r, o = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: o,
value: r
});
}, I2 = (e) => {
const t = parseFloat(e);
return isNaN(t) ? e : t;
}, $2 = (e) => {
const t = Je(e) ? Number(e) : NaN;
return isNaN(t) ? e : t;
};
let Zs;
const Ju = () => Zs || (Zs = typeof globalThis != "undefined" ? globalThis : typeof self != "undefined" ? self : typeof window != "undefined" ? window : typeof global != "undefined" ? global : {});
function el(e) {
if (ve(e)) {
const t = {};
for (let r = 0; r < e.length; r++) {
const o = e[r], n = Je(o) ? z2(o) : el(o);
if (n)
for (const i in n)
t[i] = n[i];
}
return t;
} else if (Je(e) || Ve(e))
return e;
}
const O2 = /;(?![^(]*\))/g, L2 = /:([^]+)/, B2 = /\/\*[^]*?\*\//g;
function z2(e) {
const t = {};
return e.replace(B2, "").split(O2).forEach((r) => {
if (r) {
const o = r.split(L2);
o.length > 1 && (t[o[0].trim()] = o[1].trim());
}
}), t;
}
function On(e) {
let t = "";
if (Je(e))
t = e;
else if (ve(e))
for (let r = 0; r < e.length; r++) {
const o = On(e[r]);
o && (t += o + " ");
}
else if (Ve(e))
for (const r in e)
e[r] && (t += r + " ");
return t.trim();
}
const R2 = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", H2 = /* @__PURE__ */ os(R2);
function kd(e) {
return !!e || e === "";
}
const Td = (e) => !!(e && e.__v_isRef === !0), nr = (e) => Je(e) ? e : e == null ? "" : ve(e) || Ve(e) && (e.toString === wd || !me(e.toString)) ? Td(e) ? nr(e.value) : JSON.stringify(e, Dd, 2) : String(e), Dd = (e, t) => Td(t) ? Dd(e, t.value) : vn(t) ? {
[`Map(${t.size})`]: [...t.entries()].reduce(
(r, [o, n], i) => (r[Fl(o, i) + " =>"] = n, r),
{}
)
} : yd(t) ? {
[`Set(${t.size})`]: [...t.values()].map((r) => Fl(r))
} : Xr(t) ? Fl(t) : Ve(t) && !ve(t) && !Sd(t) ? String(t) : t, Fl = (e, t = "") => {
var r;
return (
// Symbol.description in es2019+ so we need to cast here to pass
// the lib: es2016 check
Xr(e) ? `Symbol(${(r = e.description) != null ? r : t})` : e
);
};
var N2 = { NODE_ENV: "production" };
let Rt;
class Pd {
constructor(t = !1) {
this.detached = t, this._active = !0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = Rt, !t && Rt && (this.index = (Rt.scopes || (Rt.scopes = [])).push(
this
) - 1);
}
get active() {
return this._active;
}
pause() {
if (this._active) {
this._isPaused = !0;
let t, r;
if (this.scopes)
for (t = 0, r = this.scopes.length; t < r; t++)
this.scopes[t].pause();
for (t = 0, r = this.effects.length; t < r; t++)
this.effects[t].pause();
}
}
/**
* Resumes the effect scope, including all child scopes and effects.
*/
resume() {
if (this._active && this._isPaused) {
this._isPaused = !1;
let t, r;
if (this.scopes)
for (t = 0, r = this.scopes.length; t < r; t++)
this.scopes[t].resume();
for (t = 0, r = this.effects.length; t < r; t++)
this.effects[t].resume();
}
}
run(t) {
if (this._active) {
const r = Rt;
try {
return Rt = this, t();
} finally {
Rt = r;
}
}
}
/**
* This should only be called on non-detached scopes
* @internal
*/
on() {
Rt = this;
}
/**
* This should only be called on non-detached scopes
* @internal
*/
off() {
Rt = this.parent;
}
stop(t) {
if (this._active) {
this._active = !1;
let r, o;
for (r = 0, o = this.effects.length; r < o; r++)
this.effects[r].stop();
for (this.effects.length = 0, r = 0, o = this.cleanups.length; r < o; r++)
this.cleanups[r]();
if (this.cleanups.length = 0, this.scopes) {
for (r = 0, o = this.scopes.length; r < o; r++)
this.scopes[r].stop(!0);
this.scopes.length = 0;
}
if (!this.detached && this.parent && !t) {
const n = this.parent.scopes.pop();
n && n !== this && (this.parent.scopes[this.index] = n, n.index = this.index);
}
this.parent = void 0;
}
}
}
function W2(e) {
return new Pd(e);
}
function Fd() {
return Rt;
}
function j2(e, t = !1) {
Rt && Rt.cleanups.push(e);
}
let We;
const Ml = /* @__PURE__ */ new WeakSet();
class Md {
constructor(t) {
this.fn = t, this.deps = void 0, this.depsTail = void 0, this.flags = 5, this.next = void 0, this.cleanup = void 0, this.scheduler = void 0, Rt && Rt.active && Rt.effects.push(this);
}
pause() {
this.flags |= 64;
}
resume() {
this.flags & 64 && (this.flags &= -65, Ml.has(this) && (Ml.delete(this), this.trigger()));
}
/**
* @internal
*/
notify() {
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || $d(this);
}
run() {
if (!(this.flags & 1))
return this.fn();
this.flags |= 2, Xs(this), Od(this);
const t = We, r = br;
We = this, br = !0;
try {
return this.fn();
} finally {
Ld(this), We = t, br = r, this.flags &= -3;
}
}
stop() {
if (this.flags & 1) {
for (let t = this.deps; t; t = t.nextDep)
ss(t);
this.deps = this.depsTail = void 0, Xs(this), this.onStop && this.onStop(), this.flags &= -2;
}
}
trigger() {
this.flags & 64 ? Ml.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
}
/**
* @internal
*/
runIfDirty() {
ma(this) && this.run();
}
get dirty() {
return ma(this);
}
}
let Id = 0, ri, oi;
function $d(e, t = !1) {
if (e.flags |= 8, t) {
e.next = oi, oi = e;
return;
}
e.next = ri, ri = e;
}
function ls() {
Id++;
}
function as() {
if (--Id > 0)
return;
if (oi) {
let t = oi;
for (oi = void 0; t; ) {
const r = t.next;
t.next = void 0, t.flags &= -9, t = r;
}
}
let e;
for (; ri; ) {
let t = ri;
for (ri = void 0; t; ) {
const r = t.next;
if (t.next = void 0, t.flags &= -9, t.flags & 1)
try {
t.trigger();
} catch (o) {
e || (e = o);
}
t = r;
}
}
if (e) throw e;
}
function Od(e) {
for (let t = e.deps; t; t = t.nextDep)
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
}
function Ld(e) {
let t, r = e.depsTail, o = r;
for (; o; ) {
const n = o.prevDep;
o.version === -1 ? (o === r && (r = n), ss(o), V2(o)) : t = o, o.dep.activeLink = o.prevActiveLink, o.prevActiveLink = void 0, o = n;
}
e.deps = t, e.depsTail = r;
}
function ma(e) {
for (let t = e.deps; t; t = t.nextDep)
if (t.dep.version !== t.version || t.dep.computed && (Bd(t.dep.computed) || t.dep.version !== t.version))
return !0;
return !!e._dirty;
}
function Bd(e) {
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === di))
return;
e.globalVersion = di;
const t = e.dep;
if (e.flags |= 2, t.version > 0 && !e.isSSR && e.deps && !ma(e)) {
e.flags &= -3;
return;
}
const r = We, o = br;
We = e, br = !0;
try {
Od(e);
const n = e.fn(e._value);
(t.version === 0 || Co(n, e._value)) && (e._value = n, t.version++);
} catch (n) {
throw t.version++, n;
} finally {
We = r, br = o, Ld(e), e.flags &= -3;
}
}
function ss(e, t = !1) {
const { dep: r, prevSub: o, nextSub: n } = e;
if (o && (o.nextSub = n, e.prevSub = void 0), n && (n.prevSub = o, e.nextSub = void 0), r.subs === e && (r.subs = o, !o && r.computed)) {
r.computed.flags &= -5;
for (let i = r.computed.deps; i; i = i.nextDep)
ss(i, !0);
}
!t && !--r.sc && r.map && r.map.delete(r.key);
}
function V2(e) {
const { prevDep: t, nextDep: r } = e;
t && (t.nextDep = r, e.prevDep = void 0), r && (r.prevDep = t, e.nextDep = void 0);
}
let br = !0;
const zd = [];
function Qr() {
zd.push(br), br = !1;
}
function Jr() {
const e = zd.pop();
br = e === void 0 ? !0 : e;
}
function Xs(e) {
const { cleanup: t } = e;
if (e.cleanup = void 0, t) {
const r = We;
We = void 0;
try {
t();
} finally {
We = r;
}
}
}
let di = 0;
class q2 {
constructor(t, r) {
this.sub = t, this.dep = r, this.version = r.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
}
}
class cs {
constructor(t) {
this.computed = t, this.version = 0, this.activeLink = void 0, this.subs = void 0, this.map = void 0, this.key = void 0, this.sc = 0;
}
track(t) {
if (!We || !br || We === this.computed)
return;
let r = this.activeLink;
if (r === void 0 || r.sub !== We)
r = this.activeLink = new q2(We, this), We.deps ? (r.prevDep = We.depsTail, We.depsTail.nextDep = r, We.depsTail = r) : We.deps = We.depsTail = r, Rd(r);
else if (r.version === -1 && (r.version = this.version, r.nextDep)) {
const o = r.nextDep;
o.prevDep = r.prevDep, r.prevDep && (r.prevDep.nextDep = o), r.prevDep = We.depsTail, r.nextDep = void 0, We.depsTail.nextDep = r, We.depsTail = r, We.deps === r && (We.deps = o);
}
return r;
}
trigger(t) {
this.version++, di++, this.notify(t);
}
notify(t) {
ls();
try {
N2.NODE_ENV;
for (let r = this.subs; r; r = r.prevSub)
r.sub.notify() && r.sub.dep.notify();
} finally {
as();
}
}
}
function Rd(e) {
if (e.dep.sc++, e.sub.flags & 4) {
const t = e.dep.computed;
if (t && !e.dep.subs) {
t.flags |= 20;
for (let o = t.deps; o; o = o.nextDep)
Rd(o);
}
const r = e.dep.subs;
r !== e && (e.prevSub = r, r && (r.nextSub = e)), e.dep.subs = e;
}
}
const _u = /* @__PURE__ */ new WeakMap(), Wo = Symbol(
""
), va = Symbol(
""
), fi = Symbol(
""
);
function Dt(e, t, r) {
if (br && We) {
let o = _u.get(e);
o || _u.set(e, o = /* @__PURE__ */ new Map());
let n = o.get(r);
n || (o.set(r, n = new cs()), n.map = o, n.key = r), n.track();
}
}
function Ur(e, t, r, o, n, i) {
const u = _u.get(e);
if (!u) {
di++;
return;
}
const l = (a) => {
a && a.trigger();
};
if (ls(), t === "clear")
u.forEach(l);
else {
const a = ve(e), s = a && us(r);
if (a && r === "length") {
const c = Number(o);
u.forEach((d, f) => {
(f === "length" || f === fi || !Xr(f) && f >= c) && l(d);
});
} else
switch ((r !== void 0 || u.has(void 0)) && l(u.get(r)), s && l(u.get(fi)), t) {
case "add":
a ? s && l(u.get("length")) : (l(u.get(Wo)), vn(e) && l(u.get(va)));
break;
case "delete":
a || (l(u.get(Wo)), vn(e) && l(u.get(va)));
break;
case "set":
vn(e) && l(u.get(Wo));
break;
}
}
as();
}
function U2(e, t) {
const r = _u.get(e);
return r && r.get(t);
}
function an(e) {
const t = Ae(e);
return t === e ? t : (Dt(t, "iterate", fi), ur(e) ? t : t.map(Pt));
}
function tl(e) {
return Dt(e = Ae(e), "iterate", fi), e;
}
const G2 = {
__proto__: null,
[Symbol.iterator]() {
return Il(this, Symbol.iterator, Pt);
},
concat(...e) {
return an(this).concat(
...e.map((t) => ve(t) ? an(t) : t)
);
},
entries() {
return Il(this, "entries", (e) => (e[1] = Pt(e[1]), e));
},
every(e, t) {
return Wr(this, "every", e, t, void 0, arguments);
},
filter(e, t) {
return Wr(this, "filter", e, t, (r) => r.map(Pt), arguments);
},
find(e, t) {
return Wr(this, "find", e, t, Pt, arguments);
},
findIndex(e, t) {
return Wr(this, "findIndex", e, t, void 0, arguments);
},
findLast(e, t) {
return Wr(this, "findLast", e, t, Pt, arguments);
},
findLastIndex(e, t) {
return Wr(this, "findLastIndex", e, t, void 0, arguments);
},
// flat, flatMap could benefit from ARRAY_ITERATE but are not straight-forward to implement
forEach(e, t) {
return Wr(this, "forEach", e, t, void 0, arguments);
},
includes(...e) {
return $l(this, "includes", e);
},
indexOf(...e) {
return $l(this, "indexOf", e);
},
join(e) {
return an(this).join(e);
},
// keys() iterator only reads `length`, no optimisation required
lastIndexOf(...e) {
return $l(this, "lastIndexOf", e);
},
map(e, t) {
return Wr(this, "map", e, t, void 0, arguments);
},
pop() {
return qn(this, "pop");
},
push(...e) {
return qn(this, "push", e);
},
reduce(e, ...t) {
return Qs(this, "reduce", e, t);
},
reduceRight(e, ...t) {
return Qs(this, "reduceRight", e, t);
},
shift() {
return qn(this, "shift");
},
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
some(e, t) {
return Wr(this, "some", e, t, void 0, arguments);
},
splice(...e) {
return qn(this, "splice", e);
},
toReversed() {
return an(this).toReversed();
},
toSorted(e) {
return an(this).toSorted(e);
},
toSpliced(...e) {
return an(this).toSpliced(...e);
},
unshift(...e) {
return qn(this, "unshift", e);
},
values() {
return Il(this, "values", Pt);
}
};
function Il(e, t, r) {
const o = tl(e), n = o[t]();
return o !== e && !ur(e) && (n._next = n.next, n.next = () => {
const i = n._next();
return i.value && (i.value = r(i.value)), i;
}), n;
}
const Y2 = Array.prototype;
function Wr(e, t, r, o, n, i) {
const u = tl(e), l = u !== e && !ur(e), a = u[t];
if (a !== Y2[t]) {
const d = a.apply(e, i);
return l ? Pt(d) : d;
}
let s = r;
u !== e && (l ? s = function(d, f) {
return r.call(this, Pt(d), f, e);
} : r.length > 2 && (s = function(d, f) {
return r.call(this, d, f, e);
}));
const c = a.call(u, s, o);
return l && n ? n(c) : c;
}
function Qs(e, t, r, o) {
const n = tl(e);
let i = r;
return n !== e && (ur(e) ? r.length > 3 && (i = function(u, l, a) {
return r.call(this, u, l, a, e);
}) : i = function(u, l, a) {
return r.call(this, u, Pt(l), a, e);
}), n[t](i, ...o);
}
function $l(e, t, r) {
const o = Ae(e);
Dt(o, "iterate", fi);
const n = o[t](...r);
return (n === -1 || n === !1) && ds(r[0]) ? (r[0] = Ae(r[0]), o[t](...r)) : n;
}
function qn(e, t, r = []) {
Qr(), ls();
const o = Ae(e)[t].apply(e, r);
return as(), Jr(), o;
}
const K2 = /* @__PURE__ */ os("__proto__,__v_isRef,__isVue"), Hd = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(Xr)
);
function Z2(e) {
Xr(e) || (e = String(e));
const t = Ae(this);
return Dt(t, "has", e), t.hasOwnProperty(e);
}
class Nd {
constructor(t = !1, r = !1) {
this._isReadonly = t, this._isShallow = r;
}
get(t, r, o) {
if (r === "__v_skip") return t.__v_skip;
const n = this._isReadonly, i = this._isShallow;
if (r === "__v_isReactive")
return !n;
if (r === "__v_isReadonly")
return n;
if (r === "__v_isShallow")
return i;
if (r === "__v_raw")
return o === (n ? i ? Gd : Ud : i ? qd : Vd).get(t) || // receiver is not the reactive proxy, but has the same prototype
// this means the receiver is a user proxy of the reactive proxy
Object.getPrototypeOf(t) === Object.getPrototypeOf(o) ? t : void 0;
const u = ve(t);
if (!n) {
let a;
if (u && (a = G2[r]))
return a;
if (r === "hasOwnProperty")
return Z2;
}
const l = Reflect.get(
t,
r,
// if this is a proxy wrapping a ref, return methods using the raw ref
// as receiver so that we don't have to call `toRaw` on the ref in all
// its class methods
et(t) ? t : o
);
return (Xr(r) ? Hd.has(r) : K2(r)) || (n || Dt(t, "get", r), i) ? l : et(l) ? u && us(r) ? l : l.value : Ve(l) ? n ? kn(l) : Mi(l) : l;
}
}
class Wd extends Nd {
constructor(t = !1) {
super(!1, t);
}
set(t, r, o, n) {
let i = t[r];
if (!this._isShallow) {
const a = Uo(i);
if (!ur(o) && !Uo(o) && (i = Ae(i), o = Ae(o)), !ve(t) && et(i) && !et(o))
return a ? !1 : (i.value = o, !0);
}
const u = ve(t) && us(r) ? Number(r) < t.length : Ie(t, r), l = Reflect.set(
t,
r,
o,
et(t) ? t : n
);
return t === Ae(n) && (u ? Co(o, i) && Ur(t, "set", r, o) : Ur(t, "add", r, o)), l;
}
deleteProperty(t, r) {
const o = Ie(t, r);
t[r];
const n = Reflect.deleteProperty(t, r);
return n && o && Ur(t, "delete", r, void 0), n;
}
has(t, r) {
const o = Reflect.has(t, r);
return (!Xr(r) || !Hd.has(r)) && Dt(t, "has", r), o;
}
ownKeys(t) {
return Dt(
t,
"iterate",
ve(t) ? "length" : Wo
), Reflect.ownKeys(t);
}
}
class jd extends Nd {
constructor(t = !1) {
super(!0, t);
}
set(t, r) {
return !0;
}
deleteProperty(t, r) {
return !0;
}
}
const X2 = /* @__PURE__ */ new Wd(), Q2 = /* @__PURE__ */ new jd(), J2 = /* @__PURE__ */ new Wd(!0), eg = /* @__PURE__ */ new jd(!0), xa = (e) => e, Ui = (e) => Reflect.getPrototypeOf(e);
function tg(e, t, r) {
return function(...o) {
const n = this.__v_raw, i = Ae(n), u = vn(i), l = e === "entries" || e === Symbol.iterator && u, a = e === "keys" && u, s = n[e](...o), c = r ? xa : t ? ya : Pt;
return !t && Dt(
i,
"iterate",
a ? va : Wo
), {
// iterator protocol
next() {
const { value: d, done: f } = s.next();
return f ? { value: d, done: f } : {
value: l ? [c(d[0]), c(d[1])] : c(d),
done: f
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function Gi(e) {
return function(...t) {
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function rg(e, t) {
const r = {
get(n) {
const i = this.__v_raw, u = Ae(i), l = Ae(n);
e || (Co(n, l) && Dt(u, "get", n), Dt(u, "get", l));
const { has: a } = Ui(u), s = t ? xa : e ? ya : Pt;
if (a.call(u, n))
return s(i.get(n));
if (a.call(u, l))
return s(i.get(l));
i !== u && i.get(n);
},
get size() {
const n = this.__v_raw;
return !e && Dt(Ae(n), "iterate", Wo), Reflect.get(n, "size", n);
},
has(n) {
const i = this.__v_raw, u = Ae(i), l = Ae(n);
return e || (Co(n, l) && Dt(u, "has", n), Dt(u, "has", l)), n === l ? i.has(n) : i.has(n) || i.has(l);
},
forEach(n, i) {
const u = this, l = u.__v_raw, a = Ae(l), s = t ? xa : e ? ya : Pt;
return !e && Dt(a, "iterate", Wo), l.forEach((c, d) => n.call(i, s(c), s(d), u));
}
};
return at(
r,
e ? {
add: Gi("add"),
set: Gi("set"),
delete: Gi("delete"),
clear: Gi("clear")
} : {
add(n) {
!t && !ur(n) && !Uo(n) && (n = Ae(n));
const i = Ae(this);
return Ui(i).has.call(i, n) || (i.add(n), Ur(i, "add", n, n)), this;
},
set(n, i) {
!t && !ur(i) && !Uo(i) && (i = Ae(i));
const u = Ae(this), { has: l, get: a } = Ui(u);
let s = l.call(u, n);
s || (n = Ae(n), s = l.call(u, n));
const c = a.call(u, n);
return u.set(n, i), s ? Co(i, c) && Ur(u, "set", n, i) : Ur(u, "add", n, i), this;
},
delete(n) {
const i = Ae(this), { has: u, get: l } = Ui(i);
let a = u.call(i, n);
a || (n = Ae(n), a = u.call(i, n)), l && l.call(i, n);
const s = i.delete(n);
return a && Ur(i, "delete", n, void 0), s;
},
clear() {
const n = Ae(this), i = n.size !== 0, u = n.clear();
return i && Ur(
n,
"clear",
void 0,
void 0
), u;
}
}
), [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((n) => {
r[n] = tg(n, e, t);
}), r;
}
function rl(e, t) {
const r = rg(e, t);
return (o, n, i) => n === "__v_isReactive" ? !e : n === "__v_isReadonly" ? e : n === "__v_raw" ? o : Reflect.get(
Ie(r, n) && n in o ? r : o,
n,
i
);
}
const og = {
get: /* @__PURE__ */ rl(!1, !1)
}, ng = {
get: /* @__PURE__ */ rl(!1, !0)
}, ig = {
get: /* @__PURE__ */ rl(!0, !1)
}, ug = {
get: /* @__PURE__ */ rl(!0, !0)
}, Vd = /* @__PURE__ */ new WeakMap(), qd = /* @__PURE__ */ new WeakMap(), Ud = /* @__PURE__ */ new WeakMap(), Gd = /* @__PURE__ */ new WeakMap();
function lg(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function ag(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : lg(P2(e));
}
function Mi(e) {
return Uo(e) ? e : ol(
e,
!1,
X2,
og,
Vd
);
}
function sg(e) {
return ol(
e,
!1,
J2,
ng,
qd
);
}
function kn(e) {
return ol(
e,
!0,
Q2,
ig,
Ud
);
}
function Yi(e) {
return ol(
e,
!0,
eg,
ug,
Gd
);
}
function ol(e, t, r, o, n) {
if (!Ve(e) || e.__v_raw && !(t && e.__v_isReactive))
return e;
const i = n.get(e);
if (i)
return i;
const u = ag(e);
if (u === 0)
return e;
const l = new Proxy(
e,
u === 2 ? o : r
);
return n.set(e, l), l;
}
function xn(e) {
return Uo(e) ? xn(e.__v_raw) : !!(e && e.__v_isReactive);
}
function Uo(e) {
return !!(e && e.__v_isReadonly);
}
function ur(e) {
return !!(e && e.__v_isShallow);
}
function ds(e) {
return e ? !!e.__v_raw : !1;
}
function Ae(e) {
const t = e && e.__v_raw;
return t ? Ae(t) : e;
}
function Ca(e) {
return !Ie(e, "__v_skip") && Object.isExtensible(e) && Ad(e, "__v_skip", !0), e;
}
const Pt = (e) => Ve(e) ? Mi(e) : e, ya = (e) => Ve(e) ? kn(e) : e;
function et(e) {
return e ? e.__v_isRef === !0 : !1;
}
function U(e) {
return Yd(e, !1);
}
function wo(e) {
return Yd(e, !0);
}
function Yd(e, t) {
return et(e) ? e : new cg(e, t);
}
class cg {
constructor(t, r) {
this.dep = new cs(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = r ? t : Ae(t), this._value = r ? t : Pt(t), this.__v_isShallow = r;
}
get value() {
return this.dep.track(), this._value;
}
set value(t) {
const r = this._rawValue, o = this.__v_isShallow || ur(t) || Uo(t);
t = o ? t : Ae(t), Co(t, r) && (this._rawValue = t, this._value = o ? t : Pt(t), this.dep.trigger());
}
}
function be(e) {
return et(e) ? e.value : e;
}
function Cn(e) {
return me(e) ? e() : be(e);
}
const dg = {
get: (e, t, r) => t === "__v_raw" ? e : be(Reflect.get(e, t, r)),
set: (e, t, r, o) => {
const n = e[t];
return et(n) && !et(r) ? (n.value = r, !0) : Reflect.set(e, t, r, o);
}
};
function Kd(e) {
return xn(e) ? e : new Proxy(e, dg);
}
class fg {
constructor(t, r, o) {
this._object = t, this._key = r, this._defaultValue = o, this.__v_isRef = !0, this._value = void 0;
}
get value() {
const t = this._object[this._key];
return this._value = t === void 0 ? this._defaultValue : t;
}
set value(t) {
this._object[this._key] = t;
}
get dep() {
return U2(Ae(this._object), this._key);
}
}
class hg {
constructor(t) {
this._getter = t, this.__v_isRef = !0, this.__v_isReadonly = !0, this._value = void 0;
}
get value() {
return this._value = this._getter();
}
}
function Ct(e, t, r) {
return et(e) ? e : me(e) ? new hg(e) : Ve(e) && arguments.length > 1 ? pg(e, t, r) : U(e);
}
function pg(e, t, r) {
const o = e[t];
return et(o) ? o : new fg(e, t, r);
}
class gg {
constructor(t, r, o) {
this.fn = t, this.setter = r, this._value = void 0, this.dep = new cs(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = di - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !r, this.isSSR = o;
}
/**
* @internal
*/
notify() {
if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion
We !== this)
return $d(this, !0), !0;
}
get value() {
const t = this.dep.track();
return Bd(this), t && (t.version = this.dep.version), this._value;
}
set value(t) {
this.setter && this.setter(t);
}
}
function bg(e, t, r = !1) {
let o, n;
return me(e) ? o = e : (o = e.get, n = e.set), new gg(o, n, r);
}
const Ki = {}, wu = /* @__PURE__ */ new WeakMap();
let Bo;
function mg(e, t = !1, r = Bo) {
if (r) {
let o = wu.get(r);
o || wu.set(r, o = []), o.push(e);
}
}
function vg(e, t, r = Re) {
const { immediate: o, deep: n, once: i, scheduler: u, augmentJob: l, call: a } = r, s = (v) => n ? v : ur(v) || n === !1 || n === 0 ? Gr(v, 1) : Gr(v);
let c, d, f, p, h = !1, b = !1;
if (et(e) ? (d = () => e.value, h = ur(e)) : xn(e) ? (d = () => s(e), h = !0) : ve(e) ? (b = !0, h = e.some((v) => xn(v) || ur(v)), d = () => e.map((v) => {
if (et(v))
return v.value;
if (xn(v))
return s(v);
if (me(v))
return a ? a(v, 2) : v();
})) : me(e) ? t ? d = a ? () => a(e, 2) : e : d = () => {
if (f) {
Qr();
try {
f();
} finally {
Jr();
}
}
const v = Bo;
Bo = c;
try {
return a ? a(e, 3, [p]) : e(p);
} finally {
Bo = v;
}
} : d = ir, t && n) {
const v = d, S = n === !0 ? 1 / 0 : n;
d = () => Gr(v(), S);
}
const x = Fd(), g = () => {
c.stop(), x && x.active && is(x.effects, c);
};
if (i && t) {
const v = t;
t = (...S) => {
v(...S), g();
};
}
let m = b ? new Array(e.length).fill(Ki) : Ki;
const w = (v) => {
if (!(!(c.flags & 1) || !c.dirty && !v))
if (t) {
const S = c.run();
if (n || h || (b ? S.some((T, C) => Co(T, m[C])) : Co(S, m))) {
f && f();
const T = Bo;
Bo = c;
try {
const C = [
S,
// pass undefined as the old value when it's changed for the first time
m === Ki ? void 0 : b && m[0] === Ki ? [] : m,
p
];
a ? a(t, 3, C) : (
// @ts-expect-error
t(...C)
), m = S;
} finally {
Bo = T;
}
}
} else
c.run();
};
return l && l(w), c = new Md(d), c.scheduler = u ? () => u(w, !1) : w, p = (v) => mg(v, !1, c), f = c.onStop = () => {
const v = wu.get(c);
if (v) {
if (a)
a(v, 4);
else
for (const S of v) S();
wu.delete(c);
}
}, t ? o ? w(!0) : m = c.run() : u ? u(w.bind(null, !0), !0) : c.run(), g.pause = c.pause.bind(c), g.resume = c.resume.bind(c), g.stop = g, g;
}
function Gr(e, t = 1 / 0, r) {
if (t <= 0 || !Ve(e) || e.__v_skip || (r = r || /* @__PURE__ */ new Set(), r.has(e)))
return e;
if (r.add(e), t--, et(e))
Gr(e.value, t, r);
else if (ve(e))
for (let o = 0; o < e.length; o++)
Gr(e[o], t, r);
else if (yd(e) || vn(e))
e.forEach((o) => {
Gr(o, t, r);
});
else if (Sd(e)) {
for (const o in e)
Gr(e[o], t, r);
for (const o of Object.getOwnPropertySymbols(e))
Object.prototype.propertyIsEnumerable.call(e, o) && Gr(e[o], t, r);
}
return e;
}
var co = { NODE_ENV: "production" };
const ni = [];
let Ol = !1;
function xg(e, ...t) {
if (Ol) return;
Ol = !0, Qr();
const r = ni.length ? ni[ni.length - 1].component : null, o = r && r.appContext.config.warnHandler, n = Cg();
if (o)
Ln(
o,
r,
11,
[
// eslint-disable-next-line no-restricted-syntax
e + t.map((i) => {
var u, l;
return (l = (u = i.toString) == null ? void 0 : u.call(i)) != null ? l : JSON.stringify(i);
}).join(""),
r && r.proxy,
n.map(
({ vnode: i }) => `at <${jf(r, i.type)}>`
).join(`
`),
n
]
);
else {
const i = [`[Vue warn]: ${e}`, ...t];
n.length && i.push(`
`, ...yg(n)), console.warn(...i);
}
Jr(), Ol = !1;
}
function Cg() {
let e = ni[ni.length - 1];
if (!e)
return [];
const t = [];
for (; e; ) {
const r = t[0];
r && r.vnode === e ? r.recurseCount++ : t.push({
vnode: e,
recurseCount: 0
});
const o = e.component && e.component.parent;
e = o && o.vnode;
}
return t;
}
function yg(e) {
const t = [];
return e.forEach((r, o) => {
t.push(...o === 0 ? [] : [`
`], ..._g(r));
}), t;
}
function _g({ vnode: e, recurseCount: t }) {
const r = t > 0 ? `... (${t} recursive calls)` : "", o = e.component ? e.component.parent == null : !1, n = ` at <${jf(
e.component,
e.type,
o
)}`, i = ">" + r;
return e.props ? [n, ...wg(e.props), i] : [n + i];
}
function wg(e) {
const t = [], r = Object.keys(e);
return r.slice(0, 3).forEach((o) => {
t.push(...Zd(o, e[o]));
}), r.length > 3 && t.push(" ..."), t;
}
function Zd(e, t, r) {
return Je(t) ? (t = JSON.stringify(t), r ? t : [`${e}=${t}`]) : typeof t == "number" || typeof t == "boolean" || t == null ? r ? t : [`${e}=${t}`] : et(t) ? (t = Zd(e, Ae(t.value), !0), r ? t : [`${e}=Ref<`, t, ">"]) : me(t) ? [`${e}=fn${t.name ? `<${t.name}>` : ""}`] : (t = Ae(t), r ? t : [`${e}=`, t]);
}
function Ln(e, t, r, o) {
try {
return o ? e(...o) : e();
} catch (n) {
nl(n, t, r);
}
}
function mr(e, t, r, o) {
if (me(e)) {
const n = Ln(e, t, r, o);
return n && _d(n) && n.catch((i) => {
nl(i, t, r);
}), n;
}
if (ve(e)) {
const n = [];
for (let i = 0; i < e.length; i++)
n.push(mr(e[i], t, r, o));
return n;
}
}
function nl(e, t, r, o = !0) {
const n = t ? t.vnode : null, { errorHandler: i, throwUnhandledErrorInProduction: u } = t && t.appContext.config || Re;
if (t) {
let l = t.parent;
const a = t.proxy, s = `https://vuejs.org/error-reference/#runtime-${r}`;
for (; l; ) {
const c = l.ec;
if (c) {
for (let d = 0; d < c.length; d++)
if (c[d](e, a, s) === !1)
return;
}
l = l.parent;
}
if (i) {
Qr(), Ln(i, null, 10, [
e,
a,
s
]), Jr();
return;
}
}
Sg(e, r, n, o, u);
}
function Sg(e, t, r, o = !0, n = !1) {
if (n)
throw e;
console.error(e);
}
const Ht = [];
let kr = -1;
const yn = [];
let fo = null, hn = 0;
const Xd = /* @__PURE__ */ Promise.resolve();
let Su = null;
function Fr(e) {
const t = Su || Xd;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function Eg(e) {
let t = kr + 1, r = Ht.length;
for (; t < r; ) {
const o = t + r >>> 1, n = Ht[o], i = hi(n);
i < e || i === e && n.flags & 2 ? t = o + 1 : r = o;
}
return t;
}
function fs(e) {
if (!(e.flags & 1)) {
const t = hi(e), r = Ht[Ht.length - 1];
!r || // fast path when the job id is larger than the tail
!(e.flags & 2) && t >= hi(r) ? Ht.push(e) : Ht.splice(Eg(t), 0, e), e.flags |= 1, Qd();
}
}
function Qd() {
Su || (Su = Xd.then(tf));
}
function Jd(e) {
ve(e) ? yn.push(...e) : fo && e.id === -1 ? fo.splice(hn + 1, 0, e) : e.flags & 1 || (yn.push(e), e.flags |= 1), Qd();
}
function Js(e, t, r = kr + 1) {
for (; r < Ht.length; r++) {
const o = Ht[r];
if (o && o.flags & 2) {
if (e && o.id !== e.uid)
continue;
Ht.splice(r, 1), r--, o.flags & 4 && (o.flags &= -2), o(), o.flags & 4 || (o.flags &= -2);
}
}
}
function ef(e) {
if (yn.length) {
const t = [...new Set(yn)].sort(
(r, o) => hi(r) - hi(o)
);
if (yn.length = 0, fo) {
fo.push(...t);
return;
}
for (fo = t, hn = 0; hn < fo.length; hn++) {
const r = fo[hn];
r.flags & 4 && (r.flags &= -2), r.flags & 8 || r(), r.flags &= -2;
}
fo = null, hn = 0;
}
}
const hi = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
function tf(e) {
const t = ir;
try {
for (kr = 0; kr < Ht.length; kr++) {
const r = Ht[kr];
r && !(r.flags & 8) && (co.NODE_ENV !== "production" && t(r), r.flags & 4 && (r.flags &= -2), Ln(
r,
r.i,
r.i ? 15 : 14
), r.flags & 4 || (r.flags &= -2));
}
} finally {
for (; kr < Ht.length; kr++) {
const r = Ht[kr];
r && (r.flags &= -2);
}
kr = -1, Ht.length = 0, ef(), Su = null, (Ht.length || yn.length) && tf();
}
}
let vt = null, rf = null;
function Eu(e) {
const t = vt;
return vt = e, rf = e && e.type.__scopeId || null, t;
}
function Yt(e, t = vt, r) {
if (!t || e._n)
return e;
const o = (...n) => {
o._d && fc(-1);
const i = Eu(t);
let u;
try {
u = e(...n);
} finally {
Eu(i), o._d && fc(1);
}
return u;
};
return o._n = !0, o._c = !0, o._d = !0, o;
}
function il(e, t) {
if (vt === null)
return e;
const r = fl(vt), o = e.dirs || (e.dirs = []);
for (let n = 0; n < t.length; n++) {
let [i, u, l, a = Re] = t[n];
i && (me(i) && (i = {
mounted: i,
updated: i
}), i.deep && Gr(u), o.push({
dir: i,
instance: r,
value: u,
oldValue: void 0,
arg: l,
modifiers: a
}));
}
return e;
}
function Io(e, t, r, o) {
const n = e.dirs, i = t && t.dirs;
for (let u = 0; u < n.length; u++) {
const l = n[u];
i && (l.oldValue = i[u].value);
let a = l.dir[o];
a && (Qr(), mr(a, r, 8, [
e.el,
l,
e,
t
]), Jr());
}
}
const of = Symbol("_vte"), nf = (e) => e.__isTeleport, ii = (e) => e && (e.disabled || e.disabled === ""), ec = (e) => e && (e.defer || e.defer === ""), tc = (e) => typeof SVGElement != "undefined" && e instanceof SVGElement, rc = (e) => typeof MathMLElement == "function" && e instanceof MathMLElement, _a = (e, t) => {
const r = e && e.to;
return Je(r) ? t ? t(r) : null : r;
}, uf = {
name: "Teleport",
__isTeleport: !0,
process(e, t, r, o, n, i, u, l, a, s) {
const {
mc: c,
pc: d,
pbc: f,
o: { insert: p, querySelector: h, createText: b, createComment: x }
} = s, g = ii(t.props);
let { shapeFlag: m, children: w, dynamicChildren: v } = t;
if (e == null) {
const S = t.el = b(""), T = t.anchor = b("");
p(S, r, o), p(T, r, o);
const C = (F, $) => {
m & 16 && (n && n.isCE && (n.ce._teleportTarget = F), c(
w,
F,
$,
n,
i,
u,
l,
a
));
}, D = () => {
const F = t.target = _a(t.props, h), $ = af(F, t, b, p);
F && (u !== "svg" && tc(F) ? u = "svg" : u !== "mathml" && rc(F) && (u = "mathml"), g || (C(F, $), hu(t, !1)));
};
g && (C(r, T), hu(t, !0)), ec(t.props) ? zt(() => {
D(), t.el.__isMounted = !0;
}, i) : D();
} else {
if (ec(t.props) && !e.el.__isMounted) {
zt(() => {
uf.process(
e,
t,
r,
o,
n,
i,
u,
l,
a,
s
), delete e.el.__isMounted;
}, i);
return;
}
t.el = e.el, t.targetStart = e.targetStart;
const S = t.anchor = e.anchor, T = t.target = e.target, C = t.targetAnchor = e.targetAnchor, D = ii(e.props), F = D ? r : T, $ = D ? S : C;
if (u === "svg" || tc(T) ? u = "svg" : (u === "mathml" || rc(T)) && (u = "mathml"), v ? (f(
e.dynamicChildren,
v,
F,
n,
i,
u,
l
), bs(e, t, !0)) : a || d(
e,
t,
F,
$,
n,
i,
u,
l,
!1
), g)
D ? t.props && e.props && t.props.to !== e.props.to && (t.props.to = e.props.to) : Zi(
t,
r,
S,
s,
1
);
else if ((t.props && t.props.to) !== (e.props && e.props.to)) {
const R = t.target = _a(
t.props,
h
);
R && Zi(
t,
R,
null,
s,
0
);
} else D && Zi(
t,
T,
C,
s,
1
);
hu(t, g);
}
},
remove(e, t, r, { um: o, o: { remove: n } }, i) {
const {
shapeFlag: u,
children: l,
anchor: a,
targetStart: s,
targetAnchor: c,
target: d,
props: f
} = e;
if (d && (n(s), n(c)), i && n(a), u & 16) {
const p = i || !ii(f);
for (let h = 0; h < l.length; h++) {
const b = l[h];
o(
b,
t,
r,
p,
!!b.dynamicChildren
);
}
}
},
move: Zi,
hydrate: Ag
};
function Zi(e, t, r, { o: { insert: o }, m: n }, i = 2) {
i === 0 && o(e.targetAnchor, t, r);
const { el: u, anchor: l, shapeFlag: a, children: s, props: c } = e, d = i === 2;
if (d && o(u, t, r), (!d || ii(c)) && a & 16)
for (let f = 0; f < s.length; f++)
n(
s[f],
t,
r,
2
);
d && o(l, t, r);
}
function Ag(e, t, r, o, n, i, {
o: { nextSibling: u, parentNode: l, querySelector: a, insert: s, createText: c }
}, d) {
const f = t.target = _a(
t.props,
a
);
if (f) {
const p = ii(t.props), h = f._lpa || f.firstChild;
if (t.shapeFlag & 16)
if (p)
t.anchor = d(
u(e),
t,
l(e),
r,
o,
n,
i
), t.targetStart = h, t.targetAnchor = h && u(h);
else {
t.anchor = u(e);
let b = h;
for (; b; ) {
if (b && b.nodeType === 8) {
if (b.data === "teleport start anchor")
t.targetStart = b;
else if (b.data === "teleport anchor") {
t.targetAnchor = b, f._lpa = t.targetAnchor && u(t.targetAnchor);
break;
}
}
b = u(b);
}
t.targetAnchor || af(f, t, c, s), d(
h && u(h),
t,
f,
r,
o,
n,
i
);
}
hu(t, p);
}
return t.anchor && u(t.anchor);
}
const lf = uf;
function hu(e, t) {
const r = e.ctx;
if (r && r.ut) {
let o, n;
for (t ? (o = e.el, n = e.anchor) : (o = e.targetStart, n = e.targetAnchor); o && o !== n; )
o.nodeType === 1 && o.setAttribute("data-v-owner", r.uid), o = o.nextSibling;
r.ut();
}
}
function af(e, t, r, o) {
const n = t.targetStart = r(""), i = t.targetAnchor = r("");
return n[of] = i, e && (o(n, e), o(i, e)), i;
}
const ho = Symbol("_leaveCb"), Xi = Symbol("_enterCb");
function sf() {
const e = {
isMounted: !1,
isLeaving: !1,
isUnmounting: !1,
leavingVNodes: /* @__PURE__ */ new Map()
};
return $t(() => {
e.isMounted = !0;
}), Qt(() => {
e.isUnmounting = !0;
}), e;
}
const tr = [Function, Array], cf = {
mode: String,
appear: Boolean,
persisted: Boolean,
// enter
onBeforeEnter: tr,
onEnter: tr,
onAfterEnter: tr,
onEnterCancelled: tr,
// leave
onBeforeLeave: tr,
onLeave: tr,
onAfterLeave: tr,
onLeaveCancelled: tr,
// appear
onBeforeAppear: tr,
onAppear: tr,
onAfterAppear: tr,
onAppearCancelled: tr
}, df = (e) => {
const t = e.subTree;
return t.component ? df(t.component) : t;
}, kg = {
name: "BaseTransition",
props: cf,
setup(e, { slots: t }) {
const r = Jt(), o = sf();
return () => {
const n = t.default && hs(t.default(), !0);
if (!n || !n.length)
return;
const i = ff(n), u = Ae(e), { mode: l } = u;
if (o.isLeaving)
return Ll(i);
const a = oc(i);
if (!a)
return Ll(i);
let s = pi(
a,
u,
o,
r,
// #11061, ensure enterHooks is fresh after clone
(d) => s = d
);
a.type !== ht && Go(a, s);
let c = r.subTree && oc(r.subTree);
if (c && c.type !== ht && !zo(a, c) && df(r).type !== ht) {
let d = pi(
c,
u,
o,
r
);
if (Go(c, d), l === "out-in" && a.type !== ht)
return o.isLeaving = !0, d.afterLeave = () => {
o.isLeaving = !1, r.job.flags & 8 || r.update(), delete d.afterLeave, c = void 0;
}, Ll(i);
l === "in-out" && a.type !== ht ? d.delayLeave = (f, p, h) => {
const b = hf(
o,
c
);
b[String(c.key)] = c, f[ho] = () => {
p(), f[ho] = void 0, delete s.delayedLeave, c = void 0;
}, s.delayedLeave = () => {
h(), delete s.delayedLeave, c = void 0;
};
} : c = void 0;
} else c && (c = void 0);
return i;
};
}
};
function ff(e) {
let t = e[0];
if (e.length > 1) {
for (const r of e)
if (r.type !== ht) {
t = r;
break;
}
}
return t;
}
const Tg = kg;
function hf(e, t) {
const { leavingVNodes: r } = e;
let o = r.get(t.type);
return o || (o = /* @__PURE__ */ Object.create(null), r.set(t.type, o)), o;
}
function pi(e, t, r, o, n) {
const {
appear: i,
mode: u,
persisted: l = !1,
onBeforeEnter: a,
onEnter: s,
onAfterEnter: c,
onEnterCancelled: d,
onBeforeLeave: f,
onLeave: p,
onAfterLeave: h,
onLeaveCancelled: b,
onBeforeAppear: x,
onAppear: g,
onAfterAppear: m,
onAppearCancelled: w
} = t, v = String(e.key), S = hf(r, e), T = (F, $) => {
F && mr(
F,
o,
9,
$
);
}, C = (F, $) => {
const R = $[1];
T(F, $), ve(F) ? F.every((O) => O.length <= 1) && R() : F.length <= 1 && R();
}, D = {
mode: u,
persisted: l,
beforeEnter(F) {
let $ = a;
if (!r.isMounted)
if (i)
$ = x || a;
else
return;
F[ho] && F[ho](
!0
/* cancelled */
);
const R = S[v];
R && zo(e, R) && R.el[ho] && R.el[ho](), T($, [F]);
},
enter(F) {
let $ = s, R = c, O = d;
if (!r.isMounted)
if (i)
$ = g || s, R = m || c, O = w || d;
else
return;
let X = !1;
const ie = F[Xi] = (W) => {
X || (X = !0, W ? T(O, [F]) : T(R, [F]), D.delayedLeave && D.delayedLeave(), F[Xi] = void 0);
};
$ ? C($, [F, ie]) : ie();
},
leave(F, $) {
const R = String(e.key);
if (F[Xi] && F[Xi](
!0
/* cancelled */
), r.isUnmounting)
return $();
T(f, [F]);
let O = !1;
const X = F[ho] = (ie) => {
O || (O = !0, $(), ie ? T(b, [F]) : T(h, [F]), F[ho] = void 0, S[R] === e && delete S[R]);
};
S[R] = e, p ? C(p, [F, X]) : X();
},
clone(F) {
const $ = pi(
F,
t,
r,
o,
n
);
return n && n($), $;
}
};
return D;
}
function Ll(e) {
if (ul(e))
return e = Yr(e), e.children = null, e;
}
function oc(e) {
if (!ul(e))
return nf(e.type) && e.children ? ff(e.children) : e;
const { shapeFlag: t, children: r } = e;
if (r) {
if (t & 16)
return r[0];
if (t & 32 && me(r.default))
return r.default();
}
}
function Go(e, t) {
e.shapeFlag & 6 && e.component ? (e.transition = t, Go(e.component.subTree, t)) : e.shapeFlag & 128 ? (e.ssContent.transition = t.clone(e.ssContent), e.ssFallback.transition = t.clone(e.ssFallback)) : e.transition = t;
}
function hs(e, t = !1, r) {
let o = [], n = 0;
for (let i = 0; i < e.length; i++) {
let u = e[i];
const l = r == null ? u.key : String(r) + String(u.key != null ? u.key : i);
u.type === He ? (u.patchFlag & 128 && n++, o = o.concat(
hs(u.children, t, l)
)) : (t || u.type !== ht) && o.push(l != null ? Yr(u, { key: l }) : u);
}
if (n > 1)
for (let i = 0; i < o.length; i++)
o[i].patchFlag = -2;
return o;
}
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function Pe(e, t) {
return me(e) ? (
// #8236: extend call and options.name access are considered side-effects
// by Rollup, so we have to wrap it in a pure-annotated IIFE.
at({ name: e.name }, t, { setup: e })
) : e;
}
function pf(e) {
e.ids = [e.ids[0] + e.ids[2]++ + "-", 0, 0];
}
function Au(e, t, r, o, n = !1) {
if (ve(e)) {
e.forEach(
(h, b) => Au(
h,
t && (ve(t) ? t[b] : t),
r,
o,
n
)
);
return;
}
if (_n(o) && !n) {
o.shapeFlag & 512 && o.type.__asyncResolved && o.component.subTree.component && Au(e, t, r, o.component.subTree);
return;
}
const i = o.shapeFlag & 4 ? fl(o.component) : o.el, u = n ? null : i, { i: l, r: a } = e, s = t && t.r, c = l.refs === Re ? l.refs = {} : l.refs, d = l.setupState, f = Ae(d), p = d === Re ? () => !1 : (h) => Ie(f, h);
if (s != null && s !== a && (Je(s) ? (c[s] = null, p(s) && (d[s] = null)) : et(s) && (s.value = null)), me(a))
Ln(a, l, 12, [u, c]);
else {
const h = Je(a), b = et(a);
if (h || b) {
const x = () => {
if (e.f) {
const g = h ? p(a) ? d[a] : c[a] : a.value;
n ? ve(g) && is(g, i) : ve(g) ? g.includes(i) || g.push(i) : h ? (c[a] = [i], p(a) && (d[a] = c[a])) : (a.value = [i], e.k && (c[e.k] = a.value));
} else h ? (c[a] = u, p(a) && (d[a] = u)) : b && (a.value = u, e.k && (c[e.k] = u));
};
u ? (x.id = -1, zt(x, r)) : x();
}
}
}
Ju().requestIdleCallback;
Ju().cancelIdleCallback;
const _n = (e) => !!e.type.__asyncLoader, ul = (e) => e.type.__isKeepAlive;
function gf(e, t) {
mf(e, "a", t);
}
function bf(e, t) {
mf(e, "da", t);
}
function mf(e, t, r = pt) {
const o = e.__wdc || (e.__wdc = () => {
let n = r;
for (; n; ) {
if (n.isDeactivated)
return;
n = n.parent;
}
return e();
});
if (ll(t, o, r), r) {
let n = r.parent;
for (; n && n.parent; )
ul(n.parent.vnode) && Dg(o, t, r, n), n = n.parent;
}
}
function Dg(e, t, r, o) {
const n = ll(
t,
e,
o,
!0
/* prepend */
);
sl(() => {
is(o[t], n);
}, r);
}
function ll(e, t, r = pt, o = !1) {
if (r) {
const n = r[e] || (r[e] = []), i = t.__weh || (t.__weh = (...u) => {
Qr();
const l = $i(r), a = mr(t, r, e, u);
return l(), Jr(), a;
});
return o ? n.unshift(i) : n.push(i), i;
}
}
const eo = (e) => (t, r = pt) => {
(!bi || e === "sp") && ll(e, (...o) => t(...o), r);
}, al = eo("bm"), $t = eo("m"), vf = eo(
"bu"
), xf = eo("u"), Qt = eo(
"bum"
), sl = eo("um"), Pg = eo(
"sp"
), Fg = eo("rtg"), Mg = eo("rtc");
function Ig(e, t = pt) {
ll("ec", e, t);
}
const $g = Symbol.for("v-ndc");
function ps(e, t, r, o) {
let n;
const i = r, u = ve(e);
if (u || Je(e)) {
const l = u && xn(e);
let a = !1;
l && (a = !ur(e), e = tl(e)), n = new Array(e.length);
for (let s = 0, c = e.length; s < c; s++)
n[s] = t(
a ? Pt(e[s]) : e[s],
s,
void 0,
i
);
} else if (typeof e == "number") {
n = new Array(e);
for (let l = 0; l < e; l++)
n[l] = t(l + 1, l, void 0, i);
} else if (Ve(e))
if (e[Symbol.iterator])
n = Array.from(
e,
(l, a) => t(l, a, void 0, i)
);
else {
const l = Object.keys(e);
n = new Array(l.length);
for (let a = 0,