@solidjs/signals 0.11.1 → 0.11.2

package/README.md

@@ -1,5 +1,255 @@
 # @solidjs/signals
 
-Standalone Reactive implementation to serve as the basis of future (post 1.x) versions of SolidJS. This package aims to be core for Signals library made with rendering in mind so it may have more features and opinions than common Signals libraries, but are still necessary core to accomplish the type of capabilities we intend.
+The reactive core that powers [SolidJS 2.0](https://github.com/solidjs/solid). This is a standalone signals library designed for rendering — it includes first-class support for async, transitions, optimistic updates, and deeply reactive stores that go beyond what general-purpose signals libraries offer.
 
-This is not ready for production and should be considered pre-alpha. This package is completely experimental and every release may be breaking. It is also not tuned for performance as of yet as we are still focusing on capability.
+> **Status:** Beta — this package is the reactive foundation of SolidJS 2.0 Beta. The API is stabilizing but may still have breaking changes before a final release.
+
+## Installation
+
+```bash
+npm install @solidjs/signals
+# or
+pnpm add @solidjs/signals
+```
+
+## Overview
+
+`@solidjs/signals` is a push-pull hybrid reactive system. Signals hold values, computeds derive from them, and effects run side effects — all connected through an automatic dependency graph. Updates are **batched** and flushed asynchronously via microtask, giving you consistent state without glitches.
+
+```typescript
+import { createEffect, createMemo, createRoot, createSignal, flush } from "@solidjs/signals";
+
+createRoot(() => {
+  const [count, setCount] = createSignal(0);
+  const doubled = createMemo(() => count() * 2);
+
+  createEffect(
+    () => doubled(),
+    value => {
+      console.log("Doubled:", value);
+    }
+  );
+
+  setCount(5);
+  flush(); // "Doubled: 10"
+});
+```
+
+### Batched Updates
+
+Signal writes are batched — reads after a write won't reflect the new value until `flush()` runs. This prevents glitches and unnecessary recomputation.
+
+```typescript
+const [a, setA] = createSignal(1);
+const [b, setB] = createSignal(2);
+
+setA(10);
+setB(20);
+// Neither has updated yet — both writes are batched
+flush(); // Now both update and downstream effects run once
+```
+
+## Core Primitives
+
+### Signals
+
+```typescript
+const [value, setValue] = createSignal(initialValue, options?);
+```
+
+Reactive state with a getter/setter pair. Supports custom equality via `options.equals`.
+
+### Memos
+
+```typescript
+const derived = createMemo(() => expensive(signal()));
+```
+
+Read-only derived values that cache their result and only recompute when dependencies change. Supports async compute functions — return a `Promise` or `AsyncIterable` and downstream consumers will wait automatically.
+
+### Effects
+
+```typescript
+// Two-phase: compute tracks dependencies, effect runs side effects
+createEffect(
+  () => count(),
+  value => {
+    console.log(value);
+  }
+);
+
+// Render-phase effect (runs before user effects)
+createRenderEffect(
+  () => count(),
+  value => {
+    updateDOM(value);
+  }
+);
+```
+
+Effects split tracking from execution. `createEffect` and `createRenderEffect` take a compute function (for tracking) and an effect function (for side effects).
+
+### Writable Memos
+
+Pass a function to `createSignal` to get a writable derived value — a memo you can also set:
+
+```typescript
+const [value, setValue] = createSignal(prev => transform(source(), prev), initialValue);
+```
+
+## Async
+
+Computeds can return promises or async iterables. The reactive graph handles this automatically — previous values are held in place until the async work resolves, so downstream consumers never see an inconsistent state.
+
+```typescript
+const data = createMemo(async () => {
+  const response = await fetch(`/api/items?q=${query()}`);
+  return response.json();
+});
+
+// Check async state
+isPending(data); // true while loading
+latest(data); // last resolved value
+```
+
+Use `action()` to coordinate async workflows with the reactive graph:
+
+```typescript
+const save = action(function* (item) {
+  yield fetch("/api/save", { method: "POST", body: JSON.stringify(item) });
+});
+```
+
+## Optimistic Updates
+
+Optimistic signals show an immediate value while async work is pending, then automatically revert when it settles:
+
+```typescript
+const [optimisticCount, setOptimisticCount] = createOptimistic(0);
+
+// Immediate UI update — reverts when the async work resolves
+setOptimisticCount(count + 1);
+```
+
+Also available for stores via `createOptimisticStore()`.
+
+## Stores
+
+Proxy-based deeply reactive objects with per-property tracking:
+
+```typescript
+import { createStore, reconcile } from "@solidjs/signals";
+
+const [store, setStore] = createStore({ todos: [], filter: "all" });
+
+// Setter takes a mutating callback — mutations are intercepted by the proxy
+setStore(s => {
+  s.filter = "active";
+});
+setStore(s => {
+  s.todos.push({ text: "New", done: false });
+});
+setStore(s => {
+  s.todos[0].done = true;
+});
+
+// Reconcile from server data
+setStore(s => {
+  reconcile(serverTodos, "id")(s.todos);
+});
+```
+
+### Projections
+
+Derived stores that transform data reactively:
+
+```typescript
+import { createProjection } from "@solidjs/signals";
+
+const filtered = createProjection(
+  draft => {
+    draft.items = store.todos.filter(t => !t.done);
+  },
+  { items: [] }
+);
+```
+
+## Boundaries
+
+Intercept async loading and error states in the reactive graph:
+
+```typescript
+import { createErrorBoundary, createLoadBoundary } from "@solidjs/signals";
+
+createErrorBoundary(
+  () => riskyComputation(),
+  (error, reset) => handleError(error)
+);
+
+createLoadBoundary(
+  () => asyncContent(),
+  () => showFallback()
+);
+```
+
+## Ownership & Context
+
+All reactive nodes exist within an **owner** tree that handles disposal and context propagation:
+
+```typescript
+import { createContext, createRoot, getContext, onCleanup, setContext } from "@solidjs/signals";
+
+const ThemeContext = createContext("light");
+
+createRoot(dispose => {
+  setContext(ThemeContext, "dark");
+
+  createEffect(
+    () => getContext(ThemeContext),
+    theme => {
+      console.log("Theme:", theme);
+    }
+  );
+
+  onCleanup(() => console.log("Disposed"));
+
+  // Call dispose() to tear down the tree
+});
+```
+
+## Utilities
+
+| Function                 | Description                                                        |
+| ------------------------ | ------------------------------------------------------------------ |
+| `flush()`                | Process all pending updates                                        |
+| `untrack(fn)`            | Run `fn` without tracking dependencies                             |
+| `isPending(accessor)`    | Check if an async accessor is loading                              |
+| `latest(accessor)`       | Get the last resolved value of an async accessor                   |
+| `refresh(accessor)`      | Re-trigger an async computation                                    |
+| `isRefreshing(accessor)` | Check if an async accessor is refreshing                           |
+| `resolve(fn)`            | Returns a promise that resolves when a reactive expression settles |
+| `mapArray(list, mapFn)`  | Reactive array mapping with keyed reconciliation                   |
+| `repeat(count, mapFn)`   | Reactive repeat based on a reactive count                          |
+| `onSettled(fn)`          | Run a callback after the current flush cycle completes             |
+| `snapshot(store)`        | Returns a non-reactive copy of a store, preserving unmodified references |
+| `reconcile(value, key)`  | Returns a diffing function for updating stores from new data       |
+| `merge(...sources)`      | Reactively merges multiple objects/stores, last source wins        |
+| `omit(props, ...keys)`   | Creates a reactive view of an object with specified keys removed   |
+| `deep(store)`            | Tracks all nested changes on a store                               |
+| `storePath(...path)`     | Path-based setter for stores as an alternative to mutating callbacks |
+
+## Development
+
+```bash
+pnpm install
+pnpm build          # Rollup build (dev/prod/node outputs)
+pnpm test           # Run tests
+pnpm test:watch     # Watch mode
+pnpm test:gc        # Tests with GC exposed
+pnpm bench          # Benchmarks
+pnpm format         # Prettier + import sorting
+```
+
+## License
+
+MIT

package/dist/dev.js

@@ -393,7 +393,7 @@ function finalizePureQueue(completingTransition = null, incomplete = false) {
         n._pendingValue = NOT_PENDING;
         if (n._type && n._type !== EFFECT_TRACKED) n._modified = true;
       }
-      n._statusFlags &= ~STATUS_UNINITIALIZED;
+      if (!(n._statusFlags & STATUS_PENDING)) n._statusFlags &= ~STATUS_UNINITIALIZED;
       if (n._fn) GlobalQueue._dispose(n, false, true);
     }
     pendingNodes.length = 0;
