@solidjs/signals 2.0.0-rc.17 → 2.0.0-rc.19

package/dist/observe/core/async.js

@@ -1,8 +1,8 @@
-import { STATUS_ERROR, STATUS_PENDING, STATUS_UNINITIALIZED, CONFIG_GUESS, CONFIG_HELD, REACTIVE_STAGED_READ, CONFIG_STAGED, CONFIG_STAGED_ERROR, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, REACTIVE_DIRTY, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_OVERRIDE } from "./constants.js";
+import { STATUS_ERROR, STATUS_PENDING, STATUS_NO_VALUE, STATUS_UNINITIALIZED, CONFIG_GUESS, REACTIVE_RECOMPUTING_DEPS, CONFIG_HELD, REACTIVE_STAGED_READ, CONFIG_STAGED, CONFIG_STAGED_ERROR, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, NewSet, REACTIVE_DIRTY, CONFIG_INPUTS_PUBLISHED, NOT_PENDING, REACTIVE_DISPOSED, CONFIG_REDERIVE, CONFIG_VERDICT, CONFIG_OVERRIDE } from "./constants.js";
 
 import { attrHooks } from "./attribution-hooks.js";
 
-import { ext, statusNotifierOf, untrack, context, setSignal } from "./core.js";
+import { ext, statusNotifierOf, context, untrack, setSignal } from "./core.js";
 
 import "./dev.js";
 
@@ -12,7 +12,7 @@ import { unobserved, trimStaleDeps } from "./graph.js";
 
 import { enqueueSub } from "./heap.js";
 
-import { cleanup } from "./owner.js";
+import { disposeChildren, cleanup } from "./owner.js";
 
 import { passLane, joinFuture, question, MAINLINE_QUESTION, globalQueue, schedule, clock, flush, freshHook, txOf, laneStageHook, queuePendingNode } from "./scheduler.js";
 
