@solidjs/signals 2.0.0-rc.4 → 2.0.0-rc.6

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(),
-        xt: 0,
-        Kt: t,
-        $t: [],
-        qt: n,
-        zt: [],
-        Jt: [],
-        Xt: e,
-        Yt: e || i?.keyed === false ? [] : undefined,
-        Zt: r && i?.keyed !== false ? [] : undefined,
-        ts: i?.keyed === false,
-        ss: i?.fallback
+        Kt: createOwner(),
+        $t: 0,
+        Jt: t,
+        Xt: [],
+        Yt: n,
+        Zt: [],
+        ts: [],
+        ss: e,
+        es: e || i?.keyed === false ? [] : undefined,
+        rs: r && i?.keyed !== false ? [] : undefined,
+        ns: i?.keyed === false,
+        hs: 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.Ot = o;
+        h.Kt.Dt = 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.Kt() || [], s = t.length;
+    const t = this.Jt() || [], s = t.length;
     t[$TRACK];
  // top level tracking
-        runWithOwner(this.Wt, () => {
+        runWithOwner(this.Kt, () => {
         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.Yt ? this.ts ? () => {
+        h = this.es ? this.ns ? () => {
             r[e] = signal(t[e], pureOptions);
-            return this.qt(accessor(r[e]), e);
+            return this.Yt(accessor(r[e]), e);
         } : () => {
             r[e] = signal(t[e], pureOptions);
             n && (n[e] = signal(e, pureOptions));
-            return this.qt(accessor(r[e]), n ? accessor(n[e]) : undefined);
-        } : this.Zt ? () => {
+            return this.Yt(accessor(r[e]), n ? accessor(n[e]) : undefined);
+        } : this.rs ? () => {
             const s = t[e];
             n[e] = signal(e, pureOptions);
-            return this.qt(s, accessor(n[e]));
+            return this.Yt(s, accessor(n[e]));
         } : () => {
             const s = t[e];
-            return this.qt(s);
+            return this.Yt(s);
         };
         // fast path for empty arrays
                 if (s === 0) {
-            if (this.xt !== 0) {
-                this.Wt.dispose(false);
-                this.Jt = [];
-                this.$t = [];
-                this.zt = [];
-                this.xt = 0;
-                this.Yt && (this.Yt = []);
-                this.Zt && (this.Zt = []);
+            if (this.$t !== 0) {
+                this.Kt.dispose(false);
+                this.ts = [];
+                this.Xt = [];
+                this.Zt = [];
+                this.$t = 0;
+                this.es && (this.es = []);
+                this.rs && (this.rs = []);
             }
-            if (this.ss && !this.zt[0]) {
+            if (this.hs && !this.Zt[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.Jt[0]?.dispose();
-                this.zt[0] = runWithOwner(this.Jt[0] = createOwner(), this.ss);
+                this.ts[0]?.dispose();
+                this.Zt[0] = runWithOwner(this.ts[0] = createOwner(), this.hs);
             }
         }
         // fast path for new create
-         else if (this.xt === 0) {
+         else if (this.$t === 0) {
             const o = new Array(s);
             const c = new Array(s);
-            r = this.Yt && new Array(s);
-            n = this.Zt && new Array(s);
+            r = this.es && new Array(s);
+            n = this.rs && 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.Jt[0]) this.Jt[0].dispose();
+                        if (this.ts[0]) this.ts[0].dispose();
  // previous fallback
-                        this.zt = o;
-            this.Jt = c;
-            r && (this.Yt = r);
-            n && (this.Zt = n);
-            this.$t = t.slice(0);
-            this.xt = s;
+                        this.Zt = o;
+            this.ts = c;
+            r && (this.es = r);
+            n && (this.rs = n);
+            this.Xt = t.slice(0);
+            this.$t = s;
         } else {
             let o, c, a, f, u, p, w, l, d;
             // skip common prefix
-                        for (o = 0, c = Math.min(this.xt, s); o < c && (this.$t[o] === t[o] || this.Yt && compare(this.Xt, this.$t[o], t[o])); o++) {
-                if (this.Yt) setSignal(this.Yt[o], t[o]);
+                        for (o = 0, c = Math.min(this.$t, s); o < c && (this.Xt[o] === t[o] || this.es && compare(this.ss, this.Xt[o], t[o])); o++) {
+                if (this.es) setSignal(this.es[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.xt - 1, a = s - 1; c >= o && a >= o && (this.$t[c] === t[a] || this.Yt && compare(this.Xt, this.$t[c], t[a])); c--, 
+                        for (c = this.$t - 1, a = s - 1; c >= o && a >= o && (this.Xt[c] === t[a] || this.es && compare(this.ss, this.Xt[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.xt === s) {
-                this.$t = t.slice(0);
+                        if (o === s && this.$t === s) {
+                this.Xt = t.slice(0);
                 return;
             }
-            const O = s - this.xt;
+            const O = s - this.$t;
             const m = new Array(s);
             const _ = new Array(s);
-            r = this.Yt ? new Array(s) : undefined;
-            n = this.Zt ? new Array(s) : undefined;
+            r = this.es ? new Array(s) : undefined;
+            n = this.rs ? 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.Xt ? this.Xt(f) : f;
+                u = this.ss ? this.ss(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.$t[i];
-                u = this.Xt ? this.Xt(f) : f;
+                f = this.Xt[i];
+                u = this.ss ? this.ss(f) : f;
                 e = p.get(u);
                 if (e !== undefined && e !== -1) {
-                    m[e] = this.zt[i];
-                    _[e] = this.Jt[i];
-                    r && (r[e] = this.Yt[i]);
-                    n && (n[e] = this.Zt[i]);
+                    m[e] = this.Zt[i];
+                    _[e] = this.ts[i];
+                    r && (r[e] = this.es[i]);
+                    n && (n[e] = this.rs[i]);
                     e = w[e];
                     p.set(u, e);
-                } else (l ??= []).push(this.Jt[i]);
+                } else (l ??= []).push(this.ts[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.zt[i];
-                _[i] = this.Jt[i];
-                r && (r[i] = this.Yt[i]);
-                n && (n[i] = this.Zt[i]);
+                m[i] = this.Zt[i];
+                _[i] = this.ts[i];
+                r && (r[i] = this.es[i]);
+                n && (n[i] = this.rs[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.zt[e - O];
-                _[e] = this.Jt[e - O];
+                m[e] = this.Zt[e - O];
+                _[e] = this.ts[e - O];
                 if (r) {
-                    r[e] = this.Yt[e - O];
+                    r[e] = this.es[e - O];
                     setSignal(r[e], t[e]);
                 }
                 if (n) {
-                    n[e] = this.Zt[e - O];
+                    n[e] = this.rs[e - O];
                     if (O !== 0) setSignal(n[e], e);
                 }
             }
-            this.zt = m;
-            this.Jt = _;
-            r && (this.Yt = r);
-            n && (this.Zt = n);
-            this.xt = s;
+            this.Zt = m;
+            this.ts = _;
+            r && (this.es = r);
+            n && (this.rs = n);
+            this.$t = s;
             // save a copy of the mapped items for the next update
-                        this.$t = t.slice(0);
+                        this.Xt = t.slice(0);
             if (l) for (i = 0; i < l.length; i++) l[i].dispose();
         }
     });
-    return this.zt;
+    return this.Zt;
 }
 
 /**
@@ -234,21 +234,21 @@ function updateKeyedMap() {
  */ function repeat(t, s, i) {
     const e = s;
     const r = {
-        Wt: createOwner(),
-        xt: 0,
-        es: 0,
-        rs: t,
-        qt: e,
-        Jt: [],
-        zt: [],
-        ns: i?.from,
-        ss: i?.fallback
+        Kt: createOwner(),
+        $t: 0,
+        cs: 0,
+        fs: t,
+        Yt: e,
+        ts: [],
+        Zt: [],
+        us: i?.from,
+        hs: 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.Ot = n;
+        r.Kt.Dt = 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.rs();
-    const s = this.ns?.() || 0;
-    runWithOwner(this.Wt, () => {
+    const t = this.fs();
+    const s = this.us?.() || 0;
+    runWithOwner(this.Kt, () => {
         if (t === 0) {
-            if (this.xt !== 0) {
-                this.Wt.dispose(false);
-                this.Jt = [];
-                this.zt = [];
-                this.xt = 0;
+            if (this.$t !== 0) {
+                this.Kt.dispose(false);
+                this.ts = [];
+                this.Zt = [];
+                this.$t = 0;
                 // Reset offset to match the cleared data (#2767, repro 2).
-                                this.es = 0;
+                                this.cs = 0;
             }
-            if (this.ss && !this.zt[0]) {
+            if (this.hs && !this.Zt[0]) {
                 // an aborted fallback attempt leaves an owner without a mapping;
                 // dispose it before re-creating
-                this.Jt[0]?.dispose();
-                this.zt[0] = runWithOwner(this.Jt[0] = createOwner(), this.ss);
+                this.ts[0]?.dispose();
+                this.Zt[0] = runWithOwner(this.ts[0] = createOwner(), this.hs);
             }
             return;
         }
         const i = s + t;
-        const e = this.es + this.xt;
+        const e = this.cs + this.$t;
         // 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.es);
+                const r = Math.max(s, this.cs);
         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.Jt[t - this.es];
-            h[t - s] = this.zt[t - this.es];
+            o[t - s] = this.ts[t - this.cs];
+            h[t - s] = this.Zt[t - this.cs];
         }
         try {
             for (let t = s; t < i; t++) {
                 if (t >= r && t < n) continue;
-                h[t - s] = runWithOwner(o[t - s] = createOwner(), () => this.qt(t));
+                h[t - s] = runWithOwner(o[t - s] = createOwner(), () => this.Yt(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.xt === 0) this.Jt[0]?.dispose(); else for (let t = this.es; t < e; t++) if (t < s || t >= i) this.Jt[t - this.es].dispose();
-        this.zt = h;
-        this.Jt = o;
-        this.es = s;
-        this.xt = t;
+                if (this.$t === 0) this.ts[0]?.dispose(); else for (let t = this.cs; t < e; t++) if (t < s || t >= i) this.ts[t - this.cs].dispose();
+        this.Zt = h;
+        this.ts = o;
+        this.cs = s;
+        this.$t = t;
     });
-    return this.zt;
+    return this.Zt;
 }
 
 function compare(t, s, i) {