@@ -1374,10 +1374,16 @@ function read(el) {
     el._flags &= ~REACTIVE_LAZY;
     recompute(el, true);
   }
+  const owner = el._firewall || el;
+  if (strictRead && owner._statusFlags & STATUS_PENDING) {
+    throw new Error(
+      `Reading a pending async value in ${strictRead}. ` +
+        `Async values must be read within a tracking scope (JSX, computations, effects).`
+    );
+  }
   if (c && tracking) {
     if (el._fn && el._flags & REACTIVE_DISPOSED) recompute(el);
     link(el, c);
-    const owner = el._firewall || el;
     if (owner._fn) {
       const isZombie = el._flags & REACTIVE_ZOMBIE;
       if (owner._height >= (isZombie ? zombieQueue._min : dirtyQueue._min)) {
@@ -1391,25 +1397,21 @@ function read(el) {
       }
     }
   }
-  const asyncCompute = el._firewall || el;
-  if (asyncCompute._statusFlags & STATUS_PENDING) {
-    if (
-      c &&
-      !(stale && asyncCompute._transition && activeTransition !== asyncCompute._transition)
-    ) {
+  if (owner._statusFlags & STATUS_PENDING) {
+    if (c && !(stale && owner._transition && activeTransition !== owner._transition)) {
       if (currentOptimisticLane) {
-        const pendingLane = asyncCompute._optimisticLane;
+        const pendingLane = owner._optimisticLane;
         const lane = findLane(currentOptimisticLane);
-        if (pendingLane && findLane(pendingLane) === lane && !hasActiveOverride(asyncCompute)) {
+        if (pendingLane && findLane(pendingLane) === lane && !hasActiveOverride(owner)) {
           if (!tracking) link(el, c);
-          throw asyncCompute._error;
+          throw owner._error;
         }
       } else {
         if (!tracking) link(el, c);
-        throw asyncCompute._error;
+        throw owner._error;
       }
-    } else if (!c && asyncCompute._statusFlags & STATUS_UNINITIALIZED) {
-      throw asyncCompute._error;
+    } else if (!c && owner._statusFlags & STATUS_UNINITIALIZED) {
+      throw owner._error;
     }
   }
   if (el._fn && el._statusFlags & STATUS_ERROR) {
@@ -1429,7 +1431,8 @@ function read(el) {
   }
   if (strictRead && !tracking)
     console.warn(
-      `Untracked reactive read in ${strictRead}. This value won't update — use untrack() if intentional.`
+      `Reactive value read at the top level of ${strictRead} will not update. ` +
+        `Move it into a tracking scope (JSX, computations, effects).`
     );
   return !c ||
     currentOptimisticLane !== null ||
@@ -1450,7 +1453,8 @@ function setSignal(el, v) {
       ? el._value
       : el._pendingValue;
   if (typeof v === "function") v = v(currentValue);
-  const valueChanged = !el._equals || !el._equals(currentValue, v);
+  const valueChanged =
+    !el._equals || !el._equals(currentValue, v) || !!(el._statusFlags & STATUS_UNINITIALIZED);
   if (!valueChanged) {
     if (isOptimistic && el._pendingValue !== NOT_PENDING && el._fn) {
       insertSubs(el, true);
@@ -2148,7 +2152,8 @@ const storeTraps = {
     }
     if (strictRead && !tracking && typeof property === "string")
       console.warn(
-        `Untracked reactive read in ${strictRead}. This value won't update — use untrack() if intentional.`
+        `Reactive value read at the top level of ${strictRead} will not update. ` +
+          `Move it into a tracking scope (JSX, computations, effects).`
       );
     return isWrappable(value) ? wrap(value, target) : value;
   },

package/dist/node.cjs

@@ -386,7 +386,7 @@ function finalizePureQueue(e = null, t = false) {
         n.ce = S;
         if (n.oe && n.oe !== g) n.ue = true;
       }
-      n.de &= ~p;
+      if (!(n.de & a)) n.de &= ~p;
       if (n.R) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
@@ -1293,10 +1293,10 @@ function read(e) {
     e.m &= ~c;
     recompute(e, true);
   }
+  const n = e.I || e;
   if (t && I) {
     if (e.R && e.m & u) recompute(e);
     link(e, t);
-    const n = e.I || e;
     if (n.R) {
       const r = e.m & o;
       if (n.o >= (r ? P.j : v.j)) {
@@ -1310,7 +1310,6 @@ function read(e) {
       }
     }
   }
-  const n = e.I || e;
   if (n.de & a) {
     if (t && !(R && n.ne && A !== n.ne)) {
       if (F) {
@@ -1350,7 +1349,7 @@ function setSignal(e, t) {
   const n = e.we && !E;
   const r = n ? e.ae : e.ce === S ? e.ae : e.ce;
   if (typeof t === "function") t = t(r);
-  const i = !e.be || !e.be(r, t);
+  const i = !e.be || !e.be(r, t) || !!(e.de & p);
   if (!i) {
     if (n && e.ce !== S && e.R) {
       insertSubs(e, true);

package/dist/prod.js

@@ -53,11 +53,11 @@ function actualInsertIntoHeap(e, t) {
   if (r === undefined) t.l[i] = e;
   else {
     const t = r.T;
-    t.R = e;
+    t.S = e;
     e.T = t;
     r.T = e;
   }
-  if (i > t.S) t.S = i;
+  if (i > t.R) t.R = i;
 }
 function insertIntoHeap(e, t) {
   let n = e.O;
@@ -80,21 +80,21 @@ function deleteFromHeap(e, t) {
   const i = e.o;
   if (e.T === e) t.l[i] = undefined;
   else {
-    const n = e.R;
+    const n = e.S;
     const r = t.l[i];
     const s = n ?? r;
     if (e === r) t.l[i] = n;
-    else e.T.R = n;
+    else e.T.S = n;
     s.T = e.T;
   }
   e.T = e;
-  e.R = undefined;
+  e.S = undefined;
 }
 function markHeap(e) {
   if (e._) return;
   e._ = true;
-  for (let t = 0; t <= e.S; t++) {
-    for (let n = e.l[t]; n !== undefined; n = n.R) {
+  for (let t = 0; t <= e.R; t++) {
+    for (let n = e.l[t]; n !== undefined; n = n.S) {
       if (n.O & REACTIVE_IN_HEAP) markNode(n);
     }
   }
@@ -116,20 +116,20 @@ function markNode(e, t = REACTIVE_DIRTY) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.C = 0; e.C <= e.S; e.C++) {
-    let n = e.l[e.C];
+  for (e.N = 0; e.N <= e.R; e.N++) {
+    let n = e.l[e.N];
     while (n !== undefined) {
       if (n.O & REACTIVE_IN_HEAP) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.C];
+      n = e.l[e.N];
     }
   }
-  e.S = 0;
+  e.R = 0;
 }
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.N; t; t = t.D) {
+  for (let t = e.C; t; t = t.D) {
     const e = t.V;
     const i = e.m || e;
     if (i.L && i.o >= n) n = i.o + 1;
@@ -142,8 +142,8 @@ function adjustHeight(e, t) {
   }
 }
 const transitions = new Set();
-const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, C: 0, S: 0 };
-const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, C: 0, S: 0 };
+const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, N: 0, R: 0 };
+const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, N: 0, R: 0 };
 let clock = 0;
 let activeTransition = null;
 let scheduled = false;
@@ -168,17 +168,17 @@ function schedule() {
 }
 class Queue {
   i = null;
-  M = [[], []];
-  G = [];
+  G = [[], []];
+  M = [];
   created = clock;
   addChild(e) {
-    this.G.push(e);
+    this.M.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.G.indexOf(e);
+    const t = this.M.indexOf(e);
     if (t >= 0) {
-      this.G.splice(t, 1);
+      this.M.splice(t, 1);
       e.i = null;
     }
   }
@@ -187,12 +187,12 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.M[e - 1].length) {
-      const t = this.M[e - 1];
-      this.M[e - 1] = [];
+    if (this.G[e - 1].length) {
+      const t = this.G[e - 1];
+      this.G[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.G.length; t++) this.G[t].run?.(e);
+    for (let t = 0; t < this.M.length; t++) this.M[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
@@ -200,31 +200,31 @@ class Queue {
         const n = findLane(currentOptimisticLane);
         n.W[e - 1].push(t);
       } else {
-        this.M[e - 1].push(t);
+        this.G[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.M[0].push(...this.M[0]);
-    e.M[1].push(...this.M[1]);
-    this.M = [[], []];
-    for (let t = 0; t < this.G.length; t++) {
-      let n = this.G[t];
-      let i = e.G[t];
+    e.G[0].push(...this.G[0]);
+    e.G[1].push(...this.G[1]);
+    this.G = [[], []];
+    for (let t = 0; t < this.M.length; t++) {
+      let n = this.M[t];
+      let i = e.M[t];
       if (!i) {
-        i = { M: [[], []], G: [] };
-        e.G[t] = i;
+        i = { G: [[], []], M: [] };
+        e.M[t] = i;
       }
       n.stashQueues(i);
     }
   }
   restoreQueues(e) {
-    this.M[0].push(...e.M[0]);
-    this.M[1].push(...e.M[1]);
-    for (let t = 0; t < e.G.length; t++) {
-      const n = e.G[t];
-      let i = this.G[t];
+    this.G[0].push(...e.G[0]);
+    this.G[1].push(...e.G[1]);
+    for (let t = 0; t < e.M.length; t++) {
+      const n = e.M[t];
+      let i = this.M[t];
       if (i) i.restoreQueues(n);
     }
   }
@@ -254,7 +254,7 @@ class GlobalQueue extends Queue {
           runLaneEffects(EFFECT_USER);
           this.stashQueues(activeTransition.B);
           clock++;
-          scheduled = dirtyQueue.S >= dirtyQueue.C;
+          scheduled = dirtyQueue.R >= dirtyQueue.N;
           reassignPendingTransition(activeTransition.F);
           activeTransition = null;
           finalizePureQueue(null, true);
@@ -272,7 +272,7 @@ class GlobalQueue extends Queue {
         finalizePureQueue();
       }
       clock++;
-      scheduled = dirtyQueue.S >= dirtyQueue.C;
+      scheduled = dirtyQueue.R >= dirtyQueue.N;
       runLaneEffects(EFFECT_RENDER);
       this.run(EFFECT_RENDER);
       runLaneEffects(EFFECT_USER);
@@ -306,7 +306,7 @@ class GlobalQueue extends Queue {
         $: [],
         j: new Set(),
         ee: [],
-        B: { M: [[], []], G: [] },
+        B: { G: [[], []], M: [] },
         te: false
       };
     } else if (e) {
@@ -368,14 +368,14 @@ function insertSubs(e, t = false) {
       continue;
     }
     const s = r.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (s.C > r.h.o) s.C = r.h.o;
+    if (s.N > r.h.o) s.N = r.h.o;
     insertIntoHeap(r.h, s);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(globalQueue);
-  if (dirtyQueue.S >= dirtyQueue.C) runHeap(dirtyQueue, GlobalQueue.K);
+  if (dirtyQueue.R >= dirtyQueue.N) runHeap(dirtyQueue, GlobalQueue.K);
   if (n) {
     const t = globalQueue.F;
     for (let e = 0; e < t.length; e++) {
@@ -385,7 +385,7 @@ function finalizePureQueue(e = null, t = false) {
         n.ae = NOT_PENDING;
         if (n.oe && n.oe !== EFFECT_TRACKED) n.ue = true;
       }
-      n.Ee &= ~STATUS_UNINITIALIZED;
+      if (!(n.Ee & STATUS_PENDING)) n.Ee &= ~STATUS_UNINITIALIZED;
       if (n.L) GlobalQueue.Y(n, false, true);
     }
     t.length = 0;
@@ -427,7 +427,7 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.G) {
+  for (const t of e.M) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
@@ -489,10 +489,10 @@ function getOrCreateLane(e) {
   }
   const n = e.de;
   const i = n?.ie ? findLane(n.ie) : null;
-  t = { Te: e, U: new Set(), W: [[], []], k: null, ne: activeTransition, Re: i };
+  t = { Te: e, U: new Set(), W: [[], []], k: null, ne: activeTransition, Se: i };
   signalLanes.set(e, t);
   activeLanes.add(t);
-  e.Se = e.Oe || 0;
+  e.Re = e.Oe || 0;
   return t;
 }
 function findLane(e) {
@@ -531,9 +531,9 @@ function assignOrMergeLane(e, t) {
     const r = findLane(i);
     if (activeLanes.has(r)) {
       if (r !== n && !hasActiveOverride(e)) {
-        if (n.Re && findLane(n.Re) === r) {
+        if (n.Se && findLane(n.Se) === r) {
           e.ie = t;
-        } else if (r.Re && findLane(r.Re) === n);
+        } else if (r.Se && findLane(r.Se) === n);
         else mergeLanes(n, r);
       }
       return;
@@ -704,24 +704,24 @@ function unlinkSubs(e) {
   const i = e.p;
   const r = e.Pe;
   if (i !== null) i.Pe = r;
-  else t.ge = r;
+  else t.Ne = r;
   if (r !== null) r.p = i;
   else {
     t.I = i;
     if (i === null) {
-      t.Ce?.();
-      t.L && !t.Ne && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
+      t.ge?.();
+      t.L && !t.Ce && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
   deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  let t = e.N;
+  let t = e.C;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.N = null;
+  e.C = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
@@ -730,24 +730,24 @@ function link(e, t) {
   let i = null;
   const r = t.O & REACTIVE_RECOMPUTING_DEPS;
   if (r) {
-    i = n !== null ? n.D : t.N;
+    i = n !== null ? n.D : t.C;
     if (i !== null && i.V === e) {
       t.ye = i;
       return;
     }
   }
-  const s = e.ge;
+  const s = e.Ne;
   if (s !== null && s.h === t && (!r || isValidLink(s, t))) return;
-  const o = (t.ye = e.ge = { V: e, h: t, D: i, Pe: s, p: null });
+  const o = (t.ye = e.Ne = { V: e, h: t, D: i, Pe: s, p: null });
   if (n !== null) n.D = o;
-  else t.N = o;
+  else t.C = o;
   if (s !== null) s.p = o;
   else e.I = o;
 }
 function isValidLink(e, t) {
   const n = t.ye;
   if (n !== null) {
-    let i = t.N;
+    let i = t.C;
     do {
       if (i === e) return true;
       if (i === n) break;
@@ -770,11 +770,11 @@ function markDisposal(e) {
   }
 }
 function dispose(e) {
-  let t = e.N || null;
+  let t = e.C || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.N = null;
+  e.C = null;
   e.ye = null;
   disposeChildren(e, true);
 }
@@ -784,14 +784,14 @@ function disposeChildren(e, t = false, n) {
   let i = n ? e.be : e.De;
   while (i) {
     const e = i.ve;
-    if (i.N) {
+    if (i.C) {
       const e = i;
       deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      let t = e.N;
+      let t = e.C;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.N = null;
+      e.C = null;
       e.ye = null;
     }
     disposeChildren(i, true);
@@ -1013,7 +1013,7 @@ function releaseSubtree(e) {
       if (e.O & REACTIVE_SNAPSHOT_STALE) {
         e.O &= ~REACTIVE_SNAPSHOT_STALE;
         e.O |= REACTIVE_DIRTY;
-        if (dirtyQueue.C > e.o) dirtyQueue.C = e.o;
+        if (dirtyQueue.N > e.o) dirtyQueue.N = e.o;
         insertIntoHeap(e, dirtyQueue);
       }
     }
@@ -1095,13 +1095,13 @@ function recompute(e, t = false) {
   }
   if (!e.X) {
     const o = e.ye;
-    let l = o !== null ? o.D : e.N;
+    let l = o !== null ? o.D : e.C;
     if (l !== null) {
       do {
         l = unlinkSubs(l);
       } while (l !== null);
       if (o !== null) o.D = null;
-      else e.N = null;
+      else e.C = null;
     }
     const a = r ? e.fe : e.ae === NOT_PENDING ? e.fe : e.ae;
     const f = !e.pe || !e.pe(a, u);
@@ -1111,7 +1111,7 @@ function recompute(e, t = false) {
       else e.ae = u;
       if (r && !i && s) {
         const t = e.Oe || 0;
-        const n = e.Se || 0;
+        const n = e.Re || 0;
         if (t <= n) e.fe = u;
       }
       if (!r || i || e.fe !== o) {
@@ -1131,7 +1131,7 @@ function recompute(e, t = false) {
 }
 function updateIfNecessary(e) {
   if (e.O & REACTIVE_CHECK) {
-    for (let t = e.N; t; t = t.D) {
+    for (let t = e.C; t; t = t.D) {
       const n = t.V;
       const i = n.m || n;
       if (i.L) {
@@ -1153,8 +1153,8 @@ function computed(e, t, n) {
     id: n?.id ?? (i ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
     Le: i || undefined,
     pe: n?.equals != null ? n.equals : isEqual,
-    Me: !!n?.pureWrite,
-    Ce: n?.unobserved,
+    Ge: !!n?.pureWrite,
+    ge: n?.unobserved,
     me: null,
     ce: context?.ce ?? globalQueue,
     ke: context?.ke ?? defaultContext,
@@ -1163,12 +1163,12 @@ function computed(e, t, n) {
     fe: t,
     o: 0,
     A: null,
-    R: undefined,
+    S: undefined,
     T: null,
-    N: null,
+    C: null,
     ye: null,
     I: null,
-    ge: null,
+    Ne: null,
     i: context,
     ve: null,
     De: null,
@@ -1206,18 +1206,18 @@ function computed(e, t, n) {
 function signal(e, t, n = null) {
   const i = {
     pe: t?.equals != null ? t.equals : isEqual,
-    Me: !!t?.pureWrite,
-    Ce: t?.unobserved,
+    Ge: !!t?.pureWrite,
+    ge: t?.unobserved,
     fe: e,
     I: null,
-    ge: null,
+    Ne: null,
     J: clock,
     m: n,
     P: n?.A || null,
     ae: NOT_PENDING
   };
   n && (n.A = i);
-  if (snapshotCaptureActive && !i.Me) {
+  if (snapshotCaptureActive && !i.Ge) {
     i.re = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
@@ -1293,13 +1293,13 @@ function read(e) {
     e.O &= ~REACTIVE_LAZY;
     recompute(e, true);
   }
+  const n = e.m || e;
   if (t && tracking) {
     if (e.L && e.O & REACTIVE_DISPOSED) recompute(e);
     link(e, t);
-    const n = e.m || e;
     if (n.L) {
       const i = e.O & REACTIVE_ZOMBIE;
-      if (n.o >= (i ? zombieQueue.C : dirtyQueue.C)) {
+      if (n.o >= (i ? zombieQueue.N : dirtyQueue.N)) {
         markNode(t);
         markHeap(i ? zombieQueue : dirtyQueue);
         updateIfNecessary(n);
@@ -1310,7 +1310,6 @@ function read(e) {
       }
     }
   }
-  const n = e.m || e;
   if (n.Ee & STATUS_PENDING) {
     if (t && !(stale && n.ne && activeTransition !== n.ne)) {
       if (currentOptimisticLane) {
@@ -1355,7 +1354,7 @@ function setSignal(e, t) {
   const n = e._e && !projectionWriteActive;
   const i = n ? e.fe : e.ae === NOT_PENDING ? e.fe : e.ae;
   if (typeof t === "function") t = t(i);
-  const r = !e.pe || !e.pe(i, t);
+  const r = !e.pe || !e.pe(i, t) || !!(e.Ee & STATUS_UNINITIALIZED);
   if (!r) {
     if (n && e.ae !== NOT_PENDING && e.L) {
       insertSubs(e, true);
@@ -1404,14 +1403,14 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Ge) {
-    e.Ge = optimisticSignal(false, { pureWrite: true });
+  if (!e.Me) {
+    e.Me = optimisticSignal(false, { pureWrite: true });
     if (e.de) {
-      e.Ge.de = e;
+      e.Me.de = e;
     }
-    if (computePendingState(e)) setSignal(e.Ge, true);
+    if (computePendingState(e)) setSignal(e.Me, true);
   }
-  return e.Ge;
+  return e.Me;
 }
 function computePendingState(e) {
   const t = e;
@@ -1427,9 +1426,9 @@ function computePendingState(e) {
   return !!(t.Ee & STATUS_PENDING && !(t.Ee & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
-  if (e.Ge) {
+  if (e.Me) {
     const t = computePendingState(e);
-    const n = e.Ge;
+    const n = e.Me;
     setSignal(n, t);
     if (!t && n.ie) {
       const t = resolveLane(e);
@@ -1676,14 +1675,14 @@ function applyState(e, t, n, i) {
     let t = false;
     const l = getOverrideValue(s, o, c, "length", u);
     if (e.length && l && e[0] && n(e[0]) != null) {
-      let a, f, E, T, d, R, S, O;
+      let a, f, E, T, d, S, R, O;
       for (
         E = 0, T = Math.min(l, e.length);
         E < T &&
-        ((R = getOverrideValue(s, o, c, E, u)) === e[E] || (R && e[E] && n(R) === n(e[E])));
+        ((S = getOverrideValue(s, o, c, E, u)) === e[E] || (S && e[E] && n(S) === n(e[E])));
         E++
       ) {
-        applyState(e[E], wrap(R, r), n, i);
+        applyState(e[E], wrap(S, r), n, i);
       }
       const _ = new Array(e.length),
         I = new Map();
@@ -1691,10 +1690,10 @@ function applyState(e, t, n, i) {
         T = l - 1, d = e.length - 1;
         T >= E &&
         d >= E &&
-        ((R = getOverrideValue(s, o, c, T, u)) === e[d] || (R && e[d] && n(R) === n(e[d])));
+        ((S = getOverrideValue(s, o, c, T, u)) === e[d] || (S && e[d] && n(S) === n(e[d])));
         T--, d--
       ) {
-        _[d] = R;
+        _[d] = S;
       }
       if (E > d || E > T) {
         for (f = E; f <= d; f++) {
@@ -1711,21 +1710,21 @@ function applyState(e, t, n, i) {
         l !== e.length && r[STORE_NODE].length && setSignal(r[STORE_NODE].length, e.length);
         return;
       }
-      S = new Array(d + 1);
+      R = new Array(d + 1);
       for (f = d; f >= E; f--) {
-        R = e[f];
-        O = R ? n(R) : R;
+        S = e[f];
+        O = S ? n(S) : S;
         a = I.get(O);
-        S[f] = a === undefined ? -1 : a;
+        R[f] = a === undefined ? -1 : a;
         I.set(O, f);
       }
       for (a = E; a <= T; a++) {
-        R = getOverrideValue(s, o, c, a, u);
-        O = R ? n(R) : R;
+        S = getOverrideValue(s, o, c, a, u);
+        O = S ? n(S) : S;
         f = I.get(O);
         if (f !== undefined && f !== -1) {
-          _[f] = R;
-          f = S[f];
+          _[f] = S;
+          f = R[f];
           I.set(O, f);
         }
       }
@@ -1816,7 +1815,7 @@ function createProjectionInternal(e, t = {}, n) {
       r !== i && r !== undefined && reconcile(r, n?.key || "id", n?.all)(s);
     });
   });
-  i.Ne = true;
+  i.Ce = true;
   return { store: s, node: i };
 }
 function createProjection(e, t = {}, n) {
@@ -2299,7 +2298,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    i.Ne = true;
+    i.Ce = true;
   }
   return { store: s, node: i };
 }
@@ -2620,7 +2619,7 @@ function updateKeyedMap() {
         E = new Array(t),
         T = new Array(t),
         d = this.qe ? new Array(t) : undefined,
-        R = this.ze ? new Array(t) : undefined;
+        S = this.ze ? new Array(t) : undefined;
       for (
         s = 0, o = Math.min(this.$e, t);
         s < o && (this.Ke[s] === e[s] || (this.qe && compare(this.Xe, this.Ke[s], e[s])));
@@ -2638,7 +2637,7 @@ function updateKeyedMap() {
         E[u] = this.Ze[o];
         T[u] = this.Be[o];
         d && (d[u] = this.qe[o]);
-        R && (R[u] = this.ze[o]);
+        S && (S[u] = this.ze[o]);
       }
       a = new Map();
       f = new Array(u + 1);
@@ -2657,7 +2656,7 @@ function updateKeyedMap() {
           E[i] = this.Ze[n];
           T[i] = this.Be[n];
           d && (d[i] = this.qe[n]);
-          R && (R[i] = this.ze[n]);
+          S && (S[i] = this.ze[n]);
           i = f[i];
           a.set(l, i);
         } else this.Be[n].dispose();
@@ -2670,8 +2669,8 @@ function updateKeyedMap() {
             this.qe[i] = d[i];
             setSignal(this.qe[i], e[i]);
           }
-          if (R) {
-            this.ze[i] = R[i];
+          if (S) {
+            this.ze[i] = S[i];
             setSignal(this.ze[i], i);
           }
         } else {
@@ -2757,7 +2756,7 @@ function boundaryComputed(e, t) {
     n.ce.notify(n, n.it, i, r);
   };
   n.it = t;
-  n.Ne = true;
+  n.Ce = true;
   recompute(n, true);
   return n;
 }

package/package.json

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