@signaldb/oby 2.0.0-beta.2 → 2.0.0-beta.21

package/dist/index.mjs

@@ -1,1077 +1,24 @@
-import { createReactivityAdapter as At } from "@signaldb/core";
-const Ee = /* @__PURE__ */ Symbol("Cached"), te = /* @__PURE__ */ Symbol("Observable"), Je = /* @__PURE__ */ Symbol("Observable.Boolean"), Ye = /* @__PURE__ */ Symbol("Observable.Frozen"), we = /* @__PURE__ */ Symbol("Observable.Readable"), Oe = /* @__PURE__ */ Symbol("Observable.Writable"), X = /* @__PURE__ */ Symbol("Store"), Fe = /* @__PURE__ */ Symbol("Store.Keys"), Ve = /* @__PURE__ */ Symbol("Store.Observable"), ce = /* @__PURE__ */ Symbol("Store.Target"), Re = /* @__PURE__ */ Symbol("Store.Values"), _e = /* @__PURE__ */ Symbol("Store.Untracked"), q = /* @__PURE__ */ Symbol("Suspense"), ze = /* @__PURE__ */ Symbol("Uncached"), me = /* @__PURE__ */ Symbol("Untracked"), He = /* @__PURE__ */ 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 (!J(r, i))
-      return !1;
-  }
-  return !0;
-}, 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 yt() {
-  if (arguments.length)
-    throw new Error("A readonly Observable can not be updated");
-  return this.get();
-}
-function Et(e) {
-  return arguments.length ? E(e) ? this.C(e) : this.set(e) : this.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");
-} })), 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);
-}, re = (e, t) => {
-  if (e instanceof Array)
-    for (let s = e.length - 1; s >= 0; s--)
-      t(e[s]);
-  else e && t(e);
-}, se = (e, t, s) => {
-  const n = e[t];
-  n instanceof Array ? n.push(s) : n ? e[t] = [n, s] : e[t] = s;
-}, U = (e, t, s) => {
-  const n = e[t];
-  if (n instanceof Set)
-    n.add(s);
-  else if (n) {
-    if (s !== n) {
-      const r = /* @__PURE__ */ new Set();
-      r.add(n), r.add(s), e[t] = r;
-    }
-  } else
-    e[t] = s;
-}, v = (e, t, s) => {
-  const n = e[t];
-  n instanceof Set ? n.delete(s) : n === s && (e[t] = void 0);
-}, Z = (e, t) => {
-  if (e instanceof Set)
-    for (const s of e)
-      t(s);
-  else e && t(e);
-}, 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) {
-    const { S: n } = this;
-    if (n)
-      return n(t), !0;
-    if (this.parent?.catch(t, !0))
-      return !0;
-    if (s)
-      return !1;
-    throw t;
-  }
-  Q(t) {
-    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) {
-    return this.context?.[t];
-  }
-  E(t, s, n) {
-    const r = A, i = H;
-    ve(s), he(n);
-    try {
-      return t();
-    } catch (c) {
-      return this.catch(pt(c), !1), Te;
-    } finally {
-      ve(r), he(i);
-    }
-  }
-}
-class Xe extends ne {
-  constructor() {
-    super(...arguments), this.context = {};
-  }
-}
-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 ie += 1, await e();
-  } finally {
-    ie -= 1, ie || (Ue(void 0), De());
-  }
-}, 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)
-        try {
-          for (this.A2 = !0; ; ) {
-            const t = this.A1;
-            if (!t.length)
-              break;
-            this.A1 = [];
-            for (let s = 0, n = t.length; s < n; s++)
-              t[s].C();
-          }
-        } finally {
-          this.A2 = !1;
-        }
-    }, this.E = (t) => {
-      this.M += 1, t(), this.M -= 1, this.N();
-    }, this.F = (t) => {
-      this.A1.push(t);
-    };
-  }
-};
-const j = new _t();
-class T {
-  /* CONSTRUCTOR */
-  constructor(t, s, n) {
-    this.K = /* @__PURE__ */ new Set(), this.value = t, n && (this.parent = n), s?.equals !== void 0 && (this.equals = s.equals || Ge);
-  }
-  /* API */
-  get() {
-    return this.parent?.disposed || (this.parent?.C(), H?.A.L(this)), this.value;
-  }
-  set(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 !== 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 mt {
-  /* CONSTRUCTOR */
-  constructor(t) {
-    this.observer = t, this.A = [], this.P = 0;
-  }
-  /* API */
-  Q(t) {
-    if (t) {
-      const { observer: s, A: n } = this;
-      for (let r = 0; r < n.length; r++)
-        n[r].K.delete(s);
-    }
-    this.P = 0;
-  }
-  R() {
-    const { observer: t, A: s, P: n } = this, r = s.length;
-    if (n < r) {
-      for (let i = n; i < r; i++)
-        s[i].K.delete(t);
-      s.length = n;
-    }
-  }
-  empty() {
-    return !this.A.length;
-  }
-  has(t) {
-    const s = this.A.indexOf(t);
-    return s >= 0 && s < this.P;
-  }
-  L(t) {
-    const { observer: s, A: n, P: r } = this, i = n.length;
-    if (i > 0) {
-      if (n[r] === t) {
-        this.P += 1;
-        return;
-      }
-      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 Mt(s, n));
-  }
-  C() {
-    const { A: t } = this;
-    for (let s = 0, n = t.length; s < n; s++)
-      t[s].parent?.C();
-  }
-}
-class Mt {
-  /* CONSTRUCTOR */
-  constructor(t, s) {
-    this.observer = t, this.A = new Set(s);
-  }
-  /* API */
-  Q(t) {
-    for (const s of this.A)
-      s.K.delete(this.observer);
-  }
-  R() {
-  }
-  empty() {
-    return !this.A.size;
-  }
-  has(t) {
-    return this.A.has(t);
-  }
-  L(t) {
-    const { observer: s, A: n } = this, r = n.size;
-    t.K.add(s);
-    const i = n.size;
-    r !== i && n.add(t);
-  }
-  C() {
-    for (const t of this.A)
-      t.parent?.C();
-  }
-}
-class Pe extends ne {
-  /* CONSTRUCTOR */
-  constructor() {
-    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 = oe;
-    try {
-      return this.E(t, this, this);
-    } finally {
-      this.A.R();
-    }
-  }
-  run() {
-    throw new Error("Abstract method");
-  }
-  I(t) {
-    throw new Error("Abstract method");
-  }
-  C() {
-    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 xt extends Pe {
-  /* CONSTRUCTOR */
-  constructor(t, s) {
-    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 !== Te && this.observable.set(t);
-  }
-  I(t) {
-    const s = this.J;
-    s >= t || (this.J = t, s !== ue && this.observable.I(ue));
-  }
-}
-const B = (e, t) => {
-  if (k(e))
-    return e;
-  if (Be(e))
-    return P(e());
-  {
-    const s = new xt(e, t);
-    return D(s.observable);
-  }
-}, Ie = (e) => {
-  if (E(e)) {
-    if (k(e) || Be(e))
-      return !!e();
-    if (ke(e))
-      return e;
-    {
-      const t = B(() => !!e());
-      return t[Je] = !0, t;
-    }
-  } else
-    return !!e;
-}, C = (e) => {
-  se(A, "B", e);
-};
-class Tt extends ne {
-  /* CONSTRUCTOR */
-  constructor(t) {
-    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 Bt(e, t) {
-  return St(e) ? A.context[e] : new Tt(e).E(t || xe);
-}
-const Pt = () => {
-  const e = new T(!1);
-  return C(() => e.set(!0)), D(e);
-};
-class It {
-  constructor() {
-    this.A1 = [], this.A2 = !1, this.A3 = !1, this.N = () => {
-      if (!this.A2 && this.A1.length)
-        try {
-          for (this.A2 = !0; ; ) {
-            const t = this.A1;
-            if (!t.length)
-              break;
-            this.A1 = [];
-            for (let s = 0, n = t.length; s < n; s++)
-              t[s].C();
-          }
-        } finally {
-          this.A2 = !1;
-        }
-    }, this.queue = () => {
-      this.A3 || (this.A3 = !0, this.resolve());
-    }, this.resolve = () => {
-      queueMicrotask(() => {
-        queueMicrotask(() => {
-          F ? F.finally(this.resolve) : (this.A3 = !1, this.N());
-        });
-      });
-    }, this.F = (t) => {
-      this.A1.push(t), this.queue();
-    };
-  }
-}
-const fe = new It();
-class et extends Pe {
-  /* CONSTRUCTOR */
-  constructor(t, s) {
-    if (super(), this.fn = t, s?.suspense !== !1) {
-      const n = this.get(q);
-      n && (this.suspense = n);
-    }
-    s?.sync === !0 && (this.sync = !0), s?.sync === "init" ? (this.init = !0, this.C()) : this.F();
-  }
-  /* API */
-  run() {
-    const t = super.H(this.fn);
-    E(t) && se(this, "B", t);
-  }
-  F() {
-    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() {
-    this.suspense?.suspended || super.C();
-  }
-}
-const Ae = (e, t) => {
-  const s = new et(e, t);
-  return () => s.Q(!0);
-};
-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] = S(e[s]);
-    return t;
-  } else
-    return e;
-}
-class de extends ne {
-  /* CONSTRUCTOR */
-  constructor(t) {
-    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 && 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 Nt = P(-1);
-let Lt = class extends de {
-};
-class Ct {
-  /* CONSTRUCTOR */
-  constructor(t) {
-    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;
-      s.size && (this.A9 ? s.forEach((r, i) => {
-        r.A6 !== n && (r.Q(!0), s.delete(i));
-      }) : (this.A5.forEach((r) => {
-        r.Q(!0);
-      }), this.A5 = /* @__PURE__ */ new Map()));
-    }, this.Q = () => {
-      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) => {
-      this.AA();
-      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 {
-          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 = 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 Ne = (e) => E(e) && te in e;
-function V(e, t = !0) {
-  return (t ? E : Ne)(e) ? e() : e;
-}
-class tt extends ne {
-  /* CONSTRUCTOR */
-  constructor() {
-    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) {
-    if (!this.suspended && !t)
-      return;
-    const s = this.suspended, n = s + (t ? 1 : -1);
-    if (this.suspended = n, !!s == !!n)
-      return;
-    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);
-  }
-  E(t) {
-    return super.E(t, this, void 0);
-  }
-}
-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 vt {
-  /* CONSTRUCTOR */
-  constructor(t, s) {
-    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) => {
-        r > 0 && n++ < r ? (i.suspended?.set(!0), this.AC.push(i)) : i.Q(!0);
-      });
-    }, this.Q = () => {
-      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) => {
-      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 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
-        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 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, 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 m = (e) => Me(e) && X in e;
-function I(e) {
-  if (E(e)) {
-    const t = H;
-    if (t)
-      try {
-        return he(void 0), e();
-      } finally {
-        he(t);
-      }
-    else
-      return e();
-  } else
-    return e;
-}
-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?.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 B(() => {
-      const u = c();
-      return m(u) && u[Re], I(() => {
-        const o = i(u);
-        return o?.length ? o : S(s);
-      });
-    }, {
-      equals: (u, o) => K(u) && !!u[Ee] && K(o) && bt(u, o)
-    });
-  }
-}
-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 (J(i[0], e))
-      return i[1];
-  }
-  return s;
-};
-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 = ye(V(e), t, s);
-    return P(S(r));
-  }
-}
-const it = (e, t, s) => {
-  const n = Ie(e);
-  return rt(n, [[!0, t], [s]]);
-};
-function Qt(e, t, s) {
-  return it(e, t, s);
-}
-const ot = () => !!F || fe.A3 || fe.A2 || j.A2;
-function ct(e, t) {
-  return $e(new T(e, t));
-}
-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 };
-}, 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 zt extends T {
-  constructor() {
-    super(...arguments), this.AE = 1;
-  }
-  /* API */
-  call() {
-    this.AF.disposed || (this.AE -= 1, !this.AE && this.AF.delete(this.AG));
-  }
-}
-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();
-    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 zt(r === s), i.AF = t, i.AG = r, t.set(r, i)), C(i), D(i);
-  };
-};
-class N extends Map {
-  AH(t, s) {
-    return super.set(t, s), s;
-  }
-}
-class pe {
-  constructor() {
-    this.AE = 0;
-  }
-  listen() {
-    this.AE += 1, C(this);
-  }
-  call() {
-    this.AE -= 1, !this.AE && this.Q();
-  }
-  Q() {
-  }
-}
-class Gt extends pe {
-  constructor(t, s) {
-    super(), this.parent = t, this.observable = s;
-  }
-  Q() {
-    this.parent.keys = void 0;
-  }
-}
-class $t extends pe {
-  constructor(t, s) {
-    super(), this.parent = t, this.observable = s;
-  }
-  Q() {
-    this.parent.values = void 0;
-  }
-}
-class jt extends pe {
-  constructor(t, s, n) {
-    super(), this.parent = t, this.key = s, this.observable = n;
-  }
-  Q() {
-    this.parent.has?.delete(this.key);
-  }
-}
-class Wt extends pe {
-  constructor(t, s, n, r) {
-    super(), this.parent = t, this.key = s, this.observable = n, this.AI = r;
-  }
-  Q() {
-    this.parent.AJ?.delete(this.key);
-  }
-}
-const R = {
-  /* VARIABLES */
-  AK: 0,
-  AL: /* @__PURE__ */ new Set(),
-  AM: /* @__PURE__ */ new Set(),
-  /* API */
-  AN: () => {
-    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);
-      }));
-    };
-    return t.forEach(n), () => {
-      e.forEach((r) => {
-        r();
-      });
-    };
-  },
-  V: (e) => {
-    R.AM.add(e), x.F();
-  },
-  reset: () => {
-    R.AL = /* @__PURE__ */ new Set(), R.AM = /* @__PURE__ */ new Set();
-  }
-}, b = {
-  /* VARIABLES */
-  AK: 0,
-  AM: /* @__PURE__ */ new Map(),
-  /* API */
-  AN: () => {
-    const { AM: e } = b;
-    return () => {
-      e.forEach((t, s) => {
-        const n = Array.from(t);
-        Z(s.AQ, (r) => {
-          r(n);
-        });
-      });
-    };
-  },
-  V: (e, t) => {
-    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), Z(i.AO, (c) => {
-          c.AO || b.V(c, i.store), r(c);
-        }));
-      };
-      r(e || t);
-    } else {
-      const n = e?.store || I(() => t.store[s]);
-      b.V(t, n);
-    }
-  },
-  reset: () => {
-    b.AM = /* @__PURE__ */ new Map();
-  }
-}, x = {
-  /* VARIABLES */
-  AK: !1,
-  /* API */
-  N: () => {
-    const e = R.AN(), t = b.AN();
-    x.reset(), e(), t();
-  },
-  AS: () => {
-    ot() ? F ? F.finally(x.AS) : setTimeout(x.AS, 0) : x.N();
-  },
-  reset: () => {
-    x.AK = !1, R.reset(), b.reset();
-  },
-  F: () => {
-    x.AK || (x.AK = !0, queueMicrotask(x.AS));
-  }
-}, 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) => {
-    if (Xt.has(t)) {
-      if (t === X)
-        return !0;
-      if (t === ce)
-        return e;
-      if (t === Fe) {
-        if ($()) {
-          const o = M(e);
-          o.keys || (o.keys = Qe(o)), o.keys.listen(), o.keys.observable.get();
-        }
-        return;
-      }
-      if (t === Re) {
-        if ($()) {
-          const o = M(e);
-          o.values || (o.values = es(o)), o.values.listen(), o.values.observable.get();
-        }
-        return;
-      }
-      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 (Zt.has(t))
-      return e[t];
-    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);
-    } : u?.AI?.store || r;
-  },
-  set: (e, t, s) => {
-    s = L(s);
-    const n = M(e), r = n.AU?.get(t);
-    if (r)
-      r.call(n.store, s);
-    else {
-      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 l = i && e.length;
-      e[t] = s;
-      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) => {
-    const n = t in e;
-    if (!s && !n)
-      return !0;
-    if (!Reflect.deleteProperty(e, t))
-      return !1;
-    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) => {
-    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 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)
-        o.observable?.set(s.get), o.AI = void 0;
-      else {
-        const l = s.value;
-        o.observable?.set(l), o.AI = W(l) ? z.get(l) || ae(l, t, n) : void 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 === X || t === ce)
-      return !0;
-    const s = t in e;
-    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 ($()) {
-      const s = M(e);
-      s.keys || (s.keys = Qe(s)), s.keys.listen(), s.keys.observable.get();
-    }
-    return t;
-  }
-}, kt = {
-  /* API */
-  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: o } = i;
-    u && (c.AT = u), o && (c.AU = o);
-  }
-  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;
-}, 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 c = n[r], u = Object.getOwnPropertyDescriptor(e, c);
-    if (!u)
-      continue;
-    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 };
-}, 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 = 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 (X in e)
-    return !0;
-  if (_e in e)
-    return !1;
-  if (K(e))
-    return !0;
-  const t = Object.getPrototypeOf(e);
-  return t === null ? !0 : Object.getPrototypeOf(t) === null;
-}, 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");
-}, 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 Ae(() => {
-      u && (R.AL.add(t), x.F()), u = !0, c();
-    }, { suspense: !1, sync: !0 });
-  });
-  return r.forEach((c) => {
-    U(c, "AP", t);
-  }), () => {
-    R.AK -= 1, i.forEach((c) => {
-      c();
-    }), r.forEach((c) => {
-      v(c, "AP", t);
-    });
-  };
-};
-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 b.AK += 1, U(s, "AQ", t), () => {
-    b.AK -= 1, v(s, "AQ", t);
-  };
-};
-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 o = e(c), l = e(u);
-    return (o === 1 || l === 1) && (r.length = i.length), r;
-  }, s = (r, i) => {
-    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 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 p = 0, a = o.length; p < a; p++) {
-      const d = o[p];
-      d in u || delete r[d];
-    }
-    return r;
-  };
-  return (r, i) => I(() => t(r, i));
-})();
-Y.untrack = (e) => rs(e);
-Y.unwrap = (e) => L(e);
-const us = () => {
-  const e = A.get(q);
-  if (!e)
-    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 ? S(t({ error: n, reset: () => s(void 0) })) : (A.S = s, S(e));
-  });
-};
-function fs(e) {
-  const t = E(e) ? (...s) => I(() => e(...s)) : () => e;
-  return t[me] = !0, t;
-}
-const as = () => {
-  const e = A, t = H;
-  return (s) => e.E(() => s(), e, t);
-};
-function f(e, t) {
-  return $e(new T(e, t));
-}
-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 = f(0);
-    return {
-      depend: () => {
-        e();
-      },
-      notify: () => {
-        e(I(() => e() + 1));
-      }
-    };
-  },
-  isInScope: () => !!ut(),
-  onDispose: (e) => {
-    C(e);
-  }
+import e, { cleanup as t, owner as n, untrack as r } from "oby";
+import { createReactivityAdapter as i } from "@signaldb/core";
+//#region src/index.ts
+var a = i({
+	create: () => {
+		let t = e(0);
+		return {
+			depend: () => {
+				t();
+			},
+			notify: () => {
+				t(r(() => t() + 1));
+			}
+		};
+	},
+	isInScope: () => !!n(),
+	onDispose: (e) => {
+		t(e);
+	}
 });
-export {
-  bs as default
-};
-//# sourceMappingURL=index.mjs.map
+//#endregion
+export { a as default };
+
+//# sourceMappingURL=index.mjs.map