atom-effect-jquery 0.1.0

package/dist/index.mjs

@@ -0,0 +1,1677 @@
+var Ae = Object.defineProperty;
+var Oe = (t, e, s) => e in t ? Ae(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s;
+var W = (t, e, s) => Oe(t, typeof e != "symbol" ? e + "" : e, s);
+import c from "jquery";
+import { default as ot } from "jquery";
+const we = {
+  /** One second in milliseconds */
+  ONE_SECOND_MS: 1e3
+}, K = {
+  IDLE: "idle",
+  PENDING: "pending",
+  RESOLVED: "resolved",
+  REJECTED: "rejected"
+}, Z = {
+  DISPOSED: 1,
+  // 0001 - Effect has been disposed
+  EXECUTING: 2
+  // 0010 - Effect is currently executing
+}, _ = {
+  DIRTY: 1,
+  // 0001 - Needs recomputation
+  IDLE: 2,
+  // 0010 - Initial state, not computed yet
+  PENDING: 4,
+  // 0100 - Async computation in progress
+  RESOLVED: 8,
+  // 1000 - Successfully computed
+  REJECTED: 16,
+  // 10000 - Computation failed
+  RECOMPUTING: 32,
+  // 100000 - Currently recomputing
+  HAS_ERROR: 64
+  // 1000000 - Has error state
+}, P = {
+  /** Maximum effect executions per second to detect infinite loops (Legacy/Fallback) */
+  MAX_EXECUTIONS_PER_SECOND: 1e3,
+  /**
+   * Maximum executions per effect within a single flush cycle
+   * Increased from 50 to 100
+   */
+  MAX_EXECUTIONS_PER_EFFECT: 100,
+  /**
+   * Maximum total executions across all effects in a single flush cycle
+   * Increased from 5000 to 10000
+   */
+  MAX_EXECUTIONS_PER_FLUSH: 1e4,
+  /** Maximum iterations for synchronous flush loop to prevent infinite loops */
+  MAX_FLUSH_ITERATIONS: 1e3,
+  /** Minimum allowed value for max flush iterations */
+  MIN_FLUSH_ITERATIONS: 10
+}, fe = {
+  /** Maximum dependencies before warning about large dependency graphs */
+  MAX_DEPENDENCIES: 1e3,
+  /** Enable infinite loop detection warnings */
+  WARN_INFINITE_LOOP: !0
+}, X = 1073741823, x = typeof process < "u" && process.env && process.env.NODE_ENV !== "production";
+class O extends Error {
+  /**
+   * Creates a new AtomError
+   * @param message - Error message describing what went wrong
+   * @param cause - Original error that caused this error
+   * @param recoverable - Whether the operation can be retried
+   */
+  constructor(e, s = null, n = !0) {
+    super(e), this.name = "AtomError", this.cause = s, this.recoverable = n, this.timestamp = /* @__PURE__ */ new Date();
+  }
+}
+class q extends O {
+  /**
+   * Creates a new ComputedError
+   * @param message - Error message
+   * @param cause - Original error
+   */
+  constructor(e, s = null) {
+    super(e, s, !0), this.name = "ComputedError";
+  }
+}
+class w extends O {
+  /**
+   * Creates a new EffectError
+   * @param message - Error message
+   * @param cause - Original error
+   */
+  constructor(e, s = null) {
+    super(e, s, !1), this.name = "EffectError";
+  }
+}
+class ee extends O {
+  /**
+   * Creates a new SchedulerError
+   * @param message - Error message
+   * @param cause - Original error
+   */
+  constructor(e, s = null) {
+    super(e, s, !1), this.name = "SchedulerError";
+  }
+}
+const b = {
+  // ─────────────────────────────────────────────────────────────────
+  // Computed errors
+  // ─────────────────────────────────────────────────────────────────
+  /**
+   * Error thrown when computed() receives a non-function argument.
+   */
+  COMPUTED_MUST_BE_FUNCTION: "Computed function must be a function",
+  /**
+   * Error thrown when subscribe() receives an invalid listener.
+   */
+  COMPUTED_SUBSCRIBER_MUST_BE_FUNCTION: "Subscriber listener must be a function or Subscriber object",
+  /**
+   * Error thrown when accessing a pending async computed without a default value.
+   */
+  COMPUTED_ASYNC_PENDING_NO_DEFAULT: "Async computation is pending. No default value provided",
+  /**
+   * Error thrown when a synchronous computed computation fails.
+   */
+  COMPUTED_COMPUTATION_FAILED: "Computed computation failed",
+  /**
+   * Error thrown when an asynchronous computed computation fails.
+   */
+  COMPUTED_ASYNC_COMPUTATION_FAILED: "Async computed computation failed",
+  /**
+   * Error thrown when subscribing to a dependency fails.
+   */
+  COMPUTED_DEPENDENCY_SUBSCRIPTION_FAILED: "Failed to subscribe to dependency",
+  // ─────────────────────────────────────────────────────────────────
+  // Atom errors
+  // ─────────────────────────────────────────────────────────────────
+  /**
+   * Error thrown when atom.subscribe() receives an invalid listener.
+   */
+  ATOM_SUBSCRIBER_MUST_BE_FUNCTION: "Subscription listener must be a function or Subscriber object",
+  /**
+   * Error thrown when the atom subscriber notification process fails.
+   */
+  ATOM_SUBSCRIBER_EXECUTION_FAILED: "Error occurred while executing atom subscribers",
+  /**
+   * Error logged when an individual subscriber throws during notification.
+   * @remarks This error is caught and logged to prevent cascading failures.
+   */
+  ATOM_INDIVIDUAL_SUBSCRIBER_FAILED: "Error during individual atom subscriber execution",
+  // ─────────────────────────────────────────────────────────────────
+  // Effect errors
+  // ─────────────────────────────────────────────────────────────────
+  /**
+   * Error thrown when effect() receives a non-function argument.
+   */
+  EFFECT_MUST_BE_FUNCTION: "Effect function must be a function",
+  /**
+   * Error thrown when an effect's execution fails.
+   */
+  EFFECT_EXECUTION_FAILED: "Effect execution failed",
+  /**
+   * Error thrown when an effect's cleanup function fails.
+   */
+  EFFECT_CLEANUP_FAILED: "Effect cleanup function execution failed",
+  // ─────────────────────────────────────────────────────────────────
+  // Debug warnings
+  // ─────────────────────────────────────────────────────────────────
+  /**
+   * Warning message for large dependency graphs.
+   *
+   * @param count - The number of dependencies detected
+   * @returns Formatted warning message with dependency count
+   *
+   * @example
+   * ```ts
+   * console.warn(ERROR_MESSAGES.LARGE_DEPENDENCY_GRAPH(150));
+   * // Output: "Large dependency graph detected: 150 dependencies"
+   * ```
+   */
+  LARGE_DEPENDENCY_GRAPH: (t) => `Large dependency graph detected: ${t} dependencies`,
+  /**
+   * Warning logged when attempting to unsubscribe a non-existent listener.
+   */
+  UNSUBSCRIBE_NON_EXISTENT: "Attempted to unsubscribe a non-existent listener",
+  /**
+   * Error logged when the onError callback itself throws an error.
+   * @remarks This prevents cascading failures from masking the original error.
+   */
+  CALLBACK_ERROR_IN_ERROR_HANDLER: "Error occurred during onError callback execution"
+}, re = /* @__PURE__ */ Symbol("debugName"), Fe = /* @__PURE__ */ Symbol("id"), oe = /* @__PURE__ */ Symbol("type"), de = /* @__PURE__ */ Symbol("noDefaultValue");
+function ke(t) {
+  return "dependencies" in t && Array.isArray(t.dependencies);
+}
+let _e = 0;
+function Se(t, e, s) {
+  if (t._visitedEpoch !== s) {
+    if (t._visitedEpoch = s, t === e)
+      throw new q("Indirect circular dependency detected");
+    if (ke(t)) {
+      const n = t.dependencies;
+      for (let i = 0; i < n.length; i++) {
+        const r = n[i];
+        r && Se(r, e, s);
+      }
+    }
+  }
+}
+var me;
+const U = {
+  enabled: typeof process < "u" && ((me = process.env) == null ? void 0 : me.NODE_ENV) === "development",
+  maxDependencies: fe.MAX_DEPENDENCIES,
+  warnInfiniteLoop: fe.WARN_INFINITE_LOOP,
+  warn(t, e) {
+    this.enabled && t && console.warn(`[Atom Effect] ${e}`);
+  },
+  /**
+   * Checks for circular dependencies.
+   * Direct check runs always; indirect check only in dev mode.
+   * @throws {ComputedError} When circular dependency detected
+   */
+  checkCircular(t, e) {
+    if (t === e)
+      throw new q("Direct circular dependency detected");
+    this.enabled && (_e++, Se(t, e, _e));
+  },
+  attachDebugInfo(t, e, s) {
+    if (!this.enabled)
+      return;
+    const n = t;
+    n[re] = `${e}_${s}`, n[Fe] = s, n[oe] = e;
+  },
+  getDebugName(t) {
+    if (t != null && re in t)
+      return t[re];
+  },
+  getDebugType(t) {
+    if (t != null && oe in t)
+      return t[oe];
+  }
+};
+let Me = 1;
+const Pe = () => Me++;
+class ye {
+  constructor() {
+    this.id = Pe() & X, this.flags = 0;
+  }
+}
+class De extends ye {
+  constructor() {
+    super(), this.version = 0, this._lastSeenEpoch = -1;
+  }
+  /**
+   * Subscribes a listener function or Subscriber object to value changes.
+   *
+   * @param listener - Function or Subscriber object to call when the value changes
+   * @returns An unsubscribe function
+   * @throws {AtomError} If listener is not a function or Subscriber
+   */
+  subscribe(e) {
+    if (typeof e == "object" && e !== null && "execute" in e)
+      return this._objectSubscribers.add(e);
+    if (typeof e != "function")
+      throw new O(b.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);
+    return this._functionSubscribers.add(e);
+  }
+  /**
+   * Gets the total number of active subscribers.
+   */
+  subscriberCount() {
+    return this._functionSubscribers.size + this._objectSubscribers.size;
+  }
+  /**
+   * Notifies all subscribers of a change.
+   *
+   * @param newValue - The new value
+   * @param oldValue - The old value
+   */
+  _notifySubscribers(e, s) {
+    this._functionSubscribers.forEachSafe(
+      (n) => n(e, s),
+      (n) => console.error(new O(b.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED, n))
+    ), this._objectSubscribers.forEachSafe(
+      (n) => n.execute(),
+      (n) => console.error(new O(b.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED, n))
+    );
+  }
+}
+let ce = 0;
+function Ce() {
+  return ce = (ce + 1 | 0) & X, ce;
+}
+let se = 0, he = 0, ne = !1;
+function pe() {
+  return ne ? (x && console.warn(
+    "Warning: startFlush() called during flush - ignored to prevent infinite loop detection bypass"
+  ), !1) : (ne = !0, se = se + 1 & X, he = 0, !0);
+}
+function be() {
+  ne = !1;
+}
+function Le() {
+  return ne ? ++he : 0;
+}
+class $e {
+  constructor() {
+    this.queueA = [], this.queueB = [], this.queue = this.queueA, this.queueSize = 0, this._epoch = 0, this.isProcessing = !1, this.isBatching = !1, this.batchDepth = 0, this.batchQueue = [], this.batchQueueSize = 0, this.isFlushingSync = !1, this.maxFlushIterations = P.MAX_FLUSH_ITERATIONS;
+  }
+  get phase() {
+    return this.isProcessing || this.isFlushingSync ? 2 : this.isBatching ? 1 : 0;
+  }
+  /**
+   * Schedules a task for execution.
+   * Tasks are deduplicated within the same flush cycle using epoch tracking.
+   * @param callback - The function to execute.
+   * @throws {SchedulerError} If the callback is not a function.
+   */
+  schedule(e) {
+    if (typeof e != "function")
+      throw new ee("Scheduler callback must be a function");
+    e._nextEpoch !== this._epoch && (e._nextEpoch = this._epoch, this.isBatching || this.isFlushingSync ? this.batchQueue[this.batchQueueSize++] = e : (this.queue[this.queueSize++] = e, this.isProcessing || this.flush()));
+  }
+  flush() {
+    if (this.isProcessing || this.queueSize === 0) return;
+    this.isProcessing = !0;
+    const e = this.queue, s = this.queueSize;
+    this.queue = this.queue === this.queueA ? this.queueB : this.queueA, this.queueSize = 0, this._epoch++, queueMicrotask(() => {
+      const n = pe();
+      this._processJobs(e, s), this.isProcessing = !1, n && be(), this.queueSize > 0 && !this.isBatching && this.flush();
+    });
+  }
+  flushSync() {
+    this.isFlushingSync = !0;
+    const e = pe();
+    try {
+      this._mergeBatchQueue(), this._drainQueue();
+    } finally {
+      this.isFlushingSync = !1, e && be();
+    }
+  }
+  _mergeBatchQueue() {
+    if (this._epoch++, this.batchQueueSize > 0) {
+      for (let e = 0; e < this.batchQueueSize; e++) {
+        const s = this.batchQueue[e];
+        s && s._nextEpoch !== this._epoch && (s._nextEpoch = this._epoch, this.queue[this.queueSize++] = s);
+      }
+      this.batchQueueSize = 0;
+    }
+  }
+  _drainQueue() {
+    let e = 0;
+    for (; this.queueSize > 0; ) {
+      if (++e > this.maxFlushIterations) {
+        this._handleFlushOverflow();
+        break;
+      }
+      this._processCurrentQueue(), this._mergeBatchQueue();
+    }
+  }
+  _processCurrentQueue() {
+    const e = this.queue, s = this.queueSize;
+    this.queue = this.queue === this.queueA ? this.queueB : this.queueA, this.queueSize = 0, this._epoch++, this._processJobs(e, s);
+  }
+  _handleFlushOverflow() {
+    console.error(
+      new ee(
+        `Maximum flush iterations (${this.maxFlushIterations}) exceeded. Possible infinite loop.`
+      )
+    ), this.queueSize = 0, this.queue.length = 0, this.batchQueueSize = 0;
+  }
+  _processJobs(e, s) {
+    var n;
+    for (let i = 0; i < s; i++)
+      try {
+        (n = e[i]) == null || n.call(e);
+      } catch (r) {
+        console.error(
+          new ee("Error occurred during scheduler execution", r)
+        );
+      }
+    e.length = 0;
+  }
+  /** Starts a new batch of updates. Updates will be deferred until endBatch is called. */
+  startBatch() {
+    this.batchDepth++, this.isBatching = !0;
+  }
+  /**
+   * Ends the current batch. If the batch depth reaches zero, all pending updates are flushed synchronously.
+   */
+  endBatch() {
+    this.batchDepth = Math.max(0, this.batchDepth - 1), this.batchDepth === 0 && (this.flushSync(), this.isBatching = !1);
+  }
+  /**
+   * Configures the maximum number of iterations allowed during a synchronous flush.
+   * Used to prevent infinite loops.
+   * @param max - Maximum iterations count.
+   */
+  setMaxFlushIterations(e) {
+    if (e < P.MIN_FLUSH_ITERATIONS)
+      throw new ee(
+        `Max flush iterations must be at least ${P.MIN_FLUSH_ITERATIONS}`
+      );
+    this.maxFlushIterations = e;
+  }
+}
+const H = new $e();
+function A(t) {
+  if (typeof t != "function")
+    throw new O("Batch callback must be a function");
+  H.startBatch();
+  try {
+    return t();
+  } finally {
+    H.endBatch();
+  }
+}
+const V = {
+  current: null,
+  run(t, e) {
+    const s = this.current;
+    this.current = t;
+    try {
+      return e();
+    } finally {
+      this.current = s;
+    }
+  },
+  getCurrent() {
+    return this.current;
+  }
+};
+function xe(t) {
+  if (typeof t != "function")
+    throw new O("Untracked callback must be a function");
+  const e = V.current;
+  V.current = null;
+  try {
+    return t();
+  } finally {
+    V.current = e;
+  }
+}
+class ie {
+  constructor() {
+    this.subscribers = null;
+  }
+  /** Adds subscriber and returns unsubscribe function (idempotent) */
+  add(e) {
+    if (this.subscribers || (this.subscribers = []), this.subscribers.indexOf(e) !== -1)
+      return () => {
+      };
+    this.subscribers.push(e);
+    let s = !1;
+    return () => {
+      s || (s = !0, this.remove(e));
+    };
+  }
+  /** Removes subscriber using swap-and-pop */
+  remove(e) {
+    if (!this.subscribers)
+      return !1;
+    const s = this.subscribers.indexOf(e);
+    if (s === -1)
+      return !1;
+    const n = this.subscribers.length - 1;
+    return s !== n && (this.subscribers[s] = this.subscribers[n]), this.subscribers.pop(), !0;
+  }
+  has(e) {
+    return this.subscribers ? this.subscribers.indexOf(e) !== -1 : !1;
+  }
+  forEach(e) {
+    if (this.subscribers)
+      for (let s = 0; s < this.subscribers.length; s++)
+        e(this.subscribers[s], s);
+  }
+  /** Iterates with error handling to prevent one failure from breaking the chain */
+  forEachSafe(e, s) {
+    if (this.subscribers)
+      for (let n = 0; n < this.subscribers.length; n++)
+        try {
+          e(this.subscribers[n], n);
+        } catch (i) {
+          s ? s(i) : console.error("[SubscriberManager] Error in subscriber callback:", i);
+        }
+  }
+  get size() {
+    var e;
+    return ((e = this.subscribers) == null ? void 0 : e.length) ?? 0;
+  }
+  get hasSubscribers() {
+    return this.subscribers !== null && this.subscribers.length > 0;
+  }
+  clear() {
+    this.subscribers = null;
+  }
+  toArray() {
+    return this.subscribers ? [...this.subscribers] : [];
+  }
+}
+function ue(t) {
+  return t !== null && typeof t == "object" && "value" in t && "subscribe" in t && typeof t.subscribe == "function";
+}
+function Ee(t) {
+  if (U.enabled && (t == null || typeof t == "object")) {
+    const e = U.getDebugType(t);
+    if (e)
+      return e === "computed";
+  }
+  return ue(t) && "invalidate" in t && typeof t.invalidate == "function";
+}
+function Ie(t) {
+  return t != null && typeof t.then == "function";
+}
+function Ve(t) {
+  return typeof t == "object" && t !== null;
+}
+function ve(t) {
+  return (typeof t == "object" || typeof t == "function") && t !== null && typeof t.addDependency == "function";
+}
+function Ne(t) {
+  return typeof t == "function" && typeof t.addDependency != "function";
+}
+function Ue(t) {
+  return Ve(t) && typeof t.execute == "function";
+}
+class je extends De {
+  constructor(e, s) {
+    super(), this._isNotificationScheduled = !1, this._value = e, this._functionSubscribersStore = new ie(), this._objectSubscribersStore = new ie(), this._sync = s, this._notifyTask = this._flushNotifications.bind(this), U.attachDebugInfo(this, "atom", this.id);
+  }
+  /** Gets the manager for function-based subscribers. */
+  get _functionSubscribers() {
+    return this._functionSubscribersStore;
+  }
+  /** Gets the manager for object-based subscribers. */
+  get _objectSubscribers() {
+    return this._objectSubscribersStore;
+  }
+  /**
+   * Returns the current value and registers the atom as a dependency in the current tracking context.
+   */
+  get value() {
+    const e = V.getCurrent();
+    return e && this._track(e), this._value;
+  }
+  /**
+   * Sets a new value and schedules notifications if the value has changed.
+   * Uses `Object.is` for comparison.
+   */
+  set value(e) {
+    if (Object.is(this._value, e)) return;
+    const s = this._value;
+    this.version = this.version + 1 & X, this._value = e, !(!this._functionSubscribersStore.hasSubscribers && !this._objectSubscribersStore.hasSubscribers) && this._scheduleNotification(s);
+  }
+  _track(e) {
+    if (ve(e)) {
+      e.addDependency(this);
+      return;
+    }
+    if (Ne(e)) {
+      this._functionSubscribersStore.add(e);
+      return;
+    }
+    Ue(e) && this._objectSubscribersStore.add(e);
+  }
+  _scheduleNotification(e) {
+    this._isNotificationScheduled || (this._pendingOldValue = e, this._isNotificationScheduled = !0), this._sync && !H.isBatching ? this._flushNotifications() : H.schedule(this._notifyTask);
+  }
+  _flushNotifications() {
+    if (!this._isNotificationScheduled) return;
+    const e = this._pendingOldValue, s = this._value;
+    this._pendingOldValue = void 0, this._isNotificationScheduled = !1, this._notifySubscribers(s, e);
+  }
+  /**
+   * Returns the current value without registering as a dependency in the tracking context.
+   */
+  peek() {
+    return this._value;
+  }
+  /**
+   * Disposes of the atom, clearing all subscribers and resetting the value.
+   */
+  dispose() {
+    this._functionSubscribersStore.clear(), this._objectSubscribersStore.clear(), this._value = void 0;
+  }
+}
+function Be(t, e = {}) {
+  return new je(t, e.sync ?? !1);
+}
+class ae {
+  constructor() {
+    this.pool = [], this.maxPoolSize = 50, this.maxReusableCapacity = 256, this.stats = x ? {
+      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 x && 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)) {
+        x && this.stats && this.stats.rejected.frozen++;
+        return;
+      }
+      if (e.length > this.maxReusableCapacity) {
+        x && this.stats && this.stats.rejected.tooLarge++;
+        return;
+      }
+      if (this.pool.length >= this.maxPoolSize) {
+        x && this.stats && this.stats.rejected.poolFull++;
+        return;
+      }
+      e.length = 0, this.pool.push(e), x && this.stats && this.stats.released++;
+    }
+  }
+  /** Returns current stats for the pool (dev mode only). */
+  getStats() {
+    if (!x || !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, x && this.stats && (this.stats.acquired = 0, this.stats.released = 0, this.stats.rejected = { frozen: 0, tooLarge: 0, poolFull: 0 });
+  }
+}
+const g = Object.freeze([]), v = Object.freeze([]), m = Object.freeze([]), F = new ae(), L = new ae(), N = new ae();
+function qe(t, e, s, n) {
+  if (e !== g && s !== v)
+    for (let r = 0; r < e.length; r++) {
+      const o = e[r];
+      o && (o._tempUnsub = s[r]);
+    }
+  const i = L.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) : (U.checkCircular(o, n), i[r] = o.subscribe(n)));
+  }
+  if (e !== g)
+    for (let r = 0; r < e.length; r++) {
+      const o = e[r];
+      o != null && o._tempUnsub && (o._tempUnsub(), o._tempUnsub = void 0);
+    }
+  return s !== v && L.release(s), i;
+}
+function z(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 O)
+    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);
+}
+class Re extends De {
+  constructor(e, s = {}) {
+    if (typeof e != "function")
+      throw new q(b.COMPUTED_MUST_BE_FUNCTION);
+    if (super(), this._value = void 0, this.flags = _.DIRTY | _.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._functionSubscribersStore = new ie(), this._objectSubscribersStore = new ie(), this._dependencies = g, this._dependencyVersions = m, this._unsubscribes = v, this._notifyJob = () => {
+      this._functionSubscribersStore.forEachSafe(
+        (n) => n(),
+        (n) => console.error(n)
+      ), this._objectSubscribersStore.forEachSafe(
+        (n) => n.execute(),
+        (n) => console.error(n)
+      );
+    }, this._trackable = Object.assign(() => this._markDirty(), {
+      addDependency: (n) => {
+      }
+    }), U.attachDebugInfo(this, "computed", this.id), U.enabled) {
+      const n = this;
+      n.subscriberCount = () => this._functionSubscribersStore.size + this._objectSubscribersStore.size, n.isDirty = () => this._isDirty(), n.dependencies = this._dependencies, n.stateFlags = this._getFlagsAsString();
+    }
+    if (s.lazy === !1)
+      try {
+        this._recompute();
+      } catch {
+      }
+  }
+  get _functionSubscribers() {
+    return this._functionSubscribersStore;
+  }
+  get _objectSubscribers() {
+    return this._objectSubscribersStore;
+  }
+  get value() {
+    const e = this._computeValue();
+    return this._registerTracking(), e;
+  }
+  peek() {
+    return this._value;
+  }
+  get state() {
+    return this._getAsyncState();
+  }
+  get hasError() {
+    return this._isRejected();
+  }
+  get lastError() {
+    return this._error;
+  }
+  get isPending() {
+    return this._isPending();
+  }
+  get isResolved() {
+    return this._isResolved();
+  }
+  invalidate() {
+    this._markDirty(), this._dependencyVersions !== m && (N.release(this._dependencyVersions), this._dependencyVersions = m);
+  }
+  dispose() {
+    if (this._unsubscribes !== v) {
+      for (let e = 0; e < this._unsubscribes.length; e++) {
+        const s = this._unsubscribes[e];
+        s && s();
+      }
+      L.release(this._unsubscribes), this._unsubscribes = v;
+    }
+    this._dependencies !== g && (F.release(this._dependencies), this._dependencies = g), this._dependencyVersions !== m && (N.release(this._dependencyVersions), this._dependencyVersions = m), this._functionSubscribersStore.clear(), this._objectSubscribersStore.clear(), this.flags = _.DIRTY | _.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % this.MAX_PROMISE_ID;
+  }
+  // State flag operations
+  _isDirty() {
+    return (this.flags & _.DIRTY) !== 0;
+  }
+  _setDirty() {
+    this.flags |= _.DIRTY;
+  }
+  _clearDirty() {
+    this.flags &= -2;
+  }
+  _isIdle() {
+    return (this.flags & _.IDLE) !== 0;
+  }
+  _setIdle() {
+    this.flags |= _.IDLE, this.flags &= -29;
+  }
+  _isPending() {
+    return (this.flags & _.PENDING) !== 0;
+  }
+  _setPending() {
+    this.flags |= _.PENDING, this.flags &= -27;
+  }
+  _isResolved() {
+    return (this.flags & _.RESOLVED) !== 0;
+  }
+  _setResolved() {
+    this.flags |= _.RESOLVED, this.flags &= -87;
+  }
+  _isRejected() {
+    return (this.flags & _.REJECTED) !== 0;
+  }
+  _setRejected() {
+    this.flags |= _.REJECTED | _.HAS_ERROR, this.flags &= -15;
+  }
+  _isRecomputing() {
+    return (this.flags & _.RECOMPUTING) !== 0;
+  }
+  _setRecomputing(e) {
+    const s = _.RECOMPUTING;
+    this.flags = this.flags & ~s | -Number(e) & s;
+  }
+  _getAsyncState() {
+    return this._isResolved() ? K.RESOLVED : this._isPending() ? K.PENDING : this._isRejected() ? K.REJECTED : K.IDLE;
+  }
+  _getFlagsAsString() {
+    const e = [];
+    return this._isDirty() && e.push("DIRTY"), this._isIdle() && e.push("IDLE"), this._isPending() && e.push("PENDING"), this._isResolved() && e.push("RESOLVED"), this._isRejected() && e.push("REJECTED"), this._isRecomputing() && e.push("RECOMPUTING"), e.join(" | ");
+  }
+  _computeValue() {
+    return this._isRecomputing() ? this._value : ((this._isDirty() || this._isIdle()) && this._recompute(), this._isPending() ? this._handlePending() : this._isRejected() ? this._handleRejected() : this._value);
+  }
+  _recompute() {
+    if (this._isRecomputing()) return;
+    this._setRecomputing(!0);
+    const e = this._prepareComputationContext();
+    let s = !1;
+    try {
+      const n = V.run(this._trackable, this._fn);
+      Ie(n) ? (this._commitDependencies(e), s = !0, this._handleAsyncComputation(n)) : (this._commitDependencies(e), s = !0, this._handleSyncResult(n));
+    } catch (n) {
+      this._commitDependencies(e), s = !0, this._handleComputationError(n);
+    } finally {
+      this._cleanupContext(e, s), this._setRecomputing(!1);
+    }
+  }
+  _prepareComputationContext() {
+    const e = this._dependencies, s = this._dependencyVersions, n = F.acquire(), i = N.acquire(), r = Ce(), o = { depCount: 0 }, a = (l) => {
+      l._lastSeenEpoch !== r && (l._lastSeenEpoch = r, o.depCount < n.length ? (n[o.depCount] = l, i[o.depCount] = l.version) : (n.push(l), i.push(l.version)), o.depCount++);
+    }, f = this._trackable.addDependency;
+    return this._trackable.addDependency = a, { prevDeps: e, prevVersions: s, nextDeps: n, nextVersions: i, originalAdd: f, state: o };
+  }
+  _commitDependencies(e) {
+    const { nextDeps: s, nextVersions: n, state: i, prevDeps: r } = e;
+    s.length = i.depCount, n.length = i.depCount, this._unsubscribes = qe(s, r, this._unsubscribes, this), this._dependencies = s, this._dependencyVersions = n;
+  }
+  _cleanupContext(e, s) {
+    this._trackable.addDependency = e.originalAdd, s ? (e.prevDeps !== g && F.release(e.prevDeps), e.prevVersions !== m && N.release(e.prevVersions)) : (F.release(e.nextDeps), N.release(e.nextVersions));
+  }
+  _handleSyncResult(e) {
+    (!this._isResolved() || !this._equal(this._value, e)) && (this.version = this.version + 1 & X), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1);
+  }
+  _handleAsyncComputation(e) {
+    this._setPending(), this._clearDirty(), this._promiseId = this._promiseId >= this.MAX_PROMISE_ID ? 1 : this._promiseId + 1;
+    const s = this._promiseId;
+    e.then((n) => {
+      s === this._promiseId && this._handleAsyncResolution(n);
+    }).catch((n) => {
+      s === this._promiseId && this._handleAsyncRejection(n);
+    });
+  }
+  _handleAsyncResolution(e) {
+    (!this._isResolved() || !this._equal(this._value, e)) && (this.version = this.version + 1 & X), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1);
+  }
+  _handleAsyncRejection(e) {
+    const s = z(e, q, b.COMPUTED_ASYNC_COMPUTATION_FAILED);
+    if (this._error = s, this._setRejected(), this._clearDirty(), this._setRecomputing(!1), this._onError)
+      try {
+        this._onError(s);
+      } catch (n) {
+        console.error(b.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
+      }
+    this._notifySubscribers(void 0, void 0);
+  }
+  _handleComputationError(e) {
+    const s = z(e, q, b.COMPUTED_COMPUTATION_FAILED);
+    if (this._error = s, this._setRejected(), this._clearDirty(), this._setRecomputing(!1), this._onError)
+      try {
+        this._onError(s);
+      } catch (n) {
+        console.error(b.CALLBACK_ERROR_IN_ERROR_HANDLER, n);
+      }
+    throw s;
+  }
+  _handlePending() {
+    if (this._hasDefaultValue)
+      return this._defaultValue;
+    throw new q(b.COMPUTED_ASYNC_PENDING_NO_DEFAULT);
+  }
+  _handleRejected() {
+    var e;
+    if ((e = this._error) != null && e.recoverable && this._hasDefaultValue)
+      return this._defaultValue;
+    throw this._error;
+  }
+  /** Subscriber interface - marks dirty on dependency change */
+  execute() {
+    this._markDirty();
+  }
+  _markDirty() {
+    this._isRecomputing() || this._isDirty() || (this._setDirty(), this._notifyJob());
+  }
+  _registerTracking() {
+    const e = V.getCurrent();
+    if (e) {
+      if (ve(e)) {
+        e.addDependency(this);
+        return;
+      }
+      if (Ne(e)) {
+        this._functionSubscribersStore.add(e);
+        return;
+      }
+      Ue(e) && this._objectSubscribersStore.add(e);
+    }
+  }
+}
+Object.freeze(Re.prototype);
+function ze(t, e = {}) {
+  return new Re(t, e);
+}
+class Xe extends ye {
+  /**
+   * Creates a new EffectImpl instance.
+   * @param fn - The effect function to run.
+   * @param options - Configuration options for the effect.
+   */
+  constructor(e, s = {}) {
+    super(), this.run = () => {
+      if (this.isDisposed)
+        throw new w(b.EFFECT_MUST_BE_FUNCTION);
+      this._dependencyVersions !== m && (N.release(this._dependencyVersions), this._dependencyVersions = m), this.execute();
+    }, this.dispose = () => {
+      if (!this.isDisposed) {
+        if (this._setDisposed(), this._safeCleanup(), this._unsubscribes !== v) {
+          for (let n = 0; n < this._unsubscribes.length; n++) {
+            const i = this._unsubscribes[n];
+            i && i();
+          }
+          L.release(this._unsubscribes), this._unsubscribes = v;
+        }
+        this._dependencies !== g && (F.release(this._dependencies), this._dependencies = g), this._dependencyVersions !== m && (N.release(this._dependencyVersions), this._dependencyVersions = m);
+      }
+    }, this.addDependency = (n) => {
+      if (this.isExecuting && this._nextDeps && this._nextUnsubs && this._nextVersions) {
+        const i = this._currentEpoch;
+        if (n._lastSeenEpoch === i) return;
+        n._lastSeenEpoch = i, this._nextDeps.push(n), this._nextVersions.push(n.version), n._tempUnsub ? (this._nextUnsubs.push(n._tempUnsub), n._tempUnsub = void 0) : this._subscribeTo(n);
+      }
+    }, this.execute = () => {
+      if (this.isDisposed || this.isExecuting || !this._shouldExecute()) return;
+      this._checkInfiniteLoop(), this._setExecuting(!0), this._safeCleanup();
+      const n = this._prepareEffectContext();
+      let i = !1;
+      try {
+        const r = V.run(this, this._fn);
+        this._commitEffect(n), i = !0, this._checkLoopWarnings(), Ie(r) ? r.then((o) => {
+          !this.isDisposed && typeof o == "function" && (this._cleanup = o);
+        }).catch((o) => {
+          console.error(z(o, w, b.EFFECT_EXECUTION_FAILED));
+        }) : this._cleanup = typeof r == "function" ? r : null;
+      } catch (r) {
+        i = !0, console.error(z(r, w, b.EFFECT_EXECUTION_FAILED)), this._cleanup = null;
+      } finally {
+        this._cleanupEffect(n, i), this._setExecuting(!1);
+      }
+    }, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._fn = e, this._sync = s.sync ?? !1, this._maxExecutions = s.maxExecutionsPerSecond ?? P.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = s.maxExecutionsPerFlush ?? P.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = s.trackModifications ?? !1, this._cleanup = null, this._dependencies = g, this._dependencyVersions = m, this._unsubscribes = v, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, this._history = x ? [] : null, this._executionCount = 0, U.attachDebugInfo(this, "effect", this.id);
+  }
+  /**
+   * Prepares the execution context by acquiring pools and setting up epoch.
+   * @returns The prepared EffectContext.
+   */
+  _prepareEffectContext() {
+    const e = this._dependencies, s = this._dependencyVersions, n = this._unsubscribes, i = F.acquire(), r = N.acquire(), o = L.acquire(), a = Ce();
+    if (e !== g && n !== v)
+      for (let f = 0; f < e.length; f++) {
+        const l = e[f];
+        l && (l._tempUnsub = n[f]);
+      }
+    return this._nextDeps = i, this._nextVersions = r, this._nextUnsubs = o, this._currentEpoch = a, { prevDeps: e, prevVersions: s, prevUnsubs: n, nextDeps: i, nextVersions: r, nextUnsubs: o };
+  }
+  /**
+   * Commits the tracked dependencies as the current active dependencies.
+   * @param ctx - The current effect context.
+   */
+  _commitEffect(e) {
+    const s = e.nextDeps.length;
+    e.nextDeps.length = s, e.nextVersions.length = s, this._dependencies = e.nextDeps, this._dependencyVersions = e.nextVersions, this._unsubscribes = e.nextUnsubs;
+  }
+  /**
+   * Cleans up the effect execution context, releasing resources back to pools.
+   * @param ctx - The effect context to clean up.
+   * @param committed - Whether the changes were committed to the effect.
+   */
+  _cleanupEffect(e, s) {
+    var n, i;
+    if (this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, s) {
+      if (e.prevDeps !== g) {
+        for (let r = 0; r < e.prevDeps.length; r++) {
+          const o = e.prevDeps[r];
+          o != null && o._tempUnsub && (o._tempUnsub(), o._tempUnsub = void 0);
+        }
+        F.release(e.prevDeps);
+      }
+      e.prevUnsubs !== v && L.release(e.prevUnsubs), e.prevVersions !== m && N.release(e.prevVersions);
+    } else {
+      F.release(e.nextDeps), N.release(e.nextVersions);
+      for (let r = 0; r < e.nextUnsubs.length; r++)
+        (i = (n = e.nextUnsubs)[r]) == null || i.call(n);
+      if (L.release(e.nextUnsubs), e.prevDeps !== g)
+        for (let r = 0; r < e.prevDeps.length; r++) {
+          const o = e.prevDeps[r];
+          o && (o._tempUnsub = void 0);
+        }
+    }
+  }
+  /**
+   * Subscribes to a dependency's changes.
+   * @param dep - The dependency to subscribe to.
+   */
+  _subscribeTo(e) {
+    try {
+      const s = e.subscribe(() => {
+        this._trackModifications && this.isExecuting && (e._modifiedAtEpoch = this._currentEpoch), this._sync ? this.execute() : H.schedule(this.execute);
+      });
+      this._nextUnsubs && this._nextUnsubs.push(s);
+    } catch (s) {
+      console.error(z(s, w, b.EFFECT_EXECUTION_FAILED)), this._nextUnsubs && this._nextUnsubs.push(() => {
+      });
+    }
+  }
+  /**
+   * Whether the effect has been disposed.
+   */
+  get isDisposed() {
+    return (this.flags & Z.DISPOSED) !== 0;
+  }
+  /**
+   * Total number of times this effect has executed.
+   */
+  get executionCount() {
+    return this._executionCount;
+  }
+  /**
+   * Whether the effect is currently executing.
+   */
+  get isExecuting() {
+    return (this.flags & Z.EXECUTING) !== 0;
+  }
+  _setDisposed() {
+    this.flags |= Z.DISPOSED;
+  }
+  _setExecuting(e) {
+    const s = Z.EXECUTING;
+    this.flags = this.flags & ~s | -Number(e) & s;
+  }
+  /**
+   * Executes the cleanup function if it exists.
+   */
+  _safeCleanup() {
+    if (this._cleanup) {
+      try {
+        this._cleanup();
+      } catch (e) {
+        console.error(z(e, w, b.EFFECT_CLEANUP_FAILED));
+      }
+      this._cleanup = null;
+    }
+  }
+  /**
+   * Checks for infinite loops by tracking execution counts within a flush and time period.
+   * @throws {EffectError} If an infinite loop is detected.
+   */
+  _checkInfiniteLoop() {
+    if (this._lastFlushEpoch !== se && (this._lastFlushEpoch = se, this._executionsInEpoch = 0), this._executionsInEpoch++, this._executionsInEpoch > this._maxExecutionsPerFlush && this._throwInfiniteLoopError("per-effect"), Le() > P.MAX_EXECUTIONS_PER_FLUSH && this._throwInfiniteLoopError("global"), this._executionCount++, this._history) {
+      const e = Date.now();
+      this._history.push(e), this._history.length > P.MAX_EXECUTIONS_PER_SECOND + 10 && this._history.shift(), this._checkTimestampLoop(e);
+    }
+  }
+  _checkTimestampLoop(e) {
+    const s = this._history;
+    if (!s || this._maxExecutions <= 0) return;
+    const n = e - we.ONE_SECOND_MS;
+    let i = 0;
+    for (let r = s.length - 1; r >= 0 && !(s[r] < n); r--)
+      i++;
+    if (i > this._maxExecutions) {
+      const r = new w(
+        `Effect executed ${i} times within 1 second. Infinite loop suspected`
+      );
+      if (this.dispose(), console.error(r), x)
+        throw r;
+    }
+  }
+  _throwInfiniteLoopError(e) {
+    const s = new w(
+      `Infinite loop detected (${e}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${he}`
+    );
+    throw this.dispose(), console.error(s), s;
+  }
+  /**
+   * Determines if the effect should execute based on dependency versions.
+   * @returns true if any dependency has changed or if it's the first run.
+   */
+  _shouldExecute() {
+    if (this._dependencies === g || this._dependencyVersions === m)
+      return !0;
+    for (let e = 0; e < this._dependencies.length; e++) {
+      const s = this._dependencies[e];
+      if (s) {
+        if ("value" in s)
+          try {
+            xe(() => s.value);
+          } catch {
+            return !0;
+          }
+        if (s.version !== this._dependencyVersions[e])
+          return !0;
+      }
+    }
+    return !1;
+  }
+  /**
+   * Checks for potential infinite loops where an effect modifies its own dependencies.
+   * Only active if trackModifications is enabled and debug is on.
+   */
+  _checkLoopWarnings() {
+    if (this._trackModifications && U.enabled) {
+      const e = this._dependencies;
+      for (let s = 0; s < e.length; s++) {
+        const n = e[s];
+        n && n._modifiedAtEpoch === this._currentEpoch && U.warn(
+          !0,
+          `Effect is reading a dependency (${U.getDebugName(n) || "unknown"}) that it just modified. Infinite loop may occur`
+        );
+      }
+    }
+  }
+}
+function S(t, e = {}) {
+  if (typeof t != "function")
+    throw new w(b.EFFECT_MUST_BE_FUNCTION);
+  const s = new Xe(t, e);
+  return s.execute(), s;
+}
+function Ge() {
+  if (typeof window < "u") {
+    const t = window.__ATOM_DEBUG__;
+    if (typeof t == "boolean")
+      return t;
+  }
+  try {
+    if (typeof process < "u" && process.env && process.env.NODE_ENV === "development")
+      return !0;
+  } catch {
+  }
+  return !1;
+}
+let M = Ge();
+const u = {
+  get enabled() {
+    return M;
+  },
+  set enabled(t) {
+    M = t;
+  },
+  log(t, ...e) {
+    M && console.log(`[atom-effect-jquery] ${t}:`, ...e);
+  },
+  atomChanged(t, e, s) {
+    M && console.log(
+      `[atom-effect-jquery] Atom "${t || "anonymous"}" changed:`,
+      e,
+      "→",
+      s
+    );
+  },
+  /**
+   * Logs DOM updates and triggers visual highlight.
+   */
+  domUpdated(t, e, s) {
+    if (!M) return;
+    const n = Qe(t);
+    console.log(
+      `[atom-effect-jquery] DOM updated: ${n}.${e} =`,
+      s
+    ), He(t);
+  },
+  cleanup(t) {
+    M && console.log(`[atom-effect-jquery] Cleanup: ${t}`);
+  },
+  warn(...t) {
+    M && console.warn("[atom-effect-jquery]", ...t);
+  }
+};
+function Qe(t) {
+  const e = t[0];
+  if (!e) return "unknown";
+  if (e.id) return `#${e.id}`;
+  if (e.className) {
+    const s = String(e.className).split(" ").filter(Boolean).join(".");
+    return `${e.tagName.toLowerCase()}.${s}`;
+  }
+  return e.tagName.toLowerCase();
+}
+function He(t) {
+  const e = t.css("outline"), s = t.css("transition");
+  t.css({
+    outline: "2px solid #ff4444",
+    "outline-offset": "1px",
+    transition: "outline 0.1s ease-out"
+  }), setTimeout(() => {
+    t.css({
+      outline: e || "",
+      "outline-offset": "",
+      transition: s || ""
+    });
+  }, 200);
+}
+const Ye = /* @__PURE__ */ new WeakMap();
+function Te(t, e = {}) {
+  const s = Be(t, e);
+  return e.name && Ye.set(s, { name: e.name }), s;
+}
+Object.defineProperty(Te, "debug", {
+  get() {
+    return u.enabled;
+  },
+  set(t) {
+    u.enabled = t;
+  }
+});
+function Je() {
+  return new Promise((t) => setTimeout(t, 0));
+}
+c.extend({
+  atom: Te,
+  computed: ze,
+  effect: S,
+  batch: A,
+  untracked: xe,
+  isAtom: ue,
+  isComputed: Ee,
+  isReactive: (t) => ue(t) || Ee(t),
+  nextTick: Je
+});
+function d(t) {
+  return t !== null && typeof t == "object" && "value" in t && "subscribe" in t;
+}
+function p(t) {
+  return d(t) ? t.value : t;
+}
+function le(t) {
+  if (t.id) return `#${t.id}`;
+  if (t.className) {
+    const e = String(t.className).split(/\s+/).filter(Boolean).join(".");
+    return e ? `${t.tagName.toLowerCase()}.${e}` : t.tagName.toLowerCase();
+  }
+  return t.tagName.toLowerCase();
+}
+class We {
+  constructor() {
+    // DOM Element -> Effect Array (for disposal)
+    W(this, "effects", /* @__PURE__ */ new WeakMap());
+    // DOM Element -> Custom Cleanup Function Array
+    W(this, "cleanups", /* @__PURE__ */ new WeakMap());
+    // Track bound elements (Performance optimization)
+    W(this, "boundElements", /* @__PURE__ */ new WeakSet());
+  }
+  /**
+   * Registers an Effect to be disposed later.
+   */
+  trackEffect(e, s) {
+    const n = this.effects.get(e) || [];
+    n.push(s), this.effects.set(e, n), this.boundElements.add(e);
+  }
+  /**
+   * Registers a custom cleanup function (e.g., event listener removal).
+   */
+  trackCleanup(e, s) {
+    const n = this.cleanups.get(e) || [];
+    n.push(s), this.cleanups.set(e, n), this.boundElements.add(e);
+  }
+  /**
+   * Checks if an element has bindings (Fast check).
+   */
+  hasBind(e) {
+    return this.boundElements.has(e);
+  }
+  /**
+   * Cleans up a single element.
+   * - Disposes all Effects (severs connection with Atom).
+   * - Executes all custom cleanups.
+   */
+  cleanup(e) {
+    if (!this.boundElements.has(e)) return;
+    u.cleanup(le(e));
+    const s = this.effects.get(e);
+    s && (this.effects.delete(e), s.forEach((i) => {
+      try {
+        i.dispose();
+      } catch (r) {
+        u.warn("Effect dispose error:", r);
+      }
+    }));
+    const n = this.cleanups.get(e);
+    n && (this.cleanups.delete(e), n.forEach((i) => {
+      try {
+        i();
+      } catch (r) {
+        u.warn("Cleanup error:", r);
+      }
+    })), this.boundElements.delete(e);
+  }
+  /**
+   * Cleans up the element and all its descendants (Recursive).
+   * - Essential for deep removal (empty(), remove(), etc.).
+   */
+  cleanupTree(e) {
+    e.querySelectorAll("*").forEach((n) => {
+      this.boundElements.has(n) && this.cleanup(n);
+    }), this.cleanup(e);
+  }
+}
+const h = new We();
+let $ = null;
+function Ke(t = document.body) {
+  $ || ($ = new MutationObserver((e) => {
+    for (const s of e)
+      s.removedNodes.forEach((n) => {
+        n instanceof Element && h.cleanupTree(n);
+      });
+  }), $.observe(t, { childList: !0, subtree: !0 }));
+}
+function st() {
+  $ == null || $.disconnect(), $ = null;
+}
+c.fn.atomText = function(t, e) {
+  return this.each(function() {
+    const s = c(this);
+    if (d(t)) {
+      const n = S(() => {
+        const i = p(t), r = e ? e(i) : String(i ?? "");
+        s.text(r), u.domUpdated(s, "text", r);
+      });
+      h.trackEffect(this, n);
+    } else {
+      const n = e ? e(t) : String(t ?? "");
+      s.text(n);
+    }
+  });
+};
+c.fn.atomHtml = function(t) {
+  return this.each(function() {
+    const e = c(this);
+    if (d(t)) {
+      const s = S(() => {
+        const n = String(p(t) ?? "");
+        e.html(n), u.domUpdated(e, "html", n);
+      });
+      h.trackEffect(this, s);
+    } else
+      e.html(String(t ?? ""));
+  });
+};
+c.fn.atomClass = function(t, e) {
+  return this.each(function() {
+    const s = c(this);
+    if (d(e)) {
+      const n = S(() => {
+        const i = !!p(e);
+        s.toggleClass(t, i), u.domUpdated(s, `class.${t}`, i);
+      });
+      h.trackEffect(this, n);
+    } else
+      s.toggleClass(t, !!e);
+  });
+};
+c.fn.atomCss = function(t, e, s) {
+  return this.each(function() {
+    const n = c(this);
+    if (d(e)) {
+      const i = S(() => {
+        const r = p(e), o = s ? `${r}${s}` : r;
+        n.css(t, o), u.domUpdated(n, `css.${t}`, o);
+      });
+      h.trackEffect(this, i);
+    } else
+      n.css(t, s ? `${e}${s}` : e);
+  });
+};
+c.fn.atomAttr = function(t, e) {
+  return this.each(function() {
+    const s = c(this), n = (i) => {
+      i == null || i === !1 ? s.removeAttr(t) : i === !0 ? s.attr(t, t) : s.attr(t, String(i)), u.domUpdated(s, `attr.${t}`, i);
+    };
+    if (d(e)) {
+      const i = S(() => n(p(e)));
+      h.trackEffect(this, i);
+    } else
+      n(e);
+  });
+};
+c.fn.atomProp = function(t, e) {
+  return this.each(function() {
+    const s = c(this);
+    if (d(e)) {
+      const n = S(() => {
+        const i = p(e);
+        s.prop(t, i), u.domUpdated(s, `prop.${t}`, i);
+      });
+      h.trackEffect(this, n);
+    } else
+      s.prop(t, e);
+  });
+};
+c.fn.atomShow = function(t) {
+  return this.each(function() {
+    const e = c(this);
+    if (d(t)) {
+      const s = S(() => {
+        const n = !!p(t);
+        e.toggle(n), u.domUpdated(e, "show", n);
+      });
+      h.trackEffect(this, s);
+    } else
+      e.toggle(!!t);
+  });
+};
+c.fn.atomHide = function(t) {
+  return this.each(function() {
+    const e = c(this);
+    if (d(t)) {
+      const s = S(() => {
+        const n = !p(t);
+        e.toggle(n), u.domUpdated(e, "hide", !n);
+      });
+      h.trackEffect(this, s);
+    } else
+      e.toggle(!t);
+  });
+};
+c.fn.atomVal = function(t, e = {}) {
+  const {
+    debounce: s,
+    event: n = "input",
+    parse: i = (o) => o,
+    format: r = (o) => String(o ?? "")
+  } = e;
+  return this.each(function() {
+    const o = c(this);
+    let a = null, f = !1, l = !1, j = !1;
+    const I = () => {
+      l = !0;
+    }, y = () => {
+      l = !1, G();
+    };
+    o.on("compositionstart", I), o.on("compositionend", y);
+    const G = () => {
+      f || j || A(() => {
+        t.value = i(o.val());
+      });
+    }, C = () => {
+      l || j || f || (s ? (a && clearTimeout(a), a = window.setTimeout(G, s)) : G());
+    };
+    o.on(n, C), o.on("change", C);
+    const Y = S(() => {
+      const D = r(t.value);
+      o.val() !== D && (f = !0, j = !0, o.val(D), u.domUpdated(o, "val", D), j = !1, f = !1);
+    });
+    h.trackEffect(this, Y), h.trackCleanup(this, () => {
+      o.off(n, C), o.off("change", C), o.off("compositionstart", I), o.off("compositionend", y), a && clearTimeout(a);
+    });
+  });
+};
+c.fn.atomChecked = function(t) {
+  return this.each(function() {
+    const e = c(this);
+    let s = !1;
+    const n = () => {
+      s || A(() => {
+        t.value = e.prop("checked");
+      });
+    };
+    e.on("change", n), h.trackCleanup(this, () => e.off("change", n));
+    const i = S(() => {
+      s = !0, e.prop("checked", t.value), u.domUpdated(e, "checked", t.value), s = !1;
+    });
+    h.trackEffect(this, i);
+  });
+};
+c.fn.atomOn = function(t, e) {
+  return this.each(function() {
+    const s = c(this), n = function(i) {
+      A(() => e.call(this, i));
+    };
+    s.on(t, n), h.trackCleanup(this, () => s.off(t, n));
+  });
+};
+c.fn.atomUnbind = function() {
+  return this.each(function() {
+    h.cleanupTree(this);
+  });
+};
+c.fn.atomBind = function(t) {
+  return this.each(function() {
+    const e = c(this), s = [];
+    if (t.text !== void 0 && (d(t.text) ? s.push(() => {
+      const n = String(p(t.text) ?? "");
+      e.text(n), u.domUpdated(e, "text", n);
+    }) : e.text(String(t.text ?? ""))), t.html !== void 0 && (d(t.html) ? s.push(() => {
+      const n = String(p(t.html) ?? "");
+      e.html(n), u.domUpdated(e, "html", n);
+    }) : e.html(String(t.html ?? ""))), t.class)
+      for (const [n, i] of Object.entries(t.class))
+        d(i) ? s.push(() => {
+          const r = !!p(i);
+          e.toggleClass(n, r), u.domUpdated(e, `class.${n}`, r);
+        }) : e.toggleClass(n, !!i);
+    if (t.css)
+      for (const [n, i] of Object.entries(t.css))
+        if (Array.isArray(i)) {
+          const [r, o] = i;
+          d(r) ? s.push(() => {
+            const a = `${p(r)}${o}`;
+            e.css(n, a), u.domUpdated(e, `css.${n}`, a);
+          }) : e.css(n, `${r}${o}`);
+        } else d(i) ? s.push(() => {
+          const r = p(i);
+          e.css(n, r), u.domUpdated(e, `css.${n}`, r);
+        }) : e.css(n, i);
+    if (t.attr)
+      for (const [n, i] of Object.entries(t.attr)) {
+        const r = (o) => {
+          o == null || o === !1 ? e.removeAttr(n) : o === !0 ? e.attr(n, n) : e.attr(n, String(o)), u.domUpdated(e, `attr.${n}`, o);
+        };
+        d(i) ? s.push(() => r(p(i))) : r(i);
+      }
+    if (t.prop)
+      for (const [n, i] of Object.entries(t.prop))
+        d(i) ? s.push(() => {
+          const r = p(i);
+          e.prop(n, r), u.domUpdated(e, `prop.${n}`, r);
+        }) : e.prop(n, i);
+    if (t.show !== void 0 && (d(t.show) ? s.push(() => {
+      const n = !!p(t.show);
+      e.toggle(n), u.domUpdated(e, "show", n);
+    }) : e.toggle(!!t.show)), t.hide !== void 0 && (d(t.hide) ? s.push(() => {
+      const n = !p(t.hide);
+      e.toggle(n), u.domUpdated(e, "hide", !n);
+    }) : e.toggle(!t.hide)), t.val !== void 0) {
+      const n = t.val;
+      let i = !1, r = !1;
+      const o = () => {
+        r = !0;
+      }, a = () => {
+        r = !1, i || A(() => {
+          n.value = e.val();
+        });
+      };
+      e.on("compositionstart", o), e.on("compositionend", a);
+      const f = () => {
+        r || i || A(() => {
+          n.value = e.val();
+        });
+      };
+      e.on("input change", f), h.trackCleanup(this, () => {
+        e.off("input change", f), e.off("compositionstart", o), e.off("compositionend", a);
+      }), s.push(() => {
+        const l = String(n.value ?? "");
+        e.val() !== l && (i = !0, e.val(l), u.domUpdated(e, "val", l), i = !1);
+      });
+    }
+    if (t.checked !== void 0) {
+      const n = t.checked;
+      let i = !1;
+      const r = () => {
+        i || A(() => {
+          n.value = e.prop("checked");
+        });
+      };
+      e.on("change", r), h.trackCleanup(this, () => e.off("change", r)), s.push(() => {
+        i = !0, e.prop("checked", n.value), u.domUpdated(e, "checked", n.value), i = !1;
+      });
+    }
+    if (t.on)
+      for (const [n, i] of Object.entries(t.on)) {
+        const r = function(o) {
+          A(() => i.call(this, o));
+        };
+        e.on(n, r), h.trackCleanup(this, () => e.off(n, r));
+      }
+    s.forEach((n) => {
+      const i = S(n);
+      h.trackEffect(this, i);
+    });
+  });
+};
+c.fn.atomList = function(t, e) {
+  return this.each(function() {
+    const s = c(this), n = le(this), { key: i, render: r, bind: o, onAdd: a, onRemove: f, empty: l } = e, j = typeof i == "function" ? i : (C) => C[i], I = /* @__PURE__ */ new Map();
+    let y = null;
+    const G = S(() => {
+      const C = t.value, Y = /* @__PURE__ */ new Set();
+      if (u.log("list", `${n} updating with ${C.length} items`), C.length === 0 && l) {
+        y || (y = c(l), s.append(y));
+        for (const [, E] of I)
+          E.$el.remove(), h.cleanup(E.$el[0]);
+        I.clear();
+        return;
+      } else y && (y.remove(), y = null);
+      let D = null;
+      for (let E = 0; E < C.length; E++) {
+        const R = C[E], k = j(R, E);
+        Y.add(k);
+        const B = I.get(k);
+        if (B) {
+          const J = B.$el[0], T = D ? D[0] : null;
+          (T ? J.previousSibling === T : J === s[0].firstChild) || (D ? D.after(B.$el) : s.prepend(B.$el)), B.item = R, D = B.$el;
+        } else {
+          const J = r(R, E), T = c(J);
+          D ? D.after(T) : s.prepend(T), I.set(k, { $el: T, item: R }), o && o(T, R, E), a && a(T), u.log("list", `${n} added item:`, k), D = T;
+        }
+      }
+      for (const [E, R] of I)
+        if (!Y.has(E)) {
+          const k = () => {
+            R.$el.remove(), h.cleanup(R.$el[0]), I.delete(E), u.log("list", `${n} removed item:`, E);
+          };
+          f ? Promise.resolve(f(R.$el)).then(k) : k();
+        }
+    });
+    h.trackEffect(this, G), h.trackCleanup(this, () => {
+      I.clear(), y == null || y.remove();
+    });
+  });
+};
+const te = /* @__PURE__ */ new WeakMap();
+c.fn.atomMount = function(t, e = {}) {
+  return this.each(function() {
+    const s = c(this), n = le(this), i = te.get(this);
+    i && (u.log("mount", `${n} unmounting existing component`), i()), u.log("mount", `${n} mounting component`);
+    let r;
+    try {
+      r = t(s, e);
+    } catch (f) {
+      console.error("[atom-effect-jquery] Mount error:", f);
+      return;
+    }
+    let o = !1;
+    const a = () => {
+      if (!o) {
+        if (o = !0, u.log("mount", `${n} full cleanup`), typeof r == "function")
+          try {
+            r();
+          } catch {
+          }
+        h.cleanupTree(this), te.delete(this);
+      }
+    };
+    te.set(this, a), h.trackCleanup(this, a);
+  });
+};
+c.fn.atomUnmount = function() {
+  return this.each(function() {
+    var t;
+    (t = te.get(this)) == null || t();
+  });
+};
+const Q = /* @__PURE__ */ new WeakMap();
+let ge = !1;
+function nt() {
+  if (ge) return;
+  ge = !0;
+  const t = c.fn.on, e = c.fn.off;
+  c.fn.on = function(...s) {
+    let n = -1;
+    for (let i = s.length - 1; i >= 0; i--)
+      if (typeof s[i] == "function") {
+        n = i;
+        break;
+      }
+    if (n !== -1) {
+      const i = s[n];
+      let r;
+      Q.has(i) ? r = Q.get(i) : (r = function(...o) {
+        let a;
+        return A(() => {
+          a = i.apply(this, o);
+        }), a;
+      }, Q.set(i, r)), s[n] = r;
+    }
+    return t.apply(this, s);
+  }, c.fn.off = function(...s) {
+    let n = -1;
+    for (let i = s.length - 1; i >= 0; i--)
+      if (typeof s[i] == "function") {
+        n = i;
+        break;
+      }
+    if (n !== -1) {
+      const i = s[n];
+      Q.has(i) && (s[n] = Q.get(i));
+    }
+    return e.apply(this, s);
+  };
+}
+c(() => Ke(document.body));
+export {
+  Be as atom,
+  A as batch,
+  ze as computed,
+  ot as default,
+  st as disableAutoCleanup,
+  S as effect,
+  Ke as enableAutoCleanup,
+  nt as enablejQueryBatching,
+  h as registry,
+  xe as untracked
+};
+//# sourceMappingURL=index.mjs.map