@but212/atom-effect-jquery 0.15.2 → 0.15.4

package/dist/index.mjs

@@ -1,22 +1,22 @@
 import h from "jquery";
-import { default as Ut } from "jquery";
-const ze = {
+import { default as Pt } from "jquery";
+const Ye = {
   /** One second in milliseconds */
   ONE_SECOND_MS: 1e3
-}, le = {
+}, de = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, v = {
+}, U = {
   DISPOSED: 1,
   HAS_FN_SUBS: 2,
   HAS_OBJ_SUBS: 4
-}, O = {
-  ...v,
+}, v = {
+  ...U,
   EXECUTING: 8
 }, l = {
-  ...v,
+  ...U,
   DIRTY: 8,
   IDLE: 16,
   PENDING: 32,
@@ -24,11 +24,11 @@ const ze = {
   REJECTED: 128,
   RECOMPUTING: 256,
   HAS_ERROR: 512
-}, U = {
-  ...v,
+}, w = {
+  ...U,
   SYNC: 8,
   NOTIFICATION_SCHEDULED: 16
-}, j = {
+}, $ = {
   /** Maximum effect executions per second to detect infinite loops (Legacy/Fallback) */
   MAX_EXECUTIONS_PER_SECOND: 1e3,
   /**
@@ -47,13 +47,13 @@ const ze = {
   MIN_FLUSH_ITERATIONS: 10,
   /** Threshold for shrinking the batch queue to assist GC */
   BATCH_QUEUE_SHRINK_THRESHOLD: 1e3
-}, Ne = {
+}, Re = {
   /** Maximum dependencies before warning about large dependency graphs */
   MAX_DEPENDENCIES: 1e3,
   /** Enable infinite loop detection warnings */
   WARN_INFINITE_LOOP: !0
-}, z = 1073741823, N = typeof process < "u" && process.env && process.env.NODE_ENV !== "production", Xe = Object.freeze([]);
-class P extends Error {
+}, X = 1073741823, N = typeof process < "u" && process.env && process.env.NODE_ENV !== "production", Qe = Object.freeze([]);
+class M extends Error {
   /**
    * Creates a new AtomError
    * @param message - Error message describing what went wrong
@@ -64,7 +64,7 @@ class P extends Error {
     super(e), this.name = "AtomError", this.cause = s, this.recoverable = n, this.timestamp = /* @__PURE__ */ new Date();
   }
 }
-class V extends P {
+class P extends M {
   /**
    * Creates a new ComputedError
    * @param message - Error message
@@ -74,7 +74,7 @@ class V extends P {
     super(e, s, !0), this.name = "ComputedError";
   }
 }
-class J extends P {
+class K extends M {
   /**
    * Creates a new EffectError
    * @param message - Error message
@@ -84,7 +84,7 @@ class J extends P {
     super(e, s, !1), this.name = "EffectError";
   }
 }
-class ce extends P {
+class ae extends M {
   /**
    * Creates a new SchedulerError
    * @param message - Error message
@@ -94,7 +94,7 @@ class ce extends P {
     super(e, s, !1), this.name = "SchedulerError";
   }
 }
-const E = {
+const b = {
   // ─────────────────────────────────────────────────────────────────
   // Computed errors
   // ─────────────────────────────────────────────────────────────────
@@ -126,6 +126,10 @@ const E = {
    * Error thrown when subscribing to a dependency fails.
    */
   COMPUTED_DEPENDENCY_SUBSCRIPTION_FAILED: "Failed to subscribe to dependency",
+  /**
+   * Error thrown when accessing a disposed computed value.
+   */
+  COMPUTED_DISPOSED: "Cannot access a disposed computed",
   // ─────────────────────────────────────────────────────────────────
   // Atom errors
   // ─────────────────────────────────────────────────────────────────
@@ -186,28 +190,28 @@ const E = {
    * @remarks This prevents cascading failures from masking the original error.
    */
   CALLBACK_ERROR_IN_ERROR_HANDLER: "Error occurred during onError callback execution"
-}, pe = /* @__PURE__ */ Symbol("debugName"), qe = /* @__PURE__ */ Symbol("id"), Ee = /* @__PURE__ */ Symbol("type"), Te = /* @__PURE__ */ Symbol("noDefaultValue");
-function Ge(t) {
+}, me = /* @__PURE__ */ Symbol("debugName"), Je = /* @__PURE__ */ Symbol("id"), Se = /* @__PURE__ */ Symbol("type"), Ae = /* @__PURE__ */ Symbol("noDefaultValue");
+function Ke(t) {
   return "dependencies" in t && Array.isArray(t.dependencies);
 }
-let xe = 0;
-function we(t, e, s) {
+let ve = 0;
+function ke(t, e, s) {
   if (t._visitedEpoch !== s) {
     if (t._visitedEpoch = s, t === e)
-      throw new V("Indirect circular dependency detected");
-    if (Ge(t)) {
+      throw new P("Indirect circular dependency detected");
+    if (Ke(t)) {
       const n = t.dependencies;
       for (let i = 0; i < n.length; i++) {
         const o = n[i];
-        o && we(o, e, s);
+        o && ke(o, e, s);
       }
     }
   }
 }
-const w = {
+const L = {
   enabled: typeof process < "u" && process.env?.NODE_ENV === "development",
-  maxDependencies: Ne.MAX_DEPENDENCIES,
-  warnInfiniteLoop: Ne.WARN_INFINITE_LOOP,
+  maxDependencies: Re.MAX_DEPENDENCIES,
+  warnInfiniteLoop: Re.WARN_INFINITE_LOOP,
   warn(t, e) {
     this.enabled && t && console.warn(`[Atom Effect] ${e}`);
   },
@@ -218,38 +222,38 @@ const w = {
    */
   checkCircular(t, e) {
     if (t === e)
-      throw new V("Direct circular dependency detected");
-    this.enabled && (xe++, we(t, e, xe));
+      throw new P("Direct circular dependency detected");
+    this.enabled && (ve++, ke(t, e, ve));
   },
   attachDebugInfo(t, e, s) {
     if (!this.enabled)
       return;
     const n = t;
-    n[pe] = `${e}_${s}`, n[qe] = s, n[Ee] = e;
+    n[me] = `${e}_${s}`, n[Je] = s, n[Se] = e;
   },
   getDebugName(t) {
-    if (t != null && pe in t)
-      return t[pe];
+    if (t != null && me in t)
+      return t[me];
   },
   getDebugType(t) {
-    if (t != null && Ee in t)
-      return t[Ee];
+    if (t != null && Se in t)
+      return t[Se];
   }
 };
-let Ye = 1;
-const Qe = () => Ye++;
-class Le {
+let We = 1;
+const Ze = () => We++;
+class Me {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this._modifiedAtEpoch = -1, this._visitedEpoch = -1, this.id = Qe() & z, this._tempUnsub = void 0;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this._modifiedAtEpoch = -1, this._visitedEpoch = -1, this.id = Ze() & X, this._tempUnsub = void 0;
   }
   /**
    * Calculates the logical distance (shift) between current and cached version.
    */
   getShift(e) {
-    return this.version - e & z;
+    return this.version - e & X;
   }
 }
-class Fe extends Le {
+class Be extends Me {
   /**
    * Subscribes a listener function or Subscriber object to value changes.
    */
@@ -258,11 +262,11 @@ class Fe extends Le {
       return this._addSubscriber(
         this._fnSubs,
         e,
-        v.HAS_FN_SUBS
+        U.HAS_FN_SUBS
       );
     if (e !== null && typeof e == "object" && "execute" in e)
-      return this._addSubscriber(this._objSubs, e, v.HAS_OBJ_SUBS);
-    throw new P(E.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
+      return this._addSubscriber(this._objSubs, e, U.HAS_OBJ_SUBS);
+    throw new M(b.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
   }
   /**
    * Gets the total number of active subscribers.
@@ -296,9 +300,9 @@ class Fe extends Le {
    * Notifies all subscribers of a change.
    */
   _notifySubscribers(e, s) {
-    const n = this.flags, i = v.HAS_FN_SUBS | v.HAS_OBJ_SUBS;
+    const n = this.flags, i = U.HAS_FN_SUBS | U.HAS_OBJ_SUBS;
     if (n & i) {
-      if (n & v.HAS_FN_SUBS) {
+      if (n & U.HAS_FN_SUBS) {
         const o = this._fnSubs;
         for (let r = 0, c = o.length; r < c; r++) {
           const u = o[r];
@@ -307,12 +311,12 @@ class Fe extends Le {
               u(e, s);
             } catch (a) {
               console.error(
-                new P(E.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED, a)
+                new M(b.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED, a)
               );
             }
         }
       }
-      if (n & v.HAS_OBJ_SUBS) {
+      if (n & U.HAS_OBJ_SUBS) {
         const o = this._objSubs;
         for (let r = 0, c = o.length; r < c; r++) {
           const u = o[r];
@@ -321,7 +325,7 @@ class Fe extends Le {
               u.execute();
             } catch (a) {
               console.error(
-                new P(E.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED, a)
+                new M(b.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED, a)
               );
             }
         }
@@ -329,19 +333,19 @@ class Fe extends Le {
     }
   }
 }
-class Je {
+class et {
   constructor() {
-    this.acquired = 0, this.released = 0, this.rejected = new Ke();
+    this.acquired = 0, this.released = 0, this.rejected = new tt();
   }
 }
-class Ke {
+class tt {
   constructor() {
     this.frozen = 0, this.tooLarge = 0, this.poolFull = 0;
   }
 }
-class me {
+class De {
   constructor() {
-    this.pool = [], this.maxPoolSize = 50, this.maxReusableCapacity = 256, this.stats = N ? new Je() : null;
+    this.pool = [], this.maxPoolSize = 50, this.maxReusableCapacity = 256, this.stats = N ? new et() : null;
   }
   /** Acquires an array from the pool or creates a new one if the pool is empty. */
   acquire() {
@@ -392,8 +396,8 @@ class me {
     N && e && (e.acquired = 0, e.released = 0, e.rejected.frozen = 0, e.rejected.tooLarge = 0, e.rejected.poolFull = 0);
   }
 }
-const T = Object.freeze([]), H = Object.freeze([]), R = Object.freeze([]), $ = new me(), K = new me(), F = new me();
-function B(t, e, s, n) {
+const T = Object.freeze([]), H = Object.freeze([]), x = Object.freeze([]), z = new De(), W = new De(), k = new De();
+function j(t, e, s, n) {
   if (e != null) {
     if ((typeof e == "object" || typeof e == "function") && typeof e.addDependency == "function") {
       e.addDependency(t);
@@ -401,26 +405,26 @@ function B(t, e, s, n) {
     }
     if (typeof e == "function") {
       const i = e;
-      s.indexOf(i) === -1 && (s.push(i), t.flags |= v.HAS_FN_SUBS);
+      s.indexOf(i) === -1 && (s.push(i), t.flags |= U.HAS_FN_SUBS);
       return;
     }
-    typeof e == "object" && typeof e.execute == "function" && n.indexOf(e) === -1 && (n.push(e), t.flags |= v.HAS_OBJ_SUBS);
+    typeof e == "object" && typeof e.execute == "function" && n.indexOf(e) === -1 && (n.push(e), t.flags |= U.HAS_OBJ_SUBS);
   }
 }
-function Re(t, e, s, n) {
+function Ue(t, e, s, n) {
   const i = t.length, o = e.length, r = e !== T && o > 0;
   if (r)
     for (let u = 0; u < o; u++) {
       const a = e[u];
       a && (a._tempUnsub = s[u]);
     }
-  const c = K.acquire();
+  const c = W.acquire();
   c.length = i;
   for (let u = 0; u < i; u++) {
     const a = t[u];
     if (!a) continue;
     const _ = a._tempUnsub;
-    _ ? (c[u] = _, a._tempUnsub = void 0) : (w.checkCircular(a, n), c[u] = a.subscribe(n));
+    _ ? (c[u] = _, a._tempUnsub = void 0) : (L.checkCircular(a, n), c[u] = a.subscribe(n));
   }
   if (r)
     for (let u = 0; u < o; u++) {
@@ -430,30 +434,30 @@ function Re(t, e, s, n) {
         _ && (_(), a._tempUnsub = void 0);
       }
     }
-  return s !== H && K.release(s), c;
+  return s !== H && W.release(s), c;
 }
-let ue = 0;
-function Pe() {
-  return ue = ue + 1 & z || 1, ue;
+let le = 0;
+function Ve() {
+  return le = le + 1 & X || 1, le;
 }
-function We() {
-  return ue;
+function st() {
+  return le;
 }
-let ge = 0, Se = 0, ae = !1;
-function Ae() {
-  return ae ? (N && console.warn(
+let ye = 0, Ce = 0, _e = !1;
+function we() {
+  return _e ? (N && console.warn(
     "Warning: startFlush() called during flush - ignored to prevent infinite loop detection bypass"
-  ), !1) : (ae = !0, ge = ge + 1 & z || 1, Se = 0, !0);
+  ), !1) : (_e = !0, ye = ye + 1 & X || 1, Ce = 0, !0);
 }
-function Oe() {
-  ae = !1;
+function Le() {
+  _e = !1;
 }
-function Ze() {
-  return ae ? ++Se : 0;
+function nt() {
+  return _e ? ++Ce : 0;
 }
-class et {
+class it {
   constructor() {
-    this._queueBuffer = [[], []], this._bufferIndex = 0, this._size = 0, this._epoch = 0, this.isProcessing = !1, this._isBatching = !1, this.batchDepth = 0, this.batchQueue = [], this.batchQueueSize = 0, this.isFlushingSync = !1, this.maxFlushIterations = j.MAX_FLUSH_ITERATIONS;
+    this._queueBuffer = [[], []], this._bufferIndex = 0, this._size = 0, this._epoch = 0, this.isProcessing = !1, this._isBatching = !1, this.batchDepth = 0, this.batchQueue = [], this.batchQueueSize = 0, this.isFlushingSync = !1, this.maxFlushIterations = $.MAX_FLUSH_ITERATIONS;
   }
   /**
    * Returns the current operational phase of the scheduler.
@@ -476,7 +480,7 @@ class et {
    */
   schedule(e) {
     if (N && typeof e != "function")
-      throw new ce("Scheduler callback must be a function");
+      throw new ae("Scheduler callback must be a function");
     const s = this._epoch;
     if (e._nextEpoch !== s) {
       if (e._nextEpoch = s, this._isBatching || this.isFlushingSync) {
@@ -494,8 +498,8 @@ class et {
     this.isProcessing || this._size === 0 || (this.isProcessing = !0, queueMicrotask(() => {
       try {
         if (this._size === 0) return;
-        const e = Ae();
-        this._drainQueue(), e && Oe();
+        const e = we();
+        this._drainQueue(), e && Le();
       } finally {
         this.isProcessing = !1, this._size > 0 && !this._isBatching && this.flush();
       }
@@ -507,11 +511,11 @@ class et {
    */
   flushSync() {
     this.isFlushingSync = !0;
-    const e = Ae();
+    const e = we();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this.isFlushingSync = !1, e && Oe();
+      this.isFlushingSync = !1, e && Le();
     }
   }
   /**
@@ -527,7 +531,7 @@ class et {
       const c = n[r];
       c._nextEpoch !== s && (c._nextEpoch = s, i[o++] = c);
     }
-    this._size = o, this.batchQueueSize = 0, n.length > j.BATCH_QUEUE_SHRINK_THRESHOLD && (n.length = 0);
+    this._size = o, this.batchQueueSize = 0, n.length > $.BATCH_QUEUE_SHRINK_THRESHOLD && (n.length = 0);
   }
   _drainQueue() {
     let e = 0;
@@ -546,7 +550,7 @@ class et {
   }
   _handleFlushOverflow() {
     console.error(
-      new ce(
+      new ae(
         `Maximum flush iterations (${this.maxFlushIterations}) exceeded. Possible infinite loop.`
       )
     ), this._size = 0, this._queueBuffer[this._bufferIndex].length = 0, this.batchQueueSize = 0;
@@ -557,7 +561,7 @@ class et {
         e[n]();
       } catch (i) {
         console.error(
-          new ce("Error occurred during scheduler execution", i)
+          new ae("Error occurred during scheduler execution", i)
         );
       }
     e.length = 0;
@@ -573,15 +577,15 @@ class et {
     this.batchDepth--, this.batchDepth === 0 && (this.flushSync(), this._isBatching = !1);
   }
   setMaxFlushIterations(e) {
-    if (e < j.MIN_FLUSH_ITERATIONS)
-      throw new ce(
-        `Max flush iterations must be at least ${j.MIN_FLUSH_ITERATIONS}`
+    if (e < $.MIN_FLUSH_ITERATIONS)
+      throw new ae(
+        `Max flush iterations must be at least ${$.MIN_FLUSH_ITERATIONS}`
       );
     this.maxFlushIterations = e;
   }
 }
-const oe = new et();
-class tt {
+const re = new it();
+class ot {
   constructor() {
     this.current = null;
   }
@@ -608,10 +612,10 @@ class tt {
     return this.current;
   }
 }
-const C = new tt();
-function ke(t) {
+const C = new ot();
+function je(t) {
   if (typeof t != "function")
-    throw new P("Untracked callback must be a function");
+    throw new M("Untracked callback must be a function");
   const e = C.current;
   C.current = null;
   try {
@@ -620,16 +624,16 @@ function ke(t) {
     C.current = e;
   }
 }
-class st extends Fe {
+class rt extends Be {
   constructor(e, s) {
-    super(), this._value = e, this._pendingOldValue = void 0, this._notifyTask = void 0, this._fnSubs = [], this._objSubs = [], s && (this.flags |= U.SYNC), w.attachDebugInfo(this, "atom", this.id);
+    super(), this._value = e, this._pendingOldValue = void 0, this._notifyTask = void 0, this._fnSubs = [], this._objSubs = [], s && (this.flags |= w.SYNC), L.attachDebugInfo(this, "atom", this.id);
   }
   /**
    * Returns the current value and registers the atom as a dependency if in a tracking context.
    */
   get value() {
     const e = C.current;
-    return e && B(this, e, this._fnSubs, this._objSubs), this._value;
+    return e && j(this, e, this._fnSubs, this._objSubs), this._value;
   }
   /**
    * Sets a new value and schedules notifications if the value has changed.
@@ -637,8 +641,8 @@ class st extends Fe {
   set value(e) {
     const s = this._value;
     if (Object.is(s, e)) return;
-    this._value = e, this.version = this.version + 1 & z;
-    const n = this.flags, i = U.HAS_FN_SUBS | U.HAS_OBJ_SUBS;
+    this._value = e, this.version = this.version + 1 & X;
+    const n = this.flags, i = w.HAS_FN_SUBS | w.HAS_OBJ_SUBS;
     n & i && this._scheduleNotification(s);
   }
   /**
@@ -646,19 +650,19 @@ class st extends Fe {
    */
   _scheduleNotification(e) {
     let s = this.flags;
-    if (s & U.NOTIFICATION_SCHEDULED || (this._pendingOldValue = e, this.flags = s |= U.NOTIFICATION_SCHEDULED), s & U.SYNC && !oe.isBatching) {
+    if (s & w.NOTIFICATION_SCHEDULED || (this._pendingOldValue = e, this.flags = s |= w.NOTIFICATION_SCHEDULED), s & w.SYNC && !re.isBatching) {
       this._flushNotifications();
       return;
     }
     let n = this._notifyTask;
-    n || (n = this._notifyTask = () => this._flushNotifications()), oe.schedule(n);
+    n || (n = this._notifyTask = () => this._flushNotifications()), re.schedule(n);
   }
   /**
    * Flushes scheduled notifications and resets state for the next cycle.
    */
   _flushNotifications() {
     const e = this.flags;
-    if (!(e & U.NOTIFICATION_SCHEDULED) || e & U.DISPOSED)
+    if (!(e & w.NOTIFICATION_SCHEDULED) || e & w.DISPOSED)
       return;
     const s = this._pendingOldValue, n = this._value;
     this._pendingOldValue = void 0, this.flags &= -17, this._notifySubscribers(n, s);
@@ -673,43 +677,43 @@ class st extends Fe {
    * Disposes of the atom and releases all subscribers and tasks.
    */
   dispose() {
-    this.flags & U.DISPOSED || (this._fnSubs = [], this._objSubs = [], this.flags |= U.DISPOSED, this._value = void 0, this._pendingOldValue = void 0, this._notifyTask = void 0);
+    this.flags & w.DISPOSED || (this._fnSubs = [], this._objSubs = [], this.flags |= w.DISPOSED, this._value = void 0, this._pendingOldValue = void 0, this._notifyTask = void 0);
   }
 }
-function nt(t, e = {}) {
-  return new st(t, e.sync ?? !1);
+function ct(t, e = {}) {
+  return new rt(t, e.sync ?? !1);
 }
-function ne(t, e, s) {
+function ie(t, e, s) {
   if (t instanceof TypeError)
     return new e(`Type error (${s}): ${t.message}`, t);
   if (t instanceof ReferenceError)
     return new e(`Reference error (${s}): ${t.message}`, t);
-  if (t instanceof P)
+  if (t instanceof M)
     return t;
   const n = t instanceof Error ? t.message : String(t), i = t instanceof Error ? t : null;
   return new e(`Unexpected error (${s}): ${n}`, i);
 }
-function be(t) {
+function Ie(t) {
   return t !== null && typeof t == "object" && "value" in t && "subscribe" in t && typeof t.subscribe == "function";
 }
-function ve(t) {
-  if (w.enabled && t != null && typeof t == "object") {
-    const e = w.getDebugType(t);
+function Fe(t) {
+  if (L.enabled && t != null && typeof t == "object") {
+    const e = L.getDebugType(t);
     if (e)
       return e === "computed";
   }
-  return be(t) && "invalidate" in t && typeof t.invalidate == "function";
+  return Ie(t) && "invalidate" in t && typeof t.invalidate == "function";
 }
-function Me(t) {
+function $e(t) {
   return t != null && typeof t.then == "function";
 }
-const Be = l.RESOLVED | l.PENDING | l.REJECTED, fe = Array(Be + 1).fill(le.IDLE);
-fe[l.RESOLVED] = le.RESOLVED;
-fe[l.PENDING] = le.PENDING;
-fe[l.REJECTED] = le.REJECTED;
-class it {
+const He = l.RESOLVED | l.PENDING | l.REJECTED, pe = Array(He + 1).fill(de.IDLE);
+pe[l.RESOLVED] = de.RESOLVED;
+pe[l.PENDING] = de.PENDING;
+pe[l.REJECTED] = de.REJECTED;
+class ut {
   constructor(e) {
-    this._owner = e, this._epoch = -1, this._nextDeps = T, this._nextVersions = R, this._depCount = 0;
+    this._owner = e, this._epoch = -1, this._nextDeps = T, this._nextVersions = x, this._depCount = 0;
   }
   execute() {
     this._owner._markDirty();
@@ -722,14 +726,14 @@ class it {
     s < n.length ? (n[s] = e, i[s] = e.version) : (n.push(e), i.push(e.version)), this._depCount = s + 1;
   }
   reset() {
-    this._epoch = -1, this._nextDeps = T, this._nextVersions = R, this._depCount = 0;
+    this._epoch = -1, this._nextDeps = T, this._nextVersions = x, this._depCount = 0;
   }
 }
-class Ve extends Fe {
+class ze extends Be {
   constructor(e, s = {}) {
     if (typeof e != "function")
-      throw new V(E.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this.MAX_ASYNC_RETRIES = 3, this._value = void 0, this.flags = l.DIRTY | l.IDLE, this._error = null, this._promiseId = 0, this._equal = s.equal ?? Object.is, this._fn = e, this._defaultValue = "defaultValue" in s ? s.defaultValue : Te, this._hasDefaultValue = this._defaultValue !== Te, this._onError = s.onError ?? null, this.MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1, this._fnSubs = [], this._objSubs = [], this._dependencies = T, this._dependencyVersions = R, this._unsubscribes = H, this._cachedErrors = null, this._errorCacheEpoch = -1, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._trackable = new it(this), w.attachDebugInfo(this, "computed", this.id), w.enabled) {
+      throw new P(b.COMPUTED_MUST_BE_FUNCTION);
+    if (super(), this.MAX_ASYNC_RETRIES = 3, this._value = void 0, this.flags = l.DIRTY | l.IDLE, this._error = null, this._promiseId = 0, this._equal = s.equal ?? Object.is, this._fn = e, this._defaultValue = "defaultValue" in s ? s.defaultValue : Ae, this._hasDefaultValue = this._defaultValue !== Ae, this._onError = s.onError ?? null, this.MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1, this._fnSubs = [], this._objSubs = [], this._dependencies = T, this._dependencyVersions = x, this._unsubscribes = H, this._cachedErrors = null, this._errorCacheEpoch = -1, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, this._trackable = new ut(this), L.attachDebugInfo(this, "computed", this.id), L.enabled) {
       const n = this;
       n.subscriberCount = this.subscriberCount.bind(this), n.isDirty = () => (this.flags & l.DIRTY) !== 0, n.dependencies = this._dependencies, n.stateFlags = "";
     }
@@ -741,11 +745,13 @@ class Ve extends Fe {
   }
   get value() {
     const e = C.current;
-    e && B(this, e, this._fnSubs, this._objSubs);
+    e && j(this, e, this._fnSubs, this._objSubs);
     const s = this.flags;
+    if (s & l.DISPOSED)
+      throw new P(b.COMPUTED_DISPOSED);
     if (s & l.RECOMPUTING) {
       if (this._hasDefaultValue) return this._defaultValue;
-      throw new V(E.COMPUTED_CIRCULAR_DEPENDENCY);
+      throw new P(b.COMPUTED_CIRCULAR_DEPENDENCY);
     }
     s & (l.DIRTY | l.IDLE) && this._recompute();
     const n = this.flags;
@@ -756,11 +762,11 @@ class Ve extends Fe {
   }
   get state() {
     const e = C.current;
-    return e && B(this, e, this._fnSubs, this._objSubs), fe[this.flags & Be];
+    return e && j(this, e, this._fnSubs, this._objSubs), pe[this.flags & He];
   }
   get hasError() {
     const e = C.current;
-    if (e && B(this, e, this._fnSubs, this._objSubs), this.flags & (l.REJECTED | l.HAS_ERROR)) return !0;
+    if (e && j(this, e, this._fnSubs, this._objSubs), this.flags & (l.REJECTED | l.HAS_ERROR)) return !0;
     const s = this._dependencies;
     for (let n = 0, i = s.length; n < i; n++) {
       const o = s[n];
@@ -773,8 +779,8 @@ class Ve extends Fe {
   }
   get errors() {
     const e = C.current;
-    if (e && B(this, e, this._fnSubs, this._objSubs), !this.hasError) return Xe;
-    const s = We();
+    if (e && j(this, e, this._fnSubs, this._objSubs), !this.hasError) return Qe;
+    const s = st();
     if (this._errorCacheEpoch === s && this._cachedErrors !== null)
       return this._cachedErrors;
     const n = /* @__PURE__ */ new Set();
@@ -784,9 +790,9 @@ class Ve extends Fe {
       const u = i[r];
       if (u && "errors" in u) {
         const a = u.errors;
-        for (let _ = 0, k = a.length; _ < k; _++) {
-          const y = a[_];
-          y && n.add(y);
+        for (let _ = 0, B = a.length; _ < B; _++) {
+          const D = a[_];
+          D && n.add(D);
         }
       }
     }
@@ -795,20 +801,20 @@ class Ve extends Fe {
   }
   get lastError() {
     const e = C.current;
-    return e && B(this, e, this._fnSubs, this._objSubs), this._error;
+    return e && j(this, e, this._fnSubs, this._objSubs), this._error;
   }
   get isPending() {
     const e = C.current;
-    return e && B(this, e, this._fnSubs, this._objSubs), (this.flags & l.PENDING) !== 0;
+    return e && j(this, e, this._fnSubs, this._objSubs), (this.flags & l.PENDING) !== 0;
   }
   get isResolved() {
     const e = C.current;
-    return e && B(this, e, this._fnSubs, this._objSubs), (this.flags & l.RESOLVED) !== 0;
+    return e && j(this, e, this._fnSubs, this._objSubs), (this.flags & l.RESOLVED) !== 0;
   }
   invalidate() {
     this._markDirty();
     const e = this._dependencyVersions;
-    e !== R && (F.release(e), this._dependencyVersions = R), this._errorCacheEpoch = -1, this._cachedErrors = null;
+    e !== x && (k.release(e), this._dependencyVersions = x), this._errorCacheEpoch = -1, this._cachedErrors = null;
   }
   dispose() {
     const e = this._unsubscribes;
@@ -817,12 +823,12 @@ class Ve extends Fe {
         const r = e[i];
         r && r();
       }
-      K.release(e), this._unsubscribes = H;
+      W.release(e), this._unsubscribes = H;
     }
     const s = this._dependencies;
-    s !== T && ($.release(s), this._dependencies = T);
+    s !== T && (z.release(s), this._dependencies = T);
     const n = this._dependencyVersions;
-    n !== R && (F.release(n), this._dependencyVersions = R), this._fnSubs = [], this._objSubs = [], this.flags = l.DISPOSED | l.DIRTY | l.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % this.MAX_PROMISE_ID, this._cachedErrors = null, this._errorCacheEpoch = -1;
+    n !== x && (k.release(n), this._dependencyVersions = x), this._fnSubs = [], this._objSubs = [], this.flags = l.DISPOSED | l.DIRTY | l.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % this.MAX_PROMISE_ID, this._cachedErrors = null, this._errorCacheEpoch = -1;
   }
   _clearDirty() {
     this.flags &= -9;
@@ -851,23 +857,23 @@ class Ve extends Fe {
       return;
     this._setRecomputing(!0);
     const e = this._trackable, s = this._dependencies, n = this._dependencyVersions;
-    e._epoch = Pe(), e._nextDeps = $.acquire(), e._nextVersions = F.acquire(), e._depCount = 0;
+    e._epoch = Ve(), e._nextDeps = z.acquire(), e._nextVersions = k.acquire(), e._depCount = 0;
     let i = !1;
     try {
       const o = C.run(e, this._fn), r = e._nextDeps, c = e._nextVersions, u = e._depCount;
-      r.length = u, c.length = u, this._unsubscribes = Re(r, s, this._unsubscribes, this), this._dependencies = r, this._dependencyVersions = c, i = !0, Me(o) ? this._handleAsyncComputation(o) : this._finalizeResolution(o);
+      r.length = u, c.length = u, this._unsubscribes = Ue(r, s, this._unsubscribes, this), this._dependencies = r, this._dependencyVersions = c, i = !0, $e(o) ? this._handleAsyncComputation(o) : this._finalizeResolution(o);
     } catch (o) {
       let r = o;
       if (!i)
         try {
           const c = e._nextDeps, u = e._nextVersions, a = e._depCount;
-          c.length = a, u.length = a, this._unsubscribes = Re(c, s, this._unsubscribes, this), this._dependencies = c, this._dependencyVersions = u, i = !0;
+          c.length = a, u.length = a, this._unsubscribes = Ue(c, s, this._unsubscribes, this), this._dependencies = c, this._dependencyVersions = u, i = !0;
         } catch (c) {
           r = c;
         }
       this._handleComputationError(r);
     } finally {
-      i ? (s !== T && $.release(s), n !== R && F.release(n)) : ($.release(e._nextDeps), F.release(e._nextVersions)), e.reset(), this._setRecomputing(!1);
+      i ? (s !== T && z.release(s), n !== x && k.release(n)) : (z.release(e._nextDeps), k.release(e._nextVersions)), e.reset(), this._setRecomputing(!1);
     }
   }
   _handleAsyncComputation(e) {
@@ -880,7 +886,7 @@ class Ve extends Fe {
             this._asyncRetryCount++, this._markDirty();
             return;
           }
-          const i = new V(
+          const i = new P(
             `Async drift exceeded threshold after ${this.MAX_ASYNC_RETRIES} retries.`
           );
           this._handleAsyncRejection(i);
@@ -899,42 +905,42 @@ class Ve extends Fe {
       const o = s[n];
       if (o) {
         const r = o.version;
-        e = ((e << 5) - e | 0) + r & z;
+        e = ((e << 5) - e | 0) + r & X;
       }
     }
     return e;
   }
   _handleAsyncRejection(e) {
-    const s = ne(e, V, E.COMPUTED_ASYNC_COMPUTATION_FAILED);
-    this.flags & l.REJECTED || (this.version = this.version + 1 & z), this._error = s, this._setRejected(), this._clearDirty();
+    const s = ie(e, P, b.COMPUTED_ASYNC_COMPUTATION_FAILED);
+    this.flags & l.REJECTED || (this.version = this.version + 1 & X), this._error = s, this._setRejected(), this._clearDirty();
     const n = this._onError;
     if (n)
       try {
         n(s);
       } catch (i) {
-        console.error(E.CALLBACK_ERROR_IN_ERROR_HANDLER, i);
+        console.error(b.CALLBACK_ERROR_IN_ERROR_HANDLER, i);
       }
     this._notifySubscribers(void 0, void 0);
   }
   _finalizeResolution(e) {
-    (!(this.flags & l.RESOLVED) || !this._equal(this._value, e)) && (this.version = this.version + 1 & z), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1), this._cachedErrors = null, this._errorCacheEpoch = -1;
+    (!(this.flags & l.RESOLVED) || !this._equal(this._value, e)) && (this.version = this.version + 1 & X), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1), this._cachedErrors = null, this._errorCacheEpoch = -1;
   }
   _handleComputationError(e) {
-    const s = ne(e, V, E.COMPUTED_COMPUTATION_FAILED);
+    const s = ie(e, P, b.COMPUTED_COMPUTATION_FAILED);
     this._error = s, this._setRejected(), this._clearDirty(), this._setRecomputing(!1);
     const n = this._onError;
     if (n)
       try {
         n(s);
       } catch (i) {
-        console.error(E.CALLBACK_ERROR_IN_ERROR_HANDLER, i);
+        console.error(b.CALLBACK_ERROR_IN_ERROR_HANDLER, i);
       }
     throw s;
   }
   _handlePending() {
     if (this._hasDefaultValue)
       return this._defaultValue;
-    throw new V(E.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+    throw new P(b.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
   }
   _handleRejected() {
     const e = this._error;
@@ -951,40 +957,40 @@ class Ve extends Fe {
     e & (l.RECOMPUTING | l.DIRTY) || (this.flags = e | l.DIRTY, this._notifySubscribers(void 0, void 0));
   }
 }
-Object.freeze(Ve.prototype);
-function ot(t, e = {}) {
-  return new Ve(t, e);
+Object.freeze(ze.prototype);
+function ht(t, e = {}) {
+  return new ze(t, e);
 }
-class rt extends Le {
+class at extends Me {
   constructor(e, s = {}) {
-    super(), this._cleanup = null, this._dependencies = T, this._dependencyVersions = R, this._unsubscribes = H, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, this._executeTask = void 0, this._onError = s.onError ?? null, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._fn = e, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? j.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? j.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = s.trackModifications ?? !1, this._executionCount = 0, this._historyPtr = 0;
-    const n = Number.isFinite(this._maxExecutions), i = n ? Math.min(this._maxExecutions + 1, j.MAX_EXECUTIONS_PER_SECOND + 1) : 0;
-    this._historyCapacity = i, this._history = N && n && i > 0 ? new Array(i).fill(0) : null, this._execId = 0, w.attachDebugInfo(this, "effect", this.id);
+    super(), this._cleanup = null, this._dependencies = T, this._dependencyVersions = x, this._unsubscribes = H, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, this._executeTask = void 0, this._onError = s.onError ?? null, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._fn = e, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? $.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? $.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = s.trackModifications ?? !1, this._executionCount = 0, this._historyPtr = 0;
+    const n = Number.isFinite(this._maxExecutions), i = n ? Math.min(this._maxExecutions + 1, $.MAX_EXECUTIONS_PER_SECOND + 1) : 0;
+    this._historyCapacity = i, this._history = N && n && i > 0 ? new Array(i).fill(0) : null, this._execId = 0, L.attachDebugInfo(this, "effect", this.id);
   }
   run() {
-    if (this.flags & O.DISPOSED)
-      throw new J(E.EFFECT_DISPOSED);
+    if (this.flags & v.DISPOSED)
+      throw new K(b.EFFECT_DISPOSED);
     this.execute(!0);
   }
   dispose() {
     const e = this.flags;
-    if (e & O.DISPOSED) return;
-    this.flags = e | O.DISPOSED, this._safeCleanup();
+    if (e & v.DISPOSED) return;
+    this.flags = e | v.DISPOSED, this._safeCleanup();
     const s = this._unsubscribes;
     if (s !== H) {
       for (let o = 0, r = s.length; o < r; o++) {
         const c = s[o];
         c && c();
       }
-      K.release(s), this._unsubscribes = H;
+      W.release(s), this._unsubscribes = H;
     }
     const n = this._dependencies;
-    n !== T && ($.release(n), this._dependencies = T);
+    n !== T && (z.release(n), this._dependencies = T);
     const i = this._dependencyVersions;
-    i !== R && (F.release(i), this._dependencyVersions = R), this._executeTask = void 0;
+    i !== x && (k.release(i), this._dependencyVersions = x), this._executeTask = void 0;
   }
   addDependency(e) {
-    if (!(this.flags & O.EXECUTING)) return;
+    if (!(this.flags & v.EXECUTING)) return;
     const s = this._currentEpoch;
     if (e._lastSeenEpoch === s) return;
     e._lastSeenEpoch = s;
@@ -995,7 +1001,7 @@ class rt extends Le {
     r ? (o.push(r), e._tempUnsub = void 0) : this._subscribeTo(e);
   }
   execute(e = !1) {
-    if (this.flags & (O.DISPOSED | O.EXECUTING) || !e && !this._shouldExecute()) return;
+    if (this.flags & (v.DISPOSED | v.EXECUTING) || !e && !this._shouldExecute()) return;
     this._checkInfiniteLoop(), this._setExecuting(!0), this._safeCleanup();
     const s = this._prepareEffectExecutionContext();
     let n = !1;
@@ -1003,14 +1009,14 @@ class rt extends Le {
       const i = C.run(this, this._fn), o = s.nextDeps.length;
       s.nextDeps.length = o, s.nextVersions.length = o, this._dependencies = s.nextDeps, this._dependencyVersions = s.nextVersions, this._unsubscribes = s.nextUnsubs, n = !0, this._checkLoopWarnings();
       const r = ++this._execId;
-      Me(i) ? i.then((c) => {
-        const u = r !== this._execId, a = this.flags & O.DISPOSED;
+      $e(i) ? i.then((c) => {
+        const u = r !== this._execId, a = this.flags & v.DISPOSED;
         if (u || a) {
           if (typeof c == "function")
             try {
               c();
             } catch (_) {
-              this._handleExecutionError(_, E.EFFECT_CLEANUP_FAILED);
+              this._handleExecutionError(_, b.EFFECT_CLEANUP_FAILED);
             }
           return;
         }
@@ -1025,7 +1031,7 @@ class rt extends Le {
     }
   }
   _prepareEffectExecutionContext() {
-    const e = this._dependencies, s = this._dependencyVersions, n = this._unsubscribes, i = $.acquire(), o = F.acquire(), r = K.acquire(), c = Pe();
+    const e = this._dependencies, s = this._dependencyVersions, n = this._unsubscribes, i = z.acquire(), o = k.acquire(), r = W.acquire(), c = Ve();
     if (e !== T)
       for (let u = 0, a = e.length; u < a; u++) {
         const _ = e[u];
@@ -1042,15 +1048,15 @@ class rt extends Le {
           const r = n[i], c = r ? r._tempUnsub : void 0;
           c && (c(), r && (r._tempUnsub = void 0));
         }
-        $.release(n);
+        z.release(n);
       }
-      e.prevUnsubs !== H && K.release(e.prevUnsubs), e.prevVersions !== R && F.release(e.prevVersions);
+      e.prevUnsubs !== H && W.release(e.prevUnsubs), e.prevVersions !== x && k.release(e.prevVersions);
     } else {
-      $.release(e.nextDeps), F.release(e.nextVersions);
+      z.release(e.nextDeps), k.release(e.nextVersions);
       const i = e.nextUnsubs;
       for (let o = 0, r = i.length; o < r; o++)
         i[o]?.();
-      if (K.release(i), n !== T)
+      if (W.release(i), n !== T)
         for (let o = 0, r = n.length; o < r; o++) {
           const c = n[o];
           c && (c._tempUnsub = void 0);
@@ -1060,32 +1066,32 @@ class rt extends Le {
   _subscribeTo(e) {
     try {
       const s = e.subscribe(() => {
-        if (this._trackModifications && this.flags & O.EXECUTING && (e._modifiedAtEpoch = this._currentEpoch), this._sync) {
+        if (this._trackModifications && this.flags & v.EXECUTING && (e._modifiedAtEpoch = this._currentEpoch), this._sync) {
           this.execute();
           return;
         }
         let i = this._executeTask;
-        i || (i = this._executeTask = () => this.execute()), oe.schedule(i);
+        i || (i = this._executeTask = () => this.execute()), re.schedule(i);
       }), n = this._nextUnsubs;
       n && n.push(s);
     } catch (s) {
-      console.error(ne(s, J, E.EFFECT_EXECUTION_FAILED));
+      console.error(ie(s, K, b.EFFECT_EXECUTION_FAILED));
       const n = this._nextUnsubs;
       n && n.push(() => {
       });
     }
   }
   get isDisposed() {
-    return (this.flags & O.DISPOSED) !== 0;
+    return (this.flags & v.DISPOSED) !== 0;
   }
   get executionCount() {
     return this._executionCount;
   }
   get isExecuting() {
-    return (this.flags & O.EXECUTING) !== 0;
+    return (this.flags & v.EXECUTING) !== 0;
   }
   _setExecuting(e) {
-    const s = O.EXECUTING;
+    const s = v.EXECUTING;
     this.flags = this.flags & ~s | (e ? -1 : 0) & s;
   }
   _safeCleanup() {
@@ -1094,14 +1100,14 @@ class rt extends Le {
       try {
         e();
       } catch (s) {
-        this._handleExecutionError(s, E.EFFECT_CLEANUP_FAILED);
+        this._handleExecutionError(s, b.EFFECT_CLEANUP_FAILED);
       }
       this._cleanup = null;
     }
   }
   _checkInfiniteLoop() {
-    const e = ge;
-    this._lastFlushEpoch !== e && (this._lastFlushEpoch = e, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), Ze() > j.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
+    const e = ye;
+    this._lastFlushEpoch !== e && (this._lastFlushEpoch = e, this._executionsInEpoch = 0), ++this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), nt() > $.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++;
     const s = this._history;
     if (s) {
       const n = Date.now(), i = this._historyPtr, o = this._historyCapacity;
@@ -1109,8 +1115,8 @@ class rt extends Le {
       const r = (i + 1) % o;
       this._historyPtr = r;
       const c = s[r] ?? 0;
-      if (c > 0 && n - c < ze.ONE_SECOND_MS) {
-        const u = new J(
+      if (c > 0 && n - c < Ye.ONE_SECOND_MS) {
+        const u = new K(
           `Effect executed ${o} times within 1 second. Infinite loop suspected`
         );
         if (this.dispose(), console.error(u), this._onError && this._onError(u), N) throw u;
@@ -1119,8 +1125,8 @@ class rt extends Le {
     }
   }
   _throwInfiniteLoopError(e) {
-    const s = new J(
-      `Infinite loop detected (${e}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${Se}`
+    const s = new K(
+      `Infinite loop detected (${e}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${Ce}`
     );
     throw this.dispose(), console.error(s), s;
   }
@@ -1134,7 +1140,7 @@ class rt extends Le {
         if (o.version !== s[n]) return !0;
         if ("value" in o)
           try {
-            ke(() => o.value);
+            if (je(() => o.value), o.version !== s[n]) return !0;
           } catch {
             return !0;
           }
@@ -1142,50 +1148,50 @@ class rt extends Le {
     }
     return !1;
   }
-  _handleExecutionError(e, s = E.EFFECT_EXECUTION_FAILED) {
-    const n = ne(e, J, s);
+  _handleExecutionError(e, s = b.EFFECT_EXECUTION_FAILED) {
+    const n = ie(e, K, s);
     console.error(n);
     const i = this._onError;
     if (i)
       try {
         i(n);
       } catch (o) {
-        console.error(ne(o, J, E.CALLBACK_ERROR_IN_ERROR_HANDLER));
+        console.error(ie(o, K, b.CALLBACK_ERROR_IN_ERROR_HANDLER));
       }
   }
   _checkLoopWarnings() {
-    if (this._trackModifications && w.enabled) {
+    if (this._trackModifications && L.enabled) {
       const e = this._dependencies, s = this._currentEpoch;
       for (let n = 0, i = e.length; n < i; n++) {
         const o = e[n];
-        o && o._modifiedAtEpoch === s && w.warn(
+        o && o._modifiedAtEpoch === s && L.warn(
           !0,
-          `Effect is reading a dependency (${w.getDebugName(o) || "unknown"}) that it just modified. Infinite loop may occur`
+          `Effect is reading a dependency (${L.getDebugName(o) || "unknown"}) that it just modified. Infinite loop may occur`
         );
       }
     }
   }
 }
-function W(t, e = {}) {
+function Z(t, e = {}) {
   if (typeof t != "function")
-    throw new J(E.EFFECT_MUST_BE_FUNCTION);
-  const s = new rt(t, e);
+    throw new K(b.EFFECT_MUST_BE_FUNCTION);
+  const s = new at(t, e);
   return s.execute(), s;
 }
-function ye(t) {
+function Ne(t) {
   if (typeof t != "function")
-    throw new P("Batch callback must be a function");
-  oe.startBatch();
+    throw new M("Batch callback must be a function");
+  re.startBatch();
   try {
     return t();
   } finally {
-    oe.endBatch();
+    re.endBatch();
   }
 }
-function ct(t) {
+function lt(t) {
   return t !== null && typeof t == "object" && "value" in t && "subscribe" in t;
 }
-function _e(t) {
+function Ee(t) {
   if (!t) return "unknown";
   const e = "jquery" in t ? t[0] : t;
   if (!e) return "unknown";
@@ -1196,7 +1202,7 @@ function _e(t) {
   }
   return e.tagName.toLowerCase();
 }
-function ut(t) {
+function ft(t) {
   const e = t.length;
   if (e === 0) return new Int32Array(0);
   const s = new Int32Array(e), n = new Int32Array(e);
@@ -1220,7 +1226,7 @@ function ut(t) {
     o[r] = c, c = s[c];
   return o;
 }
-function ht() {
+function _t() {
   if (typeof window < "u") {
     const t = window.__ATOM_DEBUG__;
     if (typeof t == "boolean")
@@ -1233,36 +1239,36 @@ function ht() {
   }
   return !1;
 }
-let Q = ht();
-const g = {
+let J = _t();
+const m = {
   get enabled() {
-    return Q;
+    return J;
   },
   set enabled(t) {
-    Q = t;
+    J = t;
   },
   log(t, ...e) {
-    Q && console.log(`[atom-effect-jquery] ${t}:`, ...e);
+    J && console.log(`[atom-effect-jquery] ${t}:`, ...e);
   },
   atomChanged(t, e, s) {
-    Q && console.log(`[atom-effect-jquery] Atom "${t || "anonymous"}" changed:`, e, "→", s);
+    J && console.log(`[atom-effect-jquery] Atom "${t || "anonymous"}" changed:`, e, "→", s);
   },
   /**
    * Logs DOM updates and triggers visual highlight.
    */
   domUpdated(t, e, s) {
-    if (!Q) return;
-    const n = _e(t);
-    console.log(`[atom-effect-jquery] DOM updated: ${n}.${e} =`, s), at(t);
+    if (!J) return;
+    const n = Ee(t);
+    console.log(`[atom-effect-jquery] DOM updated: ${n}.${e} =`, s), dt(t);
   },
   cleanup(t) {
-    Q && console.log(`[atom-effect-jquery] Cleanup: ${t}`);
+    J && console.log(`[atom-effect-jquery] Cleanup: ${t}`);
   },
   warn(...t) {
-    Q && console.warn("[atom-effect-jquery]", ...t);
+    J && console.warn("[atom-effect-jquery]", ...t);
   }
 };
-function at(t) {
+function dt(t) {
   const e = t[0];
   if (!e || !document.contains(e)) return;
   const s = "atom_debug_timer", n = "atom_debug_cleanup_timer", i = "atom_debug_org_style";
@@ -1291,35 +1297,35 @@ function at(t) {
   }, 100);
   t.data(s, o);
 }
-const lt = /* @__PURE__ */ new WeakMap();
-function je(t, e = {}) {
-  const s = nt(t, e);
-  return e.name && lt.set(s, { name: e.name }), s;
+const pt = /* @__PURE__ */ new WeakMap();
+function Xe(t, e = {}) {
+  const s = ct(t, e);
+  return e.name && pt.set(s, { name: e.name }), s;
 }
-Object.defineProperty(je, "debug", {
+Object.defineProperty(Xe, "debug", {
   get() {
-    return g.enabled;
+    return m.enabled;
   },
   set(t) {
-    g.enabled = t;
+    m.enabled = t;
   }
 });
-function ft() {
+function Et() {
   return new Promise((t) => setTimeout(t, 0));
 }
 h.extend({
-  atom: je,
-  computed: ot,
-  effect: W,
-  batch: ye,
-  untracked: ke,
-  isAtom: be,
-  isComputed: ve,
-  isReactive: (t) => be(t) || ve(t),
-  nextTick: ft
+  atom: Xe,
+  computed: ht,
+  effect: Z,
+  batch: Ne,
+  untracked: je,
+  isAtom: Ie,
+  isComputed: Fe,
+  isReactive: (t) => Ie(t) || Fe(t),
+  nextTick: Et
 });
-const te = "_aes-bound";
-class _t {
+const se = "_aes-bound";
+class gt {
   effects = /* @__PURE__ */ new WeakMap();
   cleanups = /* @__PURE__ */ new WeakMap();
   boundElements = /* @__PURE__ */ new WeakSet();
@@ -1340,18 +1346,18 @@ class _t {
   }
   trackEffect(e, s) {
     let n = this.effects.get(e);
-    n || (n = [], this.effects.set(e, n), this.boundElements.has(e) || (this.boundElements.add(e), e.classList.add(te))), n.push(s);
+    n || (n = [], this.effects.set(e, n), this.boundElements.has(e) || (this.boundElements.add(e), e.classList.add(se))), n.push(s);
   }
   trackCleanup(e, s) {
     let n = this.cleanups.get(e);
-    n || (n = [], this.cleanups.set(e, n), this.boundElements.has(e) || (this.boundElements.add(e), e.classList.add(te))), n.push(s);
+    n || (n = [], this.cleanups.set(e, n), this.boundElements.has(e) || (this.boundElements.add(e), e.classList.add(se))), n.push(s);
   }
   hasBind(e) {
     return this.boundElements.has(e);
   }
   cleanup(e) {
     if (!this.boundElements.delete(e)) return;
-    this.preservedNodes.delete(e), this.ignoredNodes.delete(e), e.classList.remove(te), g.cleanup(_e(e));
+    this.preservedNodes.delete(e), this.ignoredNodes.delete(e), e.classList.remove(se), m.cleanup(Ee(e));
     const s = this.effects.get(e);
     if (s) {
       this.effects.delete(e);
@@ -1361,7 +1367,7 @@ class _t {
           try {
             r.dispose();
           } catch (c) {
-            g.warn("Effect dispose error:", c);
+            m.warn("Effect dispose error:", c);
           }
       }
     }
@@ -1374,26 +1380,26 @@ class _t {
           try {
             r();
           } catch (c) {
-            g.warn("Cleanup error:", c);
+            m.warn("Cleanup error:", c);
           }
       }
     }
   }
   cleanupDescendants(e) {
-    const s = e.querySelectorAll(`.${te}`);
+    const s = e.querySelectorAll(`.${se}`);
     for (let n = 0, i = s.length; n < i; n++) {
       const o = s[n];
-      o && (this.boundElements.has(o) ? this.cleanup(o) : o.classList.remove(te));
+      o && (this.boundElements.has(o) ? this.cleanup(o) : o.classList.remove(se));
     }
   }
   cleanupTree(e) {
     this.cleanupDescendants(e), this.cleanup(e);
   }
 }
-const d = new _t();
-let ie = null;
-function dt(t = document.body) {
-  ie || (ie = new MutationObserver((e) => {
+const d = new gt();
+let oe = null;
+function bt(t = document.body) {
+  oe || (oe = new MutationObserver((e) => {
     for (let s = 0, n = e.length; s < n; s++) {
       const i = e[s];
       if (!i) continue;
@@ -1403,92 +1409,92 @@ function dt(t = document.body) {
         u && (d.isKept(u) || d.isIgnored(u) || u.isConnected || u.nodeType === 1 && d.cleanupTree(u));
       }
     }
-  }), ie.observe(t, { childList: !0, subtree: !0 }));
+  }), oe.observe(t, { childList: !0, subtree: !0 }));
 }
-function Rt() {
-  ie?.disconnect(), ie = null;
+function Ut() {
+  oe?.disconnect(), oe = null;
 }
-function b(t, e, s, n) {
+function S(t, e, s, n) {
   const i = h(t);
-  if (ct(e)) {
-    const o = W(() => {
+  if (lt(e)) {
+    const o = Z(() => {
       const r = e.value;
-      s(r), g.domUpdated(i, n, r);
+      s(r), m.domUpdated(i, n, r);
     });
     d.trackEffect(t, o);
   } else
-    s(e), g.domUpdated(i, n, e);
+    s(e), m.domUpdated(i, n, e);
 }
-var p = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.Focused = 1] = "Focused", t[t.Composing = 2] = "Composing", t[t.SyncingToAtom = 4] = "SyncingToAtom", t[t.SyncingToDom = 8] = "SyncingToDom", t[t.Busy = 14] = "Busy", t))(p || {});
-function Ie() {
+var E = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.Focused = 1] = "Focused", t[t.Composing = 2] = "Composing", t[t.SyncingToAtom = 4] = "SyncingToAtom", t[t.SyncingToDom = 8] = "SyncingToDom", t[t.Busy = 14] = "Busy", t))(E || {});
+function Te() {
   return {
     timeoutId: null,
     flags: 0
     /* None */
   };
 }
-function He(t, e, s = {}) {
+function qe(t, e, s = {}) {
   const {
     debounce: n,
     event: i = "input",
-    parse: o = (m) => m,
-    format: r = (m) => String(m ?? ""),
+    parse: o = (y) => y,
+    format: r = (y) => String(y ?? ""),
     equal: c = Object.is
-  } = s, u = Ie(), a = () => {
-    u.flags |= p.Composing;
+  } = s, u = Te(), a = () => {
+    u.flags |= E.Composing;
   }, _ = () => {
-    u.flags &= ~p.Composing, y();
+    u.flags &= ~E.Composing, D();
   };
   t.on("compositionstart", a), t.on("compositionend", _);
-  const k = () => {
-    u.flags |= p.Focused;
-  }, y = () => {
-    if (!(u.flags & p.Busy)) {
-      u.flags |= p.SyncingToAtom;
+  const B = () => {
+    u.flags |= E.Focused;
+  }, D = () => {
+    if (!(u.flags & E.Busy)) {
+      u.flags |= E.SyncingToAtom;
       try {
         e.value = o(t.val());
       } finally {
-        u.flags &= ~p.SyncingToAtom;
+        u.flags &= ~E.SyncingToAtom;
       }
     }
-  }, X = () => {
-    u.timeoutId && (clearTimeout(u.timeoutId), u.timeoutId = null, y()), u.flags &= ~p.Focused;
-    const m = r(e.value);
-    t.val() !== m && t.val(m);
+  }, q = () => {
+    u.timeoutId && (clearTimeout(u.timeoutId), u.timeoutId = null, D()), u.flags &= ~E.Focused;
+    const y = r(e.value);
+    t.val() !== y && t.val(y);
   };
-  t.on("focus", k), t.on("blur", X);
-  const A = () => {
-    u.flags & p.Busy || (n ? (u.timeoutId && clearTimeout(u.timeoutId), u.timeoutId = window.setTimeout(y, n)) : y());
+  t.on("focus", B), t.on("blur", q);
+  const R = () => {
+    u.flags & E.Busy || (n ? (u.timeoutId && clearTimeout(u.timeoutId), u.timeoutId = window.setTimeout(D, n)) : D());
   };
-  return t.on(i, A), t.on("change", A), { effect: () => {
-    const m = r(e.value), x = t.val();
-    if (x !== m) {
-      if (u.flags & p.Focused && c(o(x), e.value))
+  return t.on(i, R), t.on("change", R), { effect: () => {
+    const y = r(e.value), O = t.val();
+    if (O !== y) {
+      if (u.flags & E.Focused && c(o(O), e.value))
         return;
-      u.flags |= p.SyncingToDom;
+      u.flags |= E.SyncingToDom;
       try {
-        if (u.flags & p.Focused) {
-          const M = t[0], Z = M.selectionStart, re = M.selectionEnd;
-          t.val(m);
-          const G = m.length;
-          M.setSelectionRange(
-            Math.min(Z ?? G, G),
-            Math.min(re ?? G, G)
+        if (u.flags & E.Focused) {
+          const V = t[0], te = V.selectionStart, ce = V.selectionEnd;
+          t.val(y);
+          const Y = y.length;
+          V.setSelectionRange(
+            Math.min(te ?? Y, Y),
+            Math.min(ce ?? Y, Y)
           );
         } else
-          t.val(m);
-        g.domUpdated(t, "val", m);
+          t.val(y);
+        m.domUpdated(t, "val", y);
       } finally {
-        u.flags &= ~p.SyncingToDom;
+        u.flags &= ~E.SyncingToDom;
       }
     }
   }, cleanup: () => {
-    t.off(i, A), t.off("change", A), t.off("compositionstart", a), t.off("compositionend", _), t.off("focus", k), t.off("blur", X), u.timeoutId && clearTimeout(u.timeoutId);
+    t.off(i, R), t.off("change", R), t.off("compositionstart", a), t.off("compositionend", _), t.off("focus", B), t.off("blur", q), u.timeoutId && clearTimeout(u.timeoutId);
   } };
 }
 h.fn.atomText = function(t, e) {
   return this.each(function() {
-    b(
+    S(
       this,
       t,
       (s) => {
@@ -1501,12 +1507,12 @@ h.fn.atomText = function(t, e) {
 };
 h.fn.atomHtml = function(t) {
   return this.each(function() {
-    b(this, t, (e) => h(this).html(String(e ?? "")), "html");
+    S(this, t, (e) => h(this).html(String(e ?? "")), "html");
   });
 };
 h.fn.atomClass = function(t, e) {
   return this.each(function() {
-    b(
+    S(
       this,
       e,
       (s) => h(this).toggleClass(t, !!s),
@@ -1516,7 +1522,7 @@ h.fn.atomClass = function(t, e) {
 };
 h.fn.atomCss = function(t, e, s) {
   return this.each(function() {
-    b(
+    S(
       this,
       e,
       (n) => {
@@ -1529,7 +1535,7 @@ h.fn.atomCss = function(t, e, s) {
 };
 h.fn.atomAttr = function(t, e) {
   return this.each(function() {
-    b(
+    S(
       this,
       e,
       (s) => {
@@ -1542,35 +1548,35 @@ h.fn.atomAttr = function(t, e) {
 };
 h.fn.atomProp = function(t, e) {
   return this.each(function() {
-    b(this, e, (s) => h(this).prop(t, s), `prop.${t}`);
+    S(this, e, (s) => h(this).prop(t, s), `prop.${t}`);
   });
 };
 h.fn.atomShow = function(t) {
   return this.each(function() {
-    b(this, t, (e) => h(this).toggle(!!e), "show");
+    S(this, t, (e) => h(this).toggle(!!e), "show");
   });
 };
 h.fn.atomHide = function(t) {
   return this.each(function() {
-    b(this, t, (e) => h(this).toggle(!e), "hide");
+    S(this, t, (e) => h(this).toggle(!e), "hide");
   });
 };
 h.fn.atomVal = function(t, e = {}) {
   return this.each(function() {
-    const s = h(this), { effect: n, cleanup: i } = He(s, t, e), o = W(n);
+    const s = h(this), { effect: n, cleanup: i } = qe(s, t, e), o = Z(n);
     d.trackEffect(this, o), d.trackCleanup(this, i);
   });
 };
 h.fn.atomChecked = function(t) {
   return this.each(function() {
-    const e = h(this), s = Ie(), n = () => {
-      s.flags & p.Busy || (t.value = !!e.prop("checked"));
+    const e = h(this), s = Te(), n = () => {
+      s.flags & E.Busy || (t.value = !!e.prop("checked"));
     };
     e.on("change", n), d.trackCleanup(this, () => e.off("change", n));
-    const i = W(() => {
-      s.flags |= p.SyncingToDom;
+    const i = Z(() => {
+      s.flags |= E.SyncingToDom;
       const o = !!t.value;
-      e.prop("checked", o), g.domUpdated(e, "checked", o), s.flags &= ~p.SyncingToDom;
+      e.prop("checked", o), m.domUpdated(e, "checked", o), s.flags &= ~E.SyncingToDom;
     });
     d.trackEffect(this, i);
   });
@@ -1586,8 +1592,8 @@ h.fn.atomUnbind = function() {
     d.cleanupTree(this);
   });
 };
-function pt(t, e) {
-  b(
+function mt(t, e) {
+  S(
     t.el,
     e,
     (s) => {
@@ -1596,8 +1602,8 @@ function pt(t, e) {
     "text"
   );
 }
-function Et(t, e) {
-  b(
+function St(t, e) {
+  S(
     t.el,
     e,
     (s) => {
@@ -1606,9 +1612,9 @@ function Et(t, e) {
     "html"
   );
 }
-function gt(t, e) {
+function yt(t, e) {
   for (const s in e)
-    b(
+    S(
       t.el,
       e[s],
       (n) => {
@@ -1617,7 +1623,7 @@ function gt(t, e) {
       `class.${s}`
     );
 }
-function bt(t, e) {
+function It(t, e) {
   const s = t.el.style;
   for (const n in e) {
     const i = e[n];
@@ -1625,7 +1631,7 @@ function bt(t, e) {
     const o = n.includes("-") ? n.replace(/-./g, (r) => r.charAt(1).toUpperCase()) : n;
     if (Array.isArray(i)) {
       const [r, c] = i;
-      b(
+      S(
         t.el,
         r,
         (u) => {
@@ -1634,7 +1640,7 @@ function bt(t, e) {
         `css.${n}`
       );
     } else
-      b(
+      S(
         t.el,
         i,
         (r) => {
@@ -1644,11 +1650,11 @@ function bt(t, e) {
       );
   }
 }
-function mt(t, e) {
+function Dt(t, e) {
   const s = t.el;
   for (const n in e) {
     const i = e[n];
-    b(
+    S(
       s,
       i,
       (o) => {
@@ -1662,10 +1668,10 @@ function mt(t, e) {
     );
   }
 }
-function St(t, e) {
+function Ct(t, e) {
   const s = t.el;
   for (const n in e)
-    b(
+    S(
       s,
       e[n],
       (i) => {
@@ -1674,8 +1680,8 @@ function St(t, e) {
       `prop.${n}`
     );
 }
-function yt(t, e) {
-  b(
+function Nt(t, e) {
+  S(
     t.el,
     e,
     (s) => {
@@ -1684,8 +1690,8 @@ function yt(t, e) {
     "show"
   );
 }
-function It(t, e) {
-  b(
+function Tt(t, e) {
+  S(
     t.el,
     e,
     (s) => {
@@ -1694,30 +1700,30 @@ function It(t, e) {
     "hide"
   );
 }
-function Dt(t, e) {
-  const s = Array.isArray(e) ? e[0] : e, n = Array.isArray(e) ? e[1] : {}, { effect: i, cleanup: o } = He(t.$el, s, n), r = W(i);
+function Ot(t, e) {
+  const s = Array.isArray(e) ? e[0] : e, n = Array.isArray(e) ? e[1] : {}, { effect: i, cleanup: o } = qe(t.$el, s, n), r = Z(i);
   d.trackEffect(t.el, r), t.trackCleanup(o);
 }
-function Ct(t, e) {
-  const s = Ie(), n = () => {
-    s.flags & p.Busy || (e.value = t.$el.prop("checked"));
+function xt(t, e) {
+  const s = Te(), n = () => {
+    s.flags & E.Busy || (e.value = t.$el.prop("checked"));
   };
   t.$el.on("change", n), t.trackCleanup(() => t.$el.off("change", n));
-  const i = W(() => {
-    s.flags |= p.SyncingToDom;
+  const i = Z(() => {
+    s.flags |= E.SyncingToDom;
     const o = !!e.value;
-    t.$el.prop("checked", o), g.domUpdated(t.$el, "checked", o), s.flags &= ~p.SyncingToDom;
+    t.$el.prop("checked", o), m.domUpdated(t.$el, "checked", o), s.flags &= ~E.SyncingToDom;
   });
   d.trackEffect(t.el, i);
 }
-function Nt(t, e) {
+function Rt(t, e) {
   const s = t.el;
   for (const n in e) {
     const i = e[n];
     if (typeof i != "function") continue;
     const o = i, r = (c) => {
       const u = h.Event(c.type, { originalEvent: c });
-      ye(() => o.call(s, u));
+      Ne(() => o.call(s, u));
     };
     s.addEventListener(n, r), t.trackCleanup(() => s.removeEventListener(n, r));
   }
@@ -1729,81 +1735,102 @@ h.fn.atomBind = function(t) {
       el: this,
       trackCleanup: (n) => d.trackCleanup(this, n)
     };
-    t.text !== void 0 && pt(s, t.text), t.html !== void 0 && Et(s, t.html), t.class && gt(s, t.class), t.css && bt(s, t.css), t.attr && mt(s, t.attr), t.prop && St(s, t.prop), t.show !== void 0 && yt(s, t.show), t.hide !== void 0 && It(s, t.hide), t.val !== void 0 && Dt(s, t.val), t.checked !== void 0 && Ct(s, t.checked), t.on && Nt(s, t.on);
+    t.text !== void 0 && mt(s, t.text), t.html !== void 0 && St(s, t.html), t.class && yt(s, t.class), t.css && It(s, t.css), t.attr && Dt(s, t.attr), t.prop && Ct(s, t.prop), t.show !== void 0 && Nt(s, t.show), t.hide !== void 0 && Tt(s, t.hide), t.val !== void 0 && Ot(s, t.val), t.checked !== void 0 && xt(s, t.checked), t.on && Rt(s, t.on);
   });
 };
 h.fn.atomList = function(t, e) {
   const { key: s, render: n, bind: i, update: o, onAdd: r, onRemove: c, empty: u } = e, a = typeof s == "function" ? s : (_) => _[s];
   return this.each(function() {
-    const _ = h(this), k = _e(this), y = /* @__PURE__ */ new Map(), X = /* @__PURE__ */ new Set();
-    let A = [], q = null;
-    const De = W(() => {
-      const m = t.value, x = m.length;
-      if (x === 0 ? u && !q && (q = h(u).appendTo(_)) : q && (q.remove(), q = null), x === 0 && y.size === 0) {
-        A = [];
+    const _ = h(this), B = Ee(this), D = /* @__PURE__ */ new Map(), q = /* @__PURE__ */ new Set();
+    let R = [], G = null;
+    const Oe = Z(() => {
+      const y = t.value, O = y.length;
+      if (O === 0 ? u && !G && (G = h(u).appendTo(_)) : G && (G.remove(), G = null), O === 0 && D.size === 0) {
+        R = [];
         return;
       }
-      g.log("list", `${k} updating with ${x} items`);
-      const M = new Array(x), Z = /* @__PURE__ */ new Set();
-      for (let f = 0; f < x; f++) {
-        const S = m[f], I = a(S, f);
-        g.enabled && Z.has(I) && console.warn(
-          `[atomList] Duplicate key "${I}" at index ${f}. Items with duplicate keys may cause unexpected behavior.`
-        ), M[f] = I, Z.add(I);
+      m.log("list", `${B} updating with ${O} items`);
+      const V = new Array(O), te = /* @__PURE__ */ new Set();
+      for (let f = 0; f < O; f++) {
+        const I = y[f], p = a(I, f);
+        m.enabled && te.has(p) && console.warn(
+          `[atomList] Duplicate key "${p}" at index ${f}. Items with duplicate keys may cause unexpected behavior.`
+        ), V[f] = p, te.add(p);
       }
-      for (const [f, S] of y) {
-        if (Z.has(f) || X.has(f)) continue;
-        const I = () => {
-          S.$el.remove();
-          const D = S.$el[0];
-          D && d.cleanup(D), X.delete(f), g.log("list", `${k} removed item:`, f);
+      for (const [f, I] of D) {
+        if (te.has(f) || q.has(f)) continue;
+        const p = () => {
+          I.$el.remove();
+          const g = I.$el[0];
+          g && d.cleanup(g), q.delete(f), m.log("list", `${B} removed item:`, f);
         };
-        if (y.delete(f), X.add(f), c) {
-          const D = c(S.$el);
-          D instanceof Promise ? D.then(I) : I();
+        if (D.delete(f), q.add(f), c) {
+          const g = c(I.$el);
+          g instanceof Promise ? g.then(p) : p();
         } else
-          I();
+          p();
       }
-      if (x === 0) {
-        A = [];
+      if (O === 0) {
+        R = [];
         return;
       }
-      const re = /* @__PURE__ */ new Map();
-      for (let f = 0; f < A.length; f++) {
-        const S = A[f];
-        S !== void 0 && re.set(S, f);
+      const ce = /* @__PURE__ */ new Map();
+      for (let f = 0; f < R.length; f++) {
+        const I = R[f];
+        I !== void 0 && ce.set(I, f);
       }
-      const G = new Int32Array(x);
-      for (let f = 0; f < x; f++) {
-        const S = M[f];
-        G[f] = S !== void 0 ? re.get(S) ?? -1 : -1;
+      const Y = new Int32Array(O);
+      for (let f = 0; f < O; f++) {
+        const I = V[f];
+        Y[f] = I !== void 0 ? ce.get(I) ?? -1 : -1;
       }
-      const Ce = ut(G);
-      let de = Ce.length - 1, L = null;
-      for (let f = x - 1; f >= 0; f--) {
-        const S = M[f], I = m[f], D = y.get(S);
-        if (D) {
-          D.item = I;
-          const ee = D.$el[0];
-          if (!ee) continue;
-          o && o(D.$el, I, f), de >= 0 && Ce[de] === f ? (de--, ee.nextSibling !== L && (L ? D.$el.insertBefore(L) : D.$el.appendTo(_))) : L ? D.$el.insertBefore(L) : D.$el.appendTo(_), L = ee;
+      const xe = ft(Y);
+      let ge = xe.length - 1, A = null;
+      for (let f = O - 1; f >= 0; f--) {
+        const I = V[f], p = y[f], g = D.get(I);
+        if (g) {
+          const Q = g.item;
+          g.item = p;
+          const F = g.$el[0];
+          if (!F) continue;
+          if (o)
+            o(g.$el, p, f);
+          else if (Q !== p) {
+            let be = !0;
+            if (typeof Q == "object" && Q !== null && typeof p == "object" && p !== null) {
+              const ue = Object.keys(Q), ee = Object.keys(p);
+              if (ue.length === ee.length) {
+                be = !1;
+                for (const he of ue)
+                  if (Q[he] !== p[he]) {
+                    be = !0;
+                    break;
+                  }
+              }
+            }
+            if (be) {
+              const ue = n(p, f), ee = h(ue), he = A === F;
+              g.$el.replaceWith(ee), g.$el = ee, i && i(ee, p, f), he && (A = ee[0] || null);
+            }
+          }
+          ge >= 0 && xe[ge] === f ? ge-- : A ? A.isConnected && A !== g.$el[0] ? g.$el.insertBefore(A) : A.isConnected || g.$el.appendTo(_) : g.$el.appendTo(_), A = g.$el[0] || null;
         } else {
-          const ee = n(I, f), Y = h(ee);
-          y.set(S, { $el: Y, item: I }), L ? Y.insertBefore(L) : Y.appendTo(_), i && i(Y, I, f), r && r(Y), g.log("list", `${k} added item:`, S), L = Y[0] || null;
+          const Q = n(p, f), F = h(Q);
+          D.set(I, { $el: F, item: p }), A?.isConnected ? F.insertBefore(A) : F.appendTo(_), i && i(F, p, f), r && r(F), m.log("list", `${B} added item:`, I), A = F[0] || null;
         }
       }
-      A = M;
+      R = V;
     });
-    d.trackEffect(this, De), d.trackCleanup(this, () => {
-      y.clear(), X.clear(), A = [], q?.remove();
+    d.trackEffect(this, Oe), d.trackCleanup(this, () => {
+      D.clear(), q.clear(), R = [], G?.remove();
     });
   });
 };
-const he = /* @__PURE__ */ new WeakMap();
+const fe = /* @__PURE__ */ new WeakMap();
 h.fn.atomMount = function(t, e = {}) {
   return this.each(function() {
-    const s = h(this), n = _e(this), i = he.get(this);
-    i && (g.log("mount", `${n} unmounting existing component`), i()), g.log("mount", `${n} mounting component`);
+    const s = h(this), n = Ee(this), i = fe.get(this);
+    i && (m.log("mount", `${n} unmounting existing component`), i()), m.log("mount", `${n} mounting component`);
     let o;
     try {
       o = t(s, e);
@@ -1814,28 +1841,28 @@ h.fn.atomMount = function(t, e = {}) {
     let r = !1;
     const c = () => {
       if (!r) {
-        if (r = !0, g.log("mount", `${n} full cleanup`), typeof o == "function")
+        if (r = !0, m.log("mount", `${n} full cleanup`), typeof o == "function")
           try {
             o();
           } catch (u) {
             console.error("[atom-effect-jquery] Cleanup error:", u);
           }
-        d.cleanupTree(this), he.delete(this);
+        d.cleanupTree(this), fe.delete(this);
       }
     };
-    he.set(this, c), d.trackCleanup(this, c);
+    fe.set(this, c), d.trackCleanup(this, c);
   });
 };
 h.fn.atomUnmount = function() {
   return this.each(function() {
-    he.get(this)?.();
+    fe.get(this)?.();
   });
 };
-const se = /* @__PURE__ */ new WeakMap();
-let Ue = !1;
-function $e() {
-  if (Ue) return;
-  Ue = !0;
+const ne = /* @__PURE__ */ new WeakMap();
+let Pe = !1;
+function Ge() {
+  if (Pe) return;
+  Pe = !0;
   const t = h.fn.on, e = h.fn.off, s = h.fn.remove, n = h.fn.empty, i = h.fn.detach;
   h.fn.remove = function(o) {
     return (o ? this.filter(o) : this).each(function() {
@@ -1859,9 +1886,9 @@ function $e() {
     if (r !== -1) {
       const c = o[r];
       let u;
-      se.has(c) ? u = se.get(c) : (u = function(a, ..._) {
-        return ye(() => c.call(this, a, ..._));
-      }, se.set(c, u)), o[r] = u;
+      ne.has(c) ? u = ne.get(c) : (u = function(a, ..._) {
+        return Ne(() => c.call(this, a, ..._));
+      }, ne.set(c, u)), o[r] = u;
     }
     return t.apply(this, o);
   }, h.fn.off = function(...o) {
@@ -1873,27 +1900,27 @@ function $e() {
       }
     if (r !== -1) {
       const c = o[r];
-      se.has(c) && (o[r] = se.get(c));
+      ne.has(c) && (o[r] = ne.get(c));
     }
     return e.apply(this, o);
   };
 }
-const At = $e;
-$e();
+const wt = Ge;
+Ge();
 h(() => {
-  dt(document.body);
+  bt(document.body);
 });
 export {
-  nt as atom,
-  ye as batch,
-  ot as computed,
-  Ut as default,
-  Rt as disableAutoCleanup,
-  W as effect,
-  dt as enableAutoCleanup,
-  At as enablejQueryBatching,
-  $e as enablejQueryOverrides,
+  ct as atom,
+  Ne as batch,
+  ht as computed,
+  Pt as default,
+  Ut as disableAutoCleanup,
+  Z as effect,
+  bt as enableAutoCleanup,
+  wt as enablejQueryBatching,
+  Ge as enablejQueryOverrides,
   d as registry,
-  ke as untracked
+  je as untracked
 };
 //# sourceMappingURL=index.mjs.map