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

package/dist/observe/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";
 
@@ -18,6 +18,8 @@ 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).
  *
@@ -81,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.Ae = 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);
     };
@@ -266,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._n = (e, n) => {
-    const t = e.yt;
-    if (t === undefined || e.bt !== $TRACK) return;
-    const i = e.m.B;
+ * positionally — the guess stands as written (the documented residue). */ GlobalQueue.an = (e, n) => {
+    const t = e.O;
+    if (t === undefined || e.Vt !== $TRACK) return;
+    const i = e.T.V;
     if (!(i instanceof LaneView)) return;
     if (!Array.isArray(n) || !Array.isArray(i.rows)) {
         i.base = n;
@@ -313,7 +315,7 @@ function arrangementEqual(e, n, t) {
         // key's new object is the same row, its target adopted it).
                 if (n === undefined) {
             if (!sameRow(c[e], a[e], r)) laneSet(getNode(t, e), a[e], l);
-        } else if (!sameRow(n.i & CONFIG_OVERRIDE ? n.m.B : c[e], a[e], r)) laneSet(n, 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 = a.length; ;e++) {
@@ -322,7 +324,7 @@ function arrangementEqual(e, n, t) {
             laneSet(n, undefined, l);
         }
         const e = d.length;
-        if (e !== undefined && (e.i & CONFIG_OVERRIDE || c.length !== a.length)) laneSet(e, a.length, l);
+        if (e !== undefined && (e.l & CONFIG_OVERRIDE || c.length !== a.length)) laneSet(e, a.length, l);
     }
 };
 
@@ -337,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.i & CONFIG_OVERRIDE)) {
-        e.i |= CONFIG_OVERRIDE;
+    if (!(e.l & CONFIG_OVERRIDE)) {
+        e.l |= CONFIG_OVERRIDE;
         list(e, t);
-    } else if (i.B === n) return;
-    i.B = n;
-    if (e.t !== null) {
+    } else if (i.V === n) return;
+    i.V = n;
+    if (e.o !== null) {
         insertSubs(e);
         laneDirty(e, t);
     }
@@ -387,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.Ae instanceof LaneView) t.Ae = t.Ae.base;
+            if (t !== null && t.Ie instanceof LaneView) t.Ie = t.Ie.base;
         }
         if (n.size === 0) overlaidFamilies.delete(e);
     }
@@ -404,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.en && r.en(r.Ae, o)) continue;
-        r.Ae = o;
+        if (r.Ye && r.Ye(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.Pt !== notifyEpoch) {
+                if (r.o !== null && r.Ot !== notifyEpoch) {
             insertSubs(r);
             t = true;
         }
@@ -417,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.Ae === o) continue;
-        i.Ae = o;
-        if (i.t !== null && i.Pt !== notifyEpoch) {
+        if (i.Ie === o) continue;
+        i.Ie = o;
+        if (i.o !== null && i.Ot !== notifyEpoch) {
             insertSubs(i);
             t = true;
         }
@@ -427,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.Ae instanceof LaneView && o.Pt !== notifyEpoch) {
+    if (o !== null && o.o !== null && o.Ie instanceof LaneView && o.Ot !== notifyEpoch) {
         const i = Array.isArray(n) ? untrack(() => n.map(unwrapValue)) : n;
-        if (!arrangementEqual(o.Ae.rows, i, e.fam?.key ?? null)) {
+        if (!arrangementEqual(o.Ie.rows, i, e.fam?.key ?? null)) {
             insertSubs(o);
             t = true;
         }
@@ -438,12 +440,12 @@ function sweepOverlaid() {
 }
 
 function carriesLane(e) {
-    if (e.k !== null && e.k.i & CONFIG_OVERRIDE) return true;
-    if (e.dk !== null && e.dk.i & 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].i & 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].i & CONFIG_OVERRIDE) return true;
+    if (t !== null) for (const e of Reflect.ownKeys(t)) if (t[e].l & CONFIG_OVERRIDE) return true;
     return false;
 }
 
@@ -461,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.i & CONFIG_OVERRIDE) return !!shown(t);
+    if (t !== undefined && t.l & CONFIG_OVERRIDE) return !!shown(t);
     const i = e.n?.[n];
-    if (i !== undefined && i.i & CONFIG_OVERRIDE) return shown(i) !== undefined;
+    if (i !== undefined && i.l & CONFIG_OVERRIDE) return shown(i) !== undefined;
     return undefined;
 }
 
