@but212/atom-effect-jquery 0.12.0 → 0.13.1

package/dist/index.mjs

@@ -1,9 +1,9 @@
 import u from "jquery";
-import { default as Ot } from "jquery";
-const je = {
+import { default as wt } from "jquery";
+const Be = {
   /** One second in milliseconds */
   ONE_SECOND_MS: 1e3
-}, oe = {
+}, ce = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
@@ -48,12 +48,12 @@ const je = {
   MAX_FLUSH_ITERATIONS: 1e3,
   /** Minimum allowed value for max flush iterations */
   MIN_FLUSH_ITERATIONS: 10
-}, ye = {
+}, Se = {
   /** Maximum dependencies before warning about large dependency graphs */
   MAX_DEPENDENCIES: 1e3,
   /** Enable infinite loop detection warnings */
   WARN_INFINITE_LOOP: !0
-}, F = 1073741823, fe = 1 << 19, C = typeof process < "u" && process.env && process.env.NODE_ENV !== "production", Be = Object.freeze([]);
+}, F = 1073741823, qe = 20, de = 1 << qe - 1, C = typeof process < "u" && process.env && process.env.NODE_ENV !== "production", ze = Object.freeze([]);
 class U extends Error {
   /**
    * Creates a new AtomError
@@ -147,16 +147,16 @@ const b = {
    * @remarks This prevents cascading failures from masking the original error.
    */
   CALLBACK_ERROR_IN_ERROR_HANDLER: "Error occurred during onError callback execution"
-}, ae = /* @__PURE__ */ Symbol("debugName"), qe = /* @__PURE__ */ Symbol("id"), le = /* @__PURE__ */ Symbol("type"), Se = /* @__PURE__ */ Symbol("noDefaultValue");
-function ze(t) {
+}, le = /* @__PURE__ */ Symbol("debugName"), Qe = /* @__PURE__ */ Symbol("id"), fe = /* @__PURE__ */ Symbol("type"), De = /* @__PURE__ */ Symbol("noDefaultValue");
+function $e(t) {
   return "dependencies" in t && Array.isArray(t.dependencies);
 }
