@solidjs/signals 0.13.2 → 0.13.3

package/dist/dev.js

@@ -1357,6 +1357,7 @@ function signal(v, options, firewall = null) {
   const s = {
     _equals: options?.equals != null ? options.equals : isEqual,
     _pureWrite: !!options?.pureWrite,
+    _noSnapshot: !!options?._noSnapshot,
     _unobserved: options?.unobserved,
     _value: v,
     _subs: null,
@@ -1368,7 +1369,11 @@ function signal(v, options, firewall = null) {
   };
   s._name = options?.name ?? "signal";
   firewall && (firewall._child = s);
-  if (snapshotCaptureActive && !s._pureWrite && !((firewall?._statusFlags ?? 0) & STATUS_PENDING)) {
+  if (
+    snapshotCaptureActive &&
+    !s._noSnapshot &&
+    !((firewall?._statusFlags ?? 0) & STATUS_PENDING)
+  ) {
     s._snapshotValue = v === undefined ? NO_SNAPSHOT : v;
     snapshotSources.add(s);
   }
@@ -3018,7 +3023,7 @@ const ON_INIT = Symbol();
 class CollectionQueue extends Queue {
   _collectionType;
   _sources = new Set();
-  _disabled = signal(false, { pureWrite: true });
+  _disabled = signal(false, { pureWrite: true, _noSnapshot: true });
   _initialized = false;
   _onFn;
   _prevOn = ON_INIT;

package/dist/node.cjs

@@ -1258,6 +1258,7 @@ function signal(e, t, n = null) {
   const r = {
     me: t?.equals != null ? t.equals : isEqual,
     Fe: !!t?.pureWrite,
+    Me: !!t?.Me,
     Pe: t?.unobserved,
     ae: e,
     O: null,
@@ -1268,7 +1269,7 @@ function signal(e, t, n = null) {
     ce: S
   };
   n && (n.C = r);
-  if (D && !r.Fe && !((n?.de ?? 0) & a)) {
+  if (D && !r.Me && !((n?.de ?? 0) & a)) {
     r.ie = e === undefined ? w : e;
     B.add(r);
   }
@@ -1451,14 +1452,14 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Me) {
-    e.Me = optimisticSignal(false, { pureWrite: true });
+  if (!e.Ve) {
+    e.Ve = optimisticSignal(false, { pureWrite: true });
     if (e.ye) {
-      e.Me.ye = e;
+      e.Ve.ye = e;
     }
-    if (computePendingState(e)) setSignal(e.Me, true);
+    if (computePendingState(e)) setSignal(e.Ve, true);
   }
-  return e.Me;
+  return e.Ve;
 }
 function computePendingState(e) {
   const t = e;
@@ -1474,9 +1475,9 @@ function computePendingState(e) {
   return !!(t.de & a && !(t.de & p));
 }
 function updatePendingSignal(e) {
-  if (e.Me) {
+  if (e.Ve) {
     const t = computePendingState(e);
-    const n = e.Me;
+    const n = e.Ve;
     setSignal(n, t);
     if (!t && n.re) {
       const t = resolveLane(e);
@@ -2506,65 +2507,65 @@ function mapArray(e, t, n) {
   const s = t;
   return createMemo(
     updateKeyedMap.bind({
-      Ve: createOwner(),
-      De: 0,
-      Be: e,
-      Ge: [],
-      Ke: s,
-      ze: [],
+      De: createOwner(),
+      Be: 0,
+      Ge: e,
+      Ke: [],
+      ze: s,
       Ue: [],
-      Je: r,
-      Xe: r || n?.keyed === false ? [] : undefined,
-      Ye: i ? [] : undefined,
-      Ze: n?.fallback
+      Je: [],
+      Xe: r,
+      Ye: r || n?.keyed === false ? [] : undefined,
+      Ze: i ? [] : undefined,
+      $e: n?.fallback
     })
   );
 }
 const pe = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Be() || [],
+  const e = this.Ge() || [],
     t = e.length;
   e[K];
-  runWithOwner(this.Ve, () => {
+  runWithOwner(this.De, () => {
     let n,
       r,
-      i = this.Xe
+      i = this.Ye
         ? () => {
-            this.Xe[r] = signal(e[r], pe);
-            this.Ye && (this.Ye[r] = signal(r, pe));
-            return this.Ke(accessor(this.Xe[r]), this.Ye ? accessor(this.Ye[r]) : undefined);
+            this.Ye[r] = signal(e[r], pe);
+            this.Ze && (this.Ze[r] = signal(r, pe));
+            return this.ze(accessor(this.Ye[r]), this.Ze ? accessor(this.Ze[r]) : undefined);
           }
-        : this.Ye
+        : this.Ze
           ? () => {
               const t = e[r];
-              this.Ye[r] = signal(r, pe);
-              return this.Ke(() => t, accessor(this.Ye[r]));
+              this.Ze[r] = signal(r, pe);
+              return this.ze(() => t, accessor(this.Ze[r]));
             }
           : () => {
               const t = e[r];
-              return this.Ke(() => t);
+              return this.ze(() => t);
             };
     if (t === 0) {
-      if (this.De !== 0) {
-        this.Ve.dispose(false);
+      if (this.Be !== 0) {
+        this.De.dispose(false);
+        this.Je = [];
+        this.Ke = [];
         this.Ue = [];
-        this.Ge = [];
-        this.ze = [];
-        this.De = 0;
-        this.Xe && (this.Xe = []);
+        this.Be = 0;
         this.Ye && (this.Ye = []);
+        this.Ze && (this.Ze = []);
       }
-      if (this.Ze && !this.ze[0]) {
-        this.ze[0] = runWithOwner((this.Ue[0] = createOwner()), this.Ze);
+      if (this.$e && !this.Ue[0]) {
+        this.Ue[0] = runWithOwner((this.Je[0] = createOwner()), this.$e);
       }
-    } else if (this.De === 0) {
-      if (this.Ue[0]) this.Ue[0].dispose();
-      this.ze = new Array(t);
+    } else if (this.Be === 0) {
+      if (this.Je[0]) this.Je[0].dispose();
+      this.Ue = new Array(t);
       for (r = 0; r < t; r++) {
-        this.Ge[r] = e[r];
-        this.ze[r] = runWithOwner((this.Ue[r] = createOwner()), i);
+        this.Ke[r] = e[r];
+        this.Ue[r] = runWithOwner((this.Je[r] = createOwner()), i);
       }
-      this.De = t;
+      this.Be = t;
     } else {
       let s,
         o,
@@ -2575,131 +2576,131 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         p = new Array(t),
-        h = this.Xe ? new Array(t) : undefined,
-        y = this.Ye ? new Array(t) : undefined;
+        h = this.Ye ? new Array(t) : undefined,
+        y = this.Ze ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.De, t);
-        s < o && (this.Ge[s] === e[s] || (this.Xe && compare(this.Je, this.Ge[s], e[s])));
+        s = 0, o = Math.min(this.Be, t);
+        s < o && (this.Ke[s] === e[s] || (this.Ye && compare(this.Xe, this.Ke[s], e[s])));
         s++
       ) {
-        if (this.Xe) setSignal(this.Xe[s], e[s]);
+        if (this.Ye) setSignal(this.Ye[s], e[s]);
       }
       for (
-        o = this.De - 1, u = t - 1;
+        o = this.Be - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Ge[o] === e[u] || (this.Xe && compare(this.Je, this.Ge[o], e[u])));
+        (this.Ke[o] === e[u] || (this.Ye && compare(this.Xe, this.Ke[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.ze[o];
-        p[u] = this.Ue[o];
-        h && (h[u] = this.Xe[o]);
-        y && (y[u] = this.Ye[o]);
+        d[u] = this.Ue[o];
+        p[u] = this.Je[o];
+        h && (h[u] = this.Ye[o]);
+        y && (y[u] = this.Ze[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        l = this.Je ? this.Je(f) : f;
+        l = this.Xe ? this.Xe(f) : f;
         n = c.get(l);
         a[r] = n === undefined ? -1 : n;
         c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.Ge[n];
-        l = this.Je ? this.Je(f) : f;
+        f = this.Ke[n];
+        l = this.Xe ? this.Xe(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.ze[n];
-          p[r] = this.Ue[n];
-          h && (h[r] = this.Xe[n]);
-          y && (y[r] = this.Ye[n]);
+          d[r] = this.Ue[n];
+          p[r] = this.Je[n];
+          h && (h[r] = this.Ye[n]);
+          y && (y[r] = this.Ze[n]);
           r = a[r];
           c.set(l, r);
-        } else this.Ue[n].dispose();
+        } else this.Je[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.ze[r] = d[r];
-          this.Ue[r] = p[r];
+          this.Ue[r] = d[r];
+          this.Je[r] = p[r];
           if (h) {
-            this.Xe[r] = h[r];
-            setSignal(this.Xe[r], e[r]);
+            this.Ye[r] = h[r];
+            setSignal(this.Ye[r], e[r]);
           }
           if (y) {
-            this.Ye[r] = y[r];
-            setSignal(this.Ye[r], r);
+            this.Ze[r] = y[r];
+            setSignal(this.Ze[r], r);
           }
         } else {
-          this.ze[r] = runWithOwner((this.Ue[r] = createOwner()), i);
+          this.Ue[r] = runWithOwner((this.Je[r] = createOwner()), i);
         }
       }
-      this.ze = this.ze.slice(0, (this.De = t));
-      this.Ge = e.slice(0);
+      this.Ue = this.Ue.slice(0, (this.Be = t));
+      this.Ke = e.slice(0);
     }
   });
-  return this.ze;
+  return this.Ue;
 }
 function repeat(e, t, n) {
   const r = t;
   return updateRepeat.bind({
-    Ve: createOwner(),
-    De: 0,
-    $e: 0,
-    et: e,
-    Ke: r,
+    De: createOwner(),
+    Be: 0,
+    et: 0,
+    tt: e,
+    ze: r,
+    Je: [],
     Ue: [],
-    ze: [],
-    tt: n?.from,
-    Ze: n?.fallback
+    nt: n?.from,
+    $e: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.et();
-  const t = this.tt?.() || 0;
-  runWithOwner(this.Ve, () => {
+  const e = this.tt();
+  const t = this.nt?.() || 0;
+  runWithOwner(this.De, () => {
     if (e === 0) {
-      if (this.De !== 0) {
-        this.Ve.dispose(false);
+      if (this.Be !== 0) {
+        this.De.dispose(false);
+        this.Je = [];
         this.Ue = [];
-        this.ze = [];
-        this.De = 0;
+        this.Be = 0;
       }
-      if (this.Ze && !this.ze[0]) {
-        this.ze[0] = runWithOwner((this.Ue[0] = createOwner()), this.Ze);
+      if (this.$e && !this.Ue[0]) {
+        this.Ue[0] = runWithOwner((this.Je[0] = createOwner()), this.$e);
       }
       return;
     }
     const n = t + e;
-    const r = this.$e + this.De;
-    if (this.De === 0 && this.Ue[0]) this.Ue[0].dispose();
-    for (let e = n; e < r; e++) this.Ue[e - this.$e].dispose();
-    if (this.$e < t) {
-      let e = this.$e;
-      while (e < t && e < this.De) this.Ue[e++].dispose();
-      this.Ue.splice(0, t - this.$e);
-      this.ze.splice(0, t - this.$e);
-    } else if (this.$e > t) {
-      let n = r - this.$e - 1;
-      let i = this.$e - t;
-      this.Ue.length = this.ze.length = e;
+    const r = this.et + this.Be;
+    if (this.Be === 0 && this.Je[0]) this.Je[0].dispose();
+    for (let e = n; e < r; e++) this.Je[e - this.et].dispose();
+    if (this.et < t) {
+      let e = this.et;
+      while (e < t && e < this.Be) this.Je[e++].dispose();
+      this.Je.splice(0, t - this.et);
+      this.Ue.splice(0, t - this.et);
+    } else if (this.et > t) {
+      let n = r - this.et - 1;
+      let i = this.et - t;
+      this.Je.length = this.Ue.length = e;
       while (n >= i) {
+        this.Je[n] = this.Je[n - i];
         this.Ue[n] = this.Ue[n - i];
-        this.ze[n] = this.ze[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.ze[e] = runWithOwner((this.Ue[e] = createOwner()), () => this.Ke(e + t));
+        this.Ue[e] = runWithOwner((this.Je[e] = createOwner()), () => this.ze(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.ze[e - t] = runWithOwner((this.Ue[e - t] = createOwner()), () => this.Ke(e));
+      this.Ue[e - t] = runWithOwner((this.Je[e - t] = createOwner()), () => this.ze(e));
     }
-    this.ze = this.ze.slice(0, e);
-    this.$e = t;
-    this.De = e;
+    this.Ue = this.Ue.slice(0, e);
+    this.et = t;
+    this.Be = e;
   });
-  return this.ze;
+  return this.Ue;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
@@ -2709,10 +2710,10 @@ function boundaryComputed(e, t) {
   n._e = (e, t) => {
     const r = e !== undefined ? e : n.de;
     const i = t !== undefined ? t : n.Y;
-    n.de &= ~n.nt;
-    n.fe.notify(n, n.nt, r, i);
+    n.de &= ~n.rt;
+    n.fe.notify(n, n.rt, r, i);
   };
-  n.nt = t;
+  n.rt = t;
   n.ve = true;
   recompute(n, true);
   return n;
@@ -2728,57 +2729,57 @@ function createBoundChildren(e, t, n, r) {
 }
 const he = Symbol();
 class CollectionQueue extends Queue {
-  rt;
-  it = new Set();
-  st = signal(false, { pureWrite: true });
-  ot = false;
-  ut;
-  ft = he;
+  it;
+  st = new Set();
+  ot = signal(false, { pureWrite: true, Me: true });
+  ut = false;
+  ft;
+  lt = he;
   constructor(e) {
     super();
-    this.rt = e;
+    this.it = e;
   }
   run(e) {
-    if (!e || read(this.st)) return;
+    if (!e || read(this.ot)) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.rt)) return super.notify(e, t, n, r);
-    if (this.ot && this.ut) {
+    if (!(t & this.it)) return super.notify(e, t, n, r);
+    if (this.ut && this.ft) {
       const e = untrack(() => {
         try {
-          return this.ut();
+          return this.ft();
         } catch {
           return he;
         }
       });
-      if (e !== this.ft) {
-        this.ft = e;
-        this.ot = false;
-        this.it.clear();
+      if (e !== this.lt) {
+        this.lt = e;
+        this.ut = false;
+        this.st.clear();
       }
     }
-    if (this.rt & a && this.ot) return super.notify(e, t, n, r);
-    if (n & this.rt) {
+    if (this.it & a && this.ut) return super.notify(e, t, n, r);
+    if (n & this.it) {
       const t = r?.source || e.Y?.source;
       if (t) {
-        const e = this.it.size === 0;
-        this.it.add(t);
-        if (e) setSignal(this.st, true);
+        const e = this.st.size === 0;
+        this.st.add(t);
+        if (e) setSignal(this.ot, true);
       }
     }
-    t &= ~this.rt;
+    t &= ~this.it;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.it) {
-      if (!(e.de & this.rt)) this.it.delete(e);
+    for (const e of this.st) {
+      if (!(e.de & this.it)) this.st.delete(e);
     }
-    if (!this.it.size) {
-      setSignal(this.st, false);
-      if (this.ut) {
+    if (!this.st.size) {
+      setSignal(this.ot, false);
+      if (this.ft) {
         try {
-          this.ft = untrack(() => this.ut());
+          this.lt = untrack(() => this.ft());
         } catch {}
       }
     }
@@ -2787,13 +2788,13 @@ class CollectionQueue extends Queue {
 function createCollectionBoundary(e, t, n, r) {
   const i = createOwner();
   const s = new CollectionQueue(e);
-  if (r) s.ut = r;
+  if (r) s.ft = r;
   const o = createBoundChildren(i, t, s, e);
   const u = computed(() => {
-    if (!read(s.st)) {
+    if (!read(s.ot)) {
       const e = read(o);
-      if (!untrack(() => read(s.st))) {
-        s.ot = true;
+      if (!untrack(() => read(s.ot))) {
+        s.ut = true;
         return e;
       }
     }
@@ -2806,10 +2807,10 @@ function createLoadingBoundary(e, t, n) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(d, e, e => {
-    let n = e.it.values().next().value;
+    let n = e.st.values().next().value;
     const r = n.Y?.cause ?? n.Y;
     return t(r, () => {
-      for (const t of e.it) recompute(t);
+      for (const t of e.st) recompute(t);
       schedule();
     });
   });

package/dist/prod.js

@@ -1258,6 +1258,7 @@ function signal(e, t, n = null) {
   const i = {
     Ie: t?.equals != null ? t.equals : isEqual,
     Ge: !!t?.pureWrite,
+    Qe: !!t?.Qe,
     ge: t?.unobserved,
     fe: e,
     I: null,
@@ -1268,7 +1269,7 @@ function signal(e, t, n = null) {
     le: NOT_PENDING
   };
   n && (n.A = i);
-  if (snapshotCaptureActive && !i.Ge && !((n?.Ee ?? 0) & STATUS_PENDING)) {
+  if (snapshotCaptureActive && !i.Qe && !((n?.Ee ?? 0) & STATUS_PENDING)) {
     i.re = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
@@ -1452,14 +1453,14 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Qe) {
-    e.Qe = optimisticSignal(false, { pureWrite: true });
+  if (!e.Fe) {
+    e.Fe = optimisticSignal(false, { pureWrite: true });
     if (e.Se) {
-      e.Qe.Se = e;
+      e.Fe.Se = e;
     }
-    if (computePendingState(e)) setSignal(e.Qe, true);
+    if (computePendingState(e)) setSignal(e.Fe, true);
   }
-  return e.Qe;
+  return e.Fe;
 }
 function computePendingState(e) {
   const t = e;
@@ -1475,9 +1476,9 @@ function computePendingState(e) {
   return !!(t.Ee & STATUS_PENDING && !(t.Ee & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
-  if (e.Qe) {
+  if (e.Fe) {
     const t = computePendingState(e);
-    const n = e.Qe;
+    const n = e.Fe;
     setSignal(n, t);
     if (!t && n.ie) {
       const t = resolveLane(e);
@@ -2557,65 +2558,65 @@ function mapArray(e, t, n) {
   const o = t;
   return createMemo(
     updateKeyedMap.bind({
-      Fe: createOwner(),
-      Me: 0,
-      $e: e,
-      je: [],
-      Ke: o,
-      Ye: [],
+      Me: createOwner(),
+      $e: 0,
+      je: e,
+      Ke: [],
+      Ye: o,
       Be: [],
-      Ze: i,
-      qe: i || n?.keyed === false ? [] : undefined,
-      Xe: r ? [] : undefined,
-      ze: n?.fallback
+      Ze: [],
+      qe: i,
+      Xe: i || n?.keyed === false ? [] : undefined,
+      ze: r ? [] : undefined,
+      Je: n?.fallback
     })
   );
 }
 const pureOptions = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.$e() || [],
+  const e = this.je() || [],
     t = e.length;
   e[$TRACK];
-  runWithOwner(this.Fe, () => {
+  runWithOwner(this.Me, () => {
     let n,
       i,
-      r = this.qe
+      r = this.Xe
         ? () => {
-            this.qe[i] = signal(e[i], pureOptions);
-            this.Xe && (this.Xe[i] = signal(i, pureOptions));
-            return this.Ke(accessor(this.qe[i]), this.Xe ? accessor(this.Xe[i]) : undefined);
+            this.Xe[i] = signal(e[i], pureOptions);
+            this.ze && (this.ze[i] = signal(i, pureOptions));
+            return this.Ye(accessor(this.Xe[i]), this.ze ? accessor(this.ze[i]) : undefined);
           }
-        : this.Xe
+        : this.ze
           ? () => {
               const t = e[i];
-              this.Xe[i] = signal(i, pureOptions);
-              return this.Ke(() => t, accessor(this.Xe[i]));
+              this.ze[i] = signal(i, pureOptions);
+              return this.Ye(() => t, accessor(this.ze[i]));
             }
           : () => {
               const t = e[i];
-              return this.Ke(() => t);
+              return this.Ye(() => t);
             };
     if (t === 0) {
-      if (this.Me !== 0) {
-        this.Fe.dispose(false);
+      if (this.$e !== 0) {
+        this.Me.dispose(false);
+        this.Ze = [];
+        this.Ke = [];
         this.Be = [];
-        this.je = [];
-        this.Ye = [];
-        this.Me = 0;
-        this.qe && (this.qe = []);
+        this.$e = 0;
         this.Xe && (this.Xe = []);
+        this.ze && (this.ze = []);
       }
-      if (this.ze && !this.Ye[0]) {
-        this.Ye[0] = runWithOwner((this.Be[0] = createOwner()), this.ze);
+      if (this.Je && !this.Be[0]) {
+        this.Be[0] = runWithOwner((this.Ze[0] = createOwner()), this.Je);
       }
-    } else if (this.Me === 0) {
-      if (this.Be[0]) this.Be[0].dispose();
-      this.Ye = new Array(t);
+    } else if (this.$e === 0) {
+      if (this.Ze[0]) this.Ze[0].dispose();
+      this.Be = new Array(t);
       for (i = 0; i < t; i++) {
-        this.je[i] = e[i];
-        this.Ye[i] = runWithOwner((this.Be[i] = createOwner()), r);
+        this.Ke[i] = e[i];
+        this.Be[i] = runWithOwner((this.Ze[i] = createOwner()), r);
       }
-      this.Me = t;
+      this.$e = t;
     } else {
       let o,
         s,
@@ -2626,131 +2627,131 @@ function updateKeyedMap() {
         f,
         E = new Array(t),
         T = new Array(t),
-        d = this.qe ? new Array(t) : undefined,
-        S = this.Xe ? new Array(t) : undefined;
+        d = this.Xe ? new Array(t) : undefined,
+        S = this.ze ? new Array(t) : undefined;
       for (
-        o = 0, s = Math.min(this.Me, t);
-        o < s && (this.je[o] === e[o] || (this.qe && compare(this.Ze, this.je[o], e[o])));
+        o = 0, s = Math.min(this.$e, t);
+        o < s && (this.Ke[o] === e[o] || (this.Xe && compare(this.qe, this.Ke[o], e[o])));
         o++
       ) {
-        if (this.qe) setSignal(this.qe[o], e[o]);
+        if (this.Xe) setSignal(this.Xe[o], e[o]);
       }
       for (
-        s = this.Me - 1, u = t - 1;
+        s = this.$e - 1, u = t - 1;
         s >= o &&
         u >= o &&
-        (this.je[s] === e[u] || (this.qe && compare(this.Ze, this.je[s], e[u])));
+        (this.Ke[s] === e[u] || (this.Xe && compare(this.qe, this.Ke[s], e[u])));
         s--, u--
       ) {
-        E[u] = this.Ye[s];
-        T[u] = this.Be[s];
-        d && (d[u] = this.qe[s]);
-        S && (S[u] = this.Xe[s]);
+        E[u] = this.Be[s];
+        T[u] = this.Ze[s];
+        d && (d[u] = this.Xe[s]);
+        S && (S[u] = this.ze[s]);
       }
       l = new Map();
       f = new Array(u + 1);
       for (i = u; i >= o; i--) {
         c = e[i];
-        a = this.Ze ? this.Ze(c) : c;
+        a = this.qe ? this.qe(c) : c;
         n = l.get(a);
         f[i] = n === undefined ? -1 : n;
         l.set(a, i);
       }
       for (n = o; n <= s; n++) {
-        c = this.je[n];
-        a = this.Ze ? this.Ze(c) : c;
+        c = this.Ke[n];
+        a = this.qe ? this.qe(c) : c;
         i = l.get(a);
         if (i !== undefined && i !== -1) {
-          E[i] = this.Ye[n];
-          T[i] = this.Be[n];
-          d && (d[i] = this.qe[n]);
-          S && (S[i] = this.Xe[n]);
+          E[i] = this.Be[n];
+          T[i] = this.Ze[n];
+          d && (d[i] = this.Xe[n]);
+          S && (S[i] = this.ze[n]);
           i = f[i];
           l.set(a, i);
-        } else this.Be[n].dispose();
+        } else this.Ze[n].dispose();
       }
       for (i = o; i < t; i++) {
         if (i in E) {
-          this.Ye[i] = E[i];
-          this.Be[i] = T[i];
+          this.Be[i] = E[i];
+          this.Ze[i] = T[i];
           if (d) {
-            this.qe[i] = d[i];
-            setSignal(this.qe[i], e[i]);
+            this.Xe[i] = d[i];
+            setSignal(this.Xe[i], e[i]);
           }
           if (S) {
-            this.Xe[i] = S[i];
-            setSignal(this.Xe[i], i);
+            this.ze[i] = S[i];
+            setSignal(this.ze[i], i);
           }
         } else {
-          this.Ye[i] = runWithOwner((this.Be[i] = createOwner()), r);
+          this.Be[i] = runWithOwner((this.Ze[i] = createOwner()), r);
         }
       }
-      this.Ye = this.Ye.slice(0, (this.Me = t));
-      this.je = e.slice(0);
+      this.Be = this.Be.slice(0, (this.$e = t));
+      this.Ke = e.slice(0);
     }
   });
-  return this.Ye;
+  return this.Be;
 }
 function repeat(e, t, n) {
   const i = t;
   return updateRepeat.bind({
-    Fe: createOwner(),
-    Me: 0,
-    Je: 0,
-    et: e,
-    Ke: i,
+    Me: createOwner(),
+    $e: 0,
+    et: 0,
+    tt: e,
+    Ye: i,
+    Ze: [],
     Be: [],
-    Ye: [],
-    tt: n?.from,
-    ze: n?.fallback
+    nt: n?.from,
+    Je: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.et();
-  const t = this.tt?.() || 0;
-  runWithOwner(this.Fe, () => {
+  const e = this.tt();
+  const t = this.nt?.() || 0;
+  runWithOwner(this.Me, () => {
     if (e === 0) {
-      if (this.Me !== 0) {
-        this.Fe.dispose(false);
+      if (this.$e !== 0) {
+        this.Me.dispose(false);
+        this.Ze = [];
         this.Be = [];
-        this.Ye = [];
-        this.Me = 0;
+        this.$e = 0;
       }
-      if (this.ze && !this.Ye[0]) {
-        this.Ye[0] = runWithOwner((this.Be[0] = createOwner()), this.ze);
+      if (this.Je && !this.Be[0]) {
+        this.Be[0] = runWithOwner((this.Ze[0] = createOwner()), this.Je);
       }
       return;
     }
     const n = t + e;
-    const i = this.Je + this.Me;
-    if (this.Me === 0 && this.Be[0]) this.Be[0].dispose();
-    for (let e = n; e < i; e++) this.Be[e - this.Je].dispose();
-    if (this.Je < t) {
-      let e = this.Je;
-      while (e < t && e < this.Me) this.Be[e++].dispose();
-      this.Be.splice(0, t - this.Je);
-      this.Ye.splice(0, t - this.Je);
-    } else if (this.Je > t) {
-      let n = i - this.Je - 1;
-      let r = this.Je - t;
-      this.Be.length = this.Ye.length = e;
+    const i = this.et + this.$e;
+    if (this.$e === 0 && this.Ze[0]) this.Ze[0].dispose();
+    for (let e = n; e < i; e++) this.Ze[e - this.et].dispose();
+    if (this.et < t) {
+      let e = this.et;
+      while (e < t && e < this.$e) this.Ze[e++].dispose();
+      this.Ze.splice(0, t - this.et);
+      this.Be.splice(0, t - this.et);
+    } else if (this.et > t) {
+      let n = i - this.et - 1;
+      let r = this.et - t;
+      this.Ze.length = this.Be.length = e;
       while (n >= r) {
+        this.Ze[n] = this.Ze[n - r];
         this.Be[n] = this.Be[n - r];
-        this.Ye[n] = this.Ye[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.Ye[e] = runWithOwner((this.Be[e] = createOwner()), () => this.Ke(e + t));
+        this.Be[e] = runWithOwner((this.Ze[e] = createOwner()), () => this.Ye(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.Ye[e - t] = runWithOwner((this.Be[e - t] = createOwner()), () => this.Ke(e));
+      this.Be[e - t] = runWithOwner((this.Ze[e - t] = createOwner()), () => this.Ye(e));
     }
-    this.Ye = this.Ye.slice(0, e);
-    this.Je = t;
-    this.Me = e;
+    this.Be = this.Be.slice(0, e);
+    this.et = t;
+    this.$e = e;
   });
-  return this.Ye;
+  return this.Be;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
@@ -2760,10 +2761,10 @@ function boundaryComputed(e, t) {
   n.he = (e, t) => {
     const i = e !== undefined ? e : n.Ee;
     const r = t !== undefined ? t : n.q;
-    n.Ee &= ~n.nt;
-    n.ce.notify(n, n.nt, i, r);
+    n.Ee &= ~n.it;
+    n.ce.notify(n, n.it, i, r);
   };
-  n.nt = t;
+  n.it = t;
   n.Pe = true;
   recompute(n, true);
   return n;
@@ -2779,57 +2780,57 @@ function createBoundChildren(e, t, n, i) {
 }
 const ON_INIT = Symbol();
 class CollectionQueue extends Queue {
-  it;
-  rt = new Set();
-  ot = signal(false, { pureWrite: true });
-  st = false;
-  ut;
-  ct = ON_INIT;
+  rt;
+  ot = new Set();
+  st = signal(false, { pureWrite: true, Qe: true });
+  ut = false;
+  ct;
+  lt = ON_INIT;
   constructor(e) {
     super();
-    this.it = e;
+    this.rt = e;
   }
   run(e) {
-    if (!e || read(this.ot)) return;
+    if (!e || read(this.st)) return;
     return super.run(e);
   }
   notify(e, t, n, i) {
-    if (!(t & this.it)) return super.notify(e, t, n, i);
-    if (this.st && this.ut) {
+    if (!(t & this.rt)) return super.notify(e, t, n, i);
+    if (this.ut && this.ct) {
       const e = untrack(() => {
         try {
-          return this.ut();
+          return this.ct();
         } catch {
           return ON_INIT;
         }
       });
-      if (e !== this.ct) {
-        this.ct = e;
-        this.st = false;
-        this.rt.clear();
+      if (e !== this.lt) {
+        this.lt = e;
+        this.ut = false;
+        this.ot.clear();
       }
     }
-    if (this.it & STATUS_PENDING && this.st) return super.notify(e, t, n, i);
-    if (n & this.it) {
+    if (this.rt & STATUS_PENDING && this.ut) return super.notify(e, t, n, i);
+    if (n & this.rt) {
       const t = i?.source || e.q?.source;
       if (t) {
-        const e = this.rt.size === 0;
-        this.rt.add(t);
-        if (e) setSignal(this.ot, true);
+        const e = this.ot.size === 0;
+        this.ot.add(t);
+        if (e) setSignal(this.st, true);
       }
     }
-    t &= ~this.it;
+    t &= ~this.rt;
     return t ? super.notify(e, t, n, i) : true;
   }
   checkSources() {
-    for (const e of this.rt) {
-      if (!(e.Ee & this.it)) this.rt.delete(e);
+    for (const e of this.ot) {
+      if (!(e.Ee & this.rt)) this.ot.delete(e);
     }
-    if (!this.rt.size) {
-      setSignal(this.ot, false);
-      if (this.ut) {
+    if (!this.ot.size) {
+      setSignal(this.st, false);
+      if (this.ct) {
         try {
-          this.ct = untrack(() => this.ut());
+          this.lt = untrack(() => this.ct());
         } catch {}
       }
     }
@@ -2838,13 +2839,13 @@ class CollectionQueue extends Queue {
 function createCollectionBoundary(e, t, n, i) {
   const r = createOwner();
   const o = new CollectionQueue(e);
-  if (i) o.ut = i;
+  if (i) o.ct = i;
   const s = createBoundChildren(r, t, o, e);
   const u = computed(() => {
-    if (!read(o.ot)) {
+    if (!read(o.st)) {
       const e = read(s);
-      if (!untrack(() => read(o.ot))) {
-        o.st = true;
+      if (!untrack(() => read(o.st))) {
+        o.ut = true;
         return e;
       }
     }
@@ -2857,10 +2858,10 @@ function createLoadingBoundary(e, t, n) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(STATUS_ERROR, e, e => {
-    let n = e.rt.values().next().value;
+    let n = e.ot.values().next().value;
     const i = n.q?.cause ?? n.q;
     return t(i, () => {
-      for (const t of e.rt) recompute(t);
+      for (const t of e.ot) recompute(t);
       schedule();
     });
   });

package/dist/types/core/types.d.ts

@@ -17,6 +17,8 @@ export interface NodeOptions<T> {
     transparent?: boolean;
     equals?: ((prev: T, next: T) => boolean) | false;
     pureWrite?: boolean;
+    /** Exclude this signal from snapshot capture (internal — not part of public API) */
+    _noSnapshot?: boolean;
     unobserved?: () => void;
     lazy?: boolean;
 }
@@ -28,6 +30,7 @@ export interface RawSignal<T> {
     _name?: string;
     _equals: false | ((a: T, b: T) => boolean);
     _pureWrite?: boolean;
+    _noSnapshot?: boolean;
     _unobserved?: () => void;
     _time: number;
     _transition: Transition | null;

package/package.json

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