@solidjs/signals 0.13.8 → 0.13.9

package/dist/dev.js

@@ -1361,7 +1361,7 @@ function updateIfNecessary(el) {
   ) {
     recompute(el);
   }
-  el._flags = REACTIVE_NONE | (el._flags & REACTIVE_SNAPSHOT_STALE);
+  el._flags = el._flags & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
 }
 function computed(fn, initialValue, options) {
   const transparent = options?.transparent ?? false;
@@ -1606,7 +1606,7 @@ function read(el) {
   }
   if (el._fn && el._statusFlags & STATUS_ERROR) {
     if (el._time < clock) {
-      recompute(el, true);
+      recompute(el);
       return read(el);
     } else throw el._error;
   }

package/dist/node.cjs

@@ -1264,23 +1264,23 @@ function recompute(t, n = false) {
   (!n || t.ge & a) && !t.K && !(k && u) && A.se.push(t);
   t.K && i && k !== t.K && runInTransition(t.K, () => recompute(t));
 }
-function updateIfNecessary(r) {
-  if (r.m & t) {
-    for (let e = r.A; e; e = e.N) {
-      const t = e.L;
-      const i = t.I || t;
+function updateIfNecessary(e) {
+  if (e.m & t) {
+    for (let t = e.A; t; t = t.N) {
+      const r = t.L;
+      const i = r.I || r;
       if (i.R) {
         updateIfNecessary(i);
       }
-      if (r.m & n) {
+      if (e.m & n) {
         break;
       }
     }
   }
-  if (r.m & (n | f) || (r.ae && r.de < E && !r.Ee)) {
-    recompute(r);
+  if (e.m & (n | f) || (e.ae && e.de < E && !e.Ee)) {
+    recompute(e);
   }
-  r.m = e | (r.m & c);
+  e.m = e.m & (c | i | s);
 }
 function computed(t, n, r) {
   const i = r?.transparent ?? false;
@@ -1485,7 +1485,7 @@ function read(e) {
   }
   if (e.R && e.ge & d) {
     if (e.de < E) {
-      recompute(e, true);
+      recompute(e);
       return read(e);
     } else throw e.ae;
   }

package/dist/prod.js

@@ -424,9 +424,9 @@ class GlobalQueue extends Queue {
 }
 function insertSubs(e, t = false) {
   const n = e.q || currentOptimisticLane;
-  const i = e.de !== undefined;
+  const i = e.Te !== undefined;
   for (let r = e.I; r !== null; r = r.p) {
-    if (i && r.h.Te) {
+    if (i && r.h.de) {
       r.h.O |= REACTIVE_SNAPSHOT_STALE;
       continue;
     }
@@ -1143,7 +1143,7 @@ function releaseSubtree(e) {
     }
     if (t.L) {
       const e = t;
-      e.Te = false;
+      e.de = false;
       if (e.O & REACTIVE_SNAPSHOT_STALE) {
         e.O &= ~REACTIVE_SNAPSHOT_STALE;
         e.O |= REACTIVE_DIRTY;
@@ -1158,7 +1158,7 @@ function releaseSubtree(e) {
 function clearSnapshots() {
   if (snapshotSources) {
     for (const e of snapshotSources) {
-      delete e.de;
+      delete e.Te;
       delete e[STORE_SNAPSHOT_PROPS];
     }
     snapshotSources = null;
@@ -1280,7 +1280,7 @@ function updateIfNecessary(e) {
   if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.le && e.Ee < clock && !e.Ce)) {
     recompute(e);
   }
-  e.O = REACTIVE_NONE | (e.O & REACTIVE_SNAPSHOT_STALE);
+  e.O = e.O & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
 }
 function computed(e, t, n) {
   const i = n?.transparent ?? false;
@@ -1328,7 +1328,7 @@ function computed(e, t, n) {
     }
   }
   if (s) r.o = s.o + 1;
-  if (snapshotCaptureActive && ownerInSnapshotScope(context)) r.Te = true;
+  if (snapshotCaptureActive && ownerInSnapshotScope(context)) r.de = true;
   if (externalSourceConfig) {
     const e = signal(undefined, { equals: false, pureWrite: true });
     const t = externalSourceConfig.factory(r.L, () => {
@@ -1343,7 +1343,7 @@ function computed(e, t, n) {
   !n?.lazy && recompute(r, true);
   if (snapshotCaptureActive && !n?.lazy) {
     if (!(r.Se & STATUS_PENDING)) {
-      r.de = r.J === undefined ? NO_SNAPSHOT : r.J;
+      r.Te = r.J === undefined ? NO_SNAPSHOT : r.J;
       snapshotSources.add(r);
     }
   }
@@ -1365,7 +1365,7 @@ function signal(e, t, n = null) {
   };
   n && (n.A = i);
   if (snapshotCaptureActive && !i.He && !((n?.Se ?? 0) & STATUS_PENDING)) {
-    i.de = e === undefined ? NO_SNAPSHOT : e;
+    i.Te = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
   return i;
@@ -1485,12 +1485,12 @@ function read(e) {
   }
   if (e.L && e.Se & STATUS_ERROR) {
     if (e.Ee < clock) {
-      recompute(e, true);
+      recompute(e);
       return read(e);
     } else throw e.le;
   }
-  if (snapshotCaptureActive && t && t.Te) {
-    const n = e.de;
+  if (snapshotCaptureActive && t && t.de) {
+    const n = e.Te;
     if (n !== undefined) {
       const i = n === NO_SNAPSHOT ? undefined : n;
       const r = e.X !== NOT_PENDING ? e.X : e.J;
@@ -1947,28 +1947,28 @@ function applyState(e, t, n) {
     let t = false;
     const c = getOverrideValue(r, s, u, "length", o);
     if (e.length && c && e[0] && n(e[0]) != null) {
-      let a, f, l, E, d, T, S, R;
+      let a, f, l, E, T, d, S, R;
       for (
         l = 0, E = Math.min(c, e.length);
         l < E &&
-        ((T = getOverrideValue(r, s, u, l, o)) === e[l] || (T && e[l] && n(T) === n(e[l])));
+        ((d = getOverrideValue(r, s, u, l, o)) === e[l] || (d && e[l] && n(d) === n(e[l])));
         l++
       ) {
-        applyState(e[l], wrap(T, i), n);
+        applyState(e[l], wrap(d, i), n);
       }
       const O = new Array(e.length),
         _ = new Map();
       for (
-        E = c - 1, d = e.length - 1;
+        E = c - 1, T = e.length - 1;
         E >= l &&
-        d >= l &&
-        ((T = getOverrideValue(r, s, u, E, o)) === e[d] || (T && e[d] && n(T) === n(e[d])));
-        E--, d--
+        T >= l &&
+        ((d = getOverrideValue(r, s, u, E, o)) === e[T] || (d && e[T] && n(d) === n(e[T])));
+        E--, T--
       ) {
-        O[d] = T;
+        O[T] = d;
       }
-      if (l > d || l > E) {
-        for (f = l; f <= d; f++) {
+      if (l > T || l > E) {
+        for (f = l; f <= T; f++) {
           t = true;
           i[STORE_NODE][f] && setSignal(i[STORE_NODE][f], wrap(e[f], i));
         }
@@ -1982,20 +1982,20 @@ function applyState(e, t, n) {
         c !== e.length && i[STORE_NODE].length && setSignal(i[STORE_NODE].length, e.length);
         return;
       }
-      S = new Array(d + 1);
-      for (f = d; f >= l; f--) {
-        T = e[f];
-        R = T ? n(T) : T;
+      S = new Array(T + 1);
+      for (f = T; f >= l; f--) {
+        d = e[f];
+        R = d ? n(d) : d;
         a = _.get(R);
         S[f] = a === undefined ? -1 : a;
         _.set(R, f);
       }
       for (a = l; a <= E; a++) {
-        T = getOverrideValue(r, s, u, a, o);
-        R = T ? n(T) : T;
+        d = getOverrideValue(r, s, u, a, o);
+        R = d ? n(d) : d;
         f = _.get(R);
         if (f !== undefined && f !== -1) {
-          O[f] = T;
+          O[f] = d;
           f = S[f];
           _.set(R, f);
         }
@@ -2030,12 +2030,12 @@ function applyState(e, t, n) {
       const f = c[a];
       const l = u[f];
       const E = unwrap(getOverrideValue(r, s, u, f, o));
-      let d = unwrap(e[f]);
-      if (E === d) continue;
-      if (!E || !isWrappable(E) || !isWrappable(d) || (n(E) != null && n(E) !== n(d))) {
+      let T = unwrap(e[f]);
+      if (E === T) continue;
+      if (!E || !isWrappable(E) || !isWrappable(T) || (n(E) != null && n(E) !== n(T))) {
         t && setSignal(t, void 0);
-        l && setSignal(l, isWrappable(d) ? wrap(d, i) : d);
-      } else applyState(d, wrap(E, i), n);
+        l && setSignal(l, isWrappable(T) ? wrap(T, i) : T);
+      } else applyState(T, wrap(E, i), n);
     }
   }
   if ((u = i[STORE_HAS])) {
@@ -2219,7 +2219,7 @@ function getNode(e, t, n, i, r = isEqual, s, o) {
   }
   if (o && t in o) {
     const e = o[t];
-    u.de = e === undefined ? NO_SNAPSHOT : e;
+    u.Te = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources?.add(u);
   }
   return (e[t] = u);
@@ -2374,20 +2374,20 @@ const storeTraps = {
             : e[STORE_OVERRIDE] && "length" in e[STORE_OVERRIDE]
               ? e[STORE_OVERRIDE].length
               : r.length);
-        const d = f && l > E ? l : undefined;
-        if (c === a && d === undefined) return true;
-        if (a !== undefined && a === s && d === undefined) delete e[u]?.[t];
+        const T = f && l > E ? l : undefined;
+        if (c === a && T === undefined) return true;
+        if (a !== undefined && a === s && T === undefined) delete e[u]?.[t];
         else {
           const n = e[u] || (e[u] = Object.create(null));
           n[t] = a;
-          if (d !== undefined) n.length = d;
+          if (T !== undefined) n.length = T;
         }
-        const T = isWrappable(a);
+        const d = isWrappable(a);
         e[STORE_HAS]?.[t] && setSignal(e[STORE_HAS][t], true);
         const S = getNodes(e, STORE_NODE);
-        S[t] && setSignal(S[t], () => (T ? wrap(a, e) : a));
+        S[t] && setSignal(S[t], () => (d ? wrap(a, e) : a));
         if (Array.isArray(r)) {
-          const e = t === "length" ? a : d;
+          const e = t === "length" ? a : T;
           e !== undefined && S.length && setSignal(S.length, e);
         }
         S[$TRACK] && setSignal(S[$TRACK], undefined);
@@ -2894,8 +2894,8 @@ function updateKeyedMap() {
         f,
         l,
         E = new Array(t),
-        d = new Array(t),
-        T = this.tt ? new Array(t) : undefined,
+        T = new Array(t),
+        d = this.tt ? new Array(t) : undefined,
         S = this.nt ? new Array(t) : undefined;
       for (
         s = 0, o = Math.min(this.Ze, t);
@@ -2912,8 +2912,8 @@ function updateKeyedMap() {
         o--, u--
       ) {
         E[u] = this.Xe[o];
-        d[u] = this.Je[o];
-        T && (T[u] = this.tt[o]);
+        T[u] = this.Je[o];
+        d && (d[u] = this.tt[o]);
         S && (S[u] = this.nt[o]);
       }
       f = new Map();
@@ -2931,8 +2931,8 @@ function updateKeyedMap() {
         i = f.get(a);
         if (i !== undefined && i !== -1) {
           E[i] = this.Xe[n];
-          d[i] = this.Je[n];
-          T && (T[i] = this.tt[n]);
+          T[i] = this.Je[n];
+          d && (d[i] = this.tt[n]);
           S && (S[i] = this.nt[n]);
           i = l[i];
           f.set(a, i);
@@ -2941,9 +2941,9 @@ function updateKeyedMap() {
       for (i = s; i < t; i++) {
         if (i in E) {
           this.Xe[i] = E[i];
-          this.Je[i] = d[i];
-          if (T) {
-            this.tt[i] = T[i];
+          this.Je[i] = T[i];
+          if (d) {
+            this.tt[i] = d[i];
             setSignal(this.tt[i], e[i]);
           }
           if (S) {
@@ -3052,8 +3052,8 @@ class CollectionQueue extends Queue {
   ft = new Set();
   lt = signal(false, { pureWrite: true, He: true });
   Et = false;
-  dt;
-  Tt = ON_INIT;
+  Tt;
+  dt = ON_INIT;
   constructor(e) {
     super();
     this.ct = e;
@@ -3064,16 +3064,16 @@ class CollectionQueue extends Queue {
   }
   notify(e, t, n, i) {
     if (!(t & this.ct)) return super.notify(e, t, n, i);
-    if (this.Et && this.dt) {
+    if (this.Et && this.Tt) {
       const e = untrack(() => {
         try {
-          return this.dt();
+          return this.Tt();
         } catch {
           return ON_INIT;
         }
       });
-      if (e !== this.Tt) {
-        this.Tt = e;
+      if (e !== this.dt) {
+        this.dt = e;
         this.Et = false;
         this.ft.clear();
       }
@@ -3103,9 +3103,9 @@ class CollectionQueue extends Queue {
     }
     if (!this.ft.size) {
       setSignal(this.lt, false);
-      if (this.dt) {
+      if (this.Tt) {
         try {
-          this.Tt = untrack(() => this.dt());
+          this.dt = untrack(() => this.Tt());
         } catch {}
       }
     }
@@ -3114,7 +3114,7 @@ class CollectionQueue extends Queue {
 function createCollectionBoundary(e, t, n, i) {
   const r = createOwner();
   const s = new CollectionQueue(e);
-  if (i) s.dt = i;
+  if (i) s.Tt = i;
   const o = createBoundChildren(r, t, s, e);
   const u = computed(() => {
     if (!read(s.lt)) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@solidjs/signals",
-  "version": "0.13.8",
+  "version": "0.13.9",
   "description": "SolidJS' standalone reactivity implementation",
   "author": "Ryan Carniato",
   "license": "MIT",