@konnectio/core
Version:
Konnectio Core Frontend Integration.
1,872 lines • 349 kB
JavaScript
/**
* @vue/shared v3.5.18
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
/*! #__NO_SIDE_EFFECTS__ */
// @__NO_SIDE_EFFECTS__
function ut(e) {
const t = /* @__PURE__ */ Object.create(null);
for (const n of e.split(",")) t[n] = 1;
return (n) => n in t;
}
const se = {}, es = [], Ve = () => {
}, As = () => !1, Un = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), Go = (e) => e.startsWith("onUpdate:"), re = Object.assign, Yo = (e, t) => {
const n = e.indexOf(t);
n > -1 && e.splice(n, 1);
}, cd = Object.prototype.hasOwnProperty, ae = (e, t) => cd.call(e, t), K = Array.isArray, ts = (e) => gs(e) === "[object Map]", Hn = (e) => gs(e) === "[object Set]", ec = (e) => gs(e) === "[object Date]", ad = (e) => gs(e) === "[object RegExp]", Z = (e) => typeof e == "function", z = (e) => typeof e == "string", it = (e) => typeof e == "symbol", de = (e) => e !== null && typeof e == "object", Xo = (e) => (de(e) || Z(e)) && Z(e.then) && Z(e.catch), Ua = Object.prototype.toString, gs = (e) => Ua.call(e), fd = (e) => gs(e).slice(8, -1), hi = (e) => gs(e) === "[object Object]", Jo = (e) => z(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, mn = /* @__PURE__ */ ut(
// the leading comma is intentional so empty string "" is also included
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), ud = /* @__PURE__ */ ut(
"bind,cloak,else-if,else,for,html,if,model,on,once,pre,show,slot,text,memo"
), di = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return (n) => t[n] || (t[n] = e(n));
}, hd = /-(\w)/g, _e = di(
(e) => e.replace(hd, (t, n) => n ? n.toUpperCase() : "")
), dd = /\B([A-Z])/g, st = di(
(e) => e.replace(dd, "-$1").toLowerCase()
), Bn = di((e) => e.charAt(0).toUpperCase() + e.slice(1)), ns = di(
(e) => e ? `on${Bn(e)}` : ""
), Qe = (e, t) => !Object.is(e, t), ss = (e, ...t) => {
for (let n = 0; n < e.length; n++)
e[n](...t);
}, io = (e, t, n, s = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: s,
value: n
});
}, $r = (e) => {
const t = parseFloat(e);
return isNaN(t) ? e : t;
}, Vr = (e) => {
const t = z(e) ? Number(e) : NaN;
return isNaN(t) ? e : t;
};
let tc;
const pi = () => tc || (tc = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
function pd(e, t) {
return e + JSON.stringify(
t,
(n, s) => typeof s == "function" ? s.toString() : s
);
}
const md = "Infinity,undefined,NaN,isFinite,isNaN,parseFloat,parseInt,decodeURI,decodeURIComponent,encodeURI,encodeURIComponent,Math,Number,Date,Array,Object,Boolean,String,RegExp,Map,Set,JSON,Intl,BigInt,console,Error,Symbol", gd = /* @__PURE__ */ ut(md);
function tr(e) {
if (K(e)) {
const t = {};
for (let n = 0; n < e.length; n++) {
const s = e[n], r = z(s) ? Ha(s) : tr(s);
if (r)
for (const i in r)
t[i] = r[i];
}
return t;
} else if (z(e) || de(e))
return e;
}
const _d = /;(?![^(]*\))/g, yd = /:([^]+)/, bd = /\/\*[^]*?\*\//g;
function Ha(e) {
const t = {};
return e.replace(bd, "").split(_d).forEach((n) => {
if (n) {
const s = n.split(yd);
s.length > 1 && (t[s[0].trim()] = s[1].trim());
}
}), t;
}
function nr(e) {
let t = "";
if (z(e))
t = e;
else if (K(e))
for (let n = 0; n < e.length; n++) {
const s = nr(e[n]);
s && (t += s + " ");
}
else if (de(e))
for (const n in e)
e[n] && (t += n + " ");
return t.trim();
}
function Ed(e) {
if (!e) return null;
let { class: t, style: n } = e;
return t && !z(t) && (e.class = nr(t)), n && (e.style = tr(n)), e;
}
const Sd = "html,body,base,head,link,meta,style,title,address,article,aside,footer,header,hgroup,h1,h2,h3,h4,h5,h6,nav,section,div,dd,dl,dt,figcaption,figure,picture,hr,img,li,main,ol,p,pre,ul,a,b,abbr,bdi,bdo,br,cite,code,data,dfn,em,i,kbd,mark,q,rp,rt,ruby,s,samp,small,span,strong,sub,sup,time,u,var,wbr,area,audio,map,track,video,embed,object,param,source,canvas,script,noscript,del,ins,caption,col,colgroup,table,thead,tbody,td,th,tr,button,datalist,fieldset,form,input,label,legend,meter,optgroup,option,output,progress,select,textarea,details,dialog,menu,summary,template,blockquote,iframe,tfoot", Td = "svg,animate,animateMotion,animateTransform,circle,clipPath,color-profile,defs,desc,discard,ellipse,feBlend,feColorMatrix,feComponentTransfer,feComposite,feConvolveMatrix,feDiffuseLighting,feDisplacementMap,feDistantLight,feDropShadow,feFlood,feFuncA,feFuncB,feFuncG,feFuncR,feGaussianBlur,feImage,feMerge,feMergeNode,feMorphology,feOffset,fePointLight,feSpecularLighting,feSpotLight,feTile,feTurbulence,filter,foreignObject,g,hatch,hatchpath,image,line,linearGradient,marker,mask,mesh,meshgradient,meshpatch,meshrow,metadata,mpath,path,pattern,polygon,polyline,radialGradient,rect,set,solidcolor,stop,switch,symbol,text,textPath,title,tspan,unknown,use,view", vd = "annotation,annotation-xml,maction,maligngroup,malignmark,math,menclose,merror,mfenced,mfrac,mfraction,mglyph,mi,mlabeledtr,mlongdiv,mmultiscripts,mn,mo,mover,mpadded,mphantom,mprescripts,mroot,mrow,ms,mscarries,mscarry,msgroup,msline,mspace,msqrt,msrow,mstack,mstyle,msub,msubsup,msup,mtable,mtd,mtext,mtr,munder,munderover,none,semantics", Cd = "area,base,br,col,embed,hr,img,input,link,meta,param,source,track,wbr", Nd = /* @__PURE__ */ ut(Sd), Ad = /* @__PURE__ */ ut(Td), Id = /* @__PURE__ */ ut(vd), Od = /* @__PURE__ */ ut(Cd), Ld = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", wd = /* @__PURE__ */ ut(Ld);
function Ba(e) {
return !!e || e === "";
}
function Rd(e, t) {
if (e.length !== t.length) return !1;
let n = !0;
for (let s = 0; n && s < e.length; s++)
n = bn(e[s], t[s]);
return n;
}
function bn(e, t) {
if (e === t) return !0;
let n = ec(e), s = ec(t);
if (n || s)
return n && s ? e.getTime() === t.getTime() : !1;
if (n = it(e), s = it(t), n || s)
return e === t;
if (n = K(e), s = K(t), n || s)
return n && s ? Rd(e, t) : !1;
if (n = de(e), s = de(t), n || s) {
if (!n || !s)
return !1;
const r = Object.keys(e).length, i = Object.keys(t).length;
if (r !== i)
return !1;
for (const o in e) {
const l = e.hasOwnProperty(o), c = t.hasOwnProperty(o);
if (l && !c || !l && c || !bn(e[o], t[o]))
return !1;
}
}
return String(e) === String(t);
}
function mi(e, t) {
return e.findIndex((n) => bn(n, t));
}
const ja = (e) => !!(e && e.__v_isRef === !0), Wa = (e) => z(e) ? e : e == null ? "" : K(e) || de(e) && (e.toString === Ua || !Z(e.toString)) ? ja(e) ? Wa(e.value) : JSON.stringify(e, Ka, 2) : String(e), Ka = (e, t) => ja(t) ? Ka(e, t.value) : ts(t) ? {
[`Map(${t.size})`]: [...t.entries()].reduce(
(n, [s, r], i) => (n[Hi(s, i) + " =>"] = r, n),
{}
)
} : Hn(t) ? {
[`Set(${t.size})`]: [...t.values()].map((n) => Hi(n))
} : it(t) ? Hi(t) : de(t) && !K(t) && !hi(t) ? String(t) : t, Hi = (e, t = "") => {
var n;
return (
// Symbol.description in es2019+ so we need to cast here to pass
// the lib: es2016 check
it(e) ? `Symbol(${(n = e.description) != null ? n : t})` : e
);
};
function Pd(e) {
return e == null ? "initial" : typeof e == "string" ? e === "" ? " " : e : String(e);
}
/**
* @vue/reactivity v3.5.18
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
let je;
class Qo {
constructor(t = !1) {
this.detached = t, this._active = !0, this._on = 0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = je, !t && je && (this.index = (je.scopes || (je.scopes = [])).push(
this
) - 1);
}
get active() {
return this._active;
}
pause() {
if (this._active) {
this._isPaused = !0;
let t, n;
if (this.scopes)
for (t = 0, n = this.scopes.length; t < n; t++)
this.scopes[t].pause();
for (t = 0, n = this.effects.length; t < n; t++)
this.effects[t].pause();
}
}
/**
* Resumes the effect scope, including all child scopes and effects.
*/
resume() {
if (this._active && this._isPaused) {
this._isPaused = !1;
let t, n;
if (this.scopes)
for (t = 0, n = this.scopes.length; t < n; t++)
this.scopes[t].resume();
for (t = 0, n = this.effects.length; t < n; t++)
this.effects[t].resume();
}
}
run(t) {
if (this._active) {
const n = je;
try {
return je = this, t();
} finally {
je = n;
}
}
}
/**
* This should only be called on non-detached scopes
* @internal
*/
on() {
++this._on === 1 && (this.prevScope = je, je = this);
}
/**
* This should only be called on non-detached scopes
* @internal
*/
off() {
this._on > 0 && --this._on === 0 && (je = this.prevScope, this.prevScope = void 0);
}
stop(t) {
if (this._active) {
this._active = !1;
let n, s;
for (n = 0, s = this.effects.length; n < s; n++)
this.effects[n].stop();
for (this.effects.length = 0, n = 0, s = this.cleanups.length; n < s; n++)
this.cleanups[n]();
if (this.cleanups.length = 0, this.scopes) {
for (n = 0, s = this.scopes.length; n < s; n++)
this.scopes[n].stop(!0);
this.scopes.length = 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;
}
}
}
function gi(e) {
return new Qo(e);
}
function Zo() {
return je;
}
function qa(e, t = !1) {
je && je.cleanups.push(e);
}
let me;
const Bi = /* @__PURE__ */ new WeakSet();
class Fs {
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, je && je.active && je.effects.push(this);
}
pause() {
this.flags |= 64;
}
resume() {
this.flags & 64 && (this.flags &= -65, Bi.has(this) && (Bi.delete(this), this.trigger()));
}
/**
* @internal
*/
notify() {
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || Ya(this);
}
run() {
if (!(this.flags & 1))
return this.fn();
this.flags |= 2, nc(this), Xa(this);
const t = me, n = vt;
me = this, vt = !0;
try {
return this.fn();
} finally {
Ja(this), me = t, vt = n, this.flags &= -3;
}
}
stop() {
if (this.flags & 1) {
for (let t = this.deps; t; t = t.nextDep)
tl(t);
this.deps = this.depsTail = void 0, nc(this), this.onStop && this.onStop(), this.flags &= -2;
}
}
trigger() {
this.flags & 64 ? Bi.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
}
/**
* @internal
*/
runIfDirty() {
oo(this) && this.run();
}
get dirty() {
return oo(this);
}
}
let Ga = 0, Ls, ws;
function Ya(e, t = !1) {
if (e.flags |= 8, t) {
e.next = ws, ws = e;
return;
}
e.next = Ls, Ls = e;
}
function zo() {
Ga++;
}
function el() {
if (--Ga > 0)
return;
if (ws) {
let t = ws;
for (ws = void 0; t; ) {
const n = t.next;
t.next = void 0, t.flags &= -9, t = n;
}
}
let e;
for (; Ls; ) {
let t = Ls;
for (Ls = 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 Xa(e) {
for (let t = e.deps; t; t = t.nextDep)
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
}
function Ja(e) {
let t, n = e.depsTail, s = n;
for (; s; ) {
const r = s.prevDep;
s.version === -1 ? (s === n && (n = r), tl(s), kd(s)) : t = s, s.dep.activeLink = s.prevActiveLink, s.prevActiveLink = void 0, s = r;
}
e.deps = t, e.depsTail = n;
}
function oo(e) {
for (let t = e.deps; t; t = t.nextDep)
if (t.dep.version !== t.version || t.dep.computed && (Qa(t.dep.computed) || t.dep.version !== t.version))
return !0;
return !!e._dirty;
}
function Qa(e) {
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === $s) || (e.globalVersion = $s, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !oo(e))))
return;
e.flags |= 2;
const t = e.dep, n = me, s = vt;
me = e, vt = !0;
try {
Xa(e);
const r = e.fn(e._value);
(t.version === 0 || Qe(r, e._value)) && (e.flags |= 128, e._value = r, t.version++);
} catch (r) {
throw t.version++, r;
} finally {
me = n, vt = s, Ja(e), e.flags &= -3;
}
}
function tl(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), n.subs === e && (n.subs = s, !s && n.computed)) {
n.computed.flags &= -5;
for (let i = n.computed.deps; i; i = i.nextDep)
tl(i, !0);
}
!t && !--n.sc && n.map && n.map.delete(n.key);
}
function kd(e) {
const { prevDep: t, nextDep: n } = e;
t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
}
function xd(e, t) {
e.effect instanceof Fs && (e = e.effect.fn);
const n = new Fs(e);
t && re(n, t);
try {
n.run();
} catch (r) {
throw n.stop(), r;
}
const s = n.run.bind(n);
return s.effect = n, s;
}
function Md(e) {
e.effect.stop();
}
let vt = !0;
const Za = [];
function Jt() {
Za.push(vt), vt = !1;
}
function Qt() {
const e = Za.pop();
vt = e === void 0 ? !0 : e;
}
function nc(e) {
const { cleanup: t } = e;
if (e.cleanup = void 0, t) {
const n = me;
me = void 0;
try {
t();
} finally {
me = n;
}
}
}
let $s = 0;
class Dd {
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 _i {
// TODO isolatedDeclarations "__v_skip"
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, this.__v_skip = !0;
}
track(t) {
if (!me || !vt || me === this.computed)
return;
let n = this.activeLink;
if (n === void 0 || n.sub !== me)
n = this.activeLink = new Dd(me, this), me.deps ? (n.prevDep = me.depsTail, me.depsTail.nextDep = n, me.depsTail = n) : me.deps = me.depsTail = n, za(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 = me.depsTail, n.nextDep = void 0, me.depsTail.nextDep = n, me.depsTail = n, me.deps === n && (me.deps = s);
}
return n;
}
trigger(t) {
this.version++, $s++, this.notify(t);
}
notify(t) {
zo();
try {
for (let n = this.subs; n; n = n.prevSub)
n.sub.notify() && n.sub.dep.notify();
} finally {
el();
}
}
}
function za(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)
za(s);
}
const n = e.dep.subs;
n !== e && (e.prevSub = n, n && (n.nextSub = e)), e.dep.subs = e;
}
}
const Ur = /* @__PURE__ */ new WeakMap(), Rn = Symbol(
""
), lo = Symbol(
""
), Vs = Symbol(
""
);
function Ke(e, t, n) {
if (vt && me) {
let s = Ur.get(e);
s || Ur.set(e, s = /* @__PURE__ */ new Map());
let r = s.get(n);
r || (s.set(n, r = new _i()), r.map = s, r.key = n), r.track();
}
}
function Bt(e, t, n, s, r, i) {
const o = Ur.get(e);
if (!o) {
$s++;
return;
}
const l = (c) => {
c && c.trigger();
};
if (zo(), t === "clear")
o.forEach(l);
else {
const c = K(e), a = c && Jo(n);
if (c && n === "length") {
const f = Number(s);
o.forEach((u, h) => {
(h === "length" || h === Vs || !it(h) && h >= f) && l(u);
});
} else
switch ((n !== void 0 || o.has(void 0)) && l(o.get(n)), a && l(o.get(Vs)), t) {
case "add":
c ? a && l(o.get("length")) : (l(o.get(Rn)), ts(e) && l(o.get(lo)));
break;
case "delete":
c || (l(o.get(Rn)), ts(e) && l(o.get(lo)));
break;
case "set":
ts(e) && l(o.get(Rn));
break;
}
}
el();
}
function Fd(e, t) {
const n = Ur.get(e);
return n && n.get(t);
}
function qn(e) {
const t = ne(e);
return t === e ? t : (Ke(t, "iterate", Vs), ft(e) ? t : t.map(De));
}
function yi(e) {
return Ke(e = ne(e), "iterate", Vs), e;
}
const $d = {
__proto__: null,
[Symbol.iterator]() {
return ji(this, Symbol.iterator, De);
},
concat(...e) {
return qn(this).concat(
...e.map((t) => K(t) ? qn(t) : t)
);
},
entries() {
return ji(this, "entries", (e) => (e[1] = De(e[1]), e));
},
every(e, t) {
return Ft(this, "every", e, t, void 0, arguments);
},
filter(e, t) {
return Ft(this, "filter", e, t, (n) => n.map(De), arguments);
},
find(e, t) {
return Ft(this, "find", e, t, De, arguments);
},
findIndex(e, t) {
return Ft(this, "findIndex", e, t, void 0, arguments);
},
findLast(e, t) {
return Ft(this, "findLast", e, t, De, arguments);
},
findLastIndex(e, t) {
return Ft(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 Ft(this, "forEach", e, t, void 0, arguments);
},
includes(...e) {
return Wi(this, "includes", e);
},
indexOf(...e) {
return Wi(this, "indexOf", e);
},
join(e) {
return qn(this).join(e);
},
// keys() iterator only reads `length`, no optimisation required
lastIndexOf(...e) {
return Wi(this, "lastIndexOf", e);
},
map(e, t) {
return Ft(this, "map", e, t, void 0, arguments);
},
pop() {
return Ts(this, "pop");
},
push(...e) {
return Ts(this, "push", e);
},
reduce(e, ...t) {
return sc(this, "reduce", e, t);
},
reduceRight(e, ...t) {
return sc(this, "reduceRight", e, t);
},
shift() {
return Ts(this, "shift");
},
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
some(e, t) {
return Ft(this, "some", e, t, void 0, arguments);
},
splice(...e) {
return Ts(this, "splice", e);
},
toReversed() {
return qn(this).toReversed();
},
toSorted(e) {
return qn(this).toSorted(e);
},
toSpliced(...e) {
return qn(this).toSpliced(...e);
},
unshift(...e) {
return Ts(this, "unshift", e);
},
values() {
return ji(this, "values", De);
}
};
function ji(e, t, n) {
const s = yi(e), r = s[t]();
return s !== e && !ft(e) && (r._next = r.next, r.next = () => {
const i = r._next();
return i.value && (i.value = n(i.value)), i;
}), r;
}
const Vd = Array.prototype;
function Ft(e, t, n, s, r, i) {
const o = yi(e), l = o !== e && !ft(e), c = o[t];
if (c !== Vd[t]) {
const u = c.apply(e, i);
return l ? De(u) : u;
}
let a = n;
o !== e && (l ? a = function(u, h) {
return n.call(this, De(u), h, e);
} : n.length > 2 && (a = function(u, h) {
return n.call(this, u, h, e);
}));
const f = c.call(o, a, s);
return l && r ? r(f) : f;
}
function sc(e, t, n, s) {
const r = yi(e);
let i = n;
return r !== e && (ft(e) ? n.length > 3 && (i = function(o, l, c) {
return n.call(this, o, l, c, e);
}) : i = function(o, l, c) {
return n.call(this, o, De(l), c, e);
}), r[t](i, ...s);
}
function Wi(e, t, n) {
const s = ne(e);
Ke(s, "iterate", Vs);
const r = s[t](...n);
return (r === -1 || r === !1) && Si(n[0]) ? (n[0] = ne(n[0]), s[t](...n)) : r;
}
function Ts(e, t, n = []) {
Jt(), zo();
const s = ne(e)[t].apply(e, n);
return el(), Qt(), s;
}
const Ud = /* @__PURE__ */ ut("__proto__,__v_isRef,__isVue"), ef = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(it)
);
function Hd(e) {
it(e) || (e = String(e));
const t = ne(this);
return Ke(t, "has", e), t.hasOwnProperty(e);
}
class tf {
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, i = this._isShallow;
if (n === "__v_isReactive")
return !r;
if (n === "__v_isReadonly")
return r;
if (n === "__v_isShallow")
return i;
if (n === "__v_raw")
return s === (r ? i ? cf : lf : i ? of : rf).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 o = K(t);
if (!r) {
let c;
if (o && (c = $d[n]))
return c;
if (n === "hasOwnProperty")
return Hd;
}
const l = 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
ye(t) ? t : s
);
return (it(n) ? ef.has(n) : Ud(n)) || (r || Ke(t, "get", n), i) ? l : ye(l) ? o && Jo(n) ? l : l.value : de(l) ? r ? nl(l) : sr(l) : l;
}
}
class nf extends tf {
constructor(t = !1) {
super(!1, t);
}
set(t, n, s, r) {
let i = t[n];
if (!this._isShallow) {
const c = Zt(i);
if (!ft(s) && !Zt(s) && (i = ne(i), s = ne(s)), !K(t) && ye(i) && !ye(s))
return c ? !1 : (i.value = s, !0);
}
const o = K(t) && Jo(n) ? Number(n) < t.length : ae(t, n), l = Reflect.set(
t,
n,
s,
ye(t) ? t : r
);
return t === ne(r) && (o ? Qe(s, i) && Bt(t, "set", n, s) : Bt(t, "add", n, s)), l;
}
deleteProperty(t, n) {
const s = ae(t, n);
t[n];
const r = Reflect.deleteProperty(t, n);
return r && s && Bt(t, "delete", n, void 0), r;
}
has(t, n) {
const s = Reflect.has(t, n);
return (!it(n) || !ef.has(n)) && Ke(t, "has", n), s;
}
ownKeys(t) {
return Ke(
t,
"iterate",
K(t) ? "length" : Rn
), Reflect.ownKeys(t);
}
}
class sf extends tf {
constructor(t = !1) {
super(!0, t);
}
set(t, n) {
return !0;
}
deleteProperty(t, n) {
return !0;
}
}
const Bd = /* @__PURE__ */ new nf(), jd = /* @__PURE__ */ new sf(), Wd = /* @__PURE__ */ new nf(!0), Kd = /* @__PURE__ */ new sf(!0), co = (e) => e, dr = (e) => Reflect.getPrototypeOf(e);
function qd(e, t, n) {
return function(...s) {
const r = this.__v_raw, i = ne(r), o = ts(i), l = e === "entries" || e === Symbol.iterator && o, c = e === "keys" && o, a = r[e](...s), f = n ? co : t ? Hr : De;
return !t && Ke(
i,
"iterate",
c ? lo : Rn
), {
// iterator protocol
next() {
const { value: u, done: h } = a.next();
return h ? { value: u, done: h } : {
value: l ? [f(u[0]), f(u[1])] : f(u),
done: h
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function pr(e) {
return function(...t) {
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function Gd(e, t) {
const n = {
get(r) {
const i = this.__v_raw, o = ne(i), l = ne(r);
e || (Qe(r, l) && Ke(o, "get", r), Ke(o, "get", l));
const { has: c } = dr(o), a = t ? co : e ? Hr : De;
if (c.call(o, r))
return a(i.get(r));
if (c.call(o, l))
return a(i.get(l));
i !== o && i.get(r);
},
get size() {
const r = this.__v_raw;
return !e && Ke(ne(r), "iterate", Rn), Reflect.get(r, "size", r);
},
has(r) {
const i = this.__v_raw, o = ne(i), l = ne(r);
return e || (Qe(r, l) && Ke(o, "has", r), Ke(o, "has", l)), r === l ? i.has(r) : i.has(r) || i.has(l);
},
forEach(r, i) {
const o = this, l = o.__v_raw, c = ne(l), a = t ? co : e ? Hr : De;
return !e && Ke(c, "iterate", Rn), l.forEach((f, u) => r.call(i, a(f), a(u), o));
}
};
return re(
n,
e ? {
add: pr("add"),
set: pr("set"),
delete: pr("delete"),
clear: pr("clear")
} : {
add(r) {
!t && !ft(r) && !Zt(r) && (r = ne(r));
const i = ne(this);
return dr(i).has.call(i, r) || (i.add(r), Bt(i, "add", r, r)), this;
},
set(r, i) {
!t && !ft(i) && !Zt(i) && (i = ne(i));
const o = ne(this), { has: l, get: c } = dr(o);
let a = l.call(o, r);
a || (r = ne(r), a = l.call(o, r));
const f = c.call(o, r);
return o.set(r, i), a ? Qe(i, f) && Bt(o, "set", r, i) : Bt(o, "add", r, i), this;
},
delete(r) {
const i = ne(this), { has: o, get: l } = dr(i);
let c = o.call(i, r);
c || (r = ne(r), c = o.call(i, r)), l && l.call(i, r);
const a = i.delete(r);
return c && Bt(i, "delete", r, void 0), a;
},
clear() {
const r = ne(this), i = r.size !== 0, o = r.clear();
return i && Bt(
r,
"clear",
void 0,
void 0
), o;
}
}
), [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((r) => {
n[r] = qd(r, e, t);
}), n;
}
function bi(e, t) {
const n = Gd(e, t);
return (s, r, i) => r === "__v_isReactive" ? !e : r === "__v_isReadonly" ? e : r === "__v_raw" ? s : Reflect.get(
ae(n, r) && r in s ? n : s,
r,
i
);
}
const Yd = {
get: /* @__PURE__ */ bi(!1, !1)
}, Xd = {
get: /* @__PURE__ */ bi(!1, !0)
}, Jd = {
get: /* @__PURE__ */ bi(!0, !1)
}, Qd = {
get: /* @__PURE__ */ bi(!0, !0)
}, rf = /* @__PURE__ */ new WeakMap(), of = /* @__PURE__ */ new WeakMap(), lf = /* @__PURE__ */ new WeakMap(), cf = /* @__PURE__ */ new WeakMap();
function Zd(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function zd(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : Zd(fd(e));
}
function sr(e) {
return Zt(e) ? e : Ei(
e,
!1,
Bd,
Yd,
rf
);
}
function af(e) {
return Ei(
e,
!1,
Wd,
Xd,
of
);
}
function nl(e) {
return Ei(
e,
!0,
jd,
Jd,
lf
);
}
function ep(e) {
return Ei(
e,
!0,
Kd,
Qd,
cf
);
}
function Ei(e, t, n, s, r) {
if (!de(e) || e.__v_raw && !(t && e.__v_isReactive))
return e;
const i = zd(e);
if (i === 0)
return e;
const o = r.get(e);
if (o)
return o;
const l = new Proxy(
e,
i === 2 ? s : n
);
return r.set(e, l), l;
}
function Ct(e) {
return Zt(e) ? Ct(e.__v_raw) : !!(e && e.__v_isReactive);
}
function Zt(e) {
return !!(e && e.__v_isReadonly);
}
function ft(e) {
return !!(e && e.__v_isShallow);
}
function Si(e) {
return e ? !!e.__v_raw : !1;
}
function ne(e) {
const t = e && e.__v_raw;
return t ? ne(t) : e;
}
function Ti(e) {
return !ae(e, "__v_skip") && Object.isExtensible(e) && io(e, "__v_skip", !0), e;
}
const De = (e) => de(e) ? sr(e) : e, Hr = (e) => de(e) ? nl(e) : e;
function ye(e) {
return e ? e.__v_isRef === !0 : !1;
}
function gn(e) {
return ff(e, !1);
}
function sl(e) {
return ff(e, !0);
}
function ff(e, t) {
return ye(e) ? e : new tp(e, t);
}
class tp {
constructor(t, n) {
this.dep = new _i(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = n ? t : ne(t), this._value = n ? t : De(t), this.__v_isShallow = n;
}
get value() {
return this.dep.track(), this._value;
}
set value(t) {
const n = this._rawValue, s = this.__v_isShallow || ft(t) || Zt(t);
t = s ? t : ne(t), Qe(t, n) && (this._rawValue = t, this._value = s ? t : De(t), this.dep.trigger());
}
}
function np(e) {
e.dep && e.dep.trigger();
}
function vi(e) {
return ye(e) ? e.value : e;
}
function sp(e) {
return Z(e) ? e() : vi(e);
}
const rp = {
get: (e, t, n) => t === "__v_raw" ? e : vi(Reflect.get(e, t, n)),
set: (e, t, n, s) => {
const r = e[t];
return ye(r) && !ye(n) ? (r.value = n, !0) : Reflect.set(e, t, n, s);
}
};
function rl(e) {
return Ct(e) ? e : new Proxy(e, rp);
}
class ip {
constructor(t) {
this.__v_isRef = !0, this._value = void 0;
const n = this.dep = new _i(), { get: s, set: r } = t(n.track.bind(n), n.trigger.bind(n));
this._get = s, this._set = r;
}
get value() {
return this._value = this._get();
}
set value(t) {
this._set(t);
}
}
function uf(e) {
return new ip(e);
}
function hf(e) {
const t = K(e) ? new Array(e.length) : {};
for (const n in e)
t[n] = pf(e, n);
return t;
}
class op {
constructor(t, n, s) {
this._object = t, this._key = n, this._defaultValue = s, this.__v_isRef = !0, this._value = void 0;
}
get value() {
const t = this._object[this._key];
return this._value = t === void 0 ? this._defaultValue : t;
}
set value(t) {
this._object[this._key] = t;
}
get dep() {
return Fd(ne(this._object), this._key);
}
}
class lp {
constructor(t) {
this._getter = t, this.__v_isRef = !0, this.__v_isReadonly = !0, this._value = void 0;
}
get value() {
return this._value = this._getter();
}
}
function df(e, t, n) {
return ye(e) ? e : Z(e) ? new lp(e) : de(e) && arguments.length > 1 ? pf(e, t, n) : gn(e);
}
function pf(e, t, n) {
const s = e[t];
return ye(s) ? s : new op(e, t, n);
}
class cp {
constructor(t, n, s) {
this.fn = t, this.setter = n, this._value = void 0, this.dep = new _i(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = $s - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !n, this.isSSR = s;
}
/**
* @internal
*/
notify() {
if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion
me !== this)
return Ya(this, !0), !0;
}
get value() {
const t = this.dep.track();
return Qa(this), t && (t.version = this.dep.version), this._value;
}
set value(t) {
this.setter && this.setter(t);
}
}
function ap(e, t, n = !1) {
let s, r;
return Z(e) ? s = e : (s = e.get, r = e.set), new cp(s, r, n);
}
const fp = {
GET: "get",
HAS: "has",
ITERATE: "iterate"
}, up = {
SET: "set",
ADD: "add",
DELETE: "delete",
CLEAR: "clear"
}, mr = {}, Br = /* @__PURE__ */ new WeakMap();
let fn;
function hp() {
return fn;
}
function mf(e, t = !1, n = fn) {
if (n) {
let s = Br.get(n);
s || Br.set(n, s = []), s.push(e);
}
}
function dp(e, t, n = se) {
const { immediate: s, deep: r, once: i, scheduler: o, augmentJob: l, call: c } = n, a = (p) => r ? p : ft(p) || r === !1 || r === 0 ? jt(p, 1) : jt(p);
let f, u, h, _, v = !1, E = !1;
if (ye(e) ? (u = () => e.value, v = ft(e)) : Ct(e) ? (u = () => a(e), v = !0) : K(e) ? (E = !0, v = e.some((p) => Ct(p) || ft(p)), u = () => e.map((p) => {
if (ye(p))
return p.value;
if (Ct(p))
return a(p);
if (Z(p))
return c ? c(p, 2) : p();
})) : Z(e) ? t ? u = c ? () => c(e, 2) : e : u = () => {
if (h) {
Jt();
try {
h();
} finally {
Qt();
}
}
const p = fn;
fn = f;
try {
return c ? c(e, 3, [_]) : e(_);
} finally {
fn = p;
}
} : u = Ve, t && r) {
const p = u, S = r === !0 ? 1 / 0 : r;
u = () => jt(p(), S);
}
const k = Zo(), y = () => {
f.stop(), k && k.active && Yo(k.effects, f);
};
if (i && t) {
const p = t;
t = (...S) => {
p(...S), y();
};
}
let T = E ? new Array(e.length).fill(mr) : mr;
const m = (p) => {
if (!(!(f.flags & 1) || !f.dirty && !p))
if (t) {
const S = f.run();
if (r || v || (E ? S.some((O, L) => Qe(O, T[L])) : Qe(S, T))) {
h && h();
const O = fn;
fn = f;
try {
const L = [
S,
// pass undefined as the old value when it's changed for the first time
T === mr ? void 0 : E && T[0] === mr ? [] : T,
_
];
T = S, c ? c(t, 3, L) : (
// @ts-expect-error
t(...L)
);
} finally {
fn = O;
}
}
} else
f.run();
};
return l && l(m), f = new Fs(u), f.scheduler = o ? () => o(m, !1) : m, _ = (p) => mf(p, !1, f), h = f.onStop = () => {
const p = Br.get(f);
if (p) {
if (c)
c(p, 4);
else
for (const S of p) S();
Br.delete(f);
}
}, t ? s ? m(!0) : T = f.run() : o ? o(m.bind(null, !0), !0) : f.run(), y.pause = f.pause.bind(f), y.resume = f.resume.bind(f), y.stop = y, y;
}
function jt(e, t = 1 / 0, n) {
if (t <= 0 || !de(e) || e.__v_skip || (n = n || /* @__PURE__ */ new Set(), n.has(e)))
return e;
if (n.add(e), t--, ye(e))
jt(e.value, t, n);
else if (K(e))
for (let s = 0; s < e.length; s++)
jt(e[s], t, n);
else if (Hn(e) || ts(e))
e.forEach((s) => {
jt(s, t, n);
});
else if (hi(e)) {
for (const s in e)
jt(e[s], t, n);
for (const s of Object.getOwnPropertySymbols(e))
Object.prototype.propertyIsEnumerable.call(e, s) && jt(e[s], t, n);
}
return e;
}
/**
* @vue/runtime-core v3.5.18
* (c) 2018-present Yuxi (Evan) You and Vue contributors
* @license MIT
**/
const gf = [];
function pp(e) {
gf.push(e);
}
function mp() {
gf.pop();
}
function gp(e, t) {
}
const _p = {
SETUP_FUNCTION: 0,
0: "SETUP_FUNCTION",
RENDER_FUNCTION: 1,
1: "RENDER_FUNCTION",
NATIVE_EVENT_HANDLER: 5,
5: "NATIVE_EVENT_HANDLER",
COMPONENT_EVENT_HANDLER: 6,
6: "COMPONENT_EVENT_HANDLER",
VNODE_HOOK: 7,
7: "VNODE_HOOK",
DIRECTIVE_HOOK: 8,
8: "DIRECTIVE_HOOK",
TRANSITION_HOOK: 9,
9: "TRANSITION_HOOK",
APP_ERROR_HANDLER: 10,
10: "APP_ERROR_HANDLER",
APP_WARN_HANDLER: 11,
11: "APP_WARN_HANDLER",
FUNCTION_REF: 12,
12: "FUNCTION_REF",
ASYNC_COMPONENT_LOADER: 13,
13: "ASYNC_COMPONENT_LOADER",
SCHEDULER: 14,
14: "SCHEDULER",
COMPONENT_UPDATE: 15,
15: "COMPONENT_UPDATE",
APP_UNMOUNT_CLEANUP: 16,
16: "APP_UNMOUNT_CLEANUP"
}, yp = {
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 _s(e, t, n, s) {
try {
return s ? e(...s) : e();
} catch (r) {
jn(r, t, n);
}
}
function bt(e, t, n, s) {
if (Z(e)) {
const r = _s(e, t, n, s);
return r && Xo(r) && r.catch((i) => {
jn(i, t, n);
}), r;
}
if (K(e)) {
const r = [];
for (let i = 0; i < e.length; i++)
r.push(bt(e[i], t, n, s));
return r;
}
}
function jn(e, t, n, s = !0) {
const r = t ? t.vnode : null, { errorHandler: i, throwUnhandledErrorInProduction: o } = t && t.appContext.config || se;
if (t) {
let l = t.parent;
const c = t.proxy, a = `https://vuejs.org/error-reference/#runtime-${n}`;
for (; l; ) {
const f = l.ec;
if (f) {
for (let u = 0; u < f.length; u++)
if (f[u](e, c, a) === !1)
return;
}
l = l.parent;
}
if (i) {
Jt(), _s(i, null, 10, [
e,
c,
a
]), Qt();
return;
}
}
bp(e, n, r, s, o);
}
function bp(e, t, n, s = !0, r = !1) {
if (r)
throw e;
console.error(e);
}
const Ze = [];
let Rt = -1;
const rs = [];
let un = null, Jn = 0;
const _f = /* @__PURE__ */ Promise.resolve();
let jr = null;
function rr(e) {
const t = jr || _f;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function Ep(e) {
let t = Rt + 1, n = Ze.length;
for (; t < n; ) {
const s = t + n >>> 1, r = Ze[s], i = Hs(r);
i < e || i === e && r.flags & 2 ? t = s + 1 : n = s;
}
return t;
}
function il(e) {
if (!(e.flags & 1)) {
const t = Hs(e), n = Ze[Ze.length - 1];
!n || // fast path when the job id is larger than the tail
!(e.flags & 2) && t >= Hs(n) ? Ze.push(e) : Ze.splice(Ep(t), 0, e), e.flags |= 1, yf();
}
}
function yf() {
jr || (jr = _f.then(bf));
}
function Us(e) {
K(e) ? rs.push(...e) : un && e.id === -1 ? un.splice(Jn + 1, 0, e) : e.flags & 1 || (rs.push(e), e.flags |= 1), yf();
}
function rc(e, t, n = Rt + 1) {
for (; n < Ze.length; n++) {
const s = Ze[n];
if (s && s.flags & 2) {
if (e && s.id !== e.uid)
continue;
Ze.splice(n, 1), n--, s.flags & 4 && (s.flags &= -2), s(), s.flags & 4 || (s.flags &= -2);
}
}
}
function Wr(e) {
if (rs.length) {
const t = [...new Set(rs)].sort(
(n, s) => Hs(n) - Hs(s)
);
if (rs.length = 0, un) {
un.push(...t);
return;
}
for (un = t, Jn = 0; Jn < un.length; Jn++) {
const n = un[Jn];
n.flags & 4 && (n.flags &= -2), n.flags & 8 || n(), n.flags &= -2;
}
un = null, Jn = 0;
}
}
const Hs = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
function bf(e) {
try {
for (Rt = 0; Rt < Ze.length; Rt++) {
const t = Ze[Rt];
t && !(t.flags & 8) && (t.flags & 4 && (t.flags &= -2), _s(
t,
t.i,
t.i ? 15 : 14
), t.flags & 4 || (t.flags &= -2));
}
} finally {
for (; Rt < Ze.length; Rt++) {
const t = Ze[Rt];
t && (t.flags &= -2);
}
Rt = -1, Ze.length = 0, Wr(), jr = null, (Ze.length || rs.length) && bf();
}
}
let Qn, gr = [];
function Ef(e, t) {
var n, s;
Qn = e, Qn ? (Qn.enabled = !0, gr.forEach(({ event: r, args: i }) => Qn.emit(r, ...i)), gr = []) : /* 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((i) => {
Ef(i, t);
}), setTimeout(() => {
Qn || (t.__VUE_DEVTOOLS_HOOK_REPLAY__ = null, gr = []);
}, 3e3)) : gr = [];
}
let $e = null, Ci = null;
function Bs(e) {
const t = $e;
return $e = e, Ci = e && e.type.__scopeId || null, t;
}
function Sp(e) {
Ci = e;
}
function Tp() {
Ci = null;
}
const vp = (e) => ol;
function ol(e, t = $e, n) {
if (!t || e._n)
return e;
const s = (...r) => {
s._d && _o(-1);
const i = Bs(t);
let o;
try {
o = e(...r);
} finally {
Bs(i), s._d && _o(1);
}
return o;
};
return s._n = !0, s._c = !0, s._d = !0, s;
}
function Cp(e, t) {
if ($e === null)
return e;
const n = cr($e), s = e.dirs || (e.dirs = []);
for (let r = 0; r < t.length; r++) {
let [i, o, l, c = se] = t[r];
i && (Z(i) && (i = {
mounted: i,
updated: i
}), i.deep && jt(o), s.push({
dir: i,
instance: n,
value: o,
oldValue: void 0,
arg: l,
modifiers: c
}));
}
return e;
}
function Pt(e, t, n, s) {
const r = e.dirs, i = t && t.dirs;
for (let o = 0; o < r.length; o++) {
const l = r[o];
i && (l.oldValue = i[o].value);
let c = l.dir[s];
c && (Jt(), bt(c, n, 8, [
e.el,
l,
e,
t
]), Qt());
}
}
const Sf = Symbol("_vte"), Tf = (e) => e.__isTeleport, Rs = (e) => e && (e.disabled || e.disabled === ""), ic = (e) => e && (e.defer || e.defer === ""), oc = (e) => typeof SVGElement < "u" && e instanceof SVGElement, lc = (e) => typeof MathMLElement == "function" && e instanceof MathMLElement, ao = (e, t) => {
const n = e && e.to;
return z(n) ? t ? t(n) : null : n;
}, vf = {
name: "Teleport",
__isTeleport: !0,
process(e, t, n, s, r, i, o, l, c, a) {
const {
mc: f,
pc: u,
pbc: h,
o: { insert: _, querySelector: v, createText: E, createComment: k }
} = a, y = Rs(t.props);
let { shapeFlag: T, children: m, dynamicChildren: p } = t;
if (e == null) {
const S = t.el = E(""), O = t.anchor = E("");
_(S, n, s), _(O, n, s);
const L = (A, R) => {
T & 16 && (r && r.isCE && (r.ce._teleportTarget = A), f(
m,
A,
R,
r,
i,
o,
l,
c
));
}, x = () => {
const A = t.target = ao(t.props, v), R = Cf(A, t, E, _);
A && (o !== "svg" && oc(A) ? o = "svg" : o !== "mathml" && lc(A) && (o = "mathml"), y || (L(A, R), Lr(t, !1)));
};
y && (L(n, O), Lr(t, !0)), ic(t.props) ? (t.el.__isMounted = !1, Re(() => {
x(), delete t.el.__isMounted;
}, i)) : x();
} else {
if (ic(t.props) && e.el.__isMounted === !1) {
Re(() => {
vf.process(
e,
t,
n,
s,
r,
i,
o,
l,
c,
a
);
}, i);
return;
}
t.el = e.el, t.targetStart = e.targetStart;
const S = t.anchor = e.anchor, O = t.target = e.target, L = t.targetAnchor = e.targetAnchor, x = Rs(e.props), A = x ? n : O, R = x ? S : L;
if (o === "svg" || oc(O) ? o = "svg" : (o === "mathml" || lc(O)) && (o = "mathml"), p ? (h(
e.dynamicChildren,
p,
A,
r,
i,
o,
l
), _l(e, t, !0)) : c || u(
e,
t,
A,
R,
r,
i,
o,
l,
!1
), y)
x ? t.props && e.props && t.props.to !== e.props.to && (t.props.to = e.props.to) : _r(
t,
n,
S,
a,
1
);
else if ((t.props && t.props.to) !== (e.props && e.props.to)) {
const $ = t.target = ao(
t.props,
v
);
$ && _r(
t,
$,
null,
a,
0
);
} else x && _r(
t,
O,
L,
a,
1
);
Lr(t, y);
}
},
remove(e, t, n, { um: s, o: { remove: r } }, i) {
const {
shapeFlag: o,
children: l,
anchor: c,
targetStart: a,
targetAnchor: f,
target: u,
props: h
} = e;
if (u && (r(a), r(f)), i && r(c), o & 16) {
const _ = i || !Rs(h);
for (let v = 0; v < l.length; v++) {
const E = l[v];
s(
E,
t,
n,
_,
!!E.dynamicChildren
);
}
}
},
move: _r,
hydrate: Np
};
function _r(e, t, n, { o: { insert: s }, m: r }, i = 2) {
i === 0 && s(e.targetAnchor, t, n);
const { el: o, anchor: l, shapeFlag: c, children: a, props: f } = e, u = i === 2;
if (u && s(o, t, n), (!u || Rs(f)) && c & 16)
for (let h = 0; h < a.length; h++)
r(
a[h],
t,
n,
2
);
u && s(l, t, n);
}
function Np(e, t, n, s, r, i, {
o: { nextSibling: o, parentNode: l, querySelector: c, insert: a, createText: f }
}, u) {
const h = t.target = ao(
t.props,
c
);
if (h) {
const _ = Rs(t.props), v = h._lpa || h.firstChild;
if (t.shapeFlag & 16)
if (_)
t.anchor = u(
o(e),
t,
l(e),
n,
s,
r,
i
), t.targetStart = v, t.targetAnchor = v && o(v);
else {
t.anchor = o(e);
let E = v;
for (; E; ) {
if (E && E.nodeType === 8) {
if (E.data === "teleport start anchor")
t.targetStart = E;
else if (E.data === "teleport anchor") {
t.targetAnchor = E, h._lpa = t.targetAnchor && o(t.targetAnchor);
break;
}
}
E = o(E);
}
t.targetAnchor || Cf(h, t, f, a), u(
v && o(v),
t,
h,
n,
s,
r,
i
);
}
Lr(t, _);
}
return t.anchor && o(t.anchor);
}
const Ap = vf;
function Lr(e, t) {
const n = e.ctx;
if (n && n.ut) {
let s, r;
for (t ? (s = e.el, r = e.anchor) : (s = e.targetStart, r = e.targetAnchor); s && s !== r; )
s.nodeType === 1 && s.setAttribute("data-v-owner", n.uid), s = s.nextSibling;
n.ut();
}
}
function Cf(e, t, n, s) {
const r = t.targetStart = n(""), i = t.targetAnchor = n("");
return r[Sf] = i, e && (s(r, e), s(i, e)), i;
}
const hn = Symbol("_leaveCb"), yr = Symbol("_enterCb");
function ll() {
const e = {
isMounted: !1,
isLeaving: !1,
isUnmounting: !1,
leavingVNodes: /* @__PURE__ */ new Map()
};
return bs(() => {
e.isMounted = !0;
}), Oi(() => {
e.isUnmounting = !0;
}), e;
}
const pt = [Function, Array], cl = {
mode: String,
appear: Boolean,
persisted: Boolean,
// enter
onBeforeEnter: pt,
onEnter: pt,
onAfterEnter: pt,
onEnterCancelled: pt,
// leave
onBeforeLeave: pt,
onLeave: pt,
onAfterLeave: pt,
onLeaveCancelled: pt,
// appear
onBeforeAppear: pt,
onAppear: pt,
onAfterAppear: pt,
onAppearCancelled: pt
}, Nf = (e) => {
const t = e.subTree;
return t.component ? Nf(t.component) : t;
}, Ip = {
name: "BaseTransition",
props: cl,
setup(e, { slots: t }) {
const n = Ue(), s = ll();
return () => {
const r = t.default && Ni(t.default(), !0);
if (!r || !r.length)
return;
const i = Af(r), o = ne(e), { mode: l } = o;
if (s.isLeaving)
return Ki(i);
const c = cc(i);
if (!c)
return Ki(i);
let a = ls(
c,
o,
s,
n,
// #11061, ensure enterHooks is fresh after clone
(u) => a = u
);
c.type !== Oe && zt(c, a);
let f = n.subTree && cc(n.subTree);
if (f && f.type !== Oe && !St(c, f) && Nf(n).type !== Oe) {
let u = ls(
f,
o,
s,
n
);
if (zt(f, u), l === "out-in" && c.type !== Oe)
return s.isLeaving = !0, u.afterLeave = () => {
s.isLeaving = !1, n.job.flags & 8 || n.update(), delete u.afterLeave, f = void 0;
}, Ki(i);
l === "in-out" && c.type !== Oe ? u.delayLeave = (h, _, v) => {
const E = Of(
s,
f
);
E[String(f.key)] = f, h[hn] = () => {
_(), h[hn] = void 0, delete a.delayedLeave, f = void 0;
}, a.delayedLeave = () => {
v(), delete a.delayedLeave, f = void 0;
};
} : f = void 0;
} else f && (f = void 0);
return i;
};
}
};
function Af(e) {
let t = e[0];
if (e.length > 1) {
for (const n of e)
if (n.type !== Oe) {
t = n;
break;
}
}
return t;
}
const If = Ip;
function Of(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 ls(e, t, n, s, r) {
const {
appear: i,
mode: o,
persisted: l = !1,
onBeforeEnter: c,
onEnter: a,
onAfterEnter: f,
onEnterCancelled: u,
onBeforeLeave: h,
onLeave: _,
onAfterLeave: v,
onLeaveCancelled: E,
onBeforeAppear: k,
onAppear: y,
onAfterAppear: T,
onAppearCancelled: m
} = t, p = String(e.key), S = Of(n, e), O = (A, R) => {
A && bt(
A,
s,
9,
R
);
}, L = (A, R) => {
const $ = R[1];
O(A, R), K(A) ? A.every((w) => w.length <= 1) && $() : A.length <= 1 && $();
}, x = {
mode: o,
persisted: l,
beforeEnter(A) {
let R = c;
if (!n.isMounted)
if (i)
R = k || c;
else
return;
A[hn] && A[hn](
!0
/* cancelled */
);
const $ = S[p];
$ && St(e, $) && $.el[hn] && $.el[hn](), O(R, [A]);
},
enter(A) {
let R = a, $ = f, w = u;
if (!n.isMounted)
if (i)
R = y || a, $ = T || f, w = m || u;
else
return;
let B = !1;
const X = A[yr] = (Q) => {
B || (B = !0, Q ? O(w, [A]) : O($, [A]), x.delayedLeave && x.delayedLeave(), A[yr] = void 0);
};
R ? L(R, [A, X]) : X();
},
leave(A, R) {
const $ = String(e.key);
if (A[yr] && A[yr](
!0
/* cancelled */
), n.isUnmounting)
return R();
O(h, [A]);
let w = !1;
const B = A[hn] = (X) => {
w || (w = !0, R(), X ? O(E, [A]) : O(v, [A]), A[hn] = void 0, S[$] === e && delete S[$]);
};
S[$] = e, _ ? L(_, [A, B]) : B();
},
clone(A) {
const R = ls(
A,
t,
n,
s,
r
);
return r && r(R), R;
}
};
return x;
}
function Ki(e) {
if (ir(e))
return e = Mt(e), e.children = null, e;
}
function cc(e) {
if (!ir(e))
return Tf(e.type) && e.children ? Af(e.children) : e;
if (e.component)
return e.component.subTree;
const { shapeFlag: t, children: n