UNPKG

grid-cms

Version:

The easiest way to manage data in Firestore.

1,727 lines 2.59 MB
import './style.css'; const ZV = "1.5.6"; // @__NO_SIDE_EFFECTS__ function El(t) { const e = /* @__PURE__ */ Object.create(null); for (const n of t.split(",")) e[n] = 1; return (n) => n in e; } const Wt = process.env.NODE_ENV !== "production" ? Object.freeze({}) : {}, cf = process.env.NODE_ENV !== "production" ? Object.freeze([]) : [], dr = () => { }, Lq = () => !1, P_ = (t) => t.charCodeAt(0) === 111 && t.charCodeAt(1) === 110 && // uppercase letter (t.charCodeAt(2) > 122 || t.charCodeAt(2) < 97), KE = (t) => t.startsWith("onUpdate:"), _n = Object.assign, pC = (t, e) => { const n = t.indexOf(e); n > -1 && t.splice(n, 1); }, Vq = Object.prototype.hasOwnProperty, Qt = (t, e) => Vq.call(t, e), Ze = Array.isArray, Yu = (t) => N_(t) === "[object Map]", mp = (t) => N_(t) === "[object Set]", OP = (t) => N_(t) === "[object Date]", ot = (t) => typeof t == "function", Cn = (t) => typeof t == "string", mo = (t) => typeof t == "symbol", Zt = (t) => t !== null && typeof t == "object", mC = (t) => (Zt(t) || ot(t)) && ot(t.then) && ot(t.catch), QV = Object.prototype.toString, N_ = (t) => QV.call(t), gC = (t) => N_(t).slice(8, -1), YV = (t) => N_(t) === "[object Object]", _C = (t) => Cn(t) && t !== "NaN" && t[0] !== "-" && "" + parseInt(t, 10) === t, Gm = /* @__PURE__ */ El( // the leading comma is intentional so empty string "" is also included ",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted" ), Fq = /* @__PURE__ */ El( "bind,cloak,else-if,else,for,html,if,model,on,once,pre,show,slot,text,memo" ), t0 = (t) => { const e = /* @__PURE__ */ Object.create(null); return (n) => e[n] || (e[n] = t(n)); }, $q = /-(\w)/g, ii = t0( (t) => t.replace($q, (e, n) => n ? n.toUpperCase() : "") ), Bq = /\B([A-Z])/g, ta = t0( (t) => t.replace(Bq, "-$1").toLowerCase() ), mh = t0((t) => t.charAt(0).toUpperCase() + t.slice(1)), Gl = t0( (t) => t ? `on${mh(t)}` : "" ), Oi = (t, e) => !Object.is(t, e), Md = (t, ...e) => { for (let n = 0; n < t.length; n++) t[n](...e); }, GE = (t, e, n, r = !1) => { Object.defineProperty(t, e, { configurable: !0, enumerable: !1, writable: r, value: n }); }, JE = (t) => { const e = parseFloat(t); return isNaN(e) ? t : e; }, Uq = (t) => { const e = Cn(t) ? Number(t) : NaN; return isNaN(e) ? t : e; }; let MP; const O_ = () => MP || (MP = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {}); function si(t) { if (Ze(t)) { const e = {}; for (let n = 0; n < t.length; n++) { const r = t[n], i = Cn(r) ? qq(r) : si(r); if (i) for (const s in i) e[s] = i[s]; } return e; } else if (Cn(t) || Zt(t)) return t; } const zq = /;(?![^(]*\))/g, Hq = /:([^]+)/, jq = /\/\*[^]*?\*\//g; function qq(t) { const e = {}; return t.replace(jq, "").split(zq).forEach((n) => { if (n) { const r = n.split(Hq); r.length > 1 && (e[r[0].trim()] = r[1].trim()); } }), e; } function Ft(t) { let e = ""; if (Cn(t)) e = t; else if (Ze(t)) for (let n = 0; n < t.length; n++) { const r = Ft(t[n]); r && (e += r + " "); } else if (Zt(t)) for (const n in t) t[n] && (e += n + " "); return e.trim(); } const Wq = "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", Kq = "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", Gq = "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", Jq = /* @__PURE__ */ El(Wq), Zq = /* @__PURE__ */ El(Kq), Qq = /* @__PURE__ */ El(Gq), Yq = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", Xq = /* @__PURE__ */ El(Yq); function XV(t) { return !!t || t === ""; } function e8(t, e) { if (t.length !== e.length) return !1; let n = !0; for (let r = 0; n && r < t.length; r++) n = gh(t[r], e[r]); return n; } function gh(t, e) { if (t === e) return !0; let n = OP(t), r = OP(e); if (n || r) return n && r ? t.getTime() === e.getTime() : !1; if (n = mo(t), r = mo(e), n || r) return t === e; if (n = Ze(t), r = Ze(e), n || r) return n && r ? e8(t, e) : !1; if (n = Zt(t), r = Zt(e), n || r) { if (!n || !r) return !1; const i = Object.keys(t).length, s = Object.keys(e).length; if (i !== s) return !1; for (const o in t) { const a = t.hasOwnProperty(o), l = e.hasOwnProperty(o); if (a && !l || !a && l || !gh(t[o], e[o])) return !1; } } return String(t) === String(e); } function yC(t, e) { return t.findIndex((n) => gh(n, e)); } const eF = (t) => !!(t && t.__v_isRef === !0), Yt = (t) => Cn(t) ? t : t == null ? "" : Ze(t) || Zt(t) && (t.toString === QV || !ot(t.toString)) ? eF(t) ? Yt(t.value) : JSON.stringify(t, tF, 2) : String(t), tF = (t, e) => eF(e) ? tF(t, e.value) : Yu(e) ? { [`Map(${e.size})`]: [...e.entries()].reduce( (n, [r, i], s) => (n[KS(r, s) + " =>"] = i, n), {} ) } : mp(e) ? { [`Set(${e.size})`]: [...e.values()].map((n) => KS(n)) } : mo(e) ? KS(e) : Zt(e) && !Ze(e) && !YV(e) ? String(e) : e, KS = (t, e = "") => { var n; return ( // Symbol.description in es2019+ so we need to cast here to pass // the lib: es2016 check mo(t) ? `Symbol(${(n = t.description) != null ? n : e})` : t ); }; function Ls(t, ...e) { console.warn(`[Vue warn] ${t}`, ...e); } let _i; class nF { constructor(e = !1) { this.detached = e, this._active = !0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = _i, !e && _i && (this.index = (_i.scopes || (_i.scopes = [])).push( this ) - 1); } get active() { return this._active; } pause() { if (this._active) { this._isPaused = !0; let e, n; if (this.scopes) for (e = 0, n = this.scopes.length; e < n; e++) this.scopes[e].pause(); for (e = 0, n = this.effects.length; e < n; e++) this.effects[e].pause(); } } /** * Resumes the effect scope, including all child scopes and effects. */ resume() { if (this._active && this._isPaused) { this._isPaused = !1; let e, n; if (this.scopes) for (e = 0, n = this.scopes.length; e < n; e++) this.scopes[e].resume(); for (e = 0, n = this.effects.length; e < n; e++) this.effects[e].resume(); } } run(e) { if (this._active) { const n = _i; try { return _i = this, e(); } finally { _i = n; } } else process.env.NODE_ENV !== "production" && Ls("cannot run an inactive effect scope."); } /** * This should only be called on non-detached scopes * @internal */ on() { _i = this; } /** * This should only be called on non-detached scopes * @internal */ off() { _i = this.parent; } stop(e) { if (this._active) { this._active = !1; let n, r; for (n = 0, r = this.effects.length; n < r; n++) this.effects[n].stop(); for (this.effects.length = 0, n = 0, r = this.cleanups.length; n < r; n++) this.cleanups[n](); if (this.cleanups.length = 0, this.scopes) { for (n = 0, r = this.scopes.length; n < r; n++) this.scopes[n].stop(!0); this.scopes.length = 0; } if (!this.detached && this.parent && !e) { const i = this.parent.scopes.pop(); i && i !== this && (this.parent.scopes[this.index] = i, i.index = this.index); } this.parent = void 0; } } } function rF(t) { return new nF(t); } function n0() { return _i; } function vC(t, e = !1) { _i ? _i.cleanups.push(t) : process.env.NODE_ENV !== "production" && !e && Ls( "onScopeDispose() is called when there is no active effect scope to be associated with." ); } let rn; const GS = /* @__PURE__ */ new WeakSet(); class iF { constructor(e) { this.fn = e, this.deps = void 0, this.depsTail = void 0, this.flags = 5, this.next = void 0, this.cleanup = void 0, this.scheduler = void 0, _i && _i.active && _i.effects.push(this); } pause() { this.flags |= 64; } resume() { this.flags & 64 && (this.flags &= -65, GS.has(this) && (GS.delete(this), this.trigger())); } /** * @internal */ notify() { this.flags & 2 && !(this.flags & 32) || this.flags & 8 || oF(this); } run() { if (!(this.flags & 1)) return this.fn(); this.flags |= 2, DP(this), aF(this); const e = rn, n = ao; rn = this, ao = !0; try { return this.fn(); } finally { process.env.NODE_ENV !== "production" && rn !== this && Ls( "Active effect was not restored correctly - this is likely a Vue internal bug." ), lF(this), rn = e, ao = n, this.flags &= -3; } } stop() { if (this.flags & 1) { for (let e = this.deps; e; e = e.nextDep) wC(e); this.deps = this.depsTail = void 0, DP(this), this.onStop && this.onStop(), this.flags &= -2; } } trigger() { this.flags & 64 ? GS.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty(); } /** * @internal */ runIfDirty() { NI(this) && this.run(); } get dirty() { return NI(this); } } let sF = 0, Jm, Zm; function oF(t, e = !1) { if (t.flags |= 8, e) { t.next = Zm, Zm = t; return; } t.next = Jm, Jm = t; } function EC() { sF++; } function bC() { if (--sF > 0) return; if (Zm) { let e = Zm; for (Zm = void 0; e; ) { const n = e.next; e.next = void 0, e.flags &= -9, e = n; } } let t; for (; Jm; ) { let e = Jm; for (Jm = void 0; e; ) { const n = e.next; if (e.next = void 0, e.flags &= -9, e.flags & 1) try { e.trigger(); } catch (r) { t || (t = r); } e = n; } } if (t) throw t; } function aF(t) { for (let e = t.deps; e; e = e.nextDep) e.version = -1, e.prevActiveLink = e.dep.activeLink, e.dep.activeLink = e; } function lF(t) { let e, n = t.depsTail, r = n; for (; r; ) { const i = r.prevDep; r.version === -1 ? (r === n && (n = i), wC(r), t8(r)) : e = r, r.dep.activeLink = r.prevActiveLink, r.prevActiveLink = void 0, r = i; } t.deps = e, t.depsTail = n; } function NI(t) { for (let e = t.deps; e; e = e.nextDep) if (e.dep.version !== e.version || e.dep.computed && (cF(e.dep.computed) || e.dep.version !== e.version)) return !0; return !!t._dirty; } function cF(t) { if (t.flags & 4 && !(t.flags & 16) || (t.flags &= -17, t.globalVersion === xg)) return; t.globalVersion = xg; const e = t.dep; if (t.flags |= 2, e.version > 0 && !t.isSSR && t.deps && !NI(t)) { t.flags &= -3; return; } const n = rn, r = ao; rn = t, ao = !0; try { aF(t); const i = t.fn(t._value); (e.version === 0 || Oi(i, t._value)) && (t._value = i, e.version++); } catch (i) { throw e.version++, i; } finally { rn = n, ao = r, lF(t), t.flags &= -3; } } function wC(t, e = !1) { const { dep: n, prevSub: r, nextSub: i } = t; if (r && (r.nextSub = i, t.prevSub = void 0), i && (i.prevSub = r, t.nextSub = void 0), process.env.NODE_ENV !== "production" && n.subsHead === t && (n.subsHead = i), n.subs === t && (n.subs = r, !r && n.computed)) { n.computed.flags &= -5; for (let s = n.computed.deps; s; s = s.nextDep) wC(s, !0); } !e && !--n.sc && n.map && n.map.delete(n.key); } function t8(t) { const { prevDep: e, nextDep: n } = t; e && (e.nextDep = n, t.prevDep = void 0), n && (n.prevDep = e, t.nextDep = void 0); } let ao = !0; const uF = []; function bl() { uF.push(ao), ao = !1; } function wl() { const t = uF.pop(); ao = t === void 0 ? !0 : t; } function DP(t) { const { cleanup: e } = t; if (t.cleanup = void 0, e) { const n = rn; rn = void 0; try { e(); } finally { rn = n; } } } let xg = 0, n8 = class { constructor(e, n) { this.sub = e, this.dep = n, this.version = n.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0; } }; class r0 { constructor(e) { this.computed = e, this.version = 0, this.activeLink = void 0, this.subs = void 0, this.map = void 0, this.key = void 0, this.sc = 0, process.env.NODE_ENV !== "production" && (this.subsHead = void 0); } track(e) { if (!rn || !ao || rn === this.computed) return; let n = this.activeLink; if (n === void 0 || n.sub !== rn) n = this.activeLink = new n8(rn, this), rn.deps ? (n.prevDep = rn.depsTail, rn.depsTail.nextDep = n, rn.depsTail = n) : rn.deps = rn.depsTail = n, hF(n); else if (n.version === -1 && (n.version = this.version, n.nextDep)) { const r = n.nextDep; r.prevDep = n.prevDep, n.prevDep && (n.prevDep.nextDep = r), n.prevDep = rn.depsTail, n.nextDep = void 0, rn.depsTail.nextDep = n, rn.depsTail = n, rn.deps === n && (rn.deps = r); } return process.env.NODE_ENV !== "production" && rn.onTrack && rn.onTrack( _n( { effect: rn }, e ) ), n; } trigger(e) { this.version++, xg++, this.notify(e); } notify(e) { EC(); try { if (process.env.NODE_ENV !== "production") for (let n = this.subsHead; n; n = n.nextSub) n.sub.onTrigger && !(n.sub.flags & 8) && n.sub.onTrigger( _n( { effect: n.sub }, e ) ); for (let n = this.subs; n; n = n.prevSub) n.sub.notify() && n.sub.dep.notify(); } finally { bC(); } } } function hF(t) { if (t.dep.sc++, t.sub.flags & 4) { const e = t.dep.computed; if (e && !t.dep.subs) { e.flags |= 20; for (let r = e.deps; r; r = r.nextDep) hF(r); } const n = t.dep.subs; n !== t && (t.prevSub = n, n && (n.nextSub = t)), process.env.NODE_ENV !== "production" && t.dep.subsHead === void 0 && (t.dep.subsHead = t), t.dep.subs = t; } } const ZE = /* @__PURE__ */ new WeakMap(), Xu = Symbol( process.env.NODE_ENV !== "production" ? "Object iterate" : "" ), OI = Symbol( process.env.NODE_ENV !== "production" ? "Map keys iterate" : "" ), Rg = Symbol( process.env.NODE_ENV !== "production" ? "Array iterate" : "" ); function hr(t, e, n) { if (ao && rn) { let r = ZE.get(t); r || ZE.set(t, r = /* @__PURE__ */ new Map()); let i = r.get(n); i || (r.set(n, i = new r0()), i.map = r, i.key = n), process.env.NODE_ENV !== "production" ? i.track({ target: t, type: e, key: n }) : i.track(); } } function Uo(t, e, n, r, i, s) { const o = ZE.get(t); if (!o) { xg++; return; } const a = (l) => { l && (process.env.NODE_ENV !== "production" ? l.trigger({ target: t, type: e, key: n, newValue: r, oldValue: i, oldTarget: s }) : l.trigger()); }; if (EC(), e === "clear") o.forEach(a); else { const l = Ze(t), c = l && _C(n); if (l && n === "length") { const h = Number(r); o.forEach((d, p) => { (p === "length" || p === Rg || !mo(p) && p >= h) && a(d); }); } else switch ((n !== void 0 || o.has(void 0)) && a(o.get(n)), c && a(o.get(Rg)), e) { case "add": l ? c && a(o.get("length")) : (a(o.get(Xu)), Yu(t) && a(o.get(OI))); break; case "delete": l || (a(o.get(Xu)), Yu(t) && a(o.get(OI))); break; case "set": Yu(t) && a(o.get(Xu)); break; } } bC(); } function r8(t, e) { const n = ZE.get(t); return n && n.get(e); } function bd(t) { const e = at(t); return e === t ? e : (hr(e, "iterate", Rg), Ei(t) ? e : e.map(Qr)); } function i0(t) { return hr(t = at(t), "iterate", Rg), t; } const i8 = { __proto__: null, [Symbol.iterator]() { return JS(this, Symbol.iterator, Qr); }, concat(...t) { return bd(this).concat( ...t.map((e) => Ze(e) ? bd(e) : e) ); }, entries() { return JS(this, "entries", (t) => (t[1] = Qr(t[1]), t)); }, every(t, e) { return Ia(this, "every", t, e, void 0, arguments); }, filter(t, e) { return Ia(this, "filter", t, e, (n) => n.map(Qr), arguments); }, find(t, e) { return Ia(this, "find", t, e, Qr, arguments); }, findIndex(t, e) { return Ia(this, "findIndex", t, e, void 0, arguments); }, findLast(t, e) { return Ia(this, "findLast", t, e, Qr, arguments); }, findLastIndex(t, e) { return Ia(this, "findLastIndex", t, e, void 0, arguments); }, // flat, flatMap could benefit from ARRAY_ITERATE but are not straight-forward to implement forEach(t, e) { return Ia(this, "forEach", t, e, void 0, arguments); }, includes(...t) { return ZS(this, "includes", t); }, indexOf(...t) { return ZS(this, "indexOf", t); }, join(t) { return bd(this).join(t); }, // keys() iterator only reads `length`, no optimisation required lastIndexOf(...t) { return ZS(this, "lastIndexOf", t); }, map(t, e) { return Ia(this, "map", t, e, void 0, arguments); }, pop() { return gm(this, "pop"); }, push(...t) { return gm(this, "push", t); }, reduce(t, ...e) { return LP(this, "reduce", t, e); }, reduceRight(t, ...e) { return LP(this, "reduceRight", t, e); }, shift() { return gm(this, "shift"); }, // slice could use ARRAY_ITERATE but also seems to beg for range tracking some(t, e) { return Ia(this, "some", t, e, void 0, arguments); }, splice(...t) { return gm(this, "splice", t); }, toReversed() { return bd(this).toReversed(); }, toSorted(t) { return bd(this).toSorted(t); }, toSpliced(...t) { return bd(this).toSpliced(...t); }, unshift(...t) { return gm(this, "unshift", t); }, values() { return JS(this, "values", Qr); } }; function JS(t, e, n) { const r = i0(t), i = r[e](); return r !== t && !Ei(t) && (i._next = i.next, i.next = () => { const s = i._next(); return s.value && (s.value = n(s.value)), s; }), i; } const s8 = Array.prototype; function Ia(t, e, n, r, i, s) { const o = i0(t), a = o !== t && !Ei(t), l = o[e]; if (l !== s8[e]) { const d = l.apply(t, s); return a ? Qr(d) : d; } let c = n; o !== t && (a ? c = function(d, p) { return n.call(this, Qr(d), p, t); } : n.length > 2 && (c = function(d, p) { return n.call(this, d, p, t); })); const h = l.call(o, c, r); return a && i ? i(h) : h; } function LP(t, e, n, r) { const i = i0(t); let s = n; return i !== t && (Ei(t) ? n.length > 3 && (s = function(o, a, l) { return n.call(this, o, a, l, t); }) : s = function(o, a, l) { return n.call(this, o, Qr(a), l, t); }), i[e](s, ...r); } function ZS(t, e, n) { const r = at(t); hr(r, "iterate", Rg); const i = r[e](...n); return (i === -1 || i === !1) && Pg(n[0]) ? (n[0] = at(n[0]), r[e](...n)) : i; } function gm(t, e, n = []) { bl(), EC(); const r = at(t)[e].apply(t, n); return bC(), wl(), r; } const o8 = /* @__PURE__ */ El("__proto__,__v_isRef,__isVue"), dF = new Set( /* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((t) => t !== "arguments" && t !== "caller").map((t) => Symbol[t]).filter(mo) ); function a8(t) { mo(t) || (t = String(t)); const e = at(this); return hr(e, "has", t), e.hasOwnProperty(t); } class fF { constructor(e = !1, n = !1) { this._isReadonly = e, this._isShallow = n; } get(e, n, r) { if (n === "__v_skip") return e.__v_skip; const i = this._isReadonly, s = this._isShallow; if (n === "__v_isReactive") return !i; if (n === "__v_isReadonly") return i; if (n === "__v_isShallow") return s; if (n === "__v_raw") return r === (i ? s ? vF : yF : s ? _F : gF).get(e) || // 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(e) === Object.getPrototypeOf(r) ? e : void 0; const o = Ze(e); if (!i) { let l; if (o && (l = i8[n])) return l; if (n === "hasOwnProperty") return a8; } const a = Reflect.get( e, 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 nn(e) ? e : r ); return (mo(n) ? dF.has(n) : o8(n)) || (i || hr(e, "get", n), s) ? a : nn(a) ? o && _C(n) ? a : a.value : Zt(a) ? i ? M_(a) : _h(a) : a; } } class pF extends fF { constructor(e = !1) { super(!1, e); } set(e, n, r, i) { let s = e[n]; if (!this._isShallow) { const l = al(s); if (!Ei(r) && !al(r) && (s = at(s), r = at(r)), !Ze(e) && nn(s) && !nn(r)) return l ? !1 : (s.value = r, !0); } const o = Ze(e) && _C(n) ? Number(n) < e.length : Qt(e, n), a = Reflect.set( e, n, r, nn(e) ? e : i ); return e === at(i) && (o ? Oi(r, s) && Uo(e, "set", n, r, s) : Uo(e, "add", n, r)), a; } deleteProperty(e, n) { const r = Qt(e, n), i = e[n], s = Reflect.deleteProperty(e, n); return s && r && Uo(e, "delete", n, void 0, i), s; } has(e, n) { const r = Reflect.has(e, n); return (!mo(n) || !dF.has(n)) && hr(e, "has", n), r; } ownKeys(e) { return hr( e, "iterate", Ze(e) ? "length" : Xu ), Reflect.ownKeys(e); } } class mF extends fF { constructor(e = !1) { super(!0, e); } set(e, n) { return process.env.NODE_ENV !== "production" && Ls( `Set operation on key "${String(n)}" failed: target is readonly.`, e ), !0; } deleteProperty(e, n) { return process.env.NODE_ENV !== "production" && Ls( `Delete operation on key "${String(n)}" failed: target is readonly.`, e ), !0; } } const l8 = /* @__PURE__ */ new pF(), c8 = /* @__PURE__ */ new mF(), u8 = /* @__PURE__ */ new pF(!0), h8 = /* @__PURE__ */ new mF(!0), MI = (t) => t, rv = (t) => Reflect.getPrototypeOf(t); function d8(t, e, n) { return function(...r) { const i = this.__v_raw, s = at(i), o = Yu(s), a = t === "entries" || t === Symbol.iterator && o, l = t === "keys" && o, c = i[t](...r), h = n ? MI : e ? DI : Qr; return !e && hr( s, "iterate", l ? OI : Xu ), { // iterator protocol next() { const { value: d, done: p } = c.next(); return p ? { value: d, done: p } : { value: a ? [h(d[0]), h(d[1])] : h(d), done: p }; }, // iterable protocol [Symbol.iterator]() { return this; } }; }; } function iv(t) { return function(...e) { if (process.env.NODE_ENV !== "production") { const n = e[0] ? `on key "${e[0]}" ` : ""; Ls( `${mh(t)} operation ${n}failed: target is readonly.`, at(this) ); } return t === "delete" ? !1 : t === "clear" ? void 0 : this; }; } function f8(t, e) { const n = { get(i) { const s = this.__v_raw, o = at(s), a = at(i); t || (Oi(i, a) && hr(o, "get", i), hr(o, "get", a)); const { has: l } = rv(o), c = e ? MI : t ? DI : Qr; if (l.call(o, i)) return c(s.get(i)); if (l.call(o, a)) return c(s.get(a)); s !== o && s.get(i); }, get size() { const i = this.__v_raw; return !t && hr(at(i), "iterate", Xu), Reflect.get(i, "size", i); }, has(i) { const s = this.__v_raw, o = at(s), a = at(i); return t || (Oi(i, a) && hr(o, "has", i), hr(o, "has", a)), i === a ? s.has(i) : s.has(i) || s.has(a); }, forEach(i, s) { const o = this, a = o.__v_raw, l = at(a), c = e ? MI : t ? DI : Qr; return !t && hr(l, "iterate", Xu), a.forEach((h, d) => i.call(s, c(h), c(d), o)); } }; return _n( n, t ? { add: iv("add"), set: iv("set"), delete: iv("delete"), clear: iv("clear") } : { add(i) { !e && !Ei(i) && !al(i) && (i = at(i)); const s = at(this); return rv(s).has.call(s, i) || (s.add(i), Uo(s, "add", i, i)), this; }, set(i, s) { !e && !Ei(s) && !al(s) && (s = at(s)); const o = at(this), { has: a, get: l } = rv(o); let c = a.call(o, i); c ? process.env.NODE_ENV !== "production" && VP(o, a, i) : (i = at(i), c = a.call(o, i)); const h = l.call(o, i); return o.set(i, s), c ? Oi(s, h) && Uo(o, "set", i, s, h) : Uo(o, "add", i, s), this; }, delete(i) { const s = at(this), { has: o, get: a } = rv(s); let l = o.call(s, i); l ? process.env.NODE_ENV !== "production" && VP(s, o, i) : (i = at(i), l = o.call(s, i)); const c = a ? a.call(s, i) : void 0, h = s.delete(i); return l && Uo(s, "delete", i, void 0, c), h; }, clear() { const i = at(this), s = i.size !== 0, o = process.env.NODE_ENV !== "production" ? Yu(i) ? new Map(i) : new Set(i) : void 0, a = i.clear(); return s && Uo( i, "clear", void 0, void 0, o ), a; } } ), [ "keys", "values", "entries", Symbol.iterator ].forEach((i) => { n[i] = d8(i, t, e); }), n; } function s0(t, e) { const n = f8(t, e); return (r, i, s) => i === "__v_isReactive" ? !t : i === "__v_isReadonly" ? t : i === "__v_raw" ? r : Reflect.get( Qt(n, i) && i in r ? n : r, i, s ); } const p8 = { get: /* @__PURE__ */ s0(!1, !1) }, m8 = { get: /* @__PURE__ */ s0(!1, !0) }, g8 = { get: /* @__PURE__ */ s0(!0, !1) }, _8 = { get: /* @__PURE__ */ s0(!0, !0) }; function VP(t, e, n) { const r = at(n); if (r !== n && e.call(t, r)) { const i = gC(t); Ls( `Reactive ${i} contains both the raw and reactive versions of the same object${i === "Map" ? " as keys" : ""}, which can lead to inconsistencies. Avoid differentiating between the raw and reactive versions of an object and only use the reactive version if possible.` ); } } const gF = /* @__PURE__ */ new WeakMap(), _F = /* @__PURE__ */ new WeakMap(), yF = /* @__PURE__ */ new WeakMap(), vF = /* @__PURE__ */ new WeakMap(); function y8(t) { switch (t) { case "Object": case "Array": return 1; case "Map": case "Set": case "WeakMap": case "WeakSet": return 2; default: return 0; } } function v8(t) { return t.__v_skip || !Object.isExtensible(t) ? 0 : y8(gC(t)); } function _h(t) { return al(t) ? t : o0( t, !1, l8, p8, gF ); } function EF(t) { return o0( t, !1, u8, m8, _F ); } function M_(t) { return o0( t, !0, c8, g8, yF ); } function Ho(t) { return o0( t, !0, h8, _8, vF ); } function o0(t, e, n, r, i) { if (!Zt(t)) return process.env.NODE_ENV !== "production" && Ls( `value cannot be made ${e ? "readonly" : "reactive"}: ${String( t )}` ), t; if (t.__v_raw && !(e && t.__v_isReactive)) return t; const s = i.get(t); if (s) return s; const o = v8(t); if (o === 0) return t; const a = new Proxy( t, o === 2 ? r : n ); return i.set(t, a), a; } function lo(t) { return al(t) ? lo(t.__v_raw) : !!(t && t.__v_isReactive); } function al(t) { return !!(t && t.__v_isReadonly); } function Ei(t) { return !!(t && t.__v_isShallow); } function Pg(t) { return t ? !!t.__v_raw : !1; } function at(t) { const e = t && t.__v_raw; return e ? at(e) : t; } function Ka(t) { return !Qt(t, "__v_skip") && Object.isExtensible(t) && GE(t, "__v_skip", !0), t; } const Qr = (t) => Zt(t) ? _h(t) : t, DI = (t) => Zt(t) ? M_(t) : t; function nn(t) { return t ? t.__v_isRef === !0 : !1; } function Ue(t) { return bF(t, !1); } function Bi(t) { return bF(t, !0); } function bF(t, e) { return nn(t) ? t : new E8(t, e); } class E8 { constructor(e, n) { this.dep = new r0(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = n ? e : at(e), this._value = n ? e : Qr(e), this.__v_isShallow = n; } get value() { return process.env.NODE_ENV !== "production" ? this.dep.track({ target: this, type: "get", key: "value" }) : this.dep.track(), this._value; } set value(e) { const n = this._rawValue, r = this.__v_isShallow || Ei(e) || al(e); e = r ? e : at(e), Oi(e, n) && (this._rawValue = e, this._value = r ? e : Qr(e), process.env.NODE_ENV !== "production" ? this.dep.trigger({ target: this, type: "set", key: "value", newValue: e, oldValue: n }) : this.dep.trigger()); } } function j(t) { return nn(t) ? t.value : t; } const b8 = { get: (t, e, n) => e === "__v_raw" ? t : j(Reflect.get(t, e, n)), set: (t, e, n, r) => { const i = t[e]; return nn(i) && !nn(n) ? (i.value = n, !0) : Reflect.set(t, e, n, r); } }; function wF(t) { return lo(t) ? t : new Proxy(t, b8); } class w8 { constructor(e) { this.__v_isRef = !0, this._value = void 0; const n = this.dep = new r0(), { get: r, set: i } = e(n.track.bind(n), n.trigger.bind(n)); this._get = r, this._set = i; } get value() { return this._value = this._get(); } set value(e) { this._set(e); } } function SF(t) { return new w8(t); } function LI(t) { process.env.NODE_ENV !== "production" && !Pg(t) && Ls("toRefs() expects a reactive object but received a plain one."); const e = Ze(t) ? new Array(t.length) : {}; for (const n in t) e[n] = TF(t, n); return e; } class S8 { constructor(e, n, r) { this._object = e, this._key = n, this._defaultValue = r, this.__v_isRef = !0, this._value = void 0; } get value() { const e = this._object[this._key]; return this._value = e === void 0 ? this._defaultValue : e; } set value(e) { this._object[this._key] = e; } get dep() { return r8(at(this._object), this._key); } } class T8 { constructor(e) { this._getter = e, this.__v_isRef = !0, this.__v_isReadonly = !0, this._value = void 0; } get value() { return this._value = this._getter(); } } function sE(t, e, n) { return nn(t) ? t : ot(t) ? new T8(t) : Zt(t) && arguments.length > 1 ? TF(t, e, n) : Ue(t); } function TF(t, e, n) { const r = t[e]; return nn(r) ? r : new S8(t, e, n); } class I8 { constructor(e, n, r) { this.fn = e, this.setter = n, this._value = void 0, this.dep = new r0(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = xg - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !n, this.isSSR = r; } /** * @internal */ notify() { if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion rn !== this) return oF(this, !0), !0; process.env.NODE_ENV; } get value() { const e = process.env.NODE_ENV !== "production" ? this.dep.track({ target: this, type: "get", key: "value" }) : this.dep.track(); return cF(this), e && (e.version = this.dep.version), this._value; } set value(e) { this.setter ? this.setter(e) : process.env.NODE_ENV !== "production" && Ls("Write operation failed: computed value is readonly"); } } function k8(t, e, n = !1) { let r, i; ot(t) ? r = t : (r = t.get, i = t.set); const s = new I8(r, i, n); return process.env.NODE_ENV !== "production" && e && !n && (s.onTrack = e.onTrack, s.onTrigger = e.onTrigger), s; } const sv = {}, QE = /* @__PURE__ */ new WeakMap(); let Au; function C8(t, e = !1, n = Au) { if (n) { let r = QE.get(n); r || QE.set(n, r = []), r.push(t); } else process.env.NODE_ENV !== "production" && !e && Ls( "onWatcherCleanup() was called when there was no active watcher to associate with." ); } function A8(t, e, n = Wt) { const { immediate: r, deep: i, once: s, scheduler: o, augmentJob: a, call: l } = n, c = (F) => { (n.onWarn || Ls)( "Invalid watch source: ", F, "A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types." ); }, h = (F) => i ? F : Ei(F) || i === !1 || i === 0 ? Ba(F, 1) : Ba(F); let d, p, g, y, v = !1, w = !1; if (nn(t) ? (p = () => t.value, v = Ei(t)) : lo(t) ? (p = () => h(t), v = !0) : Ze(t) ? (w = !0, v = t.some((F) => lo(F) || Ei(F)), p = () => t.map((F) => { if (nn(F)) return F.value; if (lo(F)) return h(F); if (ot(F)) return l ? l(F, 2) : F(); process.env.NODE_ENV !== "production" && c(F); })) : ot(t) ? e ? p = l ? () => l(t, 2) : t : p = () => { if (g) { bl(); try { g(); } finally { wl(); } } const F = Au; Au = d; try { return l ? l(t, 3, [y]) : t(y); } finally { Au = F; } } : (p = dr, process.env.NODE_ENV !== "production" && c(t)), e && i) { const F = p, D = i === !0 ? 1 / 0 : i; p = () => Ba(F(), D); } const A = n0(), N = () => { d.stop(), A && A.active && pC(A.effects, d); }; if (s && e) { const F = e; e = (...D) => { F(...D), N(); }; } let M = w ? new Array(t.length).fill(sv) : sv; const U = (F) => { if (!(!(d.flags & 1) || !d.dirty && !F)) if (e) { const D = d.run(); if (i || v || (w ? D.some((I, b) => Oi(I, M[b])) : Oi(D, M))) { g && g(); const I = Au; Au = d; try { const b = [ D, // pass undefined as the old value when it's changed for the first time M === sv ? void 0 : w && M[0] === sv ? [] : M, y ]; l ? l(e, 3, b) : ( // @ts-expect-error e(...b) ), M = D; } finally { Au = I; } } } else d.run(); }; return a && a(U), d = new iF(p), d.scheduler = o ? () => o(U, !1) : U, y = (F) => C8(F, !1, d), g = d.onStop = () => { const F = QE.get(d); if (F) { if (l) l(F, 4); else for (const D of F) D(); QE.delete(d); } }, process.env.NODE_ENV !== "production" && (d.onTrack = n.onTrack, d.onTrigger = n.onTrigger), e ? r ? U(!0) : M = d.run() : o ? o(U.bind(null, !0), !0) : d.run(), N.pause = d.pause.bind(d), N.resume = d.resume.bind(d), N.stop = N, N; } function Ba(t, e = 1 / 0, n) { if (e <= 0 || !Zt(t) || t.__v_skip || (n = n || /* @__PURE__ */ new Set(), n.has(t))) return t; if (n.add(t), e--, nn(t)) Ba(t.value, e, n); else if (Ze(t)) for (let r = 0; r < t.length; r++) Ba(t[r], e, n); else if (mp(t) || Yu(t)) t.forEach((r) => { Ba(r, e, n); }); else if (YV(t)) { for (const r in t) Ba(t[r], e, n); for (const r of Object.getOwnPropertySymbols(t)) Object.prototype.propertyIsEnumerable.call(t, r) && Ba(t[r], e, n); } return t; } const eh = []; function oE(t) { eh.push(t); } function aE() { eh.pop(); } let QS = !1; function Oe(t, ...e) { if (QS) return; QS = !0, bl(); const n = eh.length ? eh[eh.length - 1].component : null, r = n && n.appContext.config.warnHandler, i = x8(); if (r) gp( r, n, 11, [ // eslint-disable-next-line no-restricted-syntax t + e.map((s) => { var o, a; return (a = (o = s.toString) == null ? void 0 : o.call(s)) != null ? a : JSON.stringify(s); }).join(""), n && n.proxy, i.map( ({ vnode: s }) => `at <${d0(n, s.type)}>` ).join(` `), i ] ); else { const s = [`[Vue warn]: ${t}`, ...e]; i.length && s.push(` `, ...R8(i)), console.warn(...s); } wl(), QS = !1; } function x8() { let t = eh[eh.length - 1]; if (!t) return []; const e = []; for (; t; ) { const n = e[0]; n && n.vnode === t ? n.recurseCount++ : e.push({ vnode: t, recurseCount: 0 }); const r = t.component && t.component.parent; t = r && r.vnode; } return e; } function R8(t) { const e = []; return t.forEach((n, r) => { e.push(...r === 0 ? [] : [` `], ...P8(n)); }), e; } function P8({ vnode: t, recurseCount: e }) { const n = e > 0 ? `... (${e} recursive calls)` : "", r = t.component ? t.component.parent == null : !1, i = ` at <${d0( t.component, t.type, r )}`, s = ">" + n; return t.props ? [i, ...N8(t.props), s] : [i + s]; } function N8(t) { const e = [], n = Object.keys(t); return n.slice(0, 3).forEach((r) => { e.push(...IF(r, t[r])); }), n.length > 3 && e.push(" ..."), e; } function IF(t, e, n) { return Cn(e) ? (e = JSON.stringify(e), n ? e : [`${t}=${e}`]) : typeof e == "number" || typeof e == "boolean" || e == null ? n ? e : [`${t}=${e}`] : nn(e) ? (e = IF(t, at(e.value), !0), n ? e : [`${t}=Ref<`, e, ">"]) : ot(e) ? [`${t}=fn${e.name ? `<${e.name}>` : ""}`] : (e = at(e), n ? e : [`${t}=`, e]); } function O8(t, e) { process.env.NODE_ENV !== "production" && t !== void 0 && (typeof t != "number" ? Oe(`${e} is not a valid number - got ${JSON.stringify(t)}.`) : isNaN(t) && Oe(`${e} is NaN - the duration expression might be incorrect.`)); } const SC = { 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 gp(t, e, n, r) { try { return r ? t(...r) : t(); } catch (i) { D_(i, e, n); } } function go(t, e, n, r) { if (ot(t)) { const i = gp(t, e, n, r); return i && mC(i) && i.catch((s) => { D_(s, e, n); }), i; } if (Ze(t)) { const i = []; for (let s = 0; s < t.length; s++) i.push(go(t[s], e, n, r)); return i; } else process.env.NODE_ENV !== "production" && Oe( `Invalid value type passed to callWithAsyncErrorHandling(): ${typeof t}` ); } function D_(t, e, n, r = !0) { const i = e ? e.vnode : null, { errorHandler: s, throwUnhandledErrorInProduction: o } = e && e.appContext.config || Wt; if (e) { let a = e.parent; const l = e.proxy, c = process.env.NODE_ENV !== "production" ? SC[n] : `https://vuejs.org/error-reference/#runtime-${n}`; for (; a; ) { const h = a.ec; if (h) { for (let d = 0; d < h.length; d++) if (h[d](t, l, c) === !1) return; } a = a.parent; } if (s) { bl(), gp(s, null, 10, [ t, l, c ]), wl(); return; } } M8(t, n, i, r, o); } function M8(t, e, n, r = !0, i = !1) { if (process.env.NODE_ENV !== "production") { const s = SC[e]; if (n && oE(n), Oe(`Unhandled error${s ? ` during execution of ${s}` : ""}`), n && aE(), r) throw t; console.error(t); } else { if (i) throw t; console.error(t); } } const yi = []; let Oo = -1; const uf = []; let Jl = null, Dd = 0; const kF = /* @__PURE__ */ Promise.resolve(); let YE = null; const D8 = 100; function zi(t) { const e = YE || kF; return t ? e.then(this ? t.bind(this) : t) : e; } function L8(t) { let e = Oo + 1, n = yi.length; for (; e < n; ) { const r = e + n >>> 1, i = yi[r], s = Ng(i); s < t || s === t && i.flags & 2 ? e = r + 1 : n = r; } return e; } function a0(t) { if (!(t.flags & 1)) { const e = Ng(t), n = yi[yi.length - 1]; !n || // fast path when the job id is larger than the tail !(t.flags & 2) && e >= Ng(n) ? yi.push(t) : yi.splice(L8(e), 0, t), t.flags |= 1, CF(); } } function CF() { YE || (YE = kF.then(RF)); } function AF(t) { Ze(t) ? uf.push(...t) : Jl && t.id === -1 ? Jl.splice(Dd + 1, 0, t) : t.flags & 1 || (uf.push(t), t.flags |= 1), CF(); } function FP(t, e, n = Oo + 1) { for (process.env.NODE_ENV !== "production" && (e = e || /* @__PURE__ */ new Map()); n < yi.length; n++) { const r = yi[n]; if (r && r.flags & 2) { if (t && r.id !== t.uid || process.env.NODE_ENV !== "production" && TC(e, r)) continue; yi.splice(n, 1), n--, r.flags & 4 && (r.flags &= -2), r(), r.flags & 4 || (r.flags &= -2); } } } function xF(t) { if (uf.length) { const e = [...new Set(uf)].sort( (n, r) => Ng(n) - Ng(r) ); if (uf.length = 0, Jl) { Jl.push(...e); return; } for (Jl = e, process.env.NODE_ENV !== "production" && (t = t || /* @__PURE__ */ new Map()), Dd = 0; Dd < Jl.length; Dd++) { const n = Jl[Dd]; process.env.NODE_ENV !== "production" && TC(t, n) || (n.flags & 4 && (n.flags &= -2), n.flags & 8 || n(), n.flags &= -2); } Jl = null, Dd = 0; } } const Ng = (t) => t.id == null ? t.flags & 2 ? -1 : 1 / 0 : t.id; function RF(t) { process.env.NODE_ENV !== "production" && (t = t || /* @__PURE__ */ new Map()); const e = process.env.NODE_ENV !== "production" ? (n) => TC(t, n) : dr; try { for (Oo = 0; Oo < yi.length; Oo++) { const n = yi[Oo]; if (n && !(n.flags & 8)) { if (process.env.NODE_ENV !== "production" && e(n)) continue; n.flags & 4 && (n.flags &= -2), gp( n, n.i, n.i ? 15 : 14 ), n.flags & 4 || (n.flags &= -2); } } } finally { for (; Oo < yi.length; Oo++) { const n = yi[Oo]; n && (n.flags &= -2); } Oo = -1, yi.length = 0, xF(t), YE = null, (yi.length || uf.length) && RF(t); } } function TC(t, e) { const n = t.get(e) || 0; if (n > D8) { const r = e.i, i = r && OC(r.type); return D_( `Maximum recursive updates exceeded${i ? ` in component <${i}>` : ""}. This means you have a reactive effect that is mutating its own dependencies and thus recursively triggering itself. Possible sources include component template, render function, updated hook or watcher source function.`, null, 10 ), !0; } return t.set(e, n + 1), !1; } let jo = !1; const lE = /* @__PURE__ */ new Map(); process.env.NODE_ENV !== "production" && (O_().__VUE_HMR_RUNTIME__ = { createRecord: YS(PF), rerender: YS($8), reload: YS(B8) }); const yh = /* @__PURE__ */ new Map(); function V8(t) { const e = t.type.__hmrId; let n = yh.get(e); n || (PF(e, t.type), n = yh.get(e)), n.instances.add(t); } function F8(t) { yh.get(t.type.__hmrId).instances.delete(t); } function PF(t, e) { return yh.has(t) ? !1 : (yh.set(t, { initialDef: XE(e), instances: /* @__PURE__ */ new Set() }), !0); } function XE(t) { return b$(t) ? t.__vccOpts : t; } function $8(t, e) { const n = yh.get(t); n && (n.initialDef.render = e, [...n.instances].forEach((r) => { e && (r.render = e, XE(r.type).render = e), r.renderCache = [], jo = !0, r.update(), jo = !1; })); } function B8(t, e) { const n = yh.get(t); if (!n) return; e = XE(e), $P(n.initialDef, e); const r = [...n.instances]; for (let i = 0; i < r.length; i++) { const s = r[i], o = XE(s.type); let a = lE.get(o); a || (o !== n.initialDef && $P(o, e), lE.set(o, a = /* @__PURE__ */ new Set())), a.add(s), s.appContext.propsCache.delete(s.type), s.appContext.emitsCache.delete(s.type), s.appContext.optionsCache.delete(s.type), s.ceReload ? (a.add(s), s.ceReload(e.styles), a.delete(s)) : s.parent ? a0(() => { jo = !0, s.parent.update(), jo = !1, a.delete(s); }) : s.appContext.reload ? s.appContext.reload() : typeof window < "u" ? window.location.reload() : console.warn( "[HMR] Root or manually mounted instance modified. Full reload required." ), s.root.ce && s !== s.root && s.root.ce._removeChildStyle(o); } AF(() => { lE.clear(); }); } function $P(t, e) { _n(t, e); for (const n in t) n !== "__file" && !(n in e) && delete t[n]; } function YS(t) { return (e, n) => { try { return t(e, n); } catch (r) { console.error(r), console.warn( "[HMR] Something went wrong during Vue component hot-reload. Full reload required." ); } }; } let to, Dm = [], VI = !1; function L_(t, ...e) { to ? to.emit(t, ...e) : VI || Dm.push({ event: t, args: e }); } function IC(t, e) { var n, r; to = t, to ? (to.enabled = !0, Dm.forEach(({ event: i, args: s }) => to.emit(i, ...s)), Dm = []) : /* 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 !((r = (n = window.navigator) == null ? void 0 : n.userAgent) != null && r.includes("jsdom")) ? ((e.__VUE_DEVTOOLS_HOOK_REPLAY__ = e.__VUE_DEVTOOLS_HOOK_REPLAY__ || []).push((s) => { IC(s, e); }), setTimeout(() => { to || (e.__VUE_DEVTOOLS_HOOK_REPLAY__ = null, VI = !0, Dm = []); }, 3e3)) : (VI = !0, Dm = []); } function U8(t, e) { L_("app:init", t, e, { Fragment: vt, Text: _p, Comment: Qn, Static: hE }); } function z8(t) { L_("app:unmount", t); } const H8 = /* @__PURE__ */ kC( "component:added" /* COMPONENT_ADDED */ ), NF = /* @__PURE__ */ kC( "component:updated" /* COMPONENT_UPDATED */ ), j8 = /* @__PURE__ */ kC( "component:removed" /* COMPONENT_REMOVED */ ), q8 = (t) => { to && typeof to.cleanupBuffer == "function" && // remove the component if it wasn't buffered !to.cleanupBuffer(t) && j8(t); }; // @__NO_SIDE_EFFECTS__ function kC(t) { return (e) => { L_( t, e.appContext.app, e.uid, e.parent ? e.parent.uid : void 0, e ); }; } const W8 = /* @__PURE__ */ OF( "perf:start" /* PERFORMANCE_START */ ), K8 = /* @__PURE__ */ OF( "perf:end" /* PERFORMANCE_END */ ); function OF(t) { return (e, n, r) => { L_(t, e.appContext.app, e.uid, e, n, r); }; } function G8(t, e, n) { L_( "component:emit", t.appContext.app, t, e, n ); } let Xn = null, MF = null; function eb(t) { const e = Xn; return Xn = t, MF = t && t.type.__scopeId || null, e; } function sn(t, e = Xn, n) { if (!e || t._n) return t; const r = (...i) => { r._d && QP(-1); const s = eb(e); let o; try { o = t(...i); } finally { eb(s), r._d && QP(1); } return process.env.NODE_ENV !== "production" && NF(e), o; }; return r._n = !0, r._c = !0, r._d = !0, r; } function DF(t) { Fq(t) && Oe("Do not use built-in directive ids as custom directive id: " + t); } function xr(t, e) { if (Xn === null) return process.env.NODE_ENV !== "production" && Oe("withDirectives can only be used inside render functions."), t; const n = h0(Xn), r = t.dirs || (t.dirs = []); for (let i = 0; i < e.length; i++) { let [s, o, a, l = Wt] = e[i]; s && (ot(s) && (s = { mounted: s, updated: s }), s.deep && Ba(o), r.push({ dir: s, instance: n, value: o, oldValue: void 0, arg: a, modifiers: l })); } return t; } function Su(t, e, n, r) { const i = t.dirs, s = e && e.dirs; for (let o = 0; o < i.length; o++) { const a = i[o]; s && (a.oldValue = s[o].value); let l = a.dir[r]; l && (bl(), go(l, n, 8, [ t.el, a, t, e ]), wl()); } } const J8 = Symbol("_vte"), LF = (t) => t.__isTeleport, Zl = Symbol("_leaveCb"), ov = Symbol("_enterCb"); function VF() { const t = { isMounted: !1, isLeaving: !1, isUnmounting: !1, leavingVNodes: /* @__PURE__ */ new Map() }; return ha(() => { t.isMounted = !0; }), F_(() => { t.isUnmounting = !0; }), t; } const ws = [Function, Array], FF = { mode: String, appear: Boolean, persisted: Boolean, // enter onBeforeEnter: ws, onEnter: ws, onAfterEnter: ws, onEnterCancelled: ws, // leave onBeforeLeave: ws, onLeave: ws, onAfterLeave: ws, onLeaveCancelled: ws, // appear onBeforeAppear: ws, onAppear: ws, onAfterAppear: ws, onAppearCancelled: ws }, $F = (t) => { const e = t.subTree; return e.component ? $F(e.compo