atom-effect-jquery 0.3.0 → 0.4.0

package/dist/index.mjs

@@ -3,12 +3,12 @@ import { default as ht } from "jquery";
 const Le = {
   /** One second in milliseconds */
   ONE_SECOND_MS: 1e3
-}, W = {
+}, K = {
   IDLE: "idle",
   PENDING: "pending",
   RESOLVED: "resolved",
   REJECTED: "rejected"
-}, J = {
+}, W = {
   DISPOSED: 1,
   // 0001 - Effect has been disposed
   EXECUTING: 2
@@ -389,15 +389,15 @@ class qe {
     this.maxFlushIterations = e;
   }
 }
-const K = new qe();
+const J = new qe();
 function w(t) {
   if (typeof t != "function")
     throw new F("Batch callback must be a function");
-  K.startBatch();
+  J.startBatch();
   try {
     return t();
   } finally {
-    K.endBatch();
+    J.endBatch();
   }
 }
 const q = {
@@ -502,10 +502,10 @@ function ze(t) {
 function Ne(t) {
   return (typeof t == "object" || typeof t == "function") && t !== null && typeof t.addDependency == "function";
 }
-function Ue(t) {
+function Te(t) {
   return typeof t == "function" && typeof t.addDependency != "function";
 }
-function Re(t) {
+function Ue(t) {
   return ze(t) && typeof t.execute == "function";
 }
 class Xe extends Ie {
@@ -541,14 +541,14 @@ class Xe extends Ie {
       e.addDependency(this);
       return;
     }
-    if (Ue(e)) {
+    if (Te(e)) {
       this._functionSubscribersStore.add(e);
       return;
     }
-    Re(e) && this._objectSubscribersStore.add(e);
+    Ue(e) && this._objectSubscribersStore.add(e);
   }
   _scheduleNotification(e) {
-    this._isNotificationScheduled || (this._pendingOldValue = e, this._isNotificationScheduled = !0), this._sync && !K.isBatching ? this._flushNotifications() : K.schedule(this._notifyTask);
+    this._isNotificationScheduled || (this._pendingOldValue = e, this._isNotificationScheduled = !0), this._sync && !J.isBatching ? this._flushNotifications() : J.schedule(this._notifyTask);
   }
   _flushNotifications() {
     if (!this._isNotificationScheduled) return;
@@ -623,9 +623,9 @@ class ae {
     this.pool.length = 0, v && this.stats && (this.stats.acquired = 0, this.stats.released = 0, this.stats.rejected = { frozen: 0, tooLarge: 0, poolFull: 0 });
   }
 }
-const y = Object.freeze([]), R = Object.freeze([]), D = Object.freeze([]), P = new ae(), B = new ae(), T = new ae();
+const y = Object.freeze([]), U = Object.freeze([]), D = Object.freeze([]), P = new ae(), B = new ae(), R = new ae();
 function Qe(t, e, n, s) {
-  if (e !== y && n !== R)
+  if (e !== y && n !== U)
     for (let r = 0; r < e.length; r++) {
       const o = e[r];
       o && (o._tempUnsub = n[r]);
@@ -641,7 +641,7 @@ function Qe(t, e, n, s) {
       const o = e[r];
       o?._tempUnsub && (o._tempUnsub(), o._tempUnsub = void 0);
     }
-  return n !== R && B.release(n), i;
+  return n !== U && B.release(n), i;
 }
 function G(t, e, n) {
   if (t instanceof TypeError)
@@ -653,11 +653,11 @@ function G(t, e, n) {
   const s = t instanceof Error ? t.message : String(t), i = t instanceof Error ? t : null;
   return new e(`Unexpected error (${n}): ${s}`, i);
 }
-class Te extends Ie {
+class Re extends Ie {
   constructor(e, n = {}) {
     if (typeof e != "function")
       throw new X(E.COMPUTED_MUST_BE_FUNCTION);
-    if (super(), this._value = void 0, this.flags = p.DIRTY | p.IDLE, this._error = null, this._promiseId = 0, this._equal = n.equal ?? Object.is, this._fn = e, this._defaultValue = "defaultValue" in n ? n.defaultValue : pe, this._hasDefaultValue = this._defaultValue !== pe, this._onError = n.onError ?? null, this.MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1, this._functionSubscribersStore = new ne(), this._objectSubscribersStore = new ne(), this._dependencies = y, this._dependencyVersions = D, this._unsubscribes = R, this._notifyJob = () => {
+    if (super(), this._value = void 0, this.flags = p.DIRTY | p.IDLE, this._error = null, this._promiseId = 0, this._equal = n.equal ?? Object.is, this._fn = e, this._defaultValue = "defaultValue" in n ? n.defaultValue : pe, this._hasDefaultValue = this._defaultValue !== pe, this._onError = n.onError ?? null, this.MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1, this._functionSubscribersStore = new ne(), this._objectSubscribersStore = new ne(), this._dependencies = y, this._dependencyVersions = D, this._unsubscribes = U, this._notifyJob = () => {
       this._functionSubscribersStore.forEachSafe(
         (s) => s(),
         (s) => console.error(s)
@@ -692,32 +692,32 @@ class Te extends Ie {
     return this._value;
   }
   get state() {
-    return this._getAsyncState();
+    return this._registerTracking(), this._getAsyncState();
   }
   get hasError() {
-    return this._isRejected();
+    return this._registerTracking(), this._isRejected();
   }
   get lastError() {
-    return this._error;
+    return this._registerTracking(), this._error;
   }
   get isPending() {
-    return this._isPending();
+    return this._registerTracking(), this._isPending();
   }
   get isResolved() {
-    return this._isResolved();
+    return this._registerTracking(), this._isResolved();
   }
   invalidate() {
-    this._markDirty(), this._dependencyVersions !== D && (T.release(this._dependencyVersions), this._dependencyVersions = D);
+    this._markDirty(), this._dependencyVersions !== D && (R.release(this._dependencyVersions), this._dependencyVersions = D);
   }
   dispose() {
-    if (this._unsubscribes !== R) {
+    if (this._unsubscribes !== U) {
       for (let e = 0; e < this._unsubscribes.length; e++) {
         const n = this._unsubscribes[e];
         n && n();
       }
-      B.release(this._unsubscribes), this._unsubscribes = R;
+      B.release(this._unsubscribes), this._unsubscribes = U;
     }
-    this._dependencies !== y && (P.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== D && (T.release(this._dependencyVersions), this._dependencyVersions = D), this._functionSubscribersStore.clear(), this._objectSubscribersStore.clear(), this.flags = p.DIRTY | p.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % this.MAX_PROMISE_ID;
+    this._dependencies !== y && (P.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== D && (R.release(this._dependencyVersions), this._dependencyVersions = D), this._functionSubscribersStore.clear(), this._objectSubscribersStore.clear(), this.flags = p.DIRTY | p.IDLE, this._error = null, this._value = void 0, this._promiseId = (this._promiseId + 1) % this.MAX_PROMISE_ID;
   }
   // State flag operations
   _isDirty() {
@@ -761,7 +761,7 @@ class Te extends Ie {
     this.flags = this.flags & ~n | -Number(e) & n;
   }
   _getAsyncState() {
-    return this._isResolved() ? W.RESOLVED : this._isPending() ? W.PENDING : this._isRejected() ? W.REJECTED : W.IDLE;
+    return this._isResolved() ? K.RESOLVED : this._isPending() ? K.PENDING : this._isRejected() ? K.REJECTED : K.IDLE;
   }
   _getFlagsAsString() {
     const e = [];
@@ -785,7 +785,7 @@ class Te extends Ie {
     }
   }
   _prepareComputationContext() {
-    const e = this._dependencies, n = this._dependencyVersions, s = P.acquire(), i = T.acquire(), r = xe(), o = { depCount: 0 }, u = (f) => {
+    const e = this._dependencies, n = this._dependencyVersions, s = P.acquire(), i = R.acquire(), r = xe(), o = { depCount: 0 }, u = (f) => {
       f._lastSeenEpoch !== r && (f._lastSeenEpoch = r, o.depCount < s.length ? (s[o.depCount] = f, i[o.depCount] = f.version) : (s.push(f), i.push(f.version)), o.depCount++);
     }, l = this._trackable.addDependency;
     return this._trackable.addDependency = u, { prevDeps: e, prevVersions: n, nextDeps: s, nextVersions: i, originalAdd: l, state: o };
@@ -795,7 +795,7 @@ class Te extends Ie {
     n.length = i.depCount, s.length = i.depCount, this._unsubscribes = Qe(n, r, this._unsubscribes, this), this._dependencies = n, this._dependencyVersions = s;
   }
   _cleanupContext(e, n) {
-    this._trackable.addDependency = e.originalAdd, n ? (e.prevDeps !== y && P.release(e.prevDeps), e.prevVersions !== D && T.release(e.prevVersions)) : (P.release(e.nextDeps), T.release(e.nextVersions));
+    this._trackable.addDependency = e.originalAdd, n ? (e.prevDeps !== y && P.release(e.prevDeps), e.prevVersions !== D && R.release(e.prevVersions)) : (P.release(e.nextDeps), R.release(e.nextVersions));
   }
   _handleSyncResult(e) {
     (!this._isResolved() || !this._equal(this._value, e)) && (this.version = this.version + 1 & Q), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1);
@@ -810,7 +810,7 @@ class Te extends Ie {
     });
   }
   _handleAsyncResolution(e) {
-    (!this._isResolved() || !this._equal(this._value, e)) && (this.version = this.version + 1 & Q), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1);
+    (!this._isResolved() || !this._equal(this._value, e)) && (this.version = this.version + 1 & Q), this._value = e, this._clearDirty(), this._setResolved(), this._error = null, this._setRecomputing(!1), this._notifyJob();
   }
   _handleAsyncRejection(e) {
     const n = G(e, X, E.COMPUTED_ASYNC_COMPUTATION_FAILED);
@@ -856,17 +856,17 @@ class Te extends Ie {
         e.addDependency(this);
         return;
       }
-      if (Ue(e)) {
+      if (Te(e)) {
         this._functionSubscribersStore.add(e);
         return;
       }
-      Re(e) && this._objectSubscribersStore.add(e);
+      Ue(e) && this._objectSubscribersStore.add(e);
     }
   }
 }
-Object.freeze(Te.prototype);
+Object.freeze(Re.prototype);
 function He(t, e = {}) {
-  return new Te(t, e);
+  return new Re(t, e);
 }
 class Ye extends De {
   /**
@@ -878,17 +878,17 @@ class Ye extends De {
     super(), this.run = () => {
       if (this.isDisposed)
         throw new L(E.EFFECT_MUST_BE_FUNCTION);
-      this._dependencyVersions !== D && (T.release(this._dependencyVersions), this._dependencyVersions = D), this.execute();
+      this._dependencyVersions !== D && (R.release(this._dependencyVersions), this._dependencyVersions = D), this.execute();
     }, this.dispose = () => {
       if (!this.isDisposed) {
-        if (this._setDisposed(), this._safeCleanup(), this._unsubscribes !== R) {
+        if (this._setDisposed(), this._safeCleanup(), this._unsubscribes !== U) {
           for (let s = 0; s < this._unsubscribes.length; s++) {
             const i = this._unsubscribes[s];
             i && i();
           }
-          B.release(this._unsubscribes), this._unsubscribes = R;
+          B.release(this._unsubscribes), this._unsubscribes = U;
         }
-        this._dependencies !== y && (P.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== D && (T.release(this._dependencyVersions), this._dependencyVersions = D);
+        this._dependencies !== y && (P.release(this._dependencies), this._dependencies = y), this._dependencyVersions !== D && (R.release(this._dependencyVersions), this._dependencyVersions = D);
       }
     }, this.addDependency = (s) => {
       if (this.isExecuting && this._nextDeps && this._nextUnsubs && this._nextVersions) {
@@ -913,15 +913,15 @@ class Ye extends De {
       } finally {
         this._cleanupEffect(s, i), this._setExecuting(!1);
       }
-    }, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._fn = e, this._sync = n.sync ?? !1, this._maxExecutions = n.maxExecutionsPerSecond ?? $.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = n.maxExecutionsPerFlush ?? $.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = n.trackModifications ?? !1, this._cleanup = null, this._dependencies = y, this._dependencyVersions = D, this._unsubscribes = R, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, this._history = v ? [] : null, this._executionCount = 0, O.attachDebugInfo(this, "effect", this.id);
+    }, this._currentEpoch = -1, this._lastFlushEpoch = -1, this._executionsInEpoch = 0, this._fn = e, this._sync = n.sync ?? !1, this._maxExecutions = n.maxExecutionsPerSecond ?? $.MAX_EXECUTIONS_PER_SECOND, this._maxExecutionsPerFlush = n.maxExecutionsPerFlush ?? $.MAX_EXECUTIONS_PER_EFFECT, this._trackModifications = n.trackModifications ?? !1, this._cleanup = null, this._dependencies = y, this._dependencyVersions = D, this._unsubscribes = U, this._nextDeps = null, this._nextVersions = null, this._nextUnsubs = null, this._history = v ? [] : null, this._executionCount = 0, O.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, n = this._dependencyVersions, s = this._unsubscribes, i = P.acquire(), r = T.acquire(), o = B.acquire(), u = xe();
-    if (e !== y && s !== R)
+    const e = this._dependencies, n = this._dependencyVersions, s = this._unsubscribes, i = P.acquire(), r = R.acquire(), o = B.acquire(), u = xe();
+    if (e !== y && s !== U)
       for (let l = 0; l < e.length; l++) {
         const f = e[l];
         f && (f._tempUnsub = s[l]);
@@ -950,9 +950,9 @@ class Ye extends De {
         }
         P.release(e.prevDeps);
       }
-      e.prevUnsubs !== R && B.release(e.prevUnsubs), e.prevVersions !== D && T.release(e.prevVersions);
+      e.prevUnsubs !== U && B.release(e.prevUnsubs), e.prevVersions !== D && R.release(e.prevVersions);
     } else {
-      P.release(e.nextDeps), T.release(e.nextVersions);
+      P.release(e.nextDeps), R.release(e.nextVersions);
       for (let s = 0; s < e.nextUnsubs.length; s++)
         e.nextUnsubs[s]?.();
       if (B.release(e.nextUnsubs), e.prevDeps !== y)
@@ -969,7 +969,7 @@ class Ye extends De {
   _subscribeTo(e) {
     try {
       const n = e.subscribe(() => {
-        this._trackModifications && this.isExecuting && (e._modifiedAtEpoch = this._currentEpoch), this._sync ? this.execute() : K.schedule(this.execute);
+        this._trackModifications && this.isExecuting && (e._modifiedAtEpoch = this._currentEpoch), this._sync ? this.execute() : J.schedule(this.execute);
       });
       this._nextUnsubs && this._nextUnsubs.push(n);
     } catch (n) {
@@ -981,7 +981,7 @@ class Ye extends De {
    * Whether the effect has been disposed.
    */
   get isDisposed() {
-    return (this.flags & J.DISPOSED) !== 0;
+    return (this.flags & W.DISPOSED) !== 0;
   }
   /**
    * Total number of times this effect has executed.
@@ -993,13 +993,13 @@ class Ye extends De {
    * Whether the effect is currently executing.
    */
   get isExecuting() {
-    return (this.flags & J.EXECUTING) !== 0;
+    return (this.flags & W.EXECUTING) !== 0;
   }
   _setDisposed() {
-    this.flags |= J.DISPOSED;
+    this.flags |= W.DISPOSED;
   }
   _setExecuting(e) {
-    const n = J.EXECUTING;
+    const n = W.EXECUTING;
     this.flags = this.flags & ~n | -Number(e) & n;
   }
   /**
@@ -1091,7 +1091,7 @@ function I(t, e = {}) {
   const n = new Ye(t, e);
   return n.execute(), n;
 }
-function Ke() {
+function Je() {
   if (typeof window < "u") {
     const t = window.__ATOM_DEBUG__;
     if (typeof t == "boolean")
@@ -1104,7 +1104,7 @@ function Ke() {
   }
   return !1;
 }
-let V = Ke();
+let V = Je();
 const h = {
   get enabled() {
     return V;
@@ -1128,11 +1128,11 @@ const h = {
    */
   domUpdated(t, e, n) {
     if (!V) return;
-    const s = We(t);
+    const s = Ke(t);
     console.log(
       `[atom-effect-jquery] DOM updated: ${s}.${e} =`,
       n
-    ), Je(t);
+    ), We(t);
   },
   cleanup(t) {
     V && console.log(`[atom-effect-jquery] Cleanup: ${t}`);
@@ -1141,7 +1141,7 @@ const h = {
     V && console.warn("[atom-effect-jquery]", ...t);
   }
 };
-function We(t) {
+function Ke(t) {
   const e = t[0];
   if (!e) return "unknown";
   if (e.id) return `#${e.id}`;
@@ -1151,7 +1151,7 @@ function We(t) {
   }
   return e.tagName.toLowerCase();
 }
-function Je(t) {
+function We(t) {
   const e = t[0];
   if (!e || !document.contains(e)) return;
   const n = "atom_debug_timer", s = "atom_debug_cleanup_timer", i = "atom_debug_org_style";
@@ -1618,7 +1618,7 @@ c.fn.atomList = function(t, e) {
       const ie = /* @__PURE__ */ new Map();
       j.forEach((d, S) => ie.set(d, S));
       const we = k.map((d) => ie.has(d) ? ie.get(d) : -1), Fe = nt(we), ke = new Set(Fe);
-      let U = null;
+      let T = null;
       for (let d = N.length - 1; d >= 0; d--) {
         const S = k[d], M = N[d], Me = ke.has(d);
         if (m.has(S)) {
@@ -1626,15 +1626,15 @@ c.fn.atomList = function(t, e) {
           C.item = M;
           const A = C.$el[0];
           if (e.update && e.update(C.$el, M, d), !Me)
-            U ? C.$el.insertBefore(U) : C.$el.appendTo(n);
+            T ? C.$el.insertBefore(T) : C.$el.appendTo(n);
           else {
             const de = A.nextSibling;
-            U && de !== U ? C.$el.insertBefore(U) : !U && de && C.$el.appendTo(n);
+            T && de !== T ? C.$el.insertBefore(T) : !T && de && C.$el.appendTo(n);
           }
-          U = A;
+          T = A;
         } else {
           const C = r(M, d), A = C instanceof Element ? c(C) : c(C);
-          m.set(S, { $el: A, item: M }), U ? A.insertBefore(U) : A.appendTo(n), o && o(A, M, d), u && u(A), h.log("list", `${s} added item:`, S), U = A[0];
+          m.set(S, { $el: A, item: M }), T ? A.insertBefore(T) : A.appendTo(n), o && o(A, M, d), u && u(A), h.log("list", `${s} added item:`, S), T = A[0];
         }
       }
       j = k;