gptx-chatbot-ui
Version:
Integrate chatbots into third-party pages via gptx-chatbot-ui
1,933 lines • 2.2 MB
JavaScript
var $v = Object.defineProperty, qv = Object.defineProperties;
var Vv = Object.getOwnPropertyDescriptors;
var Tm = Object.getOwnPropertySymbols;
var Wv = Object.prototype.hasOwnProperty, Kv = Object.prototype.propertyIsEnumerable;
var Cm = (e, t, n) => t in e ? $v(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, cn = (e, t) => {
for (var n in t || (t = {}))
Wv.call(t, n) && Cm(e, n, t[n]);
if (Tm)
for (var n of Tm(t))
Kv.call(t, n) && Cm(e, n, t[n]);
return e;
}, Pn = (e, t) => qv(e, Vv(t));
var Yt = (e, t, n) => new Promise((r, o) => {
var a = (l) => {
try {
s(n.next(l));
} catch (c) {
o(c);
}
}, i = (l) => {
try {
s(n.throw(l));
} catch (c) {
o(c);
}
}, s = (l) => l.done ? r(l.value) : Promise.resolve(l.value).then(a, i);
s((n = n.apply(e, t)).next());
});
/**
* @vue/shared v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function Np(e) {
const t = /* @__PURE__ */ Object.create(null);
for (const n of e.split(",")) t[n] = 1;
return (n) => n in t;
}
const mt = {}, ea = [], Gn = () => {
}, Qv = () => !1, Vs = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), Ip = (e) => e.startsWith("onUpdate:"), Ht = Object.assign, xp = (e, t) => {
const n = e.indexOf(t);
n > -1 && e.splice(n, 1);
}, Xv = Object.prototype.hasOwnProperty, it = (e, t) => Xv.call(e, t), Fe = Array.isArray, ta = (e) => Ws(e) === "[object Map]", Ah = (e) => Ws(e) === "[object Set]", ke = (e) => typeof e == "function", It = (e) => typeof e == "string", xr = (e) => typeof e == "symbol", St = (e) => e !== null && typeof e == "object", Nh = (e) => (St(e) || ke(e)) && ke(e.then) && ke(e.catch), Ih = Object.prototype.toString, Ws = (e) => Ih.call(e), Zv = (e) => Ws(e).slice(8, -1), xh = (e) => Ws(e) === "[object Object]", Dp = (e) => It(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, za = /* @__PURE__ */ Np(
// the leading comma is intentional so empty string "" is also included
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), Ks = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return (n) => t[n] || (t[n] = e(n));
}, jv = /-(\w)/g, Jr = Ks(
(e) => e.replace(jv, (t, n) => n ? n.toUpperCase() : "")
), Jv = /\B([A-Z])/g, Lo = Ks(
(e) => e.replace(Jv, "-$1").toLowerCase()
), Dh = Ks((e) => e.charAt(0).toUpperCase() + e.slice(1)), Tl = Ks(
(e) => e ? `on${Dh(e)}` : ""
), Zr = (e, t) => !Object.is(e, t), Cl = (e, ...t) => {
for (let n = 0; n < e.length; n++)
e[n](...t);
}, Mh = (e, t, n, r = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: r,
value: n
});
}, eR = (e) => {
const t = parseFloat(e);
return isNaN(t) ? e : t;
}, tR = (e) => {
const t = It(e) ? Number(e) : NaN;
return isNaN(t) ? e : t;
};
let vm;
const Qs = () => vm || (vm = typeof globalThis != "undefined" ? globalThis : typeof self != "undefined" ? self : typeof window != "undefined" ? window : typeof global != "undefined" ? global : {});
function Xs(e) {
if (Fe(e)) {
const t = {};
for (let n = 0; n < e.length; n++) {
const r = e[n], o = It(r) ? aR(r) : Xs(r);
if (o)
for (const a in o)
t[a] = o[a];
}
return t;
} else if (It(e) || St(e))
return e;
}
const nR = /;(?![^(]*\))/g, rR = /:([^]+)/, oR = /\/\*[^]*?\*\//g;
function aR(e) {
const t = {};
return e.replace(oR, "").split(nR).forEach((n) => {
if (n) {
const r = n.split(rR);
r.length > 1 && (t[r[0].trim()] = r[1].trim());
}
}), t;
}
function Sa(e) {
let t = "";
if (It(e))
t = e;
else if (Fe(e))
for (let n = 0; n < e.length; n++) {
const r = Sa(e[n]);
r && (t += r + " ");
}
else if (St(e))
for (const n in e)
e[n] && (t += n + " ");
return t.trim();
}
const iR = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", sR = /* @__PURE__ */ Np(iR);
function wh(e) {
return !!e || e === "";
}
const Lh = (e) => !!(e && e.__v_isRef === !0), Un = (e) => It(e) ? e : e == null ? "" : Fe(e) || St(e) && (e.toString === Ih || !ke(e.toString)) ? Lh(e) ? Un(e.value) : JSON.stringify(e, Ph, 2) : String(e), Ph = (e, t) => Lh(t) ? Ph(e, t.value) : ta(t) ? {
[`Map(${t.size})`]: [...t.entries()].reduce(
(n, [r, o], a) => (n[vl(r, a) + " =>"] = o, n),
{}
)
} : Ah(t) ? {
[`Set(${t.size})`]: [...t.values()].map((n) => vl(n))
} : xr(t) ? vl(t) : St(t) && !Fe(t) && !xh(t) ? String(t) : t, vl = (e, t = "") => {
var n;
return (
// Symbol.description in es2019+ so we need to cast here to pass
// the lib: es2016 check
xr(e) ? `Symbol(${(n = e.description) != null ? n : t})` : e
);
};
var lR = { NODE_ENV: "production" };
let pn;
class kh {
constructor(t = !1) {
this.detached = t, this._active = !0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = pn, !t && pn && (this.index = (pn.scopes || (pn.scopes = [])).push(
this
) - 1);
}
get active() {
return this._active;
}
pause() {
if (this._active) {
this._isPaused = !0;
let t, n;
if (this.scopes)
for (t = 0, n = this.scopes.length; t < n; t++)
this.scopes[t].pause();
for (t = 0, n = this.effects.length; t < n; 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, n;
if (this.scopes)
for (t = 0, n = this.scopes.length; t < n; t++)
this.scopes[t].resume();
for (t = 0, n = this.effects.length; t < n; t++)
this.effects[t].resume();
}
}
run(t) {
if (this._active) {
const n = pn;
try {
return pn = this, t();
} finally {
pn = n;
}
}
}
/**
* This should only be called on non-detached scopes
* @internal
*/
on() {
pn = this;
}
/**
* This should only be called on non-detached scopes
* @internal
*/
off() {
pn = this.parent;
}
stop(t) {
if (this._active) {
this._active = !1;
let n, r;
for (n = 0, r = this.effects.length; n < r; n++)
this.effects[n].stop();
for (this.effects.length = 0, n = 0, r = this.cleanups.length; n < r; n++)
this.cleanups[n]();
if (this.cleanups.length = 0, this.scopes) {
for (n = 0, r = this.scopes.length; n < r; n++)
this.scopes[n].stop(!0);
this.scopes.length = 0;
}
if (!this.detached && this.parent && !t) {
const o = this.parent.scopes.pop();
o && o !== this && (this.parent.scopes[this.index] = o, o.index = this.index);
}
this.parent = void 0;
}
}
}
function cR(e) {
return new kh(e);
}
function Fh() {
return pn;
}
function uR(e, t = !1) {
pn && pn.cleanups.push(e);
}
let gt;
const Rl = /* @__PURE__ */ new WeakSet();
class Bh {
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, pn && pn.active && pn.effects.push(this);
}
pause() {
this.flags |= 64;
}
resume() {
this.flags & 64 && (this.flags &= -65, Rl.has(this) && (Rl.delete(this), this.trigger()));
}
/**
* @internal
*/
notify() {
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || Gh(this);
}
run() {
if (!(this.flags & 1))
return this.fn();
this.flags |= 2, Rm(this), Hh(this);
const t = gt, n = Jn;
gt = this, Jn = !0;
try {
return this.fn();
} finally {
Yh(this), gt = t, Jn = n, this.flags &= -3;
}
}
stop() {
if (this.flags & 1) {
for (let t = this.deps; t; t = t.nextDep)
Lp(t);
this.deps = this.depsTail = void 0, Rm(this), this.onStop && this.onStop(), this.flags &= -2;
}
}
trigger() {
this.flags & 64 ? Rl.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
}
/**
* @internal
*/
runIfDirty() {
Y_(this) && this.run();
}
get dirty() {
return Y_(this);
}
}
let Uh = 0, $a, qa;
function Gh(e, t = !1) {
if (e.flags |= 8, t) {
e.next = qa, qa = e;
return;
}
e.next = $a, $a = e;
}
function Mp() {
Uh++;
}
function wp() {
if (--Uh > 0)
return;
if (qa) {
let t = qa;
for (qa = void 0; t; ) {
const n = t.next;
t.next = void 0, t.flags &= -9, t = n;
}
}
let e;
for (; $a; ) {
let t = $a;
for ($a = void 0; t; ) {
const n = t.next;
if (t.next = void 0, t.flags &= -9, t.flags & 1)
try {
t.trigger();
} catch (r) {
e || (e = r);
}
t = n;
}
}
if (e) throw e;
}
function Hh(e) {
for (let t = e.deps; t; t = t.nextDep)
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
}
function Yh(e) {
let t, n = e.depsTail, r = n;
for (; r; ) {
const o = r.prevDep;
r.version === -1 ? (r === n && (n = o), Lp(r), dR(r)) : t = r, r.dep.activeLink = r.prevActiveLink, r.prevActiveLink = void 0, r = o;
}
e.deps = t, e.depsTail = n;
}
function Y_(e) {
for (let t = e.deps; t; t = t.nextDep)
if (t.dep.version !== t.version || t.dep.computed && (zh(t.dep.computed) || t.dep.version !== t.version))
return !0;
return !!e._dirty;
}
function zh(e) {
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === Ja))
return;
e.globalVersion = Ja;
const t = e.dep;
if (e.flags |= 2, t.version > 0 && !e.isSSR && e.deps && !Y_(e)) {
e.flags &= -3;
return;
}
const n = gt, r = Jn;
gt = e, Jn = !0;
try {
Hh(e);
const o = e.fn(e._value);
(t.version === 0 || Zr(o, e._value)) && (e._value = o, t.version++);
} catch (o) {
throw t.version++, o;
} finally {
gt = n, Jn = r, Yh(e), e.flags &= -3;
}
}
function Lp(e, t = !1) {
const { dep: n, prevSub: r, nextSub: o } = e;
if (r && (r.nextSub = o, e.prevSub = void 0), o && (o.prevSub = r, e.nextSub = void 0), n.subs === e && (n.subs = r, !r && n.computed)) {
n.computed.flags &= -5;
for (let a = n.computed.deps; a; a = a.nextDep)
Lp(a, !0);
}
!t && !--n.sc && n.map && n.map.delete(n.key);
}
function dR(e) {
const { prevDep: t, nextDep: n } = e;
t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
}
let Jn = !0;
const $h = [];
function Dr() {
$h.push(Jn), Jn = !1;
}
function Mr() {
const e = $h.pop();
Jn = e === void 0 ? !0 : e;
}
function Rm(e) {
const { cleanup: t } = e;
if (e.cleanup = void 0, t) {
const n = gt;
gt = void 0;
try {
t();
} finally {
gt = n;
}
}
}
let Ja = 0;
class _R {
constructor(t, n) {
this.sub = t, this.dep = n, this.version = n.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
}
}
class Pp {
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 (!gt || !Jn || gt === this.computed)
return;
let n = this.activeLink;
if (n === void 0 || n.sub !== gt)
n = this.activeLink = new _R(gt, this), gt.deps ? (n.prevDep = gt.depsTail, gt.depsTail.nextDep = n, gt.depsTail = n) : gt.deps = gt.depsTail = n, qh(n);
else if (n.version === -1 && (n.version = this.version, n.nextDep)) {
const r = n.nextDep;
r.prevDep = n.prevDep, n.prevDep && (n.prevDep.nextDep = r), n.prevDep = gt.depsTail, n.nextDep = void 0, gt.depsTail.nextDep = n, gt.depsTail = n, gt.deps === n && (gt.deps = r);
}
return n;
}
trigger(t) {
this.version++, Ja++, this.notify(t);
}
notify(t) {
Mp();
try {
lR.NODE_ENV;
for (let n = this.subs; n; n = n.prevSub)
n.sub.notify() && n.sub.dep.notify();
} finally {
wp();
}
}
}
function qh(e) {
if (e.dep.sc++, e.sub.flags & 4) {
const t = e.dep.computed;
if (t && !e.dep.subs) {
t.flags |= 20;
for (let r = t.deps; r; r = r.nextDep)
qh(r);
}
const n = e.dep.subs;
n !== e && (e.prevSub = n, n && (n.nextSub = e)), e.dep.subs = e;
}
}
const Ss = /* @__PURE__ */ new WeakMap(), yo = Symbol(
""
), z_ = Symbol(
""
), ei = Symbol(
""
);
function tn(e, t, n) {
if (Jn && gt) {
let r = Ss.get(e);
r || Ss.set(e, r = /* @__PURE__ */ new Map());
let o = r.get(n);
o || (r.set(n, o = new Pp()), o.map = r, o.key = n), o.track();
}
}
function yr(e, t, n, r, o, a) {
const i = Ss.get(e);
if (!i) {
Ja++;
return;
}
const s = (l) => {
l && l.trigger();
};
if (Mp(), t === "clear")
i.forEach(s);
else {
const l = Fe(e), c = l && Dp(n);
if (l && n === "length") {
const u = Number(r);
i.forEach((d, _) => {
(_ === "length" || _ === ei || !xr(_) && _ >= u) && s(d);
});
} else
switch ((n !== void 0 || i.has(void 0)) && s(i.get(n)), c && s(i.get(ei)), t) {
case "add":
l ? c && s(i.get("length")) : (s(i.get(yo)), ta(e) && s(i.get(z_)));
break;
case "delete":
l || (s(i.get(yo)), ta(e) && s(i.get(z_)));
break;
case "set":
ta(e) && s(i.get(yo));
break;
}
}
wp();
}
function pR(e, t) {
const n = Ss.get(e);
return n && n.get(t);
}
function qo(e) {
const t = Ke(e);
return t === e ? t : (tn(t, "iterate", ei), Hn(e) ? t : t.map(nn));
}
function Zs(e) {
return tn(e = Ke(e), "iterate", ei), e;
}
const mR = {
__proto__: null,
[Symbol.iterator]() {
return yl(this, Symbol.iterator, nn);
},
concat(...e) {
return qo(this).concat(
...e.map((t) => Fe(t) ? qo(t) : t)
);
},
entries() {
return yl(this, "entries", (e) => (e[1] = nn(e[1]), e));
},
every(e, t) {
return Tr(this, "every", e, t, void 0, arguments);
},
filter(e, t) {
return Tr(this, "filter", e, t, (n) => n.map(nn), arguments);
},
find(e, t) {
return Tr(this, "find", e, t, nn, arguments);
},
findIndex(e, t) {
return Tr(this, "findIndex", e, t, void 0, arguments);
},
findLast(e, t) {
return Tr(this, "findLast", e, t, nn, arguments);
},
findLastIndex(e, t) {
return Tr(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 Tr(this, "forEach", e, t, void 0, arguments);
},
includes(...e) {
return Ol(this, "includes", e);
},
indexOf(...e) {
return Ol(this, "indexOf", e);
},
join(e) {
return qo(this).join(e);
},
// keys() iterator only reads `length`, no optimisation required
lastIndexOf(...e) {
return Ol(this, "lastIndexOf", e);
},
map(e, t) {
return Tr(this, "map", e, t, void 0, arguments);
},
pop() {
return wa(this, "pop");
},
push(...e) {
return wa(this, "push", e);
},
reduce(e, ...t) {
return ym(this, "reduce", e, t);
},
reduceRight(e, ...t) {
return ym(this, "reduceRight", e, t);
},
shift() {
return wa(this, "shift");
},
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
some(e, t) {
return Tr(this, "some", e, t, void 0, arguments);
},
splice(...e) {
return wa(this, "splice", e);
},
toReversed() {
return qo(this).toReversed();
},
toSorted(e) {
return qo(this).toSorted(e);
},
toSpliced(...e) {
return qo(this).toSpliced(...e);
},
unshift(...e) {
return wa(this, "unshift", e);
},
values() {
return yl(this, "values", nn);
}
};
function yl(e, t, n) {
const r = Zs(e), o = r[t]();
return r !== e && !Hn(e) && (o._next = o.next, o.next = () => {
const a = o._next();
return a.value && (a.value = n(a.value)), a;
}), o;
}
const fR = Array.prototype;
function Tr(e, t, n, r, o, a) {
const i = Zs(e), s = i !== e && !Hn(e), l = i[t];
if (l !== fR[t]) {
const d = l.apply(e, a);
return s ? nn(d) : d;
}
let c = n;
i !== e && (s ? c = function(d, _) {
return n.call(this, nn(d), _, e);
} : n.length > 2 && (c = function(d, _) {
return n.call(this, d, _, e);
}));
const u = l.call(i, c, r);
return s && o ? o(u) : u;
}
function ym(e, t, n, r) {
const o = Zs(e);
let a = n;
return o !== e && (Hn(e) ? n.length > 3 && (a = function(i, s, l) {
return n.call(this, i, s, l, e);
}) : a = function(i, s, l) {
return n.call(this, i, nn(s), l, e);
}), o[t](a, ...r);
}
function Ol(e, t, n) {
const r = Ke(e);
tn(r, "iterate", ei);
const o = r[t](...n);
return (o === -1 || o === !1) && kp(n[0]) ? (n[0] = Ke(n[0]), r[t](...n)) : o;
}
function wa(e, t, n = []) {
Dr(), Mp();
const r = Ke(e)[t].apply(e, n);
return wp(), Mr(), r;
}
const gR = /* @__PURE__ */ Np("__proto__,__v_isRef,__isVue"), Vh = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(xr)
);
function ER(e) {
xr(e) || (e = String(e));
const t = Ke(this);
return tn(t, "has", e), t.hasOwnProperty(e);
}
class Wh {
constructor(t = !1, n = !1) {
this._isReadonly = t, this._isShallow = n;
}
get(t, n, r) {
if (n === "__v_skip") return t.__v_skip;
const o = this._isReadonly, a = this._isShallow;
if (n === "__v_isReactive")
return !o;
if (n === "__v_isReadonly")
return o;
if (n === "__v_isShallow")
return a;
if (n === "__v_raw")
return r === (o ? a ? Jh : jh : a ? Zh : Xh).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(r) ? t : void 0;
const i = Fe(t);
if (!o) {
let l;
if (i && (l = mR[n]))
return l;
if (n === "hasOwnProperty")
return ER;
}
const s = Reflect.get(
t,
n,
// 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
Mt(t) ? t : r
);
return (xr(n) ? Vh.has(n) : gR(n)) || (o || tn(t, "get", n), a) ? s : Mt(s) ? i && Dp(n) ? s : s.value : St(s) ? o ? ua(s) : hi(s) : s;
}
}
class Kh extends Wh {
constructor(t = !1) {
super(!1, t);
}
set(t, n, r, o) {
let a = t[n];
if (!this._isShallow) {
const l = Io(a);
if (!Hn(r) && !Io(r) && (a = Ke(a), r = Ke(r)), !Fe(t) && Mt(a) && !Mt(r))
return l ? !1 : (a.value = r, !0);
}
const i = Fe(t) && Dp(n) ? Number(n) < t.length : it(t, n), s = Reflect.set(
t,
n,
r,
Mt(t) ? t : o
);
return t === Ke(o) && (i ? Zr(r, a) && yr(t, "set", n, r) : yr(t, "add", n, r)), s;
}
deleteProperty(t, n) {
const r = it(t, n);
t[n];
const o = Reflect.deleteProperty(t, n);
return o && r && yr(t, "delete", n, void 0), o;
}
has(t, n) {
const r = Reflect.has(t, n);
return (!xr(n) || !Vh.has(n)) && tn(t, "has", n), r;
}
ownKeys(t) {
return tn(
t,
"iterate",
Fe(t) ? "length" : yo
), Reflect.ownKeys(t);
}
}
class Qh extends Wh {
constructor(t = !1) {
super(!0, t);
}
set(t, n) {
return !0;
}
deleteProperty(t, n) {
return !0;
}
}
const SR = /* @__PURE__ */ new Kh(), bR = /* @__PURE__ */ new Qh(), hR = /* @__PURE__ */ new Kh(!0), TR = /* @__PURE__ */ new Qh(!0), $_ = (e) => e, Yi = (e) => Reflect.getPrototypeOf(e);
function CR(e, t, n) {
return function(...r) {
const o = this.__v_raw, a = Ke(o), i = ta(a), s = e === "entries" || e === Symbol.iterator && i, l = e === "keys" && i, c = o[e](...r), u = n ? $_ : t ? V_ : nn;
return !t && tn(
a,
"iterate",
l ? z_ : yo
), {
// iterator protocol
next() {
const { value: d, done: _ } = c.next();
return _ ? { value: d, done: _ } : {
value: s ? [u(d[0]), u(d[1])] : u(d),
done: _
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function zi(e) {
return function(...t) {
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function vR(e, t) {
const n = {
get(o) {
const a = this.__v_raw, i = Ke(a), s = Ke(o);
e || (Zr(o, s) && tn(i, "get", o), tn(i, "get", s));
const { has: l } = Yi(i), c = t ? $_ : e ? V_ : nn;
if (l.call(i, o))
return c(a.get(o));
if (l.call(i, s))
return c(a.get(s));
a !== i && a.get(o);
},
get size() {
const o = this.__v_raw;
return !e && tn(Ke(o), "iterate", yo), Reflect.get(o, "size", o);
},
has(o) {
const a = this.__v_raw, i = Ke(a), s = Ke(o);
return e || (Zr(o, s) && tn(i, "has", o), tn(i, "has", s)), o === s ? a.has(o) : a.has(o) || a.has(s);
},
forEach(o, a) {
const i = this, s = i.__v_raw, l = Ke(s), c = t ? $_ : e ? V_ : nn;
return !e && tn(l, "iterate", yo), s.forEach((u, d) => o.call(a, c(u), c(d), i));
}
};
return Ht(
n,
e ? {
add: zi("add"),
set: zi("set"),
delete: zi("delete"),
clear: zi("clear")
} : {
add(o) {
!t && !Hn(o) && !Io(o) && (o = Ke(o));
const a = Ke(this);
return Yi(a).has.call(a, o) || (a.add(o), yr(a, "add", o, o)), this;
},
set(o, a) {
!t && !Hn(a) && !Io(a) && (a = Ke(a));
const i = Ke(this), { has: s, get: l } = Yi(i);
let c = s.call(i, o);
c || (o = Ke(o), c = s.call(i, o));
const u = l.call(i, o);
return i.set(o, a), c ? Zr(a, u) && yr(i, "set", o, a) : yr(i, "add", o, a), this;
},
delete(o) {
const a = Ke(this), { has: i, get: s } = Yi(a);
let l = i.call(a, o);
l || (o = Ke(o), l = i.call(a, o)), s && s.call(a, o);
const c = a.delete(o);
return l && yr(a, "delete", o, void 0), c;
},
clear() {
const o = Ke(this), a = o.size !== 0, i = o.clear();
return a && yr(
o,
"clear",
void 0,
void 0
), i;
}
}
), [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((o) => {
n[o] = CR(o, e, t);
}), n;
}
function js(e, t) {
const n = vR(e, t);
return (r, o, a) => o === "__v_isReactive" ? !e : o === "__v_isReadonly" ? e : o === "__v_raw" ? r : Reflect.get(
it(n, o) && o in r ? n : r,
o,
a
);
}
const RR = {
get: /* @__PURE__ */ js(!1, !1)
}, yR = {
get: /* @__PURE__ */ js(!1, !0)
}, OR = {
get: /* @__PURE__ */ js(!0, !1)
}, AR = {
get: /* @__PURE__ */ js(!0, !0)
}, Xh = /* @__PURE__ */ new WeakMap(), Zh = /* @__PURE__ */ new WeakMap(), jh = /* @__PURE__ */ new WeakMap(), Jh = /* @__PURE__ */ new WeakMap();
function NR(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function IR(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : NR(Zv(e));
}
function hi(e) {
return Io(e) ? e : Js(
e,
!1,
SR,
RR,
Xh
);
}
function xR(e) {
return Js(
e,
!1,
hR,
yR,
Zh
);
}
function ua(e) {
return Js(
e,
!0,
bR,
OR,
jh
);
}
function $i(e) {
return Js(
e,
!0,
TR,
AR,
Jh
);
}
function Js(e, t, n, r, o) {
if (!St(e) || e.__v_raw && !(t && e.__v_isReactive))
return e;
const a = o.get(e);
if (a)
return a;
const i = IR(e);
if (i === 0)
return e;
const s = new Proxy(
e,
i === 2 ? r : n
);
return o.set(e, s), s;
}
function na(e) {
return Io(e) ? na(e.__v_raw) : !!(e && e.__v_isReactive);
}
function Io(e) {
return !!(e && e.__v_isReadonly);
}
function Hn(e) {
return !!(e && e.__v_isShallow);
}
function kp(e) {
return e ? !!e.__v_raw : !1;
}
function Ke(e) {
const t = e && e.__v_raw;
return t ? Ke(t) : e;
}
function q_(e) {
return !it(e, "__v_skip") && Object.isExtensible(e) && Mh(e, "__v_skip", !0), e;
}
const nn = (e) => St(e) ? hi(e) : e, V_ = (e) => St(e) ? ua(e) : e;
function Mt(e) {
return e ? e.__v_isRef === !0 : !1;
}
function ee(e) {
return e0(e, !1);
}
function eo(e) {
return e0(e, !0);
}
function e0(e, t) {
return Mt(e) ? e : new DR(e, t);
}
class DR {
constructor(t, n) {
this.dep = new Pp(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = n ? t : Ke(t), this._value = n ? t : nn(t), this.__v_isShallow = n;
}
get value() {
return this.dep.track(), this._value;
}
set value(t) {
const n = this._rawValue, r = this.__v_isShallow || Hn(t) || Io(t);
t = r ? t : Ke(t), Zr(t, n) && (this._rawValue = t, this._value = r ? t : nn(t), this.dep.trigger());
}
}
function Pe(e) {
return Mt(e) ? e.value : e;
}
function ra(e) {
return ke(e) ? e() : Pe(e);
}
const MR = {
get: (e, t, n) => t === "__v_raw" ? e : Pe(Reflect.get(e, t, n)),
set: (e, t, n, r) => {
const o = e[t];
return Mt(o) && !Mt(n) ? (o.value = n, !0) : Reflect.set(e, t, n, r);
}
};
function t0(e) {
return na(e) ? e : new Proxy(e, MR);
}
class wR {
constructor(t, n, r) {
this._object = t, this._key = n, this._defaultValue = r, 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 pR(Ke(this._object), this._key);
}
}
class LR {
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 Zt(e, t, n) {
return Mt(e) ? e : ke(e) ? new LR(e) : St(e) && arguments.length > 1 ? PR(e, t, n) : ee(e);
}
function PR(e, t, n) {
const r = e[t];
return Mt(r) ? r : new wR(e, t, n);
}
class kR {
constructor(t, n, r) {
this.fn = t, this.setter = n, this._value = void 0, this.dep = new Pp(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = Ja - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !n, this.isSSR = r;
}
/**
* @internal
*/
notify() {
if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion
gt !== this)
return Gh(this, !0), !0;
}
get value() {
const t = this.dep.track();
return zh(this), t && (t.version = this.dep.version), this._value;
}
set value(t) {
this.setter && this.setter(t);
}
}
function FR(e, t, n = !1) {
let r, o;
return ke(e) ? r = e : (r = e.get, o = e.set), new kR(r, o, n);
}
const qi = {}, bs = /* @__PURE__ */ new WeakMap();
let ho;
function BR(e, t = !1, n = ho) {
if (n) {
let r = bs.get(n);
r || bs.set(n, r = []), r.push(e);
}
}
function UR(e, t, n = mt) {
const { immediate: r, deep: o, once: a, scheduler: i, augmentJob: s, call: l } = n, c = (b) => o ? b : Hn(b) || o === !1 || o === 0 ? Or(b, 1) : Or(b);
let u, d, _, m, p = !1, f = !1;
if (Mt(e) ? (d = () => e.value, p = Hn(e)) : na(e) ? (d = () => c(e), p = !0) : Fe(e) ? (f = !0, p = e.some((b) => na(b) || Hn(b)), d = () => e.map((b) => {
if (Mt(b))
return b.value;
if (na(b))
return c(b);
if (ke(b))
return l ? l(b, 2) : b();
})) : ke(e) ? t ? d = l ? () => l(e, 2) : e : d = () => {
if (_) {
Dr();
try {
_();
} finally {
Mr();
}
}
const b = ho;
ho = u;
try {
return l ? l(e, 3, [m]) : e(m);
} finally {
ho = b;
}
} : d = Gn, t && o) {
const b = d, C = o === !0 ? 1 / 0 : o;
d = () => Or(b(), C);
}
const S = Fh(), g = () => {
u.stop(), S && S.active && xp(S.effects, u);
};
if (a && t) {
const b = t;
t = (...C) => {
b(...C), g();
};
}
let E = f ? new Array(e.length).fill(qi) : qi;
const h = (b) => {
if (!(!(u.flags & 1) || !u.dirty && !b))
if (t) {
const C = u.run();
if (o || p || (f ? C.some((R, T) => Zr(R, E[T])) : Zr(C, E))) {
_ && _();
const R = ho;
ho = u;
try {
const T = [
C,
// pass undefined as the old value when it's changed for the first time
E === qi ? void 0 : f && E[0] === qi ? [] : E,
m
];
l ? l(t, 3, T) : (
// @ts-expect-error
t(...T)
), E = C;
} finally {
ho = R;
}
}
} else
u.run();
};
return s && s(h), u = new Bh(d), u.scheduler = i ? () => i(h, !1) : h, m = (b) => BR(b, !1, u), _ = u.onStop = () => {
const b = bs.get(u);
if (b) {
if (l)
l(b, 4);
else
for (const C of b) C();
bs.delete(u);
}
}, t ? r ? h(!0) : E = u.run() : i ? i(h.bind(null, !0), !0) : u.run(), g.pause = u.pause.bind(u), g.resume = u.resume.bind(u), g.stop = g, g;
}
function Or(e, t = 1 / 0, n) {
if (t <= 0 || !St(e) || e.__v_skip || (n = n || /* @__PURE__ */ new Set(), n.has(e)))
return e;
if (n.add(e), t--, Mt(e))
Or(e.value, t, n);
else if (Fe(e))
for (let r = 0; r < e.length; r++)
Or(e[r], t, n);
else if (Ah(e) || ta(e))
e.forEach((r) => {
Or(r, t, n);
});
else if (xh(e)) {
for (const r in e)
Or(e[r], t, n);
for (const r of Object.getOwnPropertySymbols(e))
Object.prototype.propertyIsEnumerable.call(e, r) && Or(e[r], t, n);
}
return e;
}
var Yr = { NODE_ENV: "production" };
const Va = [];
let Al = !1;
function GR(e, ...t) {
if (Al) return;
Al = !0, Dr();
const n = Va.length ? Va[Va.length - 1].component : null, r = n && n.appContext.config.warnHandler, o = HR();
if (r)
ba(
r,
n,
11,
[
// eslint-disable-next-line no-restricted-syntax
e + t.map((a) => {
var i, s;
return (s = (i = a.toString) == null ? void 0 : i.call(a)) != null ? s : JSON.stringify(a);
}).join(""),
n && n.proxy,
o.map(
({ vnode: a }) => `at <${K0(n, a.type)}>`
).join(`
`),
o
]
);
else {
const a = [`[Vue warn]: ${e}`, ...t];
o.length && a.push(`
`, ...YR(o)), console.warn(...a);
}
Mr(), Al = !1;
}
function HR() {
let e = Va[Va.length - 1];
if (!e)
return [];
const t = [];
for (; e; ) {
const n = t[0];
n && n.vnode === e ? n.recurseCount++ : t.push({
vnode: e,
recurseCount: 0
});
const r = e.component && e.component.parent;
e = r && r.vnode;
}
return t;
}
function YR(e) {
const t = [];
return e.forEach((n, r) => {
t.push(...r === 0 ? [] : [`
`], ...zR(n));
}), t;
}
function zR({ vnode: e, recurseCount: t }) {
const n = t > 0 ? `... (${t} recursive calls)` : "", r = e.component ? e.component.parent == null : !1, o = ` at <${K0(
e.component,
e.type,
r
)}`, a = ">" + n;
return e.props ? [o, ...$R(e.props), a] : [o + a];
}
function $R(e) {
const t = [], n = Object.keys(e);
return n.slice(0, 3).forEach((r) => {
t.push(...n0(r, e[r]));
}), n.length > 3 && t.push(" ..."), t;
}
function n0(e, t, n) {
return It(t) ? (t = JSON.stringify(t), n ? t : [`${e}=${t}`]) : typeof t == "number" || typeof t == "boolean" || t == null ? n ? t : [`${e}=${t}`] : Mt(t) ? (t = n0(e, Ke(t.value), !0), n ? t : [`${e}=Ref<`, t, ">"]) : ke(t) ? [`${e}=fn${t.name ? `<${t.name}>` : ""}`] : (t = Ke(t), n ? t : [`${e}=`, t]);
}
function ba(e, t, n, r) {
try {
return r ? e(...r) : e();
} catch (o) {
el(o, t, n);
}
}
function er(e, t, n, r) {
if (ke(e)) {
const o = ba(e, t, n, r);
return o && Nh(o) && o.catch((a) => {
el(a, t, n);
}), o;
}
if (Fe(e)) {
const o = [];
for (let a = 0; a < e.length; a++)
o.push(er(e[a], t, n, r));
return o;
}
}
function el(e, t, n, r = !0) {
const o = t ? t.vnode : null, { errorHandler: a, throwUnhandledErrorInProduction: i } = t && t.appContext.config || mt;
if (t) {
let s = t.parent;
const l = t.proxy, c = `https://vuejs.org/error-reference/#runtime-${n}`;
for (; s; ) {
const u = s.ec;
if (u) {
for (let d = 0; d < u.length; d++)
if (u[d](e, l, c) === !1)
return;
}
s = s.parent;
}
if (a) {
Dr(), ba(a, null, 10, [
e,
l,
c
]), Mr();
return;
}
}
qR(e, n, o, r, i);
}
function qR(e, t, n, r = !0, o = !1) {
if (o)
throw e;
console.error(e);
}
const mn = [];
let sr = -1;
const oa = [];
let zr = null, Xo = 0;
const r0 = /* @__PURE__ */ Promise.resolve();
let hs = null;
function dr(e) {
const t = hs || r0;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function VR(e) {
let t = sr + 1, n = mn.length;
for (; t < n; ) {
const r = t + n >>> 1, o = mn[r], a = ti(o);
a < e || a === e && o.flags & 2 ? t = r + 1 : n = r;
}
return t;
}
function Fp(e) {
if (!(e.flags & 1)) {
const t = ti(e), n = mn[mn.length - 1];
!n || // fast path when the job id is larger than the tail
!(e.flags & 2) && t >= ti(n) ? mn.push(e) : mn.splice(VR(t), 0, e), e.flags |= 1, o0();
}
}
function o0() {
hs || (hs = r0.then(s0));
}
function a0(e) {
Fe(e) ? oa.push(...e) : zr && e.id === -1 ? zr.splice(Xo + 1, 0, e) : e.flags & 1 || (oa.push(e), e.flags |= 1), o0();
}
function Om(e, t, n = sr + 1) {
for (; n < mn.length; n++) {
const r = mn[n];
if (r && r.flags & 2) {
if (e && r.id !== e.uid)
continue;
mn.splice(n, 1), n--, r.flags & 4 && (r.flags &= -2), r(), r.flags & 4 || (r.flags &= -2);
}
}
}
function i0(e) {
if (oa.length) {
const t = [...new Set(oa)].sort(
(n, r) => ti(n) - ti(r)
);
if (oa.length = 0, zr) {
zr.push(...t);
return;
}
for (zr = t, Xo = 0; Xo < zr.length; Xo++) {
const n = zr[Xo];
n.flags & 4 && (n.flags &= -2), n.flags & 8 || n(), n.flags &= -2;
}
zr = null, Xo = 0;
}
}
const ti = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
function s0(e) {
const t = Gn;
try {
for (sr = 0; sr < mn.length; sr++) {
const n = mn[sr];
n && !(n.flags & 8) && (Yr.NODE_ENV !== "production" && t(n), n.flags & 4 && (n.flags &= -2), ba(
n,
n.i,
n.i ? 15 : 14
), n.flags & 4 || (n.flags &= -2));
}
} finally {
for (; sr < mn.length; sr++) {
const n = mn[sr];
n && (n.flags &= -2);
}
sr = -1, mn.length = 0, i0(), hs = null, (mn.length || oa.length) && s0();
}
}
let Qt = null, l0 = null;
function Ts(e) {
const t = Qt;
return Qt = e, l0 = e && e.type.__scopeId || null, t;
}
function Rn(e, t = Qt, n) {
if (!t || e._n)
return e;
const r = (...o) => {
r._d && Um(-1);
const a = Ts(t);
let i;
try {
i = e(...o);
} finally {
Ts(a), r._d && Um(1);
}
return i;
};
return r._n = !0, r._c = !0, r._d = !0, r;
}
function tl(e, t) {
if (Qt === null)
return e;
const n = ll(Qt), r = e.dirs || (e.dirs = []);
for (let o = 0; o < t.length; o++) {
let [a, i, s, l = mt] = t[o];
a && (ke(a) && (a = {
mounted: a,
updated: a
}), a.deep && Or(i), r.push({
dir: a,
instance: n,
value: i,
oldValue: void 0,
arg: s,
modifiers: l
}));
}
return e;
}
function go(e, t, n, r) {
const o = e.dirs, a = t && t.dirs;
for (let i = 0; i < o.length; i++) {
const s = o[i];
a && (s.oldValue = a[i].value);
let l = s.dir[r];
l && (Dr(), er(l, n, 8, [
e.el,
s,
e,
t
]), Mr());
}
}
const c0 = Symbol("_vte"), u0 = (e) => e.__isTeleport, Wa = (e) => e && (e.disabled || e.disabled === ""), Am = (e) => e && (e.defer || e.defer === ""), Nm = (e) => typeof SVGElement != "undefined" && e instanceof SVGElement, Im = (e) => typeof MathMLElement == "function" && e instanceof MathMLElement, W_ = (e, t) => {
const n = e && e.to;
return It(n) ? t ? t(n) : null : n;
}, d0 = {
name: "Teleport",
__isTeleport: !0,
process(e, t, n, r, o, a, i, s, l, c) {
const {
mc: u,
pc: d,
pbc: _,
o: { insert: m, querySelector: p, createText: f, createComment: S }
} = c, g = Wa(t.props);
let { shapeFlag: E, children: h, dynamicChildren: b } = t;
if (e == null) {
const C = t.el = f(""), R = t.anchor = f("");
m(C, n, r), m(R, n, r);
const T = (I, w) => {
E & 16 && (o && o.isCE && (o.ce._teleportTarget = I), u(
h,
I,
w,
o,
a,
i,
s,
l
));
}, O = () => {
const I = t.target = W_(t.props, p), w = p0(I, t, f, m);
I && (i !== "svg" && Nm(I) ? i = "svg" : i !== "mathml" && Im(I) && (i = "mathml"), g || (T(I, w), cs(t, !1)));
};
g && (T(n, R), cs(t, !0)), Am(t.props) ? _n(() => {
O(), t.el.__isMounted = !0;
}, a) : O();
} else {
if (Am(t.props) && !e.el.__isMounted) {
_n(() => {
d0.process(
e,
t,
n,
r,
o,
a,
i,
s,
l,
c
), delete e.el.__isMounted;
}, a);
return;
}
t.el = e.el, t.targetStart = e.targetStart;
const C = t.anchor = e.anchor, R = t.target = e.target, T = t.targetAnchor = e.targetAnchor, O = Wa(e.props), I = O ? n : R, w = O ? C : T;
if (i === "svg" || Nm(R) ? i = "svg" : (i === "mathml" || Im(R)) && (i = "mathml"), b ? (_(
e.dynamicChildren,
b,
I,
o,
a,
i,
s
), Hp(e, t, !0)) : l || d(
e,
t,
I,
w,
o,
a,
i,
s,
!1
), g)
O ? t.props && e.props && t.props.to !== e.props.to && (t.props.to = e.props.to) : Vi(
t,
n,
C,
c,
1
);
else if ((t.props && t.props.to) !== (e.props && e.props.to)) {
const F = t.target = W_(
t.props,
p
);
F && Vi(
t,
F,
null,
c,
0
);
} else O && Vi(
t,
R,
T,
c,
1
);
cs(t, g);
}
},
remove(e, t, n, { um: r, o: { remove: o } }, a) {
const {
shapeFlag: i,
children: s,
anchor: l,
targetStart: c,
targetAnchor: u,
target: d,
props: _
} = e;
if (d && (o(c), o(u)), a && o(l), i & 16) {
const m = a || !Wa(_);
for (let p = 0; p < s.length; p++) {
const f = s[p];
r(
f,
t,
n,
m,
!!f.dynamicChildren
);
}
}
},
move: Vi,
hydrate: WR
};
function Vi(e, t, n, { o: { insert: r }, m: o }, a = 2) {
a === 0 && r(e.targetAnchor, t, n);
const { el: i, anchor: s, shapeFlag: l, children: c, props: u } = e, d = a === 2;
if (d && r(i, t, n), (!d || Wa(u)) && l & 16)
for (let _ = 0; _ < c.length; _++)
o(
c[_],
t,
n,
2
);
d && r(s, t, n);
}
function WR(e, t, n, r, o, a, {
o: { nextSibling: i, parentNode: s, querySelector: l, insert: c, createText: u }
}, d) {
const _ = t.target = W_(
t.props,
l
);
if (_) {
const m = Wa(t.props), p = _._lpa || _.firstChild;
if (t.shapeFlag & 16)
if (m)
t.anchor = d(
i(e),
t,
s(e),
n,
r,
o,
a
), t.targetStart = p, t.targetAnchor = p && i(p);
else {
t.anchor = i(e);
let f = p;
for (; f; ) {
if (f && f.nodeType === 8) {
if (f.data === "teleport start anchor")
t.targetStart = f;
else if (f.data === "teleport anchor") {
t.targetAnchor = f, _._lpa = t.targetAnchor && i(t.targetAnchor);
break;
}
}
f = i(f);
}
t.targetAnchor || p0(_, t, u, c), d(
p && i(p),
t,
_,
n,
r,
o,
a
);
}
cs(t, m);
}
return t.anchor && i(t.anchor);
}
const _0 = d0;
function cs(e, t) {
const n = e.ctx;
if (n && n.ut) {
let r, o;
for (t ? (r = e.el, o = e.anchor) : (r = e.targetStart, o = e.targetAnchor); r && r !== o; )
r.nodeType === 1 && r.setAttribute("data-v-owner", n.uid), r = r.nextSibling;
n.ut();
}
}
function p0(e, t, n, r) {
const o = t.targetStart = n(""), a = t.targetAnchor = n("");
return o[c0] = a, e && (r(o, e), r(a, e)), a;
}
const $r = Symbol("_leaveCb"), Wi = Symbol("_enterCb");
function m0() {
const e = {
isMounted: !1,
isLeaving: !1,
isUnmounting: !1,
leavingVNodes: /* @__PURE__ */ new Map()
};
return sn(() => {
e.isMounted = !0;
}), Nn(() => {
e.isUnmounting = !0;
}), e;
}
const kn = [Function, Array], f0 = {
mode: String,
appear: Boolean,
persisted: Boolean,
// enter
onBeforeEnter: kn,
onEnter: kn,
onAfterEnter: kn,
onEnterCancelled: kn,
// leave
onBeforeLeave: kn,
onLeave: kn,
onAfterLeave: kn,
onLeaveCancelled: kn,
// appear
onBeforeAppear: kn,
onAppear: kn,
onAfterAppear: kn,
onAppearCancelled: kn
}, g0 = (e) => {
const t = e.subTree;
return t.component ? g0(t.component) : t;
}, KR = {
name: "BaseTransition",
props: f0,
setup(e, { slots: t }) {
const n = In(), r = m0();
return () => {
const o = t.default && Bp(t.default(), !0);
if (!o || !o.length)
return;
const a = E0(o), i = Ke(e), { mode: s } = i;
if (r.isLeaving)
return Nl(a);
const l = xm(a);
if (!l)
return Nl(a);
let c = ni(
l,
i,
r,
n,
// #11061, ensure enterHooks is fresh after clone
(d) => c = d
);
l.type !== $t && xo(l, c);
let u = n.subTree && xm(n.subTree);
if (u && u.type !== $t && !To(l, u) && g0(n).type !== $t) {
let d = ni(
u,
i,
r,
n
);
if (xo(u, d), s === "out-in" && l.type !== $t)
return r.isLeaving = !0, d.afterLeave = () => {
r.isLeaving = !1, n.job.flags & 8 || n.update(), delete d.afterLeave, u = void 0;
}, Nl(a);
s === "in-out" && l.type !== $t ? d.delayLeave = (_, m, p) => {
const f = S0(
r,
u
);
f[String(u.key)] = u, _[$r] = () => {
m(), _[$r] = void 0, delete c.delayedLeave, u = void 0;
}, c.delayedLeave = () => {
p(), delete c.delayedLeave, u = void 0;
};
} : u = void 0;
} else u && (u = void 0);
return a;
};
}
};
function E0(e) {
let t = e[0];
if (e.length > 1) {
for (const n of e)
if (n.type !== $t) {
t = n;
break;
}
}
return t;
}
const QR = KR;
function S0(e, t) {
const { leavingVNodes: n } = e;
let r = n.get(t.type);
return r || (r = /* @__PURE__ */ Object.create(null), n.set(t.type, r)), r;
}
function ni(e, t, n, r, o) {
const {
appear: a,
mode: i,
persisted: s = !1,
onBeforeEnter: l,
onEnter: c,
onAfterEnter: u,
onEnterCancelled: d,
onBeforeLeave: _,
onLeave: m,
onAfterLeave: p,
onLeaveCancelled: f,
onBeforeAppear: S,
onAppear: g,
onAfterAppear: E,
onAppearCancelled: h
} = t, b = String(e.key), C = S0(n, e), R = (I, w) => {
I && er(
I,
r,
9,
w
);
}, T = (I, w) => {
const F = w[1];
R(I, w), Fe(I) ? I.every((P) => P.length <= 1) && F() : I.length <= 1 && F();
}, O = {
mode: i,
persisted: s,
beforeEnter(I) {
let w = l;
if (!n.isMounted)
if (a)
w = S || l;
else
return;
I[$r] && I[$r](
!0
/* cancelled */
);
const F = C[b];
F && To(e, F) && F.el[$r] && F.el[$r](), R(w, [I]);
},
enter(I) {
let w = c, F = u, P = d;
if (!n.isMounted)
if (a)
w = g || c, F = E || u, P = h || d;
else
return;
let V = !1;
const j = I[Wi] = (U) => {
V || (V = !0, U ? R(P, [I]) : R(F, [I]), O.delayedLeave && O.delayedLeave(), I[Wi] = void 0);
};
w ? T(w, [I, j]) : j();
},
leave(I, w) {
const F = String(e.key);
if (I[Wi] && I[Wi](
!0
/* cancelled */
), n.isUnmounting)
return w();
R(_, [I]);
let P = !1;
const V = I[$r] = (j) => {
P || (P = !0, w(), j ? R(f, [I]) : R(p, [I]), I[$r] = void 0, C[F] === e && delete C[F]);
};
C[F] = e, m ? T(m, [I, V]) : V();
},
clone(I) {
const w = ni(
I,
t,
n,
r,
o
);
return o && o(w), w;
}
};
return O;
}
function Nl(e) {
if (nl(e))
return e = Ar(e), e.children = null, e;
}
function xm(e) {
if (!nl(e))
return u0(e.type) && e.children ? E0(e.children) : e;
const { shapeFlag: t, children: n } = e;
if (n) {
if (t & 16)
return n[0];
if (t & 32 && ke(n.default))
return n.default();
}
}
function xo(e, t) {
e.shapeFlag & 6 && e.component ? (e.transition = t, xo(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 Bp(e, t = !1, n) {
let r = [], o = 0;
for (let a = 0; a < e.length; a++) {
let i = e[a];
const s = n == null ? i.key : String(n) + String(i.key != null ? i.key : a);
i.type === ft ? (i.patchFlag & 128 && o++, r = r.concat(
Bp(i.children, t, s)
)) : (t || i.type !== $t) && r.push(s != null ? Ar(i, { key: s }) : i);
}
if (o > 1)
for (let a = 0; a < r.length; a++)
r[a].patchFlag = -2;
return r;
}
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function tt(e, t) {
return ke(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.
Ht({ name: e.name }, t, { setup: e })
) : e;
}
function b0(e) {
e.ids = [e.ids[0] + e.ids[2]++ + "-", 0, 0];
}
function Cs(e, t, n, r, o = !1) {
if (Fe(e)) {
e.forEach(
(p, f) => Cs(
p,
t && (Fe(t) ? t[f] : t),
n,
r,
o
)
);
return;
}
if (aa(r) && !o) {
r.shapeFlag & 512 && r.type.__asyncResolved && r.component.subTree.component && Cs(e, t, n, r.component.subTree);
return;
}
const a = r.shapeFlag & 4 ? ll(r.component) : r.el, i = o ? null : a, { i: s, r: l } = e, c = t && t.r, u = s.refs === mt ? s.refs = {} : s.refs, d = s.setupState, _ = Ke(d), m = d === mt ? () => !1 : (p) => it(_, p);
if (c != null && c !== l && (It(c) ? (u[c] = null, m(c) && (d[c] = null)) : Mt(c) && (c.value = null)), ke(l))
ba(l, s, 12, [i, u]);
else {
const p = It(l), f = Mt(l);
if (p || f) {
const S = () => {
if (e.f) {
const g = p ? m(l) ? d[l] : u[l] : l.value;
o ? Fe(g) && xp(g, a) : Fe(g) ? g.includes(a) || g.push(a) : p ? (u[l] = [a], m(l) && (d[l] = u[l])) : (l.value = [a], e.k && (u[e.k] = l.value));
} else p ? (u[l] = i, m(l) && (d[l] = i)) : f && (l.value = i, e.k && (u[e.k] = i));
};
i ? (S.id = -1, _n(S, n)) : S();
}
}
}
Qs().requestIdleCallback;
Qs().cancelIdleCallback;
const aa = (e) => !!e.type.__asyncLoader, nl = (e) => e.type.__isKeepAlive;
function h0(e, t) {
C0(e, "a", t);
}
function T0(e, t) {
C0(e, "da", t);
}
function C0(e, t, n = qt) {
const r = e.__wdc || (e.__wdc = () => {
let o = n;
for (; o; ) {
if (o.isDeactivated)
return;
o = o.parent;
}
return e();
});
if (rl(t, r, n), n) {
let o = n.parent;
for (; o && o.parent; )
nl(o.parent.vnode) && XR(r, t, n, o), o = o.parent;
}
}
function XR(e, t, n, r) {
const o = rl(
t,
e,
r,
!0
/* prepend */
);
al(() => {
xp(r[t], o);
}, n);
}
function rl(e, t, n = qt, r = !1) {
if (n) {
const o = n[e] || (n[e] = []), a = t.__weh || (t.__weh = (...i) => {
Dr();
const s = Ci(n), l = er(t, n, e, i);
return s(), Mr(), l;
});
return r ? o.unshift(a) : o.push(a), a;
}
}
const wr = (e) => (t, n = qt) => {
(!oi || e === "sp") && rl(e, (...r) => t(...r), n);
}, ol = wr("bm"), sn = wr("m"), v0 = wr(
"bu"
), R0 = wr("u"), Nn = wr(
"bum"
), al = wr("um"), ZR = wr(
"sp"
), jR = wr("rtg"), JR = wr("rtc");
function ey(e, t = qt) {
rl("ec", e, t);
}
const ty = Symbol.for("v-ndc");
function Up(e, t, n, r) {
let o;
const a = n, i = Fe(e);
if (i || It(e)) {
const s = i && na(e);
let l = !1;
s && (l = !Hn(e), e = Zs(e)), o = new Array(e.length);
for (let c = 0, u = e.length; c < u; c++)
o[c] = t(
l ? nn(e[c]) : e[c],
c,
void 0,
a
);
} else if (typeof e == "number") {
o = new Array(e);
for (let s = 0; s < e; s++)
o[s] = t(s + 1, s, void 0, a);
} else if (St(e))
if (e[Symbol.iterator])
o = Array.from(
e,
(s, l) => t(s, l, void 0, a)
);
else {
const s = Object.keys(e);
o = new Array(s.length);
for (let l = 0, c = s.length; l < c; l++)