@duxweb/dvha-elementui 1.2.8 → 1.2.10

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.
Files changed (17) hide show
  1. package/dist/cjs/components/menu/TreeMenu.vue_vue_type_script_setup_true_lang.cjs +1 -1
  2. package/dist/cjs/hooks/tab.cjs +1 -1
  3. package/dist/esm/components/menu/TreeMenu.vue_vue_type_script_setup_true_lang.js +19 -21
  4. package/dist/esm/hooks/tab.js +4 -5
  5. package/package.json +3 -3
  6. package/dist/cjs/node_modules/.pnpm/@vue_reactivity@3.5.31/node_modules/@vue/reactivity/dist/reactivity.esm-bundler.cjs +0 -1
  7. package/dist/cjs/node_modules/.pnpm/@vue_runtime-core@3.5.31/node_modules/@vue/runtime-core/dist/runtime-core.esm-bundler.cjs +0 -6
  8. package/dist/cjs/node_modules/.pnpm/@vue_shared@3.5.31/node_modules/@vue/shared/dist/shared.esm-bundler.cjs +0 -1
  9. package/dist/cjs/node_modules/.pnpm/vue-router@4.6.4_vue@3.5.31_typescript@6.0.2_/node_modules/vue-router/dist/devtools-EWN81iOl.cjs +0 -1
  10. package/dist/cjs/node_modules/.pnpm/vue-router@4.6.4_vue@3.5.31_typescript@6.0.2_/node_modules/vue-router/dist/vue-router.cjs +0 -1
  11. package/dist/cjs/node_modules/.pnpm/vue@3.5.31_typescript@6.0.2/node_modules/vue/dist/vue.runtime.esm-bundler.cjs +0 -1
  12. package/dist/esm/node_modules/.pnpm/@vue_reactivity@3.5.31/node_modules/@vue/reactivity/dist/reactivity.esm-bundler.js +0 -732
  13. package/dist/esm/node_modules/.pnpm/@vue_runtime-core@3.5.31/node_modules/@vue/runtime-core/dist/runtime-core.esm-bundler.js +0 -922
  14. package/dist/esm/node_modules/.pnpm/@vue_shared@3.5.31/node_modules/@vue/shared/dist/shared.esm-bundler.js +0 -54
  15. package/dist/esm/node_modules/.pnpm/vue-router@4.6.4_vue@3.5.31_typescript@6.0.2_/node_modules/vue-router/dist/devtools-EWN81iOl.js +0 -10
  16. package/dist/esm/node_modules/.pnpm/vue-router@4.6.4_vue@3.5.31_typescript@6.0.2_/node_modules/vue-router/dist/vue-router.js +0 -11
  17. package/dist/esm/node_modules/.pnpm/vue@3.5.31_typescript@6.0.2/node_modules/vue/dist/vue.runtime.esm-bundler.js +0 -9
