@duxweb/dvha-naiveui 1.0.9 → 1.0.11

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

@@ -1,975 +0,0 @@
-import { isFunction as $, isObject as P, EMPTY_OBJ as We, hasChanged as m, isArray as x, extend as ne, toRawType as Ee, isSymbol as B, 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
-* @license MIT
-**/
-function D(e, ...t) {
-  console.warn(`[Vue warn] ${e}`, ...t);
-}
-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;
-  }
-  pause() {
-    this.flags |= 64;
-  }
-  resume() {
-    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 || ye(this);
-  }
-  run() {
-    if (!(this.flags & 1))
-      return this.fn();
-    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" && u !== this && D(
-        "Active effect was not restored correctly - this is likely a Vue internal bug."
-      ), Ne(this), u = t, w = s, this.flags &= -3;
-    }
-  }
-  stop() {
-    if (this.flags & 1) {
-      for (let t = this.deps; t; t = t.nextDep)
-        de(t);
-      this.deps = this.depsTail = void 0, ge(this), this.onStop && this.onStop(), this.flags &= -2;
-    }
-  }
-  trigger() {
-    this.flags & 64 ? se.add(this) : this.scheduler ? this.scheduler() : this.runIfDirty();
-  }
-  /**
-   * @internal
-   */
-  runIfDirty() {
-    ae(this) && this.run();
-  }
-  get dirty() {
-    return ae(this);
-  }
-}
-let Se = 0, H, C;
-function ye(e, t = !1) {
-  if (e.flags |= 8, t) {
-    e.next = C, C = e;
-    return;
-  }
-  e.next = H, H = e;
-}
-function he() {
-  Se++;
-}
-function pe() {
-  if (--Se > 0)
-    return;
-  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 (; 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 (r) {
-          e || (e = r);
-        }
-      t = s;
-    }
-  }
-  if (e) throw 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 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 = s;
-}
-function ae(e) {
-  for (let t = e.deps; t; t = t.nextDep)
-    if (t.dep.version !== t.version || t.dep.computed && (Re(t.dep.computed) || t.dep.version !== t.version))
-      return !0;
-  return !!e._dirty;
-}
-function Re(e) {
-  if (e.flags & 4 && !(e.flags & 16) || (e.flags &= -17, e.globalVersion === Y) || (e.globalVersion = Y, !e.isSSR && e.flags & 128 && (!e.deps && !e._dirty || !ae(e))))
-    return;
-  e.flags |= 2;
-  const t = e.dep, s = u, r = w;
-  u = e, w = !0;
-  try {
-    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 {
-    u = s, w = r, Ne(e), e.flags &= -3;
-  }
-}
-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 && !--s.sc && s.map && s.map.delete(s.key);
-}
-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 w = !0;
-const me = [];
-function xe() {
-  me.push(w), w = !1;
-}
-function Oe() {
-  const e = me.pop();
-  w = e === void 0 ? !0 : e;
-}
-function ge(e) {
-  const { cleanup: t } = e;
-  if (e.cleanup = void 0, t) {
-    const s = u;
-    u = void 0;
-    try {
-      t();
-    } finally {
-      u = s;
-    }
-  }
-}
-let Y = 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 _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 (!u || !w || u === this.computed)
-      return;
-    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" && u.onTrack && u.onTrack(
-      ne(
-        {
-          effect: u
-        },
-        t
-      )
-    ), s;
-  }
-  trigger(t) {
-    this.version++, Y++, this.notify(t);
-  }
-  notify(t) {
-    he();
-    try {
-      if (process.env.NODE_ENV !== "production")
-        for (let s = this.subsHead; s; s = s.nextSub)
-          s.sub.onTrigger && !(s.sub.flags & 8) && s.sub.onTrigger(
-            ne(
-              {
-                effect: s.sub
-              },
-              t
-            )
-          );
-      for (let s = this.subs; s; s = s.prevSub)
-        s.sub.notify() && s.sub.dep.notify();
-    } finally {
-      pe();
-    }
-  }
-}
-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 r = t.deps; r; r = r.nextDep)
-        Te(r);
-    }
-    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 k = /* @__PURE__ */ new WeakMap(), V = Symbol(
-  process.env.NODE_ENV !== "production" ? "Object iterate" : ""
-), ce = Symbol(
-  process.env.NODE_ENV !== "production" ? "Map keys iterate" : ""
-), z = Symbol(
-  process.env.NODE_ENV !== "production" ? "Array iterate" : ""
-);
-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: s
-    }) : i.track();
-  }
-}
-function N(e, t, s, r, i, n) {
-  const o = k.get(e);
-  if (!o) {
-    Y++;
-    return;
-  }
-  const a = (c) => {
-    c && (process.env.NODE_ENV !== "production" ? c.trigger({
-      target: e,
-      type: t,
-      key: s,
-      newValue: r,
-      oldValue: i,
-      oldTarget: n
-    }) : c.trigger());
-  };
-  if (he(), t === "clear")
-    o.forEach(a);
-  else {
-    const c = x(e), p = c && ue(s);
-    if (c && s === "length") {
-      const _ = Number(r);
-      o.forEach((f, d) => {
-        (d === "length" || d === z || !B(d) && d >= _) && a(f);
-      });
-    } else
-      switch ((s !== void 0 || o.has(void 0)) && a(o.get(s)), p && a(o.get(z)), t) {
-        case "add":
-          c ? p && a(o.get("length")) : (a(o.get(V)), j(e) && a(o.get(ce)));
-          break;
-        case "delete":
-          c || (a(o.get(V)), j(e) && a(o.get(ce)));
-          break;
-        case "set":
-          j(e) && a(o.get(V));
-          break;
-      }
-  }
-  pe();
-}
-function Je(e, t) {
-  const s = k.get(e);
-  return s && s.get(t);
-}
-function A(e) {
-  const t = h(e);
-  return t === e ? t : (g(t, "iterate", z), E(e) ? t : t.map(v));
-}
-function ve(e) {
-  return g(e = h(e), "iterate", z), e;
-}
-const Qe = {
-  __proto__: null,
-  [Symbol.iterator]() {
-    return ie(this, Symbol.iterator, v);
-  },
-  concat(...e) {
-    return A(this).concat(
-      ...e.map((t) => x(t) ? A(t) : t)
-    );
-  },
-  entries() {
-    return ie(this, "entries", (e) => (e[1] = v(e[1]), e));
-  },
-  every(e, t) {
-    return y(this, "every", e, t, void 0, arguments);
-  },
-  filter(e, t) {
-    return y(this, "filter", e, t, (s) => s.map(v), arguments);
-  },
-  find(e, t) {
-    return y(this, "find", e, t, v, arguments);
-  },
-  findIndex(e, t) {
-    return y(this, "findIndex", e, t, void 0, arguments);
-  },
-  findLast(e, t) {
-    return y(this, "findLast", e, t, v, arguments);
-  },
-  findLastIndex(e, t) {
-    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 y(this, "forEach", e, t, void 0, arguments);
-  },
-  includes(...e) {
-    return re(this, "includes", e);
-  },
-  indexOf(...e) {
-    return re(this, "indexOf", e);
-  },
-  join(e) {
-    return A(this).join(e);
-  },
-  // keys() iterator only reads `length`, no optimisation required
-  lastIndexOf(...e) {
-    return re(this, "lastIndexOf", e);
-  },
-  map(e, t) {
-    return y(this, "map", e, t, void 0, arguments);
-  },
-  pop() {
-    return W(this, "pop");
-  },
-  push(...e) {
-    return W(this, "push", e);
-  },
-  reduce(e, ...t) {
-    return be(this, "reduce", e, t);
-  },
-  reduceRight(e, ...t) {
-    return be(this, "reduceRight", e, t);
-  },
-  shift() {
-    return W(this, "shift");
-  },
-  // slice could use ARRAY_ITERATE but also seems to beg for range tracking
-  some(e, t) {
-    return y(this, "some", e, t, void 0, arguments);
-  },
-  splice(...e) {
-    return W(this, "splice", e);
-  },
-  toReversed() {
-    return A(this).toReversed();
-  },
-  toSorted(e) {
-    return A(this).toSorted(e);
-  },
-  toSpliced(...e) {
-    return A(this).toSpliced(...e);
-  },
-  unshift(...e) {
-    return W(this, "unshift", e);
-  },
-  values() {
-    return ie(this, "values", v);
-  }
-};
-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 _ = 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", z);
-  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(B)
-);
-function Xe(e) {
-  B(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(r) ? t : void 0;
-    const o = x(t);
-    if (!i) {
-      let c;
-      if (o && (c = Qe[s]))
-        return c;
-      if (s === "hasOwnProperty")
-        return Xe;
-    }
-    const a = Reflect.get(
-      t,
-      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
-      b(t) ? t : r
-    );
-    return (B(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 Ze extends Ie {
-  constructor(t = !1) {
-    super(!1, t);
-  }
-  set(t, s, r, i) {
-    let n = t[s];
-    if (!this._isShallow) {
-      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) && ue(s) ? Number(s) < t.length : oe(t, s), a = Reflect.set(
-      t,
-      s,
-      r,
-      b(t) ? t : i
-    );
-    return t === h(i) && (o ? m(r, n) && N(t, "set", s, r, n) : N(t, "add", s, r)), a;
-  }
-  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, s) {
-    const r = Reflect.has(t, s);
-    return (!B(s) || !Ve.has(s)) && g(t, "has", s), r;
-  }
-  ownKeys(t) {
-    return g(
-      t,
-      "iterate",
-      x(t) ? "length" : V
-    ), Reflect.ownKeys(t);
-  }
-}
-class ke extends Ie {
-  constructor(t = !1) {
-    super(!0, t);
-  }
-  set(t, s) {
-    return process.env.NODE_ENV !== "production" && D(
-      `Set operation on key "${String(s)}" failed: target is readonly.`,
-      t
-    ), !0;
-  }
-  deleteProperty(t, s) {
-    return process.env.NODE_ENV !== "production" && D(
-      `Delete operation on key "${String(s)}" failed: target is readonly.`,
-      t
-    ), !0;
-  }
-}
-const et = /* @__PURE__ */ new Ze(), tt = /* @__PURE__ */ new ke(), fe = (e) => e, U = (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",
-      c ? ce : V
-    ), {
-      // iterator protocol
-      next() {
-        const { value: f, done: d } = p.next();
-        return d ? { value: f, done: d } : {
-          value: a ? [_(f[0]), _(f[1])] : _(f),
-          done: d
-        };
-      },
-      // iterable protocol
-      [Symbol.iterator]() {
-        return this;
-      }
-    };
-  };
-}
-function q(e) {
-  return function(...t) {
-    if (process.env.NODE_ENV !== "production") {
-      const s = t[0] ? `on key "${t[0]}" ` : "";
-      D(
-        `${Ce(e)} operation ${s}failed: target is readonly.`,
-        h(this)
-      );
-    }
-    return e === "delete" ? !1 : e === "clear" ? void 0 : this;
-  };
-}
-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 } = U(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 i = this.__v_raw;
-      return !e && g(h(i), "iterate", V), Reflect.get(i, "size", i);
-    },
-    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(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 ne(
-    s,
-    e ? {
-      add: q("add"),
-      set: q("set"),
-      delete: q("delete"),
-      clear: q("clear")
-    } : {
-      add(i) {
-        !t && !E(i) && !I(i) && (i = h(i));
-        const n = h(this);
-        return U(n).has.call(n, i) || (n.add(i), N(n, "add", i, i)), this;
-      },
-      set(i, n) {
-        !t && !E(n) && !I(n) && (n = h(n));
-        const o = h(this), { has: a, get: c } = U(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(i) {
-        const n = h(this), { has: o, get: a } = U(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 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
-        ), a;
-      }
-    }
-  ), [
-    "keys",
-    "values",
-    "entries",
-    Symbol.iterator
-  ].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 rt = {
-  get: /* @__PURE__ */ Me(!1, !1)
-}, nt = {
-  get: /* @__PURE__ */ Me(!0, !1)
-};
-function we(e, t, s) {
-  const r = h(s);
-  if (r !== s && t.call(e, r)) {
-    const i = Ee(e);
-    D(
-      `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 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":
-      return 1;
-    case "Map":
-    case "Set":
-    case "WeakMap":
-    case "WeakSet":
-      return 2;
-    default:
-      return 0;
-  }
-}
-function ft(e) {
-  return e.__v_skip || !Object.isExtensible(e) ? 0 : ct(Ee(e));
-}
-function Pe(e) {
-  return I(e) ? e : Le(
-    e,
-    !1,
-    et,
-    rt,
-    Ae
-  );
-}
-function Ke(e) {
-  return Le(
-    e,
-    !0,
-    tt,
-    nt,
-    je
-  );
-}
-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
-      )}`
-    ), e;
-  if (e.__v_raw && !(t && e.__v_isReactive))
-    return e;
-  const n = ft(e);
-  if (n === 0)
-    return e;
-  const o = i.get(e);
-  if (o)
-    return o;
-  const a = new Proxy(
-    e,
-    n === 2 ? r : s
-  );
-  return i.set(e, a), a;
-}
-function Z(e) {
-  return I(e) ? Z(e.__v_raw) : !!(e && e.__v_isReactive);
-}
-function I(e) {
-  return !!(e && e.__v_isReadonly);
-}
-function E(e) {
-  return !!(e && e.__v_isShallow);
-}
-function lt(e) {
-  return e ? !!e.__v_raw : !1;
-}
-function h(e) {
-  const t = e && e.__v_raw;
-  return t ? h(t) : 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 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 dt(e) {
-  return b(e) ? e.value : e;
-}
-function St(e) {
-  return $(e) ? e() : dt(e);
-}
-class _t {
-  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 vt {
-  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 yt(e, t, s) {
-  return b(e) ? e : $(e) ? new vt(e) : P(e) && arguments.length > 1 ? gt(e, t, s) : ut(e);
-}
-function gt(e, t, s) {
-  const r = e[t];
-  return b(r) ? r : new _t(e, t, s);
-}
-class bt {
-  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 = Y - 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
-    u !== this)
-      return ye(this, !0), !0;
-    process.env.NODE_ENV;
-  }
-  get value() {
-    const t = process.env.NODE_ENV !== "production" ? this.dep.track({
-      target: this,
-      type: "get",
-      key: "value"
-    }) : this.dep.track();
-    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 Dt(e, t, s = !1) {
-  let r, i;
-  $(e) ? r = e : (r = e.get, i = e.set);
-  const n = new bt(r, i, s);
-  return process.env.NODE_ENV, n;
-}
-const X = {}, ee = /* @__PURE__ */ new WeakMap();
-let T;
-function wt(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 Nt(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: ",
-      l,
-      "A watch source can only be a getter/effect function, a ref, a reactive object, or an array of these types."
-    );
-  }, _ = (l) => i ? l : E(l) || i === !1 || i === 0 ? R(l, 1) : R(l);
-  let f, d, K, F, G = !1, J = !1;
-  if (b(e) ? (d = () => e.value, G = E(e)) : Z(e) ? (d = () => _(e), G = !0) : x(e) ? (J = !0, G = e.some((l) => Z(l) || E(l)), d = () => e.map((l) => {
-    if (b(l))
-      return l.value;
-    if (Z(l))
-      return _(l);
-    if ($(l))
-      return c ? c(l, 2) : l();
-    process.env.NODE_ENV !== "production" && p(l);
-  })) : $(e) ? t ? d = c ? () => c(e, 2) : e : d = () => {
-    if (K) {
-      xe();
-      try {
-        K();
-      } finally {
-        Oe();
-      }
-    }
-    const l = T;
-    T = f;
-    try {
-      return c ? c(e, 3, [F]) : e(F);
-    } finally {
-      T = l;
-    }
-  } : (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();
-  };
-  if (n && t) {
-    const l = t;
-    t = (...S) => {
-      l(...S), M();
-    };
-  }
-  let O = J ? new Array(e.length).fill(X) : X;
-  const L = (l) => {
-    if (!(!(f.flags & 1) || !f.dirty && !l))
-      if (t) {
-        const S = f.run();
-        if (i || G || (J ? S.some((te, Q) => m(te, O[Q])) : m(S, O))) {
-          K && K();
-          const te = T;
-          T = f;
-          try {
-            const Q = [
-              S,
-              // pass undefined as the old value when it's changed for the first time
-              O === X ? void 0 : J && O[0] === X ? [] : O,
-              F
-            ];
-            c ? c(t, 3, Q) : (
-              // @ts-expect-error
-              t(...Q)
-            ), O = S;
-          } finally {
-            T = te;
-          }
-        }
-      } else
-        f.run();
-  };
-  return a && a(L), f = new Be(d), f.scheduler = o ? () => o(L, !1) : L, F = (l) => wt(l, !1, f), K = f.onStop = () => {
-    const l = ee.get(f);
-    if (l) {
-      if (c)
-        c(l, 4);
-      else
-        for (const S of l) S();
-      ee.delete(f);
-    }
-  }, 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 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 (s.add(e), t--, b(e))
-    R(e.value, t, s);
-  else if (x(e))
-    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 (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 {
-  z as ARRAY_ITERATE_KEY,
-  V as ITERATE_KEY,
-  ce as MAP_KEY_ITERATE_KEY,
-  Be as ReactiveEffect,
-  Dt as computed,
-  lt as isProxy,
-  Z as isReactive,
-  I as isReadonly,
-  b as isRef,
-  E as isShallow,
-  wt 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,
-  yt as toRef,
-  St as toValue,
-  g as track,
-  R as traverse,
-  N as trigger,
-  dt as unref,
-  Nt as watch
-};