@solidjs/signals 2.0.0-rc.14 → 2.0.0-rc.16

package/dist/prod/store/optimistic.js

@@ -2,7 +2,7 @@ import { CONFIG_OVERRIDE, CONFIG_AUTO_DISPOSE, NOT_PENDING } from "../core/const
 
 import { computed, ext, untrack, read, isEqual } from "../core/core.js";
 
-import { pendingGuessOf, laneValueOf, optimisticWrite } from "../core/lanes.js";
+import { pendingGuessOf, optimisticWrite } from "../core/lanes.js";
 
 import { getOwner } from "../core/owner.js";
 
@@ -10,12 +10,16 @@ import { GlobalQueue, txOf, list, insertSubs, laneDirty, notifyEpoch, schedule }
 
 import { runProjectionComputed } from "./projection.js";
 
-import { wrap, storeSetter, LaneView, committed, getNode, unwrapValue, sameKey, installOptHooks, resolveChainedRaw, getHasNode, targetsEqual, getContainerNode, cloneRaw } from "./store.js";
+import { wrap, storeSetter, LaneView, committed, getNode, unwrapValue, sameKey, resolveChainedRaw, getHasNode, targetsEqual, getContainerNode, cloneRaw } from "./store.js";
+
+import { installOptHooks } from "./hooks.js";
 
 import { $OWNER } from "./target.js";
 
 import { $TARGET, markRawIngest, $TRACK, isWrappable } from "./types.js";
 
