@but212/atom-effect 0.24.0 → 0.24.1

package/dist/index.mjs

@@ -1,9 +1,9 @@
-var R = {
+var b = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, _ = {
+}, f = {
   DISPOSED: 1,
   EXECUTING: 8
 }, x = {
@@ -17,27 +17,27 @@ var R = {
   RECOMPUTING: 256,
   HAS_ERROR: 512,
   FORCE_COMPUTE: 1024
-}, a = {
+}, d = {
   DISPOSED: 1,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, C = {
+}, m = {
   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
-}, J = {
+}, st = {
   WARN_INFINITE_LOOP: !0,
   EFFECT_FREQUENCY_WINDOW: 1e3
-}, $ = {
+}, j = {
   MAX_ASYNC_RETRIES: 3,
   MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1
-}, S = {
+}, I = {
   UNINITIALIZED: -1,
   MIN: 1
-}, V = 1073741823, q = { VERSION_BITS: 16 }, Ct = (typeof process < "u" && process.env, !1), ht = Object.freeze([]), H = class {
+}, G = 1073741823, q = { VERSION_BITS: 16 }, Ct = (typeof process < "u" && process.env, !1), W = Object.freeze([]), H = class {
   constructor(t, s, e = void 0) {
     this.node = t, this.version = s, this.unsub = e;
   }
@@ -48,23 +48,23 @@ var R = {
   notify(t, s) {
     this.fn ? this.fn(t, s) : this.sub && this.sub.execute();
   }
-}, A = class extends Error {
+}, N = class extends Error {
   constructor(t, s = null, e = !0) {
     super(t), this.cause = s, this.recoverable = e, this.name = "AtomError";
   }
-}, D = class extends A {
+}, S = class extends N {
   constructor(t, s = null) {
     super(t, s, !0), this.name = "ComputedError";
   }
-}, I = class extends A {
+}, D = class extends N {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "EffectError";
   }
-}, b = class extends A {
+}, R = class extends N {
   constructor(t, s = null) {
     super(t, s, !1), this.name = "SchedulerError";
   }
-}, u = {
+}, l = {
   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",
@@ -83,55 +83,75 @@ var R = {
   SCHEDULER_CALLBACK_MUST_BE_FUNCTION: "Scheduler callback must be a function",
   SCHEDULER_END_BATCH_WITHOUT_START: "endBatch() called without matching startBatch(). Ignoring.",
   BATCH_CALLBACK_MUST_BE_FUNCTION: "Batch callback must be a function"
-}, tt = class {
+}, et = class {
   constructor() {
-    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._epoch = S.UNINITIALIZED, this._overflow = null;
+    this._s0 = null, this._s1 = null, this._s2 = null, this._s3 = null, this._count = 0, this._epoch = I.UNINITIALIZED, this._overflow = null;
   }
   get size() {
     return this._count;
   }
   getAt(t) {
-    if (t === 0) return this._s0;
-    if (t === 1) return this._s1;
-    if (t === 2) return this._s2;
-    if (t === 3) return this._s3;
-    const s = this._overflow;
-    if (s !== null && t >= 4) {
-      const e = t - 4;
-      if (e < s.length) return s[e] || null;
+    switch (t) {
+      case 0:
+        return this._s0;
+      case 1:
+        return this._s1;
+      case 2:
+        return this._s2;
+      case 3:
+        return this._s3;
+      default: {
+        const s = this._overflow;
+        if (s !== null && t >= 4) {
+          const e = t - 4;
+          if (e < s.length) return s[e] ?? null;
+        }
+        return null;
+      }
     }
-    return null;
   }
   setAt(t, s) {
-    if (t === 0) this._s0 = s;
-    else if (t === 1) this._s1 = s;
-    else if (t === 2) this._s2 = s;
-    else if (t === 3) this._s3 = s;
-    else {
-      this._overflow ??= [];
-      const e = this._overflow;
-      e[t - 4] = s;
+    switch (t) {
+      case 0:
+        this._s0 = s;
+        break;
+      case 1:
+        this._s1 = s;
+        break;
+      case 2:
+        this._s2 = s;
+        break;
+      case 3:
+        this._s3 = s;
+        break;
+      default: {
+        this._overflow ??= [];
+        const e = this._overflow;
+        e[t - 4] = s;
+      }
     }
     t >= this._count && (this._count = t + 1);
   }
   truncateFrom(t) {
     const s = this._count;
     if (t >= s) return;
-    if (t <= 0) {
-      const i = this._s0;
-      i != null && (this._onItemRemoved(i), this._s0 = null);
-    }
-    if (t <= 1) {
-      const i = this._s1;
-      i != null && (this._onItemRemoved(i), this._s1 = null);
-    }
-    if (t <= 2) {
-      const i = this._s2;
-      i != null && (this._onItemRemoved(i), this._s2 = null);
-    }
-    if (t <= 3) {
-      const i = this._s3;
-      i != null && (this._onItemRemoved(i), this._s3 = null);
+    if (t <= 3) switch (t) {
+      case 0: {
+        const i = this._s0;
+        i != null && (this._onItemRemoved(i), this._s0 = null);
+      }
+      case 1: {
+        const i = this._s1;
+        i != null && (this._onItemRemoved(i), this._s1 = null);
+      }
+      case 2: {
+        const i = this._s2;
+        i != null && (this._onItemRemoved(i), this._s2 = null);
+      }
+      case 3: {
+        const i = this._s3;
+        i != null && (this._onItemRemoved(i), this._s3 = null);
+      }
     }
     const e = this._overflow;
     if (e !== null && s > 4) {
@@ -221,11 +241,11 @@ var R = {
     if (r != null && t(r), s <= 4) return;
     const o = this._overflow;
     if (o != null) {
-      let l = 0;
-      e != null && l++, i != null && l++, n != null && l++, r != null && l++;
-      for (let h = 0, v = o.length; h < v; h++) {
-        const m = o[h];
-        if (m != null && (t(m), ++l === s))
+      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;
       }
     }
@@ -242,10 +262,10 @@ var R = {
     r != null && (t(r), e++);
     const o = this._s3;
     if (o != null && (t(o), e++), s <= 4 || e === s) return e;
-    const l = this._overflow;
-    if (l != null) for (let h = 0, v = l.length; h < v; h++) {
-      const m = l[h];
-      if (m != null && (t(m), ++e === s))
+    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;
     }
     return e;
@@ -266,30 +286,30 @@ var R = {
   dispose() {
     this.clear();
   }
-}, W = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), lt = /* @__PURE__ */ Symbol("AtomEffect.Id"), j = /* @__PURE__ */ Symbol("AtomEffect.Type"), U = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), G = {
+}, Z = /* @__PURE__ */ Symbol("AtomEffect.DebugName"), lt = /* @__PURE__ */ Symbol("AtomEffect.Id"), K = /* @__PURE__ */ Symbol("AtomEffect.Type"), U = /* @__PURE__ */ Symbol("AtomEffect.NoDefaultValue"), X = {
   enabled: !1,
-  warnInfiniteLoop: J.WARN_INFINITE_LOOP,
+  warnInfiniteLoop: st.WARN_INFINITE_LOOP,
   warn(t, s) {
   },
   attachDebugInfo(t, s, e) {
   },
-  getDebugName: (t) => t?.[W],
-  getDebugType: (t) => t?.[j]
-}, ct = 1, _t = () => ct++;
+  getDebugName: (t) => t?.[Z],
+  getDebugType: (t) => t?.[K]
+}, _t = 1, ct = () => _t++;
 function T(t, s, e) {
-  if (t instanceof A) return t;
+  if (t instanceof N) 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);
 }
-var k = class {
+var V = class {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = S.UNINITIALIZED, this.id = _t() & V, this._slots = null, this._notifying = 0, this._deps = null, this._hotIndex = -1;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = I.UNINITIALIZED, this._notifying = 0, this._hotIndex = -1, this._slots = null, this._deps = null, this.id = ct() & G;
   }
   subscribe(t) {
     const s = typeof t == "function";
-    if (!s && (!t || typeof t.execute != "function")) throw T(/* @__PURE__ */ new TypeError("Invalid subscriber"), A, u.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
+    if (!s && (!t || typeof t.execute != "function")) throw T(/* @__PURE__ */ new TypeError("Invalid subscriber"), N, l.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
     let e = this._slots;
-    e || (e = new tt(), this._slots = e);
+    e || (e = new et(), this._slots = e);
     let i = !1;
     if (e.forEach((r) => {
       (s ? r.fn === t : r.sub === t) && (i = !0);
@@ -320,7 +340,7 @@ var k = class {
           try {
             i.notify(t, s);
           } catch (n) {
-            console.error(T(n, A, u.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
+            console.error(T(n, N, l.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));
           }
         });
       } finally {
@@ -337,17 +357,17 @@ var k = class {
     }
     return !t.hasComputeds && !t.isDirtyFast() ? !1 : this._deepDirtyCheck();
   }
-}, w = 0, X = () => (w = w + 1 & 1073741823 || 1, w), z = (t) => t + 1 & V, Q = 0, F = !1, st = 0, et = () => st;
-function K() {
-  return F ? !1 : (F = !0, st = X(), Q = 0, !0);
+}, 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);
 }
-var Z = () => {
+var tt = () => {
   F = !1;
-}, ft = () => F ? ++Q : 0, L = /* @__PURE__ */ (function(t) {
+}, ft = () => F ? ++Y : 0, L = /* @__PURE__ */ (function(t) {
   return t[t.IDLE = 0] = "IDLE", t[t.BATCHING = 1] = "BATCHING", t[t.FLUSHING = 2] = "FLUSHING", t;
 })({}), at = class {
   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 = C.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 = m.MAX_FLUSH_ITERATIONS, this.onOverflow = null, this._boundRunLoop = this._runLoop.bind(this);
   }
   get phase() {
     return this._isProcessing || this._isFlushingSync ? L.FLUSHING : this._isBatching ? L.BATCHING : L.IDLE;
@@ -373,28 +393,30 @@ var Z = () => {
   _runLoop() {
     try {
       if (this._size === 0) return;
-      const t = K();
-      this._drainQueue(), t && Z();
+      const t = J();
+      this._drainQueue(), t && tt();
     } finally {
       this._isProcessing = !1, this._size > 0 && !this._isBatching && this._flush();
     }
   }
   _flushSync() {
     this._isFlushingSync = !0;
-    const t = K();
+    const t = J();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this._isFlushingSync = !1, t && Z();
+      this._isFlushingSync = !1, t && tt();
     }
   }
   _mergeBatchQueue() {
     if (this._batchQueueSize === 0) return;
     const t = ++this._epoch, s = this._batchQueue, e = this._queueBuffer[this._bufferIndex];
     let i = this._size;
-    s.slice(0, this._batchQueueSize).forEach((n) => {
-      n._nextEpoch !== t && (n._nextEpoch = t, e[i++] = n);
-    }), this._size = i, this._batchQueueSize = 0, s.length > C.BATCH_QUEUE_SHRINK_THRESHOLD && (s.length = 0);
+    for (let n = 0; n < this._batchQueueSize; n++) {
+      const r = s[n];
+      r._nextEpoch !== t && (r._nextEpoch = t, e[i++] = r);
+    }
+    this._size = i, this._batchQueueSize = 0, s.length = 0;
   }
   _drainQueue() {
     let t = 0;
@@ -413,13 +435,13 @@ var Z = () => {
       const n = s[i];
       typeof n == "function" ? n() : n.execute();
     } catch (n) {
-      console.error(new b("Error occurred during scheduler execution", n));
+      console.error(new R("Error occurred during scheduler execution", n));
     }
     s.length = 0;
   }
   _handleFlushOverflow() {
     const t = this._size + this._batchQueueSize;
-    if (console.error(new b(u.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(l.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, t))), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this._batchQueueSize = 0, this.onOverflow) try {
       this.onOverflow(t);
     } catch {
     }
@@ -431,10 +453,10 @@ var Z = () => {
     this._batchDepth !== 0 && --this._batchDepth === 0 && (this._flushSync(), this._isBatching = !1);
   }
   setMaxFlushIterations(t) {
-    if (t < C.MIN_FLUSH_ITERATIONS) throw new b(`Max flush iterations must be at least ${C.MIN_FLUSH_ITERATIONS}`);
+    if (t < m.MIN_FLUSH_ITERATIONS) throw new R(`Max flush iterations must be at least ${m.MIN_FLUSH_ITERATIONS}`);
     this._maxFlushIterations = t;
   }
-}, y = new at(), Y = /* @__PURE__ */ Symbol.for("atom-effect/atom"), it = /* @__PURE__ */ Symbol.for("atom-effect/computed"), nt = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Et = /* @__PURE__ */ Symbol.for("atom-effect/writable"), c = {
+}, y = new at(), $ = /* @__PURE__ */ Symbol.for("atom-effect/atom"), rt = /* @__PURE__ */ Symbol.for("atom-effect/computed"), ot = /* @__PURE__ */ Symbol.for("atom-effect/effect"), Et = /* @__PURE__ */ Symbol.for("atom-effect/writable"), _ = {
   current: null,
   run(t, s) {
     const e = this.current;
@@ -446,22 +468,22 @@ var Z = () => {
     }
   }
 };
-function St(t) {
-  const s = c.current;
+function vt(t) {
+  const s = _.current;
   if (s === null) return t();
-  c.current = null;
+  _.current = null;
   try {
     return t();
   } finally {
-    c.current = s;
+    _.current = s;
   }
 }
-var dt = class extends k {
+var dt = class extends V {
   constructor(t, s) {
-    super(), this._pendingOldValue = void 0, this[Y] = !0, this[Et] = !0, this._value = t, s && (this.flags |= a.SYNC), G.attachDebugInfo(this, "atom", this.id);
+    super(), this[$] = !0, this[Et] = !0, this._value = t, this._pendingOldValue = void 0, s && (this.flags |= d.SYNC), X.attachDebugInfo(this, "atom", this.id);
   }
   get value() {
-    const t = c.current;
+    const t = _.current;
     return t?.addDependency(this), this._value;
   }
   set value(t) {
@@ -469,10 +491,10 @@ var dt = class extends k {
     if (Object.is(s, t)) return;
     this._value = t, this.version = z(this.version);
     const e = this._slots, i = this.flags;
-    if (e == null || e.size === 0 || i & a.NOTIFICATION_SCHEDULED) return;
+    if (e == null || e.size === 0 || i & d.NOTIFICATION_SCHEDULED) return;
     this._pendingOldValue = s;
-    const n = i | a.NOTIFICATION_SCHEDULED;
-    if (this.flags = n, (n & a.SYNC) !== 0 && !y.isBatching) {
+    const n = i | d.NOTIFICATION_SCHEDULED;
+    if (this.flags = n, (n & d.SYNC) !== 0 && !y.isBatching) {
       this._flushNotifications();
       return;
     }
@@ -483,15 +505,15 @@ var dt = class extends k {
   }
   _flushNotifications() {
     const t = this.flags;
-    if (!(t & a.NOTIFICATION_SCHEDULED) || t & a.DISPOSED) return;
+    if (!(t & d.NOTIFICATION_SCHEDULED) || t & d.DISPOSED) return;
     const s = this._pendingOldValue;
-    this._pendingOldValue = void 0, this.flags &= ~a.NOTIFICATION_SCHEDULED, this._notifySubscribers(this._value, s);
+    this._pendingOldValue = void 0, this.flags &= ~d.NOTIFICATION_SCHEDULED, this._notifySubscribers(this._value, s);
   }
   peek() {
     return this._value;
   }
   dispose() {
-    this.flags & a.DISPOSED || (this._slots?.clear(), this.flags |= a.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
+    this.flags & d.DISPOSED || (this._slots?.clear(), this.flags |= d.DISPOSED, this._value = void 0, this._pendingOldValue = void 0);
   }
   _deepDirtyCheck() {
     return !1;
@@ -500,10 +522,10 @@ var dt = class extends k {
     this.dispose();
   }
 };
-function vt(t, s = {}) {
+function Dt(t, s = {}) {
   return new dt(t, s.sync ?? !1);
 }
-var rt = class extends tt {
+var k = class extends et {
   constructor() {
     super(), this._map = null, this._SCAN_THRESHOLD = 32, this.hasComputeds = !1, this._depsHash = 0, this._map = null, this.hasComputeds = !1, this._depsHash = 0;
   }
@@ -519,33 +541,46 @@ var rt = class extends tt {
     if (s >= e) return !1;
     const i = e - s;
     if (this._map !== null || i > this._SCAN_THRESHOLD) return this._claimViaMap(t, s);
-    if (s < 4) {
-      if (s <= 0) {
+    if (s < 4) switch (s) {
+      case 0: {
         const o = this._s0;
         if (o && o.node === t && o.unsub)
           return o.version = t.version, !0;
       }
-      if (s <= 1 && 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;
-      }
-      if (s <= 2 && e > 2) {
-        const o = this._s2;
-        if (o && o.node === t && o.unsub)
-          return o.version = t.version, s !== 2 && this._swapInline(2, s, o), !0;
-      }
-      if (s <= 3 && e > 3) {
-        const o = this._s3;
-        if (o && o.node === t && o.unsub)
-          return o.version = t.version, s !== 3 && this._swapInline(3, s, o), !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;
+        }
+      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;
+            }
+            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;
+            }
+            return !0;
+          }
+        }
     }
     const n = s > 4 ? s : 4, r = this._overflow;
-    if (r) for (let o = n - 4, l = r.length; o < l; o++) {
-      const h = r[o];
-      if (h && h.node === t && h.unsub)
-        return h.version = t.version, this._swapGeneral(o + 4, s, h), !0;
+    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;
     }
     return !1;
   }
@@ -553,9 +588,14 @@ var rt = class extends tt {
     if (this._map === null) {
       this._map = /* @__PURE__ */ new Map();
       const n = this._count;
-      for (let r = s; r < n; r++) {
-        const o = this.getAt(r);
-        o?.unsub && this._map.set(o.node, r);
+      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 e = this._map.get(t);
@@ -575,7 +615,14 @@ var rt = class extends tt {
   _swapGeneral(t, s, e) {
     if (t === s) return;
     const i = this.getAt(s);
-    this.setAt(s, e), this.setAt(t, i);
+    if (this.setAt(s, e), t === 0) this._s0 = i;
+    else if (t === 1) this._s1 = i;
+    else if (t === 2) this._s2 = i;
+    else if (t === 3) this._s3 = i;
+    else {
+      const n = this._overflow;
+      n[t - 4] = i;
+    }
   }
   insertNew(t, s) {
     const e = this._count;
@@ -583,101 +630,87 @@ var rt = class extends tt {
       const i = this.getAt(t);
       i != null && (this.add(i), this._map !== null && i.unsub && this._map.set(i.node, this._count - 1));
     }
-    t === 0 ? this._s0 = s : t === 1 ? this._s1 = s : t === 2 ? this._s2 = s : t === 3 ? this._s3 = s : this.setAt(t, s), t >= e && (this._count = t + 1);
+    if (t === 0) this._s0 = s;
+    else if (t === 1) this._s1 = s;
+    else if (t === 2) this._s2 = s;
+    else if (t === 3) this._s3 = s;
+    else {
+      let i = this._overflow;
+      i || (i = [], this._overflow = i), i[t - 4] = s;
+    }
+    t >= e && (this._count = t + 1);
   }
   truncateFrom(t) {
     t >= this._count || (super.truncateFrom(t), this._map !== null && (this._map.clear(), this._map = null));
   }
   seal() {
-    const t = this._count;
-    if (t <= 0) {
-      this._depsHash = 0;
-      return;
-    }
-    let s = 0;
-    const e = q.VERSION_BITS, i = this._s0;
-    if (i && (s = s + (i.version << e) + i.node.id | 0), t > 1) {
-      const n = this._s1;
-      n && (s = s + (n.version << e) + n.node.id | 0);
-    }
-    if (t > 2) {
-      const n = this._s2;
-      n && (s = s + (n.version << e) + n.node.id | 0);
-    }
-    if (t > 3) {
-      const n = this._s3;
-      n && (s = s + (n.version << e) + n.node.id | 0);
-      const r = this._overflow;
-      if (r) for (let o = 0, l = r.length; o < l; o++) {
-        const h = r[o];
-        h && (s = s + (h.version << e) + h.node.id | 0);
+    const t = this._count, s = q.VERSION_BITS;
+    let e = 0;
+    switch (t) {
+      case 0:
+        this._depsHash = 0;
+        return;
+      case 1: {
+        const i = this._s0;
+        e = e + (i.version << s) + i.node.id | 0;
+        break;
+      }
+      case 2: {
+        const i = this._s0, n = this._s1;
+        e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0;
+        break;
+      }
+      case 3: {
+        const i = this._s0, n = this._s1, r = this._s2;
+        e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0, e = e + (r.version << s) + r.node.id | 0;
+        break;
+      }
+      default: {
+        const i = this._s0, n = this._s1, r = this._s2, o = this._s3;
+        if (e = e + (i.version << s) + i.node.id | 0, e = e + (n.version << s) + n.node.id | 0, e = e + (r.version << s) + r.node.id | 0, e = e + (o.version << s) + o.node.id | 0, t > 4) {
+          const h = this._overflow;
+          for (let u = 0, a = h.length; u < a; u++) {
+            const c = h[u];
+            e = e + (c.version << s) + c.node.id | 0;
+          }
+        }
       }
     }
-    this._depsHash = s;
+    this._depsHash = e;
   }
   isDirtyFast() {
-    const t = this._count;
-    if (t <= 0) return !1;
-    let s = 0;
-    const e = q.VERSION_BITS, i = this._s0;
-    if (i) {
-      const n = i.node;
-      s = s + (n.version << e) + n.id | 0;
-    }
-    if (t > 1) {
-      const n = this._s1;
-      if (n) {
-        const r = n.node;
-        s = s + (r.version << e) + r.id | 0;
+    const t = this._count, s = q.VERSION_BITS;
+    let e = 0;
+    switch (t) {
+      case 0:
+        return !1;
+      case 1: {
+        const i = this._s0.node;
+        e = e + (i.version << s) + i.id | 0;
+        break;
       }
-    }
-    if (t > 2) {
-      const n = this._s2;
-      if (n) {
-        const r = n.node;
-        s = s + (r.version << e) + r.id | 0;
+      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;
       }
-    }
-    if (t > 3) {
-      const n = this._s3;
-      if (n) {
-        const o = n.node;
-        s = s + (o.version << e) + o.id | 0;
+      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;
       }
-      const r = this._overflow;
-      if (r) for (let o = 0, l = r.length; o < l; o++) {
-        const h = r[o];
-        if (h) {
-          const v = h.node;
-          s = s + (v.version << e) + v.id | 0;
+      default: {
+        const i = this._s0.node, n = this._s1.node, r = this._s2.node, o = this._s3.node;
+        if (e = e + (i.version << s) + i.id | 0, e = e + (n.version << s) + n.id | 0, e = e + (r.version << s) + r.id | 0, e = e + (o.version << s) + o.id | 0, t > 4) {
+          const h = this._overflow;
+          for (let u = 0, a = h.length; u < a; u++) {
+            const c = h[u].node;
+            e = e + (c.version << s) + c.id | 0;
+          }
         }
       }
     }
-    return s !== this._depsHash;
-  }
-  captureVersionSnapshot() {
-    const t = this._count;
-    if (t <= 0) return 0;
-    let s = 0;
-    const e = this._s0;
-    if (e && (s = (s << 5) - s + e.node.version | 0), t > 1) {
-      const i = this._s1;
-      i && (s = (s << 5) - s + i.node.version | 0);
-    }
-    if (t > 2) {
-      const i = this._s2;
-      i && (s = (s << 5) - s + i.node.version | 0);
-    }
-    if (t > 3) {
-      const i = this._s3;
-      i && (s = (s << 5) - s + i.node.version | 0);
-      const n = this._overflow;
-      if (n) for (let r = 0, o = n.length; r < o; r++) {
-        const l = n[r];
-        l && (s = (s << 5) - s + l.node.version | 0);
-      }
-    }
-    return s;
+    return e !== this._depsHash;
   }
   disposeAll() {
     this._count > 0 && this.truncateFrom(0), this.hasComputeds = !1, this._map !== null && (this._map.clear(), this._map = null);
@@ -688,46 +721,46 @@ var rt = class extends tt {
   compact() {
   }
 };
-function Dt(t) {
-  return t !== null && typeof t == "object" && Y in t;
+function St(t) {
+  return t !== null && typeof t == "object" && $ in t;
 }
 function gt(t) {
-  return t !== null && typeof t == "object" && it in t;
+  return t !== null && typeof t == "object" && rt in t;
 }
-function Tt(t) {
-  return t !== null && typeof t == "object" && nt in t;
+function mt(t) {
+  return t !== null && typeof t == "object" && ot in t;
 }
-function ot(t) {
+function ht(t) {
   return t !== null && typeof t == "object" && typeof t.then == "function";
 }
-var { IDLE: d, DIRTY: f, PENDING: g, RESOLVED: E, REJECTED: p, HAS_ERROR: N, RECOMPUTING: O, DISPOSED: M, IS_COMPUTED: P, FORCE_COMPUTE: B } = x, pt = class extends k {
+var { IDLE: C, DIRTY: E, PENDING: g, RESOLVED: p, REJECTED: v, HAS_ERROR: A, RECOMPUTING: O, DISPOSED: M, IS_COMPUTED: P, FORCE_COMPUTE: B } = x, pt = class extends V {
   constructor(t, s = {}) {
-    if (typeof t != "function") throw new D(u.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this[Y] = !0, this[it] = !0, this._error = null, this._promiseId = 0, this._deps = new rt(), this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._lastDriftEpoch = S.UNINITIALIZED, this._trackEpoch = S.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = P | f | d, 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 ?? $.MAX_ASYNC_RETRIES) & V, G.attachDebugInfo(this, "computed", this.id), s.lazy === !1) try {
+    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 = I.UNINITIALIZED, this._trackEpoch = I.UNINITIALIZED, this._trackCount = 0, this._value = void 0, this.flags = P | E | C, 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 {
       this._recompute();
     } catch {
     }
   }
   _track() {
-    c.current?.addDependency(this);
+    _.current?.addDependency(this);
   }
   get value() {
     this._track();
     const t = this.flags;
-    if ((t & (E | f | d)) === E) return this._value;
-    if (t & M) throw new D(u.COMPUTED_DISPOSED);
+    if ((t & (p | E | C)) === 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 D(u.COMPUTED_CIRCULAR_DEPENDENCY);
+      throw new S(l.COMPUTED_CIRCULAR_DEPENDENCY);
     }
-    if (t & (f | d) && ((t & d) === 0 && (t & B) === 0 && this._deps.size > 0 && !this._isDirty() ? this.flags &= ~f : this._recompute(), this.flags & E))
+    if (t & (E | C) && ((t & C) === 0 && (t & B) === 0 && this._deps.size > 0 && !this._isDirty() ? this.flags &= ~E : this._recompute(), this.flags & p))
       return this._value;
     const s = this._defaultValue, e = s !== U;
     if (this.flags & g) {
       if (e) return s;
-      throw new D(u.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+      throw new S(l.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
     }
-    if (this.flags & p) {
+    if (this.flags & v) {
       if (e) return s;
       throw this._error;
     }
@@ -739,14 +772,16 @@ var { IDLE: d, DIRTY: f, PENDING: g, RESOLVED: E, REJECTED: p, HAS_ERROR: N, REC
   get state() {
     this._track();
     const t = this.flags;
-    return t & E ? R.RESOLVED : t & g ? R.PENDING : t & p ? R.REJECTED : R.IDLE;
+    return t & p ? b.RESOLVED : t & g ? b.PENDING : t & v ? b.REJECTED : b.IDLE;
   }
   get hasError() {
-    if (this._track(), this.flags & (p | N)) return !0;
-    const t = this._deps, s = t.size;
+    if (this._track(), this.flags & (v | A)) 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 & A) return !0;
     }
     return !1;
   }
@@ -757,14 +792,16 @@ var { IDLE: d, DIRTY: f, PENDING: g, RESOLVED: E, REJECTED: p, HAS_ERROR: N, REC
     this._track();
     const t = [];
     this._error && t.push(this._error);
-    const s = this._deps, e = s.size;
+    const s = this._deps;
+    if (!s.hasComputeds) return t.length === 0 ? W : Object.freeze(t);
+    const e = s.size;
     for (let i = 0; i < e; i++) {
       const n = s.getAt(i);
       if (n == null) continue;
       const r = n.node;
-      r.flags & N && this._collectErrorsFromDep(r, t);
+      r.flags & A && this._collectErrorsFromDep(r, t);
     }
-    return t.length === 0 ? ht : Object.freeze(t);
+    return t.length === 0 ? W : Object.freeze(t);
   }
   _collectErrorsFromDep(t, s) {
     const e = t.errors, i = e.length;
@@ -780,13 +817,13 @@ var { IDLE: d, DIRTY: f, PENDING: g, RESOLVED: E, REJECTED: p, HAS_ERROR: N, REC
     return this._track(), (this.flags & g) !== 0;
   }
   get isResolved() {
-    return this._track(), (this.flags & E) !== 0;
+    return this._track(), (this.flags & p) !== 0;
   }
   invalidate() {
     this.flags |= B, this._markDirty();
   }
   dispose() {
-    this.flags & M || (this._deps.disposeAll(), this._slots?.clear(), this.flags = M | f | d, this._error = null, this._value = void 0, this._hotIndex = -1);
+    this.flags & M || (this._deps.disposeAll(), this._slots?.clear(), this.flags = M | E | C, this._error = null, this._value = void 0, this._hotIndex = -1);
   }
   [Symbol.dispose]() {
     this.dispose();
@@ -804,59 +841,60 @@ var { IDLE: d, DIRTY: f, PENDING: g, RESOLVED: E, REJECTED: p, HAS_ERROR: N, REC
   }
   _recompute() {
     if (this.flags & O) return;
-    this.flags = (this.flags | O) & ~B, this._trackEpoch = X(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
+    this.flags = (this.flags | O) & ~B, this._trackEpoch = Q(), this._trackCount = 0, this._deps.prepareTracking(), this._hotIndex = -1;
     let t = !1;
     try {
-      const s = c.run(this, this._fn);
-      this._deps.truncateFrom(this._trackCount), this._deps.seal(), t = !0, ot(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
+      const s = _.run(this, this._fn);
+      this._deps.truncateFrom(this._trackCount), this._deps.seal(), t = !0, ht(s) ? this._handleAsyncComputation(s) : this._finalizeResolution(s);
     } catch (s) {
       if (!t) try {
         this._deps.truncateFrom(this._trackCount);
       } catch {
       }
-      this._handleError(s, u.COMPUTED_COMPUTATION_FAILED, !0);
+      this._handleError(s, l.COMPUTED_COMPUTATION_FAILED, !0);
     } finally {
-      this._trackEpoch = S.UNINITIALIZED, this._trackCount = 0, this.flags &= ~O;
+      this._trackEpoch = I.UNINITIALIZED, this._trackCount = 0, this.flags &= ~O;
     }
   }
   _handleAsyncComputation(t) {
-    this.flags = (this.flags | g) & ~(d | f | E | p), this._notifySubscribers(void 0, void 0), this._asyncStartAggregateVersion = this._captureVersionSnapshot(), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % $.MAX_PROMISE_ID;
+    this.flags = (this.flags | g) & ~(C | E | p | v), this._notifySubscribers(void 0, void 0), this._asyncRetryCount = 0, this._promiseId = (this._promiseId + 1) % j.MAX_PROMISE_ID;
     const s = this._promiseId;
     t.then((e) => {
       if (s === this._promiseId) {
-        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {
-          const i = et();
-          return this._lastDriftEpoch !== i && (this._lastDriftEpoch = i, this._asyncRetryCount = 0), this._asyncRetryCount++ < this._maxAsyncRetries ? this._markDirty() : this._handleError(new D(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`), u.COMPUTED_ASYNC_COMPUTATION_FAILED);
+        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);
         }
         this._finalizeResolution(e), this._notifySubscribers(e, void 0);
       }
-    }, (e) => s === this._promiseId && this._handleError(e, u.COMPUTED_ASYNC_COMPUTATION_FAILED));
-  }
-  _captureVersionSnapshot() {
-    return this._deps.captureVersionSnapshot();
+    }, (e) => s === this._promiseId && this._handleError(e, l.COMPUTED_ASYNC_COMPUTATION_FAILED));
   }
   _handleError(t, s, e = !1) {
-    const i = T(t, D, s);
-    if (!e && !(this.flags & p) && (this.version = z(this.version)), this._error = i, this.flags = this.flags & ~(d | f | g | E) | p | N, this._onError) try {
+    const i = T(t, S, s);
+    if (!e && !(this.flags & v) && (this.version = z(this.version)), this._error = i, this.flags = this.flags & ~(C | E | g | p) | v | A, this._onError) try {
       this._onError(i);
     } catch (n) {
-      console.error(u.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
+      console.error(l.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
     }
     if (e) throw i;
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(t) {
-    (!(this.flags & E) || !this._equal(this._value, t)) && (this.version = z(this.version)), this._value = t, this._error = null, this.flags = (this.flags | E) & ~(d | f | g | p | N);
+    (!(this.flags & p) || !this._equal(this._value, t)) && (this.version = z(this.version)), this._value = t, this._error = null, this.flags = (this.flags | p) & ~(C | E | g | v | A);
   }
   execute() {
     this._markDirty();
   }
   _markDirty() {
-    this.flags & (O | f) || (this.flags |= f, this._notifySubscribers(void 0, void 0));
+    this.flags & (O | E) || (this.flags |= E, this._notifySubscribers(void 0, void 0));
+  }
+  _isDirty() {
+    const t = this._deps;
+    return t.hasComputeds ? this._deepDirtyCheck() : t.isDirtyFast();
   }
   _deepDirtyCheck() {
-    const t = this._deps, s = c.current;
-    c.current = null;
+    const t = this._deps, s = _.current;
+    _.current = null;
     try {
       const e = t.size;
       for (let i = 0; i < e; i++) {
@@ -872,34 +910,35 @@ var { IDLE: d, DIRTY: f, PENDING: g, RESOLVED: E, REJECTED: p, HAS_ERROR: N, REC
       }
       return this._hotIndex = -1, !1;
     } finally {
-      c.current = s;
+      _.current = s;
     }
   }
 };
-function At(t, s = {}) {
+function Tt(t, s = {}) {
   return new pt(t, s);
 }
-var It = class extends k {
+var It = class extends V {
   constructor(t, s = {}) {
-    super(), this[nt] = !0, this._cleanup = null, this._deps = new rt(), this._currentEpoch = S.UNINITIALIZED, this._lastFlushEpoch = S.UNINITIALIZED, this._executionsInEpoch = 0, this._executionCount = 0, this._windowStart = 0, this._windowCount = 0, this._execId = 0, this._trackCount = 0, this._fn = t, this._onError = s.onError ?? null, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? C.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? C.MAX_EXECUTIONS_PER_EFFECT, this._sync ? this._notifyCallback = () => this.execute() : this._notifyCallback = () => y.schedule(this), G.attachDebugInfo(this, "effect", this.id);
+    super(), this[ot] = !0, this._cleanup = null, this._deps = new k(), this._currentEpoch = I.UNINITIALIZED, this._lastFlushEpoch = I.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 = I.UNINITIALIZED, this._lastFlushEpoch = I.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);
   }
   run() {
-    if (this.flags & _.DISPOSED) throw new I(u.EFFECT_DISPOSED);
+    if (this.flags & f.DISPOSED) throw new D(l.EFFECT_DISPOSED);
     this.execute(!0);
   }
   dispose() {
-    this.flags & _.DISPOSED || (this.flags |= _.DISPOSED, this._execCleanup(), this._deps?.disposeAll());
+    this.flags & f.DISPOSED || (this.flags |= f.DISPOSED, this._execCleanup(), this._deps?.disposeAll());
   }
   [Symbol.dispose]() {
     this.dispose();
   }
   addDependency(t) {
-    if (!(this.flags & _.EXECUTING)) return;
+    if (!(this.flags & f.EXECUTING)) return;
     const s = this._currentEpoch;
     if (t._lastSeenEpoch === s) return;
     t._lastSeenEpoch = s;
-    const e = this._trackCount, i = this._deps, n = i.getAt(e);
-    n != null && n.node === t ? n.version = t.version : i.claimExisting(t, e) || this._insertNewDependency(t, e), t.flags & x.IS_COMPUTED && (i.hasComputeds = !0), this._trackCount = e + 1;
+    const e = this._trackCount, i = this._deps;
+    let 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;
   }
   _insertNewDependency(t, s) {
     let e;
@@ -907,7 +946,7 @@ var It = class extends k {
       const i = t.subscribe(this._notifyCallback);
       e = new H(t, t.version, i);
     } catch (i) {
-      const n = T(i, I, u.EFFECT_EXECUTION_FAILED);
+      const n = T(i, D, l.EFFECT_EXECUTION_FAILED);
       if (console.error(n), this._onError) try {
         this._onError(n);
       } catch {
@@ -917,14 +956,14 @@ var It = class extends k {
     this._deps.insertNew(s, e);
   }
   execute(t = !1) {
-    if (this.flags & (_.DISPOSED | _.EXECUTING)) return;
+    if (this.flags & (f.DISPOSED | f.EXECUTING)) return;
     const s = this._deps;
     if (!t && s.size > 0 && !this._isDirty()) return;
-    this._checkInfiniteLoops(), this.flags |= _.EXECUTING, this._execCleanup(), this._currentEpoch = X(), this._trackCount = 0, s.prepareTracking(), this._hotIndex = -1;
+    this._checkInfiniteLoops(), this.flags |= f.EXECUTING, this._execCleanup(), this._currentEpoch = Q(), this._trackCount = 0, s.prepareTracking(), this._hotIndex = -1;
     let e = !1;
     try {
-      const i = c.run(this, this._fn);
-      s.truncateFrom(this._trackCount), s.seal(), e = !0, ot(i) ? this._handleAsyncResult(i) : this._cleanup = typeof i == "function" ? i : null;
+      const i = _.run(this, this._fn);
+      s.truncateFrom(this._trackCount), s.seal(), e = !0, ht(i) ? this._handleAsyncResult(i) : this._cleanup = typeof i == "function" ? i : null;
     } catch (i) {
       if (!e) try {
         s.truncateFrom(this._trackCount);
@@ -932,17 +971,21 @@ var It = class extends k {
       }
       this._handleExecutionError(i), this._cleanup = null;
     } finally {
-      this.flags &= ~_.EXECUTING;
+      this.flags &= ~f.EXECUTING;
     }
   }
+  _isDirty() {
+    const t = this._deps;
+    return t.hasComputeds ? this._deepDirtyCheck() : t.isDirtyFast();
+  }
   _handleAsyncResult(t) {
     const s = ++this._execId;
     t.then((e) => {
-      if (s !== this._execId || this.flags & _.DISPOSED) {
+      if (s !== this._execId || this.flags & f.DISPOSED) {
         if (typeof e == "function") try {
           e();
         } catch (i) {
-          this._handleExecutionError(i, u.EFFECT_CLEANUP_FAILED);
+          this._handleExecutionError(i, l.EFFECT_CLEANUP_FAILED);
         }
         return;
       }
@@ -950,8 +993,8 @@ var It = class extends k {
     }, (e) => s === this._execId && this._handleExecutionError(e));
   }
   _deepDirtyCheck() {
-    const t = c.current;
-    c.current = null;
+    const t = _.current;
+    _.current = null;
     const s = this._deps;
     try {
       const e = s.size;
@@ -964,7 +1007,7 @@ var It = class extends k {
       }
       return !1;
     } finally {
-      c.current = t;
+      _.current = t;
     }
   }
   _tryPullComputed(t) {
@@ -978,56 +1021,56 @@ var It = class extends k {
       try {
         this._cleanup();
       } catch (t) {
-        this._handleExecutionError(t, u.EFFECT_CLEANUP_FAILED);
+        this._handleExecutionError(t, l.EFFECT_CLEANUP_FAILED);
       }
       this._cleanup = null;
     }
   }
   _checkInfiniteLoops() {
-    const t = et();
-    this._lastFlushEpoch !== t && (this._lastFlushEpoch = t, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), ft() > C.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
+    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++;
   }
   _checkFrequencyLimit() {
     if (!Number.isFinite(this._maxExecutions)) return;
     const t = Date.now();
-    if (t - this._windowStart >= J.EFFECT_FREQUENCY_WINDOW) {
+    if (t - this._windowStart >= st.EFFECT_FREQUENCY_WINDOW) {
       this._windowStart = t, this._windowCount = 1;
       return;
     }
     if (++this._windowCount > this._maxExecutions) {
-      const s = new I(u.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
+      const s = new D(l.EFFECT_FREQUENCY_LIMIT_EXCEEDED);
       throw this.dispose(), this._handleExecutionError(s), s;
     }
   }
   get isDisposed() {
-    return (this.flags & _.DISPOSED) !== 0;
+    return (this.flags & f.DISPOSED) !== 0;
   }
   get executionCount() {
     return this._executionCount;
   }
   get isExecuting() {
-    return (this.flags & _.EXECUTING) !== 0;
+    return (this.flags & f.EXECUTING) !== 0;
   }
   _throwInfiniteLoopError(t) {
-    const s = new I(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${Q}`);
+    const s = new D(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${Y}`);
     throw this.dispose(), console.error(s), s;
   }
-  _handleExecutionError(t, s = u.EFFECT_EXECUTION_FAILED) {
-    const e = T(t, I, s);
+  _handleExecutionError(t, s = l.EFFECT_EXECUTION_FAILED) {
+    const e = T(t, D, s);
     if (console.error(e), this._onError) try {
       this._onError(e);
     } catch (i) {
-      console.error(T(i, I, u.CALLBACK_ERROR_IN_ERROR_HANDLER));
+      console.error(T(i, D, l.CALLBACK_ERROR_IN_ERROR_HANDLER));
     }
   }
 };
-function mt(t, s = {}) {
-  if (typeof t != "function") throw new I(u.EFFECT_MUST_BE_FUNCTION);
+function Nt(t, s = {}) {
+  if (typeof t != "function") throw new D(l.EFFECT_MUST_BE_FUNCTION);
   const e = new It(t, s);
   return e.execute(), e;
 }
-function Nt(t) {
-  if (typeof t != "function") throw new TypeError(u.BATCH_CALLBACK_MUST_BE_FUNCTION);
+function At(t) {
+  if (typeof t != "function") throw new TypeError(l.BATCH_CALLBACK_MUST_BE_FUNCTION);
   y.startBatch();
   try {
     return t();
@@ -1036,23 +1079,23 @@ function Nt(t) {
   }
 }
 export {
-  R as AsyncState,
-  A as AtomError,
-  D as ComputedError,
-  J as DEBUG_CONFIG,
-  G as DEBUG_RUNTIME,
-  I as EffectError,
-  C as SCHEDULER_CONFIG,
-  b as SchedulerError,
-  vt as atom,
-  Nt as batch,
-  At as computed,
-  mt as effect,
-  Dt as isAtom,
+  b as AsyncState,
+  N as AtomError,
+  S as ComputedError,
+  st as DEBUG_CONFIG,
+  X as DEBUG_RUNTIME,
+  D as EffectError,
+  m as SCHEDULER_CONFIG,
+  R as SchedulerError,
+  Dt as atom,
+  At as batch,
+  Tt as computed,
+  Nt as effect,
+  St as isAtom,
   gt as isComputed,
-  Tt as isEffect,
+  mt as isEffect,
   y as scheduler,
-  St as untracked
+  vt as untracked
 };
 
 //# sourceMappingURL=index.mjs.map