@but212/atom-effect 0.18.0 → 0.19.1

package/dist/index.mjs

@@ -1,17 +1,19 @@
-const et = {
+const tt = {
   ONE_SECOND_MS: 1e3
-}, R = {
+}, k = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, M = {
+}, w = {
   DISPOSED: 1
-}, a = {
-  ...M,
+}, l = {
+  ...w,
   EXECUTING: 8
 }, o = {
-  ...M,
+  ...w,
+  /** Marker bit: identifies this node as a computed. */
+  IS_COMPUTED: 2,
   DIRTY: 8,
   IDLE: 16,
   PENDING: 32,
@@ -20,12 +22,13 @@ const et = {
   RECOMPUTING: 256,
   HAS_ERROR: 512
 }, d = {
-  ...M,
+  ...w,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, Et = {
+}, It = {
   MAX_SIZE: 1e3,
-  WARMUP_SIZE: 100
+  WARMUP_SIZE: 100,
+  ENABLE_STATS: !1
 }, I = {
   // Infinite loop protection
   MAX_EXECUTIONS_PER_SECOND: 1e3,
@@ -37,32 +40,31 @@ const et = {
   // Memory management
   CLEANUP_THRESHOLD: 1e3,
   BATCH_QUEUE_SHRINK_THRESHOLD: 1e3
-}, V = {
-  MAX_DEPENDENCIES: 1e3,
+}, et = {
   WARN_INFINITE_LOOP: !0
-}, C = 1073741823, u = typeof process < "u" && process.env && process.env.NODE_ENV !== "production" || typeof __DEV__ < "u" && !!__DEV__, st = Object.freeze([]);
-class O extends Error {
+}, y = 1073741823, _ = typeof process < "u" && process.env && process.env.NODE_ENV !== "production" || typeof __DEV__ < "u" && !!__DEV__, st = Object.freeze([]);
+class T extends Error {
   constructor(t, e = null, s = !0) {
     super(t), this.cause = e, this.recoverable = s, this.timestamp = /* @__PURE__ */ new Date(), this.name = "AtomError";
   }
 }
-class p extends O {
+class p extends T {
   constructor(t, e = null) {
     super(t, e, !0), this.name = "ComputedError";
   }
 }
-class S extends O {
+class S extends T {
   constructor(t, e = null) {
     super(t, e, !1), this.name = "EffectError";
   }
 }
-class b extends O {
+class b extends T {
   constructor(t, e = null) {
     super(t, e, !1), this.name = "SchedulerError";
   }
 }
-const z = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), it = /* @__PURE__ */ Symbol("AtomEffect.Id"), G = /* @__PURE__ */ Symbol("AtomEffect.Type"), L = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), nt = (i) => "dependencies" in i && Array.isArray(i.dependencies);
-function q(i, t, e) {
+const z = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), it = /* @__PURE__ */ Symbol("AtomEffect.Id"), G = /* @__PURE__ */ Symbol("AtomEffect.Type"), x = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), nt = (i) => "dependencies" in i && Array.isArray(i.dependencies);
+function Q(i, t, e) {
   if (i === t)
     throw new p(
       "Circular dependency detected: The computation refers to itself explicitly or implicitly."
@@ -71,25 +73,24 @@ function q(i, t, e) {
     const s = i.dependencies;
     for (let n = 0; n < s.length; n++) {
       const r = s[n];
-      r && q(r, t, e);
+      r && Q(r, t, e);
     }
   }
 }
 const g = {
   // Dev mode flag
-  enabled: u,
-  maxDependencies: V.MAX_DEPENDENCIES,
-  warnInfiniteLoop: V.WARN_INFINITE_LOOP,
+  enabled: _,
+  warnInfiniteLoop: et.WARN_INFINITE_LOOP,
   warn(i, t) {
-    u && this.enabled && i && console.warn(`[Atom Effect] ${t}`);
+    _ && this.enabled && i && console.warn(`[Atom Effect] ${t}`);
   },
   checkCircular(i, t) {
     if (i === t)
       throw new p("Direct circular dependency detected");
-    u && this.enabled && q(i, t, /* @__PURE__ */ new Set());
+    _ && this.enabled && Q(i, t, /* @__PURE__ */ new Set());
   },
   attachDebugInfo(i, t, e) {
-    if (!u || !this.enabled) return;
+    if (!_ || !this.enabled) return;
     const s = i;
     s[z] = `${t}_${e}`, s[it] = e, s[G] = t;
   },
@@ -105,7 +106,7 @@ function j(i, t, e) {
       const c = e[r];
       if (c && c.fn === n) return;
     }
-    e.push(new F(n, void 0));
+    e.push(new P(n, void 0));
     return;
   }
   if ("addDependency" in t) {
@@ -117,38 +118,34 @@ function j(i, t, e) {
     const h = e[n];
     if (h && h.sub === s) return;
   }
-  e.push(new F(void 0, s));
+  e.push(new P(void 0, s));
 }
 function ht(i, t, e) {
-  for (let s = 0, n = t.length; s < n; s++) {
-    const r = t[s];
-    r && (r.node._tempUnsub = r.unsub);
-  }
-  for (let s = 0, n = i.length; s < n; s++) {
-    const r = i[s];
-    if (!r) continue;
-    const h = r.node;
-    h._tempUnsub !== void 0 ? (r.unsub = h._tempUnsub, h._tempUnsub = void 0) : (g.checkCircular(h, e), r.unsub = h.subscribe(e));
-  }
-  for (let s = 0, n = t.length; s < n; s++) {
-    const r = t[s];
-    if (r) {
-      const h = r.node;
-      h._tempUnsub !== void 0 && (h._tempUnsub(), h._tempUnsub = void 0), r.unsub = void 0;
-    }
-  }
+  const s = /* @__PURE__ */ new Map();
+  for (let n = 0, r = t.length; n < r; n++) {
+    const h = t[n];
+    h?.unsub && (s.set(h.node, h.unsub), h.unsub = void 0);
+  }
+  for (let n = 0, r = i.length; n < r; n++) {
+    const h = i[n];
+    if (!h) continue;
+    const c = h.node, E = s.get(c);
+    E !== void 0 ? (h.unsub = E, s.delete(c)) : (g.checkCircular(c, e), h.unsub = c.subscribe(e));
+  }
+  for (const n of s.values())
+    n();
 }
-class k {
+class R {
   constructor(t, e, s = void 0) {
     this.node = t, this.version = e, this.unsub = s;
   }
 }
-class F {
+class P {
   constructor(t, e) {
     this.fn = t, this.sub = e;
   }
 }
-const _ = {
+const u = {
   // Computed Errors
   COMPUTED_MUST_BE_FUNCTION: "Computed target must be a function",
   COMPUTED_ASYNC_PENDING_NO_DEFAULT: "Async computation pending with no default value",
@@ -164,10 +161,15 @@ const _ = {
   EFFECT_EXECUTION_FAILED: "Effect execution failed",
   EFFECT_CLEANUP_FAILED: "Effect cleanup failed",
   EFFECT_DISPOSED: "Attempted to run disposed effect",
-  CALLBACK_ERROR_IN_ERROR_HANDLER: "Exception encountered in onError handler"
+  // Scheduler Errors
+  SCHEDULER_FLUSH_OVERFLOW: (i, t) => `Maximum flush iterations (${i}) exceeded. ${t} jobs dropped. Possible infinite loop.`,
+  // System / Debug
+  CALLBACK_ERROR_IN_ERROR_HANDLER: "Exception encountered in onError handler",
+  // Effect frequency
+  EFFECT_FREQUENCY_LIMIT_EXCEEDED: "Effect executed too frequently within 1 second. Suspected infinite loop."
 };
-function T(i, t, e) {
-  if (i instanceof O)
+function C(i, t, e) {
+  if (i instanceof T)
     return i;
   const s = i instanceof Error, n = s ? i.message : String(i), r = s ? i : void 0;
   let h = "Unexpected error";
@@ -175,31 +177,31 @@ function T(i, t, e) {
   const c = `${h} (${e}): ${n}`;
   return new t(c, r);
 }
-class $ {
+class q {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this._modifiedAtEpoch = -1, this.id = ot() & C, this._tempUnsub = void 0;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this._modifiedAtEpoch = -1, this.id = ot() & y;
   }
 }
-class J extends $ {
+class $ extends q {
   /**
    * Adds subscriber.
    */
   subscribe(t) {
     const e = typeof t == "function";
     if (!e && (!t || typeof t.execute != "function"))
-      throw T(
+      throw C(
         new TypeError("Invalid subscriber"),
-        O,
-        _.ATOM_SUBSCRIBER_MUST_BE_FUNCTION
+        T,
+        u.ATOM_SUBSCRIBER_MUST_BE_FUNCTION
       );
     const s = this._subscribers;
     for (let r = 0, h = s.length; r < h; r++) {
       const c = s[r];
       if (c && (e ? c.fn === t : c.sub === t))
-        return u && console.warn("Duplicate subscription ignored."), () => {
+        return _ && console.warn("Duplicate subscription ignored."), () => {
         };
     }
-    const n = new F(
+    const n = new P(
       e ? t : void 0,
       e ? void 0 : t
     );
@@ -216,7 +218,7 @@ class J extends $ {
   }
   _notifySubscribers(t, e) {
     if (this._subscribers.length === 0) return;
-    const s = [...this._subscribers], n = s.length;
+    const s = this._subscribers.slice(0), n = s.length;
     for (let r = 0; r < n; r++) {
       const h = s[r];
       if (h)
@@ -228,140 +230,134 @@ class J extends $ {
     }
   }
   _handleNotifyError(t) {
-    console.error(T(t, O, _.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+    console.error(C(t, T, u.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
   }
 }
-let y = 0;
-const K = () => (y = y + 1 & C || 1, y), ct = () => y;
-let P = 0, v = 0, A = !1;
-function X() {
-  return A ? (u && console.warn("startFlush() called during flush - ignored"), !1) : (A = !0, P = P + 1 & C || 1, v = 0, !0);
+let A = 0;
+const J = () => (A = A + 1 & y || 1, A), ct = () => A, v = (i) => i + 1 & y;
+let M = 0, B = 0, L = !1;
+function H() {
+  return L ? (_ && console.warn("startFlush() called during flush - ignored"), !1) : (L = !0, M = M + 1 & y || 1, B = 0, !0);
 }
-const H = () => {
-  A = !1;
-}, ut = () => A ? ++v : 0, f = {
-  /** Queue buffer */
-  _queueBuffer: [[], []],
-  _bufferIndex: 0,
-  _size: 0,
-  /** Epoch counter */
-  _epoch: 0,
-  /** State flags */
-  _isProcessing: !1,
-  _isBatching: !1,
-  _isFlushingSync: !1,
-  /** Batching state */
-  _batchDepth: 0,
-  _batchQueue: [],
-  _batchQueueSize: 0,
-  /** Config */
-  _maxFlushIterations: I.MAX_FLUSH_ITERATIONS,
+const X = () => {
+  L = !1;
+}, ut = () => L ? ++B : 0;
+class _t {
+  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 = I.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
+  }
   get phase() {
     return this._isProcessing || this._isFlushingSync ? 2 : this._isBatching ? 1 : 0;
-  },
+  }
   get queueSize() {
     return this._size;
-  },
+  }
   get isBatching() {
     return this._isBatching;
-  },
+  }
   /**
    * Schedules job.
    */
-  schedule(i) {
-    if (u && typeof i != "function")
+  schedule(t) {
+    if (_ && typeof t != "function")
       throw new b("Scheduler callback must be a function");
-    if (i._nextEpoch !== this._epoch) {
-      if (i._nextEpoch = this._epoch, this._isBatching || this._isFlushingSync) {
-        this._batchQueue[this._batchQueueSize++] = i;
+    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++] = i, this._isProcessing || this._flush();
+      this._queueBuffer[this._bufferIndex][this._size++] = t, this._isProcessing || this._flush();
     }
-  },
+  }
   /**
    * Triggers flush.
    */
   _flush() {
-    this._isProcessing || this._size === 0 || (this._isProcessing = !0, queueMicrotask(this._runLoop));
-  },
+    this._isProcessing || this._size === 0 || (this._isProcessing = !0, queueMicrotask(this._boundRunLoop));
+  }
   /**
    * Scheduler loop.
    */
-  _runLoop: () => {
+  _runLoop() {
     try {
-      if (f._size === 0) return;
-      const i = X();
-      f._drainQueue(), i && H();
+      if (this._size === 0) return;
+      const t = H();
+      this._drainQueue(), t && X();
     } finally {
-      f._isProcessing = !1, f._size > 0 && !f._isBatching && f._flush();
+      this._isProcessing = !1, this._size > 0 && !this._isBatching && this._flush();
     }
-  },
+  }
   _flushSync() {
     this._isFlushingSync = !0;
-    const i = X();
+    const t = H();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this._isFlushingSync = !1, i && H();
+      this._isFlushingSync = !1, t && X();
     }
-  },
+  }
   _mergeBatchQueue() {
     if (this._batchQueueSize === 0) return;
-    const i = ++this._epoch, t = this._batchQueue, e = this._queueBuffer[this._bufferIndex];
-    let s = this._size;
-    for (let n = 0; n < this._batchQueueSize; n++) {
-      const r = t[n];
-      r._nextEpoch !== i && (r._nextEpoch = i, e[s++] = r);
+    const t = ++this._epoch, e = this._batchQueue, s = this._queueBuffer[this._bufferIndex];
+    let n = this._size;
+    for (let r = 0; r < this._batchQueueSize; r++) {
+      const h = e[r];
+      h._nextEpoch !== t && (h._nextEpoch = t, s[n++] = h);
     }
-    this._size = s, this._batchQueueSize = 0, t.length > I.BATCH_QUEUE_SHRINK_THRESHOLD && (t.length = 0);
-  },
+    this._size = n, this._batchQueueSize = 0, e.length > I.BATCH_QUEUE_SHRINK_THRESHOLD && (e.length = 0);
+  }
   _drainQueue() {
-    let i = 0;
+    let t = 0;
     for (; this._size > 0; ) {
-      if (++i > this._maxFlushIterations) {
+      if (++t > this._maxFlushIterations) {
         this._handleFlushOverflow();
         return;
       }
       this._processQueue(), this._mergeBatchQueue();
     }
-  },
+  }
   _processQueue() {
-    const i = this._bufferIndex, t = this._queueBuffer[i], e = this._size;
-    this._bufferIndex = i ^ 1, this._size = 0, this._epoch++;
-    for (let s = 0; s < e; s++)
+    const t = this._bufferIndex, e = this._queueBuffer[t], s = this._size;
+    this._bufferIndex = t ^ 1, this._size = 0, this._epoch++;
+    for (let n = 0; n < s; n++)
       try {
-        t[s]();
-      } catch (n) {
-        console.error(new b("Error occurred during scheduler execution", n));
+        e[n]();
+      } catch (r) {
+        console.error(new b("Error occurred during scheduler execution", r));
       }
-    t.length = 0;
-  },
+    e.length = 0;
+  }
   _handleFlushOverflow() {
-    console.error(
+    const t = this._size + this._batchQueueSize;
+    if (console.error(
       new b(
-        `Maximum flush iterations (${this._maxFlushIterations}) exceeded. Possible infinite loop.`
+        u.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t)
       )
-    ), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0;
-  },
+    ), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow)
+      try {
+        this.onOverflow(t);
+      } catch {
+      }
+  }
   startBatch() {
     this._batchDepth++, this._isBatching = !0;
-  },
+  }
   endBatch() {
     if (this._batchDepth === 0) {
-      u && console.warn("endBatch() called without matching startBatch(). Ignoring.");
+      _ && console.warn("endBatch() called without matching startBatch(). Ignoring.");
       return;
     }
     --this._batchDepth === 0 && (this._flushSync(), this._isBatching = !1);
-  },
-  setMaxFlushIterations(i) {
-    if (i < I.MIN_FLUSH_ITERATIONS)
+  }
+  setMaxFlushIterations(t) {
+    if (t < I.MIN_FLUSH_ITERATIONS)
       throw new b(
         `Max flush iterations must be at least ${I.MIN_FLUSH_ITERATIONS}`
       );
-    this._maxFlushIterations = i;
+    this._maxFlushIterations = t;
   }
-}, E = {
+}
+const O = new _t(), f = {
   /** Active listener. */
   current: null,
   /**
@@ -381,35 +377,35 @@ const H = () => {
     }
   }
 };
-function dt(i) {
-  const t = E.current;
+function Dt(i) {
+  const t = f.current;
   if (t === null) return i();
-  E.current = null;
+  f.current = null;
   try {
     return i();
   } finally {
-    E.current = t;
+    f.current = t;
   }
 }
-class _t extends J {
+class lt extends $ {
   constructor(t, e) {
     super(), this._pendingOldValue = void 0, this._notifyTask = void 0, this._subscribers = [], this._value = t, e && (this.flags |= d.SYNC), g.attachDebugInfo(this, "atom", this.id);
   }
   get value() {
-    const t = E.current;
+    const t = f.current;
     return t && j(this, t, this._subscribers), this._value;
   }
   set value(t) {
     const e = this._value;
     if (Object.is(e, t)) return;
-    this._value = t, this.version = this.version + 1 & C;
+    this._value = t, this.version = v(this.version);
     const s = this.flags;
     if (!(this._subscribers.length === 0 || s & d.NOTIFICATION_SCHEDULED)) {
-      if (this._pendingOldValue = e, this.flags = s | d.NOTIFICATION_SCHEDULED, s & d.SYNC && !f.isBatching) {
+      if (this._pendingOldValue = e, this.flags = s | d.NOTIFICATION_SCHEDULED, s & d.SYNC && !O.isBatching) {
         this._flushNotifications();
         return;
       }
-      this._notifyTask || (this._notifyTask = () => this._flushNotifications()), f.schedule(this._notifyTask);
+      this._notifyTask || (this._notifyTask = () => this._flushNotifications()), O.schedule(this._notifyTask);
     }
   }
   /**
@@ -429,16 +425,17 @@ class _t extends J {
     this.flags & d.DISPOSED || (this._subscribers.length = 0, this.flags |= d.DISPOSED, this._value = void 0, this._pendingOldValue = void 0, this._notifyTask = void 0);
   }
 }
-function pt(i, t = {}) {
-  return new _t(i, t.sync ?? !1);
+function St(i, t = {}) {
+  return new lt(i, t.sync ?? !1);
 }
-class lt {
+class at {
   /**
    * @param limit - Max unique arrays to hold (default: 50). Prevents the pool itself from consuming too much memory.
    * @param capacity - Max length of an array to accept (default: 256).
+   * @param enableStats - Force-enable stats even in production (default: false).
    */
-  constructor(t = 50, e = 256) {
-    this.limit = t, this.capacity = e, this.pool = [], this.stats = u ? {
+  constructor(t = 50, e = 256, s = !1) {
+    this.limit = t, this.capacity = e, this.pool = [], this.stats = null, this.stats = _ || s ? {
       acquired: 0,
       released: 0,
       rejected: { frozen: 0, tooLarge: 0, poolFull: 0 }
@@ -448,7 +445,7 @@ class lt {
    * Acquires array.
    */
   acquire() {
-    return u && this.stats && this.stats.acquired++, this.pool.pop() ?? [];
+    return this.stats && this.stats.acquired++, this.pool.pop() ?? [];
   }
   /**
    * Releases array.
@@ -459,25 +456,25 @@ class lt {
   release(t, e) {
     if (!(e && t === e)) {
       if (t.length > this.capacity) {
-        u && this.stats && this.stats.rejected.tooLarge++;
+        this.stats && this.stats.rejected.tooLarge++;
         return;
       }
       if (this.pool.length >= this.limit) {
-        u && this.stats && this.stats.rejected.poolFull++;
+        this.stats && this.stats.rejected.poolFull++;
         return;
       }
       if (Object.isFrozen(t)) {
-        u && this.stats && this.stats.rejected.frozen++;
+        this.stats && this.stats.rejected.frozen++;
         return;
       }
-      t.length = 0, this.pool.push(t), u && this.stats && this.stats.released++;
+      t.length = 0, this.pool.push(t), this.stats && this.stats.released++;
     }
   }
   /**
    * Pool stats.
    */
   getStats() {
-    if (!u || !this.stats) return null;
+    if (!this.stats) return null;
     const { acquired: t, released: e, rejected: s } = this.stats, n = t - e - (s.frozen + s.tooLarge + s.poolFull);
     return {
       acquired: t,
@@ -491,7 +488,7 @@ class lt {
    * Resets pool.
    */
   reset() {
-    this.pool.length = 0, u && this.stats && (this.stats = {
+    this.pool.length = 0, this.stats && (this.stats = {
       acquired: 0,
       released: 0,
       rejected: { frozen: 0, tooLarge: 0, poolFull: 0 }
@@ -503,35 +500,37 @@ N([]);
 N([]);
 N([]);
 N([]);
-const l = N([]), D = new lt();
-function at(i) {
+const a = N([]), D = new at();
+function ft(i) {
   return i !== null && typeof i == "object" && "value" in i && typeof i.subscribe == "function";
 }
-function It(i) {
-  return at(i) && typeof i.invalidate == "function";
+function gt(i) {
+  return ft(i) && typeof i.invalidate == "function";
 }
-function Dt(i) {
+function Ct(i) {
   return i !== null && typeof i == "object" && typeof i.dispose == "function" && typeof i.run == "function";
 }
-function W(i) {
+function K(i) {
   return i !== null && typeof i == "object" && typeof i.then == "function";
 }
-const Z = o.RESOLVED | o.PENDING | o.REJECTED, m = Array(Z + 1).fill(R.IDLE);
-m[o.RESOLVED] = R.RESOLVED;
-m[o.PENDING] = R.PENDING;
-m[o.REJECTED] = R.REJECTED;
-const Y = 3, Q = Number.MAX_SAFE_INTEGER - 1;
-class tt extends J {
+const W = o.RESOLVED | o.PENDING | o.REJECTED, m = Array(W + 1).fill(k.IDLE);
+m[o.RESOLVED] = k.RESOLVED;
+m[o.PENDING] = k.PENDING;
+m[o.REJECTED] = k.REJECTED;
+const Et = 3, Y = Number.MAX_SAFE_INTEGER - 1, dt = o.REJECTED | o.HAS_ERROR;
+class Z extends $ {
   constructor(t, e = {}) {
-    if (typeof t != "function") throw new p(_.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this._error = null, this._promiseId = 0, this._subscribers = [], this._links = l, this._cachedErrors = null, this._errorCacheEpoch = -1, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._trackEpoch = -1, this._trackLinks = l, this._trackCount = 0, this._value = void 0, this.flags = o.DIRTY | o.IDLE, this._equal = e.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in e ? e.defaultValue : L, this._onError = e.onError ?? null, g.attachDebugInfo(this, "computed", this.id), e.lazy === !1)
+    if (typeof t != "function") throw new p(u.COMPUTED_MUST_BE_FUNCTION);
+    super(), this._error = null, this._promiseId = 0, this._subscribers = [], this._links = a, this._cachedErrors = null, this._errorCacheEpoch = -1, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._errorDepCount = 0, this._trackEpoch = -1, this._trackLinks = a, this._trackCount = 0, this._value = void 0, this.flags = o.IS_COMPUTED | o.DIRTY | o.IDLE, this._equal = e.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in e ? e.defaultValue : x, this._onError = e.onError ?? null;
+    const s = e.maxAsyncRetries;
+    if (this._maxAsyncRetries = s != null && s >= 0 ? s : Et, g.attachDebugInfo(this, "computed", this.id), e.lazy === !1)
       try {
         this._recompute();
       } catch {
       }
   }
   _track() {
-    const t = E.current;
+    const t = f.current;
     t && j(this, t, this._subscribers);
   }
   get value() {
@@ -540,17 +539,17 @@ class tt extends J {
     if ((t & (o.RESOLVED | o.DIRTY | o.IDLE)) === o.RESOLVED)
       return this._value;
     if (t & o.DISPOSED)
-      throw new p(_.COMPUTED_DISPOSED);
+      throw new p(u.COMPUTED_DISPOSED);
     if (t & o.RECOMPUTING) {
-      if (this._defaultValue !== L) return this._defaultValue;
-      throw new p(_.COMPUTED_CIRCULAR_DEPENDENCY);
+      if (this._defaultValue !== x) return this._defaultValue;
+      throw new p(u.COMPUTED_CIRCULAR_DEPENDENCY);
     }
     if (t & (o.DIRTY | o.IDLE) && (this._recompute(), this.flags & o.RESOLVED))
       return this._value;
-    const e = this._defaultValue, s = e !== L;
+    const e = this._defaultValue, s = e !== x;
     if (this.flags & o.PENDING) {
       if (s) return e;
-      throw new p(_.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+      throw new p(u.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
     }
     if (this.flags & o.REJECTED) {
       if (this._error?.recoverable && s) return e;
@@ -562,10 +561,10 @@ class tt extends J {
     return this._value;
   }
   get state() {
-    return this._track(), m[this.flags & Z];
+    return this._track(), m[this.flags & W];
   }
   get hasError() {
-    if (this._track(), this.flags & (o.REJECTED | o.HAS_ERROR)) return !0;
+    if (this._track(), this.flags & (o.REJECTED | o.HAS_ERROR) || this._errorDepCount > 0) return !0;
     const t = this._links;
     for (let e = 0, s = t.length; e < s; e++) {
       const n = t[e]?.node;
@@ -587,12 +586,12 @@ class tt extends J {
     for (let r = 0, h = s.length; r < h; r++) {
       const c = s[r].node;
       if (c.flags & o.HAS_ERROR) {
-        const w = c;
-        if (w.errors) {
-          const B = w.errors;
-          for (let U = 0; U < B.length; U++) {
-            const x = B[U];
-            x && e.indexOf(x) === -1 && e.push(x);
+        const E = c;
+        if (E.errors) {
+          const V = E.errors;
+          for (let F = 0; F < V.length; F++) {
+            const U = V[F];
+            U && e.indexOf(U) === -1 && e.push(U);
           }
         }
       }
@@ -615,12 +614,12 @@ class tt extends J {
   dispose() {
     if (this.flags & o.DISPOSED) return;
     const t = this._links;
-    if (t !== l) {
+    if (t !== a) {
       for (let e = 0, s = t.length; e < s; e++)
         t[e].unsub?.();
-      D.release(t), this._links = l;
+      D.release(t), this._links = a;
     }
-    this._subscribers.length = 0, this.flags = o.DISPOSED | o.DIRTY | o.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % Q, this._cachedErrors = null, this._errorCacheEpoch = -1;
+    this._subscribers.length = 0, this.flags = o.DISPOSED | o.DIRTY | o.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % Y, this._cachedErrors = null, this._errorCacheEpoch = -1;
   }
   addDependency(t) {
     if (t._lastSeenEpoch !== this._trackEpoch) {
@@ -628,70 +627,82 @@ class tt extends J {
         const e = this._trackLinks[this._trackCount];
         e.node = t, e.version = t.version;
       } else
-        this._trackLinks.push(new k(t, t.version));
+        this._trackLinks.push(new R(t, t.version));
       this._trackCount++;
     }
   }
   _commitDeps(t) {
     this._trackLinks.length = this._trackCount, ht(this._trackLinks, t, this), this._links = this._trackLinks;
   }
+  _updateErrorDepCount() {
+    let t = 0;
+    const e = this._links;
+    for (let s = 0, n = e.length; s < n; s++) {
+      const r = e[s]?.node;
+      r && r.flags & o.HAS_ERROR && t++;
+    }
+    this._errorDepCount = t;
+  }
   _recompute() {
     if (this.flags & o.RECOMPUTING) return;
     this.flags |= o.RECOMPUTING;
     const t = this._links;
-    this._trackEpoch = K(), this._trackLinks = D.acquire(), this._trackCount = 0;
+    this._trackEpoch = J(), this._trackLinks = D.acquire(), this._trackCount = 0;
     let e = !1;
     try {
-      const s = E.run(this, this._fn);
-      this._commitDeps(t), e = !0, W(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
+      const s = f.run(this, this._fn);
+      this._commitDeps(t), e = !0, this._updateErrorDepCount(), K(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
     } catch (s) {
       if (!e)
         try {
-          this._commitDeps(t), e = !0;
-        } catch {
+          this._commitDeps(t), e = !0, this._updateErrorDepCount();
+        } catch (n) {
+          _ && console.warn("[atom-effect] _commitDeps failed during error recovery:", n);
         }
-      this._handleError(s, _.COMPUTED_COMPUTATION_FAILED, !0);
+      this._handleError(s, u.COMPUTED_COMPUTATION_FAILED, !0);
     } finally {
-      e && t !== l ? D.release(t) : e || D.release(this._trackLinks), this._trackEpoch = -1, this._trackLinks = l, this._trackCount = 0, this.flags &= -257;
+      e && t !== a ? D.release(t) : e || D.release(this._trackLinks), this._trackEpoch = -1, this._trackLinks = a, this._trackCount = 0, this.flags &= -257;
     }
   }
   _handleAsyncComputation(t) {
-    this.flags = (this.flags | o.PENDING) & -217, this._notifySubscribers(void 0, void 0), this._asyncStartAggregateVersion = this._captureVersionSnapshot(), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % Q;
+    this.flags = (this.flags | o.PENDING) & -217, this._notifySubscribers(void 0, void 0), this._asyncStartAggregateVersion = this._captureVersionSnapshot(), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % Y;
     const e = this._promiseId;
     t.then(
       (s) => {
         if (e === this._promiseId) {
           if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion)
-            return this._asyncRetryCount++ < Y ? this._markDirty() : this._handleError(
-              new p(`Async drift threshold exceeded after ${Y} retries.`),
-              _.COMPUTED_ASYNC_COMPUTATION_FAILED
+            return this._asyncRetryCount++ < this._maxAsyncRetries ? this._markDirty() : this._handleError(
+              new p(
+                `Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`
+              ),
+              u.COMPUTED_ASYNC_COMPUTATION_FAILED
             );
           this._finalizeResolution(s), this._notifySubscribers(s, void 0);
         }
       },
-      (s) => e === this._promiseId && this._handleError(s, _.COMPUTED_ASYNC_COMPUTATION_FAILED)
+      (s) => e === this._promiseId && this._handleError(s, u.COMPUTED_ASYNC_COMPUTATION_FAILED)
     );
   }
   _captureVersionSnapshot() {
     let t = 0;
     const e = this._links;
     for (let s = 0, n = e.length; s < n; s++)
-      t = ((t << 5) - t | 0) + e[s].node.version & C;
+      t = ((t << 5) - t | 0) + e[s].node.version & y;
     return t;
   }
   _handleError(t, e, s = !1) {
-    const n = T(t, p, e);
-    if (!s && !(this.flags & o.REJECTED) && (this.version = this.version + 1 & C), this._error = n, this.flags = this.flags & -121 | (o.REJECTED | o.HAS_ERROR), this._onError)
+    const n = C(t, p, e);
+    if (!s && !(this.flags & o.REJECTED) && (this.version = v(this.version)), this._error = n, this.flags = this.flags & -121 | dt, this._onError)
       try {
         this._onError(n);
       } catch (r) {
-        console.error(_.CALLBACK_ERROR_IN_ERROR_HANDLER, r);
+        console.error(u.CALLBACK_ERROR_IN_ERROR_HANDLER, r);
       }
     if (s) throw n;
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(t) {
-    (!(this.flags & o.RESOLVED) || !this._equal(this._value, t)) && (this.version = this.version + 1 & C), this._value = t, this._error = null, this.flags = (this.flags | o.RESOLVED) & -697, this._cachedErrors = null, this._errorCacheEpoch = -1;
+    (!(this.flags & o.RESOLVED) || !this._equal(this._value, t)) && (this.version = v(this.version)), this._value = t, this._error = null, this.flags = (this.flags | o.RESOLVED) & -697, this._cachedErrors = null, this._errorCacheEpoch = -1;
   }
   execute() {
     this._markDirty();
@@ -701,60 +712,69 @@ class tt extends J {
     this.flags & (o.RECOMPUTING | o.DIRTY) || (this.flags |= o.DIRTY, this._notifySubscribers(void 0, void 0));
   }
 }
-Object.freeze(tt.prototype);
-function St(i, t = {}) {
-  return new tt(i, t);
+Object.freeze(Z.prototype);
+function Tt(i, t = {}) {
+  return new Z(i, t);
 }
-class ft extends $ {
+class pt extends q {
   constructor(t, e = {}) {
-    super(), this._cleanup = null, this._links = l, this._nextLinks = null, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._executionCount = 0, this._historyPtr = 0, this._execId = 0, this._fn = t, this._onError = e.onError ?? null, this._sync = e.sync ?? !1, this._maxExecutions = e.maxExecutionsPerSecond ?? I.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = e.maxExecutionsPerFlush ?? I.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = e.trackModifications ?? !1;
+    super(), this._cleanup = null, this._links = a, this._nextLinks = null, this._parkedUnsubs = null, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._executionCount = 0, this._historyPtr = 0, this._execId = 0, this._fn = t, this._onError = e.onError ?? null, this._sync = e.sync ?? !1, this._maxExecutions = e.maxExecutionsPerSecond ?? I.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = e.maxExecutionsPerFlush ?? I.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = e.trackModifications ?? !1;
     const s = Number.isFinite(this._maxExecutions), n = s ? Math.min(this._maxExecutions + 1, I.MAX_EXECUTIONS_PER_SECOND + 1) : 0;
-    this._historyCapacity = n, this._history = u && s && n > 0 ? new Array(n).fill(0) : null, g.attachDebugInfo(this, "effect", this.id);
+    this._historyCapacity = n, this._history = _ && s && n > 0 ? new Array(n).fill(0) : null, g.attachDebugInfo(this, "effect", this.id);
   }
   run() {
-    if (this.flags & a.DISPOSED)
-      throw new S(_.EFFECT_DISPOSED);
+    if (this.flags & l.DISPOSED)
+      throw new S(u.EFFECT_DISPOSED);
     this.execute(!0);
   }
   dispose() {
-    this.flags & a.DISPOSED || (this.flags |= a.DISPOSED, this._execCleanup(), this._releaseLinks(this._links), this._links = l, this._executeTask = void 0);
+    this.flags & l.DISPOSED || (this.flags |= l.DISPOSED, this._execCleanup(), this._releaseLinks(this._links), this._links = a, this._executeTask = void 0);
   }
   addDependency(t) {
-    if (!(this.flags & a.EXECUTING) || t._lastSeenEpoch === this._currentEpoch) return;
+    if (!(this.flags & l.EXECUTING) || t._lastSeenEpoch === this._currentEpoch) return;
     t._lastSeenEpoch = this._currentEpoch;
-    const e = this._nextLinks;
-    if (t._tempUnsub) {
-      e.push(new k(t, t.version, t._tempUnsub)), t._tempUnsub = void 0;
+    const e = this._nextLinks, s = this._parkedUnsubs?.get(t);
+    if (s) {
+      e.push(new R(t, t.version, s)), this._parkedUnsubs.delete(t);
       return;
     }
     try {
-      const s = t.subscribe(() => {
-        if (this._trackModifications && this.flags & a.EXECUTING && (t._modifiedAtEpoch = this._currentEpoch), this._sync) return this.execute();
-        this._executeTask || (this._executeTask = () => this.execute()), f.schedule(this._executeTask);
+      const n = t.subscribe(() => {
+        if (this._trackModifications && this.flags & l.EXECUTING && (t._modifiedAtEpoch = this._currentEpoch), this._sync) return this.execute();
+        this._executeTask || (this._executeTask = () => this.execute()), O.schedule(this._executeTask);
       });
-      e.push(new k(t, t.version, s));
-    } catch (s) {
-      console.error(T(s, S, _.EFFECT_EXECUTION_FAILED));
+      e.push(new R(t, t.version, n));
+    } catch (n) {
+      const r = C(n, S, u.EFFECT_EXECUTION_FAILED);
+      if (console.error(r), this._onError)
+        try {
+          this._onError(r);
+        } catch {
+        }
+      e.push(new R(t, t.version, void 0));
     }
   }
   /**
    * Executes effect with tracking.
    */
   execute(t = !1) {
-    if (this.flags & (a.DISPOSED | a.EXECUTING) || !t && this._links.length > 0 && !this._isDirty()) return;
-    this._checkInfiniteLoops(), this.flags |= a.EXECUTING, this._execCleanup();
+    if (this.flags & (l.DISPOSED | l.EXECUTING) || !t && this._links.length > 0 && !this._isDirty()) return;
+    this._checkInfiniteLoops(), this.flags |= l.EXECUTING, this._execCleanup();
     const e = this._links;
-    if (e !== l)
-      for (let r = 0, h = e.length; r < h; r++) {
-        const c = e[r];
-        c && (c.node._tempUnsub = c.unsub);
+    if (e !== a) {
+      const r = /* @__PURE__ */ new Map();
+      for (let h = 0, c = e.length; h < c; h++) {
+        const E = e[h];
+        E?.unsub && r.set(E.node, E.unsub);
       }
+      this._parkedUnsubs = r;
+    }
     const s = D.acquire();
-    this._nextLinks = s, this._currentEpoch = K();
+    this._nextLinks = s, this._currentEpoch = J();
     let n = !1;
     try {
-      const r = E.run(this, this._fn);
-      this._links = s, n = !0, this._checkLoopWarnings(), W(r) ? this._handleAsyncResult(r) : this._cleanup = typeof r == "function" ? r : null;
+      const r = f.run(this, this._fn);
+      this._links = s, n = !0, this._checkLoopWarnings(), K(r) ? this._handleAsyncResult(r) : this._cleanup = typeof r == "function" ? r : null;
     } catch (r) {
       n = !0, this._handleExecutionError(r), this._cleanup = null;
     } finally {
@@ -765,12 +785,12 @@ class ft extends $ {
     const e = ++this._execId;
     t.then(
       (s) => {
-        if (e !== this._execId || this.flags & a.DISPOSED) {
+        if (e !== this._execId || this.flags & l.DISPOSED) {
           if (typeof s == "function")
             try {
               s();
             } catch (n) {
-              this._handleExecutionError(n, _.EFFECT_CLEANUP_FAILED);
+              this._handleExecutionError(n, u.EFFECT_CLEANUP_FAILED);
             }
           return;
         }
@@ -781,43 +801,38 @@ class ft extends $ {
   }
   _finalizeDependencies(t, e, s) {
     if (this._nextLinks = null, t) {
-      if (e !== l) {
-        for (let n = 0, r = e.length; n < r; n++) {
-          const h = e[n], c = h?.node._tempUnsub;
-          c && (c(), h && (h.node._tempUnsub = void 0));
-        }
-        D.release(e);
-      }
-    } else if (this._releaseLinks(s), D.release(s), e !== l)
-      for (let n = 0, r = e.length; n < r; n++)
-        e[n] && (e[n].node._tempUnsub = void 0);
+      if (this._parkedUnsubs)
+        for (const n of this._parkedUnsubs.values())
+          n();
+      e !== a && D.release(e);
+    } else
+      this._releaseLinks(s), D.release(s);
+    this._parkedUnsubs = null;
   }
   _releaseLinks(t) {
-    if (t !== l) {
+    if (t !== a) {
       for (let e = 0, s = t.length; e < s; e++)
         t[e]?.unsub?.();
       D.release(t);
     }
   }
   _isDirty() {
-    const t = this._links, e = E.current;
-    E.current = null;
+    const t = this._links, e = f.current;
+    f.current = null;
     try {
       for (let s = 0, n = t.length; s < n; s++) {
         const r = t[s], h = r.node;
-        if (h.version !== r.version) return !0;
-        if ("value" in h) {
+        if (h.flags & o.IS_COMPUTED)
           try {
             h.value;
           } catch {
-            return !0;
+            return _ && console.warn(`[atom-effect] Dependency #${h.id} threw during dirty check`), !0;
           }
-          if (h.version !== r.version) return !0;
-        }
+        if (h.version !== r.version) return !0;
       }
       return !1;
     } finally {
-      E.current = e;
+      f.current = e;
     }
   }
   _execCleanup() {
@@ -825,47 +840,45 @@ class ft extends $ {
       try {
         this._cleanup();
       } catch (t) {
-        this._handleExecutionError(t, _.EFFECT_CLEANUP_FAILED);
+        this._handleExecutionError(t, u.EFFECT_CLEANUP_FAILED);
       }
       this._cleanup = null;
     }
   }
   _checkInfiniteLoops() {
-    const t = P;
+    const t = M;
     if (this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), ut() > I.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++, this._history) {
       const e = Date.now();
       this._history[this._historyPtr] = e, this._historyPtr = (this._historyPtr + 1) % this._historyCapacity;
       const s = this._history[this._historyPtr] || 0;
-      if (s > 0 && e - s < et.ONE_SECOND_MS) {
-        const n = new S(
-          "Effect executed too frequently within 1 second. Suspected infinite loop."
-        );
-        if (this.dispose(), this._handleExecutionError(n), u) throw n;
+      if (s > 0 && e - s < tt.ONE_SECOND_MS) {
+        const n = new S(u.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
+        if (this.dispose(), this._handleExecutionError(n), _) throw n;
       }
     }
   }
   get isDisposed() {
-    return (this.flags & a.DISPOSED) !== 0;
+    return (this.flags & l.DISPOSED) !== 0;
   }
   get executionCount() {
     return this._executionCount;
   }
   get isExecuting() {
-    return (this.flags & a.EXECUTING) !== 0;
+    return (this.flags & l.EXECUTING) !== 0;
   }
   _throwInfiniteLoopError(t) {
     const e = new S(
-      `Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${v}`
+      `Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${B}`
     );
     throw this.dispose(), console.error(e), e;
   }
-  _handleExecutionError(t, e = _.EFFECT_EXECUTION_FAILED) {
-    const s = T(t, S, e);
+  _handleExecutionError(t, e = u.EFFECT_EXECUTION_FAILED) {
+    const s = C(t, S, e);
     if (console.error(s), this._onError)
       try {
         this._onError(s);
       } catch (n) {
-        console.error(T(n, S, _.CALLBACK_ERROR_IN_ERROR_HANDLER));
+        console.error(C(n, S, u.CALLBACK_ERROR_IN_ERROR_HANDLER));
       }
   }
   _checkLoopWarnings() {
@@ -881,40 +894,40 @@ class ft extends $ {
     }
   }
 }
-function gt(i, t = {}) {
+function Ot(i, t = {}) {
   if (typeof i != "function")
-    throw new S(_.EFFECT_MUST_BE_FUNCTION);
-  const e = new ft(i, t);
+    throw new S(u.EFFECT_MUST_BE_FUNCTION);
+  const e = new pt(i, t);
   return e.execute(), e;
 }
-function Ct(i) {
+function yt(i) {
   if (typeof i != "function")
     throw new TypeError("Batch callback must be a function");
-  f.startBatch();
+  O.startBatch();
   try {
     return i();
   } finally {
-    f.endBatch();
+    O.endBatch();
   }
 }
 export {
-  R as AsyncState,
-  O as AtomError,
+  k as AsyncState,
+  T as AtomError,
   p as ComputedError,
-  V as DEBUG_CONFIG,
+  et as DEBUG_CONFIG,
   g as DEBUG_RUNTIME,
   S as EffectError,
-  Et as POOL_CONFIG,
+  It as POOL_CONFIG,
   I as SCHEDULER_CONFIG,
   b as SchedulerError,
-  pt as atom,
-  Ct as batch,
-  St as computed,
-  gt as effect,
-  at as isAtom,
-  It as isComputed,
-  Dt as isEffect,
-  f as scheduler,
-  dt as untracked
+  St as atom,
+  yt as batch,
+  Tt as computed,
+  Ot as effect,
+  ft as isAtom,
+  gt as isComputed,
+  Ct as isEffect,
+  O as scheduler,
+  Dt as untracked
 };
 //# sourceMappingURL=index.mjs.map