@fmidev/smartmet-alert-client
Version:
Web application for viewing weather and flood alerts
1,987 lines • 117 kB
JavaScript
/**
* @vue/shared v3.4.38
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function Hn(e, t) {
const n = new Set(e.split(","));
return t ? (s) => n.has(s.toLowerCase()) : (s) => n.has(s);
}
const X = {}, lt = [], Ee = () => {
}, uo = () => !1, Xt = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), $n = (e) => e.startsWith("onUpdate:"), ie = Object.assign, Dn = (e, t) => {
const n = e.indexOf(t);
n > -1 && e.splice(n, 1);
}, ao = Object.prototype.hasOwnProperty, $ = (e, t) => ao.call(e, t), N = Array.isArray, ct = (e) => Zt(e) === "[object Map]", Js = (e) => Zt(e) === "[object Set]", R = (e) => typeof e == "function", ee = (e) => typeof e == "string", qe = (e) => typeof e == "symbol", G = (e) => e !== null && typeof e == "object", Ys = (e) => (G(e) || R(e)) && R(e.then) && R(e.catch), Xs = Object.prototype.toString, Zt = (e) => Xs.call(e), ho = (e) => Zt(e).slice(8, -1), Zs = (e) => Zt(e) === "[object Object]", Vn = (e) => ee(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, yt = /* @__PURE__ */ Hn(
// the leading comma is intentional so empty string "" is also included
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), Qt = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return (n) => t[n] || (t[n] = e(n));
}, po = /-(\w)/g, _e = Qt((e) => e.replace(po, (t, n) => n ? n.toUpperCase() : "")), _o = /\B([A-Z])/g, be = Qt(
(e) => e.replace(_o, "-$1").toLowerCase()
), en = Qt((e) => e.charAt(0).toUpperCase() + e.slice(1)), dn = Qt((e) => e ? `on${en(e)}` : ""), We = (e, t) => !Object.is(e, t), hn = (e, ...t) => {
for (let n = 0; n < e.length; n++)
e[n](...t);
}, Qs = (e, t, n, s = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: s,
value: n
});
}, go = (e) => {
const t = parseFloat(e);
return isNaN(t) ? e : t;
}, xn = (e) => {
const t = ee(e) ? Number(e) : NaN;
return isNaN(t) ? e : t;
};
let us;
const Bn = () => us || (us = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
function Un(e) {
if (N(e)) {
const t = {};
for (let n = 0; n < e.length; n++) {
const s = e[n], r = ee(s) ? vo(s) : Un(s);
if (r)
for (const o in r)
t[o] = r[o];
}
return t;
} else if (ee(e) || G(e))
return e;
}
const mo = /;(?![^(]*\))/g, bo = /:([^]+)/, yo = /\/\*[^]*?\*\//g;
function vo(e) {
const t = {};
return e.replace(yo, "").split(mo).forEach((n) => {
if (n) {
const s = n.split(bo);
s.length > 1 && (t[s[0].trim()] = s[1].trim());
}
}), t;
}
function Kn(e) {
let t = "";
if (ee(e))
t = e;
else if (N(e))
for (let n = 0; n < e.length; n++) {
const s = Kn(e[n]);
s && (t += s + " ");
}
else if (G(e))
for (const n in e)
e[n] && (t += n + " ");
return t.trim();
}
const Co = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", Eo = /* @__PURE__ */ Hn(Co);
function er(e) {
return !!e || e === "";
}
const tr = (e) => !!(e && e.__v_isRef === !0), wo = (e) => ee(e) ? e : e == null ? "" : N(e) || G(e) && (e.toString === Xs || !R(e.toString)) ? tr(e) ? wo(e.value) : JSON.stringify(e, nr, 2) : String(e), nr = (e, t) => tr(t) ? nr(e, t.value) : ct(t) ? {
[`Map(${t.size})`]: [...t.entries()].reduce(
(n, [s, r], o) => (n[pn(s, o) + " =>"] = r, n),
{}
)
} : Js(t) ? {
[`Set(${t.size})`]: [...t.values()].map((n) => pn(n))
} : qe(t) ? pn(t) : G(t) && !N(t) && !Zs(t) ? String(t) : t, pn = (e, t = "") => {
var n;
return (
// Symbol.description in es2019+ so we need to cast here to pass
// the lib: es2016 check
qe(e) ? `Symbol(${(n = e.description) != null ? n : t})` : e
);
};
/**
* @vue/reactivity v3.4.38
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
let Se;
class xo {
constructor(t = !1) {
this.detached = t, this._active = !0, this.effects = [], this.cleanups = [], this.parent = Se, !t && Se && (this.index = (Se.scopes || (Se.scopes = [])).push(
this
) - 1);
}
get active() {
return this._active;
}
run(t) {
if (this._active) {
const n = Se;
try {
return Se = this, t();
} finally {
Se = n;
}
}
}
/**
* This should only be called on non-detached scopes
* @internal
*/
on() {
Se = this;
}
/**
* This should only be called on non-detached scopes
* @internal
*/
off() {
Se = this.parent;
}
stop(t) {
if (this._active) {
let n, s;
for (n = 0, s = this.effects.length; n < s; n++)
this.effects[n].stop();
for (n = 0, s = this.cleanups.length; n < s; n++)
this.cleanups[n]();
if (this.scopes)
for (n = 0, s = this.scopes.length; n < s; n++)
this.scopes[n].stop(!0);
if (!this.detached && this.parent && !t) {
const r = this.parent.scopes.pop();
r && r !== this && (this.parent.scopes[this.index] = r, r.index = this.index);
}
this.parent = void 0, this._active = !1;
}
}
}
function So(e, t = Se) {
t && t.active && t.effects.push(e);
}
function Ao() {
return Se;
}
let st;
class Wn {
constructor(t, n, s, r) {
this.fn = t, this.trigger = n, this.scheduler = s, this.active = !0, this.deps = [], this._dirtyLevel = 4, this._trackId = 0, this._runnings = 0, this._shouldSchedule = !1, this._depsLength = 0, So(this, r);
}
get dirty() {
if (this._dirtyLevel === 2 || this._dirtyLevel === 3) {
this._dirtyLevel = 1, ze();
for (let t = 0; t < this._depsLength; t++) {
const n = this.deps[t];
if (n.computed && (To(n.computed), this._dirtyLevel >= 4))
break;
}
this._dirtyLevel === 1 && (this._dirtyLevel = 0), Ge();
}
return this._dirtyLevel >= 4;
}
set dirty(t) {
this._dirtyLevel = t ? 4 : 0;
}
run() {
if (this._dirtyLevel = 0, !this.active)
return this.fn();
let t = Ue, n = st;
try {
return Ue = !0, st = this, this._runnings++, as(this), this.fn();
} finally {
ds(this), this._runnings--, st = n, Ue = t;
}
}
stop() {
this.active && (as(this), ds(this), this.onStop && this.onStop(), this.active = !1);
}
}
function To(e) {
return e.value;
}
function as(e) {
e._trackId++, e._depsLength = 0;
}
function ds(e) {
if (e.deps.length > e._depsLength) {
for (let t = e._depsLength; t < e.deps.length; t++)
sr(e.deps[t], e);
e.deps.length = e._depsLength;
}
}
function sr(e, t) {
const n = e.get(t);
n !== void 0 && t._trackId !== n && (e.delete(t), e.size === 0 && e.cleanup());
}
let Ue = !0, Sn = 0;
const rr = [];
function ze() {
rr.push(Ue), Ue = !1;
}
function Ge() {
const e = rr.pop();
Ue = e === void 0 ? !0 : e;
}
function kn() {
Sn++;
}
function qn() {
for (Sn--; !Sn && An.length; )
An.shift()();
}
function or(e, t, n) {
if (t.get(e) !== e._trackId) {
t.set(e, e._trackId);
const s = e.deps[e._depsLength];
s !== t ? (s && sr(s, e), e.deps[e._depsLength++] = t) : e._depsLength++;
}
}
const An = [];
function ir(e, t, n) {
kn();
for (const s of e.keys()) {
let r;
s._dirtyLevel < t && (r ?? (r = e.get(s) === s._trackId)) && (s._shouldSchedule || (s._shouldSchedule = s._dirtyLevel === 0), s._dirtyLevel = t), s._shouldSchedule && (r ?? (r = e.get(s) === s._trackId)) && (s.trigger(), (!s._runnings || s.allowRecurse) && s._dirtyLevel !== 2 && (s._shouldSchedule = !1, s.scheduler && An.push(s.scheduler)));
}
qn();
}
const lr = (e, t) => {
const n = /* @__PURE__ */ new Map();
return n.cleanup = e, n.computed = t, n;
}, Kt = /* @__PURE__ */ new WeakMap(), rt = Symbol(""), Tn = Symbol("");
function ge(e, t, n) {
if (Ue && st) {
let s = Kt.get(e);
s || Kt.set(e, s = /* @__PURE__ */ new Map());
let r = s.get(n);
r || s.set(n, r = lr(() => s.delete(n))), or(
st,
r
);
}
}
function Ie(e, t, n, s, r, o) {
const i = Kt.get(e);
if (!i)
return;
let c = [];
if (t === "clear")
c = [...i.values()];
else if (n === "length" && N(e)) {
const f = Number(s);
i.forEach((d, a) => {
(a === "length" || !qe(a) && a >= f) && c.push(d);
});
} else
switch (n !== void 0 && c.push(i.get(n)), t) {
case "add":
N(e) ? Vn(n) && c.push(i.get("length")) : (c.push(i.get(rt)), ct(e) && c.push(i.get(Tn)));
break;
case "delete":
N(e) || (c.push(i.get(rt)), ct(e) && c.push(i.get(Tn)));
break;
case "set":
ct(e) && c.push(i.get(rt));
break;
}
kn();
for (const f of c)
f && ir(
f,
4
);
qn();
}
function Oo(e, t) {
const n = Kt.get(e);
return n && n.get(t);
}
const No = /* @__PURE__ */ Hn("__proto__,__v_isRef,__isVue"), cr = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(qe)
), hs = /* @__PURE__ */ Po();
function Po() {
const e = {};
return ["includes", "indexOf", "lastIndexOf"].forEach((t) => {
e[t] = function(...n) {
const s = D(this);
for (let o = 0, i = this.length; o < i; o++)
ge(s, "get", o + "");
const r = s[t](...n);
return r === -1 || r === !1 ? s[t](...n.map(D)) : r;
};
}), ["push", "pop", "shift", "unshift", "splice"].forEach((t) => {
e[t] = function(...n) {
ze(), kn();
const s = D(this)[t].apply(this, n);
return qn(), Ge(), s;
};
}), e;
}
function Ro(e) {
qe(e) || (e = String(e));
const t = D(this);
return ge(t, "has", e), t.hasOwnProperty(e);
}
class fr {
constructor(t = !1, n = !1) {
this._isReadonly = t, this._isShallow = n;
}
get(t, n, s) {
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 ? Wo : hr : o ? dr : ar).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 = N(t);
if (!r) {
if (i && $(hs, n))
return Reflect.get(hs, n, s);
if (n === "hasOwnProperty")
return Ro;
}
const c = Reflect.get(t, n, s);
return (qe(n) ? cr.has(n) : No(n)) || (r || ge(t, "get", n), o) ? c : ue(c) ? i && Vn(n) ? c : c.value : G(c) ? r ? pr(c) : Jn(c) : c;
}
}
class ur extends fr {
constructor(t = !1) {
super(!1, t);
}
set(t, n, s, r) {
let o = t[n];
if (!this._isShallow) {
const f = ot(o);
if (!at(s) && !ot(s) && (o = D(o), s = D(s)), !N(t) && ue(o) && !ue(s))
return f ? !1 : (o.value = s, !0);
}
const i = N(t) && Vn(n) ? Number(n) < t.length : $(t, n), c = Reflect.set(t, n, s, r);
return t === D(r) && (i ? We(s, o) && Ie(t, "set", n, s) : Ie(t, "add", n, s)), c;
}
deleteProperty(t, n) {
const s = $(t, n);
t[n];
const r = Reflect.deleteProperty(t, n);
return r && s && Ie(t, "delete", n, void 0), r;
}
has(t, n) {
const s = Reflect.has(t, n);
return (!qe(n) || !cr.has(n)) && ge(t, "has", n), s;
}
ownKeys(t) {
return ge(
t,
"iterate",
N(t) ? "length" : rt
), Reflect.ownKeys(t);
}
}
class Io extends fr {
constructor(t = !1) {
super(!0, t);
}
set(t, n) {
return !0;
}
deleteProperty(t, n) {
return !0;
}
}
const Mo = /* @__PURE__ */ new ur(), Lo = /* @__PURE__ */ new Io(), Fo = /* @__PURE__ */ new ur(
!0
);
const zn = (e) => e, tn = (e) => Reflect.getPrototypeOf(e);
function It(e, t, n = !1, s = !1) {
e = e.__v_raw;
const r = D(e), o = D(t);
n || (We(t, o) && ge(r, "get", t), ge(r, "get", o));
const { has: i } = tn(r), c = s ? zn : n ? Xn : xt;
if (i.call(r, t))
return c(e.get(t));
if (i.call(r, o))
return c(e.get(o));
e !== r && e.get(t);
}
function Mt(e, t = !1) {
const n = this.__v_raw, s = D(n), r = D(e);
return t || (We(e, r) && ge(s, "has", e), ge(s, "has", r)), e === r ? n.has(e) : n.has(e) || n.has(r);
}
function Lt(e, t = !1) {
return e = e.__v_raw, !t && ge(D(e), "iterate", rt), Reflect.get(e, "size", e);
}
function ps(e, t = !1) {
!t && !at(e) && !ot(e) && (e = D(e));
const n = D(this);
return tn(n).has.call(n, e) || (n.add(e), Ie(n, "add", e, e)), this;
}
function _s(e, t, n = !1) {
!n && !at(t) && !ot(t) && (t = D(t));
const s = D(this), { has: r, get: o } = tn(s);
let i = r.call(s, e);
i || (e = D(e), i = r.call(s, e));
const c = o.call(s, e);
return s.set(e, t), i ? We(t, c) && Ie(s, "set", e, t) : Ie(s, "add", e, t), this;
}
function gs(e) {
const t = D(this), { has: n, get: s } = tn(t);
let r = n.call(t, e);
r || (e = D(e), r = n.call(t, e)), s && s.call(t, e);
const o = t.delete(e);
return r && Ie(t, "delete", e, void 0), o;
}
function ms() {
const e = D(this), t = e.size !== 0, n = e.clear();
return t && Ie(e, "clear", void 0, void 0), n;
}
function Ft(e, t) {
return function(s, r) {
const o = this, i = o.__v_raw, c = D(i), f = t ? zn : e ? Xn : xt;
return !e && ge(c, "iterate", rt), i.forEach((d, a) => s.call(r, f(d), f(a), o));
};
}
function jt(e, t, n) {
return function(...s) {
const r = this.__v_raw, o = D(r), i = ct(o), c = e === "entries" || e === Symbol.iterator && i, f = e === "keys" && i, d = r[e](...s), a = n ? zn : t ? Xn : xt;
return !t && ge(
o,
"iterate",
f ? Tn : rt
), {
// iterator protocol
next() {
const { value: p, done: y } = d.next();
return y ? { value: p, done: y } : {
value: c ? [a(p[0]), a(p[1])] : a(p),
done: y
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function Le(e) {
return function(...t) {
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function jo() {
const e = {
get(o) {
return It(this, o);
},
get size() {
return Lt(this);
},
has: Mt,
add: ps,
set: _s,
delete: gs,
clear: ms,
forEach: Ft(!1, !1)
}, t = {
get(o) {
return It(this, o, !1, !0);
},
get size() {
return Lt(this);
},
has: Mt,
add(o) {
return ps.call(this, o, !0);
},
set(o, i) {
return _s.call(this, o, i, !0);
},
delete: gs,
clear: ms,
forEach: Ft(!1, !0)
}, n = {
get(o) {
return It(this, o, !0);
},
get size() {
return Lt(this, !0);
},
has(o) {
return Mt.call(this, o, !0);
},
add: Le("add"),
set: Le("set"),
delete: Le("delete"),
clear: Le("clear"),
forEach: Ft(!0, !1)
}, s = {
get(o) {
return It(this, o, !0, !0);
},
get size() {
return Lt(this, !0);
},
has(o) {
return Mt.call(this, o, !0);
},
add: Le("add"),
set: Le("set"),
delete: Le("delete"),
clear: Le("clear"),
forEach: Ft(!0, !0)
};
return [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((o) => {
e[o] = jt(o, !1, !1), n[o] = jt(o, !0, !1), t[o] = jt(o, !1, !0), s[o] = jt(
o,
!0,
!0
);
}), [
e,
n,
t,
s
];
}
const [
Ho,
$o,
Do,
Vo
] = /* @__PURE__ */ jo();
function Gn(e, t) {
const n = t ? e ? Vo : Do : e ? $o : Ho;
return (s, r, o) => r === "__v_isReactive" ? !e : r === "__v_isReadonly" ? e : r === "__v_raw" ? s : Reflect.get(
$(n, r) && r in s ? n : s,
r,
o
);
}
const Bo = {
get: /* @__PURE__ */ Gn(!1, !1)
}, Uo = {
get: /* @__PURE__ */ Gn(!1, !0)
}, Ko = {
get: /* @__PURE__ */ Gn(!0, !1)
};
const ar = /* @__PURE__ */ new WeakMap(), dr = /* @__PURE__ */ new WeakMap(), hr = /* @__PURE__ */ new WeakMap(), Wo = /* @__PURE__ */ new WeakMap();
function ko(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function qo(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : ko(ho(e));
}
function Jn(e) {
return ot(e) ? e : Yn(
e,
!1,
Mo,
Bo,
ar
);
}
function zo(e) {
return Yn(
e,
!1,
Fo,
Uo,
dr
);
}
function pr(e) {
return Yn(
e,
!0,
Lo,
Ko,
hr
);
}
function Yn(e, t, n, s, r) {
if (!G(e) || e.__v_raw && !(t && e.__v_isReactive))
return e;
const o = r.get(e);
if (o)
return o;
const i = qo(e);
if (i === 0)
return e;
const c = new Proxy(
e,
i === 2 ? s : n
);
return r.set(e, c), c;
}
function vt(e) {
return ot(e) ? vt(e.__v_raw) : !!(e && e.__v_isReactive);
}
function ot(e) {
return !!(e && e.__v_isReadonly);
}
function at(e) {
return !!(e && e.__v_isShallow);
}
function _r(e) {
return e ? !!e.__v_raw : !1;
}
function D(e) {
const t = e && e.__v_raw;
return t ? D(t) : e;
}
function Go(e) {
return Object.isExtensible(e) && Qs(e, "__v_skip", !0), e;
}
const xt = (e) => G(e) ? Jn(e) : e, Xn = (e) => G(e) ? pr(e) : e;
class gr {
constructor(t, n, s, r) {
this.getter = t, this._setter = n, this.dep = void 0, this.__v_isRef = !0, this.__v_isReadonly = !1, this.effect = new Wn(
() => t(this._value),
() => Dt(
this,
this.effect._dirtyLevel === 2 ? 2 : 3
)
), this.effect.computed = this, this.effect.active = this._cacheable = !r, this.__v_isReadonly = s;
}
get value() {
const t = D(this);
return (!t._cacheable || t.effect.dirty) && We(t._value, t._value = t.effect.run()) && Dt(t, 4), mr(t), t.effect._dirtyLevel >= 2 && Dt(t, 2), t._value;
}
set value(t) {
this._setter(t);
}
// #region polyfill _dirty for backward compatibility third party code for Vue <= 3.3.x
get _dirty() {
return this.effect.dirty;
}
set _dirty(t) {
this.effect.dirty = t;
}
// #endregion
}
function Jo(e, t, n = !1) {
let s, r;
const o = R(e);
return o ? (s = e, r = Ee) : (s = e.get, r = e.set), new gr(s, r, o || !r, n);
}
function mr(e) {
var t;
Ue && st && (e = D(e), or(
st,
(t = e.dep) != null ? t : e.dep = lr(
() => e.dep = void 0,
e instanceof gr ? e : void 0
)
));
}
function Dt(e, t = 4, n, s) {
e = D(e);
const r = e.dep;
r && ir(
r,
t
);
}
function ue(e) {
return !!(e && e.__v_isRef === !0);
}
function Yo(e) {
return Xo(e, !1);
}
function Xo(e, t) {
return ue(e) ? e : new Zo(e, t);
}
class Zo {
constructor(t, n) {
this.__v_isShallow = n, this.dep = void 0, this.__v_isRef = !0, this._rawValue = n ? t : D(t), this._value = n ? t : xt(t);
}
get value() {
return mr(this), this._value;
}
set value(t) {
const n = this.__v_isShallow || at(t) || ot(t);
t = n ? t : D(t), We(t, this._rawValue) && (this._rawValue, this._rawValue = t, this._value = n ? t : xt(t), Dt(this, 4));
}
}
function Qo(e) {
return ue(e) ? e.value : e;
}
const ei = {
get: (e, t, n) => Qo(Reflect.get(e, t, n)),
set: (e, t, n, s) => {
const r = e[t];
return ue(r) && !ue(n) ? (r.value = n, !0) : Reflect.set(e, t, n, s);
}
};
function br(e) {
return vt(e) ? e : new Proxy(e, ei);
}
class ti {
constructor(t, n, s) {
this._object = t, this._key = n, this._defaultValue = s, this.__v_isRef = !0;
}
get value() {
const t = this._object[this._key];
return t === void 0 ? this._defaultValue : t;
}
set value(t) {
this._object[this._key] = t;
}
get dep() {
return Oo(D(this._object), this._key);
}
}
class ni {
constructor(t) {
this._getter = t, this.__v_isRef = !0, this.__v_isReadonly = !0;
}
get value() {
return this._getter();
}
}
function fc(e, t, n) {
return ue(e) ? e : R(e) ? new ni(e) : G(e) && arguments.length > 1 ? si(e, t, n) : Yo(e);
}
function si(e, t, n) {
const s = e[t];
return ue(s) ? s : new ti(e, t, n);
}
/**
* @vue/runtime-core v3.4.38
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
function Ke(e, t, n, s) {
try {
return s ? e(...s) : e();
} catch (r) {
nn(r, t, n);
}
}
function we(e, t, n, s) {
if (R(e)) {
const r = Ke(e, t, n, s);
return r && Ys(r) && r.catch((o) => {
nn(o, t, n);
}), r;
}
if (N(e)) {
const r = [];
for (let o = 0; o < e.length; o++)
r.push(we(e[o], t, n, s));
return r;
}
}
function nn(e, t, n, s = !0) {
const r = t ? t.vnode : null;
if (t) {
let o = t.parent;
const i = t.proxy, c = `https://vuejs.org/error-reference/#runtime-${n}`;
for (; o; ) {
const d = o.ec;
if (d) {
for (let a = 0; a < d.length; a++)
if (d[a](e, i, c) === !1)
return;
}
o = o.parent;
}
const f = t.appContext.config.errorHandler;
if (f) {
ze(), Ke(
f,
null,
10,
[e, i, c]
), Ge();
return;
}
}
ri(e, n, r, s);
}
function ri(e, t, n, s = !0) {
console.error(e);
}
let St = !1, On = !1;
const ce = [];
let Pe = 0;
const ft = [];
let $e = null, tt = 0;
const yr = /* @__PURE__ */ Promise.resolve();
let Zn = null;
function Qn(e) {
const t = Zn || yr;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function oi(e) {
let t = Pe + 1, n = ce.length;
for (; t < n; ) {
const s = t + n >>> 1, r = ce[s], o = At(r);
o < e || o === e && r.pre ? t = s + 1 : n = s;
}
return t;
}
function es(e) {
(!ce.length || !ce.includes(
e,
St && e.allowRecurse ? Pe + 1 : Pe
)) && (e.id == null ? ce.push(e) : ce.splice(oi(e.id), 0, e), vr());
}
function vr() {
!St && !On && (On = !0, Zn = yr.then(Er));
}
function ii(e) {
const t = ce.indexOf(e);
t > Pe && ce.splice(t, 1);
}
function li(e) {
N(e) ? ft.push(...e) : (!$e || !$e.includes(
e,
e.allowRecurse ? tt + 1 : tt
)) && ft.push(e), vr();
}
function bs(e, t, n = St ? Pe + 1 : 0) {
for (; n < ce.length; n++) {
const s = ce[n];
if (s && s.pre) {
if (e && s.id !== e.uid)
continue;
ce.splice(n, 1), n--, s();
}
}
}
function Cr(e) {
if (ft.length) {
const t = [...new Set(ft)].sort(
(n, s) => At(n) - At(s)
);
if (ft.length = 0, $e) {
$e.push(...t);
return;
}
for ($e = t, tt = 0; tt < $e.length; tt++) {
const n = $e[tt];
n.active !== !1 && n();
}
$e = null, tt = 0;
}
}
const At = (e) => e.id == null ? 1 / 0 : e.id, ci = (e, t) => {
const n = At(e) - At(t);
if (n === 0) {
if (e.pre && !t.pre) return -1;
if (t.pre && !e.pre) return 1;
}
return n;
};
function Er(e) {
On = !1, St = !0, ce.sort(ci);
try {
for (Pe = 0; Pe < ce.length; Pe++) {
const t = ce[Pe];
t && t.active !== !1 && Ke(
t,
t.i,
t.i ? 15 : 14
);
}
} finally {
Pe = 0, ce.length = 0, Cr(), St = !1, Zn = null, (ce.length || ft.length) && Er();
}
}
let se = null, sn = null;
function Wt(e) {
const t = se;
return se = e, sn = e && e.type.__scopeId || null, t;
}
function uc(e) {
sn = e;
}
function ac() {
sn = null;
}
function fi(e, t = se, n) {
if (!t || e._n)
return e;
const s = (...r) => {
s._d && Ns(-1);
const o = Wt(t);
let i;
try {
i = e(...r);
} finally {
Wt(o), s._d && Ns(1);
}
return i;
};
return s._n = !0, s._c = !0, s._d = !0, s;
}
function dc(e, t) {
if (se === null)
return e;
const n = un(se), s = e.dirs || (e.dirs = []);
for (let r = 0; r < t.length; r++) {
let [o, i, c, f = X] = t[r];
o && (R(o) && (o = {
mounted: o,
updated: o
}), o.deep && Be(i), s.push({
dir: o,
instance: n,
value: i,
oldValue: void 0,
arg: c,
modifiers: f
}));
}
return e;
}
function Xe(e, t, n, s) {
const r = e.dirs, o = t && t.dirs;
for (let i = 0; i < r.length; i++) {
const c = r[i];
o && (c.oldValue = o[i].value);
let f = c.dir[s];
f && (ze(), we(f, n, 8, [
e.el,
c,
e,
t
]), Ge());
}
}
const De = Symbol("_leaveCb"), Ht = Symbol("_enterCb");
function ui() {
const e = {
isMounted: !1,
isLeaving: !1,
isUnmounting: !1,
leavingVNodes: /* @__PURE__ */ new Map()
};
return Nr(() => {
e.isMounted = !0;
}), Pr(() => {
e.isUnmounting = !0;
}), e;
}
const ve = [Function, Array], wr = {
mode: String,
appear: Boolean,
persisted: Boolean,
// enter
onBeforeEnter: ve,
onEnter: ve,
onAfterEnter: ve,
onEnterCancelled: ve,
// leave
onBeforeLeave: ve,
onLeave: ve,
onAfterLeave: ve,
onLeaveCancelled: ve,
// appear
onBeforeAppear: ve,
onAppear: ve,
onAfterAppear: ve,
onAppearCancelled: ve
}, xr = (e) => {
const t = e.subTree;
return t.component ? xr(t.component) : t;
}, ai = {
name: "BaseTransition",
props: wr,
setup(e, { slots: t }) {
const n = hl(), s = ui();
return () => {
const r = t.default && Ar(t.default(), !0);
if (!r || !r.length)
return;
let o = r[0];
if (r.length > 1) {
for (const y of r)
if (y.type !== pe) {
o = y;
break;
}
}
const i = D(e), { mode: c } = i;
if (s.isLeaving)
return _n(o);
const f = ys(o);
if (!f)
return _n(o);
let d = Nn(
f,
i,
s,
n,
// #11061, ensure enterHooks is fresh after clone
(y) => d = y
);
kt(f, d);
const a = n.subTree, p = a && ys(a);
if (p && p.type !== pe && !nt(f, p) && xr(n).type !== pe) {
const y = Nn(
p,
i,
s,
n
);
if (kt(p, y), c === "out-in" && f.type !== pe)
return s.isLeaving = !0, y.afterLeave = () => {
s.isLeaving = !1, n.update.active !== !1 && (n.effect.dirty = !0, n.update());
}, _n(o);
c === "in-out" && f.type !== pe && (y.delayLeave = (S, I, L) => {
const Y = Sr(
s,
p
);
Y[String(p.key)] = p, S[De] = () => {
I(), S[De] = void 0, delete d.delayedLeave;
}, d.delayedLeave = L;
});
}
return o;
};
}
}, di = ai;
function Sr(e, t) {
const { leavingVNodes: n } = e;
let s = n.get(t.type);
return s || (s = /* @__PURE__ */ Object.create(null), n.set(t.type, s)), s;
}
function Nn(e, t, n, s, r) {
const {
appear: o,
mode: i,
persisted: c = !1,
onBeforeEnter: f,
onEnter: d,
onAfterEnter: a,
onEnterCancelled: p,
onBeforeLeave: y,
onLeave: S,
onAfterLeave: I,
onLeaveCancelled: L,
onBeforeAppear: Y,
onAppear: V,
onAfterAppear: W,
onAppearCancelled: j
} = t, k = String(e.key), q = Sr(n, e), P = (O, F) => {
O && we(
O,
s,
9,
F
);
}, le = (O, F) => {
const U = F[1];
P(O, F), N(O) ? O.every((x) => x.length <= 1) && U() : O.length <= 1 && U();
}, te = {
mode: i,
persisted: c,
beforeEnter(O) {
let F = f;
if (!n.isMounted)
if (o)
F = Y || f;
else
return;
O[De] && O[De](
!0
/* cancelled */
);
const U = q[k];
U && nt(e, U) && U.el[De] && U.el[De](), P(F, [O]);
},
enter(O) {
let F = d, U = a, x = p;
if (!n.isMounted)
if (o)
F = V || d, U = W || a, x = j || p;
else
return;
let K = !1;
const Q = O[Ht] = (re) => {
K || (K = !0, re ? P(x, [O]) : P(U, [O]), te.delayedLeave && te.delayedLeave(), O[Ht] = void 0);
};
F ? le(F, [O, Q]) : Q();
},
leave(O, F) {
const U = String(e.key);
if (O[Ht] && O[Ht](
!0
/* cancelled */
), n.isUnmounting)
return F();
P(y, [O]);
let x = !1;
const K = O[De] = (Q) => {
x || (x = !0, F(), Q ? P(L, [O]) : P(I, [O]), O[De] = void 0, q[U] === e && delete q[U]);
};
q[U] = e, S ? le(S, [O, K]) : K();
},
clone(O) {
const F = Nn(
O,
t,
n,
s,
r
);
return r && r(F), F;
}
};
return te;
}
function _n(e) {
if (rn(e))
return e = ke(e), e.children = null, e;
}
function ys(e) {
if (!rn(e))
return e;
const { shapeFlag: t, children: n } = e;
if (n) {
if (t & 16)
return n[0];
if (t & 32 && R(n.default))
return n.default();
}
}
function kt(e, t) {
e.shapeFlag & 6 && e.component ? kt(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 Ar(e, t = !1, n) {
let s = [], r = 0;
for (let o = 0; o < e.length; o++) {
let i = e[o];
const c = n == null ? i.key : String(n) + String(i.key != null ? i.key : o);
i.type === Ce ? (i.patchFlag & 128 && r++, s = s.concat(
Ar(i.children, t, c)
)) : (t || i.type !== pe) && s.push(c != null ? ke(i, { key: c }) : i);
}
if (r > 1)
for (let o = 0; o < s.length; o++)
s[o].patchFlag = -2;
return s;
}
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function Tr(e, t) {
return R(e) ? (
// #8326: extend call and options.name access are considered side-effects
// by Rollup, so we have to wrap it in a pure-annotated IIFE.
ie({ name: e.name }, t, { setup: e })
) : e;
}
const Ct = (e) => !!e.type.__asyncLoader, rn = (e) => e.type.__isKeepAlive;
function hi(e, t) {
Or(e, "a", t);
}
function pi(e, t) {
Or(e, "da", t);
}
function Or(e, t, n = oe) {
const s = e.__wdc || (e.__wdc = () => {
let r = n;
for (; r; ) {
if (r.isDeactivated)
return;
r = r.parent;
}
return e();
});
if (on(t, s, n), n) {
let r = n.parent;
for (; r && r.parent; )
rn(r.parent.vnode) && _i(s, t, n, r), r = r.parent;
}
}
function _i(e, t, n, s) {
const r = on(
t,
e,
s,
!0
/* prepend */
);
Rr(() => {
Dn(s[t], r);
}, n);
}
function on(e, t, n = oe, s = !1) {
if (n) {
const r = n[e] || (n[e] = []), o = t.__weh || (t.__weh = (...i) => {
ze();
const c = Nt(n), f = we(t, n, e, i);
return c(), Ge(), f;
});
return s ? r.unshift(o) : r.push(o), o;
}
}
const Me = (e) => (t, n = oe) => {
(!fn || e === "sp") && on(e, (...s) => t(...s), n);
}, gi = Me("bm"), Nr = Me("m"), mi = Me("bu"), bi = Me("u"), Pr = Me("bum"), Rr = Me("um"), yi = Me("sp"), vi = Me(
"rtg"
), Ci = Me(
"rtc"
);
function Ei(e, t = oe) {
on("ec", e, t);
}
const wi = "components";
function hc(e, t) {
return Si(wi, e, !0, t) || e;
}
const xi = Symbol.for("v-ndc");
function Si(e, t, n = !0, s = !1) {
const r = se || oe;
if (r) {
const o = r.type;
{
const c = bl(
o,
!1
);
if (c && (c === t || c === _e(t) || c === en(_e(t))))
return o;
}
const i = (
// local registration
// check instance[type] first which is resolved for options API
vs(r[e] || o[e], t) || // global registration
vs(r.appContext[e], t)
);
return !i && s ? o : i;
}
}
function vs(e, t) {
return e && (e[t] || e[_e(t)] || e[en(_e(t))]);
}
function pc(e, t, n, s) {
let r;
const o = n;
if (N(e) || ee(e)) {
r = new Array(e.length);
for (let i = 0, c = e.length; i < c; i++)
r[i] = t(e[i], i, void 0, o);
} else if (typeof e == "number") {
r = new Array(e);
for (let i = 0; i < e; i++)
r[i] = t(i + 1, i, void 0, o);
} else if (G(e))
if (e[Symbol.iterator])
r = Array.from(
e,
(i, c) => t(i, c, void 0, o)
);
else {
const i = Object.keys(e);
r = new Array(i.length);
for (let c = 0, f = i.length; c < f; c++) {
const d = i[c];
r[c] = t(e[d], d, c, o);
}
}
else
r = [];
return r;
}
function _c(e, t, n = {}, s, r) {
if (se.isCE || se.parent && Ct(se.parent) && se.parent.isCE)
return fe("slot", n, s);
let o = e[t];
o && o._c && (o._d = !1), Yr();
const i = o && Ir(o(n)), c = Zr(
Ce,
{
key: (n.key || // slot content array of a dynamic conditional slot may have a branch
// key attached in the `createSlots` helper, respect that
i && i.key || `_${t}`) + // #7256 force differentiate fallback content from actual content
(!i && s ? "_fb" : "")
},
i || [],
i && e._ === 1 ? 64 : -2
);
return o && o._c && (o._d = !0), c;
}
function Ir(e) {
return e.some((t) => zt(t) ? !(t.type === pe || t.type === Ce && !Ir(t.children)) : !0) ? e : null;
}
const Pn = (e) => e ? to(e) ? un(e) : Pn(e.parent) : null, Et = (
// Move PURE marker to new line to workaround compiler discarding it
// due to type annotation
/* @__PURE__ */ ie(/* @__PURE__ */ Object.create(null), {
$: (e) => e,
$el: (e) => e.vnode.el,
$data: (e) => e.data,
$props: (e) => e.props,
$attrs: (e) => e.attrs,
$slots: (e) => e.slots,
$refs: (e) => e.refs,
$parent: (e) => Pn(e.parent),
$root: (e) => Pn(e.root),
$emit: (e) => e.emit,
$options: (e) => Lr(e),
$forceUpdate: (e) => e.f || (e.f = () => {
e.effect.dirty = !0, es(e.update);
}),
$nextTick: (e) => e.n || (e.n = Qn.bind(e.proxy)),
$watch: (e) => Yi.bind(e)
})
), gn = (e, t) => e !== X && !e.__isScriptSetup && $(e, t), Ai = {
get({ _: e }, t) {
if (t === "__v_skip")
return !0;
const { ctx: n, setupState: s, data: r, props: o, accessCache: i, type: c, appContext: f } = e;
let d;
if (t[0] !== "$") {
const S = i[t];
if (S !== void 0)
switch (S) {
case 1:
return s[t];
case 2:
return r[t];
case 4:
return n[t];
case 3:
return o[t];
}
else {
if (gn(s, t))
return i[t] = 1, s[t];
if (r !== X && $(r, t))
return i[t] = 2, r[t];
if (
// only cache other properties when instance has declared (thus stable)
// props
(d = e.propsOptions[0]) && $(d, t)
)
return i[t] = 3, o[t];
if (n !== X && $(n, t))
return i[t] = 4, n[t];
Rn && (i[t] = 0);
}
}
const a = Et[t];
let p, y;
if (a)
return t === "$attrs" && ge(e.attrs, "get", ""), a(e);
if (
// css module (injected by vue-loader)
(p = c.__cssModules) && (p = p[t])
)
return p;
if (n !== X && $(n, t))
return i[t] = 4, n[t];
if (
// global properties
y = f.config.globalProperties, $(y, t)
)
return y[t];
},
set({ _: e }, t, n) {
const { data: s, setupState: r, ctx: o } = e;
return gn(r, t) ? (r[t] = n, !0) : s !== X && $(s, t) ? (s[t] = n, !0) : $(e.props, t) || t[0] === "$" && t.slice(1) in e ? !1 : (o[t] = n, !0);
},
has({
_: { data: e, setupState: t, accessCache: n, ctx: s, appContext: r, propsOptions: o }
}, i) {
let c;
return !!n[i] || e !== X && $(e, i) || gn(t, i) || (c = o[0]) && $(c, i) || $(s, i) || $(Et, i) || $(r.config.globalProperties, i);
},
defineProperty(e, t, n) {
return n.get != null ? e._.accessCache[t] = 0 : $(n, "value") && this.set(e, t, n.value, null), Reflect.defineProperty(e, t, n);
}
};
function Cs(e) {
return N(e) ? e.reduce(
(t, n) => (t[n] = null, t),
{}
) : e;
}
let Rn = !0;
function Ti(e) {
const t = Lr(e), n = e.proxy, s = e.ctx;
Rn = !1, t.beforeCreate && Es(t.beforeCreate, e, "bc");
const {
// state
data: r,
computed: o,
methods: i,
watch: c,
provide: f,
inject: d,
// lifecycle
created: a,
beforeMount: p,
mounted: y,
beforeUpdate: S,
updated: I,
activated: L,
deactivated: Y,
beforeDestroy: V,
beforeUnmount: W,
destroyed: j,
unmounted: k,
render: q,
renderTracked: P,
renderTriggered: le,
errorCaptured: te,
serverPrefetch: O,
// public API
expose: F,
inheritAttrs: U,
// assets
components: x,
directives: K,
filters: Q
} = t;
if (d && Oi(d, s, null), i)
for (const Z in i) {
const z = i[Z];
R(z) && (s[Z] = z.bind(n));
}
if (r) {
const Z = r.call(n, n);
G(Z) && (e.data = Jn(Z));
}
if (Rn = !0, o)
for (const Z in o) {
const z = o[Z], Je = R(z) ? z.bind(n, n) : R(z.get) ? z.get.bind(n, n) : Ee, Pt = !R(z) && R(z.set) ? z.set.bind(n) : Ee, Ye = vl({
get: Je,
set: Pt
});
Object.defineProperty(s, Z, {
enumerable: !0,
configurable: !0,
get: () => Ye.value,
set: (Ae) => Ye.value = Ae
});
}
if (c)
for (const Z in c)
Mr(c[Z], s, n, Z);
if (f) {
const Z = R(f) ? f.call(n) : f;
Reflect.ownKeys(Z).forEach((z) => {
Li(z, Z[z]);
});
}
a && Es(a, e, "c");
function ne(Z, z) {
N(z) ? z.forEach((Je) => Z(Je.bind(n))) : z && Z(z.bind(n));
}
if (ne(gi, p), ne(Nr, y), ne(mi, S), ne(bi, I), ne(hi, L), ne(pi, Y), ne(Ei, te), ne(Ci, P), ne(vi, le), ne(Pr, W), ne(Rr, k), ne(yi, O), N(F))
if (F.length) {
const Z = e.exposed || (e.exposed = {});
F.forEach((z) => {
Object.defineProperty(Z, z, {
get: () => n[z],
set: (Je) => n[z] = Je
});
});
} else e.exposed || (e.exposed = {});
q && e.render === Ee && (e.render = q), U != null && (e.inheritAttrs = U), x && (e.components = x), K && (e.directives = K);
}
function Oi(e, t, n = Ee) {
N(e) && (e = In(e));
for (const s in e) {
const r = e[s];
let o;
G(r) ? "default" in r ? o = Vt(
r.from || s,
r.default,
!0
) : o = Vt(r.from || s) : o = Vt(r), ue(o) ? Object.defineProperty(t, s, {
enumerable: !0,
configurable: !0,
get: () => o.value,
set: (i) => o.value = i
}) : t[s] = o;
}
}
function Es(e, t, n) {
we(
N(e) ? e.map((s) => s.bind(t.proxy)) : e.bind(t.proxy),
t,
n
);
}
function Mr(e, t, n, s) {
const r = s.includes(".") ? Gr(n, s) : () => n[s];
if (ee(e)) {
const o = t[e];
R(o) && bn(r, o);
} else if (R(e))
bn(r, e.bind(n));
else if (G(e))
if (N(e))
e.forEach((o) => Mr(o, t, n, s));
else {
const o = R(e.handler) ? e.handler.bind(n) : t[e.handler];
R(o) && bn(r, o, e);
}
}
function Lr(e) {
const t = e.type, { mixins: n, extends: s } = t, {
mixins: r,
optionsCache: o,
config: { optionMergeStrategies: i }
} = e.appContext, c = o.get(t);
let f;
return c ? f = c : !r.length && !n && !s ? f = t : (f = {}, r.length && r.forEach(
(d) => qt(f, d, i, !0)
), qt(f, t, i)), G(t) && o.set(t, f), f;
}
function qt(e, t, n, s = !1) {
const { mixins: r, extends: o } = t;
o && qt(e, o, n, !0), r && r.forEach(
(i) => qt(e, i, n, !0)
);
for (const i in t)
if (!(s && i === "expose")) {
const c = Ni[i] || n && n[i];
e[i] = c ? c(e[i], t[i]) : t[i];
}
return e;
}
const Ni = {
data: ws,
props: xs,
emits: xs,
// objects
methods: bt,
computed: bt,
// lifecycle
beforeCreate: de,
created: de,
beforeMount: de,
mounted: de,
beforeUpdate: de,
updated: de,
beforeDestroy: de,
beforeUnmount: de,
destroyed: de,
unmounted: de,
activated: de,
deactivated: de,
errorCaptured: de,
serverPrefetch: de,
// assets
components: bt,
directives: bt,
// watch
watch: Ri,
// provide / inject
provide: ws,
inject: Pi
};
function ws(e, t) {
return t ? e ? function() {
return ie(
R(e) ? e.call(this, this) : e,
R(t) ? t.call(this, this) : t
);
} : t : e;
}
function Pi(e, t) {
return bt(In(e), In(t));
}
function In(e) {
if (N(e)) {
const t = {};
for (let n = 0; n < e.length; n++)
t[e[n]] = e[n];
return t;
}
return e;
}
function de(e, t) {
return e ? [...new Set([].concat(e, t))] : t;
}
function bt(e, t) {
return e ? ie(/* @__PURE__ */ Object.create(null), e, t) : t;
}
function xs(e, t) {
return e ? N(e) && N(t) ? [.../* @__PURE__ */ new Set([...e, ...t])] : ie(
/* @__PURE__ */ Object.create(null),
Cs(e),
Cs(t ?? {})
) : t;
}
function Ri(e, t) {
if (!e) return t;
if (!t) return e;
const n = ie(/* @__PURE__ */ Object.create(null), e);
for (const s in t)
n[s] = de(e[s], t[s]);
return n;
}
function Fr() {
return {
app: null,
config: {
isNativeTag: uo,
performance: !1,
globalProperties: {},
optionMergeStrategies: {},
errorHandler: void 0,
warnHandler: void 0,
compilerOptions: {}
},
mixins: [],
components: {},
directives: {},
provides: /* @__PURE__ */ Object.create(null),
optionsCache: /* @__PURE__ */ new WeakMap(),
propsCache: /* @__PURE__ */ new WeakMap(),
emitsCache: /* @__PURE__ */ new WeakMap()
};
}
let Ii = 0;
function Mi(e, t) {
return function(s, r = null) {
R(s) || (s = ie({}, s)), r != null && !G(r) && (r = null);
const o = Fr(), i = /* @__PURE__ */ new WeakSet();
let c = !1;
const f = o.app = {
_uid: Ii++,
_component: s,
_props: r,
_container: null,
_context: o,
_instance: null,
version: Cl,
get config() {
return o.config;
},
set config(d) {
},
use(d, ...a) {
return i.has(d) || (d && R(d.install) ? (i.add(d), d.install(f, ...a)) : R(d) && (i.add(d), d(f, ...a))), f;
},
mixin(d) {
return o.mixins.includes(d) || o.mixins.push(d), f;
},
component(d, a) {
return a ? (o.components[d] = a, f) : o.components[d];
},
directive(d, a) {
return a ? (o.directives[d] = a, f) : o.directives[d];
},
mount(d, a, p) {
if (!c) {
const y = fe(s, r);
return y.appContext = o, p === !0 ? p = "svg" : p === !1 && (p = void 0), e(y, d, p), c = !0, f._container = d, d.__vue_app__ = f, un(y.component);
}
},
unmount() {
c && (e(null, f._container), delete f._container.__vue_app__);
},
provide(d, a) {
return o.provides[d] = a, f;
},
runWithContext(d) {
const a = ut;
ut = f;
try {
return d();
} finally {
ut = a;
}
}
};
return f;
};
}
let ut = null;
function Li(e, t) {
if (oe) {
let n = oe.provides;
const s = oe.parent && oe.parent.provides;
s === n && (n = oe.provides = Object.create(s)), n[e] = t;
}
}
function Vt(e, t, n = !1) {
const s = oe || se;
if (s || ut) {
const r = ut ? ut._context.provides : 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 && R(t) ? t.call(s && s.proxy) : t;
}
}
const jr = {}, Hr = () => Object.create(jr), $r = (e) => Object.getPrototypeOf(e) === jr;
function Fi(e, t, n, s = !1) {
const r = {}, o = Hr();
e.propsDefaults = /* @__PURE__ */ Object.create(null), Dr(e, t, r, o);
for (const i in e.propsOptions[0])
i in r || (r[i] = void 0);
n ? e.props = s ? r : zo(r) : e.type.props ? e.props = r : e.props = o, e.attrs = o;
}
function ji(e, t, n, s) {
const {
props: r,
attrs: o,
vnode: { patchFlag: i }
} = e, c = D(r), [f] = e.propsOptions;
let d = !1;
if (
// always force full diff in dev
// - #1942 if hmr is enabled with sfc component
// - vite#872 non-sfc component used by sfc component
(s || i > 0) && !(i & 16)
) {
if (i & 8) {
const a = e.vnode.dynamicProps;
for (let p = 0; p < a.length; p++) {
let y = a[p];
if (ln(e.emitsOptions, y))
continue;
const S = t[y];
if (f)
if ($(o, y))
S !== o[y] && (o[y] = S, d = !0);
else {
const I = _e(y);
r[I] = Mn(
f,
c,
I,
S,
e,
!1
);
}
else
S !== o[y] && (o[y] = S, d = !0);
}
}
} else {
Dr(e, t, r, o) && (d = !0);
let a;
for (const p in c)
(!t || // for camelCase
!$(t, p) && // it's possible the original props was passed in as kebab-case
// and converted to camelCase (#955)
((a = be(p)) === p || !$(t, a))) && (f ? n && // for camelCase
(n[p] !== void 0 || // for kebab-case
n[a] !== void 0) && (r[p] = Mn(
f,
c,
p,
void 0,
e,
!0
)) : delete r[p]);
if (o !== c)
for (const p in o)
(!t || !$(t, p)) && (delete o[p], d = !0);
}
d && Ie(e.attrs, "set", "");
}
function Dr(e, t, n, s) {
const [r, o] = e.propsOptions;
let i = !1, c;
if (t)
for (let f in t) {
if (yt(f))
continue;
const d = t[f];
let a;
r && $(r, a = _e(f)) ? !o || !o.includes(a) ? n[a] = d : (c || (c = {}))[a] = d : ln(e.emitsOptions, f) || (!(f in s) || d !== s[f]) && (s[f] = d, i = !0);
}
if (o) {
const f = D(n), d = c || X;
for (let a = 0; a < o.length; a++) {
const p = o[a];
n[p] = Mn(
r,
f,
p,
d[p],
e,
!$(d, p)
);
}
}
return i;
}
function Mn(e, t, n, s, r, o) {
const i = e[n];
if (i != null) {
const c = $(i, "default");
if (c && s === void 0) {
const f = i.default;
if (i.type !== Function && !i.skipFactory && R(f)) {
const { propsDefaults: d } = r;
if (n in d)
s = d[n];
else {
const a = Nt(r);
s = d[n] = f.call(
null,
t
), a();
}
} else
s = f;
}
i[
0
/* shouldCast */
] && (o && !c ? s = !1 : i[
1
/* shouldCastTrue */
] && (s === "" || s === be(n)) && (s = !0));
}
return s;
}
const Hi = /* @__PURE__ */ new WeakMap();
function Vr(e, t, n = !1) {
const s = n ? Hi : t.propsCache, r = s.get(e);
if (r)
return r;
const o = e.props, i = {}, c = [];
let f = !1;
if (!R(e)) {
const a = (p) => {
f = !0;
const [y, S] = Vr(p, t, !0);
ie(i, y), S && c.push(...S);
};
!n && t.mixins.length && t.mixins.forEach(a), e.extends && a(e.extends), e.mixins && e.mixins.forEach(a);
}
if (!o && !f)
return G(e) && s.set(e, lt), lt;
if (N(o))
for (let a = 0; a < o.length; a++) {
const p = _e(o[a]);
Ss(p) && (i[p] = X);
}
else if (o)
for (const a in o) {
const p = _e(a);
if (Ss(p)) {
const y = o[a], S = i[p] = N(y) || R(y) ? { type: y } : ie({}, y), I = S.type;
let L = !1, Y = !0;
if (N(I))
for (let V = 0; V < I.length; ++V) {
const W = I[V], j = R(W) && W.name;
if (j === "Boolean") {
L = !0;
break;
} else j === "String" && (Y = !1);
}
else
L = R(I) && I.name === "Boolean";
S[
0
/* shouldCast */
] = L, S[
1
/* shouldCastTrue */
] = Y, (L || $(S, "default")) && c.push(p);
}
}
const d = [i, c];
return G(e) && s.set(e, d), d;
}
function Ss(e) {
return e[0] !== "$" && !yt(e);
}
const Br = (e) => e[0] === "_" || e === "$stable", ts = (e) => N(e) ? e.map(Ne) : [Ne(e)], $i = (e, t, n) => {
if (t._n)
return t;
const s = fi((...r) => ts(t(...r)), n);
return s._c = !1, s;
}, Ur = (e, t, n) => {
const s = e._ctx;
for (const r in e) {
if (Br(r)) continue;
const o = e[r];
if (R(o))
t[r] = $i(r, o, s);
else if (o != null) {
const i = ts(o);
t[r] = () => i;
}
}
}, Kr = (e, t) => {
const n = ts(t);
e.slots.default = () => n;
}, Wr = (e, t, n) => {
for (const s in t)
(n || s !== "_") && (e[s] = t[s]);
}, Di = (e, t, n) => {
const s = e.slots = Hr();
if (e.vnode.shapeFlag & 32) {
const r = t._;
r ? (Wr(s, t, n), n && Qs(s, "_", r, !0)) : Ur(t, s);
} else t && Kr(e, t);
}, Vi = (e, t, n) => {
const { vnode: s, slots: r } = e;
let o = !0, i = X;
if (s.shapeFlag & 32) {
const c = t._;
c ? n && c === 1 ? o = !1 : Wr(r, t, n) : (o = !t.$stable, Ur(t, r)), i = t;
} else t && (Kr(e, t), i = { default: 1 });
if (o)
for (const c in r)
!Br(c) && i[c] == null && delete r[c];
};
function Ln(e, t, n, s, r = !1) {
if (N(e)) {
e.forEach(
(y, S) => Ln(
y,
t && (N(t) ? t[S] : t),
n,
s,
r
)
);
return;
}
if (Ct(s) && !r)
return;
const o = s.shapeFlag & 4 ? un(s.component) : s.el, i = r ? null : o, { i: c, r: f } = e, d = t && t.r, a = c.refs === X ? c.refs = {} : c.refs, p = c.setupState;
if (d != null && d !== f && (ee(d) ? (a[d] = null, $(p, d) && (p[d] = null)) : ue(d) && (d.value = null)), R(f))
Ke(f, c, 12, [i, a]);
else {
const y = ee(f), S = ue(f);
if (y || S) {
const I = () => {
if (e.f) {
const L = y ? $(p, f) ? p[f] : a[f] : f.value;
r ? N(L) && Dn(L, o) : N(L) ? L.includes(o) || L.push(o) : y ? (a[f] = [o], $(p, f) && (p[f] = a[f])) : (f.value = [o], e.k && (a[e.k] = f.value));
} else y ? (a[f] = i, $(p, f) && (p[f] = i)) : S && (f.value = i, e.k && (a[e.k] = i));
};
i ? (I.id = -1, he(I, n)) : I();
}
}
}
const Bi = Symbol("_vte"), Ui = (e) => e.__isTeleport;
function Ki() {
typeof __VUE_PROD_HYDRATION_MISMATCH_DETAILS__ != "boolean" && (Bn().__VUE_PROD_HYDRATIO