@but212/atom-effect 0.21.3 → 0.22.0

package/dist/index.mjs

@@ -1,12 +1,12 @@
-const A = {
+const b = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, l = {
+}, u = {
   DISPOSED: 1,
   EXECUTING: 8
-}, K = {
+}, $ = {
   DISPOSED: 1,
   /** Marker bit: identifies this node as a computed. */
   IS_COMPUTED: 2,
@@ -21,11 +21,11 @@ const A = {
   DISPOSED: 1,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, Ct = {
+}, Dt = {
   MAX_SIZE: 1e3,
   WARMUP_SIZE: 100,
   ENABLE_STATS: !1
-}, p = {
+}, d = {
   // Infinite loop protection
   MAX_EXECUTIONS_PER_SECOND: 1e3,
   MAX_EXECUTIONS_PER_EFFECT: 100,
@@ -35,58 +35,55 @@ const A = {
   MIN_FLUSH_ITERATIONS: 10,
   // Memory management
   BATCH_QUEUE_SHRINK_THRESHOLD: 1e3
-}, ot = {
+}, nt = {
   WARN_INFINITE_LOOP: !0,
   EFFECT_FREQUENCY_WINDOW: 1e3
-}, X = {
+}, H = {
   MAX_ASYNC_RETRIES: 3,
   MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1
-}, B = 1073741823, J = typeof process < "u" && process.env && !1 || !1, ht = Object.freeze([]);
-class C extends Error {
+}, R = 1073741823, W = typeof process < "u" && process.env && !1 || !1, rt = Object.freeze([]);
+class D extends Error {
   constructor(t, e = null, s = !0) {
     super(t), this.cause = e, this.recoverable = s, this.name = "AtomError";
   }
 }
-class E extends C {
+class f extends D {
   constructor(t, e = null) {
     super(t, e, !0), this.name = "ComputedError";
   }
 }
-class g extends C {
+class I extends D {
   constructor(t, e = null) {
     super(t, e, !1), this.name = "EffectError";
   }
 }
-class m extends C {
+class m extends D {
   constructor(t, e = null) {
     super(t, e, !1), this.name = "SchedulerError";
   }
 }
-const ct = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), ut = /* @__PURE__ */ Symbol("AtomEffect.Type"), U = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), L = {
+const ot = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), ht = /* @__PURE__ */ Symbol("AtomEffect.Type"), x = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), F = {
   // Dev mode flag
-  enabled: J,
-  warnInfiniteLoop: ot.WARN_INFINITE_LOOP,
+  enabled: W,
+  warnInfiniteLoop: nt.WARN_INFINITE_LOOP,
   warn(i, t) {
   },
   checkCircular(i, t) {
     if (i === t)
-      throw new E("Direct circular dependency detected");
+      throw new f("Direct circular dependency detected");
   },
   attachDebugInfo(i, t, e) {
   },
-  getDebugName: (i) => i?.[ct],
-  getDebugType: (i) => i?.[ut]
+  getDebugName: (i) => i?.[ot],
+  getDebugType: (i) => i?.[ht]
 };
-let lt = 1;
-const _t = () => lt++;
-function Z(i, t, e) {
+let ct = 1;
+const ut = () => ct++;
+function K(i, t, e) {
   if (typeof t == "function") {
     const n = t;
-    for (let r = 0, o = e.length; r < o; r++) {
-      const h = e[r];
-      if (h && h.fn === n) return;
-    }
-    e.push(new M(n, void 0));
+    if (e.some((r) => r && r.fn === n)) return;
+    e.push(new P(n, void 0));
     return;
   }
   if ("addDependency" in t) {
@@ -94,38 +91,29 @@ function Z(i, t, e) {
     return;
   }
   const s = t;
-  for (let n = 0, r = e.length; n < r; n++) {
-    const o = e[n];
-    if (o && o.sub === s) return;
-  }
-  e.push(new M(void 0, s));
+  e.some((n) => n && n.sub === s) || e.push(new P(void 0, s));
 }
-function G(i, t, e) {
+function V(i, t, e) {
   const s = /* @__PURE__ */ new Map();
-  for (let n = 0, r = t.length; n < r; n++) {
-    const o = t[n];
-    o?.unsub && s.set(o.node, o.unsub);
-  }
-  for (let n = 0, r = i.length; n < r; n++) {
-    const o = i[n];
-    if (!o) continue;
-    const h = o.node, I = s.get(h);
-    I !== void 0 ? (o.unsub = I, s.delete(h)) : (L.checkCircular(h, e), o.unsub = h.subscribe(e));
-  }
-  for (const n of s.values())
-    n();
+  t.forEach((n) => {
+    n?.unsub && s.set(n.node, n.unsub);
+  }), i.forEach((n) => {
+    if (!n) return;
+    const r = n.node, o = s.get(r);
+    o !== void 0 ? (n.unsub = o, s.delete(r)) : (F.checkCircular(r, e), n.unsub = r.subscribe(e));
+  }), s.forEach((n) => n());
 }
 class v {
   constructor(t, e, s = void 0) {
     this.node = t, this.version = e, this.unsub = s;
   }
 }
-class M {
+class P {
   constructor(t, e) {
     this.fn = t, this.sub = e;
   }
 }
-const c = {
+const h = {
   // Computed Errors
   COMPUTED_MUST_BE_FUNCTION: "Computed target must be a function",
   COMPUTED_ASYNC_PENDING_NO_DEFAULT: "Async computation pending with no default value",
@@ -150,41 +138,37 @@ const c = {
   SCHEDULER_CALLBACK_MUST_BE_FUNCTION: "Scheduler callback must be a function",
   SCHEDULER_END_BATCH_WITHOUT_START: "endBatch() called without matching startBatch(). Ignoring."
 };
-function D(i, t, e) {
-  if (i instanceof C)
+function S(i, t, e) {
+  if (i instanceof D)
     return i;
-  const s = i instanceof Error, n = s ? i.message : String(i), r = s ? i : void 0, h = `${s ? i.constructor.name : "Unexpected error"} (${e}): ${n}`;
-  return new t(h, r);
+  const s = i instanceof Error, n = s ? i.message : String(i), r = s ? i : void 0, O = `${s ? i.constructor.name : "Unexpected error"} (${e}): ${n}`;
+  return new t(O, r);
 }
-class tt {
+class J {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this.id = _t() & B;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this.id = ut() & R;
   }
 }
-class et extends tt {
+class Z extends J {
   /**
    * Adds subscriber.
    */
   subscribe(t) {
     const e = typeof t == "function";
     if (!e && (!t || typeof t.execute != "function"))
-      throw D(
+      throw S(
         new TypeError("Invalid subscriber"),
-        C,
-        c.ATOM_SUBSCRIBER_MUST_BE_FUNCTION
+        D,
+        h.ATOM_SUBSCRIBER_MUST_BE_FUNCTION
       );
-    const s = this._subscribers;
-    for (let r = 0, o = s.length; r < o; r++) {
-      const h = s[r];
-      if (h && (e ? h.fn === t : h.sub === t))
-        return () => {
-        };
-    }
-    const n = new M(
+    if (this._subscribers.some((r) => r ? e ? r.fn === t : r.sub === t : !1))
+      return () => {
+      };
+    const s = new P(
       e ? t : void 0,
       e ? void 0 : t
     );
-    return s.push(n), () => this._unsubscribe(n);
+    return this._subscribers.push(s), () => this._unsubscribe(s);
   }
   _unsubscribe(t) {
     const e = this._subscribers, s = e.indexOf(t);
@@ -197,34 +181,32 @@ class et extends tt {
   }
   _notifySubscribers(t, e) {
     if (this._subscribers.length === 0) return;
-    const s = this._subscribers.slice(0), n = s.length;
-    for (let r = 0; r < n; r++) {
-      const o = s[r];
-      if (o)
+    this._subscribers.slice(0).forEach((n) => {
+      if (n)
         try {
-          o.fn ? o.fn(t, e) : o.sub && o.sub.execute();
-        } catch (h) {
-          this._handleNotifyError(h);
+          n.fn ? n.fn(t, e) : n.sub && n.sub.execute();
+        } catch (r) {
+          this._handleNotifyError(r);
         }
-    }
+    });
   }
   _handleNotifyError(t) {
-    console.error(D(t, C, c.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+    console.error(S(t, D, h.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
   }
 }
-let x = 0;
-const z = () => (x = x + 1 & B || 1, x), w = (i) => i + 1 & B;
-let H = 0, k = !1, st = 0;
-const at = () => st;
-function Q() {
-  return k ? !1 : (k = !0, st = z(), H = 0, !0);
+let k = 0;
+const w = () => (k = k + 1 & R || 1, k), M = (i) => i + 1 & R;
+let B = 0, L = !1, tt = 0;
+const _t = () => tt;
+function X() {
+  return L ? !1 : (L = !0, tt = w(), B = 0, !0);
 }
-const Y = () => {
-  k = !1;
-}, ft = () => k ? ++H : 0;
-class Et {
+const G = () => {
+  L = !1;
+}, at = () => L ? ++B : 0;
+class lt {
   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 = p.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
+    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 = d.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
   }
   get phase() {
     return this._isProcessing || this._isFlushingSync ? 2 : this._isBatching ? 1 : 0;
@@ -259,30 +241,28 @@ class Et {
   _runLoop() {
     try {
       if (this._size === 0) return;
-      const t = Q();
-      this._drainQueue(), t && Y();
+      const t = X();
+      this._drainQueue(), t && G();
     } finally {
       this._isProcessing = !1, this._size > 0 && !this._isBatching && this._flush();
     }
   }
   _flushSync() {
     this._isFlushingSync = !0;
-    const t = Q();
+    const t = X();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this._isFlushingSync = !1, t && Y();
+      this._isFlushingSync = !1, t && G();
     }
   }
   _mergeBatchQueue() {
     if (this._batchQueueSize === 0) return;
     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 o = e[r];
-      o._nextEpoch !== t && (o._nextEpoch = t, s[n++] = o);
-    }
-    this._size = n, this._batchQueueSize = 0, e.length > p.BATCH_QUEUE_SHRINK_THRESHOLD && (e.length = 0);
+    e.slice(0, this._batchQueueSize).forEach((r) => {
+      r._nextEpoch !== t && (r._nextEpoch = t, s[n++] = r);
+    }), this._size = n, this._batchQueueSize = 0, e.length > d.BATCH_QUEUE_SHRINK_THRESHOLD && (e.length = 0);
   }
   _drainQueue() {
     let t = 0;
@@ -309,7 +289,7 @@ class Et {
     const t = this._size + this._batchQueueSize;
     if (console.error(
       new m(
-        c.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t)
+        h.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t)
       )
     ), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow)
       try {
@@ -324,14 +304,14 @@ class Et {
     this._batchDepth !== 0 && --this._batchDepth === 0 && (this._flushSync(), this._isBatching = !1);
   }
   setMaxFlushIterations(t) {
-    if (t < p.MIN_FLUSH_ITERATIONS)
+    if (t < d.MIN_FLUSH_ITERATIONS)
       throw new m(
-        `Max flush iterations must be at least ${p.MIN_FLUSH_ITERATIONS}`
+        `Max flush iterations must be at least ${d.MIN_FLUSH_ITERATIONS}`
       );
     this._maxFlushIterations = t;
   }
 }
-const b = new Et(), V = /* @__PURE__ */ Symbol.for("atom-effect/atom"), it = /* @__PURE__ */ Symbol.for("atom-effect/computed"), nt = /* @__PURE__ */ Symbol.for("atom-effect/effect"), _ = {
+const T = new lt(), z = /* @__PURE__ */ Symbol.for("atom-effect/atom"), et = /* @__PURE__ */ Symbol.for("atom-effect/computed"), st = /* @__PURE__ */ Symbol.for("atom-effect/effect"), _ = {
   /** Active listener. */
   current: null,
   /**
@@ -351,7 +331,7 @@ const b = new Et(), V = /* @__PURE__ */ Symbol.for("atom-effect/atom"), it = /*
     }
   }
 };
-function Tt(i) {
+function Ct(i) {
   const t = _.current;
   if (t === null) return i();
   _.current = null;
@@ -361,26 +341,26 @@ function Tt(i) {
     _.current = t;
   }
 }
-var j;
-class dt extends et {
+var Q;
+class ft extends Z {
   constructor(t, e) {
-    super(), this._pendingOldValue = void 0, this._notifyTask = () => this._flushNotifications(), this._subscribers = [], this[j] = !0, this._value = t, e && (this.flags |= a.SYNC), L.attachDebugInfo(this, "atom", this.id);
+    super(), this._pendingOldValue = void 0, this._notifyTask = () => this._flushNotifications(), this._subscribers = [], this[Q] = !0, this._value = t, e && (this.flags |= a.SYNC), F.attachDebugInfo(this, "atom", this.id);
   }
   get value() {
     const t = _.current;
-    return t && Z(this, t, this._subscribers), this._value;
+    return t && K(this, t, this._subscribers), this._value;
   }
   set value(t) {
     const e = this._value;
     if (Object.is(e, t)) return;
-    this._value = t, this.version = w(this.version);
+    this._value = t, this.version = M(this.version);
     const s = this.flags;
     if (!(this._subscribers.length === 0 || s & a.NOTIFICATION_SCHEDULED)) {
-      if (this._pendingOldValue = e, this.flags = s | a.NOTIFICATION_SCHEDULED, s & a.SYNC && !b.isBatching) {
+      if (this._pendingOldValue = e, this.flags = s | a.NOTIFICATION_SCHEDULED, s & a.SYNC && !T.isBatching) {
         this._flushNotifications();
         return;
       }
-      b.schedule(this._notifyTask);
+      T.schedule(this._notifyTask);
     }
   }
   /**
@@ -399,14 +379,14 @@ class dt extends et {
   dispose() {
     this.flags & a.DISPOSED || (this._subscribers.length = 0, this.flags |= a.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
   }
-  [(j = V, Symbol.dispose)]() {
+  [(Q = z, Symbol.dispose)]() {
     this.dispose();
   }
 }
-function Ot(i, t = {}) {
-  return new dt(i, t.sync ?? !1);
+function gt(i, t = {}) {
+  return new ft(i, t.sync ?? !1);
 }
-class pt {
+class Et {
   /**
    * @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).
@@ -473,32 +453,32 @@ class pt {
     });
   }
 }
-const u = Object.freeze(
+const c = Object.freeze(
   []
-), f = new pt();
-function bt(i) {
-  return i !== null && typeof i == "object" && V in i;
+), l = new Et();
+function Tt(i) {
+  return i !== null && typeof i == "object" && z in i;
 }
-function At(i) {
-  return i !== null && typeof i == "object" && it in i;
+function Ot(i) {
+  return i !== null && typeof i == "object" && et in i;
 }
-function Nt(i) {
-  return i !== null && typeof i == "object" && nt in i;
+function bt(i) {
+  return i !== null && typeof i == "object" && st in i;
 }
-function rt(i) {
+function it(i) {
   return i !== null && typeof i == "object" && typeof i.then == "function";
 }
-var q, $;
-const { IDLE: N, DIRTY: S, PENDING: R, RESOLVED: d, REJECTED: O, HAS_ERROR: y, RECOMPUTING: T, DISPOSED: P, IS_COMPUTED: It } = K;
-function St(i) {
-  return i & d ? A.RESOLVED : i & R ? A.PENDING : i & O ? A.REJECTED : A.IDLE;
+var Y, q;
+const { IDLE: A, DIRTY: p, PENDING: y, RESOLVED: E, REJECTED: g, HAS_ERROR: N, RECOMPUTING: C, DISPOSED: U, IS_COMPUTED: dt } = $;
+function pt(i) {
+  return i & E ? b.RESOLVED : i & y ? b.PENDING : i & g ? b.REJECTED : b.IDLE;
 }
-class gt extends et {
+class It extends Z {
   constructor(t, e = {}) {
-    if (typeof t != "function") throw new E(c.COMPUTED_MUST_BE_FUNCTION);
-    super(), this[$] = !0, this[q] = !0, this._error = null, this._promiseId = 0, this._subscribers = [], this._links = u, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._trackEpoch = -1, this._trackLinks = u, this._trackCount = 0, this._value = void 0, this.flags = It | S | N, this._equal = e.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in e ? e.defaultValue : U, this._onError = e.onError ?? null;
+    if (typeof t != "function") throw new f(h.COMPUTED_MUST_BE_FUNCTION);
+    super(), this[q] = !0, this[Y] = !0, this._error = null, this._promiseId = 0, this._subscribers = [], this._links = c, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._trackEpoch = -1, this._trackLinks = c, this._trackCount = 0, this._value = void 0, this.flags = dt | p | A, 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 : X.MAX_ASYNC_RETRIES, L.attachDebugInfo(this, "computed", this.id), e.lazy === !1)
+    if (this._maxAsyncRetries = (s ?? H.MAX_ASYNC_RETRIES) & R, F.attachDebugInfo(this, "computed", this.id), e.lazy === !1)
       try {
         this._recompute();
       } catch {
@@ -506,27 +486,27 @@ class gt extends et {
   }
   _track() {
     const t = _.current;
-    t && Z(this, t, this._subscribers);
+    t && K(this, t, this._subscribers);
   }
   get value() {
     this._track();
     const t = this.flags;
-    if ((t & (d | S | N)) === d)
+    if ((t & (E | p | A)) === E)
       return this._value;
-    if (t & P)
-      throw new E(c.COMPUTED_DISPOSED);
-    if (t & T) {
-      if (this._defaultValue !== U) return this._defaultValue;
-      throw new E(c.COMPUTED_CIRCULAR_DEPENDENCY);
+    if (t & U)
+      throw new f(h.COMPUTED_DISPOSED);
+    if (t & C) {
+      if (this._defaultValue !== x) return this._defaultValue;
+      throw new f(h.COMPUTED_CIRCULAR_DEPENDENCY);
     }
-    if (t & (S | N) && (this._recompute(), this.flags & d))
+    if (t & (p | A) && (this._recompute(), this.flags & E))
       return this._value;
-    const e = this._defaultValue, s = e !== U;
-    if (this.flags & R) {
+    const e = this._defaultValue, s = e !== x;
+    if (this.flags & y) {
       if (s) return e;
-      throw new E(c.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+      throw new f(h.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
     }
-    if (this.flags & O) {
+    if (this.flags & g) {
       if (s) return e;
       throw this._error;
     }
@@ -536,61 +516,42 @@ class gt extends et {
     return this._value;
   }
   get state() {
-    return this._track(), St(this.flags);
+    return this._track(), pt(this.flags);
   }
   get hasError() {
-    if (this._track(), this.flags & (O | y)) return !0;
-    const t = this._links;
-    for (let e = 0, s = t.length; e < s; e++) {
-      const n = t[e]?.node;
-      if (n && n.flags & y) return !0;
-    }
-    return !1;
+    return this._track(), this.flags & (g | N) ? !0 : this._links.some((t) => t?.node?.flags & N);
   }
   get isValid() {
     return !this.hasError;
   }
   get errors() {
-    if (this._track(), !this.hasError) return ht;
+    if (this._track(), !this.hasError) return rt;
     const t = [];
-    this._error && t.push(this._error);
-    const e = this._links;
-    for (let s = 0, n = e.length; s < n; s++) {
-      const r = e[s].node;
-      if (r.flags & y) {
-        const h = r.errors;
-        if (h.length > 0)
-          for (let I = 0; I < h.length; I++) {
-            const F = h[I];
-            F && t.indexOf(F) === -1 && t.push(F);
-          }
-      }
-    }
-    return Object.freeze(t);
+    return this._error && t.push(this._error), this._links.forEach((s) => {
+      const n = s.node;
+      n.flags & N && n.errors.forEach((o) => {
+        o && !t.includes(o) && t.push(o);
+      });
+    }), Object.freeze(t);
   }
   get lastError() {
     return this._track(), this._error;
   }
   get isPending() {
-    return this._track(), (this.flags & R) !== 0;
+    return this._track(), (this.flags & y) !== 0;
   }
   get isResolved() {
-    return this._track(), (this.flags & d) !== 0;
+    return this._track(), (this.flags & E) !== 0;
   }
   invalidate() {
     this._markDirty();
   }
   dispose() {
-    if (this.flags & P) return;
+    if (this.flags & U) return;
     const t = this._links;
-    if (t !== u) {
-      for (let e = 0, s = t.length; e < s; e++)
-        t[e].unsub?.();
-      f.release(t), this._links = u;
-    }
-    this._subscribers.length = 0, this.flags = P | S | N, this._error = null, this._value = void 0;
+    t !== c && (t.forEach((e) => e.unsub?.()), l.release(t), this._links = c), this._subscribers.length = 0, this.flags = U | p | A, this._error = null, this._value = void 0;
   }
-  [($ = V, q = it, Symbol.dispose)]() {
+  [(q = z, Y = et, Symbol.dispose)]() {
     this.dispose();
   }
   addDependency(t) {
@@ -604,42 +565,42 @@ class gt extends et {
     }
   }
   _recompute() {
-    if (this.flags & T) return;
-    this.flags |= T;
+    if (this.flags & C) return;
+    this.flags |= C;
     const t = this._links;
-    this._trackEpoch = z(), this._trackLinks = f.acquire(), this._trackCount = 0;
+    this._trackEpoch = w(), this._trackLinks = l.acquire(), this._trackCount = 0;
     let e = !1;
     try {
       const s = _.run(this, this._fn);
-      this._trackLinks.length = this._trackCount, G(this._trackLinks, t, this), this._links = this._trackLinks, e = !0, rt(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
+      this._trackLinks.length = this._trackCount, V(this._trackLinks, t, this), this._links = this._trackLinks, e = !0, it(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
     } catch (s) {
       if (!e)
         try {
-          this._trackLinks.length = this._trackCount, G(this._trackLinks, t, this), this._links = this._trackLinks, e = !0;
+          this._trackLinks.length = this._trackCount, V(this._trackLinks, t, this), this._links = this._trackLinks, e = !0;
         } catch {
         }
-      this._handleError(s, c.COMPUTED_COMPUTATION_FAILED, !0);
+      this._handleError(s, h.COMPUTED_COMPUTATION_FAILED, !0);
     } finally {
-      e && t !== u ? f.release(t) : e || f.release(this._trackLinks), this._trackEpoch = -1, this._trackLinks = u, this._trackCount = 0, this.flags &= ~T;
+      e && t !== c ? l.release(t) : e || l.release(this._trackLinks), this._trackEpoch = -1, this._trackLinks = c, this._trackCount = 0, this.flags &= ~C;
     }
   }
   _handleAsyncComputation(t) {
-    this.flags = (this.flags | R) & -217, this._notifySubscribers(void 0, void 0), this._asyncStartAggregateVersion = this._captureVersionSnapshot(), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % X.MAX_PROMISE_ID;
+    this.flags = (this.flags | y) & -217, this._notifySubscribers(void 0, void 0), this._asyncStartAggregateVersion = this._captureVersionSnapshot(), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % H.MAX_PROMISE_ID;
     const e = this._promiseId;
     t.then(
       (s) => {
         if (e === this._promiseId) {
           if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion)
             return this._asyncRetryCount++ < this._maxAsyncRetries ? this._markDirty() : this._handleError(
-              new E(
+              new f(
                 `Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`
               ),
-              c.COMPUTED_ASYNC_COMPUTATION_FAILED
+              h.COMPUTED_ASYNC_COMPUTATION_FAILED
             );
           this._finalizeResolution(s), this._notifySubscribers(s, void 0);
         }
       },
-      (s) => e === this._promiseId && this._handleError(s, c.COMPUTED_ASYNC_COMPUTATION_FAILED)
+      (s) => e === this._promiseId && this._handleError(s, h.COMPUTED_ASYNC_COMPUTATION_FAILED)
     );
   }
   _captureVersionSnapshot() {
@@ -650,67 +611,65 @@ class gt extends et {
     return t;
   }
   _handleError(t, e, s = !1) {
-    const n = D(t, E, e);
-    if (!s && !(this.flags & O) && (this.version = w(this.version)), this._error = n, this.flags = this.flags & -121 | O | y, this._onError)
+    const n = S(t, f, e);
+    if (!s && !(this.flags & g) && (this.version = M(this.version)), this._error = n, this.flags = this.flags & -121 | g | N, this._onError)
       try {
         this._onError(n);
       } catch (r) {
-        console.error(c.CALLBACK_ERROR_IN_ERROR_HANDLER, r);
+        console.error(h.CALLBACK_ERROR_IN_ERROR_HANDLER, r);
       }
     if (s) throw n;
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(t) {
-    (!(this.flags & d) || !this._equal(this._value, t)) && (this.version = w(this.version)), this._value = t, this._error = null, this.flags = (this.flags | d) & -697;
+    (!(this.flags & E) || !this._equal(this._value, t)) && (this.version = M(this.version)), this._value = t, this._error = null, this.flags = (this.flags | E) & -697;
   }
   execute() {
     this._markDirty();
   }
   /** @internal */
   _markDirty() {
-    this.flags & (T | S) || (this.flags |= S, this._notifySubscribers(void 0, void 0));
+    this.flags & (C | p) || (this.flags |= p, this._notifySubscribers(void 0, void 0));
   }
 }
-function yt(i, t = {}) {
-  return new gt(i, t);
+function At(i, t = {}) {
+  return new It(i, t);
 }
-var W;
-class Dt extends tt {
+var j;
+class St extends J {
   constructor(t, e = {}) {
-    super(), this[W] = !0, this._cleanup = null, this._links = u, this._nextLinks = null, this._prevLinks = u, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._fn = t, this._onError = e.onError ?? null, this._sync = e.sync ?? !1, this._maxExecutions = e.maxExecutionsPerSecond ?? p.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = e.maxExecutionsPerFlush ?? p.MAX_EXECUTIONS_PER_EFFECT, this._sync ? (this._executeTask = void 0, this._notifyCallback = () => this.execute()) : (this._executeTask = () => this.execute(), this._notifyCallback = () => b.schedule(this._executeTask)), L.attachDebugInfo(this, "effect", this.id);
+    super(), this[j] = !0, this._cleanup = null, this._links = c, this._nextLinks = null, this._prevLinks = c, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._fn = t, this._onError = e.onError ?? null, this._sync = e.sync ?? !1, this._maxExecutions = e.maxExecutionsPerSecond ?? d.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = e.maxExecutionsPerFlush ?? d.MAX_EXECUTIONS_PER_EFFECT, this._sync ? (this._executeTask = void 0, this._notifyCallback = () => this.execute()) : (this._executeTask = () => this.execute(), this._notifyCallback = () => T.schedule(this._executeTask)), F.attachDebugInfo(this, "effect", this.id);
   }
   run() {
-    if (this.flags & l.DISPOSED)
-      throw new g(c.EFFECT_DISPOSED);
+    if (this.flags & u.DISPOSED)
+      throw new I(h.EFFECT_DISPOSED);
     this.execute(!0);
   }
   dispose() {
-    this.flags & l.DISPOSED || (this.flags |= l.DISPOSED, this._execCleanup(), this._unsubLinks(this._links), this._links !== u && f.release(this._links), this._links = u, this._prevLinks = u);
+    this.flags & u.DISPOSED || (this.flags |= u.DISPOSED, this._execCleanup(), this._unsubLinks(this._links), this._links !== c && l.release(this._links), this._links = c, this._prevLinks = c);
   }
-  [(W = nt, Symbol.dispose)]() {
+  [(j = st, Symbol.dispose)]() {
     this.dispose();
   }
   addDependency(t) {
-    if (!(this.flags & l.EXECUTING)) return;
+    if (!(this.flags & u.EXECUTING)) return;
     const e = this._currentEpoch;
     if (t._lastSeenEpoch === e) return;
     t._lastSeenEpoch = e;
-    const s = this._nextLinks, n = this._prevLinks;
-    for (let r = 0, o = n.length; r < o; r++) {
-      const h = n[r];
-      if (h && h.node === t && h.unsub) {
-        h.version = t.version, s.push(h), n[r] = null;
-        return;
-      }
+    const s = this._nextLinks, n = this._prevLinks, r = n.findIndex((o) => o && o.node === t && o.unsub);
+    if (r !== -1) {
+      const o = n[r];
+      o.version = t.version, s.push(o), n[r] = null;
+      return;
     }
     try {
-      const r = t.subscribe(this._notifyCallback);
-      s.push(new v(t, t.version, r));
-    } catch (r) {
-      const o = D(r, g, c.EFFECT_EXECUTION_FAILED);
-      if (console.error(o), this._onError)
+      const o = t.subscribe(this._notifyCallback);
+      s.push(new v(t, t.version, o));
+    } catch (o) {
+      const O = S(o, I, h.EFFECT_EXECUTION_FAILED);
+      if (console.error(O), this._onError)
         try {
-          this._onError(o);
+          this._onError(O);
         } catch {
         }
       s.push(new v(t, t.version, void 0));
@@ -720,14 +679,14 @@ class Dt extends tt {
    * Executes effect with tracking.
    */
   execute(t = !1) {
-    if (this.flags & (l.DISPOSED | l.EXECUTING) || !t && this._links.length > 0 && !this._isDirty()) return;
-    this._checkInfiniteLoops(), this.flags |= l.EXECUTING, this._execCleanup(), this._prevLinks = this._links;
-    const e = f.acquire();
-    this._nextLinks = e, this._currentEpoch = z();
+    if (this.flags & (u.DISPOSED | u.EXECUTING) || !t && this._links.length > 0 && !this._isDirty()) return;
+    this._checkInfiniteLoops(), this.flags |= u.EXECUTING, this._execCleanup(), this._prevLinks = this._links;
+    const e = l.acquire();
+    this._nextLinks = e, this._currentEpoch = w();
     let s = !1;
     try {
       const n = _.run(this, this._fn);
-      this._links = e, s = !0, rt(n) ? this._handleAsyncResult(n) : this._cleanup = typeof n == "function" ? n : null;
+      this._links = e, s = !0, it(n) ? this._handleAsyncResult(n) : this._cleanup = typeof n == "function" ? n : null;
     } catch (n) {
       this._links = e, s = !0, this._handleExecutionError(n), this._cleanup = null;
     } finally {
@@ -738,12 +697,12 @@ class Dt extends tt {
     const e = ++this._execId;
     t.then(
       (s) => {
-        if (e !== this._execId || this.flags & l.DISPOSED) {
+        if (e !== this._execId || this.flags & u.DISPOSED) {
           if (typeof s == "function")
             try {
               s();
             } catch (n) {
-              this._handleExecutionError(n, c.EFFECT_CLEANUP_FAILED);
+              this._handleExecutionError(n, h.EFFECT_CLEANUP_FAILED);
             }
           return;
         }
@@ -753,34 +712,25 @@ class Dt extends tt {
     );
   }
   _finalizeDependencies(t, e, s) {
-    if (this._nextLinks = null, this._prevLinks = u, t) {
-      for (let n = 0, r = e.length; n < r; n++) {
-        const o = e[n];
-        o && o.unsub?.();
-      }
-      e !== u && f.release(e);
-    } else
-      this._unsubLinks(s), f.release(s);
+    this._nextLinks = null, this._prevLinks = c, t ? (e.forEach((n) => n?.unsub?.()), e !== c && l.release(e)) : (this._unsubLinks(s), l.release(s));
   }
   _unsubLinks(t) {
-    for (let e = 0, s = t.length; e < s; e++)
-      t[e]?.unsub?.();
+    t.forEach((e) => e?.unsub?.());
   }
   _isDirty() {
     const t = this._links, e = _.current;
     _.current = null;
     try {
-      for (let s = 0, n = t.length; s < n; s++) {
-        const r = t[s], o = r.node;
-        if (o.flags & K.IS_COMPUTED)
+      return t.some((s) => {
+        const n = s.node;
+        if (n.flags & $.IS_COMPUTED)
           try {
-            o.value;
+            n.value;
           } catch {
             return !0;
           }
-        if (o.version !== r.version) return !0;
-      }
-      return !1;
+        return n.version !== s.version;
+      });
     } finally {
       _.current = e;
     }
@@ -790,77 +740,77 @@ class Dt extends tt {
       try {
         this._cleanup();
       } catch (t) {
-        this._handleExecutionError(t, c.EFFECT_CLEANUP_FAILED);
+        this._handleExecutionError(t, h.EFFECT_CLEANUP_FAILED);
       }
       this._cleanup = null;
     }
   }
   _checkInfiniteLoops() {
-    const t = at();
-    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), ft() > p.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
+    const t = _t();
+    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), at() > d.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
   }
   get isDisposed() {
-    return (this.flags & l.DISPOSED) !== 0;
+    return (this.flags & u.DISPOSED) !== 0;
   }
   get executionCount() {
     return this._executionCount;
   }
   get isExecuting() {
-    return (this.flags & l.EXECUTING) !== 0;
+    return (this.flags & u.EXECUTING) !== 0;
   }
   _throwInfiniteLoopError(t) {
-    const e = new g(
-      `Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${H}`
+    const e = new I(
+      `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 = c.EFFECT_EXECUTION_FAILED) {
-    const s = D(t, g, e);
+  _handleExecutionError(t, e = h.EFFECT_EXECUTION_FAILED) {
+    const s = S(t, I, e);
     if (console.error(s), this._onError)
       try {
         this._onError(s);
       } catch (n) {
-        console.error(D(n, g, c.CALLBACK_ERROR_IN_ERROR_HANDLER));
+        console.error(S(n, I, h.CALLBACK_ERROR_IN_ERROR_HANDLER));
       }
   }
 }
-function Rt(i, t = {}) {
+function Nt(i, t = {}) {
   if (typeof i != "function")
-    throw new g(c.EFFECT_MUST_BE_FUNCTION);
-  const e = new Dt(i, t);
+    throw new I(h.EFFECT_MUST_BE_FUNCTION);
+  const e = new St(i, t);
   return e.execute(), e;
 }
-function kt(i) {
+function yt(i) {
   if (typeof i != "function")
     throw new TypeError("Batch callback must be a function");
-  b.startBatch();
+  T.startBatch();
   try {
     return i();
   } finally {
-    b.endBatch();
+    T.endBatch();
   }
 }
 export {
-  V as ATOM_BRAND,
-  A as AsyncState,
-  C as AtomError,
-  it as COMPUTED_BRAND,
-  E as ComputedError,
-  ot as DEBUG_CONFIG,
-  L as DEBUG_RUNTIME,
-  nt as EFFECT_BRAND,
-  g as EffectError,
-  Ct as POOL_CONFIG,
-  p as SCHEDULER_CONFIG,
+  z as ATOM_BRAND,
+  b as AsyncState,
+  D as AtomError,
+  et as COMPUTED_BRAND,
+  f as ComputedError,
+  nt as DEBUG_CONFIG,
+  F as DEBUG_RUNTIME,
+  st as EFFECT_BRAND,
+  I as EffectError,
+  Dt as POOL_CONFIG,
+  d as SCHEDULER_CONFIG,
   m as SchedulerError,
-  Ot as atom,
-  kt as batch,
-  yt as computed,
-  Rt as effect,
-  bt as isAtom,
-  At as isComputed,
-  Nt as isEffect,
-  b as scheduler,
-  Tt as untracked
+  gt as atom,
+  yt as batch,
+  At as computed,
+  Nt as effect,
+  Tt as isAtom,
+  Ot as isComputed,
+  bt as isEffect,
+  T as scheduler,
+  Ct as untracked
 };
 //# sourceMappingURL=index.mjs.map