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

package/dist/observe/map.js

@@ -0,0 +1,482 @@
+import { computed, runWithOwner, signal, setSignal } from "./core/core.js";
+
+import { createOwner } from "./core/owner.js";
+
+import "./core/scheduler.js";
+
+import { CONFIG_AUTO_DISPOSE } from "./core/constants.js";
+
+import { attrHooks } from "./core/attribution-hooks.js";
+
+import "./core/invariants.js";
+
+import "./core/verdict.js";
+
+import "./core/effect.js";
+
+import { accessor } from "./signals.js";
+
+import { $TRACK } from "./store/store.js";
+
+import "./store/next/store.js";
+
+function mapArray(t, s, i) {
+    const e = typeof i?.keyed === "function" ? i.keyed : undefined;
+    const r = s.length > 1;
+    const n = s;
+    const o = {
+        an: createOwner(),
+        ts: 0,
+        ss: t,
+        es: [],
+        rs: n,
+        ns: [],
+        hs: [],
+        _n: e,
+        fs: e || i?.keyed === false ? [] : undefined,
+        cs: r && i?.keyed !== false ? [] : undefined,
+        us: i?.keyed === false,
+        ls: i?.fallback
+    };
+    const h = computed(updateKeyedMap.bind(o), i?.name ? {
+        name: i.name
+    } : undefined);
+    // Untracked reads inside the internal owner resolve via _parentComputed; routing
+    // them through node lets store-proxy lookups see pending writes (not stale _value).
+        o.an.ln = h;
+    h.T &= ~CONFIG_AUTO_DISPOSE;
+    return accessor(h);
+}
+
+const pureOptions = {
+    ownedWrite: true
+};
+
+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 u = e;
+    let l = false;
+    while (a <= n && u <= i - 1) {
+        const t = r[a];
+        const e = s[u];
+        if (t === e) {
+            if (!l) {
+                f.push(a, u, 0);
+                l = true;
+            }
+            f[f.length - 1]++;
+            a++;
+            u++;
+            continue;
+        }
+        l = false;
+        // Bounded realignment lookahead, shorter distance wins.
+                let d = -1;
+        let p = Math.min(32 - o.length, n - a, c);
+        for (let t = 1; t <= p; t++) {
+            if (r[a + t] === e) {
+                d = t;
+                break;
+            }
+        }
+        c -= d === -1 ? p : d;
+        let w = -1;
+        p = Math.min(32 - h.length, i - 1 - u, c);
+        for (let i = 1; i <= p; i++) {
+            if (s[u + i] === t) {
+                w = i;
+                break;
+            }
+        }
+        c -= w === -1 ? p : w;
+        if (d !== -1 && (w === -1 || d <= w)) {
+            while (d-- > 0) o.push(a++);
+            continue;
+        }
+        if (w !== -1) {
+            while (w-- > 0) h.push(u++);
+            continue;
+        }
+        if (c <= 0 || o.length === 32 || h.length === 32) return false;
+        o.push(a++);
+        h.push(u++);
+    }
+    for (;a <= n; a++) {
+        if (o.length === 32) return false;
+        o.push(a);
+    }
+    for (;u <= i - 1; u++) {
+        if (h.length === 32) return false;
+        h.push(u);
+    }
+    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 u = t.hs;
+    const l = a.slice(0, i);
+    const d = u.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++) {
+                l[i + e] = a[s + e];
+                d[i + e] = u[s + e];
+            }
+        }
+    }
+    for (f = 0; f < r.length; f++) {
+        const t = r[f] >> 6;
+        const s = e[r[f] & 63];
+        l[t] = a[s];
+        d[t] = u[s];
+    }
+    t.ns = l;
+    t.hs = d;
+    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]) u[e[h]].dispose();
+    }
+    return true;
+}
+
+function updateKeyedMap() {
+    const t = this.ss() || [], s = t.length;
+    t[$TRACK];
+ // top level tracking
+        runWithOwner(this.an, () => {
+        let i, e, r, n, 
+        // Mappers write freshly-created row/index signals into the STAGE
+        // arrays (`rows`/`indexes`), never into `this._rows`/`this._indexes`.
+        o = this.fs ? this.us ? () => {
+            r[e] = signal(t[e], pureOptions);
+            return this.rs(accessor(r[e]), e);
+        } : () => {
+            r[e] = signal(t[e], pureOptions);
+            n && (n[e] = signal(e, pureOptions));
+            return this.rs(accessor(r[e]), n ? accessor(n[e]) : undefined);
+        } : this.cs ? () => {
+            const s = t[e];
+            n[e] = signal(e, pureOptions);
+            return this.rs(s, accessor(n[e]));
+        } : () => {
+            const s = t[e];
+            return this.rs(s);
+        };
+        // fast path for empty arrays
+                if (s === 0) {
+            if (this.ts !== 0) {
+                this.an.dispose(false);
+                this.hs = [];
+                this.es = [];
+                this.ns = [];
+                this.ts = 0;
+                this.fs && (this.fs = []);
+                this.cs && (this.cs = []);
+            }
+            if (this.ls && !this.ns[0]) {
+                // an aborted fallback attempt leaves an owner without a mapping;
+                // dispose it before re-creating
+                this.hs[0]?.dispose();
+                this.ns[0] = runWithOwner(this.hs[0] = createOwner(), this.ls);
+            }
+        }
+        // fast path for new create
+         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++) h[e] = runWithOwner(f[e] = createOwner(), o);
+            } catch (t) {
+                for (i = 0; i <= e; i++) f[i]?.dispose();
+                throw t;
+            }
+            // commit
+                        if (this.hs[0]) this.hs[0].dispose();
+ // previous fallback
+                        this.ns = h;
+            this.hs = f;
+            r && (this.fs = r);
+            n && (this.cs = n);
+            this.es = t.slice(0);
+            this.ts = s;
+        } else {
+            let h, f, c, a, u, l, d, p, w, 
+            // Dev (attribution engine installed): the items behind the exited and
+            // entered rows, for the list-identity census.
+            m, O;
+            // skip common prefix
+                        for (h = 0, f = Math.min(this.ts, s); h < f && (this.es[h] === t[h] || this.fs && compare(this._n, 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 (f = this.ts - 1, c = s - 1; f >= h && c >= h && (this.es[f] === t[c] || this.fs && compare(this._n, 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 (h === s && this.ts === s) {
+                this.es = 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 (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.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
+                        l = new Map;
+            d = new Array(c + 1);
+            for (e = c; e >= h; e--) {
+                a = t[e];
+                u = this._n ? this._n(a) : a;
+                i = l.get(u);
+                d[e] = i === undefined ? -1 : i;
+                l.set(u, 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 = h; i <= f; i++) {
+                a = this.es[i];
+                u = this._n ? this._n(a) : a;
+                e = l.get(u);
+                if (e !== undefined && e !== -1) {
+                    y[e] = this.ns[i];
+                    A[e] = this.hs[i];
+                    r && (r[e] = this.fs[i]);
+                    n && (n[e] = this.cs[i]);
+                    e = d[e];
+                    l.set(u, e);
+                } else {
+                    (p ??= []).push(this.hs[i]);
+                    if (true && attrHooks !== null) (m ??= []).push(a);
+                }
+            }
+            // 2) create new rows into the temp arrays; an abort disposes only these
+                        try {
+                for (e = h; e <= c; e++) {
+                    if (A[e] !== undefined) continue;
+                    (w ??= []).push(A[e] = createOwner());
+                    if (true && attrHooks !== null) (O ??= []).push(t[e]);
+                    y[e] = runWithOwner(A[e], o);
+                }
+            } catch (t) {
+                if (w) for (i = 0; i < w.length; i++) w[i].dispose();
+                throw t;
+            }
+            // 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 < 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 = 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.ns[e - _];
+                A[e] = this.hs[e - _];
+                if (r) {
+                    r[e] = this.fs[e - _];
+                    setSignal(r[e], t[e]);
+                }
+                if (n) {
+                    n[e] = this.cs[e - _];
+                    if (_ !== 0) setSignal(n[e], e);
+                }
+            }
+            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.es = t.slice(0);
+            if (p) for (i = 0; i < p.length; i++) p[i].dispose();
+            if (true && attrHooks !== null && m !== undefined && O !== undefined) attrHooks.listChurn(this.an.ln, m, O, s, this._n !== undefined);
+        }
+    });
+    return this.ns;
+}
+
+/**
+ * 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://docs.solidjs.com/reference/reactive-utilities/repeat
+ */ function repeat(t, s, i) {
+    const e = s;
+    const r = {
+        an: createOwner(),
+        ts: 0,
+        ds: 0,
+        ps: t,
+        rs: e,
+        hs: [],
+        ns: [],
+        ws: i?.from,
+        ls: 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.an.ln = n;
+    n.T &= ~CONFIG_AUTO_DISPOSE;
+    return accessor(n);
+}
+
+// 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() {
+    const t = this.ps();
+    const s = this.ws?.() || 0;
+    runWithOwner(this.an, () => {
+        if (t === 0) {
+            if (this.ts !== 0) {
+                this.an.dispose(false);
+                this.hs = [];
+                this.ns = [];
+                this.ts = 0;
+                // Reset offset to match the cleared data (#2767, repro 2).
+                                this.ds = 0;
+            }
+            if (this.ls && !this.ns[0]) {
+                // an aborted fallback attempt leaves an owner without a mapping;
+                // dispose it before re-creating
+                this.hs[0]?.dispose();
+                this.ns[0] = runWithOwner(this.hs[0] = createOwner(), this.ls);
+            }
+            return;
+        }
+        const i = s + t;
+        const e = this.ds + 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.ds);
+        const n = Math.min(i, e);
+        const o = new Array(t);
+        const h = new Array(t);
+        for (let t = r; t < n; t++) {
+            h[t - s] = this.hs[t - this.ds];
+            o[t - s] = this.ns[t - this.ds];
+        }
+        try {
+            for (let t = s; t < i; t++) {
+                if (t >= r && t < n) continue;
+                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) && h[t - s]) h[t - s].dispose();
+            throw t;
+        }
+        // commit: dispose the previous fallback or the rows leaving the window
+                if (this.ts === 0) this.hs[0]?.dispose(); else for (let t = this.ds; t < e; t++) if (t < s || t >= i) this.hs[t - this.ds].dispose();
+        this.ns = o;
+        this.hs = h;
+        this.ds = s;
+        this.ts = t;
+    });
+    return this.ns;
+}
+
+function compare(t, s, i) {
+    return t ? t(s) === t(i) : true;
+}
+
+export { mapArray, repeat };