@konnectio/core
Version:
Konnectio Core Frontend Integration.
1,868 lines • 356 kB
JavaScript
// @__NO_SIDE_EFFECTS__
function ht(e) {
const t = /* @__PURE__ */ Object.create(null);
for (const n of e.split(",")) t[n] = 1;
return (n) => n in t;
}
const ie = {}, ls = [], $e = () => {
}, is = () => !1, Kn = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), ll = (e) => e.startsWith("onUpdate:"), ne = Object.assign, cl = (e, t) => {
const n = e.indexOf(t);
n > -1 && e.splice(n, 1);
}, Vp = Object.prototype.hasOwnProperty, ae = (e, t) => Vp.call(e, t), K = Array.isArray, cs = (e) => As(e) === "[object Map]", qn = (e) => As(e) === "[object Set]", $c = (e) => As(e) === "[object Date]", Up = (e) => As(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", al = (e) => (de(e) || Z(e)) && Z(e.then) && Z(e.catch), Of = Object.prototype.toString, As = (e) => Of.call(e), Hp = (e) => As(e).slice(8, -1), Ai = (e) => As(e) === "[object Object]", Ii = (e) => z(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, yn = /* @__PURE__ */ ht(
// the leading comma is intentional so empty string "" is also included
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
), Bp = /* @__PURE__ */ ht(
"bind,cloak,else-if,else,for,html,if,model,on,once,pre,show,slot,text,memo"
), Oi = (e) => {
const t = /* @__PURE__ */ Object.create(null);
return ((n) => t[n] || (t[n] = e(n)));
}, jp = /-\w/g, ye = Oi(
(e) => e.replace(jp, (t) => t.slice(1).toUpperCase())
), Wp = /\B([A-Z])/g, st = Oi(
(e) => e.replace(Wp, "-$1").toLowerCase()
), Cn = Oi((e) => e.charAt(0).toUpperCase() + e.slice(1)), Dn = Oi(
(e) => e ? `on${Cn(e)}` : ""
), Je = (e, t) => !Object.is(e, t), as = (e, ...t) => {
for (let n = 0; n < e.length; n++)
e[n](...t);
}, Lf = (e, t, n, s = !1) => {
Object.defineProperty(e, t, {
configurable: !0,
enumerable: !1,
writable: s,
value: n
});
}, Li = (e) => {
const t = parseFloat(e);
return isNaN(t) ? e : t;
}, ei = (e) => {
const t = z(e) ? Number(e) : NaN;
return isNaN(t) ? e : t;
};
let Vc;
const wi = () => Vc || (Vc = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
function Kp(e, t) {
return e + JSON.stringify(
t,
(n, s) => typeof s == "function" ? s.toString() : s
);
}
const qp = "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", Gp = /* @__PURE__ */ ht(qp);
function Is(e) {
if (K(e)) {
const t = {};
for (let n = 0; n < e.length; n++) {
const s = e[n], r = z(s) ? wf(s) : Is(s);
if (r)
for (const i in r)
t[i] = r[i];
}
return t;
} else if (z(e) || de(e))
return e;
}
const Yp = /;(?![^(]*\))/g, Xp = /:([^]+)/, Jp = /\/\*[^]*?\*\//g;
function wf(e) {
const t = {};
return e.replace(Jp, "").split(Yp).forEach((n) => {
if (n) {
const s = n.split(Xp);
s.length > 1 && (t[s[0].trim()] = s[1].trim());
}
}), t;
}
function Os(e) {
let t = "";
if (z(e))
t = e;
else if (K(e))
for (let n = 0; n < e.length; n++) {
const s = Os(e[n]);
s && (t += s + " ");
}
else if (de(e))
for (const n in e)
e[n] && (t += n + " ");
return t.trim();
}
function Pf(e) {
if (!e) return null;
let { class: t, style: n } = e;
return t && !z(t) && (e.class = Os(t)), n && (e.style = Is(n)), e;
}
const Qp = "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", Zp = "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", zp = "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", em = "area,base,br,col,embed,hr,img,input,link,meta,param,source,track,wbr", tm = /* @__PURE__ */ ht(Qp), nm = /* @__PURE__ */ ht(Zp), sm = /* @__PURE__ */ ht(zp), rm = /* @__PURE__ */ ht(em), im = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", om = /* @__PURE__ */ ht(im);
function kf(e) {
return !!e || e === "";
}
function lm(e, t) {
if (e.length !== t.length) return !1;
let n = !0;
for (let s = 0; n && s < e.length; s++)
n = Tn(e[s], t[s]);
return n;
}
function Tn(e, t) {
if (e === t) return !0;
let n = $c(e), s = $c(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 ? lm(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 || !Tn(e[o], t[o]))
return !1;
}
}
return String(e) === String(t);
}
function Pi(e, t) {
return e.findIndex((n) => Tn(n, t));
}
const Rf = (e) => !!(e && e.__v_isRef === !0), fl = (e) => z(e) ? e : e == null ? "" : K(e) || de(e) && (e.toString === Of || !Z(e.toString)) ? Rf(e) ? fl(e.value) : JSON.stringify(e, Mf, 2) : String(e), Mf = (e, t) => Rf(t) ? Mf(e, t.value) : cs(t) ? {
[`Map(${t.size})`]: [...t.entries()].reduce(
(n, [s, r], i) => (n[oo(s, i) + " =>"] = r, n),
{}
)
} : qn(t) ? {
[`Set(${t.size})`]: [...t.values()].map((n) => oo(n))
} : it(t) ? oo(t) : de(t) && !K(t) && !Ai(t) ? String(t) : t, oo = (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 cm(e) {
return e == null ? "initial" : typeof e == "string" ? e === "" ? " " : e : String(e);
}
let Be;
class ki {
constructor(t = !1) {
this.detached = t, this._active = !0, this._on = 0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = Be, !t && Be && (this.index = (Be.scopes || (Be.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 = Be;
try {
return Be = this, t();
} finally {
Be = n;
}
}
}
/**
* This should only be called on non-detached scopes
* @internal
*/
on() {
++this._on === 1 && (this.prevScope = Be, Be = this);
}
/**
* This should only be called on non-detached scopes
* @internal
*/
off() {
this._on > 0 && --this._on === 0 && (Be = 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 mr(e) {
return new ki(e);
}
function Ri() {
return Be;
}
function ul(e, t = !1) {
Be && Be.cleanups.push(e);
}
let ge;
const lo = /* @__PURE__ */ new WeakSet();
class ds {
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, Be && Be.active && Be.effects.push(this);
}
pause() {
this.flags |= 64;
}
resume() {
this.flags & 64 && (this.flags &= -65, lo.has(this) && (lo.delete(this), this.trigger()));
}
/**
* @internal
*/
notify() {
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || Df(this);
}
run() {
if (!(this.flags & 1))
return this.fn();
this.flags |= 2, Uc(this), Ff(this);
const t = ge, n = Ct;
ge = this, Ct = !0;
try {
return this.fn();
} finally {
$f(this), ge = t, Ct = n, this.flags &= -3;
}
}
stop() {
if (this.flags & 1) {
for (let t = this.deps; t; t = t.nextDep)
pl(t);
this.deps = this.depsTail = void 0, Uc(this), this.onStop && this.onStop(), this.flags &= -2;
}
}
trigger() {
this.flags & 64 ? lo.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
}
/**
* @internal
*/
runIfDirty() {
Co(this) && this.run();
}
get dirty() {
return Co(this);
}
}
let xf = 0, js, Ws;
function Df(e, t = !1) {
if (e.flags |= 8, t) {
e.next = Ws, Ws = e;
return;
}
e.next = js, js = e;
}
function hl() {
xf++;
}
function dl() {
if (--xf > 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 (; js; ) {
let t = js;
for (js = 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 Ff(e) {
for (let t = e.deps; t; t = t.nextDep)
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
}
function $f(e) {
let t, n = e.depsTail, s = n;
for (; s; ) {
const r = s.prevDep;
s.version === -1 ? (s === n && (n = r), pl(s), am(s)) : t = s, s.dep.activeLink = s.prevActiveLink, s.prevActiveLink = void 0, s = r;
}
e.deps = t, e.depsTail = n;
}
function Co(e) {
for (let t = e.deps; t; t = t.nextDep)
if (t.dep.version !== t.version || t.dep.computed && (Vf(t.dep.computed) || t.dep.version !== t.version))
return !0;
return !!e._dirty;
}
function Vf(e) {
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === Qs) || (e.globalVersion = Qs, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !Co(e))))
return;
e.flags |= 2;
const t = e.dep, n = ge, s = Ct;
ge = e, Ct = !0;
try {
Ff(e);
const r = e.fn(e._value);
(t.version === 0 || Je(r, e._value)) && (e.flags |= 128, e._value = r, t.version++);
} catch (r) {
throw t.version++, r;
} finally {
ge = n, Ct = s, $f(e), e.flags &= -3;
}
}
function pl(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)
pl(i, !0);
}
!t && !--n.sc && n.map && n.map.delete(n.key);
}
function am(e) {
const { prevDep: t, nextDep: n } = e;
t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
}
function Uf(e, t) {
e.effect instanceof ds && (e = e.effect.fn);
const n = new ds(e);
t && ne(n, t);
try {
n.run();
} catch (r) {
throw n.stop(), r;
}
const s = n.run.bind(n);
return s.effect = n, s;
}
function Hf(e) {
e.effect.stop();
}
let Ct = !0;
const Bf = [];
function sn() {
Bf.push(Ct), Ct = !1;
}
function rn() {
const e = Bf.pop();
Ct = e === void 0 ? !0 : e;
}
function Uc(e) {
const { cleanup: t } = e;
if (e.cleanup = void 0, t) {
const n = ge;
ge = void 0;
try {
t();
} finally {
ge = n;
}
}
}
let Qs = 0;
class fm {
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 Mi {
// 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 (!ge || !Ct || ge === this.computed)
return;
let n = this.activeLink;
if (n === void 0 || n.sub !== ge)
n = this.activeLink = new fm(ge, this), ge.deps ? (n.prevDep = ge.depsTail, ge.depsTail.nextDep = n, ge.depsTail = n) : ge.deps = ge.depsTail = n, jf(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 = ge.depsTail, n.nextDep = void 0, ge.depsTail.nextDep = n, ge.depsTail = n, ge.deps === n && (ge.deps = s);
}
return n;
}
trigger(t) {
this.version++, Qs++, this.notify(t);
}
notify(t) {
hl();
try {
for (let n = this.subs; n; n = n.prevSub)
n.sub.notify() && n.sub.dep.notify();
} finally {
dl();
}
}
}
function jf(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)
jf(s);
}
const n = e.dep.subs;
n !== e && (e.prevSub = n, n && (n.nextSub = e)), e.dep.subs = e;
}
}
const ti = /* @__PURE__ */ new WeakMap(), Fn = /* @__PURE__ */ Symbol(
""
), No = /* @__PURE__ */ Symbol(
""
), Zs = /* @__PURE__ */ Symbol(
""
);
function We(e, t, n) {
if (Ct && ge) {
let s = ti.get(e);
s || ti.set(e, s = /* @__PURE__ */ new Map());
let r = s.get(n);
r || (s.set(n, r = new Mi()), r.map = s, r.key = n), r.track();
}
}
function Xt(e, t, n, s, r, i) {
const o = ti.get(e);
if (!o) {
Qs++;
return;
}
const l = (c) => {
c && c.trigger();
};
if (hl(), t === "clear")
o.forEach(l);
else {
const c = K(e), a = c && Ii(n);
if (c && n === "length") {
const f = Number(s);
o.forEach((u, d) => {
(d === "length" || d === Zs || !it(d) && d >= f) && l(u);
});
} else
switch ((n !== void 0 || o.has(void 0)) && l(o.get(n)), a && l(o.get(Zs)), t) {
case "add":
c ? a && l(o.get("length")) : (l(o.get(Fn)), cs(e) && l(o.get(No)));
break;
case "delete":
c || (l(o.get(Fn)), cs(e) && l(o.get(No)));
break;
case "set":
cs(e) && l(o.get(Fn));
break;
}
}
dl();
}
function um(e, t) {
const n = ti.get(e);
return n && n.get(t);
}
function Zn(e) {
const t = te(e);
return t === e ? t : (We(t, "iterate", Zs), Ze(e) ? t : t.map(Ot));
}
function xi(e) {
return We(e = te(e), "iterate", Zs), e;
}
function dn(e, t) {
return It(e) ? ft(e) ? ps(Ot(t)) : ps(t) : Ot(t);
}
const hm = {
__proto__: null,
[Symbol.iterator]() {
return co(this, Symbol.iterator, (e) => dn(this, e));
},
concat(...e) {
return Zn(this).concat(
...e.map((t) => K(t) ? Zn(t) : t)
);
},
entries() {
return co(this, "entries", (e) => (e[1] = dn(this, e[1]), e));
},
every(e, t) {
return jt(this, "every", e, t, void 0, arguments);
},
filter(e, t) {
return jt(
this,
"filter",
e,
t,
(n) => n.map((s) => dn(this, s)),
arguments
);
},
find(e, t) {
return jt(
this,
"find",
e,
t,
(n) => dn(this, n),
arguments
);
},
findIndex(e, t) {
return jt(this, "findIndex", e, t, void 0, arguments);
},
findLast(e, t) {
return jt(
this,
"findLast",
e,
t,
(n) => dn(this, n),
arguments
);
},
findLastIndex(e, t) {
return jt(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 jt(this, "forEach", e, t, void 0, arguments);
},
includes(...e) {
return ao(this, "includes", e);
},
indexOf(...e) {
return ao(this, "indexOf", e);
},
join(e) {
return Zn(this).join(e);
},
// keys() iterator only reads `length`, no optimization required
lastIndexOf(...e) {
return ao(this, "lastIndexOf", e);
},
map(e, t) {
return jt(this, "map", e, t, void 0, arguments);
},
pop() {
return Ds(this, "pop");
},
push(...e) {
return Ds(this, "push", e);
},
reduce(e, ...t) {
return Hc(this, "reduce", e, t);
},
reduceRight(e, ...t) {
return Hc(this, "reduceRight", e, t);
},
shift() {
return Ds(this, "shift");
},
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
some(e, t) {
return jt(this, "some", e, t, void 0, arguments);
},
splice(...e) {
return Ds(this, "splice", e);
},
toReversed() {
return Zn(this).toReversed();
},
toSorted(e) {
return Zn(this).toSorted(e);
},
toSpliced(...e) {
return Zn(this).toSpliced(...e);
},
unshift(...e) {
return Ds(this, "unshift", e);
},
values() {
return co(this, "values", (e) => dn(this, e));
}
};
function co(e, t, n) {
const s = xi(e), r = s[t]();
return s !== e && !Ze(e) && (r._next = r.next, r.next = () => {
const i = r._next();
return i.done || (i.value = n(i.value)), i;
}), r;
}
const dm = Array.prototype;
function jt(e, t, n, s, r, i) {
const o = xi(e), l = o !== e && !Ze(e), c = o[t];
if (c !== dm[t]) {
const u = c.apply(e, i);
return l ? Ot(u) : u;
}
let a = n;
o !== e && (l ? a = function(u, d) {
return n.call(this, dn(e, u), d, e);
} : n.length > 2 && (a = function(u, d) {
return n.call(this, u, d, e);
}));
const f = c.call(o, a, s);
return l && r ? r(f) : f;
}
function Hc(e, t, n, s) {
const r = xi(e);
let i = n;
return r !== e && (Ze(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, dn(e, l), c, e);
}), r[t](i, ...s);
}
function ao(e, t, n) {
const s = te(e);
We(s, "iterate", Zs);
const r = s[t](...n);
return (r === -1 || r === !1) && ws(n[0]) ? (n[0] = te(n[0]), s[t](...n)) : r;
}
function Ds(e, t, n = []) {
sn(), hl();
const s = te(e)[t].apply(e, n);
return dl(), rn(), s;
}
const pm = /* @__PURE__ */ ht("__proto__,__v_isRef,__isVue"), Wf = new Set(
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(it)
);
function mm(e) {
it(e) || (e = String(e));
const t = te(this);
return We(t, "has", e), t.hasOwnProperty(e);
}
class Kf {
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 ? Qf : Jf : i ? Xf : Yf).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 = hm[n]))
return c;
if (n === "hasOwnProperty")
return mm;
}
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
me(t) ? t : s
);
if ((it(n) ? Wf.has(n) : pm(n)) || (r || We(t, "get", n), i))
return l;
if (me(l)) {
const c = o && Ii(n) ? l : l.value;
return r && de(c) ? zs(c) : c;
}
return de(l) ? r ? zs(l) : Ls(l) : l;
}
}
class qf extends Kf {
constructor(t = !1) {
super(!1, t);
}
set(t, n, s, r) {
let i = t[n];
const o = K(t) && Ii(n);
if (!this._isShallow) {
const a = It(i);
if (!Ze(s) && !It(s) && (i = te(i), s = te(s)), !o && me(i) && !me(s))
return a || (i.value = s), !0;
}
const l = o ? Number(n) < t.length : ae(t, n), c = Reflect.set(
t,
n,
s,
me(t) ? t : r
);
return t === te(r) && (l ? Je(s, i) && Xt(t, "set", n, s) : Xt(t, "add", n, s)), c;
}
deleteProperty(t, n) {
const s = ae(t, n);
t[n];
const r = Reflect.deleteProperty(t, n);
return r && s && Xt(t, "delete", n, void 0), r;
}
has(t, n) {
const s = Reflect.has(t, n);
return (!it(n) || !Wf.has(n)) && We(t, "has", n), s;
}
ownKeys(t) {
return We(
t,
"iterate",
K(t) ? "length" : Fn
), Reflect.ownKeys(t);
}
}
class Gf extends Kf {
constructor(t = !1) {
super(!0, t);
}
set(t, n) {
return !0;
}
deleteProperty(t, n) {
return !0;
}
}
const gm = /* @__PURE__ */ new qf(), _m = /* @__PURE__ */ new Gf(), ym = /* @__PURE__ */ new qf(!0), bm = /* @__PURE__ */ new Gf(!0), Ao = (e) => e, Lr = (e) => Reflect.getPrototypeOf(e);
function Em(e, t, n) {
return function(...s) {
const r = this.__v_raw, i = te(r), o = cs(i), l = e === "entries" || e === Symbol.iterator && o, c = e === "keys" && o, a = r[e](...s), f = n ? Ao : t ? ps : Ot;
return !t && We(
i,
"iterate",
c ? No : Fn
), {
// iterator protocol
next() {
const { value: u, done: d } = a.next();
return d ? { value: u, done: d } : {
value: l ? [f(u[0]), f(u[1])] : f(u),
done: d
};
},
// iterable protocol
[Symbol.iterator]() {
return this;
}
};
};
}
function wr(e) {
return function(...t) {
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
};
}
function Sm(e, t) {
const n = {
get(r) {
const i = this.__v_raw, o = te(i), l = te(r);
e || (Je(r, l) && We(o, "get", r), We(o, "get", l));
const { has: c } = Lr(o), a = t ? Ao : e ? ps : Ot;
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 && We(te(r), "iterate", Fn), r.size;
},
has(r) {
const i = this.__v_raw, o = te(i), l = te(r);
return e || (Je(r, l) && We(o, "has", r), We(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 = te(l), a = t ? Ao : e ? ps : Ot;
return !e && We(c, "iterate", Fn), l.forEach((f, u) => r.call(i, a(f), a(u), o));
}
};
return ne(
n,
e ? {
add: wr("add"),
set: wr("set"),
delete: wr("delete"),
clear: wr("clear")
} : {
add(r) {
!t && !Ze(r) && !It(r) && (r = te(r));
const i = te(this);
return Lr(i).has.call(i, r) || (i.add(r), Xt(i, "add", r, r)), this;
},
set(r, i) {
!t && !Ze(i) && !It(i) && (i = te(i));
const o = te(this), { has: l, get: c } = Lr(o);
let a = l.call(o, r);
a || (r = te(r), a = l.call(o, r));
const f = c.call(o, r);
return o.set(r, i), a ? Je(i, f) && Xt(o, "set", r, i) : Xt(o, "add", r, i), this;
},
delete(r) {
const i = te(this), { has: o, get: l } = Lr(i);
let c = o.call(i, r);
c || (r = te(r), c = o.call(i, r)), l && l.call(i, r);
const a = i.delete(r);
return c && Xt(i, "delete", r, void 0), a;
},
clear() {
const r = te(this), i = r.size !== 0, o = r.clear();
return i && Xt(
r,
"clear",
void 0,
void 0
), o;
}
}
), [
"keys",
"values",
"entries",
Symbol.iterator
].forEach((r) => {
n[r] = Em(r, e, t);
}), n;
}
function Di(e, t) {
const n = Sm(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 Tm = {
get: /* @__PURE__ */ Di(!1, !1)
}, vm = {
get: /* @__PURE__ */ Di(!1, !0)
}, Cm = {
get: /* @__PURE__ */ Di(!0, !1)
}, Nm = {
get: /* @__PURE__ */ Di(!0, !0)
}, Yf = /* @__PURE__ */ new WeakMap(), Xf = /* @__PURE__ */ new WeakMap(), Jf = /* @__PURE__ */ new WeakMap(), Qf = /* @__PURE__ */ new WeakMap();
function Am(e) {
switch (e) {
case "Object":
case "Array":
return 1;
case "Map":
case "Set":
case "WeakMap":
case "WeakSet":
return 2;
default:
return 0;
}
}
function Im(e) {
return e.__v_skip || !Object.isExtensible(e) ? 0 : Am(Hp(e));
}
function Ls(e) {
return It(e) ? e : Fi(
e,
!1,
gm,
Tm,
Yf
);
}
function ml(e) {
return Fi(
e,
!1,
ym,
vm,
Xf
);
}
function zs(e) {
return Fi(
e,
!0,
_m,
Cm,
Jf
);
}
function Zf(e) {
return Fi(
e,
!0,
bm,
Nm,
Qf
);
}
function Fi(e, t, n, s, r) {
if (!de(e) || e.__v_raw && !(t && e.__v_isReactive))
return e;
const i = Im(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 ft(e) {
return It(e) ? ft(e.__v_raw) : !!(e && e.__v_isReactive);
}
function It(e) {
return !!(e && e.__v_isReadonly);
}
function Ze(e) {
return !!(e && e.__v_isShallow);
}
function ws(e) {
return e ? !!e.__v_raw : !1;
}
function te(e) {
const t = e && e.__v_raw;
return t ? te(t) : e;
}
function gr(e) {
return !ae(e, "__v_skip") && Object.isExtensible(e) && Lf(e, "__v_skip", !0), e;
}
const Ot = (e) => de(e) ? Ls(e) : e, ps = (e) => de(e) ? zs(e) : e;
function me(e) {
return e ? e.__v_isRef === !0 : !1;
}
function en(e) {
return zf(e, !1);
}
function $i(e) {
return zf(e, !0);
}
function zf(e, t) {
return me(e) ? e : new Om(e, t);
}
class Om {
constructor(t, n) {
this.dep = new Mi(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = n ? t : te(t), this._value = n ? t : Ot(t), this.__v_isShallow = n;
}
get value() {
return this.dep.track(), this._value;
}
set value(t) {
const n = this._rawValue, s = this.__v_isShallow || Ze(t) || It(t);
t = s ? t : te(t), Je(t, n) && (this._rawValue = t, this._value = s ? t : Ot(t), this.dep.trigger());
}
}
function eu(e) {
e.dep && e.dep.trigger();
}
function Ps(e) {
return me(e) ? e.value : e;
}
function tu(e) {
return Z(e) ? e() : Ps(e);
}
const Lm = {
get: (e, t, n) => t === "__v_raw" ? e : Ps(Reflect.get(e, t, n)),
set: (e, t, n, s) => {
const r = e[t];
return me(r) && !me(n) ? (r.value = n, !0) : Reflect.set(e, t, n, s);
}
};
function Vi(e) {
return ft(e) ? e : new Proxy(e, Lm);
}
class wm {
constructor(t) {
this.__v_isRef = !0, this._value = void 0;
const n = this.dep = new Mi(), { 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 gl(e) {
return new wm(e);
}
function _l(e) {
const t = K(e) ? new Array(e.length) : {};
for (const n in e)
t[n] = nu(e, n);
return t;
}
class Pm {
constructor(t, n, s) {
this._object = t, this._key = n, this._defaultValue = s, this.__v_isRef = !0, this._value = void 0, this._raw = te(t);
let r = !0, i = t;
if (!K(t) || !Ii(String(n)))
do
r = !ws(i) || Ze(i);
while (r && (i = i.__v_raw));
this._shallow = r;
}
get value() {
let t = this._object[this._key];
return this._shallow && (t = Ps(t)), this._value = t === void 0 ? this._defaultValue : t;
}
set value(t) {
if (this._shallow && me(this._raw[this._key])) {
const n = this._object[this._key];
if (me(n)) {
n.value = t;
return;
}
}
this._object[this._key] = t;
}
get dep() {
return um(this._raw, this._key);
}
}
class km {
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 yl(e, t, n) {
return me(e) ? e : Z(e) ? new km(e) : de(e) && arguments.length > 1 ? nu(e, t, n) : en(e);
}
function nu(e, t, n) {
return new Pm(e, t, n);
}
class Rm {
constructor(t, n, s) {
this.fn = t, this.setter = n, this._value = void 0, this.dep = new Mi(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = Qs - 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
ge !== this)
return Df(this, !0), !0;
}
get value() {
const t = this.dep.track();
return Vf(this), t && (t.version = this.dep.version), this._value;
}
set value(t) {
this.setter && this.setter(t);
}
}
function Mm(e, t, n = !1) {
let s, r;
return Z(e) ? s = e : (s = e.get, r = e.set), new Rm(s, r, n);
}
const su = {
GET: "get",
HAS: "has",
ITERATE: "iterate"
}, ru = {
SET: "set",
ADD: "add",
DELETE: "delete",
CLEAR: "clear"
}, Pr = {}, ni = /* @__PURE__ */ new WeakMap();
let pn;
function iu() {
return pn;
}
function bl(e, t = !1, n = pn) {
if (n) {
let s = ni.get(n);
s || ni.set(n, s = []), s.push(e);
}
}
function xm(e, t, n = ie) {
const { immediate: s, deep: r, once: i, scheduler: o, augmentJob: l, call: c } = n, a = (p) => r ? p : Ze(p) || r === !1 || r === 0 ? Jt(p, 1) : Jt(p);
let f, u, d, _, v = !1, T = !1;
if (me(e) ? (u = () => e.value, v = Ze(e)) : ft(e) ? (u = () => a(e), v = !0) : K(e) ? (T = !0, v = e.some((p) => ft(p) || Ze(p)), u = () => e.map((p) => {
if (me(p))
return p.value;
if (ft(p))
return a(p);
if (Z(p))
return c ? c(p, 2) : p();
})) : Z(e) ? t ? u = c ? () => c(e, 2) : e : u = () => {
if (d) {
sn();
try {
d();
} finally {
rn();
}
}
const p = pn;
pn = f;
try {
return c ? c(e, 3, [_]) : e(_);
} finally {
pn = p;
}
} : u = $e, t && r) {
const p = u, S = r === !0 ? 1 / 0 : r;
u = () => Jt(p(), S);
}
const P = Ri(), y = () => {
f.stop(), P && P.active && cl(P.effects, f);
};
if (i && t) {
const p = t;
t = (...S) => {
p(...S), y();
};
}
let E = T ? new Array(e.length).fill(Pr) : Pr;
const m = (p) => {
if (!(!(f.flags & 1) || !f.dirty && !p))
if (t) {
const S = f.run();
if (r || v || (T ? S.some((O, L) => Je(O, E[L])) : Je(S, E))) {
d && d();
const O = pn;
pn = f;
try {
const L = [
S,
// pass undefined as the old value when it's changed for the first time
E === Pr ? void 0 : T && E[0] === Pr ? [] : E,
_
];
E = S, c ? c(t, 3, L) : (
// @ts-expect-error
t(...L)
);
} finally {
pn = O;
}
}
} else
f.run();
};
return l && l(m), f = new ds(u), f.scheduler = o ? () => o(m, !1) : m, _ = (p) => bl(p, !1, f), d = f.onStop = () => {
const p = ni.get(f);
if (p) {
if (c)
c(p, 4);
else
for (const S of p) S();
ni.delete(f);
}
}, t ? s ? m(!0) : E = 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 Map(), (n.get(e) || 0) >= t))
return e;
if (n.set(e, t), t--, me(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 (qn(e) || cs(e))
e.forEach((s) => {
Jt(s, t, n);
});
else if (Ai(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;
}
const ou = [];
function Dm(e) {
ou.push(e);
}
function Fm() {
ou.pop();
}
function lu(e, t) {
}
const cu = {
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"
}, $m = {
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 Gn(e, t, n, s) {
try {
return s ? e(...s) : e();
} catch (r) {
Nn(r, t, n);
}
}
function ut(e, t, n, s) {
if (Z(e)) {
const r = Gn(e, t, n, s);
return r && al(r) && r.catch((i) => {
Nn(i, t, n);
}), r;
}
if (K(e)) {
const r = [];
for (let i = 0; i < e.length; i++)
r.push(ut(e[i], t, n, s));
return r;
}
}
function Nn(e, t, n, s = !0) {
const r = t ? t.vnode : null, { errorHandler: i, throwUnhandledErrorInProduction: o } = t && t.appContext.config || ie;
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) {
sn(), Gn(i, null, 10, [
e,
c,
a
]), rn();
return;
}
}
Vm(e, n, r, s, o);
}
function Vm(e, t, n, s = !0, r = !1) {
if (r)
throw e;
console.error(e);
}
const Qe = [];
let xt = -1;
const fs = [];
let mn = null, ns = 0;
const au = /* @__PURE__ */ Promise.resolve();
let si = null;
function ks(e) {
const t = si || au;
return e ? t.then(this ? e.bind(this) : e) : t;
}
function Um(e) {
let t = xt + 1, n = Qe.length;
for (; t < n; ) {
const s = t + n >>> 1, r = Qe[s], i = er(r);
i < e || i === e && r.flags & 2 ? t = s + 1 : n = s;
}
return t;
}
function El(e) {
if (!(e.flags & 1)) {
const t = er(e), n = Qe[Qe.length - 1];
!n || // fast path when the job id is larger than the tail
!(e.flags & 2) && t >= er(n) ? Qe.push(e) : Qe.splice(Um(t), 0, e), e.flags |= 1, fu();
}
}
function fu() {
si || (si = au.then(uu));
}
function ms(e) {
K(e) ? fs.push(...e) : mn && e.id === -1 ? mn.splice(ns + 1, 0, e) : e.flags & 1 || (fs.push(e), e.flags |= 1), fu();
}
function Bc(e, t, n = xt + 1) {
for (; n < Qe.length; n++) {
const s = Qe[n];
if (s && s.flags & 2) {
if (e && s.id !== e.uid)
continue;
Qe.splice(n, 1), n--, s.flags & 4 && (s.flags &= -2), s(), s.flags & 4 || (s.flags &= -2);
}
}
}
function ri(e) {
if (fs.length) {
const t = [...new Set(fs)].sort(
(n, s) => er(n) - er(s)
);
if (fs.length = 0, mn) {
mn.push(...t);
return;
}
for (mn = t, ns = 0; ns < mn.length; ns++) {
const n = mn[ns];
n.flags & 4 && (n.flags &= -2), n.flags & 8 || n(), n.flags &= -2;
}
mn = null, ns = 0;
}
}
const er = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
function uu(e) {
try {
for (xt = 0; xt < Qe.length; xt++) {
const t = Qe[xt];
t && !(t.flags & 8) && (t.flags & 4 && (t.flags &= -2), Gn(
t,
t.i,
t.i ? 15 : 14
), t.flags & 4 || (t.flags &= -2));
}
} finally {
for (; xt < Qe.length; xt++) {
const t = Qe[xt];
t && (t.flags &= -2);
}
xt = -1, Qe.length = 0, ri(), si = null, (Qe.length || fs.length) && uu();
}
}
let ss, kr = [];
function hu(e, t) {
var n, s;
ss = e, ss ? (ss.enabled = !0, kr.forEach(({ event: r, args: i }) => ss.emit(r, ...i)), kr = []) : /* 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) => {
hu(i, t);
}), setTimeout(() => {
ss || (t.__VUE_DEVTOOLS_HOOK_REPLAY__ = null, kr = []);
}, 3e3)) : kr = [];
}
let Fe = null, Ui = null;
function tr(e) {
const t = Fe;
return Fe = e, Ui = e && e.type.__scopeId || null, t;
}
function du(e) {
Ui = e;
}
function pu() {
Ui = null;
}
const mu = (e) => Hi;
function Hi(e, t = Fe, n) {
if (!t || e._n)
return e;
const s = (...r) => {
s._d && _s(-1);
const i = tr(t);
let o;
try {
o = e(...r);
} finally {
tr(i), s._d && _s(1);
}
return o;
};
return s._n = !0, s._c = !0, s._d = !0, s;
}
function gu(e, t) {
if (Fe === null)
return e;
const n = Tr(Fe), s = e.dirs || (e.dirs = []);
for (let r = 0; r < t.length; r++) {
let [i, o, l, c = ie] = 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 Dt(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 && (sn(), ut(c, n, 8, [
e.el,
l,
e,
t
]), rn());
}
}
function Sl(e, t) {
if (De) {
let n = De.provides;
const s = De.parent && De.parent.provides;
s === n && (n = De.provides = Object.create(s)), n[e] = t;
}
}
function bn(e, t, n = !1) {
const s = Ge();
if (s || $n) {
let r = $n ? $n._context.provides : s ? s.parent == null || s.ce ? 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 && Z(t) ? t.call(s && s.proxy) : t;
}
}
function Tl() {
return !!(Ge() || $n);
}
const vl = /* @__PURE__ */ Symbol.for("v-scx"), Cl = () => bn(vl);
function _u(e, t) {
return _r(e, null, t);
}
function yu(e, t) {
return _r(
e,
null,
{ flush: "post" }
);
}
function Nl(e, t) {
return _r(
e,
null,
{ flush: "sync" }
);
}
function Nt(e, t, n) {
return _r(e, t, n);
}
function _r(e, t, n = ie) {
const { immediate: s, deep: r, flush: i, once: o } = n, l = ne({}, n), c = t && s || !t && i !== "post";
let a;
if (ys) {
if (i === "sync") {
const _ = Cl();
a = _.__watcherHandles || (_.__watcherHandles = []);
} else if (!c) {
const _ = () => {
};
return _.stop = $e, _.resume = $e, _.pause = $e, _;
}
}
const f = De;
l.call = (_, v, T) => ut(_, f, v, T);
let u = !1;
i === "post" ? l.scheduler = (_) => {
Le(_, f && f.suspense);
} : i !== "sync" && (u = !0, l.scheduler = (_, v) => {
v ? _() : El(_);
}), l.augmentJob = (_) => {
t && (_.flags |= 4), u && (_.flags |= 2, f && (_.id = f.uid, _.i = f));
};
const d = xm(e, t, l);
return ys && (a ? a.push(d) : c && d()), d;
}
function Hm(e, t, n) {
const s = this.proxy, r = z(e) ? e.includes(".") ? bu(s, e) : () => s[e] : e.bind(s, s);
let i;
Z(t) ? i = t : (i = t.handler, n = t);
const o = jn(this), l = _r(r, i.bind(s), n);
return o(), l;
}
function bu(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 Eu = /* @__PURE__ */ Symbol("_vte"), Su = (e) => e.__isTeleport, Ks = (e) => e && (e.disabled || e.disabled === ""), jc = (e) => e && (e.defer || e.defer === ""), Wc = (e) => typeof SVGElement < "u" && e instanceof SVGElement, Kc = (e) => typeof MathMLElement == "function" && e instanceof MathMLElement, Io = (e, t) => {
const n = e && e.to;
return z(n) ? t ? t(n) : null : n;
}, Tu = {
name: "Teleport",
__isTeleport: !0,
process(e, t, n, s, r, i, o, l, c, a) {
const {
mc: f,
pc: u,
pbc: d,
o: { insert: _, querySelector: v, createText: T, createComment: P }
} = a, y = Ks(t.props);
let { shapeFlag: E, children: m, dynamicChildren: p } = t;
if (e == null) {
const S = t.el = T(""), O = t.anchor = T("");
_(S, n, s), _(O, n, s);
const L = (A, k) => {
E & 16 && f(
m,
A,
k,
r,
i,
o,
l,
c
);
}, M = () => {
const A = t.target = Io(t.props, v), k = Cu(A, t, T, _);
A && (o !== "svg" && Wc(A) ? o = "svg" : o !== "mathml" && Kc(A) && (o = "mathml"), r && r.isCE && (r.ce._teleportTargets || (r.ce._teleportTargets = /* @__PURE__ */ new Set())).add(A), y || (L(A, k), Kr(t, !1)));
};
y && (L(n, O), Kr(t, !0)), jc(t.props) ? (t.el.__isMounted = !1, Le(() => {
M(), delete t.el.__isMounted;
}, i)) : M();
} else {
if (jc(t.props) && e.el.__isMounted === !1) {
Le(() => {
Tu.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, M = Ks(e.props), A = M ? n : O, k = M ? S : L;
if (o === "svg" || Wc(O) ? o = "svg" : (o === "mathml" || Kc(O)) && (o = "mathml"), p ? (d(
e.dynamicChildren,
p,
A,
r,
i,
o,
l
), jl(e, t, !0)) : c || u(
e,
t,
A,
k,
r,
i,
o,
l,
!1
), y)
M ? t.props && e.props && t.props.to !== e.props.to && (t.props.to = e.props.to) : Rr(
t,
n,
S,
a,
1
);
else if ((t.props && t.props.to) !== (e.props && e.props.to)) {
const $ = t.target = Io(
t.props,
v
);
$ && Rr(
t,
$,
null,
a,
0
);
} else M && Rr(
t,
O,
L,
a,
1
);
Kr(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: d
} = e;
if (u && (r(a), r(f)), i && r(c), o & 16) {
const _ = i || !Ks(d);
for (let v = 0; v < l.length; v++) {
const T = l[v];
s(
T,
t,
n,
_,
!!T.dynamicChildren
);
}
}
},
move: Rr,
hydrate: Bm
};
function Rr(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 || Ks(f)) && c & 16)
for (let d = 0; d < a.length; d++)
r(
a[d],
t,
n,
2
);
u && s(l, t, n);
}
function Bm(e, t, n, s, r, i, {
o: { nextSibling: o, parentNode: l, querySelector: c, insert: a, createText: f }
}, u) {
function d(T, P, y, E) {
P.anchor = u(
o(T),
P,
l(T),
n,
s,
r,
i
), P.targetStart = y, P.targetAnchor = E;
}
const _ = t.target = Io(
t.props,
c
), v = Ks(t.props);
if (_) {
const T = _._lpa || _.firstChild;
if (t.shapeFlag & 16)
if (v)
d(
e,
t,
T,
T && o(T)
);
else {
t.anchor = o(e);
let P = T;
for (; P; ) {
if (P && P.nodeType === 8) {
if (P.data === "teleport start anchor")
t.targetStart = P;
else if (P.data === "teleport anchor") {
t.targetAnchor = P, _._lpa = t.targetAnchor && o(t.targetAnchor);
break;
}
}
P = o(P);
}
t.targetAnchor || Cu(_, t, f, a), u(
T && o(T),
t,
_,
n,
s,
r,
i
);
}
Kr(t, v);
} else v && t.shapeFlag & 16 && d(e, t, e, o(e));
return t.anchor && o(t.anchor);
}
const vu = Tu;
function Kr(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 Cu(e, t, n, s) {
const r = t.targetStart = n(""), i = t.targetAnchor = n("");
return r[Eu] = i, e && (s(r, e), s(i, e)), i;
}
const Yt = /* @__PURE__ */ Symbol("_leaveCb"), Mr = /* @__PURE__ */ Symbol("_enterCb");
function Bi() {
const e = {
isMounted: !1,
isLeaving: !1,
isUnmounting: !1,
leavingVNodes: /* @__PURE__ */ new Map()
};
return Xn(() => {
e.isMounted = !0;
}), Sr(() => {
e.isUnmounting = !0;
}), e;
}
const mt = [Function, Array], ji = {
mode: String,
appear: Boolean,
persisted: Boolean,
// enter
onBeforeEnter: mt,
onEnter: mt,
onAfterEnter: mt,
onEnterCancelled: mt,
// leave
onBeforeLeave: mt,
onLeave: mt,
onAfterLeave: mt,
onLeaveCancelled: mt,
// appear
onBeforeAppear: mt,
onAppear: mt,
onAfterAppear: mt,
onAppearCancelled: mt
}, Nu = (e) => {
const t = e.subTree;
return t.component ? Nu(t.component) : t;
}, jm = {
name: "BaseTransition",
props: ji,
setup(e, { slots: t }) {
const n = Ge(), s = Bi();
return () => {
const r = t.default && yr(t.default(), !0);
if (!r || !r.length)
return;
const i = Au(r), o = te(e), { mode: l } = o;
if (s.isLeaving)
return fo(i);
const c = qc(i);
if (!c)
return fo(i);
let a = Hn(
c,
o,
s,
n,
// #11061, ensure enterHooks is fresh after clone
(u) => a = u
);
c.type !== Ne && Ut(c, a);
let f = n.subTree && qc(n.subTree);
if (f && f.type !== Ne && !Tt(f, c) && Nu(n).type !== Ne) {
let u = Hn(
f,
o,
s,
n
);
if (Ut(f, u), l === "out-in" && c.type !== Ne)
return s.isLeaving = !0, u.afterLeave = () => {
s.isLeaving = !1, n.job.flags & 8 || n.update(), delete u.afterLeave, f = void 0;
}, fo(i);
l === "in-out" && c.type !== Ne ? u.delayLeave = (d, _, v) => {
const T = Iu(
s,
f
)