@but212/atom-effect 0.27.0 → 0.29.0

package/dist/index.mjs

@@ -1,4 +1,4 @@
-var A = {
+var y = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
@@ -6,7 +6,7 @@ var A = {
 }, I = {
   DISPOSED: 1,
   EXECUTING: 8
-}, H = {
+}, B = {
   DISPOSED: 1,
   IS_COMPUTED: 2,
   DIRTY: 8,
@@ -28,45 +28,25 @@ var A = {
   MAX_FLUSH_ITERATIONS: 1e3,
   MIN_FLUSH_ITERATIONS: 10,
   BATCH_QUEUE_SHRINK_THRESHOLD: 1e3
-}, st = {
+}, Z = {
   WARN_INFINITE_LOOP: !0,
   EFFECT_FREQUENCY_WINDOW: 1e3
-}, j = {
-  MAX_ASYNC_RETRIES: 3,
-  MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1
-}, T = {
+}, ut = { MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1 }, b = {
   UNINITIALIZED: -1,
   MIN: 1
-}, w = 1073741823, _t = { VERSION_BITS: 16 }, mt = (typeof process < "u" && process.env, !1), W = Object.freeze([]), z = class {
-  constructor(t, s, e = void 0) {
-    this.node = t, this.version = s, this.unsub = e;
-  }
-}, ft = class {
-  constructor(t, s) {
-    this.fn = t, this.sub = s;
-  }
-  notify(t, s) {
-    const e = this.fn;
-    if (e !== void 0) {
-      e(t, s);
-      return;
-    }
-    const i = this.sub;
-    i !== void 0 && i.execute();
-  }
-}, N = class extends Error {
+}, X = 1073741823, Tt = (typeof process < "u" && process.env, !1), Y = Object.freeze([]), T = class extends Error {
   constructor(t, s = null, e = !0) {
     super(t), this.cause = s, this.recoverable = e, this.name = "AtomError";
   }
-}, S = class extends N {
+}, m = class extends T {
   constructor(t, s = null) {
     super(t, s, !0), this.name = "ComputedError";
   }
-}, v = class extends N {
+}, v = class extends T {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "EffectError";
   }
-}, L = class extends N {
+}, U = class extends T {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "SchedulerError";
   }
@@ -89,7 +69,27 @@ var A = {
   SCHEDULER_CALLBACK_MUST_BE_FUNCTION: "Scheduler callback must be a function",
   SCHEDULER_END_BATCH_WITHOUT_START: "endBatch() called without matching startBatch(). Ignoring.",
   BATCH_CALLBACK_MUST_BE_FUNCTION: "Batch callback must be a function"
-}, et = class {
+};
+function g(t, s, e) {
+  return t instanceof T ? t : t instanceof Error ? new s(`${t.name || t.constructor.name || "Error"} (${e}): ${t.message}`, t) : new s(`Unexpected error (${e}): ${String(t)}`);
+}
+var q = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), lt = /* @__PURE__ */ Symbol("AtomEffect.Id"), j = /* @__PURE__ */ Symbol("AtomEffect.Type"), L = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), ht = class {
+  constructor() {
+    this.enabled = !1, this.warnInfiniteLoop = Z.WARN_INFINITE_LOOP;
+  }
+  warn(t, s) {
+  }
+  attachDebugInfo(t, s, e) {
+  }
+  getDebugName(t) {
+    if (t != null)
+      return t[q];
+  }
+  getDebugType(t) {
+    if (t != null)
+      return t[j];
+  }
+}, G = new ht(), ct = 1, _t = () => ct++ | 0, J = class {
   constructor() {
     this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow = null, this._freeIndices = null;
   }
@@ -239,8 +239,8 @@ var A = {
     if (o != null && (t(o), ++e === s))
       return;
     const u = this._overflow;
-    if (u != null) for (let h = 0, l = u.length; h < l; h++) {
-      const f = u[h];
+    if (u != null) for (let l = 0, h = u.length; l < h; l++) {
+      const f = u[l];
       if (f != null && (t(f), ++e === s))
         return;
     }
@@ -262,8 +262,8 @@ var A = {
     if (o != null && (t(o), ++e === s))
       return e;
     const u = this._overflow;
-    if (u != null) for (let h = 0, l = u.length; h < l; h++) {
-      const f = u[h];
+    if (u != null) for (let l = 0, h = u.length; l < h; l++) {
+      const f = u[l];
       if (f != null && (t(f), ++e === s))
         return e;
     }
@@ -288,44 +288,201 @@ var A = {
   dispose() {
     this.clear();
   }
-}, K = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), at = /* @__PURE__ */ Symbol("AtomEffect.Id"), Z = /* @__PURE__ */ Symbol("AtomEffect.Type"), P = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), Et = class {
-  constructor() {
-    this.enabled = !1, this.warnInfiniteLoop = st.WARN_INFINITE_LOOP;
+}, tt = class extends J {
+  constructor(...t) {
+    super(...t), this._map = null, this._SCAN_THRESHOLD = 32, this.hasComputeds = !1;
   }
-  warn(t, s) {
+  prepareTracking() {
+    this.hasComputeds = !1;
   }
-  attachDebugInfo(t, s, e) {
+  _onItemRemoved(t) {
+    const s = t.unsub;
+    s && s();
   }
-  getDebugName(t) {
-    if (t != null)
-      return t[K];
+  claimExisting(t, s) {
+    const e = this._count;
+    if (s >= e) return !1;
+    const i = e - s;
+    if (this._map !== null || i > this._SCAN_THRESHOLD) return this._claimViaMap(t, s);
+    if (s < 4) switch (s) {
+      case 0: {
+        const n = this._s0;
+        if (n && n.node === t && n.unsub)
+          return n.version = t.version, !0;
+      }
+      case 1:
+        if (e > 1) {
+          const n = this._s1;
+          if (n && n.node === t && n.unsub)
+            return n.version = t.version, s !== 1 && (this._s1 = this._s0, this._s0 = n), !0;
+        }
+      case 2:
+        if (e > 2) {
+          const n = this._s2;
+          if (n && n.node === t && n.unsub) {
+            if (n.version = t.version, s !== 2) {
+              const o = s === 0 ? this._s0 : this._s1;
+              s === 0 ? this._s0 = n : this._s1 = n, this._s2 = o;
+            }
+            return !0;
+          }
+        }
+      case 3:
+        if (e > 3) {
+          const n = this._s3;
+          if (n && n.node === t && n.unsub) {
+            if (n.version = t.version, s !== 3) {
+              let o;
+              s === 0 ? (o = this._s0, this._s0 = n) : s === 1 ? (o = this._s1, this._s1 = n) : (o = this._s2, this._s2 = n), this._s3 = o;
+            }
+            return !0;
+          }
+        }
+    }
+    const r = this._overflow;
+    if (r) {
+      const n = t.version, o = s > 4 ? s : 4, u = r.length;
+      for (let l = o - 4; l < u; l++) {
+        const h = r[l];
+        if (h && h.node === t && h.unsub)
+          return h.version = n, this._swapGeneral(l + 4, s, h), !0;
+      }
+    }
+    return !1;
   }
-  getDebugType(t) {
-    if (t != null)
-      return t[Z];
+  _claimViaMap(t, s) {
+    let e = this._map;
+    if (e === null) {
+      e = this._map = /* @__PURE__ */ new Map();
+      const n = this._count;
+      if (s < 4) {
+        const u = this._s0;
+        s <= 0 && u?.unsub && e.set(u.node, 0);
+        const l = this._s1;
+        s <= 1 && l?.unsub && e.set(l.node, 1);
+        const h = this._s2;
+        s <= 2 && h?.unsub && e.set(h.node, 2);
+        const f = this._s3;
+        s <= 3 && f?.unsub && e.set(f.node, 3);
+      }
+      const o = this._overflow;
+      if (o && n > 4) {
+        const u = s > 4 ? s : 4, l = o.length;
+        for (let h = u - 4; h < l; h++) {
+          const f = o[h];
+          f?.unsub && e.set(f.node, h + 4);
+        }
+      }
+    }
+    const i = e.get(t);
+    if (i === void 0 || i < s) return !1;
+    const r = this.getAt(i);
+    if (r == null || !r.unsub) return !1;
+    if (r.version = t.version, i !== s) {
+      let n;
+      s === 0 ? n = this._s0 : s === 1 ? n = this._s1 : s === 2 ? n = this._s2 : s === 3 ? n = this._s3 : n = this._overflow[s - 4] ?? null, this.setAt(s, r), this.setAt(i, n), n?.unsub && e.set(n.node, i), e.set(t, s);
+    }
+    return !0;
+  }
+  _swapGeneral(t, s, e) {
+    if (t === s) return;
+    let i;
+    if (s === 0 ? i = this._s0 : s === 1 ? i = this._s1 : s === 2 ? i = this._s2 : s === 3 ? i = this._s3 : i = this._overflow[s - 4] ?? null, this.setAt(s, e), t === 0) this._s0 = i;
+    else if (t === 1) this._s1 = i;
+    else if (t === 2) this._s2 = i;
+    else if (t === 3) this._s3 = i;
+    else {
+      const r = this._overflow;
+      r[t - 4] = i;
+    }
+  }
+  insertNew(t, s) {
+    const e = this._count;
+    if (t < e) {
+      let i;
+      t === 0 ? i = this._s0 : t === 1 ? i = this._s1 : t === 2 ? i = this._s2 : t === 3 ? i = this._s3 : i = this._overflow[t - 4] ?? null, i != null && (this._addToOverflow(i), this._map !== null && i.unsub && this._map.set(i.node, this._count - 1));
+    }
+    if (t === 0) this._s0 = s;
+    else if (t === 1) this._s1 = s;
+    else if (t === 2) this._s2 = s;
+    else if (t === 3) this._s3 = s;
+    else {
+      let i = this._overflow;
+      i || (i = [], this._overflow = i), i[t - 4] = s;
+    }
+    t >= e && (this._count = t + 1);
+  }
+  truncateFrom(t) {
+    t >= this._count || (super.truncateFrom(t), this._map !== null && (this._map.clear(), this._map = null));
+  }
+  disposeAll() {
+    this._count > 0 && this.truncateFrom(0), this.hasComputeds = !1;
+  }
+  remove(t) {
+    throw new Error("remove() is strictly prohibited in DepSlotBuffer to preserve sequential cache paths.");
+  }
+  compact() {
+  }
+}, z = class {
+  constructor(t, s, e = void 0) {
+    this.node = t, this.version = s, this.unsub = e;
+  }
+}, ft = class {
+  constructor(t, s) {
+    this.fn = t, this.sub = s;
+  }
+  notify(t, s) {
+    const e = this.fn;
+    if (e !== void 0) {
+      e(t, s);
+      return;
+    }
+    const i = this.sub;
+    i !== void 0 && i.execute();
+  }
+}, at = class {
+  constructor() {
+    this.current = null;
+  }
+  run(t, s) {
+    if (this.current === t) return s();
+    const e = this.current;
+    this.current = t;
+    try {
+      return s();
+    } finally {
+      this.current = e;
+    }
+  }
+}, _ = new at();
+function mt(t) {
+  const s = _, e = s.current;
+  if (e === null) return t();
+  s.current = null;
+  try {
+    return t();
+  } finally {
+    s.current = e;
   }
-}, G = new Et(), dt = 1, pt = () => dt++ | 0;
-function m(t, s, e) {
-  return t instanceof N ? t : t instanceof Error ? new s(`${t.name || t.constructor.name || "Error"} (${e}): ${t.message}`, t) : new s(`Unexpected error (${e}): ${String(t)}`);
 }
 var Q = class {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = T.UNINITIALIZED, this._notifying = 0, this._hotIndex = -1, this._slots = null, this._deps = null, this.id = pt() & w;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = b.UNINITIALIZED, this._notifying = 0, this._hotIndex = -1, this._slots = null, this._deps = null, this.id = _t() & X;
   }
   get isDisposed() {
-    return (this.flags & H.DISPOSED) !== 0;
+    return (this.flags & B.DISPOSED) !== 0;
   }
   get isComputed() {
-    return (this.flags & H.IS_COMPUTED) !== 0;
+    return (this.flags & B.IS_COMPUTED) !== 0;
   }
   get hasError() {
     return !1;
   }
   subscribe(t) {
     const s = typeof t == "function";
-    if (!s && (!t || typeof t.execute != "function")) throw m(/* @__PURE__ */ new TypeError("Invalid subscriber"), N, c.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
+    if (!s && (!t || typeof t.execute != "function")) throw g(/* @__PURE__ */ new TypeError("Invalid subscriber"), T, c.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
     let e = this._slots;
-    e || (e = new et(), this._slots = e);
+    e || (e = new J(), this._slots = e);
     let i = !1;
     if (e._s0 != null && (s ? e._s0.fn === t : e._s0.sub === t)) i = !0;
     else if (e._s1 != null && (s ? e._s1.fn === t : e._s1.sub === t)) i = !0;
@@ -334,8 +491,8 @@ var Q = class {
     else {
       const n = e._overflow;
       if (n != null) for (let o = 0, u = n.length; o < u; o++) {
-        const h = n[o];
-        if (h != null && (s ? h.fn === t : h.sub === t)) {
+        const l = n[o];
+        if (l != null && (s ? l.fn === t : l.sub === t)) {
           i = !0;
           break;
         }
@@ -386,8 +543,8 @@ var Q = class {
           const u = r[n];
           if (u != null) try {
             u.notify(t, s);
-          } catch (h) {
-            this._logNotifyError(h);
+          } catch (l) {
+            this._logNotifyError(l);
           }
         }
       } finally {
@@ -396,7 +553,7 @@ var Q = class {
     }
   }
   _logNotifyError(t) {
-    console.error(m(t, N, c.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+    console.error(g(t, T, c.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
   }
   _isDirty() {
     const t = this._deps;
@@ -406,34 +563,34 @@ var Q = class {
       const e = t.getAt(s);
       if (e != null && e.node.version !== e.version) return !0;
     }
-    return !t.hasComputeds && !t.isDirtyFast() ? !1 : this._deepDirtyCheck();
+    return this._deepDirtyCheck();
   }
-}, M = 0;
-function Y() {
-  const t = M + 1 & w;
-  return M = t === 0 ? 1 : t, M;
+}, $ = /* @__PURE__ */ Symbol.for("atom-effect/atom"), st = /* @__PURE__ */ Symbol.for("atom-effect/computed"), et = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Et = /* @__PURE__ */ Symbol.for("atom-effect/writable"), P = 0;
+function k() {
+  const t = P + 1 & X;
+  return P = t === 0 ? 1 : t, P;
 }
-function X(t) {
-  const s = t + 1 & w;
+function H(t) {
+  const s = t + 1 & X;
   return s === 0 ? 1 : s;
 }
-var k = 0, R = !1, it = 0;
-function nt() {
+var V = 0, R = !1, it = 0;
+function dt() {
   return it;
 }
-function J() {
-  return R ? !1 : (R = !0, it = Y(), k = 0, !0);
+function W() {
+  return R ? !1 : (R = !0, it = k(), V = 0, !0);
 }
-function tt() {
+function K() {
   R = !1;
 }
-function Ct() {
+function pt() {
   if (!R) return 0;
-  const t = ++k;
+  const t = ++V;
   if (t <= C.MAX_EXECUTIONS_PER_FLUSH) return t;
   throw new Error(`[atom-effect] Infinite loop detected: flush execution count exceeded ${C.MAX_EXECUTIONS_PER_FLUSH}`);
 }
-var It = class {
+var Ct = class {
   constructor() {
     this._queueBuffer = [[], []], this._bufferIndex = 0, this._size = 0, this._epoch = 0, this._isProcessing = !1, this._isFlushingSync = !1, this._batchDepth = 0, this._batchQueue = [], this._batchQueueSize = 0, this._maxFlushIterations = C.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
   }
@@ -459,19 +616,19 @@ var It = class {
   _runLoop() {
     try {
       if (this._size === 0) return;
-      const t = J();
-      this._drainQueue(), t && tt();
+      const t = W();
+      this._drainQueue(), t && K();
     } finally {
       this._isProcessing = !1, this._size > 0 && this._batchDepth === 0 && this._flush();
     }
   }
   _flushSync() {
     this._isFlushingSync = !0;
-    const t = J();
+    const t = W();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this._isFlushingSync = !1, t && tt();
+      this._isFlushingSync = !1, t && K();
     }
   }
   _mergeBatchQueue() {
@@ -503,14 +660,14 @@ var It = class {
       try {
         typeof r == "function" ? r() : r.execute();
       } catch (n) {
-        console.error(new L("Error occurred during scheduler execution", n));
+        console.error(new U("Error occurred during scheduler execution", n));
       }
     }
     s.length = 0;
   }
   _handleFlushOverflow() {
     const t = this._size + this._batchQueueSize, s = this._maxFlushIterations;
-    console.error(new L(c.SCHEDULER_FLUSH_OVERFLOW(s, t))), this._size = 0;
+    console.error(new U(c.SCHEDULER_FLUSH_OVERFLOW(s, t))), this._size = 0;
     const e = this._bufferIndex;
     this._queueBuffer[e].length = 0, this._batchQueueSize = 0;
     const i = this.onOverflow;
@@ -526,36 +683,23 @@ var It = class {
     this._batchDepth !== 0 && --this._batchDepth === 0 && this._flushSync();
   }
   setMaxFlushIterations(t) {
-    if (t < C.MIN_FLUSH_ITERATIONS) throw new L(`Max flush iterations must be at least ${C.MIN_FLUSH_ITERATIONS}`);
+    if (t < C.MIN_FLUSH_ITERATIONS) throw new U(`Max flush iterations must be at least ${C.MIN_FLUSH_ITERATIONS}`);
     this._maxFlushIterations = t;
   }
-}, F = new It(), V = /* @__PURE__ */ Symbol.for("atom-effect/atom"), rt = /* @__PURE__ */ Symbol.for("atom-effect/computed"), ot = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Dt = /* @__PURE__ */ Symbol.for("atom-effect/writable"), vt = class {
-  constructor() {
-    this.current = null;
-  }
-  run(t, s) {
-    const e = this.current;
-    this.current = t;
-    try {
-      return s();
-    } finally {
-      this.current = e;
-    }
-  }
-}, _ = new vt();
+}, w = new Ct();
 function Nt(t) {
-  const s = _, e = s.current;
-  if (e === null) return t();
-  s.current = null;
+  if (typeof t != "function") throw new TypeError(c.BATCH_CALLBACK_MUST_BE_FUNCTION);
+  const s = w;
+  s.startBatch();
   try {
     return t();
   } finally {
-    s.current = e;
+    s.endBatch();
   }
 }
-var St = class extends Q {
+var It = class extends Q {
   constructor(t, s) {
-    super(), this[V] = !0, this[Dt] = !0, this._value = t, s && (this.flags |= a.SYNC), G.attachDebugInfo(this, "atom", this.id);
+    super(), this[$] = !0, this[Et] = !0, this._value = t, s && (this.flags |= a.SYNC), G.attachDebugInfo(this, "atom", this.id);
   }
   get isNotificationScheduled() {
     return (this.flags & a.NOTIFICATION_SCHEDULED) !== 0;
@@ -570,11 +714,11 @@ var St = class extends Q {
   set value(t) {
     const s = this._value;
     if (Object.is(s, t)) return;
-    this._value = t, this.version = X(this.version);
+    this._value = t, this.version = H(this.version);
     const e = this.flags;
     if ((e & a.NOTIFICATION_SCHEDULED) !== 0) return;
     const i = this._slots;
-    i == null || i.size === 0 || (this._pendingOldValue = s, this.flags = e | a.NOTIFICATION_SCHEDULED, (e & a.SYNC) !== 0 && !F.isBatching ? this._flushNotifications() : F.schedule(this));
+    i == null || i.size === 0 || (this._pendingOldValue = s, this.flags = e | a.NOTIFICATION_SCHEDULED, (e & a.SYNC) !== 0 && !w.isBatching ? this._flushNotifications() : w.schedule(this));
   }
   execute() {
     this._flushNotifications();
@@ -599,201 +743,25 @@ var St = class extends Q {
     this.dispose();
   }
 };
-function yt(t, s = {}) {
-  return new St(t, s.sync ?? !1);
+function bt(t, s = {}) {
+  return new It(t, s.sync ?? !1);
+}
+function yt(t) {
+  return typeof t == "object" && t !== null && $ in t;
 }
-var ut = class extends et {
-  constructor(...t) {
-    super(...t), this._map = null, this._SCAN_THRESHOLD = 32, this.hasComputeds = !1, this._depsHash = 0;
-  }
-  prepareTracking() {
-    this.hasComputeds = !1;
-  }
-  _onItemRemoved(t) {
-    const s = t.unsub;
-    s && s();
-  }
-  claimExisting(t, s) {
-    const e = this._count;
-    if (s >= e) return !1;
-    const i = e - s;
-    if (this._map !== null || i > this._SCAN_THRESHOLD) return this._claimViaMap(t, s);
-    if (s < 4) switch (s) {
-      case 0: {
-        const n = this._s0;
-        if (n && n.node === t && n.unsub)
-          return n.version = t.version, !0;
-      }
-      case 1:
-        if (e > 1) {
-          const n = this._s1;
-          if (n && n.node === t && n.unsub)
-            return n.version = t.version, s !== 1 && (this._s1 = this._s0, this._s0 = n), !0;
-        }
-      case 2:
-        if (e > 2) {
-          const n = this._s2;
-          if (n && n.node === t && n.unsub) {
-            if (n.version = t.version, s !== 2) {
-              const o = s === 0 ? this._s0 : this._s1;
-              s === 0 ? this._s0 = n : this._s1 = n, this._s2 = o;
-            }
-            return !0;
-          }
-        }
-      case 3:
-        if (e > 3) {
-          const n = this._s3;
-          if (n && n.node === t && n.unsub) {
-            if (n.version = t.version, s !== 3) {
-              let o;
-              s === 0 ? (o = this._s0, this._s0 = n) : s === 1 ? (o = this._s1, this._s1 = n) : (o = this._s2, this._s2 = n), this._s3 = o;
-            }
-            return !0;
-          }
-        }
-    }
-    const r = this._overflow;
-    if (r) {
-      const n = t.version, o = s > 4 ? s : 4, u = r.length;
-      for (let h = o - 4; h < u; h++) {
-        const l = r[h];
-        if (l && l.node === t && l.unsub)
-          return l.version = n, this._swapGeneral(h + 4, s, l), !0;
-      }
-    }
-    return !1;
-  }
-  _claimViaMap(t, s) {
-    let e = this._map;
-    if (e === null) {
-      e = this._map = /* @__PURE__ */ new Map();
-      const n = this._count;
-      if (s < 4) {
-        const u = this._s0;
-        s <= 0 && u?.unsub && e.set(u.node, 0);
-        const h = this._s1;
-        s <= 1 && h?.unsub && e.set(h.node, 1);
-        const l = this._s2;
-        s <= 2 && l?.unsub && e.set(l.node, 2);
-        const f = this._s3;
-        s <= 3 && f?.unsub && e.set(f.node, 3);
-      }
-      const o = this._overflow;
-      if (o && n > 4) {
-        const u = s > 4 ? s : 4, h = o.length;
-        for (let l = u - 4; l < h; l++) {
-          const f = o[l];
-          f?.unsub && e.set(f.node, l + 4);
-        }
-      }
-    }
-    const i = e.get(t);
-    if (i === void 0 || i < s) return !1;
-    const r = this.getAt(i);
-    if (r == null || !r.unsub) return !1;
-    if (r.version = t.version, i !== s) {
-      let n;
-      s === 0 ? n = this._s0 : s === 1 ? n = this._s1 : s === 2 ? n = this._s2 : s === 3 ? n = this._s3 : n = this._overflow[s - 4] ?? null, this.setAt(s, r), this.setAt(i, n), n?.unsub && e.set(n.node, i), e.set(t, s);
-    }
-    return !0;
-  }
-  _swapGeneral(t, s, e) {
-    if (t === s) return;
-    let i;
-    if (s === 0 ? i = this._s0 : s === 1 ? i = this._s1 : s === 2 ? i = this._s2 : s === 3 ? i = this._s3 : i = this._overflow[s - 4] ?? null, this.setAt(s, e), t === 0) this._s0 = i;
-    else if (t === 1) this._s1 = i;
-    else if (t === 2) this._s2 = i;
-    else if (t === 3) this._s3 = i;
-    else {
-      const r = this._overflow;
-      r[t - 4] = i;
-    }
-  }
-  insertNew(t, s) {
-    const e = this._count;
-    if (t < e) {
-      let i;
-      t === 0 ? i = this._s0 : t === 1 ? i = this._s1 : t === 2 ? i = this._s2 : t === 3 ? i = this._s3 : i = this._overflow[t - 4] ?? null, i != null && (this._addToOverflow(i), this._map !== null && i.unsub && this._map.set(i.node, this._count - 1));
-    }
-    if (t === 0) this._s0 = s;
-    else if (t === 1) this._s1 = s;
-    else if (t === 2) this._s2 = s;
-    else if (t === 3) this._s3 = s;
-    else {
-      let i = this._overflow;
-      i || (i = [], this._overflow = i), i[t - 4] = s;
-    }
-    t >= e && (this._count = t + 1);
-  }
-  truncateFrom(t) {
-    t >= this._count || (super.truncateFrom(t), this._map !== null && (this._map.clear(), this._map = null));
-  }
-  seal() {
-    this._depsHash = this._calculateHash(!1);
-  }
-  isDirtyFast() {
-    return this._calculateHash(!0) !== this._depsHash;
-  }
-  _calculateHash(t) {
-    const s = this._count;
-    if (s === 0) return 0;
-    const e = _t.VERSION_BITS;
-    let i = 0;
-    const r = this._s0;
-    if (r != null) {
-      const n = r.node, o = t ? n.version : r.version;
-      i = i + (o << e) + n.id | 0;
-      const u = this._s1;
-      if (s > 1 && u != null) {
-        const h = u.node, l = t ? h.version : u.version;
-        i = i + (l << e) + h.id | 0;
-        const f = this._s2;
-        if (s > 2 && f != null) {
-          const $ = f.node, lt = t ? $.version : f.version;
-          i = i + (lt << e) + $.id | 0;
-          const U = this._s3;
-          if (s > 3 && U != null) {
-            const q = U.node, ct = t ? q.version : U.version;
-            i = i + (ct << e) + q.id | 0;
-          }
-        }
-      }
-    }
-    if (s > 4) {
-      const n = this._overflow;
-      for (let o = 0, u = n.length; o < u; o++) {
-        const h = n[o], l = h.node, f = t ? l.version : h.version;
-        i = i + (f << e) + l.id | 0;
-      }
-    }
-    return i;
-  }
-  disposeAll() {
-    this._count > 0 && this.truncateFrom(0), this.hasComputeds = !1;
-  }
-  remove(t) {
-    throw new Error("remove() is strictly prohibited in DepSlotBuffer to preserve sequential cache paths.");
-  }
-  compact() {
-  }
-};
 function At(t) {
-  return typeof t == "object" && t !== null && V in t;
+  return typeof t == "object" && t !== null && st in t;
 }
 function Ot(t) {
-  return typeof t == "object" && t !== null && rt in t;
+  return typeof t == "object" && t !== null && et in t;
 }
-function bt(t) {
-  return typeof t == "object" && t !== null && ot in t;
-}
-function ht(t) {
+function nt(t) {
   return typeof t == "object" && t !== null && typeof t.then == "function";
 }
-var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, RECOMPUTING: y, DISPOSED: x, IS_COMPUTED: b, FORCE_COMPUTE: B } = H, gt = class extends Q {
+var { IDLE: p, DIRTY: E, PENDING: S, RESOLVED: d, REJECTED: D, HAS_ERROR: A, RECOMPUTING: N, DISPOSED: M, IS_COMPUTED: O, FORCE_COMPUTE: x } = B, Dt = class extends Q {
   constructor(t, s = {}) {
-    if (typeof t != "function") throw new S(c.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this[V] = !0, this[rt] = !0, this._error = null, this._promiseId = 0, this._deps = new ut(), this._asyncRetryCount = 0, this._lastDriftEpoch = T.UNINITIALIZED, this._trackEpoch = T.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = b | E | p, this._equal = s.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in s ? s.defaultValue : P, this._onError = s.onError ?? null, this._maxAsyncRetries = (s.maxAsyncRetries ?? j.MAX_ASYNC_RETRIES) & w, G.attachDebugInfo(this, "computed", this.id), s.lazy === !1) try {
+    if (typeof t != "function") throw new m(c.COMPUTED_MUST_BE_FUNCTION);
+    if (super(), this[$] = !0, this[st] = !0, this._error = null, this._promiseId = 0, this._deps = new tt(), this._trackEpoch = b.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = O | E | p, this._equal = s.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in s ? s.defaultValue : L, this._onError = s.onError ?? null, G.attachDebugInfo(this, "computed", this.id), s.lazy === !1) try {
       this._recompute();
     } catch {
     }
@@ -805,10 +773,10 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
     return (this.flags & D) !== 0;
   }
   get isRecomputing() {
-    return (this.flags & y) !== 0;
+    return (this.flags & N) !== 0;
   }
   get _hasErrorInternal() {
-    return (this.flags & O) !== 0;
+    return (this.flags & A) !== 0;
   }
   _track() {
     _.current?.addDependency(this);
@@ -818,20 +786,20 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
     t?.addDependency(this);
     let s = this.flags;
     if ((s & (d | E | p)) === d) return this._value;
-    if ((s & x) !== 0) throw new S(c.COMPUTED_DISPOSED);
-    if ((s & y) !== 0) {
+    if ((s & M) !== 0) throw new m(c.COMPUTED_DISPOSED);
+    if ((s & N) !== 0) {
       const r = this._defaultValue;
-      if (r !== P) return r;
-      throw new S(c.COMPUTED_CIRCULAR_DEPENDENCY);
+      if (r !== L) return r;
+      throw new m(c.COMPUTED_CIRCULAR_DEPENDENCY);
     }
     if ((s & (E | p)) !== 0) {
       const r = this._deps;
-      if ((s & p) === 0 && (s & B) === 0 && r.size > 0 && !this._isDirty() ? s = this.flags &= ~E : (this._recompute(), s = this.flags), (s & d) !== 0) return this._value;
+      if ((s & p) === 0 && (s & x) === 0 && r.size > 0 && !this._isDirty() ? s = this.flags &= ~E : (this._recompute(), s = this.flags), (s & d) !== 0) return this._value;
     }
-    const e = this._defaultValue, i = e !== P;
-    if ((s & g) !== 0) {
+    const e = this._defaultValue, i = e !== L;
+    if ((s & S) !== 0) {
       if (i) return e;
-      throw new S(c.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+      throw new m(c.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
     }
     if ((s & D) !== 0) {
       if (i) return e;
@@ -846,11 +814,11 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
     const t = _.current;
     t?.addDependency(this);
     const s = this.flags;
-    return (s & d) !== 0 ? A.RESOLVED : (s & g) !== 0 ? A.PENDING : (s & D) !== 0 ? A.REJECTED : A.IDLE;
+    return (s & d) !== 0 ? y.RESOLVED : (s & S) !== 0 ? y.PENDING : (s & D) !== 0 ? y.REJECTED : y.IDLE;
   }
   get hasError() {
     const t = _.current;
-    if (t?.addDependency(this), (this.flags & (D | O)) !== 0) return !0;
+    if (t?.addDependency(this), (this.flags & (D | A)) !== 0) return !0;
     const s = this._deps;
     if (!s.hasComputeds) return !1;
     const e = s.size;
@@ -865,7 +833,7 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
     t?.addDependency(this);
     const s = this._error, e = this._deps;
     if (!e.hasComputeds)
-      return s == null ? W : Object.freeze([s]);
+      return s == null ? Y : Object.freeze([s]);
     const i = [];
     s != null && i.push(s);
     const r = e.size;
@@ -873,9 +841,9 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
       const o = e.getAt(n);
       if (o == null) continue;
       const u = o.node;
-      (u.flags & b) !== 0 && u.hasError && this._collectErrorsFromDep(u, i);
+      (u.flags & O) !== 0 && u.hasError && this._collectErrorsFromDep(u, i);
     }
-    return i.length === 0 ? W : Object.freeze(i);
+    return i.length === 0 ? Y : Object.freeze(i);
   }
   _collectErrorsFromDep(t, s) {
     const e = t.errors, i = e.length;
@@ -890,17 +858,17 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
   }
   get isPending() {
     const t = _.current;
-    return t?.addDependency(this), (this.flags & g) !== 0;
+    return t?.addDependency(this), (this.flags & S) !== 0;
   }
   get isResolved() {
     const t = _.current;
     return t?.addDependency(this), (this.flags & d) !== 0;
   }
   invalidate() {
-    this.flags |= B, this._markDirty();
+    this.flags |= x, this._markDirty();
   }
   dispose() {
-    (this.flags & x) === 0 && (this._deps.disposeAll(), this._slots != null && this._slots.clear(), this.flags = x | E | p, this._error = null, this._value = void 0, this._hotIndex = -1);
+    (this.flags & M) === 0 && (this._deps.disposeAll(), this._slots != null && this._slots.clear(), this.flags = M | E | p, this._error = null, this._value = void 0, this._hotIndex = -1);
   }
   [Symbol.dispose]() {
     this.dispose();
@@ -915,15 +883,15 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
       const n = new z(t, t.version, t.subscribe(this));
       i.insertNew(e, n);
     }
-    (t.flags & b) !== 0 && (i.hasComputeds = !0);
+    (t.flags & O) !== 0 && (i.hasComputeds = !0);
   }
   _recompute() {
     if (this.isRecomputing) return;
-    this.flags = (this.flags | y) & ~B, this._trackEpoch = Y(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
+    this.flags = (this.flags | N) & ~x, this._trackEpoch = k(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
     let t = !1;
     try {
       const s = _.run(this, this._fn);
-      this._deps.truncateFrom(this._trackCount), this._deps.seal(), t = !0, ht(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
+      this._deps.truncateFrom(this._trackCount), t = !0, nt(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
     } catch (s) {
       if (!t) try {
         this._deps.truncateFrom(this._trackCount);
@@ -931,25 +899,22 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
       }
       this._handleError(s, c.COMPUTED_COMPUTATION_FAILED, !0);
     } finally {
-      this._trackEpoch = T.UNINITIALIZED, this._trackCount = 0, this.flags &= ~y;
+      this._trackEpoch = b.UNINITIALIZED, this._trackCount = 0, this.flags &= ~N;
     }
   }
   _handleAsyncComputation(t) {
-    this.flags = (this.flags | g) & ~(p | E | d | D), this._notifySubscribers(void 0, void 0), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % j.MAX_PROMISE_ID;
+    this.flags = (this.flags | S) & ~(p | E | d | D), this._notifySubscribers(void 0, void 0), this._promiseId = (this._promiseId + 1) % ut.MAX_PROMISE_ID;
     const s = this._promiseId;
     t.then((e) => {
       if (s === this._promiseId) {
-        if (this._isDirty()) {
-          const i = nt();
-          return this._lastDriftEpoch !== i && (this._lastDriftEpoch = i, this._asyncRetryCount = 0), this._asyncRetryCount++ < this._maxAsyncRetries ? this._markDirty() : this._handleError(new S(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`), c.COMPUTED_ASYNC_COMPUTATION_FAILED);
-        }
+        if (this._isDirty()) return this._markDirty();
         this._finalizeResolution(e), this._notifySubscribers(e, void 0);
       }
     }, (e) => s === this._promiseId && this._handleError(e, c.COMPUTED_ASYNC_COMPUTATION_FAILED));
   }
   _handleError(t, s, e = !1) {
-    const i = m(t, S, s);
-    if (!e && !this.isRejected && (this.version = X(this.version)), this._error = i, this.flags = this.flags & ~(p | E | g | d) | D | O, this._onError) try {
+    const i = g(t, m, s);
+    if (!e && !this.isRejected && (this.version = H(this.version)), this._error = i, this.flags = this.flags & ~(p | E | S | d) | D | A, this._onError) try {
       this._onError(i);
     } catch (r) {
       console.error(c.CALLBACK_ERROR_IN_ERROR_HANDLER, r);
@@ -959,18 +924,14 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
   }
   _finalizeResolution(t) {
     const s = this.flags;
-    ((s & d) === 0 || !this._equal(this._value, t)) && (this.version = X(this.version)), this._value = t, this._error = null, this.flags = (s | d) & ~(p | E | g | D | O);
+    ((s & d) === 0 || !this._equal(this._value, t)) && (this.version = H(this.version)), this._value = t, this._error = null, this.flags = (s | d) & ~(p | E | S | D | A);
   }
   execute() {
     this._markDirty();
   }
   _markDirty() {
     const t = this.flags;
-    (t & (y | E)) === 0 && (this.flags = t | E, this._notifySubscribers(void 0, void 0));
-  }
-  _isDirty() {
-    const t = this._deps;
-    return t.hasComputeds ? this._deepDirtyCheck() : t.isDirtyFast();
+    (t & (N | E)) === 0 && (this.flags = t | E, this._notifySubscribers(void 0, void 0));
   }
   _deepDirtyCheck() {
     const t = this._deps, s = _.current;
@@ -981,7 +942,7 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
         const r = t.getAt(i);
         if (r == null) continue;
         const n = r.node;
-        if ((n.flags & b) !== 0) try {
+        if ((n.flags & O) !== 0) try {
           n.value;
         } catch {
         }
@@ -994,12 +955,12 @@ var { IDLE: p, DIRTY: E, PENDING: g, RESOLVED: d, REJECTED: D, HAS_ERROR: O, REC
     }
   }
 };
-function Rt(t, s = {}) {
-  return new gt(t, s);
+function Ft(t, s = {}) {
+  return new Dt(t, s);
 }
-var Tt = class extends Q {
+var vt = class extends Q {
   constructor(t, s = {}) {
-    super(), this[ot] = !0, this._cleanup = null, this._deps = new ut(), this._currentEpoch = T.UNINITIALIZED, this._lastFlushEpoch = T.UNINITIALIZED, this._fn = t, this._onError = s.onError ?? null, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? C.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? C.MAX_EXECUTIONS_PER_EFFECT, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._trackCount = 0, this._sync ? this._notifyCallback = () => this.execute() : this._notifyCallback = () => F.schedule(this), G.attachDebugInfo(this, "effect", this.id);
+    super(), this[et] = !0, this._cleanup = null, this._deps = new tt(), this._currentEpoch = b.UNINITIALIZED, this._lastFlushEpoch = b.UNINITIALIZED, this._fn = t, this._onError = s.onError ?? null, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? C.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? C.MAX_EXECUTIONS_PER_EFFECT, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._trackCount = 0, this._sync ? this._notifyCallback = () => this.execute() : this._notifyCallback = () => w.schedule(this), G.attachDebugInfo(this, "effect", this.id);
   }
   run() {
     if (this.isDisposed) throw new v(c.EFFECT_DISPOSED);
@@ -1042,7 +1003,7 @@ var Tt = class extends Q {
       const i = t.subscribe(this._notifyCallback);
       e = new z(t, t.version, i);
     } catch (i) {
-      const r = m(i, v, c.EFFECT_EXECUTION_FAILED);
+      const r = g(i, v, c.EFFECT_EXECUTION_FAILED);
       if (console.error(r), this._onError) try {
         this._onError(r);
       } catch {
@@ -1056,11 +1017,11 @@ var Tt = class extends Q {
     if ((s & (I.DISPOSED | I.EXECUTING)) !== 0) return;
     const e = this._deps;
     if (!t && e.size > 0 && !this._isDirty()) return;
-    this._checkInfiniteLoops(), this.flags = s | I.EXECUTING, this._execCleanup(), this._currentEpoch = Y(), this._trackCount = 0, e.prepareTracking(), this._hotIndex = -1;
+    this._checkInfiniteLoops(), this.flags = s | I.EXECUTING, this._execCleanup(), this._currentEpoch = k(), this._trackCount = 0, e.prepareTracking(), this._hotIndex = -1;
     let i = !1;
     try {
       const r = _.run(this, this._fn);
-      e.truncateFrom(this._trackCount), e.seal(), i = !0, ht(r) ? this._handleAsyncResult(r) : this._cleanup = typeof r == "function" ? r : null;
+      e.truncateFrom(this._trackCount), i = !0, nt(r) ? this._handleAsyncResult(r) : this._cleanup = typeof r == "function" ? r : null;
     } catch (r) {
       if (!i) try {
         e.truncateFrom(this._trackCount);
@@ -1071,10 +1032,6 @@ var Tt = class extends Q {
       this.flags &= ~I.EXECUTING;
     }
   }
-  _isDirty() {
-    const t = this._deps;
-    return t.hasComputeds ? this._deepDirtyCheck() : t.isDirtyFast();
-  }
   _handleAsyncResult(t) {
     const s = ++this._execId;
     t.then((e) => {
@@ -1125,13 +1082,13 @@ var Tt = class extends Q {
     }
   }
   _checkInfiniteLoops() {
-    const t = nt();
-    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), Ct() > C.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
+    const t = dt();
+    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), pt() > C.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
   }
   _checkFrequencyLimit() {
     if (!Number.isFinite(this._maxExecutions)) return;
     const t = Date.now();
-    if (t - this._windowStart >= st.EFFECT_FREQUENCY_WINDOW) {
+    if (t - this._windowStart >= Z.EFFECT_FREQUENCY_WINDOW) {
       this._windowStart = t, this._windowCount = 1;
       return;
     }
@@ -1147,51 +1104,99 @@ var Tt = class extends Q {
     return (this.flags & I.EXECUTING) !== 0;
   }
   _throwInfiniteLoopError(t) {
-    const s = new v(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${k}`);
+    const s = new v(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${V}`);
     throw this.dispose(), console.error(s), s;
   }
   _handleExecutionError(t, s = c.EFFECT_EXECUTION_FAILED) {
-    const e = m(t, v, s);
+    const e = g(t, v, s);
     if (console.error(e), this._onError) try {
       this._onError(e);
     } catch (i) {
-      console.error(m(i, v, c.CALLBACK_ERROR_IN_ERROR_HANDLER));
+      console.error(g(i, v, c.CALLBACK_ERROR_IN_ERROR_HANDLER));
     }
   }
 };
-function Ft(t, s = {}) {
+function Rt(t, s = {}) {
   if (typeof t != "function") throw new v(c.EFFECT_MUST_BE_FUNCTION);
-  const e = new Tt(t, s);
+  const e = new vt(t, s);
   return e.execute(), e;
 }
-function wt(t) {
-  if (typeof t != "function") throw new TypeError(c.BATCH_CALLBACK_MUST_BE_FUNCTION);
-  const s = F;
-  s.startBatch();
-  try {
-    return t();
-  } finally {
-    s.endBatch();
-  }
+var St = /* @__PURE__ */ Symbol.for("atom-effect/atom"), gt = /* @__PURE__ */ Symbol.for("atom-effect/writable");
+function rt(t, s, e, i) {
+  if (e === s.length) return i;
+  const r = s[e], n = t != null && typeof t == "object" ? t : {}, o = n[r], u = rt(o, s, e + 1, i);
+  if (Object.is(o, u)) return t;
+  if (Array.isArray(n)) {
+    const l = n.slice(), h = Number.parseInt(r, 10);
+    return Number.isNaN(h) ? l[r] = u : l[h] = u, l;
+  }
+  return {
+    ...n,
+    [r]: u
+  };
+}
+function F(t, s) {
+  let e = t;
+  const i = s.length;
+  for (let r = 0; r < i; r++) {
+    if (e == null) return;
+    e = e[s[r]];
+  }
+  return e;
+}
+function ot(t, s) {
+  const e = s.includes(".") ? s.split(".") : [s], i = /* @__PURE__ */ new Set(), r = () => {
+    i.forEach((n) => n()), i.clear();
+  };
+  return {
+    get value() {
+      return F(t.value, e);
+    },
+    set value(n) {
+      const o = t.peek(), u = rt(o, e, 0, n);
+      u !== o && (t.value = u);
+    },
+    peek: () => F(t.peek(), e),
+    subscribe(n) {
+      const o = t.subscribe((u, l) => {
+        const h = F(u, e), f = F(l, e);
+        Object.is(h, f) || n(h, f);
+      });
+      return i.add(o), () => {
+        o(), i.delete(o);
+      };
+    },
+    subscriberCount: () => i.size,
+    dispose: r,
+    [Symbol.dispose]: r,
+    [St]: !0,
+    [gt]: !0
+  };
 }
+var wt = (t, s) => ot(t, s), Ut = (t) => (s) => ot(t, s);
 export {
-  A as AsyncState,
-  N as AtomError,
-  S as ComputedError,
-  st as DEBUG_CONFIG,
+  y as AsyncState,
+  T as AtomError,
+  m as ComputedError,
+  Z as DEBUG_CONFIG,
   G as DEBUG_RUNTIME,
   v as EffectError,
   C as SCHEDULER_CONFIG,
-  L as SchedulerError,
-  yt as atom,
-  wt as batch,
-  Rt as computed,
-  Ft as effect,
-  At as isAtom,
-  Ot as isComputed,
-  bt as isEffect,
-  F as scheduler,
-  Nt as untracked
+  U as SchedulerError,
+  bt as atom,
+  ot as atomLens,
+  Nt as batch,
+  wt as composeLens,
+  Ft as computed,
+  Rt as effect,
+  F as getPathValue,
+  yt as isAtom,
+  At as isComputed,
+  Ot as isEffect,
+  Ut as lensFor,
+  w as scheduler,
+  rt as setDeepValue,
+  mt as untracked
 };
 
 //# sourceMappingURL=index.mjs.map