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

package/dist/prod/map.js

@@ -23,23 +23,23 @@ function mapArray(t, s, i) {
     const r = s.length > 1;
     const n = s;
     const h = {
-        wt: createOwner(),
-        jt: 0,
-        Wt: t,
-        Mt: [],
-        xt: n,
+        jt: createOwner(),
+        Wt: 0,
+        xt: t,
         Kt: [],
-        Ft: [],
-        Ut: e,
-        $t: e || i?.keyed === false ? [] : undefined,
-        qt: r && i?.keyed !== false ? [] : undefined,
-        zt: i?.keyed === false,
-        Bt: i?.fallback
+        $t: n,
+        qt: [],
+        zt: [],
+        Jt: e,
+        Xt: e || i?.keyed === false ? [] : undefined,
+        Yt: r && i?.keyed !== false ? [] : undefined,
+        Zt: i?.keyed === false,
+        ts: i?.fallback
     };
     const o = computed(updateKeyedMap.bind(h));
     // Untracked reads inside the internal owner resolve via _parentComputed; routing
     // them through node lets store-proxy lookups see pending writes (not stale _value).
-        h.wt.It = o;
+        h.jt.Ot = o;
     o.T &= ~CONFIG_AUTO_DISPOSE;
     return accessor(o);
 }
