@but212/atom-effect 0.19.0 → 0.19.1

package/dist/index.mjs

@@ -1,17 +1,19 @@
 const tt = {
   ONE_SECOND_MS: 1e3
-}, m = {
+}, 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,10 +22,10 @@ const tt = {
   RECOMPUTING: 256,
   HAS_ERROR: 512
 }, d = {
-  ...M,
+  ...w,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, pt = {
+}, It = {
   MAX_SIZE: 1e3,
   WARMUP_SIZE: 100,
   ENABLE_STATS: !1
@@ -40,7 +42,7 @@ const tt = {
   BATCH_QUEUE_SHRINK_THRESHOLD: 1e3
 }, et = {
   WARN_INFINITE_LOOP: !0
-}, O = 1073741823, _ = typeof process < "u" && process.env && process.env.NODE_ENV !== "production" || typeof __DEV__ < "u" && !!__DEV__, st = Object.freeze([]);
+}, 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";
@@ -56,7 +58,7 @@ class S extends T {
     super(t, e, !1), this.name = "EffectError";
   }
 }
-class N extends T {
+class b extends T {
   constructor(t, e = null) {
     super(t, e, !1), this.name = "SchedulerError";
   }
@@ -104,7 +106,7 @@ function j(i, t, e) {
       const c = e[r];
       if (c && c.fn === n) return;
     }
-    e.push(new k(n, void 0));
+    e.push(new P(n, void 0));
     return;
   }
   if ("addDependency" in t) {
@@ -116,33 +118,29 @@ function j(i, t, e) {
     const h = e[n];
     if (h && h.sub === s) return;
   }
-  e.push(new k(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 b {
+class R {
   constructor(t, e, s = void 0) {
     this.node = t, this.version = e, this.unsub = s;
   }
 }
-class k {
+class P {
   constructor(t, e) {
     this.fn = t, this.sub = e;
   }
@@ -181,7 +179,7 @@ function C(i, t, e) {
 }
 class q {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this._modifiedAtEpoch = -1, this.id = ot() & O, this._tempUnsub = void 0;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this._modifiedAtEpoch = -1, this.id = ot() & y;
   }
 }
 class $ extends q {
@@ -203,7 +201,7 @@ class $ extends q {
         return _ && console.warn("Duplicate subscription ignored."), () => {
         };
     }
-    const n = new k(
+    const n = new P(
       e ? t : void 0,
       e ? void 0 : t
     );
@@ -235,144 +233,131 @@ class $ extends q {
     console.error(C(t, T, u.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
   }
 }
-let R = 0;
-const J = () => (R = R + 1 & O || 1, R), ct = () => R, P = (i) => i + 1 & O;
-let v = 0, w = 0, A = !1;
+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 A ? (_ && console.warn("startFlush() called during flush - ignored"), !1) : (A = !0, v = v + 1 & O || 1, w = 0, !0);
+  return L ? (_ && console.warn("startFlush() called during flush - ignored"), !1) : (L = !0, M = M + 1 & y || 1, B = 0, !0);
 }
 const X = () => {
-  A = !1;
-}, ut = () => A ? ++w : 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,
+  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 (_ && typeof i != "function")
-      throw new N("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;
+  schedule(t) {
+    if (_ && typeof t != "function")
+      throw new b("Scheduler callback must be a function");
+    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 = H();
-      f._drainQueue(), i && X();
+      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 = H();
+    const t = H();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this._isFlushingSync = !1, i && X();
+      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 N("Error occurred during scheduler execution", n));
+        e[n]();
+      } catch (r) {
+        console.error(new b("Error occurred during scheduler execution", r));
       }
-    t.length = 0;
-  },
-  /** Overflow callback */
-  onOverflow: null,
+    e.length = 0;
+  }
   _handleFlushOverflow() {
-    const i = this._size + this._batchQueueSize;
+    const t = this._size + this._batchQueueSize;
     if (console.error(
-      new N(
-        u.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, i)
+      new b(
+        u.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t)
       )
     ), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow)
       try {
-        this.onOverflow(i);
+        this.onOverflow(t);
       } catch {
       }
-  },
+  }
   startBatch() {
     this._batchDepth++, this._isBatching = !0;
-  },
+  }
   endBatch() {
     if (this._batchDepth === 0) {
       _ && 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)
-      throw new N(
+  }
+  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,
   /**
@@ -392,35 +377,35 @@ const X = () => {
     }
   }
 };
-function It(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 $ {
+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 = P(this.version);
+    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);
     }
   }
   /**
@@ -440,10 +425,10 @@ class _t extends $ {
     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 Dt(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).
@@ -510,42 +495,42 @@ class lt {
     });
   }
 }
-const y = (i) => Object.freeze(i);
-y([]);
-y([]);
-y([]);
-y([]);
-const l = y([]), D = new lt();
-function at(i) {
+const N = (i) => Object.freeze(i);
+N([]);
+N([]);
+N([]);
+N([]);
+const a = N([]), D = new at();
+function ft(i) {
   return i !== null && typeof i == "object" && "value" in i && typeof i.subscribe == "function";
 }
-function St(i) {
-  return at(i) && typeof i.invalidate == "function";
-}
 function gt(i) {
+  return ft(i) && typeof i.invalidate == "function";
+}
+function Ct(i) {
   return i !== null && typeof i == "object" && typeof i.dispose == "function" && typeof i.run == "function";
 }
 function K(i) {
   return i !== null && typeof i == "object" && typeof i.then == "function";
 }
-const W = o.RESOLVED | o.PENDING | o.REJECTED, U = Array(W + 1).fill(m.IDLE);
-U[o.RESOLVED] = m.RESOLVED;
-U[o.PENDING] = m.PENDING;
-U[o.REJECTED] = m.REJECTED;
-const ft = 3, Y = Number.MAX_SAFE_INTEGER - 1, Et = o.REJECTED | o.HAS_ERROR;
+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(u.COMPUTED_MUST_BE_FUNCTION);
-    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._errorDepCount = 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 : x, this._onError = e.onError ?? null;
+    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 : ft, g.attachDebugInfo(this, "computed", this.id), e.lazy === !1)
+    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() {
@@ -576,7 +561,7 @@ class Z extends $ {
     return this._value;
   }
   get state() {
-    return this._track(), U[this.flags & W];
+    return this._track(), m[this.flags & W];
   }
   get hasError() {
     if (this._track(), this.flags & (o.REJECTED | o.HAS_ERROR) || this._errorDepCount > 0) return !0;
@@ -601,12 +586,12 @@ class Z extends $ {
     for (let r = 0, h = s.length; r < h; r++) {
       const c = s[r].node;
       if (c.flags & o.HAS_ERROR) {
-        const B = c;
-        if (B.errors) {
-          const V = B.errors;
-          for (let L = 0; L < V.length; L++) {
-            const F = V[L];
-            F && e.indexOf(F) === -1 && e.push(F);
+        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);
           }
         }
       }
@@ -629,10 +614,10 @@ class Z extends $ {
   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) % Y, this._cachedErrors = null, this._errorCacheEpoch = -1;
   }
@@ -642,7 +627,7 @@ class Z extends $ {
         const e = this._trackLinks[this._trackCount];
         e.node = t, e.version = t.version;
       } else
-        this._trackLinks.push(new b(t, t.version));
+        this._trackLinks.push(new R(t, t.version));
       this._trackCount++;
     }
   }
@@ -665,7 +650,7 @@ class Z extends $ {
     this._trackEpoch = J(), this._trackLinks = D.acquire(), this._trackCount = 0;
     let e = !1;
     try {
-      const s = E.run(this, this._fn);
+      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)
@@ -676,7 +661,7 @@ class Z extends $ {
         }
       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) {
@@ -702,12 +687,12 @@ class Z extends $ {
     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 & O;
+      t = ((t << 5) - t | 0) + e[s].node.version & y;
     return t;
   }
   _handleError(t, e, s = !1) {
     const n = C(t, p, e);
-    if (!s && !(this.flags & o.REJECTED) && (this.version = P(this.version)), this._error = n, this.flags = this.flags & -121 | Et, this._onError)
+    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) {
@@ -717,7 +702,7 @@ class Z extends $ {
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(t) {
-    (!(this.flags & o.RESOLVED) || !this._equal(this._value, t)) && (this.version = P(this.version)), 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();
@@ -728,64 +713,67 @@ class Z extends $ {
   }
 }
 Object.freeze(Z.prototype);
-function Ct(i, t = {}) {
+function Tt(i, t = {}) {
   return new Z(i, t);
 }
-class dt extends q {
+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 = _ && s && n > 0 ? new Array(n).fill(0) : null, g.attachDebugInfo(this, "effect", this.id);
   }
   run() {
-    if (this.flags & a.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 b(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 b(t, t.version, s));
-    } catch (s) {
-      const n = C(s, S, u.EFFECT_EXECUTION_FAILED);
-      if (console.error(n), this._onError)
+      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(n);
+          this._onError(r);
         } catch {
         }
-      e.push(new b(t, t.version, void 0));
+      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 = J();
     let n = !1;
     try {
-      const r = E.run(this, this._fn);
+      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;
@@ -797,7 +785,7 @@ class dt extends q {
     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();
@@ -813,31 +801,28 @@ class dt extends q {
   }
   _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 ("value" in h)
+        if (h.flags & o.IS_COMPUTED)
           try {
             h.value;
           } catch {
@@ -847,7 +832,7 @@ class dt extends q {
       }
       return !1;
     } finally {
-      E.current = e;
+      f.current = e;
     }
   }
   _execCleanup() {
@@ -861,7 +846,7 @@ class dt extends q {
     }
   }
   _checkInfiniteLoops() {
-    const t = v;
+    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;
@@ -873,17 +858,17 @@ class dt extends q {
     }
   }
   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: ${w}`
+      `Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${B}`
     );
     throw this.dispose(), console.error(e), e;
   }
@@ -909,40 +894,40 @@ class dt extends q {
     }
   }
 }
-function Tt(i, t = {}) {
+function Ot(i, t = {}) {
   if (typeof i != "function")
     throw new S(u.EFFECT_MUST_BE_FUNCTION);
-  const e = new dt(i, t);
+  const e = new pt(i, t);
   return e.execute(), e;
 }
-function Ot(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 {
-  m as AsyncState,
+  k as AsyncState,
   T as AtomError,
   p as ComputedError,
   et as DEBUG_CONFIG,
   g as DEBUG_RUNTIME,
   S as EffectError,
-  pt as POOL_CONFIG,
+  It as POOL_CONFIG,
   I as SCHEDULER_CONFIG,
-  N as SchedulerError,
-  Dt as atom,
-  Ot as batch,
-  Ct as computed,
-  Tt as effect,
-  at as isAtom,
-  St as isComputed,
-  gt as isEffect,
-  f as scheduler,
-  It as untracked
+  b as SchedulerError,
+  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