@duxweb/dvha-elementui 1.2.6 → 1.2.7

package/dist/esm/node_modules/.pnpm/@vue_reactivity@3.5.31/node_modules/@vue/reactivity/dist/reactivity.esm-bundler.js

@@ -0,0 +1,732 @@
+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";
+//#region ../../node_modules/.pnpm/@vue+reactivity@3.5.31/node_modules/@vue/reactivity/dist/reactivity.esm-bundler.js
+function g(e, ...t) {
+	console.warn(`[Vue warn] ${e}`, ...t);
+}
+var _;
+function ne() {
+	return _;
+}
+var v, y = /* @__PURE__ */ new WeakSet(), re = class {
+	constructor(e) {
+		this.fn = e, this.deps = void 0, this.depsTail = void 0, this.flags = 5, this.next = void 0, this.cleanup = void 0, this.scheduler = void 0, _ && _.active && _.effects.push(this);
+	}
+	pause() {
+		this.flags |= 64;
+	}
+	resume() {
+		this.flags & 64 && (this.flags &= -65, y.has(this) && (y.delete(this), this.trigger()));
+	}
+	notify() {
+		this.flags & 2 && !(this.flags & 32) || this.flags & 8 || C(this);
+	}
+	run() {
+		if (!(this.flags & 1)) return this.fn();
+		this.flags |= 2, fe(this), ie(this);
+		let e = v, t = D;
+		v = this, D = !0;
+		try {
+			return this.fn();
+		} finally {
+			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;
+		}
+	}
+	stop() {
+		if (this.flags & 1) {
+			for (let e = this.deps; e; e = e.nextDep) E(e);
+			this.deps = this.depsTail = void 0, fe(this), this.onStop && this.onStop(), this.flags &= -2;
+		}
+	}
+	trigger() {
+		this.flags & 64 ? y.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
+	}
+	runIfDirty() {
+		oe(this) && this.run();
+	}
+	get dirty() {
+		return oe(this);
+	}
+}, b = 0, x, S;
+function C(e, t = !1) {
+	if (e.flags |= 8, t) {
+		e.next = S, S = e;
+		return;
+	}
+	e.next = x, x = e;
+}
+function w() {
+	b++;
+}
+function T() {
+	if (--b > 0) return;
+	if (S) {
+		let e = S;
+		for (S = void 0; e;) {
+			let t = e.next;
+			e.next = void 0, e.flags &= -9, e = t;
+		}
+	}
+	let e;
+	for (; x;) {
+		let t = x;
+		for (x = void 0; t;) {
+			let n = t.next;
+			if (t.next = void 0, t.flags &= -9, t.flags & 1) try {
+				t.trigger();
+			} catch (t) {
+				e ||= t;
+			}
+			t = n;
+		}
+	}
+	if (e) throw e;
+}
+function ie(e) {
+	for (let t = e.deps; t; t = t.nextDep) t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
+}
+function ae(e) {
+	let t, n = e.depsTail, r = n;
+	for (; r;) {
+		let e = r.prevDep;
+		r.version === -1 ? (r === n && (n = e), E(r), ce(r)) : t = r, r.dep.activeLink = r.prevActiveLink, r.prevActiveLink = void 0, r = e;
+	}
+	e.deps = t, e.depsTail = n;
+}
+function oe(e) {
+	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;
+	return !!e._dirty;
+}
+function se(e) {
+	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;
+	e.flags |= 2;
+	let t = e.dep, n = v, r = D;
+	v = e, D = !0;
+	try {
+		ie(e);
+		let n = e.fn(e._value);
+		(t.version === 0 || a(n, e._value)) && (e.flags |= 128, e._value = n, t.version++);
+	} catch (e) {
+		throw t.version++, e;
+	} finally {
+		v = n, D = r, ae(e), e.flags &= -3;
+	}
+}
+function E(e, t = !1) {
+	let { dep: n, prevSub: r, nextSub: i } = e;
+	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)) {
+		n.computed.flags &= -5;
+		for (let e = n.computed.deps; e; e = e.nextDep) E(e, !0);
+	}
+	!t && !--n.sc && n.map && n.map.delete(n.key);
+}
+function ce(e) {
+	let { prevDep: t, nextDep: n } = e;
+	t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
+}
+var D = !0, le = [];
+function ue() {
+	le.push(D), D = !1;
+}
+function de() {
+	let e = le.pop();
+	D = e === void 0 ? !0 : e;
+}
+function fe(e) {
+	let { cleanup: t } = e;
+	if (e.cleanup = void 0, t) {
+		let e = v;
+		v = void 0;
+		try {
+			t();
+		} finally {
+			v = e;
+		}
+	}
+}
+var O = 0, pe = class {
+	constructor(e, t) {
+		this.sub = e, this.dep = t, this.version = t.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
+	}
+}, me = class {
+	constructor(e) {
+		this.computed = e, this.version = 0, this.activeLink = void 0, this.subs = void 0, this.map = void 0, this.key = void 0, this.sc = 0, this.__v_skip = !0, process.env.NODE_ENV !== "production" && (this.subsHead = void 0);
+	}
+	track(e) {
+		if (!v || !D || v === this.computed) return;
+		let t = this.activeLink;
+		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);
+		else if (t.version === -1 && (t.version = this.version, t.nextDep)) {
+			let e = t.nextDep;
+			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);
+		}
+		return process.env.NODE_ENV !== "production" && v.onTrack && v.onTrack(i({ effect: v }, e)), t;
+	}
+	trigger(e) {
+		this.version++, O++, this.notify(e);
+	}
+	notify(e) {
+		w();
+		try {
+			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));
+			for (let e = this.subs; e; e = e.prevSub) e.sub.notify() && e.sub.dep.notify();
+		} finally {
+			T();
+		}
+	}
+};
+function he(e) {
+	if (e.dep.sc++, e.sub.flags & 4) {
+		let t = e.dep.computed;
+		if (t && !e.dep.subs) {
+			t.flags |= 20;
+			for (let e = t.deps; e; e = e.nextDep) he(e);
+		}
+		let n = e.dep.subs;
+		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;
+	}
+}
+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");
+function M(e, t, n) {
+	if (D && v) {
+		let r = ge.get(e);
+		r || ge.set(e, r = /* @__PURE__ */ new Map());
+		let i = r.get(n);
+		i || (r.set(n, i = new me()), i.map = r, i.key = n), process.env.NODE_ENV === "production" ? i.track() : i.track({
+			target: e,
+			type: t,
+			key: n
+		});
+	}
+}
+function N(e, t, n, r, i, a) {
+	let o = ge.get(e);
+	if (!o) {
+		O++;
+		return;
+	}
+	let c = (o) => {
+		o && (process.env.NODE_ENV === "production" ? o.trigger() : o.trigger({
+			target: e,
+			type: t,
+			key: n,
+			newValue: r,
+			oldValue: i,
+			oldTarget: a
+		}));
+	};
+	if (w(), t === "clear") o.forEach(c);
+	else {
+		let i = s(e), a = i && l(n);
+		if (i && n === "length") {
+			let e = Number(r);
+			o.forEach((t, n) => {
+				(n === "length" || n === j || !m(n) && n >= e) && c(t);
+			});
+		} else switch ((n !== void 0 || o.has(void 0)) && c(o.get(n)), a && c(o.get(j)), t) {
+			case "add":
+				i ? a && c(o.get("length")) : (c(o.get(k)), u(e) && c(o.get(A)));
+				break;
+			case "delete":
+				i || (c(o.get(k)), u(e) && c(o.get(A)));
+				break;
+			case "set":
+				u(e) && c(o.get(k));
+				break;
+		}
+	}
+	T();
+}
+function P(e) {
+	let t = /* @__PURE__ */ K(e);
+	return t === e ? t : (M(t, "iterate", j), /* @__PURE__ */ G(e) ? t : t.map(q));
+}
+function F(e) {
+	return M(e = /* @__PURE__ */ K(e), "iterate", j), e;
+}
+function I(e, t) {
+	return /* @__PURE__ */ W(e) ? J(/* @__PURE__ */ U(e) ? q(t) : t) : q(t);
+}
+var _e = {
+	__proto__: null,
+	[Symbol.iterator]() {
+		return L(this, Symbol.iterator, (e) => I(this, e));
+	},
+	concat(...e) {
+		return P(this).concat(...e.map((e) => s(e) ? P(e) : e));
+	},
+	entries() {
+		return L(this, "entries", (e) => (e[1] = I(this, e[1]), e));
+	},
+	every(e, t) {
+		return R(this, "every", e, t, void 0, arguments);
+	},
+	filter(e, t) {
+		return R(this, "filter", e, t, (e) => e.map((e) => I(this, e)), arguments);
+	},
+	find(e, t) {
+		return R(this, "find", e, t, (e) => I(this, e), arguments);
+	},
+	findIndex(e, t) {
+		return R(this, "findIndex", e, t, void 0, arguments);
+	},
+	findLast(e, t) {
+		return R(this, "findLast", e, t, (e) => I(this, e), arguments);
+	},
+	findLastIndex(e, t) {
+		return R(this, "findLastIndex", e, t, void 0, arguments);
+	},
+	forEach(e, t) {
+		return R(this, "forEach", e, t, void 0, arguments);
+	},
+	includes(...e) {
+		return be(this, "includes", e);
+	},
+	indexOf(...e) {
+		return be(this, "indexOf", e);
+	},
+	join(e) {
+		return P(this).join(e);
+	},
+	lastIndexOf(...e) {
+		return be(this, "lastIndexOf", e);
+	},
+	map(e, t) {
+		return R(this, "map", e, t, void 0, arguments);
+	},
+	pop() {
+		return z(this, "pop");
+	},
+	push(...e) {
+		return z(this, "push", e);
+	},
+	reduce(e, ...t) {
+		return ye(this, "reduce", e, t);
+	},
+	reduceRight(e, ...t) {
+		return ye(this, "reduceRight", e, t);
+	},
+	shift() {
+		return z(this, "shift");
+	},
+	some(e, t) {
+		return R(this, "some", e, t, void 0, arguments);
+	},
+	splice(...e) {
+		return z(this, "splice", e);
+	},
+	toReversed() {
+		return P(this).toReversed();
+	},
+	toSorted(e) {
+		return P(this).toSorted(e);
+	},
+	toSpliced(...e) {
+		return P(this).toSpliced(...e);
+	},
+	unshift(...e) {
+		return z(this, "unshift", e);
+	},
+	values() {
+		return L(this, "values", (e) => I(this, e));
+	}
+};
+function L(e, t, n) {
+	let r = F(e), i = r[t]();
+	return r !== e && !/* @__PURE__ */ G(e) && (i._next = i.next, i.next = () => {
+		let e = i._next();
+		return e.done || (e.value = n(e.value)), e;
+	}), i;
+}
+var ve = Array.prototype;
+function R(e, t, n, r, i, a) {
+	let o = F(e), s = o !== e && !/* @__PURE__ */ G(e), c = o[t];
+	if (c !== ve[t]) {
+		let t = c.apply(e, a);
+		return s ? q(t) : t;
+	}
+	let l = n;
+	o !== e && (s ? l = function(t, r) {
+		return n.call(this, I(e, t), r, e);
+	} : n.length > 2 && (l = function(t, r) {
+		return n.call(this, t, r, e);
+	}));
+	let u = c.call(o, l, r);
+	return s && i ? i(u) : u;
+}
+function ye(e, t, n, r) {
+	let i = F(e), a = i !== e && !/* @__PURE__ */ G(e), o = n, s = !1;
+	i !== e && (a ? (s = r.length === 0, o = function(t, r, i) {
+		return s && (s = !1, t = I(e, t)), n.call(this, t, I(e, r), i, e);
+	}) : n.length > 3 && (o = function(t, r, i) {
+		return n.call(this, t, r, i, e);
+	}));
+	let c = i[t](o, ...r);
+	return s ? I(e, c) : c;
+}
+function be(e, t, n) {
+	let r = /* @__PURE__ */ K(e);
+	M(r, "iterate", j);
+	let i = r[t](...n);
+	return (i === -1 || i === !1) && /* @__PURE__ */ qe(n[0]) ? (n[0] = /* @__PURE__ */ K(n[0]), r[t](...n)) : i;
+}
+function z(e, t, n = []) {
+	ue(), w();
+	let r = (/* @__PURE__ */ K(e))[t].apply(e, n);
+	return T(), de(), r;
+}
+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));
+function Ce(e) {
+	m(e) || (e = String(e));
+	let t = /* @__PURE__ */ K(this);
+	return M(t, "has", e), t.hasOwnProperty(e);
+}
+var we = class {
+	constructor(e = !1, t = !1) {
+		this._isReadonly = e, this._isShallow = t;
+	}
+	get(e, t, n) {
+		if (t === "__v_skip") return e.__v_skip;
+		let r = this._isReadonly, i = this._isShallow;
+		if (t === "__v_isReactive") return !r;
+		if (t === "__v_isReadonly") return r;
+		if (t === "__v_isShallow") return i;
+		if (t === "__v_raw") return n === (r ? i ? Ve : Be : i ? ze : Re).get(e) || Object.getPrototypeOf(e) === Object.getPrototypeOf(n) ? e : void 0;
+		let a = s(e);
+		if (!r) {
+			let e;
+			if (a && (e = _e[t])) return e;
+			if (t === "hasOwnProperty") return Ce;
+		}
+		let o = Reflect.get(e, t, /* @__PURE__ */ Y(e) ? e : n);
+		if ((m(t) ? Se.has(t) : xe(t)) || (r || M(e, "get", t), i)) return o;
+		if (/* @__PURE__ */ Y(o)) {
+			let e = a && l(t) ? o : o.value;
+			return r && d(e) ? /* @__PURE__ */ H(e) : e;
+		}
+		return d(o) ? r ? /* @__PURE__ */ H(o) : /* @__PURE__ */ We(o) : o;
+	}
+}, Te = class extends we {
+	constructor(e = !1) {
+		super(!1, e);
+	}
+	set(e, t, n, r) {
+		let i = e[t], c = s(e) && l(t);
+		if (!this._isShallow) {
+			let r = /* @__PURE__ */ W(i);
+			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);
+		}
+		let u = c ? Number(t) < e.length : o(e, t), d = Reflect.set(e, t, n, /* @__PURE__ */ Y(e) ? e : r);
+		return e === /* @__PURE__ */ K(r) && (u ? a(n, i) && N(e, "set", t, n, i) : N(e, "add", t, n)), d;
+	}
+	deleteProperty(e, t) {
+		let n = o(e, t), r = e[t], i = Reflect.deleteProperty(e, t);
+		return i && n && N(e, "delete", t, void 0, r), i;
+	}
+	has(e, t) {
+		let n = Reflect.has(e, t);
+		return (!m(t) || !Se.has(t)) && M(e, "has", t), n;
+	}
+	ownKeys(e) {
+		return M(e, "iterate", s(e) ? "length" : k), Reflect.ownKeys(e);
+	}
+}, Ee = class extends we {
+	constructor(e = !1) {
+		super(!0, e);
+	}
+	set(e, t) {
+		return process.env.NODE_ENV !== "production" && g(`Set operation on key "${String(t)}" failed: target is readonly.`, e), !0;
+	}
+	deleteProperty(e, t) {
+		return process.env.NODE_ENV !== "production" && g(`Delete operation on key "${String(t)}" failed: target is readonly.`, e), !0;
+	}
+}, De = /* @__PURE__ */ new Te(), Oe = /* @__PURE__ */ new Ee(), ke = /* @__PURE__ */ new Ee(!0), Ae = (e) => e, B = (e) => Reflect.getPrototypeOf(e);
+function je(e, t, n) {
+	return function(...r) {
+		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;
+		return !t && M(o, "iterate", l ? A : k), i(Object.create(d), { next() {
+			let { value: e, done: t } = d.next();
+			return t ? {
+				value: e,
+				done: t
+			} : {
+				value: c ? [f(e[0]), f(e[1])] : f(e),
+				done: t
+			};
+		} });
+	};
+}
+function V(e) {
+	return function(...t) {
+		if (process.env.NODE_ENV !== "production") {
+			let r = t[0] ? `on key "${t[0]}" ` : "";
+			g(`${n(e)} operation ${r}failed: target is readonly.`, /* @__PURE__ */ K(this));
+		}
+		return e === "delete" ? !1 : e === "clear" ? void 0 : this;
+	};
+}
+function Me(e, t) {
+	let n = {
+		get(n) {
+			let r = this.__v_raw, i = /* @__PURE__ */ K(r), o = /* @__PURE__ */ K(n);
+			e || (a(n, o) && M(i, "get", n), M(i, "get", o));
+			let { has: s } = B(i), c = t ? Ae : e ? J : q;
+			if (s.call(i, n)) return c(r.get(n));
+			if (s.call(i, o)) return c(r.get(o));
+			r !== i && r.get(n);
+		},
+		get size() {
+			let t = this.__v_raw;
+			return !e && M(/* @__PURE__ */ K(t), "iterate", k), t.size;
+		},
+		has(t) {
+			let n = this.__v_raw, r = /* @__PURE__ */ K(n), i = /* @__PURE__ */ K(t);
+			return e || (a(t, i) && M(r, "has", t), M(r, "has", i)), t === i ? n.has(t) : n.has(t) || n.has(i);
+		},
+		forEach(n, r) {
+			let i = this, a = i.__v_raw, o = /* @__PURE__ */ K(a), s = t ? Ae : e ? J : q;
+			return !e && M(o, "iterate", k), a.forEach((e, t) => n.call(r, s(e), s(t), i));
+		}
+	};
+	return i(n, e ? {
+		add: V("add"),
+		set: V("set"),
+		delete: V("delete"),
+		clear: V("clear")
+	} : {
+		add(e) {
+			let n = /* @__PURE__ */ K(this), r = B(n), i = /* @__PURE__ */ K(e), o = !t && !/* @__PURE__ */ G(e) && !/* @__PURE__ */ W(e) ? i : e;
+			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;
+		},
+		set(e, n) {
+			!t && !/* @__PURE__ */ G(n) && !/* @__PURE__ */ W(n) && (n = /* @__PURE__ */ K(n));
+			let r = /* @__PURE__ */ K(this), { has: i, get: o } = B(r), s = i.call(r, e);
+			s ? process.env.NODE_ENV !== "production" && Le(r, i, e) : (e = /* @__PURE__ */ K(e), s = i.call(r, e));
+			let c = o.call(r, e);
+			return r.set(e, n), s ? a(n, c) && N(r, "set", e, n, c) : N(r, "add", e, n), this;
+		},
+		delete(e) {
+			let t = /* @__PURE__ */ K(this), { has: n, get: r } = B(t), i = n.call(t, e);
+			i ? process.env.NODE_ENV !== "production" && Le(t, n, e) : (e = /* @__PURE__ */ K(e), i = n.call(t, e));
+			let a = r ? r.call(t, e) : void 0, o = t.delete(e);
+			return i && N(t, "delete", e, void 0, a), o;
+		},
+		clear() {
+			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();
+			return t && N(e, "clear", void 0, void 0, n), r;
+		}
+	}), [
+		"keys",
+		"values",
+		"entries",
+		Symbol.iterator
+	].forEach((r) => {
+		n[r] = je(r, e, t);
+	}), n;
+}
+function Ne(e, t) {
+	let n = Me(e, t);
+	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);
+}
+var Pe = { get: /* @__PURE__ */ Ne(!1, !1) }, Fe = { get: /* @__PURE__ */ Ne(!0, !1) }, Ie = { get: /* @__PURE__ */ Ne(!0, !0) };
+function Le(e, t, n) {
+	let r = /* @__PURE__ */ K(n);
+	if (r !== n && t.call(e, r)) {
+		let t = h(e);
+		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.`);
+	}
+}
+var Re = /* @__PURE__ */ new WeakMap(), ze = /* @__PURE__ */ new WeakMap(), Be = /* @__PURE__ */ new WeakMap(), Ve = /* @__PURE__ */ new WeakMap();
+function He(e) {
+	switch (e) {
+		case "Object":
+		case "Array": return 1;
+		case "Map":
+		case "Set":
+		case "WeakMap":
+		case "WeakSet": return 2;
+		default: return 0;
+	}
+}
+function Ue(e) {
+	return e.__v_skip || !Object.isExtensible(e) ? 0 : He(h(e));
+}
+/* @__NO_SIDE_EFFECTS__ */
+function We(e) {
+	return /* @__PURE__ */ W(e) ? e : Ke(e, !1, De, Pe, Re);
+}
+/* @__NO_SIDE_EFFECTS__ */
+function H(e) {
+	return Ke(e, !0, Oe, Fe, Be);
+}
+/* @__NO_SIDE_EFFECTS__ */
+function Ge(e) {
+	return Ke(e, !0, ke, Ie, Ve);
+}
+function Ke(e, t, n, r, i) {
+	if (!d(e)) return process.env.NODE_ENV !== "production" && g(`value cannot be made ${t ? "readonly" : "reactive"}: ${String(e)}`), e;
+	if (e.__v_raw && !(t && e.__v_isReactive)) return e;
+	let a = Ue(e);
+	if (a === 0) return e;
+	let o = i.get(e);
+	if (o) return o;
+	let s = new Proxy(e, a === 2 ? r : n);
+	return i.set(e, s), s;
+}
+/* @__NO_SIDE_EFFECTS__ */
+function U(e) {
+	return /* @__PURE__ */ W(e) ? /* @__PURE__ */ U(e.__v_raw) : !!(e && e.__v_isReactive);
+}
+/* @__NO_SIDE_EFFECTS__ */
+function W(e) {
+	return !!(e && e.__v_isReadonly);
+}
+/* @__NO_SIDE_EFFECTS__ */
+function G(e) {
+	return !!(e && e.__v_isShallow);
+}
+/* @__NO_SIDE_EFFECTS__ */
+function qe(e) {
+	return e ? !!e.__v_raw : !1;
+}
+/* @__NO_SIDE_EFFECTS__ */
+function K(e) {
+	let t = e && e.__v_raw;
+	return t ? /* @__PURE__ */ K(t) : e;
+}
+function Je(e) {
+	return !o(e, "__v_skip") && Object.isExtensible(e) && r(e, "__v_skip", !0), e;
+}
+var q = (e) => d(e) ? /* @__PURE__ */ We(e) : e, J = (e) => d(e) ? /* @__PURE__ */ H(e) : e;
+/* @__NO_SIDE_EFFECTS__ */
+function Y(e) {
+	return e ? e.__v_isRef === !0 : !1;
+}
+function Ye(e) {
+	return /* @__PURE__ */ Y(e) ? e.value : e;
+}
+var Xe = {
+	get: (e, t, n) => t === "__v_raw" ? e : Ye(Reflect.get(e, t, n)),
+	set: (e, t, n, r) => {
+		let i = e[t];
+		return /* @__PURE__ */ Y(i) && !/* @__PURE__ */ Y(n) ? (i.value = n, !0) : Reflect.set(e, t, n, r);
+	}
+};
+function Ze(e) {
+	return /* @__PURE__ */ U(e) ? e : new Proxy(e, Xe);
+}
+var Qe = class {
+	constructor(e, t, n) {
+		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;
+	}
+	notify() {
+		if (this.flags |= 16, !(this.flags & 8) && v !== this) return C(this, !0), !0;
+		process.env.NODE_ENV;
+	}
+	get value() {
+		let e = process.env.NODE_ENV === "production" ? this.dep.track() : this.dep.track({
+			target: this,
+			type: "get",
+			key: "value"
+		});
+		return se(this), e && (e.version = this.dep.version), this._value;
+	}
+	set value(e) {
+		this.setter ? this.setter(e) : process.env.NODE_ENV !== "production" && g("Write operation failed: computed value is readonly");
+	}
+};
+/* @__NO_SIDE_EFFECTS__ */
+function $e(e, t, n = !1) {
+	let r, i;
+	c(e) ? r = e : (r = e.get, i = e.set);
+	let a = new Qe(r, i, n);
+	return process.env.NODE_ENV !== "production" && t && !n && (a.onTrack = t.onTrack, a.onTrigger = t.onTrigger), a;
+}
+var X = {}, Z = /* @__PURE__ */ new WeakMap(), Q = void 0;
+function et(e, t = !1, n = Q) {
+	if (n) {
+		let t = Z.get(n);
+		t || Z.set(n, t = []), t.push(e);
+	} else process.env.NODE_ENV !== "production" && !t && g("onWatcherCleanup() was called when there was no active watcher to associate with.");
+}
+function tt(n, r, i = e) {
+	let { immediate: o, deep: l, once: u, scheduler: d, augmentJob: f, call: p } = i, m = (e) => {
+		(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.");
+	}, ee = (e) => l ? e : /* @__PURE__ */ G(e) || l === !1 || l === 0 ? $(e, 1) : $(e), h, _, v, y, b = !1, x = !1;
+	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) => {
+		if (/* @__PURE__ */ Y(e)) return e.value;
+		if (/* @__PURE__ */ U(e)) return ee(e);
+		if (c(e)) return p ? p(e, 2) : e();
+		process.env.NODE_ENV !== "production" && m(e);
+	})) : c(n) ? _ = r ? p ? () => p(n, 2) : n : () => {
+		if (v) {
+			ue();
+			try {
+				v();
+			} finally {
+				de();
+			}
+		}
+		let e = Q;
+		Q = h;
+		try {
+			return p ? p(n, 3, [y]) : n(y);
+		} finally {
+			Q = e;
+		}
+	} : (_ = t, process.env.NODE_ENV !== "production" && m(n)), r && l) {
+		let e = _, t = l === !0 ? Infinity : l;
+		_ = () => $(e(), t);
+	}
+	let S = ne(), C = () => {
+		h.stop(), S && S.active && te(S.effects, h);
+	};
+	if (u && r) {
+		let e = r;
+		r = (...t) => {
+			e(...t), C();
+		};
+	}
+	let w = x ? Array(n.length).fill(X) : X, T = (e) => {
+		if (!(!(h.flags & 1) || !h.dirty && !e)) if (r) {
+			let e = h.run();
+			if (l || b || (x ? e.some((e, t) => a(e, w[t])) : a(e, w))) {
+				v && v();
+				let t = Q;
+				Q = h;
+				try {
+					let t = [
+						e,
+						w === X ? void 0 : x && w[0] === X ? [] : w,
+						y
+					];
+					w = e, p ? p(r, 3, t) : r(...t);
+				} finally {
+					Q = t;
+				}
+			}
+		} else h.run();
+	};
+	return f && f(T), h = new re(_), h.scheduler = d ? () => d(T, !1) : T, y = (e) => et(e, !1, h), v = h.onStop = () => {
+		let e = Z.get(h);
+		if (e) {
+			if (p) p(e, 4);
+			else for (let t of e) t();
+			Z.delete(h);
+		}
+	}, 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;
+}
+function $(e, t = Infinity, n) {
+	if (t <= 0 || !d(e) || e.__v_skip || (n ||= /* @__PURE__ */ new Map(), (n.get(e) || 0) >= t)) return e;
+	if (n.set(e, t), t--, /* @__PURE__ */ Y(e)) $(e.value, t, n);
+	else if (s(e)) for (let r = 0; r < e.length; r++) $(e[r], t, n);
+	else if (p(e) || u(e)) e.forEach((e) => {
+		$(e, t, n);
+	});
+	else if (f(e)) {
+		for (let r in e) $(e[r], t, n);
+		for (let r of Object.getOwnPropertySymbols(e)) Object.prototype.propertyIsEnumerable.call(e, r) && $(e[r], t, n);
+	}
+	return e;
+}
+//#endregion
+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 };