-let De = 0;
+let Ie = 0;
 function ve(t, e, s) {
   if (t._visitedEpoch !== s) {
     if (t._visitedEpoch = s, t === e)
       throw new B("Indirect circular dependency detected");
-    if (ze(t)) {
+    if ($e(t)) {
       const n = t.dependencies;
       for (let i = 0; i < n.length; i++) {
         const r = n[i];
@@ -165,10 +165,10 @@ function ve(t, e, s) {
     }
   }
 }
-const N = {
+const v = {
   enabled: typeof process < "u" && process.env?.NODE_ENV === "development",
-  maxDependencies: ye.MAX_DEPENDENCIES,
-  warnInfiniteLoop: ye.WARN_INFINITE_LOOP,
+  maxDependencies: Se.MAX_DEPENDENCIES,
+  warnInfiniteLoop: Se.WARN_INFINITE_LOOP,
   warn(t, e) {
     this.enabled && t && console.warn(`[Atom Effect] ${e}`);
   },
@@ -180,28 +180,28 @@ const N = {
   checkCircular(t, e) {
     if (t === e)
       throw new B("Direct circular dependency detected");
-    this.enabled && (De++, ve(t, e, De));
+    this.enabled && (Ie++, ve(t, e, Ie));
   },
   attachDebugInfo(t, e, s) {
     if (!this.enabled)
       return;
     const n = t;
-    n[ae] = `${e}_${s}`, n[qe] = s, n[le] = e;
+    n[le] = `${e}_${s}`, n[Qe] = s, n[fe] = e;
   },
   getDebugName(t) {
-    if (t != null && ae in t)
-      return t[ae];
-  },
-  getDebugType(t) {
     if (t != null && le in t)
       return t[le];
+  },
+  getDebugType(t) {
+    if (t != null && fe in t)
+      return t[fe];
   }
 };
-let Qe = 1;
-const $e = () => Qe++;
-class Ne {
+let Xe = 1;
+const He = () => Xe++;
+class Ae {
   constructor() {
-    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this.id = $e() & F;
+    this.flags = 0, this.version = 0, this._lastSeenEpoch = -1, this.id = He() & F;
   }
   /**
    * Rotates the phase by 1, automatically incrementing cycle on overflow.
@@ -243,7 +243,7 @@ class Ne {
     return this.version - e & F;
   }
 }
-class Ae extends Ne {
+class Re extends Ae {
   /**
    * Subscribes a listener function or Subscriber object to value changes.
    *
@@ -310,26 +310,138 @@ class Ae extends Ne {
         }
   }
 }
-let se = 0;
-function Re() {
-  return se = se + 1 & F || 1, se;
+class pe {
+  constructor() {
+    this.pool = [], this.maxPoolSize = 50, this.maxReusableCapacity = 256, this.stats = C ? {
+      acquired: 0,
+      released: 0,
+      rejected: { frozen: 0, tooLarge: 0, poolFull: 0 }
+    } : null;
+  }
+  /** Acquires an array from the pool or creates a new one if the pool is empty. */
+  acquire() {
+    return C && this.stats && this.stats.acquired++, this.pool.pop() ?? [];
+  }
+  /**
+   * Releases an array back to the pool.
+   * Clears the array before storing it.
+   * @param arr - The array to release.
+   * @param emptyConst - Optional reference to a constant empty array to skip.
+   */
+  release(e, s) {
+    if (!(s && e === s)) {
+      if (Object.isFrozen(e)) {
+        C && this.stats && this.stats.rejected.frozen++;
+        return;
+      }
+      if (e.length > this.maxReusableCapacity) {
+        C && this.stats && this.stats.rejected.tooLarge++;
+        return;
+      }
+      if (this.pool.length >= this.maxPoolSize) {
+        C && this.stats && this.stats.rejected.poolFull++;
+        return;
+      }
+      e.length = 0, this.pool.push(e), C && this.stats && this.stats.released++;
+    }
+  }
+  /** Returns current stats for the pool (dev mode only). */
+  getStats() {
+    if (!C || !this.stats) return null;
+    const { acquired: e, released: s, rejected: n } = this.stats, i = n.frozen + n.tooLarge + n.poolFull;
+    return {
+      acquired: e,
+      released: s,
+      rejected: n,
+      leaked: e - s - i,
+      poolSize: this.pool.length
+    };
+  }
+  /** Resets the pool and its stats. */
+  reset() {
+    this.pool.length = 0, C && this.stats && (this.stats.acquired = 0, this.stats.released = 0, this.stats.rejected = { frozen: 0, tooLarge: 0, poolFull: 0 });
+  }
+}
+const y = Object.freeze([]), N = Object.freeze([]), S = Object.freeze([]), w = new pe(), z = new pe(), T = new pe();
+function _e(t) {
+  return t !== null && typeof t == "object" && "value" in t && "subscribe" in t && typeof t.subscribe == "function";
 }
-function Xe() {
-  return se;
+function Ce(t) {
+  if (v.enabled && (t == null || typeof t == "object")) {
+    const e = v.getDebugType(t);
+    if (e)
+      return e === "computed";
+  }
+  return _e(t) && "invalidate" in t && typeof t.invalidate == "function";
+}
+function Oe(t) {
+  return t != null && typeof t.then == "function";
+}
+function Ge(t) {
+  return typeof t == "object" && t !== null;
+}
+function Ye(t) {
+  return (typeof t == "object" || typeof t == "function") && t !== null && typeof t.addDependency == "function";
+}
+function Je(t) {
+  return typeof t == "function" && typeof t.addDependency != "function";
 }
-let ie = 0, _e = 0, re = !1;
-function Ie() {
-  return re ? (C && console.warn(
+function Ke(t) {
+  return Ge(t) && typeof t.execute == "function";
+}
+function Ue(t, e, s, n) {
+  if (e) {
+    if (Ye(e)) {
+      e.addDependency(t);
+      return;
+    }
+    if (Je(e)) {
+      const i = e;
+      s.indexOf(i) === -1 && s.push(i);
+      return;
+    }
+    Ke(e) && n.indexOf(e) === -1 && n.push(e);
+  }
+}
+function We(t, e, s, n) {
+  if (e !== y && s !== N)
+    for (let r = 0; r < e.length; r++) {
+      const o = e[r];
+      o && (o._tempUnsub = s[r]);
+    }
+  const i = z.acquire();
+  i.length = t.length;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    o && (o._tempUnsub ? (i[r] = o._tempUnsub, o._tempUnsub = void 0) : (v.checkCircular(o, n), i[r] = o.subscribe(n)));
+  }
+  if (e !== y)
+    for (let r = 0; r < e.length; r++) {
+      const o = e[r];
+      o?._tempUnsub && (o._tempUnsub(), o._tempUnsub = void 0);
+    }
+  return s !== N && z.release(s), i;
+}
+let ne = 0;
+function we() {
+  return ne = ne + 1 & F || 1, ne;
+}
+function Ze() {
+  return ne;
+}
+let re = 0, ge = 0, oe = !1;
+function xe() {
+  return oe ? (C && console.warn(
     "Warning: startFlush() called during flush - ignored to prevent infinite loop detection bypass"
-  ), !1) : (re = !0, ie = ie + 1 & F, _e = 0, !0);
+  ), !1) : (oe = !0, re = re + 1 & F, ge = 0, !0);
 }
-function Ce() {
-  re = !1;
+function Ne() {
+  oe = !1;
 }
-function He() {
-  return re ? ++_e : 0;
+function et() {
+  return oe ? ++ge : 0;
 }
-class Ge {
+class tt {
   constructor() {
     this.queueA = [], this.queueB = [], this.queue = this.queueA, this.queueSize = 0, this.urgentQueueA = [], this.urgentQueueB = [], this.urgentQueue = this.urgentQueueA, this.urgentQueueSize = 0, this._epoch = 0, this.isProcessing = !1, this.isBatching = !1, this.batchDepth = 0, this.batchQueue = [], this.batchQueueSize = 0, this.isFlushingSync = !1, this.maxFlushIterations = q.MAX_FLUSH_ITERATIONS;
   }
@@ -375,14 +487,14 @@ class Ge {
     if (!s || e._cachedVersion === void 0)
       return 0;
     const n = s.getShift(e._cachedVersion);
-    return fe - 1 - n >>> 31 & 1;
+    return de - 1 - n >>> 31 & 1;
   }
   flush() {
     this.isProcessing || this.queueSize === 0 && this.urgentQueueSize === 0 || (this.isProcessing = !0, queueMicrotask(() => {
       try {
         if (this.queueSize === 0 && this.urgentQueueSize === 0) return;
-        const e = Ie();
-        this._drainQueue(), e && Ce();
+        const e = xe();
+        this._drainQueue(), e && Ne();
       } finally {
         this.isProcessing = !1, (this.queueSize > 0 || this.urgentQueueSize > 0) && !this.isBatching && this.flush();
       }
@@ -390,11 +502,11 @@ class Ge {
   }
   flushSync() {
     this.isFlushingSync = !0;
-    const e = Ie();
+    const e = xe();
     try {
       this._mergeBatchQueue(), this._drainQueue();
     } finally {
-      this.isFlushingSync = !1, e && Ce();
+      this.isFlushingSync = !1, e && Ne();
     }
   }
   _mergeBatchQueue() {
@@ -482,18 +594,8 @@ class Ge {
     this.maxFlushIterations = e;
   }
 }
-const W = new Ge();
-function Ye(t) {
-  if (typeof t != "function")
-    throw new U("Batch callback must be a function");
-  W.startBatch();
-  try {
-    return t();
-  } finally {
-    W.endBatch();
-  }
-}
-class Je {
+const W = new tt();
+class st {
   constructor() {
     this.current = null;
   }
@@ -520,8 +622,8 @@ class Je {
     return this.current;
   }
 }
-const Q = new Je();
-function Oe(t) {
+const Q = new st();
+function Fe(t) {
   if (typeof t != "function")
     throw new U("Untracked callback must be a function");
   const e = Q.current;
@@ -532,121 +634,9 @@ function Oe(t) {
     Q.current = e;
   }
 }
-class pe {
-  constructor() {
-    this.pool = [], this.maxPoolSize = 50, this.maxReusableCapacity = 256, this.stats = C ? {
-      acquired: 0,
-      released: 0,
-      rejected: { frozen: 0, tooLarge: 0, poolFull: 0 }
-    } : null;
-  }
-  /** Acquires an array from the pool or creates a new one if the pool is empty. */
-  acquire() {
-    return C && this.stats && this.stats.acquired++, this.pool.pop() ?? [];
-  }
-  /**
-   * Releases an array back to the pool.
-   * Clears the array before storing it.
-   * @param arr - The array to release.
-   * @param emptyConst - Optional reference to a constant empty array to skip.
-   */
-  release(e, s) {
-    if (!(s && e === s)) {
-      if (Object.isFrozen(e)) {
-        C && this.stats && this.stats.rejected.frozen++;
-        return;
-      }
-      if (e.length > this.maxReusableCapacity) {
-        C && this.stats && this.stats.rejected.tooLarge++;
-        return;
-      }
-      if (this.pool.length >= this.maxPoolSize) {
-        C && this.stats && this.stats.rejected.poolFull++;
-        return;
-      }
-      e.length = 0, this.pool.push(e), C && this.stats && this.stats.released++;
-    }
-  }
-  /** Returns current stats for the pool (dev mode only). */
-  getStats() {
-    if (!C || !this.stats) return null;
-    const { acquired: e, released: s, rejected: n } = this.stats, i = n.frozen + n.tooLarge + n.poolFull;
-    return {
-      acquired: e,
-      released: s,
-      rejected: n,
-      leaked: e - s - i,
-      poolSize: this.pool.length
-    };
-  }
-  /** Resets the pool and its stats. */
-  reset() {
-    this.pool.length = 0, C && this.stats && (this.stats.acquired = 0, this.stats.released = 0, this.stats.rejected = { frozen: 0, tooLarge: 0, poolFull: 0 });
-  }
-}
-const y = Object.freeze([]), T = Object.freeze([]), S = Object.freeze([]), w = new pe(), z = new pe(), v = new pe();
-function de(t) {
-  return t !== null && typeof t == "object" && "value" in t && "subscribe" in t && typeof t.subscribe == "function";
-}
-function xe(t) {
-  if (N.enabled && (t == null || typeof t == "object")) {
-    const e = N.getDebugType(t);
-    if (e)
-      return e === "computed";
-  }
-  return de(t) && "invalidate" in t && typeof t.invalidate == "function";
-}
-function Ue(t) {
-  return t != null && typeof t.then == "function";
-}
-function Ke(t) {
-  return typeof t == "object" && t !== null;
-}
-function We(t) {
-  return (typeof t == "object" || typeof t == "function") && t !== null && typeof t.addDependency == "function";
-}
-function Ze(t) {
-  return typeof t == "function" && typeof t.addDependency != "function";
-}
-function et(t) {
-  return Ke(t) && typeof t.execute == "function";
-}
-function we(t, e, s, n) {
-  if (e) {
-    if (We(e)) {
-      e.addDependency(t);
-      return;
-    }
-    if (Ze(e)) {
-      const i = e;
-      s.indexOf(i) === -1 && s.push(i);
-      return;
-    }
-    et(e) && n.indexOf(e) === -1 && n.push(e);
-  }
-}
-function tt(t, e, s, n) {
-  if (e !== y && s !== T)
-    for (let r = 0; r < e.length; r++) {
-      const o = e[r];
-      o && (o._tempUnsub = s[r]);
-    }
-  const i = z.acquire();
-  i.length = t.length;
-  for (let r = 0; r < t.length; r++) {
-    const o = t[r];
-    o && (o._tempUnsub ? (i[r] = o._tempUnsub, o._tempUnsub = void 0) : (N.checkCircular(o, n), i[r] = o.subscribe(n)));
-  }
-  if (e !== y)
-    for (let r = 0; r < e.length; r++) {
-      const o = e[r];
-      o?._tempUnsub && (o._tempUnsub(), o._tempUnsub = void 0);
-    }
-  return s !== T && z.release(s), i;
-}
-class st extends Ae {
+class nt extends Re {
   constructor(e, s) {
-    super(), this._fnSubs = null, this._objSubs = null, this._value = e, s && (this.flags |= G.SYNC), N.attachDebugInfo(this, "atom", this.id);
+    super(), this._fnSubs = null, this._objSubs = null, this._value = e, s && (this.flags |= G.SYNC), v.attachDebugInfo(this, "atom", this.id);
   }
   _getFnSubs() {
     return this._fnSubs ??= [], this._fnSubs;
@@ -659,7 +649,7 @@ class st extends Ae {
    */
   get value() {
     const e = Q.current;
-    return e && we(this, e, this._getFnSubs(), this._getObjSubs()), this._value;
+    return e && Ue(this, e, this._getFnSubs(), this._getObjSubs()), this._value;
   }
   /**
    * Sets a new value and schedules notifications if the value has changed.
@@ -691,8 +681,8 @@ class st extends Ae {
     this._fnSubs = null, this._objSubs = null, this._value = void 0, this._notifyTask = void 0;
   }
 }
-function nt(t, e = {}) {
-  return new st(t, e.sync ?? !1);
+function it(t, e = {}) {
+  return new nt(t, e.sync ?? !1);
 }
 function J(t, e, s) {
   if (t instanceof TypeError)
@@ -704,15 +694,15 @@ function J(t, e, s) {
   const n = t instanceof Error ? t.message : String(t), i = t instanceof Error ? t : null;
   return new e(`Unexpected error (${s}): ${n}`, i);
 }
-const Fe = l.RESOLVED | l.PENDING | l.REJECTED, ce = Array(Fe + 1).fill(oe.IDLE);
-ce[l.RESOLVED] = oe.RESOLVED;
-ce[l.PENDING] = oe.PENDING;
-ce[l.REJECTED] = oe.REJECTED;
-class ke extends Ae {
+const ke = l.RESOLVED | l.PENDING | l.REJECTED, ue = Array(ke + 1).fill(ce.IDLE);
+ue[l.RESOLVED] = ce.RESOLVED;
+ue[l.PENDING] = ce.PENDING;
+ue[l.REJECTED] = ce.REJECTED;
+class Le extends Re {
   constructor(e, s = {}) {
     if (typeof e != "function")
       throw new B(b.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this._fnSubs = null, this._objSubs = null, this._cachedErrors = null, this._errorCacheEpoch = -1, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, 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 : Se, this._hasDefaultValue = this._defaultValue !== Se, this._onError = s.onError ?? null, this.MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1, this._dependencies = y, this._dependencyVersions = S, this._unsubscribes = T, this._notifyJob = () => {
+    if (super(), this._fnSubs = null, this._objSubs = null, this._cachedErrors = null, this._errorCacheEpoch = -1, this._asyncStartAggregateVersion = 0, this._asyncRetryCount = 0, 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 : De, this._hasDefaultValue = this._defaultValue !== De, this._onError = s.onError ?? null, this.MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1, this._dependencies = y, this._dependencyVersions = S, this._unsubscribes = N, this._notifyJob = () => {
       const n = this._fnSubs;
       if (n)
         for (let r = n.length - 1; r >= 0; r--)
@@ -734,7 +724,7 @@ class ke extends Ae {
     }, this._trackable = Object.assign(() => this._markDirty(), {
       addDependency: (n) => {
       }
-    }), N.attachDebugInfo(this, "computed", this.id), N.enabled) {
+    }), v.attachDebugInfo(this, "computed", this.id), v.enabled) {
       const n = this;
       n.subscriberCount = this.subscriberCount.bind(this), n.isDirty = () => this._isDirty(), n.dependencies = this._dependencies, n.stateFlags = this._getFlagsAsString();
     }
@@ -774,8 +764,8 @@ class ke extends Ae {
   }
   get errors() {
     if (this._registerTracking(), !this.hasError)
-      return Be;
-    const e = Xe();
+      return ze;
+    const e = Ze();
     if (this._errorCacheEpoch === e && this._cachedErrors !== null)
       return this._cachedErrors;
     const s = /* @__PURE__ */ new Set();
@@ -802,17 +792,17 @@ class ke extends Ae {
     return this._registerTracking(), this._isResolved();
   }
   invalidate() {
-    this._markDirty(), this._dependencyVersions !== S && (v.release(this._dependencyVersions), this._dependencyVersions = S), this._errorCacheEpoch = -1, this._cachedErrors = null;
+    this._markDirty(), this._dependencyVersions !== S && (T.release(this._dependencyVersions), this._dependencyVersions = S), this._errorCacheEpoch = -1, this._cachedErrors = null;
   }
   dispose() {
-    if (this._unsubscribes !== T) {
+    if (this._unsubscribes !== N) {
       for (let e = 0; e < this._unsubscribes.length; e++) {
         const s = this._unsubscribes[e];
         s && s();
       }
-      z.release(this._unsubscribes), this._unsubscribes = T;
+      z.release(this._unsubscribes), this._unsubscribes = N;
     }
-    this._dependencies !== y && (w.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== S && (v.release(this._dependencyVersions), this._dependencyVersions = S), this._fnSubs = null, this._objSubs = null, this.flags = 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;
+    this._dependencies !== y && (w.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== S && (T.release(this._dependencyVersions), this._dependencyVersions = S), this._fnSubs = null, this._objSubs = null, this.flags = 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;
   }
   // State flag operations
   _isDirty() {
@@ -856,7 +846,7 @@ class ke extends Ae {
     this.flags = this.flags & ~s | -Number(e) & s;
   }
   _getAsyncState() {
-    return ce[this.flags & Fe];
+    return ue[this.flags & ke];
   }
   _getFlagsAsString() {
     const e = [];
@@ -872,7 +862,7 @@ class ke extends Ae {
     let s = !1;
     try {
       const n = Q.run(this._trackable, this._fn);
-      this._commitDependencies(e), s = !0, Ue(n) ? this._handleAsyncComputation(n) : this._handleSyncResult(n);
+      this._commitDependencies(e), s = !0, Oe(n) ? this._handleAsyncComputation(n) : this._handleSyncResult(n);
     } catch (n) {
       if (!s)
         try {
@@ -886,17 +876,17 @@ class ke extends Ae {
     }
   }
   _prepareComputationContext() {
-    const e = this._dependencies, s = this._dependencyVersions, n = w.acquire(), i = v.acquire(), r = Re(), o = { depCount: 0 }, c = (f) => {
-      f._lastSeenEpoch !== r && (f._lastSeenEpoch = r, o.depCount < n.length ? (n[o.depCount] = f, i[o.depCount] = f.version) : (n.push(f), i.push(f.version)), o.depCount++);
+    const e = this._dependencies, s = this._dependencyVersions, n = w.acquire(), i = T.acquire(), r = we(), o = { depCount: 0 }, c = (d) => {
+      d._lastSeenEpoch !== r && (d._lastSeenEpoch = r, o.depCount < n.length ? (n[o.depCount] = d, i[o.depCount] = d.version) : (n.push(d), i.push(d.version)), o.depCount++);
     }, h = this._trackable.addDependency;
     return this._trackable.addDependency = c, { prevDeps: e, prevVersions: s, nextDeps: n, nextVersions: i, originalAdd: h, state: o };
   }
   _commitDependencies(e) {
     const { nextDeps: s, nextVersions: n, state: i, prevDeps: r } = e;
-    s.length = i.depCount, n.length = i.depCount, this._unsubscribes = tt(s, r, this._unsubscribes, this), this._dependencies = s, this._dependencyVersions = n;
+    s.length = i.depCount, n.length = i.depCount, this._unsubscribes = We(s, r, this._unsubscribes, this), this._dependencies = s, this._dependencyVersions = n;
   }
   _cleanupContext(e, s) {
-    this._trackable.addDependency = e.originalAdd, s ? (e.prevDeps !== y && w.release(e.prevDeps), e.prevVersions !== S && v.release(e.prevVersions)) : (w.release(e.nextDeps), v.release(e.nextVersions));
+    this._trackable.addDependency = e.originalAdd, s ? (e.prevDeps !== y && w.release(e.prevDeps), e.prevVersions !== S && T.release(e.prevVersions)) : (w.release(e.nextDeps), T.release(e.nextVersions));
   }
   /**
    * Calculates aggregate shift from all dependencies.
@@ -923,7 +913,7 @@ class ke extends Ae {
    * @returns true if aggregate shift exceeds PHASE_THRESHOLD
    */
   isUrgent() {
-    return this._getAggregateShift() >= fe;
+    return this._getAggregateShift() >= de;
   }
   _handleSyncResult(e) {
     this._finalizeResolution(e);
@@ -934,7 +924,7 @@ class ke extends Ae {
     e.then((n) => {
       if (s !== this._promiseId) return;
       const i = this._captureVersionSnapshot() - this._asyncStartAggregateVersion & F;
-      if (fe - 1 - i >>> 31 & 1) {
+      if (de - 1 - i >>> 31 & 1) {
         if (this._asyncRetryCount < this.MAX_ASYNC_RETRIES) {
           this._asyncRetryCount++, this._markDirty();
           return;
@@ -1013,14 +1003,14 @@ class ke extends Ae {
     this._isRecomputing() || this._isDirty() || (this._setDirty(), this._notifyJob());
   }
   _registerTracking() {
-    we(this, Q.getCurrent(), this._getFnSubs(), this._getObjSubs());
+    Ue(this, Q.getCurrent(), this._getFnSubs(), this._getObjSubs());
   }
 }
-Object.freeze(ke.prototype);
-function it(t, e = {}) {
-  return new ke(t, e);
+Object.freeze(Le.prototype);
+function rt(t, e = {}) {
+  return new Le(t, e);
 }
-class rt extends Ne {
+class ot extends Ae {
   /**
    * Creates a new EffectImpl instance.
    * @param fn - The effect function to run.
@@ -1030,17 +1020,17 @@ class rt extends Ne {
     super(), this.run = () => {
       if (this.isDisposed)
         throw new j(b.EFFECT_MUST_BE_FUNCTION);
-      this._dependencyVersions !== S && (v.release(this._dependencyVersions), this._dependencyVersions = S), this.execute();
+      this._dependencyVersions !== S && (T.release(this._dependencyVersions), this._dependencyVersions = S), this.execute();
     }, this.dispose = () => {
       if (!this.isDisposed) {
-        if (this._setDisposed(), this._safeCleanup(), this._unsubscribes !== T) {
+        if (this._setDisposed(), this._safeCleanup(), this._unsubscribes !== N) {
           for (let i = 0; i < this._unsubscribes.length; i++) {
             const r = this._unsubscribes[i];
             r && r();
           }
-          z.release(this._unsubscribes), this._unsubscribes = T;
+          z.release(this._unsubscribes), this._unsubscribes = N;
         }
-        this._dependencies !== y && (w.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== S && (v.release(this._dependencyVersions), this._dependencyVersions = S);
+        this._dependencies !== y && (w.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== S && (T.release(this._dependencyVersions), this._dependencyVersions = S);
       }
     }, this.addDependency = (i) => {
       if (this.isExecuting && this._nextDeps && this._nextUnsubs && this._nextVersions) {
@@ -1055,7 +1045,7 @@ class rt extends Ne {
       let r = !1;
       try {
         const o = Q.run(this, this._fn);
-        this._commitEffect(i), r = !0, this._checkLoopWarnings(), Ue(o) ? o.then((c) => {
+        this._commitEffect(i), r = !0, this._checkLoopWarnings(), Oe(o) ? o.then((c) => {
           !this.isDisposed && typeof c == "function" && (this._cleanup = c);
         }).catch((c) => {
           this._handleExecutionError(c);
@@ -1065,20 +1055,20 @@ class rt extends Ne {
       } finally {
         this._cleanupEffect(i, r), this._setExecuting(!1);
       }
-    }, this._cleanup = null, this._dependencies = y, this._dependencyVersions = S, this._unsubscribes = T, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, 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 ?? q.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? q.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = s.trackModifications ?? !1, this._historyPtr = 0;
+    }, this._cleanup = null, this._dependencies = y, this._dependencyVersions = S, this._unsubscribes = N, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, 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 ?? q.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? q.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = s.trackModifications ?? !1, this._historyPtr = 0;
     const n = Number.isFinite(this._maxExecutions);
-    this._historyCapacity = n ? Math.min(this._maxExecutions + 1, q.MAX_EXECUTIONS_PER_SECOND + 1) : 0, this._history = C && n && this._historyCapacity > 0 ? new Array(this._historyCapacity).fill(0) : null, this._executionCount = 0, N.attachDebugInfo(this, "effect", this.id);
+    this._historyCapacity = n ? Math.min(this._maxExecutions + 1, q.MAX_EXECUTIONS_PER_SECOND + 1) : 0, this._history = C && n && this._historyCapacity > 0 ? new Array(this._historyCapacity).fill(0) : null, this._executionCount = 0, v.attachDebugInfo(this, "effect", this.id);
   }
   /**
    * Prepares the execution context by acquiring pools and setting up epoch.
    * @returns The prepared EffectExecutionContext.
    */
   _prepareEffectExecutionContext() {
-    const e = this._dependencies, s = this._dependencyVersions, n = this._unsubscribes, i = w.acquire(), r = v.acquire(), o = z.acquire(), c = Re();
-    if (e !== y && n !== T)
+    const e = this._dependencies, s = this._dependencyVersions, n = this._unsubscribes, i = w.acquire(), r = T.acquire(), o = z.acquire(), c = we();
+    if (e !== y && n !== N)
       for (let h = 0; h < e.length; h++) {
-        const f = e[h];
-        f && (f._tempUnsub = n[h]);
+        const d = e[h];
+        d && (d._tempUnsub = n[h]);
       }
     return this._nextDeps = i, this._nextVersions = r, this._nextUnsubs = o, this._currentEpoch = c, { prevDeps: e, prevVersions: s, prevUnsubs: n, nextDeps: i, nextVersions: r, nextUnsubs: o };
   }
@@ -1104,9 +1094,9 @@ class rt extends Ne {
         }
         w.release(e.prevDeps);
       }
-      e.prevUnsubs !== T && z.release(e.prevUnsubs), e.prevVersions !== S && v.release(e.prevVersions);
+      e.prevUnsubs !== N && z.release(e.prevUnsubs), e.prevVersions !== S && T.release(e.prevVersions);
     } else {
-      w.release(e.nextDeps), v.release(e.nextVersions);
+      w.release(e.nextDeps), T.release(e.nextVersions);
       for (let n = 0; n < e.nextUnsubs.length; n++)
         e.nextUnsubs[n]?.();
       if (z.release(e.nextUnsubs), e.prevDeps !== y)
@@ -1174,11 +1164,11 @@ class rt extends Ne {
    * @throws {EffectError} If an infinite loop is detected.
    */
   _checkInfiniteLoop() {
-    if (this._lastFlushEpoch !== ie && (this._lastFlushEpoch = ie, this._executionsInEpoch = 0), this._executionsInEpoch++, this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), He() > q.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++, this._history && this._maxExecutions > 0) {
+    if (this._lastFlushEpoch !== re && (this._lastFlushEpoch = re, this._executionsInEpoch = 0), this._executionsInEpoch++, this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), et() > q.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++, this._history && this._maxExecutions > 0) {
       const e = Date.now(), s = this._historyPtr, n = this._historyCapacity;
       this._history[s] = e;
       const i = (s + 1) % n, r = this._history[i] ?? 0;
-      if (this._historyPtr = i, r > 0 && e - r < je.ONE_SECOND_MS) {
+      if (this._historyPtr = i, r > 0 && e - r < Be.ONE_SECOND_MS) {
         const o = new j(
           `Effect executed ${n} times within 1 second. Infinite loop suspected`
         );
@@ -1189,7 +1179,7 @@ class rt extends Ne {
   }
   _throwInfiniteLoopError(e) {
     const s = new j(
-      `Infinite loop detected (${e}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${_e}`
+      `Infinite loop detected (${e}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${ge}`
     );
     throw this.dispose(), console.error(s), s;
   }
@@ -1205,7 +1195,7 @@ class rt extends Ne {
       if (s) {
         if ("value" in s)
           try {
-            Oe(() => s.value);
+            Fe(() => s.value);
           } catch {
             return !0;
           }
@@ -1228,13 +1218,13 @@ class rt extends Ne {
    * Only active if trackModifications is enabled and debug is on.
    */
   _checkLoopWarnings() {
-    if (this._trackModifications && N.enabled) {
+    if (this._trackModifications && v.enabled) {
       const e = this._dependencies;
       for (let s = 0; s < e.length; s++) {
         const n = e[s];
-        n && n._modifiedAtEpoch === this._currentEpoch && N.warn(
+        n && n._modifiedAtEpoch === this._currentEpoch && v.warn(
           !0,
-          `Effect is reading a dependency (${N.getDebugName(n) || "unknown"}) that it just modified. Infinite loop may occur`
+          `Effect is reading a dependency (${v.getDebugName(n) || "unknown"}) that it just modified. Infinite loop may occur`
         );
       }
     }
@@ -1243,13 +1233,23 @@ class rt extends Ne {
 function $(t, e = {}) {
   if (typeof t != "function")
     throw new j(b.EFFECT_MUST_BE_FUNCTION);
-  const s = new rt(t, e);
+  const s = new ot(t, e);
   return s.execute(), s;
 }
-function ot(t) {
+function ct(t) {
+  if (typeof t != "function")
+    throw new U("Batch callback must be a function");
+  W.startBatch();
+  try {
+    return t();
+  } finally {
+    W.endBatch();
+  }
+}
+function ut(t) {
   return t !== null && typeof t == "object" && "value" in t && "subscribe" in t;
 }
-function ue(t) {
+function he(t) {
   if (!t) return "unknown";
   const e = "jquery" in t ? t[0] : t;
   if (!e) return "unknown";
@@ -1260,7 +1260,31 @@ function ue(t) {
   }
   return e.tagName.toLowerCase();
 }
-function ct() {
+function ht(t) {
+  const e = t.length;
+  if (e === 0) return new Int32Array(0);
+  const s = new Int32Array(e), n = new Int32Array(e);
+  let i = 0;
+  for (let o = 0; o < e; o++) {
+    const c = t[o];
+    if (c === -1) continue;
+    if (i === 0 || t[n[i - 1]] < c) {
+      s[o] = i > 0 ? n[i - 1] : -1, n[i++] = o;
+      continue;
+    }
+    let h = 0, d = i - 1;
+    for (; h < d; ) {
+      const m = h + d >>> 1;
+      t[n[m]] < c ? h = m + 1 : d = m;
+    }
+    c < t[n[h]] && (h > 0 && (s[o] = n[h - 1]), n[h] = o);
+  }
+  const r = new Int32Array(i);
+  for (let o = i - 1, c = n[i - 1]; o >= 0; o--)
+    r[o] = c, c = s[c];
+  return r;
+}
+function at() {
   if (typeof window < "u") {
     const t = window.__ATOM_DEBUG__;
     if (typeof t == "boolean")
@@ -1273,7 +1297,7 @@ function ct() {
   }
   return !1;
 }
-let M = ct();
+let M = at();
 const g = {
   get enabled() {
     return M;
@@ -1292,8 +1316,8 @@ const g = {
    */
   domUpdated(t, e, s) {
     if (!M) return;
-    const n = ue(t);
-    console.log(`[atom-effect-jquery] DOM updated: ${n}.${e} =`, s), ut(t);
+    const n = he(t);
+    console.log(`[atom-effect-jquery] DOM updated: ${n}.${e} =`, s), lt(t);
   },
   cleanup(t) {
     M && console.log(`[atom-effect-jquery] Cleanup: ${t}`);
@@ -1302,7 +1326,7 @@ const g = {
     M && console.warn("[atom-effect-jquery]", ...t);
   }
 };
-function ut(t) {
+function lt(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";
@@ -1331,12 +1355,12 @@ function ut(t) {
   }, 100);
   t.data(s, r);
 }
-const ht = /* @__PURE__ */ new WeakMap();
-function Le(t, e = {}) {
-  const s = nt(t, e);
-  return e.name && ht.set(s, { name: e.name }), s;
+const ft = /* @__PURE__ */ new WeakMap();
+function Pe(t, e = {}) {
+  const s = it(t, e);
+  return e.name && ft.set(s, { name: e.name }), s;
 }
-Object.defineProperty(Le, "debug", {
+Object.defineProperty(Pe, "debug", {
   get() {
     return g.enabled;
   },
@@ -1344,45 +1368,54 @@ Object.defineProperty(Le, "debug", {
     g.enabled = t;
   }
 });
-function at() {
+function dt() {
   return new Promise((t) => setTimeout(t, 0));
 }
 u.extend({
-  atom: Le,
-  computed: it,
+  atom: Pe,
+  computed: rt,
   effect: $,
-  batch: Ye,
-  untracked: Oe,
-  isAtom: de,
-  isComputed: xe,
-  isReactive: (t) => de(t) || xe(t),
-  nextTick: at
+  batch: ct,
+  untracked: Fe,
+  isAtom: _e,
+  isComputed: Ce,
+  isReactive: (t) => _e(t) || Ce(t),
+  nextTick: dt
 });
-class lt {
+const se = "_aes-bound";
+class _t {
   effects = /* @__PURE__ */ new WeakMap();
   cleanups = /* @__PURE__ */ new WeakMap();
   boundElements = /* @__PURE__ */ new WeakSet();
   preservedNodes = /* @__PURE__ */ new WeakSet();
+  ignoredNodes = /* @__PURE__ */ new WeakSet();
+  // Prevent redundant cleanup
   keep(e) {
     this.preservedNodes.add(e);
   }
   isKept(e) {
     return this.preservedNodes.has(e);
   }
+  markIgnored(e) {
+    this.ignoredNodes.add(e);
+  }
+  isIgnored(e) {
+    return this.ignoredNodes.has(e);
+  }
   trackEffect(e, s) {
     let n = this.effects.get(e);
-    n || (n = [], this.effects.set(e, n), this.boundElements.add(e)), 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.add(e)), 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;
-    g.cleanup(ue(e));
+    e.classList.remove(se), g.cleanup(he(e));
     const s = this.effects.get(e);
     if (s) {
       this.effects.delete(e);
@@ -1410,18 +1443,20 @@ class lt {
       }
     }
   }
-  cleanupTree(e) {
-    const s = e.querySelectorAll("*");
+  cleanupDescendants(e) {
+    const s = e.querySelectorAll(`.${se}`);
     for (let n = 0, i = s.length; n < i; n++) {
       const r = s[n];
       r && this.boundElements.has(r) && this.cleanup(r);
     }
-    this.cleanup(e);
+  }
+  cleanupTree(e) {
+    this.cleanupDescendants(e), this.cleanup(e);
   }
 }
-const d = new lt();
+const f = new _t();
 let K = null;
-function ft(t = document.body) {
+function pt(t = document.body) {
   K || (K = new MutationObserver((e) => {
     for (let s = 0, n = e.length; s < n; s++) {
       const i = e[s];
@@ -1429,40 +1464,40 @@ function ft(t = document.body) {
       const r = i.removedNodes;
       for (let o = 0, c = r.length; o < c; o++) {
         const h = r[o];
-        h && (d.isKept(h) || h.isConnected || h.nodeType === 1 && d.cleanupTree(h));
+        h && (f.isKept(h) || f.isIgnored(h) || h.isConnected || h.nodeType === 1 && f.cleanupTree(h));
       }
     }
   }), K.observe(t, { childList: !0, subtree: !0 }));
 }
-function vt() {
+function At() {
   K?.disconnect(), K = null;
 }
 function _(t, e, s, n) {
   const i = u(t), r = t;
-  if (ot(e)) {
+  if (ut(e)) {
     const o = $(() => {
       const c = e.value;
       s(c), g.domUpdated(i, n, c);
     });
-    d.trackEffect(r, o);
+    f.trackEffect(r, o);
   } else
     s(e);
 }
-function Pe() {
+function Ve() {
   return { timeoutId: null, phase: "idle", hasFocus: !1 };
 }
-function Ve(t, e, s = {}) {
+function Me(t, e, s = {}) {
   const {
     debounce: n,
     event: i = "input",
     parse: r = (D) => D,
     format: o = (D) => String(D ?? "")
-  } = s, c = Pe(), h = () => {
+  } = s, c = Ve(), h = () => {
     c.phase = "composing";
-  }, f = () => {
+  }, d = () => {
     c.phase = "idle", x();
   };
-  t.on("compositionstart", h), t.on("compositionend", f);
+  t.on("compositionstart", h), t.on("compositionend", d);
   const m = () => {
     c.hasFocus = !0;
   }, X = () => {
@@ -1484,7 +1519,7 @@ function Ve(t, e, s = {}) {
       c.phase = "syncing-to-dom", t.val(D), g.domUpdated(t, "val", D), c.phase = "idle";
     }
   }, cleanup: () => {
-    t.off(i, A), t.off("change", A), t.off("compositionstart", h), t.off("compositionend", f), t.off("focus", m), t.off("blur", X), c.timeoutId && clearTimeout(c.timeoutId);
+    t.off(i, A), t.off("change", A), t.off("compositionstart", h), t.off("compositionend", d), t.off("focus", m), t.off("blur", X), c.timeoutId && clearTimeout(c.timeoutId);
   } };
 }
 u.fn.atomText = function(t, e) {
@@ -1558,8 +1593,8 @@ u.fn.atomHide = function(t) {
 };
 u.fn.atomVal = function(t, e = {}) {
   return this.each(function() {
-    const s = u(this), { effect: n, cleanup: i } = Ve(s, t, e), r = $(n);
-    d.trackEffect(this, r), d.trackCleanup(this, i);
+    const s = u(this), { effect: n, cleanup: i } = Me(s, t, e), r = $(n);
+    f.trackEffect(this, r), f.trackCleanup(this, i);
   });
 };
 u.fn.atomChecked = function(t) {
@@ -1569,27 +1604,27 @@ u.fn.atomChecked = function(t) {
     const n = () => {
       s || (t.value = !!e.prop("checked"));
     };
-    e.on("change", n), d.trackCleanup(this, () => e.off("change", n));
+    e.on("change", n), f.trackCleanup(this, () => e.off("change", n));
     const i = $(() => {
       s = !0;
       const r = !!t.value;
       e.prop("checked", r), g.domUpdated(e, "checked", r), s = !1;
     });
-    d.trackEffect(this, i);
+    f.trackEffect(this, i);
   });
 };
 u.fn.atomOn = function(t, e) {
   return this.each(function() {
     const s = u(this);
-    s.on(t, e), d.trackCleanup(this, () => s.off(t, e));
+    s.on(t, e), f.trackCleanup(this, () => s.off(t, e));
   });
 };
 u.fn.atomUnbind = function() {
   return this.each(function() {
-    d.cleanupTree(this);
+    f.cleanupTree(this);
   });
 };
-function dt(t, e) {
+function gt(t, e) {
   _(
     t.el,
     e,
@@ -1599,7 +1634,7 @@ function dt(t, e) {
     "text"
   );
 }
-function _t(t, e) {
+function Et(t, e) {
   _(
     t.el,
     e,
@@ -1609,7 +1644,7 @@ function _t(t, e) {
     "html"
   );
 }
-function pt(t, e) {
+function bt(t, e) {
   for (const s in e)
     _(
       t.el,
@@ -1620,7 +1655,7 @@ function pt(t, e) {
       `class.${s}`
     );
 }
-function gt(t, e) {
+function mt(t, e) {
   const s = t.el.style;
   for (const n in e) {
     const i = e[n];
@@ -1647,7 +1682,7 @@ function gt(t, e) {
       );
   }
 }
-function Et(t, e) {
+function yt(t, e) {
   const s = t.el;
   for (const n in e) {
     const i = e[n];
@@ -1665,7 +1700,7 @@ function Et(t, e) {
     );
   }
 }
-function bt(t, e) {
+function St(t, e) {
   const s = t.el;
   for (const n in e)
     _(
@@ -1677,7 +1712,7 @@ function bt(t, e) {
       `prop.${n}`
     );
 }
-function mt(t, e) {
+function Dt(t, e) {
   _(
     t.el,
     e,
@@ -1687,7 +1722,7 @@ function mt(t, e) {
     "show"
   );
 }
-function yt(t, e) {
+function It(t, e) {
   _(
     t.el,
     e,
@@ -1697,12 +1732,12 @@ function yt(t, e) {
     "hide"
   );
 }
-function St(t, e) {
-  const s = Array.isArray(e) ? e[0] : e, n = Array.isArray(e) ? e[1] : {}, { effect: i, cleanup: r } = Ve(t.$el, s, n), o = $(i);
-  d.trackEffect(t.el, o), t.trackCleanup(r);
+function Ct(t, e) {
+  const s = Array.isArray(e) ? e[0] : e, n = Array.isArray(e) ? e[1] : {}, { effect: i, cleanup: r } = Me(t.$el, s, n), o = $(i);
+  f.trackEffect(t.el, o), t.trackCleanup(r);
 }
-function Dt(t, e) {
-  const s = Pe(), n = () => {
+function xt(t, e) {
+  const s = Ve(), n = () => {
     s.phase === "idle" && (e.value = t.$el.prop("checked"));
   };
   t.$el.on("change", n), t.trackCleanup(() => t.$el.off("change", n));
@@ -1711,9 +1746,9 @@ function Dt(t, e) {
     const r = !!e.value;
     t.$el.prop("checked", r), g.domUpdated(t.$el, "checked", r), s.phase = "idle";
   });
-  d.trackEffect(t.el, i);
+  f.trackEffect(t.el, i);
 }
-function It(t, e) {
+function Nt(t, e) {
   const s = t.el;
   for (const n in e) {
     const i = e[n];
@@ -1728,39 +1763,15 @@ u.fn.atomBind = function(t) {
       $el: u(this),
       el: this,
       effects: [],
-      trackCleanup: (n) => d.trackCleanup(this, n)
+      trackCleanup: (n) => f.trackCleanup(this, n)
     };
-    t.text !== void 0 && dt(s, t.text), t.html !== void 0 && _t(s, t.html), t.class && pt(s, t.class), t.css && gt(s, t.css), t.attr && Et(s, t.attr), t.prop && bt(s, t.prop), t.show !== void 0 && mt(s, t.show), t.hide !== void 0 && yt(s, t.hide), t.val !== void 0 && St(s, t.val), t.checked !== void 0 && Dt(s, t.checked), t.on && It(s, t.on);
+    t.text !== void 0 && gt(s, t.text), t.html !== void 0 && Et(s, t.html), t.class && bt(s, t.class), t.css && mt(s, t.css), t.attr && yt(s, t.attr), t.prop && St(s, t.prop), t.show !== void 0 && Dt(s, t.show), t.hide !== void 0 && It(s, t.hide), t.val !== void 0 && Ct(s, t.val), t.checked !== void 0 && xt(s, t.checked), t.on && Nt(s, t.on);
   });
 };
-function Ct(t) {
-  const e = t.length;
-  if (e === 0) return new Int32Array(0);
-  const s = new Int32Array(e), n = new Int32Array(e);
-  let i = 0;
-  for (let o = 0; o < e; o++) {
-    const c = t[o];
-    if (c === -1) continue;
-    if (i === 0 || t[n[i - 1]] < c) {
-      s[o] = i > 0 ? n[i - 1] : -1, n[i++] = o;
-      continue;
-    }
-    let h = 0, f = i - 1;
-    for (; h < f; ) {
-      const m = h + f >>> 1;
-      t[n[m]] < c ? h = m + 1 : f = m;
-    }
-    c < t[n[h]] && (h > 0 && (s[o] = n[h - 1]), n[h] = o);
-  }
-  const r = new Int32Array(i);
-  for (let o = i - 1, c = n[i - 1]; o >= 0; o--)
-    r[o] = c, c = s[c];
-  return r;
-}
 u.fn.atomList = function(t, e) {
-  const { key: s, render: n, bind: i, update: r, onAdd: o, onRemove: c, empty: h } = e, f = typeof s == "function" ? s : (m) => m[s];
+  const { key: s, render: n, bind: i, update: r, onAdd: o, onRemove: c, empty: h } = e, d = typeof s == "function" ? s : (m) => m[s];
   return this.each(function() {
-    const m = u(this), X = ue(this), x = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Set();
+    const m = u(this), X = he(this), x = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Set();
     let k = [], L = null;
     const D = $(() => {
       const H = t.value, R = H.length;
@@ -1769,17 +1780,17 @@ u.fn.atomList = function(t, e) {
         return;
       }
       g.log("list", `${X} updating with ${R} items`);
-      const Z = new Array(R), ge = /* @__PURE__ */ new Set();
+      const Z = new Array(R), Ee = /* @__PURE__ */ new Set();
       for (let a = 0; a < R; a++) {
-        const p = H[a], I = f(p, a);
-        Z[a] = I, ge.add(I);
+        const p = H[a], I = d(p, a);
+        Z[a] = I, Ee.add(I);
       }
       for (const [a, p] of x) {
-        if (ge.has(a) || A.has(a)) continue;
+        if (Ee.has(a) || A.has(a)) continue;
         const I = () => {
           p.$el.remove();
           const E = p.$el[0];
-          E && d.cleanup(E), A.delete(a), g.log("list", `${X} removed item:`, a);
+          E && f.cleanup(E), A.delete(a), g.log("list", `${X} removed item:`, a);
         };
         if (x.delete(a), A.add(a), c) {
           const E = c(p.$el);
@@ -1791,25 +1802,25 @@ u.fn.atomList = function(t, e) {
         k = [];
         return;
       }
-      const Ee = /* @__PURE__ */ new Map();
+      const be = /* @__PURE__ */ new Map();
       for (let a = 0; a < k.length; a++) {
         const p = k[a];
-        p !== void 0 && Ee.set(p, a);
+        p !== void 0 && be.set(p, a);
       }
-      const be = new Int32Array(R);
+      const me = new Int32Array(R);
       for (let a = 0; a < R; a++) {
         const p = Z[a];
-        be[a] = p !== void 0 ? Ee.get(p) ?? -1 : -1;
+        me[a] = p !== void 0 ? be.get(p) ?? -1 : -1;
       }
-      const me = Ct(be);
-      let he = me.length - 1, O = null;
+      const ye = ht(me);
+      let ae = ye.length - 1, O = null;
       for (let a = R - 1; a >= 0; a--) {
         const p = Z[a], I = H[a], E = x.get(p);
         if (E) {
           E.item = I;
           const P = E.$el[0];
           if (!P) continue;
-          r && r(E.$el, I, a), he >= 0 && me[he] === a ? (he--, P.nextSibling !== O && (O ? E.$el.insertBefore(O) : E.$el.appendTo(m))) : O ? E.$el.insertBefore(O) : E.$el.appendTo(m), O = P;
+          r && r(E.$el, I, a), ae >= 0 && ye[ae] === a ? (ae--, P.nextSibling !== O && (O ? E.$el.insertBefore(O) : E.$el.appendTo(m))) : O ? E.$el.insertBefore(O) : E.$el.appendTo(m), O = P;
         } else {
           const P = n(I, a), V = P instanceof Element ? u(P) : u(P);
           x.set(p, { $el: V, item: I }), O ? V.insertBefore(O) : V.appendTo(m), i && i(V, I, a), o && o(V), g.log("list", `${X} added item:`, p), O = V[0] || null;
@@ -1817,15 +1828,15 @@ u.fn.atomList = function(t, e) {
       }
       k = Z;
     });
-    d.trackEffect(this, D), d.trackCleanup(this, () => {
+    f.trackEffect(this, D), f.trackCleanup(this, () => {
       x.clear(), A.clear(), k = [], L?.remove();
     });
   });
 };
-const ne = /* @__PURE__ */ new WeakMap();
+const ie = /* @__PURE__ */ new WeakMap();
 u.fn.atomMount = function(t, e = {}) {
   return this.each(function() {
-    const s = u(this), n = ue(this), i = ne.get(this);
+    const s = u(this), n = he(this), i = ie.get(this);
     i && (g.log("mount", `${n} unmounting existing component`), i()), g.log("mount", `${n} mounting component`);
     let r;
     try {
@@ -1842,34 +1853,34 @@ u.fn.atomMount = function(t, e = {}) {
             r();
           } catch {
           }
-        d.cleanupTree(this), ne.delete(this);
+        f.cleanupTree(this), ie.delete(this);
       }
     };
-    ne.set(this, c), d.trackCleanup(this, c);
+    ie.set(this, c), f.trackCleanup(this, c);
   });
 };
 u.fn.atomUnmount = function() {
   return this.each(function() {
-    ne.get(this)?.();
+    ie.get(this)?.();
   });
 };
 const Y = /* @__PURE__ */ new WeakMap();
 let Te = !1;
-function Me() {
+function je() {
   if (Te) return;
   Te = !0;
   const t = u.fn.on, e = u.fn.off, s = u.fn.remove, n = u.fn.empty, i = u.fn.detach;
   u.fn.remove = function(r) {
     return (r ? this.filter(r) : this).each(function() {
-      d.cleanupTree(this);
+      f.cleanupTree(this), f.markIgnored(this);
     }), s.call(this, r);
   }, u.fn.empty = function() {
     return this.each(function() {
-      this.querySelectorAll("*").forEach((o) => d.cleanup(o));
+      f.cleanupDescendants(this);
     }), n.call(this);
   }, u.fn.detach = function(r) {
     return (r ? this.filter(r) : this).each(function() {
-      d.keep(this);
+      f.keep(this);
     }), i.call(this, r);
   }, u.fn.on = function(...r) {
     let o = -1;
@@ -1881,8 +1892,8 @@ function Me() {
     if (o !== -1) {
       const c = r[o];
       let h;
-      Y.has(c) ? h = Y.get(c) : (h = function(...f) {
-        return c.apply(this, f);
+      Y.has(c) ? h = Y.get(c) : (h = function(...d) {
+        return c.apply(this, d);
       }, Y.set(c, h)), r[o] = h;
     }
     return t.apply(this, r);
@@ -1900,22 +1911,22 @@ function Me() {
     return e.apply(this, r);
   };
 }
-const Nt = Me;
-Me();
+const Rt = je;
+je();
 u(() => {
-  ft(document.body);
+  pt(document.body);
 });
 export {
-  nt as atom,
-  Ye as batch,
-  it as computed,
-  Ot as default,
-  vt as disableAutoCleanup,
+  it as atom,
+  ct as batch,
+  rt as computed,
+  wt as default,
+  At as disableAutoCleanup,
   $ as effect,
-  ft as enableAutoCleanup,
-  Nt as enablejQueryBatching,
-  Me as enablejQueryOverrides,
-  d as registry,
-  Oe as untracked
+  pt as enableAutoCleanup,
+  Rt as enablejQueryBatching,
+  je as enablejQueryOverrides,
+  f as registry,
+  Fe as untracked
 };
 //# sourceMappingURL=index.mjs.map