@but212/atom-effect 0.25.0 → 0.26.0

package/dist/index.mjs

@@ -1,12 +1,12 @@
-var b = {
+var y = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, f = {
+}, c = {
   DISPOSED: 1,
   EXECUTING: 8
-}, x = {
+}, B = {
   DISPOSED: 1,
   IS_COMPUTED: 2,
   DIRTY: 8,
@@ -17,27 +17,27 @@ var b = {
   RECOMPUTING: 256,
   HAS_ERROR: 512,
   FORCE_COMPUTE: 1024
-}, d = {
+}, a = {
   DISPOSED: 1,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, m = {
+}, I = {
   MAX_EXECUTIONS_PER_SECOND: 1e3,
   MAX_EXECUTIONS_PER_EFFECT: 100,
   MAX_EXECUTIONS_PER_FLUSH: 1e4,
   MAX_FLUSH_ITERATIONS: 1e3,
   MIN_FLUSH_ITERATIONS: 10,
   BATCH_QUEUE_SHRINK_THRESHOLD: 1e3
-}, st = {
+}, tt = {
   WARN_INFINITE_LOOP: !0,
   EFFECT_FREQUENCY_WINDOW: 1e3
-}, j = {
+}, $ = {
   MAX_ASYNC_RETRIES: 3,
   MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1
-}, C = {
+}, p = {
   UNINITIALIZED: -1,
   MIN: 1
-}, G = 1073741823, q = { VERSION_BITS: 16 }, Ct = (typeof process < "u" && process.env, !1), W = Object.freeze([]), H = class {
+}, st = 1073741823, j = { VERSION_BITS: 16 }, Ct = (typeof process < "u" && process.env, !1), q = Object.freeze([]), x = class {
   constructor(t, s, e = void 0) {
     this.node = t, this.version = s, this.unsub = e;
   }
@@ -48,23 +48,23 @@ var b = {
   notify(t, s) {
     this.fn ? this.fn(t, s) : this.sub && this.sub.execute();
   }
-}, A = class extends Error {
+}, T = class extends Error {
   constructor(t, s = null, e = !0) {
     super(t), this.cause = s, this.recoverable = e, this.name = "AtomError";
   }
-}, S = class extends A {
+}, v = class extends T {
   constructor(t, s = null) {
     super(t, s, !0), this.name = "ComputedError";
   }
-}, D = class extends A {
+}, D = class extends T {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "EffectError";
   }
-}, R = class extends A {
+}, R = class extends T {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "SchedulerError";
   }
-}, l = {
+}, h = {
   COMPUTED_MUST_BE_FUNCTION: "Computed target must be a function",
   COMPUTED_ASYNC_PENDING_NO_DEFAULT: "Async computation pending with no default value",
   COMPUTED_COMPUTATION_FAILED: "Computation execution failed",
@@ -85,7 +85,7 @@ var b = {
   BATCH_CALLBACK_MUST_BE_FUNCTION: "Batch callback must be a function"
 }, et = class {
   constructor() {
-    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow = null;
+    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow = null, this._freeIndices = null;
   }
   get size() {
     return this._count;
@@ -156,13 +156,13 @@ var b = {
     const e = this._overflow;
     if (e !== null && s > 4) {
       const i = t > 4 ? t - 4 : 0, n = e.length;
-      for (let r = i; r < n; r++) {
-        const o = e[r];
-        o != null && (this._onItemRemoved(o), e[r] = null);
+      for (let o = i; o < n; o++) {
+        const r = e[o];
+        r != null && (this._onItemRemoved(r), e[o] = null);
       }
       t <= 4 ? (e.length = 0, this._overflow = null) : e.length = t - 4;
     }
-    this._count = t;
+    this._freeIndices !== null && (this._freeIndices = null), this._count = t;
   }
   _onItemRemoved(t) {
   }
@@ -183,14 +183,13 @@ var b = {
       this._s3 = t, this._count++;
       return;
     }
+    this._addToOverflow(t);
+  }
+  _addToOverflow(t) {
     if (this._overflow === null) this._overflow = [t];
     else {
-      const s = this._overflow;
-      for (let e = 0, i = s.length; e < i; e++) if (s[e] === null) {
-        s[e] = t, this._count++;
-        return;
-      }
-      s.push(t);
+      const s = this._freeIndices;
+      s !== null && s.length > 0 ? this._overflow[s.pop()] = t : this._overflow.push(t);
     }
     this._count++;
   }
@@ -206,48 +205,32 @@ var b = {
     const s = this._overflow;
     if (s == null) return !1;
     for (let e = 0, i = s.length; e < i; e++) if (s[e] === t)
-      return s[e] = null, this._count--, !0;
+      return s[e] = null, this._count--, this._freeIndices === null && (this._freeIndices = []), this._freeIndices.push(e), !0;
     return !1;
   }
   has(t) {
-    const s = this._count;
-    if (s === 0) return !1;
+    if (this._count === 0) return !1;
     if (this._s0 === t || this._s1 === t || this._s2 === t || this._s3 === t) return !0;
-    if (s <= 4) return !1;
-    const e = this._overflow;
-    if (e != null) {
-      let i = 0;
-      this._s0 != null && i++, this._s1 != null && i++, this._s2 != null && i++, this._s3 != null && i++;
-      for (let n = 0, r = e.length; n < r; n++) {
-        const o = e[n];
-        if (o != null) {
-          if (o === t) return !0;
-          if (++i === s) break;
-        }
-      }
+    const s = this._overflow;
+    if (s != null) {
+      for (let e = 0, i = s.length; e < i; e++) if (s[e] === t) return !0;
     }
     return !1;
   }
   forEach(t) {
-    const s = this._count;
-    if (s === 0) return;
-    const e = this._s0;
+    if (this._count === 0) return;
+    const s = this._s0;
+    s != null && t(s);
+    const e = this._s1;
     e != null && t(e);
-    const i = this._s1;
+    const i = this._s2;
     i != null && t(i);
-    const n = this._s2;
+    const n = this._s3;
     n != null && t(n);
-    const r = this._s3;
-    if (r != null && t(r), s <= 4) return;
     const o = this._overflow;
-    if (o != null) {
-      let h = 0;
-      e != null && h++, i != null && h++, n != null && h++, r != null && h++;
-      for (let u = 0, a = o.length; u < a; u++) {
-        const c = o[u];
-        if (c != null && (t(c), ++h === s))
-          return;
-      }
+    if (o != null) for (let r = 0, u = o.length; r < u; r++) {
+      const l = o[r];
+      l != null && t(l);
     }
   }
   forEachIndexed(t) {
@@ -258,15 +241,14 @@ var b = {
     i != null && (t(i), e++);
     const n = this._s1;
     n != null && (t(n), e++);
-    const r = this._s2;
-    r != null && (t(r), e++);
-    const o = this._s3;
-    if (o != null && (t(o), e++), s <= 4 || e === s) return e;
-    const h = this._overflow;
-    if (h != null) for (let u = 0, a = h.length; u < a; u++) {
-      const c = h[u];
-      if (c != null && (t(c), ++e === s))
-        break;
+    const o = this._s2;
+    o != null && (t(o), e++);
+    const r = this._s3;
+    if (r != null && (t(r), e++), e === s) return e;
+    const u = this._overflow;
+    if (u != null) for (let l = 0, O = u.length; l < O; l++) {
+      const Y = u[l];
+      Y != null && (t(Y), e++);
     }
     return e;
   }
@@ -275,44 +257,44 @@ var b = {
     if (t === null || t.length === 0) return;
     let s = 0;
     for (; s < t.length; ) if (t[s] === null) {
-      const e = t.pop();
-      s < t.length && e != null && (t[s] = e);
+      for (; t.length > s && t[t.length - 1] === null; ) t.pop();
+      t.length > s && (t[s] = t.pop(), s++);
     } else s++;
-    t.length === 0 && (this._overflow = null);
+    this._freeIndices = null, t.length === 0 && (this._overflow = null);
   }
   clear() {
-    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow !== null && (this._overflow.length = 0, this._overflow = null);
+    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._overflow !== null && (this._overflow.length = 0, this._overflow = null), this._freeIndices = null;
   }
   dispose() {
     this.clear();
   }
-}, K = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), lt = /* @__PURE__ */ Symbol("AtomEffect.Id"), Z = /* @__PURE__ */ Symbol("AtomEffect.Type"), U = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), X = {
+}, W = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), lt = /* @__PURE__ */ Symbol("AtomEffect.Id"), K = /* @__PURE__ */ Symbol("AtomEffect.Type"), b = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), G = {
   enabled: !1,
-  warnInfiniteLoop: st.WARN_INFINITE_LOOP,
+  warnInfiniteLoop: tt.WARN_INFINITE_LOOP,
   warn(t, s) {
   },
   attachDebugInfo(t, s, e) {
   },
-  getDebugName: (t) => t?.[K],
-  getDebugType: (t) => t?.[Z]
+  getDebugName: (t) => t?.[W],
+  getDebugType: (t) => t?.[K]
 }, _t = 1, ct = () => _t++;
-function T(t, s, e) {
-  if (t instanceof A) return t;
-  const i = t instanceof Error, n = i ? t.message : String(t), r = i ? t : void 0;
-  return new s(`${i ? t.constructor.name : "Unexpected error"} (${e}): ${n}`, r);
+function g(t, s, e) {
+  if (t instanceof T) return t;
+  const i = t instanceof Error, n = i ? t.message : String(t), o = i ? t : void 0;
+  return new s(`${i ? t.constructor.name : "Unexpected error"} (${e}): ${n}`, o);
 }
-var V = class {
+var X = class {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = C.UNINITIALIZED, this._notifying = 0, this._hotIndex = -1, this._slots = null, this._deps = null, this.id = ct() & G;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = p.UNINITIALIZED, this._notifying = 0, this._hotIndex = -1, this._slots = null, this._deps = null, this.id = ct() & st;
   }
   subscribe(t) {
     const s = typeof t == "function";
-    if (!s && (!t || typeof t.execute != "function")) throw T(/* @__PURE__ */ new TypeError("Invalid subscriber"), A, l.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
+    if (!s && (!t || typeof t.execute != "function")) throw g(/* @__PURE__ */ new TypeError("Invalid subscriber"), T, h.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
     let e = this._slots;
     e || (e = new et(), this._slots = e);
     let i = !1;
-    if (e.forEach((r) => {
-      (s ? r.fn === t : r.sub === t) && (i = !0);
+    if (e.forEach((o) => {
+      (s ? o.fn === t : o.sub === t) && (i = !0);
     }), i)
       return () => {
       };
@@ -340,7 +322,7 @@ var V = class {
           try {
             i.notify(t, s);
           } catch (n) {
-            console.error(T(n, A, l.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+            console.error(g(n, T, h.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
           }
         });
       } finally {
@@ -357,20 +339,25 @@ var V = class {
     }
     return !t.hasComputeds && !t.isDirtyFast() ? !1 : this._deepDirtyCheck();
   }
-}, w = 0, Q = () => (w = w + 1 & 1073741823 || 1, w), z = (t) => t + 1 & G, Y = 0, F = !1, it = 0, nt = () => it;
-function J() {
-  return F ? !1 : (F = !0, it = Q(), Y = 0, !0);
+}, U = 0, k = () => (U = U + 1 & 1073741823 || 1, U), H = (t) => t + 1 & 1073741823 || 1, V = 0, F = !1, it = 0, nt = () => it;
+function Z() {
+  return F ? !1 : (F = !0, it = k(), V = 0, !0);
 }
-var tt = () => {
+var J = () => {
   F = !1;
-}, ft = () => F ? ++Y : 0, L = /* @__PURE__ */ (function(t) {
+}, ft = () => {
+  if (!F) return 0;
+  const t = ++V;
+  if (t > I.MAX_EXECUTIONS_PER_FLUSH) throw new Error(`[atom-effect] Infinite loop detected: flush execution count exceeded ${I.MAX_EXECUTIONS_PER_FLUSH}`);
+  return t;
+}, w = /* @__PURE__ */ (function(t) {
   return t[t.IDLE = 0] = "IDLE", t[t.BATCHING = 1] = "BATCHING", t[t.FLUSHING = 2] = "FLUSHING", t;
 })({}), at = class {
   constructor() {
-    this._queueBuffer = [[], []], this._bufferIndex = 0, this._size = 0, this._epoch = 0, this._isProcessing = !1, this._isBatching = !1, this._isFlushingSync = !1, this._batchDepth = 0, this._batchQueue = [], this._batchQueueSize = 0, this._maxFlushIterations = m.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
+    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 ? L.FLUSHING : this._isBatching ? L.BATCHING : L.IDLE;
+    return this._isProcessing || this._isFlushingSync ? w.FLUSHING : this._isBatching ? w.BATCHING : w.IDLE;
   }
   get queueSize() {
     return this._size;
@@ -393,19 +380,19 @@ var tt = () => {
   _runLoop() {
     try {
       if (this._size === 0) return;
-      const t = J();
-      this._drainQueue(), t && tt();
+      const t = Z();
+      this._drainQueue(), t && J();
     } finally {
       this._isProcessing = !1, this._size > 0 && !this._isBatching && this._flush();
     }
   }
   _flushSync() {
     this._isFlushingSync = !0;
-    const t = J();
+    const t = Z();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this._isFlushingSync = !1, t && tt();
+      this._isFlushingSync = !1, t && J();
     }
   }
   _mergeBatchQueue() {
@@ -413,8 +400,8 @@ var tt = () => {
     const t = ++this._epoch, s = this._batchQueue, e = this._queueBuffer[this._bufferIndex];
     let i = this._size;
     for (let n = 0; n < this._batchQueueSize; n++) {
-      const r = s[n];
-      r._nextEpoch !== t && (r._nextEpoch = t, e[i++] = r);
+      const o = s[n];
+      o._nextEpoch !== t && (o._nextEpoch = t, e[i++] = o);
     }
     this._size = i, this._batchQueueSize = 0, s.length = 0;
   }
@@ -441,7 +428,7 @@ var tt = () => {
   }
   _handleFlushOverflow() {
     const t = this._size + this._batchQueueSize;
-    if (console.error(new R(l.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t))), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow) try {
+    if (console.error(new R(h.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t))), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow) try {
       this.onOverflow(t);
     } catch {
     }
@@ -453,10 +440,10 @@ var tt = () => {
     this._batchDepth !== 0 && --this._batchDepth === 0 && (this._flushSync(), this._isBatching = !1);
   }
   setMaxFlushIterations(t) {
-    if (t < m.MIN_FLUSH_ITERATIONS) throw new R(`Max flush iterations must be at least ${m.MIN_FLUSH_ITERATIONS}`);
+    if (t < I.MIN_FLUSH_ITERATIONS) throw new R(`Max flush iterations must be at least ${I.MIN_FLUSH_ITERATIONS}`);
     this._maxFlushIterations = t;
   }
-}, y = new at(), $ = /* @__PURE__ */ Symbol.for("atom-effect/atom"), rt = /* @__PURE__ */ Symbol.for("atom-effect/computed"), ot = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Et = /* @__PURE__ */ Symbol.for("atom-effect/writable"), _ = {
+}, A = new at(), Q = /* @__PURE__ */ Symbol.for("atom-effect/atom"), rt = /* @__PURE__ */ Symbol.for("atom-effect/computed"), ot = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Et = /* @__PURE__ */ Symbol.for("atom-effect/writable"), _ = {
   current: null,
   run(t, s) {
     const e = this.current;
@@ -468,7 +455,7 @@ var tt = () => {
     }
   }
 };
-function vt(t) {
+function Dt(t) {
   const s = _.current;
   if (s === null) return t();
   _.current = null;
@@ -478,9 +465,9 @@ function vt(t) {
     _.current = s;
   }
 }
-var dt = class extends V {
+var dt = class extends X {
   constructor(t, s) {
-    super(), this[$] = !0, this[Et] = !0, this._value = t, this._pendingOldValue = void 0, s && (this.flags |= d.SYNC), X.attachDebugInfo(this, "atom", this.id);
+    super(), this[Q] = !0, this[Et] = !0, this._value = t, this._pendingOldValue = void 0, s && (this.flags |= a.SYNC), G.attachDebugInfo(this, "atom", this.id);
   }
   get value() {
     const t = _.current;
@@ -489,31 +476,31 @@ var dt = class extends V {
   set value(t) {
     const s = this._value;
     if (Object.is(s, t)) return;
-    this._value = t, this.version = z(this.version);
+    this._value = t, this.version = H(this.version);
     const e = this._slots, i = this.flags;
-    if (e == null || e.size === 0 || i & d.NOTIFICATION_SCHEDULED) return;
+    if (e == null || e.size === 0 || i & a.NOTIFICATION_SCHEDULED) return;
     this._pendingOldValue = s;
-    const n = i | d.NOTIFICATION_SCHEDULED;
-    if (this.flags = n, (n & d.SYNC) !== 0 && !y.isBatching) {
+    const n = i | a.NOTIFICATION_SCHEDULED;
+    if (this.flags = n, (n & a.SYNC) !== 0 && !A.isBatching) {
       this._flushNotifications();
       return;
     }
-    y.schedule(this);
+    A.schedule(this);
   }
   execute() {
     this._flushNotifications();
   }
   _flushNotifications() {
     const t = this.flags;
-    if (!(t & d.NOTIFICATION_SCHEDULED) || t & d.DISPOSED) return;
+    if (!(t & a.NOTIFICATION_SCHEDULED) || t & a.DISPOSED) return;
     const s = this._pendingOldValue;
-    this._pendingOldValue = void 0, this.flags &= ~d.NOTIFICATION_SCHEDULED, this._notifySubscribers(this._value, s);
+    this._pendingOldValue = void 0, this.flags &= ~a.NOTIFICATION_SCHEDULED, this._notifySubscribers(this._value, s);
   }
   peek() {
     return this._value;
   }
   dispose() {
-    this.flags & d.DISPOSED || (this._slots?.clear(), this.flags |= d.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
+    this.flags & a.DISPOSED || (this._slots?.clear(), this.flags |= a.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
   }
   _deepDirtyCheck() {
     return !1;
@@ -522,10 +509,10 @@ var dt = class extends V {
     this.dispose();
   }
 };
-function Dt(t, s = {}) {
+function vt(t, s = {}) {
   return new dt(t, s.sync ?? !1);
 }
-var k = class extends et {
+var z = class extends et {
   constructor() {
     super(), this._map = null, this._SCAN_THRESHOLD = 32, this.hasComputeds = !1, this._depsHash = 0, this._map = null, this.hasComputeds = !1, this._depsHash = 0;
   }
@@ -543,44 +530,44 @@ var k = class extends et {
     if (this._map !== null || i > this._SCAN_THRESHOLD) return this._claimViaMap(t, s);
     if (s < 4) switch (s) {
       case 0: {
-        const o = this._s0;
-        if (o && o.node === t && o.unsub)
-          return o.version = t.version, !0;
+        const r = this._s0;
+        if (r && r.node === t && r.unsub)
+          return r.version = t.version, !0;
       }
       case 1:
         if (e > 1) {
-          const o = this._s1;
-          if (o && o.node === t && o.unsub)
-            return o.version = t.version, s !== 1 && (this._s1 = this._s0, this._s0 = o), !0;
+          const r = this._s1;
+          if (r && r.node === t && r.unsub)
+            return r.version = t.version, s !== 1 && (this._s1 = this._s0, this._s0 = r), !0;
         }
       case 2:
         if (e > 2) {
-          const o = this._s2;
-          if (o && o.node === t && o.unsub) {
-            if (o.version = t.version, s !== 2) {
-              const h = s === 0 ? this._s0 : this._s1;
-              s === 0 ? this._s0 = o : this._s1 = o, this._s2 = h;
+          const r = this._s2;
+          if (r && r.node === t && r.unsub) {
+            if (r.version = t.version, s !== 2) {
+              const u = s === 0 ? this._s0 : this._s1;
+              s === 0 ? this._s0 = r : this._s1 = r, this._s2 = u;
             }
             return !0;
           }
         }
       case 3:
         if (e > 3) {
-          const o = this._s3;
-          if (o && o.node === t && o.unsub) {
-            if (o.version = t.version, s !== 3) {
-              let h;
-              s === 0 ? (h = this._s0, this._s0 = o) : s === 1 ? (h = this._s1, this._s1 = o) : (h = this._s2, this._s2 = o), this._s3 = h;
+          const r = this._s3;
+          if (r && r.node === t && r.unsub) {
+            if (r.version = t.version, s !== 3) {
+              let u;
+              s === 0 ? (u = this._s0, this._s0 = r) : s === 1 ? (u = this._s1, this._s1 = r) : (u = this._s2, this._s2 = r), this._s3 = u;
             }
             return !0;
           }
         }
     }
-    const n = s > 4 ? s : 4, r = this._overflow;
-    if (r) for (let o = n - 4, h = r.length; o < h; o++) {
-      const u = r[o];
-      if (u && u.node === t && u.unsub)
-        return u.version = t.version, this._swapGeneral(o + 4, s, u), !0;
+    const n = s > 4 ? s : 4, o = this._overflow;
+    if (o) for (let r = n - 4, u = o.length; r < u; r++) {
+      const l = o[r];
+      if (l && l.node === t && l.unsub)
+        return l.version = t.version, this._swapGeneral(r + 4, s, l), !0;
     }
     return !1;
   }
@@ -589,12 +576,12 @@ var k = class extends et {
       this._map = /* @__PURE__ */ new Map();
       const n = this._count;
       s < 4 && (s <= 0 && this._s0?.unsub && this._map.set(this._s0.node, 0), s <= 1 && this._s1?.unsub && this._map.set(this._s1.node, 1), s <= 2 && this._s2?.unsub && this._map.set(this._s2.node, 2), s <= 3 && this._s3?.unsub && this._map.set(this._s3.node, 3));
-      const r = this._overflow;
-      if (r && n > 4) {
-        const o = s > 4 ? s : 4;
-        for (let h = o - 4, u = r.length; h < u; h++) {
-          const a = r[h];
-          a?.unsub && this._map.set(a.node, h + 4);
+      const o = this._overflow;
+      if (o && n > 4) {
+        const r = s > 4 ? s : 4;
+        for (let u = r - 4, l = o.length; u < l; u++) {
+          const O = o[u];
+          O?.unsub && this._map.set(O.node, u + 4);
         }
       }
     }
@@ -608,10 +595,6 @@ var k = class extends et {
     }
     return !0;
   }
-  _swapInline(t, s, e) {
-    const i = this.getAt(s);
-    this.setAt(s, e), this.setAt(t, i);
-  }
   _swapGeneral(t, s, e) {
     if (t === s) return;
     const i = this.getAt(s);
@@ -628,7 +611,7 @@ var k = class extends et {
     const e = this._count;
     if (t < e) {
       const i = this.getAt(t);
-      i != null && (this.add(i), this._map !== null && i.unsub && this._map.set(i.node, this._count - 1));
+      i != null && (this._addToOverflow(i), this._map !== null && i.unsub && this._map.set(i.node, this._count - 1));
     }
     if (t === 0) this._s0 = s;
     else if (t === 1) this._s1 = s;
@@ -644,70 +627,64 @@ var k = class extends et {
     t >= this._count || (super.truncateFrom(t), this._map !== null && (this._map.clear(), this._map = null));
   }
   seal() {
-    const t = this._count, s = q.VERSION_BITS;
+    const t = this._count;
+    if (t === 0) {
+      this._depsHash = 0;
+      return;
+    }
+    const s = j.VERSION_BITS;
     let e = 0;
-    switch (t) {
-      case 0:
-        this._depsHash = 0;
-        return;
-      case 1: {
-        const i = this._s0;
-        e = e + (i.version << s) + i.node.id | 0;
-        break;
-      }
-      case 2: {
-        const i = this._s0, n = this._s1;
-        e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0;
-        break;
-      }
-      case 3: {
-        const i = this._s0, n = this._s1, r = this._s2;
-        e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0, e = e + (r.version << s) + r.node.id | 0;
-        break;
-      }
-      default: {
-        const i = this._s0, n = this._s1, r = this._s2, o = this._s3;
-        if (e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0, e = e + (r.version << s) + r.node.id | 0, e = e + (o.version << s) + o.node.id | 0, t > 4) {
-          const h = this._overflow;
-          for (let u = 0, a = h.length; u < a; u++) {
-            const c = h[u];
-            e = e + (c.version << s) + c.node.id | 0;
-          }
-        }
+    if (t >= 1) {
+      const i = this._s0;
+      e = e + (i.version << s) + i.node.id | 0;
+    }
+    if (t >= 2) {
+      const i = this._s1;
+      e = e + (i.version << s) + i.node.id | 0;
+    }
+    if (t >= 3) {
+      const i = this._s2;
+      e = e + (i.version << s) + i.node.id | 0;
+    }
+    if (t >= 4) {
+      const i = this._s3;
+      e = e + (i.version << s) + i.node.id | 0;
+    }
+    if (t > 4) {
+      const i = this._overflow;
+      for (let n = 0, o = i.length; n < o; n++) {
+        const r = i[n];
+        e = e + (r.version << s) + r.node.id | 0;
       }
     }
     this._depsHash = e;
   }
   isDirtyFast() {
-    const t = this._count, s = q.VERSION_BITS;
+    const t = this._count;
+    if (t === 0) return !1;
+    const s = j.VERSION_BITS;
     let e = 0;
-    switch (t) {
-      case 0:
-        return !1;
-      case 1: {
-        const i = this._s0.node;
-        e = e + (i.version << s) + i.id | 0;
-        break;
-      }
-      case 2: {
-        const i = this._s0.node, n = this._s1.node;
-        e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0;
-        break;
-      }
-      case 3: {
-        const i = this._s0.node, n = this._s1.node, r = this._s2.node;
-        e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0, e = e + (r.version << s) + r.id | 0;
-        break;
-      }
-      default: {
-        const i = this._s0.node, n = this._s1.node, r = this._s2.node, o = this._s3.node;
-        if (e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0, e = e + (r.version << s) + r.id | 0, e = e + (o.version << s) + o.id | 0, t > 4) {
-          const h = this._overflow;
-          for (let u = 0, a = h.length; u < a; u++) {
-            const c = h[u].node;
-            e = e + (c.version << s) + c.id | 0;
-          }
-        }
+    if (t >= 1) {
+      const i = this._s0.node;
+      e = e + (i.version << s) + i.id | 0;
+    }
+    if (t >= 2) {
+      const i = this._s1.node;
+      e = e + (i.version << s) + i.id | 0;
+    }
+    if (t >= 3) {
+      const i = this._s2.node;
+      e = e + (i.version << s) + i.id | 0;
+    }
+    if (t >= 4) {
+      const i = this._s3.node;
+      e = e + (i.version << s) + i.id | 0;
+    }
+    if (t > 4) {
+      const i = this._overflow;
+      for (let n = 0, o = i.length; n < o; n++) {
+        const r = i[n].node;
+        e = e + (r.version << s) + r.id | 0;
       }
     }
     return e !== this._depsHash;
@@ -722,21 +699,21 @@ var k = class extends et {
   }
 };
 function St(t) {
-  return t !== null && typeof t == "object" && $ in t;
+  return t !== null && typeof t == "object" && Q in t;
 }
 function gt(t) {
   return t !== null && typeof t == "object" && rt in t;
 }
-function mt(t) {
+function Tt(t) {
   return t !== null && typeof t == "object" && ot in t;
 }
 function ht(t) {
   return t !== null && typeof t == "object" && typeof t.then == "function";
 }
-var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, RECOMPUTING: O, DISPOSED: M, IS_COMPUTED: P, FORCE_COMPUTE: B } = x, pt = class extends V {
+var { IDLE: d, DIRTY: f, PENDING: S, RESOLVED: E, REJECTED: C, HAS_ERROR: m, RECOMPUTING: N, DISPOSED: L, IS_COMPUTED: M, FORCE_COMPUTE: P } = B, pt = class extends X {
   constructor(t, s = {}) {
-    if (typeof t != "function") throw new S(l.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this[$] = !0, this[rt] = !0, this._error = null, this._promiseId = 0, this._deps = new k(), this._asyncRetryCount = 0, this._lastDriftEpoch = C.UNINITIALIZED, this._trackEpoch = C.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = P | E | I, this._equal = s.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in s ? s.defaultValue : U, this._onError = s.onError ?? null, this._maxAsyncRetries = (s.maxAsyncRetries ?? j.MAX_ASYNC_RETRIES) & G, X.attachDebugInfo(this, "computed", this.id), s.lazy === !1) try {
+    if (typeof t != "function") throw new v(h.COMPUTED_MUST_BE_FUNCTION);
+    if (super(), this[Q] = !0, this[rt] = !0, this._error = null, this._promiseId = 0, this._deps = new z(), this._asyncRetryCount = 0, this._lastDriftEpoch = p.UNINITIALIZED, this._trackEpoch = p.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = M | f | d, this._equal = s.equal ?? Object.is, this._fn = t, this._defaultValue = "defaultValue" in s ? s.defaultValue : b, this._onError = s.onError ?? null, this._maxAsyncRetries = (s.maxAsyncRetries ?? $.MAX_ASYNC_RETRIES) & st, G.attachDebugInfo(this, "computed", this.id), s.lazy === !1) try {
       this._recompute();
     } catch {
     }
@@ -747,20 +724,20 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
   get value() {
     this._track();
     const t = this.flags;
-    if ((t & (p | E | I)) === p) return this._value;
-    if (t & M) throw new S(l.COMPUTED_DISPOSED);
-    if (t & O) {
-      if (this._defaultValue !== U) return this._defaultValue;
-      throw new S(l.COMPUTED_CIRCULAR_DEPENDENCY);
+    if ((t & (E | f | d)) === E) return this._value;
+    if (t & L) throw new v(h.COMPUTED_DISPOSED);
+    if (t & N) {
+      if (this._defaultValue !== b) return this._defaultValue;
+      throw new v(h.COMPUTED_CIRCULAR_DEPENDENCY);
     }
-    if (t & (E | I) && ((t & I) === 0 && (t & B) === 0 && this._deps.size > 0 && !this._isDirty() ? this.flags &= ~E : this._recompute(), this.flags & p))
+    if (t & (f | d) && ((t & d) === 0 && (t & P) === 0 && this._deps.size > 0 && !this._isDirty() ? this.flags &= ~f : this._recompute(), this.flags & E))
       return this._value;
-    const s = this._defaultValue, e = s !== U;
-    if (this.flags & g) {
+    const s = this._defaultValue, e = s !== b;
+    if (this.flags & S) {
       if (e) return s;
-      throw new S(l.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+      throw new v(h.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
     }
-    if (this.flags & v) {
+    if (this.flags & C) {
       if (e) return s;
       throw this._error;
     }
@@ -772,16 +749,16 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
   get state() {
     this._track();
     const t = this.flags;
-    return t & p ? b.RESOLVED : t & g ? b.PENDING : t & v ? b.REJECTED : b.IDLE;
+    return t & E ? y.RESOLVED : t & S ? y.PENDING : t & C ? y.REJECTED : y.IDLE;
   }
   get hasError() {
-    if (this._track(), this.flags & (v | N)) return !0;
+    if (this._track(), this.flags & (C | m)) return !0;
     const t = this._deps;
     if (!t.hasComputeds) return !1;
     const s = t.size;
     for (let e = 0; e < s; e++) {
       const i = t.getAt(e);
-      if (i != null && i.node.flags & N) return !0;
+      if (i != null && i.node.flags & m) return !0;
     }
     return !1;
   }
@@ -793,37 +770,37 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
     const t = [];
     this._error && t.push(this._error);
     const s = this._deps;
-    if (!s.hasComputeds) return t.length === 0 ? W : Object.freeze(t);
+    if (!s.hasComputeds) return t.length === 0 ? q : Object.freeze(t);
     const e = s.size;
     for (let i = 0; i < e; i++) {
       const n = s.getAt(i);
       if (n == null) continue;
-      const r = n.node;
-      r.flags & N && this._collectErrorsFromDep(r, t);
+      const o = n.node;
+      o.flags & m && this._collectErrorsFromDep(o, t);
     }
-    return t.length === 0 ? W : Object.freeze(t);
+    return t.length === 0 ? q : Object.freeze(t);
   }
   _collectErrorsFromDep(t, s) {
     const e = t.errors, i = e.length;
     for (let n = 0; n < i; n++) {
-      const r = e[n];
-      r != null && !s.includes(r) && s.push(r);
+      const o = e[n];
+      o != null && !s.includes(o) && s.push(o);
     }
   }
   get lastError() {
     return this._track(), this._error;
   }
   get isPending() {
-    return this._track(), (this.flags & g) !== 0;
+    return this._track(), (this.flags & S) !== 0;
   }
   get isResolved() {
-    return this._track(), (this.flags & p) !== 0;
+    return this._track(), (this.flags & E) !== 0;
   }
   invalidate() {
-    this.flags |= B, this._markDirty();
+    this.flags |= P, this._markDirty();
   }
   dispose() {
-    this.flags & M || (this._deps.disposeAll(), this._slots?.clear(), this.flags = M | E | I, this._error = null, this._value = void 0, this._hotIndex = -1);
+    this.flags & L || (this._deps.disposeAll(), this._slots?.clear(), this.flags = L | f | d, this._error = null, this._value = void 0, this._hotIndex = -1);
   }
   [Symbol.dispose]() {
     this.dispose();
@@ -834,14 +811,14 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
     const s = this._trackCount, e = this._deps.getAt(s);
     if (e != null && e.node === t) e.version = t.version;
     else if (!this._deps.claimExisting(t, s)) {
-      const i = new H(t, t.version, t.subscribe(this));
+      const i = new x(t, t.version, t.subscribe(this));
       this._deps.insertNew(s, i);
     }
-    t.flags & P && (this._deps.hasComputeds = !0), this._trackCount = s + 1;
+    t.flags & M && (this._deps.hasComputeds = !0), this._trackCount = s + 1;
   }
   _recompute() {
-    if (this.flags & O) return;
-    this.flags = (this.flags | O) & ~B, this._trackEpoch = Q(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
+    if (this.flags & N) return;
+    this.flags = (this.flags | N) & ~P, this._trackEpoch = k(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
     let t = !1;
     try {
       const s = _.run(this, this._fn);
@@ -851,42 +828,42 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
         this._deps.truncateFrom(this._trackCount);
       } catch {
       }
-      this._handleError(s, l.COMPUTED_COMPUTATION_FAILED, !0);
+      this._handleError(s, h.COMPUTED_COMPUTATION_FAILED, !0);
     } finally {
-      this._trackEpoch = C.UNINITIALIZED, this._trackCount = 0, this.flags &= ~O;
+      this._trackEpoch = p.UNINITIALIZED, this._trackCount = 0, this.flags &= ~N;
     }
   }
   _handleAsyncComputation(t) {
-    this.flags = (this.flags | g) & ~(I | E | p | v), this._notifySubscribers(void 0, void 0), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % j.MAX_PROMISE_ID;
+    this.flags = (this.flags | S) & ~(d | f | E | C), this._notifySubscribers(void 0, void 0), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % $.MAX_PROMISE_ID;
     const s = this._promiseId;
     t.then((e) => {
       if (s === this._promiseId) {
         if (this._isDirty()) {
           const i = nt();
-          return this._lastDriftEpoch !== i && (this._lastDriftEpoch = i, this._asyncRetryCount = 0), this._asyncRetryCount++ < this._maxAsyncRetries ? this._markDirty() : this._handleError(new S(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`), l.COMPUTED_ASYNC_COMPUTATION_FAILED);
+          return this._lastDriftEpoch !== i && (this._lastDriftEpoch = i, this._asyncRetryCount = 0), this._asyncRetryCount++ < this._maxAsyncRetries ? this._markDirty() : this._handleError(new v(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`), h.COMPUTED_ASYNC_COMPUTATION_FAILED);
         }
         this._finalizeResolution(e), this._notifySubscribers(e, void 0);
       }
-    }, (e) => s === this._promiseId && this._handleError(e, l.COMPUTED_ASYNC_COMPUTATION_FAILED));
+    }, (e) => s === this._promiseId && this._handleError(e, h.COMPUTED_ASYNC_COMPUTATION_FAILED));
   }
   _handleError(t, s, e = !1) {
-    const i = T(t, S, s);
-    if (!e && !(this.flags & v) && (this.version = z(this.version)), this._error = i, this.flags = this.flags & ~(I | E | g | p) | v | N, this._onError) try {
+    const i = g(t, v, s);
+    if (!e && !(this.flags & C) && (this.version = H(this.version)), this._error = i, this.flags = this.flags & ~(d | f | S | E) | C | m, this._onError) try {
       this._onError(i);
     } catch (n) {
-      console.error(l.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
+      console.error(h.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
     }
     if (e) throw i;
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(t) {
-    (!(this.flags & p) || !this._equal(this._value, t)) && (this.version = z(this.version)), this._value = t, this._error = null, this.flags = (this.flags | p) & ~(I | E | g | v | N);
+    (!(this.flags & E) || !this._equal(this._value, t)) && (this.version = H(this.version)), this._value = t, this._error = null, this.flags = (this.flags | E) & ~(d | f | S | C | m);
   }
   execute() {
     this._markDirty();
   }
   _markDirty() {
-    this.flags & (O | E) || (this.flags |= E, this._notifySubscribers(void 0, void 0));
+    this.flags & (N | f) || (this.flags |= f, this._notifySubscribers(void 0, void 0));
   }
   _isDirty() {
     const t = this._deps;
@@ -900,12 +877,12 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
       for (let i = 0; i < e; i++) {
         const n = t.getAt(i);
         if (n == null) continue;
-        const r = n.node;
-        if (r.flags & P) try {
-          r.value;
+        const o = n.node;
+        if (o.flags & M) try {
+          o.value;
         } catch {
         }
-        if (r.version !== n.version)
+        if (o.version !== n.version)
           return this._hotIndex = i, !0;
       }
       return this._hotIndex = -1, !1;
@@ -914,52 +891,52 @@ var { IDLE: I, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: N, REC
     }
   }
 };
-function Tt(t, s = {}) {
+function mt(t, s = {}) {
   return new pt(t, s);
 }
-var It = class extends V {
+var It = class extends X {
   constructor(t, s = {}) {
-    super(), this[ot] = !0, this._cleanup = null, this._deps = new k(), this._currentEpoch = C.UNINITIALIZED, this._lastFlushEpoch = C.UNINITIALIZED, this._fn = t, this._onError = s.onError ?? null, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? m.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? m.MAX_EXECUTIONS_PER_EFFECT, this._cleanup = null, this._deps = new k(), this._currentEpoch = C.UNINITIALIZED, this._lastFlushEpoch = C.UNINITIALIZED, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._trackCount = 0, this._sync ? this._notifyCallback = () => this.execute() : this._notifyCallback = () => y.schedule(this), X.attachDebugInfo(this, "effect", this.id);
+    super(), this[ot] = !0, this._cleanup = null, this._deps = new z(), this._currentEpoch = p.UNINITIALIZED, this._lastFlushEpoch = p.UNINITIALIZED, this._fn = t, this._onError = s.onError ?? null, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? I.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? I.MAX_EXECUTIONS_PER_EFFECT, this._cleanup = null, this._deps = new z(), this._currentEpoch = p.UNINITIALIZED, this._lastFlushEpoch = p.UNINITIALIZED, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._trackCount = 0, this._sync ? this._notifyCallback = () => this.execute() : this._notifyCallback = () => A.schedule(this), G.attachDebugInfo(this, "effect", this.id);
   }
   run() {
-    if (this.flags & f.DISPOSED) throw new D(l.EFFECT_DISPOSED);
+    if (this.flags & c.DISPOSED) throw new D(h.EFFECT_DISPOSED);
     this.execute(!0);
   }
   dispose() {
-    this.flags & f.DISPOSED || (this.flags |= f.DISPOSED, this._execCleanup(), this._deps?.disposeAll());
+    this.flags & c.DISPOSED || (this.flags |= c.DISPOSED, this._execCleanup(), this._deps?.disposeAll());
   }
   [Symbol.dispose]() {
     this.dispose();
   }
   addDependency(t) {
-    if (!(this.flags & f.EXECUTING)) return;
+    if (!(this.flags & c.EXECUTING)) return;
     const s = this._currentEpoch;
     if (t._lastSeenEpoch === s) return;
     t._lastSeenEpoch = s;
     const e = this._trackCount, i = this._deps;
     let n;
-    e === 0 ? n = i._s0 : e === 1 ? n = i._s1 : e === 2 ? n = i._s2 : e === 3 ? n = i._s3 : n = i.getAt(e), n != null && n.node === t ? n.version = t.version : i.claimExisting(t, e) || this._insertNewDependency(t, e), t.flags & x.IS_COMPUTED && (i.hasComputeds = !0), this._trackCount = e + 1;
+    e === 0 ? n = i._s0 : e === 1 ? n = i._s1 : e === 2 ? n = i._s2 : e === 3 ? n = i._s3 : n = i.getAt(e), n != null && n.node === t ? n.version = t.version : i.claimExisting(t, e) || this._insertNewDependency(t, e), t.flags & B.IS_COMPUTED && (i.hasComputeds = !0), this._trackCount = e + 1;
   }
   _insertNewDependency(t, s) {
     let e;
     try {
       const i = t.subscribe(this._notifyCallback);
-      e = new H(t, t.version, i);
+      e = new x(t, t.version, i);
     } catch (i) {
-      const n = T(i, D, l.EFFECT_EXECUTION_FAILED);
+      const n = g(i, D, h.EFFECT_EXECUTION_FAILED);
       if (console.error(n), this._onError) try {
         this._onError(n);
       } catch {
       }
-      e = new H(t, t.version, void 0);
+      e = new x(t, t.version, void 0);
     }
     this._deps.insertNew(s, e);
   }
   execute(t = !1) {
-    if (this.flags & (f.DISPOSED | f.EXECUTING)) return;
+    if (this.flags & (c.DISPOSED | c.EXECUTING)) return;
     const s = this._deps;
     if (!t && s.size > 0 && !this._isDirty()) return;
-    this._checkInfiniteLoops(), this.flags |= f.EXECUTING, this._execCleanup(), this._currentEpoch = Q(), this._trackCount = 0, s.prepareTracking(), this._hotIndex = -1;
+    this._checkInfiniteLoops(), this.flags |= c.EXECUTING, this._execCleanup(), this._currentEpoch = k(), this._trackCount = 0, s.prepareTracking(), this._hotIndex = -1;
     let e = !1;
     try {
       const i = _.run(this, this._fn);
@@ -971,7 +948,7 @@ var It = class extends V {
       }
       this._handleExecutionError(i), this._cleanup = null;
     } finally {
-      this.flags &= ~f.EXECUTING;
+      this.flags &= ~c.EXECUTING;
     }
   }
   _isDirty() {
@@ -981,11 +958,11 @@ var It = class extends V {
   _handleAsyncResult(t) {
     const s = ++this._execId;
     t.then((e) => {
-      if (s !== this._execId || this.flags & f.DISPOSED) {
+      if (s !== this._execId || this.flags & c.DISPOSED) {
         if (typeof e == "function") try {
           e();
         } catch (i) {
-          this._handleExecutionError(i, l.EFFECT_CLEANUP_FAILED);
+          this._handleExecutionError(i, h.EFFECT_CLEANUP_FAILED);
         }
         return;
       }
@@ -1001,8 +978,8 @@ var It = class extends V {
       for (let i = 0; i < e; i++) {
         const n = s.getAt(i);
         if (n == null) continue;
-        const r = n.node;
-        if (r.flags & x.IS_COMPUTED && this._tryPullComputed(r), r.version !== n.version)
+        const o = n.node;
+        if (o.flags & B.IS_COMPUTED && this._tryPullComputed(o), o.version !== n.version)
           return this._hotIndex = i, !0;
       }
       return !1;
@@ -1021,81 +998,81 @@ var It = class extends V {
       try {
         this._cleanup();
       } catch (t) {
-        this._handleExecutionError(t, l.EFFECT_CLEANUP_FAILED);
+        this._handleExecutionError(t, h.EFFECT_CLEANUP_FAILED);
       }
       this._cleanup = null;
     }
   }
   _checkInfiniteLoops() {
     const t = nt();
-    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), ft() > m.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
+    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), ft() > I.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
   }
   _checkFrequencyLimit() {
     if (!Number.isFinite(this._maxExecutions)) return;
     const t = Date.now();
-    if (t - this._windowStart >= st.EFFECT_FREQUENCY_WINDOW) {
+    if (t - this._windowStart >= tt.EFFECT_FREQUENCY_WINDOW) {
       this._windowStart = t, this._windowCount = 1;
       return;
     }
     if (++this._windowCount > this._maxExecutions) {
-      const s = new D(l.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
+      const s = new D(h.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
       throw this.dispose(), this._handleExecutionError(s), s;
     }
   }
   get isDisposed() {
-    return (this.flags & f.DISPOSED) !== 0;
+    return (this.flags & c.DISPOSED) !== 0;
   }
   get executionCount() {
     return this._executionCount;
   }
   get isExecuting() {
-    return (this.flags & f.EXECUTING) !== 0;
+    return (this.flags & c.EXECUTING) !== 0;
   }
   _throwInfiniteLoopError(t) {
-    const s = new D(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${Y}`);
+    const s = new D(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${V}`);
     throw this.dispose(), console.error(s), s;
   }
-  _handleExecutionError(t, s = l.EFFECT_EXECUTION_FAILED) {
-    const e = T(t, D, s);
+  _handleExecutionError(t, s = h.EFFECT_EXECUTION_FAILED) {
+    const e = g(t, D, s);
     if (console.error(e), this._onError) try {
       this._onError(e);
     } catch (i) {
-      console.error(T(i, D, l.CALLBACK_ERROR_IN_ERROR_HANDLER));
+      console.error(g(i, D, h.CALLBACK_ERROR_IN_ERROR_HANDLER));
     }
   }
 };
-function At(t, s = {}) {
-  if (typeof t != "function") throw new D(l.EFFECT_MUST_BE_FUNCTION);
+function Nt(t, s = {}) {
+  if (typeof t != "function") throw new D(h.EFFECT_MUST_BE_FUNCTION);
   const e = new It(t, s);
   return e.execute(), e;
 }
-function Nt(t) {
-  if (typeof t != "function") throw new TypeError(l.BATCH_CALLBACK_MUST_BE_FUNCTION);
-  y.startBatch();
+function At(t) {
+  if (typeof t != "function") throw new TypeError(h.BATCH_CALLBACK_MUST_BE_FUNCTION);
+  A.startBatch();
   try {
     return t();
   } finally {
-    y.endBatch();
+    A.endBatch();
   }
 }
 export {
-  b as AsyncState,
-  A as AtomError,
-  S as ComputedError,
-  st as DEBUG_CONFIG,
-  X as DEBUG_RUNTIME,
+  y as AsyncState,
+  T as AtomError,
+  v as ComputedError,
+  tt as DEBUG_CONFIG,
+  G as DEBUG_RUNTIME,
   D as EffectError,
-  m as SCHEDULER_CONFIG,
+  I as SCHEDULER_CONFIG,
   R as SchedulerError,
-  Dt as atom,
-  Nt as batch,
-  Tt as computed,
-  At as effect,
+  vt as atom,
+  At as batch,
+  mt as computed,
+  Nt as effect,
   St as isAtom,
   gt as isComputed,
-  mt as isEffect,
-  y as scheduler,
-  vt as untracked
+  Tt as isEffect,
+  A as scheduler,
+  Dt as untracked
 };
 
 //# sourceMappingURL=index.mjs.map