@duxweb/dvha-naiveui 1.0.2 → 1.0.4

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

@@ -1,4 +1,4 @@
-import { isFunction as q, extend as X, hasChanged as M, isSymbol as L, isObject as W, EMPTY_OBJ as Pe, toRawType as he, isArray as x, hasOwn as Z, isIntegerKey as ie, isMap as O, makeMap as Ke, capitalize as je, NOOP as Le, isSet as We, isPlainObject as He } from "../../shared/dist/shared.esm-bundler.js";
+import { isFunction as Z, isObject as P, EMPTY_OBJ as We, hasChanged as m, isArray as x, extend as ne, toRawType as Ee, isSymbol as z, hasOwn as oe, isIntegerKey as ue, isMap as j, makeMap as He, capitalize as Ce, NOOP as $e, isSet as Ye, isPlainObject as ze } from "../../shared/dist/shared.esm-bundler.js";
 /**
 * @vue/reactivity v3.5.14
 * (c) 2018-present Yuxi (Evan) You and Vue contributors
@@ -7,9 +7,9 @@ import { isFunction as q, extend as X, hasChanged as M, isSymbol as L, isObject
 function D(e, ...t) {
   console.warn(`[Vue warn] ${e}`, ...t);
 }
-let l;
-const J = /* @__PURE__ */ new WeakSet();
-class Ce {
+let u;
+const se = /* @__PURE__ */ new WeakSet();
+class Be {
   constructor(t) {
     this.fn = t, this.deps = void 0, this.depsTail = void 0, this.flags = 5, this.next = void 0, this.cleanup = void 0, this.scheduler = void 0;
   }
@@ -17,526 +17,530 @@ class Ce {
     this.flags |= 64;
   }
   resume() {
-    this.flags & 64 && (this.flags &= -65, J.has(this) && (J.delete(this), this.trigger()));
+    this.flags & 64 && (this.flags &= -65, se.has(this) && (se.delete(this), this.trigger()));
   }
   /**
    * @internal
    */
   notify() {
-    this.flags & 2 && !(this.flags & 32) || this.flags & 8 || _e(this);
+    this.flags & 2 && !(this.flags & 32) || this.flags & 8 || ye(this);
   }
   run() {
     if (!(this.flags & 1))
       return this.fn();
-    this.flags |= 2, le(this), ge(this);
-    const t = l, n = b;
-    l = this, b = !0;
+    this.flags |= 2, ge(this), De(this);
+    const t = u, s = w;
+    u = this, w = !0;
     try {
       return this.fn();
     } finally {
-      process.env.NODE_ENV !== "production" && l !== this && D(
+      process.env.NODE_ENV !== "production" && u !== this && D(
         "Active effect was not restored correctly - this is likely a Vue internal bug."
-      ), be(this), l = t, b = n, this.flags &= -3;
+      ), Ne(this), u = t, w = s, this.flags &= -3;
     }
   }
   stop() {
     if (this.flags & 1) {
       for (let t = this.deps; t; t = t.nextDep)
-        ce(t);
-      this.deps = this.depsTail = void 0, le(this), this.onStop && this.onStop(), this.flags &= -2;
+        de(t);
+      this.deps = this.depsTail = void 0, ge(this), this.onStop && this.onStop(), this.flags &= -2;
     }
   }
   trigger() {
-    this.flags & 64 ? J.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
+    this.flags & 64 ? se.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
   }
   /**
    * @internal
    */
   runIfDirty() {
-    k(this) && this.run();
+    ae(this) && this.run();
   }
   get dirty() {
-    return k(this);
+    return ae(this);
   }
 }
-let ve = 0, A, P;
-function _e(e, t = !1) {
+let Se = 0, H, C;
+function ye(e, t = !1) {
   if (e.flags |= 8, t) {
-    e.next = P, P = e;
+    e.next = C, C = e;
     return;
   }
-  e.next = A, A = e;
+  e.next = H, H = e;
 }
-function re() {
-  ve++;
+function he() {
+  Se++;
 }
-function oe() {
-  if (--ve > 0)
+function pe() {
+  if (--Se > 0)
     return;
-  if (P) {
-    let t = P;
-    for (P = void 0; t; ) {
-      const n = t.next;
-      t.next = void 0, t.flags &= -9, t = n;
+  if (C) {
+    let t = C;
+    for (C = void 0; t; ) {
+      const s = t.next;
+      t.next = void 0, t.flags &= -9, t = s;
     }
   }
   let e;
-  for (; A; ) {
-    let t = A;
-    for (A = void 0; t; ) {
-      const n = t.next;
+  for (; H; ) {
+    let t = H;
+    for (H = void 0; t; ) {
+      const s = t.next;
       if (t.next = void 0, t.flags &= -9, t.flags & 1)
         try {
           t.trigger();
-        } catch (i) {
-          e || (e = i);
+        } catch (r) {
+          e || (e = r);
         }
-      t = n;
+      t = s;
     }
   }
   if (e) throw e;
 }
-function ge(e) {
+function De(e) {
   for (let t = e.deps; t; t = t.nextDep)
     t.version = -1, t.prevActiveLink = t.dep.activeLink, t.dep.activeLink = t;
 }
-function be(e) {
-  let t, n = e.depsTail, i = n;
-  for (; i; ) {
-    const s = i.prevDep;
-    i.version === -1 ? (i === n && (n = s), ce(i), $e(i)) : t = i, i.dep.activeLink = i.prevActiveLink, i.prevActiveLink = void 0, i = s;
+function Ne(e) {
+  let t, s = e.depsTail, r = s;
+  for (; r; ) {
+    const i = r.prevDep;
+    r.version === -1 ? (r === s && (s = i), de(r), Fe(r)) : t = r, r.dep.activeLink = r.prevActiveLink, r.prevActiveLink = void 0, r = i;
   }
-  e.deps = t, e.depsTail = n;
+  e.deps = t, e.depsTail = s;
 }
-function k(e) {
+function ae(e) {
   for (let t = e.deps; t; t = t.nextDep)
-    if (t.dep.version !== t.version || t.dep.computed && (we(t.dep.computed) || t.dep.version !== t.version))
+    if (t.dep.version !== t.version || t.dep.computed && (Re(t.dep.computed) || t.dep.version !== t.version))
       return !0;
   return !!e._dirty;
 }
-function we(e) {
-  if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === K) || (e.globalVersion = K, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !k(e))))
+function Re(e) {
+  if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === $) || (e.globalVersion = $, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !ae(e))))
     return;
   e.flags |= 2;
-  const t = e.dep, n = l, i = b;
-  l = e, b = !0;
+  const t = e.dep, s = u, r = w;
+  u = e, w = !0;
   try {
-    ge(e);
-    const s = e.fn(e._value);
-    (t.version === 0 || M(s, e._value)) && (e.flags |= 128, e._value = s, t.version++);
-  } catch (s) {
-    throw t.version++, s;
+    De(e);
+    const i = e.fn(e._value);
+    (t.version === 0 || m(i, e._value)) && (e.flags |= 128, e._value = i, t.version++);
+  } catch (i) {
+    throw t.version++, i;
   } finally {
-    l = n, b = i, be(e), e.flags &= -3;
+    u = s, w = r, Ne(e), e.flags &= -3;
   }
 }
-function ce(e, t = !1) {
-  const { dep: n, prevSub: i, nextSub: s } = e;
-  if (i && (i.nextSub = s, e.prevSub = void 0), s && (s.prevSub = i, e.nextSub = void 0), process.env.NODE_ENV !== "production" && n.subsHead === e && (n.subsHead = s), n.subs === e && (n.subs = i, !i && n.computed)) {
-    n.computed.flags &= -5;
-    for (let r = n.computed.deps; r; r = r.nextDep)
-      ce(r, !0);
+function de(e, t = !1) {
+  const { dep: s, 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" && s.subsHead === e && (s.subsHead = i), s.subs === e && (s.subs = r, !r && s.computed)) {
+    s.computed.flags &= -5;
+    for (let n = s.computed.deps; n; n = n.nextDep)
+      de(n, !0);
   }
-  !t && !--n.sc && n.map && n.map.delete(n.key);
+  !t && !--s.sc && s.map && s.map.delete(s.key);
 }
-function $e(e) {
-  const { prevDep: t, nextDep: n } = e;
-  t && (t.nextDep = n, e.prevDep = void 0), n && (n.prevDep = t, e.nextDep = void 0);
+function Fe(e) {
+  const { prevDep: t, nextDep: s } = e;
+  t && (t.nextDep = s, e.prevDep = void 0), s && (s.prevDep = t, e.nextDep = void 0);
 }
-let b = !0;
-const Ee = [];
-function Se() {
-  Ee.push(b), b = !1;
+let w = !0;
+const me = [];
+function xe() {
+  me.push(w), w = !1;
 }
-function De() {
-  const e = Ee.pop();
-  b = e === void 0 ? !0 : e;
+function Oe() {
+  const e = me.pop();
+  w = e === void 0 ? !0 : e;
 }
-function le(e) {
+function ge(e) {
   const { cleanup: t } = e;
   if (e.cleanup = void 0, t) {
-    const n = l;
-    l = void 0;
+    const s = u;
+    u = void 0;
     try {
       t();
     } finally {
-      l = n;
+      u = s;
     }
   }
 }
-let K = 0;
-class Ye {
-  constructor(t, n) {
-    this.sub = t, this.dep = n, this.version = n.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
+let $ = 0;
+class Ge {
+  constructor(t, s) {
+    this.sub = t, this.dep = s, this.version = s.version, this.nextDep = this.prevDep = this.nextSub = this.prevSub = this.prevActiveLink = void 0;
   }
 }
-class Ne {
+class _e {
   constructor(t) {
     this.computed = t, this.version = 0, this.activeLink = void 0, this.subs = void 0, this.map = void 0, this.key = void 0, this.sc = 0, process.env.NODE_ENV !== "production" && (this.subsHead = void 0);
   }
   track(t) {
-    if (!l || !b || l === this.computed)
+    if (!u || !w || u === this.computed)
       return;
-    let n = this.activeLink;
-    if (n === void 0 || n.sub !== l)
-      n = this.activeLink = new Ye(l, this), l.deps ? (n.prevDep = l.depsTail, l.depsTail.nextDep = n, l.depsTail = n) : l.deps = l.depsTail = n, xe(n);
-    else if (n.version === -1 && (n.version = this.version, n.nextDep)) {
-      const i = n.nextDep;
-      i.prevDep = n.prevDep, n.prevDep && (n.prevDep.nextDep = i), n.prevDep = l.depsTail, n.nextDep = void 0, l.depsTail.nextDep = n, l.depsTail = n, l.deps === n && (l.deps = i);
+    let s = this.activeLink;
+    if (s === void 0 || s.sub !== u)
+      s = this.activeLink = new Ge(u, this), u.deps ? (s.prevDep = u.depsTail, u.depsTail.nextDep = s, u.depsTail = s) : u.deps = u.depsTail = s, Te(s);
+    else if (s.version === -1 && (s.version = this.version, s.nextDep)) {
+      const r = s.nextDep;
+      r.prevDep = s.prevDep, s.prevDep && (s.prevDep.nextDep = r), s.prevDep = u.depsTail, s.nextDep = void 0, u.depsTail.nextDep = s, u.depsTail = s, u.deps === s && (u.deps = r);
     }
-    return process.env.NODE_ENV !== "production" && l.onTrack && l.onTrack(
-      X(
+    return process.env.NODE_ENV !== "production" && u.onTrack && u.onTrack(
+      ne(
         {
-          effect: l
+          effect: u
         },
         t
       )
-    ), n;
+    ), s;
   }
   trigger(t) {
-    this.version++, K++, this.notify(t);
+    this.version++, $++, this.notify(t);
   }
   notify(t) {
-    re();
+    he();
     try {
       if (process.env.NODE_ENV !== "production")
-        for (let n = this.subsHead; n; n = n.nextSub)
-          n.sub.onTrigger && !(n.sub.flags & 8) && n.sub.onTrigger(
-            X(
+        for (let s = this.subsHead; s; s = s.nextSub)
+          s.sub.onTrigger && !(s.sub.flags & 8) && s.sub.onTrigger(
+            ne(
               {
-                effect: n.sub
+                effect: s.sub
               },
               t
             )
           );
-      for (let n = this.subs; n; n = n.prevSub)
-        n.sub.notify() && n.sub.dep.notify();
+      for (let s = this.subs; s; s = s.prevSub)
+        s.sub.notify() && s.sub.dep.notify();
     } finally {
-      oe();
+      pe();
     }
   }
 }
-function xe(e) {
+function Te(e) {
   if (e.dep.sc++, e.sub.flags & 4) {
     const t = e.dep.computed;
     if (t && !e.dep.subs) {
       t.flags |= 20;
-      for (let i = t.deps; i; i = i.nextDep)
-        xe(i);
+      for (let r = t.deps; r; r = r.nextDep)
+        Te(r);
     }
-    const 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;
+    const s = e.dep.subs;
+    s !== e && (e.prevSub = s, s && (s.nextSub = e)), process.env.NODE_ENV !== "production" && e.dep.subsHead === void 0 && (e.dep.subsHead = e), e.dep.subs = e;
   }
 }
-const ee = /* @__PURE__ */ new WeakMap(), m = Symbol(
+const k = /* @__PURE__ */ new WeakMap(), V = Symbol(
   process.env.NODE_ENV !== "production" ? "Object iterate" : ""
-), te = Symbol(
+), ce = Symbol(
   process.env.NODE_ENV !== "production" ? "Map keys iterate" : ""
-), j = Symbol(
+), Y = Symbol(
   process.env.NODE_ENV !== "production" ? "Array iterate" : ""
 );
-function _(e, t, n) {
-  if (b && l) {
-    let i = ee.get(e);
-    i || ee.set(e, i = /* @__PURE__ */ new Map());
-    let s = i.get(n);
-    s || (i.set(n, s = new Ne()), s.map = i, s.key = n), process.env.NODE_ENV !== "production" ? s.track({
+function g(e, t, s) {
+  if (w && u) {
+    let r = k.get(e);
+    r || k.set(e, r = /* @__PURE__ */ new Map());
+    let i = r.get(s);
+    i || (r.set(s, i = new _e()), i.map = r, i.key = s), process.env.NODE_ENV !== "production" ? i.track({
       target: e,
       type: t,
-      key: n
-    }) : s.track();
+      key: s
+    }) : i.track();
   }
 }
-function N(e, t, n, i, s, r) {
-  const o = ee.get(e);
+function N(e, t, s, r, i, n) {
+  const o = k.get(e);
   if (!o) {
-    K++;
+    $++;
     return;
   }
-  const c = (a) => {
-    a && (process.env.NODE_ENV !== "production" ? a.trigger({
+  const a = (c) => {
+    c && (process.env.NODE_ENV !== "production" ? c.trigger({
       target: e,
       type: t,
-      key: n,
-      newValue: i,
-      oldValue: s,
-      oldTarget: r
-    }) : a.trigger());
+      key: s,
+      newValue: r,
+      oldValue: i,
+      oldTarget: n
+    }) : c.trigger());
   };
-  if (re(), t === "clear")
-    o.forEach(c);
+  if (he(), t === "clear")
+    o.forEach(a);
   else {
-    const a = x(e), d = a && ie(n);
-    if (a && n === "length") {
-      const v = Number(i);
-      o.forEach((f, h) => {
-        (h === "length" || h === j || !L(h) && h >= v) && c(f);
+    const c = x(e), p = c && ue(s);
+    if (c && s === "length") {
+      const _ = Number(r);
+      o.forEach((f, d) => {
+        (d === "length" || d === Y || !z(d) && d >= _) && a(f);
       });
     } else
-      switch ((n !== void 0 || o.has(void 0)) && c(o.get(n)), d && c(o.get(j)), t) {
+      switch ((s !== void 0 || o.has(void 0)) && a(o.get(s)), p && a(o.get(Y)), t) {
         case "add":
-          a ? d && c(o.get("length")) : (c(o.get(m)), O(e) && c(o.get(te)));
+          c ? p && a(o.get("length")) : (a(o.get(V)), j(e) && a(o.get(ce)));
           break;
         case "delete":
-          a || (c(o.get(m)), O(e) && c(o.get(te)));
+          c || (a(o.get(V)), j(e) && a(o.get(ce)));
           break;
         case "set":
-          O(e) && c(o.get(m));
+          j(e) && a(o.get(V));
           break;
       }
   }
-  oe();
+  pe();
 }
-function R(e) {
-  const t = p(e);
-  return t === e ? t : (_(t, "iterate", j), w(e) ? t : t.map(g));
+function Je(e, t) {
+  const s = k.get(e);
+  return s && s.get(t);
 }
-function ae(e) {
-  return _(e = p(e), "iterate", j), e;
+function A(e) {
+  const t = h(e);
+  return t === e ? t : (g(t, "iterate", Y), E(e) ? t : t.map(v));
 }
-const ze = {
+function ve(e) {
+  return g(e = h(e), "iterate", Y), e;
+}
+const Qe = {
   __proto__: null,
   [Symbol.iterator]() {
-    return Q(this, Symbol.iterator, g);
+    return ie(this, Symbol.iterator, v);
   },
   concat(...e) {
-    return R(this).concat(
-      ...e.map((t) => x(t) ? R(t) : t)
+    return A(this).concat(
+      ...e.map((t) => x(t) ? A(t) : t)
     );
   },
   entries() {
-    return Q(this, "entries", (e) => (e[1] = g(e[1]), e));
+    return ie(this, "entries", (e) => (e[1] = v(e[1]), e));
   },
   every(e, t) {
-    return E(this, "every", e, t, void 0, arguments);
+    return y(this, "every", e, t, void 0, arguments);
   },
   filter(e, t) {
-    return E(this, "filter", e, t, (n) => n.map(g), arguments);
+    return y(this, "filter", e, t, (s) => s.map(v), arguments);
   },
   find(e, t) {
-    return E(this, "find", e, t, g, arguments);
+    return y(this, "find", e, t, v, arguments);
   },
   findIndex(e, t) {
-    return E(this, "findIndex", e, t, void 0, arguments);
+    return y(this, "findIndex", e, t, void 0, arguments);
   },
   findLast(e, t) {
-    return E(this, "findLast", e, t, g, arguments);
+    return y(this, "findLast", e, t, v, arguments);
   },
   findLastIndex(e, t) {
-    return E(this, "findLastIndex", e, t, void 0, arguments);
+    return y(this, "findLastIndex", e, t, void 0, arguments);
   },
   // flat, flatMap could benefit from ARRAY_ITERATE but are not straight-forward to implement
   forEach(e, t) {
-    return E(this, "forEach", e, t, void 0, arguments);
+    return y(this, "forEach", e, t, void 0, arguments);
   },
   includes(...e) {
-    return U(this, "includes", e);
+    return re(this, "includes", e);
   },
   indexOf(...e) {
-    return U(this, "indexOf", e);
+    return re(this, "indexOf", e);
   },
   join(e) {
-    return R(this).join(e);
+    return A(this).join(e);
   },
   // keys() iterator only reads `length`, no optimisation required
   lastIndexOf(...e) {
-    return U(this, "lastIndexOf", e);
+    return re(this, "lastIndexOf", e);
   },
   map(e, t) {
-    return E(this, "map", e, t, void 0, arguments);
+    return y(this, "map", e, t, void 0, arguments);
   },
   pop() {
-    return I(this, "pop");
+    return W(this, "pop");
   },
   push(...e) {
-    return I(this, "push", e);
+    return W(this, "push", e);
   },
   reduce(e, ...t) {
-    return ue(this, "reduce", e, t);
+    return be(this, "reduce", e, t);
   },
   reduceRight(e, ...t) {
-    return ue(this, "reduceRight", e, t);
+    return be(this, "reduceRight", e, t);
   },
   shift() {
-    return I(this, "shift");
+    return W(this, "shift");
   },
   // slice could use ARRAY_ITERATE but also seems to beg for range tracking
   some(e, t) {
-    return E(this, "some", e, t, void 0, arguments);
+    return y(this, "some", e, t, void 0, arguments);
   },
   splice(...e) {
-    return I(this, "splice", e);
+    return W(this, "splice", e);
   },
   toReversed() {
-    return R(this).toReversed();
+    return A(this).toReversed();
   },
   toSorted(e) {
-    return R(this).toSorted(e);
+    return A(this).toSorted(e);
   },
   toSpliced(...e) {
-    return R(this).toSpliced(...e);
+    return A(this).toSpliced(...e);
   },
   unshift(...e) {
-    return I(this, "unshift", e);
+    return W(this, "unshift", e);
   },
   values() {
-    return Q(this, "values", g);
+    return ie(this, "values", v);
   }
 };
-function Q(e, t, n) {
-  const i = ae(e), s = i[t]();
-  return i !== e && !w(e) && (s._next = s.next, s.next = () => {
-    const r = s._next();
-    return r.value && (r.value = n(r.value)), r;
-  }), s;
-}
-const Be = Array.prototype;
-function E(e, t, n, i, s, r) {
-  const o = ae(e), c = o !== e && !w(e), a = o[t];
-  if (a !== Be[t]) {
-    const f = a.apply(e, r);
-    return c ? g(f) : f;
-  }
-  let d = n;
-  o !== e && (c ? d = function(f, h) {
-    return n.call(this, g(f), h, e);
-  } : n.length > 2 && (d = function(f, h) {
-    return n.call(this, f, h, e);
+function ie(e, t, s) {
+  const r = ve(e), i = r[t]();
+  return r !== e && !E(e) && (i._next = i.next, i.next = () => {
+    const n = i._next();
+    return n.value && (n.value = s(n.value)), n;
+  }), i;
+}
+const Ue = Array.prototype;
+function y(e, t, s, r, i, n) {
+  const o = ve(e), a = o !== e && !E(e), c = o[t];
+  if (c !== Ue[t]) {
+    const f = c.apply(e, n);
+    return a ? v(f) : f;
+  }
+  let p = s;
+  o !== e && (a ? p = function(f, d) {
+    return s.call(this, v(f), d, e);
+  } : s.length > 2 && (p = function(f, d) {
+    return s.call(this, f, d, e);
   }));
-  const v = a.call(o, d, i);
-  return c && s ? s(v) : v;
-}
-function ue(e, t, n, i) {
-  const s = ae(e);
-  let r = n;
-  return s !== e && (w(e) ? n.length > 3 && (r = function(o, c, a) {
-    return n.call(this, o, c, a, e);
-  }) : r = function(o, c, a) {
-    return n.call(this, o, g(c), a, e);
-  }), s[t](r, ...i);
-}
-function U(e, t, n) {
-  const i = p(e);
-  _(i, "iterate", j);
-  const s = i[t](...n);
-  return (s === -1 || s === !1) && rt(n[0]) ? (n[0] = p(n[0]), i[t](...n)) : s;
-}
-function I(e, t, n = []) {
-  Se(), re();
-  const i = p(e)[t].apply(e, n);
-  return oe(), De(), i;
-}
-const Fe = /* @__PURE__ */ Ke("__proto__,__v_isRef,__isVue"), ye = new Set(
-  /* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(L)
+  const _ = c.call(o, p, r);
+  return a && i ? i(_) : _;
+}
+function be(e, t, s, r) {
+  const i = ve(e);
+  let n = s;
+  return i !== e && (E(e) ? s.length > 3 && (n = function(o, a, c) {
+    return s.call(this, o, a, c, e);
+  }) : n = function(o, a, c) {
+    return s.call(this, o, v(a), c, e);
+  }), i[t](n, ...r);
+}
+function re(e, t, s) {
+  const r = h(e);
+  g(r, "iterate", Y);
+  const i = r[t](...s);
+  return (i === -1 || i === !1) && lt(s[0]) ? (s[0] = h(s[0]), r[t](...s)) : i;
+}
+function W(e, t, s = []) {
+  xe(), he();
+  const r = h(e)[t].apply(e, s);
+  return pe(), Oe(), r;
+}
+const qe = /* @__PURE__ */ He("__proto__,__v_isRef,__isVue"), Ve = new Set(
+  /* @__PURE__ */ Object.getOwnPropertyNames(Symbol).filter((e) => e !== "arguments" && e !== "caller").map((e) => Symbol[e]).filter(z)
 );
-function Ge(e) {
-  L(e) || (e = String(e));
-  const t = p(this);
-  return _(t, "has", e), t.hasOwnProperty(e);
-}
-class me {
-  constructor(t = !1, n = !1) {
-    this._isReadonly = t, this._isShallow = n;
-  }
-  get(t, n, i) {
-    if (n === "__v_skip") return t.__v_skip;
-    const s = this._isReadonly, r = this._isShallow;
-    if (n === "__v_isReactive")
-      return !s;
-    if (n === "__v_isReadonly")
-      return s;
-    if (n === "__v_isShallow")
-      return r;
-    if (n === "__v_raw")
-      return i === (s ? r ? nt : Te : r ? tt : Oe).get(t) || // receiver is not the reactive proxy, but has the same prototype
+function Xe(e) {
+  z(e) || (e = String(e));
+  const t = h(this);
+  return g(t, "has", e), t.hasOwnProperty(e);
+}
+class Ie {
+  constructor(t = !1, s = !1) {
+    this._isReadonly = t, this._isShallow = s;
+  }
+  get(t, s, r) {
+    if (s === "__v_skip") return t.__v_skip;
+    const i = this._isReadonly, n = this._isShallow;
+    if (s === "__v_isReactive")
+      return !i;
+    if (s === "__v_isReadonly")
+      return i;
+    if (s === "__v_isShallow")
+      return n;
+    if (s === "__v_raw")
+      return r === (i ? n ? at : je : n ? ot : Ae).get(t) || // receiver is not the reactive proxy, but has the same prototype
       // this means the receiver is a user proxy of the reactive proxy
-      Object.getPrototypeOf(t) === Object.getPrototypeOf(i) ? t : void 0;
+      Object.getPrototypeOf(t) === Object.getPrototypeOf(r) ? t : void 0;
     const o = x(t);
-    if (!s) {
-      let a;
-      if (o && (a = ze[n]))
-        return a;
-      if (n === "hasOwnProperty")
-        return Ge;
+    if (!i) {
+      let c;
+      if (o && (c = Qe[s]))
+        return c;
+      if (s === "hasOwnProperty")
+        return Xe;
     }
-    const c = Reflect.get(
+    const a = Reflect.get(
       t,
-      n,
+      s,
       // if this is a proxy wrapping a ref, return methods using the raw ref
       // as receiver so that we don't have to call `toRaw` on the ref in all
       // its class methods
-      S(t) ? t : i
+      b(t) ? t : r
     );
-    return (L(n) ? ye.has(n) : Fe(n)) || (s || _(t, "get", n), r) ? c : S(c) ? o && ie(n) ? c : c.value : W(c) ? s ? Ie(c) : Ve(c) : c;
+    return (z(s) ? Ve.has(s) : qe(s)) || (i || g(t, "get", s), n) ? a : b(a) ? o && ue(s) ? a : a.value : P(a) ? i ? Ke(a) : Pe(a) : a;
   }
 }
-class Je extends me {
+class Ze extends Ie {
   constructor(t = !1) {
     super(!1, t);
   }
-  set(t, n, i, s) {
-    let r = t[n];
+  set(t, s, r, i) {
+    let n = t[s];
     if (!this._isShallow) {
-      const a = T(r);
-      if (!w(i) && !T(i) && (r = p(r), i = p(i)), !x(t) && S(r) && !S(i))
-        return a ? !1 : (r.value = i, !0);
+      const c = I(n);
+      if (!E(r) && !I(r) && (n = h(n), r = h(r)), !x(t) && b(n) && !b(r))
+        return c ? !1 : (n.value = r, !0);
     }
-    const o = x(t) && ie(n) ? Number(n) < t.length : Z(t, n), c = Reflect.set(
+    const o = x(t) && ue(s) ? Number(s) < t.length : oe(t, s), a = Reflect.set(
       t,
-      n,
-      i,
-      S(t) ? t : s
+      s,
+      r,
+      b(t) ? t : i
     );
-    return t === p(s) && (o ? M(i, r) && N(t, "set", n, i, r) : N(t, "add", n, i)), c;
+    return t === h(i) && (o ? m(r, n) && N(t, "set", s, r, n) : N(t, "add", s, r)), a;
   }
-  deleteProperty(t, n) {
-    const i = Z(t, n), s = t[n], r = Reflect.deleteProperty(t, n);
-    return r && i && N(t, "delete", n, void 0, s), r;
+  deleteProperty(t, s) {
+    const r = oe(t, s), i = t[s], n = Reflect.deleteProperty(t, s);
+    return n && r && N(t, "delete", s, void 0, i), n;
   }
-  has(t, n) {
-    const i = Reflect.has(t, n);
-    return (!L(n) || !ye.has(n)) && _(t, "has", n), i;
+  has(t, s) {
+    const r = Reflect.has(t, s);
+    return (!z(s) || !Ve.has(s)) && g(t, "has", s), r;
   }
   ownKeys(t) {
-    return _(
+    return g(
       t,
       "iterate",
-      x(t) ? "length" : m
+      x(t) ? "length" : V
     ), Reflect.ownKeys(t);
   }
 }
-class Qe extends me {
+class ke extends Ie {
   constructor(t = !1) {
     super(!0, t);
   }
-  set(t, n) {
+  set(t, s) {
     return process.env.NODE_ENV !== "production" && D(
-      `Set operation on key "${String(n)}" failed: target is readonly.`,
+      `Set operation on key "${String(s)}" failed: target is readonly.`,
       t
     ), !0;
   }
-  deleteProperty(t, n) {
+  deleteProperty(t, s) {
     return process.env.NODE_ENV !== "production" && D(
-      `Delete operation on key "${String(n)}" failed: target is readonly.`,
+      `Delete operation on key "${String(s)}" failed: target is readonly.`,
       t
     ), !0;
   }
 }
-const Ue = /* @__PURE__ */ new Je(), qe = /* @__PURE__ */ new Qe(), ne = (e) => e, C = (e) => Reflect.getPrototypeOf(e);
-function Xe(e, t, n) {
-  return function(...i) {
-    const s = this.__v_raw, r = p(s), o = O(r), c = e === "entries" || e === Symbol.iterator && o, a = e === "keys" && o, d = s[e](...i), v = n ? ne : t ? se : g;
-    return !t && _(
-      r,
+const et = /* @__PURE__ */ new Ze(), tt = /* @__PURE__ */ new ke(), fe = (e) => e, Q = (e) => Reflect.getPrototypeOf(e);
+function st(e, t, s) {
+  return function(...r) {
+    const i = this.__v_raw, n = h(i), o = j(n), a = e === "entries" || e === Symbol.iterator && o, c = e === "keys" && o, p = i[e](...r), _ = s ? fe : t ? le : v;
+    return !t && g(
+      n,
       "iterate",
-      a ? te : m
+      c ? ce : V
     ), {
       // iterator protocol
       next() {
-        const { value: f, done: h } = d.next();
-        return h ? { value: f, done: h } : {
-          value: c ? [v(f[0]), v(f[1])] : v(f),
-          done: h
+        const { value: f, done: d } = p.next();
+        return d ? { value: f, done: d } : {
+          value: a ? [_(f[0]), _(f[1])] : _(f),
+          done: d
         };
       },
       // iterable protocol
@@ -546,80 +550,80 @@ function Xe(e, t, n) {
     };
   };
 }
-function $(e) {
+function U(e) {
   return function(...t) {
     if (process.env.NODE_ENV !== "production") {
-      const n = t[0] ? `on key "${t[0]}" ` : "";
+      const s = t[0] ? `on key "${t[0]}" ` : "";
       D(
-        `${je(e)} operation ${n}failed: target is readonly.`,
-        p(this)
+        `${Ce(e)} operation ${s}failed: target is readonly.`,
+        h(this)
       );
     }
     return e === "delete" ? !1 : e === "clear" ? void 0 : this;
   };
 }
-function Ze(e, t) {
-  const n = {
-    get(s) {
-      const r = this.__v_raw, o = p(r), c = p(s);
-      e || (M(s, c) && _(o, "get", s), _(o, "get", c));
-      const { has: a } = C(o), d = t ? ne : e ? se : g;
-      if (a.call(o, s))
-        return d(r.get(s));
-      if (a.call(o, c))
-        return d(r.get(c));
-      r !== o && r.get(s);
+function it(e, t) {
+  const s = {
+    get(i) {
+      const n = this.__v_raw, o = h(n), a = h(i);
+      e || (m(i, a) && g(o, "get", i), g(o, "get", a));
+      const { has: c } = Q(o), p = t ? fe : e ? le : v;
+      if (c.call(o, i))
+        return p(n.get(i));
+      if (c.call(o, a))
+        return p(n.get(a));
+      n !== o && n.get(i);
     },
     get size() {
-      const s = this.__v_raw;
-      return !e && _(p(s), "iterate", m), Reflect.get(s, "size", s);
+      const i = this.__v_raw;
+      return !e && g(h(i), "iterate", V), Reflect.get(i, "size", i);
     },
-    has(s) {
-      const r = this.__v_raw, o = p(r), c = p(s);
-      return e || (M(s, c) && _(o, "has", s), _(o, "has", c)), s === c ? r.has(s) : r.has(s) || r.has(c);
+    has(i) {
+      const n = this.__v_raw, o = h(n), a = h(i);
+      return e || (m(i, a) && g(o, "has", i), g(o, "has", a)), i === a ? n.has(i) : n.has(i) || n.has(a);
     },
-    forEach(s, r) {
-      const o = this, c = o.__v_raw, a = p(c), d = t ? ne : e ? se : g;
-      return !e && _(a, "iterate", m), c.forEach((v, f) => s.call(r, d(v), d(f), o));
+    forEach(i, n) {
+      const o = this, a = o.__v_raw, c = h(a), p = t ? fe : e ? le : v;
+      return !e && g(c, "iterate", V), a.forEach((_, f) => i.call(n, p(_), p(f), o));
     }
   };
-  return X(
-    n,
+  return ne(
+    s,
     e ? {
-      add: $("add"),
-      set: $("set"),
-      delete: $("delete"),
-      clear: $("clear")
+      add: U("add"),
+      set: U("set"),
+      delete: U("delete"),
+      clear: U("clear")
     } : {
-      add(s) {
-        !t && !w(s) && !T(s) && (s = p(s));
-        const r = p(this);
-        return C(r).has.call(r, s) || (r.add(s), N(r, "add", s, s)), this;
+      add(i) {
+        !t && !E(i) && !I(i) && (i = h(i));
+        const n = h(this);
+        return Q(n).has.call(n, i) || (n.add(i), N(n, "add", i, i)), this;
       },
-      set(s, r) {
-        !t && !w(r) && !T(r) && (r = p(r));
-        const o = p(this), { has: c, get: a } = C(o);
-        let d = c.call(o, s);
-        d ? process.env.NODE_ENV !== "production" && pe(o, c, s) : (s = p(s), d = c.call(o, s));
-        const v = a.call(o, s);
-        return o.set(s, r), d ? M(r, v) && N(o, "set", s, r, v) : N(o, "add", s, r), this;
+      set(i, n) {
+        !t && !E(n) && !I(n) && (n = h(n));
+        const o = h(this), { has: a, get: c } = Q(o);
+        let p = a.call(o, i);
+        p ? process.env.NODE_ENV !== "production" && we(o, a, i) : (i = h(i), p = a.call(o, i));
+        const _ = c.call(o, i);
+        return o.set(i, n), p ? m(n, _) && N(o, "set", i, n, _) : N(o, "add", i, n), this;
       },
-      delete(s) {
-        const r = p(this), { has: o, get: c } = C(r);
-        let a = o.call(r, s);
-        a ? process.env.NODE_ENV !== "production" && pe(r, o, s) : (s = p(s), a = o.call(r, s));
-        const d = c ? c.call(r, s) : void 0, v = r.delete(s);
-        return a && N(r, "delete", s, void 0, d), v;
+      delete(i) {
+        const n = h(this), { has: o, get: a } = Q(n);
+        let c = o.call(n, i);
+        c ? process.env.NODE_ENV !== "production" && we(n, o, i) : (i = h(i), c = o.call(n, i));
+        const p = a ? a.call(n, i) : void 0, _ = n.delete(i);
+        return c && N(n, "delete", i, void 0, p), _;
       },
       clear() {
-        const s = p(this), r = s.size !== 0, o = process.env.NODE_ENV !== "production" ? O(s) ? new Map(s) : new Set(s) : void 0, c = s.clear();
-        return r && N(
-          s,
+        const i = h(this), n = i.size !== 0, o = process.env.NODE_ENV !== "production" ? j(i) ? new Map(i) : new Set(i) : void 0, a = i.clear();
+        return n && N(
+          i,
           "clear",
           void 0,
           void 0,
           o
-        ), c;
+        ), a;
       }
     }
   ), [
@@ -627,34 +631,34 @@ function Ze(e, t) {
     "values",
     "entries",
     Symbol.iterator
-  ].forEach((s) => {
-    n[s] = Xe(s, e, t);
-  }), n;
-}
-function Re(e, t) {
-  const n = Ze(e, t);
-  return (i, s, r) => s === "__v_isReactive" ? !e : s === "__v_isReadonly" ? e : s === "__v_raw" ? i : Reflect.get(
-    Z(n, s) && s in i ? n : i,
-    s,
-    r
+  ].forEach((i) => {
+    s[i] = st(i, e, t);
+  }), s;
+}
+function Me(e, t) {
+  const s = it(e, t);
+  return (r, i, n) => i === "__v_isReactive" ? !e : i === "__v_isReadonly" ? e : i === "__v_raw" ? r : Reflect.get(
+    oe(s, i) && i in r ? s : r,
+    i,
+    n
   );
 }
-const ke = {
-  get: /* @__PURE__ */ Re(!1, !1)
-}, et = {
-  get: /* @__PURE__ */ Re(!0, !1)
+const rt = {
+  get: /* @__PURE__ */ Me(!1, !1)
+}, nt = {
+  get: /* @__PURE__ */ Me(!0, !1)
 };
-function pe(e, t, n) {
-  const i = p(n);
-  if (i !== n && t.call(e, i)) {
-    const s = he(e);
+function we(e, t, s) {
+  const r = h(s);
+  if (r !== s && t.call(e, r)) {
+    const i = Ee(e);
     D(
-      `Reactive ${s} contains both the raw and reactive versions of the same object${s === "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.`
+      `Reactive ${i} contains both the raw and reactive versions of the same object${i === "Map" ? " as keys" : ""}, which can lead to inconsistencies. Avoid differentiating between the raw and reactive versions of an object and only use the reactive version if possible.`
     );
   }
 }
-const Oe = /* @__PURE__ */ new WeakMap(), tt = /* @__PURE__ */ new WeakMap(), Te = /* @__PURE__ */ new WeakMap(), nt = /* @__PURE__ */ new WeakMap();
-function st(e) {
+const Ae = /* @__PURE__ */ new WeakMap(), ot = /* @__PURE__ */ new WeakMap(), je = /* @__PURE__ */ new WeakMap(), at = /* @__PURE__ */ new WeakMap();
+function ct(e) {
   switch (e) {
     case "Object":
     case "Array":
@@ -668,29 +672,29 @@ function st(e) {
       return 0;
   }
 }
-function it(e) {
-  return e.__v_skip || !Object.isExtensible(e) ? 0 : st(he(e));
+function ft(e) {
+  return e.__v_skip || !Object.isExtensible(e) ? 0 : ct(Ee(e));
 }
-function Ve(e) {
-  return T(e) ? e : Me(
+function Pe(e) {
+  return I(e) ? e : Le(
     e,
     !1,
-    Ue,
-    ke,
-    Oe
+    et,
+    rt,
+    Ae
   );
 }
-function Ie(e) {
-  return Me(
+function Ke(e) {
+  return Le(
     e,
     !0,
-    qe,
-    et,
-    Te
+    tt,
+    nt,
+    je
   );
 }
-function Me(e, t, n, i, s) {
-  if (!W(e))
+function Le(e, t, s, r, i) {
+  if (!P(e))
     return process.env.NODE_ENV !== "production" && D(
       `value cannot be made ${t ? "readonly" : "reactive"}: ${String(
         e
@@ -698,52 +702,110 @@ function Me(e, t, n, i, s) {
     ), e;
   if (e.__v_raw && !(t && e.__v_isReactive))
     return e;
-  const r = it(e);
-  if (r === 0)
+  const n = ft(e);
+  if (n === 0)
     return e;
-  const o = s.get(e);
+  const o = i.get(e);
   if (o)
     return o;
-  const c = new Proxy(
+  const a = new Proxy(
     e,
-    r === 2 ? i : n
+    n === 2 ? r : s
   );
-  return s.set(e, c), c;
+  return i.set(e, a), a;
 }
-function Y(e) {
-  return T(e) ? Y(e.__v_raw) : !!(e && e.__v_isReactive);
+function X(e) {
+  return I(e) ? X(e.__v_raw) : !!(e && e.__v_isReactive);
 }
-function T(e) {
+function I(e) {
   return !!(e && e.__v_isReadonly);
 }
-function w(e) {
+function E(e) {
   return !!(e && e.__v_isShallow);
 }
-function rt(e) {
+function lt(e) {
   return e ? !!e.__v_raw : !1;
 }
-function p(e) {
+function h(e) {
   const t = e && e.__v_raw;
-  return t ? p(t) : e;
+  return t ? h(t) : e;
 }
-const g = (e) => W(e) ? Ve(e) : e, se = (e) => W(e) ? Ie(e) : e;
-function S(e) {
+const v = (e) => P(e) ? Pe(e) : e, le = (e) => P(e) ? Ke(e) : e;
+function b(e) {
   return e ? e.__v_isRef === !0 : !1;
 }
-function ft(e) {
-  return S(e) ? e.value : e;
+function ut(e) {
+  return ht(e, !1);
+}
+function ht(e, t) {
+  return b(e) ? e : new pt(e, t);
+}
+class pt {
+  constructor(t, s) {
+    this.dep = new _e(), this.__v_isRef = !0, this.__v_isShallow = !1, this._rawValue = s ? t : h(t), this._value = s ? t : v(t), this.__v_isShallow = s;
+  }
+  get value() {
+    return process.env.NODE_ENV !== "production" ? this.dep.track({
+      target: this,
+      type: "get",
+      key: "value"
+    }) : this.dep.track(), this._value;
+  }
+  set value(t) {
+    const s = this._rawValue, r = this.__v_isShallow || E(t) || I(t);
+    t = r ? t : h(t), m(t, s) && (this._rawValue = t, this._value = r ? t : v(t), process.env.NODE_ENV !== "production" ? this.dep.trigger({
+      target: this,
+      type: "set",
+      key: "value",
+      newValue: t,
+      oldValue: s
+    }) : this.dep.trigger());
+  }
+}
+function Et(e) {
+  return b(e) ? e.value : e;
 }
-class ot {
-  constructor(t, n, i) {
-    this.fn = t, this.setter = n, this._value = void 0, this.dep = new Ne(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = K - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !n, this.isSSR = i;
+class dt {
+  constructor(t, s, r) {
+    this._object = t, this._key = s, this._defaultValue = r, this.__v_isRef = !0, this._value = void 0;
+  }
+  get value() {
+    const t = this._object[this._key];
+    return this._value = t === void 0 ? this._defaultValue : t;
+  }
+  set value(t) {
+    this._object[this._key] = t;
+  }
+  get dep() {
+    return Je(h(this._object), this._key);
+  }
+}
+class _t {
+  constructor(t) {
+    this._getter = t, this.__v_isRef = !0, this.__v_isReadonly = !0, this._value = void 0;
+  }
+  get value() {
+    return this._value = this._getter();
+  }
+}
+function St(e, t, s) {
+  return b(e) ? e : Z(e) ? new _t(e) : P(e) && arguments.length > 1 ? vt(e, t, s) : ut(e);
+}
+function vt(e, t, s) {
+  const r = e[t];
+  return b(r) ? r : new dt(e, t, s);
+}
+class gt {
+  constructor(t, s, r) {
+    this.fn = t, this.setter = s, this._value = void 0, this.dep = new _e(this), this.__v_isRef = !0, this.deps = void 0, this.depsTail = void 0, this.flags = 16, this.globalVersion = $ - 1, this.next = void 0, this.effect = this, this.__v_isReadonly = !s, this.isSSR = r;
   }
   /**
    * @internal
    */
   notify() {
     if (this.flags |= 16, !(this.flags & 8) && // avoid infinite self recursion
-    l !== this)
-      return _e(this, !0), !0;
+    u !== this)
+      return ye(this, !0), !0;
     process.env.NODE_ENV;
   }
   get value() {
@@ -752,124 +814,158 @@ class ot {
       type: "get",
       key: "value"
     }) : this.dep.track();
-    return we(this), t && (t.version = this.dep.version), this._value;
+    return Re(this), t && (t.version = this.dep.version), this._value;
   }
   set value(t) {
     this.setter ? this.setter(t) : process.env.NODE_ENV !== "production" && D("Write operation failed: computed value is readonly");
   }
 }
-function lt(e, t, n = !1) {
-  let i, s;
-  q(e) ? i = e : (i = e.get, s = e.set);
-  const r = new ot(i, s, n);
-  return process.env.NODE_ENV, r;
+function yt(e, t, s = !1) {
+  let r, i;
+  Z(e) ? r = e : (r = e.get, i = e.set);
+  const n = new gt(r, i, s);
+  return process.env.NODE_ENV, n;
 }
-const de = {}, B = /* @__PURE__ */ new WeakMap();
-let z;
-function ct(e, t = !1, n = z) {
-  if (n) {
-    let i = B.get(n);
-    i || B.set(n, i = []), i.push(e);
+const q = {}, ee = /* @__PURE__ */ new WeakMap();
+let T;
+function bt(e, t = !1, s = T) {
+  if (s) {
+    let r = ee.get(s);
+    r || ee.set(s, r = []), r.push(e);
   } else process.env.NODE_ENV !== "production" && !t && D(
     "onWatcherCleanup() was called when there was no active watcher to associate with."
   );
 }
-function ut(e, t, n = Pe) {
-  const { immediate: i, deep: s, once: r, scheduler: o, augmentJob: c, call: a } = n, d = (u) => {
-    (n.onWarn || D)(
+function Dt(e, t, s = We) {
+  const { immediate: r, deep: i, once: n, scheduler: o, augmentJob: a, call: c } = s, p = (l) => {
+    (s.onWarn || D)(
       "Invalid watch source: ",
-      u,
+      l,
       "A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types."
     );
-  }, v = (u) => s ? u : w(u) || s === !1 || s === 0 ? y(u, 1) : y(u);
-  let f, h, F, G, fe = !1;
-  S(e) ? (h = () => e.value, w(e)) : Y(e) ? h = () => v(e) : x(e) ? (fe = !0, e.some((u) => Y(u) || w(u)), h = () => e.map((u) => {
-    if (S(u))
-      return u.value;
-    if (Y(u))
-      return v(u);
-    if (q(u))
-      return a ? a(u, 2) : u();
-    process.env.NODE_ENV !== "production" && d(u);
-  })) : q(e) ? h = () => {
-    if (F) {
-      Se();
+  }, _ = (l) => i ? l : E(l) || i === !1 || i === 0 ? R(l, 1) : R(l);
+  let f, d, K, B, F = !1, G = !1;
+  if (b(e) ? (d = () => e.value, F = E(e)) : X(e) ? (d = () => _(e), F = !0) : x(e) ? (G = !0, F = e.some((l) => X(l) || E(l)), d = () => e.map((l) => {
+    if (b(l))
+      return l.value;
+    if (X(l))
+      return _(l);
+    if (Z(l))
+      return c ? c(l, 2) : l();
+    process.env.NODE_ENV !== "production" && p(l);
+  })) : Z(e) ? t ? d = c ? () => c(e, 2) : e : d = () => {
+    if (K) {
+      xe();
       try {
-        F();
+        K();
       } finally {
-        De();
+        Oe();
       }
     }
-    const u = z;
-    z = f;
+    const l = T;
+    T = f;
     try {
-      return a ? a(e, 3, [G]) : e(G);
+      return c ? c(e, 3, [B]) : e(B);
     } finally {
-      z = u;
+      T = l;
     }
-  } : (h = Le, process.env.NODE_ENV !== "production" && d(e));
-  const V = () => {
+  } : (d = $e, process.env.NODE_ENV !== "production" && p(e)), t && i) {
+    const l = d, S = i === !0 ? 1 / 0 : i;
+    d = () => R(l(), S);
+  }
+  const M = () => {
     f.stop();
   };
-  fe && new Array(e.length).fill(de);
-  const H = (u) => {
-    !(f.flags & 1) || !f.dirty && !u || f.run();
+  if (n && t) {
+    const l = t;
+    t = (...S) => {
+      l(...S), M();
+    };
+  }
+  let O = G ? new Array(e.length).fill(q) : q;
+  const L = (l) => {
+    if (!(!(f.flags & 1) || !f.dirty && !l))
+      if (t) {
+        const S = f.run();
+        if (i || F || (G ? S.some((te, J) => m(te, O[J])) : m(S, O))) {
+          K && K();
+          const te = T;
+          T = f;
+          try {
+            const J = [
+              S,
+              // pass undefined as the old value when it's changed for the first time
+              O === q ? void 0 : G && O[0] === q ? [] : O,
+              B
+            ];
+            c ? c(t, 3, J) : (
+              // @ts-expect-error
+              t(...J)
+            ), O = S;
+          } finally {
+            T = te;
+          }
+        }
+      } else
+        f.run();
   };
-  return c && c(H), f = new Ce(h), f.scheduler = o ? () => o(H, !1) : H, G = (u) => ct(u, !1, f), F = f.onStop = () => {
-    const u = B.get(f);
-    if (u) {
-      if (a)
-        a(u, 4);
+  return a && a(L), f = new Be(d), f.scheduler = o ? () => o(L, !1) : L, B = (l) => bt(l, !1, f), K = f.onStop = () => {
+    const l = ee.get(f);
+    if (l) {
+      if (c)
+        c(l, 4);
       else
-        for (const Ae of u) Ae();
-      B.delete(f);
+        for (const S of l) S();
+      ee.delete(f);
     }
-  }, process.env.NODE_ENV !== "production" && (f.onTrack = n.onTrack, f.onTrigger = n.onTrigger), o ? o(H.bind(null, !0), !0) : f.run(), V.pause = f.pause.bind(f), V.resume = f.resume.bind(f), V.stop = V, V;
+  }, process.env.NODE_ENV !== "production" && (f.onTrack = s.onTrack, f.onTrigger = s.onTrigger), t ? r ? L(!0) : O = f.run() : o ? o(L.bind(null, !0), !0) : f.run(), M.pause = f.pause.bind(f), M.resume = f.resume.bind(f), M.stop = M, M;
 }
-function y(e, t = 1 / 0, n) {
-  if (t <= 0 || !W(e) || e.__v_skip || (n = n || /* @__PURE__ */ new Set(), n.has(e)))
+function R(e, t = 1 / 0, s) {
+  if (t <= 0 || !P(e) || e.__v_skip || (s = s || /* @__PURE__ */ new Set(), s.has(e)))
     return e;
-  if (n.add(e), t--, S(e))
-    y(e.value, t, n);
+  if (s.add(e), t--, b(e))
+    R(e.value, t, s);
   else if (x(e))
-    for (let i = 0; i < e.length; i++)
-      y(e[i], t, n);
-  else if (We(e) || O(e))
-    e.forEach((i) => {
-      y(i, t, n);
+    for (let r = 0; r < e.length; r++)
+      R(e[r], t, s);
+  else if (Ye(e) || j(e))
+    e.forEach((r) => {
+      R(r, t, s);
     });
-  else if (He(e)) {
-    for (const i in e)
-      y(e[i], t, n);
-    for (const i of Object.getOwnPropertySymbols(e))
-      Object.prototype.propertyIsEnumerable.call(e, i) && y(e[i], t, n);
+  else if (ze(e)) {
+    for (const r in e)
+      R(e[r], t, s);
+    for (const r of Object.getOwnPropertySymbols(e))
+      Object.prototype.propertyIsEnumerable.call(e, r) && R(e[r], t, s);
   }
   return e;
 }
 export {
-  j as ARRAY_ITERATE_KEY,
-  m as ITERATE_KEY,
-  te as MAP_KEY_ITERATE_KEY,
-  Ce as ReactiveEffect,
-  lt as computed,
-  rt as isProxy,
-  Y as isReactive,
-  T as isReadonly,
-  S as isRef,
-  w as isShallow,
-  ct as onWatcherCleanup,
-  Se as pauseTracking,
-  Ve as reactive,
-  R as reactiveReadArray,
-  Ie as readonly,
-  De as resetTracking,
-  ae as shallowReadArray,
-  p as toRaw,
-  g as toReactive,
-  se as toReadonly,
-  _ as track,
-  y as traverse,
+  Y as ARRAY_ITERATE_KEY,
+  V as ITERATE_KEY,
+  ce as MAP_KEY_ITERATE_KEY,
+  Be as ReactiveEffect,
+  yt as computed,
+  lt as isProxy,
+  X as isReactive,
+  I as isReadonly,
+  b as isRef,
+  E as isShallow,
+  bt as onWatcherCleanup,
+  xe as pauseTracking,
+  Pe as reactive,
+  A as reactiveReadArray,
+  Ke as readonly,
+  ut as ref,
+  Oe as resetTracking,
+  ve as shallowReadArray,
+  h as toRaw,
+  v as toReactive,
+  le as toReadonly,
+  St as toRef,
+  g as track,
+  R as traverse,
   N as trigger,
-  ft as unref,
-  ut as watch
+  Et as unref,
+  Dt as watch
 };