@@ -1,732 +0,0 @@
1
- import { EMPTY_OBJ as e, NOOP as t, capitalize as n, def as r, extend as i, hasChanged as a, hasOwn as o, isArray as s, isFunction as c, isIntegerKey as l, isMap as u, isObject as d, isPlainObject as f, isSet as p, isSymbol as m, makeMap as ee, remove as te, toRawType as h } from "../../../../../@vue_shared@3.5.31/node_modules/@vue/shared/dist/shared.esm-bundler.js";
2
- //#region ../../node_modules/.pnpm/@vue+reactivity@3.5.31/node_modules/@vue/reactivity/dist/reactivity.esm-bundler.js
3
- function g(e, ...t) {
4
- console.warn(`[Vue warn] ${e}`, ...t);
5
- }
6
- var _;
7
- function ne() {
8
- return _;
9
- }
10
- var v, y = /* @__PURE__ */ new WeakSet(), re = class {
11
- constructor(e) {
12
- this.fn = e, this.deps = void 0, this.depsTail = void 0, this.flags = 5, this.next = void 0, this.cleanup = void 0, this.scheduler = void 0, _ && _.active && _.effects.push(this);
13
- }
14
- pause() {
15
- this.flags |= 64;
16
- }
17
- resume() {
18
- this.flags & 64 && (this.flags &= -65, y.has(this) && (y.delete(this), this.trigger()));
19
- }
20
- notify() {
21
- this.flags & 2 && !(this.flags & 32) || this.flags & 8 || C(this);
22
- }
23
- run() {
24
- if (!(this.flags & 1)) return this.fn();
25
- this.flags |= 2, fe(this), ie(this);
26
- let e = v, t = D;
27
- v = this, D = !0;
28
- try {
29
- return this.fn();
30
- } finally {
31
- process.env.NODE_ENV !== "production" && v !== this && g("Active effect was not restored correctly - this is likely a Vue internal bug."), ae(this), v = e, D = t, this.flags &= -3;
32
- }
33
- }
34
- stop() {
35
- if (this.flags & 1) {
36
- for (let e = this.deps; e; e = e.nextDep) E(e);
37
- this.deps = this.depsTail = void 0, fe(this), this.onStop && this.onStop(), this.flags &= -2;
38
- }
39
- }
40
- trigger() {
41
- this.flags & 64 ? y.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
42
- }
43
- runIfDirty() {
44
- oe(this) && this.run();
45
- }
46
- get dirty() {
47
- return oe(this);
48
- }
49
- }, b = 0, x, S;
50
- function C(e, t = !1) {
51
- if (e.flags |= 8, t) {
52
- e.next = S, S = e;
53
- return;
54
- }
55
- e.next = x, x = e;
56
- }
57
- function w() {
58
- b++;
59
- }
60
- function T() {
61
- if (--b > 0) return;
62
- if (S) {
63
- let e = S;
64
- for (S = void 0; e;) {
65
- let t = e.next;
66
- e.next = void 0, e.flags &= -9, e = t;
67
- }
68
- }
69
- let e;
70
- for (; x;) {
71
- let t = x;
72
- for (x = void 0; t;) {
73
- let n = t.next;
74
- if (t.next = void 0, t.flags &= -9, t.flags & 1) try {
75
- t.trigger();
76
- } catch (t) {
77
- e ||= t;
78
- }
79
- t = n;
80
- }
81
- }
82
- if (e) throw e;
83
- }
84
- function ie(e) {
85
- for (let t = e.deps; t; t = t.nextDep) t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
86
- }
87
- function ae(e) {
88
- let t, n = e.depsTail, r = n;
89
- for (; r;) {
90
- let e = r.prevDep;
91
- r.version === -1 ? (r === n && (n = e), E(r), ce(r)) : t = r, r.dep.activeLink = r.prevActiveLink, r.prevActiveLink = void 0, r = e;
92
- }
93
- e.deps = t, e.depsTail = n;
94
- }
95
- function oe(e) {
96
- for (let t = e.deps; t; t = t.nextDep) if (t.dep.version !== t.version || t.dep.computed && (se(t.dep.computed) || t.dep.version !== t.version)) return !0;
97
- return !!e._dirty;
98
- }
99
- function se(e) {
100
- if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === O) || (e.globalVersion = O, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !oe(e)))) return;
101
- e.flags |= 2;
102
- let t = e.dep, n = v, r = D;
103
- v = e, D = !0;
104
- try {
105
- ie(e);
106
- let n = e.fn(e._value);
107
- (t.version === 0 || a(n, e._value)) && (e.flags |= 128, e._value = n, t.version++);
108
- } catch (e) {
109
- throw t.version++, e;
110
- } finally {
111
- v = n, D = r, ae(e), e.flags &= -3;
112
- }
113
- }
114
- function E(e, t = !1) {
115
- let { dep: n, prevSub: r, nextSub: i } = e;
116
- if (r && (r.nextSub = i, e.prevSub = void 0), i && (i.prevSub = r, e.nextSub = void 0), process.env.NODE_ENV !== "production" && n.subsHead === e && (n.subsHead = i), n.subs === e && (n.subs = r, !r && n.computed)) {
117
- n.computed.flags &= -5;
118
- for (let e = n.computed.deps; e; e = e.nextDep) E(e, !0);
119
- }
120
- !t && !--n.sc && n.map && n.map.delete(n.key);
121
- }
122
- function ce(e) {
123
- let { prevDep: t, nextDep: n } = e;
124
- t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
125
- }
126
- var D = !0, le = [];
127
- function ue() {
128
- le.push(D), D = !1;
129
- }
130
- function de() {
131
- let e = le.pop();
132
- D = e === void 0 ? !0 : e;
133
- }
134
- function fe(e) {
135
- let { cleanup: t } = e;
136
- if (e.cleanup = void 0, t) {
137
- let e = v;
138
- v = void 0;
139
- try {
140
- t();
141
- } finally {
142
- v = e;
143
- }
144
- }
145
- }
146
- var O = 0, pe = class {
147
- constructor(e, t) {
148
- this.sub = e, this.dep = t, this.version = t.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
149
- }
150
- }, me = class {
151
- constructor(e) {
152
- this.computed = e, this.version = 0, this.activeLink = void 0, this.subs = void 0, this.map = void 0, this.key = void 0, this.sc = 0, this.__v_skip = !0, process.env.NODE_ENV !== "production" && (this.subsHead = void 0);
153
- }
154
- track(e) {
155
- if (!v || !D || v === this.computed) return;
156
- let t = this.activeLink;
157
- if (t === void 0 || t.sub !== v) t = this.activeLink = new pe(v, this), v.deps ? (t.prevDep = v.depsTail, v.depsTail.nextDep = t, v.depsTail = t) : v.deps = v.depsTail = t, he(t);
158
- else if (t.version === -1 && (t.version = this.version, t.nextDep)) {
159
- let e = t.nextDep;
160
- e.prevDep = t.prevDep, t.prevDep && (t.prevDep.nextDep = e), t.prevDep = v.depsTail, t.nextDep = void 0, v.depsTail.nextDep = t, v.depsTail = t, v.deps === t && (v.deps = e);
161
- }
162
- return process.env.NODE_ENV !== "production" && v.onTrack && v.onTrack(i({ effect: v }, e)), t;
163
- }
164
- trigger(e) {
165
- this.version++, O++, this.notify(e);
166
- }
167
- notify(e) {
168
- w();
169
- try {
170
- if (process.env.NODE_ENV !== "production") for (let t = this.subsHead; t; t = t.nextSub) t.sub.onTrigger && !(t.sub.flags & 8) && t.sub.onTrigger(i({ effect: t.sub }, e));
171
- for (let e = this.subs; e; e = e.prevSub) e.sub.notify() && e.sub.dep.notify();
172
- } finally {
173
- T();
174
- }
175
- }
176
- };
177
- function he(e) {
178
- if (e.dep.sc++, e.sub.flags & 4) {
179
- let t = e.dep.computed;
180
- if (t && !e.dep.subs) {
181
- t.flags |= 20;
182
- for (let e = t.deps; e; e = e.nextDep) he(e);
183
- }
184
- let n = e.dep.subs;
185
- n !== e && (e.prevSub = n, n && (n.nextSub = e)), process.env.NODE_ENV !== "production" && e.dep.subsHead === void 0 && (e.dep.subsHead = e), e.dep.subs = e;
186
- }
187
- }
188
- var ge = /* @__PURE__ */ new WeakMap(), k = /* @__PURE__ */ Symbol(process.env.NODE_ENV === "production" ? "" : "Object iterate"), A = /* @__PURE__ */ Symbol(process.env.NODE_ENV === "production" ? "" : "Map keys iterate"), j = /* @__PURE__ */ Symbol(process.env.NODE_ENV === "production" ? "" : "Array iterate");
189
- function M(e, t, n) {
190
- if (D && v) {
191
- let r = ge.get(e);
192
- r || ge.set(e, r = /* @__PURE__ */ new Map());
193
- let i = r.get(n);
194
- i || (r.set(n, i = new me()), i.map = r, i.key = n), process.env.NODE_ENV === "production" ? i.track() : i.track({
195
- target: e,
196
- type: t,
197
- key: n
198
- });
199
- }
200
- }
201
- function N(e, t, n, r, i, a) {
202
- let o = ge.get(e);
203
- if (!o) {
204
- O++;
205
- return;
206
- }
207
- let c = (o) => {
208
- o && (process.env.NODE_ENV === "production" ? o.trigger() : o.trigger({
209
- target: e,
210
- type: t,
211
- key: n,
212
- newValue: r,
213
- oldValue: i,
214
- oldTarget: a
215
- }));
216
- };
217
- if (w(), t === "clear") o.forEach(c);
218
- else {
219
- let i = s(e), a = i && l(n);
220
- if (i && n === "length") {
221
- let e = Number(r);
222
- o.forEach((t, n) => {
223
- (n === "length" || n === j || !m(n) && n >= e) && c(t);
224
- });
225
- } else switch ((n !== void 0 || o.has(void 0)) && c(o.get(n)), a && c(o.get(j)), t) {
226
- case "add":
227
- i ? a && c(o.get("length")) : (c(o.get(k)), u(e) && c(o.get(A)));
228
- break;
229
- case "delete":
230
- i || (c(o.get(k)), u(e) && c(o.get(A)));
231
- break;
232
- case "set":
233
- u(e) && c(o.get(k));
234
- break;
235
- }
236
- }
237
- T();
238
- }
239
- function P(e) {
240
- let t = /* @__PURE__ */ K(e);
241
- return t === e ? t : (M(t, "iterate", j), /* @__PURE__ */ G(e) ? t : t.map(q));
242
- }
243
- function F(e) {
244
- return M(e = /* @__PURE__ */ K(e), "iterate", j), e;
245
- }
246
- function I(e, t) {
247
- return /* @__PURE__ */ W(e) ? J(/* @__PURE__ */ U(e) ? q(t) : t) : q(t);
248
- }
249
- var _e = {
250
- __proto__: null,
251
- [Symbol.iterator]() {
252
- return L(this, Symbol.iterator, (e) => I(this, e));
253
- },
254
- concat(...e) {
255
- return P(this).concat(...e.map((e) => s(e) ? P(e) : e));
256
- },
257
- entries() {
258
- return L(this, "entries", (e) => (e[1] = I(this, e[1]), e));
259
- },
260
- every(e, t) {
261
- return R(this, "every", e, t, void 0, arguments);
262
- },
263
- filter(e, t) {
264
- return R(this, "filter", e, t, (e) => e.map((e) => I(this, e)), arguments);
265
- },
266
- find(e, t) {
267
- return R(this, "find", e, t, (e) => I(this, e), arguments);
268
- },
269
- findIndex(e, t) {
270
- return R(this, "findIndex", e, t, void 0, arguments);
271
- },
272
- findLast(e, t) {
273
- return R(this, "findLast", e, t, (e) => I(this, e), arguments);
274
- },
275
- findLastIndex(e, t) {
276
- return R(this, "findLastIndex", e, t, void 0, arguments);
277
- },
278
- forEach(e, t) {
279
- return R(this, "forEach", e, t, void 0, arguments);
280
- },
281
- includes(...e) {
282
- return be(this, "includes", e);
283
- },
284
- indexOf(...e) {
285
- return be(this, "indexOf", e);
286
- },
287
- join(e) {
288
- return P(this).join(e);
289
- },
290
- lastIndexOf(...e) {
291
- return be(this, "lastIndexOf", e);
292
- },
293
- map(e, t) {
294
- return R(this, "map", e, t, void 0, arguments);
295
- },
296
- pop() {
297
- return z(this, "pop");
298
- },
299
- push(...e) {
300
- return z(this, "push", e);
301
- },
302
- reduce(e, ...t) {
303
- return ye(this, "reduce", e, t);
304
- },
305
- reduceRight(e, ...t) {
306
- return ye(this, "reduceRight", e, t);
307
- },
308
- shift() {
309
- return z(this, "shift");
310
- },
311
- some(e, t) {
312
- return R(this, "some", e, t, void 0, arguments);
313
- },
314
- splice(...e) {
315
- return z(this, "splice", e);
316
- },
317
- toReversed() {
318
- return P(this).toReversed();
319
- },
320
- toSorted(e) {
321
- return P(this).toSorted(e);
322
- },
323
- toSpliced(...e) {
324
- return P(this).toSpliced(...e);
325
- },
326
- unshift(...e) {
327
- return z(this, "unshift", e);
328
- },
329
- values() {
330
- return L(this, "values", (e) => I(this, e));
331
- }
332
- };
333
- function L(e, t, n) {
334
- let r = F(e), i = r[t]();
335
- return r !== e && !/* @__PURE__ */ G(e) && (i._next = i.next, i.next = () => {
336
- let e = i._next();
337
- return e.done || (e.value = n(e.value)), e;
338
- }), i;
339
- }
340
- var ve = Array.prototype;
341
- function R(e, t, n, r, i, a) {
342
- let o = F(e), s = o !== e && !/* @__PURE__ */ G(e), c = o[t];
343
- if (c !== ve[t]) {
344
- let t = c.apply(e, a);
345
- return s ? q(t) : t;
346
- }
347
- let l = n;
348
- o !== e && (s ? l = function(t, r) {
349
- return n.call(this, I(e, t), r, e);
350
- } : n.length > 2 && (l = function(t, r) {
351
- return n.call(this, t, r, e);
352
- }));
353
- let u = c.call(o, l, r);
354
- return s && i ? i(u) : u;
355
- }
356
- function ye(e, t, n, r) {
357
- let i = F(e), a = i !== e && !/* @__PURE__ */ G(e), o = n, s = !1;
358
- i !== e && (a ? (s = r.length === 0, o = function(t, r, i) {
359
- return s && (s = !1, t = I(e, t)), n.call(this, t, I(e, r), i, e);
360
- }) : n.length > 3 && (o = function(t, r, i) {
361
- return n.call(this, t, r, i, e);
362
- }));
363
- let c = i[t](o, ...r);
364
- return s ? I(e, c) : c;
365
- }
366
- function be(e, t, n) {
367
- let r = /* @__PURE__ */ K(e);
368
- M(r, "iterate", j);
369
- let i = r[t](...n);
370
- return (i === -1 || i === !1) && /* @__PURE__ */ qe(n[0]) ? (n[0] = /* @__PURE__ */ K(n[0]), r[t](...n)) : i;
371
- }
372
- function z(e, t, n = []) {
373
- ue(), w();
374
- let r = (/* @__PURE__ */ K(e))[t].apply(e, n);
375
- return T(), de(), r;
376
- }
377
- var xe = /* @__PURE__ */ ee("__proto__,__v_isRef,__isVue"), Se = new Set(/* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(m));
378
- function Ce(e) {
379
- m(e) || (e = String(e));
380
- let t = /* @__PURE__ */ K(this);
381
- return M(t, "has", e), t.hasOwnProperty(e);
382
- }
383
- var we = class {
384
- constructor(e = !1, t = !1) {
385
- this._isReadonly = e, this._isShallow = t;
386
- }
387
- get(e, t, n) {
388
- if (t === "__v_skip") return e.__v_skip;
389
- let r = this._isReadonly, i = this._isShallow;
390
- if (t === "__v_isReactive") return !r;
391
- if (t === "__v_isReadonly") return r;
392
- if (t === "__v_isShallow") return i;
393
- if (t === "__v_raw") return n === (r ? i ? Ve : Be : i ? ze : Re).get(e) || Object.getPrototypeOf(e) === Object.getPrototypeOf(n) ? e : void 0;
394
- let a = s(e);
395
- if (!r) {
396
- let e;
397
- if (a && (e = _e[t])) return e;
398
- if (t === "hasOwnProperty") return Ce;
399
- }
400
- let o = Reflect.get(e, t, /* @__PURE__ */ Y(e) ? e : n);
401
- if ((m(t) ? Se.has(t) : xe(t)) || (r || M(e, "get", t), i)) return o;
402
- if (/* @__PURE__ */ Y(o)) {
403
- let e = a && l(t) ? o : o.value;
404
- return r && d(e) ? /* @__PURE__ */ H(e) : e;
405
- }
406
- return d(o) ? r ? /* @__PURE__ */ H(o) : /* @__PURE__ */ We(o) : o;
407
- }
408
- }, Te = class extends we {
409
- constructor(e = !1) {
410
- super(!1, e);
411
- }
412
- set(e, t, n, r) {
413
- let i = e[t], c = s(e) && l(t);
414
- if (!this._isShallow) {
415
- let r = /* @__PURE__ */ W(i);
416
- if (!/* @__PURE__ */ G(n) && !/* @__PURE__ */ W(n) && (i = /* @__PURE__ */ K(i), n = /* @__PURE__ */ K(n)), !c && /* @__PURE__ */ Y(i) && !/* @__PURE__ */ Y(n)) return r ? (process.env.NODE_ENV !== "production" && g(`Set operation on key "${String(t)}" failed: target is readonly.`, e[t]), !0) : (i.value = n, !0);
417
- }
418
- let u = c ? Number(t) < e.length : o(e, t), d = Reflect.set(e, t, n, /* @__PURE__ */ Y(e) ? e : r);
419
- return e === /* @__PURE__ */ K(r) && (u ? a(n, i) && N(e, "set", t, n, i) : N(e, "add", t, n)), d;
420
- }
421
- deleteProperty(e, t) {
422
- let n = o(e, t), r = e[t], i = Reflect.deleteProperty(e, t);
423
- return i && n && N(e, "delete", t, void 0, r), i;
424
- }
425
- has(e, t) {
426
- let n = Reflect.has(e, t);
427
- return (!m(t) || !Se.has(t)) && M(e, "has", t), n;
428
- }
429
- ownKeys(e) {
430
- return M(e, "iterate", s(e) ? "length" : k), Reflect.ownKeys(e);
431
- }
432
- }, Ee = class extends we {
433
- constructor(e = !1) {
434
- super(!0, e);
435
- }
436
- set(e, t) {
437
- return process.env.NODE_ENV !== "production" && g(`Set operation on key "${String(t)}" failed: target is readonly.`, e), !0;
438
- }
439
- deleteProperty(e, t) {
440
- return process.env.NODE_ENV !== "production" && g(`Delete operation on key "${String(t)}" failed: target is readonly.`, e), !0;
441
- }
442
- }, De = /* @__PURE__ */ new Te(), Oe = /* @__PURE__ */ new Ee(), ke = /* @__PURE__ */ new Ee(!0), Ae = (e) => e, B = (e) => Reflect.getPrototypeOf(e);
443
- function je(e, t, n) {
444
- return function(...r) {
445
- let a = this.__v_raw, o = /* @__PURE__ */ K(a), s = u(o), c = e === "entries" || e === Symbol.iterator && s, l = e === "keys" && s, d = a[e](...r), f = n ? Ae : t ? J : q;
446
- return !t && M(o, "iterate", l ? A : k), i(Object.create(d), { next() {
447
- let { value: e, done: t } = d.next();
448
- return t ? {
449
- value: e,
450
- done: t
451
- } : {
452
- value: c ? [f(e[0]), f(e[1])] : f(e),
453
- done: t
454
- };
455
- } });
456
- };
457
- }
458
- function V(e) {
459
- return function(...t) {
460
- if (process.env.NODE_ENV !== "production") {
461
- let r = t[0] ? `on key "${t[0]}" ` : "";
462
- g(`${n(e)} operation ${r}failed: target is readonly.`, /* @__PURE__ */ K(this));
463
- }
464
- return e === "delete" ? !1 : e === "clear" ? void 0 : this;
465
- };
466
- }
467
- function Me(e, t) {
468
- let n = {
469
- get(n) {
470
- let r = this.__v_raw, i = /* @__PURE__ */ K(r), o = /* @__PURE__ */ K(n);
471
- e || (a(n, o) && M(i, "get", n), M(i, "get", o));
472
- let { has: s } = B(i), c = t ? Ae : e ? J : q;
473
- if (s.call(i, n)) return c(r.get(n));
474
- if (s.call(i, o)) return c(r.get(o));
475
- r !== i && r.get(n);
476
- },
477
- get size() {
478
- let t = this.__v_raw;
479
- return !e && M(/* @__PURE__ */ K(t), "iterate", k), t.size;
480
- },
481
- has(t) {
482
- let n = this.__v_raw, r = /* @__PURE__ */ K(n), i = /* @__PURE__ */ K(t);
483
- return e || (a(t, i) && M(r, "has", t), M(r, "has", i)), t === i ? n.has(t) : n.has(t) || n.has(i);
484
- },
485
- forEach(n, r) {
486
- let i = this, a = i.__v_raw, o = /* @__PURE__ */ K(a), s = t ? Ae : e ? J : q;
487
- return !e && M(o, "iterate", k), a.forEach((e, t) => n.call(r, s(e), s(t), i));
488
- }
489
- };
490
- return i(n, e ? {
491
- add: V("add"),
492
- set: V("set"),
493
- delete: V("delete"),
494
- clear: V("clear")
495
- } : {
496
- add(e) {
497
- let n = /* @__PURE__ */ K(this), r = B(n), i = /* @__PURE__ */ K(e), o = !t && !/* @__PURE__ */ G(e) && !/* @__PURE__ */ W(e) ? i : e;
498
- return r.has.call(n, o) || a(e, o) && r.has.call(n, e) || a(i, o) && r.has.call(n, i) || (n.add(o), N(n, "add", o, o)), this;
499
- },
500
- set(e, n) {
501
- !t && !/* @__PURE__ */ G(n) && !/* @__PURE__ */ W(n) && (n = /* @__PURE__ */ K(n));
502
- let r = /* @__PURE__ */ K(this), { has: i, get: o } = B(r), s = i.call(r, e);
503
- s ? process.env.NODE_ENV !== "production" && Le(r, i, e) : (e = /* @__PURE__ */ K(e), s = i.call(r, e));
504
- let c = o.call(r, e);
505
- return r.set(e, n), s ? a(n, c) && N(r, "set", e, n, c) : N(r, "add", e, n), this;
506
- },
507
- delete(e) {
508
- let t = /* @__PURE__ */ K(this), { has: n, get: r } = B(t), i = n.call(t, e);
509
- i ? process.env.NODE_ENV !== "production" && Le(t, n, e) : (e = /* @__PURE__ */ K(e), i = n.call(t, e));
510
- let a = r ? r.call(t, e) : void 0, o = t.delete(e);
511
- return i && N(t, "delete", e, void 0, a), o;
512
- },
513
- clear() {
514
- let e = /* @__PURE__ */ K(this), t = e.size !== 0, n = process.env.NODE_ENV === "production" ? void 0 : u(e) ? new Map(e) : new Set(e), r = e.clear();
515
- return t && N(e, "clear", void 0, void 0, n), r;
516
- }
517
- }), [
518
- "keys",
519
- "values",
520
- "entries",
521
- Symbol.iterator
522
- ].forEach((r) => {
523
- n[r] = je(r, e, t);
524
- }), n;
525
- }
526
- function Ne(e, t) {
527
- let n = Me(e, t);
528
- return (t, r, i) => r === "__v_isReactive" ? !e : r === "__v_isReadonly" ? e : r === "__v_raw" ? t : Reflect.get(o(n, r) && r in t ? n : t, r, i);
529
- }
530
- var Pe = { get: /* @__PURE__ */ Ne(!1, !1) }, Fe = { get: /* @__PURE__ */ Ne(!0, !1) }, Ie = { get: /* @__PURE__ */ Ne(!0, !0) };
531
- function Le(e, t, n) {
532
- let r = /* @__PURE__ */ K(n);
533
- if (r !== n && t.call(e, r)) {
534
- let t = h(e);
535
- g(`Reactive ${t} contains both the raw and reactive versions of the same object${t === "Map" ? " as keys" : ""}, which can lead to inconsistencies. Avoid differentiating between the raw and reactive versions of an object and only use the reactive version if possible.`);
536
- }
537
- }
538
- var Re = /* @__PURE__ */ new WeakMap(), ze = /* @__PURE__ */ new WeakMap(), Be = /* @__PURE__ */ new WeakMap(), Ve = /* @__PURE__ */ new WeakMap();
539
- function He(e) {
540
- switch (e) {
541
- case "Object":
542
- case "Array": return 1;
543
- case "Map":
544
- case "Set":
545
- case "WeakMap":
546
- case "WeakSet": return 2;
547
- default: return 0;
548
- }
549
- }
550
- function Ue(e) {
551
- return e.__v_skip || !Object.isExtensible(e) ? 0 : He(h(e));
552
- }
553
- /* @__NO_SIDE_EFFECTS__ */
554
- function We(e) {
555
- return /* @__PURE__ */ W(e) ? e : Ke(e, !1, De, Pe, Re);
556
- }
557
- /* @__NO_SIDE_EFFECTS__ */
558
- function H(e) {
559
- return Ke(e, !0, Oe, Fe, Be);
560
- }
561
- /* @__NO_SIDE_EFFECTS__ */
562
- function Ge(e) {
563
- return Ke(e, !0, ke, Ie, Ve);
564
- }
565
- function Ke(e, t, n, r, i) {
566
- if (!d(e)) return process.env.NODE_ENV !== "production" && g(`value cannot be made ${t ? "readonly" : "reactive"}: ${String(e)}`), e;
567
- if (e.__v_raw && !(t && e.__v_isReactive)) return e;
568
- let a = Ue(e);
569
- if (a === 0) return e;
570
- let o = i.get(e);
571
- if (o) return o;
572
- let s = new Proxy(e, a === 2 ? r : n);
573
- return i.set(e, s), s;
574
- }
575
- /* @__NO_SIDE_EFFECTS__ */
576
- function U(e) {
577
- return /* @__PURE__ */ W(e) ? /* @__PURE__ */ U(e.__v_raw) : !!(e && e.__v_isReactive);
578
- }
579
- /* @__NO_SIDE_EFFECTS__ */
580
- function W(e) {
581
- return !!(e && e.__v_isReadonly);
582
- }
583
- /* @__NO_SIDE_EFFECTS__ */
584
- function G(e) {
585
- return !!(e && e.__v_isShallow);
586
- }
587
- /* @__NO_SIDE_EFFECTS__ */
588
- function qe(e) {
589
- return e ? !!e.__v_raw : !1;
590
- }
591
- /* @__NO_SIDE_EFFECTS__ */
592
- function K(e) {
593
- let t = e && e.__v_raw;
594
- return t ? /* @__PURE__ */ K(t) : e;
595
- }
596
- function Je(e) {
597
- return !o(e, "__v_skip") && Object.isExtensible(e) && r(e, "__v_skip", !0), e;
598
- }
599
- var q = (e) => d(e) ? /* @__PURE__ */ We(e) : e, J = (e) => d(e) ? /* @__PURE__ */ H(e) : e;
600
- /* @__NO_SIDE_EFFECTS__ */
601
- function Y(e) {
602
- return e ? e.__v_isRef === !0 : !1;
603
- }
604
- function Ye(e) {
605
- return /* @__PURE__ */ Y(e) ? e.value : e;
606
- }
607
- var Xe = {
608
- get: (e, t, n) => t === "__v_raw" ? e : Ye(Reflect.get(e, t, n)),
609
- set: (e, t, n, r) => {
610
- let i = e[t];
611
- return /* @__PURE__ */ Y(i) && !/* @__PURE__ */ Y(n) ? (i.value = n, !0) : Reflect.set(e, t, n, r);
612
- }
613
- };
614
- function Ze(e) {
615
- return /* @__PURE__ */ U(e) ? e : new Proxy(e, Xe);
616
- }
617
- var Qe = class {
618
- constructor(e, t, n) {
619
- this.fn = e, this.setter = t, this._value = void 0, this.dep = new me(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = O - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !t, this.isSSR = n;
620
- }
621
- notify() {
622
- if (this.flags |= 16, !(this.flags & 8) && v !== this) return C(this, !0), !0;
623
- process.env.NODE_ENV;
624
- }
625
- get value() {
626
- let e = process.env.NODE_ENV === "production" ? this.dep.track() : this.dep.track({
627
- target: this,
628
- type: "get",
629
- key: "value"
630
- });
631
- return se(this), e && (e.version = this.dep.version), this._value;
632
- }
633
- set value(e) {
634
- this.setter ? this.setter(e) : process.env.NODE_ENV !== "production" && g("Write operation failed: computed value is readonly");
635
- }
636
- };
637
- /* @__NO_SIDE_EFFECTS__ */
638
- function $e(e, t, n = !1) {
639
- let r, i;
640
- c(e) ? r = e : (r = e.get, i = e.set);
641
- let a = new Qe(r, i, n);
642
- return process.env.NODE_ENV !== "production" && t && !n && (a.onTrack = t.onTrack, a.onTrigger = t.onTrigger), a;
643
- }
644
- var X = {}, Z = /* @__PURE__ */ new WeakMap(), Q = void 0;
645
- function et(e, t = !1, n = Q) {
646
- if (n) {
647
- let t = Z.get(n);
648
- t || Z.set(n, t = []), t.push(e);
649
- } else process.env.NODE_ENV !== "production" && !t && g("onWatcherCleanup() was called when there was no active watcher to associate with.");
650
- }
651
- function tt(n, r, i = e) {
652
- let { immediate: o, deep: l, once: u, scheduler: d, augmentJob: f, call: p } = i, m = (e) => {
653
- (i.onWarn || g)("Invalid watch source: ", e, "A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types.");
654
- }, ee = (e) => l ? e : /* @__PURE__ */ G(e) || l === !1 || l === 0 ? $(e, 1) : $(e), h, _, v, y, b = !1, x = !1;
655
- if (/* @__PURE__ */ Y(n) ? (_ = () => n.value, b = /* @__PURE__ */ G(n)) : /* @__PURE__ */ U(n) ? (_ = () => ee(n), b = !0) : s(n) ? (x = !0, b = n.some((e) => /* @__PURE__ */ U(e) || /* @__PURE__ */ G(e)), _ = () => n.map((e) => {
656
- if (/* @__PURE__ */ Y(e)) return e.value;
657
- if (/* @__PURE__ */ U(e)) return ee(e);
658
- if (c(e)) return p ? p(e, 2) : e();
659
- process.env.NODE_ENV !== "production" && m(e);
660
- })) : c(n) ? _ = r ? p ? () => p(n, 2) : n : () => {
661
- if (v) {
662
- ue();
663
- try {
664
- v();
665
- } finally {
666
- de();
667
- }
668
- }
669
- let e = Q;
670
- Q = h;
671
- try {
672
- return p ? p(n, 3, [y]) : n(y);
673
- } finally {
674
- Q = e;
675
- }
676
- } : (_ = t, process.env.NODE_ENV !== "production" && m(n)), r && l) {
677
- let e = _, t = l === !0 ? Infinity : l;
678
- _ = () => $(e(), t);
679
- }
680
- let S = ne(), C = () => {
681
- h.stop(), S && S.active && te(S.effects, h);
682
- };
683
- if (u && r) {
684
- let e = r;
685
- r = (...t) => {
686
- e(...t), C();
687
- };
688
- }
689
- let w = x ? Array(n.length).fill(X) : X, T = (e) => {
690
- if (!(!(h.flags & 1) || !h.dirty && !e)) if (r) {
691
- let e = h.run();
692
- if (l || b || (x ? e.some((e, t) => a(e, w[t])) : a(e, w))) {
693
- v && v();
694
- let t = Q;
695
- Q = h;
696
- try {
697
- let t = [
698
- e,
699
- w === X ? void 0 : x && w[0] === X ? [] : w,
700
- y
701
- ];
702
- w = e, p ? p(r, 3, t) : r(...t);
703
- } finally {
704
- Q = t;
705
- }
706
- }
707
- } else h.run();
708
- };
709
- return f && f(T), h = new re(_), h.scheduler = d ? () => d(T, !1) : T, y = (e) => et(e, !1, h), v = h.onStop = () => {
710
- let e = Z.get(h);
711
- if (e) {
712
- if (p) p(e, 4);
713
- else for (let t of e) t();
714
- Z.delete(h);
715
- }
716
- }, process.env.NODE_ENV !== "production" && (h.onTrack = i.onTrack, h.onTrigger = i.onTrigger), r ? o ? T(!0) : w = h.run() : d ? d(T.bind(null, !0), !0) : h.run(), C.pause = h.pause.bind(h), C.resume = h.resume.bind(h), C.stop = C, C;
717
- }
718
- function $(e, t = Infinity, n) {
719
- if (t <= 0 || !d(e) || e.__v_skip || (n ||= /* @__PURE__ */ new Map(), (n.get(e) || 0) >= t)) return e;
720
- if (n.set(e, t), t--, /* @__PURE__ */ Y(e)) $(e.value, t, n);
721
- else if (s(e)) for (let r = 0; r < e.length; r++) $(e[r], t, n);
722
- else if (p(e) || u(e)) e.forEach((e) => {
723
- $(e, t, n);
724
- });
725
- else if (f(e)) {
726
- for (let r in e) $(e[r], t, n);
727
- for (let r of Object.getOwnPropertySymbols(e)) Object.prototype.propertyIsEnumerable.call(e, r) && $(e[r], t, n);
728
- }
729
- return e;
730
- }
731
- //#endregion
732
- export { re as ReactiveEffect, $e as computed, ne as getCurrentScope, qe as isProxy, U as isReactive, W as isReadonly, Y as isRef, G as isShallow, Je as markRaw, et as onWatcherCleanup, ue as pauseTracking, Ze as proxyRefs, We as reactive, H as readonly, de as resetTracking, F as shallowReadArray, Ge as shallowReadonly, K as toRaw, q as toReactive, J as toReadonly, M as track, Ye as unref, tt as watch };