From 989067dc00d79fd34bb7d1f9308549f0cf6a7a71 Mon Sep 17 00:00:00 2001 From: akatz-ai Date: Thu, 22 Jan 2026 21:04:34 -0500 Subject: [PATCH 01/91] fix(workflow): write property_download_intent models to pyproject.toml When a workflow has models with embedded download URLs (property_download_intent from node properties.models), clicking "Apply Resolution" now writes them to pyproject.toml before starting downloads. This allows _finalize_download to find and update them from "unresolved" to "resolved" when download completes. Previously, these models only existed in the ResolutionResult object and were never persisted, causing the workflow to still show "missing models" until user saved (Ctrl+S) triggering re-analysis. - Add new block in apply_resolution to write property_download_intent models - Uses expected_categories from core library's node analysis for category - Respects user choices (skip/cancel/optional) before writing - Avoids duplicates by checking existing models in pyproject --- server/api/v2/workflows.py | 44 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) diff --git a/server/api/v2/workflows.py b/server/api/v2/workflows.py index 48a3e21..4e78f6d 100644 --- a/server/api/v2/workflows.py +++ b/server/api/v2/workflows.py @@ -893,6 +893,50 @@ async def apply_resolution(request: web.Request, env) -> web.Response: except Exception: pass # Continue even if update fails + # Write property_download_intent models to pyproject (they're in models_resolved, not processed by fix_resolution) + try: + from comfygit_core.models.manifest import ManifestWorkflowModel + + existing_models = env.pyproject.workflows.get_workflow_models(name) + existing_filenames = {m.filename for m in existing_models if m.sources} + + for model in result.models_resolved: + if model.match_type == "property_download_intent" and model.model_source: + filename = model.reference.widget_value + + # Skip if already in pyproject with sources (avoid duplicates) + if filename in existing_filenames: + continue + + # Check if user cancelled this download + choice = model_choices.get(filename) + if choice and choice.get("action") in ("skip", "cancel_download", "optional"): + continue + + # Use expected_categories from core library's node analysis + category = model.expected_categories[0] if model.expected_categories else "models" + + # Use user's URL if they provided one, otherwise use model_source + url = model.model_source + target_path = str(model.target_path) if model.target_path else None + if choice and choice.get("action") == "download" and choice.get("url"): + url = choice["url"] + if choice.get("target_path"): + target_path = choice["target_path"] + + manifest_model = ManifestWorkflowModel( + filename=filename, + category=category, + criticality="required", + status="unresolved", + nodes=[model.reference], + sources=[url], + relative_path=target_path + ) + env.pyproject.workflows.add_workflow_model(name, manifest_model) + except Exception: + pass # Continue even if write fails - downloads will still work + # Get models directory for checking if files already exist models_dir = env.workspace.workspace_config_manager.get_models_directory() From 1e34d36cef1a2ff54c9fc0a6d9285674504d24c9 Mon Sep 17 00:00:00 2001 From: akatz-ai Date: Fri, 23 Jan 2026 01:24:43 -0500 Subject: [PATCH 02/91] feat(extension): add workflow load hooks to intercept missing resources Register beforeConfigureGraph and afterConfigureGraph hooks in the ComfyGit extension to capture workflow data when workflows are loaded. Dispatches 'comfygit:workflow-loaded' custom event with workflow JSON and missing node types for the upcoming missing resources popup feature. --- frontend/src/main.ts | 34 + js/comfygit-panel.js | 6459 +++++++++++++++++++++--------------------- 2 files changed, 3276 insertions(+), 3217 deletions(-) diff --git a/frontend/src/main.ts b/frontend/src/main.ts index 005d30a..74fe197 100644 --- a/frontend/src/main.ts +++ b/frontend/src/main.ts @@ -480,6 +480,40 @@ document.head.appendChild(styles) app.registerExtension({ name: 'Comfy.ComfyGitPanel', + // Hook into workflow loading to intercept missing resources + // This runs BEFORE ComfyUI's missing nodes/models dialogs + async beforeConfigureGraph(graphData: any, missingNodeTypes: any[]) { + // Store workflow data for use in afterConfigureGraph + // We use window to share state since these are separate hook calls + ;(window as any).__comfygit_pending_workflow = { + graphData, + missingNodeTypes, + timestamp: Date.now() + } + console.log('[ComfyGit] beforeConfigureGraph: captured workflow data', { + nodeCount: graphData?.nodes?.length ?? 0, + missingNodeTypes: missingNodeTypes?.length ?? 0 + }) + }, + + async afterConfigureGraph(missingNodeTypes: any[]) { + const pending = (window as any).__comfygit_pending_workflow + if (!pending) return + delete (window as any).__comfygit_pending_workflow + + // Dispatch custom event for our popup component to handle + window.dispatchEvent(new CustomEvent('comfygit:workflow-loaded', { + detail: { + workflow: pending.graphData, + missingNodeTypes: missingNodeTypes, + timestamp: pending.timestamp + } + })) + console.log('[ComfyGit] afterConfigureGraph: dispatched workflow-loaded event', { + missingNodeTypes: missingNodeTypes?.length ?? 0 + }) + }, + async setup() { // Create button group const btnGroup = document.createElement('div') diff --git a/js/comfygit-panel.js b/js/comfygit-panel.js index 1e37494..2502364 100644 --- a/js/comfygit-panel.js +++ b/js/comfygit-panel.js @@ -6,133 +6,133 @@ import { app as Os } from "../../scripts/app.js"; **/ // @__NO_SIDE_EFFECTS__ function Ia(e) { - const s = /* @__PURE__ */ Object.create(null); - for (const o of e.split(",")) s[o] = 1; - return (o) => o in s; + const t = /* @__PURE__ */ Object.create(null); + for (const o of e.split(",")) t[o] = 1; + return (o) => o in t; } const st = {}, ro = [], ms = () => { }, Xl = () => !1, Rn = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter -(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), Ea = (e) => e.startsWith("onUpdate:"), pt = Object.assign, Ta = (e, s) => { - const o = e.indexOf(s); +(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), Ea = (e) => e.startsWith("onUpdate:"), pt = Object.assign, Ta = (e, t) => { + const o = e.indexOf(t); o > -1 && e.splice(o, 1); -}, Fr = Object.prototype.hasOwnProperty, Ze = (e, s) => Fr.call(e, s), Ue = Array.isArray, co = (e) => Jo(e) === "[object Map]", yo = (e) => Jo(e) === "[object Set]", sl = (e) => Jo(e) === "[object Date]", Be = (e) => typeof e == "function", ut = (e) => typeof e == "string", Zt = (e) => typeof e == "symbol", tt = (e) => e !== null && typeof e == "object", Ql = (e) => (tt(e) || Be(e)) && Be(e.then) && Be(e.catch), Zl = Object.prototype.toString, Jo = (e) => Zl.call(e), Br = (e) => Jo(e).slice(8, -1), ei = (e) => Jo(e) === "[object Object]", Pa = (e) => ut(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, Mo = /* @__PURE__ */ Ia( +}, Fr = Object.prototype.hasOwnProperty, Ze = (e, t) => Fr.call(e, t), Ne = Array.isArray, co = (e) => Jo(e) === "[object Map]", yo = (e) => Jo(e) === "[object Set]", sl = (e) => Jo(e) === "[object Date]", Be = (e) => typeof e == "function", ut = (e) => typeof e == "string", Zt = (e) => typeof e == "symbol", tt = (e) => e !== null && typeof e == "object", Ql = (e) => (tt(e) || Be(e)) && Be(e.then) && Be(e.catch), Zl = Object.prototype.toString, Jo = (e) => Zl.call(e), Br = (e) => Jo(e).slice(8, -1), ei = (e) => Jo(e) === "[object Object]", Pa = (e) => ut(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, Mo = /* @__PURE__ */ Ia( // the leading comma is intentional so empty string "" is also included ",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted" ), Mn = (e) => { - const s = /* @__PURE__ */ Object.create(null); - return ((o) => s[o] || (s[o] = e(o))); + const t = /* @__PURE__ */ Object.create(null); + return ((o) => t[o] || (t[o] = e(o))); }, Vr = /-\w/g, Wt = Mn( - (e) => e.replace(Vr, (s) => s.slice(1).toUpperCase()) + (e) => e.replace(Vr, (t) => t.slice(1).toUpperCase()) ), Wr = /\B([A-Z])/g, zs = Mn( (e) => e.replace(Wr, "-$1").toLowerCase() ), Dn = Mn((e) => e.charAt(0).toUpperCase() + e.slice(1)), Hn = Mn( (e) => e ? `on${Dn(e)}` : "" -), As = (e, s) => !Object.is(e, s), fn = (e, ...s) => { +), As = (e, t) => !Object.is(e, t), fn = (e, ...t) => { for (let o = 0; o < e.length; o++) - e[o](...s); -}, ti = (e, s, o, n = !1) => { - Object.defineProperty(e, s, { + e[o](...t); +}, ti = (e, t, o, n = !1) => { + Object.defineProperty(e, t, { configurable: !0, enumerable: !1, writable: n, value: o }); }, Ln = (e) => { - const s = parseFloat(e); - return isNaN(s) ? e : s; + const t = parseFloat(e); + return isNaN(t) ? e : t; }, Gr = (e) => { - const s = ut(e) ? Number(e) : NaN; - return isNaN(s) ? e : s; + const t = ut(e) ? Number(e) : NaN; + return isNaN(t) ? e : t; }; let ol; const On = () => ol || (ol = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {}); function Gt(e) { - if (Ue(e)) { - const s = {}; + if (Ne(e)) { + const t = {}; for (let o = 0; o < e.length; o++) { const n = e[o], l = ut(n) ? qr(n) : Gt(n); if (l) for (const i in l) - s[i] = l[i]; + t[i] = l[i]; } - return s; + return t; } else if (ut(e) || tt(e)) return e; } const jr = /;(?![^(]*\))/g, Hr = /:([^]+)/, Kr = /\/\*[^]*?\*\//g; function qr(e) { - const s = {}; + const t = {}; return e.replace(Kr, "").split(jr).forEach((o) => { if (o) { const n = o.split(Hr); - n.length > 1 && (s[n[0].trim()] = n[1].trim()); + n.length > 1 && (t[n[0].trim()] = n[1].trim()); } - }), s; + }), t; } function Se(e) { - let s = ""; + let t = ""; if (ut(e)) - s = e; - else if (Ue(e)) + t = e; + else if (Ne(e)) for (let o = 0; o < e.length; o++) { const n = Se(e[o]); - n && (s += n + " "); + n && (t += n + " "); } else if (tt(e)) for (const o in e) - e[o] && (s += o + " "); - return s.trim(); + e[o] && (t += o + " "); + return t.trim(); } const Yr = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", Jr = /* @__PURE__ */ Ia(Yr); function si(e) { return !!e || e === ""; } -function Xr(e, s) { - if (e.length !== s.length) return !1; +function Xr(e, t) { + if (e.length !== t.length) return !1; let o = !0; for (let n = 0; o && n < e.length; n++) - o = Qs(e[n], s[n]); + o = Qs(e[n], t[n]); return o; } -function Qs(e, s) { - if (e === s) return !0; - let o = sl(e), n = sl(s); +function Qs(e, t) { + if (e === t) return !0; + let o = sl(e), n = sl(t); if (o || n) - return o && n ? e.getTime() === s.getTime() : !1; - if (o = Zt(e), n = Zt(s), o || n) - return e === s; - if (o = Ue(e), n = Ue(s), o || n) - return o && n ? Xr(e, s) : !1; - if (o = tt(e), n = tt(s), o || n) { + return o && n ? e.getTime() === t.getTime() : !1; + if (o = Zt(e), n = Zt(t), o || n) + return e === t; + if (o = Ne(e), n = Ne(t), o || n) + return o && n ? Xr(e, t) : !1; + if (o = tt(e), n = tt(t), o || n) { if (!o || !n) return !1; - const l = Object.keys(e).length, i = Object.keys(s).length; + const l = Object.keys(e).length, i = Object.keys(t).length; if (l !== i) return !1; for (const r in e) { - const u = e.hasOwnProperty(r), d = s.hasOwnProperty(r); - if (u && !d || !u && d || !Qs(e[r], s[r])) + const u = e.hasOwnProperty(r), d = t.hasOwnProperty(r); + if (u && !d || !u && d || !Qs(e[r], t[r])) return !1; } } - return String(e) === String(s); + return String(e) === String(t); } -function Ra(e, s) { - return e.findIndex((o) => Qs(o, s)); +function Ra(e, t) { + return e.findIndex((o) => Qs(o, t)); } -const oi = (e) => !!(e && e.__v_isRef === !0), f = (e) => ut(e) ? e : e == null ? "" : Ue(e) || tt(e) && (e.toString === Zl || !Be(e.toString)) ? oi(e) ? f(e.value) : JSON.stringify(e, ni, 2) : String(e), ni = (e, s) => oi(s) ? ni(e, s.value) : co(s) ? { - [`Map(${s.size})`]: [...s.entries()].reduce( +const oi = (e) => !!(e && e.__v_isRef === !0), f = (e) => ut(e) ? e : e == null ? "" : Ne(e) || tt(e) && (e.toString === Zl || !Be(e.toString)) ? oi(e) ? f(e.value) : JSON.stringify(e, ni, 2) : String(e), ni = (e, t) => oi(t) ? ni(e, t.value) : co(t) ? { + [`Map(${t.size})`]: [...t.entries()].reduce( (o, [n, l], i) => (o[Kn(n, i) + " =>"] = l, o), {} ) -} : yo(s) ? { - [`Set(${s.size})`]: [...s.values()].map((o) => Kn(o)) -} : Zt(s) ? Kn(s) : tt(s) && !Ue(s) && !ei(s) ? String(s) : s, Kn = (e, s = "") => { +} : yo(t) ? { + [`Set(${t.size})`]: [...t.values()].map((o) => Kn(o)) +} : Zt(t) ? Kn(t) : tt(t) && !Ne(t) && !ei(t) ? String(t) : t, Kn = (e, t = "") => { var o; return ( // Symbol.description in es2019+ so we need to cast here to pass // the lib: es2016 check - Zt(e) ? `Symbol(${(o = e.description) != null ? o : s})` : e + Zt(e) ? `Symbol(${(o = e.description) != null ? o : t})` : e ); }; /** @@ -142,8 +142,8 @@ const oi = (e) => !!(e && e.__v_isRef === !0), f = (e) => ut(e) ? e : e == null **/ let Dt; class Qr { - constructor(s = !1) { - this.detached = s, this._active = !0, this._on = 0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = Dt, !s && Dt && (this.index = (Dt.scopes || (Dt.scopes = [])).push( + constructor(t = !1) { + this.detached = t, this._active = !0, this._on = 0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = Dt, !t && Dt && (this.index = (Dt.scopes || (Dt.scopes = [])).push( this ) - 1); } @@ -153,12 +153,12 @@ class Qr { pause() { if (this._active) { this._isPaused = !0; - let s, o; + let t, o; if (this.scopes) - for (s = 0, o = this.scopes.length; s < o; s++) - this.scopes[s].pause(); - for (s = 0, o = this.effects.length; s < o; s++) - this.effects[s].pause(); + for (t = 0, o = this.scopes.length; t < o; t++) + this.scopes[t].pause(); + for (t = 0, o = this.effects.length; t < o; t++) + this.effects[t].pause(); } } /** @@ -167,19 +167,19 @@ class Qr { resume() { if (this._active && this._isPaused) { this._isPaused = !1; - let s, o; + let t, o; if (this.scopes) - for (s = 0, o = this.scopes.length; s < o; s++) - this.scopes[s].resume(); - for (s = 0, o = this.effects.length; s < o; s++) - this.effects[s].resume(); + for (t = 0, o = this.scopes.length; t < o; t++) + this.scopes[t].resume(); + for (t = 0, o = this.effects.length; t < o; t++) + this.effects[t].resume(); } } - run(s) { + run(t) { if (this._active) { const o = Dt; try { - return Dt = this, s(); + return Dt = this, t(); } finally { Dt = o; } @@ -199,7 +199,7 @@ class Qr { off() { this._on > 0 && --this._on === 0 && (Dt = this.prevScope, this.prevScope = void 0); } - stop(s) { + stop(t) { if (this._active) { this._active = !1; let o, n; @@ -212,7 +212,7 @@ class Qr { this.scopes[o].stop(!0); this.scopes.length = 0; } - if (!this.detached && this.parent && !s) { + if (!this.detached && this.parent && !t) { const l = this.parent.scopes.pop(); l && l !== this && (this.parent.scopes[this.index] = l, l.index = this.index); } @@ -226,8 +226,8 @@ function Zr() { let nt; const qn = /* @__PURE__ */ new WeakSet(); class ai { - constructor(s) { - this.fn = s, this.deps = void 0, this.depsTail = void 0, this.flags = 5, this.next = void 0, this.cleanup = void 0, this.scheduler = void 0, Dt && Dt.active && Dt.effects.push(this); + 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, Dt && Dt.active && Dt.effects.push(this); } pause() { this.flags |= 64; @@ -245,18 +245,18 @@ class ai { if (!(this.flags & 1)) return this.fn(); this.flags |= 2, nl(this), ri(this); - const s = nt, o = Jt; + const t = nt, o = Jt; nt = this, Jt = !0; try { return this.fn(); } finally { - ci(this), nt = s, Jt = o, this.flags &= -3; + ci(this), nt = t, Jt = o, this.flags &= -3; } } stop() { if (this.flags & 1) { - for (let s = this.deps; s; s = s.nextDep) - La(s); + for (let t = this.deps; t; t = t.nextDep) + La(t); this.deps = this.depsTail = void 0, nl(this), this.onStop && this.onStop(), this.flags &= -2; } } @@ -274,8 +274,8 @@ class ai { } } let li = 0, Do, Lo; -function ii(e, s = !1) { - if (e.flags |= 8, s) { +function ii(e, t = !1) { + if (e.flags |= 8, t) { e.next = Lo, Lo = e; return; } @@ -288,43 +288,43 @@ function Da() { if (--li > 0) return; if (Lo) { - let s = Lo; - for (Lo = void 0; s; ) { - const o = s.next; - s.next = void 0, s.flags &= -9, s = o; + let t = Lo; + for (Lo = void 0; t; ) { + const o = t.next; + t.next = void 0, t.flags &= -9, t = o; } } let e; for (; Do; ) { - let s = Do; - for (Do = void 0; s; ) { - const o = s.next; - if (s.next = void 0, s.flags &= -9, s.flags & 1) + let t = Do; + for (Do = void 0; t; ) { + const o = t.next; + if (t.next = void 0, t.flags &= -9, t.flags & 1) try { - s.trigger(); + t.trigger(); } catch (n) { e || (e = n); } - s = o; + t = o; } } if (e) throw e; } function ri(e) { - for (let s = e.deps; s; s = s.nextDep) - s.version = -1, s.prevActiveLink = s.dep.activeLink, s.dep.activeLink = s; + for (let t = e.deps; t; t = t.nextDep) + t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t; } function ci(e) { - let s, o = e.depsTail, n = o; + let t, o = e.depsTail, n = o; for (; n; ) { const l = n.prevDep; - n.version === -1 ? (n === o && (o = l), La(n), ec(n)) : s = n, n.dep.activeLink = n.prevActiveLink, n.prevActiveLink = void 0, n = l; + n.version === -1 ? (n === o && (o = l), La(n), ec(n)) : t = n, n.dep.activeLink = n.prevActiveLink, n.prevActiveLink = void 0, n = l; } - e.deps = s, e.depsTail = o; + e.deps = t, e.depsTail = o; } function da(e) { - for (let s = e.deps; s; s = s.nextDep) - if (s.dep.version !== s.version || s.dep.computed && (ui(s.dep.computed) || s.dep.version !== s.version)) + for (let t = e.deps; t; t = t.nextDep) + if (t.dep.version !== t.version || t.dep.computed && (ui(t.dep.computed) || t.dep.version !== t.version)) return !0; return !!e._dirty; } @@ -332,30 +332,30 @@ function ui(e) { if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === Vo) || (e.globalVersion = Vo, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !da(e)))) return; e.flags |= 2; - const s = e.dep, o = nt, n = Jt; + const t = e.dep, o = nt, n = Jt; nt = e, Jt = !0; try { ri(e); const l = e.fn(e._value); - (s.version === 0 || As(l, e._value)) && (e.flags |= 128, e._value = l, s.version++); + (t.version === 0 || As(l, e._value)) && (e.flags |= 128, e._value = l, t.version++); } catch (l) { - throw s.version++, l; + throw t.version++, l; } finally { nt = o, Jt = n, ci(e), e.flags &= -3; } } -function La(e, s = !1) { +function La(e, t = !1) { const { dep: o, prevSub: n, nextSub: l } = e; if (n && (n.nextSub = l, e.prevSub = void 0), l && (l.prevSub = n, e.nextSub = void 0), o.subs === e && (o.subs = n, !n && o.computed)) { o.computed.flags &= -5; for (let i = o.computed.deps; i; i = i.nextDep) La(i, !0); } - !s && !--o.sc && o.map && o.map.delete(o.key); + !t && !--o.sc && o.map && o.map.delete(o.key); } function ec(e) { - const { prevDep: s, nextDep: o } = e; - s && (s.nextDep = o, e.prevDep = void 0), o && (o.prevDep = s, e.nextDep = void 0); + const { prevDep: t, nextDep: o } = e; + t && (t.nextDep = o, e.prevDep = void 0), o && (o.prevDep = t, e.nextDep = void 0); } let Jt = !0; const di = []; @@ -367,12 +367,12 @@ function Cs() { Jt = e === void 0 ? !0 : e; } function nl(e) { - const { cleanup: s } = e; - if (e.cleanup = void 0, s) { + const { cleanup: t } = e; + if (e.cleanup = void 0, t) { const o = nt; nt = void 0; try { - s(); + t(); } finally { nt = o; } @@ -380,16 +380,16 @@ function nl(e) { } let Vo = 0; class tc { - constructor(s, o) { - this.sub = s, this.dep = o, this.version = o.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0; + constructor(t, o) { + this.sub = t, this.dep = o, this.version = o.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0; } } class Oa { // TODO isolatedDeclarations "__v_skip" - constructor(s) { - this.computed = s, 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; + 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(s) { + track(t) { if (!nt || !Jt || nt === this.computed) return; let o = this.activeLink; @@ -401,10 +401,10 @@ class Oa { } return o; } - trigger(s) { - this.version++, Vo++, this.notify(s); + trigger(t) { + this.version++, Vo++, this.notify(t); } - notify(s) { + notify(t) { Ma(); try { for (let o = this.subs; o; o = o.prevSub) @@ -416,10 +416,10 @@ class Oa { } function fi(e) { if (e.dep.sc++, e.sub.flags & 4) { - const s = e.dep.computed; - if (s && !e.dep.subs) { - s.flags |= 20; - for (let n = s.deps; n; n = n.nextDep) + const t = e.dep.computed; + if (t && !e.dep.subs) { + t.flags |= 20; + for (let n = t.deps; n; n = n.nextDep) fi(n); } const o = e.dep.subs; @@ -433,7 +433,7 @@ const fa = /* @__PURE__ */ new WeakMap(), Js = Symbol( ), Wo = Symbol( "" ); -function bt(e, s, o) { +function bt(e, t, o) { if (Jt && nt) { let n = fa.get(e); n || fa.set(e, n = /* @__PURE__ */ new Map()); @@ -441,7 +441,7 @@ function bt(e, s, o) { l || (n.set(o, l = new Oa()), l.map = n, l.key = o), l.track(); } } -function bs(e, s, o, n, l, i) { +function bs(e, t, o, n, l, i) { const r = fa.get(e); if (!r) { Vo++; @@ -450,17 +450,17 @@ function bs(e, s, o, n, l, i) { const u = (d) => { d && d.trigger(); }; - if (Ma(), s === "clear") + if (Ma(), t === "clear") r.forEach(u); else { - const d = Ue(e), m = d && Pa(o); + const d = Ne(e), m = d && Pa(o); if (d && o === "length") { const v = Number(n); r.forEach((h, w) => { (w === "length" || w === Wo || !Zt(w) && w >= v) && u(h); }); } else - switch ((o !== void 0 || r.has(void 0)) && u(r.get(o)), m && u(r.get(Wo)), s) { + switch ((o !== void 0 || r.has(void 0)) && u(r.get(o)), m && u(r.get(Wo)), t) { case "add": d ? m && u(r.get("length")) : (u(r.get(Js)), co(e) && u(r.get(ma))); break; @@ -475,14 +475,14 @@ function bs(e, s, o, n, l, i) { Da(); } function so(e) { - const s = Je(e); - return s === e ? s : (bt(s, "iterate", Wo), Bt(e) ? s : s.map(es)); + const t = Je(e); + return t === e ? t : (bt(t, "iterate", Wo), Bt(e) ? t : t.map(es)); } function An(e) { return bt(e = Je(e), "iterate", Wo), e; } -function Ms(e, s) { - return xs(e) ? Xs(e) ? po(es(s)) : po(s) : es(s); +function Ms(e, t) { + return xs(e) ? Xs(e) ? po(es(t)) : po(t) : es(t); } const sc = { __proto__: null, @@ -491,54 +491,54 @@ const sc = { }, concat(...e) { return so(this).concat( - ...e.map((s) => Ue(s) ? so(s) : s) + ...e.map((t) => Ne(t) ? so(t) : t) ); }, entries() { return Yn(this, "entries", (e) => (e[1] = Ms(this, e[1]), e)); }, - every(e, s) { - return hs(this, "every", e, s, void 0, arguments); + every(e, t) { + return hs(this, "every", e, t, void 0, arguments); }, - filter(e, s) { + filter(e, t) { return hs( this, "filter", e, - s, + t, (o) => o.map((n) => Ms(this, n)), arguments ); }, - find(e, s) { + find(e, t) { return hs( this, "find", e, - s, + t, (o) => Ms(this, o), arguments ); }, - findIndex(e, s) { - return hs(this, "findIndex", e, s, void 0, arguments); + findIndex(e, t) { + return hs(this, "findIndex", e, t, void 0, arguments); }, - findLast(e, s) { + findLast(e, t) { return hs( this, "findLast", e, - s, + t, (o) => Ms(this, o), arguments ); }, - findLastIndex(e, s) { - return hs(this, "findLastIndex", e, s, void 0, arguments); + findLastIndex(e, t) { + return hs(this, "findLastIndex", e, t, void 0, arguments); }, // flat, flatMap could benefit from ARRAY_ITERATE but are not straight-forward to implement - forEach(e, s) { - return hs(this, "forEach", e, s, void 0, arguments); + forEach(e, t) { + return hs(this, "forEach", e, t, void 0, arguments); }, includes(...e) { return Jn(this, "includes", e); @@ -553,8 +553,8 @@ const sc = { lastIndexOf(...e) { return Jn(this, "lastIndexOf", e); }, - map(e, s) { - return hs(this, "map", e, s, void 0, arguments); + map(e, t) { + return hs(this, "map", e, t, void 0, arguments); }, pop() { return xo(this, "pop"); @@ -562,18 +562,18 @@ const sc = { push(...e) { return xo(this, "push", e); }, - reduce(e, ...s) { - return al(this, "reduce", e, s); + reduce(e, ...t) { + return al(this, "reduce", e, t); }, - reduceRight(e, ...s) { - return al(this, "reduceRight", e, s); + reduceRight(e, ...t) { + return al(this, "reduceRight", e, t); }, shift() { return xo(this, "shift"); }, // slice could use ARRAY_ITERATE but also seems to beg for range tracking - some(e, s) { - return hs(this, "some", e, s, void 0, arguments); + some(e, t) { + return hs(this, "some", e, t, void 0, arguments); }, splice(...e) { return xo(this, "splice", e); @@ -594,17 +594,17 @@ const sc = { return Yn(this, "values", (e) => Ms(this, e)); } }; -function Yn(e, s, o) { - const n = An(e), l = n[s](); +function Yn(e, t, o) { + const n = An(e), l = n[t](); return n !== e && !Bt(e) && (l._next = l.next, l.next = () => { const i = l._next(); return i.done || (i.value = o(i.value)), i; }), l; } const oc = Array.prototype; -function hs(e, s, o, n, l, i) { - const r = An(e), u = r !== e && !Bt(e), d = r[s]; - if (d !== oc[s]) { +function hs(e, t, o, n, l, i) { + const r = An(e), u = r !== e && !Bt(e), d = r[t]; + if (d !== oc[t]) { const h = d.apply(e, i); return u ? es(h) : h; } @@ -617,24 +617,24 @@ function hs(e, s, o, n, l, i) { const v = d.call(r, m, n); return u && l ? l(v) : v; } -function al(e, s, o, n) { +function al(e, t, o, n) { const l = An(e); let i = o; return l !== e && (Bt(e) ? o.length > 3 && (i = function(r, u, d) { return o.call(this, r, u, d, e); }) : i = function(r, u, d) { return o.call(this, r, Ms(e, u), d, e); - }), l[s](i, ...n); + }), l[t](i, ...n); } -function Jn(e, s, o) { +function Jn(e, t, o) { const n = Je(e); bt(n, "iterate", Wo); - const l = n[s](...o); - return (l === -1 || l === !1) && Ua(o[0]) ? (o[0] = Je(o[0]), n[s](...o)) : l; + const l = n[t](...o); + return (l === -1 || l === !1) && Na(o[0]) ? (o[0] = Je(o[0]), n[t](...o)) : l; } -function xo(e, s, o = []) { +function xo(e, t, o = []) { $s(), Ma(); - const n = Je(e)[s].apply(e, o); + const n = Je(e)[t].apply(e, o); return Da(), Cs(), n; } const nc = /* @__PURE__ */ Ia("__proto__,__v_isRef,__isVue"), mi = new Set( @@ -642,15 +642,15 @@ const nc = /* @__PURE__ */ Ia("__proto__,__v_isRef,__isVue"), mi = new Set( ); function ac(e) { Zt(e) || (e = String(e)); - const s = Je(this); - return bt(s, "has", e), s.hasOwnProperty(e); + const t = Je(this); + return bt(t, "has", e), t.hasOwnProperty(e); } class vi { - constructor(s = !1, o = !1) { - this._isReadonly = s, this._isShallow = o; + constructor(t = !1, o = !1) { + this._isReadonly = t, this._isShallow = o; } - get(s, o, n) { - if (o === "__v_skip") return s.__v_skip; + get(t, o, n) { + if (o === "__v_skip") return t.__v_skip; const l = this._isReadonly, i = this._isShallow; if (o === "__v_isReactive") return !l; @@ -659,10 +659,10 @@ class vi { if (o === "__v_isShallow") return i; if (o === "__v_raw") - return n === (l ? i ? pc : yi : i ? hi : gi).get(s) || // receiver is not the reactive proxy, but has the same prototype + return n === (l ? i ? pc : yi : i ? hi : gi).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(s) === Object.getPrototypeOf(n) ? s : void 0; - const r = Ue(s); + Object.getPrototypeOf(t) === Object.getPrototypeOf(n) ? t : void 0; + const r = Ne(t); if (!l) { let d; if (r && (d = sc[o])) @@ -671,14 +671,14 @@ class vi { return ac; } const u = Reflect.get( - s, + t, o, // 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 - $t(s) ? s : n + $t(t) ? t : n ); - if ((Zt(o) ? mi.has(o) : nc(o)) || (l || bt(s, "get", o), i)) + if ((Zt(o) ? mi.has(o) : nc(o)) || (l || bt(t, "get", o), i)) return u; if ($t(u)) { const d = r && Pa(o) ? u : u.value; @@ -688,60 +688,60 @@ class vi { } } class pi extends vi { - constructor(s = !1) { - super(!1, s); + constructor(t = !1) { + super(!1, t); } - set(s, o, n, l) { - let i = s[o]; - const r = Ue(s) && Pa(o); + set(t, o, n, l) { + let i = t[o]; + const r = Ne(t) && Pa(o); if (!this._isShallow) { const m = xs(i); if (!Bt(n) && !xs(n) && (i = Je(i), n = Je(n)), !r && $t(i) && !$t(n)) return m || (i.value = n), !0; } - const u = r ? Number(o) < s.length : Ze(s, o), d = Reflect.set( - s, + const u = r ? Number(o) < t.length : Ze(t, o), d = Reflect.set( + t, o, n, - $t(s) ? s : l + $t(t) ? t : l ); - return s === Je(l) && (u ? As(n, i) && bs(s, "set", o, n) : bs(s, "add", o, n)), d; + return t === Je(l) && (u ? As(n, i) && bs(t, "set", o, n) : bs(t, "add", o, n)), d; } - deleteProperty(s, o) { - const n = Ze(s, o); - s[o]; - const l = Reflect.deleteProperty(s, o); - return l && n && bs(s, "delete", o, void 0), l; + deleteProperty(t, o) { + const n = Ze(t, o); + t[o]; + const l = Reflect.deleteProperty(t, o); + return l && n && bs(t, "delete", o, void 0), l; } - has(s, o) { - const n = Reflect.has(s, o); - return (!Zt(o) || !mi.has(o)) && bt(s, "has", o), n; + has(t, o) { + const n = Reflect.has(t, o); + return (!Zt(o) || !mi.has(o)) && bt(t, "has", o), n; } - ownKeys(s) { + ownKeys(t) { return bt( - s, + t, "iterate", - Ue(s) ? "length" : Js - ), Reflect.ownKeys(s); + Ne(t) ? "length" : Js + ), Reflect.ownKeys(t); } } class lc extends vi { - constructor(s = !1) { - super(!0, s); + constructor(t = !1) { + super(!0, t); } - set(s, o) { + set(t, o) { return !0; } - deleteProperty(s, o) { + deleteProperty(t, o) { return !0; } } const ic = /* @__PURE__ */ new pi(), rc = /* @__PURE__ */ new lc(), cc = /* @__PURE__ */ new pi(!0); const va = (e) => e, sn = (e) => Reflect.getPrototypeOf(e); -function uc(e, s, o) { +function uc(e, t, o) { return function(...n) { - const l = this.__v_raw, i = Je(l), r = co(i), u = e === "entries" || e === Symbol.iterator && r, d = e === "keys" && r, m = l[e](...n), v = o ? va : s ? po : es; - return !s && bt( + const l = this.__v_raw, i = Je(l), r = co(i), u = e === "entries" || e === Symbol.iterator && r, d = e === "keys" && r, m = l[e](...n), v = o ? va : t ? po : es; + return !t && bt( i, "iterate", d ? ma : Js @@ -762,16 +762,16 @@ function uc(e, s, o) { }; } function on(e) { - return function(...s) { + return function(...t) { return e === "delete" ? !1 : e === "clear" ? void 0 : this; }; } -function dc(e, s) { +function dc(e, t) { const o = { get(l) { const i = this.__v_raw, r = Je(i), u = Je(l); e || (As(l, u) && bt(r, "get", l), bt(r, "get", u)); - const { has: d } = sn(r), m = s ? va : e ? po : es; + const { has: d } = sn(r), m = t ? va : e ? po : es; if (d.call(r, l)) return m(i.get(l)); if (d.call(r, u)) @@ -787,7 +787,7 @@ function dc(e, s) { return e || (As(l, u) && bt(r, "has", l), bt(r, "has", u)), l === u ? i.has(l) : i.has(l) || i.has(u); }, forEach(l, i) { - const r = this, u = r.__v_raw, d = Je(u), m = s ? va : e ? po : es; + const r = this, u = r.__v_raw, d = Je(u), m = t ? va : e ? po : es; return !e && bt(d, "iterate", Js), u.forEach((v, h) => l.call(i, m(v), m(h), r)); } }; @@ -800,12 +800,12 @@ function dc(e, s) { clear: on("clear") } : { add(l) { - !s && !Bt(l) && !xs(l) && (l = Je(l)); + !t && !Bt(l) && !xs(l) && (l = Je(l)); const i = Je(this); return sn(i).has.call(i, l) || (i.add(l), bs(i, "add", l, l)), this; }, set(l, i) { - !s && !Bt(i) && !xs(i) && (i = Je(i)); + !t && !Bt(i) && !xs(i) && (i = Je(i)); const r = Je(this), { has: u, get: d } = sn(r); let m = u.call(r, l); m || (l = Je(l), m = u.call(r, l)); @@ -835,11 +835,11 @@ function dc(e, s) { "entries", Symbol.iterator ].forEach((l) => { - o[l] = uc(l, e, s); + o[l] = uc(l, e, t); }), o; } -function Aa(e, s) { - const o = dc(e, s); +function Aa(e, t) { + const o = dc(e, t); return (n, l, i) => l === "__v_isReactive" ? !e : l === "__v_isReadonly" ? e : l === "__v_raw" ? n : Reflect.get( Ze(o, l) && l in n ? o : n, l, @@ -872,7 +872,7 @@ function hc(e) { return e.__v_skip || !Object.isExtensible(e) ? 0 : gc(Br(e)); } function Fs(e) { - return xs(e) ? e : Na( + return xs(e) ? e : Ua( e, !1, ic, @@ -881,7 +881,7 @@ function Fs(e) { ); } function yc(e) { - return Na( + return Ua( e, !1, cc, @@ -890,7 +890,7 @@ function yc(e) { ); } function wn(e) { - return Na( + return Ua( e, !0, rc, @@ -898,8 +898,8 @@ function wn(e) { yi ); } -function Na(e, s, o, n, l) { - if (!tt(e) || e.__v_raw && !(s && e.__v_isReactive)) +function Ua(e, t, o, n, l) { + if (!tt(e) || e.__v_raw && !(t && e.__v_isReactive)) return e; const i = hc(e); if (i === 0) @@ -922,12 +922,12 @@ function xs(e) { function Bt(e) { return !!(e && e.__v_isShallow); } -function Ua(e) { +function Na(e) { return e ? !!e.__v_raw : !1; } function Je(e) { - const s = e && e.__v_raw; - return s ? Je(s) : e; + const t = e && e.__v_raw; + return t ? Je(t) : e; } function wc(e) { return !Ze(e, "__v_skip") && Object.isExtensible(e) && ti(e, "__v_skip", !0), e; @@ -939,37 +939,37 @@ function $t(e) { function k(e) { return bc(e, !1); } -function bc(e, s) { - return $t(e) ? e : new _c(e, s); +function bc(e, t) { + return $t(e) ? e : new _c(e, t); } class _c { - constructor(s, o) { - this.dep = new Oa(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = o ? s : Je(s), this._value = o ? s : es(s), this.__v_isShallow = o; + constructor(t, o) { + this.dep = new Oa(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = o ? t : Je(t), this._value = o ? t : es(t), this.__v_isShallow = o; } get value() { return this.dep.track(), this._value; } - set value(s) { - const o = this._rawValue, n = this.__v_isShallow || Bt(s) || xs(s); - s = n ? s : Je(s), As(s, o) && (this._rawValue = s, this._value = n ? s : es(s), this.dep.trigger()); + set value(t) { + const o = this._rawValue, n = this.__v_isShallow || Bt(t) || xs(t); + t = n ? t : Je(t), As(t, o) && (this._rawValue = t, this._value = n ? t : es(t), this.dep.trigger()); } } function Fe(e) { return $t(e) ? e.value : e; } const kc = { - get: (e, s, o) => s === "__v_raw" ? e : Fe(Reflect.get(e, s, o)), - set: (e, s, o, n) => { - const l = e[s]; - return $t(l) && !$t(o) ? (l.value = o, !0) : Reflect.set(e, s, o, n); + get: (e, t, o) => t === "__v_raw" ? e : Fe(Reflect.get(e, t, o)), + set: (e, t, o, n) => { + const l = e[t]; + return $t(l) && !$t(o) ? (l.value = o, !0) : Reflect.set(e, t, o, n); } }; function wi(e) { return Xs(e) ? e : new Proxy(e, kc); } class $c { - constructor(s, o, n) { - this.fn = s, this.setter = o, this._value = void 0, this.dep = new Oa(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = Vo - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !o, this.isSSR = n; + constructor(t, o, n) { + this.fn = t, this.setter = o, this._value = void 0, this.dep = new Oa(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = Vo - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !o, this.isSSR = n; } /** * @internal @@ -980,36 +980,36 @@ class $c { return ii(this, !0), !0; } get value() { - const s = this.dep.track(); - return ui(this), s && (s.version = this.dep.version), this._value; + const t = this.dep.track(); + return ui(this), t && (t.version = this.dep.version), this._value; } - set value(s) { - this.setter && this.setter(s); + set value(t) { + this.setter && this.setter(t); } } -function Cc(e, s, o = !1) { +function Cc(e, t, o = !1) { let n, l; return Be(e) ? n = e : (n = e.get, l = e.set), new $c(n, l, o); } const nn = {}, bn = /* @__PURE__ */ new WeakMap(); let qs; -function xc(e, s = !1, o = qs) { +function xc(e, t = !1, o = qs) { if (o) { let n = bn.get(o); n || bn.set(o, n = []), n.push(e); } } -function Sc(e, s, o = st) { +function Sc(e, t, o = st) { const { immediate: n, deep: l, once: i, scheduler: r, augmentJob: u, call: d } = o, m = (x) => l ? x : Bt(x) || l === !1 || l === 0 ? _s(x, 1) : _s(x); let v, h, w, p, _ = !1, S = !1; - if ($t(e) ? (h = () => e.value, _ = Bt(e)) : Xs(e) ? (h = () => m(e), _ = !0) : Ue(e) ? (S = !0, _ = e.some((x) => Xs(x) || Bt(x)), h = () => e.map((x) => { + if ($t(e) ? (h = () => e.value, _ = Bt(e)) : Xs(e) ? (h = () => m(e), _ = !0) : Ne(e) ? (S = !0, _ = e.some((x) => Xs(x) || Bt(x)), h = () => e.map((x) => { if ($t(x)) return x.value; if (Xs(x)) return m(x); if (Be(x)) return d ? d(x, 2) : x(); - })) : Be(e) ? s ? h = d ? () => d(e, 2) : e : h = () => { + })) : Be(e) ? t ? h = d ? () => d(e, 2) : e : h = () => { if (w) { $s(); try { @@ -1025,23 +1025,23 @@ function Sc(e, s, o = st) { } finally { qs = x; } - } : h = ms, s && l) { + } : h = ms, t && l) { const x = h, q = l === !0 ? 1 / 0 : l; h = () => _s(x(), q); } const $ = Zr(), P = () => { v.stop(), $ && $.active && Ta($.effects, v); }; - if (i && s) { - const x = s; - s = (...q) => { + if (i && t) { + const x = t; + t = (...q) => { x(...q), P(); }; } let O = S ? new Array(e.length).fill(nn) : nn; const T = (x) => { if (!(!(v.flags & 1) || !v.dirty && !x)) - if (s) { + if (t) { const q = v.run(); if (l || _ || (S ? q.some((B, A) => As(B, O[A])) : As(q, O))) { w && w(); @@ -1054,9 +1054,9 @@ function Sc(e, s, o = st) { O === nn ? void 0 : S && O[0] === nn ? [] : O, p ]; - O = q, d ? d(s, 3, A) : ( + O = q, d ? d(t, 3, A) : ( // @ts-expect-error - s(...A) + t(...A) ); } finally { qs = B; @@ -1074,25 +1074,25 @@ function Sc(e, s, o = st) { for (const q of x) q(); bn.delete(v); } - }, s ? n ? T(!0) : O = v.run() : r ? r(T.bind(null, !0), !0) : v.run(), P.pause = v.pause.bind(v), P.resume = v.resume.bind(v), P.stop = P, P; + }, t ? n ? T(!0) : O = v.run() : r ? r(T.bind(null, !0), !0) : v.run(), P.pause = v.pause.bind(v), P.resume = v.resume.bind(v), P.stop = P, P; } -function _s(e, s = 1 / 0, o) { - if (s <= 0 || !tt(e) || e.__v_skip || (o = o || /* @__PURE__ */ new Map(), (o.get(e) || 0) >= s)) +function _s(e, t = 1 / 0, o) { + if (t <= 0 || !tt(e) || e.__v_skip || (o = o || /* @__PURE__ */ new Map(), (o.get(e) || 0) >= t)) return e; - if (o.set(e, s), s--, $t(e)) - _s(e.value, s, o); - else if (Ue(e)) + if (o.set(e, t), t--, $t(e)) + _s(e.value, t, o); + else if (Ne(e)) for (let n = 0; n < e.length; n++) - _s(e[n], s, o); + _s(e[n], t, o); else if (yo(e) || co(e)) e.forEach((n) => { - _s(n, s, o); + _s(n, t, o); }); else if (ei(e)) { for (const n in e) - _s(e[n], s, o); + _s(e[n], t, o); for (const n of Object.getOwnPropertySymbols(e)) - Object.prototype.propertyIsEnumerable.call(e, n) && _s(e[n], s, o); + Object.prototype.propertyIsEnumerable.call(e, n) && _s(e[n], t, o); } return e; } @@ -1101,32 +1101,32 @@ function _s(e, s = 1 / 0, o) { * (c) 2018-present Yuxi (Evan) You and Vue contributors * @license MIT **/ -function Xo(e, s, o, n) { +function Xo(e, t, o, n) { try { return n ? e(...n) : e(); } catch (l) { - Nn(l, s, o); + Un(l, t, o); } } -function ts(e, s, o, n) { +function ts(e, t, o, n) { if (Be(e)) { - const l = Xo(e, s, o, n); + const l = Xo(e, t, o, n); return l && Ql(l) && l.catch((i) => { - Nn(i, s, o); + Un(i, t, o); }), l; } - if (Ue(e)) { + if (Ne(e)) { const l = []; for (let i = 0; i < e.length; i++) - l.push(ts(e[i], s, o, n)); + l.push(ts(e[i], t, o, n)); return l; } } -function Nn(e, s, o, n = !0) { - const l = s ? s.vnode : null, { errorHandler: i, throwUnhandledErrorInProduction: r } = s && s.appContext.config || st; - if (s) { - let u = s.parent; - const d = s.proxy, m = `https://vuejs.org/error-reference/#runtime-${o}`; +function Un(e, t, o, n = !0) { + const l = t ? t.vnode : null, { errorHandler: i, throwUnhandledErrorInProduction: r } = t && t.appContext.config || st; + if (t) { + let u = t.parent; + const d = t.proxy, m = `https://vuejs.org/error-reference/#runtime-${o}`; for (; u; ) { const v = u.ec; if (v) { @@ -1147,7 +1147,7 @@ function Nn(e, s, o, n = !0) { } Ic(e, o, l, n, r); } -function Ic(e, s, o, n = !0, l = !1) { +function Ic(e, t, o, n = !0, l = !1) { if (l) throw e; console.error(e); @@ -1159,31 +1159,31 @@ let Ds = null, ao = 0; const bi = /* @__PURE__ */ Promise.resolve(); let _n = null; function Qo(e) { - const s = _n || bi; - return e ? s.then(this ? e.bind(this) : e) : s; + const t = _n || bi; + return e ? t.then(this ? e.bind(this) : e) : t; } function Ec(e) { - let s = us + 1, o = It.length; - for (; s < o; ) { - const n = s + o >>> 1, l = It[n], i = Go(l); - i < e || i === e && l.flags & 2 ? s = n + 1 : o = n; + let t = us + 1, o = It.length; + for (; t < o; ) { + const n = t + o >>> 1, l = It[n], i = Go(l); + i < e || i === e && l.flags & 2 ? t = n + 1 : o = n; } - return s; + return t; } function za(e) { if (!(e.flags & 1)) { - const s = Go(e), o = It[It.length - 1]; + const t = Go(e), o = It[It.length - 1]; !o || // fast path when the job id is larger than the tail - !(e.flags & 2) && s >= Go(o) ? It.push(e) : It.splice(Ec(s), 0, e), e.flags |= 1, _i(); + !(e.flags & 2) && t >= Go(o) ? It.push(e) : It.splice(Ec(t), 0, e), e.flags |= 1, _i(); } } function _i() { _n || (_n = bi.then($i)); } function Tc(e) { - Ue(e) ? uo.push(...e) : Ds && e.id === -1 ? Ds.splice(ao + 1, 0, e) : e.flags & 1 || (uo.push(e), e.flags |= 1), _i(); + Ne(e) ? uo.push(...e) : Ds && e.id === -1 ? Ds.splice(ao + 1, 0, e) : e.flags & 1 || (uo.push(e), e.flags |= 1), _i(); } -function ll(e, s, o = us + 1) { +function ll(e, t, o = us + 1) { for (; o < It.length; o++) { const n = It[o]; if (n && n.flags & 2) { @@ -1195,14 +1195,14 @@ function ll(e, s, o = us + 1) { } function ki(e) { if (uo.length) { - const s = [...new Set(uo)].sort( + const t = [...new Set(uo)].sort( (o, n) => Go(o) - Go(n) ); if (uo.length = 0, Ds) { - Ds.push(...s); + Ds.push(...t); return; } - for (Ds = s, ao = 0; ao < Ds.length; ao++) { + for (Ds = t, ao = 0; ao < Ds.length; ao++) { const o = Ds[ao]; o.flags & 4 && (o.flags &= -2), o.flags & 8 || o(), o.flags &= -2; } @@ -1213,32 +1213,32 @@ const Go = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id; function $i(e) { try { for (us = 0; us < It.length; us++) { - const s = It[us]; - s && !(s.flags & 8) && (s.flags & 4 && (s.flags &= -2), Xo( - s, - s.i, - s.i ? 15 : 14 - ), s.flags & 4 || (s.flags &= -2)); + const t = It[us]; + t && !(t.flags & 8) && (t.flags & 4 && (t.flags &= -2), Xo( + t, + t.i, + t.i ? 15 : 14 + ), t.flags & 4 || (t.flags &= -2)); } } finally { for (; us < It.length; us++) { - const s = It[us]; - s && (s.flags &= -2); + const t = It[us]; + t && (t.flags &= -2); } us = -1, It.length = 0, ki(), _n = null, (It.length || uo.length) && $i(); } } let yt = null, Ci = null; function kn(e) { - const s = yt; - return yt = e, Ci = e && e.type.__scopeId || null, s; + const t = yt; + return yt = e, Ci = e && e.type.__scopeId || null, t; } -function g(e, s = yt, o) { - if (!s || e._n) +function g(e, t = yt, o) { + if (!t || e._n) return e; const n = (...l) => { n._d && xn(-1); - const i = kn(s); + const i = kn(t); let r; try { r = e(...l); @@ -1249,12 +1249,12 @@ function g(e, s = yt, o) { }; return n._n = !0, n._c = !0, n._d = !0, n; } -function qe(e, s) { +function qe(e, t) { if (yt === null) return e; const o = Vn(yt), n = e.dirs || (e.dirs = []); - for (let l = 0; l < s.length; l++) { - let [i, r, u, d = st] = s[l]; + for (let l = 0; l < t.length; l++) { + let [i, r, u, d = st] = t[l]; i && (Be(i) && (i = { mounted: i, updated: i @@ -1269,8 +1269,8 @@ function qe(e, s) { } return e; } -function Gs(e, s, o, n) { - const l = e.dirs, i = s && s.dirs; +function Gs(e, t, o, n) { + const l = e.dirs, i = t && t.dirs; for (let r = 0; r < l.length; r++) { const u = l[r]; i && (u.oldValue = i[r].value); @@ -1279,26 +1279,26 @@ function Gs(e, s, o, n) { e.el, u, e, - s + t ]), Cs()); } } -const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disabled || e.disabled === ""), il = (e) => e && (e.defer || e.defer === ""), rl = (e) => typeof SVGElement < "u" && e instanceof SVGElement, cl = (e) => typeof MathMLElement == "function" && e instanceof MathMLElement, pa = (e, s) => { +const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disabled || e.disabled === ""), il = (e) => e && (e.defer || e.defer === ""), rl = (e) => typeof SVGElement < "u" && e instanceof SVGElement, cl = (e) => typeof MathMLElement == "function" && e instanceof MathMLElement, pa = (e, t) => { const o = e && e.to; - return ut(o) ? s ? s(o) : null : o; + return ut(o) ? t ? t(o) : null : o; }, Ii = { name: "Teleport", __isTeleport: !0, - process(e, s, o, n, l, i, r, u, d, m) { + process(e, t, o, n, l, i, r, u, d, m) { const { mc: v, pc: h, pbc: w, o: { insert: p, querySelector: _, createText: S, createComment: $ } - } = m, P = Oo(s.props); - let { shapeFlag: O, children: T, dynamicChildren: x } = s; + } = m, P = Oo(t.props); + let { shapeFlag: O, children: T, dynamicChildren: x } = t; if (e == null) { - const q = s.el = S(""), B = s.anchor = S(""); + const q = t.el = S(""), B = t.anchor = S(""); p(q, o, n), p(B, o, n); const A = (E, L) => { O & 16 && v( @@ -1312,18 +1312,18 @@ const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disab d ); }, I = () => { - const E = s.target = pa(s.props, _), L = Ei(E, s, S, p); - E && (r !== "svg" && rl(E) ? r = "svg" : r !== "mathml" && cl(E) && (r = "mathml"), l && l.isCE && (l.ce._teleportTargets || (l.ce._teleportTargets = /* @__PURE__ */ new Set())).add(E), P || (A(E, L), mn(s, !1))); + const E = t.target = pa(t.props, _), L = Ei(E, t, S, p); + E && (r !== "svg" && rl(E) ? r = "svg" : r !== "mathml" && cl(E) && (r = "mathml"), l && l.isCE && (l.ce._teleportTargets || (l.ce._teleportTargets = /* @__PURE__ */ new Set())).add(E), P || (A(E, L), mn(t, !1))); }; - P && (A(o, B), mn(s, !0)), il(s.props) ? (s.el.__isMounted = !1, St(() => { - I(), delete s.el.__isMounted; + P && (A(o, B), mn(t, !0)), il(t.props) ? (t.el.__isMounted = !1, St(() => { + I(), delete t.el.__isMounted; }, i)) : I(); } else { - if (il(s.props) && e.el.__isMounted === !1) { + if (il(t.props) && e.el.__isMounted === !1) { St(() => { Ii.process( e, - s, + t, o, n, l, @@ -1336,8 +1336,8 @@ const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disab }, i); return; } - s.el = e.el, s.targetStart = e.targetStart; - const q = s.anchor = e.anchor, B = s.target = e.target, A = s.targetAnchor = e.targetAnchor, I = Oo(e.props), E = I ? o : B, L = I ? q : A; + t.el = e.el, t.targetStart = e.targetStart; + const q = t.anchor = e.anchor, B = t.target = e.target, A = t.targetAnchor = e.targetAnchor, I = Oo(e.props), E = I ? o : B, L = I ? q : A; if (r === "svg" || rl(B) ? r = "svg" : (r === "mathml" || cl(B)) && (r = "mathml"), x ? (w( e.dynamicChildren, x, @@ -1346,9 +1346,9 @@ const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disab i, r, u - ), Ga(e, s, !0)) : d || h( + ), Ga(e, t, !0)) : d || h( e, - s, + t, E, L, l, @@ -1357,36 +1357,36 @@ const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disab u, !1 ), P) - I ? s.props && e.props && s.props.to !== e.props.to && (s.props.to = e.props.to) : an( - s, + I ? t.props && e.props && t.props.to !== e.props.to && (t.props.to = e.props.to) : an( + t, o, q, m, 1 ); - else if ((s.props && s.props.to) !== (e.props && e.props.to)) { - const re = s.target = pa( - s.props, + else if ((t.props && t.props.to) !== (e.props && e.props.to)) { + const re = t.target = pa( + t.props, _ ); re && an( - s, + t, re, null, m, 0 ); } else I && an( - s, + t, B, A, m, 1 ); - mn(s, P); + mn(t, P); } }, - remove(e, s, o, { um: n, o: { remove: l } }, i) { + remove(e, t, o, { um: n, o: { remove: l } }, i) { const { shapeFlag: r, children: u, @@ -1402,7 +1402,7 @@ const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disab const S = u[_]; n( S, - s, + t, o, p, !!S.dynamicChildren @@ -1413,20 +1413,20 @@ const xi = Symbol("_vte"), Si = (e) => e.__isTeleport, Oo = (e) => e && (e.disab move: an, hydrate: Pc }; -function an(e, s, o, { o: { insert: n }, m: l }, i = 2) { - i === 0 && n(e.targetAnchor, s, o); +function an(e, t, o, { o: { insert: n }, m: l }, i = 2) { + i === 0 && n(e.targetAnchor, t, o); const { el: r, anchor: u, shapeFlag: d, children: m, props: v } = e, h = i === 2; - if (h && n(r, s, o), (!h || Oo(v)) && d & 16) + if (h && n(r, t, o), (!h || Oo(v)) && d & 16) for (let w = 0; w < m.length; w++) l( m[w], - s, + t, o, 2 ); - h && n(u, s, o); + h && n(u, t, o); } -function Pc(e, s, o, n, l, i, { +function Pc(e, t, o, n, l, i, { o: { nextSibling: r, parentNode: u, querySelector: d, insert: m, createText: v } }, h) { function w(S, $, P, O) { @@ -1440,37 +1440,37 @@ function Pc(e, s, o, n, l, i, { i ), $.targetStart = P, $.targetAnchor = O; } - const p = s.target = pa( - s.props, + const p = t.target = pa( + t.props, d - ), _ = Oo(s.props); + ), _ = Oo(t.props); if (p) { const S = p._lpa || p.firstChild; - if (s.shapeFlag & 16) + if (t.shapeFlag & 16) if (_) w( e, - s, + t, S, S && r(S) ); else { - s.anchor = r(e); + t.anchor = r(e); let $ = S; for (; $; ) { if ($ && $.nodeType === 8) { if ($.data === "teleport start anchor") - s.targetStart = $; + t.targetStart = $; else if ($.data === "teleport anchor") { - s.targetAnchor = $, p._lpa = s.targetAnchor && r(s.targetAnchor); + t.targetAnchor = $, p._lpa = t.targetAnchor && r(t.targetAnchor); break; } } $ = r($); } - s.targetAnchor || Ei(p, s, v, m), h( + t.targetAnchor || Ei(p, t, v, m), h( S && r(S), - s, + t, p, o, n, @@ -1478,22 +1478,22 @@ function Pc(e, s, o, n, l, i, { i ); } - mn(s, _); - } else _ && s.shapeFlag & 16 && w(e, s, e, r(e)); - return s.anchor && r(s.anchor); + mn(t, _); + } else _ && t.shapeFlag & 16 && w(e, t, e, r(e)); + return t.anchor && r(t.anchor); } const wt = Ii; -function mn(e, s) { +function mn(e, t) { const o = e.ctx; if (o && o.ut) { let n, l; - for (s ? (n = e.el, l = e.anchor) : (n = e.targetStart, l = e.targetAnchor); n && n !== l; ) + for (t ? (n = e.el, l = e.anchor) : (n = e.targetStart, l = e.targetAnchor); n && n !== l; ) n.nodeType === 1 && n.setAttribute("data-v-owner", o.uid), n = n.nextSibling; o.ut(); } } -function Ei(e, s, o, n) { - const l = s.targetStart = o(""), i = s.targetAnchor = o(""); +function Ei(e, t, o, n) { + const l = t.targetStart = o(""), i = t.targetAnchor = o(""); return l[xi] = i, e && (n(l, e), n(i, e)), i; } const ws = Symbol("_leaveCb"), ln = Symbol("_enterCb"); @@ -1506,7 +1506,7 @@ function Ti() { }; return et(() => { e.isMounted = !0; - }), Ni(() => { + }), Ui(() => { e.isUnmounting = !0; }), e; } @@ -1530,15 +1530,15 @@ const zt = [Function, Array], Pi = { onAfterAppear: zt, onAppearCancelled: zt }, Ri = (e) => { - const s = e.subTree; - return s.component ? Ri(s.component) : s; + const t = e.subTree; + return t.component ? Ri(t.component) : t; }, Rc = { name: "BaseTransition", props: Pi, - setup(e, { slots: s }) { + setup(e, { slots: t }) { const o = Ha(), n = Ti(); return () => { - const l = s.default && Fa(s.default(), !0); + const l = t.default && Fa(t.default(), !0); if (!l || !l.length) return; const i = Mi(l), r = Je(e), { mode: u } = r; @@ -1585,23 +1585,23 @@ const zt = [Function, Array], Pi = { } }; function Mi(e) { - let s = e[0]; + let t = e[0]; if (e.length > 1) { for (const o of e) if (o.type !== _t) { - s = o; + t = o; break; } } - return s; + return t; } const Mc = Rc; -function Di(e, s) { +function Di(e, t) { const { leavingVNodes: o } = e; - let n = o.get(s.type); - return n || (n = /* @__PURE__ */ Object.create(null), o.set(s.type, n)), n; + let n = o.get(t.type); + return n || (n = /* @__PURE__ */ Object.create(null), o.set(t.type, n)), n; } -function jo(e, s, o, n, l) { +function jo(e, t, o, n, l) { const { appear: i, mode: r, @@ -1618,7 +1618,7 @@ function jo(e, s, o, n, l) { onAppear: P, onAfterAppear: O, onAppearCancelled: T - } = s, x = String(e.key), q = Di(o, e), B = (E, L) => { + } = t, x = String(e.key), q = Di(o, e), B = (E, L) => { E && ts( E, n, @@ -1627,7 +1627,7 @@ function jo(e, s, o, n, l) { ); }, A = (E, L) => { const re = L[1]; - B(E, L), Ue(E) ? E.every((Y) => Y.length <= 1) && re() : E.length <= 1 && re(); + B(E, L), Ne(E) ? E.every((Y) => Y.length <= 1) && re() : E.length <= 1 && re(); }, I = { mode: r, persisted: u, @@ -1675,7 +1675,7 @@ function jo(e, s, o, n, l) { clone(E) { const L = jo( E, - s, + t, o, n, l @@ -1686,33 +1686,33 @@ function jo(e, s, o, n, l) { return I; } function Xn(e) { - if (Un(e)) - return e = Ns(e), e.children = null, e; + if (Nn(e)) + return e = Us(e), e.children = null, e; } function ul(e) { - if (!Un(e)) + if (!Nn(e)) return Si(e.type) && e.children ? Mi(e.children) : e; if (e.component) return e.component.subTree; - const { shapeFlag: s, children: o } = e; + const { shapeFlag: t, children: o } = e; if (o) { - if (s & 16) + if (t & 16) return o[0]; - if (s & 32 && Be(o.default)) + if (t & 32 && Be(o.default)) return o.default(); } } -function Zs(e, s) { - e.shapeFlag & 6 && e.component ? (e.transition = s, Zs(e.component.subTree, s)) : e.shapeFlag & 128 ? (e.ssContent.transition = s.clone(e.ssContent), e.ssFallback.transition = s.clone(e.ssFallback)) : e.transition = s; +function Zs(e, t) { + e.shapeFlag & 6 && e.component ? (e.transition = t, Zs(e.component.subTree, t)) : e.shapeFlag & 128 ? (e.ssContent.transition = t.clone(e.ssContent), e.ssFallback.transition = t.clone(e.ssFallback)) : e.transition = t; } -function Fa(e, s = !1, o) { +function Fa(e, t = !1, o) { let n = [], l = 0; for (let i = 0; i < e.length; i++) { let r = e[i]; const u = o == null ? r.key : String(o) + String(r.key != null ? r.key : i); r.type === j ? (r.patchFlag & 128 && l++, n = n.concat( - Fa(r.children, s, u) - )) : (s || r.type !== _t) && n.push(u != null ? Ns(r, { key: u }) : r); + Fa(r.children, t, u) + )) : (t || r.type !== _t) && n.push(u != null ? Us(r, { key: u }) : r); } if (l > 1) for (let i = 0; i < n.length; i++) @@ -1720,23 +1720,23 @@ function Fa(e, s = !1, o) { return n; } // @__NO_SIDE_EFFECTS__ -function fe(e, s) { +function fe(e, t) { return Be(e) ? ( // #8236: extend call and options.name access are considered side-effects // by Rollup, so we have to wrap it in a pure-annotated IIFE. - pt({ name: e.name }, s, { setup: e }) + pt({ name: e.name }, t, { setup: e }) ) : e; } function Li(e) { e.ids = [e.ids[0] + e.ids[2]++ + "-", 0, 0]; } const $n = /* @__PURE__ */ new WeakMap(); -function Ao(e, s, o, n, l = !1) { - if (Ue(e)) { +function Ao(e, t, o, n, l = !1) { + if (Ne(e)) { e.forEach( (_, S) => Ao( _, - s && (Ue(s) ? s[S] : s), + t && (Ne(t) ? t[S] : t), o, n, l @@ -1745,16 +1745,16 @@ function Ao(e, s, o, n, l = !1) { return; } if (fo(n) && !l) { - n.shapeFlag & 512 && n.type.__asyncResolved && n.component.subTree.component && Ao(e, s, o, n.component.subTree); + n.shapeFlag & 512 && n.type.__asyncResolved && n.component.subTree.component && Ao(e, t, o, n.component.subTree); return; } - const i = n.shapeFlag & 4 ? Vn(n.component) : n.el, r = l ? null : i, { i: u, r: d } = e, m = s && s.r, v = u.refs === st ? u.refs = {} : u.refs, h = u.setupState, w = Je(h), p = h === st ? Xl : (_) => Ze(w, _); + const i = n.shapeFlag & 4 ? Vn(n.component) : n.el, r = l ? null : i, { i: u, r: d } = e, m = t && t.r, v = u.refs === st ? u.refs = {} : u.refs, h = u.setupState, w = Je(h), p = h === st ? Xl : (_) => Ze(w, _); if (m != null && m !== d) { - if (dl(s), ut(m)) + if (dl(t), ut(m)) v[m] = null, p(m) && (h[m] = null); else if ($t(m)) { m.value = null; - const _ = s; + const _ = t; _.k && (v[_.k] = null); } } @@ -1767,8 +1767,8 @@ function Ao(e, s, o, n, l = !1) { if (e.f) { const P = _ ? p(d) ? h[d] : v[d] : d.value; if (l) - Ue(P) && Ta(P, i); - else if (Ue(P)) + Ne(P) && Ta(P, i); + else if (Ne(P)) P.includes(i) || P.push(i); else if (_) v[d] = [i], p(d) && (h[d] = v[d]); @@ -1789,19 +1789,19 @@ function Ao(e, s, o, n, l = !1) { } } function dl(e) { - const s = $n.get(e); - s && (s.flags |= 8, $n.delete(e)); + const t = $n.get(e); + t && (t.flags |= 8, $n.delete(e)); } On().requestIdleCallback; On().cancelIdleCallback; -const fo = (e) => !!e.type.__asyncLoader, Un = (e) => e.type.__isKeepAlive; -function Dc(e, s) { - Oi(e, "a", s); +const fo = (e) => !!e.type.__asyncLoader, Nn = (e) => e.type.__isKeepAlive; +function Dc(e, t) { + Oi(e, "a", t); } -function Lc(e, s) { - Oi(e, "da", s); +function Lc(e, t) { + Oi(e, "da", t); } -function Oi(e, s, o = kt) { +function Oi(e, t, o = kt) { const n = e.__wdc || (e.__wdc = () => { let l = o; for (; l; ) { @@ -1811,51 +1811,51 @@ function Oi(e, s, o = kt) { } return e(); }); - if (zn(s, n, o), o) { + if (zn(t, n, o), o) { let l = o.parent; for (; l && l.parent; ) - Un(l.parent.vnode) && Oc(n, s, o, l), l = l.parent; + Nn(l.parent.vnode) && Oc(n, t, o, l), l = l.parent; } } -function Oc(e, s, o, n) { +function Oc(e, t, o, n) { const l = zn( - s, + t, e, n, !0 /* prepend */ ); wo(() => { - Ta(n[s], l); + Ta(n[t], l); }, o); } -function zn(e, s, o = kt, n = !1) { +function zn(e, t, o = kt, n = !1) { if (o) { - const l = o[e] || (o[e] = []), i = s.__weh || (s.__weh = (...r) => { + const l = o[e] || (o[e] = []), i = t.__weh || (t.__weh = (...r) => { $s(); - const u = Zo(o), d = ts(s, o, e, r); + const u = Zo(o), d = ts(t, o, e, r); return u(), Cs(), d; }); return n ? l.unshift(i) : l.push(i), i; } } -const Ss = (e) => (s, o = kt) => { - (!qo || e === "sp") && zn(e, (...n) => s(...n), o); -}, Ac = Ss("bm"), et = Ss("m"), Nc = Ss( +const Ss = (e) => (t, o = kt) => { + (!qo || e === "sp") && zn(e, (...n) => t(...n), o); +}, Ac = Ss("bm"), et = Ss("m"), Uc = Ss( "bu" -), Ai = Ss("u"), Ni = Ss( +), Ai = Ss("u"), Ui = Ss( "bum" -), wo = Ss("um"), Uc = Ss( +), wo = Ss("um"), Nc = Ss( "sp" ), zc = Ss("rtg"), Fc = Ss("rtc"); -function Bc(e, s = kt) { - zn("ec", e, s); +function Bc(e, t = kt) { + zn("ec", e, t); } -const Vc = "components", Ui = Symbol.for("v-ndc"); +const Vc = "components", Ni = Symbol.for("v-ndc"); function Ba(e) { - return ut(e) ? Wc(Vc, e, !1) || e : e || Ui; + return ut(e) ? Wc(Vc, e, !1) || e : e || Ni; } -function Wc(e, s, o = !0, n = !1) { +function Wc(e, t, o = !0, n = !1) { const l = yt || kt; if (l) { const i = l.type; @@ -1864,30 +1864,30 @@ function Wc(e, s, o = !0, n = !1) { i, !1 ); - if (u && (u === s || u === Wt(s) || u === Dn(Wt(s)))) + if (u && (u === t || u === Wt(t) || u === Dn(Wt(t)))) return i; } const r = ( // local registration // check instance[type] first which is resolved for options API - fl(l[e] || i[e], s) || // global registration - fl(l.appContext[e], s) + fl(l[e] || i[e], t) || // global registration + fl(l.appContext[e], t) ); return !r && n ? i : r; } } -function fl(e, s) { - return e && (e[s] || e[Wt(s)] || e[Dn(Wt(s))]); +function fl(e, t) { + return e && (e[t] || e[Wt(t)] || e[Dn(Wt(t))]); } -function pe(e, s, o, n) { +function pe(e, t, o, n) { let l; - const i = o, r = Ue(e); + const i = o, r = Ne(e); if (r || ut(e)) { const u = r && Xs(e); let d = !1, m = !1; u && (d = !Bt(e), m = xs(e), e = An(e)), l = new Array(e.length); for (let v = 0, h = e.length; v < h; v++) - l[v] = s( + l[v] = t( d ? m ? po(es(e[v])) : es(e[v]) : e[v], v, void 0, @@ -1896,29 +1896,29 @@ function pe(e, s, o, n) { } else if (typeof e == "number") { l = new Array(e); for (let u = 0; u < e; u++) - l[u] = s(u + 1, u, void 0, i); + l[u] = t(u + 1, u, void 0, i); } else if (tt(e)) if (e[Symbol.iterator]) l = Array.from( e, - (u, d) => s(u, d, void 0, i) + (u, d) => t(u, d, void 0, i) ); else { const u = Object.keys(e); l = new Array(u.length); for (let d = 0, m = u.length; d < m; d++) { const v = u[d]; - l[d] = s(e[v], v, d, i); + l[d] = t(e[v], v, d, i); } } else l = []; return l; } -function eo(e, s) { - for (let o = 0; o < s.length; o++) { - const n = s[o]; - if (Ue(n)) +function eo(e, t) { + for (let o = 0; o < t.length; o++) { + const n = t[o]; + if (Ne(n)) for (let l = 0; l < n.length; l++) e[n[l].name] = n[l].fn; else n && (e[n.name] = n.key ? (...l) => { @@ -1928,24 +1928,24 @@ function eo(e, s) { } return e; } -function He(e, s, o = {}, n, l) { +function He(e, t, o = {}, n, l) { if (yt.ce || yt.parent && fo(yt.parent) && yt.parent.ce) { const m = Object.keys(o).length > 0; - return s !== "default" && (o.name = s), a(), R( + return t !== "default" && (o.name = t), a(), R( j, null, [C("slot", o, n && n())], m ? -2 : 64 ); } - let i = e[s]; + let i = e[t]; i && i._c && (i._d = !1), a(); const r = i && zi(i(o)), u = o.key || // slot content array of a dynamic conditional slot may have a branch // key attached in the `createSlots` helper, respect that r && r.key, d = R( j, { - key: (u && !Zt(u) ? u : `_${s}`) + // #7256 force differentiate fallback content from actual content + key: (u && !Zt(u) ? u : `_${t}`) + // #7256 force differentiate fallback content from actual content (!r && n ? "_fb" : "") }, r || (n ? n() : []), @@ -1954,9 +1954,9 @@ function He(e, s, o = {}, n, l) { return i && i._c && (i._d = !0), d; } function zi(e) { - return e.some((s) => Ko(s) ? !(s.type === _t || s.type === j && !zi(s.children)) : !0) ? e : null; + return e.some((t) => Ko(t) ? !(t.type === _t || t.type === j && !zi(t.children)) : !0) ? e : null; } -const ga = (e) => e ? nr(e) ? Vn(e) : ga(e.parent) : null, No = ( +const ga = (e) => e ? nr(e) ? Vn(e) : ga(e.parent) : null, Uo = ( // Move PURE marker to new line to workaround compiler discarding it // due to type annotation /* @__PURE__ */ pt(/* @__PURE__ */ Object.create(null), { @@ -1978,77 +1978,77 @@ const ga = (e) => e ? nr(e) ? Vn(e) : ga(e.parent) : null, No = ( $nextTick: (e) => e.n || (e.n = Qo.bind(e.proxy)), $watch: (e) => tu.bind(e) }) -), Qn = (e, s) => e !== st && !e.__isScriptSetup && Ze(e, s), Gc = { - get({ _: e }, s) { - if (s === "__v_skip") +), Qn = (e, t) => e !== st && !e.__isScriptSetup && Ze(e, t), Gc = { + get({ _: e }, t) { + if (t === "__v_skip") return !0; const { ctx: o, setupState: n, data: l, props: i, accessCache: r, type: u, appContext: d } = e; - if (s[0] !== "$") { - const w = r[s]; + if (t[0] !== "$") { + const w = r[t]; if (w !== void 0) switch (w) { case 1: - return n[s]; + return n[t]; case 2: - return l[s]; + return l[t]; case 4: - return o[s]; + return o[t]; case 3: - return i[s]; + return i[t]; } else { - if (Qn(n, s)) - return r[s] = 1, n[s]; - if (l !== st && Ze(l, s)) - return r[s] = 2, l[s]; - if (Ze(i, s)) - return r[s] = 3, i[s]; - if (o !== st && Ze(o, s)) - return r[s] = 4, o[s]; - ha && (r[s] = 0); + if (Qn(n, t)) + return r[t] = 1, n[t]; + if (l !== st && Ze(l, t)) + return r[t] = 2, l[t]; + if (Ze(i, t)) + return r[t] = 3, i[t]; + if (o !== st && Ze(o, t)) + return r[t] = 4, o[t]; + ha && (r[t] = 0); } } - const m = No[s]; + const m = Uo[t]; let v, h; if (m) - return s === "$attrs" && bt(e.attrs, "get", ""), m(e); + return t === "$attrs" && bt(e.attrs, "get", ""), m(e); if ( // css module (injected by vue-loader) - (v = u.__cssModules) && (v = v[s]) + (v = u.__cssModules) && (v = v[t]) ) return v; - if (o !== st && Ze(o, s)) - return r[s] = 4, o[s]; + if (o !== st && Ze(o, t)) + return r[t] = 4, o[t]; if ( // global properties - h = d.config.globalProperties, Ze(h, s) + h = d.config.globalProperties, Ze(h, t) ) - return h[s]; + return h[t]; }, - set({ _: e }, s, o) { + set({ _: e }, t, o) { const { data: n, setupState: l, ctx: i } = e; - return Qn(l, s) ? (l[s] = o, !0) : n !== st && Ze(n, s) ? (n[s] = o, !0) : Ze(e.props, s) || s[0] === "$" && s.slice(1) in e ? !1 : (i[s] = o, !0); + return Qn(l, t) ? (l[t] = o, !0) : n !== st && Ze(n, t) ? (n[t] = o, !0) : Ze(e.props, t) || t[0] === "$" && t.slice(1) in e ? !1 : (i[t] = o, !0); }, has({ - _: { data: e, setupState: s, accessCache: o, ctx: n, appContext: l, props: i, type: r } + _: { data: e, setupState: t, accessCache: o, ctx: n, appContext: l, props: i, type: r } }, u) { let d; - return !!(o[u] || e !== st && u[0] !== "$" && Ze(e, u) || Qn(s, u) || Ze(i, u) || Ze(n, u) || Ze(No, u) || Ze(l.config.globalProperties, u) || (d = r.__cssModules) && d[u]); + return !!(o[u] || e !== st && u[0] !== "$" && Ze(e, u) || Qn(t, u) || Ze(i, u) || Ze(n, u) || Ze(Uo, u) || Ze(l.config.globalProperties, u) || (d = r.__cssModules) && d[u]); }, - defineProperty(e, s, o) { - return o.get != null ? e._.accessCache[s] = 0 : Ze(o, "value") && this.set(e, s, o.value, null), Reflect.defineProperty(e, s, o); + defineProperty(e, t, o) { + return o.get != null ? e._.accessCache[t] = 0 : Ze(o, "value") && this.set(e, t, o.value, null), Reflect.defineProperty(e, t, o); } }; function ml(e) { - return Ue(e) ? e.reduce( - (s, o) => (s[o] = null, s), + return Ne(e) ? e.reduce( + (t, o) => (t[o] = null, t), {} ) : e; } let ha = !0; function jc(e) { - const s = Bi(e), o = e.proxy, n = e.ctx; - ha = !1, s.beforeCreate && vl(s.beforeCreate, e, "bc"); + const t = Bi(e), o = e.proxy, n = e.ctx; + ha = !1, t.beforeCreate && vl(t.beforeCreate, e, "bc"); const { // state data: l, @@ -2081,23 +2081,23 @@ function jc(e) { components: Y, directives: H, filters: te - } = s; + } = t; if (m && Hc(m, n, null), r) - for (const U in r) { - const M = r[U]; - Be(M) && (n[U] = M.bind(o)); + for (const N in r) { + const M = r[N]; + Be(M) && (n[N] = M.bind(o)); } if (l) { - const U = l.call(o, o); - tt(U) && (e.data = Fs(U)); + const N = l.call(o, o); + tt(N) && (e.data = Fs(N)); } if (ha = !0, i) - for (const U in i) { - const M = i[U], we = Be(M) ? M.bind(o, o) : Be(M.get) ? M.get.bind(o, o) : ms, ve = !Be(M) && Be(M.set) ? M.set.bind(o) : ms, Ie = F({ + for (const N in i) { + const M = i[N], we = Be(M) ? M.bind(o, o) : Be(M.get) ? M.get.bind(o, o) : ms, ve = !Be(M) && Be(M.set) ? M.set.bind(o) : ms, Ie = F({ get: we, set: ve }); - Object.defineProperty(n, U, { + Object.defineProperty(n, N, { enumerable: !0, configurable: !0, get: () => Ie.value, @@ -2105,23 +2105,23 @@ function jc(e) { }); } if (u) - for (const U in u) - Fi(u[U], n, o, U); + for (const N in u) + Fi(u[N], n, o, N); if (d) { - const U = Be(d) ? d.call(o) : d; - Reflect.ownKeys(U).forEach((M) => { - Qc(M, U[M]); + const N = Be(d) ? d.call(o) : d; + Reflect.ownKeys(N).forEach((M) => { + Qc(M, N[M]); }); } v && vl(v, e, "c"); - function N(U, M) { - Ue(M) ? M.forEach((we) => U(we.bind(o))) : M && U(M.bind(o)); + function U(N, M) { + Ne(M) ? M.forEach((we) => N(we.bind(o))) : M && N(M.bind(o)); } - if (N(Ac, h), N(et, w), N(Nc, p), N(Ai, _), N(Dc, S), N(Lc, $), N(Bc, I), N(Fc, B), N(zc, A), N(Ni, O), N(wo, x), N(Uc, E), Ue(L)) + if (U(Ac, h), U(et, w), U(Uc, p), U(Ai, _), U(Dc, S), U(Lc, $), U(Bc, I), U(Fc, B), U(zc, A), U(Ui, O), U(wo, x), U(Nc, E), Ne(L)) if (L.length) { - const U = e.exposed || (e.exposed = {}); + const N = e.exposed || (e.exposed = {}); L.forEach((M) => { - Object.defineProperty(U, M, { + Object.defineProperty(N, M, { get: () => o[M], set: (we) => o[M] = we, enumerable: !0 @@ -2130,8 +2130,8 @@ function jc(e) { } else e.exposed || (e.exposed = {}); q && e.render === ms && (e.render = q), re != null && (e.inheritAttrs = re), Y && (e.components = Y), H && (e.directives = H), E && Li(e); } -function Hc(e, s, o = ms) { - Ue(e) && (e = ya(e)); +function Hc(e, t, o = ms) { + Ne(e) && (e = ya(e)); for (const n in e) { const l = e[n]; let i; @@ -2139,56 +2139,56 @@ function Hc(e, s, o = ms) { l.from || n, l.default, !0 - ) : i = vn(l.from || n) : i = vn(l), $t(i) ? Object.defineProperty(s, n, { + ) : i = vn(l.from || n) : i = vn(l), $t(i) ? Object.defineProperty(t, n, { enumerable: !0, configurable: !0, get: () => i.value, set: (r) => i.value = r - }) : s[n] = i; + }) : t[n] = i; } } -function vl(e, s, o) { +function vl(e, t, o) { ts( - Ue(e) ? e.map((n) => n.bind(s.proxy)) : e.bind(s.proxy), - s, + Ne(e) ? e.map((n) => n.bind(t.proxy)) : e.bind(t.proxy), + t, o ); } -function Fi(e, s, o, n) { +function Fi(e, t, o, n) { let l = n.includes(".") ? Gi(o, n) : () => o[n]; if (ut(e)) { - const i = s[e]; + const i = t[e]; Be(i) && Ct(l, i); } else if (Be(e)) Ct(l, e.bind(o)); else if (tt(e)) - if (Ue(e)) - e.forEach((i) => Fi(i, s, o, n)); + if (Ne(e)) + e.forEach((i) => Fi(i, t, o, n)); else { - const i = Be(e.handler) ? e.handler.bind(o) : s[e.handler]; + const i = Be(e.handler) ? e.handler.bind(o) : t[e.handler]; Be(i) && Ct(l, i, e); } } function Bi(e) { - const s = e.type, { mixins: o, extends: n } = s, { + const t = e.type, { mixins: o, extends: n } = t, { mixins: l, optionsCache: i, config: { optionMergeStrategies: r } - } = e.appContext, u = i.get(s); + } = e.appContext, u = i.get(t); let d; - return u ? d = u : !l.length && !o && !n ? d = s : (d = {}, l.length && l.forEach( + return u ? d = u : !l.length && !o && !n ? d = t : (d = {}, l.length && l.forEach( (m) => Cn(d, m, r, !0) - ), Cn(d, s, r)), tt(s) && i.set(s, d), d; + ), Cn(d, t, r)), tt(t) && i.set(t, d), d; } -function Cn(e, s, o, n = !1) { - const { mixins: l, extends: i } = s; +function Cn(e, t, o, n = !1) { + const { mixins: l, extends: i } = t; i && Cn(e, i, o, !0), l && l.forEach( (r) => Cn(e, r, o, !0) ); - for (const r in s) + for (const r in t) if (!(n && r === "expose")) { const u = Kc[r] || o && o[r]; - e[r] = u ? u(e[r], s[r]) : s[r]; + e[r] = u ? u(e[r], t[r]) : t[r]; } return e; } @@ -2223,45 +2223,45 @@ const Kc = { provide: pl, inject: qc }; -function pl(e, s) { - return s ? e ? function() { +function pl(e, t) { + return t ? e ? function() { return pt( Be(e) ? e.call(this, this) : e, - Be(s) ? s.call(this, this) : s + Be(t) ? t.call(this, this) : t ); - } : s : e; + } : t : e; } -function qc(e, s) { - return Ro(ya(e), ya(s)); +function qc(e, t) { + return Ro(ya(e), ya(t)); } function ya(e) { - if (Ue(e)) { - const s = {}; + if (Ne(e)) { + const t = {}; for (let o = 0; o < e.length; o++) - s[e[o]] = e[o]; - return s; + t[e[o]] = e[o]; + return t; } return e; } -function xt(e, s) { - return e ? [...new Set([].concat(e, s))] : s; +function xt(e, t) { + return e ? [...new Set([].concat(e, t))] : t; } -function Ro(e, s) { - return e ? pt(/* @__PURE__ */ Object.create(null), e, s) : s; +function Ro(e, t) { + return e ? pt(/* @__PURE__ */ Object.create(null), e, t) : t; } -function gl(e, s) { - return e ? Ue(e) && Ue(s) ? [.../* @__PURE__ */ new Set([...e, ...s])] : pt( +function gl(e, t) { + return e ? Ne(e) && Ne(t) ? [.../* @__PURE__ */ new Set([...e, ...t])] : pt( /* @__PURE__ */ Object.create(null), ml(e), - ml(s ?? {}) - ) : s; + ml(t ?? {}) + ) : t; } -function Yc(e, s) { - if (!e) return s; - if (!s) return e; +function Yc(e, t) { + if (!e) return t; + if (!t) return e; const o = pt(/* @__PURE__ */ Object.create(null), e); - for (const n in s) - o[n] = xt(e[n], s[n]); + for (const n in t) + o[n] = xt(e[n], t[n]); return o; } function Vi() { @@ -2286,7 +2286,7 @@ function Vi() { }; } let Jc = 0; -function Xc(e, s) { +function Xc(e, t) { return function(n, l = null) { Be(n) || (n = pt({}, n)), l != null && !tt(l) && (l = null); const i = Vi(), r = /* @__PURE__ */ new WeakSet(), u = []; @@ -2349,29 +2349,29 @@ function Xc(e, s) { }; } let mo = null; -function Qc(e, s) { +function Qc(e, t) { if (kt) { let o = kt.provides; const n = kt.parent && kt.parent.provides; - n === o && (o = kt.provides = Object.create(n)), o[e] = s; + n === o && (o = kt.provides = Object.create(n)), o[e] = t; } } -function vn(e, s, o = !1) { +function vn(e, t, o = !1) { const n = Ha(); if (n || mo) { let l = mo ? mo._context.provides : n ? n.parent == null || n.ce ? n.vnode.appContext && n.vnode.appContext.provides : n.parent.provides : void 0; if (l && e in l) return l[e]; if (arguments.length > 1) - return o && Be(s) ? s.call(n && n.proxy) : s; + return o && Be(t) ? t.call(n && n.proxy) : t; } } const Zc = Symbol.for("v-scx"), eu = () => vn(Zc); -function Ct(e, s, o) { - return Wi(e, s, o); +function Ct(e, t, o) { + return Wi(e, t, o); } -function Wi(e, s, o = st) { - const { immediate: n, deep: l, flush: i, once: r } = o, u = pt({}, o), d = s && n || !s && i !== "post"; +function Wi(e, t, o = st) { + const { immediate: n, deep: l, flush: i, once: r } = o, u = pt({}, o), d = t && n || !t && i !== "post"; let m; if (qo) { if (i === "sync") { @@ -2391,20 +2391,20 @@ function Wi(e, s, o = st) { } : i !== "sync" && (h = !0, u.scheduler = (p, _) => { _ ? p() : za(p); }), u.augmentJob = (p) => { - s && (p.flags |= 4), h && (p.flags |= 2, v && (p.id = v.uid, p.i = v)); + t && (p.flags |= 4), h && (p.flags |= 2, v && (p.id = v.uid, p.i = v)); }; - const w = Sc(e, s, u); + const w = Sc(e, t, u); return qo && (m ? m.push(w) : d && w()), w; } -function tu(e, s, o) { +function tu(e, t, o) { const n = this.proxy, l = ut(e) ? e.includes(".") ? Gi(n, e) : () => n[e] : e.bind(n, n); let i; - Be(s) ? i = s : (i = s.handler, o = s); + Be(t) ? i = t : (i = t.handler, o = t); const r = Zo(this), u = Wi(l, i.bind(n), o); return r(), u; } -function Gi(e, s) { - const o = s.split("."); +function Gi(e, t) { + const o = t.split("."); return () => { let n = e; for (let l = 0; l < o.length && n; l++) @@ -2412,16 +2412,16 @@ function Gi(e, s) { return n; }; } -const su = (e, s) => s === "modelValue" || s === "model-value" ? e.modelModifiers : e[`${s}Modifiers`] || e[`${Wt(s)}Modifiers`] || e[`${zs(s)}Modifiers`]; -function ou(e, s, ...o) { +const su = (e, t) => t === "modelValue" || t === "model-value" ? e.modelModifiers : e[`${t}Modifiers`] || e[`${Wt(t)}Modifiers`] || e[`${zs(t)}Modifiers`]; +function ou(e, t, ...o) { if (e.isUnmounted) return; const n = e.vnode.props || st; let l = o; - const i = s.startsWith("update:"), r = i && su(n, s.slice(7)); + const i = t.startsWith("update:"), r = i && su(n, t.slice(7)); r && (r.trim && (l = o.map((v) => ut(v) ? v.trim() : v)), r.number && (l = o.map(Ln))); - let u, d = n[u = Hn(s)] || // also try camelCase event handler (#2249) - n[u = Hn(Wt(s))]; - !d && i && (d = n[u = Hn(zs(s))]), d && ts( + let u, d = n[u = Hn(t)] || // also try camelCase event handler (#2249) + n[u = Hn(Wt(t))]; + !d && i && (d = n[u = Hn(zs(t))]), d && ts( d, e, 6, @@ -2442,27 +2442,27 @@ function ou(e, s, ...o) { } } const nu = /* @__PURE__ */ new WeakMap(); -function ji(e, s, o = !1) { - const n = o ? nu : s.emitsCache, l = n.get(e); +function ji(e, t, o = !1) { + const n = o ? nu : t.emitsCache, l = n.get(e); if (l !== void 0) return l; const i = e.emits; let r = {}, u = !1; if (!Be(e)) { const d = (m) => { - const v = ji(m, s, !0); + const v = ji(m, t, !0); v && (u = !0, pt(r, v)); }; - !o && s.mixins.length && s.mixins.forEach(d), e.extends && d(e.extends), e.mixins && e.mixins.forEach(d); + !o && t.mixins.length && t.mixins.forEach(d), e.extends && d(e.extends), e.mixins && e.mixins.forEach(d); } - return !i && !u ? (tt(e) && n.set(e, null), null) : (Ue(i) ? i.forEach((d) => r[d] = null) : pt(r, i), tt(e) && n.set(e, r), r); + return !i && !u ? (tt(e) && n.set(e, null), null) : (Ne(i) ? i.forEach((d) => r[d] = null) : pt(r, i), tt(e) && n.set(e, r), r); } -function Fn(e, s) { - return !e || !Rn(s) ? !1 : (s = s.slice(2).replace(/Once$/, ""), Ze(e, s[0].toLowerCase() + s.slice(1)) || Ze(e, zs(s)) || Ze(e, s)); +function Fn(e, t) { + return !e || !Rn(t) ? !1 : (t = t.slice(2).replace(/Once$/, ""), Ze(e, t[0].toLowerCase() + t.slice(1)) || Ze(e, zs(t)) || Ze(e, t)); } function hl(e) { const { - type: s, + type: t, vnode: o, proxy: n, withProxy: l, @@ -2494,7 +2494,7 @@ function hl(e) { ) ), O = u; } else { - const x = s; + const x = t; P = fs( x.length > 1 ? x( h, @@ -2503,10 +2503,10 @@ function hl(e) { h, null ) - ), O = s.props ? u : au(u); + ), O = t.props ? u : au(u); } } catch (x) { - Uo.length = 0, Nn(x, e, 1), P = C(_t); + No.length = 0, Un(x, e, 1), P = C(_t); } let T = P; if (O && S !== !1) { @@ -2514,24 +2514,24 @@ function hl(e) { x.length && q & 7 && (i && x.some(Ea) && (O = lu( O, i - )), T = Ns(T, O, !1, !0)); + )), T = Us(T, O, !1, !0)); } - return o.dirs && (T = Ns(T, null, !1, !0), T.dirs = T.dirs ? T.dirs.concat(o.dirs) : o.dirs), o.transition && Zs(T, o.transition), P = T, kn($), P; + return o.dirs && (T = Us(T, null, !1, !0), T.dirs = T.dirs ? T.dirs.concat(o.dirs) : o.dirs), o.transition && Zs(T, o.transition), P = T, kn($), P; } const au = (e) => { - let s; + let t; for (const o in e) - (o === "class" || o === "style" || Rn(o)) && ((s || (s = {}))[o] = e[o]); - return s; -}, lu = (e, s) => { + (o === "class" || o === "style" || Rn(o)) && ((t || (t = {}))[o] = e[o]); + return t; +}, lu = (e, t) => { const o = {}; for (const n in e) - (!Ea(n) || !(n.slice(9) in s)) && (o[n] = e[n]); + (!Ea(n) || !(n.slice(9) in t)) && (o[n] = e[n]); return o; }; -function iu(e, s, o) { - const { props: n, children: l, component: i } = e, { props: r, children: u, patchFlag: d } = s, m = i.emitsOptions; - if (s.dirs || s.transition) +function iu(e, t, o) { + const { props: n, children: l, component: i } = e, { props: r, children: u, patchFlag: d } = t, m = i.emitsOptions; + if (t.dirs || t.transition) return !0; if (o && d >= 0) { if (d & 1024) @@ -2539,7 +2539,7 @@ function iu(e, s, o) { if (d & 16) return n ? yl(n, r, m) : !!r; if (d & 8) { - const v = s.dynamicProps; + const v = t.dynamicProps; for (let h = 0; h < v.length; h++) { const w = v[h]; if (r[w] !== n[w] && !Fn(m, w)) @@ -2550,35 +2550,35 @@ function iu(e, s, o) { return (l || u) && (!u || !u.$stable) ? !0 : n === r ? !1 : n ? r ? yl(n, r, m) : !0 : !!r; return !1; } -function yl(e, s, o) { - const n = Object.keys(s); +function yl(e, t, o) { + const n = Object.keys(t); if (n.length !== Object.keys(e).length) return !0; for (let l = 0; l < n.length; l++) { const i = n[l]; - if (s[i] !== e[i] && !Fn(o, i)) + if (t[i] !== e[i] && !Fn(o, i)) return !0; } return !1; } -function ru({ vnode: e, parent: s }, o) { - for (; s; ) { - const n = s.subTree; +function ru({ vnode: e, parent: t }, o) { + for (; t; ) { + const n = t.subTree; if (n.suspense && n.suspense.activeBranch === e && (n.el = e.el), n === e) - (e = s.vnode).el = o, s = s.parent; + (e = t.vnode).el = o, t = t.parent; else break; } } const Hi = {}, Ki = () => Object.create(Hi), qi = (e) => Object.getPrototypeOf(e) === Hi; -function cu(e, s, o, n = !1) { +function cu(e, t, o, n = !1) { const l = {}, i = Ki(); - e.propsDefaults = /* @__PURE__ */ Object.create(null), Yi(e, s, l, i); + e.propsDefaults = /* @__PURE__ */ Object.create(null), Yi(e, t, l, i); for (const r in e.propsOptions[0]) r in l || (l[r] = void 0); o ? e.props = n ? l : yc(l) : e.type.props ? e.props = l : e.props = i, e.attrs = i; } -function uu(e, s, o, n) { +function uu(e, t, o, n) { const { props: l, attrs: i, @@ -2597,7 +2597,7 @@ function uu(e, s, o, n) { let w = v[h]; if (Fn(e.emitsOptions, w)) continue; - const p = s[w]; + const p = t[w]; if (d) if (Ze(i, w)) p !== i[w] && (i[w] = p, m = !0); @@ -2617,13 +2617,13 @@ function uu(e, s, o, n) { } } } else { - Yi(e, s, l, i) && (m = !0); + Yi(e, t, l, i) && (m = !0); let v; for (const h in u) - (!s || // for camelCase - !Ze(s, h) && // it's possible the original props was passed in as kebab-case + (!t || // for camelCase + !Ze(t, h) && // it's possible the original props was passed in as kebab-case // and converted to camelCase (#955) - ((v = zs(h)) === h || !Ze(s, v))) && (d ? o && // for camelCase + ((v = zs(h)) === h || !Ze(t, v))) && (d ? o && // for camelCase (o[h] !== void 0 || // for kebab-case o[v] !== void 0) && (l[h] = wa( d, @@ -2635,18 +2635,18 @@ function uu(e, s, o, n) { )) : delete l[h]); if (i !== u) for (const h in i) - (!s || !Ze(s, h)) && (delete i[h], m = !0); + (!t || !Ze(t, h)) && (delete i[h], m = !0); } m && bs(e.attrs, "set", ""); } -function Yi(e, s, o, n) { +function Yi(e, t, o, n) { const [l, i] = e.propsOptions; let r = !1, u; - if (s) - for (let d in s) { + if (t) + for (let d in t) { if (Mo(d)) continue; - const m = s[d]; + const m = t[d]; let v; l && Ze(l, v = Wt(d)) ? !i || !i.includes(v) ? o[v] = m : (u || (u = {}))[v] = m : Fn(e.emitsOptions, d) || (!(d in n) || m !== n[d]) && (n[d] = m, r = !0); } @@ -2666,7 +2666,7 @@ function Yi(e, s, o, n) { } return r; } -function wa(e, s, o, n, l, i) { +function wa(e, t, o, n, l, i) { const r = e[o]; if (r != null) { const u = Ze(r, "default"); @@ -2680,7 +2680,7 @@ function wa(e, s, o, n, l, i) { const v = Zo(l); n = m[o] = d.call( null, - s + t ), v(); } } else @@ -2698,8 +2698,8 @@ function wa(e, s, o, n, l, i) { return n; } const du = /* @__PURE__ */ new WeakMap(); -function Ji(e, s, o = !1) { - const n = o ? du : s.propsCache, l = n.get(e); +function Ji(e, t, o = !1) { + const n = o ? du : t.propsCache, l = n.get(e); if (l) return l; const i = e.props, r = {}, u = []; @@ -2707,14 +2707,14 @@ function Ji(e, s, o = !1) { if (!Be(e)) { const v = (h) => { d = !0; - const [w, p] = Ji(h, s, !0); + const [w, p] = Ji(h, t, !0); pt(r, w), p && u.push(...p); }; - !o && s.mixins.length && s.mixins.forEach(v), e.extends && v(e.extends), e.mixins && e.mixins.forEach(v); + !o && t.mixins.length && t.mixins.forEach(v), e.extends && v(e.extends), e.mixins && e.mixins.forEach(v); } if (!i && !d) return tt(e) && n.set(e, ro), ro; - if (Ue(i)) + if (Ne(i)) for (let v = 0; v < i.length; v++) { const h = Wt(i[v]); wl(h) && (r[h] = st); @@ -2723,9 +2723,9 @@ function Ji(e, s, o = !1) { for (const v in i) { const h = Wt(v); if (wl(h)) { - const w = i[v], p = r[h] = Ue(w) || Be(w) ? { type: w } : pt({}, w), _ = p.type; + const w = i[v], p = r[h] = Ne(w) || Be(w) ? { type: w } : pt({}, w), _ = p.type; let S = !1, $ = !0; - if (Ue(_)) + if (Ne(_)) for (let P = 0; P < _.length; ++P) { const O = _[P], T = Be(O) && O.name; if (T === "Boolean") { @@ -2750,42 +2750,42 @@ function Ji(e, s, o = !1) { function wl(e) { return e[0] !== "$" && !Mo(e); } -const Va = (e) => e === "_" || e === "_ctx" || e === "$stable", Wa = (e) => Ue(e) ? e.map(fs) : [fs(e)], fu = (e, s, o) => { - if (s._n) - return s; - const n = g((...l) => Wa(s(...l)), o); +const Va = (e) => e === "_" || e === "_ctx" || e === "$stable", Wa = (e) => Ne(e) ? e.map(fs) : [fs(e)], fu = (e, t, o) => { + if (t._n) + return t; + const n = g((...l) => Wa(t(...l)), o); return n._c = !1, n; -}, Xi = (e, s, o) => { +}, Xi = (e, t, o) => { const n = e._ctx; for (const l in e) { if (Va(l)) continue; const i = e[l]; if (Be(i)) - s[l] = fu(l, i, n); + t[l] = fu(l, i, n); else if (i != null) { const r = Wa(i); - s[l] = () => r; + t[l] = () => r; } } -}, Qi = (e, s) => { - const o = Wa(s); +}, Qi = (e, t) => { + const o = Wa(t); e.slots.default = () => o; -}, Zi = (e, s, o) => { - for (const n in s) - (o || !Va(n)) && (e[n] = s[n]); -}, mu = (e, s, o) => { +}, Zi = (e, t, o) => { + for (const n in t) + (o || !Va(n)) && (e[n] = t[n]); +}, mu = (e, t, o) => { const n = e.slots = Ki(); if (e.vnode.shapeFlag & 32) { - const l = s._; - l ? (Zi(n, s, o), o && ti(n, "_", l, !0)) : Xi(s, n); - } else s && Qi(e, s); -}, vu = (e, s, o) => { + const l = t._; + l ? (Zi(n, t, o), o && ti(n, "_", l, !0)) : Xi(t, n); + } else t && Qi(e, t); +}, vu = (e, t, o) => { const { vnode: n, slots: l } = e; let i = !0, r = st; if (n.shapeFlag & 32) { - const u = s._; - u ? o && u === 1 ? i = !1 : Zi(l, s, o) : (i = !s.$stable, Xi(s, l)), r = s; - } else s && (Qi(e, s), r = { default: 1 }); + const u = t._; + u ? o && u === 1 ? i = !1 : Zi(l, t, o) : (i = !t.$stable, Xi(t, l)), r = t; + } else t && (Qi(e, t), r = { default: 1 }); if (i) for (const u in l) !Va(u) && r[u] == null && delete l[u]; @@ -2793,7 +2793,7 @@ const Va = (e) => e === "_" || e === "_ctx" || e === "$stable", Wa = (e) => Ue(e function pu(e) { return gu(e); } -function gu(e, s) { +function gu(e, t) { const o = On(); o.__VUE__ = !0; const { @@ -3149,13 +3149,13 @@ function gu(e, s) { ne, ue ); - if (Un(D) && (Ce.ctx.renderer = Ve), Iu(Ce, !1, $e), Ce.asyncDep) { - if (ue && ue.registerDep(Ce, N, $e), !D.el) { + if (Nn(D) && (Ce.ctx.renderer = Ve), Iu(Ce, !1, $e), Ce.asyncDep) { + if (ue && ue.registerDep(Ce, U, $e), !D.el) { const oe = Ce.subTree = C(_t); P(null, oe, V, se), D.placeholder = oe.el; } } else - N( + U( Ce, D, V, @@ -3168,27 +3168,27 @@ function gu(e, s) { const ne = V.component = D.component; if (iu(D, V, se)) if (ne.asyncDep && !ne.asyncResolved) { - U(ne, V, se); + N(ne, V, se); return; } else ne.next = V, ne.update(); else V.el = D.el, ne.vnode = V; - }, N = (D, V, se, ne, ue, de, $e) => { + }, U = (D, V, se, ne, ue, de, $e) => { const Ce = () => { if (D.isMounted) { let { next: xe, bu: Z, u: K, parent: Pe, vnode: he } = D; { const ze = er(D); if (ze) { - xe && (xe.el = he.el, U(D, xe, $e)), ze.asyncDep.then(() => { + xe && (xe.el = he.el, N(D, xe, $e)), ze.asyncDep.then(() => { D.isUnmounted || Ce(); }); return; } } let ge = xe, W; - js(D, !1), xe ? (xe.el = he.el, U(D, xe, $e)) : xe = he, Z && fn(Z), (W = xe.props && xe.props.onVnodeBeforeUpdate) && is(W, Pe, xe, he), js(D, !0); + js(D, !1), xe ? (xe.el = he.el, N(D, xe, $e)) : xe = he, Z && fn(Z), (W = xe.props && xe.props.onVnodeBeforeUpdate) && is(W, Pe, xe, he), js(D, !0); const z = hl(D), ie = D.subTree; D.subTree = z, S( ie, @@ -3237,7 +3237,7 @@ function gu(e, s) { D.scope.off(); const ce = D.update = oe.run.bind(oe), De = D.job = oe.runIfDirty.bind(oe); De.i = D, De.id = D.uid, oe.scheduler = () => za(De), js(D, !0), ce(); - }, U = (D, V, se) => { + }, N = (D, V, se) => { V.component = D; const ne = D.vnode.props; D.vnode = V, D.next = null, uu(D, V.props, ne, se), vu(D, V.children, se), $s(), ll(D), Cs(); @@ -3427,7 +3427,7 @@ function gu(e, s) { } const vt = ie ? yu(Qe) : ro; for (ge = vt.length - 1, ce = z - 1; ce >= 0; ce--) { - const at = Pe + ce, dt = V[at], Rt = V[at + 1], Ut = at + 1 < De ? ( + const at = Pe + ce, dt = V[at], Rt = V[at + 1], Nt = at + 1 < De ? ( // #13559, fallback to el placeholder for unresolved async component Rt.el || Rt.placeholder ) : ne; @@ -3435,13 +3435,13 @@ function gu(e, s) { null, dt, se, - Ut, + Nt, ue, de, $e, Ce, oe - ) : ie && (ge < 0 || ce !== vt[ge] ? Ie(dt, se, Ut, 2) : ge--); + ) : ie && (ge < 0 || ce !== vt[ge] ? Ie(dt, se, Nt, 2) : ge--); } } }, Ie = (D, V, se, ne, ue = null) => { @@ -3603,18 +3603,18 @@ function gu(e, s) { createApp: Xc(ae) }; } -function Zn({ type: e, props: s }, o) { - return o === "svg" && e === "foreignObject" || o === "mathml" && e === "annotation-xml" && s && s.encoding && s.encoding.includes("html") ? void 0 : o; +function Zn({ type: e, props: t }, o) { + return o === "svg" && e === "foreignObject" || o === "mathml" && e === "annotation-xml" && t && t.encoding && t.encoding.includes("html") ? void 0 : o; } -function js({ effect: e, job: s }, o) { - o ? (e.flags |= 32, s.flags |= 4) : (e.flags &= -33, s.flags &= -5); +function js({ effect: e, job: t }, o) { + o ? (e.flags |= 32, t.flags |= 4) : (e.flags &= -33, t.flags &= -5); } -function hu(e, s) { - return (!e || e && !e.pendingBranch) && s && !s.persisted; +function hu(e, t) { + return (!e || e && !e.pendingBranch) && t && !t.persisted; } -function Ga(e, s, o = !1) { - const n = e.children, l = s.children; - if (Ue(n) && Ue(l)) +function Ga(e, t, o = !1) { + const n = e.children, l = t.children; + if (Ne(n) && Ne(l)) for (let i = 0; i < n.length; i++) { const r = n[i]; let u = l[i]; @@ -3623,59 +3623,59 @@ function Ga(e, s, o = !1) { } } function yu(e) { - const s = e.slice(), o = [0]; + const t = e.slice(), o = [0]; let n, l, i, r, u; const d = e.length; for (n = 0; n < d; n++) { const m = e[n]; if (m !== 0) { if (l = o[o.length - 1], e[l] < m) { - s[n] = l, o.push(n); + t[n] = l, o.push(n); continue; } for (i = 0, r = o.length - 1; i < r; ) u = i + r >> 1, e[o[u]] < m ? i = u + 1 : r = u; - m < e[o[i]] && (i > 0 && (s[n] = o[i - 1]), o[i] = n); + m < e[o[i]] && (i > 0 && (t[n] = o[i - 1]), o[i] = n); } } for (i = o.length, r = o[i - 1]; i-- > 0; ) - o[i] = r, r = s[r]; + o[i] = r, r = t[r]; return o; } function er(e) { - const s = e.subTree.component; - if (s) - return s.asyncDep && !s.asyncResolved ? s : er(s); + const t = e.subTree.component; + if (t) + return t.asyncDep && !t.asyncResolved ? t : er(t); } function bl(e) { if (e) - for (let s = 0; s < e.length; s++) - e[s].flags |= 8; + for (let t = 0; t < e.length; t++) + e[t].flags |= 8; } const tr = (e) => e.__isSuspense; -function wu(e, s) { - s && s.pendingBranch ? Ue(e) ? s.effects.push(...e) : s.effects.push(e) : Tc(e); +function wu(e, t) { + t && t.pendingBranch ? Ne(e) ? t.effects.push(...e) : t.effects.push(e) : Tc(e); } -const j = Symbol.for("v-fgt"), Bn = Symbol.for("v-txt"), _t = Symbol.for("v-cmt"), ea = Symbol.for("v-stc"), Uo = []; +const j = Symbol.for("v-fgt"), Bn = Symbol.for("v-txt"), _t = Symbol.for("v-cmt"), ea = Symbol.for("v-stc"), No = []; let At = null; function a(e = !1) { - Uo.push(At = e ? null : []); + No.push(At = e ? null : []); } function bu() { - Uo.pop(), At = Uo[Uo.length - 1] || null; + No.pop(), At = No[No.length - 1] || null; } let Ho = 1; -function xn(e, s = !1) { - Ho += e, e < 0 && At && s && (At.hasOnce = !0); +function xn(e, t = !1) { + Ho += e, e < 0 && At && t && (At.hasOnce = !0); } function sr(e) { return e.dynamicChildren = Ho > 0 ? At || ro : null, bu(), Ho > 0 && At && At.push(e), e; } -function c(e, s, o, n, l, i) { +function c(e, t, o, n, l, i) { return sr( - t( + s( e, - s, + t, o, n, l, @@ -3684,11 +3684,11 @@ function c(e, s, o, n, l, i) { ) ); } -function R(e, s, o, n, l) { +function R(e, t, o, n, l) { return sr( C( e, - s, + t, o, n, l, @@ -3699,22 +3699,22 @@ function R(e, s, o, n, l) { function Ko(e) { return e ? e.__v_isVNode === !0 : !1; } -function Ys(e, s) { - return e.type === s.type && e.key === s.key; +function Ys(e, t) { + return e.type === t.type && e.key === t.key; } const or = ({ key: e }) => e ?? null, pn = ({ ref: e, - ref_key: s, + ref_key: t, ref_for: o -}) => (typeof e == "number" && (e = "" + e), e != null ? ut(e) || $t(e) || Be(e) ? { i: yt, r: e, k: s, f: !!o } : e : null); -function t(e, s = null, o = null, n = 0, l = null, i = e === j ? 0 : 1, r = !1, u = !1) { +}) => (typeof e == "number" && (e = "" + e), e != null ? ut(e) || $t(e) || Be(e) ? { i: yt, r: e, k: t, f: !!o } : e : null); +function s(e, t = null, o = null, n = 0, l = null, i = e === j ? 0 : 1, r = !1, u = !1) { const d = { __v_isVNode: !0, __v_skip: !0, type: e, - props: s, - key: s && or(s), - ref: s && pn(s), + props: t, + key: t && or(t), + ref: t && pn(t), scopeId: Ci, slotScopeIds: null, children: o, @@ -3748,25 +3748,25 @@ function t(e, s = null, o = null, n = 0, l = null, i = e === j ? 0 : 1, r = !1, d.patchFlag !== 32 && At.push(d), d; } const C = _u; -function _u(e, s = null, o = null, n = 0, l = null, i = !1) { - if ((!e || e === Ui) && (e = _t), Ko(e)) { - const u = Ns( +function _u(e, t = null, o = null, n = 0, l = null, i = !1) { + if ((!e || e === Ni) && (e = _t), Ko(e)) { + const u = Us( e, - s, + t, !0 /* mergeRef: true */ ); return o && ja(u, o), Ho > 0 && !i && At && (u.shapeFlag & 6 ? At[At.indexOf(e)] = u : At.push(u)), u.patchFlag = -2, u; } - if (Mu(e) && (e = e.__vccOpts), s) { - s = ku(s); - let { class: u, style: d } = s; - u && !ut(u) && (s.class = Se(u)), tt(d) && (Ua(d) && !Ue(d) && (d = pt({}, d)), s.style = Gt(d)); + if (Mu(e) && (e = e.__vccOpts), t) { + t = ku(t); + let { class: u, style: d } = t; + u && !ut(u) && (t.class = Se(u)), tt(d) && (Na(d) && !Ne(d) && (d = pt({}, d)), t.style = Gt(d)); } const r = ut(e) ? 1 : tr(e) ? 128 : Si(e) ? 64 : tt(e) ? 4 : Be(e) ? 2 : 0; - return t( + return s( e, - s, + t, o, n, l, @@ -3776,20 +3776,20 @@ function _u(e, s = null, o = null, n = 0, l = null, i = !1) { ); } function ku(e) { - return e ? Ua(e) || qi(e) ? pt({}, e) : e : null; + return e ? Na(e) || qi(e) ? pt({}, e) : e : null; } -function Ns(e, s, o = !1, n = !1) { - const { props: l, ref: i, patchFlag: r, children: u, transition: d } = e, m = s ? $u(l || {}, s) : l, v = { +function Us(e, t, o = !1, n = !1) { + const { props: l, ref: i, patchFlag: r, children: u, transition: d } = e, m = t ? $u(l || {}, t) : l, v = { __v_isVNode: !0, __v_skip: !0, type: e.type, props: m, key: m && or(m), - ref: s && s.ref ? ( + ref: t && t.ref ? ( // #2078 in the case of // if the vnode itself already has a ref, cloneVNode will need to merge // the refs so the single vnode can be set on multiple refs - o && i ? Ue(i) ? i.concat(pn(s)) : [i, pn(s)] : pn(s) + o && i ? Ne(i) ? i.concat(pn(t)) : [i, pn(t)] : pn(t) ) : i, scopeId: e.scopeId, slotScopeIds: e.slotScopeIds, @@ -3803,7 +3803,7 @@ function Ns(e, s, o = !1, n = !1) { // existing patch flag to be reliable and need to add the FULL_PROPS flag. // note: preserve flag for fragments since they use the flag for children // fast paths only. - patchFlag: s && e.type !== j ? r === -1 ? 16 : r | 16 : r, + patchFlag: t && e.type !== j ? r === -1 ? 16 : r | 16 : r, dynamicProps: e.dynamicProps, dynamicChildren: e.dynamicChildren, appContext: e.appContext, @@ -3815,8 +3815,8 @@ function Ns(e, s, o = !1, n = !1) { // they will simply be overwritten. component: e.component, suspense: e.suspense, - ssContent: e.ssContent && Ns(e.ssContent), - ssFallback: e.ssFallback && Ns(e.ssFallback), + ssContent: e.ssContent && Us(e.ssContent), + ssFallback: e.ssFallback && Us(e.ssFallback), placeholder: e.placeholder, el: e.el, anchor: e.anchor, @@ -3828,14 +3828,14 @@ function Ns(e, s, o = !1, n = !1) { d.clone(v) ), v; } -function b(e = " ", s = 0) { - return C(Bn, null, e, s); +function b(e = " ", t = 0) { + return C(Bn, null, e, t); } -function y(e = "", s = !1) { - return s ? (a(), R(_t, null, e)) : C(_t, null, e); +function y(e = "", t = !1) { + return t ? (a(), R(_t, null, e)) : C(_t, null, e); } function fs(e) { - return e == null || typeof e == "boolean" ? C(_t) : Ue(e) ? C( + return e == null || typeof e == "boolean" ? C(_t) : Ne(e) ? C( j, null, // #3666, avoid reference pollution when reusing vnode @@ -3843,58 +3843,58 @@ function fs(e) { ) : Ko(e) ? Ls(e) : C(Bn, null, String(e)); } function Ls(e) { - return e.el === null && e.patchFlag !== -1 || e.memo ? e : Ns(e); + return e.el === null && e.patchFlag !== -1 || e.memo ? e : Us(e); } -function ja(e, s) { +function ja(e, t) { let o = 0; const { shapeFlag: n } = e; - if (s == null) - s = null; - else if (Ue(s)) + if (t == null) + t = null; + else if (Ne(t)) o = 16; - else if (typeof s == "object") + else if (typeof t == "object") if (n & 65) { - const l = s.default; + const l = t.default; l && (l._c && (l._d = !1), ja(e, l()), l._c && (l._d = !0)); return; } else { o = 32; - const l = s._; - !l && !qi(s) ? s._ctx = yt : l === 3 && yt && (yt.slots._ === 1 ? s._ = 1 : (s._ = 2, e.patchFlag |= 1024)); + const l = t._; + !l && !qi(t) ? t._ctx = yt : l === 3 && yt && (yt.slots._ === 1 ? t._ = 1 : (t._ = 2, e.patchFlag |= 1024)); } - else Be(s) ? (s = { default: s, _ctx: yt }, o = 32) : (s = String(s), n & 64 ? (o = 16, s = [b(s)]) : o = 8); - e.children = s, e.shapeFlag |= o; + else Be(t) ? (t = { default: t, _ctx: yt }, o = 32) : (t = String(t), n & 64 ? (o = 16, t = [b(t)]) : o = 8); + e.children = t, e.shapeFlag |= o; } function $u(...e) { - const s = {}; + const t = {}; for (let o = 0; o < e.length; o++) { const n = e[o]; for (const l in n) if (l === "class") - s.class !== n.class && (s.class = Se([s.class, n.class])); + t.class !== n.class && (t.class = Se([t.class, n.class])); else if (l === "style") - s.style = Gt([s.style, n.style]); + t.style = Gt([t.style, n.style]); else if (Rn(l)) { - const i = s[l], r = n[l]; - r && i !== r && !(Ue(i) && i.includes(r)) && (s[l] = i ? [].concat(i, r) : r); - } else l !== "" && (s[l] = n[l]); + const i = t[l], r = n[l]; + r && i !== r && !(Ne(i) && i.includes(r)) && (t[l] = i ? [].concat(i, r) : r); + } else l !== "" && (t[l] = n[l]); } - return s; + return t; } -function is(e, s, o, n = null) { - ts(e, s, 7, [ +function is(e, t, o, n = null) { + ts(e, t, 7, [ o, n ]); } const Cu = Vi(); let xu = 0; -function Su(e, s, o) { - const n = e.type, l = (s ? s.appContext : e.appContext) || Cu, i = { +function Su(e, t, o) { + const n = e.type, l = (t ? t.appContext : e.appContext) || Cu, i = { uid: xu++, vnode: e, type: n, - parent: s, + parent: t, appContext: l, root: null, // to be immediately set @@ -3914,8 +3914,8 @@ function Su(e, s, o) { exposed: null, exposeProxy: null, withProxy: null, - provides: s ? s.provides : Object.create(l.provides), - ids: s ? s.ids : ["", 0, 0], + provides: t ? t.provides : Object.create(l.provides), + ids: t ? t.ids : ["", 0, 0], accessCache: null, renderCache: [], // local resolved assets @@ -3966,30 +3966,30 @@ function Su(e, s, o) { ec: null, sp: null }; - return i.ctx = { _: i }, i.root = s ? s.root : i, i.emit = ou.bind(null, i), e.ce && e.ce(i), i; + return i.ctx = { _: i }, i.root = t ? t.root : i, i.emit = ou.bind(null, i), e.ce && e.ce(i), i; } let kt = null; const Ha = () => kt || yt; let Sn, ba; { - const e = On(), s = (o, n) => { + const e = On(), t = (o, n) => { let l; return (l = e[o]) || (l = e[o] = []), l.push(n), (i) => { l.length > 1 ? l.forEach((r) => r(i)) : l[0](i); }; }; - Sn = s( + Sn = t( "__VUE_INSTANCE_SETTERS__", (o) => kt = o - ), ba = s( + ), ba = t( "__VUE_SSR_SETTERS__", (o) => qo = o ); } const Zo = (e) => { - const s = kt; + const t = kt; return Sn(e), e.scope.on(), () => { - e.scope.off(), Sn(s); + e.scope.off(), Sn(t); }; }, _l = () => { kt && kt.scope.off(), Sn(null); @@ -3998,14 +3998,14 @@ function nr(e) { return e.vnode.shapeFlag & 4; } let qo = !1; -function Iu(e, s = !1, o = !1) { - s && ba(s); +function Iu(e, t = !1, o = !1) { + t && ba(t); const { props: n, children: l } = e.vnode, i = nr(e); - cu(e, n, i, s), mu(e, l, o || s); - const r = i ? Eu(e, s) : void 0; - return s && ba(!1), r; + cu(e, n, i, t), mu(e, l, o || t); + const r = i ? Eu(e, t) : void 0; + return t && ba(!1), r; } -function Eu(e, s) { +function Eu(e, t) { const o = e.type; e.accessCache = /* @__PURE__ */ Object.create(null), e.proxy = new Proxy(e.ctx, Gc); const { setup: n } = o; @@ -4021,11 +4021,11 @@ function Eu(e, s) { ] ), u = Ql(r); if (Cs(), i(), (u || e.sp) && !fo(e) && Li(e), u) { - if (r.then(_l, _l), s) + if (r.then(_l, _l), t) return r.then((d) => { kl(e, d); }).catch((d) => { - Nn(d, e, 0); + Un(d, e, 0); }); e.asyncDep = r; } else @@ -4033,10 +4033,10 @@ function Eu(e, s) { } else ar(e); } -function kl(e, s, o) { - Be(s) ? e.type.__ssrInlineRender ? e.ssrRender = s : e.render = s : tt(s) && (e.setupState = wi(s)), ar(e); +function kl(e, t, o) { + Be(t) ? e.type.__ssrInlineRender ? e.ssrRender = t : e.render = t : tt(t) && (e.setupState = wi(t)), ar(e); } -function ar(e, s, o) { +function ar(e, t, o) { const n = e.type; e.render || (e.render = n.render || ms); { @@ -4050,46 +4050,46 @@ function ar(e, s, o) { } } const Tu = { - get(e, s) { - return bt(e, "get", ""), e[s]; + get(e, t) { + return bt(e, "get", ""), e[t]; } }; function Pu(e) { - const s = (o) => { + const t = (o) => { e.exposed = o || {}; }; return { attrs: new Proxy(e.attrs, Tu), slots: e.slots, emit: e.emit, - expose: s + expose: t }; } function Vn(e) { return e.exposed ? e.exposeProxy || (e.exposeProxy = new Proxy(wi(wc(e.exposed)), { - get(s, o) { - if (o in s) - return s[o]; - if (o in No) - return No[o](e); + get(t, o) { + if (o in t) + return t[o]; + if (o in Uo) + return Uo[o](e); }, - has(s, o) { - return o in s || o in No; + has(t, o) { + return o in t || o in Uo; } })) : e.proxy; } -function Ru(e, s = !0) { - return Be(e) ? e.displayName || e.name : e.name || s && e.__name; +function Ru(e, t = !0) { + return Be(e) ? e.displayName || e.name : e.name || t && e.__name; } function Mu(e) { return Be(e) && "__vccOpts" in e; } -const F = (e, s) => Cc(e, s, qo); -function Wn(e, s, o) { +const F = (e, t) => Cc(e, t, qo); +function Wn(e, t, o) { try { xn(-1); const n = arguments.length; - return n === 2 ? tt(s) && !Ue(s) ? Ko(s) ? C(e, null, [s]) : C(e, s) : C(e, null, s) : (n > 3 ? o = Array.prototype.slice.call(arguments, 2) : n === 3 && Ko(o) && (o = [o]), C(e, s, o)); + return n === 2 ? tt(t) && !Ne(t) ? Ko(t) ? C(e, null, [t]) : C(e, t) : C(e, null, t) : (n > 3 ? o = Array.prototype.slice.call(arguments, 2) : n === 3 && Ko(o) && (o = [o]), C(e, t, o)); } finally { xn(1); } @@ -4110,39 +4110,39 @@ if ($l) } catch { } const lr = _a ? (e) => _a.createHTML(e) : (e) => e, Lu = "http://www.w3.org/2000/svg", Ou = "http://www.w3.org/1998/Math/MathML", ys = typeof document < "u" ? document : null, Cl = ys && /* @__PURE__ */ ys.createElement("template"), Au = { - insert: (e, s, o) => { - s.insertBefore(e, o || null); + insert: (e, t, o) => { + t.insertBefore(e, o || null); }, remove: (e) => { - const s = e.parentNode; - s && s.removeChild(e); + const t = e.parentNode; + t && t.removeChild(e); }, - createElement: (e, s, o, n) => { - const l = s === "svg" ? ys.createElementNS(Lu, e) : s === "mathml" ? ys.createElementNS(Ou, e) : o ? ys.createElement(e, { is: o }) : ys.createElement(e); + createElement: (e, t, o, n) => { + const l = t === "svg" ? ys.createElementNS(Lu, e) : t === "mathml" ? ys.createElementNS(Ou, e) : o ? ys.createElement(e, { is: o }) : ys.createElement(e); return e === "select" && n && n.multiple != null && l.setAttribute("multiple", n.multiple), l; }, createText: (e) => ys.createTextNode(e), createComment: (e) => ys.createComment(e), - setText: (e, s) => { - e.nodeValue = s; + setText: (e, t) => { + e.nodeValue = t; }, - setElementText: (e, s) => { - e.textContent = s; + setElementText: (e, t) => { + e.textContent = t; }, parentNode: (e) => e.parentNode, nextSibling: (e) => e.nextSibling, querySelector: (e) => ys.querySelector(e), - setScopeId(e, s) { - e.setAttribute(s, ""); + setScopeId(e, t) { + e.setAttribute(t, ""); }, // __UNSAFE__ // Reason: innerHTML. // Static content here can only come from compiled templates. // As long as the user only uses trusted templates, this is safe. - insertStaticContent(e, s, o, n, l, i) { - const r = o ? o.previousSibling : s.lastChild; + insertStaticContent(e, t, o, n, l, i) { + const r = o ? o.previousSibling : t.lastChild; if (l && (l === i || l.nextSibling)) - for (; s.insertBefore(l.cloneNode(!0), o), !(l === i || !(l = l.nextSibling)); ) + for (; t.insertBefore(l.cloneNode(!0), o), !(l === i || !(l = l.nextSibling)); ) ; else { Cl.innerHTML = lr( @@ -4155,13 +4155,13 @@ const lr = _a ? (e) => _a.createHTML(e) : (e) => e, Lu = "http://www.w3.org/2000 u.appendChild(d.firstChild); u.removeChild(d); } - s.insertBefore(u, o); + t.insertBefore(u, o); } return [ // first - r ? r.nextSibling : s.firstChild, + r ? r.nextSibling : t.firstChild, // last - o ? o.previousSibling : s.lastChild + o ? o.previousSibling : t.lastChild ]; } }, Ps = "transition", So = "animation", go = Symbol("_vtc"), ir = { @@ -4185,17 +4185,17 @@ const lr = _a ? (e) => _a.createHTML(e) : (e) => e, Lu = "http://www.w3.org/2000 {}, Pi, ir -), Nu = (e) => (e.displayName = "Transition", e.props = rr, e), Uu = /* @__PURE__ */ Nu( - (e, { slots: s }) => Wn(Mc, cr(e), s) -), Hs = (e, s = []) => { - Ue(e) ? e.forEach((o) => o(...s)) : e && e(...s); -}, xl = (e) => e ? Ue(e) ? e.some((s) => s.length > 1) : e.length > 1 : !1; +), Uu = (e) => (e.displayName = "Transition", e.props = rr, e), Nu = /* @__PURE__ */ Uu( + (e, { slots: t }) => Wn(Mc, cr(e), t) +), Hs = (e, t = []) => { + Ne(e) ? e.forEach((o) => o(...t)) : e && e(...t); +}, xl = (e) => e ? Ne(e) ? e.some((t) => t.length > 1) : e.length > 1 : !1; function cr(e) { - const s = {}; + const t = {}; for (const Y in e) - Y in ir || (s[Y] = e[Y]); + Y in ir || (t[Y] = e[Y]); if (e.css === !1) - return s; + return t; const { name: o = "v", type: n, @@ -4218,17 +4218,17 @@ function cr(e) { onBeforeAppear: B = P, onAppear: A = O, onAppearCancelled: I = T - } = s, E = (Y, H, te, Q) => { + } = t, E = (Y, H, te, Q) => { Y._enterCancelled = Q, Rs(Y, H ? v : u), Rs(Y, H ? m : r), te && te(); }, L = (Y, H) => { Y._isLeaving = !1, Rs(Y, h), Rs(Y, p), Rs(Y, w), H && H(); }, re = (Y) => (H, te) => { - const Q = Y ? A : O, N = () => E(H, Y, te); - Hs(Q, [H, N]), Sl(() => { - Rs(H, Y ? d : i), cs(H, Y ? v : u), xl(Q) || Il(H, n, S, N); + const Q = Y ? A : O, U = () => E(H, Y, te); + Hs(Q, [H, U]), Sl(() => { + Rs(H, Y ? d : i), cs(H, Y ? v : u), xl(Q) || Il(H, n, S, U); }); }; - return pt(s, { + return pt(t, { onBeforeEnter(Y) { Hs(P, [Y]), cs(Y, i), cs(Y, r); }, @@ -4261,20 +4261,20 @@ function zu(e) { if (tt(e)) return [ta(e.enter), ta(e.leave)]; { - const s = ta(e); - return [s, s]; + const t = ta(e); + return [t, t]; } } function ta(e) { return Gr(e); } -function cs(e, s) { - s.split(/\s+/).forEach((o) => o && e.classList.add(o)), (e[go] || (e[go] = /* @__PURE__ */ new Set())).add(s); +function cs(e, t) { + t.split(/\s+/).forEach((o) => o && e.classList.add(o)), (e[go] || (e[go] = /* @__PURE__ */ new Set())).add(t); } -function Rs(e, s) { - s.split(/\s+/).forEach((n) => n && e.classList.remove(n)); +function Rs(e, t) { + t.split(/\s+/).forEach((n) => n && e.classList.remove(n)); const o = e[go]; - o && (o.delete(s), o.size || (e[go] = void 0)); + o && (o.delete(t), o.size || (e[go] = void 0)); } function Sl(e) { requestAnimationFrame(() => { @@ -4282,13 +4282,13 @@ function Sl(e) { }); } let Fu = 0; -function Il(e, s, o, n) { +function Il(e, t, o, n) { const l = e._endId = ++Fu, i = () => { l === e._endId && n(); }; if (o != null) return setTimeout(i, o); - const { type: r, timeout: u, propCount: d } = ur(e, s); + const { type: r, timeout: u, propCount: d } = ur(e, t); if (!r) return n(); const m = r + "end"; @@ -4302,10 +4302,10 @@ function Il(e, s, o, n) { v < d && h(); }, u + 1), e.addEventListener(m, w); } -function ur(e, s) { +function ur(e, t) { const o = window.getComputedStyle(e), n = (_) => (o[_] || "").split(", "), l = n(`${Ps}Delay`), i = n(`${Ps}Duration`), r = El(l, i), u = n(`${So}Delay`), d = n(`${So}Duration`), m = El(u, d); let v = null, h = 0, w = 0; - s === Ps ? r > 0 && (v = Ps, h = r, w = i.length) : s === So ? m > 0 && (v = So, h = m, w = d.length) : (h = Math.max(r, m), v = h > 0 ? r > m ? Ps : So : null, w = v ? v === Ps ? i.length : d.length : 0); + t === Ps ? r > 0 && (v = Ps, h = r, w = i.length) : t === So ? m > 0 && (v = So, h = m, w = d.length) : (h = Math.max(r, m), v = h > 0 ? r > m ? Ps : So : null, w = v ? v === Ps ? i.length : d.length : 0); const p = v === Ps && /\b(?:transform|all)(?:,|$)/.test( n(`${Ps}Property`).toString() ); @@ -4316,10 +4316,10 @@ function ur(e, s) { hasTransform: p }; } -function El(e, s) { - for (; e.length < s.length; ) +function El(e, t) { + for (; e.length < t.length; ) e = e.concat(e); - return Math.max(...s.map((o, n) => Tl(o) + Tl(e[n]))); + return Math.max(...t.map((o, n) => Tl(o) + Tl(e[n]))); } function Tl(e) { return e === "auto" ? 0 : Number(e.slice(0, -1).replace(",", ".")) * 1e3; @@ -4327,42 +4327,42 @@ function Tl(e) { function ka(e) { return (e ? e.ownerDocument : document).body.offsetHeight; } -function Bu(e, s, o) { +function Bu(e, t, o) { const n = e[go]; - n && (s = (s ? [s, ...n] : [...n]).join(" ")), s == null ? e.removeAttribute("class") : o ? e.setAttribute("class", s) : e.className = s; + n && (t = (t ? [t, ...n] : [...n]).join(" ")), t == null ? e.removeAttribute("class") : o ? e.setAttribute("class", t) : e.className = t; } const Pl = Symbol("_vod"), Vu = Symbol("_vsh"), Wu = Symbol(""), Gu = /(?:^|;)\s*display\s*:/; -function ju(e, s, o) { +function ju(e, t, o) { const n = e.style, l = ut(o); let i = !1; if (o && !l) { - if (s) - if (ut(s)) - for (const r of s.split(";")) { + if (t) + if (ut(t)) + for (const r of t.split(";")) { const u = r.slice(0, r.indexOf(":")).trim(); o[u] == null && gn(n, u, ""); } else - for (const r in s) + for (const r in t) o[r] == null && gn(n, r, ""); for (const r in o) r === "display" && (i = !0), gn(n, r, o[r]); } else if (l) { - if (s !== o) { + if (t !== o) { const r = n[Wu]; r && (o += ";" + r), n.cssText = o, i = Gu.test(o); } - } else s && e.removeAttribute("style"); + } else t && e.removeAttribute("style"); Pl in e && (e[Pl] = i ? n.display : "", e[Vu] && (n.display = "none")); } const Rl = /\s*!important$/; -function gn(e, s, o) { - if (Ue(o)) - o.forEach((n) => gn(e, s, n)); - else if (o == null && (o = ""), s.startsWith("--")) - e.setProperty(s, o); +function gn(e, t, o) { + if (Ne(o)) + o.forEach((n) => gn(e, t, n)); + else if (o == null && (o = ""), t.startsWith("--")) + e.setProperty(t, o); else { - const n = Hu(e, s); + const n = Hu(e, t); Rl.test(o) ? e.setProperty( zs(n), o.replace(Rl, ""), @@ -4371,91 +4371,91 @@ function gn(e, s, o) { } } const Ml = ["Webkit", "Moz", "ms"], sa = {}; -function Hu(e, s) { - const o = sa[s]; +function Hu(e, t) { + const o = sa[t]; if (o) return o; - let n = Wt(s); + let n = Wt(t); if (n !== "filter" && n in e) - return sa[s] = n; + return sa[t] = n; n = Dn(n); for (let l = 0; l < Ml.length; l++) { const i = Ml[l] + n; if (i in e) - return sa[s] = i; + return sa[t] = i; } - return s; + return t; } const Dl = "http://www.w3.org/1999/xlink"; -function Ll(e, s, o, n, l, i = Jr(s)) { - n && s.startsWith("xlink:") ? o == null ? e.removeAttributeNS(Dl, s.slice(6, s.length)) : e.setAttributeNS(Dl, s, o) : o == null || i && !si(o) ? e.removeAttribute(s) : e.setAttribute( - s, +function Ll(e, t, o, n, l, i = Jr(t)) { + n && t.startsWith("xlink:") ? o == null ? e.removeAttributeNS(Dl, t.slice(6, t.length)) : e.setAttributeNS(Dl, t, o) : o == null || i && !si(o) ? e.removeAttribute(t) : e.setAttribute( + t, i ? "" : Zt(o) ? String(o) : o ); } -function Ol(e, s, o, n, l) { - if (s === "innerHTML" || s === "textContent") { - o != null && (e[s] = s === "innerHTML" ? lr(o) : o); +function Ol(e, t, o, n, l) { + if (t === "innerHTML" || t === "textContent") { + o != null && (e[t] = t === "innerHTML" ? lr(o) : o); return; } const i = e.tagName; - if (s === "value" && i !== "PROGRESS" && // custom elements may use _value internally + if (t === "value" && i !== "PROGRESS" && // custom elements may use _value internally !i.includes("-")) { const u = i === "OPTION" ? e.getAttribute("value") || "" : e.value, d = o == null ? ( // #11647: value should be set as empty string for null and undefined, // but should be set as 'on'. e.type === "checkbox" ? "on" : "" ) : String(o); - (u !== d || !("_value" in e)) && (e.value = d), o == null && e.removeAttribute(s), e._value = o; + (u !== d || !("_value" in e)) && (e.value = d), o == null && e.removeAttribute(t), e._value = o; return; } let r = !1; if (o === "" || o == null) { - const u = typeof e[s]; + const u = typeof e[t]; u === "boolean" ? o = si(o) : o == null && u === "string" ? (o = "", r = !0) : u === "number" && (o = 0, r = !0); } try { - e[s] = o; + e[t] = o; } catch { } - r && e.removeAttribute(l || s); + r && e.removeAttribute(l || t); } -function ks(e, s, o, n) { - e.addEventListener(s, o, n); +function ks(e, t, o, n) { + e.addEventListener(t, o, n); } -function Ku(e, s, o, n) { - e.removeEventListener(s, o, n); +function Ku(e, t, o, n) { + e.removeEventListener(t, o, n); } const Al = Symbol("_vei"); -function qu(e, s, o, n, l = null) { - const i = e[Al] || (e[Al] = {}), r = i[s]; +function qu(e, t, o, n, l = null) { + const i = e[Al] || (e[Al] = {}), r = i[t]; if (n && r) r.value = n; else { - const [u, d] = Yu(s); + const [u, d] = Yu(t); if (n) { - const m = i[s] = Qu( + const m = i[t] = Qu( n, l ); ks(e, u, m, d); - } else r && (Ku(e, u, r, d), i[s] = void 0); + } else r && (Ku(e, u, r, d), i[t] = void 0); } } -const Nl = /(?:Once|Passive|Capture)$/; +const Ul = /(?:Once|Passive|Capture)$/; function Yu(e) { - let s; - if (Nl.test(e)) { - s = {}; + let t; + if (Ul.test(e)) { + t = {}; let n; - for (; n = e.match(Nl); ) - e = e.slice(0, e.length - n[0].length), s[n[0].toLowerCase()] = !0; + for (; n = e.match(Ul); ) + e = e.slice(0, e.length - n[0].length), t[n[0].toLowerCase()] = !0; } - return [e[2] === ":" ? e.slice(3) : zs(e.slice(2)), s]; + return [e[2] === ":" ? e.slice(3) : zs(e.slice(2)), t]; } let oa = 0; const Ju = /* @__PURE__ */ Promise.resolve(), Xu = () => oa || (Ju.then(() => oa = 0), oa = Date.now()); -function Qu(e, s) { +function Qu(e, t) { const o = (n) => { if (!n._vts) n._vts = Date.now(); @@ -4463,40 +4463,40 @@ function Qu(e, s) { return; ts( Zu(n, o.value), - s, + t, 5, [n] ); }; return o.value = e, o.attached = Xu(), o; } -function Zu(e, s) { - if (Ue(s)) { +function Zu(e, t) { + if (Ne(t)) { const o = e.stopImmediatePropagation; return e.stopImmediatePropagation = () => { o.call(e), e._stopped = !0; - }, s.map( + }, t.map( (n) => (l) => !l._stopped && n && n(l) ); } else - return s; + return t; } -const Ul = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // lowercase letter -e.charCodeAt(2) > 96 && e.charCodeAt(2) < 123, ed = (e, s, o, n, l, i) => { +const Nl = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // lowercase letter +e.charCodeAt(2) > 96 && e.charCodeAt(2) < 123, ed = (e, t, o, n, l, i) => { const r = l === "svg"; - s === "class" ? Bu(e, n, r) : s === "style" ? ju(e, o, n) : Rn(s) ? Ea(s) || qu(e, s, o, n, i) : (s[0] === "." ? (s = s.slice(1), !0) : s[0] === "^" ? (s = s.slice(1), !1) : td(e, s, n, r)) ? (Ol(e, s, n), !e.tagName.includes("-") && (s === "value" || s === "checked" || s === "selected") && Ll(e, s, n, r, i, s !== "value")) : /* #11081 force set props for possible async custom element */ e._isVueCE && (/[A-Z]/.test(s) || !ut(n)) ? Ol(e, Wt(s), n, i, s) : (s === "true-value" ? e._trueValue = n : s === "false-value" && (e._falseValue = n), Ll(e, s, n, r)); + t === "class" ? Bu(e, n, r) : t === "style" ? ju(e, o, n) : Rn(t) ? Ea(t) || qu(e, t, o, n, i) : (t[0] === "." ? (t = t.slice(1), !0) : t[0] === "^" ? (t = t.slice(1), !1) : td(e, t, n, r)) ? (Ol(e, t, n), !e.tagName.includes("-") && (t === "value" || t === "checked" || t === "selected") && Ll(e, t, n, r, i, t !== "value")) : /* #11081 force set props for possible async custom element */ e._isVueCE && (/[A-Z]/.test(t) || !ut(n)) ? Ol(e, Wt(t), n, i, t) : (t === "true-value" ? e._trueValue = n : t === "false-value" && (e._falseValue = n), Ll(e, t, n, r)); }; -function td(e, s, o, n) { +function td(e, t, o, n) { if (n) - return !!(s === "innerHTML" || s === "textContent" || s in e && Ul(s) && Be(o)); - if (s === "spellcheck" || s === "draggable" || s === "translate" || s === "autocorrect" || s === "sandbox" && e.tagName === "IFRAME" || s === "form" || s === "list" && e.tagName === "INPUT" || s === "type" && e.tagName === "TEXTAREA") + return !!(t === "innerHTML" || t === "textContent" || t in e && Nl(t) && Be(o)); + if (t === "spellcheck" || t === "draggable" || t === "translate" || t === "autocorrect" || t === "sandbox" && e.tagName === "IFRAME" || t === "form" || t === "list" && e.tagName === "INPUT" || t === "type" && e.tagName === "TEXTAREA") return !1; - if (s === "width" || s === "height") { + if (t === "width" || t === "height") { const l = e.tagName; if (l === "IMG" || l === "VIDEO" || l === "CANVAS" || l === "SOURCE") return !1; } - return Ul(s) && ut(o) ? !1 : s in e; + return Nl(t) && ut(o) ? !1 : t in e; } const dr = /* @__PURE__ */ new WeakMap(), fr = /* @__PURE__ */ new WeakMap(), In = Symbol("_moveCb"), zl = Symbol("_enterCb"), sd = (e) => (delete e.props.mode, e), od = /* @__PURE__ */ sd({ name: "TransitionGroup", @@ -4504,7 +4504,7 @@ const dr = /* @__PURE__ */ new WeakMap(), fr = /* @__PURE__ */ new WeakMap(), In tag: String, moveClass: String }), - setup(e, { slots: s }) { + setup(e, { slots: t }) { const o = Ha(), n = Ti(); let l, i; return Ai(() => { @@ -4548,7 +4548,7 @@ const dr = /* @__PURE__ */ new WeakMap(), fr = /* @__PURE__ */ new WeakMap(), In top: v.el.offsetTop })); } - i = s.default ? Fa(s.default()) : []; + i = t.default ? Fa(t.default()) : []; for (let m = 0; m < i.length; m++) { const v = i[m]; v.key != null && Zs( @@ -4561,8 +4561,8 @@ const dr = /* @__PURE__ */ new WeakMap(), fr = /* @__PURE__ */ new WeakMap(), In } }), nd = od; function ad(e) { - const s = e.el; - s[In] && s[In](), s[zl] && s[zl](); + const t = e.el; + t[In] && t[In](), t[zl] && t[zl](); } function ld(e) { fr.set(e, { @@ -4571,63 +4571,63 @@ function ld(e) { }); } function id(e) { - const s = dr.get(e), o = fr.get(e), n = s.left - o.left, l = s.top - o.top; + const t = dr.get(e), o = fr.get(e), n = t.left - o.left, l = t.top - o.top; if (n || l) { const i = e.el.style; return i.transform = i.webkitTransform = `translate(${n}px,${l}px)`, i.transitionDuration = "0s", e; } } -function rd(e, s, o) { +function rd(e, t, o) { const n = e.cloneNode(), l = e[go]; l && l.forEach((u) => { u.split(/\s+/).forEach((d) => d && n.classList.remove(d)); }), o.split(/\s+/).forEach((u) => u && n.classList.add(u)), n.style.display = "none"; - const i = s.nodeType === 1 ? s : s.parentNode; + const i = t.nodeType === 1 ? t : t.parentNode; i.appendChild(n); const { hasTransform: r } = ur(n); return i.removeChild(n), r; } -const Us = (e) => { - const s = e.props["onUpdate:modelValue"] || !1; - return Ue(s) ? (o) => fn(s, o) : s; +const Ns = (e) => { + const t = e.props["onUpdate:modelValue"] || !1; + return Ne(t) ? (o) => fn(t, o) : t; }; function cd(e) { e.target.composing = !0; } function Fl(e) { - const s = e.target; - s.composing && (s.composing = !1, s.dispatchEvent(new Event("input"))); + const t = e.target; + t.composing && (t.composing = !1, t.dispatchEvent(new Event("input"))); } const Vt = Symbol("_assign"); -function Bl(e, s, o) { - return s && (e = e.trim()), o && (e = Ln(e)), e; +function Bl(e, t, o) { + return t && (e = e.trim()), o && (e = Ln(e)), e; } -const Nt = { - created(e, { modifiers: { lazy: s, trim: o, number: n } }, l) { - e[Vt] = Us(l); +const Ut = { + created(e, { modifiers: { lazy: t, trim: o, number: n } }, l) { + e[Vt] = Ns(l); const i = n || l.props && l.props.type === "number"; - ks(e, s ? "change" : "input", (r) => { + ks(e, t ? "change" : "input", (r) => { r.target.composing || e[Vt](Bl(e.value, o, i)); }), (o || i) && ks(e, "change", () => { e.value = Bl(e.value, o, i); - }), s || (ks(e, "compositionstart", cd), ks(e, "compositionend", Fl), ks(e, "change", Fl)); + }), t || (ks(e, "compositionstart", cd), ks(e, "compositionend", Fl), ks(e, "change", Fl)); }, // set value on mounted so it's after min/max for type="range" - mounted(e, { value: s }) { - e.value = s ?? ""; + mounted(e, { value: t }) { + e.value = t ?? ""; }, - beforeUpdate(e, { value: s, oldValue: o, modifiers: { lazy: n, trim: l, number: i } }, r) { - if (e[Vt] = Us(r), e.composing) return; - const u = (i || e.type === "number") && !/^0\d/.test(e.value) ? Ln(e.value) : e.value, d = s ?? ""; - u !== d && (document.activeElement === e && e.type !== "range" && (n && s === o || l && e.value.trim() === d) || (e.value = d)); + beforeUpdate(e, { value: t, oldValue: o, modifiers: { lazy: n, trim: l, number: i } }, r) { + if (e[Vt] = Ns(r), e.composing) return; + const u = (i || e.type === "number") && !/^0\d/.test(e.value) ? Ln(e.value) : e.value, d = t ?? ""; + u !== d && (document.activeElement === e && e.type !== "range" && (n && t === o || l && e.value.trim() === d) || (e.value = d)); } }, Yo = { // #4096 array checkboxes need to be deep traversed deep: !0, - created(e, s, o) { - e[Vt] = Us(o), ks(e, "change", () => { + created(e, t, o) { + e[Vt] = Ns(o), ks(e, "change", () => { const n = e._modelValue, l = ho(e), i = e.checked, r = e[Vt]; - if (Ue(n)) { + if (Ne(n)) { const u = Ra(n, l), d = u !== -1; if (i && !d) r(n.concat(l)); @@ -4644,37 +4644,37 @@ const Nt = { }, // set initial checked on mount to wait for true-value/false-value mounted: Vl, - beforeUpdate(e, s, o) { - e[Vt] = Us(o), Vl(e, s, o); + beforeUpdate(e, t, o) { + e[Vt] = Ns(o), Vl(e, t, o); } }; -function Vl(e, { value: s, oldValue: o }, n) { - e._modelValue = s; +function Vl(e, { value: t, oldValue: o }, n) { + e._modelValue = t; let l; - if (Ue(s)) - l = Ra(s, n.props.value) > -1; - else if (yo(s)) - l = s.has(n.props.value); + if (Ne(t)) + l = Ra(t, n.props.value) > -1; + else if (yo(t)) + l = t.has(n.props.value); else { - if (s === o) return; - l = Qs(s, mr(e, !0)); + if (t === o) return; + l = Qs(t, mr(e, !0)); } e.checked !== l && (e.checked = l); } const Yt = { - created(e, { value: s }, o) { - e.checked = Qs(s, o.props.value), e[Vt] = Us(o), ks(e, "change", () => { + created(e, { value: t }, o) { + e.checked = Qs(t, o.props.value), e[Vt] = Ns(o), ks(e, "change", () => { e[Vt](ho(e)); }); }, - beforeUpdate(e, { value: s, oldValue: o }, n) { - e[Vt] = Us(n), s !== o && (e.checked = Qs(s, n.props.value)); + beforeUpdate(e, { value: t, oldValue: o }, n) { + e[Vt] = Ns(n), t !== o && (e.checked = Qs(t, n.props.value)); } }, vs = { // relies on its children //