@solidjs/signals 2.0.0-rc.2 → 2.0.0-rc.20

package/dist/observe/map.js

@@ -0,0 +1,593 @@
+import { computed, runWithOwner, signal, setSignal } from "./core/core.js";
+
+import "./core/verdict.js";
+
+import { CONFIG_AUTO_DISPOSE } from "./core/constants.js";
+
+import { attrHooks } from "./core/attribution-hooks.js";
+
+import "./core/dev.js";
+
+import "./core/scheduler.js";
+
+import { createOwner, getOwner } from "./core/owner.js";
+
+import "./core/effect.js";
+
+import { accessor } from "./signals.js";
+
+import { $TRACK, shallowView, $TARGET } from "./store/types.js";
+
+function mapArray(t, e, i) {
+    const s = typeof i?.keyed === "function" ? i.keyed : undefined;
+    const n = e.length > 1;
+    const r = e;
+    const o = {
+        H: createOwner(),
+        wt: 0,
+        Mt: t,
+        Wt: [],
+        vt: r,
+        Kt: [],
+        Ye: [],
+        gt: s,
+        $t: s || i?.keyed === false ? [] : undefined,
+        xt: n && i?.keyed !== false ? [] : undefined,
+        Ut: i?.keyed === false,
+        L: i?.fallback
+    };
+    const f = computed(updateKeyedMap.bind(o), i?.name ? {
+        name: i.name
+    } : undefined);
+    f.l &= ~CONFIG_AUTO_DISPOSE;
+    return accessor(f);
+}
+
+const pureOptions = {
+    ownedWrite: true
+};
+
+function trySmallMove(t, e, i, s) {
+    const n = t.Wt;
+    const r = t.wt - 1;
+    const o = [];
+    const f = [];
+    const h = [];
+ // flat triples: oldStart, newStart, length
+        let c = 256;
+    let a = s;
+    let l = s;
+    let u = false;
+    while (a <= r && l <= i - 1) {
+        const t = n[a];
+        const s = e[l];
+        if (t === s) {
+            if (!u) {
+                h.push(a, l, 0);
+                u = true;
+            }
+            h[h.length - 1]++;
+            a++;
+            l++;
+            continue;
+        }
+        u = false;
+        // Bounded realignment lookahead, shorter distance wins.
+                let d = -1;
+        let w = Math.min(32 - o.length, r - a, c);
+        for (let t = 1; t <= w; t++) {
+            if (n[a + t] === s) {
+                d = t;
+                break;
+            }
+        }
+        c -= d === -1 ? w : d;
+        let p = -1;
+        w = Math.min(32 - f.length, i - 1 - l, c);
+        for (let i = 1; i <= w; i++) {
+            if (e[l + i] === t) {
+                p = i;
+                break;
+            }
+        }
+        c -= p === -1 ? w : p;
+        if (d !== -1 && (p === -1 || d <= p)) {
+            while (d-- > 0) o.push(a++);
+            continue;
+        }
+        if (p !== -1) {
+            while (p-- > 0) f.push(l++);
+            continue;
+        }
+        if (c <= 0 || o.length === 32 || f.length === 32) return false;
+        o.push(a++);
+        f.push(l++);
+    }
+    for (;a <= r; a++) {
+        if (o.length === 32) return false;
+        o.push(a);
+    }
+    for (;l <= i - 1; l++) {
+        if (f.length === 32) return false;
+        f.push(l);
+    }
+    return commitSmallMove(t, e, i, o, f, h);
+}
+
+/** 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, e, i, s, n, r) {
+    const o = t.Wt;
+    let f;
+    let h;
+    let c;
+    if (n.length !== 0) {
+        c = new Array(s.length);
+        for (h = 0; h < n.length; h++) {
+            let t = -1;
+            for (f = 0; f < s.length; f++) {
+                if (!c[f] && o[s[f]] === e[n[h]]) {
+                    t = f;
+                    break;
+                }
+            }
+            if (t === -1) return false;
+            c[t] = true;
+            n[h] = n[h] << 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 (s.length !== 0 || n.length !== 0) {
+        const t = new Set;
+        for (f = 0; f < s.length; f++) t.add(o[s[f]]);
+        for (h = 0; h < n.length; h++) t.add(e[n[h] >> 6]);
+        for (let e = 0; e < r.length; e += 3) {
+            const i = r[e];
+            for (let s = 0, n = r[e + 2]; s < n; s++) if (t.has(o[i + s])) return false;
+        }
+    }
+    const a = t.Kt;
+    const l = t.Ye;
+    const u = a.slice(0, i);
+    const d = l.slice(0, i);
+    for (let t = 0; t < r.length; t += 3) {
+        const e = r[t];
+        const i = r[t + 1];
+        if (e !== i) {
+            for (let s = 0; s < r[t + 2]; s++) {
+                u[i + s] = a[e + s];
+                d[i + s] = l[e + s];
+            }
+        }
+    }
+    for (h = 0; h < n.length; h++) {
+        const t = n[h] >> 6;
+        const e = s[n[h] & 63];
+        u[t] = a[e];
+        d[t] = l[e];
+    }
+    t.Kt = u;
+    t.Ye = d;
+    t.wt = i;
+    t.Wt = e.slice(0);
+    // Dispose unmatched sources LAST (general-path ordering).
+        for (f = 0; f < s.length; f++) {
+        if (c === undefined || !c[f]) l[s[f]].dispose();
+    }
+    return true;
+}
+
+/** Stage a PURE REMOVAL without the key map: when the new window is the old
+ * window with items dropped, in order (one-item removals, every-nth, the
+ * table filters), a two-pointer walk lands every survivor in the window
+ * stage with one key call per item and returns the leavers; a shape that is
+ * not an ordered subsequence returns null with the node stage cleared, and
+ * the map path below starts from scratch (it rewrites every window slot of
+ * `temp` / `rows` / `indexes`, so only `tempNodes`' `!== undefined` probe
+ * needs the reset). The stage arrays are scratch — nothing live is touched. */ function stageRemoval(t, e, i, s, n, r, o, f, h) {
+    const c = t.gt;
+    const a = t.Wt;
+    const l = t.Ye;
+    const u = [];
+    let d = i;
+    for (let w = i; w <= n; d++, w++) {
+        const n = c ? c(e[w]) : e[w];
+        while (d <= s && (c ? c(a[d]) : a[d]) !== n) u.push(l[d++]);
+        if (d > s) {
+            o.fill(undefined);
+            return null;
+        }
+        r[w] = t.Kt[d];
+        o[w - i] = l[d];
+        if (f) f[w - i] = t.$t[d];
+        if (h) h[w - i] = t.xt[d];
+    }
+    for (;d <= s; d++) u.push(l[d]);
+    return u;
+}
+
+/** Land a staged window into the live bookkeeping arrays in place: shift the
+ * suffix by `dif` (a loop walked from the side that never overwrites an
+ * unread slot), take the window from the stage, write survivors' row and
+ * index signals. Its own function so the general path's body stays under
+ * the JIT's optimization budget — the inlined commit measured ~10% slower on
+ * full-window reorders (the small-move note has the same finding). */ function commitWindow(t, e, i, s, n, r, o, f, h) {
+    const c = t.Ye;
+    const a = t.$t;
+    const l = t.xt;
+    const u = t.wt;
+    const d = i - u;
+    let w, p;
+    if (d > 0) {
+        // Grow first: a store past the end from the top is a third slower than
+        // filling a pre-sized tail (measured on 1k refs, 2026-10-15).
+        c.length = i;
+        if (a) a.length = i;
+        if (l) l.length = i;
+        for (w = u - 1, p = i - 1; w > n; w--, p--) {
+            c[p] = c[w];
+            if (a) a[p] = a[w];
+            if (l) l[p] = l[w];
+        }
+    } else if (d < 0) {
+        for (w = n + 1, p = r + 1; w < u; w++, p++) {
+            c[p] = c[w];
+            if (a) a[p] = a[w];
+            if (l) l[p] = l[w];
+        }
+        c.length = i;
+        if (a) a.length = i;
+        if (l) l.length = i;
+    }
+    for (p = s; p <= r; p++) {
+        c[p] = o[p - s];
+        if (a) setSignal(a[p] = f[p - s], e[p]);
+        if (l) setSignal(l[p] = h[p - s], p);
+    }
+    for (p = r + 1; p < i; p++) {
+        if (a) setSignal(a[p], e[p]);
+        if (l && d !== 0) setSignal(l[p], p);
+    }
+}
+
+function updateKeyedMap() {
+    // Untracked reads inside the internal owner resolve via _parentComputed:
+    // routed through the node, a store-proxy lookup sees pending writes (not a
+    // stale _value) and an async read in a row callback registers the node as
+    // the flight's reader (pending tracking + post-settle retry) instead of
+    // vanishing. Set per pass: the first pass runs inside `computed()`, before
+    // the node exists to the caller.
+    this.H.Ht = getOwner();
+    let t = this.Mt() || [];
+    t[$TRACK];
+ // top level tracking (a store array's container node)
+    // A shallow store array diffs its backing: its slots are raw records, and
+    // a trap per slot read was most of a one-row write on a 1k-row list.
+        t = shallowView?.(t[$TARGET]) ?? t;
+    const e = t.length;
+    runWithOwner(this.H, () => {
+        let i, s, 
+        // The stage slot a mapper writes its row/index signal into: `j` on the
+        // create-all path, `j - start` on the general path, whose stage arrays
+        // are sized to the changed WINDOW, not the list.
+        n, r, o, 
+        // Mappers write freshly-created row/index signals into the STAGE
+        // arrays (`rows`/`indexes`), never into `this._rows`/`this._indexes`.
+        f = this.$t ? this.Ut ? () => {
+            r[n] = signal(t[s], pureOptions);
+            return this.vt(accessor(r[n]), s);
+        } : () => {
+            r[n] = signal(t[s], pureOptions);
+            o && (o[n] = signal(s, pureOptions));
+            return this.vt(accessor(r[n]), o ? accessor(o[n]) : undefined);
+        } : this.xt ? () => {
+            const e = t[s];
+            o[n] = signal(s, pureOptions);
+            return this.vt(e, accessor(o[n]));
+        } : () => {
+            const e = t[s];
+            return this.vt(e);
+        };
+        // fast path for empty arrays
+                if (e === 0) {
+            if (this.wt !== 0) {
+                this.H.dispose(false);
+                this.Ye = [];
+                this.Wt = [];
+                this.Kt = [];
+                this.wt = 0;
+                this.$t && (this.$t = []);
+                this.xt && (this.xt = []);
+            }
+            if (this.L && !this.Kt.length) {
+                // an aborted fallback attempt leaves an owner without a mapping;
+                // dispose it before re-creating
+                this.Ye[0]?.dispose();
+                this.Kt[0] = runWithOwner(this.Ye[0] = createOwner(), this.L);
+            }
+        }
+        // fast path for new create
+         else if (this.wt === 0) {
+            const h = new Array(e);
+            const c = new Array(e);
+            r = this.$t && new Array(e);
+            o = this.xt && new Array(e);
+            try {
+                for (s = 0; s < e; s++) {
+                    n = s;
+                    h[s] = runWithOwner(c[s] = createOwner(), f);
+                }
+            } catch (t) {
+                for (i = 0; i <= s; i++) c[i]?.dispose();
+                throw t;
+            }
+            // commit
+                        if (this.Ye[0]) this.Ye[0].dispose();
+ // previous fallback
+                        this.Kt = h;
+            this.Ye = c;
+            r && (this.$t = r);
+            o && (this.xt = o);
+            this.Wt = t.slice(0);
+            this.wt = e;
+        } else {
+            let h, c, a, l, u, d, w, p, m, 
+            // Dev (attribution engine installed): the items behind the exited and
+            // entered rows, for the list-identity census.
+            O, _;
+            // The pass's write to a per-slot signal (a row accessor in index mode,
+            // an index accessor in keyed mode). The list's frame lives in these
+            // writes as much as in the computed's result, so under a LANE pass they
+            // are the lane's frame too (F1): a plain `setSignal` staged them into
+            // the action's transaction and the row readers were served the
+            // committed value until the action landed — `<For>` without `keyed`
+            // showed the pre-action list for the whole action while the keyed modes
+            // showed the optimistic one. The engine publishes the write as a
+            // derived override on the slot (lanes stage, A17) and lands or
+            // supersedes it when a plain pass later writes a slot still carrying
+            // one (A18) — `landOnOverride`'s slot arm. Decided once per pass, not
+            // per slot: a lane pass marks the map (`_laneSlots`: its slots may
+            // carry overrides), a marked map routes every slot write through the
+            // engine while any lane is live — a slot's override resolves with its
+            // lane's transaction, or with the batch for an orphan lane
+            // (resolveOptimisticNodes, then cleanupCompletedLanes, both before the
+            // completion wakes any recompute), so a pass that finds no lane live
+            // knows the slots are clean and drops the mark — and an unmarked map
+            // takes `setSignal` directly. The engine is installed whenever a lane
+            // is active.
+            // CARVE 2: the lane-slot arm (`_landOnOverride`, F1) went with the engine.
+                        const y = setSignal;
+            // skip common prefix
+                        for (h = 0, c = Math.min(this.wt, e); h < c && (this.Wt[h] === t[h] || this.$t && compare(this.gt, this.Wt[h], t[h])); h++) {
+                if (this.$t) y(this.$t[h], t[h]);
+            }
+            // skip common suffix — counted only; retained entries land in one pass
+            // at commit instead of being staged and copied twice
+                        for (c = this.wt - 1, a = e - 1; c >= h && a >= h && (this.Wt[c] === t[a] || this.$t && compare(this.gt, this.Wt[c], t[a])); c--, 
+            a--) ;
+            // 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 (h === e && this.wt === e) {
+                this.Wt = t.slice(0);
+                return;
+            }
+            // 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 (e <= this.wt && c - h > 64 && this.$t === undefined && this.xt === 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 + (a - h >> 1);
+                const s = t[i];
+                const n = Math.min(c, i + 32);
+                let r = Math.max(h, i - 32);
+                while (r <= n && this.Wt[r] !== s) r++;
+                if (r <= n && trySmallMove(this, t, e, h)) return;
+            }
+            const A = e - this.wt;
+            // WINDOW-SIZED STAGING, IN-PLACE COMMIT (2026-10-15). The strong-abort
+            // contract (#2903) only needs the pass to touch nothing live before
+            // every mapper has succeeded; it never needed four fresh newLen-sized
+            // arrays. Only the changed window [start, newEnd] is staged — the
+            // prefix and suffix are, by construction, the rows that did not move
+            // relative to each other — and at commit the bookkeeping arrays
+            // (`_nodes`, `_rows`, `_indexes`) take the window in place with the
+            // suffix shifted by a plain loop (`copyWithin` is a generic
+            // per-element builtin in V8 — 30× slower than the loop on 1k refs,
+            // measured 2026-10-15). `_mappings` alone is
+            // rebuilt: its fresh identity is the change signal downstream relies
+            // on. A one-row edit on a 500-row list used to allocate ~20 KB of
+            // staging plus a position-sized chain array per commit (uibench's
+            // one-item tree ops at 4–6× Octane, jfb-reorder `removefirst` at
+            // 2.5×); now it stages one slot.
+                        const g = a - h + 1;
+            const S = new Array(e);
+            const M = new Array(g);
+            r = this.$t ? new Array(g) : undefined;
+            o = this.xt ? new Array(g) : undefined;
+            // A shrinking pass is tried as a pure removal first (stageRemoval: no
+            // key map, one key call per item); anything else takes the map path.
+                        const k = A < 0 ? stageRemoval(this, t, h, c, a, S, M, r, o) : null;
+            if (k !== null) {
+                // (The list-churn census below wants removals AND creations in one
+                // pass; a pure removal has none, so no item ledger is kept here.)
+                if (k.length !== 0) p = k;
+            } else {
+                // 0) prepare a map of all indices in the changed window of newItems,
+                // scanning backwards so we encounter them in natural order
+                d = new Map;
+                w = new Array(g);
+                for (s = a; s >= h; s--) {
+                    l = t[s];
+                    u = this.gt ? this.gt(l) : l;
+                    i = d.get(u);
+                    w[s - h] = i === undefined ? -1 : i;
+                    d.set(u, s);
+                }
+                // 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 = h; i <= c; i++) {
+                    l = this.Wt[i];
+                    u = this.gt ? this.gt(l) : l;
+                    s = d.get(u);
+                    if (s !== undefined && s !== -1) {
+                        S[s] = this.Kt[i];
+                        M[s - h] = this.Ye[i];
+                        r && (r[s - h] = this.$t[i]);
+                        o && (o[s - h] = this.xt[i]);
+                        s = w[s - h];
+                        d.set(u, s);
+                    } else {
+                        (p ??= []).push(this.Ye[i]);
+                        if (true && attrHooks !== null) (O ??= []).push(l);
+                    }
+                }
+                // 2) create new rows into the window stage; an abort disposes only these
+                                try {
+                    for (s = h; s <= a; s++) {
+                        if (M[s - h] !== undefined) continue;
+                        (m ??= []).push(M[s - h] = createOwner());
+                        if (true && attrHooks !== null) (_ ??= []).push(t[s]);
+                        n = s - h;
+                        S[s] = runWithOwner(M[s - h], f);
+                    }
+                } catch (t) {
+                    if (m) for (i = 0; i < m.length; i++) m[i].dispose();
+                    throw t;
+                }
+            }
+            // 3) commit: the retained prefix and suffix land in the fresh mapped
+            // array; the bookkeeping arrays take the staged window IN PLACE (own
+            // function: kept out of this body on purpose, see commitWindow); then
+            // the exited rows dispose
+                        for (i = 0; i < h; i++) S[i] = this.Kt[i];
+            for (s = a + 1; s < e; s++) S[s] = this.Kt[s - A];
+            commitWindow(this, t, e, h, c, a, M, r, o);
+            this.Kt = S;
+            this.wt = e;
+            // save a copy of the mapped items for the next update
+                        this.Wt = t.slice(0);
+            if (p) for (i = 0; i < p.length; i++) p[i].dispose();
+            if (true && attrHooks !== null && O !== undefined && _ !== undefined) attrHooks.listChurn(this.H.Ht, O, _, e, this.gt !== undefined);
+        }
+    });
+    return this.Kt;
+}
+
+/**
+ * Reactively renders a callback `count` times, reusing previously-rendered
+ * entries when only the count changes. Underlying helper for `<Repeat>`.
+ *
+ * - `options.from` — start index (default `0`); useful for offset/windowed
+ *   rendering.
+ * - `options.fallback` — accessor returning a value to show when count is `0`.
+ *
+ * @example
+ * ```ts
+ * const view = repeat(count, i => `Item ${i}`, { fallback: () => "empty" });
+ * ```
+ *
+ * @description https://v2.solidjs.com/reference/solid-js/advanced/jsx-component-primitives/repeat
+ */ function repeat(t, e, i) {
+    const s = e;
+    const n = {
+        H: createOwner(),
+        wt: 0,
+        qt: 0,
+        zt: t,
+        vt: s,
+        Ye: [],
+        Kt: [],
+        Bt: i?.from,
+        L: i?.fallback
+    };
+    const r = computed(updateRepeat.bind(n));
+    r.l &= ~CONFIG_AUTO_DISPOSE;
+    return accessor(r);
+}
+
+// Same staged-commit discipline as `updateKeyedMap` (#2903): the retained
+// window overlap is copied into fresh arrays, missing indexes are created
+// into them, and `this` is only touched — including disposal of rows leaving
+// the window — after every `_map` call succeeded. A NotReadyError mid-pass
+// disposes only the owners this pass created and leaves prior state intact
+// for the post-settle retry. The overlap math also subsumes the previous
+// disjoint-window/front-clear/end-clear/shift special cases.
+function updateRepeat() {
+    // As in updateKeyedMap: the node is the row callbacks' reader, per pass.
+    this.H.Ht = getOwner();
+    const t = this.zt();
+    const e = this.Bt?.() || 0;
+    runWithOwner(this.H, () => {
+        if (t === 0) {
+            if (this.wt !== 0) {
+                this.H.dispose(false);
+                this.Ye = [];
+                this.Kt = [];
+                this.wt = 0;
+                // Reset offset to match the cleared data (#2767, repro 2).
+                                this.qt = 0;
+            }
+            if (this.L && !this.Kt.length) {
+                // an aborted fallback attempt leaves an owner without a mapping;
+                // dispose it before re-creating
+                this.Ye[0]?.dispose();
+                this.Kt[0] = runWithOwner(this.Ye[0] = createOwner(), this.L);
+            }
+            return;
+        }
+        const i = e + t;
+        const s = this.qt + this.wt;
+        // Retained overlap [keepStart, keepEnd) in global indexes; empty when the
+        // windows are disjoint or when coming from empty/fallback.
+                const n = Math.max(e, this.qt);
+        const r = Math.min(i, s);
+        const o = new Array(t);
+        const f = new Array(t);
+        for (let t = n; t < r; t++) {
+            f[t - e] = this.Ye[t - this.qt];
+            o[t - e] = this.Kt[t - this.qt];
+        }
+        try {
+            for (let t = e; t < i; t++) {
+                if (t >= n && t < r) continue;
+                o[t - e] = runWithOwner(f[t - e] = createOwner(), () => this.vt(t));
+            }
+        } catch (t) {
+            for (let t = e; t < i; t++) if ((t < n || t >= r) && f[t - e]) f[t - e].dispose();
+            throw t;
+        }
+        // commit: dispose the previous fallback or the rows leaving the window
+                if (this.wt === 0) this.Ye[0]?.dispose(); else for (let t = this.qt; t < s; t++) if (t < e || t >= i) this.Ye[t - this.qt].dispose();
+        this.Kt = o;
+        this.Ye = f;
+        this.qt = e;
+        this.wt = t;
+    });
+    return this.Kt;
+}
+
+function compare(t, e, i) {
+    return t ? t(e) === t(i) : true;
+}
+
+export { mapArray, repeat };