@@ -22,22 +22,22 @@ import { passLane, joinFuture, question, MAINLINE_QUESTION, globalQueue, schedul
 // overlapping source landed beside the Set and removePendingSource refused
 // to clear it, stranding the Set members' pending forever (#2893).
 function addPendingSource(e, t) {
-    if (e.T?.fe?.has(t)) return false;
-    (ext(e).fe ??= new Set).add(t);
+    if (e.T?.se?.has(t)) return false;
+    (ext(e).se ??= new NewSet).add(t);
     return true;
 }
 
 function removePendingSource(e, t) {
-    const n = e.T?.fe;
+    const n = e.T?.se;
     if (!n?.delete(t)) return false;
-    if (!n.size) e.T.fe = undefined;
+    if (!n.size) e.T.se = undefined;
     return true;
 }
 
 function clearPendingSources(e) {
     // This set is node-owned and never shared; dropping the sole reference
     // releases the set and every entry without a redundant clear() walk.
-    if (e.T !== null) e.T.fe = undefined;
+    if (e.T !== null) e.T.se = undefined;
 }
 
 // A rejection-pending only resolves through the settle sweep over the
@@ -48,7 +48,7 @@ function clearPendingSources(e) {
 function retryReaches(e, t) {
     for (let n = e.C; n; n = n.G) {
         const e = n.S;
-        if (e === t || e.T?.fe?.has(t)) return true;
+        if (e === t || e.T?.se?.has(t)) return true;
     }
     return false;
 }
@@ -60,7 +60,7 @@ function retryReaches(e, t) {
  * with NO read-visible pending status and no downstream propagation. Commit
  * #0 keeps serving.
  */ function parkLoadingWindow(e, t) {
-    ext(e).se = true;
+    ext(e).fe = true;
     if (t.source) addPendingSource(e, t.source);
     // A settled error is the node's answer ("the error stays the answer until
     // this retry can actually run") — the park must not replace it: reads
@@ -108,7 +108,7 @@ function releaseIfSettledUnobserved(e) {
 // Collect-then-release so unobserved() never unlinks under the walk.
 function releaseSettledDependents(e) {
     let t;
-    const n = new Set;
+    const n = new NewSet;
     const visit = e => {
         if (n.has(e)) return;
         n.add(e);
@@ -154,9 +154,9 @@ function releaseSettledDependents(e) {
     // The node answered (an error ends the wait — no longer pending, nor
     // blocked); a shown error stays its display until the commit.
         clearPendingSources(e);
-    if (e.T) e.T.se = false;
+    if (e.T) e.T.fe = false;
     if (!((e.m &= STATUS_ERROR | STATUS_UNINITIALIZED) & STATUS_ERROR)) setPendingError(e);
-    e.ue = t instanceof StatusError ? t : new StatusError(e, t);
+    e.ie = t instanceof StatusError ? t : new StatusError(e, t);
     e.l |= CONFIG_STAGED | CONFIG_STAGED_ERROR;
     // Readers parked on the flight re-run and derive from the staging; the
     // verdict readers the walk wakes need a flush (#4106).
@@ -167,7 +167,7 @@ function releaseSettledDependents(e) {
 
 function settleErroredDependents(e, t) {
     let n = false;
-    const r = new Set;
+    const r = new NewSet;
     const visit = e => {
         if (r.has(e)) return;
         r.add(e);
@@ -192,51 +192,51 @@ function settlePendingSource(e, t = e) {
     removePendingSource(e, t);
     let n = false;
     let r;
-    const o = new Set;
-    const settle = f => {
-        if (o.has(f) || 
+    const o = new NewSet;
+    const settle = s => {
+        if (o.has(s) || 
         // A conditional dropped this source, but another dependency can still
         // carry it. Only retire pending state inherited through the recovered
         // branch. Deliberately NOT marked visited on this early return: the
         // carrying dependency may itself be a later branch of this same walk
         // (two unchanged memos converging), and its visit must be free to
         // re-examine this node once that branch has retired the source.
-        t !== e && retryReaches(f, t) || !removePendingSource(f, t)) 
+        t !== e && retryReaches(s, t) || !removePendingSource(s, t)) 
         // A19: a verdict reader holds no pending of its own (it was re-derived
         // when the source went pending, `propagateStatus`), and a landing
         // equal to the committed value notifies nobody — the source settling
         // is its verdict changing: it runs again.
-        return f.l & CONFIG_VERDICT && enqueueSub(f);
-        o.add(f);
-        f.ie = clock;
-        const s = f.T?.fe?.values().next().value;
+        return s.l & CONFIG_VERDICT && enqueueSub(s);
+        o.add(s);
+        s.ae = clock;
+        const f = s.T?.se?.values().next().value;
         // STATUS_ERROR + pending sources only coexist via an errored loading
         // window's park (notifyStatus(STATUS_ERROR) clears pending sources
         // otherwise): the settled error stays the answer through the settle —
         // nulling it here would have reads throw `null` until the re-enqueued
         // retry lands, or lose it entirely if that retry parks again (#2989).
-                const u = f.m & STATUS_ERROR;
-        if (s) {
-            if (!u) setPendingError(f, s);
+                const u = s.m & STATUS_ERROR;
+        if (f) {
+            if (!u) setPendingError(s, f);
         } else {
-            f.m &= ~STATUS_PENDING;
-            if (!u) setPendingError(f);
+            s.m &= ~STATUS_PENDING;
+            if (!u) setPendingError(s);
             // L2: a landing resumes the transaction waiting on it (maintainer: "it
             // resumes the sync frame") — a held reader's re-pass over the landed
             // value is that transaction's work, and the flush that carries it
             // parks into it.
-                        if (f.l & CONFIG_HELD) joinFuture(txOf(f));
-            if (f.T?.se) {
-                enqueueSub(f);
+                        if (s.l & CONFIG_HELD) joinFuture(txOf(s));
+            if (s.T?.fe) {
+                enqueueSub(s);
                 n = true;
             }
-            if (f.T !== null) f.T.se = false;
+            if (s.T !== null) s.T.fe = false;
             // Fully settled with nobody watching: release candidate (#2934). Checked
             // again at release time — deferred so unobserved() can't unlink subs
             // lists this walk is still iterating.
-                        if (!f.o && f.l & CONFIG_AUTO_DISPOSE) (r ??= []).push(f);
+                        if (!s.o && s.l & CONFIG_AUTO_DISPOSE) (r ??= []).push(s);
         }
-        forEachDependent(f, settle);
+        forEachDependent(s, settle);
     };
     forEachDependent(e, settle);
     // Release before the flush schedule below: unobserved() pulls the node back
@@ -251,13 +251,41 @@ function isThenable(e) {
 }
 
 /** Fire and clear a node's iterator-flight cancellation hook (#3122). */ function releaseFlightTeardown(e) {
-    const t = e.T?.ae;
+    const t = e.T?.Se;
     if (t != null) {
-        e.T.ae = null;
+        e.T.Se = null;
         t();
     }
 }
 
+/**
+ * Internal (not a package export): run `fn` when the current pass's flight
+ * is superseded, at the same instant as the iterator close above, instead of
+ * when the replacing pass commits (owner cleanups wait for that). Chains onto
+ * the node's teardown slot; fires once with it. A no-op unless the ambient
+ * owner is a computed in its own pass. `consumeIterator` fills the slot
+ * before its first pull, so a source opened in an async generator's body
+ * (`for await`) composes after the generator's close.
+ */ function onSupersede(e) {
+    const t = context;
+    if (t === null || t.X === undefined || !(t.R & REACTIVE_RECOMPUTING_DEPS)) return;
+    const n = t.T === null;
+    const r = ext(t);
+    // Allocating the extension mid-run turns `_x?._inFlight` from undefined into
+    // null, which recompute would read as a flight this body registered itself.
+    // Restore undefined here, so the fix costs nothing for code that never
+    // calls onSupersede.
+        if (n) r.Ee = undefined;
+    const o = r.Se;
+    r.Se = o === null ? e : () => {
+        try {
+            o();
+        } finally {
+            e();
+        }
+    };
+}
+
 function handleAsync(e, t, n, 
 // The flight rejected (after the node's status is set): a projection
 // tells its leaves' readers, who are not the node's dependents
@@ -265,15 +293,15 @@ function handleAsync(e, t, n,
 // pending on another source, not errored.
 r) {
     let o = false;
-    let f = false;
+    let s = false;
     if (typeof t === "object" && t !== null) {
         untrack(() => {
             o = t[Symbol.asyncIterator];
-            f = !o && isThenable(t);
+            s = !o && isThenable(t);
         });
     }
-    if (!f && !o) {
-        if (e.T !== null) e.T.Se = null;
+    if (!s && !o) {
+        if (e.T !== null) e.T.Ee = null;
         // A sync landing is the first real answer for a loadingValue node.
                 e.ce = false;
         return t;
@@ -283,60 +311,67 @@ r) {
     // self-registration — runs during a recompute of `el`, which has already
     // fired _flightTeardown. A future non-recompute registration path must
     // release it here before overwriting _inFlight.
-        ext(e).Se = t;
+        ext(e).Ee = t;
     // The question this flight answers (A18 provenance, lanes.ts): the action
     // whose slice asked it; mainline is always the current question.
-        e.T.Ee = question || MAINLINE_QUESTION;
+        e.T.de = question || MAINLINE_QUESTION;
     // The run that asked this flight read every input without throwing: an
     // input still in flight was masked for it (an active override, A17), so
     // pending state those inputs propagated onto the node earlier does not
     // describe this answer. Drop it — the flight is the node's pending now.
     // The landing retires only the flight's own entry (landStatus, #3373), so
     // an entry that survived here would hold the node past its own answer.
-        e.T.fe = undefined;
+        e.T.se = undefined;
     // Attribution hook: a new flight is registered. Fired here (not in the
     // branches below) so every flight shape — plain thenable, iterator, the
     // flattened combinations — is announced exactly once, while the recompute
     // frame that caused it is still on the engine's stack. Not inside a try
     // (#2883 — see attribution-hooks.ts).
         if (attrHooks !== null) attrHooks.flightStart(e, t);
-    let s;
+    let f;
     const handleError = o => {
-        if (e.T?.Se !== t) return;
+        if (e.T?.Ee !== t) return;
         // NotReadyError from rejected promises should be treated as pending, not error
-                let f = o instanceof NotReadyError;
-        if (f && e.ce) {
+                let s = o instanceof NotReadyError;
+        if (s && e.ce) {
             // Loading window: the flight died waiting on an unready source. Keep
             // serving commit #0 — same parking as recompute's catch for sync
             // dependency throws. The dead flight is released so the clock-gated
             // error-retry pull (updateIfNecessary) can also re-ask.
-            if (e.T !== null) e.T.Se = null;
+            if (e.T !== null) e.T.Ee = null;
             parkLoadingWindow(e, o);
-            e.ie = clock;
+            e.ae = clock;
             return;
         }
         // D-41: a held node's error is staged (`stageError`). A derived store's
         // readers learn its error through the family, not the derive's
         // dependents: it publishes now.
-                if (f || n || !stageError(e, o)) notifyStatus(e, f ? STATUS_PENDING : STATUS_ERROR, o);
+                if (s || n || !stageError(e, o)) {
+            notifyStatus(e, s ? STATUS_PENDING : STATUS_ERROR, o);
+            // The error is this pass's answer, published now: it replaces the shown
+            // frame as a value's commit would (`commitPendingNode`), so the frame
+            // the pass parked goes instead of waiting for a later success. A no-op
+            // when nothing is parked.
+                        if (!s) disposeChildren(e, false, true);
+        }
         // A NotReady rejection is a landing into another pending source. The
         // rejected flight will never settle its self entry, so transfer ownership
         // after notifyStatus has propagated the replacement source.
-                if (f) settlePendingSource(e);
-        e.ie = clock;
+                if (s) settlePendingSource(e);
+        e.ae = clock;
         // A real error settles derivatively-pending dependents (notifyStatus
         // cleared their pending sources), so stranded lazy ones release here —
         // the error twin of settlePendingSource's release (#2934).
-                if (!f) releaseSettledDependents(e);
-        r?.(o, f);
+                if (!s) releaseSettledDependents(e);
+        r?.(o, s);
     };
     const asyncWrite = (r, o) => {
-        if (e.T?.Se !== t) return;
+        if (e.T?.Ee !== t) return;
         // If the node was dirtied by a newer write (optimistic override or regular),
         // skip this stale async result — the upcoming flush will recompute the node
         // with the new value, creating a fresh Promise that supersedes this one.
                 if (e.R & REACTIVE_DIRTY) return;
-        const f = e.m & STATUS_UNINITIALIZED;
+        const s = e.m & STATUS_UNINITIALIZED;
         landStatus(e);
         // Attribution hook: lets the engine snapshot state before the landing
         // branches, so it can tell whether the plain path's setSignal committed a
@@ -350,9 +385,15 @@ r) {
                 return;
             }
             // A store derive's landing commits through its setter: unheld, the
-            // shown error leaves now; held, at the derive's commit.
-                        if (!(e.l & CONFIG_HELD)) e.T.de = undefined;
-            if (f) landStatus(e, true);
+            // shown error leaves now, and so does a commit-beneath-a-flight's
+            // CONFIG_INPUTS_PUBLISHED (its first flight's, #4269) — left standing,
+            // a verdict reader of the next flight would suspend instead of being
+            // served the screen; held, both at the derive's commit.
+                        if (!(e.l & CONFIG_HELD)) {
+                e.T.Te = undefined;
+                e.l &= ~CONFIG_INPUTS_PUBLISHED;
+            }
+            if (s) landStatus(e, true);
             // Attribution hook: this path landed through the setter (derived
             // stores, projections), which does not go through setSignal, so the
             // plain branch's asyncEnd never ran and the flight stayed open — the
@@ -381,7 +422,7 @@ r) {
         // (`_pendingValue` set inside setSignal) is not — commitPendingNode closes
         // the window when the flush commits it, so no one-frame pulse can leak to
         // observers between the landing and its commit (#2990).
-                if (e.ue === NOT_PENDING) {
+                if (e.ie === NOT_PENDING) {
             e.ce = false;
             // The landing published: the dependency tail the flight's pass left
             // linked goes now (A30, #3410). A staged landing has not replaced the
@@ -419,7 +460,7 @@ r) {
     // empty completion) — meaningful only in the live posture.
         const consumeIterator = (n, r) => {
         const o = n[Symbol.asyncIterator]();
-        let f = false;
+        let s = false;
         let u = false;
         let i = !r;
         const close = () => {
@@ -433,8 +474,12 @@ r) {
         cleanup(close, r);
         // Flight-identity cancellation (#3122): the registration above is the
         // owner-death backstop; the teardown slot fires at the _inFlight release
-        // sites so supersede stops this stream immediately.
-                ext(e).ae = close;
+        // sites so supersede stops this stream immediately. Assigned, not
+        // chained (chaining here costs every app bytes): it replaces any
+        // `onSupersede` teardown this run registered earlier, which then falls
+        // back to the owner-cleanup channel. A returned `from()` is unaffected:
+        // `close` calls its `return()`, which runs its own teardown.
+                ext(e).Se = close;
         // Release check before each next pull: an unobserved lazy node must tear
         // down (its close above runs via disposal, closing the iterator) instead
         // of pumping the stream forever with zero subscribers (#2935).
@@ -455,11 +500,11 @@ r) {
             // use the bare form as a promise-free fast path when a value is already
             // buffered (seroval's deserialized streams do), so a bare result is
             // assimilated as an already-settled step instead of crashing on `.then`.
-                        const c = o.next();
-            const E = isThenable(c) ? c : {
-                then: e => void e(c)
+                        const E = o.next();
+            const c = isThenable(E) ? E : {
+                then: e => void e(E)
             };
-            E.then(r => {
+            c.then(r => {
                 // The sync stash only serves the INITIAL drain (handleAsync's caller
                 // consumes syncValue / throws NotReady from it). A sync-settled step
                 // after an async gap — seroval buffering values between pulls, a
@@ -471,14 +516,14 @@ r) {
                     n = r;
                     l = true;
                     if (r.done) u = true;
-                } else if (e.T?.Se !== t) {
+                } else if (e.T?.Ee !== t) {
                     return;
                 } else if (!r.done) {
-                    f = true;
+                    s = true;
                     asyncWrite(r.value, iterateOrRelease);
                 } else {
                     u = true;
-                    if (f) {
+                    if (s) {
                         schedule();
                         flush();
                     } else {
@@ -491,7 +536,7 @@ r) {
                 if (S && i) {
                     r = n;
                     a = true;
-                } else if (e.T?.Se === t) {
+                } else if (e.T?.Ee === t) {
                     u = true;
                     handleError(n);
                     settleAutodispose();
@@ -506,8 +551,8 @@ r) {
                 return true;
             }
             if (l && !n.done) {
-                s = n.value;
-                f = true;
+                f = n.value;
+                s = true;
                 return iterate();
             }
             return l && n.done;
@@ -515,7 +560,7 @@ r) {
         const l = iterate();
         // Later iterate() calls run from asyncWrite, where rethrowing would be unhandled.
                 i = false;
-        return f || l;
+        return s || l;
     };
     // Landed-synchronously verdict for a LIVE iterator drain; null when no live
     // drain ran (plain promise flight, or a deferred flatten). Drives the
@@ -534,16 +579,16 @@ r) {
             });
         }
         if (!n) return false;
-        s = undefined;
+        f = undefined;
         const r = consumeIterator(e, t);
         if (!t) u = r;
         return true;
     };
-    if (f) {
-        let n = false, r = false, o, f = true;
+    if (s) {
+        let n = false, r = false, o, s = true;
         t.then(r => {
-            if (f) {
-                s = r;
+            if (s) {
+                f = r;
                 n = true;
             } else {
                 // Flattening consumes the stream as the value: each yield lands
@@ -556,7 +601,7 @@ r) {
                 // compute catch above it: a protocol throw settles as this
                 // flight's error (#4112).
                 try {
-                    if (e.T?.Se === t && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, e)) return;
+                    if (e.T?.Ee === t && !(e.R & REACTIVE_DISPOSED) && flattenIfIterable(r, e)) return;
                     asyncWrite(r);
                 } catch (e) {
                     handleError(e);
@@ -564,7 +609,7 @@ r) {
                 settleAutodispose();
             }
         }, e => {
-            if (f) {
+            if (s) {
                 o = e;
                 r = true;
             } else {
@@ -572,7 +617,7 @@ r) {
                 settleAutodispose();
             }
         });
-        f = false;
+        s = false;
         if (r) {
             // Settle through the same status path an async rejection uses, then
             // unwind the in-progress synchronous read so the errored node isn't
@@ -580,13 +625,13 @@ r) {
             handleError(o);
             throw o;
         } else if (!n) {
-            // Loading window: serve commit #0 instead of suspending — first-flight
-            // work on a loadingValue node is loading-class (invisible to
-            // boundaries); the flight itself is already registered in _inFlight and
-            // lands through asyncWrite.
-            if (e.ce) return e.Ie;
-            throw new NotReadyError(context);
-        } else if (!flattenIfIterable(s)) {
+            // Not landed: the shared tail below suspends, or — loading window —
+            // serves commit #0 (first-flight work on a loadingValue node is
+            // loading-class, invisible to boundaries; the flight itself is already
+            // registered in _inFlight and lands through asyncWrite). A promise is
+            // never an iterator, so nothing between here and there runs.
+            u = false;
+        } else if (!flattenIfIterable(f)) {
             // Synchronously-resolved promise: the first real answer landed.
             e.ce = false;
         }
@@ -597,20 +642,20 @@ r) {
     if (o) flattenIfIterable(t);
     if (u !== null) {
         if (!u) {
-            // Loading window: serve commit #0 (see the promise branch above).
-            if (e.ce) return e.Ie;
+            // Loading window: serve commit #0 instead of suspending.
+            if (e.ce) return e.le;
             throw new NotReadyError(context);
         }
         // A sync first yield (or immediate empty completion) is the first real
         // answer; async yields clear inside asyncWrite.
                 e.ce = false;
     }
-    return s;
+    return f;
 }
 
 function clearStatus(e, t = false) {
-    if (e.T?.fe) clearPendingSources(e);
-    if (e.T?.se) if (e.T !== null) e.T.se = false;
+    if (e.T?.se) clearPendingSources(e);
+    if (e.T?.fe) e.T.fe = false;
     e.m = t ? 0 : e.m & STATUS_UNINITIALIZED;
     if (e.T?.F) setPendingError(e);
     const n = statusNotifierOf(e);
@@ -642,34 +687,35 @@ function clearStatus(e, t = false) {
  * reader thrown NotReady(self) would park on a retired entry. Companions
  * keep their verdict (pending before and after; the write re-syncs them).
  */ function landStatus(e, t = false) {
-    const n = e.T?.fe;
+    const n = e.T?.se;
     // (The full clear below drops the set whether or not self was retired first.)
         if (n && (n.delete(e), n.size)) {
-        e.T.se = false;
+        e.T.fe = false;
         if (t) e.m = STATUS_PENDING;
         setPendingError(e, n.values().next().value);
     } else clearStatus(e, t);
 }
 
-function notifyStatus(e, t, n, r) {
+function notifyStatus(e, t, n) {
     // Wrap regular errors to track source node
     if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError)) n = new StatusError(e, n);
-    const o = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
+    const r = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
     // (CARVE 2: the lane assignment went with the engine.)
-        {
-        if (t === STATUS_PENDING && o) {
-            // D-41: a re-ask of a shown error keeps it the display (`_shownError`).
-            if (e.m & STATUS_ERROR) e.T.de = e.T.F;
-            addPendingSource(e, o);
-            e.m = STATUS_PENDING | e.m & STATUS_UNINITIALIZED;
-            // Preserve the current source on this propagation so readers park on
-            // the distinct pending source.
-                        setPendingError(e, o, n);
-        } else {
-            clearPendingSources(e);
-            e.m = t | (t !== STATUS_ERROR ? e.m & STATUS_UNINITIALIZED : 0);
-            ext(e).F = n;
-        }
+        if (t === STATUS_PENDING && r) {
+        // D-41: a re-ask of a shown error keeps it the display (`_shownError`).
+        if (e.m & STATUS_ERROR) e.T.Te = e.T.F;
+        addPendingSource(e, r);
+        // A re-ask of an error that answered the first read: still no value.
+                e.m = STATUS_PENDING | (e.m & STATUS_NO_VALUE ? STATUS_UNINITIALIZED : e.m & STATUS_UNINITIALIZED);
+        // Preserve the current source on this propagation so readers park on
+        // the distinct pending source.
+                setPendingError(e, r, n);
+    } else {
+        clearPendingSources(e);
+        // An error answering a node with no value marks it so; a re-ask of it
+        // (pending) is uninitialized again; a write (STATUS_NONE) gives it one.
+                e.m = t | (t === STATUS_ERROR ? e.m & (STATUS_UNINITIALIZED | STATUS_NO_VALUE) ? STATUS_NO_VALUE : 0 : t === STATUS_PENDING && e.m & STATUS_NO_VALUE ? STATUS_UNINITIALIZED : e.m & STATUS_UNINITIALIZED);
+        ext(e).F = n;
     }
     // Lanes: a written guess is an optimistic boundary (A17 — "the optimistic
     // future value until we know otherwise"). Its own source in flight is its
@@ -681,11 +727,9 @@ function notifyStatus(e, t, n, r) {
         if (passLane === null) joinFuture(null);
         return;
     }
-    const f = statusNotifierOf(e);
-    if (f) {
-        {
-            f.call(e);
-        }
+    const o = statusNotifierOf(e);
+    if (o) {
+        o.call(e);
         return;
     }
     propagateStatus(e, t, n);
@@ -695,10 +739,10 @@ function notifyStatus(e, t, n, r) {
  * subscriber as a propagated mark (or a re-derive). On its own for a store
  * family's leaves, which are not the derive's dependents — the family
  * propagates the derive's status from each leaf to the leaf's readers
- * (store/projection.ts `wakeFamily`), exactly as a memo's would reach its. */ function propagateStatus(e, t, n, r) {
-    const o = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
-    forEachDependent(e, (r, f) => {
-        r.ie = clock;
+ * (store/projection.ts `wakeFamily`), exactly as a memo's would reach its. */ function propagateStatus(e, t, n) {
+    const r = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
+    forEachDependent(e, (o, s) => {
+        o.ae = clock;
         // A pending mark on a kept-tail link re-derives the subscriber instead of
         // marking it (A30, #3494 review; fuzzer latest-1 #2141; #3519 review).
         // Past `_depsTail` lie the committed frame's deps, kept by A30 because
@@ -718,8 +762,8 @@ function notifyStatus(e, t, n, r) {
         // Inheriting the error would make a probe's reader errored. A boundary's
         // output (CONFIG_REDERIVE, boundaries.ts) the same: content or fallback
         // is its pass's call.
-                if (r.l & (CONFIG_REDERIVE | CONFIG_VERDICT) || t === STATUS_PENDING && f.Te !== r.Ne) {
-            enqueueSub(r);
+                if (o.l & (CONFIG_REDERIVE | CONFIG_VERDICT) || t === STATUS_PENDING && s.Ie !== o.Ne) {
+            enqueueSub(o);
             schedule();
             return;
         }
@@ -730,30 +774,31 @@ function notifyStatus(e, t, n, r) {
         // frame still passes through — its pass is the frame's (#3372, compiled
         // shape: the unmount it stages makes the observer a zombie whose say is
         // moot for this transaction, A15 #3463).
-                if (t === STATUS_PENDING && o && r.T?.fe?.has(o)) {
-            if (passLane === null && (r.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.q && !freshHook?.(r, o.ie === clock)) joinFuture(txOf(r));
+                if (t === STATUS_PENDING && r && o.T?.se?.has(r)) {
+            if (passLane === null && (o.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && globalQueue.q && !freshHook?.(o, r.ae === clock)) joinFuture(txOf(o));
             return;
         }
-        if (t === STATUS_PENDING && o || t !== STATUS_PENDING && (r.T?.F !== n || r.T?.fe)) {
+        if (t === STATUS_PENDING && r || t !== STATUS_PENDING && (o.T?.F !== n || o.T?.se)) {
             // The marked subscriber is queued for the commit sweep so its status
             // bookkeeping (loading window, uninitialized clear) runs with the flush
             // — with the lane, when the pass propagating is the lane's work and
             // the dependent's pending is the lane's own flight (`laneStage`).
-            {
-                // (No answer: a pending propagation leaves a written guess a guess.)
-                if (laneStageHook && passLane !== null) laneStageHook(r, passLane, true, e); else {
-                    queuePendingNode(r);
-                    // A15 (#3443): pending propagates onto a held memo without
-                    // recomputing it, and the propagation itself enters the memo's
-                    // transaction — the flight flows into a memo that transaction
-                    // holds, so the write that started it is held with it. A render
-                    // effect's membership is its pass's (`notify`), never sticky.
-                                        if (t === STATUS_PENDING && (r.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !r.i) joinFuture(txOf(r));
-                }
+            // (No answer: a pending propagation leaves a written guess a guess.)
+            if (laneStageHook && passLane !== null) laneStageHook(o, passLane, true, e); else {
+                queuePendingNode(o);
+                // A15 (#3443): pending propagates onto a held memo without
+                // recomputing it, and the propagation itself enters the memo's
+                // transaction — the flight flows into a memo that transaction
+                // holds, so the write that started it is held with it. A render
+                // effect's membership is its pass's (`notify`), never sticky.
+                                if (t === STATUS_PENDING && (o.l & (CONFIG_HELD | CONFIG_OVERRIDE)) === CONFIG_HELD && !o.i) joinFuture(txOf(o));
             }
-            notifyStatus(r, t, n);
+            notifyStatus(o, t, n);
+            // A derived store's derive (store/projection.ts): marked, not re-run —
+            // its leaves' readers are not its dependents, so the family walks them.
+                        o.fam?.st(t);
         }
     });
 }
 
-export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseIfSettledUnobserved, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource, stageError };
+export { addPendingSource, clearStatus, forEachDependent, handleAsync, isThenable, notifyStatus, onSupersede, parkLoadingWindow, propagateStatus, releaseFlightTeardown, releaseIfSettledUnobserved, releaseSettledDependents, setPendingError, settleErroredDependents, settlePendingSource, stageError };