+import { laneValueOf } from "../core/truth.js";
+
 /**
  * Store — optimistic stores on lanes (plan sec. 31, S4; INTERNALS §3/§7, RUL-3).
  *
@@ -79,7 +83,7 @@ function notifyOptimisticWrites(e, n) {
     // inner store's truth for its key before guessing over it.
         const o = e.ch ? e.v : null;
     const guess = (e, n, i, r) => {
-        if (o !== null) e.pe = i ? n in t : unwrapValue(t[n]);
+        if (o !== null) e.Ie = i ? n in t : unwrapValue(t[n]);
         // By value: a function leaf is a value, not an updater (#3017).
                 optimisticWrite(e, () => r);
     };
@@ -89,17 +93,17 @@ function notifyOptimisticWrites(e, n) {
         // A chained draft holds the inner store's raws; a raw is the inner slot it
         // resolves to (as a read of it serves) — the row a held write staged is
         // the same row, not a guess over the slot (#3796).
-                const f = n[t];
-        const a = unwrapValue(o && f ? resolveChainedRaw(e, t, f) : f);
+                const a = n[t];
+        const f = unwrapValue(o && a ? resolveChainedRaw(e, t, a) : a);
         if (!(t in i)) {
-            guess(getNode(e, t), t, false, a);
+            guess(getNode(e, t), t, false, f);
             guess(getHasNode(e, t), t, true, true);
             s = true;
         } else {
             const n = i[t];
-            const f = unwrapValue(o && n ? resolveChainedRaw(e, t, n) : n);
-            if (!isEqual(f, a) && !targetsEqual(f, a)) {
-                guess(getNode(e, t), t, false, a);
+            const a = unwrapValue(o && n ? resolveChainedRaw(e, t, n) : n);
+            if (!isEqual(a, f) && !targetsEqual(a, f)) {
+                guess(getNode(e, t), t, false, f);
                 if (r) s = true;
             }
         }
@@ -120,16 +124,16 @@ function notifyOptimisticWrites(e, n) {
         // The rows the setter removed from the view it saw, by key: a later
         // re-base over another action's truth must not bring them back.
                 let s = null;
-        const f = e.fam.key;
-        if (r && f !== null && f !== undefined) {
+        const a = e.fam.key;
+        if (r && a !== null && a !== undefined) {
             const e = new Set;
             for (let n = 0; n < o.length; n++) {
-                const t = isWrappable(o[n]) ? f(o[n]) : undefined;
+                const t = isWrappable(o[n]) ? a(o[n]) : undefined;
                 if (t !== undefined) e.add(t);
             }
             for (let n = 0; n < i.length; n++) {
                 const t = unwrapValue(i[n]);
-                const r = isWrappable(t) ? f(t) : undefined;
+                const r = isWrappable(t) ? a(t) : undefined;
                 if (r !== undefined && !e.has(r)) (s ??= new Set).add(r);
             }
         }
@@ -137,10 +141,10 @@ function notifyOptimisticWrites(e, n) {
     }
     if (e.dk !== null) optimisticWrite(e.dk, {});
     markOverlaid(e);
-    const f = optStaged.get(e);
-    if (f === undefined) return null;
+    const a = optStaged.get(e);
+    if (a === undefined) return null;
     optStaged.delete(e);
-    return f;
+    return a;
 }
 
 /** The container comparator's lane arm (store.ts `containerEquals`): an
@@ -157,9 +161,40 @@ function rowSame(e, n, t) {
     if (t === null || !isWrappable(e) || !isWrappable(n)) return false;
     const i = t(unwrapValue(e));
     const r = t(unwrapValue(n));
+    // Keyless rows are identified by position — reconcile's fallback when the
+    // key is missing. The caller already paired these by index, so two keyless
+    // rows are the same row and the landing confirms the arrangement instead of
+    // dissolving it. Dissolving held an external echo under the action, and a
+    // mainline `until` then timed out on a source that already contained it
+    // (#3898). Keyed rows still match only on the key.
+        if (i === undefined && r === undefined) return true;
     return i !== undefined && sameKey(i, r);
 }
 
+/** Whether reconcile would write anything into `a` from `b`: wrappable
+ * pairs descend, leaves compare as its writes do. A key mismatch is a
+ * replacement, which a content difference already says. Plain data — the
+ * server's echo of a guessed row is a new object with the same contents. */ function echoes(e, n) {
+    if (e === n) return true;
+    if (!isWrappable(e) || !isWrappable(n)) return false;
+    e = unwrapValue(e);
+    n = unwrapValue(n);
+    const t = Object.keys(e);
+    if (Array.isArray(e) !== Array.isArray(n) || t.length !== Object.keys(n).length) return false;
+    for (const i of t) if (!hasOwn.call(n, i) || !echoes(e[i], n[i])) return false;
+    return true;
+}
+
+// A cycle (a row that references itself) is not plain data: no match, so
+// the landing stays a correction.
+GlobalQueue.nn = (e, n) => {
+    try {
+        return echoes(e, n);
+    } catch {
+        return false;
+    }
+};
+
 function arrangementEqual(e, n, t) {
     if (Array.isArray(e) !== Array.isArray(n)) return false;
     if (Array.isArray(e)) {
@@ -193,18 +228,18 @@ function arrangementEqual(e, n, t) {
             }
         }
         for (let s = 0; s < n.length; s++) {
-            const f = n[s];
-            let a;
-            if (isWrappable(f)) {
+            const a = n[s];
+            let f;
+            if (isWrappable(a)) {
                 if (o !== null) {
-                    const e = t(f);
-                    if (e !== undefined) a = o.get(e);
-                } else if (s < i && isWrappable(unwrapValue(r[s]))) a = r[s];
+                    const e = t(a);
+                    if (e !== undefined) f = o.get(e);
+                } else if (s < i && isWrappable(unwrapValue(r[s]))) f = r[s];
             }
-            if (a !== undefined) {
-                if (unwrapValue(a) !== f) reconcileDraft(a, f, t);
-                if (e[s] !== a) e[s] = a;
-            } else if (unwrapValue(e[s]) !== f) e[s] = f;
+            if (f !== undefined) {
+                if (unwrapValue(f) !== a) reconcileDraft(f, a, t);
+                if (e[s] !== f) e[s] = f;
+            } else if (unwrapValue(e[s]) !== a) e[s] = a;
         }
         if (e.length !== n.length) e.length = n.length;
         return;
@@ -233,10 +268,10 @@ function arrangementEqual(e, n, t) {
  * node is born for it as the lane's derivation), on `length` only when the
  * committed length differs, and as the `LaneView`'s base for structural
  * reads. Unkeyed families compose
- * positionally — the guess stands as written (the documented residue). */ GlobalQueue.En = (e, n) => {
-    const t = e.ot;
-    if (t === undefined || e.rt !== $TRACK) return;
-    const i = e.m.Z;
+ * positionally — the guess stands as written (the documented residue). */ GlobalQueue.an = (e, n) => {
+    const t = e.O;
+    if (t === undefined || e.ze !== $TRACK) return;
+    const i = e.T.v;
     if (!(i instanceof LaneView)) return;
     if (!Array.isArray(n) || !Array.isArray(i.rows)) {
         i.base = n;
@@ -251,45 +286,45 @@ function arrangementEqual(e, n, t) {
         if (i !== undefined && !o.has(i)) o.set(i, t);
     }
     const s = new Set;
-    const f = [];
-    const a = i.rows;
-    for (let e = 0; e < a.length; e++) {
-        const n = a[e];
+    const a = [];
+    const f = i.rows;
+    for (let e = 0; e < f.length; e++) {
+        const n = f[e];
         const t = isWrappable(n) ? r(n) : undefined;
         const i = t !== undefined ? o.get(t) : undefined;
         if (i !== undefined) {
-            f.push(i);
+            a.push(i);
             s.add(t);
-        } else f.push(n);
+        } else a.push(n);
     }
-    const l = i.removed;
+    const u = i.removed;
     for (let e = 0; e < n.length; e++) {
         const t = n[e];
         const i = isWrappable(t) ? r(t) : undefined;
-        if (i !== undefined && !s.has(i) && (l === null || !l.has(i))) f.push(t);
+        if (i !== undefined && !s.has(i) && (u === null || !u.has(i))) a.push(t);
     }
-    i.rows = f;
-    i.base = f;
-    const u = txOf(e);
+    i.rows = a;
+    i.base = a;
+    const l = txOf(e);
     const c = committed(t);
     const d = t.n;
-    for (let e = 0; e < f.length; e++) {
+    for (let e = 0; e < a.length; e++) {
         const n = d?.[e];
         // A slot the lane does not own shows the committed row: it becomes the
         // lane's only where the composed row is another row (by key — the same
         // key's new object is the same row, its target adopted it).
                 if (n === undefined) {
-            if (!sameRow(c[e], f[e], r)) laneSet(getNode(t, e), f[e], u);
-        } else if (!sameRow(n.u & CONFIG_OVERRIDE ? n.m.Z : c[e], f[e], r)) laneSet(n, f[e], u);
+            if (!sameRow(c[e], a[e], r)) laneSet(getNode(t, e), a[e], l);
+        } else if (!sameRow(n.l & CONFIG_OVERRIDE ? n.T.v : c[e], a[e], r)) laneSet(n, a[e], l);
     }
     if (d !== null) {
-        for (let e = f.length; ;e++) {
+        for (let e = a.length; ;e++) {
             const n = d[e];
             if (n === undefined) break;
-            laneSet(n, undefined, u);
+            laneSet(n, undefined, l);
         }
         const e = d.length;
-        if (e !== undefined && (e.u & CONFIG_OVERRIDE || c.length !== f.length)) laneSet(e, f.length, u);
+        if (e !== undefined && (e.l & CONFIG_OVERRIDE || c.length !== a.length)) laneSet(e, a.length, l);
     }
 };
 
@@ -304,12 +339,12 @@ function sameRow(e, n, t) {
  * node that was not the lane's becomes its derivation (its committed value
  * untouched beneath; the lane's end commits the latest). */ function laneSet(e, n, t) {
     const i = ext(e);
-    if (!(e.u & CONFIG_OVERRIDE)) {
-        e.u |= CONFIG_OVERRIDE;
+    if (!(e.l & CONFIG_OVERRIDE)) {
+        e.l |= CONFIG_OVERRIDE;
         list(e, t);
-    } else if (i.Z === n) return;
-    i.Z = n;
-    if (e.t !== null) {
+    } else if (i.v === n) return;
+    i.v = n;
+    if (e.o !== null) {
         insertSubs(e);
         laneDirty(e, t);
     }
@@ -354,7 +389,7 @@ function sweepOverlaid() {
             // The container shows its backing again (a shown arrangement guess
             // that ended without a landing left its `LaneView` as the value).
                         const t = e.k;
-            if (t !== null && t.pe instanceof LaneView) t.pe = t.pe.base;
+            if (t !== null && t.Ie instanceof LaneView) t.Ie = t.Ie.base;
         }
         if (n.size === 0) overlaidFamilies.delete(e);
     }
@@ -371,11 +406,11 @@ function sweepOverlaid() {
     if (i !== null) for (const e of Reflect.ownKeys(i)) {
         const r = i[e];
         const o = untrack(() => unwrapValue(n[e]));
-        if (r.We && r.We(r.pe, o)) continue;
-        r.pe = o;
+        if (r.xe && r.xe(r.Ie, o)) continue;
+        r.Ie = o;
         // (The lane's end notified it this epoch when the shown value and the
         // covered one differed — its readers re-derive already.)
-                if (r.t !== null && r.ze !== notifyEpoch) {
+                if (r.o !== null && r.Me !== notifyEpoch) {
             insertSubs(r);
             t = true;
         }
@@ -384,9 +419,9 @@ function sweepOverlaid() {
     if (r !== null) for (const e of Reflect.ownKeys(r)) {
         const i = r[e];
         const o = untrack(() => e in n);
-        if (i.pe === o) continue;
-        i.pe = o;
-        if (i.t !== null && i.ze !== notifyEpoch) {
+        if (i.Ie === o) continue;
+        i.Ie = o;
+        if (i.o !== null && i.Me !== notifyEpoch) {
             insertSubs(i);
             t = true;
         }
@@ -394,9 +429,9 @@ function sweepOverlaid() {
     // The arrangement the readers saw (the shown guess) against the inner's
     // now: a structural reader re-derives when they differ.
         const o = e.k;
-    if (o !== null && o.t !== null && o.pe instanceof LaneView && o.ze !== notifyEpoch) {
+    if (o !== null && o.o !== null && o.Ie instanceof LaneView && o.Me !== notifyEpoch) {
         const i = Array.isArray(n) ? untrack(() => n.map(unwrapValue)) : n;
-        if (!arrangementEqual(o.pe.rows, i, e.fam?.key ?? null)) {
+        if (!arrangementEqual(o.Ie.rows, i, e.fam?.key ?? null)) {
             insertSubs(o);
             t = true;
         }
@@ -405,12 +440,12 @@ function sweepOverlaid() {
 }
 
 function carriesLane(e) {
-    if (e.k !== null && e.k.u & CONFIG_OVERRIDE) return true;
-    if (e.dk !== null && e.dk.u & CONFIG_OVERRIDE) return true;
+    if (e.k !== null && e.k.l & CONFIG_OVERRIDE) return true;
+    if (e.dk !== null && e.dk.l & CONFIG_OVERRIDE) return true;
     const n = e.n;
-    if (n !== null) for (const e of Reflect.ownKeys(n)) if (n[e].u & CONFIG_OVERRIDE) return true;
+    if (n !== null) for (const e of Reflect.ownKeys(n)) if (n[e].l & CONFIG_OVERRIDE) return true;
     const t = e.h;
-    if (t !== null) for (const e of Reflect.ownKeys(t)) if (t[e].u & CONFIG_OVERRIDE) return true;
+    if (t !== null) for (const e of Reflect.ownKeys(t)) if (t[e].l & CONFIG_OVERRIDE) return true;
     return false;
 }
 
@@ -428,9 +463,9 @@ function overlaid(e) {
  * the backing answers. */ function optimisticHas(e, n) {
     if (!overlaid(e)) return undefined;
     const t = e.h?.[n];
-    if (t !== undefined && t.u & CONFIG_OVERRIDE) return !!shown(t);
+    if (t !== undefined && t.l & CONFIG_OVERRIDE) return !!shown(t);
     const i = e.n?.[n];
-    if (i !== undefined && i.u & CONFIG_OVERRIDE) return shown(i) !== undefined;
+    if (i !== undefined && i.l & CONFIG_OVERRIDE) return shown(i) !== undefined;
     return undefined;
 }
 
@@ -441,7 +476,7 @@ function overlaid(e) {
     if (t === undefined) return undefined;
     if (!t) return null;
     const i = e.n?.[n];
-    const r = i !== undefined && i.u & CONFIG_OVERRIDE ? shown(i) : e.v[n];
+    const r = i !== undefined && i.l & CONFIG_OVERRIDE ? shown(i) : e.v[n];
     // An array's `length` is reported as the array has it (non-configurable).
         if (n === "length" && Array.isArray(e.v)) return {
         value: r,
@@ -474,7 +509,7 @@ i = false) {
         for (const e of Reflect.ownKeys(o)) {
             const r = o[e];
             let s;
-            if (r.u & CONFIG_OVERRIDE) s = t(r); else if (!i || (s = pendingGuessOf(r)) === NOT_PENDING) continue;
+            if (r.l & CONFIG_OVERRIDE) s = t(r); else if (!i || (s = pendingGuessOf(r)) === NOT_PENDING) continue;
             if (e === "length" && Array.isArray(n)) {
                 if (n.length !== s) ensure().length = s;
             } else if (!isEqual(n[e], s) || !hasOwn.call(n, e)) {
@@ -486,11 +521,11 @@ i = false) {
     if (s !== null) {
         for (const e of Reflect.ownKeys(s)) {
             const o = s[e];
-            let f;
-            if (o.u & CONFIG_OVERRIDE) f = t(o); else if (!i || (f = pendingGuessOf(o)) === NOT_PENDING) continue;
-            const a = !!f;
-            const l = r ?? n;
-            if (!a && e in l) delete ensure()[e];
+            let a;
+            if (o.l & CONFIG_OVERRIDE) a = t(o); else if (!i || (a = pendingGuessOf(o)) === NOT_PENDING) continue;
+            const f = !!a;
+            const u = r ?? n;
+            if (!f && e in u) delete ensure()[e];
         }
     }
     return r ?? n;
@@ -499,9 +534,11 @@ i = false) {
 function createOptimisticStore(e, n, t) {
     const i = typeof e === "function";
     const r = i ? t : n;
-    const o = i ? n : e;
+    // Seedless derived form: the root starts as an empty record (see
+    // createProjectionInternal).
+        const o = i ? n || {} : e;
     const s = r?.key === undefined ? "id" : r.key;
-    const f = {
+    const a = {
         map: new WeakMap,
         node: null,
         live: new Set,
@@ -509,9 +546,9 @@ function createOptimisticStore(e, n, t) {
         opt: true,
         key: typeof s === "function" ? s : s === null ? null : e => isWrappable(e) ? e[s] : undefined
     };
-    const a = wrap(o, null, null, f);
-    if (f.shallow) {
-        a[$TARGET].s = true;
+    const f = wrap(o, null, null, a);
+    if (a.shallow) {
+        f[$TARGET].s = true;
         markRawIngest(o);
     }
     if (i) {
@@ -521,13 +558,13 @@ function createOptimisticStore(e, n, t) {
             loadingValue: undefined
         };
         const i = computed(() => {
-            if (!f.node) f.node = getOwner();
-            runProjectionComputed(a, n, s);
+            if (!a.node) a.node = getOwner();
+            runProjectionComputed(f, n, s);
         }, t);
-        i.u &= ~CONFIG_AUTO_DISPOSE;
-        f.node = i;
+        i.l &= ~CONFIG_AUTO_DISPOSE;
+        a.node = i;
     }
-    return [ a, e => storeSetter(a, e) ];
+    return [ f, e => storeSetter(f, e) ];
 }
 
 export { createOptimisticStore, notifyOptimisticWrites, optimisticHas, optimisticOwnDescriptor, optimisticView, sweepOverlaid };

package/dist/prod/store/projection.js

@@ -10,7 +10,7 @@ import { enqueueSub } from "../core/heap.js";
 
 import { getOwner, isDisposed } from "../core/owner.js";
 
-import { question, setQuestion, schedule } from "../core/scheduler.js";
+import { question, setQuestion, insertSubs, schedule } from "../core/scheduler.js";
 
 import { reconcileState } from "./reconcile.js";
 
@@ -18,7 +18,7 @@ import { wrap, storeSetter, runDirect } from "./store.js";
 
 import { setLookup } from "./target.js";
 
-import { $TARGET, markRawIngest, setWriteOverride } from "./types.js";
+import { $TARGET, markRawIngest, isWrappable, setWriteOverride } from "./types.js";
 
 /**
  * Store — projections (plan sec. 31, S3; INTERNALS §7/§7b).
@@ -122,7 +122,7 @@ function cloneState(e, t) {
     const r = e.node;
     e.woke = true;
     forEachFamilyNode(e, e => {
-        if (e.t === null) return;
+        if (e.o === null) return;
         // The leaf carries the derive's pending as a propagated copy, as a memo
         // between them would: a dependent recovering one branch stays pending
         // through a leaf it still reads (core `retryReaches`), and the landing's
@@ -139,7 +139,7 @@ function cloneState(e, t) {
 /** The derive's flight rejected: every live reader of the family
  * re-derives (its pull throws the derive's error). */ function errorFamily(e) {
     forEachFamilyNode(e, e => {
-        if (e.t === null) return;
+        if (e.o === null) return;
         forEachDependent(e, e => {
             enqueueSub(e);
         });
@@ -154,7 +154,7 @@ function cloneState(e, t) {
     e.woke = false;
     const t = e.node;
     forEachFamilyNode(e, e => {
-        if (e.t !== null) settlePendingSource(e, t);
+        if (e.o !== null) settlePendingSource(e, t);
     });
 }
 
@@ -183,16 +183,16 @@ function forEachFamilyNode(e, t) {
     // for the whole first flight — the derive works a detached shadow of the
     // seed so draft writes cannot tear through to readers (#2988). Every
     // commit point reconciles the shadow through the normal commit path.
-        const a = i._e ? cloneState(s.v, s.s) : null;
+        const a = i.ce ? cloneState(s.v, s.s) : null;
     // The question a write of this run answers: inside a slice, the slice's
     // (the sync pass); in a continuation — the flight still registered — the
     // flight's (`handleAsync` stamped it with the action that asked).
-        const asking = () => question || (i.m !== null && i.m.De !== null ? i.m.Oe : 0);
+        const asking = () => question || (i.T !== null && i.T.Se !== null ? i.T.Ee : 0);
     const f = wrapDraft(e, () => c.run === u && !isDisposed(i), o, s.s, 
     // A write after the run returned (a continuation, a callback) arms the
     // drain itself when no landing will.
     () => {
-        if (!(i.G & STATUS_PENDING) && !i._e) schedule();
+        if (!(i.m & STATUS_PENDING) && !i.ce) schedule();
     }, asking);
     // The creation run commits directly (a memo's first value is its
     // `_value`); every later run — a re-derive in a flush, an async landing
@@ -219,7 +219,12 @@ function forEachFamilyNode(e, t) {
             }
             // A landing (not the sync pass's own commit): the readers held
             // pending on the derive settle.
-                        if (!d || !(i.G & STATUS_UNINITIALIZED)) settleFamily(c);
+                        if (!d || !(i.m & STATUS_UNINITIALIZED)) settleFamily(c);
+            // A commit is the derive's change for the readers that observed its
+            // flight (linked by `pullFamily`; a settled pull does not link), as
+            // a memo's landing is for its readers: one that caught the NotReady
+            // (a fallback value, not pending) re-runs too (#4070).
+                        insertSubs(i);
         };
         const u = handleAsync(i, l, commit, (e, t) => {
             // The flight rejected: the leaves' readers learn it from here —
@@ -228,10 +233,10 @@ function forEachFamilyNode(e, t) {
             // reader re-derives and meets the error at its pull (memo parity,
             // #2897) — and the flush that runs them advances the clock, so a
             // later tracked re-read may retry (core `read`).
-            if (d && i.G & STATUS_UNINITIALIZED) return;
+            if (d && i.m & STATUS_UNINITIALIZED) return;
             if (t) wakeFamily(c, e); else errorFamily(c);
         });
-        if (!i._e) commit(u);
+        if (!i.ce) commit(u);
     }, false);
     try {
         d ? runDirect(pass) : pass();
@@ -239,51 +244,58 @@ function forEachFamilyNode(e, t) {
         // A flight went up (NotReady out of the pass — the derive's own, with
         // the derive as its source): the leaves' readers learn it from here —
         // they do not subscribe to the derive.
-        if (e instanceof NotReadyError && !d) wakeFamily(c, e);
+        // A synchronous error the same way (#3956: a rerun that finds the
+        // entry failed throws): every live reader re-derives and meets it.
+        if (!d) e instanceof NotReadyError ? wakeFamily(c, e) : errorFamily(c);
         throw e;
     }
     // A pass that returned with a flight up (an iterator's sync first yield):
     // the wake, as for the throw. Not a sync pass that superseded one — the
     // status it reads is the dead flight's, cleared when this pass settles
     // (#3181: a reader the settle walk had just released, re-parked for good).
-        if (i.G & STATUS_PENDING && i.m.De !== null && !i._e && !d) wakeFamily(c, i.m?.V);
+        if (i.m & STATUS_PENDING && i.T.Se !== null && !i.ce && !d) wakeFamily(c, i.T?.F);
     return i;
 }
 
 function createProjectionInternal(e, t, r) {
-    const n = {
+    // Seedless (`fn` takes no draft): the root starts as an empty record. It is
+    // a draft like any seed, never observable before the first landing (A25).
+    t ||= {};
+    const n = r?.key === undefined ? "id" : r.key;
+    const o = {
         map: new WeakMap,
         node: null,
         live: new Set,
-        shallow: !!r?.shallow
+        shallow: !!r?.shallow,
+        // The row key, for a child paired after the adoption (store.ts
+        // `adoptChild`, #3712) as the adoption pairs them.
+        key: typeof n === "function" ? n : n === null ? null : e => isWrappable(e) ? e[n] : undefined
     };
-    const o = wrap(t, null, null, n);
-    if (n.shallow) {
-        o[$TARGET].s = true;
+    const i = wrap(t, null, null, o);
+    if (o.shallow) {
+        i[$TARGET].s = true;
         markRawIngest(t);
     }
-    let i;
-    if (r?.seedLoadingValue) i = {
+    let s;
+    if (r?.seedLoadingValue) s = {
         loadingValue: undefined
     };
-    const s = computed(() => {
-        if (!n.node) n.node = getOwner();
-        runProjectionComputed(o, e, r?.key === undefined ? "id" : r.key);
-    }, i);
-    s.u &= ~CONFIG_AUTO_DISPOSE;
-    n.node = s;
+    const c = computed(() => {
+        if (!o.node) o.node = getOwner();
+        runProjectionComputed(i, e, n);
+    }, s);
+    c.l &= ~CONFIG_AUTO_DISPOSE;
+    o.node = c;
+    // The derive's leaves are not its dependents: a mark's repoll
+    // (affects-marks.ts) reaches their readers through this.
+        c.fam = o;
     return {
-        store: o,
-        node: s
+        store: i,
+        node: c
     };
 }
 
-/**
- * A derived store: `fn` runs in a computed and writes its draft; readers of
- * the store's keys re-run only when the keys they read change (the
- * firewall). `fn` may be async or an async iterator; the seed is a draft,
- * never an observable value, until the first landing (A25).
- */ function createProjection(e, t, r) {
+function createProjection(e, t, r) {
     return createProjectionInternal(e, t, r).store;
 }