@univerjs/ui-adapter-vue3 0.8.3-nightly.202507010644
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +1 -0
- package/lib/cjs/index.js +17 -0
- package/lib/es/index.js +3647 -0
- package/lib/index.js +3647 -0
- package/lib/types/index.d.ts +16 -0
- package/lib/types/plugin.d.ts +18 -0
- package/lib/umd/index.js +20 -0
- package/package.json +70 -0
package/lib/es/index.js
ADDED
|
@@ -0,0 +1,3647 @@
|
|
|
1
|
+
import { DependentOn as xr, Inject as Bs, Injector as vr, Plugin as yr } from "@univerjs/core";
|
|
2
|
+
import { UniverUIPlugin as wr, ComponentManager as Sr } from "@univerjs/ui";
|
|
3
|
+
import { cloneElement as Tr, createElement as vn, useRef as Cr, useEffect as Er } from "react";
|
|
4
|
+
/**
|
|
5
|
+
* @vue/shared v3.5.17
|
|
6
|
+
* (c) 2018-present Yuxi (Evan) You and Vue contributors
|
|
7
|
+
* @license MIT
|
|
8
|
+
**/
|
|
9
|
+
/*! #__NO_SIDE_EFFECTS__ */
|
|
10
|
+
// @__NO_SIDE_EFFECTS__
|
|
11
|
+
function bs(e) {
|
|
12
|
+
const t = /* @__PURE__ */ Object.create(null);
|
|
13
|
+
for (const s of e.split(",")) t[s] = 1;
|
|
14
|
+
return (s) => s in t;
|
|
15
|
+
}
|
|
16
|
+
const V = {}, ot = [], xe = () => {
|
|
17
|
+
}, Or = () => !1, Lt = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // uppercase letter
|
|
18
|
+
(e.charCodeAt(2) > 122 || e.charCodeAt(2) < 97), xs = (e) => e.startsWith("onUpdate:"), te = Object.assign, vs = (e, t) => {
|
|
19
|
+
const s = e.indexOf(t);
|
|
20
|
+
s > -1 && e.splice(s, 1);
|
|
21
|
+
}, Pr = Object.prototype.hasOwnProperty, D = (e, t) => Pr.call(e, t), A = Array.isArray, lt = (e) => $t(e) === "[object Map]", Ar = (e) => $t(e) === "[object Set]", I = (e) => typeof e == "function", J = (e) => typeof e == "string", Qe = (e) => typeof e == "symbol", q = (e) => e !== null && typeof e == "object", yn = (e) => (q(e) || I(e)) && I(e.then) && I(e.catch), Ir = Object.prototype.toString, $t = (e) => Ir.call(e), Rr = (e) => $t(e).slice(8, -1), Mr = (e) => $t(e) === "[object Object]", ys = (e) => J(e) && e !== "NaN" && e[0] !== "-" && "" + parseInt(e, 10) === e, ft = /* @__PURE__ */ bs(
|
|
22
|
+
// the leading comma is intentional so empty string "" is also included
|
|
23
|
+
",key,ref,ref_for,ref_key,onVnodeBeforeMount,onVnodeMounted,onVnodeBeforeUpdate,onVnodeUpdated,onVnodeBeforeUnmount,onVnodeUnmounted"
|
|
24
|
+
), Ut = (e) => {
|
|
25
|
+
const t = /* @__PURE__ */ Object.create(null);
|
|
26
|
+
return (s) => t[s] || (t[s] = e(s));
|
|
27
|
+
}, Fr = /-(\w)/g, He = Ut(
|
|
28
|
+
(e) => e.replace(Fr, (t, s) => s ? s.toUpperCase() : "")
|
|
29
|
+
), Dr = /\B([A-Z])/g, Be = Ut(
|
|
30
|
+
(e) => e.replace(Dr, "-$1").toLowerCase()
|
|
31
|
+
), wn = Ut((e) => e.charAt(0).toUpperCase() + e.slice(1)), Yt = Ut(
|
|
32
|
+
(e) => e ? `on${wn(e)}` : ""
|
|
33
|
+
), Ke = (e, t) => !Object.is(e, t), zt = (e, ...t) => {
|
|
34
|
+
for (let s = 0; s < e.length; s++)
|
|
35
|
+
e[s](...t);
|
|
36
|
+
}, is = (e, t, s, n = !1) => {
|
|
37
|
+
Object.defineProperty(e, t, {
|
|
38
|
+
configurable: !0,
|
|
39
|
+
enumerable: !1,
|
|
40
|
+
writable: n,
|
|
41
|
+
value: s
|
|
42
|
+
});
|
|
43
|
+
}, Hr = (e) => {
|
|
44
|
+
const t = parseFloat(e);
|
|
45
|
+
return isNaN(t) ? e : t;
|
|
46
|
+
};
|
|
47
|
+
let qs;
|
|
48
|
+
const Vt = () => qs || (qs = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : typeof global < "u" ? global : {});
|
|
49
|
+
function ws(e) {
|
|
50
|
+
if (A(e)) {
|
|
51
|
+
const t = {};
|
|
52
|
+
for (let s = 0; s < e.length; s++) {
|
|
53
|
+
const n = e[s], r = J(n) ? $r(n) : ws(n);
|
|
54
|
+
if (r)
|
|
55
|
+
for (const i in r)
|
|
56
|
+
t[i] = r[i];
|
|
57
|
+
}
|
|
58
|
+
return t;
|
|
59
|
+
} else if (J(e) || q(e))
|
|
60
|
+
return e;
|
|
61
|
+
}
|
|
62
|
+
const jr = /;(?![^(]*\))/g, Nr = /:([^]+)/, Lr = /\/\*[^]*?\*\//g;
|
|
63
|
+
function $r(e) {
|
|
64
|
+
const t = {};
|
|
65
|
+
return e.replace(Lr, "").split(jr).forEach((s) => {
|
|
66
|
+
if (s) {
|
|
67
|
+
const n = s.split(Nr);
|
|
68
|
+
n.length > 1 && (t[n[0].trim()] = n[1].trim());
|
|
69
|
+
}
|
|
70
|
+
}), t;
|
|
71
|
+
}
|
|
72
|
+
function Ss(e) {
|
|
73
|
+
let t = "";
|
|
74
|
+
if (J(e))
|
|
75
|
+
t = e;
|
|
76
|
+
else if (A(e))
|
|
77
|
+
for (let s = 0; s < e.length; s++) {
|
|
78
|
+
const n = Ss(e[s]);
|
|
79
|
+
n && (t += n + " ");
|
|
80
|
+
}
|
|
81
|
+
else if (q(e))
|
|
82
|
+
for (const s in e)
|
|
83
|
+
e[s] && (t += s + " ");
|
|
84
|
+
return t.trim();
|
|
85
|
+
}
|
|
86
|
+
const Ur = "itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly", Vr = /* @__PURE__ */ bs(Ur);
|
|
87
|
+
function Sn(e) {
|
|
88
|
+
return !!e || e === "";
|
|
89
|
+
}
|
|
90
|
+
/**
|
|
91
|
+
* @vue/reactivity v3.5.17
|
|
92
|
+
* (c) 2018-present Yuxi (Evan) You and Vue contributors
|
|
93
|
+
* @license MIT
|
|
94
|
+
**/
|
|
95
|
+
let re;
|
|
96
|
+
class Kr {
|
|
97
|
+
constructor(t = !1) {
|
|
98
|
+
this.detached = t, this._active = !0, this._on = 0, this.effects = [], this.cleanups = [], this._isPaused = !1, this.parent = re, !t && re && (this.index = (re.scopes || (re.scopes = [])).push(
|
|
99
|
+
this
|
|
100
|
+
) - 1);
|
|
101
|
+
}
|
|
102
|
+
get active() {
|
|
103
|
+
return this._active;
|
|
104
|
+
}
|
|
105
|
+
pause() {
|
|
106
|
+
if (this._active) {
|
|
107
|
+
this._isPaused = !0;
|
|
108
|
+
let t, s;
|
|
109
|
+
if (this.scopes)
|
|
110
|
+
for (t = 0, s = this.scopes.length; t < s; t++)
|
|
111
|
+
this.scopes[t].pause();
|
|
112
|
+
for (t = 0, s = this.effects.length; t < s; t++)
|
|
113
|
+
this.effects[t].pause();
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
/**
|
|
117
|
+
* Resumes the effect scope, including all child scopes and effects.
|
|
118
|
+
*/
|
|
119
|
+
resume() {
|
|
120
|
+
if (this._active && this._isPaused) {
|
|
121
|
+
this._isPaused = !1;
|
|
122
|
+
let t, s;
|
|
123
|
+
if (this.scopes)
|
|
124
|
+
for (t = 0, s = this.scopes.length; t < s; t++)
|
|
125
|
+
this.scopes[t].resume();
|
|
126
|
+
for (t = 0, s = this.effects.length; t < s; t++)
|
|
127
|
+
this.effects[t].resume();
|
|
128
|
+
}
|
|
129
|
+
}
|
|
130
|
+
run(t) {
|
|
131
|
+
if (this._active) {
|
|
132
|
+
const s = re;
|
|
133
|
+
try {
|
|
134
|
+
return re = this, t();
|
|
135
|
+
} finally {
|
|
136
|
+
re = s;
|
|
137
|
+
}
|
|
138
|
+
}
|
|
139
|
+
}
|
|
140
|
+
/**
|
|
141
|
+
* This should only be called on non-detached scopes
|
|
142
|
+
* @internal
|
|
143
|
+
*/
|
|
144
|
+
on() {
|
|
145
|
+
++this._on === 1 && (this.prevScope = re, re = this);
|
|
146
|
+
}
|
|
147
|
+
/**
|
|
148
|
+
* This should only be called on non-detached scopes
|
|
149
|
+
* @internal
|
|
150
|
+
*/
|
|
151
|
+
off() {
|
|
152
|
+
this._on > 0 && --this._on === 0 && (re = this.prevScope, this.prevScope = void 0);
|
|
153
|
+
}
|
|
154
|
+
stop(t) {
|
|
155
|
+
if (this._active) {
|
|
156
|
+
this._active = !1;
|
|
157
|
+
let s, n;
|
|
158
|
+
for (s = 0, n = this.effects.length; s < n; s++)
|
|
159
|
+
this.effects[s].stop();
|
|
160
|
+
for (this.effects.length = 0, s = 0, n = this.cleanups.length; s < n; s++)
|
|
161
|
+
this.cleanups[s]();
|
|
162
|
+
if (this.cleanups.length = 0, this.scopes) {
|
|
163
|
+
for (s = 0, n = this.scopes.length; s < n; s++)
|
|
164
|
+
this.scopes[s].stop(!0);
|
|
165
|
+
this.scopes.length = 0;
|
|
166
|
+
}
|
|
167
|
+
if (!this.detached && this.parent && !t) {
|
|
168
|
+
const r = this.parent.scopes.pop();
|
|
169
|
+
r && r !== this && (this.parent.scopes[this.index] = r, r.index = this.index);
|
|
170
|
+
}
|
|
171
|
+
this.parent = void 0;
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
}
|
|
175
|
+
function Wr() {
|
|
176
|
+
return re;
|
|
177
|
+
}
|
|
178
|
+
let U;
|
|
179
|
+
const Xt = /* @__PURE__ */ new WeakSet();
|
|
180
|
+
class Tn {
|
|
181
|
+
constructor(t) {
|
|
182
|
+
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, re && re.active && re.effects.push(this);
|
|
183
|
+
}
|
|
184
|
+
pause() {
|
|
185
|
+
this.flags |= 64;
|
|
186
|
+
}
|
|
187
|
+
resume() {
|
|
188
|
+
this.flags & 64 && (this.flags &= -65, Xt.has(this) && (Xt.delete(this), this.trigger()));
|
|
189
|
+
}
|
|
190
|
+
/**
|
|
191
|
+
* @internal
|
|
192
|
+
*/
|
|
193
|
+
notify() {
|
|
194
|
+
this.flags & 2 && !(this.flags & 32) || this.flags & 8 || En(this);
|
|
195
|
+
}
|
|
196
|
+
run() {
|
|
197
|
+
if (!(this.flags & 1))
|
|
198
|
+
return this.fn();
|
|
199
|
+
this.flags |= 2, Gs(this), On(this);
|
|
200
|
+
const t = U, s = ce;
|
|
201
|
+
U = this, ce = !0;
|
|
202
|
+
try {
|
|
203
|
+
return this.fn();
|
|
204
|
+
} finally {
|
|
205
|
+
Pn(this), U = t, ce = s, this.flags &= -3;
|
|
206
|
+
}
|
|
207
|
+
}
|
|
208
|
+
stop() {
|
|
209
|
+
if (this.flags & 1) {
|
|
210
|
+
for (let t = this.deps; t; t = t.nextDep)
|
|
211
|
+
Es(t);
|
|
212
|
+
this.deps = this.depsTail = void 0, Gs(this), this.onStop && this.onStop(), this.flags &= -2;
|
|
213
|
+
}
|
|
214
|
+
}
|
|
215
|
+
trigger() {
|
|
216
|
+
this.flags & 64 ? Xt.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
|
|
217
|
+
}
|
|
218
|
+
/**
|
|
219
|
+
* @internal
|
|
220
|
+
*/
|
|
221
|
+
runIfDirty() {
|
|
222
|
+
os(this) && this.run();
|
|
223
|
+
}
|
|
224
|
+
get dirty() {
|
|
225
|
+
return os(this);
|
|
226
|
+
}
|
|
227
|
+
}
|
|
228
|
+
let Cn = 0, ct, ut;
|
|
229
|
+
function En(e, t = !1) {
|
|
230
|
+
if (e.flags |= 8, t) {
|
|
231
|
+
e.next = ut, ut = e;
|
|
232
|
+
return;
|
|
233
|
+
}
|
|
234
|
+
e.next = ct, ct = e;
|
|
235
|
+
}
|
|
236
|
+
function Ts() {
|
|
237
|
+
Cn++;
|
|
238
|
+
}
|
|
239
|
+
function Cs() {
|
|
240
|
+
if (--Cn > 0)
|
|
241
|
+
return;
|
|
242
|
+
if (ut) {
|
|
243
|
+
let t = ut;
|
|
244
|
+
for (ut = void 0; t; ) {
|
|
245
|
+
const s = t.next;
|
|
246
|
+
t.next = void 0, t.flags &= -9, t = s;
|
|
247
|
+
}
|
|
248
|
+
}
|
|
249
|
+
let e;
|
|
250
|
+
for (; ct; ) {
|
|
251
|
+
let t = ct;
|
|
252
|
+
for (ct = void 0; t; ) {
|
|
253
|
+
const s = t.next;
|
|
254
|
+
if (t.next = void 0, t.flags &= -9, t.flags & 1)
|
|
255
|
+
try {
|
|
256
|
+
t.trigger();
|
|
257
|
+
} catch (n) {
|
|
258
|
+
e || (e = n);
|
|
259
|
+
}
|
|
260
|
+
t = s;
|
|
261
|
+
}
|
|
262
|
+
}
|
|
263
|
+
if (e) throw e;
|
|
264
|
+
}
|
|
265
|
+
function On(e) {
|
|
266
|
+
for (let t = e.deps; t; t = t.nextDep)
|
|
267
|
+
t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
|
|
268
|
+
}
|
|
269
|
+
function Pn(e) {
|
|
270
|
+
let t, s = e.depsTail, n = s;
|
|
271
|
+
for (; n; ) {
|
|
272
|
+
const r = n.prevDep;
|
|
273
|
+
n.version === -1 ? (n === s && (s = r), Es(n), Br(n)) : t = n, n.dep.activeLink = n.prevActiveLink, n.prevActiveLink = void 0, n = r;
|
|
274
|
+
}
|
|
275
|
+
e.deps = t, e.depsTail = s;
|
|
276
|
+
}
|
|
277
|
+
function os(e) {
|
|
278
|
+
for (let t = e.deps; t; t = t.nextDep)
|
|
279
|
+
if (t.dep.version !== t.version || t.dep.computed && (An(t.dep.computed) || t.dep.version !== t.version))
|
|
280
|
+
return !0;
|
|
281
|
+
return !!e._dirty;
|
|
282
|
+
}
|
|
283
|
+
function An(e) {
|
|
284
|
+
if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === gt) || (e.globalVersion = gt, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !os(e))))
|
|
285
|
+
return;
|
|
286
|
+
e.flags |= 2;
|
|
287
|
+
const t = e.dep, s = U, n = ce;
|
|
288
|
+
U = e, ce = !0;
|
|
289
|
+
try {
|
|
290
|
+
On(e);
|
|
291
|
+
const r = e.fn(e._value);
|
|
292
|
+
(t.version === 0 || Ke(r, e._value)) && (e.flags |= 128, e._value = r, t.version++);
|
|
293
|
+
} catch (r) {
|
|
294
|
+
throw t.version++, r;
|
|
295
|
+
} finally {
|
|
296
|
+
U = s, ce = n, Pn(e), e.flags &= -3;
|
|
297
|
+
}
|
|
298
|
+
}
|
|
299
|
+
function Es(e, t = !1) {
|
|
300
|
+
const { dep: s, prevSub: n, nextSub: r } = e;
|
|
301
|
+
if (n && (n.nextSub = r, e.prevSub = void 0), r && (r.prevSub = n, e.nextSub = void 0), s.subs === e && (s.subs = n, !n && s.computed)) {
|
|
302
|
+
s.computed.flags &= -5;
|
|
303
|
+
for (let i = s.computed.deps; i; i = i.nextDep)
|
|
304
|
+
Es(i, !0);
|
|
305
|
+
}
|
|
306
|
+
!t && !--s.sc && s.map && s.map.delete(s.key);
|
|
307
|
+
}
|
|
308
|
+
function Br(e) {
|
|
309
|
+
const { prevDep: t, nextDep: s } = e;
|
|
310
|
+
t && (t.nextDep = s, e.prevDep = void 0), s && (s.prevDep = t, e.nextDep = void 0);
|
|
311
|
+
}
|
|
312
|
+
let ce = !0;
|
|
313
|
+
const In = [];
|
|
314
|
+
function Ee() {
|
|
315
|
+
In.push(ce), ce = !1;
|
|
316
|
+
}
|
|
317
|
+
function Oe() {
|
|
318
|
+
const e = In.pop();
|
|
319
|
+
ce = e === void 0 ? !0 : e;
|
|
320
|
+
}
|
|
321
|
+
function Gs(e) {
|
|
322
|
+
const { cleanup: t } = e;
|
|
323
|
+
if (e.cleanup = void 0, t) {
|
|
324
|
+
const s = U;
|
|
325
|
+
U = void 0;
|
|
326
|
+
try {
|
|
327
|
+
t();
|
|
328
|
+
} finally {
|
|
329
|
+
U = s;
|
|
330
|
+
}
|
|
331
|
+
}
|
|
332
|
+
}
|
|
333
|
+
let gt = 0;
|
|
334
|
+
class qr {
|
|
335
|
+
constructor(t, s) {
|
|
336
|
+
this.sub = t, this.dep = s, this.version = s.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
|
|
337
|
+
}
|
|
338
|
+
}
|
|
339
|
+
class Rn {
|
|
340
|
+
// TODO isolatedDeclarations "__v_skip"
|
|
341
|
+
constructor(t) {
|
|
342
|
+
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;
|
|
343
|
+
}
|
|
344
|
+
track(t) {
|
|
345
|
+
if (!U || !ce || U === this.computed)
|
|
346
|
+
return;
|
|
347
|
+
let s = this.activeLink;
|
|
348
|
+
if (s === void 0 || s.sub !== U)
|
|
349
|
+
s = this.activeLink = new qr(U, this), U.deps ? (s.prevDep = U.depsTail, U.depsTail.nextDep = s, U.depsTail = s) : U.deps = U.depsTail = s, Mn(s);
|
|
350
|
+
else if (s.version === -1 && (s.version = this.version, s.nextDep)) {
|
|
351
|
+
const n = s.nextDep;
|
|
352
|
+
n.prevDep = s.prevDep, s.prevDep && (s.prevDep.nextDep = n), s.prevDep = U.depsTail, s.nextDep = void 0, U.depsTail.nextDep = s, U.depsTail = s, U.deps === s && (U.deps = n);
|
|
353
|
+
}
|
|
354
|
+
return s;
|
|
355
|
+
}
|
|
356
|
+
trigger(t) {
|
|
357
|
+
this.version++, gt++, this.notify(t);
|
|
358
|
+
}
|
|
359
|
+
notify(t) {
|
|
360
|
+
Ts();
|
|
361
|
+
try {
|
|
362
|
+
for (let s = this.subs; s; s = s.prevSub)
|
|
363
|
+
s.sub.notify() && s.sub.dep.notify();
|
|
364
|
+
} finally {
|
|
365
|
+
Cs();
|
|
366
|
+
}
|
|
367
|
+
}
|
|
368
|
+
}
|
|
369
|
+
function Mn(e) {
|
|
370
|
+
if (e.dep.sc++, e.sub.flags & 4) {
|
|
371
|
+
const t = e.dep.computed;
|
|
372
|
+
if (t && !e.dep.subs) {
|
|
373
|
+
t.flags |= 20;
|
|
374
|
+
for (let n = t.deps; n; n = n.nextDep)
|
|
375
|
+
Mn(n);
|
|
376
|
+
}
|
|
377
|
+
const s = e.dep.subs;
|
|
378
|
+
s !== e && (e.prevSub = s, s && (s.nextSub = e)), e.dep.subs = e;
|
|
379
|
+
}
|
|
380
|
+
}
|
|
381
|
+
const ls = /* @__PURE__ */ new WeakMap(), We = Symbol(
|
|
382
|
+
""
|
|
383
|
+
), fs = Symbol(
|
|
384
|
+
""
|
|
385
|
+
), _t = Symbol(
|
|
386
|
+
""
|
|
387
|
+
);
|
|
388
|
+
function z(e, t, s) {
|
|
389
|
+
if (ce && U) {
|
|
390
|
+
let n = ls.get(e);
|
|
391
|
+
n || ls.set(e, n = /* @__PURE__ */ new Map());
|
|
392
|
+
let r = n.get(s);
|
|
393
|
+
r || (n.set(s, r = new Rn()), r.map = n, r.key = s), r.track();
|
|
394
|
+
}
|
|
395
|
+
}
|
|
396
|
+
function Ce(e, t, s, n, r, i) {
|
|
397
|
+
const o = ls.get(e);
|
|
398
|
+
if (!o) {
|
|
399
|
+
gt++;
|
|
400
|
+
return;
|
|
401
|
+
}
|
|
402
|
+
const f = (u) => {
|
|
403
|
+
u && u.trigger();
|
|
404
|
+
};
|
|
405
|
+
if (Ts(), t === "clear")
|
|
406
|
+
o.forEach(f);
|
|
407
|
+
else {
|
|
408
|
+
const u = A(e), h = u && ys(s);
|
|
409
|
+
if (u && s === "length") {
|
|
410
|
+
const a = Number(n);
|
|
411
|
+
o.forEach((p, S) => {
|
|
412
|
+
(S === "length" || S === _t || !Qe(S) && S >= a) && f(p);
|
|
413
|
+
});
|
|
414
|
+
} else
|
|
415
|
+
switch ((s !== void 0 || o.has(void 0)) && f(o.get(s)), h && f(o.get(_t)), t) {
|
|
416
|
+
case "add":
|
|
417
|
+
u ? h && f(o.get("length")) : (f(o.get(We)), lt(e) && f(o.get(fs)));
|
|
418
|
+
break;
|
|
419
|
+
case "delete":
|
|
420
|
+
u || (f(o.get(We)), lt(e) && f(o.get(fs)));
|
|
421
|
+
break;
|
|
422
|
+
case "set":
|
|
423
|
+
lt(e) && f(o.get(We));
|
|
424
|
+
break;
|
|
425
|
+
}
|
|
426
|
+
}
|
|
427
|
+
Cs();
|
|
428
|
+
}
|
|
429
|
+
function qe(e) {
|
|
430
|
+
const t = j(e);
|
|
431
|
+
return t === e ? t : (z(t, "iterate", _t), ve(e) ? t : t.map(le));
|
|
432
|
+
}
|
|
433
|
+
function Os(e) {
|
|
434
|
+
return z(e = j(e), "iterate", _t), e;
|
|
435
|
+
}
|
|
436
|
+
const Gr = {
|
|
437
|
+
__proto__: null,
|
|
438
|
+
[Symbol.iterator]() {
|
|
439
|
+
return Zt(this, Symbol.iterator, le);
|
|
440
|
+
},
|
|
441
|
+
concat(...e) {
|
|
442
|
+
return qe(this).concat(
|
|
443
|
+
...e.map((t) => A(t) ? qe(t) : t)
|
|
444
|
+
);
|
|
445
|
+
},
|
|
446
|
+
entries() {
|
|
447
|
+
return Zt(this, "entries", (e) => (e[1] = le(e[1]), e));
|
|
448
|
+
},
|
|
449
|
+
every(e, t) {
|
|
450
|
+
return we(this, "every", e, t, void 0, arguments);
|
|
451
|
+
},
|
|
452
|
+
filter(e, t) {
|
|
453
|
+
return we(this, "filter", e, t, (s) => s.map(le), arguments);
|
|
454
|
+
},
|
|
455
|
+
find(e, t) {
|
|
456
|
+
return we(this, "find", e, t, le, arguments);
|
|
457
|
+
},
|
|
458
|
+
findIndex(e, t) {
|
|
459
|
+
return we(this, "findIndex", e, t, void 0, arguments);
|
|
460
|
+
},
|
|
461
|
+
findLast(e, t) {
|
|
462
|
+
return we(this, "findLast", e, t, le, arguments);
|
|
463
|
+
},
|
|
464
|
+
findLastIndex(e, t) {
|
|
465
|
+
return we(this, "findLastIndex", e, t, void 0, arguments);
|
|
466
|
+
},
|
|
467
|
+
// flat, flatMap could benefit from ARRAY_ITERATE but are not straight-forward to implement
|
|
468
|
+
forEach(e, t) {
|
|
469
|
+
return we(this, "forEach", e, t, void 0, arguments);
|
|
470
|
+
},
|
|
471
|
+
includes(...e) {
|
|
472
|
+
return Qt(this, "includes", e);
|
|
473
|
+
},
|
|
474
|
+
indexOf(...e) {
|
|
475
|
+
return Qt(this, "indexOf", e);
|
|
476
|
+
},
|
|
477
|
+
join(e) {
|
|
478
|
+
return qe(this).join(e);
|
|
479
|
+
},
|
|
480
|
+
// keys() iterator only reads `length`, no optimisation required
|
|
481
|
+
lastIndexOf(...e) {
|
|
482
|
+
return Qt(this, "lastIndexOf", e);
|
|
483
|
+
},
|
|
484
|
+
map(e, t) {
|
|
485
|
+
return we(this, "map", e, t, void 0, arguments);
|
|
486
|
+
},
|
|
487
|
+
pop() {
|
|
488
|
+
return nt(this, "pop");
|
|
489
|
+
},
|
|
490
|
+
push(...e) {
|
|
491
|
+
return nt(this, "push", e);
|
|
492
|
+
},
|
|
493
|
+
reduce(e, ...t) {
|
|
494
|
+
return Js(this, "reduce", e, t);
|
|
495
|
+
},
|
|
496
|
+
reduceRight(e, ...t) {
|
|
497
|
+
return Js(this, "reduceRight", e, t);
|
|
498
|
+
},
|
|
499
|
+
shift() {
|
|
500
|
+
return nt(this, "shift");
|
|
501
|
+
},
|
|
502
|
+
// slice could use ARRAY_ITERATE but also seems to beg for range tracking
|
|
503
|
+
some(e, t) {
|
|
504
|
+
return we(this, "some", e, t, void 0, arguments);
|
|
505
|
+
},
|
|
506
|
+
splice(...e) {
|
|
507
|
+
return nt(this, "splice", e);
|
|
508
|
+
},
|
|
509
|
+
toReversed() {
|
|
510
|
+
return qe(this).toReversed();
|
|
511
|
+
},
|
|
512
|
+
toSorted(e) {
|
|
513
|
+
return qe(this).toSorted(e);
|
|
514
|
+
},
|
|
515
|
+
toSpliced(...e) {
|
|
516
|
+
return qe(this).toSpliced(...e);
|
|
517
|
+
},
|
|
518
|
+
unshift(...e) {
|
|
519
|
+
return nt(this, "unshift", e);
|
|
520
|
+
},
|
|
521
|
+
values() {
|
|
522
|
+
return Zt(this, "values", le);
|
|
523
|
+
}
|
|
524
|
+
};
|
|
525
|
+
function Zt(e, t, s) {
|
|
526
|
+
const n = Os(e), r = n[t]();
|
|
527
|
+
return n !== e && !ve(e) && (r._next = r.next, r.next = () => {
|
|
528
|
+
const i = r._next();
|
|
529
|
+
return i.value && (i.value = s(i.value)), i;
|
|
530
|
+
}), r;
|
|
531
|
+
}
|
|
532
|
+
const Jr = Array.prototype;
|
|
533
|
+
function we(e, t, s, n, r, i) {
|
|
534
|
+
const o = Os(e), f = o !== e && !ve(e), u = o[t];
|
|
535
|
+
if (u !== Jr[t]) {
|
|
536
|
+
const p = u.apply(e, i);
|
|
537
|
+
return f ? le(p) : p;
|
|
538
|
+
}
|
|
539
|
+
let h = s;
|
|
540
|
+
o !== e && (f ? h = function(p, S) {
|
|
541
|
+
return s.call(this, le(p), S, e);
|
|
542
|
+
} : s.length > 2 && (h = function(p, S) {
|
|
543
|
+
return s.call(this, p, S, e);
|
|
544
|
+
}));
|
|
545
|
+
const a = u.call(o, h, n);
|
|
546
|
+
return f && r ? r(a) : a;
|
|
547
|
+
}
|
|
548
|
+
function Js(e, t, s, n) {
|
|
549
|
+
const r = Os(e);
|
|
550
|
+
let i = s;
|
|
551
|
+
return r !== e && (ve(e) ? s.length > 3 && (i = function(o, f, u) {
|
|
552
|
+
return s.call(this, o, f, u, e);
|
|
553
|
+
}) : i = function(o, f, u) {
|
|
554
|
+
return s.call(this, o, le(f), u, e);
|
|
555
|
+
}), r[t](i, ...n);
|
|
556
|
+
}
|
|
557
|
+
function Qt(e, t, s) {
|
|
558
|
+
const n = j(e);
|
|
559
|
+
z(n, "iterate", _t);
|
|
560
|
+
const r = n[t](...s);
|
|
561
|
+
return (r === -1 || r === !1) && Rs(s[0]) ? (s[0] = j(s[0]), n[t](...s)) : r;
|
|
562
|
+
}
|
|
563
|
+
function nt(e, t, s = []) {
|
|
564
|
+
Ee(), Ts();
|
|
565
|
+
const n = j(e)[t].apply(e, s);
|
|
566
|
+
return Cs(), Oe(), n;
|
|
567
|
+
}
|
|
568
|
+
const Yr = /* @__PURE__ */ bs("__proto__,__v_isRef,__isVue"), Fn = new Set(
|
|
569
|
+
/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(Qe)
|
|
570
|
+
);
|
|
571
|
+
function zr(e) {
|
|
572
|
+
Qe(e) || (e = String(e));
|
|
573
|
+
const t = j(this);
|
|
574
|
+
return z(t, "has", e), t.hasOwnProperty(e);
|
|
575
|
+
}
|
|
576
|
+
class Dn {
|
|
577
|
+
constructor(t = !1, s = !1) {
|
|
578
|
+
this._isReadonly = t, this._isShallow = s;
|
|
579
|
+
}
|
|
580
|
+
get(t, s, n) {
|
|
581
|
+
if (s === "__v_skip") return t.__v_skip;
|
|
582
|
+
const r = this._isReadonly, i = this._isShallow;
|
|
583
|
+
if (s === "__v_isReactive")
|
|
584
|
+
return !r;
|
|
585
|
+
if (s === "__v_isReadonly")
|
|
586
|
+
return r;
|
|
587
|
+
if (s === "__v_isShallow")
|
|
588
|
+
return i;
|
|
589
|
+
if (s === "__v_raw")
|
|
590
|
+
return n === (r ? i ? ii : Ln : i ? Nn : jn).get(t) || // receiver is not the reactive proxy, but has the same prototype
|
|
591
|
+
// this means the receiver is a user proxy of the reactive proxy
|
|
592
|
+
Object.getPrototypeOf(t) === Object.getPrototypeOf(n) ? t : void 0;
|
|
593
|
+
const o = A(t);
|
|
594
|
+
if (!r) {
|
|
595
|
+
let u;
|
|
596
|
+
if (o && (u = Gr[s]))
|
|
597
|
+
return u;
|
|
598
|
+
if (s === "hasOwnProperty")
|
|
599
|
+
return zr;
|
|
600
|
+
}
|
|
601
|
+
const f = Reflect.get(
|
|
602
|
+
t,
|
|
603
|
+
s,
|
|
604
|
+
// if this is a proxy wrapping a ref, return methods using the raw ref
|
|
605
|
+
// as receiver so that we don't have to call `toRaw` on the ref in all
|
|
606
|
+
// its class methods
|
|
607
|
+
ee(t) ? t : n
|
|
608
|
+
);
|
|
609
|
+
return (Qe(s) ? Fn.has(s) : Yr(s)) || (r || z(t, "get", s), i) ? f : ee(f) ? o && ys(s) ? f : f.value : q(f) ? r ? $n(f) : As(f) : f;
|
|
610
|
+
}
|
|
611
|
+
}
|
|
612
|
+
class Hn extends Dn {
|
|
613
|
+
constructor(t = !1) {
|
|
614
|
+
super(!1, t);
|
|
615
|
+
}
|
|
616
|
+
set(t, s, n, r) {
|
|
617
|
+
let i = t[s];
|
|
618
|
+
if (!this._isShallow) {
|
|
619
|
+
const u = ze(i);
|
|
620
|
+
if (!ve(n) && !ze(n) && (i = j(i), n = j(n)), !A(t) && ee(i) && !ee(n))
|
|
621
|
+
return u ? !1 : (i.value = n, !0);
|
|
622
|
+
}
|
|
623
|
+
const o = A(t) && ys(s) ? Number(s) < t.length : D(t, s), f = Reflect.set(
|
|
624
|
+
t,
|
|
625
|
+
s,
|
|
626
|
+
n,
|
|
627
|
+
ee(t) ? t : r
|
|
628
|
+
);
|
|
629
|
+
return t === j(r) && (o ? Ke(n, i) && Ce(t, "set", s, n) : Ce(t, "add", s, n)), f;
|
|
630
|
+
}
|
|
631
|
+
deleteProperty(t, s) {
|
|
632
|
+
const n = D(t, s);
|
|
633
|
+
t[s];
|
|
634
|
+
const r = Reflect.deleteProperty(t, s);
|
|
635
|
+
return r && n && Ce(t, "delete", s, void 0), r;
|
|
636
|
+
}
|
|
637
|
+
has(t, s) {
|
|
638
|
+
const n = Reflect.has(t, s);
|
|
639
|
+
return (!Qe(s) || !Fn.has(s)) && z(t, "has", s), n;
|
|
640
|
+
}
|
|
641
|
+
ownKeys(t) {
|
|
642
|
+
return z(
|
|
643
|
+
t,
|
|
644
|
+
"iterate",
|
|
645
|
+
A(t) ? "length" : We
|
|
646
|
+
), Reflect.ownKeys(t);
|
|
647
|
+
}
|
|
648
|
+
}
|
|
649
|
+
class Xr extends Dn {
|
|
650
|
+
constructor(t = !1) {
|
|
651
|
+
super(!0, t);
|
|
652
|
+
}
|
|
653
|
+
set(t, s) {
|
|
654
|
+
return !0;
|
|
655
|
+
}
|
|
656
|
+
deleteProperty(t, s) {
|
|
657
|
+
return !0;
|
|
658
|
+
}
|
|
659
|
+
}
|
|
660
|
+
const Zr = /* @__PURE__ */ new Hn(), Qr = /* @__PURE__ */ new Xr(), kr = /* @__PURE__ */ new Hn(!0);
|
|
661
|
+
const cs = (e) => e, Et = (e) => Reflect.getPrototypeOf(e);
|
|
662
|
+
function ei(e, t, s) {
|
|
663
|
+
return function(...n) {
|
|
664
|
+
const r = this.__v_raw, i = j(r), o = lt(i), f = e === "entries" || e === Symbol.iterator && o, u = e === "keys" && o, h = r[e](...n), a = s ? cs : t ? us : le;
|
|
665
|
+
return !t && z(
|
|
666
|
+
i,
|
|
667
|
+
"iterate",
|
|
668
|
+
u ? fs : We
|
|
669
|
+
), {
|
|
670
|
+
// iterator protocol
|
|
671
|
+
next() {
|
|
672
|
+
const { value: p, done: S } = h.next();
|
|
673
|
+
return S ? { value: p, done: S } : {
|
|
674
|
+
value: f ? [a(p[0]), a(p[1])] : a(p),
|
|
675
|
+
done: S
|
|
676
|
+
};
|
|
677
|
+
},
|
|
678
|
+
// iterable protocol
|
|
679
|
+
[Symbol.iterator]() {
|
|
680
|
+
return this;
|
|
681
|
+
}
|
|
682
|
+
};
|
|
683
|
+
};
|
|
684
|
+
}
|
|
685
|
+
function Ot(e) {
|
|
686
|
+
return function(...t) {
|
|
687
|
+
return e === "delete" ? !1 : e === "clear" ? void 0 : this;
|
|
688
|
+
};
|
|
689
|
+
}
|
|
690
|
+
function ti(e, t) {
|
|
691
|
+
const s = {
|
|
692
|
+
get(r) {
|
|
693
|
+
const i = this.__v_raw, o = j(i), f = j(r);
|
|
694
|
+
e || (Ke(r, f) && z(o, "get", r), z(o, "get", f));
|
|
695
|
+
const { has: u } = Et(o), h = t ? cs : e ? us : le;
|
|
696
|
+
if (u.call(o, r))
|
|
697
|
+
return h(i.get(r));
|
|
698
|
+
if (u.call(o, f))
|
|
699
|
+
return h(i.get(f));
|
|
700
|
+
i !== o && i.get(r);
|
|
701
|
+
},
|
|
702
|
+
get size() {
|
|
703
|
+
const r = this.__v_raw;
|
|
704
|
+
return !e && z(j(r), "iterate", We), Reflect.get(r, "size", r);
|
|
705
|
+
},
|
|
706
|
+
has(r) {
|
|
707
|
+
const i = this.__v_raw, o = j(i), f = j(r);
|
|
708
|
+
return e || (Ke(r, f) && z(o, "has", r), z(o, "has", f)), r === f ? i.has(r) : i.has(r) || i.has(f);
|
|
709
|
+
},
|
|
710
|
+
forEach(r, i) {
|
|
711
|
+
const o = this, f = o.__v_raw, u = j(f), h = t ? cs : e ? us : le;
|
|
712
|
+
return !e && z(u, "iterate", We), f.forEach((a, p) => r.call(i, h(a), h(p), o));
|
|
713
|
+
}
|
|
714
|
+
};
|
|
715
|
+
return te(
|
|
716
|
+
s,
|
|
717
|
+
e ? {
|
|
718
|
+
add: Ot("add"),
|
|
719
|
+
set: Ot("set"),
|
|
720
|
+
delete: Ot("delete"),
|
|
721
|
+
clear: Ot("clear")
|
|
722
|
+
} : {
|
|
723
|
+
add(r) {
|
|
724
|
+
!t && !ve(r) && !ze(r) && (r = j(r));
|
|
725
|
+
const i = j(this);
|
|
726
|
+
return Et(i).has.call(i, r) || (i.add(r), Ce(i, "add", r, r)), this;
|
|
727
|
+
},
|
|
728
|
+
set(r, i) {
|
|
729
|
+
!t && !ve(i) && !ze(i) && (i = j(i));
|
|
730
|
+
const o = j(this), { has: f, get: u } = Et(o);
|
|
731
|
+
let h = f.call(o, r);
|
|
732
|
+
h || (r = j(r), h = f.call(o, r));
|
|
733
|
+
const a = u.call(o, r);
|
|
734
|
+
return o.set(r, i), h ? Ke(i, a) && Ce(o, "set", r, i) : Ce(o, "add", r, i), this;
|
|
735
|
+
},
|
|
736
|
+
delete(r) {
|
|
737
|
+
const i = j(this), { has: o, get: f } = Et(i);
|
|
738
|
+
let u = o.call(i, r);
|
|
739
|
+
u || (r = j(r), u = o.call(i, r)), f && f.call(i, r);
|
|
740
|
+
const h = i.delete(r);
|
|
741
|
+
return u && Ce(i, "delete", r, void 0), h;
|
|
742
|
+
},
|
|
743
|
+
clear() {
|
|
744
|
+
const r = j(this), i = r.size !== 0, o = r.clear();
|
|
745
|
+
return i && Ce(
|
|
746
|
+
r,
|
|
747
|
+
"clear",
|
|
748
|
+
void 0,
|
|
749
|
+
void 0
|
|
750
|
+
), o;
|
|
751
|
+
}
|
|
752
|
+
}
|
|
753
|
+
), [
|
|
754
|
+
"keys",
|
|
755
|
+
"values",
|
|
756
|
+
"entries",
|
|
757
|
+
Symbol.iterator
|
|
758
|
+
].forEach((r) => {
|
|
759
|
+
s[r] = ei(r, e, t);
|
|
760
|
+
}), s;
|
|
761
|
+
}
|
|
762
|
+
function Ps(e, t) {
|
|
763
|
+
const s = ti(e, t);
|
|
764
|
+
return (n, r, i) => r === "__v_isReactive" ? !e : r === "__v_isReadonly" ? e : r === "__v_raw" ? n : Reflect.get(
|
|
765
|
+
D(s, r) && r in n ? s : n,
|
|
766
|
+
r,
|
|
767
|
+
i
|
|
768
|
+
);
|
|
769
|
+
}
|
|
770
|
+
const si = {
|
|
771
|
+
get: /* @__PURE__ */ Ps(!1, !1)
|
|
772
|
+
}, ni = {
|
|
773
|
+
get: /* @__PURE__ */ Ps(!1, !0)
|
|
774
|
+
}, ri = {
|
|
775
|
+
get: /* @__PURE__ */ Ps(!0, !1)
|
|
776
|
+
};
|
|
777
|
+
const jn = /* @__PURE__ */ new WeakMap(), Nn = /* @__PURE__ */ new WeakMap(), Ln = /* @__PURE__ */ new WeakMap(), ii = /* @__PURE__ */ new WeakMap();
|
|
778
|
+
function oi(e) {
|
|
779
|
+
switch (e) {
|
|
780
|
+
case "Object":
|
|
781
|
+
case "Array":
|
|
782
|
+
return 1;
|
|
783
|
+
case "Map":
|
|
784
|
+
case "Set":
|
|
785
|
+
case "WeakMap":
|
|
786
|
+
case "WeakSet":
|
|
787
|
+
return 2;
|
|
788
|
+
default:
|
|
789
|
+
return 0;
|
|
790
|
+
}
|
|
791
|
+
}
|
|
792
|
+
function li(e) {
|
|
793
|
+
return e.__v_skip || !Object.isExtensible(e) ? 0 : oi(Rr(e));
|
|
794
|
+
}
|
|
795
|
+
function As(e) {
|
|
796
|
+
return ze(e) ? e : Is(
|
|
797
|
+
e,
|
|
798
|
+
!1,
|
|
799
|
+
Zr,
|
|
800
|
+
si,
|
|
801
|
+
jn
|
|
802
|
+
);
|
|
803
|
+
}
|
|
804
|
+
function fi(e) {
|
|
805
|
+
return Is(
|
|
806
|
+
e,
|
|
807
|
+
!1,
|
|
808
|
+
kr,
|
|
809
|
+
ni,
|
|
810
|
+
Nn
|
|
811
|
+
);
|
|
812
|
+
}
|
|
813
|
+
function $n(e) {
|
|
814
|
+
return Is(
|
|
815
|
+
e,
|
|
816
|
+
!0,
|
|
817
|
+
Qr,
|
|
818
|
+
ri,
|
|
819
|
+
Ln
|
|
820
|
+
);
|
|
821
|
+
}
|
|
822
|
+
function Is(e, t, s, n, r) {
|
|
823
|
+
if (!q(e) || e.__v_raw && !(t && e.__v_isReactive))
|
|
824
|
+
return e;
|
|
825
|
+
const i = li(e);
|
|
826
|
+
if (i === 0)
|
|
827
|
+
return e;
|
|
828
|
+
const o = r.get(e);
|
|
829
|
+
if (o)
|
|
830
|
+
return o;
|
|
831
|
+
const f = new Proxy(
|
|
832
|
+
e,
|
|
833
|
+
i === 2 ? n : s
|
|
834
|
+
);
|
|
835
|
+
return r.set(e, f), f;
|
|
836
|
+
}
|
|
837
|
+
function at(e) {
|
|
838
|
+
return ze(e) ? at(e.__v_raw) : !!(e && e.__v_isReactive);
|
|
839
|
+
}
|
|
840
|
+
function ze(e) {
|
|
841
|
+
return !!(e && e.__v_isReadonly);
|
|
842
|
+
}
|
|
843
|
+
function ve(e) {
|
|
844
|
+
return !!(e && e.__v_isShallow);
|
|
845
|
+
}
|
|
846
|
+
function Rs(e) {
|
|
847
|
+
return e ? !!e.__v_raw : !1;
|
|
848
|
+
}
|
|
849
|
+
function j(e) {
|
|
850
|
+
const t = e && e.__v_raw;
|
|
851
|
+
return t ? j(t) : e;
|
|
852
|
+
}
|
|
853
|
+
function ci(e) {
|
|
854
|
+
return !D(e, "__v_skip") && Object.isExtensible(e) && is(e, "__v_skip", !0), e;
|
|
855
|
+
}
|
|
856
|
+
const le = (e) => q(e) ? As(e) : e, us = (e) => q(e) ? $n(e) : e;
|
|
857
|
+
function ee(e) {
|
|
858
|
+
return e ? e.__v_isRef === !0 : !1;
|
|
859
|
+
}
|
|
860
|
+
function ui(e) {
|
|
861
|
+
return ee(e) ? e.value : e;
|
|
862
|
+
}
|
|
863
|
+
const ai = {
|
|
864
|
+
get: (e, t, s) => t === "__v_raw" ? e : ui(Reflect.get(e, t, s)),
|
|
865
|
+
set: (e, t, s, n) => {
|
|
866
|
+
const r = e[t];
|
|
867
|
+
return ee(r) && !ee(s) ? (r.value = s, !0) : Reflect.set(e, t, s, n);
|
|
868
|
+
}
|
|
869
|
+
};
|
|
870
|
+
function Un(e) {
|
|
871
|
+
return at(e) ? e : new Proxy(e, ai);
|
|
872
|
+
}
|
|
873
|
+
class di {
|
|
874
|
+
constructor(t, s, n) {
|
|
875
|
+
this.fn = t, this.setter = s, this._value = void 0, this.dep = new Rn(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = gt - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !s, this.isSSR = n;
|
|
876
|
+
}
|
|
877
|
+
/**
|
|
878
|
+
* @internal
|
|
879
|
+
*/
|
|
880
|
+
notify() {
|
|
881
|
+
if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion
|
|
882
|
+
U !== this)
|
|
883
|
+
return En(this, !0), !0;
|
|
884
|
+
}
|
|
885
|
+
get value() {
|
|
886
|
+
const t = this.dep.track();
|
|
887
|
+
return An(this), t && (t.version = this.dep.version), this._value;
|
|
888
|
+
}
|
|
889
|
+
set value(t) {
|
|
890
|
+
this.setter && this.setter(t);
|
|
891
|
+
}
|
|
892
|
+
}
|
|
893
|
+
function hi(e, t, s = !1) {
|
|
894
|
+
let n, r;
|
|
895
|
+
return I(e) ? n = e : (n = e.get, r = e.set), new di(n, r, s);
|
|
896
|
+
}
|
|
897
|
+
const Pt = {}, Mt = /* @__PURE__ */ new WeakMap();
|
|
898
|
+
let Ve;
|
|
899
|
+
function pi(e, t = !1, s = Ve) {
|
|
900
|
+
if (s) {
|
|
901
|
+
let n = Mt.get(s);
|
|
902
|
+
n || Mt.set(s, n = []), n.push(e);
|
|
903
|
+
}
|
|
904
|
+
}
|
|
905
|
+
function gi(e, t, s = V) {
|
|
906
|
+
const { immediate: n, deep: r, once: i, scheduler: o, augmentJob: f, call: u } = s, h = (O) => r ? O : ve(O) || r === !1 || r === 0 ? Fe(O, 1) : Fe(O);
|
|
907
|
+
let a, p, S, T, F = !1, M = !1;
|
|
908
|
+
if (ee(e) ? (p = () => e.value, F = ve(e)) : at(e) ? (p = () => h(e), F = !0) : A(e) ? (M = !0, F = e.some((O) => at(O) || ve(O)), p = () => e.map((O) => {
|
|
909
|
+
if (ee(O))
|
|
910
|
+
return O.value;
|
|
911
|
+
if (at(O))
|
|
912
|
+
return h(O);
|
|
913
|
+
if (I(O))
|
|
914
|
+
return u ? u(O, 2) : O();
|
|
915
|
+
})) : I(e) ? t ? p = u ? () => u(e, 2) : e : p = () => {
|
|
916
|
+
if (S) {
|
|
917
|
+
Ee();
|
|
918
|
+
try {
|
|
919
|
+
S();
|
|
920
|
+
} finally {
|
|
921
|
+
Oe();
|
|
922
|
+
}
|
|
923
|
+
}
|
|
924
|
+
const O = Ve;
|
|
925
|
+
Ve = a;
|
|
926
|
+
try {
|
|
927
|
+
return u ? u(e, 3, [T]) : e(T);
|
|
928
|
+
} finally {
|
|
929
|
+
Ve = O;
|
|
930
|
+
}
|
|
931
|
+
} : p = xe, t && r) {
|
|
932
|
+
const O = p, G = r === !0 ? 1 / 0 : r;
|
|
933
|
+
p = () => Fe(O(), G);
|
|
934
|
+
}
|
|
935
|
+
const Y = Wr(), N = () => {
|
|
936
|
+
a.stop(), Y && Y.active && vs(Y.effects, a);
|
|
937
|
+
};
|
|
938
|
+
if (i && t) {
|
|
939
|
+
const O = t;
|
|
940
|
+
t = (...G) => {
|
|
941
|
+
O(...G), N();
|
|
942
|
+
};
|
|
943
|
+
}
|
|
944
|
+
let W = M ? new Array(e.length).fill(Pt) : Pt;
|
|
945
|
+
const B = (O) => {
|
|
946
|
+
if (!(!(a.flags & 1) || !a.dirty && !O))
|
|
947
|
+
if (t) {
|
|
948
|
+
const G = a.run();
|
|
949
|
+
if (r || F || (M ? G.some((Ae, ue) => Ke(Ae, W[ue])) : Ke(G, W))) {
|
|
950
|
+
S && S();
|
|
951
|
+
const Ae = Ve;
|
|
952
|
+
Ve = a;
|
|
953
|
+
try {
|
|
954
|
+
const ue = [
|
|
955
|
+
G,
|
|
956
|
+
// pass undefined as the old value when it's changed for the first time
|
|
957
|
+
W === Pt ? void 0 : M && W[0] === Pt ? [] : W,
|
|
958
|
+
T
|
|
959
|
+
];
|
|
960
|
+
W = G, u ? u(t, 3, ue) : (
|
|
961
|
+
// @ts-expect-error
|
|
962
|
+
t(...ue)
|
|
963
|
+
);
|
|
964
|
+
} finally {
|
|
965
|
+
Ve = Ae;
|
|
966
|
+
}
|
|
967
|
+
}
|
|
968
|
+
} else
|
|
969
|
+
a.run();
|
|
970
|
+
};
|
|
971
|
+
return f && f(B), a = new Tn(p), a.scheduler = o ? () => o(B, !1) : B, T = (O) => pi(O, !1, a), S = a.onStop = () => {
|
|
972
|
+
const O = Mt.get(a);
|
|
973
|
+
if (O) {
|
|
974
|
+
if (u)
|
|
975
|
+
u(O, 4);
|
|
976
|
+
else
|
|
977
|
+
for (const G of O) G();
|
|
978
|
+
Mt.delete(a);
|
|
979
|
+
}
|
|
980
|
+
}, t ? n ? B(!0) : W = a.run() : o ? o(B.bind(null, !0), !0) : a.run(), N.pause = a.pause.bind(a), N.resume = a.resume.bind(a), N.stop = N, N;
|
|
981
|
+
}
|
|
982
|
+
function Fe(e, t = 1 / 0, s) {
|
|
983
|
+
if (t <= 0 || !q(e) || e.__v_skip || (s = s || /* @__PURE__ */ new Set(), s.has(e)))
|
|
984
|
+
return e;
|
|
985
|
+
if (s.add(e), t--, ee(e))
|
|
986
|
+
Fe(e.value, t, s);
|
|
987
|
+
else if (A(e))
|
|
988
|
+
for (let n = 0; n < e.length; n++)
|
|
989
|
+
Fe(e[n], t, s);
|
|
990
|
+
else if (Ar(e) || lt(e))
|
|
991
|
+
e.forEach((n) => {
|
|
992
|
+
Fe(n, t, s);
|
|
993
|
+
});
|
|
994
|
+
else if (Mr(e)) {
|
|
995
|
+
for (const n in e)
|
|
996
|
+
Fe(e[n], t, s);
|
|
997
|
+
for (const n of Object.getOwnPropertySymbols(e))
|
|
998
|
+
Object.prototype.propertyIsEnumerable.call(e, n) && Fe(e[n], t, s);
|
|
999
|
+
}
|
|
1000
|
+
return e;
|
|
1001
|
+
}
|
|
1002
|
+
/**
|
|
1003
|
+
* @vue/runtime-core v3.5.17
|
|
1004
|
+
* (c) 2018-present Yuxi (Evan) You and Vue contributors
|
|
1005
|
+
* @license MIT
|
|
1006
|
+
**/
|
|
1007
|
+
function xt(e, t, s, n) {
|
|
1008
|
+
try {
|
|
1009
|
+
return n ? e(...n) : e();
|
|
1010
|
+
} catch (r) {
|
|
1011
|
+
Kt(r, t, s);
|
|
1012
|
+
}
|
|
1013
|
+
}
|
|
1014
|
+
function ye(e, t, s, n) {
|
|
1015
|
+
if (I(e)) {
|
|
1016
|
+
const r = xt(e, t, s, n);
|
|
1017
|
+
return r && yn(r) && r.catch((i) => {
|
|
1018
|
+
Kt(i, t, s);
|
|
1019
|
+
}), r;
|
|
1020
|
+
}
|
|
1021
|
+
if (A(e)) {
|
|
1022
|
+
const r = [];
|
|
1023
|
+
for (let i = 0; i < e.length; i++)
|
|
1024
|
+
r.push(ye(e[i], t, s, n));
|
|
1025
|
+
return r;
|
|
1026
|
+
}
|
|
1027
|
+
}
|
|
1028
|
+
function Kt(e, t, s, n = !0) {
|
|
1029
|
+
const r = t ? t.vnode : null, { errorHandler: i, throwUnhandledErrorInProduction: o } = t && t.appContext.config || V;
|
|
1030
|
+
if (t) {
|
|
1031
|
+
let f = t.parent;
|
|
1032
|
+
const u = t.proxy, h = `https://vuejs.org/error-reference/#runtime-${s}`;
|
|
1033
|
+
for (; f; ) {
|
|
1034
|
+
const a = f.ec;
|
|
1035
|
+
if (a) {
|
|
1036
|
+
for (let p = 0; p < a.length; p++)
|
|
1037
|
+
if (a[p](e, u, h) === !1)
|
|
1038
|
+
return;
|
|
1039
|
+
}
|
|
1040
|
+
f = f.parent;
|
|
1041
|
+
}
|
|
1042
|
+
if (i) {
|
|
1043
|
+
Ee(), xt(i, null, 10, [
|
|
1044
|
+
e,
|
|
1045
|
+
u,
|
|
1046
|
+
h
|
|
1047
|
+
]), Oe();
|
|
1048
|
+
return;
|
|
1049
|
+
}
|
|
1050
|
+
}
|
|
1051
|
+
_i(e, s, r, n, o);
|
|
1052
|
+
}
|
|
1053
|
+
function _i(e, t, s, n = !0, r = !1) {
|
|
1054
|
+
if (r)
|
|
1055
|
+
throw e;
|
|
1056
|
+
console.error(e);
|
|
1057
|
+
}
|
|
1058
|
+
const Q = [];
|
|
1059
|
+
let _e = -1;
|
|
1060
|
+
const Je = [];
|
|
1061
|
+
let Re = null, Ge = 0;
|
|
1062
|
+
const Vn = /* @__PURE__ */ Promise.resolve();
|
|
1063
|
+
let Ft = null;
|
|
1064
|
+
function mi(e) {
|
|
1065
|
+
const t = Ft || Vn;
|
|
1066
|
+
return e ? t.then(this ? e.bind(this) : e) : t;
|
|
1067
|
+
}
|
|
1068
|
+
function bi(e) {
|
|
1069
|
+
let t = _e + 1, s = Q.length;
|
|
1070
|
+
for (; t < s; ) {
|
|
1071
|
+
const n = t + s >>> 1, r = Q[n], i = mt(r);
|
|
1072
|
+
i < e || i === e && r.flags & 2 ? t = n + 1 : s = n;
|
|
1073
|
+
}
|
|
1074
|
+
return t;
|
|
1075
|
+
}
|
|
1076
|
+
function Ms(e) {
|
|
1077
|
+
if (!(e.flags & 1)) {
|
|
1078
|
+
const t = mt(e), s = Q[Q.length - 1];
|
|
1079
|
+
!s || // fast path when the job id is larger than the tail
|
|
1080
|
+
!(e.flags & 2) && t >= mt(s) ? Q.push(e) : Q.splice(bi(t), 0, e), e.flags |= 1, Kn();
|
|
1081
|
+
}
|
|
1082
|
+
}
|
|
1083
|
+
function Kn() {
|
|
1084
|
+
Ft || (Ft = Vn.then(Bn));
|
|
1085
|
+
}
|
|
1086
|
+
function xi(e) {
|
|
1087
|
+
A(e) ? Je.push(...e) : Re && e.id === -1 ? Re.splice(Ge + 1, 0, e) : e.flags & 1 || (Je.push(e), e.flags |= 1), Kn();
|
|
1088
|
+
}
|
|
1089
|
+
function Ys(e, t, s = _e + 1) {
|
|
1090
|
+
for (; s < Q.length; s++) {
|
|
1091
|
+
const n = Q[s];
|
|
1092
|
+
if (n && n.flags & 2) {
|
|
1093
|
+
if (e && n.id !== e.uid)
|
|
1094
|
+
continue;
|
|
1095
|
+
Q.splice(s, 1), s--, n.flags & 4 && (n.flags &= -2), n(), n.flags & 4 || (n.flags &= -2);
|
|
1096
|
+
}
|
|
1097
|
+
}
|
|
1098
|
+
}
|
|
1099
|
+
function Wn(e) {
|
|
1100
|
+
if (Je.length) {
|
|
1101
|
+
const t = [...new Set(Je)].sort(
|
|
1102
|
+
(s, n) => mt(s) - mt(n)
|
|
1103
|
+
);
|
|
1104
|
+
if (Je.length = 0, Re) {
|
|
1105
|
+
Re.push(...t);
|
|
1106
|
+
return;
|
|
1107
|
+
}
|
|
1108
|
+
for (Re = t, Ge = 0; Ge < Re.length; Ge++) {
|
|
1109
|
+
const s = Re[Ge];
|
|
1110
|
+
s.flags & 4 && (s.flags &= -2), s.flags & 8 || s(), s.flags &= -2;
|
|
1111
|
+
}
|
|
1112
|
+
Re = null, Ge = 0;
|
|
1113
|
+
}
|
|
1114
|
+
}
|
|
1115
|
+
const mt = (e) => e.id == null ? e.flags & 2 ? -1 : 1 / 0 : e.id;
|
|
1116
|
+
function Bn(e) {
|
|
1117
|
+
try {
|
|
1118
|
+
for (_e = 0; _e < Q.length; _e++) {
|
|
1119
|
+
const t = Q[_e];
|
|
1120
|
+
t && !(t.flags & 8) && (t.flags & 4 && (t.flags &= -2), xt(
|
|
1121
|
+
t,
|
|
1122
|
+
t.i,
|
|
1123
|
+
t.i ? 15 : 14
|
|
1124
|
+
), t.flags & 4 || (t.flags &= -2));
|
|
1125
|
+
}
|
|
1126
|
+
} finally {
|
|
1127
|
+
for (; _e < Q.length; _e++) {
|
|
1128
|
+
const t = Q[_e];
|
|
1129
|
+
t && (t.flags &= -2);
|
|
1130
|
+
}
|
|
1131
|
+
_e = -1, Q.length = 0, Wn(), Ft = null, (Q.length || Je.length) && Bn();
|
|
1132
|
+
}
|
|
1133
|
+
}
|
|
1134
|
+
let be = null, qn = null;
|
|
1135
|
+
function Dt(e) {
|
|
1136
|
+
const t = be;
|
|
1137
|
+
return be = e, qn = e && e.type.__scopeId || null, t;
|
|
1138
|
+
}
|
|
1139
|
+
function vi(e, t = be, s) {
|
|
1140
|
+
if (!t || e._n)
|
|
1141
|
+
return e;
|
|
1142
|
+
const n = (...r) => {
|
|
1143
|
+
n._d && nn(-1);
|
|
1144
|
+
const i = Dt(t);
|
|
1145
|
+
let o;
|
|
1146
|
+
try {
|
|
1147
|
+
o = e(...r);
|
|
1148
|
+
} finally {
|
|
1149
|
+
Dt(i), n._d && nn(1);
|
|
1150
|
+
}
|
|
1151
|
+
return o;
|
|
1152
|
+
};
|
|
1153
|
+
return n._n = !0, n._c = !0, n._d = !0, n;
|
|
1154
|
+
}
|
|
1155
|
+
function $e(e, t, s, n) {
|
|
1156
|
+
const r = e.dirs, i = t && t.dirs;
|
|
1157
|
+
for (let o = 0; o < r.length; o++) {
|
|
1158
|
+
const f = r[o];
|
|
1159
|
+
i && (f.oldValue = i[o].value);
|
|
1160
|
+
let u = f.dir[n];
|
|
1161
|
+
u && (Ee(), ye(u, s, 8, [
|
|
1162
|
+
e.el,
|
|
1163
|
+
f,
|
|
1164
|
+
e,
|
|
1165
|
+
t
|
|
1166
|
+
]), Oe());
|
|
1167
|
+
}
|
|
1168
|
+
}
|
|
1169
|
+
const yi = Symbol("_vte"), wi = (e) => e.__isTeleport;
|
|
1170
|
+
function Fs(e, t) {
|
|
1171
|
+
e.shapeFlag & 6 && e.component ? (e.transition = t, Fs(e.component.subTree, t)) : e.shapeFlag & 128 ? (e.ssContent.transition = t.clone(e.ssContent), e.ssFallback.transition = t.clone(e.ssFallback)) : e.transition = t;
|
|
1172
|
+
}
|
|
1173
|
+
function Gn(e) {
|
|
1174
|
+
e.ids = [e.ids[0] + e.ids[2]++ + "-", 0, 0];
|
|
1175
|
+
}
|
|
1176
|
+
function dt(e, t, s, n, r = !1) {
|
|
1177
|
+
if (A(e)) {
|
|
1178
|
+
e.forEach(
|
|
1179
|
+
(F, M) => dt(
|
|
1180
|
+
F,
|
|
1181
|
+
t && (A(t) ? t[M] : t),
|
|
1182
|
+
s,
|
|
1183
|
+
n,
|
|
1184
|
+
r
|
|
1185
|
+
)
|
|
1186
|
+
);
|
|
1187
|
+
return;
|
|
1188
|
+
}
|
|
1189
|
+
if (ht(n) && !r) {
|
|
1190
|
+
n.shapeFlag & 512 && n.type.__asyncResolved && n.component.subTree.component && dt(e, t, s, n.component.subTree);
|
|
1191
|
+
return;
|
|
1192
|
+
}
|
|
1193
|
+
const i = n.shapeFlag & 4 ? Ls(n.component) : n.el, o = r ? null : i, { i: f, r: u } = e, h = t && t.r, a = f.refs === V ? f.refs = {} : f.refs, p = f.setupState, S = j(p), T = p === V ? () => !1 : (F) => D(S, F);
|
|
1194
|
+
if (h != null && h !== u && (J(h) ? (a[h] = null, T(h) && (p[h] = null)) : ee(h) && (h.value = null)), I(u))
|
|
1195
|
+
xt(u, f, 12, [o, a]);
|
|
1196
|
+
else {
|
|
1197
|
+
const F = J(u), M = ee(u);
|
|
1198
|
+
if (F || M) {
|
|
1199
|
+
const Y = () => {
|
|
1200
|
+
if (e.f) {
|
|
1201
|
+
const N = F ? T(u) ? p[u] : a[u] : u.value;
|
|
1202
|
+
r ? A(N) && vs(N, i) : A(N) ? N.includes(i) || N.push(i) : F ? (a[u] = [i], T(u) && (p[u] = a[u])) : (u.value = [i], e.k && (a[e.k] = u.value));
|
|
1203
|
+
} else F ? (a[u] = o, T(u) && (p[u] = o)) : M && (u.value = o, e.k && (a[e.k] = o));
|
|
1204
|
+
};
|
|
1205
|
+
o ? (Y.id = -1, oe(Y, s)) : Y();
|
|
1206
|
+
}
|
|
1207
|
+
}
|
|
1208
|
+
}
|
|
1209
|
+
Vt().requestIdleCallback;
|
|
1210
|
+
Vt().cancelIdleCallback;
|
|
1211
|
+
const ht = (e) => !!e.type.__asyncLoader, Jn = (e) => e.type.__isKeepAlive;
|
|
1212
|
+
function Si(e, t) {
|
|
1213
|
+
Yn(e, "a", t);
|
|
1214
|
+
}
|
|
1215
|
+
function Ti(e, t) {
|
|
1216
|
+
Yn(e, "da", t);
|
|
1217
|
+
}
|
|
1218
|
+
function Yn(e, t, s = k) {
|
|
1219
|
+
const n = e.__wdc || (e.__wdc = () => {
|
|
1220
|
+
let r = s;
|
|
1221
|
+
for (; r; ) {
|
|
1222
|
+
if (r.isDeactivated)
|
|
1223
|
+
return;
|
|
1224
|
+
r = r.parent;
|
|
1225
|
+
}
|
|
1226
|
+
return e();
|
|
1227
|
+
});
|
|
1228
|
+
if (Wt(t, n, s), s) {
|
|
1229
|
+
let r = s.parent;
|
|
1230
|
+
for (; r && r.parent; )
|
|
1231
|
+
Jn(r.parent.vnode) && Ci(n, t, s, r), r = r.parent;
|
|
1232
|
+
}
|
|
1233
|
+
}
|
|
1234
|
+
function Ci(e, t, s, n) {
|
|
1235
|
+
const r = Wt(
|
|
1236
|
+
t,
|
|
1237
|
+
e,
|
|
1238
|
+
n,
|
|
1239
|
+
!0
|
|
1240
|
+
/* prepend */
|
|
1241
|
+
);
|
|
1242
|
+
zn(() => {
|
|
1243
|
+
vs(n[t], r);
|
|
1244
|
+
}, s);
|
|
1245
|
+
}
|
|
1246
|
+
function Wt(e, t, s = k, n = !1) {
|
|
1247
|
+
if (s) {
|
|
1248
|
+
const r = s[e] || (s[e] = []), i = t.__weh || (t.__weh = (...o) => {
|
|
1249
|
+
Ee();
|
|
1250
|
+
const f = vt(s), u = ye(t, s, e, o);
|
|
1251
|
+
return f(), Oe(), u;
|
|
1252
|
+
});
|
|
1253
|
+
return n ? r.unshift(i) : r.push(i), i;
|
|
1254
|
+
}
|
|
1255
|
+
}
|
|
1256
|
+
const Pe = (e) => (t, s = k) => {
|
|
1257
|
+
(!bt || e === "sp") && Wt(e, (...n) => t(...n), s);
|
|
1258
|
+
}, Ei = Pe("bm"), Oi = Pe("m"), Pi = Pe(
|
|
1259
|
+
"bu"
|
|
1260
|
+
), Ai = Pe("u"), Ii = Pe(
|
|
1261
|
+
"bum"
|
|
1262
|
+
), zn = Pe("um"), Ri = Pe(
|
|
1263
|
+
"sp"
|
|
1264
|
+
), Mi = Pe("rtg"), Fi = Pe("rtc");
|
|
1265
|
+
function Di(e, t = k) {
|
|
1266
|
+
Wt("ec", e, t);
|
|
1267
|
+
}
|
|
1268
|
+
const Hi = Symbol.for("v-ndc"), as = (e) => e ? pr(e) ? Ls(e) : as(e.parent) : null, pt = (
|
|
1269
|
+
// Move PURE marker to new line to workaround compiler discarding it
|
|
1270
|
+
// due to type annotation
|
|
1271
|
+
/* @__PURE__ */ te(/* @__PURE__ */ Object.create(null), {
|
|
1272
|
+
$: (e) => e,
|
|
1273
|
+
$el: (e) => e.vnode.el,
|
|
1274
|
+
$data: (e) => e.data,
|
|
1275
|
+
$props: (e) => e.props,
|
|
1276
|
+
$attrs: (e) => e.attrs,
|
|
1277
|
+
$slots: (e) => e.slots,
|
|
1278
|
+
$refs: (e) => e.refs,
|
|
1279
|
+
$parent: (e) => as(e.parent),
|
|
1280
|
+
$root: (e) => as(e.root),
|
|
1281
|
+
$host: (e) => e.ce,
|
|
1282
|
+
$emit: (e) => e.emit,
|
|
1283
|
+
$options: (e) => Zn(e),
|
|
1284
|
+
$forceUpdate: (e) => e.f || (e.f = () => {
|
|
1285
|
+
Ms(e.update);
|
|
1286
|
+
}),
|
|
1287
|
+
$nextTick: (e) => e.n || (e.n = mi.bind(e.proxy)),
|
|
1288
|
+
$watch: (e) => no.bind(e)
|
|
1289
|
+
})
|
|
1290
|
+
), kt = (e, t) => e !== V && !e.__isScriptSetup && D(e, t), ji = {
|
|
1291
|
+
get({ _: e }, t) {
|
|
1292
|
+
if (t === "__v_skip")
|
|
1293
|
+
return !0;
|
|
1294
|
+
const { ctx: s, setupState: n, data: r, props: i, accessCache: o, type: f, appContext: u } = e;
|
|
1295
|
+
let h;
|
|
1296
|
+
if (t[0] !== "$") {
|
|
1297
|
+
const T = o[t];
|
|
1298
|
+
if (T !== void 0)
|
|
1299
|
+
switch (T) {
|
|
1300
|
+
case 1:
|
|
1301
|
+
return n[t];
|
|
1302
|
+
case 2:
|
|
1303
|
+
return r[t];
|
|
1304
|
+
case 4:
|
|
1305
|
+
return s[t];
|
|
1306
|
+
case 3:
|
|
1307
|
+
return i[t];
|
|
1308
|
+
}
|
|
1309
|
+
else {
|
|
1310
|
+
if (kt(n, t))
|
|
1311
|
+
return o[t] = 1, n[t];
|
|
1312
|
+
if (r !== V && D(r, t))
|
|
1313
|
+
return o[t] = 2, r[t];
|
|
1314
|
+
if (
|
|
1315
|
+
// only cache other properties when instance has declared (thus stable)
|
|
1316
|
+
// props
|
|
1317
|
+
(h = e.propsOptions[0]) && D(h, t)
|
|
1318
|
+
)
|
|
1319
|
+
return o[t] = 3, i[t];
|
|
1320
|
+
if (s !== V && D(s, t))
|
|
1321
|
+
return o[t] = 4, s[t];
|
|
1322
|
+
ds && (o[t] = 0);
|
|
1323
|
+
}
|
|
1324
|
+
}
|
|
1325
|
+
const a = pt[t];
|
|
1326
|
+
let p, S;
|
|
1327
|
+
if (a)
|
|
1328
|
+
return t === "$attrs" && z(e.attrs, "get", ""), a(e);
|
|
1329
|
+
if (
|
|
1330
|
+
// css module (injected by vue-loader)
|
|
1331
|
+
(p = f.__cssModules) && (p = p[t])
|
|
1332
|
+
)
|
|
1333
|
+
return p;
|
|
1334
|
+
if (s !== V && D(s, t))
|
|
1335
|
+
return o[t] = 4, s[t];
|
|
1336
|
+
if (
|
|
1337
|
+
// global properties
|
|
1338
|
+
S = u.config.globalProperties, D(S, t)
|
|
1339
|
+
)
|
|
1340
|
+
return S[t];
|
|
1341
|
+
},
|
|
1342
|
+
set({ _: e }, t, s) {
|
|
1343
|
+
const { data: n, setupState: r, ctx: i } = e;
|
|
1344
|
+
return kt(r, t) ? (r[t] = s, !0) : n !== V && D(n, t) ? (n[t] = s, !0) : D(e.props, t) || t[0] === "$" && t.slice(1) in e ? !1 : (i[t] = s, !0);
|
|
1345
|
+
},
|
|
1346
|
+
has({
|
|
1347
|
+
_: { data: e, setupState: t, accessCache: s, ctx: n, appContext: r, propsOptions: i }
|
|
1348
|
+
}, o) {
|
|
1349
|
+
let f;
|
|
1350
|
+
return !!s[o] || e !== V && D(e, o) || kt(t, o) || (f = i[0]) && D(f, o) || D(n, o) || D(pt, o) || D(r.config.globalProperties, o);
|
|
1351
|
+
},
|
|
1352
|
+
defineProperty(e, t, s) {
|
|
1353
|
+
return s.get != null ? e._.accessCache[t] = 0 : D(s, "value") && this.set(e, t, s.value, null), Reflect.defineProperty(e, t, s);
|
|
1354
|
+
}
|
|
1355
|
+
};
|
|
1356
|
+
function zs(e) {
|
|
1357
|
+
return A(e) ? e.reduce(
|
|
1358
|
+
(t, s) => (t[s] = null, t),
|
|
1359
|
+
{}
|
|
1360
|
+
) : e;
|
|
1361
|
+
}
|
|
1362
|
+
let ds = !0;
|
|
1363
|
+
function Ni(e) {
|
|
1364
|
+
const t = Zn(e), s = e.proxy, n = e.ctx;
|
|
1365
|
+
ds = !1, t.beforeCreate && Xs(t.beforeCreate, e, "bc");
|
|
1366
|
+
const {
|
|
1367
|
+
// state
|
|
1368
|
+
data: r,
|
|
1369
|
+
computed: i,
|
|
1370
|
+
methods: o,
|
|
1371
|
+
watch: f,
|
|
1372
|
+
provide: u,
|
|
1373
|
+
inject: h,
|
|
1374
|
+
// lifecycle
|
|
1375
|
+
created: a,
|
|
1376
|
+
beforeMount: p,
|
|
1377
|
+
mounted: S,
|
|
1378
|
+
beforeUpdate: T,
|
|
1379
|
+
updated: F,
|
|
1380
|
+
activated: M,
|
|
1381
|
+
deactivated: Y,
|
|
1382
|
+
beforeDestroy: N,
|
|
1383
|
+
beforeUnmount: W,
|
|
1384
|
+
destroyed: B,
|
|
1385
|
+
unmounted: O,
|
|
1386
|
+
render: G,
|
|
1387
|
+
renderTracked: Ae,
|
|
1388
|
+
renderTriggered: ue,
|
|
1389
|
+
errorCaptured: Ie,
|
|
1390
|
+
serverPrefetch: yt,
|
|
1391
|
+
// public API
|
|
1392
|
+
expose: je,
|
|
1393
|
+
inheritAttrs: ke,
|
|
1394
|
+
// assets
|
|
1395
|
+
components: wt,
|
|
1396
|
+
directives: St,
|
|
1397
|
+
filters: Gt
|
|
1398
|
+
} = t;
|
|
1399
|
+
if (h && Li(h, n, null), o)
|
|
1400
|
+
for (const K in o) {
|
|
1401
|
+
const L = o[K];
|
|
1402
|
+
I(L) && (n[K] = L.bind(s));
|
|
1403
|
+
}
|
|
1404
|
+
if (r) {
|
|
1405
|
+
const K = r.call(s, s);
|
|
1406
|
+
q(K) && (e.data = As(K));
|
|
1407
|
+
}
|
|
1408
|
+
if (ds = !0, i)
|
|
1409
|
+
for (const K in i) {
|
|
1410
|
+
const L = i[K], Ne = I(L) ? L.bind(s, s) : I(L.get) ? L.get.bind(s, s) : xe, Tt = !I(L) && I(L.set) ? L.set.bind(s) : xe, Le = Co({
|
|
1411
|
+
get: Ne,
|
|
1412
|
+
set: Tt
|
|
1413
|
+
});
|
|
1414
|
+
Object.defineProperty(n, K, {
|
|
1415
|
+
enumerable: !0,
|
|
1416
|
+
configurable: !0,
|
|
1417
|
+
get: () => Le.value,
|
|
1418
|
+
set: (ae) => Le.value = ae
|
|
1419
|
+
});
|
|
1420
|
+
}
|
|
1421
|
+
if (f)
|
|
1422
|
+
for (const K in f)
|
|
1423
|
+
Xn(f[K], n, s, K);
|
|
1424
|
+
if (u) {
|
|
1425
|
+
const K = I(u) ? u.call(s) : u;
|
|
1426
|
+
Reflect.ownKeys(K).forEach((L) => {
|
|
1427
|
+
Bi(L, K[L]);
|
|
1428
|
+
});
|
|
1429
|
+
}
|
|
1430
|
+
a && Xs(a, e, "c");
|
|
1431
|
+
function X(K, L) {
|
|
1432
|
+
A(L) ? L.forEach((Ne) => K(Ne.bind(s))) : L && K(L.bind(s));
|
|
1433
|
+
}
|
|
1434
|
+
if (X(Ei, p), X(Oi, S), X(Pi, T), X(Ai, F), X(Si, M), X(Ti, Y), X(Di, Ie), X(Fi, Ae), X(Mi, ue), X(Ii, W), X(zn, O), X(Ri, yt), A(je))
|
|
1435
|
+
if (je.length) {
|
|
1436
|
+
const K = e.exposed || (e.exposed = {});
|
|
1437
|
+
je.forEach((L) => {
|
|
1438
|
+
Object.defineProperty(K, L, {
|
|
1439
|
+
get: () => s[L],
|
|
1440
|
+
set: (Ne) => s[L] = Ne
|
|
1441
|
+
});
|
|
1442
|
+
});
|
|
1443
|
+
} else e.exposed || (e.exposed = {});
|
|
1444
|
+
G && e.render === xe && (e.render = G), ke != null && (e.inheritAttrs = ke), wt && (e.components = wt), St && (e.directives = St), yt && Gn(e);
|
|
1445
|
+
}
|
|
1446
|
+
function Li(e, t, s = xe) {
|
|
1447
|
+
A(e) && (e = hs(e));
|
|
1448
|
+
for (const n in e) {
|
|
1449
|
+
const r = e[n];
|
|
1450
|
+
let i;
|
|
1451
|
+
q(r) ? "default" in r ? i = At(
|
|
1452
|
+
r.from || n,
|
|
1453
|
+
r.default,
|
|
1454
|
+
!0
|
|
1455
|
+
) : i = At(r.from || n) : i = At(r), ee(i) ? Object.defineProperty(t, n, {
|
|
1456
|
+
enumerable: !0,
|
|
1457
|
+
configurable: !0,
|
|
1458
|
+
get: () => i.value,
|
|
1459
|
+
set: (o) => i.value = o
|
|
1460
|
+
}) : t[n] = i;
|
|
1461
|
+
}
|
|
1462
|
+
}
|
|
1463
|
+
function Xs(e, t, s) {
|
|
1464
|
+
ye(
|
|
1465
|
+
A(e) ? e.map((n) => n.bind(t.proxy)) : e.bind(t.proxy),
|
|
1466
|
+
t,
|
|
1467
|
+
s
|
|
1468
|
+
);
|
|
1469
|
+
}
|
|
1470
|
+
function Xn(e, t, s, n) {
|
|
1471
|
+
let r = n.includes(".") ? ur(s, n) : () => s[n];
|
|
1472
|
+
if (J(e)) {
|
|
1473
|
+
const i = t[e];
|
|
1474
|
+
I(i) && ts(r, i);
|
|
1475
|
+
} else if (I(e))
|
|
1476
|
+
ts(r, e.bind(s));
|
|
1477
|
+
else if (q(e))
|
|
1478
|
+
if (A(e))
|
|
1479
|
+
e.forEach((i) => Xn(i, t, s, n));
|
|
1480
|
+
else {
|
|
1481
|
+
const i = I(e.handler) ? e.handler.bind(s) : t[e.handler];
|
|
1482
|
+
I(i) && ts(r, i, e);
|
|
1483
|
+
}
|
|
1484
|
+
}
|
|
1485
|
+
function Zn(e) {
|
|
1486
|
+
const t = e.type, { mixins: s, extends: n } = t, {
|
|
1487
|
+
mixins: r,
|
|
1488
|
+
optionsCache: i,
|
|
1489
|
+
config: { optionMergeStrategies: o }
|
|
1490
|
+
} = e.appContext, f = i.get(t);
|
|
1491
|
+
let u;
|
|
1492
|
+
return f ? u = f : !r.length && !s && !n ? u = t : (u = {}, r.length && r.forEach(
|
|
1493
|
+
(h) => Ht(u, h, o, !0)
|
|
1494
|
+
), Ht(u, t, o)), q(t) && i.set(t, u), u;
|
|
1495
|
+
}
|
|
1496
|
+
function Ht(e, t, s, n = !1) {
|
|
1497
|
+
const { mixins: r, extends: i } = t;
|
|
1498
|
+
i && Ht(e, i, s, !0), r && r.forEach(
|
|
1499
|
+
(o) => Ht(e, o, s, !0)
|
|
1500
|
+
);
|
|
1501
|
+
for (const o in t)
|
|
1502
|
+
if (!(n && o === "expose")) {
|
|
1503
|
+
const f = $i[o] || s && s[o];
|
|
1504
|
+
e[o] = f ? f(e[o], t[o]) : t[o];
|
|
1505
|
+
}
|
|
1506
|
+
return e;
|
|
1507
|
+
}
|
|
1508
|
+
const $i = {
|
|
1509
|
+
data: Zs,
|
|
1510
|
+
props: Qs,
|
|
1511
|
+
emits: Qs,
|
|
1512
|
+
// objects
|
|
1513
|
+
methods: it,
|
|
1514
|
+
computed: it,
|
|
1515
|
+
// lifecycle
|
|
1516
|
+
beforeCreate: Z,
|
|
1517
|
+
created: Z,
|
|
1518
|
+
beforeMount: Z,
|
|
1519
|
+
mounted: Z,
|
|
1520
|
+
beforeUpdate: Z,
|
|
1521
|
+
updated: Z,
|
|
1522
|
+
beforeDestroy: Z,
|
|
1523
|
+
beforeUnmount: Z,
|
|
1524
|
+
destroyed: Z,
|
|
1525
|
+
unmounted: Z,
|
|
1526
|
+
activated: Z,
|
|
1527
|
+
deactivated: Z,
|
|
1528
|
+
errorCaptured: Z,
|
|
1529
|
+
serverPrefetch: Z,
|
|
1530
|
+
// assets
|
|
1531
|
+
components: it,
|
|
1532
|
+
directives: it,
|
|
1533
|
+
// watch
|
|
1534
|
+
watch: Vi,
|
|
1535
|
+
// provide / inject
|
|
1536
|
+
provide: Zs,
|
|
1537
|
+
inject: Ui
|
|
1538
|
+
};
|
|
1539
|
+
function Zs(e, t) {
|
|
1540
|
+
return t ? e ? function() {
|
|
1541
|
+
return te(
|
|
1542
|
+
I(e) ? e.call(this, this) : e,
|
|
1543
|
+
I(t) ? t.call(this, this) : t
|
|
1544
|
+
);
|
|
1545
|
+
} : t : e;
|
|
1546
|
+
}
|
|
1547
|
+
function Ui(e, t) {
|
|
1548
|
+
return it(hs(e), hs(t));
|
|
1549
|
+
}
|
|
1550
|
+
function hs(e) {
|
|
1551
|
+
if (A(e)) {
|
|
1552
|
+
const t = {};
|
|
1553
|
+
for (let s = 0; s < e.length; s++)
|
|
1554
|
+
t[e[s]] = e[s];
|
|
1555
|
+
return t;
|
|
1556
|
+
}
|
|
1557
|
+
return e;
|
|
1558
|
+
}
|
|
1559
|
+
function Z(e, t) {
|
|
1560
|
+
return e ? [...new Set([].concat(e, t))] : t;
|
|
1561
|
+
}
|
|
1562
|
+
function it(e, t) {
|
|
1563
|
+
return e ? te(/* @__PURE__ */ Object.create(null), e, t) : t;
|
|
1564
|
+
}
|
|
1565
|
+
function Qs(e, t) {
|
|
1566
|
+
return e ? A(e) && A(t) ? [.../* @__PURE__ */ new Set([...e, ...t])] : te(
|
|
1567
|
+
/* @__PURE__ */ Object.create(null),
|
|
1568
|
+
zs(e),
|
|
1569
|
+
zs(t != null ? t : {})
|
|
1570
|
+
) : t;
|
|
1571
|
+
}
|
|
1572
|
+
function Vi(e, t) {
|
|
1573
|
+
if (!e) return t;
|
|
1574
|
+
if (!t) return e;
|
|
1575
|
+
const s = te(/* @__PURE__ */ Object.create(null), e);
|
|
1576
|
+
for (const n in t)
|
|
1577
|
+
s[n] = Z(e[n], t[n]);
|
|
1578
|
+
return s;
|
|
1579
|
+
}
|
|
1580
|
+
function Qn() {
|
|
1581
|
+
return {
|
|
1582
|
+
app: null,
|
|
1583
|
+
config: {
|
|
1584
|
+
isNativeTag: Or,
|
|
1585
|
+
performance: !1,
|
|
1586
|
+
globalProperties: {},
|
|
1587
|
+
optionMergeStrategies: {},
|
|
1588
|
+
errorHandler: void 0,
|
|
1589
|
+
warnHandler: void 0,
|
|
1590
|
+
compilerOptions: {}
|
|
1591
|
+
},
|
|
1592
|
+
mixins: [],
|
|
1593
|
+
components: {},
|
|
1594
|
+
directives: {},
|
|
1595
|
+
provides: /* @__PURE__ */ Object.create(null),
|
|
1596
|
+
optionsCache: /* @__PURE__ */ new WeakMap(),
|
|
1597
|
+
propsCache: /* @__PURE__ */ new WeakMap(),
|
|
1598
|
+
emitsCache: /* @__PURE__ */ new WeakMap()
|
|
1599
|
+
};
|
|
1600
|
+
}
|
|
1601
|
+
let Ki = 0;
|
|
1602
|
+
function Wi(e, t) {
|
|
1603
|
+
return function(n, r = null) {
|
|
1604
|
+
I(n) || (n = te({}, n)), r != null && !q(r) && (r = null);
|
|
1605
|
+
const i = Qn(), o = /* @__PURE__ */ new WeakSet(), f = [];
|
|
1606
|
+
let u = !1;
|
|
1607
|
+
const h = i.app = {
|
|
1608
|
+
_uid: Ki++,
|
|
1609
|
+
_component: n,
|
|
1610
|
+
_props: r,
|
|
1611
|
+
_container: null,
|
|
1612
|
+
_context: i,
|
|
1613
|
+
_instance: null,
|
|
1614
|
+
version: Oo,
|
|
1615
|
+
get config() {
|
|
1616
|
+
return i.config;
|
|
1617
|
+
},
|
|
1618
|
+
set config(a) {
|
|
1619
|
+
},
|
|
1620
|
+
use(a, ...p) {
|
|
1621
|
+
return o.has(a) || (a && I(a.install) ? (o.add(a), a.install(h, ...p)) : I(a) && (o.add(a), a(h, ...p))), h;
|
|
1622
|
+
},
|
|
1623
|
+
mixin(a) {
|
|
1624
|
+
return i.mixins.includes(a) || i.mixins.push(a), h;
|
|
1625
|
+
},
|
|
1626
|
+
component(a, p) {
|
|
1627
|
+
return p ? (i.components[a] = p, h) : i.components[a];
|
|
1628
|
+
},
|
|
1629
|
+
directive(a, p) {
|
|
1630
|
+
return p ? (i.directives[a] = p, h) : i.directives[a];
|
|
1631
|
+
},
|
|
1632
|
+
mount(a, p, S) {
|
|
1633
|
+
if (!u) {
|
|
1634
|
+
const T = h._ceVNode || fe(n, r);
|
|
1635
|
+
return T.appContext = i, S === !0 ? S = "svg" : S === !1 && (S = void 0), e(T, a, S), u = !0, h._container = a, a.__vue_app__ = h, Ls(T.component);
|
|
1636
|
+
}
|
|
1637
|
+
},
|
|
1638
|
+
onUnmount(a) {
|
|
1639
|
+
f.push(a);
|
|
1640
|
+
},
|
|
1641
|
+
unmount() {
|
|
1642
|
+
u && (ye(
|
|
1643
|
+
f,
|
|
1644
|
+
h._instance,
|
|
1645
|
+
16
|
|
1646
|
+
), e(null, h._container), delete h._container.__vue_app__);
|
|
1647
|
+
},
|
|
1648
|
+
provide(a, p) {
|
|
1649
|
+
return i.provides[a] = p, h;
|
|
1650
|
+
},
|
|
1651
|
+
runWithContext(a) {
|
|
1652
|
+
const p = Ye;
|
|
1653
|
+
Ye = h;
|
|
1654
|
+
try {
|
|
1655
|
+
return a();
|
|
1656
|
+
} finally {
|
|
1657
|
+
Ye = p;
|
|
1658
|
+
}
|
|
1659
|
+
}
|
|
1660
|
+
};
|
|
1661
|
+
return h;
|
|
1662
|
+
};
|
|
1663
|
+
}
|
|
1664
|
+
let Ye = null;
|
|
1665
|
+
function Bi(e, t) {
|
|
1666
|
+
if (k) {
|
|
1667
|
+
let s = k.provides;
|
|
1668
|
+
const n = k.parent && k.parent.provides;
|
|
1669
|
+
n === s && (s = k.provides = Object.create(n)), s[e] = t;
|
|
1670
|
+
}
|
|
1671
|
+
}
|
|
1672
|
+
function At(e, t, s = !1) {
|
|
1673
|
+
const n = k || be;
|
|
1674
|
+
if (n || Ye) {
|
|
1675
|
+
let r = Ye ? Ye._context.provides : n ? n.parent == null || n.ce ? n.vnode.appContext && n.vnode.appContext.provides : n.parent.provides : void 0;
|
|
1676
|
+
if (r && e in r)
|
|
1677
|
+
return r[e];
|
|
1678
|
+
if (arguments.length > 1)
|
|
1679
|
+
return s && I(t) ? t.call(n && n.proxy) : t;
|
|
1680
|
+
}
|
|
1681
|
+
}
|
|
1682
|
+
const kn = {}, er = () => Object.create(kn), tr = (e) => Object.getPrototypeOf(e) === kn;
|
|
1683
|
+
function qi(e, t, s, n = !1) {
|
|
1684
|
+
const r = {}, i = er();
|
|
1685
|
+
e.propsDefaults = /* @__PURE__ */ Object.create(null), sr(e, t, r, i);
|
|
1686
|
+
for (const o in e.propsOptions[0])
|
|
1687
|
+
o in r || (r[o] = void 0);
|
|
1688
|
+
s ? e.props = n ? r : fi(r) : e.type.props ? e.props = r : e.props = i, e.attrs = i;
|
|
1689
|
+
}
|
|
1690
|
+
function Gi(e, t, s, n) {
|
|
1691
|
+
const {
|
|
1692
|
+
props: r,
|
|
1693
|
+
attrs: i,
|
|
1694
|
+
vnode: { patchFlag: o }
|
|
1695
|
+
} = e, f = j(r), [u] = e.propsOptions;
|
|
1696
|
+
let h = !1;
|
|
1697
|
+
if (
|
|
1698
|
+
// always force full diff in dev
|
|
1699
|
+
// - #1942 if hmr is enabled with sfc component
|
|
1700
|
+
// - vite#872 non-sfc component used by sfc component
|
|
1701
|
+
(n || o > 0) && !(o & 16)
|
|
1702
|
+
) {
|
|
1703
|
+
if (o & 8) {
|
|
1704
|
+
const a = e.vnode.dynamicProps;
|
|
1705
|
+
for (let p = 0; p < a.length; p++) {
|
|
1706
|
+
let S = a[p];
|
|
1707
|
+
if (Bt(e.emitsOptions, S))
|
|
1708
|
+
continue;
|
|
1709
|
+
const T = t[S];
|
|
1710
|
+
if (u)
|
|
1711
|
+
if (D(i, S))
|
|
1712
|
+
T !== i[S] && (i[S] = T, h = !0);
|
|
1713
|
+
else {
|
|
1714
|
+
const F = He(S);
|
|
1715
|
+
r[F] = ps(
|
|
1716
|
+
u,
|
|
1717
|
+
f,
|
|
1718
|
+
F,
|
|
1719
|
+
T,
|
|
1720
|
+
e,
|
|
1721
|
+
!1
|
|
1722
|
+
);
|
|
1723
|
+
}
|
|
1724
|
+
else
|
|
1725
|
+
T !== i[S] && (i[S] = T, h = !0);
|
|
1726
|
+
}
|
|
1727
|
+
}
|
|
1728
|
+
} else {
|
|
1729
|
+
sr(e, t, r, i) && (h = !0);
|
|
1730
|
+
let a;
|
|
1731
|
+
for (const p in f)
|
|
1732
|
+
(!t || // for camelCase
|
|
1733
|
+
!D(t, p) && // it's possible the original props was passed in as kebab-case
|
|
1734
|
+
// and converted to camelCase (#955)
|
|
1735
|
+
((a = Be(p)) === p || !D(t, a))) && (u ? s && // for camelCase
|
|
1736
|
+
(s[p] !== void 0 || // for kebab-case
|
|
1737
|
+
s[a] !== void 0) && (r[p] = ps(
|
|
1738
|
+
u,
|
|
1739
|
+
f,
|
|
1740
|
+
p,
|
|
1741
|
+
void 0,
|
|
1742
|
+
e,
|
|
1743
|
+
!0
|
|
1744
|
+
)) : delete r[p]);
|
|
1745
|
+
if (i !== f)
|
|
1746
|
+
for (const p in i)
|
|
1747
|
+
(!t || !D(t, p)) && (delete i[p], h = !0);
|
|
1748
|
+
}
|
|
1749
|
+
h && Ce(e.attrs, "set", "");
|
|
1750
|
+
}
|
|
1751
|
+
function sr(e, t, s, n) {
|
|
1752
|
+
const [r, i] = e.propsOptions;
|
|
1753
|
+
let o = !1, f;
|
|
1754
|
+
if (t)
|
|
1755
|
+
for (let u in t) {
|
|
1756
|
+
if (ft(u))
|
|
1757
|
+
continue;
|
|
1758
|
+
const h = t[u];
|
|
1759
|
+
let a;
|
|
1760
|
+
r && D(r, a = He(u)) ? !i || !i.includes(a) ? s[a] = h : (f || (f = {}))[a] = h : Bt(e.emitsOptions, u) || (!(u in n) || h !== n[u]) && (n[u] = h, o = !0);
|
|
1761
|
+
}
|
|
1762
|
+
if (i) {
|
|
1763
|
+
const u = j(s), h = f || V;
|
|
1764
|
+
for (let a = 0; a < i.length; a++) {
|
|
1765
|
+
const p = i[a];
|
|
1766
|
+
s[p] = ps(
|
|
1767
|
+
r,
|
|
1768
|
+
u,
|
|
1769
|
+
p,
|
|
1770
|
+
h[p],
|
|
1771
|
+
e,
|
|
1772
|
+
!D(h, p)
|
|
1773
|
+
);
|
|
1774
|
+
}
|
|
1775
|
+
}
|
|
1776
|
+
return o;
|
|
1777
|
+
}
|
|
1778
|
+
function ps(e, t, s, n, r, i) {
|
|
1779
|
+
const o = e[s];
|
|
1780
|
+
if (o != null) {
|
|
1781
|
+
const f = D(o, "default");
|
|
1782
|
+
if (f && n === void 0) {
|
|
1783
|
+
const u = o.default;
|
|
1784
|
+
if (o.type !== Function && !o.skipFactory && I(u)) {
|
|
1785
|
+
const { propsDefaults: h } = r;
|
|
1786
|
+
if (s in h)
|
|
1787
|
+
n = h[s];
|
|
1788
|
+
else {
|
|
1789
|
+
const a = vt(r);
|
|
1790
|
+
n = h[s] = u.call(
|
|
1791
|
+
null,
|
|
1792
|
+
t
|
|
1793
|
+
), a();
|
|
1794
|
+
}
|
|
1795
|
+
} else
|
|
1796
|
+
n = u;
|
|
1797
|
+
r.ce && r.ce._setProp(s, n);
|
|
1798
|
+
}
|
|
1799
|
+
o[
|
|
1800
|
+
0
|
|
1801
|
+
/* shouldCast */
|
|
1802
|
+
] && (i && !f ? n = !1 : o[
|
|
1803
|
+
1
|
|
1804
|
+
/* shouldCastTrue */
|
|
1805
|
+
] && (n === "" || n === Be(s)) && (n = !0));
|
|
1806
|
+
}
|
|
1807
|
+
return n;
|
|
1808
|
+
}
|
|
1809
|
+
const Ji = /* @__PURE__ */ new WeakMap();
|
|
1810
|
+
function nr(e, t, s = !1) {
|
|
1811
|
+
const n = s ? Ji : t.propsCache, r = n.get(e);
|
|
1812
|
+
if (r)
|
|
1813
|
+
return r;
|
|
1814
|
+
const i = e.props, o = {}, f = [];
|
|
1815
|
+
let u = !1;
|
|
1816
|
+
if (!I(e)) {
|
|
1817
|
+
const a = (p) => {
|
|
1818
|
+
u = !0;
|
|
1819
|
+
const [S, T] = nr(p, t, !0);
|
|
1820
|
+
te(o, S), T && f.push(...T);
|
|
1821
|
+
};
|
|
1822
|
+
!s && t.mixins.length && t.mixins.forEach(a), e.extends && a(e.extends), e.mixins && e.mixins.forEach(a);
|
|
1823
|
+
}
|
|
1824
|
+
if (!i && !u)
|
|
1825
|
+
return q(e) && n.set(e, ot), ot;
|
|
1826
|
+
if (A(i))
|
|
1827
|
+
for (let a = 0; a < i.length; a++) {
|
|
1828
|
+
const p = He(i[a]);
|
|
1829
|
+
ks(p) && (o[p] = V);
|
|
1830
|
+
}
|
|
1831
|
+
else if (i)
|
|
1832
|
+
for (const a in i) {
|
|
1833
|
+
const p = He(a);
|
|
1834
|
+
if (ks(p)) {
|
|
1835
|
+
const S = i[a], T = o[p] = A(S) || I(S) ? { type: S } : te({}, S), F = T.type;
|
|
1836
|
+
let M = !1, Y = !0;
|
|
1837
|
+
if (A(F))
|
|
1838
|
+
for (let N = 0; N < F.length; ++N) {
|
|
1839
|
+
const W = F[N], B = I(W) && W.name;
|
|
1840
|
+
if (B === "Boolean") {
|
|
1841
|
+
M = !0;
|
|
1842
|
+
break;
|
|
1843
|
+
} else B === "String" && (Y = !1);
|
|
1844
|
+
}
|
|
1845
|
+
else
|
|
1846
|
+
M = I(F) && F.name === "Boolean";
|
|
1847
|
+
T[
|
|
1848
|
+
0
|
|
1849
|
+
/* shouldCast */
|
|
1850
|
+
] = M, T[
|
|
1851
|
+
1
|
|
1852
|
+
/* shouldCastTrue */
|
|
1853
|
+
] = Y, (M || D(T, "default")) && f.push(p);
|
|
1854
|
+
}
|
|
1855
|
+
}
|
|
1856
|
+
const h = [o, f];
|
|
1857
|
+
return q(e) && n.set(e, h), h;
|
|
1858
|
+
}
|
|
1859
|
+
function ks(e) {
|
|
1860
|
+
return e[0] !== "$" && !ft(e);
|
|
1861
|
+
}
|
|
1862
|
+
const Ds = (e) => e[0] === "_" || e === "$stable", Hs = (e) => A(e) ? e.map(me) : [me(e)], Yi = (e, t, s) => {
|
|
1863
|
+
if (t._n)
|
|
1864
|
+
return t;
|
|
1865
|
+
const n = vi((...r) => Hs(t(...r)), s);
|
|
1866
|
+
return n._c = !1, n;
|
|
1867
|
+
}, rr = (e, t, s) => {
|
|
1868
|
+
const n = e._ctx;
|
|
1869
|
+
for (const r in e) {
|
|
1870
|
+
if (Ds(r)) continue;
|
|
1871
|
+
const i = e[r];
|
|
1872
|
+
if (I(i))
|
|
1873
|
+
t[r] = Yi(r, i, n);
|
|
1874
|
+
else if (i != null) {
|
|
1875
|
+
const o = Hs(i);
|
|
1876
|
+
t[r] = () => o;
|
|
1877
|
+
}
|
|
1878
|
+
}
|
|
1879
|
+
}, ir = (e, t) => {
|
|
1880
|
+
const s = Hs(t);
|
|
1881
|
+
e.slots.default = () => s;
|
|
1882
|
+
}, or = (e, t, s) => {
|
|
1883
|
+
for (const n in t)
|
|
1884
|
+
(s || !Ds(n)) && (e[n] = t[n]);
|
|
1885
|
+
}, zi = (e, t, s) => {
|
|
1886
|
+
const n = e.slots = er();
|
|
1887
|
+
if (e.vnode.shapeFlag & 32) {
|
|
1888
|
+
const r = t.__;
|
|
1889
|
+
r && is(n, "__", r, !0);
|
|
1890
|
+
const i = t._;
|
|
1891
|
+
i ? (or(n, t, s), s && is(n, "_", i, !0)) : rr(t, n);
|
|
1892
|
+
} else t && ir(e, t);
|
|
1893
|
+
}, Xi = (e, t, s) => {
|
|
1894
|
+
const { vnode: n, slots: r } = e;
|
|
1895
|
+
let i = !0, o = V;
|
|
1896
|
+
if (n.shapeFlag & 32) {
|
|
1897
|
+
const f = t._;
|
|
1898
|
+
f ? s && f === 1 ? i = !1 : or(r, t, s) : (i = !t.$stable, rr(t, r)), o = t;
|
|
1899
|
+
} else t && (ir(e, t), o = { default: 1 });
|
|
1900
|
+
if (i)
|
|
1901
|
+
for (const f in r)
|
|
1902
|
+
!Ds(f) && o[f] == null && delete r[f];
|
|
1903
|
+
}, oe = uo;
|
|
1904
|
+
function Zi(e) {
|
|
1905
|
+
return Qi(e);
|
|
1906
|
+
}
|
|
1907
|
+
function Qi(e, t) {
|
|
1908
|
+
const s = Vt();
|
|
1909
|
+
s.__VUE__ = !0;
|
|
1910
|
+
const {
|
|
1911
|
+
insert: n,
|
|
1912
|
+
remove: r,
|
|
1913
|
+
patchProp: i,
|
|
1914
|
+
createElement: o,
|
|
1915
|
+
createText: f,
|
|
1916
|
+
createComment: u,
|
|
1917
|
+
setText: h,
|
|
1918
|
+
setElementText: a,
|
|
1919
|
+
parentNode: p,
|
|
1920
|
+
nextSibling: S,
|
|
1921
|
+
setScopeId: T = xe,
|
|
1922
|
+
insertStaticContent: F
|
|
1923
|
+
} = e, M = (l, c, d, m = null, g = null, _ = null, y = void 0, v = null, x = !!c.dynamicChildren) => {
|
|
1924
|
+
if (l === c)
|
|
1925
|
+
return;
|
|
1926
|
+
l && !rt(l, c) && (m = Ct(l), ae(l, g, _, !0), l = null), c.patchFlag === -2 && (x = !1, c.dynamicChildren = null);
|
|
1927
|
+
const { type: b, ref: E, shapeFlag: w } = c;
|
|
1928
|
+
switch (b) {
|
|
1929
|
+
case qt:
|
|
1930
|
+
Y(l, c, d, m);
|
|
1931
|
+
break;
|
|
1932
|
+
case Xe:
|
|
1933
|
+
N(l, c, d, m);
|
|
1934
|
+
break;
|
|
1935
|
+
case ss:
|
|
1936
|
+
l == null && W(c, d, m, y);
|
|
1937
|
+
break;
|
|
1938
|
+
case Te:
|
|
1939
|
+
wt(
|
|
1940
|
+
l,
|
|
1941
|
+
c,
|
|
1942
|
+
d,
|
|
1943
|
+
m,
|
|
1944
|
+
g,
|
|
1945
|
+
_,
|
|
1946
|
+
y,
|
|
1947
|
+
v,
|
|
1948
|
+
x
|
|
1949
|
+
);
|
|
1950
|
+
break;
|
|
1951
|
+
default:
|
|
1952
|
+
w & 1 ? G(
|
|
1953
|
+
l,
|
|
1954
|
+
c,
|
|
1955
|
+
d,
|
|
1956
|
+
m,
|
|
1957
|
+
g,
|
|
1958
|
+
_,
|
|
1959
|
+
y,
|
|
1960
|
+
v,
|
|
1961
|
+
x
|
|
1962
|
+
) : w & 6 ? St(
|
|
1963
|
+
l,
|
|
1964
|
+
c,
|
|
1965
|
+
d,
|
|
1966
|
+
m,
|
|
1967
|
+
g,
|
|
1968
|
+
_,
|
|
1969
|
+
y,
|
|
1970
|
+
v,
|
|
1971
|
+
x
|
|
1972
|
+
) : (w & 64 || w & 128) && b.process(
|
|
1973
|
+
l,
|
|
1974
|
+
c,
|
|
1975
|
+
d,
|
|
1976
|
+
m,
|
|
1977
|
+
g,
|
|
1978
|
+
_,
|
|
1979
|
+
y,
|
|
1980
|
+
v,
|
|
1981
|
+
x,
|
|
1982
|
+
tt
|
|
1983
|
+
);
|
|
1984
|
+
}
|
|
1985
|
+
E != null && g ? dt(E, l && l.ref, _, c || l, !c) : E == null && l && l.ref != null && dt(l.ref, null, _, l, !0);
|
|
1986
|
+
}, Y = (l, c, d, m) => {
|
|
1987
|
+
if (l == null)
|
|
1988
|
+
n(
|
|
1989
|
+
c.el = f(c.children),
|
|
1990
|
+
d,
|
|
1991
|
+
m
|
|
1992
|
+
);
|
|
1993
|
+
else {
|
|
1994
|
+
const g = c.el = l.el;
|
|
1995
|
+
c.children !== l.children && h(g, c.children);
|
|
1996
|
+
}
|
|
1997
|
+
}, N = (l, c, d, m) => {
|
|
1998
|
+
l == null ? n(
|
|
1999
|
+
c.el = u(c.children || ""),
|
|
2000
|
+
d,
|
|
2001
|
+
m
|
|
2002
|
+
) : c.el = l.el;
|
|
2003
|
+
}, W = (l, c, d, m) => {
|
|
2004
|
+
[l.el, l.anchor] = F(
|
|
2005
|
+
l.children,
|
|
2006
|
+
c,
|
|
2007
|
+
d,
|
|
2008
|
+
m,
|
|
2009
|
+
l.el,
|
|
2010
|
+
l.anchor
|
|
2011
|
+
);
|
|
2012
|
+
}, B = ({ el: l, anchor: c }, d, m) => {
|
|
2013
|
+
let g;
|
|
2014
|
+
for (; l && l !== c; )
|
|
2015
|
+
g = S(l), n(l, d, m), l = g;
|
|
2016
|
+
n(c, d, m);
|
|
2017
|
+
}, O = ({ el: l, anchor: c }) => {
|
|
2018
|
+
let d;
|
|
2019
|
+
for (; l && l !== c; )
|
|
2020
|
+
d = S(l), r(l), l = d;
|
|
2021
|
+
r(c);
|
|
2022
|
+
}, G = (l, c, d, m, g, _, y, v, x) => {
|
|
2023
|
+
c.type === "svg" ? y = "svg" : c.type === "math" && (y = "mathml"), l == null ? Ae(
|
|
2024
|
+
c,
|
|
2025
|
+
d,
|
|
2026
|
+
m,
|
|
2027
|
+
g,
|
|
2028
|
+
_,
|
|
2029
|
+
y,
|
|
2030
|
+
v,
|
|
2031
|
+
x
|
|
2032
|
+
) : yt(
|
|
2033
|
+
l,
|
|
2034
|
+
c,
|
|
2035
|
+
g,
|
|
2036
|
+
_,
|
|
2037
|
+
y,
|
|
2038
|
+
v,
|
|
2039
|
+
x
|
|
2040
|
+
);
|
|
2041
|
+
}, Ae = (l, c, d, m, g, _, y, v) => {
|
|
2042
|
+
let x, b;
|
|
2043
|
+
const { props: E, shapeFlag: w, transition: C, dirs: P } = l;
|
|
2044
|
+
if (x = l.el = o(
|
|
2045
|
+
l.type,
|
|
2046
|
+
_,
|
|
2047
|
+
E && E.is,
|
|
2048
|
+
E
|
|
2049
|
+
), w & 8 ? a(x, l.children) : w & 16 && Ie(
|
|
2050
|
+
l.children,
|
|
2051
|
+
x,
|
|
2052
|
+
null,
|
|
2053
|
+
m,
|
|
2054
|
+
g,
|
|
2055
|
+
es(l, _),
|
|
2056
|
+
y,
|
|
2057
|
+
v
|
|
2058
|
+
), P && $e(l, null, m, "created"), ue(x, l, l.scopeId, y, m), E) {
|
|
2059
|
+
for (const $ in E)
|
|
2060
|
+
$ !== "value" && !ft($) && i(x, $, null, E[$], _, m);
|
|
2061
|
+
"value" in E && i(x, "value", null, E.value, _), (b = E.onVnodeBeforeMount) && ge(b, m, l);
|
|
2062
|
+
}
|
|
2063
|
+
P && $e(l, null, m, "beforeMount");
|
|
2064
|
+
const R = ki(g, C);
|
|
2065
|
+
R && C.beforeEnter(x), n(x, c, d), ((b = E && E.onVnodeMounted) || R || P) && oe(() => {
|
|
2066
|
+
b && ge(b, m, l), R && C.enter(x), P && $e(l, null, m, "mounted");
|
|
2067
|
+
}, g);
|
|
2068
|
+
}, ue = (l, c, d, m, g) => {
|
|
2069
|
+
if (d && T(l, d), m)
|
|
2070
|
+
for (let _ = 0; _ < m.length; _++)
|
|
2071
|
+
T(l, m[_]);
|
|
2072
|
+
if (g) {
|
|
2073
|
+
let _ = g.subTree;
|
|
2074
|
+
if (c === _ || dr(_.type) && (_.ssContent === c || _.ssFallback === c)) {
|
|
2075
|
+
const y = g.vnode;
|
|
2076
|
+
ue(
|
|
2077
|
+
l,
|
|
2078
|
+
y,
|
|
2079
|
+
y.scopeId,
|
|
2080
|
+
y.slotScopeIds,
|
|
2081
|
+
g.parent
|
|
2082
|
+
);
|
|
2083
|
+
}
|
|
2084
|
+
}
|
|
2085
|
+
}, Ie = (l, c, d, m, g, _, y, v, x = 0) => {
|
|
2086
|
+
for (let b = x; b < l.length; b++) {
|
|
2087
|
+
const E = l[b] = v ? Me(l[b]) : me(l[b]);
|
|
2088
|
+
M(
|
|
2089
|
+
null,
|
|
2090
|
+
E,
|
|
2091
|
+
c,
|
|
2092
|
+
d,
|
|
2093
|
+
m,
|
|
2094
|
+
g,
|
|
2095
|
+
_,
|
|
2096
|
+
y,
|
|
2097
|
+
v
|
|
2098
|
+
);
|
|
2099
|
+
}
|
|
2100
|
+
}, yt = (l, c, d, m, g, _, y) => {
|
|
2101
|
+
const v = c.el = l.el;
|
|
2102
|
+
let { patchFlag: x, dynamicChildren: b, dirs: E } = c;
|
|
2103
|
+
x |= l.patchFlag & 16;
|
|
2104
|
+
const w = l.props || V, C = c.props || V;
|
|
2105
|
+
let P;
|
|
2106
|
+
if (d && Ue(d, !1), (P = C.onVnodeBeforeUpdate) && ge(P, d, c, l), E && $e(c, l, d, "beforeUpdate"), d && Ue(d, !0), (w.innerHTML && C.innerHTML == null || w.textContent && C.textContent == null) && a(v, ""), b ? je(
|
|
2107
|
+
l.dynamicChildren,
|
|
2108
|
+
b,
|
|
2109
|
+
v,
|
|
2110
|
+
d,
|
|
2111
|
+
m,
|
|
2112
|
+
es(c, g),
|
|
2113
|
+
_
|
|
2114
|
+
) : y || L(
|
|
2115
|
+
l,
|
|
2116
|
+
c,
|
|
2117
|
+
v,
|
|
2118
|
+
null,
|
|
2119
|
+
d,
|
|
2120
|
+
m,
|
|
2121
|
+
es(c, g),
|
|
2122
|
+
_,
|
|
2123
|
+
!1
|
|
2124
|
+
), x > 0) {
|
|
2125
|
+
if (x & 16)
|
|
2126
|
+
ke(v, w, C, d, g);
|
|
2127
|
+
else if (x & 2 && w.class !== C.class && i(v, "class", null, C.class, g), x & 4 && i(v, "style", w.style, C.style, g), x & 8) {
|
|
2128
|
+
const R = c.dynamicProps;
|
|
2129
|
+
for (let $ = 0; $ < R.length; $++) {
|
|
2130
|
+
const H = R[$], se = w[H], ne = C[H];
|
|
2131
|
+
(ne !== se || H === "value") && i(v, H, se, ne, g, d);
|
|
2132
|
+
}
|
|
2133
|
+
}
|
|
2134
|
+
x & 1 && l.children !== c.children && a(v, c.children);
|
|
2135
|
+
} else !y && b == null && ke(v, w, C, d, g);
|
|
2136
|
+
((P = C.onVnodeUpdated) || E) && oe(() => {
|
|
2137
|
+
P && ge(P, d, c, l), E && $e(c, l, d, "updated");
|
|
2138
|
+
}, m);
|
|
2139
|
+
}, je = (l, c, d, m, g, _, y) => {
|
|
2140
|
+
for (let v = 0; v < c.length; v++) {
|
|
2141
|
+
const x = l[v], b = c[v], E = (
|
|
2142
|
+
// oldVNode may be an errored async setup() component inside Suspense
|
|
2143
|
+
// which will not have a mounted element
|
|
2144
|
+
x.el && // - In the case of a Fragment, we need to provide the actual parent
|
|
2145
|
+
// of the Fragment itself so it can move its children.
|
|
2146
|
+
(x.type === Te || // - In the case of different nodes, there is going to be a replacement
|
|
2147
|
+
// which also requires the correct parent container
|
|
2148
|
+
!rt(x, b) || // - In the case of a component, it could contain anything.
|
|
2149
|
+
x.shapeFlag & 198) ? p(x.el) : (
|
|
2150
|
+
// In other cases, the parent container is not actually used so we
|
|
2151
|
+
// just pass the block element here to avoid a DOM parentNode call.
|
|
2152
|
+
d
|
|
2153
|
+
)
|
|
2154
|
+
);
|
|
2155
|
+
M(
|
|
2156
|
+
x,
|
|
2157
|
+
b,
|
|
2158
|
+
E,
|
|
2159
|
+
null,
|
|
2160
|
+
m,
|
|
2161
|
+
g,
|
|
2162
|
+
_,
|
|
2163
|
+
y,
|
|
2164
|
+
!0
|
|
2165
|
+
);
|
|
2166
|
+
}
|
|
2167
|
+
}, ke = (l, c, d, m, g) => {
|
|
2168
|
+
if (c !== d) {
|
|
2169
|
+
if (c !== V)
|
|
2170
|
+
for (const _ in c)
|
|
2171
|
+
!ft(_) && !(_ in d) && i(
|
|
2172
|
+
l,
|
|
2173
|
+
_,
|
|
2174
|
+
c[_],
|
|
2175
|
+
null,
|
|
2176
|
+
g,
|
|
2177
|
+
m
|
|
2178
|
+
);
|
|
2179
|
+
for (const _ in d) {
|
|
2180
|
+
if (ft(_)) continue;
|
|
2181
|
+
const y = d[_], v = c[_];
|
|
2182
|
+
y !== v && _ !== "value" && i(l, _, v, y, g, m);
|
|
2183
|
+
}
|
|
2184
|
+
"value" in d && i(l, "value", c.value, d.value, g);
|
|
2185
|
+
}
|
|
2186
|
+
}, wt = (l, c, d, m, g, _, y, v, x) => {
|
|
2187
|
+
const b = c.el = l ? l.el : f(""), E = c.anchor = l ? l.anchor : f("");
|
|
2188
|
+
let { patchFlag: w, dynamicChildren: C, slotScopeIds: P } = c;
|
|
2189
|
+
P && (v = v ? v.concat(P) : P), l == null ? (n(b, d, m), n(E, d, m), Ie(
|
|
2190
|
+
// #10007
|
|
2191
|
+
// such fragment like `<></>` will be compiled into
|
|
2192
|
+
// a fragment which doesn't have a children.
|
|
2193
|
+
// In this case fallback to an empty array
|
|
2194
|
+
c.children || [],
|
|
2195
|
+
d,
|
|
2196
|
+
E,
|
|
2197
|
+
g,
|
|
2198
|
+
_,
|
|
2199
|
+
y,
|
|
2200
|
+
v,
|
|
2201
|
+
x
|
|
2202
|
+
)) : w > 0 && w & 64 && C && // #2715 the previous fragment could've been a BAILed one as a result
|
|
2203
|
+
// of renderSlot() with no valid children
|
|
2204
|
+
l.dynamicChildren ? (je(
|
|
2205
|
+
l.dynamicChildren,
|
|
2206
|
+
C,
|
|
2207
|
+
d,
|
|
2208
|
+
g,
|
|
2209
|
+
_,
|
|
2210
|
+
y,
|
|
2211
|
+
v
|
|
2212
|
+
), // #2080 if the stable fragment has a key, it's a <template v-for> that may
|
|
2213
|
+
// get moved around. Make sure all root level vnodes inherit el.
|
|
2214
|
+
// #2134 or if it's a component root, it may also get moved around
|
|
2215
|
+
// as the component is being moved.
|
|
2216
|
+
(c.key != null || g && c === g.subTree) && lr(
|
|
2217
|
+
l,
|
|
2218
|
+
c,
|
|
2219
|
+
!0
|
|
2220
|
+
/* shallow */
|
|
2221
|
+
)) : L(
|
|
2222
|
+
l,
|
|
2223
|
+
c,
|
|
2224
|
+
d,
|
|
2225
|
+
E,
|
|
2226
|
+
g,
|
|
2227
|
+
_,
|
|
2228
|
+
y,
|
|
2229
|
+
v,
|
|
2230
|
+
x
|
|
2231
|
+
);
|
|
2232
|
+
}, St = (l, c, d, m, g, _, y, v, x) => {
|
|
2233
|
+
c.slotScopeIds = v, l == null ? c.shapeFlag & 512 ? g.ctx.activate(
|
|
2234
|
+
c,
|
|
2235
|
+
d,
|
|
2236
|
+
m,
|
|
2237
|
+
y,
|
|
2238
|
+
x
|
|
2239
|
+
) : Gt(
|
|
2240
|
+
c,
|
|
2241
|
+
d,
|
|
2242
|
+
m,
|
|
2243
|
+
g,
|
|
2244
|
+
_,
|
|
2245
|
+
y,
|
|
2246
|
+
x
|
|
2247
|
+
) : $s(l, c, x);
|
|
2248
|
+
}, Gt = (l, c, d, m, g, _, y) => {
|
|
2249
|
+
const v = l.component = xo(
|
|
2250
|
+
l,
|
|
2251
|
+
m,
|
|
2252
|
+
g
|
|
2253
|
+
);
|
|
2254
|
+
if (Jn(l) && (v.ctx.renderer = tt), vo(v, !1, y), v.asyncDep) {
|
|
2255
|
+
if (g && g.registerDep(v, X, y), !l.el) {
|
|
2256
|
+
const x = v.subTree = fe(Xe);
|
|
2257
|
+
N(null, x, c, d);
|
|
2258
|
+
}
|
|
2259
|
+
} else
|
|
2260
|
+
X(
|
|
2261
|
+
v,
|
|
2262
|
+
l,
|
|
2263
|
+
c,
|
|
2264
|
+
d,
|
|
2265
|
+
g,
|
|
2266
|
+
_,
|
|
2267
|
+
y
|
|
2268
|
+
);
|
|
2269
|
+
}, $s = (l, c, d) => {
|
|
2270
|
+
const m = c.component = l.component;
|
|
2271
|
+
if (fo(l, c, d))
|
|
2272
|
+
if (m.asyncDep && !m.asyncResolved) {
|
|
2273
|
+
K(m, c, d);
|
|
2274
|
+
return;
|
|
2275
|
+
} else
|
|
2276
|
+
m.next = c, m.update();
|
|
2277
|
+
else
|
|
2278
|
+
c.el = l.el, m.vnode = c;
|
|
2279
|
+
}, X = (l, c, d, m, g, _, y) => {
|
|
2280
|
+
const v = () => {
|
|
2281
|
+
if (l.isMounted) {
|
|
2282
|
+
let { next: w, bu: C, u: P, parent: R, vnode: $ } = l;
|
|
2283
|
+
{
|
|
2284
|
+
const he = fr(l);
|
|
2285
|
+
if (he) {
|
|
2286
|
+
w && (w.el = $.el, K(l, w, y)), he.asyncDep.then(() => {
|
|
2287
|
+
l.isUnmounted || v();
|
|
2288
|
+
});
|
|
2289
|
+
return;
|
|
2290
|
+
}
|
|
2291
|
+
}
|
|
2292
|
+
let H = w, se;
|
|
2293
|
+
Ue(l, !1), w ? (w.el = $.el, K(l, w, y)) : w = $, C && zt(C), (se = w.props && w.props.onVnodeBeforeUpdate) && ge(se, R, w, $), Ue(l, !0);
|
|
2294
|
+
const ne = tn(l), de = l.subTree;
|
|
2295
|
+
l.subTree = ne, M(
|
|
2296
|
+
de,
|
|
2297
|
+
ne,
|
|
2298
|
+
// parent may have changed if it's in a teleport
|
|
2299
|
+
p(de.el),
|
|
2300
|
+
// anchor may have changed if it's in a fragment
|
|
2301
|
+
Ct(de),
|
|
2302
|
+
l,
|
|
2303
|
+
g,
|
|
2304
|
+
_
|
|
2305
|
+
), w.el = ne.el, H === null && co(l, ne.el), P && oe(P, g), (se = w.props && w.props.onVnodeUpdated) && oe(
|
|
2306
|
+
() => ge(se, R, w, $),
|
|
2307
|
+
g
|
|
2308
|
+
);
|
|
2309
|
+
} else {
|
|
2310
|
+
let w;
|
|
2311
|
+
const { el: C, props: P } = c, { bm: R, m: $, parent: H, root: se, type: ne } = l, de = ht(c);
|
|
2312
|
+
Ue(l, !1), R && zt(R), !de && (w = P && P.onVnodeBeforeMount) && ge(w, H, c), Ue(l, !0);
|
|
2313
|
+
{
|
|
2314
|
+
se.ce && // @ts-expect-error _def is private
|
|
2315
|
+
se.ce._def.shadowRoot !== !1 && se.ce._injectChildStyle(ne);
|
|
2316
|
+
const he = l.subTree = tn(l);
|
|
2317
|
+
M(
|
|
2318
|
+
null,
|
|
2319
|
+
he,
|
|
2320
|
+
d,
|
|
2321
|
+
m,
|
|
2322
|
+
l,
|
|
2323
|
+
g,
|
|
2324
|
+
_
|
|
2325
|
+
), c.el = he.el;
|
|
2326
|
+
}
|
|
2327
|
+
if ($ && oe($, g), !de && (w = P && P.onVnodeMounted)) {
|
|
2328
|
+
const he = c;
|
|
2329
|
+
oe(
|
|
2330
|
+
() => ge(w, H, he),
|
|
2331
|
+
g
|
|
2332
|
+
);
|
|
2333
|
+
}
|
|
2334
|
+
(c.shapeFlag & 256 || H && ht(H.vnode) && H.vnode.shapeFlag & 256) && l.a && oe(l.a, g), l.isMounted = !0, c = d = m = null;
|
|
2335
|
+
}
|
|
2336
|
+
};
|
|
2337
|
+
l.scope.on();
|
|
2338
|
+
const x = l.effect = new Tn(v);
|
|
2339
|
+
l.scope.off();
|
|
2340
|
+
const b = l.update = x.run.bind(x), E = l.job = x.runIfDirty.bind(x);
|
|
2341
|
+
E.i = l, E.id = l.uid, x.scheduler = () => Ms(E), Ue(l, !0), b();
|
|
2342
|
+
}, K = (l, c, d) => {
|
|
2343
|
+
c.component = l;
|
|
2344
|
+
const m = l.vnode.props;
|
|
2345
|
+
l.vnode = c, l.next = null, Gi(l, c.props, m, d), Xi(l, c.children, d), Ee(), Ys(l), Oe();
|
|
2346
|
+
}, L = (l, c, d, m, g, _, y, v, x = !1) => {
|
|
2347
|
+
const b = l && l.children, E = l ? l.shapeFlag : 0, w = c.children, { patchFlag: C, shapeFlag: P } = c;
|
|
2348
|
+
if (C > 0) {
|
|
2349
|
+
if (C & 128) {
|
|
2350
|
+
Tt(
|
|
2351
|
+
b,
|
|
2352
|
+
w,
|
|
2353
|
+
d,
|
|
2354
|
+
m,
|
|
2355
|
+
g,
|
|
2356
|
+
_,
|
|
2357
|
+
y,
|
|
2358
|
+
v,
|
|
2359
|
+
x
|
|
2360
|
+
);
|
|
2361
|
+
return;
|
|
2362
|
+
} else if (C & 256) {
|
|
2363
|
+
Ne(
|
|
2364
|
+
b,
|
|
2365
|
+
w,
|
|
2366
|
+
d,
|
|
2367
|
+
m,
|
|
2368
|
+
g,
|
|
2369
|
+
_,
|
|
2370
|
+
y,
|
|
2371
|
+
v,
|
|
2372
|
+
x
|
|
2373
|
+
);
|
|
2374
|
+
return;
|
|
2375
|
+
}
|
|
2376
|
+
}
|
|
2377
|
+
P & 8 ? (E & 16 && et(b, g, _), w !== b && a(d, w)) : E & 16 ? P & 16 ? Tt(
|
|
2378
|
+
b,
|
|
2379
|
+
w,
|
|
2380
|
+
d,
|
|
2381
|
+
m,
|
|
2382
|
+
g,
|
|
2383
|
+
_,
|
|
2384
|
+
y,
|
|
2385
|
+
v,
|
|
2386
|
+
x
|
|
2387
|
+
) : et(b, g, _, !0) : (E & 8 && a(d, ""), P & 16 && Ie(
|
|
2388
|
+
w,
|
|
2389
|
+
d,
|
|
2390
|
+
m,
|
|
2391
|
+
g,
|
|
2392
|
+
_,
|
|
2393
|
+
y,
|
|
2394
|
+
v,
|
|
2395
|
+
x
|
|
2396
|
+
));
|
|
2397
|
+
}, Ne = (l, c, d, m, g, _, y, v, x) => {
|
|
2398
|
+
l = l || ot, c = c || ot;
|
|
2399
|
+
const b = l.length, E = c.length, w = Math.min(b, E);
|
|
2400
|
+
let C;
|
|
2401
|
+
for (C = 0; C < w; C++) {
|
|
2402
|
+
const P = c[C] = x ? Me(c[C]) : me(c[C]);
|
|
2403
|
+
M(
|
|
2404
|
+
l[C],
|
|
2405
|
+
P,
|
|
2406
|
+
d,
|
|
2407
|
+
null,
|
|
2408
|
+
g,
|
|
2409
|
+
_,
|
|
2410
|
+
y,
|
|
2411
|
+
v,
|
|
2412
|
+
x
|
|
2413
|
+
);
|
|
2414
|
+
}
|
|
2415
|
+
b > E ? et(
|
|
2416
|
+
l,
|
|
2417
|
+
g,
|
|
2418
|
+
_,
|
|
2419
|
+
!0,
|
|
2420
|
+
!1,
|
|
2421
|
+
w
|
|
2422
|
+
) : Ie(
|
|
2423
|
+
c,
|
|
2424
|
+
d,
|
|
2425
|
+
m,
|
|
2426
|
+
g,
|
|
2427
|
+
_,
|
|
2428
|
+
y,
|
|
2429
|
+
v,
|
|
2430
|
+
x,
|
|
2431
|
+
w
|
|
2432
|
+
);
|
|
2433
|
+
}, Tt = (l, c, d, m, g, _, y, v, x) => {
|
|
2434
|
+
let b = 0;
|
|
2435
|
+
const E = c.length;
|
|
2436
|
+
let w = l.length - 1, C = E - 1;
|
|
2437
|
+
for (; b <= w && b <= C; ) {
|
|
2438
|
+
const P = l[b], R = c[b] = x ? Me(c[b]) : me(c[b]);
|
|
2439
|
+
if (rt(P, R))
|
|
2440
|
+
M(
|
|
2441
|
+
P,
|
|
2442
|
+
R,
|
|
2443
|
+
d,
|
|
2444
|
+
null,
|
|
2445
|
+
g,
|
|
2446
|
+
_,
|
|
2447
|
+
y,
|
|
2448
|
+
v,
|
|
2449
|
+
x
|
|
2450
|
+
);
|
|
2451
|
+
else
|
|
2452
|
+
break;
|
|
2453
|
+
b++;
|
|
2454
|
+
}
|
|
2455
|
+
for (; b <= w && b <= C; ) {
|
|
2456
|
+
const P = l[w], R = c[C] = x ? Me(c[C]) : me(c[C]);
|
|
2457
|
+
if (rt(P, R))
|
|
2458
|
+
M(
|
|
2459
|
+
P,
|
|
2460
|
+
R,
|
|
2461
|
+
d,
|
|
2462
|
+
null,
|
|
2463
|
+
g,
|
|
2464
|
+
_,
|
|
2465
|
+
y,
|
|
2466
|
+
v,
|
|
2467
|
+
x
|
|
2468
|
+
);
|
|
2469
|
+
else
|
|
2470
|
+
break;
|
|
2471
|
+
w--, C--;
|
|
2472
|
+
}
|
|
2473
|
+
if (b > w) {
|
|
2474
|
+
if (b <= C) {
|
|
2475
|
+
const P = C + 1, R = P < E ? c[P].el : m;
|
|
2476
|
+
for (; b <= C; )
|
|
2477
|
+
M(
|
|
2478
|
+
null,
|
|
2479
|
+
c[b] = x ? Me(c[b]) : me(c[b]),
|
|
2480
|
+
d,
|
|
2481
|
+
R,
|
|
2482
|
+
g,
|
|
2483
|
+
_,
|
|
2484
|
+
y,
|
|
2485
|
+
v,
|
|
2486
|
+
x
|
|
2487
|
+
), b++;
|
|
2488
|
+
}
|
|
2489
|
+
} else if (b > C)
|
|
2490
|
+
for (; b <= w; )
|
|
2491
|
+
ae(l[b], g, _, !0), b++;
|
|
2492
|
+
else {
|
|
2493
|
+
const P = b, R = b, $ = /* @__PURE__ */ new Map();
|
|
2494
|
+
for (b = R; b <= C; b++) {
|
|
2495
|
+
const ie = c[b] = x ? Me(c[b]) : me(c[b]);
|
|
2496
|
+
ie.key != null && $.set(ie.key, b);
|
|
2497
|
+
}
|
|
2498
|
+
let H, se = 0;
|
|
2499
|
+
const ne = C - R + 1;
|
|
2500
|
+
let de = !1, he = 0;
|
|
2501
|
+
const st = new Array(ne);
|
|
2502
|
+
for (b = 0; b < ne; b++) st[b] = 0;
|
|
2503
|
+
for (b = P; b <= w; b++) {
|
|
2504
|
+
const ie = l[b];
|
|
2505
|
+
if (se >= ne) {
|
|
2506
|
+
ae(ie, g, _, !0);
|
|
2507
|
+
continue;
|
|
2508
|
+
}
|
|
2509
|
+
let pe;
|
|
2510
|
+
if (ie.key != null)
|
|
2511
|
+
pe = $.get(ie.key);
|
|
2512
|
+
else
|
|
2513
|
+
for (H = R; H <= C; H++)
|
|
2514
|
+
if (st[H - R] === 0 && rt(ie, c[H])) {
|
|
2515
|
+
pe = H;
|
|
2516
|
+
break;
|
|
2517
|
+
}
|
|
2518
|
+
pe === void 0 ? ae(ie, g, _, !0) : (st[pe - R] = b + 1, pe >= he ? he = pe : de = !0, M(
|
|
2519
|
+
ie,
|
|
2520
|
+
c[pe],
|
|
2521
|
+
d,
|
|
2522
|
+
null,
|
|
2523
|
+
g,
|
|
2524
|
+
_,
|
|
2525
|
+
y,
|
|
2526
|
+
v,
|
|
2527
|
+
x
|
|
2528
|
+
), se++);
|
|
2529
|
+
}
|
|
2530
|
+
const Ks = de ? eo(st) : ot;
|
|
2531
|
+
for (H = Ks.length - 1, b = ne - 1; b >= 0; b--) {
|
|
2532
|
+
const ie = R + b, pe = c[ie], Ws = ie + 1 < E ? c[ie + 1].el : m;
|
|
2533
|
+
st[b] === 0 ? M(
|
|
2534
|
+
null,
|
|
2535
|
+
pe,
|
|
2536
|
+
d,
|
|
2537
|
+
Ws,
|
|
2538
|
+
g,
|
|
2539
|
+
_,
|
|
2540
|
+
y,
|
|
2541
|
+
v,
|
|
2542
|
+
x
|
|
2543
|
+
) : de && (H < 0 || b !== Ks[H] ? Le(pe, d, Ws, 2) : H--);
|
|
2544
|
+
}
|
|
2545
|
+
}
|
|
2546
|
+
}, Le = (l, c, d, m, g = null) => {
|
|
2547
|
+
const { el: _, type: y, transition: v, children: x, shapeFlag: b } = l;
|
|
2548
|
+
if (b & 6) {
|
|
2549
|
+
Le(l.component.subTree, c, d, m);
|
|
2550
|
+
return;
|
|
2551
|
+
}
|
|
2552
|
+
if (b & 128) {
|
|
2553
|
+
l.suspense.move(c, d, m);
|
|
2554
|
+
return;
|
|
2555
|
+
}
|
|
2556
|
+
if (b & 64) {
|
|
2557
|
+
y.move(l, c, d, tt);
|
|
2558
|
+
return;
|
|
2559
|
+
}
|
|
2560
|
+
if (y === Te) {
|
|
2561
|
+
n(_, c, d);
|
|
2562
|
+
for (let w = 0; w < x.length; w++)
|
|
2563
|
+
Le(x[w], c, d, m);
|
|
2564
|
+
n(l.anchor, c, d);
|
|
2565
|
+
return;
|
|
2566
|
+
}
|
|
2567
|
+
if (y === ss) {
|
|
2568
|
+
B(l, c, d);
|
|
2569
|
+
return;
|
|
2570
|
+
}
|
|
2571
|
+
if (m !== 2 && b & 1 && v)
|
|
2572
|
+
if (m === 0)
|
|
2573
|
+
v.beforeEnter(_), n(_, c, d), oe(() => v.enter(_), g);
|
|
2574
|
+
else {
|
|
2575
|
+
const { leave: w, delayLeave: C, afterLeave: P } = v, R = () => {
|
|
2576
|
+
l.ctx.isUnmounted ? r(_) : n(_, c, d);
|
|
2577
|
+
}, $ = () => {
|
|
2578
|
+
w(_, () => {
|
|
2579
|
+
R(), P && P();
|
|
2580
|
+
});
|
|
2581
|
+
};
|
|
2582
|
+
C ? C(_, R, $) : $();
|
|
2583
|
+
}
|
|
2584
|
+
else
|
|
2585
|
+
n(_, c, d);
|
|
2586
|
+
}, ae = (l, c, d, m = !1, g = !1) => {
|
|
2587
|
+
const {
|
|
2588
|
+
type: _,
|
|
2589
|
+
props: y,
|
|
2590
|
+
ref: v,
|
|
2591
|
+
children: x,
|
|
2592
|
+
dynamicChildren: b,
|
|
2593
|
+
shapeFlag: E,
|
|
2594
|
+
patchFlag: w,
|
|
2595
|
+
dirs: C,
|
|
2596
|
+
cacheIndex: P
|
|
2597
|
+
} = l;
|
|
2598
|
+
if (w === -2 && (g = !1), v != null && (Ee(), dt(v, null, d, l, !0), Oe()), P != null && (c.renderCache[P] = void 0), E & 256) {
|
|
2599
|
+
c.ctx.deactivate(l);
|
|
2600
|
+
return;
|
|
2601
|
+
}
|
|
2602
|
+
const R = E & 1 && C, $ = !ht(l);
|
|
2603
|
+
let H;
|
|
2604
|
+
if ($ && (H = y && y.onVnodeBeforeUnmount) && ge(H, c, l), E & 6)
|
|
2605
|
+
br(l.component, d, m);
|
|
2606
|
+
else {
|
|
2607
|
+
if (E & 128) {
|
|
2608
|
+
l.suspense.unmount(d, m);
|
|
2609
|
+
return;
|
|
2610
|
+
}
|
|
2611
|
+
R && $e(l, null, c, "beforeUnmount"), E & 64 ? l.type.remove(
|
|
2612
|
+
l,
|
|
2613
|
+
c,
|
|
2614
|
+
d,
|
|
2615
|
+
tt,
|
|
2616
|
+
m
|
|
2617
|
+
) : b && // #5154
|
|
2618
|
+
// when v-once is used inside a block, setBlockTracking(-1) marks the
|
|
2619
|
+
// parent block with hasOnce: true
|
|
2620
|
+
// so that it doesn't take the fast path during unmount - otherwise
|
|
2621
|
+
// components nested in v-once are never unmounted.
|
|
2622
|
+
!b.hasOnce && // #1153: fast path should not be taken for non-stable (v-for) fragments
|
|
2623
|
+
(_ !== Te || w > 0 && w & 64) ? et(
|
|
2624
|
+
b,
|
|
2625
|
+
c,
|
|
2626
|
+
d,
|
|
2627
|
+
!1,
|
|
2628
|
+
!0
|
|
2629
|
+
) : (_ === Te && w & 384 || !g && E & 16) && et(x, c, d), m && Us(l);
|
|
2630
|
+
}
|
|
2631
|
+
($ && (H = y && y.onVnodeUnmounted) || R) && oe(() => {
|
|
2632
|
+
H && ge(H, c, l), R && $e(l, null, c, "unmounted");
|
|
2633
|
+
}, d);
|
|
2634
|
+
}, Us = (l) => {
|
|
2635
|
+
const { type: c, el: d, anchor: m, transition: g } = l;
|
|
2636
|
+
if (c === Te) {
|
|
2637
|
+
mr(d, m);
|
|
2638
|
+
return;
|
|
2639
|
+
}
|
|
2640
|
+
if (c === ss) {
|
|
2641
|
+
O(l);
|
|
2642
|
+
return;
|
|
2643
|
+
}
|
|
2644
|
+
const _ = () => {
|
|
2645
|
+
r(d), g && !g.persisted && g.afterLeave && g.afterLeave();
|
|
2646
|
+
};
|
|
2647
|
+
if (l.shapeFlag & 1 && g && !g.persisted) {
|
|
2648
|
+
const { leave: y, delayLeave: v } = g, x = () => y(d, _);
|
|
2649
|
+
v ? v(l.el, _, x) : x();
|
|
2650
|
+
} else
|
|
2651
|
+
_();
|
|
2652
|
+
}, mr = (l, c) => {
|
|
2653
|
+
let d;
|
|
2654
|
+
for (; l !== c; )
|
|
2655
|
+
d = S(l), r(l), l = d;
|
|
2656
|
+
r(c);
|
|
2657
|
+
}, br = (l, c, d) => {
|
|
2658
|
+
const {
|
|
2659
|
+
bum: m,
|
|
2660
|
+
scope: g,
|
|
2661
|
+
job: _,
|
|
2662
|
+
subTree: y,
|
|
2663
|
+
um: v,
|
|
2664
|
+
m: x,
|
|
2665
|
+
a: b,
|
|
2666
|
+
parent: E,
|
|
2667
|
+
slots: { __: w }
|
|
2668
|
+
} = l;
|
|
2669
|
+
en(x), en(b), m && zt(m), E && A(w) && w.forEach((C) => {
|
|
2670
|
+
E.renderCache[C] = void 0;
|
|
2671
|
+
}), g.stop(), _ && (_.flags |= 8, ae(y, l, c, d)), v && oe(v, c), oe(() => {
|
|
2672
|
+
l.isUnmounted = !0;
|
|
2673
|
+
}, c), c && c.pendingBranch && !c.isUnmounted && l.asyncDep && !l.asyncResolved && l.suspenseId === c.pendingId && (c.deps--, c.deps === 0 && c.resolve());
|
|
2674
|
+
}, et = (l, c, d, m = !1, g = !1, _ = 0) => {
|
|
2675
|
+
for (let y = _; y < l.length; y++)
|
|
2676
|
+
ae(l[y], c, d, m, g);
|
|
2677
|
+
}, Ct = (l) => {
|
|
2678
|
+
if (l.shapeFlag & 6)
|
|
2679
|
+
return Ct(l.component.subTree);
|
|
2680
|
+
if (l.shapeFlag & 128)
|
|
2681
|
+
return l.suspense.next();
|
|
2682
|
+
const c = S(l.anchor || l.el), d = c && c[yi];
|
|
2683
|
+
return d ? S(d) : c;
|
|
2684
|
+
};
|
|
2685
|
+
let Jt = !1;
|
|
2686
|
+
const Vs = (l, c, d) => {
|
|
2687
|
+
l == null ? c._vnode && ae(c._vnode, null, null, !0) : M(
|
|
2688
|
+
c._vnode || null,
|
|
2689
|
+
l,
|
|
2690
|
+
c,
|
|
2691
|
+
null,
|
|
2692
|
+
null,
|
|
2693
|
+
null,
|
|
2694
|
+
d
|
|
2695
|
+
), c._vnode = l, Jt || (Jt = !0, Ys(), Wn(), Jt = !1);
|
|
2696
|
+
}, tt = {
|
|
2697
|
+
p: M,
|
|
2698
|
+
um: ae,
|
|
2699
|
+
m: Le,
|
|
2700
|
+
r: Us,
|
|
2701
|
+
mt: Gt,
|
|
2702
|
+
mc: Ie,
|
|
2703
|
+
pc: L,
|
|
2704
|
+
pbc: je,
|
|
2705
|
+
n: Ct,
|
|
2706
|
+
o: e
|
|
2707
|
+
};
|
|
2708
|
+
return {
|
|
2709
|
+
render: Vs,
|
|
2710
|
+
hydrate: void 0,
|
|
2711
|
+
createApp: Wi(Vs)
|
|
2712
|
+
};
|
|
2713
|
+
}
|
|
2714
|
+
function es({ type: e, props: t }, s) {
|
|
2715
|
+
return s === "svg" && e === "foreignObject" || s === "mathml" && e === "annotation-xml" && t && t.encoding && t.encoding.includes("html") ? void 0 : s;
|
|
2716
|
+
}
|
|
2717
|
+
function Ue({ effect: e, job: t }, s) {
|
|
2718
|
+
s ? (e.flags |= 32, t.flags |= 4) : (e.flags &= -33, t.flags &= -5);
|
|
2719
|
+
}
|
|
2720
|
+
function ki(e, t) {
|
|
2721
|
+
return (!e || e && !e.pendingBranch) && t && !t.persisted;
|
|
2722
|
+
}
|
|
2723
|
+
function lr(e, t, s = !1) {
|
|
2724
|
+
const n = e.children, r = t.children;
|
|
2725
|
+
if (A(n) && A(r))
|
|
2726
|
+
for (let i = 0; i < n.length; i++) {
|
|
2727
|
+
const o = n[i];
|
|
2728
|
+
let f = r[i];
|
|
2729
|
+
f.shapeFlag & 1 && !f.dynamicChildren && ((f.patchFlag <= 0 || f.patchFlag === 32) && (f = r[i] = Me(r[i]), f.el = o.el), !s && f.patchFlag !== -2 && lr(o, f)), f.type === qt && (f.el = o.el), f.type === Xe && !f.el && (f.el = o.el);
|
|
2730
|
+
}
|
|
2731
|
+
}
|
|
2732
|
+
function eo(e) {
|
|
2733
|
+
const t = e.slice(), s = [0];
|
|
2734
|
+
let n, r, i, o, f;
|
|
2735
|
+
const u = e.length;
|
|
2736
|
+
for (n = 0; n < u; n++) {
|
|
2737
|
+
const h = e[n];
|
|
2738
|
+
if (h !== 0) {
|
|
2739
|
+
if (r = s[s.length - 1], e[r] < h) {
|
|
2740
|
+
t[n] = r, s.push(n);
|
|
2741
|
+
continue;
|
|
2742
|
+
}
|
|
2743
|
+
for (i = 0, o = s.length - 1; i < o; )
|
|
2744
|
+
f = i + o >> 1, e[s[f]] < h ? i = f + 1 : o = f;
|
|
2745
|
+
h < e[s[i]] && (i > 0 && (t[n] = s[i - 1]), s[i] = n);
|
|
2746
|
+
}
|
|
2747
|
+
}
|
|
2748
|
+
for (i = s.length, o = s[i - 1]; i-- > 0; )
|
|
2749
|
+
s[i] = o, o = t[o];
|
|
2750
|
+
return s;
|
|
2751
|
+
}
|
|
2752
|
+
function fr(e) {
|
|
2753
|
+
const t = e.subTree.component;
|
|
2754
|
+
if (t)
|
|
2755
|
+
return t.asyncDep && !t.asyncResolved ? t : fr(t);
|
|
2756
|
+
}
|
|
2757
|
+
function en(e) {
|
|
2758
|
+
if (e)
|
|
2759
|
+
for (let t = 0; t < e.length; t++)
|
|
2760
|
+
e[t].flags |= 8;
|
|
2761
|
+
}
|
|
2762
|
+
const to = Symbol.for("v-scx"), so = () => At(to);
|
|
2763
|
+
function ts(e, t, s) {
|
|
2764
|
+
return cr(e, t, s);
|
|
2765
|
+
}
|
|
2766
|
+
function cr(e, t, s = V) {
|
|
2767
|
+
const { immediate: n, deep: r, flush: i, once: o } = s, f = te({}, s), u = t && n || !t && i !== "post";
|
|
2768
|
+
let h;
|
|
2769
|
+
if (bt) {
|
|
2770
|
+
if (i === "sync") {
|
|
2771
|
+
const T = so();
|
|
2772
|
+
h = T.__watcherHandles || (T.__watcherHandles = []);
|
|
2773
|
+
} else if (!u) {
|
|
2774
|
+
const T = () => {
|
|
2775
|
+
};
|
|
2776
|
+
return T.stop = xe, T.resume = xe, T.pause = xe, T;
|
|
2777
|
+
}
|
|
2778
|
+
}
|
|
2779
|
+
const a = k;
|
|
2780
|
+
f.call = (T, F, M) => ye(T, a, F, M);
|
|
2781
|
+
let p = !1;
|
|
2782
|
+
i === "post" ? f.scheduler = (T) => {
|
|
2783
|
+
oe(T, a && a.suspense);
|
|
2784
|
+
} : i !== "sync" && (p = !0, f.scheduler = (T, F) => {
|
|
2785
|
+
F ? T() : Ms(T);
|
|
2786
|
+
}), f.augmentJob = (T) => {
|
|
2787
|
+
t && (T.flags |= 4), p && (T.flags |= 2, a && (T.id = a.uid, T.i = a));
|
|
2788
|
+
};
|
|
2789
|
+
const S = gi(e, t, f);
|
|
2790
|
+
return bt && (h ? h.push(S) : u && S()), S;
|
|
2791
|
+
}
|
|
2792
|
+
function no(e, t, s) {
|
|
2793
|
+
const n = this.proxy, r = J(e) ? e.includes(".") ? ur(n, e) : () => n[e] : e.bind(n, n);
|
|
2794
|
+
let i;
|
|
2795
|
+
I(t) ? i = t : (i = t.handler, s = t);
|
|
2796
|
+
const o = vt(this), f = cr(r, i.bind(n), s);
|
|
2797
|
+
return o(), f;
|
|
2798
|
+
}
|
|
2799
|
+
function ur(e, t) {
|
|
2800
|
+
const s = t.split(".");
|
|
2801
|
+
return () => {
|
|
2802
|
+
let n = e;
|
|
2803
|
+
for (let r = 0; r < s.length && n; r++)
|
|
2804
|
+
n = n[s[r]];
|
|
2805
|
+
return n;
|
|
2806
|
+
};
|
|
2807
|
+
}
|
|
2808
|
+
const ro = (e, t) => t === "modelValue" || t === "model-value" ? e.modelModifiers : e[`${t}Modifiers`] || e[`${He(t)}Modifiers`] || e[`${Be(t)}Modifiers`];
|
|
2809
|
+
function io(e, t, ...s) {
|
|
2810
|
+
if (e.isUnmounted) return;
|
|
2811
|
+
const n = e.vnode.props || V;
|
|
2812
|
+
let r = s;
|
|
2813
|
+
const i = t.startsWith("update:"), o = i && ro(n, t.slice(7));
|
|
2814
|
+
o && (o.trim && (r = s.map((a) => J(a) ? a.trim() : a)), o.number && (r = s.map(Hr)));
|
|
2815
|
+
let f, u = n[f = Yt(t)] || // also try camelCase event handler (#2249)
|
|
2816
|
+
n[f = Yt(He(t))];
|
|
2817
|
+
!u && i && (u = n[f = Yt(Be(t))]), u && ye(
|
|
2818
|
+
u,
|
|
2819
|
+
e,
|
|
2820
|
+
6,
|
|
2821
|
+
r
|
|
2822
|
+
);
|
|
2823
|
+
const h = n[f + "Once"];
|
|
2824
|
+
if (h) {
|
|
2825
|
+
if (!e.emitted)
|
|
2826
|
+
e.emitted = {};
|
|
2827
|
+
else if (e.emitted[f])
|
|
2828
|
+
return;
|
|
2829
|
+
e.emitted[f] = !0, ye(
|
|
2830
|
+
h,
|
|
2831
|
+
e,
|
|
2832
|
+
6,
|
|
2833
|
+
r
|
|
2834
|
+
);
|
|
2835
|
+
}
|
|
2836
|
+
}
|
|
2837
|
+
function ar(e, t, s = !1) {
|
|
2838
|
+
const n = t.emitsCache, r = n.get(e);
|
|
2839
|
+
if (r !== void 0)
|
|
2840
|
+
return r;
|
|
2841
|
+
const i = e.emits;
|
|
2842
|
+
let o = {}, f = !1;
|
|
2843
|
+
if (!I(e)) {
|
|
2844
|
+
const u = (h) => {
|
|
2845
|
+
const a = ar(h, t, !0);
|
|
2846
|
+
a && (f = !0, te(o, a));
|
|
2847
|
+
};
|
|
2848
|
+
!s && t.mixins.length && t.mixins.forEach(u), e.extends && u(e.extends), e.mixins && e.mixins.forEach(u);
|
|
2849
|
+
}
|
|
2850
|
+
return !i && !f ? (q(e) && n.set(e, null), null) : (A(i) ? i.forEach((u) => o[u] = null) : te(o, i), q(e) && n.set(e, o), o);
|
|
2851
|
+
}
|
|
2852
|
+
function Bt(e, t) {
|
|
2853
|
+
return !e || !Lt(t) ? !1 : (t = t.slice(2).replace(/Once$/, ""), D(e, t[0].toLowerCase() + t.slice(1)) || D(e, Be(t)) || D(e, t));
|
|
2854
|
+
}
|
|
2855
|
+
function tn(e) {
|
|
2856
|
+
const {
|
|
2857
|
+
type: t,
|
|
2858
|
+
vnode: s,
|
|
2859
|
+
proxy: n,
|
|
2860
|
+
withProxy: r,
|
|
2861
|
+
propsOptions: [i],
|
|
2862
|
+
slots: o,
|
|
2863
|
+
attrs: f,
|
|
2864
|
+
emit: u,
|
|
2865
|
+
render: h,
|
|
2866
|
+
renderCache: a,
|
|
2867
|
+
props: p,
|
|
2868
|
+
data: S,
|
|
2869
|
+
setupState: T,
|
|
2870
|
+
ctx: F,
|
|
2871
|
+
inheritAttrs: M
|
|
2872
|
+
} = e, Y = Dt(e);
|
|
2873
|
+
let N, W;
|
|
2874
|
+
try {
|
|
2875
|
+
if (s.shapeFlag & 4) {
|
|
2876
|
+
const O = r || n, G = O;
|
|
2877
|
+
N = me(
|
|
2878
|
+
h.call(
|
|
2879
|
+
G,
|
|
2880
|
+
O,
|
|
2881
|
+
a,
|
|
2882
|
+
p,
|
|
2883
|
+
T,
|
|
2884
|
+
S,
|
|
2885
|
+
F
|
|
2886
|
+
)
|
|
2887
|
+
), W = f;
|
|
2888
|
+
} else {
|
|
2889
|
+
const O = t;
|
|
2890
|
+
N = me(
|
|
2891
|
+
O.length > 1 ? O(
|
|
2892
|
+
p,
|
|
2893
|
+
{ attrs: f, slots: o, emit: u }
|
|
2894
|
+
) : O(
|
|
2895
|
+
p,
|
|
2896
|
+
null
|
|
2897
|
+
)
|
|
2898
|
+
), W = t.props ? f : oo(f);
|
|
2899
|
+
}
|
|
2900
|
+
} catch (O) {
|
|
2901
|
+
Kt(O, e, 1), N = fe(Xe);
|
|
2902
|
+
}
|
|
2903
|
+
let B = N;
|
|
2904
|
+
if (W && M !== !1) {
|
|
2905
|
+
const O = Object.keys(W), { shapeFlag: G } = B;
|
|
2906
|
+
O.length && G & 7 && (i && O.some(xs) && (W = lo(
|
|
2907
|
+
W,
|
|
2908
|
+
i
|
|
2909
|
+
)), B = Ze(B, W, !1, !0));
|
|
2910
|
+
}
|
|
2911
|
+
return s.dirs && (B = Ze(B, null, !1, !0), B.dirs = B.dirs ? B.dirs.concat(s.dirs) : s.dirs), s.transition && Fs(B, s.transition), N = B, Dt(Y), N;
|
|
2912
|
+
}
|
|
2913
|
+
const oo = (e) => {
|
|
2914
|
+
let t;
|
|
2915
|
+
for (const s in e)
|
|
2916
|
+
(s === "class" || s === "style" || Lt(s)) && ((t || (t = {}))[s] = e[s]);
|
|
2917
|
+
return t;
|
|
2918
|
+
}, lo = (e, t) => {
|
|
2919
|
+
const s = {};
|
|
2920
|
+
for (const n in e)
|
|
2921
|
+
(!xs(n) || !(n.slice(9) in t)) && (s[n] = e[n]);
|
|
2922
|
+
return s;
|
|
2923
|
+
};
|
|
2924
|
+
function fo(e, t, s) {
|
|
2925
|
+
const { props: n, children: r, component: i } = e, { props: o, children: f, patchFlag: u } = t, h = i.emitsOptions;
|
|
2926
|
+
if (t.dirs || t.transition)
|
|
2927
|
+
return !0;
|
|
2928
|
+
if (s && u >= 0) {
|
|
2929
|
+
if (u & 1024)
|
|
2930
|
+
return !0;
|
|
2931
|
+
if (u & 16)
|
|
2932
|
+
return n ? sn(n, o, h) : !!o;
|
|
2933
|
+
if (u & 8) {
|
|
2934
|
+
const a = t.dynamicProps;
|
|
2935
|
+
for (let p = 0; p < a.length; p++) {
|
|
2936
|
+
const S = a[p];
|
|
2937
|
+
if (o[S] !== n[S] && !Bt(h, S))
|
|
2938
|
+
return !0;
|
|
2939
|
+
}
|
|
2940
|
+
}
|
|
2941
|
+
} else
|
|
2942
|
+
return (r || f) && (!f || !f.$stable) ? !0 : n === o ? !1 : n ? o ? sn(n, o, h) : !0 : !!o;
|
|
2943
|
+
return !1;
|
|
2944
|
+
}
|
|
2945
|
+
function sn(e, t, s) {
|
|
2946
|
+
const n = Object.keys(t);
|
|
2947
|
+
if (n.length !== Object.keys(e).length)
|
|
2948
|
+
return !0;
|
|
2949
|
+
for (let r = 0; r < n.length; r++) {
|
|
2950
|
+
const i = n[r];
|
|
2951
|
+
if (t[i] !== e[i] && !Bt(s, i))
|
|
2952
|
+
return !0;
|
|
2953
|
+
}
|
|
2954
|
+
return !1;
|
|
2955
|
+
}
|
|
2956
|
+
function co({ vnode: e, parent: t }, s) {
|
|
2957
|
+
for (; t; ) {
|
|
2958
|
+
const n = t.subTree;
|
|
2959
|
+
if (n.suspense && n.suspense.activeBranch === e && (n.el = e.el), n === e)
|
|
2960
|
+
(e = t.vnode).el = s, t = t.parent;
|
|
2961
|
+
else
|
|
2962
|
+
break;
|
|
2963
|
+
}
|
|
2964
|
+
}
|
|
2965
|
+
const dr = (e) => e.__isSuspense;
|
|
2966
|
+
function uo(e, t) {
|
|
2967
|
+
t && t.pendingBranch ? A(e) ? t.effects.push(...e) : t.effects.push(e) : xi(e);
|
|
2968
|
+
}
|
|
2969
|
+
const Te = Symbol.for("v-fgt"), qt = Symbol.for("v-txt"), Xe = Symbol.for("v-cmt"), ss = Symbol.for("v-stc");
|
|
2970
|
+
let De = null, js = 1;
|
|
2971
|
+
function nn(e, t = !1) {
|
|
2972
|
+
js += e, e < 0 && De && t && (De.hasOnce = !0);
|
|
2973
|
+
}
|
|
2974
|
+
function jt(e) {
|
|
2975
|
+
return e ? e.__v_isVNode === !0 : !1;
|
|
2976
|
+
}
|
|
2977
|
+
function rt(e, t) {
|
|
2978
|
+
return e.type === t.type && e.key === t.key;
|
|
2979
|
+
}
|
|
2980
|
+
const hr = ({ key: e }) => e != null ? e : null, It = ({
|
|
2981
|
+
ref: e,
|
|
2982
|
+
ref_key: t,
|
|
2983
|
+
ref_for: s
|
|
2984
|
+
}) => (typeof e == "number" && (e = "" + e), e != null ? J(e) || ee(e) || I(e) ? { i: be, r: e, k: t, f: !!s } : e : null);
|
|
2985
|
+
function ao(e, t = null, s = null, n = 0, r = null, i = e === Te ? 0 : 1, o = !1, f = !1) {
|
|
2986
|
+
const u = {
|
|
2987
|
+
__v_isVNode: !0,
|
|
2988
|
+
__v_skip: !0,
|
|
2989
|
+
type: e,
|
|
2990
|
+
props: t,
|
|
2991
|
+
key: t && hr(t),
|
|
2992
|
+
ref: t && It(t),
|
|
2993
|
+
scopeId: qn,
|
|
2994
|
+
slotScopeIds: null,
|
|
2995
|
+
children: s,
|
|
2996
|
+
component: null,
|
|
2997
|
+
suspense: null,
|
|
2998
|
+
ssContent: null,
|
|
2999
|
+
ssFallback: null,
|
|
3000
|
+
dirs: null,
|
|
3001
|
+
transition: null,
|
|
3002
|
+
el: null,
|
|
3003
|
+
anchor: null,
|
|
3004
|
+
target: null,
|
|
3005
|
+
targetStart: null,
|
|
3006
|
+
targetAnchor: null,
|
|
3007
|
+
staticCount: 0,
|
|
3008
|
+
shapeFlag: i,
|
|
3009
|
+
patchFlag: n,
|
|
3010
|
+
dynamicProps: r,
|
|
3011
|
+
dynamicChildren: null,
|
|
3012
|
+
appContext: null,
|
|
3013
|
+
ctx: be
|
|
3014
|
+
};
|
|
3015
|
+
return f ? (Ns(u, s), i & 128 && e.normalize(u)) : s && (u.shapeFlag |= J(s) ? 8 : 16), js > 0 && // avoid a block node from tracking itself
|
|
3016
|
+
!o && // has current parent block
|
|
3017
|
+
De && // presence of a patch flag indicates this node needs patching on updates.
|
|
3018
|
+
// component nodes also should always be patched, because even if the
|
|
3019
|
+
// component doesn't need to update, it needs to persist the instance on to
|
|
3020
|
+
// the next vnode so that it can be properly unmounted later.
|
|
3021
|
+
(u.patchFlag > 0 || i & 6) && // the EVENTS flag is only for hydration and if it is the only flag, the
|
|
3022
|
+
// vnode should not be considered dynamic due to handler caching.
|
|
3023
|
+
u.patchFlag !== 32 && De.push(u), u;
|
|
3024
|
+
}
|
|
3025
|
+
const fe = ho;
|
|
3026
|
+
function ho(e, t = null, s = null, n = 0, r = null, i = !1) {
|
|
3027
|
+
if ((!e || e === Hi) && (e = Xe), jt(e)) {
|
|
3028
|
+
const f = Ze(
|
|
3029
|
+
e,
|
|
3030
|
+
t,
|
|
3031
|
+
!0
|
|
3032
|
+
/* mergeRef: true */
|
|
3033
|
+
);
|
|
3034
|
+
return s && Ns(f, s), js > 0 && !i && De && (f.shapeFlag & 6 ? De[De.indexOf(e)] = f : De.push(f)), f.patchFlag = -2, f;
|
|
3035
|
+
}
|
|
3036
|
+
if (To(e) && (e = e.__vccOpts), t) {
|
|
3037
|
+
t = po(t);
|
|
3038
|
+
let { class: f, style: u } = t;
|
|
3039
|
+
f && !J(f) && (t.class = Ss(f)), q(u) && (Rs(u) && !A(u) && (u = te({}, u)), t.style = ws(u));
|
|
3040
|
+
}
|
|
3041
|
+
const o = J(e) ? 1 : dr(e) ? 128 : wi(e) ? 64 : q(e) ? 4 : I(e) ? 2 : 0;
|
|
3042
|
+
return ao(
|
|
3043
|
+
e,
|
|
3044
|
+
t,
|
|
3045
|
+
s,
|
|
3046
|
+
n,
|
|
3047
|
+
r,
|
|
3048
|
+
o,
|
|
3049
|
+
i,
|
|
3050
|
+
!0
|
|
3051
|
+
);
|
|
3052
|
+
}
|
|
3053
|
+
function po(e) {
|
|
3054
|
+
return e ? Rs(e) || tr(e) ? te({}, e) : e : null;
|
|
3055
|
+
}
|
|
3056
|
+
function Ze(e, t, s = !1, n = !1) {
|
|
3057
|
+
const { props: r, ref: i, patchFlag: o, children: f, transition: u } = e, h = t ? _o(r || {}, t) : r, a = {
|
|
3058
|
+
__v_isVNode: !0,
|
|
3059
|
+
__v_skip: !0,
|
|
3060
|
+
type: e.type,
|
|
3061
|
+
props: h,
|
|
3062
|
+
key: h && hr(h),
|
|
3063
|
+
ref: t && t.ref ? (
|
|
3064
|
+
// #2078 in the case of <component :is="vnode" ref="extra"/>
|
|
3065
|
+
// if the vnode itself already has a ref, cloneVNode will need to merge
|
|
3066
|
+
// the refs so the single vnode can be set on multiple refs
|
|
3067
|
+
s && i ? A(i) ? i.concat(It(t)) : [i, It(t)] : It(t)
|
|
3068
|
+
) : i,
|
|
3069
|
+
scopeId: e.scopeId,
|
|
3070
|
+
slotScopeIds: e.slotScopeIds,
|
|
3071
|
+
children: f,
|
|
3072
|
+
target: e.target,
|
|
3073
|
+
targetStart: e.targetStart,
|
|
3074
|
+
targetAnchor: e.targetAnchor,
|
|
3075
|
+
staticCount: e.staticCount,
|
|
3076
|
+
shapeFlag: e.shapeFlag,
|
|
3077
|
+
// if the vnode is cloned with extra props, we can no longer assume its
|
|
3078
|
+
// existing patch flag to be reliable and need to add the FULL_PROPS flag.
|
|
3079
|
+
// note: preserve flag for fragments since they use the flag for children
|
|
3080
|
+
// fast paths only.
|
|
3081
|
+
patchFlag: t && e.type !== Te ? o === -1 ? 16 : o | 16 : o,
|
|
3082
|
+
dynamicProps: e.dynamicProps,
|
|
3083
|
+
dynamicChildren: e.dynamicChildren,
|
|
3084
|
+
appContext: e.appContext,
|
|
3085
|
+
dirs: e.dirs,
|
|
3086
|
+
transition: u,
|
|
3087
|
+
// These should technically only be non-null on mounted VNodes. However,
|
|
3088
|
+
// they *should* be copied for kept-alive vnodes. So we just always copy
|
|
3089
|
+
// them since them being non-null during a mount doesn't affect the logic as
|
|
3090
|
+
// they will simply be overwritten.
|
|
3091
|
+
component: e.component,
|
|
3092
|
+
suspense: e.suspense,
|
|
3093
|
+
ssContent: e.ssContent && Ze(e.ssContent),
|
|
3094
|
+
ssFallback: e.ssFallback && Ze(e.ssFallback),
|
|
3095
|
+
el: e.el,
|
|
3096
|
+
anchor: e.anchor,
|
|
3097
|
+
ctx: e.ctx,
|
|
3098
|
+
ce: e.ce
|
|
3099
|
+
};
|
|
3100
|
+
return u && n && Fs(
|
|
3101
|
+
a,
|
|
3102
|
+
u.clone(a)
|
|
3103
|
+
), a;
|
|
3104
|
+
}
|
|
3105
|
+
function go(e = " ", t = 0) {
|
|
3106
|
+
return fe(qt, null, e, t);
|
|
3107
|
+
}
|
|
3108
|
+
function me(e) {
|
|
3109
|
+
return e == null || typeof e == "boolean" ? fe(Xe) : A(e) ? fe(
|
|
3110
|
+
Te,
|
|
3111
|
+
null,
|
|
3112
|
+
// #3666, avoid reference pollution when reusing vnode
|
|
3113
|
+
e.slice()
|
|
3114
|
+
) : jt(e) ? Me(e) : fe(qt, null, String(e));
|
|
3115
|
+
}
|
|
3116
|
+
function Me(e) {
|
|
3117
|
+
return e.el === null && e.patchFlag !== -1 || e.memo ? e : Ze(e);
|
|
3118
|
+
}
|
|
3119
|
+
function Ns(e, t) {
|
|
3120
|
+
let s = 0;
|
|
3121
|
+
const { shapeFlag: n } = e;
|
|
3122
|
+
if (t == null)
|
|
3123
|
+
t = null;
|
|
3124
|
+
else if (A(t))
|
|
3125
|
+
s = 16;
|
|
3126
|
+
else if (typeof t == "object")
|
|
3127
|
+
if (n & 65) {
|
|
3128
|
+
const r = t.default;
|
|
3129
|
+
r && (r._c && (r._d = !1), Ns(e, r()), r._c && (r._d = !0));
|
|
3130
|
+
return;
|
|
3131
|
+
} else {
|
|
3132
|
+
s = 32;
|
|
3133
|
+
const r = t._;
|
|
3134
|
+
!r && !tr(t) ? t._ctx = be : r === 3 && be && (be.slots._ === 1 ? t._ = 1 : (t._ = 2, e.patchFlag |= 1024));
|
|
3135
|
+
}
|
|
3136
|
+
else I(t) ? (t = { default: t, _ctx: be }, s = 32) : (t = String(t), n & 64 ? (s = 16, t = [go(t)]) : s = 8);
|
|
3137
|
+
e.children = t, e.shapeFlag |= s;
|
|
3138
|
+
}
|
|
3139
|
+
function _o(...e) {
|
|
3140
|
+
const t = {};
|
|
3141
|
+
for (let s = 0; s < e.length; s++) {
|
|
3142
|
+
const n = e[s];
|
|
3143
|
+
for (const r in n)
|
|
3144
|
+
if (r === "class")
|
|
3145
|
+
t.class !== n.class && (t.class = Ss([t.class, n.class]));
|
|
3146
|
+
else if (r === "style")
|
|
3147
|
+
t.style = ws([t.style, n.style]);
|
|
3148
|
+
else if (Lt(r)) {
|
|
3149
|
+
const i = t[r], o = n[r];
|
|
3150
|
+
o && i !== o && !(A(i) && i.includes(o)) && (t[r] = i ? [].concat(i, o) : o);
|
|
3151
|
+
} else r !== "" && (t[r] = n[r]);
|
|
3152
|
+
}
|
|
3153
|
+
return t;
|
|
3154
|
+
}
|
|
3155
|
+
function ge(e, t, s, n = null) {
|
|
3156
|
+
ye(e, t, 7, [
|
|
3157
|
+
s,
|
|
3158
|
+
n
|
|
3159
|
+
]);
|
|
3160
|
+
}
|
|
3161
|
+
const mo = Qn();
|
|
3162
|
+
let bo = 0;
|
|
3163
|
+
function xo(e, t, s) {
|
|
3164
|
+
const n = e.type, r = (t ? t.appContext : e.appContext) || mo, i = {
|
|
3165
|
+
uid: bo++,
|
|
3166
|
+
vnode: e,
|
|
3167
|
+
type: n,
|
|
3168
|
+
parent: t,
|
|
3169
|
+
appContext: r,
|
|
3170
|
+
root: null,
|
|
3171
|
+
// to be immediately set
|
|
3172
|
+
next: null,
|
|
3173
|
+
subTree: null,
|
|
3174
|
+
// will be set synchronously right after creation
|
|
3175
|
+
effect: null,
|
|
3176
|
+
update: null,
|
|
3177
|
+
// will be set synchronously right after creation
|
|
3178
|
+
job: null,
|
|
3179
|
+
scope: new Kr(
|
|
3180
|
+
!0
|
|
3181
|
+
/* detached */
|
|
3182
|
+
),
|
|
3183
|
+
render: null,
|
|
3184
|
+
proxy: null,
|
|
3185
|
+
exposed: null,
|
|
3186
|
+
exposeProxy: null,
|
|
3187
|
+
withProxy: null,
|
|
3188
|
+
provides: t ? t.provides : Object.create(r.provides),
|
|
3189
|
+
ids: t ? t.ids : ["", 0, 0],
|
|
3190
|
+
accessCache: null,
|
|
3191
|
+
renderCache: [],
|
|
3192
|
+
// local resolved assets
|
|
3193
|
+
components: null,
|
|
3194
|
+
directives: null,
|
|
3195
|
+
// resolved props and emits options
|
|
3196
|
+
propsOptions: nr(n, r),
|
|
3197
|
+
emitsOptions: ar(n, r),
|
|
3198
|
+
// emit
|
|
3199
|
+
emit: null,
|
|
3200
|
+
// to be set immediately
|
|
3201
|
+
emitted: null,
|
|
3202
|
+
// props default value
|
|
3203
|
+
propsDefaults: V,
|
|
3204
|
+
// inheritAttrs
|
|
3205
|
+
inheritAttrs: n.inheritAttrs,
|
|
3206
|
+
// state
|
|
3207
|
+
ctx: V,
|
|
3208
|
+
data: V,
|
|
3209
|
+
props: V,
|
|
3210
|
+
attrs: V,
|
|
3211
|
+
slots: V,
|
|
3212
|
+
refs: V,
|
|
3213
|
+
setupState: V,
|
|
3214
|
+
setupContext: null,
|
|
3215
|
+
// suspense related
|
|
3216
|
+
suspense: s,
|
|
3217
|
+
suspenseId: s ? s.pendingId : 0,
|
|
3218
|
+
asyncDep: null,
|
|
3219
|
+
asyncResolved: !1,
|
|
3220
|
+
// lifecycle hooks
|
|
3221
|
+
// not using enums here because it results in computed properties
|
|
3222
|
+
isMounted: !1,
|
|
3223
|
+
isUnmounted: !1,
|
|
3224
|
+
isDeactivated: !1,
|
|
3225
|
+
bc: null,
|
|
3226
|
+
c: null,
|
|
3227
|
+
bm: null,
|
|
3228
|
+
m: null,
|
|
3229
|
+
bu: null,
|
|
3230
|
+
u: null,
|
|
3231
|
+
um: null,
|
|
3232
|
+
bum: null,
|
|
3233
|
+
da: null,
|
|
3234
|
+
a: null,
|
|
3235
|
+
rtg: null,
|
|
3236
|
+
rtc: null,
|
|
3237
|
+
ec: null,
|
|
3238
|
+
sp: null
|
|
3239
|
+
};
|
|
3240
|
+
return i.ctx = { _: i }, i.root = t ? t.root : i, i.emit = io.bind(null, i), e.ce && e.ce(i), i;
|
|
3241
|
+
}
|
|
3242
|
+
let k = null, Nt, gs;
|
|
3243
|
+
{
|
|
3244
|
+
const e = Vt(), t = (s, n) => {
|
|
3245
|
+
let r;
|
|
3246
|
+
return (r = e[s]) || (r = e[s] = []), r.push(n), (i) => {
|
|
3247
|
+
r.length > 1 ? r.forEach((o) => o(i)) : r[0](i);
|
|
3248
|
+
};
|
|
3249
|
+
};
|
|
3250
|
+
Nt = t(
|
|
3251
|
+
"__VUE_INSTANCE_SETTERS__",
|
|
3252
|
+
(s) => k = s
|
|
3253
|
+
), gs = t(
|
|
3254
|
+
"__VUE_SSR_SETTERS__",
|
|
3255
|
+
(s) => bt = s
|
|
3256
|
+
);
|
|
3257
|
+
}
|
|
3258
|
+
const vt = (e) => {
|
|
3259
|
+
const t = k;
|
|
3260
|
+
return Nt(e), e.scope.on(), () => {
|
|
3261
|
+
e.scope.off(), Nt(t);
|
|
3262
|
+
};
|
|
3263
|
+
}, rn = () => {
|
|
3264
|
+
k && k.scope.off(), Nt(null);
|
|
3265
|
+
};
|
|
3266
|
+
function pr(e) {
|
|
3267
|
+
return e.vnode.shapeFlag & 4;
|
|
3268
|
+
}
|
|
3269
|
+
let bt = !1;
|
|
3270
|
+
function vo(e, t = !1, s = !1) {
|
|
3271
|
+
t && gs(t);
|
|
3272
|
+
const { props: n, children: r } = e.vnode, i = pr(e);
|
|
3273
|
+
qi(e, n, i, t), zi(e, r, s || t);
|
|
3274
|
+
const o = i ? yo(e, t) : void 0;
|
|
3275
|
+
return t && gs(!1), o;
|
|
3276
|
+
}
|
|
3277
|
+
function yo(e, t) {
|
|
3278
|
+
const s = e.type;
|
|
3279
|
+
e.accessCache = /* @__PURE__ */ Object.create(null), e.proxy = new Proxy(e.ctx, ji);
|
|
3280
|
+
const { setup: n } = s;
|
|
3281
|
+
if (n) {
|
|
3282
|
+
Ee();
|
|
3283
|
+
const r = e.setupContext = n.length > 1 ? So(e) : null, i = vt(e), o = xt(
|
|
3284
|
+
n,
|
|
3285
|
+
e,
|
|
3286
|
+
0,
|
|
3287
|
+
[
|
|
3288
|
+
e.props,
|
|
3289
|
+
r
|
|
3290
|
+
]
|
|
3291
|
+
), f = yn(o);
|
|
3292
|
+
if (Oe(), i(), (f || e.sp) && !ht(e) && Gn(e), f) {
|
|
3293
|
+
if (o.then(rn, rn), t)
|
|
3294
|
+
return o.then((u) => {
|
|
3295
|
+
on(e, u);
|
|
3296
|
+
}).catch((u) => {
|
|
3297
|
+
Kt(u, e, 0);
|
|
3298
|
+
});
|
|
3299
|
+
e.asyncDep = o;
|
|
3300
|
+
} else
|
|
3301
|
+
on(e, o);
|
|
3302
|
+
} else
|
|
3303
|
+
gr(e);
|
|
3304
|
+
}
|
|
3305
|
+
function on(e, t, s) {
|
|
3306
|
+
I(t) ? e.type.__ssrInlineRender ? e.ssrRender = t : e.render = t : q(t) && (e.setupState = Un(t)), gr(e);
|
|
3307
|
+
}
|
|
3308
|
+
function gr(e, t, s) {
|
|
3309
|
+
const n = e.type;
|
|
3310
|
+
e.render || (e.render = n.render || xe);
|
|
3311
|
+
{
|
|
3312
|
+
const r = vt(e);
|
|
3313
|
+
Ee();
|
|
3314
|
+
try {
|
|
3315
|
+
Ni(e);
|
|
3316
|
+
} finally {
|
|
3317
|
+
Oe(), r();
|
|
3318
|
+
}
|
|
3319
|
+
}
|
|
3320
|
+
}
|
|
3321
|
+
const wo = {
|
|
3322
|
+
get(e, t) {
|
|
3323
|
+
return z(e, "get", ""), e[t];
|
|
3324
|
+
}
|
|
3325
|
+
};
|
|
3326
|
+
function So(e) {
|
|
3327
|
+
const t = (s) => {
|
|
3328
|
+
e.exposed = s || {};
|
|
3329
|
+
};
|
|
3330
|
+
return {
|
|
3331
|
+
attrs: new Proxy(e.attrs, wo),
|
|
3332
|
+
slots: e.slots,
|
|
3333
|
+
emit: e.emit,
|
|
3334
|
+
expose: t
|
|
3335
|
+
};
|
|
3336
|
+
}
|
|
3337
|
+
function Ls(e) {
|
|
3338
|
+
return e.exposed ? e.exposeProxy || (e.exposeProxy = new Proxy(Un(ci(e.exposed)), {
|
|
3339
|
+
get(t, s) {
|
|
3340
|
+
if (s in t)
|
|
3341
|
+
return t[s];
|
|
3342
|
+
if (s in pt)
|
|
3343
|
+
return pt[s](e);
|
|
3344
|
+
},
|
|
3345
|
+
has(t, s) {
|
|
3346
|
+
return s in t || s in pt;
|
|
3347
|
+
}
|
|
3348
|
+
})) : e.proxy;
|
|
3349
|
+
}
|
|
3350
|
+
function To(e) {
|
|
3351
|
+
return I(e) && "__vccOpts" in e;
|
|
3352
|
+
}
|
|
3353
|
+
const Co = (e, t) => hi(e, t, bt);
|
|
3354
|
+
function Eo(e, t, s) {
|
|
3355
|
+
const n = arguments.length;
|
|
3356
|
+
return n === 2 ? q(t) && !A(t) ? jt(t) ? fe(e, null, [t]) : fe(e, t) : fe(e, null, t) : (n > 3 ? s = Array.prototype.slice.call(arguments, 2) : n === 3 && jt(s) && (s = [s]), fe(e, t, s));
|
|
3357
|
+
}
|
|
3358
|
+
const Oo = "3.5.17";
|
|
3359
|
+
/**
|
|
3360
|
+
* @vue/runtime-dom v3.5.17
|
|
3361
|
+
* (c) 2018-present Yuxi (Evan) You and Vue contributors
|
|
3362
|
+
* @license MIT
|
|
3363
|
+
**/
|
|
3364
|
+
let _s;
|
|
3365
|
+
const ln = typeof window < "u" && window.trustedTypes;
|
|
3366
|
+
if (ln)
|
|
3367
|
+
try {
|
|
3368
|
+
_s = /* @__PURE__ */ ln.createPolicy("vue", {
|
|
3369
|
+
createHTML: (e) => e
|
|
3370
|
+
});
|
|
3371
|
+
} catch {
|
|
3372
|
+
}
|
|
3373
|
+
const _r = _s ? (e) => _s.createHTML(e) : (e) => e, Po = "http://www.w3.org/2000/svg", Ao = "http://www.w3.org/1998/Math/MathML", Se = typeof document < "u" ? document : null, fn = Se && /* @__PURE__ */ Se.createElement("template"), Io = {
|
|
3374
|
+
insert: (e, t, s) => {
|
|
3375
|
+
t.insertBefore(e, s || null);
|
|
3376
|
+
},
|
|
3377
|
+
remove: (e) => {
|
|
3378
|
+
const t = e.parentNode;
|
|
3379
|
+
t && t.removeChild(e);
|
|
3380
|
+
},
|
|
3381
|
+
createElement: (e, t, s, n) => {
|
|
3382
|
+
const r = t === "svg" ? Se.createElementNS(Po, e) : t === "mathml" ? Se.createElementNS(Ao, e) : s ? Se.createElement(e, { is: s }) : Se.createElement(e);
|
|
3383
|
+
return e === "select" && n && n.multiple != null && r.setAttribute("multiple", n.multiple), r;
|
|
3384
|
+
},
|
|
3385
|
+
createText: (e) => Se.createTextNode(e),
|
|
3386
|
+
createComment: (e) => Se.createComment(e),
|
|
3387
|
+
setText: (e, t) => {
|
|
3388
|
+
e.nodeValue = t;
|
|
3389
|
+
},
|
|
3390
|
+
setElementText: (e, t) => {
|
|
3391
|
+
e.textContent = t;
|
|
3392
|
+
},
|
|
3393
|
+
parentNode: (e) => e.parentNode,
|
|
3394
|
+
nextSibling: (e) => e.nextSibling,
|
|
3395
|
+
querySelector: (e) => Se.querySelector(e),
|
|
3396
|
+
setScopeId(e, t) {
|
|
3397
|
+
e.setAttribute(t, "");
|
|
3398
|
+
},
|
|
3399
|
+
// __UNSAFE__
|
|
3400
|
+
// Reason: innerHTML.
|
|
3401
|
+
// Static content here can only come from compiled templates.
|
|
3402
|
+
// As long as the user only uses trusted templates, this is safe.
|
|
3403
|
+
insertStaticContent(e, t, s, n, r, i) {
|
|
3404
|
+
const o = s ? s.previousSibling : t.lastChild;
|
|
3405
|
+
if (r && (r === i || r.nextSibling))
|
|
3406
|
+
for (; t.insertBefore(r.cloneNode(!0), s), !(r === i || !(r = r.nextSibling)); )
|
|
3407
|
+
;
|
|
3408
|
+
else {
|
|
3409
|
+
fn.innerHTML = _r(
|
|
3410
|
+
n === "svg" ? `<svg>${e}</svg>` : n === "mathml" ? `<math>${e}</math>` : e
|
|
3411
|
+
);
|
|
3412
|
+
const f = fn.content;
|
|
3413
|
+
if (n === "svg" || n === "mathml") {
|
|
3414
|
+
const u = f.firstChild;
|
|
3415
|
+
for (; u.firstChild; )
|
|
3416
|
+
f.appendChild(u.firstChild);
|
|
3417
|
+
f.removeChild(u);
|
|
3418
|
+
}
|
|
3419
|
+
t.insertBefore(f, s);
|
|
3420
|
+
}
|
|
3421
|
+
return [
|
|
3422
|
+
// first
|
|
3423
|
+
o ? o.nextSibling : t.firstChild,
|
|
3424
|
+
// last
|
|
3425
|
+
s ? s.previousSibling : t.lastChild
|
|
3426
|
+
];
|
|
3427
|
+
}
|
|
3428
|
+
}, Ro = Symbol("_vtc");
|
|
3429
|
+
function Mo(e, t, s) {
|
|
3430
|
+
const n = e[Ro];
|
|
3431
|
+
n && (t = (t ? [t, ...n] : [...n]).join(" ")), t == null ? e.removeAttribute("class") : s ? e.setAttribute("class", t) : e.className = t;
|
|
3432
|
+
}
|
|
3433
|
+
const cn = Symbol("_vod"), Fo = Symbol("_vsh"), Do = Symbol(""), Ho = /(^|;)\s*display\s*:/;
|
|
3434
|
+
function jo(e, t, s) {
|
|
3435
|
+
const n = e.style, r = J(s);
|
|
3436
|
+
let i = !1;
|
|
3437
|
+
if (s && !r) {
|
|
3438
|
+
if (t)
|
|
3439
|
+
if (J(t))
|
|
3440
|
+
for (const o of t.split(";")) {
|
|
3441
|
+
const f = o.slice(0, o.indexOf(":")).trim();
|
|
3442
|
+
s[f] == null && Rt(n, f, "");
|
|
3443
|
+
}
|
|
3444
|
+
else
|
|
3445
|
+
for (const o in t)
|
|
3446
|
+
s[o] == null && Rt(n, o, "");
|
|
3447
|
+
for (const o in s)
|
|
3448
|
+
o === "display" && (i = !0), Rt(n, o, s[o]);
|
|
3449
|
+
} else if (r) {
|
|
3450
|
+
if (t !== s) {
|
|
3451
|
+
const o = n[Do];
|
|
3452
|
+
o && (s += ";" + o), n.cssText = s, i = Ho.test(s);
|
|
3453
|
+
}
|
|
3454
|
+
} else t && e.removeAttribute("style");
|
|
3455
|
+
cn in e && (e[cn] = i ? n.display : "", e[Fo] && (n.display = "none"));
|
|
3456
|
+
}
|
|
3457
|
+
const un = /\s*!important$/;
|
|
3458
|
+
function Rt(e, t, s) {
|
|
3459
|
+
if (A(s))
|
|
3460
|
+
s.forEach((n) => Rt(e, t, n));
|
|
3461
|
+
else if (s == null && (s = ""), t.startsWith("--"))
|
|
3462
|
+
e.setProperty(t, s);
|
|
3463
|
+
else {
|
|
3464
|
+
const n = No(e, t);
|
|
3465
|
+
un.test(s) ? e.setProperty(
|
|
3466
|
+
Be(n),
|
|
3467
|
+
s.replace(un, ""),
|
|
3468
|
+
"important"
|
|
3469
|
+
) : e[n] = s;
|
|
3470
|
+
}
|
|
3471
|
+
}
|
|
3472
|
+
const an = ["Webkit", "Moz", "ms"], ns = {};
|
|
3473
|
+
function No(e, t) {
|
|
3474
|
+
const s = ns[t];
|
|
3475
|
+
if (s)
|
|
3476
|
+
return s;
|
|
3477
|
+
let n = He(t);
|
|
3478
|
+
if (n !== "filter" && n in e)
|
|
3479
|
+
return ns[t] = n;
|
|
3480
|
+
n = wn(n);
|
|
3481
|
+
for (let r = 0; r < an.length; r++) {
|
|
3482
|
+
const i = an[r] + n;
|
|
3483
|
+
if (i in e)
|
|
3484
|
+
return ns[t] = i;
|
|
3485
|
+
}
|
|
3486
|
+
return t;
|
|
3487
|
+
}
|
|
3488
|
+
const dn = "http://www.w3.org/1999/xlink";
|
|
3489
|
+
function hn(e, t, s, n, r, i = Vr(t)) {
|
|
3490
|
+
n && t.startsWith("xlink:") ? s == null ? e.removeAttributeNS(dn, t.slice(6, t.length)) : e.setAttributeNS(dn, t, s) : s == null || i && !Sn(s) ? e.removeAttribute(t) : e.setAttribute(
|
|
3491
|
+
t,
|
|
3492
|
+
i ? "" : Qe(s) ? String(s) : s
|
|
3493
|
+
);
|
|
3494
|
+
}
|
|
3495
|
+
function pn(e, t, s, n, r) {
|
|
3496
|
+
if (t === "innerHTML" || t === "textContent") {
|
|
3497
|
+
s != null && (e[t] = t === "innerHTML" ? _r(s) : s);
|
|
3498
|
+
return;
|
|
3499
|
+
}
|
|
3500
|
+
const i = e.tagName;
|
|
3501
|
+
if (t === "value" && i !== "PROGRESS" && // custom elements may use _value internally
|
|
3502
|
+
!i.includes("-")) {
|
|
3503
|
+
const f = i === "OPTION" ? e.getAttribute("value") || "" : e.value, u = s == null ? (
|
|
3504
|
+
// #11647: value should be set as empty string for null and undefined,
|
|
3505
|
+
// but <input type="checkbox"> should be set as 'on'.
|
|
3506
|
+
e.type === "checkbox" ? "on" : ""
|
|
3507
|
+
) : String(s);
|
|
3508
|
+
(f !== u || !("_value" in e)) && (e.value = u), s == null && e.removeAttribute(t), e._value = s;
|
|
3509
|
+
return;
|
|
3510
|
+
}
|
|
3511
|
+
let o = !1;
|
|
3512
|
+
if (s === "" || s == null) {
|
|
3513
|
+
const f = typeof e[t];
|
|
3514
|
+
f === "boolean" ? s = Sn(s) : s == null && f === "string" ? (s = "", o = !0) : f === "number" && (s = 0, o = !0);
|
|
3515
|
+
}
|
|
3516
|
+
try {
|
|
3517
|
+
e[t] = s;
|
|
3518
|
+
} catch {
|
|
3519
|
+
}
|
|
3520
|
+
o && e.removeAttribute(r || t);
|
|
3521
|
+
}
|
|
3522
|
+
function Lo(e, t, s, n) {
|
|
3523
|
+
e.addEventListener(t, s, n);
|
|
3524
|
+
}
|
|
3525
|
+
function $o(e, t, s, n) {
|
|
3526
|
+
e.removeEventListener(t, s, n);
|
|
3527
|
+
}
|
|
3528
|
+
const gn = Symbol("_vei");
|
|
3529
|
+
function Uo(e, t, s, n, r = null) {
|
|
3530
|
+
const i = e[gn] || (e[gn] = {}), o = i[t];
|
|
3531
|
+
if (n && o)
|
|
3532
|
+
o.value = n;
|
|
3533
|
+
else {
|
|
3534
|
+
const [f, u] = Vo(t);
|
|
3535
|
+
if (n) {
|
|
3536
|
+
const h = i[t] = Bo(
|
|
3537
|
+
n,
|
|
3538
|
+
r
|
|
3539
|
+
);
|
|
3540
|
+
Lo(e, f, h, u);
|
|
3541
|
+
} else o && ($o(e, f, o, u), i[t] = void 0);
|
|
3542
|
+
}
|
|
3543
|
+
}
|
|
3544
|
+
const _n = /(?:Once|Passive|Capture)$/;
|
|
3545
|
+
function Vo(e) {
|
|
3546
|
+
let t;
|
|
3547
|
+
if (_n.test(e)) {
|
|
3548
|
+
t = {};
|
|
3549
|
+
let n;
|
|
3550
|
+
for (; n = e.match(_n); )
|
|
3551
|
+
e = e.slice(0, e.length - n[0].length), t[n[0].toLowerCase()] = !0;
|
|
3552
|
+
}
|
|
3553
|
+
return [e[2] === ":" ? e.slice(3) : Be(e.slice(2)), t];
|
|
3554
|
+
}
|
|
3555
|
+
let rs = 0;
|
|
3556
|
+
const Ko = /* @__PURE__ */ Promise.resolve(), Wo = () => rs || (Ko.then(() => rs = 0), rs = Date.now());
|
|
3557
|
+
function Bo(e, t) {
|
|
3558
|
+
const s = (n) => {
|
|
3559
|
+
if (!n._vts)
|
|
3560
|
+
n._vts = Date.now();
|
|
3561
|
+
else if (n._vts <= s.attached)
|
|
3562
|
+
return;
|
|
3563
|
+
ye(
|
|
3564
|
+
qo(n, s.value),
|
|
3565
|
+
t,
|
|
3566
|
+
5,
|
|
3567
|
+
[n]
|
|
3568
|
+
);
|
|
3569
|
+
};
|
|
3570
|
+
return s.value = e, s.attached = Wo(), s;
|
|
3571
|
+
}
|
|
3572
|
+
function qo(e, t) {
|
|
3573
|
+
if (A(t)) {
|
|
3574
|
+
const s = e.stopImmediatePropagation;
|
|
3575
|
+
return e.stopImmediatePropagation = () => {
|
|
3576
|
+
s.call(e), e._stopped = !0;
|
|
3577
|
+
}, t.map(
|
|
3578
|
+
(n) => (r) => !r._stopped && n && n(r)
|
|
3579
|
+
);
|
|
3580
|
+
} else
|
|
3581
|
+
return t;
|
|
3582
|
+
}
|
|
3583
|
+
const mn = (e) => e.charCodeAt(0) === 111 && e.charCodeAt(1) === 110 && // lowercase letter
|
|
3584
|
+
e.charCodeAt(2) > 96 && e.charCodeAt(2) < 123, Go = (e, t, s, n, r, i) => {
|
|
3585
|
+
const o = r === "svg";
|
|
3586
|
+
t === "class" ? Mo(e, n, o) : t === "style" ? jo(e, s, n) : Lt(t) ? xs(t) || Uo(e, t, s, n, i) : (t[0] === "." ? (t = t.slice(1), !0) : t[0] === "^" ? (t = t.slice(1), !1) : Jo(e, t, n, o)) ? (pn(e, t, n), !e.tagName.includes("-") && (t === "value" || t === "checked" || t === "selected") && hn(e, t, n, o, i, t !== "value")) : /* #11081 force set props for possible async custom element */ e._isVueCE && (/[A-Z]/.test(t) || !J(n)) ? pn(e, He(t), n, i, t) : (t === "true-value" ? e._trueValue = n : t === "false-value" && (e._falseValue = n), hn(e, t, n, o));
|
|
3587
|
+
};
|
|
3588
|
+
function Jo(e, t, s, n) {
|
|
3589
|
+
if (n)
|
|
3590
|
+
return !!(t === "innerHTML" || t === "textContent" || t in e && mn(t) && I(s));
|
|
3591
|
+
if (t === "spellcheck" || t === "draggable" || t === "translate" || t === "autocorrect" || t === "form" || t === "list" && e.tagName === "INPUT" || t === "type" && e.tagName === "TEXTAREA")
|
|
3592
|
+
return !1;
|
|
3593
|
+
if (t === "width" || t === "height") {
|
|
3594
|
+
const r = e.tagName;
|
|
3595
|
+
if (r === "IMG" || r === "VIDEO" || r === "CANVAS" || r === "SOURCE")
|
|
3596
|
+
return !1;
|
|
3597
|
+
}
|
|
3598
|
+
return mn(t) && J(s) ? !1 : t in e;
|
|
3599
|
+
}
|
|
3600
|
+
const Yo = /* @__PURE__ */ te({ patchProp: Go }, Io);
|
|
3601
|
+
let bn;
|
|
3602
|
+
function zo() {
|
|
3603
|
+
return bn || (bn = Zi(Yo));
|
|
3604
|
+
}
|
|
3605
|
+
const Xo = (...e) => {
|
|
3606
|
+
zo().render(...e);
|
|
3607
|
+
};
|
|
3608
|
+
var Zo = Object.defineProperty, Qo = Object.getOwnPropertyDescriptor, ko = (e, t, s) => t in e ? Zo(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s, el = (e, t, s, n) => {
|
|
3609
|
+
for (var r = n > 1 ? void 0 : n ? Qo(t, s) : t, i = e.length - 1, o; i >= 0; i--)
|
|
3610
|
+
(o = e[i]) && (r = o(r) || r);
|
|
3611
|
+
return r;
|
|
3612
|
+
}, xn = (e, t) => (s, n) => t(s, n, e), tl = (e, t, s) => ko(e, t + "", s);
|
|
3613
|
+
let ms = class extends yr {
|
|
3614
|
+
constructor(e = {}, t, s) {
|
|
3615
|
+
super(), this._config = e, this._injector = t, this._componentManager = s;
|
|
3616
|
+
}
|
|
3617
|
+
onStarting() {
|
|
3618
|
+
this._componentManager.setHandler("vue3", (e) => (t) => {
|
|
3619
|
+
Tr(
|
|
3620
|
+
vn(sl, {
|
|
3621
|
+
component: e,
|
|
3622
|
+
// Prevent passing undefined or null props to Vue component
|
|
3623
|
+
props: Object.keys(t).filter((s) => t[s] !== void 0 && t[s] !== null).reduce((s, n) => (s[n] = t[n], s), {})
|
|
3624
|
+
})
|
|
3625
|
+
);
|
|
3626
|
+
});
|
|
3627
|
+
}
|
|
3628
|
+
};
|
|
3629
|
+
tl(ms, "pluginName", "UNIVER_UI_ADAPTER_VUE3_PLUGIN");
|
|
3630
|
+
ms = el([
|
|
3631
|
+
xr(wr),
|
|
3632
|
+
xn(1, Bs(vr)),
|
|
3633
|
+
xn(2, Bs(Sr))
|
|
3634
|
+
], ms);
|
|
3635
|
+
function sl(e) {
|
|
3636
|
+
const { component: t, props: s } = e, n = Cr(null);
|
|
3637
|
+
return Er(() => {
|
|
3638
|
+
if (!n.current) return;
|
|
3639
|
+
const r = Eo(t, s), i = document.createElement("div");
|
|
3640
|
+
return document.body.appendChild(i), Xo(r, n.current), () => {
|
|
3641
|
+
document.body.removeChild(i);
|
|
3642
|
+
};
|
|
3643
|
+
}, [s]), vn("div", { ref: n });
|
|
3644
|
+
}
|
|
3645
|
+
export {
|
|
3646
|
+
ms as UniverVue3AdapterPlugin
|
|
3647
|
+
};
|