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

package/dist/prod/map.js

@@ -16,28 +16,30 @@ 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 h = {
-        wt: createOwner(),
-        jt: 0,
-        Wt: t,
-        Mt: [],
-        Kt: n,
-        xt: [],
-        Ut: [],
-        $t: e,
-        qt: e || i?.keyed === false ? [] : undefined,
-        zt: r && i?.keyed !== false ? [] : undefined,
-        Bt: i?.keyed === false,
-        Ht: i?.fallback
+        jt: createOwner(),
+        Wt: 0,
+        xt: t,
+        Kt: [],
+        $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.dt = o;
+        h.jt.Ot = o;
     o.T &= ~CONFIG_AUTO_DISPOSE;
     return accessor(o);
 }
@@ -56,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.qt ? this.Bt ? () => {
+        h = this.Xt ? this.Zt ? () => {
             r[e] = signal(t[e], pureOptions);
-            return this.Kt(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.Kt(accessor(r[e]), n ? accessor(n[e]) : undefined);
-        } : this.zt ? () => {
+            return this.$t(accessor(r[e]), n ? accessor(n[e]) : undefined);
+        } : this.Yt ? () => {
             const s = t[e];
             n[e] = signal(e, pureOptions);
-            return this.Kt(s, accessor(n[e]));
+            return this.$t(s, accessor(n[e]));
         } : () => {
             const s = t[e];
-            return this.Kt(s);
+            return this.$t(s);
         };
         // fast path for empty arrays
                 if (s === 0) {
-            if (this.jt !== 0) {
-                this.wt.dispose(false);
-                this.Ut = [];
-                this.Mt = [];
-                this.xt = [];
-                this.jt = 0;
-                this.qt && (this.qt = []);
-                this.zt && (this.zt = []);
+            if (this.Wt !== 0) {
+                this.jt.dispose(false);
+                this.zt = [];
+                this.Kt = [];
+                this.qt = [];
+                this.Wt = 0;
+                this.Xt && (this.Xt = []);
+                this.Yt && (this.Yt = []);
             }
-            if (this.Ht && !this.xt[0]) {
+            if (this.ts && !this.qt[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.Ut[0]?.dispose();
-                this.xt[0] = runWithOwner(this.Ut[0] = createOwner(), this.Ht);
+                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.qt && new Array(s);
-            n = this.zt && 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) {
@@ -109,43 +111,43 @@ function updateKeyedMap() {
                 throw t;
             }
             // commit
-                        if (this.Ut[0]) this.Ut[0].dispose();
+                        if (this.zt[0]) this.zt[0].dispose();
  // previous fallback
-                        this.xt = o;
-            this.Ut = c;
-            r && (this.qt = r);
-            n && (this.zt = 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.qt && compare(this.$t, this.Mt[o], t[o])); o++) {
-                if (this.qt) setSignal(this.qt[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.qt && compare(this.$t, 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.qt ? new Array(s) : undefined;
-            n = this.zt ? 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.$t ? this.$t(f) : f;
+                u = this.Jt ? this.Jt(f) : f;
                 i = p.get(u);
                 w[e] = i === undefined ? -1 : i;
                 p.set(u, e);
@@ -154,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.$t ? this.$t(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.xt[i];
-                    _[e] = this.Ut[i];
-                    r && (r[e] = this.qt[i]);
-                    n && (n[e] = this.zt[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.Ut[i]);
+                } else (l ??= []).push(this.zt[i]);
             }
             // 2) create new rows into the temp arrays; an abort disposes only these
                         try {
@@ -181,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.xt[i];
-                _[i] = this.Ut[i];
-                r && (r[i] = this.qt[i]);
-                n && (n[i] = this.zt[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.xt[e - O];
-                _[e] = this.Ut[e - O];
+                m[e] = this.qt[e - O];
+                _[e] = this.zt[e - O];
                 if (r) {
-                    r[e] = this.qt[e - O];
+                    r[e] = this.Xt[e - O];
                     setSignal(r[e], t[e]);
                 }
                 if (n) {
-                    n[e] = this.zt[e - O];
+                    n[e] = this.Yt[e - O];
                     if (O !== 0) setSignal(n[e], e);
                 }
             }
-            this.xt = m;
-            this.Ut = _;
-            r && (this.qt = r);
-            n && (this.zt = 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.xt;
+    return this.qt;
 }
 
 /**
@@ -232,21 +234,21 @@ function updateKeyedMap() {
  */ function repeat(t, s, i) {
     const e = s;
     const r = {
-        wt: createOwner(),
-        jt: 0,
-        Jt: 0,
-        Vt: t,
-        Kt: e,
-        Ut: [],
-        xt: [],
-        Xt: i?.from,
-        Ht: 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.dt = n;
+        r.jt.Ot = n;
     n.T &= ~CONFIG_AUTO_DISPOSE;
     return accessor(n);
 }
@@ -259,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.Vt();
-    const s = this.Xt?.() || 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.Ut = [];
-                this.xt = [];
-                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.Jt = 0;
+                                this.ss = 0;
             }
-            if (this.Ht && !this.xt[0]) {
+            if (this.ts && !this.qt[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.Ut[0]?.dispose();
-                this.xt[0] = runWithOwner(this.Ut[0] = createOwner(), this.Ht);
+                this.zt[0]?.dispose();
+                this.qt[0] = runWithOwner(this.zt[0] = createOwner(), this.ts);
             }
             return;
         }
         const i = s + t;
-        const e = this.Jt + 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.Jt);
+                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.Ut[t - this.Jt];
-            h[t - s] = this.xt[t - this.Jt];
+            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.Kt(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.Ut[0]?.dispose(); else for (let t = this.Jt; t < e; t++) if (t < s || t >= i) this.Ut[t - this.Jt].dispose();
-        this.xt = h;
-        this.Ut = o;
-        this.Jt = 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.xt;
+    return this.qt;
 }
 
 function compare(t, s, i) {

package/dist/prod/signals.js

@@ -123,6 +123,12 @@ function createEffect(e, t, n) {
  * may run multiple times for a single change or show tearing (reading inconsistent
  * state). Use only when dynamic subscription patterns require same-scope tracking.
  *
+ * The callback runs during the flush itself: writes made inside it are queued
+ * into the same flush's continuation and are never visible to the callback's
+ * own reads (reads return settled values, as in every effect-phase scope), and
+ * `flush()` cannot be called from inside it (dev throws; production is a
+ * no-op) — defer with `queueMicrotask(() => flush())` if needed.
+ *
  * ```typescript
  * createTrackedEffect(compute, options?: { name?: string });
  * ```
@@ -245,7 +251,7 @@ function createEffect(e, t, n) {
             // route through the inherited queue.
             const r = getOwner();
             const o = new MicrotaskQueue;
-            o.ke = 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
@@ -303,6 +309,19 @@ function createOptimistic(e, t) {
  * Reactive reads inside the callback are *not* tracked — to react to
  * subsequent settles, register a new `onSettled` each time.
  *
+ * The callback runs during the settle flush itself, which gives it the same
+ * write semantics as every other effect-phase scope (the effect half of
+ * `createEffect`, event handlers):
+ *
+ * - **Writes** are queued into the same flush's continuation — dependent memos
+ *   and effects update before the flush returns — but reads inside the
+ *   callback keep returning the settled (pre-write) values. A callback never
+ *   observes its own unsettled write. Functional setters still compose:
+ *   `set(v => v + 1)` twice increments twice.
+ * - **`flush()` cannot be called** from inside the callback — the flush is
+ *   already running (dev throws; production is a no-op). To force a drain
+ *   after this settle, defer it: `queueMicrotask(() => flush())`.
+ *
  * `onCleanup` is **not** allowed inside the callback — return a cleanup
  * function instead. The returned cleanup runs on owner disposal.
  *

package/dist/prod/store/index.js

@@ -0,0 +1,36 @@
+import "../core/core.js";
+
+import "../core/scheduler.js";
+
+import "../core/invariants.js";
+
+import "../core/verdict.js";
+
+import "../core/effect.js";
+
+import { createStoreNext, deepNext, snapshotNext } from "./next/store.js";
+
+import { reconcileNextState } from "./next/reconcile.js";
+
+import { createStoreDerivedNext } from "./next/projection.js";
+
+export { createProjectionNext as createProjection } from "./next/projection.js";
+
+function createStore(e, t, r) {
+    if (typeof e === "function") return createStoreDerivedNext(e, t, r);
+    return createStoreNext(e, !!t?.shallow);
+}
+
+function reconcile(e, t = "id") {
+    return r => reconcileNextState(e, r, t);
+}
+
+function snapshot(e) {
+    return snapshotNext(e);
+}
+
+function deep(e) {
+    return deepNext(e);
+}
+
+export { createStore, deep, reconcile, snapshot };