@solidjs/signals 2.0.0-rc.7 → 2.0.0-rc.9

package/dist/prod/index.js

@@ -12,7 +12,9 @@ export { $REFRESH, SUPPORTS_PROXY } from "./core/constants.js";
 
 import "./core/invariants.js";
 
-export { enforceLoadingBoundary, flush, resetErrorHalt } from "./core/scheduler.js";
+export { ownerPath } from "./core/dev.js";
+
+export { ROOT_ERROR_HOOK, enforceLoadingBoundary, flush, resetErrorHalt } from "./core/scheduler.js";
 
 export { isPending, latest } from "./core/verdict.js";
 
@@ -20,6 +22,8 @@ import "./core/effect.js";
 
 export { action } from "./core/action.js";
 
+export { configureClientErrors } from "./core/error-hooks.js";
+
 export { createEffect, createMemo, createOptimistic, createReaction, createRenderEffect, createSignal, createTrackedEffect, onCleanup, onSettled, refresh, resolve, until } from "./signals.js";
 
 export { affects } from "./affects.js";
@@ -32,16 +36,22 @@ export { createErrorBoundary, createLoadingBoundary, createRevealOrder, flatten
 
 export { $PROXY, $TARGET, $TRACK, isWrappable } from "./store/store.js";
 
+export { MergeView, OmitView, SOURCE_MEMO, SOURCE_MERGE, SOURCE_OMIT, SOURCE_PLAIN, SOURCE_PROXY, hasStaticKeys, isStatic, merge, mergeSources, mergeView, omit, omitView, resolvedTable, sourceGet, sourceHas, sourceKeys, sourceOwners, viewOf } from "./store/utils.js";
+
 export { createOptimisticStoreNext as createOptimisticStore } from "./store/next/optimistic.js";
 
 export { createProjectionNext as createProjection } from "./store/next/projection.js";
 
-export { merge, omit } from "./store/utils.js";
-
 export { storeHasFamily, storeHasOptimisticFamily, storeIsShallow } from "./store/next/store.js";
 
 export { storePath } from "./store/storePath.js";
 
-const DEV = undefined;
+/**
+ * Observe tier (diagnostics channel, attribution hook slot + interaction
+ * frame): dev and observe builds. The attribution engine itself is the
+ * `@solidjs/signals/attribution` entry.
+ */ const OBSERVE = undefined;
+
+/** Dev tier (devtools hooks, graph traversal, console reporting): dev builds only. */ const DEV = undefined;
 
-export { DEV };
+export { DEV, OBSERVE };

package/dist/prod/map.js

@@ -24,165 +24,316 @@ function mapArray(t, s, i) {
     const e = typeof i?.keyed === "function" ? i.keyed : undefined;
     const r = s.length > 1;
     const n = s;
-    const h = {
-        $t: createOwner(),
-        Jt: 0,
-        Xt: t,
-        Yt: [],
-        Zt: n,
-        ts: [],
-        ss: [],
-        Ht: e,
-        es: e || i?.keyed === false ? [] : undefined,
-        rs: r && i?.keyed !== false ? [] : undefined,
-        ns: i?.keyed === false,
-        hs: i?.fallback
+    const o = {
+        se: createOwner(),
+        ts: 0,
+        ss: t,
+        es: [],
+        rs: n,
+        ns: [],
+        hs: [],
+        qt: e,
+        fs: e || i?.keyed === false ? [] : undefined,
+        cs: r && i?.keyed !== false ? [] : undefined,
+        ls: i?.keyed === false,
+        us: i?.fallback
     };
-    const o = computed(updateKeyedMap.bind(h), undefined);
+    const h = computed(updateKeyedMap.bind(o), undefined);
     // Untracked reads inside the internal owner resolve via _parentComputed; routing
     // them through node lets store-proxy lookups see pending writes (not stale _value).
-        h.$t.Pt = o;
-    o.T &= ~CONFIG_AUTO_DISPOSE;
-    return accessor(o);
+        o.se.Qt = h;
+    h.T &= ~CONFIG_AUTO_DISPOSE;
+    return accessor(h);
 }
 
 const pureOptions = {
     ownedWrite: true
 };
 
-// Exception safety (#2903): a map callback can throw NotReadyError mid-pass
-// (async read), and the computed re-runs the whole pass after settle. Every
-// pass therefore STAGES its work — new rows are created into temp arrays and
-// removals are deferred — and commits to `this` only after every mapper
-// succeeded. An aborted pass disposes just the owners it created and leaves
-// `_items`/`_mappings`/`_nodes`/`_rows`/`_indexes`/`_len` exactly as they
-// were, so the retry diffs against uncorrupted state. Consequence of the
-// strong-abort ordering: removed rows now dispose AFTER the pass's new rows
-// are created (you cannot destroy state before knowing the pass will land).
+function trySmallMove(t, s, i, e) {
+    const r = t.es;
+    const n = t.ts - 1;
+    const o = [];
+    const h = [];
+    const f = [];
+ // flat triples: oldStart, newStart, length
+        let c = 256;
+    let a = e;
+    let l = e;
+    let u = false;
+    while (a <= n && l <= i - 1) {
+        const t = r[a];
+        const e = s[l];
+        if (t === e) {
+            if (!u) {
+                f.push(a, l, 0);
+                u = true;
+            }
+            f[f.length - 1]++;
+            a++;
+            l++;
+            continue;
+        }
+        u = false;
+        // Bounded realignment lookahead, shorter distance wins.
+                let p = -1;
+        let d = Math.min(32 - o.length, n - a, c);
+        for (let t = 1; t <= d; t++) {
+            if (r[a + t] === e) {
+                p = t;
+                break;
+            }
+        }
+        c -= p === -1 ? d : p;
+        let w = -1;
+        d = Math.min(32 - h.length, i - 1 - l, c);
+        for (let i = 1; i <= d; i++) {
+            if (s[l + i] === t) {
+                w = i;
+                break;
+            }
+        }
+        c -= w === -1 ? d : w;
+        if (p !== -1 && (w === -1 || p <= w)) {
+            while (p-- > 0) o.push(a++);
+            continue;
+        }
+        if (w !== -1) {
+            while (w-- > 0) h.push(l++);
+            continue;
+        }
+        if (c <= 0 || o.length === 32 || h.length === 32) return false;
+        o.push(a++);
+        h.push(l++);
+    }
+    for (;a <= n; a++) {
+        if (o.length === 32) return false;
+        o.push(a);
+    }
+    for (;l <= i - 1; l++) {
+        if (h.length === 32) return false;
+        h.push(l);
+    }
+    return commitSmallMove(t, s, i, o, h, f);
+}
+
+/** PHASE 2 of the small-move path, in its OWN function so that a pass which
+ * only SCANS and bails (a full replace: the first structural pass of a page,
+ * typically) compiles nothing but the scan — V8 parses and compiles lazily
+ * per function, and cold `replace` measured +0.5 ms with both phases in one
+ * body. Pairs displaced sources with destinations (an unmatched destination
+ * is a replacement/insertion → general path), then commits: slice() the live
+ * arrays, copy shifted runs, patch displaced pairs, dispose leftovers. */ function commitSmallMove(t, s, i, e, r, n) {
+    const o = t.es;
+    let h;
+    let f;
+    let c;
+    if (r.length !== 0) {
+        c = new Array(e.length);
+        for (f = 0; f < r.length; f++) {
+            let t = -1;
+            for (h = 0; h < e.length; h++) {
+                if (!c[h] && o[e[h]] === s[r[f]]) {
+                    t = h;
+                    break;
+                }
+            }
+            if (t === -1) return false;
+            c[t] = true;
+            r[f] = r[f] << 6 | t;
+ // pack pairing (found < 32)
+                }
+    }
+    // DUPLICATES: the general path pairs equal identities by OCCURRENCE ORDER
+    // (the chained index map). Displaced↔displaced pairing above is ascending
+    // on both sides, so it agrees; but an aligned run was matched by POSITION,
+    // and if a displaced identity also occurs inside a run the two algorithms
+    // can hand different occurrences different owners (row-local state moves;
+    // a shrink could dispose the wrong one). Decline that case — general path.
+        if (e.length !== 0 || r.length !== 0) {
+        const t = new Set;
+        for (h = 0; h < e.length; h++) t.add(o[e[h]]);
+        for (f = 0; f < r.length; f++) t.add(s[r[f] >> 6]);
+        for (let s = 0; s < n.length; s += 3) {
+            const i = n[s];
+            for (let e = 0, r = n[s + 2]; e < r; e++) if (t.has(o[i + e])) return false;
+        }
+    }
+    const a = t.ns;
+    const l = t.hs;
+    const u = a.slice(0, i);
+    const p = l.slice(0, i);
+    for (let t = 0; t < n.length; t += 3) {
+        const s = n[t];
+        const i = n[t + 1];
+        if (s !== i) {
+            for (let e = 0; e < n[t + 2]; e++) {
+                u[i + e] = a[s + e];
+                p[i + e] = l[s + e];
+            }
+        }
+    }
+    for (f = 0; f < r.length; f++) {
+        const t = r[f] >> 6;
+        const s = e[r[f] & 63];
+        u[t] = a[s];
+        p[t] = l[s];
+    }
+    t.ns = u;
+    t.hs = p;
+    t.ts = i;
+    t.es = s.slice(0);
+    // Dispose unmatched sources LAST (general-path ordering).
+        for (h = 0; h < e.length; h++) {
+        if (c === undefined || !c[h]) l[e[h]].dispose();
+    }
+    return true;
+}
+
 function updateKeyedMap() {
-    const t = this.Xt() || [], s = t.length;
+    const t = this.ss() || [], s = t.length;
     t[$TRACK];
  // top level tracking
-        runWithOwner(this.$t, () => {
+        runWithOwner(this.se, () => {
         let i, e, r, n, 
         // Mappers write freshly-created row/index signals into the STAGE
         // arrays (`rows`/`indexes`), never into `this._rows`/`this._indexes`.
-        h = this.es ? this.ns ? () => {
+        o = this.fs ? this.ls ? () => {
             r[e] = signal(t[e], pureOptions);
-            return this.Zt(accessor(r[e]), e);
+            return this.rs(accessor(r[e]), e);
         } : () => {
             r[e] = signal(t[e], pureOptions);
             n && (n[e] = signal(e, pureOptions));
-            return this.Zt(accessor(r[e]), n ? accessor(n[e]) : undefined);
-        } : this.rs ? () => {
+            return this.rs(accessor(r[e]), n ? accessor(n[e]) : undefined);
+        } : this.cs ? () => {
             const s = t[e];
             n[e] = signal(e, pureOptions);
-            return this.Zt(s, accessor(n[e]));
+            return this.rs(s, accessor(n[e]));
         } : () => {
             const s = t[e];
-            return this.Zt(s);
+            return this.rs(s);
         };
         // fast path for empty arrays
                 if (s === 0) {
-            if (this.Jt !== 0) {
-                this.$t.dispose(false);
-                this.ss = [];
-                this.Yt = [];
-                this.ts = [];
-                this.Jt = 0;
-                this.es && (this.es = []);
-                this.rs && (this.rs = []);
+            if (this.ts !== 0) {
+                this.se.dispose(false);
+                this.hs = [];
+                this.es = [];
+                this.ns = [];
+                this.ts = 0;
+                this.fs && (this.fs = []);
+                this.cs && (this.cs = []);
             }
-            if (this.hs && !this.ts[0]) {
+            if (this.us && !this.ns[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.ss[0]?.dispose();
-                this.ts[0] = runWithOwner(this.ss[0] = createOwner(), this.hs);
+                this.hs[0]?.dispose();
+                this.ns[0] = runWithOwner(this.hs[0] = createOwner(), this.us);
             }
         }
         // fast path for new create
-         else if (this.Jt === 0) {
-            const o = new Array(s);
-            const a = new Array(s);
-            r = this.es && new Array(s);
-            n = this.rs && new Array(s);
+         else if (this.ts === 0) {
+            const h = new Array(s);
+            const f = new Array(s);
+            r = this.fs && new Array(s);
+            n = this.cs && new Array(s);
             try {
-                for (e = 0; e < s; e++) o[e] = runWithOwner(a[e] = createOwner(), h);
+                for (e = 0; e < s; e++) h[e] = runWithOwner(f[e] = createOwner(), o);
             } catch (t) {
-                for (i = 0; i <= e; i++) a[i]?.dispose();
+                for (i = 0; i <= e; i++) f[i]?.dispose();
                 throw t;
             }
             // commit
-                        if (this.ss[0]) this.ss[0].dispose();
+                        if (this.hs[0]) this.hs[0].dispose();
  // previous fallback
-                        this.ts = o;
-            this.ss = a;
-            r && (this.es = r);
-            n && (this.rs = n);
-            this.Yt = t.slice(0);
-            this.Jt = s;
+                        this.ns = h;
+            this.hs = f;
+            r && (this.fs = r);
+            n && (this.cs = n);
+            this.es = t.slice(0);
+            this.ts = s;
         } else {
-            let o, a, c, f, u, p, l, d, w, 
+            let h, f, c, a, l, u, p, d, w, 
             // Dev (attribution engine installed): the items behind the exited and
             // entered rows, for the list-identity census.
             m, O;
             // skip common prefix
-                        for (o = 0, a = Math.min(this.Jt, s); o < a && (this.Yt[o] === t[o] || this.es && compare(this.Ht, this.Yt[o], t[o])); o++) {
-                if (this.es) setSignal(this.es[o], t[o]);
+                        for (h = 0, f = Math.min(this.ts, s); h < f && (this.es[h] === t[h] || this.fs && compare(this.qt, this.es[h], t[h])); h++) {
+                if (this.fs) setSignal(this.fs[h], t[h]);
             }
             // skip common suffix — counted only; retained entries land in one pass
             // at commit instead of being staged and copied twice
-                        for (a = this.Jt - 1, c = s - 1; a >= o && c >= o && (this.Yt[a] === t[c] || this.es && compare(this.Ht, this.Yt[a], t[c])); a--, 
+                        for (f = this.ts - 1, c = s - 1; f >= h && c >= h && (this.es[f] === t[c] || this.fs && compare(this.qt, this.es[f], t[c])); f--, 
             c--) ;
             // no structural change (every position matched in place at equal
             // length — the common post-reconcile shape): keep the same mapped
             // array identity so downstream consumers don't re-run at all
-                        if (o === s && this.Jt === s) {
-                this.Yt = t.slice(0);
+                        if (h === s && this.ts === s) {
+                this.es = t.slice(0);
                 return;
             }
-            const _ = s - this.Jt;
+            // SMALL-MOVE FAST PATH: extracted to its own function — inlining it
+            // here bloats updateKeyedMap past the JIT's optimization budget and
+            // deoptimizes the GENERAL path (measured 2x on reverse). Gated to
+            // LARGE trimmed windows: when the trims already shrank the window
+            // (plain removals, tail edits), the general path is window-
+            // proportional and cheap — the fast path would only re-walk what the
+            // trims proved.
+                        if (s <= this.ts && f - h > 64 && this.fs === undefined && this.cs === undefined) {
+                // PROBE before the scan: a small move keeps a mid-window item within
+                // ±32 of its old position; a REPLACE (all fresh items — the shape
+                // every page's first structural pass usually is) has it nowhere.
+                // ~65 compares, no allocation, and the scan function is never
+                // compiled for a replace (its cold first-call compile was the cost).
+                const i = h + (c - h >> 1);
+                const e = t[i];
+                const r = Math.min(f, i + 32);
+                let n = Math.max(h, i - 32);
+                while (n <= r && this.es[n] !== e) n++;
+                if (n <= r && trySmallMove(this, t, s, h)) return;
+            }
+            const _ = s - this.ts;
             const y = new Array(s);
             const A = new Array(s);
-            r = this.es ? new Array(s) : undefined;
-            n = this.rs ? new Array(s) : undefined;
+            r = this.fs ? new Array(s) : undefined;
+            n = this.cs ? new Array(s) : undefined;
             // 0) prepare a map of all indices in the changed window of newItems,
             // scanning backwards so we encounter them in natural order
-                        p = new Map;
-            l = new Array(c + 1);
-            for (e = c; e >= o; e--) {
-                f = t[e];
-                u = this.Ht ? this.Ht(f) : f;
-                i = p.get(u);
-                l[e] = i === undefined ? -1 : i;
-                p.set(u, e);
+                        u = new Map;
+            p = new Array(c + 1);
+            for (e = c; e >= h; e--) {
+                a = t[e];
+                l = this.qt ? this.qt(a) : a;
+                i = u.get(l);
+                p[e] = i === undefined ? -1 : i;
+                u.set(l, e);
             }
             // 1) step through the old changed window and see if items can be found
             // in the new set; if so, stage them at their new positions; if not,
             // queue them for disposal at commit
-                        for (i = o; i <= a; i++) {
-                f = this.Yt[i];
-                u = this.Ht ? this.Ht(f) : f;
-                e = p.get(u);
+                        for (i = h; i <= f; i++) {
+                a = this.es[i];
+                l = this.qt ? this.qt(a) : a;
+                e = u.get(l);
                 if (e !== undefined && e !== -1) {
-                    y[e] = this.ts[i];
-                    A[e] = this.ss[i];
-                    r && (r[e] = this.es[i]);
-                    n && (n[e] = this.rs[i]);
-                    e = l[e];
-                    p.set(u, e);
+                    y[e] = this.ns[i];
+                    A[e] = this.hs[i];
+                    r && (r[e] = this.fs[i]);
+                    n && (n[e] = this.cs[i]);
+                    e = p[e];
+                    u.set(l, e);
                 } else {
-                    (d ??= []).push(this.ss[i]);
+                    (d ??= []).push(this.hs[i]);
                     if (false && attrHooks !== null) ;
                 }
             }
             // 2) create new rows into the temp arrays; an abort disposes only these
                         try {
-                for (e = o; e <= c; e++) {
+                for (e = h; e <= c; e++) {
                     if (A[e] !== undefined) continue;
                     (w ??= []).push(A[e] = createOwner());
                     if (false && attrHooks !== null) ;
-                    y[e] = runWithOwner(A[e], h);
+                    y[e] = runWithOwner(A[e], o);
                 }
             } catch (t) {
                 if (w) for (i = 0; i < w.length; i++) w[i].dispose();
@@ -191,40 +342,40 @@ function updateKeyedMap() {
             // 3) commit: land the retained prefix and suffix plus the staged window
             // into the fresh arrays, swap them in (new identity for downstream
             // change propagation), then dispose exited rows
-                        for (i = 0; i < o; i++) {
-                y[i] = this.ts[i];
-                A[i] = this.ss[i];
-                r && (r[i] = this.es[i]);
-                n && (n[i] = this.rs[i]);
+                        for (i = 0; i < h; i++) {
+                y[i] = this.ns[i];
+                A[i] = this.hs[i];
+                r && (r[i] = this.fs[i]);
+                n && (n[i] = this.cs[i]);
             }
-            for (e = o; e <= c; e++) {
+            for (e = h; e <= c; e++) {
                 if (r) setSignal(r[e], t[e]);
                 if (n) setSignal(n[e], e);
             }
             for (e = c + 1; e < s; e++) {
-                y[e] = this.ts[e - _];
-                A[e] = this.ss[e - _];
+                y[e] = this.ns[e - _];
+                A[e] = this.hs[e - _];
                 if (r) {
-                    r[e] = this.es[e - _];
+                    r[e] = this.fs[e - _];
                     setSignal(r[e], t[e]);
                 }
                 if (n) {
-                    n[e] = this.rs[e - _];
+                    n[e] = this.cs[e - _];
                     if (_ !== 0) setSignal(n[e], e);
                 }
             }
-            this.ts = y;
-            this.ss = A;
-            r && (this.es = r);
-            n && (this.rs = n);
-            this.Jt = s;
+            this.ns = y;
+            this.hs = A;
+            r && (this.fs = r);
+            n && (this.cs = n);
+            this.ts = s;
             // save a copy of the mapped items for the next update
-                        this.Yt = t.slice(0);
+                        this.es = t.slice(0);
             if (d) for (i = 0; i < d.length; i++) d[i].dispose();
             if (false && attrHooks !== null && m !== undefined && O !== undefined) ;
         }
     });
-    return this.ts;
+    return this.ns;
 }
 
 /**
@@ -244,21 +395,21 @@ function updateKeyedMap() {
  */ function repeat(t, s, i) {
     const e = s;
     const r = {
-        $t: createOwner(),
-        Jt: 0,
-        cs: 0,
-        fs: t,
-        Zt: e,
-        ss: [],
-        ts: [],
-        us: i?.from,
-        hs: i?.fallback
+        se: createOwner(),
+        ts: 0,
+        ps: 0,
+        ds: t,
+        rs: e,
+        hs: [],
+        ns: [],
+        ws: i?.from,
+        us: i?.fallback
     };
     const n = computed(updateRepeat.bind(r));
     // Same as mapArray: untracked reads inside the internal owner resolve via
     // _parentComputed, so async reads in row callbacks register with the node
     // (pending tracking + post-settle retry) instead of vanishing.
-        r.$t.Pt = n;
+        r.se.Qt = n;
     n.T &= ~CONFIG_AUTO_DISPOSE;
     return accessor(n);
 }
@@ -271,55 +422,55 @@ function updateKeyedMap() {
 // for the post-settle retry. The overlap math also subsumes the previous
 // disjoint-window/front-clear/end-clear/shift special cases.
 function updateRepeat() {
-    const t = this.fs();
-    const s = this.us?.() || 0;
-    runWithOwner(this.$t, () => {
+    const t = this.ds();
+    const s = this.ws?.() || 0;
+    runWithOwner(this.se, () => {
         if (t === 0) {
-            if (this.Jt !== 0) {
-                this.$t.dispose(false);
-                this.ss = [];
-                this.ts = [];
-                this.Jt = 0;
+            if (this.ts !== 0) {
+                this.se.dispose(false);
+                this.hs = [];
+                this.ns = [];
+                this.ts = 0;
                 // Reset offset to match the cleared data (#2767, repro 2).
-                                this.cs = 0;
+                                this.ps = 0;
             }
-            if (this.hs && !this.ts[0]) {
+            if (this.us && !this.ns[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.ss[0]?.dispose();
-                this.ts[0] = runWithOwner(this.ss[0] = createOwner(), this.hs);
+                this.hs[0]?.dispose();
+                this.ns[0] = runWithOwner(this.hs[0] = createOwner(), this.us);
             }
             return;
         }
         const i = s + t;
-        const e = this.cs + this.Jt;
+        const e = this.ps + this.ts;
         // Retained overlap [keepStart, keepEnd) in global indexes; empty when the
         // windows are disjoint or when coming from empty/fallback.
-                const r = Math.max(s, this.cs);
+                const r = Math.max(s, this.ps);
         const n = Math.min(i, e);
-        const h = new Array(t);
         const o = new Array(t);
+        const h = new Array(t);
         for (let t = r; t < n; t++) {
-            o[t - s] = this.ss[t - this.cs];
-            h[t - s] = this.ts[t - this.cs];
+            h[t - s] = this.hs[t - this.ps];
+            o[t - s] = this.ns[t - this.ps];
         }
         try {
             for (let t = s; t < i; t++) {
                 if (t >= r && t < n) continue;
-                h[t - s] = runWithOwner(o[t - s] = createOwner(), () => this.Zt(t));
+                o[t - s] = runWithOwner(h[t - s] = createOwner(), () => this.rs(t));
             }
         } catch (t) {
-            for (let t = s; t < i; t++) if ((t < r || t >= n) && o[t - s]) o[t - s].dispose();
+            for (let t = s; t < i; t++) if ((t < r || t >= n) && h[t - s]) h[t - s].dispose();
             throw t;
         }
         // commit: dispose the previous fallback or the rows leaving the window
-                if (this.Jt === 0) this.ss[0]?.dispose(); else for (let t = this.cs; t < e; t++) if (t < s || t >= i) this.ss[t - this.cs].dispose();
-        this.ts = h;
-        this.ss = o;
-        this.cs = s;
-        this.Jt = t;
+                if (this.ts === 0) this.hs[0]?.dispose(); else for (let t = this.ps; t < e; t++) if (t < s || t >= i) this.hs[t - this.ps].dispose();
+        this.ns = o;
+        this.hs = h;
+        this.ps = s;
+        this.ts = t;
     });
-    return this.ts;
+    return this.ns;
 }
 
 function compare(t, s, i) {