@signaldb/oby 1.0.0 → 2.0.0-beta.1

package/dist/index.mjs

@@ -1,54 +1,54 @@
-import { createReactivityAdapter as Et } from "@signaldb/core";
-const xe = Symbol("Cached"), ce = Symbol("Observable"), Ge = Symbol("Observable.Boolean"), $e = Symbol("Observable.Frozen"), Te = Symbol("Observable.Readable"), Be = Symbol("Observable.Writable"), ne = Symbol("Store"), je = Symbol("Store.Keys"), We = Symbol("Store.Observable"), de = Symbol("Store.Target"), Pe = Symbol("Store.Values"), Ie = Symbol("Store.Untracked"), H = Symbol("Suspense"), Xe = Symbol("Uncached"), Ne = Symbol("Untracked"), Ze = Symbol("Untracked.Unwrapped"), wt = (e) => Q(e) ? e : [e], Ot = (e) => e instanceof Error ? e : typeof e == "string" ? new Error(e) : new Error("Unknown error"), { is: G } = Object, { isArray: Q } = Array, yt = (e, t) => {
+import { createReactivityAdapter as At } from "@signaldb/core";
+const Ee = Symbol("Cached"), te = Symbol("Observable"), Je = Symbol("Observable.Boolean"), Ye = Symbol("Observable.Frozen"), we = Symbol("Observable.Readable"), Oe = Symbol("Observable.Writable"), X = Symbol("Store"), Fe = Symbol("Store.Keys"), Ve = Symbol("Store.Observable"), ce = Symbol("Store.Target"), Re = Symbol("Store.Values"), _e = Symbol("Store.Untracked"), q = Symbol("Suspense"), ze = Symbol("Uncached"), me = Symbol("Untracked"), He = Symbol("Untracked.Unwrapped"), dt = (e) => K(e) ? e : [e], pt = (e) => e instanceof Error ? e : typeof e == "string" ? new Error(e) : new Error("Unknown error"), { is: J } = Object, { isArray: K } = Array, bt = (e, t) => {
   if (e.length !== t.length)
     return !1;
   for (let s = 0, n = e.length; s < n; s++) {
     const r = e[s], i = t[s];
-    if (!G(r, i))
+    if (!J(r, i))
       return !1;
   }
   return !0;
-}, _ = (e) => typeof e == "function", Le = (e) => e !== null && typeof e == "object", _t = (e) => typeof e == "symbol", Ce = () => {
-}, ke = () => !1;
-function Rt() {
+}, E = (e) => typeof e == "function", Me = (e) => e !== null && typeof e == "object", St = (e) => typeof e == "symbol", xe = () => {
+}, Ge = () => !1;
+function gt() {
   if (arguments.length)
     throw new Error("A readonly Observable can not be updated");
   return this;
 }
-function mt() {
+function yt() {
   if (arguments.length)
     throw new Error("A readonly Observable can not be updated");
   return this.get();
 }
-function Mt(e) {
-  return arguments.length ? _(e) ? this.C(e) : this.set(e) : this.get();
+function Et(e) {
+  return arguments.length ? E(e) ? this.C(e) : this.set(e) : this.get();
 }
-const C = (e) => {
-  const t = Rt.bind(e);
-  return t[ce] = !0, t[$e] = !0, t;
-}, F = (e) => {
-  const t = mt.bind(e);
-  return t[ce] = !0, t[Te] = e, t;
-}, et = (e) => {
-  const t = Mt.bind(e);
-  return t[ce] = !0, t[Be] = e, t;
-}, Je = 0, Ae = 1, be = 2, ge = 3, tt = C(!1), xt = C(!0), Ke = new Proxy({}, new Proxy({}, { get() {
+const P = (e) => {
+  const t = gt.bind(e);
+  return t[te] = !0, t[Ye] = !0, t;
+}, D = (e) => {
+  const t = yt.bind(e);
+  return t[te] = !0, t[we] = e, t;
+}, $e = (e) => {
+  const t = Et.bind(e);
+  return t[te] = !0, t[Oe] = e, t;
+}, Ke = 0, oe = 1, ue = 2, le = 3, je = P(!1), wt = P(!0), Te = new Proxy({}, new Proxy({}, { get() {
   throw new Error("Unavailable value");
-} })), st = function() {
-}, Re = (e, t) => {
+} })), We = function() {
+}, Se = (e, t) => {
   if (e instanceof Array)
     for (let s = 0, n = e.length; s < n; s++)
       t(e[s]);
   else e && t(e);
-}, fe = (e, t) => {
+}, re = (e, t) => {
   if (e instanceof Array)
     for (let s = e.length - 1; s >= 0; s--)
       t(e[s]);
   else e && t(e);
-}, ue = (e, t, s) => {
+}, se = (e, t, s) => {
   const n = e[t];
   n instanceof Array ? n.push(s) : n ? e[t] = [n, s] : e[t] = s;
-}, q = (e, t, s) => {
+}, U = (e, t, s) => {
   const n = e[t];
   if (n instanceof Set)
     n.add(s);
@@ -59,70 +59,65 @@ const C = (e) => {
     }
   } else
     e[t] = s;
-}, J = (e, t, s) => {
+}, v = (e, t, s) => {
   const n = e[t];
   n instanceof Set ? n.delete(s) : n === s && (e[t] = void 0);
-}, re = (e, t) => {
+}, Z = (e, t) => {
   if (e instanceof Set)
     for (const s of e)
       t(s);
   else e && t(e);
-}, Tt = (e) => e.call(e), me = (e) => e.Q(!0);
-class le {
+}, Ot = (e) => e.call(e), ge = (e) => e.Q(!0);
+class ne {
   constructor() {
     this.disposed = !1, this.B = void 0, this.S = void 0, this.D = void 0, this.K = void 0, this.T = void 0, this.U = void 0;
   }
   /* API */
   catch(t, s) {
-    var r;
     const { S: n } = this;
     if (n)
       return n(t), !0;
-    if ((r = this.parent) != null && r.catch(t, !0))
+    if (this.parent?.catch(t, !0))
       return !0;
     if (s)
       return !1;
     throw t;
   }
   Q(t) {
-    fe(this.D, me), fe(this.K, me), fe(this.U, me), fe(this.B, Tt), this.B = void 0, this.disposed = t, this.S = void 0, this.K = void 0, this.U = void 0;
+    re(this.D, ge), re(this.K, ge), re(this.U, ge), re(this.B, Ot), this.B = void 0, this.disposed = t, this.S = void 0, this.K = void 0, this.U = void 0;
   }
   get(t) {
-    var s;
-    return (s = this.context) == null ? void 0 : s[t];
+    return this.context?.[t];
   }
   E(t, s, n) {
-    const r = g, i = Y;
-    Fe(s), Se(n);
+    const r = A, i = H;
+    ve(s), he(n);
     try {
       return t();
-    } catch (o) {
-      return this.catch(Ot(o), !1), Ke;
+    } catch (c) {
+      return this.catch(pt(c), !1), Te;
     } finally {
-      Fe(r), Se(i);
+      ve(r), he(i);
     }
   }
 }
-class nt extends le {
+class Xe extends ne {
   constructor() {
     super(...arguments), this.context = {};
   }
 }
-let W, rt = new nt(), Y, g = rt;
-const Ye = (e) => W = e, Se = (e) => Y = e, Fe = (e) => g = e;
-let ae = 0, Ve = Ce;
-const Bt = async (e) => {
-  ae || Ye(new Promise((t) => Ve = t));
+let F, Ze = new Xe(), H, A = Ze;
+const Ue = (e) => F = e, he = (e) => H = e, ve = (e) => A = e;
+let ie = 0, De = xe;
+const Rt = async (e) => {
+  ie || Ue(new Promise((t) => De = t));
   try {
-    return ae += 1, await e();
+    return ie += 1, await e();
   } finally {
-    ae -= 1, ae || (Ye(void 0), Ve());
+    ie -= 1, ie || (Ue(void 0), De());
   }
-}, it = (e) => _(e) && Ge in e, ie = (e) => {
-  var t, s;
-  return _(e) && ($e in e || !!((s = (t = e[Te]) == null ? void 0 : t.parent) != null && s.disposed));
-}, Ue = (e) => _(e) && (Ne in e || Ze in e);
-let Pt = class {
+}, ke = (e) => E(e) && Je in e, k = (e) => E(e) && (Ye in e || !!e[we]?.parent?.disposed), Be = (e) => E(e) && (me in e || He in e);
+let _t = class {
   constructor() {
     this.A1 = [], this.M = 0, this.A2 = !1, this.N = () => {
       if (!this.A2 && !this.M && this.A1.length)
@@ -145,31 +140,30 @@ let Pt = class {
     };
   }
 };
-const te = new Pt();
-class N {
+const j = new _t();
+class T {
   /* CONSTRUCTOR */
   constructor(t, s, n) {
-    this.K = /* @__PURE__ */ new Set(), this.value = t, n && (this.parent = n), (s == null ? void 0 : s.equals) !== void 0 && (this.equals = s.equals || ke);
+    this.K = /* @__PURE__ */ new Set(), this.value = t, n && (this.parent = n), s?.equals !== void 0 && (this.equals = s.equals || Ge);
   }
   /* API */
   get() {
-    var t, s;
-    return (t = this.parent) != null && t.disposed || ((s = this.parent) == null || s.C(), Y == null || Y.A.L(this)), this.value;
+    return this.parent?.disposed || (this.parent?.C(), H?.A.L(this)), this.value;
   }
   set(t) {
-    const s = this.equals || G;
-    return (this.value === st || !s(t, this.value)) && (this.value = t, te.M += 1, this.I(ge), te.M -= 1, te.N()), t;
+    const s = this.equals || J;
+    return (this.value === We || !s(t, this.value)) && (this.value = t, j.M += 1, this.I(le), j.M -= 1, j.N()), t;
   }
   I(t) {
     for (const s of this.K)
-      (s.J !== Ae || s.A.has(this)) && (s.sync ? (s.J = Math.max(s.J, t), te.F(s)) : s.I(t));
+      (s.J !== oe || s.A.has(this)) && (s.sync ? (s.J = Math.max(s.J, t), j.F(s)) : s.I(t));
   }
   C(t) {
     const s = t(this.value);
     return this.set(s);
   }
 }
-class It {
+class mt {
   /* CONSTRUCTOR */
   constructor(t) {
     this.observer = t, this.A = [], this.P = 0;
@@ -205,21 +199,20 @@ class It {
         this.P += 1;
         return;
       }
-      const o = n.indexOf(t);
-      if (o >= 0 && o < r)
+      const c = n.indexOf(t);
+      if (c >= 0 && c < r)
         return;
       r < i - 1 ? this.R() : r === i - 1 && n[r].K.delete(s);
     }
-    t.K.add(s), n[this.P++] = t, r === 128 && (s.A = new Nt(s, n));
+    t.K.add(s), n[this.P++] = t, r === 128 && (s.A = new Mt(s, n));
   }
   C() {
-    var s;
     const { A: t } = this;
-    for (let n = 0, r = t.length; n < r; n++)
-      (s = t[n].parent) == null || s.C();
+    for (let s = 0, n = t.length; s < n; s++)
+      t[s].parent?.C();
   }
 }
-class Nt {
+class Mt {
   /* CONSTRUCTOR */
   constructor(t, s) {
     this.observer = t, this.A = new Set(s);
@@ -244,22 +237,21 @@ class Nt {
     r !== i && n.add(t);
   }
   C() {
-    var t;
-    for (const s of this.A)
-      (t = s.parent) == null || t.C();
+    for (const t of this.A)
+      t.parent?.C();
   }
 }
-class ve extends le {
+class Pe extends ne {
   /* CONSTRUCTOR */
   constructor() {
-    super(), this.parent = g, this.context = g.context, this.J = ge, this.A = new It(this), g !== rt && ue(this.parent, "K", this);
+    super(), this.parent = A, this.context = A.context, this.J = le, this.A = new mt(this), A !== Ze && se(this.parent, "K", this);
   }
   /* API */
   Q(t) {
     this.A.Q(t), super.Q(t);
   }
   H(t) {
-    this.Q(!1), this.J = Ae;
+    this.Q(!1), this.J = oe;
     try {
       return this.E(t, this, this);
     } finally {
@@ -273,66 +265,66 @@ class ve extends le {
     throw new Error("Abstract method");
   }
   C() {
-    this.disposed || (this.J === be && this.A.C(), this.J === ge ? (this.J = Ae, this.run(), this.J === Ae ? this.J = Je : this.C()) : this.J = Je);
+    this.disposed || (this.J === ue && this.A.C(), this.J === le ? (this.J = oe, this.run(), this.J === oe ? this.J = Ke : this.C()) : this.J = Ke);
   }
 }
-class Lt extends ve {
+class xt extends Pe {
   /* CONSTRUCTOR */
   constructor(t, s) {
-    super(), this.fn = t, this.observable = new N(st, s, this), (s == null ? void 0 : s.sync) === !0 && (this.sync = !0, this.C());
+    super(), this.fn = t, this.observable = new T(We, s, this), s?.sync === !0 && (this.sync = !0, this.C());
   }
   /* API */
   run() {
     const t = super.H(this.fn);
-    !this.disposed && this.A.empty() && (this.disposed = !0), t !== Ke && this.observable.set(t);
+    !this.disposed && this.A.empty() && (this.disposed = !0), t !== Te && this.observable.set(t);
   }
   I(t) {
     const s = this.J;
-    s >= t || (this.J = t, s !== be && this.observable.I(be));
+    s >= t || (this.J = t, s !== ue && this.observable.I(ue));
   }
 }
-const L = (e, t) => {
-  if (ie(e))
+const B = (e, t) => {
+  if (k(e))
     return e;
-  if (Ue(e))
-    return C(e());
+  if (Be(e))
+    return P(e());
   {
-    const s = new Lt(e, t);
-    return F(s.observable);
+    const s = new xt(e, t);
+    return D(s.observable);
   }
-}, De = (e) => {
-  if (_(e)) {
-    if (ie(e) || Ue(e))
+}, Ie = (e) => {
+  if (E(e)) {
+    if (k(e) || Be(e))
       return !!e();
-    if (it(e))
+    if (ke(e))
       return e;
     {
-      const t = L(() => !!e());
-      return t[Ge] = !0, t;
+      const t = B(() => !!e());
+      return t[Je] = !0, t;
     }
   } else
     return !!e;
-}, D = (e) => {
-  ue(g, "B", e);
+}, C = (e) => {
+  se(A, "B", e);
 };
-class Ct extends le {
+class Tt extends ne {
   /* CONSTRUCTOR */
   constructor(t) {
-    super(), this.parent = g, this.context = { ...g.context, ...t }, ue(this.parent, "D", this);
+    super(), this.parent = A, this.context = { ...A.context, ...t }, se(this.parent, "D", this);
   }
   /* API */
   E(t) {
     return super.E(t, this, void 0);
   }
 }
-function Kt(e, t) {
-  return _t(e) ? g.context[e] : new Ct(e).E(t || Ce);
+function Bt(e, t) {
+  return St(e) ? A.context[e] : new Tt(e).E(t || xe);
 }
-const Ut = () => {
-  const e = new N(!1);
-  return D(() => e.set(!0)), F(e);
+const Pt = () => {
+  const e = new T(!1);
+  return C(() => e.set(!0)), D(e);
 };
-class vt {
+class It {
   constructor() {
     this.A1 = [], this.A2 = !1, this.A3 = !1, this.N = () => {
       if (!this.A2 && this.A1.length)
@@ -353,7 +345,7 @@ class vt {
     }, this.resolve = () => {
       queueMicrotask(() => {
         queueMicrotask(() => {
-          W ? W.finally(this.resolve) : (this.A3 = !1, this.N());
+          F ? F.finally(this.resolve) : (this.A3 = !1, this.N());
         });
       });
     }, this.F = (t) => {
@@ -361,70 +353,68 @@ class vt {
     };
   }
 }
-const pe = new vt();
-class ot extends ve {
+const fe = new It();
+class et extends Pe {
   /* CONSTRUCTOR */
   constructor(t, s) {
-    if (super(), this.fn = t, (s == null ? void 0 : s.suspense) !== !1) {
-      const n = this.get(H);
+    if (super(), this.fn = t, s?.suspense !== !1) {
+      const n = this.get(q);
       n && (this.suspense = n);
     }
-    (s == null ? void 0 : s.sync) === !0 && (this.sync = !0), (s == null ? void 0 : s.sync) === "init" ? (this.init = !0, this.C()) : this.F();
+    s?.sync === !0 && (this.sync = !0), s?.sync === "init" ? (this.init = !0, this.C()) : this.F();
   }
   /* API */
   run() {
     const t = super.H(this.fn);
-    _(t) && ue(this, "B", t);
+    E(t) && se(this, "B", t);
   }
   F() {
-    var t;
-    (t = this.suspense) != null && t.suspended || (this.sync ? this.C() : pe.F(this));
+    this.suspense?.suspended || (this.sync ? this.C() : fe.F(this));
   }
   I(t) {
     const s = this.J;
     s >= t || (this.J = t, (!this.sync || s !== 2 && s !== 3) && this.F());
   }
   C() {
-    var t;
-    (t = this.suspense) != null && t.suspended || super.C();
+    this.suspense?.suspended || super.C();
   }
 }
-const we = (e, t) => {
-  const s = new ot(e, t);
+const Ae = (e, t) => {
+  const s = new et(e, t);
   return () => s.Q(!0);
 };
-function O(e) {
-  if (_(e))
-    return Ze in e ? O(e()) : Ne in e ? C(O(e())) : ce in e ? e : L(() => O(e()));
+function S(e) {
+  if (E(e))
+    return He in e ? S(e()) : me in e ? P(S(e())) : te in e ? e : B(() => S(e()));
   if (e instanceof Array) {
     const t = new Array(e.length);
     for (let s = 0, n = t.length; s < n; s++)
-      t[s] = O(e[s]);
+      t[s] = S(e[s]);
     return t;
   } else
     return e;
 }
-class Oe extends le {
+class de extends ne {
   /* CONSTRUCTOR */
   constructor(t) {
-    super(), this.parent = g, this.context = g.context, t && this.get(H) && (this.A0 = !0, q(this.parent, "T", this));
+    super(), this.parent = A, this.context = A.context, t && this.get(q) && (this.A0 = !0, U(this.parent, "T", this));
   }
   /* API */
   Q(t) {
-    this.A0 && J(this.parent, "T", this), super.Q(t);
+    this.A0 && v(this.parent, "T", this), super.Q(t);
   }
   E(t) {
     const s = () => this.Q(!0), n = () => t(s);
     return super.E(n, this, void 0);
   }
 }
-const Dt = C(-1);
-let Qt = class extends Oe {
+const Nt = P(-1);
+let Lt = class extends de {
 };
-class qt {
+class Ct {
   /* CONSTRUCTOR */
   constructor(t) {
-    this.parent = g, this.suspense = g.get(H), this.A5 = /* @__PURE__ */ new Map(), this.A6 = !1, this.A7 = 0, this.A8 = 0, this.A9 = 0, this.cleanup = () => {
+    this.parent = A, this.suspense = A.get(q), this.A5 = /* @__PURE__ */ new Map(), this.A6 = !1, this.A7 = 0, this.A8 = 0, this.A9 = 0, this.cleanup = () => {
       if (!this.A7 || this.A7 === this.A8)
         return;
       const { A5: s, A6: n } = this;
@@ -434,62 +424,59 @@ class qt {
         r.Q(!0);
       }), this.A5 = /* @__PURE__ */ new Map()));
     }, this.Q = () => {
-      this.suspense && J(this.parent, "T", this.T), this.A7 = this.A5.size, this.A8 = 0, this.A9 = 0, this.cleanup();
+      this.suspense && v(this.parent, "T", this.T), this.A7 = this.A5.size, this.A8 = 0, this.A9 = 0, this.cleanup();
     }, this.AA = () => {
       this.A6 = !this.A6, this.A8 = 0, this.A9 = 0;
     }, this.O = (s) => {
       this.A9 = s.length, this.cleanup(), this.A7 = this.A9, this.A8 = 0;
     }, this.map = (s) => {
-      var A;
       this.AA();
-      const { A5: n, A6: r, fn: i, AB: o } = this, u = new Array(s.length);
-      let c = !0, h = !0, l = 0;
-      for (let f = 0, S = s.length; f < S; f++) {
-        const d = s[f], b = n.get(d);
-        if (b && b.A6 !== r)
-          h = !1, l += 1, b.A6 = r, (A = b.index) == null || A.set(f), u[f] = b.G;
+      const { A5: n, A6: r, fn: i, AB: c } = this, u = new Array(s.length);
+      let o = !0, l = !0, p = 0;
+      for (let a = 0, d = s.length; a < d; a++) {
+        const g = s[a], h = n.get(g);
+        if (h && h.A6 !== r)
+          l = !1, p += 1, h.A6 = r, h.index?.set(a), u[a] = h.G;
         else {
-          c = !1;
-          const p = new Qt(!1);
-          b && D(() => p.Q(!0)), p.E(() => {
-            let y = Dt;
-            o && (p.index = new N(f), y = F(p.index));
-            const j = u[f] = O(i(d, y));
-            p.A6 = r, p.G = j, b || n.set(d, p);
+          o = !1;
+          const w = new Lt(!1);
+          h && C(() => w.Q(!0)), w.E(() => {
+            let y = Nt;
+            c && (w.index = new T(a), y = D(w.index));
+            const _ = u[a] = S(i(g, y));
+            w.A6 = r, w.G = _, h || n.set(g, w);
           });
         }
       }
-      return this.A8 = l, this.O(s), c && (u[xe] = !0), h && (u[Xe] = !0), u;
-    }, this.T = () => Array.from(this.A5.values()), this.fn = t, this.AB = t.length > 1, this.suspense && q(this.parent, "T", this.T);
+      return this.A8 = p, this.O(s), o && (u[Ee] = !0), l && (u[ze] = !0), u;
+    }, this.T = () => Array.from(this.A5.values()), this.fn = t, this.AB = t.length > 1, this.suspense && U(this.parent, "T", this.T);
   }
 }
-const Qe = (e) => _(e) && ce in e;
-function X(e, t = !0) {
-  return (t ? _ : Qe)(e) ? e() : e;
+const Ne = (e) => E(e) && te in e;
+function V(e, t = !0) {
+  return (t ? E : Ne)(e) ? e() : e;
 }
-class ct extends le {
+class tt extends ne {
   /* CONSTRUCTOR */
   constructor() {
-    var t;
-    super(), this.parent = g, this.context = { ...g.context, [H]: this }, ue(this.parent, "U", this), this.suspended = ((t = g.get(H)) == null ? void 0 : t.suspended) || 0;
+    super(), this.parent = A, this.context = { ...A.context, [q]: this }, se(this.parent, "U", this), this.suspended = A.get(q)?.suspended || 0;
   }
   /* API */
   A4(t) {
-    var c;
     if (!this.suspended && !t)
       return;
     const s = this.suspended, n = s + (t ? 1 : -1);
     if (this.suspended = n, !!s == !!n)
       return;
-    (c = this.observable) == null || c.set(!!n);
-    const r = (h) => {
-      Re(h.D, r), Re(h.K, i), Re(h.U, u), re(h.T, o);
-    }, i = (h) => {
-      h instanceof ot && (h.J === be || h.J === ge) && (h.init ? h.C() : h.F()), r(h);
-    }, o = (h) => {
-      _(h) ? h().forEach(r) : r(h);
-    }, u = (h) => {
-      h.A4(t);
+    this.observable?.set(!!n);
+    const r = (o) => {
+      Se(o.D, r), Se(o.K, i), Se(o.U, u), Z(o.T, c);
+    }, i = (o) => {
+      o instanceof et && (o.J === ue || o.J === le) && (o.init ? o.C() : o.F()), r(o);
+    }, c = (o) => {
+      E(o) ? o().forEach(r) : r(o);
+    }, u = (o) => {
+      o.A4(t);
     };
     r(this);
   }
@@ -497,136 +484,134 @@ class ct extends le {
     return super.E(t, this, void 0);
   }
 }
-const ut = (e, t) => {
-  const s = new ct(), n = De(e);
-  return we(() => s.A4(X(n)), { sync: !0 }), s.E(t);
-}, Jt = C(-1);
-class Yt extends Oe {
+const st = (e, t) => {
+  const s = new tt(), n = Ie(e);
+  return Ae(() => s.A4(V(n)), { sync: !0 }), s.E(t);
+}, Kt = P(-1);
+class Ut extends de {
 }
-class Ft {
+class vt {
   /* CONSTRUCTOR */
   constructor(t, s) {
-    this.parent = g, this.suspense = g.get(H), this.A5 = /* @__PURE__ */ new Map(), this.AC = [], this.AD = 0, this.cleanup = () => {
+    this.parent = A, this.suspense = A.get(q), this.A5 = /* @__PURE__ */ new Map(), this.AC = [], this.AD = 0, this.cleanup = () => {
       let n = 0, r = Math.max(0, this.pooled ? this.AD - this.AC.length : 0);
       this.A5.forEach((i) => {
-        var o;
-        r > 0 && n++ < r ? ((o = i.suspended) == null || o.set(!0), this.AC.push(i)) : i.Q(!0);
+        r > 0 && n++ < r ? (i.suspended?.set(!0), this.AC.push(i)) : i.Q(!0);
       });
     }, this.Q = () => {
-      this.suspense && J(this.parent, "T", this.T), this.A5.forEach((n) => {
+      this.suspense && v(this.parent, "T", this.T), this.A5.forEach((n) => {
         n.Q(!0);
       }), this.AC.forEach((n) => {
         n.Q(!0);
       });
     }, this.map = (n) => {
-      var d, b, p, y, j, he;
-      const { A5: r, fn: i, AB: o } = this, u = /* @__PURE__ */ new Map(), c = new Array(n.length), h = this.AC, l = this.pooled;
-      let A = !0, f = !0, S = [];
+      const { A5: r, fn: i, AB: c } = this, u = /* @__PURE__ */ new Map(), o = new Array(n.length), l = this.AC, p = this.pooled;
+      let a = !0, d = !0, g = [];
       if (r.size)
-        for (let M = 0, E = n.length; M < E; M++) {
-          const x = n[M], T = r.get(x);
-          T ? (f = !1, r.delete(x), u.set(x, T), (d = T.index) == null || d.set(M), c[M] = T.G) : S.push(M);
+        for (let h = 0, w = n.length; h < w; h++) {
+          const y = n[h], _ = r.get(y);
+          _ ? (d = !1, r.delete(y), u.set(y, _), _.index?.set(h), o[h] = _.G) : g.push(h);
         }
       else
-        S = new Array(c.length);
-      e: for (let M = 0, E = S.length; M < E; M++) {
-        const x = S[M] || M, T = n[x], V = u.has(T);
-        if (!V)
-          for (const [k, z] of r.entries()) {
-            r.delete(k), u.set(T, z), (b = z.index) == null || b.set(x), (p = z.value) == null || p.set(T), c[x] = z.G;
+        g = new Array(o.length);
+      e: for (let h = 0, w = g.length; h < w; h++) {
+        const y = g[h] || h, _ = n[y], Le = u.has(_);
+        if (!Le)
+          for (const [G, Q] of r.entries()) {
+            r.delete(G), u.set(_, Q), Q.index?.set(y), Q.value?.set(_), o[y] = Q.G;
             continue e;
           }
-        A = !1;
-        let R;
-        l && h.length ? (R = h.pop(), (y = R.index) == null || y.set(x), (j = R.value) == null || j.set(T), (he = R.suspended) == null || he.set(!1), c[x] = R.G) : (R = new Yt(!1), R.E(() => {
-          let k = Jt;
-          o && (R.index = new N(x), k = F(R.index));
-          const z = R.value = new N(T), _e = l ? new N(!1) : void 0, qe = L(() => X(z.get())), pt = c[x] = _e ? ut(() => _e.get(), () => O(i(qe, k))) : O(i(qe, k));
-          R.value = z, R.G = pt, R.suspended = _e;
-        })), V ? D(() => R.Q(!0)) : u.set(T, R);
+        a = !1;
+        let O;
+        p && l.length ? (O = l.pop(), O.index?.set(y), O.value?.set(_), O.suspended?.set(!1), o[y] = O.G) : (O = new Ut(!1), O.E(() => {
+          let G = Kt;
+          c && (O.index = new T(y), G = D(O.index));
+          const Q = O.value = new T(_), be = p ? new T(!1) : void 0, Ce = B(() => V(Q.get())), at = o[y] = be ? st(() => be.get(), () => S(i(Ce, G))) : S(i(Ce, G));
+          O.value = Q, O.G = at, O.suspended = be;
+        })), Le ? C(() => O.Q(!0)) : u.set(_, O);
       }
-      return this.AD = Math.max(this.AD, c.length), this.cleanup(), this.A5 = u, A && (c[xe] = !0), f && (c[Xe] = !0), c;
-    }, this.T = () => [...this.A5.values(), ...this.AC.values()], this.fn = t, this.AB = t.length > 1, this.pooled = s, this.suspense && q(this.parent, "T", this.T);
+      return this.AD = Math.max(this.AD, o.length), this.cleanup(), this.A5 = u, a && (o[Ee] = !0), d && (o[ze] = !0), o;
+    }, this.T = () => [...this.A5.values(), ...this.AC.values()], this.fn = t, this.AB = t.length > 1, this.pooled = s, this.suspense && U(this.parent, "T", this.T);
   }
 }
-const B = (e) => Le(e) && ne in e;
-function K(e) {
-  if (_(e)) {
-    const t = Y;
+const m = (e) => Me(e) && X in e;
+function I(e) {
+  if (E(e)) {
+    const t = H;
     if (t)
       try {
-        return Se(void 0), e();
+        return he(void 0), e();
       } finally {
-        Se(t);
+        he(t);
       }
     else
       return e();
   } else
     return e;
 }
-function Vt(e, t, s = [], n) {
-  if (Q(e) && !B(e)) {
-    const r = !!(n != null && n.unkeyed);
-    return C(K(() => e.length ? e.map((i, o) => O(t(r && !Qe(i) ? C(i) : i, o))) : O(s)));
+function Dt(e, t, s = [], n) {
+  if (K(e) && !m(e)) {
+    const r = !!n?.unkeyed;
+    return P(I(() => e.length ? e.map((i, c) => S(t(r && !Ne(i) ? P(i) : i, c))) : S(s)));
   } else {
-    const { Q: r, map: i } = n != null && n.unkeyed ? new Ft(t, !!n.pooled) : new qt(t);
-    D(r);
-    const o = L(() => X(e) ?? [], {
-      equals: (u, c) => !!u && !!c && !u.length && !c.length && !B(u) && !B(c)
+    const { Q: r, map: i } = n?.unkeyed ? new vt(t, !!n.pooled) : new Ct(t);
+    C(r);
+    const c = B(() => V(e) ?? [], {
+      equals: (u, o) => !!u && !!o && !u.length && !o.length && !m(u) && !m(o)
     });
-    return L(() => {
-      const u = o();
-      return B(u) && u[Pe], K(() => {
-        const c = i(u);
-        return c != null && c.length ? c : O(s);
+    return B(() => {
+      const u = c();
+      return m(u) && u[Re], I(() => {
+        const o = i(u);
+        return o?.length ? o : S(s);
       });
     }, {
-      equals: (u, c) => Q(u) && !!u[xe] && Q(c) && yt(u, c)
+      equals: (u, o) => K(u) && !!u[Ee] && K(o) && bt(u, o)
     });
   }
 }
-const lt = (e) => (K(e), e), Me = (e, t, s) => {
+const nt = (e) => (I(e), e), ye = (e, t, s) => {
   for (let n = 0, r = t.length; n < r; n++) {
     const i = t[n];
     if (i.length === 1)
       return i[0];
-    if (G(i[0], e))
+    if (J(i[0], e))
       return i[1];
   }
   return s;
 };
-function ht(e, t, s) {
-  if (_(e) && !ie(e) && !Ue(e)) {
-    if (it(e))
-      return L(() => O(Me(e(), t, s)));
-    const r = lt(L(() => Me(e(), t, s)));
-    return ie(r) ? C(O(r())) : L(() => O(X(r)));
+function rt(e, t, s) {
+  if (E(e) && !k(e) && !Be(e)) {
+    if (ke(e))
+      return B(() => S(ye(e(), t, s)));
+    const r = nt(B(() => ye(e(), t, s)));
+    return k(r) ? P(S(r())) : B(() => S(V(r)));
   } else {
-    const r = Me(X(e), t, s);
-    return C(O(r));
+    const r = ye(V(e), t, s);
+    return P(S(r));
   }
 }
-const ft = (e, t, s) => {
-  const n = De(e);
-  return ht(n, [[!0, t], [s]]);
+const it = (e, t, s) => {
+  const n = Ie(e);
+  return rt(n, [[!0, t], [s]]);
 };
-function zt(e, t, s) {
-  return ft(e, t, s);
+function Qt(e, t, s) {
+  return it(e, t, s);
 }
-const at = () => !!W || pe.A3 || pe.A2 || te.A2;
-function At(e, t) {
-  return et(new N(e, t));
+const ot = () => !!F || fe.A3 || fe.A2 || j.A2;
+function ct(e, t) {
+  return $e(new T(e, t));
 }
-const dt = () => {
-  const e = g instanceof nt, t = g instanceof Oe, s = g instanceof ct, n = g instanceof ve;
+const ut = () => {
+  const e = A instanceof Xe, t = A instanceof de, s = A instanceof tt, n = A instanceof Pe;
   return { isSuperRoot: e, isRoot: t, isSuspense: s, isComputation: n };
-}, Ht = (e) => _(e) && Be in e, Gt = (e) => _(e) ? e[Te] || e[Be] || Ke : e, $t = (e) => Ht(e) ? F(Gt(e)) : e, jt = (e) => new Oe(!0).E(e);
-class Wt extends Map {
+}, qt = (e) => E(e) && Oe in e, Jt = (e) => E(e) ? e[we] || e[Oe] || Te : e, Yt = (e) => qt(e) ? D(Jt(e)) : e, Ft = (e) => new de(!0).E(e);
+class Vt extends Map {
   constructor() {
     super(...arguments), this.disposed = !1;
   }
 }
-class Xt extends N {
+class zt extends T {
   constructor() {
     super(...arguments), this.AE = 1;
   }
@@ -635,34 +620,33 @@ class Xt extends N {
     this.AF.disposed || (this.AE -= 1, !this.AE && this.AF.delete(this.AG));
   }
 }
-const Zt = (e) => {
-  if (e = lt(L(e)), ie(e)) {
-    const r = K(e);
-    return (i) => i === r ? xt : tt;
-  }
-  let t = new Wt(), s = K(e);
-  return we(() => {
-    var o, u;
+const Ht = (e) => {
+  if (e = nt(B(e)), k(e)) {
+    const r = I(e);
+    return (i) => i === r ? wt : je;
+  }
+  let t = new Vt(), s = I(e);
+  return Ae(() => {
     const r = s, i = e();
-    G(r, i) || (s = i, (o = t.get(r)) == null || o.set(!1), (u = t.get(i)) == null || u.set(!0));
-  }, { suspense: !1, sync: !0 }), D(() => {
+    J(r, i) || (s = i, t.get(r)?.set(!1), t.get(i)?.set(!0));
+  }, { suspense: !1, sync: !0 }), C(() => {
     t.disposed = !0;
   }), (r) => {
     let i = t.get(r);
-    return i ? i.AE += 1 : (i = new Xt(r === s), i.AF = t, i.AG = r, t.set(r, i)), D(i), F(i);
+    return i ? i.AE += 1 : (i = new zt(r === s), i.AF = t, i.AG = r, t.set(r, i)), C(i), D(i);
   };
 };
-class U extends Map {
+class N extends Map {
   AH(t, s) {
     return super.set(t, s), s;
   }
 }
-class ye {
+class pe {
   constructor() {
     this.AE = 0;
   }
   listen() {
-    this.AE += 1, D(this);
+    this.AE += 1, C(this);
   }
   call() {
     this.AE -= 1, !this.AE && this.Q();
@@ -670,7 +654,7 @@ class ye {
   Q() {
   }
 }
-class kt extends ye {
+class Gt extends pe {
   constructor(t, s) {
     super(), this.parent = t, this.observable = s;
   }
@@ -678,7 +662,7 @@ class kt extends ye {
     this.parent.keys = void 0;
   }
 }
-class es extends ye {
+class $t extends pe {
   constructor(t, s) {
     super(), this.parent = t, this.observable = s;
   }
@@ -686,33 +670,31 @@ class es extends ye {
     this.parent.values = void 0;
   }
 }
-class ts extends ye {
+class jt extends pe {
   constructor(t, s, n) {
     super(), this.parent = t, this.key = s, this.observable = n;
   }
   Q() {
-    var t;
-    (t = this.parent.has) == null || t.delete(this.key);
+    this.parent.has?.delete(this.key);
   }
 }
-class ss extends ye {
+class Wt extends pe {
   constructor(t, s, n, r) {
     super(), this.parent = t, this.key = s, this.observable = n, this.AI = r;
   }
   Q() {
-    var t;
-    (t = this.parent.AJ) == null || t.delete(this.key);
+    this.parent.AJ?.delete(this.key);
   }
 }
-const m = {
+const R = {
   /* VARIABLES */
   AK: 0,
   AL: /* @__PURE__ */ new Set(),
   AM: /* @__PURE__ */ new Set(),
   /* API */
   AN: () => {
-    const { AL: e, AM: t } = m, s = /* @__PURE__ */ new Set(), n = (r) => {
-      s.has(r) || (s.add(r), re(r.AO, n), re(r.AP, (i) => {
+    const { AL: e, AM: t } = R, s = /* @__PURE__ */ new Set(), n = (r) => {
+      s.has(r) || (s.add(r), Z(r.AO, n), Z(r.AP, (i) => {
         e.add(i);
       }));
     };
@@ -723,378 +705,373 @@ const m = {
     };
   },
   V: (e) => {
-    m.AM.add(e), I.F();
+    R.AM.add(e), x.F();
   },
   reset: () => {
-    m.AL = /* @__PURE__ */ new Set(), m.AM = /* @__PURE__ */ new Set();
+    R.AL = /* @__PURE__ */ new Set(), R.AM = /* @__PURE__ */ new Set();
   }
-}, w = {
+}, b = {
   /* VARIABLES */
   AK: 0,
   AM: /* @__PURE__ */ new Map(),
   /* API */
   AN: () => {
-    const { AM: e } = w;
+    const { AM: e } = b;
     return () => {
       e.forEach((t, s) => {
         const n = Array.from(t);
-        re(s.AQ, (r) => {
+        Z(s.AQ, (r) => {
           r(n);
         });
       });
     };
   },
   V: (e, t) => {
-    const s = w.AM.get(e) || /* @__PURE__ */ new Set();
-    s.add(t), w.AM.set(e, s), I.F();
+    const s = b.AM.get(e) || /* @__PURE__ */ new Set();
+    s.add(t), b.AM.set(e, s), x.F();
   },
   AR: (e, t, s) => {
     if (t.AO) {
       const n = /* @__PURE__ */ new Set(), r = (i) => {
-        n.has(i) || (n.add(i), re(i.AO, (o) => {
-          o.AO || w.V(o, i.store), r(o);
+        n.has(i) || (n.add(i), Z(i.AO, (c) => {
+          c.AO || b.V(c, i.store), r(c);
         }));
       };
       r(e || t);
     } else {
-      const n = (e == null ? void 0 : e.store) || K(() => t.store[s]);
-      w.V(t, n);
+      const n = e?.store || I(() => t.store[s]);
+      b.V(t, n);
     }
   },
   reset: () => {
-    w.AM = /* @__PURE__ */ new Map();
+    b.AM = /* @__PURE__ */ new Map();
   }
-}, I = {
+}, x = {
   /* VARIABLES */
   AK: !1,
   /* API */
   N: () => {
-    const e = m.AN(), t = w.AN();
-    I.reset(), e(), t();
+    const e = R.AN(), t = b.AN();
+    x.reset(), e(), t();
   },
   AS: () => {
-    at() ? W ? W.finally(I.AS) : setTimeout(I.AS, 0) : I.N();
+    ot() ? F ? F.finally(x.AS) : setTimeout(x.AS, 0) : x.N();
   },
   reset: () => {
-    I.AK = !1, m.reset(), w.reset();
+    x.AK = !1, R.reset(), b.reset();
   },
   F: () => {
-    I.AK || (I.AK = !0, queueMicrotask(I.AS));
+    x.AK || (x.AK = !0, queueMicrotask(x.AS));
   }
-}, Z = /* @__PURE__ */ new WeakMap(), ns = /* @__PURE__ */ new Set([ne, je, We, de, Pe]), rs = /* @__PURE__ */ new Set(["__proto__", "__defineGetter__", "__defineSetter__", "__lookupGetter__", "__lookupSetter__", "prototype", "constructor", "hasOwnProperty", "isPrototypeOf", "propertyIsEnumerable", "toLocaleString", "toSource", "toString", "valueOf"]), bt = {
+}, z = /* @__PURE__ */ new WeakMap(), Xt = /* @__PURE__ */ new Set([X, Fe, Ve, ce, Re]), Zt = /* @__PURE__ */ new Set(["__proto__", "__defineGetter__", "__defineSetter__", "__lookupGetter__", "__lookupSetter__", "prototype", "constructor", "hasOwnProperty", "isPrototypeOf", "propertyIsEnumerable", "toLocaleString", "toSource", "toString", "valueOf"]), lt = {
   /* API */
   get: (e, t) => {
-    var c, h;
-    if (ns.has(t)) {
-      if (t === ne)
+    if (Xt.has(t)) {
+      if (t === X)
         return !0;
-      if (t === de)
+      if (t === ce)
         return e;
-      if (t === je) {
-        if (ee()) {
-          const l = P(e);
-          l.keys || (l.keys = ze(l)), l.keys.listen(), l.keys.observable.get();
+      if (t === Fe) {
+        if ($()) {
+          const o = M(e);
+          o.keys || (o.keys = Qe(o)), o.keys.listen(), o.keys.observable.get();
         }
         return;
       }
-      if (t === Pe) {
-        if (ee()) {
-          const l = P(e);
-          l.values || (l.values = os(l)), l.values.listen(), l.values.observable.get();
+      if (t === Re) {
+        if ($()) {
+          const o = M(e);
+          o.values || (o.values = es(o)), o.values.listen(), o.values.observable.get();
         }
         return;
       }
-      if (t === We)
-        return (l) => {
-          var y;
-          l = typeof l == "number" ? String(l) : l;
-          const A = P(e), f = (y = A.AT) == null ? void 0 : y.get(l);
-          if (f)
-            return f.bind(A.store);
-          A.AJ || (A.AJ = new U());
-          const S = e[l], d = A.AJ.get(l) || A.AJ.AH(l, He(A, l, S)), b = A.equals ? { equals: A.equals } : void 0;
-          return d.observable || (d.observable = oe(A, S, b)), F(d.observable);
+      if (t === Ve)
+        return (o) => {
+          o = typeof o == "number" ? String(o) : o;
+          const l = M(e), p = l.AT?.get(o);
+          if (p)
+            return p.bind(l.store);
+          l.AJ || (l.AJ = new N());
+          const a = e[o], d = l.AJ.get(o) || l.AJ.AH(o, qe(l, o, a)), g = l.equals ? { equals: l.equals } : void 0;
+          return d.observable || (d.observable = ee(l, a, g)), D(d.observable);
         };
     }
-    if (rs.has(t))
+    if (Zt.has(t))
       return e[t];
-    const s = P(e), n = (c = s.AT) == null ? void 0 : c.get(t), r = n || e[t];
-    s.AJ || (s.AJ = new U());
-    const i = ee(), o = se(r), u = i || o ? s.AJ.get(t) || s.AJ.AH(t, He(s, t, r)) : void 0;
-    if (u != null && u.AI && q(u.AI, "AO", s), u && i) {
-      const l = s.equals ? { equals: s.equals } : void 0;
-      u.listen(), u.observable || (u.observable = oe(s, r, l)), u.observable.get();
+    const s = M(e), n = s.AT?.get(t), r = n || e[t];
+    s.AJ || (s.AJ = new N());
+    const i = $(), c = W(r), u = i || c ? s.AJ.get(t) || s.AJ.AH(t, qe(s, t, r)) : void 0;
+    if (u?.AI && U(u.AI, "AO", s), u && i) {
+      const o = s.equals ? { equals: s.equals } : void 0;
+      u.listen(), u.observable || (u.observable = ee(s, r, o)), u.observable.get();
     }
     return n ? n.call(s.store) : typeof r == "function" && r === Array.prototype[t] ? function() {
       return r.apply(s.store, arguments);
-    } : ((h = u == null ? void 0 : u.AI) == null ? void 0 : h.store) || r;
+    } : u?.AI?.store || r;
   },
   set: (e, t, s) => {
-    var i, o, u, c, h, l, A, f, S, d;
-    s = v(s);
-    const n = P(e), r = (i = n.AU) == null ? void 0 : i.get(t);
+    s = L(s);
+    const n = M(e), r = n.AU?.get(t);
     if (r)
       r.call(n.store, s);
     else {
-      const b = Q(e), p = e[t], y = !!p || t in e, j = n.equals || G;
-      if (y && j(s, p) && (t !== "length" || !b))
+      const i = K(e), c = e[t], u = !!c || t in e, o = n.equals || J;
+      if (u && o(s, c) && (t !== "length" || !i))
         return !0;
-      const he = b && e.length;
+      const l = i && e.length;
       e[t] = s;
-      const M = b && e.length;
-      b && t !== "length" && he !== M && ((c = (u = (o = n.AJ) == null ? void 0 : o.get("length")) == null ? void 0 : u.observable) == null || c.set(M)), (h = n.values) == null || h.observable.set(0), y || ((l = n.keys) == null || l.observable.set(0), (f = (A = n.has) == null ? void 0 : A.get(t)) == null || f.observable.set(!0));
-      const E = (S = n.AJ) == null ? void 0 : S.get(t);
-      if (E != null && E.AI && J(E.AI, "AO", n), E && ((d = E.observable) == null || d.set(s), E.AI = se(s) ? Z.get(s) || Ee(s, t, n) : void 0), E != null && E.AI && q(E.AI, "AO", n), w.AK && w.AR(E == null ? void 0 : E.AI, n, t), m.AK && m.V(n), b && t === "length") {
-        const x = Number(p), T = Number(s);
-        for (let V = T; V < x; V++)
-          V in e || bt.deleteProperty(e, `${V}`, !0);
+      const p = i && e.length;
+      i && t !== "length" && l !== p && n.AJ?.get("length")?.observable?.set(p), n.values?.observable.set(0), u || (n.keys?.observable.set(0), n.has?.get(t)?.observable.set(!0));
+      const a = n.AJ?.get(t);
+      if (a?.AI && v(a.AI, "AO", n), a && (a.observable?.set(s), a.AI = W(s) ? z.get(s) || ae(s, t, n) : void 0), a?.AI && U(a.AI, "AO", n), b.AK && b.AR(a?.AI, n, t), R.AK && R.V(n), i && t === "length") {
+        const d = Number(c), g = Number(s);
+        for (let h = g; h < d; h++)
+          h in e || lt.deleteProperty(e, `${h}`, !0);
       }
     }
     return !0;
   },
   deleteProperty: (e, t, s) => {
-    var u, c, h, l, A, f, S, d;
     const n = t in e;
     if (!s && !n)
       return !0;
     if (!Reflect.deleteProperty(e, t))
       return !1;
-    const i = P(e);
-    (u = i.AT) == null || u.delete(t), (c = i.AU) == null || c.delete(t), (h = i.keys) == null || h.observable.set(0), (l = i.values) == null || l.observable.set(0), (f = (A = i.has) == null ? void 0 : A.get(t)) == null || f.observable.set(!1);
-    const o = (S = i.AJ) == null ? void 0 : S.get(t);
-    return w.AK && w.AR(o == null ? void 0 : o.AI, i, t), o != null && o.AI && J(o.AI, "AO", i), o && ((d = o.observable) == null || d.set(void 0), o.AI = void 0), m.AK && m.V(i), !0;
+    const i = M(e);
+    i.AT?.delete(t), i.AU?.delete(t), i.keys?.observable.set(0), i.values?.observable.set(0), i.has?.get(t)?.observable.set(!1);
+    const c = i.AJ?.get(t);
+    return b.AK && b.AR(c?.AI, i, t), c?.AI && v(c.AI, "AO", i), c && (c.observable?.set(void 0), c.AI = void 0), R.AK && R.V(i), !0;
   },
   defineProperty: (e, t, s) => {
-    var h, l, A, f, S, d, b, p;
-    const n = P(e), r = n.equals || G, i = t in e, o = Reflect.getOwnPropertyDescriptor(e, t);
-    if ("value" in s && B(s.value) && (s = { ...s, value: v(s.value) }), o && fs(o, s, r))
+    const n = M(e), r = n.equals || J, i = t in e, c = Reflect.getOwnPropertyDescriptor(e, t);
+    if ("value" in s && m(s.value) && (s = { ...s, value: L(s.value) }), c && is(c, s, r))
       return !0;
     if (!Reflect.defineProperty(e, t, s))
       return !1;
-    s.get ? s.get && (n.AT || (n.AT = new U()), n.AT.set(t, s.get)) : (h = n.AT) == null || h.delete(t), s.set ? s.set && (n.AU || (n.AU = new U()), n.AU.set(t, s.set)) : (l = n.AU) == null || l.delete(t), i !== !!s.enumerable && ((A = n.keys) == null || A.observable.set(0)), (S = (f = n.has) == null ? void 0 : f.get(t)) == null || S.observable.set(!0);
-    const c = (d = n.AJ) == null ? void 0 : d.get(t);
-    if (w.AK && w.AR(c == null ? void 0 : c.AI, n, t), c != null && c.AI && J(c.AI, "AO", n), c)
+    s.get ? s.get && (n.AT || (n.AT = new N()), n.AT.set(t, s.get)) : n.AT?.delete(t), s.set ? s.set && (n.AU || (n.AU = new N()), n.AU.set(t, s.set)) : n.AU?.delete(t), i !== !!s.enumerable && n.keys?.observable.set(0), n.has?.get(t)?.observable.set(!0);
+    const o = n.AJ?.get(t);
+    if (b.AK && b.AR(o?.AI, n, t), o?.AI && v(o.AI, "AO", n), o)
       if ("get" in s)
-        (b = c.observable) == null || b.set(s.get), c.AI = void 0;
+        o.observable?.set(s.get), o.AI = void 0;
       else {
-        const y = s.value;
-        (p = c.observable) == null || p.set(y), c.AI = se(y) ? Z.get(y) || Ee(y, t, n) : void 0;
+        const l = s.value;
+        o.observable?.set(l), o.AI = W(l) ? z.get(l) || ae(l, t, n) : void 0;
       }
-    return c != null && c.AI && q(c.AI, "AO", n), w.AK && w.AR(c == null ? void 0 : c.AI, n, t), m.AK && m.V(n), !0;
+    return o?.AI && U(o.AI, "AO", n), b.AK && b.AR(o?.AI, n, t), R.AK && R.V(n), !0;
   },
   has: (e, t) => {
-    if (t === ne || t === de)
+    if (t === X || t === ce)
       return !0;
     const s = t in e;
-    if (ee()) {
-      const n = P(e);
-      n.has || (n.has = new U());
-      const r = n.has.get(t) || n.has.AH(t, cs(n, t, s));
+    if ($()) {
+      const n = M(e);
+      n.has || (n.has = new N());
+      const r = n.has.get(t) || n.has.AH(t, ts(n, t, s));
       r.listen(), r.observable.get();
     }
     return s;
   },
   ownKeys: (e) => {
     const t = Reflect.ownKeys(e);
-    if (ee()) {
-      const s = P(e);
-      s.keys || (s.keys = ze(s)), s.keys.listen(), s.keys.observable.get();
+    if ($()) {
+      const s = M(e);
+      s.keys || (s.keys = Qe(s)), s.keys.listen(), s.keys.observable.get();
     }
     return t;
   }
-}, is = {
+}, kt = {
   /* API */
-  has: (e, t) => t === Ie ? !0 : t in e
-}, Ee = (e, t, s, n) => {
-  if (B(e))
-    return P(v(e));
-  const r = as(e, t, s) ? e : new Proxy(e, bt), i = us(e), o = { AO: s, store: r };
+  has: (e, t) => t === _e ? !0 : t in e
+}, ae = (e, t, s, n) => {
+  if (m(e))
+    return M(L(e));
+  const r = os(e, t, s) ? e : new Proxy(e, lt), i = ss(e), c = { AO: s, store: r };
   if (i) {
-    const { AT: u, AU: c } = i;
-    u && (o.AT = u), c && (o.AU = c);
+    const { AT: u, AU: o } = i;
+    u && (c.AT = u), o && (c.AU = o);
   }
-  return n === !1 ? o.equals = ke : n ? o.equals = n : s != null && s.equals && (o.equals = s.equals), Z.set(e, o), o;
-}, P = (e) => {
-  const t = Z.get(e);
+  return n === !1 ? c.equals = Ge : n ? c.equals = n : s?.equals && (c.equals = s.equals), z.set(e, c), c;
+}, M = (e) => {
+  const t = z.get(e);
   if (!t)
     throw new Error("Impossible");
   return t;
-}, gt = (e) => P(v(e)), ze = (e) => {
-  const t = oe(e, 0, { equals: !1 });
-  return new kt(e, t);
-}, os = (e) => {
-  const t = oe(e, 0, { equals: !1 });
-  return new es(e, t);
-}, cs = (e, t, s) => {
-  const n = oe(e, s);
-  return new ts(e, t, n);
-}, oe = (e, t, s) => new N(t, s), He = (e, t, s) => {
-  const r = se(s) ? Z.get(s) || Ee(s, t, e) : void 0, i = new ss(e, t, void 0, r);
-  return e.AJ || (e.AJ = new U()), e.AJ.set(t, i), i;
-}, us = (e) => {
-  if (Q(e))
+}, ht = (e) => M(L(e)), Qe = (e) => {
+  const t = ee(e, 0, { equals: !1 });
+  return new Gt(e, t);
+}, es = (e) => {
+  const t = ee(e, 0, { equals: !1 });
+  return new $t(e, t);
+}, ts = (e, t, s) => {
+  const n = ee(e, s);
+  return new jt(e, t, n);
+}, ee = (e, t, s) => new T(t, s), qe = (e, t, s) => {
+  const r = W(s) ? z.get(s) || ae(s, t, e) : void 0, i = new Wt(e, t, void 0, r);
+  return e.AJ || (e.AJ = new N()), e.AJ.set(t, i), i;
+}, ss = (e) => {
+  if (K(e))
     return;
   let t, s;
   const n = Object.keys(e);
   for (let r = 0, i = n.length; r < i; r++) {
-    const o = n[r], u = Object.getOwnPropertyDescriptor(e, o);
+    const c = n[r], u = Object.getOwnPropertyDescriptor(e, c);
     if (!u)
       continue;
-    const { get: c, set: h } = u;
-    c && (t || (t = new U()), t.set(o, c)), h && (s || (s = new U()), s.set(o, h)), c && !h && (s || (s = new U()), s.set(o, As));
+    const { get: o, set: l } = u;
+    o && (t || (t = new N()), t.set(c, o)), l && (s || (s = new N()), s.set(c, l)), o && !l && (s || (s = new N()), s.set(c, cs));
   }
   if (!(!t && !s))
     return { AT: t, AU: s };
-}, ls = (e, t) => B(e) ? e : (Z.get(e) || Ee(e, void 0, void 0, t == null ? void 0 : t.equals)).store, v = (e) => B(e) ? e[de] : e, hs = (e) => !Le(e) || St(e) ? e : new Proxy(e, is), fs = (e, t, s) => !!e.configurable == !!t.configurable && !!e.enumerable == !!t.enumerable && !!e.writable == !!t.writable && s(e.value, t.value) && e.get === t.get && e.set === t.set, as = (e, t, s) => {
+}, ns = (e, t) => m(e) ? e : (z.get(e) || ae(e, void 0, void 0, t?.equals)).store, L = (e) => m(e) ? e[ce] : e, rs = (e) => !Me(e) || ft(e) ? e : new Proxy(e, kt), is = (e, t, s) => !!e.configurable == !!t.configurable && !!e.enumerable == !!t.enumerable && !!e.writable == !!t.writable && s(e.value, t.value) && e.get === t.get && e.set === t.set, os = (e, t, s) => {
   if (Object.isFrozen(e))
     return !0;
   if (!s || t === void 0)
     return !1;
-  const n = $.unwrap(s.store), r = Reflect.getOwnPropertyDescriptor(n, t);
-  return !(r != null && r.configurable || r != null && r.writable);
-}, ee = () => !!Y, se = (e) => {
+  const n = Y.unwrap(s.store), r = Reflect.getOwnPropertyDescriptor(n, t);
+  return !(r?.configurable || r?.writable);
+}, $ = () => !!H, W = (e) => {
   if (e === null || typeof e != "object")
     return !1;
-  if (ne in e)
+  if (X in e)
     return !0;
-  if (Ie in e)
+  if (_e in e)
     return !1;
-  if (Q(e))
+  if (K(e))
     return !0;
   const t = Object.getPrototypeOf(e);
   return t === null ? !0 : Object.getPrototypeOf(t) === null;
-}, St = (e) => e === null || typeof e != "object" ? !1 : Ie in e, As = () => {
+}, ft = (e) => e === null || typeof e != "object" ? !1 : _e in e, cs = () => {
   throw new TypeError("Cannot set property value of #<Object> which has only a getter");
-}, $ = (e, t) => !Le(e) || St(e) ? e : ls(e, t);
-$.on = (e, t) => {
-  const s = B(e) ? [e] : wt(e), n = s.filter(_), r = s.filter(B).map(gt);
-  m.AK += 1;
-  const i = n.map((o) => {
+}, Y = (e, t) => !Me(e) || ft(e) ? e : ns(e, t);
+Y.on = (e, t) => {
+  const s = m(e) ? [e] : dt(e), n = s.filter(E), r = s.filter(m).map(ht);
+  R.AK += 1;
+  const i = n.map((c) => {
     let u = !1;
-    return we(() => {
-      u && (m.AL.add(t), I.F()), u = !0, o();
+    return Ae(() => {
+      u && (R.AL.add(t), x.F()), u = !0, c();
     }, { suspense: !1, sync: !0 });
   });
-  return r.forEach((o) => {
-    q(o, "AP", t);
+  return r.forEach((c) => {
+    U(c, "AP", t);
   }), () => {
-    m.AK -= 1, i.forEach((o) => {
-      o();
-    }), r.forEach((o) => {
-      J(o, "AP", t);
+    R.AK -= 1, i.forEach((c) => {
+      c();
+    }), r.forEach((c) => {
+      v(c, "AP", t);
     });
   };
 };
-$._onRoots = (e, t) => {
-  if (!B(e))
-    return Ce;
-  const s = gt(e);
+Y._onRoots = (e, t) => {
+  if (!m(e))
+    return xe;
+  const s = ht(e);
   if (s.AO)
     throw new Error("Only top-level stores are supported");
-  return w.AK += 1, q(s, "AQ", t), () => {
-    w.AK -= 1, J(s, "AQ", t);
+  return b.AK += 1, U(s, "AQ", t), () => {
+    b.AK -= 1, v(s, "AQ", t);
   };
 };
-$.reconcile = /* @__PURE__ */ (() => {
-  const e = (r) => Q(r) ? 1 : se(r) ? 2 : 0, t = (r, i) => {
-    const o = v(r), u = v(i);
+Y.reconcile = /* @__PURE__ */ (() => {
+  const e = (r) => K(r) ? 1 : W(r) ? 2 : 0, t = (r, i) => {
+    const c = L(r), u = L(i);
     s(r, i);
-    const c = e(o), h = e(u);
-    return (c === 1 || h === 1) && (r.length = i.length), r;
+    const o = e(c), l = e(u);
+    return (o === 1 || l === 1) && (r.length = i.length), r;
   }, s = (r, i) => {
-    const o = v(r), u = v(i), c = Object.keys(o), h = Object.keys(u);
-    for (let l = 0, A = h.length; l < A; l++) {
-      const f = h[l], S = o[f], d = u[f];
-      if (G(S, d))
-        S === void 0 && !(f in o) && (r[f] = void 0);
+    const c = L(r), u = L(i), o = Object.keys(c), l = Object.keys(u);
+    for (let p = 0, a = l.length; p < a; p++) {
+      const d = l[p], g = c[d], h = u[d];
+      if (J(g, h))
+        g === void 0 && !(d in c) && (r[d] = void 0);
       else {
-        const b = e(S), p = e(d);
-        b && b === p ? (s(r[f], d), b === 1 && (r[f].length = d.length)) : r[f] = d;
+        const w = e(g), y = e(h);
+        w && w === y ? (s(r[d], h), w === 1 && (r[d].length = h.length)) : r[d] = h;
       }
     }
-    for (let l = 0, A = c.length; l < A; l++) {
-      const f = c[l];
-      f in u || delete r[f];
+    for (let p = 0, a = o.length; p < a; p++) {
+      const d = o[p];
+      d in u || delete r[d];
     }
     return r;
   };
-  return (r, i) => K(() => t(r, i));
+  return (r, i) => I(() => t(r, i));
 })();
-$.untrack = (e) => hs(e);
-$.unwrap = (e) => v(e);
-const ds = () => {
-  const e = g.get(H);
+Y.untrack = (e) => rs(e);
+Y.unwrap = (e) => L(e);
+const us = () => {
+  const e = A.get(q);
   if (!e)
-    return tt;
-  const t = e.observable || (e.observable = new N(!!e.suspended));
-  return F(t);
-}, bs = () => {
-  pe.N();
-}, gs = (e, t) => {
-  const s = At();
-  return L(() => {
+    return je;
+  const t = e.observable || (e.observable = new T(!!e.suspended));
+  return D(t);
+}, ls = () => {
+  fe.N();
+}, hs = (e, t) => {
+  const s = ct();
+  return B(() => {
     const n = s();
-    return n ? O(t({ error: n, reset: () => s(void 0) })) : (g.S = s, O(e));
+    return n ? S(t({ error: n, reset: () => s(void 0) })) : (A.S = s, S(e));
   });
 };
-function Ss(e) {
-  const t = _(e) ? (...s) => K(() => e(...s)) : () => e;
-  return t[Ne] = !0, t;
+function fs(e) {
+  const t = E(e) ? (...s) => I(() => e(...s)) : () => e;
+  return t[me] = !0, t;
 }
-const ps = () => {
-  const e = g, t = Y;
+const as = () => {
+  const e = A, t = H;
   return (s) => e.E(() => s(), e, t);
 };
-function a(e, t) {
-  return et(new N(e, t));
+function f(e, t) {
+  return $e(new T(e, t));
 }
-a.batch = Bt;
-a.boolean = De;
-a.cleanup = D;
-a.context = Kt;
-a.disposed = Ut;
-a.effect = we;
-a.for = Vt;
-a.get = X;
-a.if = zt;
-a.isBatching = at;
-a.isObservable = Qe;
-a.isStore = B;
-a.memo = L;
-a.observable = At;
-a.owner = dt;
-a.readonly = $t;
-a.resolve = O;
-a.root = jt;
-a.selector = Zt;
-a.store = $;
-a.suspended = ds;
-a.suspense = ut;
-a.switch = ht;
-a.ternary = ft;
-a.tick = bs;
-a.tryCatch = gs;
-a.untrack = K;
-a.untracked = Ss;
-a.with = ps;
-const ys = Et({
+f.batch = Rt;
+f.boolean = Ie;
+f.cleanup = C;
+f.context = Bt;
+f.disposed = Pt;
+f.effect = Ae;
+f.for = Dt;
+f.get = V;
+f.if = Qt;
+f.isBatching = ot;
+f.isObservable = Ne;
+f.isStore = m;
+f.memo = B;
+f.observable = ct;
+f.owner = ut;
+f.readonly = Yt;
+f.resolve = S;
+f.root = Ft;
+f.selector = Ht;
+f.store = Y;
+f.suspended = us;
+f.suspense = st;
+f.switch = rt;
+f.ternary = it;
+f.tick = ls;
+f.tryCatch = hs;
+f.untrack = I;
+f.untracked = fs;
+f.with = as;
+const bs = At({
   create: () => {
-    const e = a(0);
+    const e = f(0);
     return {
       depend: () => {
         e();
       },
       notify: () => {
-        e(K(() => e() + 1));
+        e(I(() => e() + 1));
       }
     };
   },
-  isInScope: () => !!dt(),
+  isInScope: () => !!ut(),
   onDispose: (e) => {
-    D(e);
+    C(e);
   }
 });
 export {
-  ys as default
+  bs as default
 };
 //# sourceMappingURL=index.mjs.map