imooc-element-components-hql
Version:
1,801 lines (1,800 loc) • 401 kB
JavaScript
/**
* @vue/shared v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function X2(e) {
const t = /* @__PURE__ */ Object.create(null);
for (const r of e.split(",")) t[r] = 1;
return (r) => r in t;
}
const ee = process.env.NODE_ENV !== "production" ? Object.freeze({}) : {}, K2 = process.env.NODE_ENV !== "production" ? Object.freeze([]) : [], ve = () => {
}, Zn = () => !1, Ht = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), Yt = (e) => e.startsWith("onUpdate:"), ce = Object.assign, sr = (e, t) => {
const r = e.indexOf(t);
r > -1 && e.splice(r, 1);
}, Yn = Object.prototype.hasOwnProperty, W = (e, t) => Yn.call(e, t), B = Array.isArray, O2 = (e) => _0(e) === "[object Map]", Z1 = (e) => _0(e) === "[object Set]", T = (e) => typeof e == "function", re = (e) => typeof e == "string", i2 = (e) => typeof e == "symbol", Z = (e) => e !== null && typeof e == "object", lr = (e) => (Z(e) || T(e)) && T(e.then) && T(e.catch), Y1 = Object.prototype.toString, _0 = (e) => Y1.call(e), ir = (e) => _0(e).slice(8, -1), Q1 = (e) => _0(e) === "[object Object]", ur = (e) => re(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, vt = /* @__PURE__ */ X2(
// the leading comma is intentional so empty string "" is also included
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), Qn = /* @__PURE__ */ X2(
"bind,cloak,else-if,else,for,html,if,model,on,once,pre,show,slot,text,memo"
), p0 = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return (r) => t[r] || (t[r] = e(r));
}, Xn = /-(\w)/g, He = p0(
(e) => e.replace(Xn, (t, r) => r ? r.toUpperCase() : "")
), ea = /\B([A-Z])/g, x2 = p0(
(e) => e.replace(ea, "-$1").toLowerCase()
), T2 = p0((e) => e.charAt(0).toUpperCase() + e.slice(1)), E2 = p0(
(e) => e ? `on${T2(e)}` : ""
), g2 = (e, t) => !Object.is(e, t), lt = (e, ...t) => {
for (let r = 0; r < e.length; r++)
e[r](...t);
}, Qt = (e, t, r, n = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: n,
value: r
});
}, ta = (e) => {
const t = parseFloat(e);
return isNaN(t) ? e : t;
}, ra = (e) => {
const t = re(e) ? Number(e) : NaN;
return isNaN(t) ? e : t;
};
let kr;
const Nt = () => kr || (kr = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
function Ot(e) {
if (B(e)) {
const t = {};
for (let r = 0; r < e.length; r++) {
const n = e[r], a = re(n) ? sa(n) : Ot(n);
if (a)
for (const o in a)
t[o] = a[o];
}
return t;
} else if (re(e) || Z(e))
return e;
}
const na = /;(?![^(]*\))/g, aa = /:([^]+)/, oa = /\/\*[^]*?\*\//g;
function sa(e) {
const t = {};
return e.replace(oa, "").split(na).forEach((r) => {
if (r) {
const n = r.split(aa);
n.length > 1 && (t[n[0].trim()] = n[1].trim());
}
}), t;
}
function Te(e) {
let t = "";
if (re(e))
t = e;
else if (B(e))
for (let r = 0; r < e.length; r++) {
const n = Te(e[r]);
n && (t += n + " ");
}
else if (Z(e))
for (const r in e)
e[r] && (t += r + " ");
return t.trim();
}
const la = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", ia = /* @__PURE__ */ X2(la);
function X1(e) {
return !!e || e === "";
}
const e4 = (e) => !!(e && e.__v_isRef === !0), f0 = (e) => re(e) ? e : e == null ? "" : B(e) || Z(e) && (e.toString === Y1 || !T(e.toString)) ? e4(e) ? f0(e.value) : JSON.stringify(e, t4, 2) : String(e), t4 = (e, t) => e4(t) ? t4(e, t.value) : O2(t) ? {
[`Map(${t.size})`]: [...t.entries()].reduce(
(r, [n, a], o) => (r[O0(n, o) + " =>"] = a, r),
{}
)
} : Z1(t) ? {
[`Set(${t.size})`]: [...t.values()].map((r) => O0(r))
} : i2(t) ? O0(t) : Z(t) && !B(t) && !Q1(t) ? String(t) : t, O0 = (e, t = "") => {
var r;
return (
// Symbol.description in es2019+ so we need to cast here to pass
// the lib: es2016 check
i2(e) ? `Symbol(${(r = e.description) != null ? r : t})` : e
);
};
/**
* @vue/reactivity v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
function ke(e, ...t) {
console.warn(`[Vue warn] ${e}`, ...t);
}
let ze;
class ua {
constructor(t = !1) {
this.detached = t, this._active = !0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = ze, !t && ze && (this.index = (ze.scopes || (ze.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 = ze;
try {
return ze = this, t();
} finally {
ze = r;
}
} else process.env.NODE_ENV !== "production" && ke("cannot run an inactive effect scope.");
}
/**
* This should only be called on non-detached scopes
* @internal
*/
on() {
ze = this;
}
/**
* This should only be called on non-detached scopes
* @internal
*/
off() {
ze = this.parent;
}
stop(t) {
if (this._active) {
this._active = !1;
let r, n;
for (r = 0, n = this.effects.length; r < n; r++)
this.effects[r].stop();
for (this.effects.length = 0, r = 0, n = this.cleanups.length; r < n; r++)
this.cleanups[r]();
if (this.cleanups.length = 0, this.scopes) {
for (r = 0, n = this.scopes.length; r < n; r++)
this.scopes[r].stop(!0);
this.scopes.length = 0;
}
if (!this.detached && this.parent && !t) {
const a = this.parent.scopes.pop();
a && a !== this && (this.parent.scopes[this.index] = a, a.index = this.index);
}
this.parent = void 0;
}
}
}
function r4() {
return ze;
}
function ca(e, t = !1) {
ze ? ze.cleanups.push(e) : process.env.NODE_ENV !== "production" && !t && ke(
"onScopeDispose() is called when there is no active effect scope to be associated with."
);
}
let X;
const S0 = /* @__PURE__ */ new WeakSet();
class n4 {
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, ze && ze.active && ze.effects.push(this);
}
pause() {
this.flags |= 64;
}
resume() {
this.flags & 64 && (this.flags &= -65, S0.has(this) && (S0.delete(this), this.trigger()));
}
/**
* @internal
*/
notify() {
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || o4(this);
}
run() {
if (!(this.flags & 1))
return this.fn();
this.flags |= 2, Rr(this), s4(this);
const t = X, r = Ie;
X = this, Ie = !0;
try {
return this.fn();
} finally {
process.env.NODE_ENV !== "production" && X !== this && ke(
"Active effect was not restored correctly - this is likely a Vue internal bug."
), l4(this), X = t, Ie = r, this.flags &= -3;
}
}
stop() {
if (this.flags & 1) {
for (let t = this.deps; t; t = t.nextDep)
pr(t);
this.deps = this.depsTail = void 0, Rr(this), this.onStop && this.onStop(), this.flags &= -2;
}
}
trigger() {
this.flags & 64 ? S0.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
}
/**
* @internal
*/
runIfDirty() {
j0(this) && this.run();
}
get dirty() {
return j0(this);
}
}
let a4 = 0, ht, mt;
function o4(e, t = !1) {
if (e.flags |= 8, t) {
e.next = mt, mt = e;
return;
}
e.next = ht, ht = e;
}
function cr() {
a4++;
}
function _r() {
if (--a4 > 0)
return;
if (mt) {
let t = mt;
for (mt = void 0; t; ) {
const r = t.next;
t.next = void 0, t.flags &= -9, t = r;
}
}
let e;
for (; ht; ) {
let t = ht;
for (ht = void 0; t; ) {
const r = t.next;
if (t.next = void 0, t.flags &= -9, t.flags & 1)
try {
t.trigger();
} catch (n) {
e || (e = n);
}
t = r;
}
}
if (e) throw e;
}
function s4(e) {
for (let t = e.deps; t; t = t.nextDep)
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
}
function l4(e) {
let t, r = e.depsTail, n = r;
for (; n; ) {
const a = n.prevDep;
n.version === -1 ? (n === r && (r = a), pr(n), _a(n)) : t = n, n.dep.activeLink = n.prevActiveLink, n.prevActiveLink = void 0, n = a;
}
e.deps = t, e.depsTail = r;
}
function j0(e) {
for (let t = e.deps; t; t = t.nextDep)
if (t.dep.version !== t.version || t.dep.computed && (i4(t.dep.computed) || t.dep.version !== t.version))
return !0;
return !!e._dirty;
}
function i4(e) {
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === wt))
return;
e.globalVersion = wt;
const t = e.dep;
if (e.flags |= 2, t.version > 0 && !e.isSSR && e.deps && !j0(e)) {
e.flags &= -3;
return;
}
const r = X, n = Ie;
X = e, Ie = !0;
try {
s4(e);
const a = e.fn(e._value);
(t.version === 0 || g2(a, e._value)) && (e._value = a, t.version++);
} catch (a) {
throw t.version++, a;
} finally {
X = r, Ie = n, l4(e), e.flags &= -3;
}
}
function pr(e, t = !1) {
const { dep: r, prevSub: n, nextSub: a } = e;
if (n && (n.nextSub = a, e.prevSub = void 0), a && (a.prevSub = n, e.nextSub = void 0), process.env.NODE_ENV !== "production" && r.subsHead === e && (r.subsHead = a), r.subs === e && (r.subs = n, !n && r.computed)) {
r.computed.flags &= -5;
for (let o = r.computed.deps; o; o = o.nextDep)
pr(o, !0);
}
!t && !--r.sc && r.map && r.map.delete(r.key);
}
function _a(e) {
const { prevDep: t, nextDep: r } = e;
t && (t.nextDep = r, e.prevDep = void 0), r && (r.prevDep = t, e.nextDep = void 0);
}
let Ie = !0;
const u4 = [];
function u2() {
u4.push(Ie), Ie = !1;
}
function c2() {
const e = u4.pop();
Ie = e === void 0 ? !0 : e;
}
function Rr(e) {
const { cleanup: t } = e;
if (e.cleanup = void 0, t) {
const r = X;
X = void 0;
try {
t();
} finally {
X = r;
}
}
}
let wt = 0;
class pa {
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 fr {
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, process.env.NODE_ENV !== "production" && (this.subsHead = void 0);
}
track(t) {
if (!X || !Ie || X === this.computed)
return;
let r = this.activeLink;
if (r === void 0 || r.sub !== X)
r = this.activeLink = new pa(X, this), X.deps ? (r.prevDep = X.depsTail, X.depsTail.nextDep = r, X.depsTail = r) : X.deps = X.depsTail = r, c4(r);
else if (r.version === -1 && (r.version = this.version, r.nextDep)) {
const n = r.nextDep;
n.prevDep = r.prevDep, r.prevDep && (r.prevDep.nextDep = n), r.prevDep = X.depsTail, r.nextDep = void 0, X.depsTail.nextDep = r, X.depsTail = r, X.deps === r && (X.deps = n);
}
return process.env.NODE_ENV !== "production" && X.onTrack && X.onTrack(
ce(
{
effect: X
},
t
)
), r;
}
trigger(t) {
this.version++, wt++, this.notify(t);
}
notify(t) {
cr();
try {
if (process.env.NODE_ENV !== "production")
for (let r = this.subsHead; r; r = r.nextSub)
r.sub.onTrigger && !(r.sub.flags & 8) && r.sub.onTrigger(
ce(
{
effect: r.sub
},
t
)
);
for (let r = this.subs; r; r = r.prevSub)
r.sub.notify() && r.sub.dep.notify();
} finally {
_r();
}
}
}
function c4(e) {
if (e.dep.sc++, e.sub.flags & 4) {
const t = e.dep.computed;
if (t && !e.dep.subs) {
t.flags |= 20;
for (let n = t.deps; n; n = n.nextDep)
c4(n);
}
const r = e.dep.subs;
r !== e && (e.prevSub = r, r && (r.nextSub = e)), process.env.NODE_ENV !== "production" && e.dep.subsHead === void 0 && (e.dep.subsHead = e), e.dep.subs = e;
}
}
const q0 = /* @__PURE__ */ new WeakMap(), S2 = Symbol(
process.env.NODE_ENV !== "production" ? "Object iterate" : ""
), U0 = Symbol(
process.env.NODE_ENV !== "production" ? "Map keys iterate" : ""
), xt = Symbol(
process.env.NODE_ENV !== "production" ? "Array iterate" : ""
);
function de(e, t, r) {
if (Ie && X) {
let n = q0.get(e);
n || q0.set(e, n = /* @__PURE__ */ new Map());
let a = n.get(r);
a || (n.set(r, a = new fr()), a.map = n, a.key = r), process.env.NODE_ENV !== "production" ? a.track({
target: e,
type: t,
key: r
}) : a.track();
}
}
function Ze(e, t, r, n, a, o) {
const l = q0.get(e);
if (!l) {
wt++;
return;
}
const i = (p) => {
p && (process.env.NODE_ENV !== "production" ? p.trigger({
target: e,
type: t,
key: r,
newValue: n,
oldValue: a,
oldTarget: o
}) : p.trigger());
};
if (cr(), t === "clear")
l.forEach(i);
else {
const p = B(e), m = p && ur(r);
if (p && r === "length") {
const v = Number(n);
l.forEach((d, g) => {
(g === "length" || g === xt || !i2(g) && g >= v) && i(d);
});
} else
switch ((r !== void 0 || l.has(void 0)) && i(l.get(r)), m && i(l.get(xt)), t) {
case "add":
p ? m && i(l.get("length")) : (i(l.get(S2)), O2(e) && i(l.get(U0)));
break;
case "delete":
p || (i(l.get(S2)), O2(e) && i(l.get(U0)));
break;
case "set":
O2(e) && i(l.get(S2));
break;
}
}
_r();
}
function R2(e) {
const t = j(e);
return t === e ? t : (de(t, "iterate", xt), Ne(e) ? t : t.map(ye));
}
function d0(e) {
return de(e = j(e), "iterate", xt), e;
}
const fa = {
__proto__: null,
[Symbol.iterator]() {
return A0(this, Symbol.iterator, ye);
},
concat(...e) {
return R2(this).concat(
...e.map((t) => B(t) ? R2(t) : t)
);
},
entries() {
return A0(this, "entries", (e) => (e[1] = ye(e[1]), e));
},
every(e, t) {
return t2(this, "every", e, t, void 0, arguments);
},
filter(e, t) {
return t2(this, "filter", e, t, (r) => r.map(ye), arguments);
},
find(e, t) {
return t2(this, "find", e, t, ye, arguments);
},
findIndex(e, t) {
return t2(this, "findIndex", e, t, void 0, arguments);
},
findLast(e, t) {
return t2(this, "findLast", e, t, ye, arguments);
},
findLastIndex(e, t) {
return t2(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 t2(this, "forEach", e, t, void 0, arguments);
},
includes(...e) {
return L0(this, "includes", e);
},
indexOf(...e) {
return L0(this, "indexOf", e);
},
join(e) {
return R2(this).join(e);
},
// keys() iterator only reads `length`, no optimisation required
lastIndexOf(...e) {
return L0(this, "lastIndexOf", e);
},
map(e, t) {
return t2(this, "map", e, t, void 0, arguments);
},
pop() {
return it(this, "pop");
},
push(...e) {
return it(this, "push", e);
},
reduce(e, ...t) {
return jr(this, "reduce", e, t);
},
reduceRight(e, ...t) {
return jr(this, "reduceRight", e, t);
},
shift() {
return it(this, "shift");
},
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
some(e, t) {
return t2(this, "some", e, t, void 0, arguments);
},
splice(...e) {
return it(this, "splice", e);
},
toReversed() {
return R2(this).toReversed();
},
toSorted(e) {
return R2(this).toSorted(e);
},
toSpliced(...e) {
return R2(this).toSpliced(...e);
},
unshift(...e) {
return it(this, "unshift", e);
},
values() {
return A0(this, "values", ye);
}
};
function A0(e, t, r) {
const n = d0(e), a = n[t]();
return n !== e && !Ne(e) && (a._next = a.next, a.next = () => {
const o = a._next();
return o.value && (o.value = r(o.value)), o;
}), a;
}
const da = Array.prototype;
function t2(e, t, r, n, a, o) {
const l = d0(e), i = l !== e && !Ne(e), p = l[t];
if (p !== da[t]) {
const d = p.apply(e, o);
return i ? ye(d) : d;
}
let m = r;
l !== e && (i ? m = function(d, g) {
return r.call(this, ye(d), g, e);
} : r.length > 2 && (m = function(d, g) {
return r.call(this, d, g, e);
}));
const v = p.call(l, m, n);
return i && a ? a(v) : v;
}
function jr(e, t, r, n) {
const a = d0(e);
let o = r;
return a !== e && (Ne(e) ? r.length > 3 && (o = function(l, i, p) {
return r.call(this, l, i, p, e);
}) : o = function(l, i, p) {
return r.call(this, l, ye(i), p, e);
}), a[t](o, ...n);
}
function L0(e, t, r) {
const n = j(e);
de(n, "iterate", xt);
const a = n[t](...r);
return (a === -1 || a === !1) && Xt(r[0]) ? (r[0] = j(r[0]), n[t](...r)) : a;
}
function it(e, t, r = []) {
u2(), cr();
const n = j(e)[t].apply(e, r);
return _r(), c2(), n;
}
const va = /* @__PURE__ */ X2("__proto__,__v_isRef,__isVue"), _4 = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(i2)
);
function ha(e) {
i2(e) || (e = String(e));
const t = j(this);
return de(t, "has", e), t.hasOwnProperty(e);
}
class p4 {
constructor(t = !1, r = !1) {
this._isReadonly = t, this._isShallow = r;
}
get(t, r, n) {
if (r === "__v_skip") return t.__v_skip;
const a = this._isReadonly, o = this._isShallow;
if (r === "__v_isReactive")
return !a;
if (r === "__v_isReadonly")
return a;
if (r === "__v_isShallow")
return o;
if (r === "__v_raw")
return n === (a ? o ? g4 : m4 : o ? h4 : v4).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(n) ? t : void 0;
const l = B(t);
if (!a) {
let p;
if (l && (p = fa[r]))
return p;
if (r === "hasOwnProperty")
return ha;
}
const i = 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
ue(t) ? t : n
);
return (i2(r) ? _4.has(r) : va(r)) || (a || de(t, "get", r), o) ? i : ue(i) ? l && ur(r) ? i : i.value : Z(i) ? a ? vr(i) : dr(i) : i;
}
}
class f4 extends p4 {
constructor(t = !1) {
super(!1, t);
}
set(t, r, n, a) {
let o = t[r];
if (!this._isShallow) {
const p = s2(o);
if (!Ne(n) && !s2(n) && (o = j(o), n = j(n)), !B(t) && ue(o) && !ue(n))
return p ? !1 : (o.value = n, !0);
}
const l = B(t) && ur(r) ? Number(r) < t.length : W(t, r), i = Reflect.set(
t,
r,
n,
ue(t) ? t : a
);
return t === j(a) && (l ? g2(n, o) && Ze(t, "set", r, n, o) : Ze(t, "add", r, n)), i;
}
deleteProperty(t, r) {
const n = W(t, r), a = t[r], o = Reflect.deleteProperty(t, r);
return o && n && Ze(t, "delete", r, void 0, a), o;
}
has(t, r) {
const n = Reflect.has(t, r);
return (!i2(r) || !_4.has(r)) && de(t, "has", r), n;
}
ownKeys(t) {
return de(
t,
"iterate",
B(t) ? "length" : S2
), Reflect.ownKeys(t);
}
}
class d4 extends p4 {
constructor(t = !1) {
super(!0, t);
}
set(t, r) {
return process.env.NODE_ENV !== "production" && ke(
`Set operation on key "${String(r)}" failed: target is readonly.`,
t
), !0;
}
deleteProperty(t, r) {
return process.env.NODE_ENV !== "production" && ke(
`Delete operation on key "${String(r)}" failed: target is readonly.`,
t
), !0;
}
}
const ma = /* @__PURE__ */ new f4(), ga = /* @__PURE__ */ new d4(), wa = /* @__PURE__ */ new f4(!0), xa = /* @__PURE__ */ new d4(!0), K0 = (e) => e, $t = (e) => Reflect.getPrototypeOf(e);
function ya(e, t, r) {
return function(...n) {
const a = this.__v_raw, o = j(a), l = O2(o), i = e === "entries" || e === Symbol.iterator && l, p = e === "keys" && l, m = a[e](...n), v = r ? K0 : t ? W0 : ye;
return !t && de(
o,
"iterate",
p ? U0 : S2
), {
// iterator protocol
next() {
const { value: d, done: g } = m.next();
return g ? { value: d, done: g } : {
value: i ? [v(d[0]), v(d[1])] : v(d),
done: g
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function Ft(e) {
return function(...t) {
if (process.env.NODE_ENV !== "production") {
const r = t[0] ? `on key "${t[0]}" ` : "";
ke(
`${T2(e)} operation ${r}failed: target is readonly.`,
j(this)
);
}
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function Ca(e, t) {
const r = {
get(a) {
const o = this.__v_raw, l = j(o), i = j(a);
e || (g2(a, i) && de(l, "get", a), de(l, "get", i));
const { has: p } = $t(l), m = t ? K0 : e ? W0 : ye;
if (p.call(l, a))
return m(o.get(a));
if (p.call(l, i))
return m(o.get(i));
o !== l && o.get(a);
},
get size() {
const a = this.__v_raw;
return !e && de(j(a), "iterate", S2), Reflect.get(a, "size", a);
},
has(a) {
const o = this.__v_raw, l = j(o), i = j(a);
return e || (g2(a, i) && de(l, "has", a), de(l, "has", i)), a === i ? o.has(a) : o.has(a) || o.has(i);
},
forEach(a, o) {
const l = this, i = l.__v_raw, p = j(i), m = t ? K0 : e ? W0 : ye;
return !e && de(p, "iterate", S2), i.forEach((v, d) => a.call(o, m(v), m(d), l));
}
};
return ce(
r,
e ? {
add: Ft("add"),
set: Ft("set"),
delete: Ft("delete"),
clear: Ft("clear")
} : {
add(a) {
!t && !Ne(a) && !s2(a) && (a = j(a));
const o = j(this);
return $t(o).has.call(o, a) || (o.add(a), Ze(o, "add", a, a)), this;
},
set(a, o) {
!t && !Ne(o) && !s2(o) && (o = j(o));
const l = j(this), { has: i, get: p } = $t(l);
let m = i.call(l, a);
m ? process.env.NODE_ENV !== "production" && qr(l, i, a) : (a = j(a), m = i.call(l, a));
const v = p.call(l, a);
return l.set(a, o), m ? g2(o, v) && Ze(l, "set", a, o, v) : Ze(l, "add", a, o), this;
},
delete(a) {
const o = j(this), { has: l, get: i } = $t(o);
let p = l.call(o, a);
p ? process.env.NODE_ENV !== "production" && qr(o, l, a) : (a = j(a), p = l.call(o, a));
const m = i ? i.call(o, a) : void 0, v = o.delete(a);
return p && Ze(o, "delete", a, void 0, m), v;
},
clear() {
const a = j(this), o = a.size !== 0, l = process.env.NODE_ENV !== "production" ? O2(a) ? new Map(a) : new Set(a) : void 0, i = a.clear();
return o && Ze(
a,
"clear",
void 0,
void 0,
l
), i;
}
}
), [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((a) => {
r[a] = ya(a, e, t);
}), r;
}
function v0(e, t) {
const r = Ca(e, t);
return (n, a, o) => a === "__v_isReactive" ? !e : a === "__v_isReadonly" ? e : a === "__v_raw" ? n : Reflect.get(
W(r, a) && a in n ? r : n,
a,
o
);
}
const ba = {
get: /* @__PURE__ */ v0(!1, !1)
}, Ma = {
get: /* @__PURE__ */ v0(!1, !0)
}, Va = {
get: /* @__PURE__ */ v0(!0, !1)
}, za = {
get: /* @__PURE__ */ v0(!0, !0)
};
function qr(e, t, r) {
const n = j(r);
if (n !== r && t.call(e, n)) {
const a = ir(e);
ke(
`Reactive ${a} contains both the raw and reactive versions of the same object${a === "Map" ? " as keys" : ""}, which can lead to inconsistencies. Avoid differentiating between the raw and reactive versions of an object and only use the reactive version if possible.`
);
}
}
const v4 = /* @__PURE__ */ new WeakMap(), h4 = /* @__PURE__ */ new WeakMap(), m4 = /* @__PURE__ */ new WeakMap(), g4 = /* @__PURE__ */ new WeakMap();
function Ea(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function Ha(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : Ea(ir(e));
}
function dr(e) {
return s2(e) ? e : h0(
e,
!1,
ma,
ba,
v4
);
}
function w4(e) {
return h0(
e,
!1,
wa,
Ma,
h4
);
}
function vr(e) {
return h0(
e,
!0,
ga,
Va,
m4
);
}
function Ye(e) {
return h0(
e,
!0,
xa,
za,
g4
);
}
function h0(e, t, r, n, a) {
if (!Z(e))
return process.env.NODE_ENV !== "production" && ke(
`value cannot be made ${t ? "readonly" : "reactive"}: ${String(
e
)}`
), e;
if (e.__v_raw && !(t && e.__v_isReactive))
return e;
const o = a.get(e);
if (o)
return o;
const l = Ha(e);
if (l === 0)
return e;
const i = new Proxy(
e,
l === 2 ? n : r
);
return a.set(e, i), i;
}
function A2(e) {
return s2(e) ? A2(e.__v_raw) : !!(e && e.__v_isReactive);
}
function s2(e) {
return !!(e && e.__v_isReadonly);
}
function Ne(e) {
return !!(e && e.__v_isShallow);
}
function Xt(e) {
return e ? !!e.__v_raw : !1;
}
function j(e) {
const t = e && e.__v_raw;
return t ? j(t) : e;
}
function Na(e) {
return !W(e, "__v_skip") && Object.isExtensible(e) && Qt(e, "__v_skip", !0), e;
}
const ye = (e) => Z(e) ? dr(e) : e, W0 = (e) => Z(e) ? vr(e) : e;
function ue(e) {
return e ? e.__v_isRef === !0 : !1;
}
function De(e) {
return Oa(e, !1);
}
function Oa(e, t) {
return ue(e) ? e : new Sa(e, t);
}
class Sa {
constructor(t, r) {
this.dep = new fr(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = r ? t : j(t), this._value = r ? t : ye(t), this.__v_isShallow = r;
}
get value() {
return process.env.NODE_ENV !== "production" ? this.dep.track({
target: this,
type: "get",
key: "value"
}) : this.dep.track(), this._value;
}
set value(t) {
const r = this._rawValue, n = this.__v_isShallow || Ne(t) || s2(t);
t = n ? t : j(t), g2(t, r) && (this._rawValue = t, this._value = n ? t : ye(t), process.env.NODE_ENV !== "production" ? this.dep.trigger({
target: this,
type: "set",
key: "value",
newValue: t,
oldValue: r
}) : this.dep.trigger());
}
}
function I(e) {
return ue(e) ? e.value : e;
}
const Aa = {
get: (e, t, r) => t === "__v_raw" ? e : I(Reflect.get(e, t, r)),
set: (e, t, r, n) => {
const a = e[t];
return ue(a) && !ue(r) ? (a.value = r, !0) : Reflect.set(e, t, r, n);
}
};
function x4(e) {
return A2(e) ? e : new Proxy(e, Aa);
}
class La {
constructor(t, r, n) {
this.fn = t, this.setter = r, this._value = void 0, this.dep = new fr(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = wt - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !r, this.isSSR = n;
}
/**
* @internal
*/
notify() {
if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion
X !== this)
return o4(this, !0), !0;
process.env.NODE_ENV;
}
get value() {
const t = process.env.NODE_ENV !== "production" ? this.dep.track({
target: this,
type: "get",
key: "value"
}) : this.dep.track();
return i4(this), t && (t.version = this.dep.version), this._value;
}
set value(t) {
this.setter ? this.setter(t) : process.env.NODE_ENV !== "production" && ke("Write operation failed: computed value is readonly");
}
}
function Ba(e, t, r = !1) {
let n, a;
T(e) ? n = e : (n = e.get, a = e.set);
const o = new La(n, a, r);
return process.env.NODE_ENV, o;
}
const It = {}, e0 = /* @__PURE__ */ new WeakMap();
let H2;
function Da(e, t = !1, r = H2) {
if (r) {
let n = e0.get(r);
n || e0.set(r, n = []), n.push(e);
} else process.env.NODE_ENV !== "production" && !t && ke(
"onWatcherCleanup() was called when there was no active watcher to associate with."
);
}
function Ta(e, t, r = ee) {
const { immediate: n, deep: a, once: o, scheduler: l, augmentJob: i, call: p } = r, m = (L) => {
(r.onWarn || ke)(
"Invalid watch source: ",
L,
"A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types."
);
}, v = (L) => a ? L : Ne(L) || a === !1 || a === 0 ? a2(L, 1) : a2(L);
let d, g, y, A, H = !1, k = !1;
if (ue(e) ? (g = () => e.value, H = Ne(e)) : A2(e) ? (g = () => v(e), H = !0) : B(e) ? (k = !0, H = e.some((L) => A2(L) || Ne(L)), g = () => e.map((L) => {
if (ue(L))
return L.value;
if (A2(L))
return v(L);
if (T(L))
return p ? p(L, 2) : L();
process.env.NODE_ENV !== "production" && m(L);
})) : T(e) ? t ? g = p ? () => p(e, 2) : e : g = () => {
if (y) {
u2();
try {
y();
} finally {
c2();
}
}
const L = H2;
H2 = d;
try {
return p ? p(e, 3, [A]) : e(A);
} finally {
H2 = L;
}
} : (g = ve, process.env.NODE_ENV !== "production" && m(e)), t && a) {
const L = g, Y = a === !0 ? 1 / 0 : a;
g = () => a2(L(), Y);
}
const F = r4(), ne = () => {
d.stop(), F && F.active && sr(F.effects, d);
};
if (o && t) {
const L = t;
t = (...Y) => {
L(...Y), ne();
};
}
let U = k ? new Array(e.length).fill(It) : It;
const _e = (L) => {
if (!(!(d.flags & 1) || !d.dirty && !L))
if (t) {
const Y = d.run();
if (a || H || (k ? Y.some((q, ie) => g2(q, U[ie])) : g2(Y, U))) {
y && y();
const q = H2;
H2 = d;
try {
const ie = [
Y,
// pass undefined as the old value when it's changed for the first time
U === It ? void 0 : k && U[0] === It ? [] : U,
A
];
p ? p(t, 3, ie) : (
// @ts-expect-error
t(...ie)
), U = Y;
} finally {
H2 = q;
}
}
} else
d.run();
};
return i && i(_e), d = new n4(g), d.scheduler = l ? () => l(_e, !1) : _e, A = (L) => Da(L, !1, d), y = d.onStop = () => {
const L = e0.get(d);
if (L) {
if (p)
p(L, 4);
else
for (const Y of L) Y();
e0.delete(d);
}
}, process.env.NODE_ENV !== "production" && (d.onTrack = r.onTrack, d.onTrigger = r.onTrigger), t ? n ? _e(!0) : U = d.run() : l ? l(_e.bind(null, !0), !0) : d.run(), ne.pause = d.pause.bind(d), ne.resume = d.resume.bind(d), ne.stop = ne, ne;
}
function a2(e, t = 1 / 0, r) {
if (t <= 0 || !Z(e) || e.__v_skip || (r = r || /* @__PURE__ */ new Set(), r.has(e)))
return e;
if (r.add(e), t--, ue(e))
a2(e.value, t, r);
else if (B(e))
for (let n = 0; n < e.length; n++)
a2(e[n], t, r);
else if (Z1(e) || O2(e))
e.forEach((n) => {
a2(n, t, r);
});
else if (Q1(e)) {
for (const n in e)
a2(e[n], t, r);
for (const n of Object.getOwnPropertySymbols(e))
Object.prototype.propertyIsEnumerable.call(e, n) && a2(e[n], t, r);
}
return e;
}
/**
* @vue/runtime-core v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
const L2 = [];
function jt(e) {
L2.push(e);
}
function qt() {
L2.pop();
}
let B0 = !1;
function V(e, ...t) {
if (B0) return;
B0 = !0, u2();
const r = L2.length ? L2[L2.length - 1].component : null, n = r && r.appContext.config.warnHandler, a = Pa();
if (n)
et(
n,
r,
11,
[
// eslint-disable-next-line no-restricted-syntax
e + t.map((o) => {
var l, i;
return (i = (l = o.toString) == null ? void 0 : l.call(o)) != null ? i : JSON.stringify(o);
}).join(""),
r && r.proxy,
a.map(
({ vnode: o }) => `at <${C0(r, o.type)}>`
).join(`
`),
a
]
);
else {
const o = [`[Vue warn]: ${e}`, ...t];
a.length && o.push(`
`, ...$a(a)), console.warn(...o);
}
c2(), B0 = !1;
}
function Pa() {
let e = L2[L2.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 n = e.component && e.component.parent;
e = n && n.vnode;
}
return t;
}
function $a(e) {
const t = [];
return e.forEach((r, n) => {
t.push(...n === 0 ? [] : [`
`], ...Fa(r));
}), t;
}
function Fa({ vnode: e, recurseCount: t }) {
const r = t > 0 ? `... (${t} recursive calls)` : "", n = e.component ? e.component.parent == null : !1, a = ` at <${C0(
e.component,
e.type,
n
)}`, o = ">" + r;
return e.props ? [a, ...Ia(e.props), o] : [a + o];
}
function Ia(e) {
const t = [], r = Object.keys(e);
return r.slice(0, 3).forEach((n) => {
t.push(...y4(n, e[n]));
}), r.length > 3 && t.push(" ..."), t;
}
function y4(e, t, r) {
return re(t) ? (t = JSON.stringify(t), r ? t : [`${e}=${t}`]) : typeof t == "number" || typeof t == "boolean" || t == null ? r ? t : [`${e}=${t}`] : ue(t) ? (t = y4(e, j(t.value), !0), r ? t : [`${e}=Ref<`, t, ">"]) : T(t) ? [`${e}=fn${t.name ? `<${t.name}>` : ""}`] : (t = j(t), r ? t : [`${e}=`, t]);
}
function ka(e, t) {
process.env.NODE_ENV !== "production" && e !== void 0 && (typeof e != "number" ? V(`${t} is not a valid number - got ${JSON.stringify(e)}.`) : isNaN(e) && V(`${t} is NaN - the duration expression might be incorrect.`));
}
const hr = {
sp: "serverPrefetch hook",
bc: "beforeCreate hook",
c: "created hook",
bm: "beforeMount hook",
m: "mounted hook",
bu: "beforeUpdate hook",
u: "updated",
bum: "beforeUnmount hook",
um: "unmounted hook",
a: "activated hook",
da: "deactivated hook",
ec: "errorCaptured hook",
rtc: "renderTracked hook",
rtg: "renderTriggered hook",
0: "setup function",
1: "render function",
2: "watcher getter",
3: "watcher callback",
4: "watcher cleanup function",
5: "native event handler",
6: "component event handler",
7: "vnode hook",
8: "directive hook",
9: "transition hook",
10: "app errorHandler",
11: "app warnHandler",
12: "ref function",
13: "async component loader",
14: "scheduler flush",
15: "component update",
16: "app unmount cleanup function"
};
function et(e, t, r, n) {
try {
return n ? e(...n) : e();
} catch (a) {
St(a, t, r);
}
}
function Re(e, t, r, n) {
if (T(e)) {
const a = et(e, t, r, n);
return a && lr(a) && a.catch((o) => {
St(o, t, r);
}), a;
}
if (B(e)) {
const a = [];
for (let o = 0; o < e.length; o++)
a.push(Re(e[o], t, r, n));
return a;
} else process.env.NODE_ENV !== "production" && V(
`Invalid value type passed to callWithAsyncErrorHandling(): ${typeof e}`
);
}
function St(e, t, r, n = !0) {
const a = t ? t.vnode : null, { errorHandler: o, throwUnhandledErrorInProduction: l } = t && t.appContext.config || ee;
if (t) {
let i = t.parent;
const p = t.proxy, m = process.env.NODE_ENV !== "production" ? hr[r] : `https://vuejs.org/error-reference/#runtime-${r}`;
for (; i; ) {
const v = i.ec;
if (v) {
for (let d = 0; d < v.length; d++)
if (v[d](e, p, m) === !1)
return;
}
i = i.parent;
}
if (o) {
u2(), et(o, null, 10, [
e,
p,
m
]), c2();
return;
}
}
Ra(e, r, a, n, l);
}
function Ra(e, t, r, n = !0, a = !1) {
if (process.env.NODE_ENV !== "production") {
const o = hr[t];
if (r && jt(r), V(`Unhandled error${o ? ` during execution of ${o}` : ""}`), r && qt(), n)
throw e;
console.error(e);
} else {
if (a)
throw e;
console.error(e);
}
}
const Ee = [];
let Ge = -1;
const W2 = [];
let d2 = null, U2 = 0;
const C4 = /* @__PURE__ */ Promise.resolve();
let t0 = null;
const ja = 100;
function b4(e) {
const t = t0 || C4;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function qa(e) {
let t = Ge + 1, r = Ee.length;
for (; t < r; ) {
const n = t + r >>> 1, a = Ee[n], o = yt(a);
o < e || o === e && a.flags & 2 ? t = n + 1 : r = n;
}
return t;
}
function m0(e) {
if (!(e.flags & 1)) {
const t = yt(e), r = Ee[Ee.length - 1];
!r || // fast path when the job id is larger than the tail
!(e.flags & 2) && t >= yt(r) ? Ee.push(e) : Ee.splice(qa(t), 0, e), e.flags |= 1, M4();
}
}
function M4() {
t0 || (t0 = C4.then(E4));
}
function V4(e) {
B(e) ? W2.push(...e) : d2 && e.id === -1 ? d2.splice(U2 + 1, 0, e) : e.flags & 1 || (W2.push(e), e.flags |= 1), M4();
}
function Ur(e, t, r = Ge + 1) {
for (process.env.NODE_ENV !== "production" && (t = t || /* @__PURE__ */ new Map()); r < Ee.length; r++) {
const n = Ee[r];
if (n && n.flags & 2) {
if (e && n.id !== e.uid || process.env.NODE_ENV !== "production" && mr(t, n))
continue;
Ee.splice(r, 1), r--, n.flags & 4 && (n.flags &= -2), n(), n.flags & 4 || (n.flags &= -2);
}
}
}
function z4(e) {
if (W2.length) {
const t = [...new Set(W2)].sort(
(r, n) => yt(r) - yt(n)
);
if (W2.length = 0, d2) {
d2.push(...t);
return;
}
for (d2 = t, process.env.NODE_ENV !== "production" && (e = e || /* @__PURE__ */ new Map()), U2 = 0; U2 < d2.length; U2++) {
const r = d2[U2];
process.env.NODE_ENV !== "production" && mr(e, r) || (r.flags & 4 && (r.flags &= -2), r.flags & 8 || r(), r.flags &= -2);
}
d2 = null, U2 = 0;
}
}
const yt = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
function E4(e) {
process.env.NODE_ENV !== "production" && (e = e || /* @__PURE__ */ new Map());
const t = process.env.NODE_ENV !== "production" ? (r) => mr(e, r) : ve;
try {
for (Ge = 0; Ge < Ee.length; Ge++) {
const r = Ee[Ge];
if (r && !(r.flags & 8)) {
if (process.env.NODE_ENV !== "production" && t(r))
continue;
r.flags & 4 && (r.flags &= -2), et(
r,
r.i,
r.i ? 15 : 14
), r.flags & 4 || (r.flags &= -2);
}
}
} finally {
for (; Ge < Ee.length; Ge++) {
const r = Ee[Ge];
r && (r.flags &= -2);
}
Ge = -1, Ee.length = 0, z4(e), t0 = null, (Ee.length || W2.length) && E4(e);
}
}
function mr(e, t) {
const r = e.get(t) || 0;
if (r > ja) {
const n = t.i, a = n && Mr(n.type);
return St(
`Maximum recursive updates exceeded${a ? ` in component <${a}>` : ""}. This means you have a reactive effect that is mutating its own dependencies and thus recursively triggering itself. Possible sources include component template, render function, updated hook or watcher source function.`,
null,
10
), !0;
}
return e.set(t, r + 1), !1;
}
let Qe = !1;
const Ut = /* @__PURE__ */ new Map();
process.env.NODE_ENV !== "production" && (Nt().__VUE_HMR_RUNTIME__ = {
createRecord: D0(H4),
rerender: D0(Wa),
reload: D0(Ga)
});
const P2 = /* @__PURE__ */ new Map();
function Ua(e) {
const t = e.type.__hmrId;
let r = P2.get(t);
r || (H4(t, e.type), r = P2.get(t)), r.instances.add(e);
}
function Ka(e) {
P2.get(e.type.__hmrId).instances.delete(e);
}
function H4(e, t) {
return P2.has(e) ? !1 : (P2.set(e, {
initialDef: r0(t),
instances: /* @__PURE__ */ new Set()
}), !0);
}
function r0(e) {
return Mn(e) ? e.__vccOpts : e;
}
function Wa(e, t) {
const r = P2.get(e);
r && (r.initialDef.render = t, [...r.instances].forEach((n) => {
t && (n.render = t, r0(n.type).render = t), n.renderCache = [], Qe = !0, n.update(), Qe = !1;
}));
}
function Ga(e, t) {
const r = P2.get(e);
if (!r) return;
t = r0(t), Kr(r.initialDef, t);
const n = [...r.instances];
for (let a = 0; a < n.length; a++) {
const o = n[a], l = r0(o.type);
let i = Ut.get(l);
i || (l !== r.initialDef && Kr(l, t), Ut.set(l, i = /* @__PURE__ */ new Set())), i.add(o), o.appContext.propsCache.delete(o.type), o.appContext.emitsCache.delete(o.type), o.appContext.optionsCache.delete(o.type), o.ceReload ? (i.add(o), o.ceReload(t.styles), i.delete(o)) : o.parent ? m0(() => {
Qe = !0, o.parent.update(), Qe = !1, i.delete(o);
}) : o.appContext.reload ? o.appContext.reload() : typeof window < "u" ? window.location.reload() : console.warn(
"[HMR] Root or manually mounted instance modified. Full reload required."
), o.root.ce && o !== o.root && o.root.ce._removeChildStyle(l);
}
V4(() => {
Ut.clear();
});
}
function Kr(e, t) {
ce(e, t);
for (const r in e)
r !== "__file" && !(r in t) && delete e[r];
}
function D0(e) {
return (t, r) => {
try {
return e(t, r);
} catch (n) {
console.error(n), console.warn(
"[HMR] Something went wrong during Vue component hot-reload. Full reload required."
);
}
};
}
let $e, ft = [], G0 = !1;
function At(e, ...t) {
$e ? $e.emit(e, ...t) : G0 || ft.push({ event: e, args: t });
}
function gr(e, t) {
var r, n;
$e = e, $e ? ($e.enabled = !0, ft.forEach(({ event: a, args: o }) => $e.emit(a, ...o)), ft = []) : /* handle late devtools injection - only do this if we are in an actual */ /* browser environment to avoid the timer handle stalling test runner exit */ /* (#4815) */ typeof window < "u" && // some envs mock window but not fully
window.HTMLElement && // also exclude jsdom
// eslint-disable-next-line no-restricted-syntax
!((n = (r = window.navigator) == null ? void 0 : r.userAgent) != null && n.includes("jsdom")) ? ((t.__VUE_DEVTOOLS_HOOK_REPLAY__ = t.__VUE_DEVTOOLS_HOOK_REPLAY__ || []).push((o) => {
gr(o, t);
}), setTimeout(() => {
$e || (t.__VUE_DEVTOOLS_HOOK_REPLAY__ = null, G0 = !0, ft = []);
}, 3e3)) : (G0 = !0, ft = []);
}
function Ja(e, t) {
At("app:init", e, t, {
Fragment: we,
Text: Bt,
Comment: pe,
Static: Wt
});
}
function Za(e) {
At("app:unmount", e);
}
const Ya = /* @__PURE__ */ wr(
"component:added"
/* COMPONENT_ADDED */
), N4 = /* @__PURE__ */ wr(
"component:updated"
/* COMPONENT_UPDATED */
), Qa = /* @__PURE__ */ wr(
"component:removed"
/* COMPONENT_REMOVED */
), Xa = (e) => {
$e && typeof $e.cleanupBuffer == "function" && // remove the component if it wasn't buffered
!$e.cleanupBuffer(e) && Qa(e);
};
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function wr(e) {
return (t) => {
At(
e,
t.appContext.app,
t.uid,
t.parent ? t.parent.uid : void 0,
t
);
};
}
const e6 = /* @__PURE__ */ O4(
"perf:start"
/* PERFORMANCE_START */
), t6 = /* @__PURE__ */ O4(
"perf:end"
/* PERFORMANCE_END */
);
function O4(e) {
return (t, r, n) => {
At(e, t.appContext.app, t.uid, t, r, n);
};
}
function r6(e, t, r) {
At(
"component:emit",
e.appContext.app,
e,
t,
r
);
}
let fe = null, S4 = null;
function n0(e) {
const t = fe;
return fe = e, S4 = e && e.type.__scopeId || null, t;
}
function B2(e, t = fe, r) {
if (!t || e._n)
return e;
const n = (...a) => {
n._d && l1(-1);
const o = n0(t);
let l;
try {
l = e(...a);
} finally {
n0(o), n._d && l1(1);
}
return process.env.NODE_ENV !== "production" && N4(t), l;
};
return n._n = !0, n._c = !0, n._d = !0, n;
}
function A4(e) {
Qn(e) && V("Do not use built-in directive ids as custom directive id: " + e);
}
function L4(e, t) {
if (fe === null)
return process.env.NODE_ENV !== "production" && V("withDirectives can only be used inside render functions."), e;
const r = y0(fe), n = e.dirs || (e.dirs = []);
for (let a = 0; a < t.length; a++) {
let [o, l, i, p = ee] = t[a];
o && (T(o) && (o = {
mounted: o,
updated: o
}), o.deep && a2(l), n.push({
dir: o,
instance: r,
value: l,
oldValue: void 0,
arg: i,
modifiers: p
}));
}
return e;
}
function C2(e, t, r, n) {
const a = e.dirs, o = t && t.dirs;
for (let l = 0; l < a.length; l++) {
const i = a[l];
o && (i.oldValue = o[l].value);
let p = i.dir[n];
p && (u2(), Re(p, r, 8, [
e.el,
i,
e,
t
]), c2());
}
}
const n6 = Symbol("_vte"), B4 = (e) => e.__isTeleport, v2 = Symbol("_leaveCb"), kt = Symbol("_enterCb");
function a6() {
const e = {
isMounted: !1,
isLeaving: !1,
isUnmounting: !1,
leavingVNodes: /* @__PURE__ */ new Map()
};
return w0(() => {
e.isMounted = !0;
}), R4(() => {
e.isUnmounting = !0;
}), e;
}
const Be = [Function, Array], D4 = {
mode: String,
appear: Boolean,
persisted: Boolean,
// enter
onBeforeEnter: Be,
onEnter: Be,
onAfterEnter: Be,
onEnterCancelled: Be,
// leave
onBeforeLeave: Be,
onLeave: Be,
onAfterLeave: Be,
onLeaveCancelled: Be,
// appear
onBeforeAppear: Be,
onAppear: Be,
onAfterAppear: Be,
onAppearCancelled: Be
}, T4 = (e) => {
const t = e.subTree;
return t.component ? T4(t.component) : t;
}, o6 = {
name: "BaseTransition",
props: D4,
setup(e, { slots: t }) {
const r = y2(), n = a6();
return () => {
const a = t.default && F4(t.default(), !0);
if (!a || !a.length)
return;
const o = P4(a), l = j(e), { mode: i } = l;
if (process.env.NODE_ENV !== "production" && i && i !== "in-out" && i !== "out-in" && i !== "default" && V(`invalid <transition> mode: ${i}`), n.isLeaving)
return T0(o);
const p = Wr(o);
if (!p)
return T0(o);
let m = J0(
p,
l,
n,
r,
// #11061, ensure enterHooks is fresh after clone
(d) => m = d
);
p.type !== pe && Ct(p, m);
let v = r.subTree && Wr(r.subTree);
if (v && v.type !== pe && !N2(p, v) && T4(r).type !== pe) {
let d = J0(
v,
l,
n,
r
);
if (Ct(v, d), i === "out-in" && p.type !== pe)
return n.isLeaving = !0, d.afterLeave = () => {
n.isLeaving = !1, r.job.flags & 8 || r.update(), delete d.afterLeave, v = void 0;
}, T0(o);
i === "in-out" && p.type !== pe ? d.delayLeave = (g, y, A) => {
const H = $4(
n,
v
);
H[String(v.key)] = v, g[v2] = () => {
y(), g[v2] = void 0, delete m.delayedLeave, v = void 0;
}, m.delayedLeave = () => {
A(), delete m.delayedLeave, v = void 0;
};
} : v = void 0;
} else v && (v = void 0);
return o;
};
}
};
function P4(e) {
let t = e[0];
if (e.length > 1) {
let r = !1;
for (const n of e)
if (n.type !== pe) {
if (process.env.NODE_ENV !== "production" && r) {
V(
"<transition> can only be used on a single element or component. Use <transition-group> for lists."
);
break;
}
if (t = n, r = !0, process.env.NODE_ENV === "production") break;
}
}
return t;
}
const s6 = o6;
function $4(e, t) {
const { leavingVNodes: r } = e;
let n = r.get(t.type);
return n || (n = /* @__PURE__ */ Object.create(null), r.set(t.type, n)), n;
}
function J0(e, t, r, n, a) {
const {
appear: o,
mode: l,
persisted: i = !1,
onBeforeEnter: p,
onEnter: m,
onAfterEnter: v,
onEnterCancelled: d,
onBeforeLeave: g,
onLeave: y,
onAfterLeave: A,
onLeaveCancelled: H,
onBeforeAppear: k,
onAppear: F,
onAfterAppear: ne,
onAppearCancelled: U
} = t, _e = String(e.key), L = $4(r, e), Y = ($, Q) => {
$ && Re(
$,
n,
9,
Q
);
}, q = ($, Q) => {
const se = Q[1];
Y($, Q), B($) ? $.every((S) => S.length <= 1) && se() : $.length <= 1 && se();
}, ie = {
mode: l,
persisted: i,
beforeEnter($) {
let Q = p;
if (!r.isMounted)
if (o)
Q = k || p;
else
return;
$[v2] && $[v2](
!0
/* cancelled */
);
const se = L[_e];
se && N2(e, se) && se.el[v2] && se.el[v2](), Y(Q, [$]);
},
enter($) {
let Q = m, se = v, S = d;
if (!r.isMounted)
if (o)
Q = F || m, se = ne || v, S = U || d;
else
return;
let le = !1;
const Ce = $[kt] = (be) => {
le || (le = !0, be ? Y(S, [$]) : Y(se, [$]), ie.delayedLeave && ie.delayedLeave(), $[kt] = void 0);
};
Q ? q(Q, [$, Ce]) : Ce();
},
leave($, Q) {
const se = String(e.key);
if ($[kt] && $[kt](
!0
/* cancelled */
), r.isUnmounting)
return Q();
Y(g, [$]);
let S = !1;
const le = $[v2] = (Ce) => {
S || (S = !0, Q(), Ce ? Y(H, [$]) : Y(A, [$]), $[v2] = void 0, L[se] === e && delete L[se]);
};
L[se] = e, y ? q(y, [$, le]) : le();
},
clone($) {
const Q = J0(
$,
t,
r,
n,
a