imooc-element-components-hql
Version:
1,725 lines • 60.2 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 an(e) {
const t = /* @__PURE__ */ Object.create(null);
for (const n of e.split(",")) t[n] = 1;
return (n) => n in t;
}
const T = process.env.NODE_ENV !== "production" ? Object.freeze({}) : {}, un = process.env.NODE_ENV !== "production" ? Object.freeze([]) : [], k = () => {
}, fn = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), V = Object.assign, pn = Object.prototype.hasOwnProperty, N = (e, t) => pn.call(e, t), m = Array.isArray, ee = (e) => Pe(e) === "[object Map]", dn = (e) => Pe(e) === "[object Set]", w = (e) => typeof e == "function", A = (e) => typeof e == "string", pe = (e) => typeof e == "symbol", y = (e) => e !== null && typeof e == "object", hn = (e) => (y(e) || w(e)) && w(e.then) && w(e.catch), _n = Object.prototype.toString, Pe = (e) => _n.call(e), Dt = (e) => Pe(e).slice(8, -1), gn = (e) => Pe(e) === "[object Object]", rt = (e) => A(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, Vt = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return (n) => t[n] || (t[n] = e(n));
}, mn = /-(\w)/g, Oe = Vt(
(e) => e.replace(mn, (t, n) => n ? n.toUpperCase() : "")
), Se = Vt((e) => e.charAt(0).toUpperCase() + e.slice(1)), L = (e, t) => !Object.is(e, t), En = (e, t, n, s = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: s,
value: n
});
};
let gt;
const $e = () => gt || (gt = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
function st(e) {
if (m(e)) {
const t = {};
for (let n = 0; n < e.length; n++) {
const s = e[n], r = A(s) ? vn(s) : st(s);
if (r)
for (const o in r)
t[o] = r[o];
}
return t;
} else if (A(e) || y(e))
return e;
}
const bn = /;(?![^(]*\))/g, Nn = /:([^]+)/, wn = /\/\*[^]*?\*\//g;
function vn(e) {
const t = {};
return e.replace(wn, "").split(bn).forEach((n) => {
if (n) {
const s = n.split(Nn);
s.length > 1 && (t[s[0].trim()] = s[1].trim());
}
}), t;
}
function ot(e) {
let t = "";
if (A(e))
t = e;
else if (m(e))
for (let n = 0; n < e.length; n++) {
const s = ot(e[n]);
s && (t += s + " ");
}
else if (y(e))
for (const n in e)
e[n] && (t += n + " ");
return t.trim();
}
/**
* @vue/reactivity v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
function U(e, ...t) {
console.warn(`[Vue warn] ${e}`, ...t);
}
let g;
const je = /* @__PURE__ */ new WeakSet();
class On {
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;
}
pause() {
this.flags |= 64;
}
resume() {
this.flags & 64 && (this.flags &= -65, je.has(this) && (je.delete(this), this.trigger()));
}
/**
* @internal
*/
notify() {
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || Sn(this);
}
run() {
if (!(this.flags & 1))
return this.fn();
this.flags |= 2, mt(this), Ct(this);
const t = g, n = P;
g = this, P = !0;
try {
return this.fn();
} finally {
process.env.NODE_ENV !== "production" && g !== this && U(
"Active effect was not restored correctly - this is likely a Vue internal bug."
), Tt(this), g = t, P = n, this.flags &= -3;
}
}
stop() {
if (this.flags & 1) {
for (let t = this.deps; t; t = t.nextDep)
lt(t);
this.deps = this.depsTail = void 0, mt(this), this.onStop && this.onStop(), this.flags &= -2;
}
}
trigger() {
this.flags & 64 ? je.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
}
/**
* @internal
*/
runIfDirty() {
Ye(this) && this.run();
}
get dirty() {
return Ye(this);
}
}
let Rt = 0, ce, le;
function Sn(e, t = !1) {
if (e.flags |= 8, t) {
e.next = le, le = e;
return;
}
e.next = ce, ce = e;
}
function it() {
Rt++;
}
function ct() {
if (--Rt > 0)
return;
if (le) {
let t = le;
for (le = void 0; t; ) {
const n = t.next;
t.next = void 0, t.flags &= -9, t = n;
}
}
let e;
for (; ce; ) {
let t = ce;
for (ce = void 0; t; ) {
const n = t.next;
if (t.next = void 0, t.flags &= -9, t.flags & 1)
try {
t.trigger();
} catch (s) {
e || (e = s);
}
t = n;
}
}
if (e) throw e;
}
function Ct(e) {
for (let t = e.deps; t; t = t.nextDep)
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
}
function Tt(e) {
let t, n = e.depsTail, s = n;
for (; s; ) {
const r = s.prevDep;
s.version === -1 ? (s === n && (n = r), lt(s), yn(s)) : t = s, s.dep.activeLink = s.prevActiveLink, s.prevActiveLink = void 0, s = r;
}
e.deps = t, e.depsTail = n;
}
function Ye(e) {
for (let t = e.deps; t; t = t.nextDep)
if (t.dep.version !== t.version || t.dep.computed && (xn(t.dep.computed) || t.dep.version !== t.version))
return !0;
return !!e._dirty;
}
function xn(e) {
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === xe))
return;
e.globalVersion = xe;
const t = e.dep;
if (e.flags |= 2, t.version > 0 && !e.isSSR && e.deps && !Ye(e)) {
e.flags &= -3;
return;
}
const n = g, s = P;
g = e, P = !0;
try {
Ct(e);
const r = e.fn(e._value);
(t.version === 0 || L(r, e._value)) && (e._value = r, t.version++);
} catch (r) {
throw t.version++, r;
} finally {
g = n, P = s, Tt(e), e.flags &= -3;
}
}
function lt(e, t = !1) {
const { dep: n, prevSub: s, nextSub: r } = e;
if (s && (s.nextSub = r, e.prevSub = void 0), r && (r.prevSub = s, e.nextSub = void 0), process.env.NODE_ENV !== "production" && n.subsHead === e && (n.subsHead = r), n.subs === e && (n.subs = s, !s && n.computed)) {
n.computed.flags &= -5;
for (let o = n.computed.deps; o; o = o.nextDep)
lt(o, !0);
}
!t && !--n.sc && n.map && n.map.delete(n.key);
}
function yn(e) {
const { prevDep: t, nextDep: n } = e;
t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
}
let P = !0;
const It = [];
function Ae() {
It.push(P), P = !1;
}
function Me() {
const e = It.pop();
P = e === void 0 ? !0 : e;
}
function mt(e) {
const { cleanup: t } = e;
if (e.cleanup = void 0, t) {
const n = g;
g = void 0;
try {
t();
} finally {
g = n;
}
}
}
let xe = 0;
class Dn {
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 Pt {
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 (!g || !P || g === this.computed)
return;
let n = this.activeLink;
if (n === void 0 || n.sub !== g)
n = this.activeLink = new Dn(g, this), g.deps ? (n.prevDep = g.depsTail, g.depsTail.nextDep = n, g.depsTail = n) : g.deps = g.depsTail = n, $t(n);
else if (n.version === -1 && (n.version = this.version, n.nextDep)) {
const s = n.nextDep;
s.prevDep = n.prevDep, n.prevDep && (n.prevDep.nextDep = s), n.prevDep = g.depsTail, n.nextDep = void 0, g.depsTail.nextDep = n, g.depsTail = n, g.deps === n && (g.deps = s);
}
return process.env.NODE_ENV !== "production" && g.onTrack && g.onTrack(
V(
{
effect: g
},
t
)
), n;
}
trigger(t) {
this.version++, xe++, this.notify(t);
}
notify(t) {
it();
try {
if (process.env.NODE_ENV !== "production")
for (let n = this.subsHead; n; n = n.nextSub)
n.sub.onTrigger && !(n.sub.flags & 8) && n.sub.onTrigger(
V(
{
effect: n.sub
},
t
)
);
for (let n = this.subs; n; n = n.prevSub)
n.sub.notify() && n.sub.dep.notify();
} finally {
ct();
}
}
}
function $t(e) {
if (e.dep.sc++, e.sub.flags & 4) {
const t = e.dep.computed;
if (t && !e.dep.subs) {
t.flags |= 20;
for (let s = t.deps; s; s = s.nextDep)
$t(s);
}
const n = e.dep.subs;
n !== e && (e.prevSub = n, n && (n.nextSub = e)), process.env.NODE_ENV !== "production" && e.dep.subsHead === void 0 && (e.dep.subsHead = e), e.dep.subs = e;
}
}
const qe = /* @__PURE__ */ new WeakMap(), J = Symbol(
process.env.NODE_ENV !== "production" ? "Object iterate" : ""
), Ge = Symbol(
process.env.NODE_ENV !== "production" ? "Map keys iterate" : ""
), ue = Symbol(
process.env.NODE_ENV !== "production" ? "Array iterate" : ""
);
function v(e, t, n) {
if (P && g) {
let s = qe.get(e);
s || qe.set(e, s = /* @__PURE__ */ new Map());
let r = s.get(n);
r || (s.set(n, r = new Pt()), r.map = s, r.key = n), process.env.NODE_ENV !== "production" ? r.track({
target: e,
type: t,
key: n
}) : r.track();
}
}
function W(e, t, n, s, r, o) {
const i = qe.get(e);
if (!i) {
xe++;
return;
}
const c = (a) => {
a && (process.env.NODE_ENV !== "production" ? a.trigger({
target: e,
type: t,
key: n,
newValue: s,
oldValue: r,
oldTarget: o
}) : a.trigger());
};
if (it(), t === "clear")
i.forEach(c);
else {
const a = m(e), f = a && rt(n);
if (a && n === "length") {
const p = Number(s);
i.forEach((l, u) => {
(u === "length" || u === ue || !pe(u) && u >= p) && c(l);
});
} else
switch ((n !== void 0 || i.has(void 0)) && c(i.get(n)), f && c(i.get(ue)), t) {
case "add":
a ? f && c(i.get("length")) : (c(i.get(J)), ee(e) && c(i.get(Ge)));
break;
case "delete":
a || (c(i.get(J)), ee(e) && c(i.get(Ge)));
break;
case "set":
ee(e) && c(i.get(J));
break;
}
}
ct();
}
function G(e) {
const t = h(e);
return t === e ? t : (v(t, "iterate", ue), D(e) ? t : t.map(x));
}
function at(e) {
return v(e = h(e), "iterate", ue), e;
}
const Vn = {
__proto__: null,
[Symbol.iterator]() {
return We(this, Symbol.iterator, x);
},
concat(...e) {
return G(this).concat(
...e.map((t) => m(t) ? G(t) : t)
);
},
entries() {
return We(this, "entries", (e) => (e[1] = x(e[1]), e));
},
every(e, t) {
return M(this, "every", e, t, void 0, arguments);
},
filter(e, t) {
return M(this, "filter", e, t, (n) => n.map(x), arguments);
},
find(e, t) {
return M(this, "find", e, t, x, arguments);
},
findIndex(e, t) {
return M(this, "findIndex", e, t, void 0, arguments);
},
findLast(e, t) {
return M(this, "findLast", e, t, x, arguments);
},
findLastIndex(e, t) {
return M(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 M(this, "forEach", e, t, void 0, arguments);
},
includes(...e) {
return Ke(this, "includes", e);
},
indexOf(...e) {
return Ke(this, "indexOf", e);
},
join(e) {
return G(this).join(e);
},
// keys() iterator only reads `length`, no optimisation required
lastIndexOf(...e) {
return Ke(this, "lastIndexOf", e);
},
map(e, t) {
return M(this, "map", e, t, void 0, arguments);
},
pop() {
return oe(this, "pop");
},
push(...e) {
return oe(this, "push", e);
},
reduce(e, ...t) {
return Et(this, "reduce", e, t);
},
reduceRight(e, ...t) {
return Et(this, "reduceRight", e, t);
},
shift() {
return oe(this, "shift");
},
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
some(e, t) {
return M(this, "some", e, t, void 0, arguments);
},
splice(...e) {
return oe(this, "splice", e);
},
toReversed() {
return G(this).toReversed();
},
toSorted(e) {
return G(this).toSorted(e);
},
toSpliced(...e) {
return G(this).toSpliced(...e);
},
unshift(...e) {
return oe(this, "unshift", e);
},
values() {
return We(this, "values", x);
}
};
function We(e, t, n) {
const s = at(e), r = s[t]();
return s !== e && !D(e) && (r._next = r.next, r.next = () => {
const o = r._next();
return o.value && (o.value = n(o.value)), o;
}), r;
}
const Rn = Array.prototype;
function M(e, t, n, s, r, o) {
const i = at(e), c = i !== e && !D(e), a = i[t];
if (a !== Rn[t]) {
const l = a.apply(e, o);
return c ? x(l) : l;
}
let f = n;
i !== e && (c ? f = function(l, u) {
return n.call(this, x(l), u, e);
} : n.length > 2 && (f = function(l, u) {
return n.call(this, l, u, e);
}));
const p = a.call(i, f, s);
return c && r ? r(p) : p;
}
function Et(e, t, n, s) {
const r = at(e);
let o = n;
return r !== e && (D(e) ? n.length > 3 && (o = function(i, c, a) {
return n.call(this, i, c, a, e);
}) : o = function(i, c, a) {
return n.call(this, i, x(c), a, e);
}), r[t](o, ...s);
}
function Ke(e, t, n) {
const s = h(e);
v(s, "iterate", ue);
const r = s[t](...n);
return (r === -1 || r === !1) && ye(n[0]) ? (n[0] = h(n[0]), s[t](...n)) : r;
}
function oe(e, t, n = []) {
Ae(), it();
const s = h(e)[t].apply(e, n);
return ct(), Me(), s;
}
const Cn = /* @__PURE__ */ an("__proto__,__v_isRef,__isVue"), At = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(pe)
);
function Tn(e) {
pe(e) || (e = String(e));
const t = h(this);
return v(t, "has", e), t.hasOwnProperty(e);
}
class Mt {
constructor(t = !1, n = !1) {
this._isReadonly = t, this._isShallow = n;
}
get(t, n, s) {
if (n === "__v_skip") return t.__v_skip;
const r = this._isReadonly, o = this._isShallow;
if (n === "__v_isReactive")
return !r;
if (n === "__v_isReadonly")
return r;
if (n === "__v_isShallow")
return o;
if (n === "__v_raw")
return s === (r ? o ? Wt : jt : o ? Kn : Ht).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(s) ? t : void 0;
const i = m(t);
if (!r) {
let a;
if (i && (a = Vn[n]))
return a;
if (n === "hasOwnProperty")
return Tn;
}
const c = 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
O(t) ? t : s
);
return (pe(n) ? At.has(n) : Cn(n)) || (r || v(t, "get", n), o) ? c : O(c) ? i && rt(n) ? c : c.value : y(c) ? r ? Lt(c) : Kt(c) : c;
}
}
class In extends Mt {
constructor(t = !1) {
super(!1, t);
}
set(t, n, s, r) {
let o = t[n];
if (!this._isShallow) {
const a = H(o);
if (!D(s) && !H(s) && (o = h(o), s = h(s)), !m(t) && O(o) && !O(s))
return a ? !1 : (o.value = s, !0);
}
const i = m(t) && rt(n) ? Number(n) < t.length : N(t, n), c = Reflect.set(
t,
n,
s,
O(t) ? t : r
);
return t === h(r) && (i ? L(s, o) && W(t, "set", n, s, o) : W(t, "add", n, s)), c;
}
deleteProperty(t, n) {
const s = N(t, n), r = t[n], o = Reflect.deleteProperty(t, n);
return o && s && W(t, "delete", n, void 0, r), o;
}
has(t, n) {
const s = Reflect.has(t, n);
return (!pe(n) || !At.has(n)) && v(t, "has", n), s;
}
ownKeys(t) {
return v(
t,
"iterate",
m(t) ? "length" : J
), Reflect.ownKeys(t);
}
}
class Ft extends Mt {
constructor(t = !1) {
super(!0, t);
}
set(t, n) {
return process.env.NODE_ENV !== "production" && U(
`Set operation on key "${String(n)}" failed: target is readonly.`,
t
), !0;
}
deleteProperty(t, n) {
return process.env.NODE_ENV !== "production" && U(
`Delete operation on key "${String(n)}" failed: target is readonly.`,
t
), !0;
}
}
const Pn = /* @__PURE__ */ new In(), $n = /* @__PURE__ */ new Ft(), An = /* @__PURE__ */ new Ft(!0), Qe = (e) => e, ge = (e) => Reflect.getPrototypeOf(e);
function Mn(e, t, n) {
return function(...s) {
const r = this.__v_raw, o = h(r), i = ee(o), c = e === "entries" || e === Symbol.iterator && i, a = e === "keys" && i, f = r[e](...s), p = n ? Qe : t ? Xe : x;
return !t && v(
o,
"iterate",
a ? Ge : J
), {
// iterator protocol
next() {
const { value: l, done: u } = f.next();
return u ? { value: l, done: u } : {
value: c ? [p(l[0]), p(l[1])] : p(l),
done: u
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function me(e) {
return function(...t) {
if (process.env.NODE_ENV !== "production") {
const n = t[0] ? `on key "${t[0]}" ` : "";
U(
`${Se(e)} operation ${n}failed: target is readonly.`,
h(this)
);
}
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function Fn(e, t) {
const n = {
get(r) {
const o = this.__v_raw, i = h(o), c = h(r);
e || (L(r, c) && v(i, "get", r), v(i, "get", c));
const { has: a } = ge(i), f = t ? Qe : e ? Xe : x;
if (a.call(i, r))
return f(o.get(r));
if (a.call(i, c))
return f(o.get(c));
o !== i && o.get(r);
},
get size() {
const r = this.__v_raw;
return !e && v(h(r), "iterate", J), Reflect.get(r, "size", r);
},
has(r) {
const o = this.__v_raw, i = h(o), c = h(r);
return e || (L(r, c) && v(i, "has", r), v(i, "has", c)), r === c ? o.has(r) : o.has(r) || o.has(c);
},
forEach(r, o) {
const i = this, c = i.__v_raw, a = h(c), f = t ? Qe : e ? Xe : x;
return !e && v(a, "iterate", J), c.forEach((p, l) => r.call(o, f(p), f(l), i));
}
};
return V(
n,
e ? {
add: me("add"),
set: me("set"),
delete: me("delete"),
clear: me("clear")
} : {
add(r) {
!t && !D(r) && !H(r) && (r = h(r));
const o = h(this);
return ge(o).has.call(o, r) || (o.add(r), W(o, "add", r, r)), this;
},
set(r, o) {
!t && !D(o) && !H(o) && (o = h(o));
const i = h(this), { has: c, get: a } = ge(i);
let f = c.call(i, r);
f ? process.env.NODE_ENV !== "production" && bt(i, c, r) : (r = h(r), f = c.call(i, r));
const p = a.call(i, r);
return i.set(r, o), f ? L(o, p) && W(i, "set", r, o, p) : W(i, "add", r, o), this;
},
delete(r) {
const o = h(this), { has: i, get: c } = ge(o);
let a = i.call(o, r);
a ? process.env.NODE_ENV !== "production" && bt(o, i, r) : (r = h(r), a = i.call(o, r));
const f = c ? c.call(o, r) : void 0, p = o.delete(r);
return a && W(o, "delete", r, void 0, f), p;
},
clear() {
const r = h(this), o = r.size !== 0, i = process.env.NODE_ENV !== "production" ? ee(r) ? new Map(r) : new Set(r) : void 0, c = r.clear();
return o && W(
r,
"clear",
void 0,
void 0,
i
), c;
}
}
), [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((r) => {
n[r] = Mn(r, e, t);
}), n;
}
function ut(e, t) {
const n = Fn(e, t);
return (s, r, o) => r === "__v_isReactive" ? !e : r === "__v_isReadonly" ? e : r === "__v_raw" ? s : Reflect.get(
N(n, r) && r in s ? n : s,
r,
o
);
}
const Hn = {
get: /* @__PURE__ */ ut(!1, !1)
}, jn = {
get: /* @__PURE__ */ ut(!0, !1)
}, Wn = {
get: /* @__PURE__ */ ut(!0, !0)
};
function bt(e, t, n) {
const s = h(n);
if (s !== n && t.call(e, s)) {
const r = Dt(e);
U(
`Reactive ${r} contains both the raw and reactive versions of the same object${r === "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 Ht = /* @__PURE__ */ new WeakMap(), Kn = /* @__PURE__ */ new WeakMap(), jt = /* @__PURE__ */ new WeakMap(), Wt = /* @__PURE__ */ new WeakMap();
function Ln(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function Un(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : Ln(Dt(e));
}
function Kt(e) {
return H(e) ? e : ft(
e,
!1,
Pn,
Hn,
Ht
);
}
function Lt(e) {
return ft(
e,
!0,
$n,
jn,
jt
);
}
function Ee(e) {
return ft(
e,
!0,
An,
Wn,
Wt
);
}
function ft(e, t, n, s, r) {
if (!y(e))
return process.env.NODE_ENV !== "production" && U(
`value cannot be made ${t ? "readonly" : "reactive"}: ${String(
e
)}`
), e;
if (e.__v_raw && !(t && e.__v_isReactive))
return e;
const o = r.get(e);
if (o)
return o;
const i = Un(e);
if (i === 0)
return e;
const c = new Proxy(
e,
i === 2 ? s : n
);
return r.set(e, c), c;
}
function te(e) {
return H(e) ? te(e.__v_raw) : !!(e && e.__v_isReactive);
}
function H(e) {
return !!(e && e.__v_isReadonly);
}
function D(e) {
return !!(e && e.__v_isShallow);
}
function ye(e) {
return e ? !!e.__v_raw : !1;
}
function h(e) {
const t = e && e.__v_raw;
return t ? h(t) : e;
}
function zn(e) {
return !N(e, "__v_skip") && Object.isExtensible(e) && En(e, "__v_skip", !0), e;
}
const x = (e) => y(e) ? Kt(e) : e, Xe = (e) => y(e) ? Lt(e) : e;
function O(e) {
return e ? e.__v_isRef === !0 : !1;
}
function Le(e) {
return Bn(e, !1);
}
function Bn(e, t) {
return O(e) ? e : new Jn(e, t);
}
class Jn {
constructor(t, n) {
this.dep = new Pt(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = n ? t : h(t), this._value = n ? t : x(t), this.__v_isShallow = n;
}
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 n = this._rawValue, s = this.__v_isShallow || D(t) || H(t);
t = s ? t : h(t), L(t, n) && (this._rawValue = t, this._value = s ? t : x(t), process.env.NODE_ENV !== "production" ? this.dep.trigger({
target: this,
type: "set",
key: "value",
newValue: t,
oldValue: n
}) : this.dep.trigger());
}
}
function Q(e) {
return O(e) ? e.value : e;
}
const Yn = {
get: (e, t, n) => t === "__v_raw" ? e : Q(Reflect.get(e, t, n)),
set: (e, t, n, s) => {
const r = e[t];
return O(r) && !O(n) ? (r.value = n, !0) : Reflect.set(e, t, n, s);
}
};
function qn(e) {
return te(e) ? e : new Proxy(e, Yn);
}
const be = {}, De = /* @__PURE__ */ new WeakMap();
let B;
function Gn(e, t = !1, n = B) {
if (n) {
let s = De.get(n);
s || De.set(n, s = []), s.push(e);
} else process.env.NODE_ENV !== "production" && !t && U(
"onWatcherCleanup() was called when there was no active watcher to associate with."
);
}
function Qn(e, t, n = T) {
const { immediate: s, deep: r, once: o, scheduler: i, augmentJob: c, call: a } = n, f = (_) => {
(n.onWarn || U)(
"Invalid watch source: ",
_,
"A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types."
);
}, p = (_) => r ? _ : D(_) || r === !1 || r === 0 ? K(_, 1) : K(_);
let l, u, d, b, R = !1, he = !1;
if (O(e) ? (u = () => e.value, R = D(e)) : te(e) ? (u = () => p(e), R = !0) : m(e) ? (he = !0, R = e.some((_) => te(_) || D(_)), u = () => e.map((_) => {
if (O(_))
return _.value;
if (te(_))
return p(_);
if (w(_))
return a ? a(_, 2) : _();
process.env.NODE_ENV !== "production" && f(_);
})) : w(e) ? t ? u = a ? () => a(e, 2) : e : u = () => {
if (d) {
Ae();
try {
d();
} finally {
Me();
}
}
const _ = B;
B = l;
try {
return a ? a(e, 3, [b]) : e(b);
} finally {
B = _;
}
} : (u = k, process.env.NODE_ENV !== "production" && f(e)), t && r) {
const _ = u, $ = r === !0 ? 1 / 0 : r;
u = () => K(_(), $);
}
const q = () => {
l.stop();
};
if (o && t) {
const _ = t;
t = (...$) => {
_(...$), q();
};
}
let z = he ? new Array(e.length).fill(be) : be;
const se = (_) => {
if (!(!(l.flags & 1) || !l.dirty && !_))
if (t) {
const $ = l.run();
if (r || R || (he ? $.some((He, _e) => L(He, z[_e])) : L($, z))) {
d && d();
const He = B;
B = l;
try {
const _e = [
$,
// pass undefined as the old value when it's changed for the first time
z === be ? void 0 : he && z[0] === be ? [] : z,
b
];
a ? a(t, 3, _e) : (
// @ts-expect-error
t(..._e)
), z = $;
} finally {
B = He;
}
}
} else
l.run();
};
return c && c(se), l = new On(u), l.scheduler = i ? () => i(se, !1) : se, b = (_) => Gn(_, !1, l), d = l.onStop = () => {
const _ = De.get(l);
if (_) {
if (a)
a(_, 4);
else
for (const $ of _) $();
De.delete(l);
}
}, process.env.NODE_ENV !== "production" && (l.onTrack = n.onTrack, l.onTrigger = n.onTrigger), t ? s ? se(!0) : z = l.run() : i ? i(se.bind(null, !0), !0) : l.run(), q.pause = l.pause.bind(l), q.resume = l.resume.bind(l), q.stop = q, q;
}
function K(e, t = 1 / 0, n) {
if (t <= 0 || !y(e) || e.__v_skip || (n = n || /* @__PURE__ */ new Set(), n.has(e)))
return e;
if (n.add(e), t--, O(e))
K(e.value, t, n);
else if (m(e))
for (let s = 0; s < e.length; s++)
K(e[s], t, n);
else if (dn(e) || ee(e))
e.forEach((s) => {
K(s, t, n);
});
else if (gn(e)) {
for (const s in e)
K(e[s], t, n);
for (const s of Object.getOwnPropertySymbols(e))
Object.prototype.propertyIsEnumerable.call(e, s) && K(e[s], t, n);
}
return e;
}
/**
* @vue/runtime-core v3.5.13
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
const Y = [];
function Xn(e) {
Y.push(e);
}
function Zn() {
Y.pop();
}
let Ue = !1;
function E(e, ...t) {
if (Ue) return;
Ue = !0, Ae();
const n = Y.length ? Y[Y.length - 1].component : null, s = n && n.appContext.config.warnHandler, r = kn();
if (s)
Fe(
s,
n,
11,
[
// eslint-disable-next-line no-restricted-syntax
e + t.map((o) => {
var i, c;
return (c = (i = o.toString) == null ? void 0 : i.call(o)) != null ? c : JSON.stringify(o);
}).join(""),
n && n.proxy,
r.map(
({ vnode: o }) => `at <${cn(n, o.type)}>`
).join(`
`),
r
]
);
else {
const o = [`[Vue warn]: ${e}`, ...t];
r.length && o.push(`
`, ...er(r)), console.warn(...o);
}
Me(), Ue = !1;
}
function kn() {
let e = Y[Y.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 s = e.component && e.component.parent;
e = s && s.vnode;
}
return t;
}
function er(e) {
const t = [];
return e.forEach((n, s) => {
t.push(...s === 0 ? [] : [`
`], ...tr(n));
}), t;
}
function tr({ vnode: e, recurseCount: t }) {
const n = t > 0 ? `... (${t} recursive calls)` : "", s = e.component ? e.component.parent == null : !1, r = ` at <${cn(
e.component,
e.type,
s
)}`, o = ">" + n;
return e.props ? [r, ...nr(e.props), o] : [r + o];
}
function nr(e) {
const t = [], n = Object.keys(e);
return n.slice(0, 3).forEach((s) => {
t.push(...Ut(s, e[s]));
}), n.length > 3 && t.push(" ..."), t;
}
function Ut(e, t, n) {
return A(t) ? (t = JSON.stringify(t), n ? t : [`${e}=${t}`]) : typeof t == "number" || typeof t == "boolean" || t == null ? n ? t : [`${e}=${t}`] : O(t) ? (t = Ut(e, h(t.value), !0), n ? t : [`${e}=Ref<`, t, ">"]) : w(t) ? [`${e}=fn${t.name ? `<${t.name}>` : ""}`] : (t = h(t), n ? t : [`${e}=`, t]);
}
const zt = {
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 Fe(e, t, n, s) {
try {
return s ? e(...s) : e();
} catch (r) {
pt(r, t, n);
}
}
function Bt(e, t, n, s) {
if (w(e)) {
const r = Fe(e, t, n, s);
return r && hn(r) && r.catch((o) => {
pt(o, t, n);
}), r;
}
if (m(e)) {
const r = [];
for (let o = 0; o < e.length; o++)
r.push(Bt(e[o], t, n, s));
return r;
} else process.env.NODE_ENV !== "production" && E(
`Invalid value type passed to callWithAsyncErrorHandling(): ${typeof e}`
);
}
function pt(e, t, n, s = !0) {
const r = t ? t.vnode : null, { errorHandler: o, throwUnhandledErrorInProduction: i } = t && t.appContext.config || T;
if (t) {
let c = t.parent;
const a = t.proxy, f = process.env.NODE_ENV !== "production" ? zt[n] : `https://vuejs.org/error-reference/#runtime-${n}`;
for (; c; ) {
const p = c.ec;
if (p) {
for (let l = 0; l < p.length; l++)
if (p[l](e, a, f) === !1)
return;
}
c = c.parent;
}
if (o) {
Ae(), Fe(o, null, 10, [
e,
a,
f
]), Me();
return;
}
}
rr(e, n, r, s, i);
}
function rr(e, t, n, s = !0, r = !1) {
if (process.env.NODE_ENV !== "production") {
const o = zt[t];
if (n && Xn(n), E(`Unhandled error${o ? ` during execution of ${o}` : ""}`), n && Zn(), s)
throw e;
console.error(e);
} else {
if (r)
throw e;
console.error(e);
}
}
const C = [];
let F = -1;
const ne = [];
let j = null, X = 0;
const Jt = /* @__PURE__ */ Promise.resolve();
let Ve = null;
const sr = 100;
function or(e) {
const t = Ve || Jt;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function ir(e) {
let t = F + 1, n = C.length;
for (; t < n; ) {
const s = t + n >>> 1, r = C[s], o = fe(r);
o < e || o === e && r.flags & 2 ? t = s + 1 : n = s;
}
return t;
}
function dt(e) {
if (!(e.flags & 1)) {
const t = fe(e), n = C[C.length - 1];
!n || // fast path when the job id is larger than the tail
!(e.flags & 2) && t >= fe(n) ? C.push(e) : C.splice(ir(t), 0, e), e.flags |= 1, Yt();
}
}
function Yt() {
Ve || (Ve = Jt.then(Gt));
}
function qt(e) {
m(e) ? ne.push(...e) : j && e.id === -1 ? j.splice(X + 1, 0, e) : e.flags & 1 || (ne.push(e), e.flags |= 1), Yt();
}
function cr(e) {
if (ne.length) {
const t = [...new Set(ne)].sort(
(n, s) => fe(n) - fe(s)
);
if (ne.length = 0, j) {
j.push(...t);
return;
}
for (j = t, process.env.NODE_ENV !== "production" && (e = e || /* @__PURE__ */ new Map()), X = 0; X < j.length; X++) {
const n = j[X];
process.env.NODE_ENV !== "production" && Qt(e, n) || (n.flags & 4 && (n.flags &= -2), n.flags & 8 || n(), n.flags &= -2);
}
j = null, X = 0;
}
}
const fe = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
function Gt(e) {
process.env.NODE_ENV !== "production" && (e = e || /* @__PURE__ */ new Map());
const t = process.env.NODE_ENV !== "production" ? (n) => Qt(e, n) : k;
try {
for (F = 0; F < C.length; F++) {
const n = C[F];
if (n && !(n.flags & 8)) {
if (process.env.NODE_ENV !== "production" && t(n))
continue;
n.flags & 4 && (n.flags &= -2), Fe(
n,
n.i,
n.i ? 15 : 14
), n.flags & 4 || (n.flags &= -2);
}
}
} finally {
for (; F < C.length; F++) {
const n = C[F];
n && (n.flags &= -2);
}
F = -1, C.length = 0, cr(e), Ve = null, (C.length || ne.length) && Gt(e);
}
}
function Qt(e, t) {
const n = e.get(t) || 0;
if (n > sr) {
const s = t.i, r = s && _t(s.type);
return pt(
`Maximum recursive updates exceeded${r ? ` in component <${r}>` : ""}. 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, n + 1), !1;
}
const ze = /* @__PURE__ */ new Map();
process.env.NODE_ENV !== "production" && ($e().__VUE_HMR_RUNTIME__ = {
createRecord: Be(lr),
rerender: Be(ar),
reload: Be(ur)
});
const Re = /* @__PURE__ */ new Map();
function lr(e, t) {
return Re.has(e) ? !1 : (Re.set(e, {
initialDef: Ce(t),
instances: /* @__PURE__ */ new Set()
}), !0);
}
function Ce(e) {
return ln(e) ? e.__vccOpts : e;
}
function ar(e, t) {
const n = Re.get(e);
n && (n.initialDef.render = t, [...n.instances].forEach((s) => {
t && (s.render = t, Ce(s.type).render = t), s.renderCache = [], s.update();
}));
}
function ur(e, t) {
const n = Re.get(e);
if (!n) return;
t = Ce(t), Nt(n.initialDef, t);
const s = [...n.instances];
for (let r = 0; r < s.length; r++) {
const o = s[r], i = Ce(o.type);
let c = ze.get(i);
c || (i !== n.initialDef && Nt(i, t), ze.set(i, c = /* @__PURE__ */ new Set())), c.add(o), o.appContext.propsCache.delete(o.type), o.appContext.emitsCache.delete(o.type), o.appContext.optionsCache.delete(o.type), o.ceReload ? (c.add(o), o.ceReload(t.styles), c.delete(o)) : o.parent ? dt(() => {
o.parent.update(), c.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(i);
}
qt(() => {
ze.clear();
});
}
function Nt(e, t) {
V(e, t);
for (const n in e)
n !== "__file" && !(n in t) && delete e[n];
}
function Be(e) {
return (t, n) => {
try {
return e(t, n);
} catch (s) {
console.error(s), console.warn(
"[HMR] Something went wrong during Vue component hot-reload. Full reload required."
);
}
};
}
let Z, Ne = [];
function Xt(e, t) {
var n, s;
Z = e, Z ? (Z.enabled = !0, Ne.forEach(({ event: r, args: o }) => Z.emit(r, ...o)), Ne = []) : /* 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
!((s = (n = window.navigator) == null ? void 0 : n.userAgent) != null && s.includes("jsdom")) ? ((t.__VUE_DEVTOOLS_HOOK_REPLAY__ = t.__VUE_DEVTOOLS_HOOK_REPLAY__ || []).push((o) => {
Xt(o, t);
}), setTimeout(() => {
Z || (t.__VUE_DEVTOOLS_HOOK_REPLAY__ = null, Ne = []);
}, 3e3)) : Ne = [];
}
let re = null, fr = null;
const pr = (e) => e.__isTeleport;
function Zt(e, t) {
e.shapeFlag & 6 && e.component ? (e.transition = t, Zt(e.component.subTree, t)) : e.shapeFlag & 128 ? (e.ssContent.transition = t.clone(e.ssContent), e.ssFallback.transition = t.clone(e.ssFallback)) : e.transition = t;
}
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function dr(e, t) {
return w(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.
V({ name: e.name }, t, { setup: e })
) : e;
}
$e().requestIdleCallback;
$e().cancelIdleCallback;
const hr = "components";
function _r(e, t) {
return mr(hr, e, !0, t) || e;
}
const gr = Symbol.for("v-ndc");
function mr(e, t, n = !0, s = !1) {
const r = de;
if (r) {
const o = r.type;
{
const c = _t(
o,
!1
);
if (c && (c === t || c === Oe(t) || c === Se(Oe(t))))
return o;
}
const i = (
// local registration
// check instance[type] first which is resolved for options API
wt(r[e] || o[e], t) || // global registration
wt(r.appContext[e], t)
);
return !i && s ? o : (process.env.NODE_ENV !== "production" && n && !i && E(`Failed to resolve ${e.slice(0, -1)}: ${t}
If this is a native custom element, make sure to exclude it from component resolution via compilerOptions.isCustomElement.`), i);
} else process.env.NODE_ENV !== "production" && E(
`resolve${Se(e.slice(0, -1))} can only be used in render() or setup().`
);
}
function wt(e, t) {
return e && (e[t] || e[Oe(t)] || e[Se(Oe(t))]);
}
const Ze = (e) => e ? zr(e) ? Br(e) : Ze(e.parent) : null, ae = (
// Move PURE marker to new line to workaround compiler discarding it
// due to type annotation
/* @__PURE__ */ V(/* @__PURE__ */ Object.create(null), {
$: (e) => e,
$el: (e) => e.vnode.el,
$data: (e) => e.data,
$props: (e) => process.env.NODE_ENV !== "production" ? Ee(e.props) : e.props,
$attrs: (e) => process.env.NODE_ENV !== "production" ? Ee(e.attrs) : e.attrs,
$slots: (e) => process.env.NODE_ENV !== "production" ? Ee(e.slots) : e.slots,
$refs: (e) => process.env.NODE_ENV !== "production" ? Ee(e.refs) : e.refs,
$parent: (e) => Ze(e.parent),
$root: (e) => Ze(e.root),
$host: (e) => e.ce,
$emit: (e) => e.emit,
$options: (e) => br(e),
$forceUpdate: (e) => e.f || (e.f = () => {
dt(e.update);
}),
$nextTick: (e) => e.n || (e.n = or.bind(e.proxy)),
$watch: (e) => Rr.bind(e)
})
), Je = (e, t) => e !== T && !e.__isScriptSetup && N(e, t), Er = {
get({ _: e }, t) {
if (t === "__v_skip")
return !0;
const { ctx: n, setupState: s, data: r, props: o, accessCache: i, type: c, appContext: a } = e;
if (process.env.NODE_ENV !== "production" && t === "__isVue")
return !0;
let f;
if (t[0] !== "$") {
const d = i[t];
if (d !== void 0)
switch (d) {
case 1:
return s[t];
case 2:
return r[t];
case 4:
return n[t];
case 3:
return o[t];
}
else {
if (Je(s, t))
return i[t] = 1, s[t];
if (r !== T && N(r, t))
return i[t] = 2, r[t];
if (
// only cache other properties when instance has declared (thus stable)
// props
(f = e.propsOptions[0]) && N(f, t)
)
return i[t] = 3, o[t];
if (n !== T && N(n, t))
return i[t] = 4, n[t];
i[t] = 0;
}
}
const p = ae[t];
let l, u;
if (p)
return t === "$attrs" ? (v(e.attrs, "get", ""), process.env.NODE_ENV !== "production" && void 0) : process.env.NODE_ENV !== "production" && t === "$slots" && v(e, "get", t), p(e);
if (
// css module (injected by vue-loader)
(l = c.__cssModules) && (l = l[t])
)
return l;
if (n !== T && N(n, t))
return i[t] = 4, n[t];
if (
// global properties
u = a.config.globalProperties, N(u, t)
)
return u[t];
process.env.NODE_ENV;
},
set({ _: e }, t, n) {
const { data: s, setupState: r, ctx: o } = e;
return Je(r, t) ? (r[t] = n, !0) : process.env.NODE_ENV !== "production" && r.__isScriptSetup && N(r, t) ? (E(`Cannot mutate <script setup> binding "${t}" from Options API.`), !1) : s !== T && N(s, t) ? (s[t] = n, !0) : N(e.props, t) ? (process.env.NODE_ENV !== "production" && E(`Attempting to mutate prop "${t}". Props are readonly.`), !1) : t[0] === "$" && t.slice(1) in e ? (process.env.NODE_ENV !== "production" && E(
`Attempting to mutate public property "${t}". Properties starting with $ are reserved and readonly.`
), !1) : (process.env.NODE_ENV !== "production" && t in e.appContext.config.globalProperties ? Object.defineProperty(o, t, {
enumerable: !0,
configurable: !0,
value: n
}) : o[t] = n, !0);
},
has({
_: { data: e, setupState: t, accessCache: n, ctx: s, appContext: r, propsOptions: o }
}, i) {
let c;
return !!n[i] || e !== T && N(e, i) || Je(t, i) || (c = o[0]) && N(c, i) || N(s, i) || N(ae, i) || N(r.config.globalProperties, i);
},
defineProperty(e, t, n) {
return n.get != null ? e._.accessCache[t] = 0 : N(n, "value") && this.set(e, t, n.value, null), Reflect.defineProperty(e, t, n);
}
};
process.env.NODE_ENV !== "production" && (Er.ownKeys = (e) => (E(
"Avoid app logic that relies on enumerating keys on a component instance. The keys will be empty in production mode to avoid performance overhead."
), Reflect.ownKeys(e)));
function vt(e) {
return m(e) ? e.reduce(
(t, n) => (t[n] = null, t),
{}
) : e;
}
function br(e) {
const t = e.type, { mixins: n, extends: s } = t, {
mixins: r,
optionsCache: o,
config: { optionMergeStrategies: i }
} = e.appContext, c = o.get(t);
let a;
return c ? a = c : !r.length && !n && !s ? a = t : (a = {}, r.length && r.forEach(
(f) => Te(a, f, i, !0)
), Te(a, t, i)), y(t) && o.set(t, a), a;
}
function Te(e, t, n, s = !1) {
const { mixins: r, extends: o } = t;
o && Te(e, o, n, !0), r && r.forEach(
(i) => Te(e, i, n, !0)
);
for (const i in t)
if (s && i === "expose")
process.env.NODE_ENV !== "production" && E(
'"expose" option is ignored when declared in mixins or extends. It should only be declared in the base component itself.'
);
else {
const c = Nr[i] || n && n[i];
e[i] = c ? c(e[i], t[i]) : t[i];
}
return e;
}
const Nr = {
data: Ot,
props: xt,
emits: xt,
// objects
methods: ie,
computed: ie,
// lifecycle
beforeCreate: S,
created: S,
beforeMount: S,
mounted: S,
beforeUpdate: S,
updated: S,
beforeDestroy: S,
beforeUnmount: S,
destroyed: S,
unmounted: S,
activated: S,
deactivated: S,
errorCaptured: S,
serverPrefetch: S,
// assets
components: ie,
directives: ie,
// watch
watch: vr,
// provide / inject
provide: Ot,
inject: wr
};
function Ot(e, t) {
return t ? e ? function() {
return V(
w(e) ? e.call(this, this) : e,
w(t) ? t.call(this, this) : t
);
} : t : e;
}
function wr(e, t) {
return ie(St(e), St(t));
}
function St(e) {
if (m(e)) {
const t = {};
for (let n = 0; n < e.length; n++)
t[e[n]] = e[n];
return t;
}
return e;
}
function S(e, t) {
return e ? [...new Set([].concat(e, t))] : t;
}
function ie(e, t) {
return e ? V(/* @__PURE__ */ Object.create(null), e, t) : t;
}
function xt(e, t) {
return e ? m(e) && m(t) ? [.../* @__PURE__ */ new Set([...e, ...t])] : V(
/* @__PURE__ */ Object.create(null),
vt(e),
vt(t ?? {})
) : t;
}
function vr(e, t) {
if (!e) return t;
if (!t) return e;
const n = V(/* @__PURE__ */ Object.create(null), e);
for (const s in t)
n[s] = S(e[s], t[s]);
return n;
}
let Or = null;
function Sr(e, t, n = !1) {
const s = de || re;
if (s || Or) {
const r = s ? s.parent == null ? s.vnode.appContext && s.vnode.appContext.provides : s.parent.provides : void 0;
if (r && e in r)
return r[e];
if (arguments.length > 1)
return n && w(t) ? t.call(s && s.proxy) : t;
process.env.NODE_ENV !== "production" && E(`injection "${String(e)}" not found.`);
} else process.env.NODE_ENV !== "production" && E("inject() can only be used inside setup() or functional components.");
}
const xr = {}, kt = (e) => Object.getPrototypeOf(e) === xr, yr = Ir, Dr = Symbol.for("v-scx"), Vr = () => {
{
const e = Sr(Dr);
return e || process.env.NODE_ENV !== "production" && E(
"Server rendering context not provided. Make sure to only call useSSRContext() conditionally in the server build."
), e;
}
};
function yt(e, t, n) {
return process.env.NODE_ENV !== "production" && !w(t) && E(
"`watch(fn, options?)` signature has been moved to a separate API. Use `watchEffect(fn, options?)` instead. `watch` now only supports `watch(source, cb, options?) signature."
), en(e, t, n);
}
function en(e, t, n = T) {
const { immediate: s, deep: r, flush: o, once: i } = n;
process.env.NODE_ENV !== "production" && !t && (s !== void 0 && E(
'watch() "immediate" option is only respected when using the watch(source, callback, options?) signature.'
), r !== void 0 && E(
'watch() "deep" option is only respected when using the watch(source, callback, options?) signature.'
), i !== void 0 && E(
'watch() "once" option is only respected when using the watch(source, callback, options?) signature.'
));
const c = V({}, n);
process.env.NODE_ENV !== "production" && (c.onWarn = E);
const a = t && s || !t && o !== "post";
let f;
if (nt) {
if (o === "sync") {
const d = Vr();
f = d.__watcherHandles || (d.__watcherHandles = []);
} else if (!a) {
const d = () => {
};
return d.stop = k, d.resume = k, d.pause = k, d;
}
}
const p = de;
c.call = (d, b, R) => Bt(d, p, b, R);
let l = !1;
o === "post" ? c.scheduler = (d) => {
yr(d, p && p.suspense);
} : o !== "sync" && (l = !0, c.scheduler = (d, b) => {
b ? d() : dt(d);
}), c.augmentJob = (d) => {
t && (d.flags |= 4), l && (d.flags |= 2, p && (d.id = p.uid, d.i = p));
};
const u = Qn(e, t, c);
return nt && (f ? f.push(u) : a && u()), u;
}
function Rr(e, t, n) {
const s = this.proxy, r = A(e) ? e.includes(".") ? Cr(s, e) : () => s[e] : e.bind(s, s);
let o;
w(t) ? o = t : (o = t.handler, n = t);
const i = Ur(this), c = en(r, o.bind(s), n);
return i(), c;
}
function Cr(e, t) {
const n = t.split(".");
return () => {
let s = e;
for (let r = 0; r < n.length && s; r++)
s = s[n[r]];
return s;
};
}
const Tr = (e) => e.__isSuspense;
function Ir(e, t) {
t && t.pendingBranch ? m(e) ? t.effects.push(...e) : t.effects.push(e) : qt(e);
}
const tn = Symbol.for("v-fgt"), Pr = Symbol.for("v-txt"), $r = Symbol.for("v-cmt"), we = [];
let I = null;
function Ar(e = !1) {
we.push(I = e ? null : []);
}
function Mr() {
we.pop(), I = we[we.length - 1] || null;
}
function Fr(e) {
return e.dynamicChildren = I || un, Mr(), I && I.push(e), e;
}
function Hr(e, t, n, s, r, o) {
return Fr(
rn(
e,
t,
n,
s,
r,
o,
!0
)
);
}
function jr(e) {
return e ? e.__v_isVNode === !0 : !1;
}
const Wr = (...e) => sn(
...e
), nn = ({ key: e }) => e ?? null, ve = ({
ref: e,
ref_key: t,
ref_for: n
}) => (typeof e == "number" && (e = "" + e), e != null ? A(e) || O(e) || w(e) ? { i: re, r: e, k: t, f: !!n } : e : null);
function rn(e, t = null, n = null, s = 0, r = null, o = e === tn ? 0 : 1, i = !1, c = !1) {
const a = {
__v_isVNode: !0,
__v_skip: !0,
type: e,
props: t,
key: t && nn(t),
ref: t && ve(t),
scopeId: fr,
slotScopeIds: null,
children: n,
component: null,
suspense: null,
ssContent: null,
ssFallback: null,
dirs: null,
transition: null,
el: null,
anchor: null,
target: null,
targetStart: null,
targetAnchor: null,
staticCount: 0,
shapeFlag: o,
patchFlag: s,
dynamicProps: r,
dynamicChildren: null,
appContext: null,
ctx: re
};
return c ? (ht(a, n), o & 128 && e.normalize(a)) : n && (a.shapeFlag |= A(n) ? 8 : 16), process.env.NODE_ENV !== "production" && a.key !== a.key && E("VNode created with invalid key (NaN). VNode type:", a.type), // avoid a block node from tracking itself
!i && // has current parent block
I && // presence of a patch flag indicates this node needs patching on updates.
// component nodes also should always be patched, because even if the
// component doesn't need to update, it needs to persist the instance on to
// the next vnode so that it can be properly unmounted later.
(a.patchFlag > 0 || o & 6) && // the EVENTS flag is only for hydration and if it is the only flag, the
// vnode should not be considered dynamic due to handler caching.
a.patchFlag !== 32 && I.push(a), a;
}
const ke = process.env.NODE_ENV !== "production" ? Wr : sn;
function sn(e, t = null, n = null, s = 0, r = null, o = !1) {
if ((!e || e === gr) && (process.env.NODE_ENV !== "production" && !e && E(`Invalid vnode type when creating vnode: ${e}.`), e = $r), jr(e)) {
const c = Ie(
e,
t,
!0
/* mergeRef: true */
);
return n && ht(c, n), !o && I && (c.shapeFlag & 6 ? I[I.indexOf(e)] = c : I.push(c)), c.patchFlag = -2, c;
}
if (ln(e) && (e = e.__vccOpts), t) {
t = Kr(t);
let { class: c, style: a } = t;
c && !A(c) && (t.class = ot(c)), y(a) && (ye(a) && !m(a) && (a = V({}, a)), t.style = st(a));
}
const i = A(e)