@solidjs/signals 2.0.0-beta.30 → 2.0.0-beta.32

package/dist/prod/core/verdict.js

@@ -32,15 +32,15 @@ let pendingProbe = null;
  * Get or create the pending signal for a node (lazy).
  * Used by isPending() to track pending state reactively.
  */ function getPendingSignal(e) {
-    if (!e.he) {
+    if (!e.Re) {
         // Start false, write true if pending - ensures reversion returns to false
-        e.he = optimisticSignal(false, {
+        e.Re = optimisticSignal(false, {
             ownedWrite: true
         });
-        e.he.nn = e;
-        if (computePendingState(e)) setSignal(e.he, true);
+        e.Re.nn = e;
+        if (computePendingState(e)) setSignal(e.Re, true);
     }
-    return e.he;
+    return e.Re;
 }
 
 function collectPendingSources(e) {
@@ -102,10 +102,10 @@ function collectPendingSources(e) {
 
 function quietPending(e) {
     if (e.oe) {
-        for (const t of e.oe) if (!t.Re) return false;
+        for (const t of e.oe) if (!t.Ue) return false;
         return true;
     }
-    return e.Re;
+    return e.Ue;
 }
 
 function newQuestionInFlight(e) {
@@ -129,27 +129,27 @@ function computePendingState(e) {
         return !!(n.se & REACTIVE_MANUAL_WRITE) || !n.Te && !(n.S & STATUS_PENDING) || !!(n.S & STATUS_PENDING) && quietPending(n);
     }
     if (e.De !== NOT_PENDING && !(t.S & STATUS_UNINITIALIZED)) {
-        if (hasActiveOverride(e)) return !e.be || !e.be(e.De, unwrapOverride(e.Ae));
+        if (hasActiveOverride(e)) return !e.he || !e.he(e.De, unwrapOverride(e.Ae));
         return true;
     }
     return newQuestionInFlight(t);
 }
 
 function syncCompanions(e, t) {
-    if (e.he) updatePendingSignal(e);
+    if (e.Re) updatePendingSignal(e);
     if (e.pe) setSignal(e.pe, t);
 }
 
 function updatePendingSignal(e) {
-    if (e.he) {
-        setSignal(e.he, computePendingState(e));
+    if (e.Re) {
+        setSignal(e.Re, computePendingState(e));
     }
     if (e.pe) updatePendingSignal(e.pe);
 }
 
 function updateChildCompanions(e) {
     for (let t = e.u; t !== null; t = t.fe) {
-        if (t.he || t.pe) updatePendingSignal(t);
+        if (t.Re || t.pe) updatePendingSignal(t);
     }
 }
 
@@ -167,7 +167,7 @@ function updateChildCompanions(e) {
     const visit = e => {
         if (i.has(e)) return;
         i.add(e);
-        if (e.he || e.pe) n(e);
+        if (e.Re || e.pe) n(e);
         for (let t = e.o; t !== null; t = t.ue) visit(t.le);
         for (let t = e.u ?? null; t !== null; t = t.fe) {
             visit(t);
@@ -177,11 +177,11 @@ function updateChildCompanions(e) {
 }
 
 function snapCompanionsToState(e) {
-    const t = e.he;
+    const t = e.Re;
     if (t && (t.Ae === undefined || t.Ae === NOT_PENDING)) {
         const n = computePendingState(e);
-        if (t.Ue !== n || t.De !== NOT_PENDING) {
-            t.Ue = n;
+        if (t.be !== n || t.De !== NOT_PENDING) {
+            t.be = n;
             t.De = NOT_PENDING;
             t.Se = clock;
             insertSubs(t);
@@ -190,7 +190,7 @@ function snapCompanionsToState(e) {
     }
     const n = e.pe;
     if (n && !(n.se & REACTIVE_DISPOSED)) {
-        if ((n.Ae === undefined || n.Ae === NOT_PENDING) && n.De === NOT_PENDING && !Object.is(n.Ue, e.Ue) && !(n.se & (REACTIVE_DIRTY | REACTIVE_CHECK))) {
+        if ((n.Ae === undefined || n.Ae === NOT_PENDING) && n.De === NOT_PENDING && !Object.is(n.be, e.be) && !(n.se & (REACTIVE_DIRTY | REACTIVE_CHECK))) {
             n.se |= REACTIVE_DIRTY;
             insertIntoHeap(n, queueFor(n));
             insertSubs(n);
@@ -223,7 +223,7 @@ function getLatestValueComputed(e) {
     const t = getLatestValueComputed(e);
     const n = latestReadActive;
     setLatestReadActive(false);
-    const i = e.Ae !== undefined && e.Ae !== NOT_PENDING ? unwrapOverride(e.Ae) : e.Ue;
+    const i = e.Ae !== undefined && e.Ae !== NOT_PENDING ? unwrapOverride(e.Ae) : e.be;
     let r;
     try {
         // An untracked latest() read has no reading context, so read() never
@@ -279,9 +279,9 @@ function recordFreshRead(e, t) {
 
 function applyReask(e, t) {
     const n = !!(e.S & STATUS_PENDING);
-    const i = t && !(n && !e.Re);
-    const r = n && e.Re !== i;
-    e.Re = i;
+    const i = t && !(n && !e.Ue);
+    const r = n && e.Ue !== i;
+    e.Ue = i;
     return r;
 }
 

package/dist/prod/store/optimistic.js

@@ -33,8 +33,8 @@ function createOptimisticStore(e, t, r) {
         // clobbering instead of composing). Optimistic state clears when truth
         // lands or its transaction ends — never mid-refetch. Wrapped here (engine
         // is already installed above) so store-free apps never carry the check.
-                const e = GlobalQueue.dn;
-        GlobalQueue.dn = t => {
+                const e = GlobalQueue.Tn;
+        GlobalQueue.Tn = t => {
             for (const e of t.cn) {
                 if ((e[$TARGET]?.[STORE_FIREWALL]?.S ?? 0) & STATUS_PENDING) return true;
             }
@@ -121,8 +121,8 @@ function clearOptimisticStores(e, t) {
                 T.Ae = NOT_PENDING;
                 T.sn = null;
                 T.De = NOT_PENDING;
-                T.Ue = o;
-                if (!T.be || !T.be(n, o)) {
+                T.be = o;
+                if (!T.he || !T.he(n, o)) {
                     insertSubs(T, true);
                     schedule();
                 }

package/dist/prod/store/store.js

@@ -291,7 +291,7 @@ function ownEnumerableKeysPlain(e) {
  * The value a store leaf's backing signal currently shows to readers: active
  * override, else held pending value, else committed value.
  */ function visibleNodeValue(e) {
-    return e.Ae !== undefined && e.Ae !== NOT_PENDING ? unwrapOverride(e.Ae) : e.De !== NOT_PENDING ? e.De : e.Ue;
+    return e.Ae !== undefined && e.Ae !== NOT_PENDING ? unwrapOverride(e.Ae) : e.De !== NOT_PENDING ? e.De : e.be;
 }
 
 function hasOwnStoreProperty(e, t) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@solidjs/signals",
-  "version": "2.0.0-beta.30",
+  "version": "2.0.0-beta.32",
   "description": "Solid's reactive primitives: signals, memos, effects, stores, and async-aware computations.",
   "author": "Ryan Carniato",
   "license": "MIT",