@@ -58,52 +58,52 @@ const pureOptions = {
 // 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 updateKeyedMap() {
-    const t = this.Wt() || [], s = t.length;
+    const t = this.xt() || [], s = t.length;
     t[$TRACK];
  // top level tracking
-        runWithOwner(this.wt, () => {
+        runWithOwner(this.jt, () => {
         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.$t ? this.zt ? () => {
+        h = this.Xt ? this.Zt ? () => {
             r[e] = signal(t[e], pureOptions);
-            return this.xt(accessor(r[e]), e);
+            return this.$t(accessor(r[e]), e);
         } : () => {
             r[e] = signal(t[e], pureOptions);
             n && (n[e] = signal(e, pureOptions));
-            return this.xt(accessor(r[e]), n ? accessor(n[e]) : undefined);
-        } : this.qt ? () => {
+            return this.$t(accessor(r[e]), n ? accessor(n[e]) : undefined);
+        } : this.Yt ? () => {
             const s = t[e];
             n[e] = signal(e, pureOptions);
-            return this.xt(s, accessor(n[e]));
+            return this.$t(s, accessor(n[e]));
         } : () => {
             const s = t[e];
-            return this.xt(s);
+            return this.$t(s);
         };
         // fast path for empty arrays
                 if (s === 0) {
-            if (this.jt !== 0) {
-                this.wt.dispose(false);
-                this.Ft = [];
-                this.Mt = [];
+            if (this.Wt !== 0) {
+                this.jt.dispose(false);
+                this.zt = [];
                 this.Kt = [];
-                this.jt = 0;
-                this.$t && (this.$t = []);
-                this.qt && (this.qt = []);
+                this.qt = [];
+                this.Wt = 0;
+                this.Xt && (this.Xt = []);
+                this.Yt && (this.Yt = []);
             }
-            if (this.Bt && !this.Kt[0]) {
+            if (this.ts && !this.qt[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.Ft[0]?.dispose();
-                this.Kt[0] = runWithOwner(this.Ft[0] = createOwner(), this.Bt);
+                this.zt[0]?.dispose();
+                this.qt[0] = runWithOwner(this.zt[0] = createOwner(), this.ts);
             }
         }
         // fast path for new create
-         else if (this.jt === 0) {
+         else if (this.Wt === 0) {
             const o = new Array(s);
             const c = new Array(s);
-            r = this.$t && new Array(s);
-            n = this.qt && new Array(s);
+            r = this.Xt && new Array(s);
+            n = this.Yt && new Array(s);
             try {
                 for (e = 0; e < s; e++) o[e] = runWithOwner(c[e] = createOwner(), h);
             } catch (t) {
@@ -111,43 +111,43 @@ function updateKeyedMap() {
                 throw t;
             }
             // commit
-                        if (this.Ft[0]) this.Ft[0].dispose();
+                        if (this.zt[0]) this.zt[0].dispose();
  // previous fallback
-                        this.Kt = o;
-            this.Ft = c;
-            r && (this.$t = r);
-            n && (this.qt = n);
-            this.Mt = t.slice(0);
-            this.jt = s;
+                        this.qt = o;
+            this.zt = c;
+            r && (this.Xt = r);
+            n && (this.Yt = n);
+            this.Kt = t.slice(0);
+            this.Wt = s;
         } else {
             let o, c, a, f, u, p, w, l, d;
             // skip common prefix
-                        for (o = 0, c = Math.min(this.jt, s); o < c && (this.Mt[o] === t[o] || this.$t && compare(this.Ut, this.Mt[o], t[o])); o++) {
-                if (this.$t) setSignal(this.$t[o], t[o]);
+                        for (o = 0, c = Math.min(this.Wt, s); o < c && (this.Kt[o] === t[o] || this.Xt && compare(this.Jt, this.Kt[o], t[o])); o++) {
+                if (this.Xt) setSignal(this.Xt[o], t[o]);
             }
             // skip common suffix — counted only; retained entries land in one pass
             // at commit instead of being staged and copied twice
-                        for (c = this.jt - 1, a = s - 1; c >= o && a >= o && (this.Mt[c] === t[a] || this.$t && compare(this.Ut, this.Mt[c], t[a])); c--, 
+                        for (c = this.Wt - 1, a = s - 1; c >= o && a >= o && (this.Kt[c] === t[a] || this.Xt && compare(this.Jt, this.Kt[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 (o === s && this.jt === s) {
-                this.Mt = t.slice(0);
+                        if (o === s && this.Wt === s) {
+                this.Kt = t.slice(0);
                 return;
             }
-            const O = s - this.jt;
+            const O = s - this.Wt;
             const m = new Array(s);
             const _ = new Array(s);
-            r = this.$t ? new Array(s) : undefined;
-            n = this.qt ? new Array(s) : undefined;
+            r = this.Xt ? new Array(s) : undefined;
+            n = this.Yt ? 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;
             w = new Array(a + 1);
             for (e = a; e >= o; e--) {
                 f = t[e];
-                u = this.Ut ? this.Ut(f) : f;
+                u = this.Jt ? this.Jt(f) : f;
                 i = p.get(u);
                 w[e] = i === undefined ? -1 : i;
                 p.set(u, e);
@@ -156,17 +156,17 @@ function updateKeyedMap() {
             // in the new set; if so, stage them at their new positions; if not,
             // queue them for disposal at commit
                         for (i = o; i <= c; i++) {
-                f = this.Mt[i];
-                u = this.Ut ? this.Ut(f) : f;
+                f = this.Kt[i];
+                u = this.Jt ? this.Jt(f) : f;
                 e = p.get(u);
                 if (e !== undefined && e !== -1) {
-                    m[e] = this.Kt[i];
-                    _[e] = this.Ft[i];
-                    r && (r[e] = this.$t[i]);
-                    n && (n[e] = this.qt[i]);
+                    m[e] = this.qt[i];
+                    _[e] = this.zt[i];
+                    r && (r[e] = this.Xt[i]);
+                    n && (n[e] = this.Yt[i]);
                     e = w[e];
                     p.set(u, e);
-                } else (l ??= []).push(this.Ft[i]);
+                } else (l ??= []).push(this.zt[i]);
             }
             // 2) create new rows into the temp arrays; an abort disposes only these
                         try {
@@ -183,38 +183,38 @@ function updateKeyedMap() {
             // into the fresh arrays, swap them in (new identity for downstream
             // change propagation), then dispose exited rows
                         for (i = 0; i < o; i++) {
-                m[i] = this.Kt[i];
-                _[i] = this.Ft[i];
-                r && (r[i] = this.$t[i]);
-                n && (n[i] = this.qt[i]);
+                m[i] = this.qt[i];
+                _[i] = this.zt[i];
+                r && (r[i] = this.Xt[i]);
+                n && (n[i] = this.Yt[i]);
             }
             for (e = o; e <= a; e++) {
                 if (r) setSignal(r[e], t[e]);
                 if (n) setSignal(n[e], e);
             }
             for (e = a + 1; e < s; e++) {
-                m[e] = this.Kt[e - O];
-                _[e] = this.Ft[e - O];
+                m[e] = this.qt[e - O];
+                _[e] = this.zt[e - O];
                 if (r) {
-                    r[e] = this.$t[e - O];
+                    r[e] = this.Xt[e - O];
                     setSignal(r[e], t[e]);
                 }
                 if (n) {
-                    n[e] = this.qt[e - O];
+                    n[e] = this.Yt[e - O];
                     if (O !== 0) setSignal(n[e], e);
                 }
             }
-            this.Kt = m;
-            this.Ft = _;
-            r && (this.$t = r);
-            n && (this.qt = n);
-            this.jt = s;
+            this.qt = m;
+            this.zt = _;
+            r && (this.Xt = r);
+            n && (this.Yt = n);
+            this.Wt = s;
             // save a copy of the mapped items for the next update
-                        this.Mt = t.slice(0);
+                        this.Kt = t.slice(0);
             if (l) for (i = 0; i < l.length; i++) l[i].dispose();
         }
     });
-    return this.Kt;
+    return this.qt;
 }
 
 /**
@@ -234,21 +234,21 @@ function updateKeyedMap() {
  */ function repeat(t, s, i) {
     const e = s;
     const r = {
-        wt: createOwner(),
-        jt: 0,
-        Ht: 0,
-        Jt: t,
-        xt: e,
-        Ft: [],
-        Kt: [],
-        Vt: i?.from,
-        Bt: i?.fallback
+        jt: createOwner(),
+        Wt: 0,
+        ss: 0,
+        es: t,
+        $t: e,
+        zt: [],
+        qt: [],
+        rs: i?.from,
+        ts: 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.wt.It = n;
+        r.jt.Ot = n;
     n.T &= ~CONFIG_AUTO_DISPOSE;
     return accessor(n);
 }
@@ -261,55 +261,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.Jt();
-    const s = this.Vt?.() || 0;
-    runWithOwner(this.wt, () => {
+    const t = this.es();
+    const s = this.rs?.() || 0;
+    runWithOwner(this.jt, () => {
         if (t === 0) {
-            if (this.jt !== 0) {
-                this.wt.dispose(false);
-                this.Ft = [];
-                this.Kt = [];
-                this.jt = 0;
+            if (this.Wt !== 0) {
+                this.jt.dispose(false);
+                this.zt = [];
+                this.qt = [];
+                this.Wt = 0;
                 // Reset offset to match the cleared data (#2767, repro 2).
-                                this.Ht = 0;
+                                this.ss = 0;
             }
-            if (this.Bt && !this.Kt[0]) {
+            if (this.ts && !this.qt[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.Ft[0]?.dispose();
-                this.Kt[0] = runWithOwner(this.Ft[0] = createOwner(), this.Bt);
+                this.zt[0]?.dispose();
+                this.qt[0] = runWithOwner(this.zt[0] = createOwner(), this.ts);
             }
             return;
         }
         const i = s + t;
-        const e = this.Ht + this.jt;
+        const e = this.ss + this.Wt;
         // 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.Ht);
+                const r = Math.max(s, this.ss);
         const n = Math.min(i, e);
         const h = new Array(t);
         const o = new Array(t);
         for (let t = r; t < n; t++) {
-            o[t - s] = this.Ft[t - this.Ht];
-            h[t - s] = this.Kt[t - this.Ht];
+            o[t - s] = this.zt[t - this.ss];
+            h[t - s] = this.qt[t - this.ss];
         }
         try {
             for (let t = s; t < i; t++) {
                 if (t >= r && t < n) continue;
-                h[t - s] = runWithOwner(o[t - s] = createOwner(), () => this.xt(t));
+                h[t - s] = runWithOwner(o[t - s] = createOwner(), () => this.$t(t));
             }
         } catch (t) {
             for (let t = s; t < i; t++) if ((t < r || t >= n) && o[t - s]) o[t - s].dispose();
             throw t;
         }
         // commit: dispose the previous fallback or the rows leaving the window
-                if (this.jt === 0) this.Ft[0]?.dispose(); else for (let t = this.Ht; t < e; t++) if (t < s || t >= i) this.Ft[t - this.Ht].dispose();
-        this.Kt = h;
-        this.Ft = o;
-        this.Ht = s;
-        this.jt = t;
+                if (this.Wt === 0) this.zt[0]?.dispose(); else for (let t = this.ss; t < e; t++) if (t < s || t >= i) this.zt[t - this.ss].dispose();
+        this.qt = h;
+        this.zt = o;
+        this.ss = s;
+        this.Wt = t;
     });
-    return this.Kt;
+    return this.qt;
 }
 
 function compare(t, s, i) {

package/dist/prod/signals.js

@@ -251,7 +251,7 @@ function createEffect(e, t, n) {
             // route through the inherited queue.
             const r = getOwner();
             const o = new MicrotaskQueue;
-            o.Fe = r.C;
+            o.ve = r.C;
  // notify() forwards up the normal chain
                         r.C = o;
             // A user effect rather than a bare computed: computeds are pull-based and

package/dist/prod/store/next/optimistic.js

@@ -1,6 +1,6 @@
-import { CONFIG_AUTO_DISPOSE, STATUS_PENDING, NOT_PENDING, unwrapOverride } from "../../core/constants.js";
+import { computed, ext, setSignal, isEqual } from "../../core/core.js";
 
-import { computed, setSignal, isEqual } from "../../core/core.js";
+import { CONFIG_AUTO_DISPOSE, STATUS_PENDING, NOT_PENDING, unwrapOverride, CONFIG_OPTIMISTIC } from "../../core/constants.js";
 
 import { GlobalQueue, insertSubs, schedule, globalQueue } from "../../core/scheduler.js";
 
@@ -51,14 +51,14 @@ function installNextBlockedHalf() {
     // Scheduler flush tails call _clearOptimisticStores whenever tracked
     // stores exist; next has no layer to clear — reverts are engine-native —
     // so the hook only empties the batch set.
-        if (!GlobalQueue.gt) {
-        GlobalQueue.gt = e => {
+        if (!GlobalQueue.Vt) {
+        GlobalQueue.Vt = e => {
             e.clear();
         };
     }
-    const e = GlobalQueue.Tn;
-    GlobalQueue.Tn = t => {
-        for (const e of t.dn) {
+    const e = GlobalQueue.dn;
+    GlobalQueue.dn = t => {
+        for (const e of t.cn) {
             const t = e?.[$TARGET];
             const n = t?.fam?.node;
             // The hold exists to keep optimistic state alive until the store's own
@@ -80,10 +80,10 @@ function familyHasLiveOverrides(e) {
             if (t === null) continue;
             for (const e of Reflect.ownKeys(t)) {
                 const n = t[e];
-                if (n.De !== undefined && n.De !== NOT_PENDING) return true;
+                if (n.o?.De !== undefined && n.o?.De !== NOT_PENDING) return true;
             }
         }
-        if (e.k !== null && e.k.De !== undefined && e.k.De !== NOT_PENDING) return true;
+        if (e.k !== null && e.k.o?.De !== undefined && e.k.o?.De !== NOT_PENDING) return true;
     }
     t.clear();
  // nothing live — drop the bookkeeping
@@ -146,15 +146,15 @@ function createOptimisticStoreNext(e, t, n) {
     // at plain flush end. The blocked-check store-half keeps that transaction
     // from settling while the firewall is pending.
     const n = e.fam?.node;
-    if (n?.Ne) globalQueue.initTransition(n.Ne);
+    if (n?._e) globalQueue.initTransition(n._e);
     const i = e.v;
     const visible = (t, n) => {
         const i = e.n?.[t];
-        return i !== undefined && hasActiveOverride(i) ? unwrapOverride(i.De) : n;
+        return i !== undefined && hasActiveOverride(i) ? unwrapOverride(i.o?.De) : n;
     };
     const visiblePresent = t => {
         const n = e.h?.[t];
-        return n !== undefined && hasActiveOverride(n) ? !!unwrapOverride(n.De) : t in i;
+        return n !== undefined && hasActiveOverride(n) ? !!unwrapOverride(n.o?.De) : t in i;
     };
     let o = false;
     const r = Array.isArray(t);
@@ -198,7 +198,7 @@ function createOptimisticStoreNext(e, t, n) {
     // and the target for landing consumption (RUL-2).
         e.pb = null;
     (e.fam.overlaid ??= new Set).add(e);
-    GlobalQueue.Qn?.(e.fam.px ?? e.px);
+    GlobalQueue.Nn?.(e.fam.px ?? e.px);
 }
 
 /**
@@ -214,15 +214,19 @@ function createOptimisticStoreNext(e, t, n) {
         for (const e of t) {
             const drop = (e, t) => {
                 if (!hasActiveOverride(e)) return;
-                const n = unwrapOverride(e.De);
+                const n = unwrapOverride(e.o?.De);
                 // Full legacy reset (clearOptimisticOverride parity): the landing is
                 // authoritative NOW — fold committed into the node directly instead
                 // of riding a transaction's commit (whose queues may be stashed with
                 // the transaction parked; the wake would strand until it settles).
-                                e.De = NOT_PENDING;
-                e.sn = null;
-                e.Ke = undefined;
-                e._e = NOT_PENDING;
+                                ext(e).De = NOT_PENDING;
+                e.T |= CONFIG_OPTIMISTIC;
+                const i = e.o;
+                if (i) {
+                    i.Et = null;
+                    i.Be = undefined;
+                }
+                e.Pe = NOT_PENDING;
                 e.be = t;
                 if (!e.Ue || !e.Ue(n, t)) {
                     insertSubs(e, true);
@@ -256,9 +260,13 @@ function createOptimisticStoreNext(e, t, n) {
                 for (const t of Reflect.ownKeys(n)) drop(n[t], t in e.v);
             }
             if (e.k !== null && hasActiveOverride(e.k)) {
-                e.k.De = NOT_PENDING;
-                e.k.sn = null;
-                e.k.Ke = undefined;
+                ext(e.k).De = NOT_PENDING;
+                e.k.T |= CONFIG_OPTIMISTIC;
+                const t = e.k.o;
+                if (t) {
+                    t.Et = null;
+                    t.Be = undefined;
+                }
                 insertSubs(e.k, true);
                 schedule();
             }
@@ -280,7 +288,7 @@ function createOptimisticStoreNext(e, t, n) {
         for (const e of Reflect.ownKeys(i)) {
             const n = i[e];
             if (!hasActiveOverride(n)) continue;
-            const o = unwrapOverride(n.De);
+            const o = unwrapOverride(n.o?.De);
             if (e === "length" && Array.isArray(t)) {
                 if (t.length !== o) ensure().length = o;
             } else if (!isEqual(t[e], o)) ensure()[e] = o;
@@ -291,7 +299,7 @@ function createOptimisticStoreNext(e, t, n) {
         for (const e of Reflect.ownKeys(o)) {
             const i = o[e];
             if (!hasActiveOverride(i)) continue;
-            const r = !!unwrapOverride(i.De);
+            const r = !!unwrapOverride(i.o?.De);
             if (!r && e in (n ?? t)) delete ensure()[e];
         }
     }

package/dist/prod/store/next/projection.js

@@ -149,8 +149,8 @@ function runProjectionComputedNext(e, t, r, o, i) {
     // 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 u = n.Ee ? JSON.parse(JSON.stringify(e[$TARGET][STORE_VALUE])) : null;
-    const l = new Proxy(e, createWriteTraps(() => !c || n.Te === s, i));
+        const u = n.Ie ? JSON.parse(JSON.stringify(e[$TARGET][STORE_VALUE])) : null;
+    const l = new Proxy(e, createWriteTraps(() => !c || n.o?.Ee === s, i));
     storeSetterNext(l, i => {
         s = t(u ?? i);
         c = true;
@@ -164,7 +164,7 @@ function runProjectionComputedNext(e, t, r, o, i) {
             o ? o(write) : write();
         };
         const l = handleAsync(n, s, commit);
-        if (!n.Ee) commit(l);
+        if (!n.Ie) commit(l);
     }, false);
     return n;
 }