@@ -474,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.i & 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,
@@ -507,7 +509,7 @@ i = false) {
         for (const e of Reflect.ownKeys(o)) {
             const r = o[e];
             let s;
-            if (r.i & 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)) {
@@ -520,7 +522,7 @@ i = false) {
         for (const e of Reflect.ownKeys(s)) {
             const o = s[e];
             let a;
-            if (o.i & CONFIG_OVERRIDE) a = t(o); else if (!i || (a = pendingGuessOf(o)) === NOT_PENDING) continue;
+            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];
@@ -532,7 +534,9 @@ 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 a = {
         map: new WeakMap,
@@ -543,7 +547,7 @@ function createOptimisticStore(e, n, t) {
         key: typeof s === "function" ? s : s === null ? null : e => isWrappable(e) ? e[s] : undefined
     };
     const f = wrap(o, null, null, a);
-    nameStore(f, r?.name);
+    nameStore(f, r?.name, r?.loc);
     if (a.shallow) {
         f[$TARGET].s = true;
         markRawIngest(o);
@@ -554,15 +558,16 @@ function createOptimisticStore(e, n, t) {
         if (r?.seedLoadingValue) t = {
             loadingValue: undefined
         };
-        if (r?.name) t = {
+        if (r?.name || r?.loc) t = {
             ...t,
-            name: r.name
+            name: r.name,
+            loc: r.loc
         };
         const i = computed(() => {
             if (!a.node) a.node = getOwner();
             runProjectionComputed(f, n, s);
         }, t);
-        i.i &= ~CONFIG_AUTO_DISPOSE;
+        i.l &= ~CONFIG_AUTO_DISPOSE;
         a.node = i;
     }
     return [ f, e => storeSetter(f, e) ];

package/dist/observe/store/projection.js

@@ -1,3 +1,5 @@
+import { attrHooks } from "../core/attribution-hooks.js";
+
 import { CONFIG_AUTO_DISPOSE, STATUS_PENDING, STATUS_UNINITIALIZED } from "../core/constants.js";
 
 import { computed } from "../core/core.js";
@@ -10,15 +12,15 @@ 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";
 
 import { wrap, nameStore, storeSetter, runDirect } from "./store.js";
 
-import { setLookup } from "./target.js";
+import { storeOwners, setLookup } from "./target.js";
 
-import { $TARGET, markRawIngest, setWriteOverride, isWrappable } from "./types.js";
+import { $TARGET, markRawIngest, isWrappable, setWriteOverride } from "./types.js";
 
 /**
  * Store — projections (plan sec. 31, S3; INTERNALS §7/§7b).
@@ -50,22 +52,22 @@ import { $TARGET, markRawIngest, setWriteOverride, isWrappable } from "./types.j
  * set/getOwnPropertyDescriptor/defineProperty. With the store proxy as
  * target those checks re-enter the store's traps OUTSIDE the override
  * bracket, so `Object.keys(state)` in a derive continuation fired the gate.
- */ function wrapDraft(e, t, r, n, o, i) {
+ */ function wrapDraft(e, t, r, o, n, i) {
     const mutate = e => {
         if (!t()) return true;
         setWriteOverride(true);
         // A continuation's write is the flight's answer: it asks the flight's
         // question (A18 provenance — a landing beneath a newer guess is held,
         // not a correction; lanes.ts `laneWrite`).
-                const n = question;
+                const o = question;
         if (i !== undefined) setQuestion(i());
         try {
             r ? r(e) : e();
         } finally {
             setWriteOverride(false);
-            setQuestion(n);
+            setQuestion(o);
         }
-        if (o) o();
+        if (n) n();
         return true;
     };
     const read = e => {
@@ -79,23 +81,23 @@ import { $TARGET, markRawIngest, setWriteOverride, isWrappable } from "./types.j
     const s = {
         get(s, c) {
             const u = read(() => e[c]);
-            return !n && typeof u === "object" && u !== null && c !== $TARGET ? wrapDraft(u, t, r, false, o, i) : u;
+            return !o && typeof u === "object" && u !== null && c !== $TARGET ? wrapDraft(u, t, r, false, n, i) : u;
         },
         has: (t, r) => read(() => r in e),
-        set: (t, r, n) => mutate(() => {
-            e[r] = n;
+        set: (t, r, o) => mutate(() => {
+            e[r] = o;
         }),
         deleteProperty: (t, r) => mutate(() => {
             delete e[r];
         }),
         ownKeys: () => read(() => Reflect.ownKeys(e)),
         getOwnPropertyDescriptor(t, r) {
-            const n = read(() => Reflect.getOwnPropertyDescriptor(e, r));
-            if (n) n.configurable = true;
-            return n;
+            const o = read(() => Reflect.getOwnPropertyDescriptor(e, r));
+            if (o) o.configurable = true;
+            return o;
         },
-        defineProperty: (t, r, n) => mutate(() => {
-            Reflect.defineProperty(e, r, n);
+        defineProperty: (t, r, o) => mutate(() => {
+            Reflect.defineProperty(e, r, o);
         })
     };
     const c = new Proxy(Array.isArray(e) ? [] : {}, s);
@@ -122,7 +124,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 +141,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 +156,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);
     });
 }
 
@@ -162,8 +164,8 @@ function forEachFamilyNode(e, t) {
     for (const r of e.live) {
         const e = r.n;
         if (e !== null) for (const r of Reflect.ownKeys(e)) t(e[r]);
-        const n = r.h;
-        if (n !== null) for (const e of Reflect.ownKeys(n)) t(n[e]);
+        const o = r.h;
+        if (o !== null) for (const e of Reflect.ownKeys(o)) t(o[e]);
         if (r.k !== null) t(r.k);
         if (r.dk !== null) t(r.dk);
     }
@@ -173,7 +175,7 @@ function forEachFamilyNode(e, t) {
  * result (sync, or each async landing) through the reconcile channel.
  * Draft validity is per run (R37): live from here until the NEXT run starts
  * — a sync derive that subscribes to an external source and pushes into
- * the draft from the callback (#3585) is the model use. */ function runProjectionComputed(e, t, r, n, o) {
+ * the draft from the callback (#3585) is the model use. */ function runProjectionComputed(e, t, r, o, n) {
     const i = getOwner();
     const s = e[$TARGET];
     const c = s.fam;
@@ -183,43 +185,48 @@ 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.De ? 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.Te !== null ? i.m._e : 0);
-    const f = wrapDraft(e, () => c.run === u && !isDisposed(i), o, s.s, 
+        const asking = () => question || (i.T !== null && i.T.Se !== null ? i.T.Ee : 0);
+    const f = wrapDraft(e, () => c.run === u && !isDisposed(i), n, s.s, 
     // A write after the run returned (a continuation, a callback) arms the
     // drain itself when no landing will.
     () => {
-        if (!(i.S & STATUS_PENDING) && !i.De) 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
     // — stages and commits with the flush like a memo's recompute.
         const d = u === 1;
-    const pass = () => storeSetter(f, o => {
-        l = t(a ?? o);
+    const pass = () => storeSetter(f, n => {
+        l = t(a ?? n);
         const commit = t => {
             // Shadow run: commit a detached snapshot, never the shadow itself
             // (adoption takes the value by identity — handing it the live
             // shadow would fuse the draft to the observable store).
             if (a && (t === undefined || t === a)) t = cloneState(a, s.s);
-            if (t !== o && t !== undefined) {
+            if (t !== n && t !== undefined) {
                 const write = () => {
-                    const n = question;
+                    const o = question;
                     setQuestion(asking());
                     try {
                         storeSetter(e, e => reconcileState(t, e, r, true), false);
                     } finally {
-                        setQuestion(n);
+                        setQuestion(o);
                     }
                 };
-                n ? n(write, t) : write();
+                o ? o(write, t) : write();
             }
             // A landing (not the sync pass's own commit): the readers held
             // pending on the derive settle.
-                        if (!d || !(i.S & 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 +235,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.S & STATUS_UNINITIALIZED) return;
+            if (d && i.m & STATUS_UNINITIALIZED) return;
             if (t) wakeFamily(c, e); else errorFamily(c);
         });
-        if (!i.De) commit(u);
+        if (!i.ce) commit(u);
     }, false);
     try {
         d ? runDirect(pass) : pass();
@@ -248,23 +255,26 @@ function forEachFamilyNode(e, t) {
     // 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.S & STATUS_PENDING && i.m.Te !== null && !i.De && !d) wakeFamily(c, i.m?.F);
+        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 = r?.key === undefined ? "id" : r.key;
-    const o = {
+    // 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 o = r?.key === undefined ? "id" : r.key;
+    const n = {
         map: new WeakMap,
         node: null,
         live: new Set,
         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
+        key: typeof o === "function" ? o : o === null ? null : e => isWrappable(e) ? e[o] : undefined
     };
-    const i = wrap(t, null, null, o);
-    if (o.shallow) {
+    const i = wrap(t, null, null, n);
+    if (n.shallow) {
         i[$TARGET].s = true;
         markRawIngest(t);
     }
@@ -272,37 +282,40 @@ function createProjectionInternal(e, t, r) {
     if (r?.seedLoadingValue) s = {
         loadingValue: undefined
     };
-    if (r?.name) {
+    if (attrHooks !== null) 
+    // As createStore: the owner in scope stamps the projection's property
+    // nodes, so attribution places them under it (#4035).
+    storeOwners.set(i[$TARGET], getOwner());
+    if (r?.name || r?.loc) {
         s = {
             ...s,
-            name: r.name
+            name: r.name,
+            loc: r.loc
         };
-        nameStore(i, r.name);
+        nameStore(i, r.name, r.loc);
     }
     const c = computed(() => {
-        if (!o.node) o.node = getOwner();
-        runProjectionComputed(i, e, n);
+        if (!n.node) n.node = getOwner();
+        runProjectionComputed(i, e, o);
     }, s);
-    c.i &= ~CONFIG_AUTO_DISPOSE;
-    o.node = c;
+    c.l &= ~CONFIG_AUTO_DISPOSE;
+    n.node = c;
+    // The derive's leaves are not its dependents: a mark's repoll
+    // (affects-marks.ts) reaches their readers through this.
+        c.fam = n;
     return {
         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;
 }
 
 /** `createStore(fn, seed, options)`: a projection with a user setter. */ function createStoreDerived(e, t, r) {
-    const {store: n} = createProjectionInternal(e, t, r);
-    return [ n, e => storeSetter(n, e) ];
+    const {store: o} = createProjectionInternal(e, t, r);
+    return [ o, e => storeSetter(o, e) ];
 }
 
 export { createProjection, createStoreDerived, runProjectionComputed };