@but212/atom-effect 0.25.0 → 0.27.0

package/dist/index.mjs

@@ -1,12 +1,12 @@
-var b = {
+var A = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, f = {
+}, I = {
   DISPOSED: 1,
   EXECUTING: 8
-}, x = {
+}, H = {
   DISPOSED: 1,
   IS_COMPUTED: 2,
   DIRTY: 8,
@@ -17,11 +17,11 @@ var b = {
   RECOMPUTING: 256,
   HAS_ERROR: 512,
   FORCE_COMPUTE: 1024
-}, d = {
+}, a = {
   DISPOSED: 1,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, m = {
+}, C = {
   MAX_EXECUTIONS_PER_SECOND: 1e3,
   MAX_EXECUTIONS_PER_EFFECT: 100,
   MAX_EXECUTIONS_PER_FLUSH: 1e4,
@@ -34,37 +34,43 @@ var b = {
 }, j = {
   MAX_ASYNC_RETRIES: 3,
   MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1
-}, C = {
+}, T = {
   UNINITIALIZED: -1,
   MIN: 1
-}, G = 1073741823, q = { VERSION_BITS: 16 }, Ct = (typeof process < "u" && process.env, !1), W = Object.freeze([]), H = class {
+}, 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;
   }
-}, ut = class {
+}, ft = class {
   constructor(t, s) {
     this.fn = t, this.sub = s;
   }
   notify(t, s) {
-    this.fn ? this.fn(t, s) : this.sub && this.sub.execute();
+    const e = this.fn;
+    if (e !== void 0) {
+      e(t, s);
+      return;
+    }
+    const i = this.sub;
+    i !== void 0 && i.execute();
   }
-}, A = class extends Error {
+}, N = class extends Error {
   constructor(t, s = null, e = !0) {
     super(t), this.cause = s, this.recoverable = e, this.name = "AtomError";
   }
-}, S = class extends A {
+}, S = class extends N {
   constructor(t, s = null) {
     super(t, s, !0), this.name = "ComputedError";
   }
-}, D = class extends A {
+}, v = class extends N {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "EffectError";
   }
-}, R = class extends A {
+}, L = class extends N {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "SchedulerError";
   }
-}, l = {
+}, c = {
   COMPUTED_MUST_BE_FUNCTION: "Computed target must be a function",
   COMPUTED_ASYNC_PENDING_NO_DEFAULT: "Async computation pending with no default value",
   COMPUTED_COMPUTATION_FAILED: "Computation execution failed",
@@ -85,13 +91,13 @@ var b = {
   BATCH_CALLBACK_MUST_BE_FUNCTION: "Batch callback must be a function"
 }, et = class {
   constructor() {
-    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow = null;
+    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow = null, this._freeIndices = null;
   }
   get size() {
     return this._count;
   }
   getAt(t) {
-    switch (t) {
+    if (t < 4) switch (t) {
       case 0:
         return this._s0;
       case 1:
@@ -100,15 +106,13 @@ var b = {
         return this._s2;
       case 3:
         return this._s3;
-      default: {
-        const s = this._overflow;
-        if (s !== null && t >= 4) {
-          const e = t - 4;
-          if (e < s.length) return s[e] ?? null;
-        }
-        return null;
-      }
     }
+    const s = this._overflow;
+    if (s !== null) {
+      const e = s[t - 4];
+      return e === void 0 ? null : e;
+    }
+    return null;
   }
   setAt(t, s) {
     switch (t) {
@@ -124,45 +128,42 @@ var b = {
       case 3:
         this._s3 = s;
         break;
-      default: {
-        this._overflow ??= [];
-        const e = this._overflow;
-        e[t - 4] = s;
-      }
+      default:
+        this._overflow ??= [], this._overflow[t - 4] = s;
     }
     t >= this._count && (this._count = t + 1);
   }
   truncateFrom(t) {
     const s = this._count;
     if (t >= s) return;
-    if (t <= 3) switch (t) {
-      case 0: {
+    if (t <= 3) {
+      if (t <= 0) {
         const i = this._s0;
         i != null && (this._onItemRemoved(i), this._s0 = null);
       }
-      case 1: {
+      if (t <= 1) {
         const i = this._s1;
         i != null && (this._onItemRemoved(i), this._s1 = null);
       }
-      case 2: {
+      if (t <= 2) {
         const i = this._s2;
         i != null && (this._onItemRemoved(i), this._s2 = null);
       }
-      case 3: {
+      if (t <= 3) {
         const i = this._s3;
         i != null && (this._onItemRemoved(i), this._s3 = null);
       }
     }
     const e = this._overflow;
     if (e !== null && s > 4) {
-      const i = t > 4 ? t - 4 : 0, n = e.length;
-      for (let r = i; r < n; r++) {
-        const o = e[r];
-        o != null && (this._onItemRemoved(o), e[r] = null);
+      const i = t > 4 ? t - 4 : 0, r = e.length;
+      for (let n = i; n < r; n++) {
+        const o = e[n];
+        o != null && (this._onItemRemoved(o), e[n] = null);
       }
       t <= 4 ? (e.length = 0, this._overflow = null) : e.length = t - 4;
     }
-    this._count = t;
+    this._freeIndices !== null && (this._freeIndices = null), this._count = t;
   }
   _onItemRemoved(t) {
   }
@@ -183,14 +184,14 @@ var b = {
       this._s3 = t, this._count++;
       return;
     }
-    if (this._overflow === null) this._overflow = [t];
+    this._addToOverflow(t);
+  }
+  _addToOverflow(t) {
+    const s = this._overflow;
+    if (s === null) this._overflow = [t];
     else {
-      const s = this._overflow;
-      for (let e = 0, i = s.length; e < i; e++) if (s[e] === null) {
-        s[e] = t, this._count++;
-        return;
-      }
-      s.push(t);
+      const e = this._freeIndices;
+      e !== null && e.length > 0 ? s[e.pop()] = t : s.push(t);
     }
     this._count++;
   }
@@ -205,49 +206,43 @@ var b = {
       return this._s3 = null, this._count--, !0;
     const s = this._overflow;
     if (s == null) return !1;
-    for (let e = 0, i = s.length; e < i; e++) if (s[e] === t)
-      return s[e] = null, this._count--, !0;
+    for (let e = 0, i = s.length; e < i; e++) if (s[e] === t) {
+      s[e] = null, this._count--;
+      let r = this._freeIndices;
+      return r === null && (r = this._freeIndices = []), r.push(e), !0;
+    }
     return !1;
   }
   has(t) {
-    const s = this._count;
-    if (s === 0) return !1;
+    if (this._count === 0) return !1;
     if (this._s0 === t || this._s1 === t || this._s2 === t || this._s3 === t) return !0;
-    if (s <= 4) return !1;
-    const e = this._overflow;
-    if (e != null) {
-      let i = 0;
-      this._s0 != null && i++, this._s1 != null && i++, this._s2 != null && i++, this._s3 != null && i++;
-      for (let n = 0, r = e.length; n < r; n++) {
-        const o = e[n];
-        if (o != null) {
-          if (o === t) return !0;
-          if (++i === s) break;
-        }
-      }
+    const s = this._overflow;
+    if (s != null) {
+      for (let e = 0, i = s.length; e < i; e++) if (s[e] === t) return !0;
     }
     return !1;
   }
   forEach(t) {
     const s = this._count;
     if (s === 0) return;
-    const e = this._s0;
-    e != null && t(e);
-    const i = this._s1;
-    i != null && t(i);
+    let e = 0;
+    const i = this._s0;
+    if (i != null && (t(i), ++e === s))
+      return;
+    const r = this._s1;
+    if (r != null && (t(r), ++e === s))
+      return;
     const n = this._s2;
-    n != null && t(n);
-    const r = this._s3;
-    if (r != null && t(r), s <= 4) return;
-    const o = this._overflow;
-    if (o != null) {
-      let h = 0;
-      e != null && h++, i != null && h++, n != null && h++, r != null && h++;
-      for (let u = 0, a = o.length; u < a; u++) {
-        const c = o[u];
-        if (c != null && (t(c), ++h === s))
-          return;
-      }
+    if (n != null && (t(n), ++e === s))
+      return;
+    const o = this._s3;
+    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 (f != null && (t(f), ++e === s))
+        return;
     }
   }
   forEachIndexed(t) {
@@ -255,137 +250,208 @@ var b = {
     if (s === 0) return 0;
     let e = 0;
     const i = this._s0;
-    i != null && (t(i), e++);
-    const n = this._s1;
-    n != null && (t(n), e++);
-    const r = this._s2;
-    r != null && (t(r), e++);
+    if (i != null && (t(i), ++e === s))
+      return e;
+    const r = this._s1;
+    if (r != null && (t(r), ++e === s))
+      return e;
+    const n = this._s2;
+    if (n != null && (t(n), ++e === s))
+      return e;
     const o = this._s3;
-    if (o != null && (t(o), e++), s <= 4 || e === s) return e;
-    const h = this._overflow;
-    if (h != null) for (let u = 0, a = h.length; u < a; u++) {
-      const c = h[u];
-      if (c != null && (t(c), ++e === s))
-        break;
+    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 (f != null && (t(f), ++e === s))
+        return e;
     }
     return e;
   }
   compact() {
     const t = this._overflow;
-    if (t === null || t.length === 0) return;
-    let s = 0;
-    for (; s < t.length; ) if (t[s] === null) {
-      const e = t.pop();
-      s < t.length && e != null && (t[s] = e);
-    } else s++;
-    t.length === 0 && (this._overflow = null);
+    if (t === null) return;
+    let s = t.length;
+    if (s === 0) return;
+    let e = 0;
+    for (; e < s; ) if (t[e] === null) {
+      for (; s > e && t[s - 1] === null; )
+        t.pop(), s--;
+      s > e && (t[e] = t.pop(), s--, e++);
+    } else e++;
+    this._freeIndices = null, s === 0 && (this._overflow = null);
   }
   clear() {
-    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow !== null && (this._overflow.length = 0, this._overflow = null);
+    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow !== null && (this._overflow.length = 0, this._overflow = null), this._freeIndices = null;
   }
   dispose() {
     this.clear();
   }
-}, K = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), lt = /* @__PURE__ */ Symbol("AtomEffect.Id"), Z = /* @__PURE__ */ Symbol("AtomEffect.Type"), U = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), X = {
-  enabled: !1,
-  warnInfiniteLoop: st.WARN_INFINITE_LOOP,
+}, 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;
+  }
   warn(t, s) {
-  },
+  }
   attachDebugInfo(t, s, e) {
-  },
-  getDebugName: (t) => t?.[K],
-  getDebugType: (t) => t?.[Z]
-}, _t = 1, ct = () => _t++;
-function T(t, s, e) {
-  if (t instanceof A) return t;
-  const i = t instanceof Error, n = i ? t.message : String(t), r = i ? t : void 0;
-  return new s(`${i ? t.constructor.name : "Unexpected error"} (${e}): ${n}`, r);
+  }
+  getDebugName(t) {
+    if (t != null)
+      return t[K];
+  }
+  getDebugType(t) {
+    if (t != null)
+      return t[Z];
+  }
+}, 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 V = class {
+var Q = class {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = C.UNINITIALIZED, this._notifying = 0, this._hotIndex = -1, this._slots = null, this._deps = null, this.id = ct() & G;
+    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;
+  }
+  get isDisposed() {
+    return (this.flags & H.DISPOSED) !== 0;
+  }
+  get isComputed() {
+    return (this.flags & H.IS_COMPUTED) !== 0;
+  }
+  get hasError() {
+    return !1;
   }
   subscribe(t) {
     const s = typeof t == "function";
-    if (!s && (!t || typeof t.execute != "function")) throw T(/* @__PURE__ */ new TypeError("Invalid subscriber"), A, l.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
+    if (!s && (!t || typeof t.execute != "function")) throw m(/* @__PURE__ */ new TypeError("Invalid subscriber"), N, c.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
     let e = this._slots;
     e || (e = new et(), this._slots = e);
     let i = !1;
-    if (e.forEach((r) => {
-      (s ? r.fn === t : r.sub === t) && (i = !0);
-    }), i)
+    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;
+    else if (e._s2 != null && (s ? e._s2.fn === t : e._s2.sub === t)) i = !0;
+    else if (e._s3 != null && (s ? e._s3.fn === t : e._s3.sub === t)) i = !0;
+    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)) {
+          i = !0;
+          break;
+        }
+      }
+    }
+    if (i)
       return () => {
       };
-    const n = new ut(s ? t : void 0, s ? void 0 : t);
-    return e.add(n), () => this._unsubscribe(n);
+    const r = new ft(s ? t : void 0, s ? void 0 : t);
+    return e.add(r), () => this._unsubscribe(r);
   }
   _unsubscribe(t) {
-    if (this._slots) {
-      if (this._notifying > 0) {
-        this._slots.remove(t);
-        return;
-      }
-      this._slots.remove(t), this._slots.compact();
-    }
+    const s = this._slots;
+    s && (s.remove(t), this._notifying === 0 && s.compact());
   }
   subscriberCount() {
-    return this._slots ? this._slots.size : 0;
+    const t = this._slots;
+    return t === null ? 0 : t.size;
   }
   _notifySubscribers(t, s) {
     const e = this._slots;
-    if (!(!e || e.size === 0)) {
+    if (!(e === null || e.size === 0)) {
       this._notifying++;
       try {
-        e.forEach((i) => {
-          try {
-            i.notify(t, s);
-          } catch (n) {
-            console.error(T(n, A, l.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+        let i = e._s0;
+        if (i != null) try {
+          i.notify(t, s);
+        } catch (n) {
+          this._logNotifyError(n);
+        }
+        if (i = e._s1, i != null) try {
+          i.notify(t, s);
+        } catch (n) {
+          this._logNotifyError(n);
+        }
+        if (i = e._s2, i != null) try {
+          i.notify(t, s);
+        } catch (n) {
+          this._logNotifyError(n);
+        }
+        if (i = e._s3, i != null) try {
+          i.notify(t, s);
+        } catch (n) {
+          this._logNotifyError(n);
+        }
+        const r = e._overflow;
+        if (r != null) for (let n = 0, o = r.length; n < o; n++) {
+          const u = r[n];
+          if (u != null) try {
+            u.notify(t, s);
+          } catch (h) {
+            this._logNotifyError(h);
           }
-        });
+        }
       } finally {
-        this._notifying--, this._notifying === 0 && e.compact();
+        --this._notifying === 0 && e.compact();
       }
     }
   }
+  _logNotifyError(t) {
+    console.error(m(t, N, c.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+  }
   _isDirty() {
     const t = this._deps;
-    if (!t || t.size === 0) return !1;
-    if (this._hotIndex !== -1) {
-      const s = t.getAt(this._hotIndex);
-      if (s != null && s.node.version !== s.version) return !0;
+    if (t === null || t.size === 0) return !1;
+    const s = this._hotIndex;
+    if (s !== -1) {
+      const e = t.getAt(s);
+      if (e != null && e.node.version !== e.version) return !0;
     }
     return !t.hasComputeds && !t.isDirtyFast() ? !1 : this._deepDirtyCheck();
   }
-}, w = 0, Q = () => (w = w + 1 & 1073741823 || 1, w), z = (t) => t + 1 & G, Y = 0, F = !1, it = 0, nt = () => it;
+}, M = 0;
+function Y() {
+  const t = M + 1 & w;
+  return M = t === 0 ? 1 : t, M;
+}
+function X(t) {
+  const s = t + 1 & w;
+  return s === 0 ? 1 : s;
+}
+var k = 0, R = !1, it = 0;
+function nt() {
+  return it;
+}
 function J() {
-  return F ? !1 : (F = !0, it = Q(), Y = 0, !0);
+  return R ? !1 : (R = !0, it = Y(), k = 0, !0);
+}
+function tt() {
+  R = !1;
 }
-var tt = () => {
-  F = !1;
-}, ft = () => F ? ++Y : 0, L = /* @__PURE__ */ (function(t) {
-  return t[t.IDLE = 0] = "IDLE", t[t.BATCHING = 1] = "BATCHING", t[t.FLUSHING = 2] = "FLUSHING", t;
-})({}), at = class {
+function Ct() {
+  if (!R) return 0;
+  const t = ++k;
+  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 {
   constructor() {
-    this._queueBuffer = [[], []], this._bufferIndex = 0, this._size = 0, this._epoch = 0, this._isProcessing = !1, this._isBatching = !1, this._isFlushingSync = !1, this._batchDepth = 0, this._batchQueue = [], this._batchQueueSize = 0, this._maxFlushIterations = m.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
-  }
-  get phase() {
-    return this._isProcessing || this._isFlushingSync ? L.FLUSHING : this._isBatching ? L.BATCHING : L.IDLE;
+    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);
   }
   get queueSize() {
     return this._size;
   }
   get isBatching() {
-    return this._isBatching;
+    return this._batchDepth > 0;
   }
   schedule(t) {
-    if (t._nextEpoch !== this._epoch) {
-      if (t._nextEpoch = this._epoch, this._isBatching || this._isFlushingSync) {
-        this._batchQueue[this._batchQueueSize++] = t;
-        return;
-      }
-      this._queueBuffer[this._bufferIndex][this._size++] = t, this._isProcessing || this._flush();
+    const s = this._epoch;
+    if (t._nextEpoch === s) return;
+    if (t._nextEpoch = s, this._batchDepth > 0 || this._isFlushingSync) {
+      this._batchQueue[this._batchQueueSize++] = t;
+      return;
     }
+    const e = this._bufferIndex, i = this._queueBuffer[e];
+    i[this._size++] = t, this._isProcessing || this._flush();
   }
   _flush() {
     this._isProcessing || this._size === 0 || (this._isProcessing = !0, queueMicrotask(this._boundRunLoop));
@@ -396,7 +462,7 @@ var tt = () => {
       const t = J();
       this._drainQueue(), t && tt();
     } finally {
-      this._isProcessing = !1, this._size > 0 && !this._isBatching && this._flush();
+      this._isProcessing = !1, this._size > 0 && this._batchDepth === 0 && this._flush();
     }
   }
   _flushSync() {
@@ -409,14 +475,15 @@ var tt = () => {
     }
   }
   _mergeBatchQueue() {
-    if (this._batchQueueSize === 0) return;
-    const t = ++this._epoch, s = this._batchQueue, e = this._queueBuffer[this._bufferIndex];
-    let i = this._size;
-    for (let n = 0; n < this._batchQueueSize; n++) {
-      const r = s[n];
-      r._nextEpoch !== t && (r._nextEpoch = t, e[i++] = r);
+    const t = this._batchQueueSize;
+    if (t === 0) return;
+    const s = ++this._epoch, e = this._batchQueue, i = this._bufferIndex, r = this._queueBuffer[i];
+    let n = this._size;
+    for (let o = 0; o < t; o++) {
+      const u = e[o];
+      u._nextEpoch !== s && (u._nextEpoch = s, r[n++] = u);
     }
-    this._size = i, this._batchQueueSize = 0, s.length = 0;
+    this._size = n, this._batchQueueSize = 0, e.length = 0;
   }
   _drainQueue() {
     let t = 0;
@@ -430,34 +497,42 @@ var tt = () => {
   }
   _processQueue() {
     const t = this._bufferIndex, s = this._queueBuffer[t], e = this._size;
-    this._bufferIndex = t ^ 1, this._size = 0, this._epoch++;
-    for (let i = 0; i < e; i++) try {
-      const n = s[i];
-      typeof n == "function" ? n() : n.execute();
-    } catch (n) {
-      console.error(new R("Error occurred during scheduler execution", n));
+    this._bufferIndex = t ^ 1, this._size = 0, this._epoch = this._epoch + 1 | 0;
+    for (let i = 0; i < e; i++) {
+      const r = s[i];
+      try {
+        typeof r == "function" ? r() : r.execute();
+      } catch (n) {
+        console.error(new L("Error occurred during scheduler execution", n));
+      }
     }
     s.length = 0;
   }
   _handleFlushOverflow() {
-    const t = this._size + this._batchQueueSize;
-    if (console.error(new R(l.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t))), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow) try {
-      this.onOverflow(t);
+    const t = this._size + this._batchQueueSize, s = this._maxFlushIterations;
+    console.error(new L(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;
+    if (i) try {
+      i(t);
     } catch {
     }
   }
   startBatch() {
-    this._batchDepth++, this._isBatching = !0;
+    this._batchDepth++;
   }
   endBatch() {
-    this._batchDepth !== 0 && --this._batchDepth === 0 && (this._flushSync(), this._isBatching = !1);
+    this._batchDepth !== 0 && --this._batchDepth === 0 && this._flushSync();
   }
   setMaxFlushIterations(t) {
-    if (t < m.MIN_FLUSH_ITERATIONS) throw new R(`Max flush iterations must be at least ${m.MIN_FLUSH_ITERATIONS}`);
+    if (t < C.MIN_FLUSH_ITERATIONS) throw new L(`Max flush iterations must be at least ${C.MIN_FLUSH_ITERATIONS}`);
     this._maxFlushIterations = t;
   }
-}, y = new at(), $ = /* @__PURE__ */ Symbol.for("atom-effect/atom"), rt = /* @__PURE__ */ Symbol.for("atom-effect/computed"), ot = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Et = /* @__PURE__ */ Symbol.for("atom-effect/writable"), _ = {
-  current: null,
+}, 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;
@@ -467,20 +542,26 @@ var tt = () => {
       this.current = e;
     }
   }
-};
-function vt(t) {
-  const s = _.current;
-  if (s === null) return t();
-  _.current = null;
+}, _ = new vt();
+function Nt(t) {
+  const s = _, e = s.current;
+  if (e === null) return t();
+  s.current = null;
   try {
     return t();
   } finally {
-    _.current = s;
+    s.current = e;
   }
 }
-var dt = class extends V {
+var St = class extends Q {
   constructor(t, s) {
-    super(), this[$] = !0, this[Et] = !0, this._value = t, this._pendingOldValue = void 0, s && (this.flags |= d.SYNC), X.attachDebugInfo(this, "atom", this.id);
+    super(), this[V] = !0, this[Dt] = !0, this._value = t, s && (this.flags |= a.SYNC), G.attachDebugInfo(this, "atom", this.id);
+  }
+  get isNotificationScheduled() {
+    return (this.flags & a.NOTIFICATION_SCHEDULED) !== 0;
+  }
+  get isSync() {
+    return (this.flags & a.SYNC) !== 0;
   }
   get value() {
     const t = _.current;
@@ -489,31 +570,27 @@ var dt = class extends V {
   set value(t) {
     const s = this._value;
     if (Object.is(s, t)) return;
-    this._value = t, this.version = z(this.version);
-    const e = this._slots, i = this.flags;
-    if (e == null || e.size === 0 || i & d.NOTIFICATION_SCHEDULED) return;
-    this._pendingOldValue = s;
-    const n = i | d.NOTIFICATION_SCHEDULED;
-    if (this.flags = n, (n & d.SYNC) !== 0 && !y.isBatching) {
-      this._flushNotifications();
-      return;
-    }
-    y.schedule(this);
+    this._value = t, this.version = X(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));
   }
   execute() {
     this._flushNotifications();
   }
   _flushNotifications() {
     const t = this.flags;
-    if (!(t & d.NOTIFICATION_SCHEDULED) || t & d.DISPOSED) return;
+    if ((t & (a.NOTIFICATION_SCHEDULED | a.DISPOSED)) !== a.NOTIFICATION_SCHEDULED) return;
     const s = this._pendingOldValue;
-    this._pendingOldValue = void 0, this.flags &= ~d.NOTIFICATION_SCHEDULED, this._notifySubscribers(this._value, s);
+    this._pendingOldValue = void 0, this.flags = t & ~a.NOTIFICATION_SCHEDULED, this._notifySubscribers(this._value, s);
   }
   peek() {
     return this._value;
   }
   dispose() {
-    this.flags & d.DISPOSED || (this._slots?.clear(), this.flags |= d.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
+    const t = this.flags;
+    (t & a.DISPOSED) === 0 && (this._slots?.clear(), this.flags = t | a.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
   }
   _deepDirtyCheck() {
     return !1;
@@ -522,12 +599,12 @@ var dt = class extends V {
     this.dispose();
   }
 };
-function Dt(t, s = {}) {
-  return new dt(t, s.sync ?? !1);
+function yt(t, s = {}) {
+  return new St(t, s.sync ?? !1);
 }
-var k = class extends et {
-  constructor() {
-    super(), this._map = null, this._SCAN_THRESHOLD = 32, this.hasComputeds = !1, this._depsHash = 0, this._map = null, this.hasComputeds = !1, this._depsHash = 0;
+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;
@@ -543,92 +620,101 @@ var k = class extends et {
     if (this._map !== null || i > this._SCAN_THRESHOLD) return this._claimViaMap(t, s);
     if (s < 4) switch (s) {
       case 0: {
-        const o = this._s0;
-        if (o && o.node === t && o.unsub)
-          return o.version = t.version, !0;
+        const n = this._s0;
+        if (n && n.node === t && n.unsub)
+          return n.version = t.version, !0;
       }
       case 1:
         if (e > 1) {
-          const o = this._s1;
-          if (o && o.node === t && o.unsub)
-            return o.version = t.version, s !== 1 && (this._s1 = this._s0, this._s0 = o), !0;
+          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 o = this._s2;
-          if (o && o.node === t && o.unsub) {
-            if (o.version = t.version, s !== 2) {
-              const h = s === 0 ? this._s0 : this._s1;
-              s === 0 ? this._s0 = o : this._s1 = o, this._s2 = h;
+          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 o = this._s3;
-          if (o && o.node === t && o.unsub) {
-            if (o.version = t.version, s !== 3) {
-              let h;
-              s === 0 ? (h = this._s0, this._s0 = o) : s === 1 ? (h = this._s1, this._s1 = o) : (h = this._s2, this._s2 = o), this._s3 = h;
+          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 n = s > 4 ? s : 4, r = this._overflow;
-    if (r) for (let o = n - 4, h = r.length; o < h; o++) {
-      const u = r[o];
-      if (u && u.node === t && u.unsub)
-        return u.version = t.version, this._swapGeneral(o + 4, s, u), !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) {
-    if (this._map === null) {
-      this._map = /* @__PURE__ */ new Map();
+    let e = this._map;
+    if (e === null) {
+      e = this._map = /* @__PURE__ */ new Map();
       const n = this._count;
-      s < 4 && (s <= 0 && this._s0?.unsub && this._map.set(this._s0.node, 0), s <= 1 && this._s1?.unsub && this._map.set(this._s1.node, 1), s <= 2 && this._s2?.unsub && this._map.set(this._s2.node, 2), s <= 3 && this._s3?.unsub && this._map.set(this._s3.node, 3));
-      const r = this._overflow;
-      if (r && n > 4) {
-        const o = s > 4 ? s : 4;
-        for (let h = o - 4, u = r.length; h < u; h++) {
-          const a = r[h];
-          a?.unsub && this._map.set(a.node, h + 4);
+      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 e = this._map.get(t);
-    if (e === void 0 || e < s) return !1;
-    const i = this.getAt(e);
-    if (i == null || !i.unsub) return !1;
-    if (i.version = t.version, e !== s) {
-      const n = this.getAt(s);
-      this.setAt(s, i), this.setAt(e, n), n?.unsub && this._map.set(n.node, e), this._map.set(t, s);
+    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;
   }
-  _swapInline(t, s, e) {
-    const i = this.getAt(s);
-    this.setAt(s, e), this.setAt(t, i);
-  }
   _swapGeneral(t, s, e) {
     if (t === s) return;
-    const i = this.getAt(s);
-    if (this.setAt(s, e), t === 0) this._s0 = i;
+    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 n = this._overflow;
-      n[t - 4] = i;
+      const r = this._overflow;
+      r[t - 4] = i;
     }
   }
   insertNew(t, s) {
     const e = this._count;
     if (t < e) {
-      const i = this.getAt(t);
-      i != null && (this.add(i), this._map !== null && i.unsub && this._map.set(i.node, this._count - 1));
+      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;
@@ -644,76 +730,47 @@ var k = class extends et {
     t >= this._count || (super.truncateFrom(t), this._map !== null && (this._map.clear(), this._map = null));
   }
   seal() {
-    const t = this._count, s = q.VERSION_BITS;
-    let e = 0;
-    switch (t) {
-      case 0:
-        this._depsHash = 0;
-        return;
-      case 1: {
-        const i = this._s0;
-        e = e + (i.version << s) + i.node.id | 0;
-        break;
-      }
-      case 2: {
-        const i = this._s0, n = this._s1;
-        e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0;
-        break;
-      }
-      case 3: {
-        const i = this._s0, n = this._s1, r = this._s2;
-        e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0, e = e + (r.version << s) + r.node.id | 0;
-        break;
-      }
-      default: {
-        const i = this._s0, n = this._s1, r = this._s2, o = this._s3;
-        if (e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0, e = e + (r.version << s) + r.node.id | 0, e = e + (o.version << s) + o.node.id | 0, t > 4) {
-          const h = this._overflow;
-          for (let u = 0, a = h.length; u < a; u++) {
-            const c = h[u];
-            e = e + (c.version << s) + c.node.id | 0;
-          }
-        }
-      }
-    }
-    this._depsHash = e;
+    this._depsHash = this._calculateHash(!1);
   }
   isDirtyFast() {
-    const t = this._count, s = q.VERSION_BITS;
-    let e = 0;
-    switch (t) {
-      case 0:
-        return !1;
-      case 1: {
-        const i = this._s0.node;
-        e = e + (i.version << s) + i.id | 0;
-        break;
-      }
-      case 2: {
-        const i = this._s0.node, n = this._s1.node;
-        e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0;
-        break;
-      }
-      case 3: {
-        const i = this._s0.node, n = this._s1.node, r = this._s2.node;
-        e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0, e = e + (r.version << s) + r.id | 0;
-        break;
-      }
-      default: {
-        const i = this._s0.node, n = this._s1.node, r = this._s2.node, o = this._s3.node;
-        if (e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0, e = e + (r.version << s) + r.id | 0, e = e + (o.version << s) + o.id | 0, t > 4) {
-          const h = this._overflow;
-          for (let u = 0, a = h.length; u < a; u++) {
-            const c = h[u].node;
-            e = e + (c.version << s) + c.id | 0;
+    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;
           }
         }
       }
     }
-    return e !== this._depsHash;
+    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, this._map !== null && (this._map.clear(), this._map = null);
+    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.");
@@ -721,47 +778,63 @@ var k = class extends et {
   compact() {
   }
 };
-function St(t) {
-  return t !== null && typeof t == "object" && $ in t;
+function At(t) {
+  return typeof t == "object" && t !== null && V in t;
 }
-function gt(t) {
-  return t !== null && typeof t == "object" && rt in t;
+function Ot(t) {
+  return typeof t == "object" && t !== null && rt in t;
 }
-function mt(t) {
-  return t !== null && typeof t == "object" && ot in t;
+function bt(t) {
+  return typeof t == "object" && t !== null && ot in t;
 }
 function ht(t) {
-  return t !== null && typeof t == "object" && typeof t.then == "function";
+  return typeof t == "object" && t !== null && typeof t.then == "function";
 }
-var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, RECOMPUTING: O, DISPOSED: M, IS_COMPUTED: P, FORCE_COMPUTE: B } = x, pt = class extends V {
+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 {
   constructor(t, s = {}) {
-    if (typeof t != "function") throw new S(l.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this[$] = !0, this[rt] = !0, this._error = null, this._promiseId = 0, this._deps = new k(), this._asyncRetryCount = 0, this._lastDriftEpoch = C.UNINITIALIZED, this._trackEpoch = C.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = P | E | I, this._equal = s.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in s ? s.defaultValue : U, this._onError = s.onError ?? null, this._maxAsyncRetries = (s.maxAsyncRetries ?? j.MAX_ASYNC_RETRIES) & G, X.attachDebugInfo(this, "computed", this.id), s.lazy === !1) try {
+    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 {
       this._recompute();
     } catch {
     }
   }
+  get isDirty() {
+    return (this.flags & E) !== 0;
+  }
+  get isRejected() {
+    return (this.flags & D) !== 0;
+  }
+  get isRecomputing() {
+    return (this.flags & y) !== 0;
+  }
+  get _hasErrorInternal() {
+    return (this.flags & O) !== 0;
+  }
   _track() {
     _.current?.addDependency(this);
   }
   get value() {
-    this._track();
-    const t = this.flags;
-    if ((t & (p | E | I)) === p) return this._value;
-    if (t & M) throw new S(l.COMPUTED_DISPOSED);
-    if (t & O) {
-      if (this._defaultValue !== U) return this._defaultValue;
-      throw new S(l.COMPUTED_CIRCULAR_DEPENDENCY);
+    const t = _.current;
+    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) {
+      const r = this._defaultValue;
+      if (r !== P) return r;
+      throw new S(c.COMPUTED_CIRCULAR_DEPENDENCY);
     }
-    if (t & (E | I) && ((t & I) === 0 && (t & B) === 0 && this._deps.size > 0 && !this._isDirty() ? this.flags &= ~E : this._recompute(), this.flags & p))
-      return this._value;
-    const s = this._defaultValue, e = s !== U;
-    if (this.flags & g) {
-      if (e) return s;
-      throw new S(l.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+    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 (this.flags & v) {
-      if (e) return s;
+    const e = this._defaultValue, i = e !== P;
+    if ((s & g) !== 0) {
+      if (i) return e;
+      throw new S(c.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+    }
+    if ((s & D) !== 0) {
+      if (i) return e;
       throw this._error;
     }
     return this._value;
@@ -770,78 +843,83 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
     return this._value;
   }
   get state() {
-    this._track();
-    const t = this.flags;
-    return t & p ? b.RESOLVED : t & g ? b.PENDING : t & v ? b.REJECTED : b.IDLE;
+    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;
   }
   get hasError() {
-    if (this._track(), this.flags & (v | N)) return !0;
-    const t = this._deps;
-    if (!t.hasComputeds) return !1;
-    const s = t.size;
-    for (let e = 0; e < s; e++) {
-      const i = t.getAt(e);
-      if (i != null && i.node.flags & N) return !0;
-    }
+    const t = _.current;
+    if (t?.addDependency(this), (this.flags & (D | O)) !== 0) return !0;
+    const s = this._deps;
+    if (!s.hasComputeds) return !1;
+    const e = s.size;
+    for (let i = 0; i < e; i++) if (s.getAt(i)?.node.hasError) return !0;
     return !1;
   }
   get isValid() {
     return !this.hasError;
   }
   get errors() {
-    this._track();
-    const t = [];
-    this._error && t.push(this._error);
-    const s = this._deps;
-    if (!s.hasComputeds) return t.length === 0 ? W : Object.freeze(t);
-    const e = s.size;
-    for (let i = 0; i < e; i++) {
-      const n = s.getAt(i);
-      if (n == null) continue;
-      const r = n.node;
-      r.flags & N && this._collectErrorsFromDep(r, t);
+    const t = _.current;
+    t?.addDependency(this);
+    const s = this._error, e = this._deps;
+    if (!e.hasComputeds)
+      return s == null ? W : Object.freeze([s]);
+    const i = [];
+    s != null && i.push(s);
+    const r = e.size;
+    for (let n = 0; n < r; n++) {
+      const o = e.getAt(n);
+      if (o == null) continue;
+      const u = o.node;
+      (u.flags & b) !== 0 && u.hasError && this._collectErrorsFromDep(u, i);
     }
-    return t.length === 0 ? W : Object.freeze(t);
+    return i.length === 0 ? W : Object.freeze(i);
   }
   _collectErrorsFromDep(t, s) {
     const e = t.errors, i = e.length;
-    for (let n = 0; n < i; n++) {
-      const r = e[n];
-      r != null && !s.includes(r) && s.push(r);
+    for (let r = 0; r < i; r++) {
+      const n = e[r];
+      n != null && !s.includes(n) && s.push(n);
     }
   }
   get lastError() {
-    return this._track(), this._error;
+    const t = _.current;
+    return t?.addDependency(this), this._error;
   }
   get isPending() {
-    return this._track(), (this.flags & g) !== 0;
+    const t = _.current;
+    return t?.addDependency(this), (this.flags & g) !== 0;
   }
   get isResolved() {
-    return this._track(), (this.flags & p) !== 0;
+    const t = _.current;
+    return t?.addDependency(this), (this.flags & d) !== 0;
   }
   invalidate() {
     this.flags |= B, this._markDirty();
   }
   dispose() {
-    this.flags & M || (this._deps.disposeAll(), this._slots?.clear(), this.flags = M | E | I, this._error = null, this._value = void 0, this._hotIndex = -1);
+    (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);
   }
   [Symbol.dispose]() {
     this.dispose();
   }
   addDependency(t) {
-    if (t._lastSeenEpoch === this._trackEpoch) return;
-    t._lastSeenEpoch = this._trackEpoch;
-    const s = this._trackCount, e = this._deps.getAt(s);
-    if (e != null && e.node === t) e.version = t.version;
-    else if (!this._deps.claimExisting(t, s)) {
-      const i = new H(t, t.version, t.subscribe(this));
-      this._deps.insertNew(s, i);
+    const s = this._trackEpoch;
+    if (t._lastSeenEpoch === s) return;
+    t._lastSeenEpoch = s;
+    const e = this._trackCount++, i = this._deps, r = i.getAt(e);
+    if (r != null && r.node === t) r.version = t.version;
+    else if (!i.claimExisting(t, e)) {
+      const n = new z(t, t.version, t.subscribe(this));
+      i.insertNew(e, n);
     }
-    t.flags & P && (this._deps.hasComputeds = !0), this._trackCount = s + 1;
+    (t.flags & b) !== 0 && (i.hasComputeds = !0);
   }
   _recompute() {
-    if (this.flags & O) return;
-    this.flags = (this.flags | O) & ~B, this._trackEpoch = Q(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
+    if (this.isRecomputing) return;
+    this.flags = (this.flags | y) & ~B, this._trackEpoch = Y(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
     let t = !1;
     try {
       const s = _.run(this, this._fn);
@@ -851,42 +929,44 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
         this._deps.truncateFrom(this._trackCount);
       } catch {
       }
-      this._handleError(s, l.COMPUTED_COMPUTATION_FAILED, !0);
+      this._handleError(s, c.COMPUTED_COMPUTATION_FAILED, !0);
     } finally {
-      this._trackEpoch = C.UNINITIALIZED, this._trackCount = 0, this.flags &= ~O;
+      this._trackEpoch = T.UNINITIALIZED, this._trackCount = 0, this.flags &= ~y;
     }
   }
   _handleAsyncComputation(t) {
-    this.flags = (this.flags | g) & ~(I | E | p | v), this._notifySubscribers(void 0, void 0), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % j.MAX_PROMISE_ID;
+    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;
     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.`), l.COMPUTED_ASYNC_COMPUTATION_FAILED);
+          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);
         }
         this._finalizeResolution(e), this._notifySubscribers(e, void 0);
       }
-    }, (e) => s === this._promiseId && this._handleError(e, l.COMPUTED_ASYNC_COMPUTATION_FAILED));
+    }, (e) => s === this._promiseId && this._handleError(e, c.COMPUTED_ASYNC_COMPUTATION_FAILED));
   }
   _handleError(t, s, e = !1) {
-    const i = T(t, S, s);
-    if (!e && !(this.flags & v) && (this.version = z(this.version)), this._error = i, this.flags = this.flags & ~(I | E | g | p) | v | N, this._onError) try {
+    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 {
       this._onError(i);
-    } catch (n) {
-      console.error(l.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
+    } catch (r) {
+      console.error(c.CALLBACK_ERROR_IN_ERROR_HANDLER, r);
     }
     if (e) throw i;
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(t) {
-    (!(this.flags & p) || !this._equal(this._value, t)) && (this.version = z(this.version)), this._value = t, this._error = null, this.flags = (this.flags | p) & ~(I | E | g | v | N);
+    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);
   }
   execute() {
     this._markDirty();
   }
   _markDirty() {
-    this.flags & (O | E) || (this.flags |= E, this._notifySubscribers(void 0, void 0));
+    const t = this.flags;
+    (t & (y | E)) === 0 && (this.flags = t | E, this._notifySubscribers(void 0, void 0));
   }
   _isDirty() {
     const t = this._deps;
@@ -898,14 +978,14 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
     try {
       const e = t.size;
       for (let i = 0; i < e; i++) {
-        const n = t.getAt(i);
-        if (n == null) continue;
-        const r = n.node;
-        if (r.flags & P) try {
-          r.value;
+        const r = t.getAt(i);
+        if (r == null) continue;
+        const n = r.node;
+        if ((n.flags & b) !== 0) try {
+          n.value;
         } catch {
         }
-        if (r.version !== n.version)
+        if (n.version !== r.version)
           return this._hotIndex = i, !0;
       }
       return this._hotIndex = -1, !1;
@@ -914,64 +994,81 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
     }
   }
 };
-function Tt(t, s = {}) {
-  return new pt(t, s);
+function Rt(t, s = {}) {
+  return new gt(t, s);
 }
-var It = class extends V {
+var Tt = class extends Q {
   constructor(t, s = {}) {
-    super(), this[ot] = !0, this._cleanup = null, this._deps = new k(), this._currentEpoch = C.UNINITIALIZED, this._lastFlushEpoch = C.UNINITIALIZED, this._fn = t, this._onError = s.onError ?? null, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? m.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? m.MAX_EXECUTIONS_PER_EFFECT, this._cleanup = null, this._deps = new k(), this._currentEpoch = C.UNINITIALIZED, this._lastFlushEpoch = C.UNINITIALIZED, 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 = () => y.schedule(this), X.attachDebugInfo(this, "effect", this.id);
+    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);
   }
   run() {
-    if (this.flags & f.DISPOSED) throw new D(l.EFFECT_DISPOSED);
+    if (this.isDisposed) throw new v(c.EFFECT_DISPOSED);
     this.execute(!0);
   }
   dispose() {
-    this.flags & f.DISPOSED || (this.flags |= f.DISPOSED, this._execCleanup(), this._deps?.disposeAll());
+    this.isDisposed || (this.flags |= I.DISPOSED, this._execCleanup(), this._deps?.disposeAll());
   }
   [Symbol.dispose]() {
     this.dispose();
   }
   addDependency(t) {
-    if (!(this.flags & f.EXECUTING)) return;
+    if ((this.flags & I.EXECUTING) === 0) return;
     const s = this._currentEpoch;
     if (t._lastSeenEpoch === s) return;
     t._lastSeenEpoch = s;
-    const e = this._trackCount, i = this._deps;
-    let n;
-    e === 0 ? n = i._s0 : e === 1 ? n = i._s1 : e === 2 ? n = i._s2 : e === 3 ? n = i._s3 : n = i.getAt(e), n != null && n.node === t ? n.version = t.version : i.claimExisting(t, e) || this._insertNewDependency(t, e), t.flags & x.IS_COMPUTED && (i.hasComputeds = !0), this._trackCount = e + 1;
+    const e = this._trackCount++, i = this._deps;
+    let r;
+    switch (e) {
+      case 0:
+        r = i._s0;
+        break;
+      case 1:
+        r = i._s1;
+        break;
+      case 2:
+        r = i._s2;
+        break;
+      case 3:
+        r = i._s3;
+        break;
+      default:
+        r = i.getAt(e);
+    }
+    r != null && r.node === t ? r.version = t.version : i.claimExisting(t, e) || this._insertNewDependency(t, e), t.isComputed && (i.hasComputeds = !0);
   }
   _insertNewDependency(t, s) {
     let e;
     try {
       const i = t.subscribe(this._notifyCallback);
-      e = new H(t, t.version, i);
+      e = new z(t, t.version, i);
     } catch (i) {
-      const n = T(i, D, l.EFFECT_EXECUTION_FAILED);
-      if (console.error(n), this._onError) try {
-        this._onError(n);
+      const r = m(i, v, c.EFFECT_EXECUTION_FAILED);
+      if (console.error(r), this._onError) try {
+        this._onError(r);
       } catch {
       }
-      e = new H(t, t.version, void 0);
+      e = new z(t, t.version, void 0);
     }
     this._deps.insertNew(s, e);
   }
   execute(t = !1) {
-    if (this.flags & (f.DISPOSED | f.EXECUTING)) return;
-    const s = this._deps;
-    if (!t && s.size > 0 && !this._isDirty()) return;
-    this._checkInfiniteLoops(), this.flags |= f.EXECUTING, this._execCleanup(), this._currentEpoch = Q(), this._trackCount = 0, s.prepareTracking(), this._hotIndex = -1;
-    let e = !1;
+    const s = this.flags;
+    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;
+    let i = !1;
     try {
-      const i = _.run(this, this._fn);
-      s.truncateFrom(this._trackCount), s.seal(), e = !0, ht(i) ? this._handleAsyncResult(i) : this._cleanup = typeof i == "function" ? i : null;
-    } catch (i) {
-      if (!e) try {
-        s.truncateFrom(this._trackCount);
+      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;
+    } catch (r) {
+      if (!i) try {
+        e.truncateFrom(this._trackCount);
       } catch {
       }
-      this._handleExecutionError(i), this._cleanup = null;
+      this._handleExecutionError(r), this._cleanup = null;
     } finally {
-      this.flags &= ~f.EXECUTING;
+      this.flags &= ~I.EXECUTING;
     }
   }
   _isDirty() {
@@ -981,11 +1078,11 @@ var It = class extends V {
   _handleAsyncResult(t) {
     const s = ++this._execId;
     t.then((e) => {
-      if (s !== this._execId || this.flags & f.DISPOSED) {
+      if (s !== this._execId || this.isDisposed) {
         if (typeof e == "function") try {
           e();
         } catch (i) {
-          this._handleExecutionError(i, l.EFFECT_CLEANUP_FAILED);
+          this._handleExecutionError(i, c.EFFECT_CLEANUP_FAILED);
         }
         return;
       }
@@ -999,10 +1096,10 @@ var It = class extends V {
     try {
       const e = s.size;
       for (let i = 0; i < e; i++) {
-        const n = s.getAt(i);
-        if (n == null) continue;
-        const r = n.node;
-        if (r.flags & x.IS_COMPUTED && this._tryPullComputed(r), r.version !== n.version)
+        const r = s.getAt(i);
+        if (r == null) continue;
+        const n = r.node;
+        if (n.isComputed && this._tryPullComputed(n), n.version !== r.version)
           return this._hotIndex = i, !0;
       }
       return !1;
@@ -1017,18 +1114,19 @@ var It = class extends V {
     }
   }
   _execCleanup() {
-    if (this._cleanup) {
+    const t = this._cleanup;
+    if (t != null) {
+      this._cleanup = null;
       try {
-        this._cleanup();
-      } catch (t) {
-        this._handleExecutionError(t, l.EFFECT_CLEANUP_FAILED);
+        t();
+      } catch (s) {
+        this._handleExecutionError(s, c.EFFECT_CLEANUP_FAILED);
       }
-      this._cleanup = null;
     }
   }
   _checkInfiniteLoops() {
     const t = nt();
-    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), ft() > m.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
+    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++;
   }
   _checkFrequencyLimit() {
     if (!Number.isFinite(this._maxExecutions)) return;
@@ -1038,64 +1136,62 @@ var It = class extends V {
       return;
     }
     if (++this._windowCount > this._maxExecutions) {
-      const s = new D(l.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
+      const s = new v(c.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
       throw this.dispose(), this._handleExecutionError(s), s;
     }
   }
-  get isDisposed() {
-    return (this.flags & f.DISPOSED) !== 0;
-  }
   get executionCount() {
     return this._executionCount;
   }
   get isExecuting() {
-    return (this.flags & f.EXECUTING) !== 0;
+    return (this.flags & I.EXECUTING) !== 0;
   }
   _throwInfiniteLoopError(t) {
-    const s = new D(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${Y}`);
+    const s = new v(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${k}`);
     throw this.dispose(), console.error(s), s;
   }
-  _handleExecutionError(t, s = l.EFFECT_EXECUTION_FAILED) {
-    const e = T(t, D, s);
+  _handleExecutionError(t, s = c.EFFECT_EXECUTION_FAILED) {
+    const e = m(t, v, s);
     if (console.error(e), this._onError) try {
       this._onError(e);
     } catch (i) {
-      console.error(T(i, D, l.CALLBACK_ERROR_IN_ERROR_HANDLER));
+      console.error(m(i, v, c.CALLBACK_ERROR_IN_ERROR_HANDLER));
     }
   }
 };
-function At(t, s = {}) {
-  if (typeof t != "function") throw new D(l.EFFECT_MUST_BE_FUNCTION);
-  const e = new It(t, s);
+function Ft(t, s = {}) {
+  if (typeof t != "function") throw new v(c.EFFECT_MUST_BE_FUNCTION);
+  const e = new Tt(t, s);
   return e.execute(), e;
 }
-function Nt(t) {
-  if (typeof t != "function") throw new TypeError(l.BATCH_CALLBACK_MUST_BE_FUNCTION);
-  y.startBatch();
+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 {
-    y.endBatch();
+    s.endBatch();
   }
 }
 export {
-  b as AsyncState,
-  A as AtomError,
+  A as AsyncState,
+  N as AtomError,
   S as ComputedError,
   st as DEBUG_CONFIG,
-  X as DEBUG_RUNTIME,
-  D as EffectError,
-  m as SCHEDULER_CONFIG,
-  R as SchedulerError,
-  Dt as atom,
-  Nt as batch,
-  Tt as computed,
-  At as effect,
-  St as isAtom,
-  gt as isComputed,
-  mt as isEffect,
-  y as scheduler,
-  vt as untracked
+  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
 };
 
 //# sourceMappingURL=index.mjs.map