@solidjs/signals 0.11.0 → 0.11.1

package/dist/prod.js

@@ -32,6 +32,7 @@ const REACTIVE_ZOMBIE = 1 << 5;
 const REACTIVE_DISPOSED = 1 << 6;
 const REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
 const REACTIVE_SNAPSHOT_STALE = 1 << 8;
+const REACTIVE_LAZY = 1 << 9;
 const STATUS_PENDING = 1 << 0;
 const STATUS_ERROR = 1 << 1;
 const STATUS_UNINITIALIZED = 1 << 2;
@@ -52,11 +53,11 @@ function actualInsertIntoHeap(e, t) {
   if (r === undefined) t.l[i] = e;
   else {
     const t = r.T;
-    t.S = e;
+    t.R = e;
     e.T = t;
     r.T = e;
   }
-  if (i > t.R) t.R = i;
+  if (i > t.S) t.S = i;
 }
 function insertIntoHeap(e, t) {
   let n = e.O;
@@ -79,21 +80,21 @@ function deleteFromHeap(e, t) {
   const i = e.o;
   if (e.T === e) t.l[i] = undefined;
   else {
-    const n = e.S;
+    const n = e.R;
     const r = t.l[i];
     const s = n ?? r;
     if (e === r) t.l[i] = n;
-    else e.T.S = n;
+    else e.T.R = n;
     s.T = e.T;
   }
   e.T = e;
-  e.S = undefined;
+  e.R = undefined;
 }
 function markHeap(e) {
   if (e._) return;
   e._ = true;
-  for (let t = 0; t <= e.R; t++) {
-    for (let n = e.l[t]; n !== undefined; n = n.S) {
+  for (let t = 0; t <= e.S; t++) {
+    for (let n = e.l[t]; n !== undefined; n = n.R) {
       if (n.O & REACTIVE_IN_HEAP) markNode(n);
     }
   }
@@ -115,20 +116,20 @@ function markNode(e, t = REACTIVE_DIRTY) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.N = 0; e.N <= e.R; e.N++) {
-    let n = e.l[e.N];
+  for (e.C = 0; e.C <= e.S; e.C++) {
+    let n = e.l[e.C];
     while (n !== undefined) {
       if (n.O & REACTIVE_IN_HEAP) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.N];
+      n = e.l[e.C];
     }
   }
-  e.R = 0;
+  e.S = 0;
 }
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.C; t; t = t.D) {
+  for (let t = e.N; t; t = t.D) {
     const e = t.V;
     const i = e.m || e;
     if (i.L && i.o >= n) n = i.o + 1;
@@ -141,8 +142,8 @@ function adjustHeight(e, t) {
   }
 }
 const transitions = new Set();
-const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, N: 0, R: 0 };
-const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, N: 0, R: 0 };
+const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, C: 0, S: 0 };
+const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, C: 0, S: 0 };
 let clock = 0;
 let activeTransition = null;
 let scheduled = false;
@@ -235,7 +236,7 @@ class GlobalQueue extends Queue {
   j = new Set();
   static K;
   static Y;
-  static B = null;
+  static Z = null;
   flush() {
     if (this.H) return;
     this.H = true;
@@ -251,16 +252,16 @@ class GlobalQueue extends Queue {
           this.j = new Set();
           runLaneEffects(EFFECT_RENDER);
           runLaneEffects(EFFECT_USER);
-          this.stashQueues(activeTransition.X);
+          this.stashQueues(activeTransition.B);
           clock++;
-          scheduled = dirtyQueue.R >= dirtyQueue.N;
+          scheduled = dirtyQueue.S >= dirtyQueue.C;
           reassignPendingTransition(activeTransition.F);
           activeTransition = null;
           finalizePureQueue(null, true);
           return;
         }
         this.F !== activeTransition.F && this.F.push(...activeTransition.F);
-        this.restoreQueues(activeTransition.X);
+        this.restoreQueues(activeTransition.B);
         transitions.delete(activeTransition);
         const t = activeTransition;
         activeTransition = null;
@@ -271,7 +272,7 @@ class GlobalQueue extends Queue {
         finalizePureQueue();
       }
       clock++;
-      scheduled = dirtyQueue.R >= dirtyQueue.N;
+      scheduled = dirtyQueue.S >= dirtyQueue.C;
       runLaneEffects(EFFECT_RENDER);
       this.run(EFFECT_RENDER);
       runLaneEffects(EFFECT_USER);
@@ -283,9 +284,9 @@ class GlobalQueue extends Queue {
   notify(e, t, n, i) {
     if (t & STATUS_PENDING) {
       if (n & STATUS_PENDING) {
-        const t = i !== undefined ? i : e.q;
-        if (activeTransition && t && !activeTransition.Z.includes(t.source)) {
-          activeTransition.Z.push(t.source);
+        const t = i !== undefined ? i : e.X;
+        if (activeTransition && t && !activeTransition.q.includes(t.source)) {
+          activeTransition.q.push(t.source);
           schedule();
         }
       }
@@ -301,11 +302,11 @@ class GlobalQueue extends Queue {
       activeTransition = e ?? {
         J: clock,
         F: [],
-        Z: [],
+        q: [],
         $: [],
         j: new Set(),
         ee: [],
-        X: { M: [[], []], G: [] },
+        B: { M: [[], []], G: [] },
         te: false
       };
     } else if (e) {
@@ -367,14 +368,14 @@ function insertSubs(e, t = false) {
       continue;
     }
     const s = r.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (s.N > r.h.o) s.N = r.h.o;
+    if (s.C > r.h.o) s.C = r.h.o;
     insertIntoHeap(r.h, s);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(globalQueue);
-  if (dirtyQueue.R >= dirtyQueue.N) runHeap(dirtyQueue, GlobalQueue.K);
+  if (dirtyQueue.S >= dirtyQueue.C) runHeap(dirtyQueue, GlobalQueue.K);
   if (n) {
     const t = globalQueue.F;
     for (let e = 0; e < t.length; e++) {
@@ -402,9 +403,9 @@ function finalizePureQueue(e = null, t = false) {
     }
     n.length = 0;
     const i = e ? e.j : globalQueue.j;
-    if (GlobalQueue.B && i.size) {
+    if (GlobalQueue.Z && i.size) {
       for (const e of i) {
-        GlobalQueue.B(e);
+        GlobalQueue.Z(e);
       }
       i.clear();
       schedule();
@@ -453,9 +454,9 @@ function transitionComplete(e) {
   if (e.te) return true;
   if (e.ee.length) return false;
   let t = true;
-  for (let n = 0; n < e.Z.length; n++) {
-    const i = e.Z[n];
-    if (i.Ee & STATUS_PENDING && i.q?.source === i) {
+  for (let n = 0; n < e.q.length; n++) {
+    const i = e.q[n];
+    if (i.Ee & STATUS_PENDING && i.X?.source === i) {
       t = false;
       break;
     }
@@ -488,10 +489,10 @@ function getOrCreateLane(e) {
   }
   const n = e.de;
   const i = n?.ie ? findLane(n.ie) : null;
-  t = { Te: e, U: new Set(), W: [[], []], k: null, ne: activeTransition, Se: i };
+  t = { Te: e, U: new Set(), W: [[], []], k: null, ne: activeTransition, Re: i };
   signalLanes.set(e, t);
   activeLanes.add(t);
-  e.Re = e.Oe || 0;
+  e.Se = e.Oe || 0;
   return t;
 }
 function findLane(e) {
@@ -530,9 +531,9 @@ function assignOrMergeLane(e, t) {
     const r = findLane(i);
     if (activeLanes.has(r)) {
       if (r !== n && !hasActiveOverride(e)) {
-        if (n.Se && findLane(n.Se) === r) {
+        if (n.Re && findLane(n.Re) === r) {
           e.ie = t;
-        } else if (r.Se && findLane(r.Se) === n);
+        } else if (r.Re && findLane(r.Re) === n);
         else mergeLanes(n, r);
       }
       return;
@@ -646,7 +647,7 @@ function handleAsync(e, t, n) {
 }
 function clearStatus(e) {
   e.Ee = e.Ee & STATUS_UNINITIALIZED;
-  e.q = null;
+  e.X = null;
   updatePendingSignal(e);
   e.Ae?.();
 }
@@ -658,7 +659,7 @@ function notifyStatus(e, t, n, i, r) {
   const u = o && hasActiveOverride(e);
   if (!i) {
     e.Ee = t | (t !== STATUS_ERROR ? e.Ee & STATUS_UNINITIALIZED : 0);
-    e.q = n;
+    e.X = n;
     updatePendingSignal(e);
   }
   if (r && !i) {
@@ -666,8 +667,8 @@ function notifyStatus(e, t, n, i, r) {
   }
   if (u && activeTransition && n instanceof NotReadyError) {
     const e = n.source;
-    if (!activeTransition.Z.includes(e)) {
-      activeTransition.Z.push(e);
+    if (!activeTransition.q.includes(e)) {
+      activeTransition.q.push(e);
     }
   }
   const c = i || u;
@@ -682,7 +683,7 @@ function notifyStatus(e, t, n, i, r) {
   }
   for (let i = e.I; i !== null; i = i.p) {
     i.h.J = clock;
-    if (i.h.q !== n) {
+    if (i.h.X !== n) {
       !i.h.ne && globalQueue.F.push(i.h);
       notifyStatus(i.h, t, n, c, l);
     }
@@ -690,7 +691,7 @@ function notifyStatus(e, t, n, i, r) {
   for (let i = e.A; i !== null; i = i.P) {
     for (let e = i.I; e !== null; e = e.p) {
       e.h.J = clock;
-      if (e.h.q !== n) {
+      if (e.h.X !== n) {
         !e.h.ne && globalQueue.F.push(e.h);
         notifyStatus(e.h, t, n, c, l);
       }
@@ -708,19 +709,19 @@ function unlinkSubs(e) {
   else {
     t.I = i;
     if (i === null) {
-      t.Ne?.();
-      t.L && !t.Ce && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
+      t.Ce?.();
+      t.L && !t.Ne && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
   deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  let t = e.C;
+  let t = e.N;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.C = null;
+  e.N = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
@@ -729,7 +730,7 @@ function link(e, t) {
   let i = null;
   const r = t.O & REACTIVE_RECOMPUTING_DEPS;
   if (r) {
-    i = n !== null ? n.D : t.C;
+    i = n !== null ? n.D : t.N;
     if (i !== null && i.V === e) {
       t.ye = i;
       return;
@@ -739,14 +740,14 @@ function link(e, t) {
   if (s !== null && s.h === t && (!r || isValidLink(s, t))) return;
   const o = (t.ye = e.ge = { V: e, h: t, D: i, Pe: s, p: null });
   if (n !== null) n.D = o;
-  else t.C = o;
+  else t.N = o;
   if (s !== null) s.p = o;
   else e.I = o;
 }
 function isValidLink(e, t) {
   const n = t.ye;
   if (n !== null) {
-    let i = t.C;
+    let i = t.N;
     do {
       if (i === e) return true;
       if (i === n) break;
@@ -769,11 +770,11 @@ function markDisposal(e) {
   }
 }
 function dispose(e) {
-  let t = e.C || null;
+  let t = e.N || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.C = null;
+  e.N = null;
   e.ye = null;
   disposeChildren(e, true);
 }
@@ -783,14 +784,14 @@ function disposeChildren(e, t = false, n) {
   let i = n ? e.be : e.De;
   while (i) {
     const e = i.ve;
-    if (i.C) {
+    if (i.N) {
       const e = i;
       deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      let t = e.C;
+      let t = e.N;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.C = null;
+      e.N = null;
       e.ye = null;
     }
     disposeChildren(i, true);
@@ -893,7 +894,7 @@ function effect(e, t, n, i, r) {
   const o = computed(r?.render ? t => staleValues(() => e(t)) : e, i, {
     ...r,
     equals: () => {
-      o.ue = !o.q;
+      o.ue = !o.X;
       if (s) o.ce.enqueue(o.oe, runEffect.bind(o));
       return false;
     },
@@ -906,7 +907,7 @@ function effect(e, t, n, i, r) {
   o.oe = r?.render ? EFFECT_RENDER : EFFECT_USER;
   o.Ae = (e, t) => {
     const n = e !== undefined ? e : o.Ee;
-    const i = t !== undefined ? t : o.q;
+    const i = t !== undefined ? t : o.X;
     if (n & STATUS_ERROR) {
       let e = i;
       o.ce.notify(o, STATUS_PENDING, 0);
@@ -1012,7 +1013,7 @@ function releaseSubtree(e) {
       if (e.O & REACTIVE_SNAPSHOT_STALE) {
         e.O &= ~REACTIVE_SNAPSHOT_STALE;
         e.O |= REACTIVE_DIRTY;
-        if (dirtyQueue.N > e.o) dirtyQueue.N = e.o;
+        if (dirtyQueue.C > e.o) dirtyQueue.C = e.o;
         insertIntoHeap(e, dirtyQueue);
       }
     }
@@ -1092,15 +1093,15 @@ function recompute(e, t = false) {
     e.O = REACTIVE_NONE | (t ? e.O & REACTIVE_SNAPSHOT_STALE : 0);
     context = o;
   }
-  if (!e.q) {
+  if (!e.X) {
     const o = e.ye;
-    let l = o !== null ? o.D : e.C;
+    let l = o !== null ? o.D : e.N;
     if (l !== null) {
       do {
         l = unlinkSubs(l);
       } while (l !== null);
       if (o !== null) o.D = null;
-      else e.C = null;
+      else e.N = null;
     }
     const a = r ? e.fe : e.ae === NOT_PENDING ? e.fe : e.ae;
     const f = !e.pe || !e.pe(a, u);
@@ -1110,7 +1111,7 @@ function recompute(e, t = false) {
       else e.ae = u;
       if (r && !i && s) {
         const t = e.Oe || 0;
-        const n = e.Re || 0;
+        const n = e.Se || 0;
         if (t <= n) e.fe = u;
       }
       if (!r || i || e.fe !== o) {
@@ -1130,7 +1131,7 @@ function recompute(e, t = false) {
 }
 function updateIfNecessary(e) {
   if (e.O & REACTIVE_CHECK) {
-    for (let t = e.C; t; t = t.D) {
+    for (let t = e.N; t; t = t.D) {
       const n = t.V;
       const i = n.m || n;
       if (i.L) {
@@ -1141,7 +1142,7 @@ function updateIfNecessary(e) {
       }
     }
   }
-  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.q && e.J < clock)) {
+  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.X && e.J < clock)) {
     recompute(e);
   }
   e.O = REACTIVE_NONE | (e.O & REACTIVE_SNAPSHOT_STALE);
@@ -1153,7 +1154,7 @@ function computed(e, t, n) {
     Le: i || undefined,
     pe: n?.equals != null ? n.equals : isEqual,
     Me: !!n?.pureWrite,
-    Ne: n?.unobserved,
+    Ce: n?.unobserved,
     me: null,
     ce: context?.ce ?? globalQueue,
     ke: context?.ke ?? defaultContext,
@@ -1162,16 +1163,16 @@ function computed(e, t, n) {
     fe: t,
     o: 0,
     A: null,
-    S: undefined,
+    R: undefined,
     T: null,
-    C: null,
+    N: null,
     ye: null,
     I: null,
     ge: null,
     i: context,
     ve: null,
     De: null,
-    O: REACTIVE_NONE,
+    O: n?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
     Ee: STATUS_UNINITIALIZED,
     J: clock,
     ae: NOT_PENDING,
@@ -1206,7 +1207,7 @@ function signal(e, t, n = null) {
   const i = {
     pe: t?.equals != null ? t.equals : isEqual,
     Me: !!t?.pureWrite,
-    Ne: t?.unobserved,
+    Ce: t?.unobserved,
     fe: e,
     I: null,
     ge: null,
@@ -1288,13 +1289,17 @@ function read(e) {
   let t = context;
   if (t?.t) t = t.u;
   if (refreshing && e.L) recompute(e);
+  if (e.O & REACTIVE_LAZY) {
+    e.O &= ~REACTIVE_LAZY;
+    recompute(e, true);
+  }
   if (t && tracking) {
     if (e.L && e.O & REACTIVE_DISPOSED) recompute(e);
     link(e, t);
     const n = e.m || e;
     if (n.L) {
       const i = e.O & REACTIVE_ZOMBIE;
-      if (n.o >= (i ? zombieQueue.N : dirtyQueue.N)) {
+      if (n.o >= (i ? zombieQueue.C : dirtyQueue.C)) {
         markNode(t);
         markHeap(i ? zombieQueue : dirtyQueue);
         updateIfNecessary(n);
@@ -1313,21 +1318,21 @@ function read(e) {
         const r = findLane(currentOptimisticLane);
         if (i && findLane(i) === r && !hasActiveOverride(n)) {
           if (!tracking) link(e, t);
-          throw n.q;
+          throw n.X;
         }
       } else {
         if (!tracking) link(e, t);
-        throw n.q;
+        throw n.X;
       }
     } else if (!t && n.Ee & STATUS_UNINITIALIZED) {
-      throw n.q;
+      throw n.X;
     }
   }
   if (e.L && e.Ee & STATUS_ERROR) {
     if (e.J < clock) {
       recompute(e, true);
       return read(e);
-    } else throw e.q;
+    } else throw e.X;
   }
   if (snapshotCaptureActive && t && t.se) {
     const n = e.re;
@@ -1671,14 +1676,14 @@ function applyState(e, t, n, i) {
     let t = false;
     const l = getOverrideValue(s, o, c, "length", u);
     if (e.length && l && e[0] && n(e[0]) != null) {
-      let a, f, E, T, d, S, R, O;
+      let a, f, E, T, d, R, S, O;
       for (
         E = 0, T = Math.min(l, e.length);
         E < T &&
-        ((S = getOverrideValue(s, o, c, E, u)) === e[E] || (S && e[E] && n(S) === n(e[E])));
+        ((R = getOverrideValue(s, o, c, E, u)) === e[E] || (R && e[E] && n(R) === n(e[E])));
         E++
       ) {
-        applyState(e[E], wrap(S, r), n, i);
+        applyState(e[E], wrap(R, r), n, i);
       }
       const _ = new Array(e.length),
         I = new Map();
@@ -1686,10 +1691,10 @@ function applyState(e, t, n, i) {
         T = l - 1, d = e.length - 1;
         T >= E &&
         d >= E &&
-        ((S = getOverrideValue(s, o, c, T, u)) === e[d] || (S && e[d] && n(S) === n(e[d])));
+        ((R = getOverrideValue(s, o, c, T, u)) === e[d] || (R && e[d] && n(R) === n(e[d])));
         T--, d--
       ) {
-        _[d] = S;
+        _[d] = R;
       }
       if (E > d || E > T) {
         for (f = E; f <= d; f++) {
@@ -1706,21 +1711,21 @@ function applyState(e, t, n, i) {
         l !== e.length && r[STORE_NODE].length && setSignal(r[STORE_NODE].length, e.length);
         return;
       }
-      R = new Array(d + 1);
+      S = new Array(d + 1);
       for (f = d; f >= E; f--) {
-        S = e[f];
-        O = S ? n(S) : S;
+        R = e[f];
+        O = R ? n(R) : R;
         a = I.get(O);
-        R[f] = a === undefined ? -1 : a;
+        S[f] = a === undefined ? -1 : a;
         I.set(O, f);
       }
       for (a = E; a <= T; a++) {
-        S = getOverrideValue(s, o, c, a, u);
-        O = S ? n(S) : S;
+        R = getOverrideValue(s, o, c, a, u);
+        O = R ? n(R) : R;
         f = I.get(O);
         if (f !== undefined && f !== -1) {
-          _[f] = S;
-          f = R[f];
+          _[f] = R;
+          f = S[f];
           I.set(O, f);
         }
       }
@@ -1811,7 +1816,7 @@ function createProjectionInternal(e, t = {}, n) {
       r !== i && r !== undefined && reconcile(r, n?.key || "id", n?.all)(s);
     });
   });
-  i.Ce = true;
+  i.Ne = true;
   return { store: s, node: i };
 }
 function createProjection(e, t = {}, n) {
@@ -2218,7 +2223,7 @@ function deep(e) {
   return e[$DEEP];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.B ||= clearOptimisticStore;
+  GlobalQueue.Z ||= clearOptimisticStore;
   const i = typeof e === "function";
   const r = (i ? t : e) ?? {};
   const s = i ? e : undefined;
@@ -2294,7 +2299,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    i.Ce = true;
+    i.Ne = true;
   }
   return { store: s, node: i };
 }
@@ -2547,11 +2552,11 @@ function mapArray(e, t, n) {
       je: e,
       Ke: [],
       Ye: s,
+      Ze: [],
       Be: [],
-      Xe: [],
-      qe: i,
-      ze: i || n?.keyed === false ? [] : undefined,
-      Ze: r ? [] : undefined,
+      Xe: i,
+      qe: i || n?.keyed === false ? [] : undefined,
+      ze: r ? [] : undefined,
       Je: n?.fallback
     })
   );
@@ -2564,20 +2569,20 @@ function updateKeyedMap() {
   runWithOwner(this.Fe, () => {
     let n,
       i,
-      r = this.ze
+      r = this.qe
         ? () => {
-            this.ze[i] = signal(e[i], pureOptions);
-            this.Ze && (this.Ze[i] = signal(i, pureOptions));
+            this.qe[i] = signal(e[i], pureOptions);
+            this.ze && (this.ze[i] = signal(i, pureOptions));
             return this.Ye(
-              read.bind(null, this.ze[i]),
-              this.Ze ? read.bind(null, this.Ze[i]) : undefined
+              read.bind(null, this.qe[i]),
+              this.ze ? read.bind(null, this.ze[i]) : undefined
             );
           }
-        : this.Ze
+        : this.ze
           ? () => {
               const t = e[i];
-              this.Ze[i] = signal(i, pureOptions);
-              return this.Ye(() => t, read.bind(null, this.Ze[i]));
+              this.ze[i] = signal(i, pureOptions);
+              return this.Ye(() => t, read.bind(null, this.ze[i]));
             }
           : () => {
               const t = e[i];
@@ -2586,22 +2591,22 @@ function updateKeyedMap() {
     if (t === 0) {
       if (this.$e !== 0) {
         this.Fe.dispose(false);
-        this.Xe = [];
-        this.Ke = [];
         this.Be = [];
+        this.Ke = [];
+        this.Ze = [];
         this.$e = 0;
+        this.qe && (this.qe = []);
         this.ze && (this.ze = []);
-        this.Ze && (this.Ze = []);
       }
-      if (this.Je && !this.Be[0]) {
-        this.Be[0] = runWithOwner((this.Xe[0] = createOwner()), this.Je);
+      if (this.Je && !this.Ze[0]) {
+        this.Ze[0] = runWithOwner((this.Be[0] = createOwner()), this.Je);
       }
     } else if (this.$e === 0) {
-      if (this.Xe[0]) this.Xe[0].dispose();
-      this.Be = new Array(t);
+      if (this.Be[0]) this.Be[0].dispose();
+      this.Ze = new Array(t);
       for (i = 0; i < t; i++) {
         this.Ke[i] = e[i];
-        this.Be[i] = runWithOwner((this.Xe[i] = createOwner()), r);
+        this.Ze[i] = runWithOwner((this.Be[i] = createOwner()), r);
       }
       this.$e = t;
     } else {
@@ -2614,70 +2619,70 @@ function updateKeyedMap() {
         f,
         E = new Array(t),
         T = new Array(t),
-        d = this.ze ? new Array(t) : undefined,
-        S = this.Ze ? new Array(t) : undefined;
+        d = this.qe ? new Array(t) : undefined,
+        R = this.ze ? new Array(t) : undefined;
       for (
         s = 0, o = Math.min(this.$e, t);
-        s < o && (this.Ke[s] === e[s] || (this.ze && compare(this.qe, this.Ke[s], e[s])));
+        s < o && (this.Ke[s] === e[s] || (this.qe && compare(this.Xe, this.Ke[s], e[s])));
         s++
       ) {
-        if (this.ze) setSignal(this.ze[s], e[s]);
+        if (this.qe) setSignal(this.qe[s], e[s]);
       }
       for (
         o = this.$e - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Ke[o] === e[u] || (this.ze && compare(this.qe, this.Ke[o], e[u])));
+        (this.Ke[o] === e[u] || (this.qe && compare(this.Xe, this.Ke[o], e[u])));
         o--, u--
       ) {
-        E[u] = this.Be[o];
-        T[u] = this.Xe[o];
-        d && (d[u] = this.ze[o]);
-        S && (S[u] = this.Ze[o]);
+        E[u] = this.Ze[o];
+        T[u] = this.Be[o];
+        d && (d[u] = this.qe[o]);
+        R && (R[u] = this.ze[o]);
       }
       a = new Map();
       f = new Array(u + 1);
       for (i = u; i >= s; i--) {
         c = e[i];
-        l = this.qe ? this.qe(c) : c;
+        l = this.Xe ? this.Xe(c) : c;
         n = a.get(l);
         f[i] = n === undefined ? -1 : n;
         a.set(l, i);
       }
       for (n = s; n <= o; n++) {
         c = this.Ke[n];
-        l = this.qe ? this.qe(c) : c;
+        l = this.Xe ? this.Xe(c) : c;
         i = a.get(l);
         if (i !== undefined && i !== -1) {
-          E[i] = this.Be[n];
-          T[i] = this.Xe[n];
-          d && (d[i] = this.ze[n]);
-          S && (S[i] = this.Ze[n]);
+          E[i] = this.Ze[n];
+          T[i] = this.Be[n];
+          d && (d[i] = this.qe[n]);
+          R && (R[i] = this.ze[n]);
           i = f[i];
           a.set(l, i);
-        } else this.Xe[n].dispose();
+        } else this.Be[n].dispose();
       }
       for (i = s; i < t; i++) {
         if (i in E) {
-          this.Be[i] = E[i];
-          this.Xe[i] = T[i];
+          this.Ze[i] = E[i];
+          this.Be[i] = T[i];
           if (d) {
-            this.ze[i] = d[i];
-            setSignal(this.ze[i], e[i]);
+            this.qe[i] = d[i];
+            setSignal(this.qe[i], e[i]);
           }
-          if (S) {
-            this.Ze[i] = S[i];
-            setSignal(this.Ze[i], i);
+          if (R) {
+            this.ze[i] = R[i];
+            setSignal(this.ze[i], i);
           }
         } else {
-          this.Be[i] = runWithOwner((this.Xe[i] = createOwner()), r);
+          this.Ze[i] = runWithOwner((this.Be[i] = createOwner()), r);
         }
       }
-      this.Be = this.Be.slice(0, (this.$e = t));
+      this.Ze = this.Ze.slice(0, (this.$e = t));
       this.Ke = e.slice(0);
     }
   });
-  return this.Be;
+  return this.Ze;
 }
 function repeat(e, t, n) {
   const i = t;
@@ -2687,8 +2692,8 @@ function repeat(e, t, n) {
     et: 0,
     tt: e,
     Ye: i,
-    Xe: [],
     Be: [],
+    Ze: [],
     nt: n?.from,
     Je: n?.fallback
   });
@@ -2700,45 +2705,45 @@ function updateRepeat() {
     if (e === 0) {
       if (this.$e !== 0) {
         this.Fe.dispose(false);
-        this.Xe = [];
         this.Be = [];
+        this.Ze = [];
         this.$e = 0;
       }
-      if (this.Je && !this.Be[0]) {
-        this.Be[0] = runWithOwner((this.Xe[0] = createOwner()), this.Je);
+      if (this.Je && !this.Ze[0]) {
+        this.Ze[0] = runWithOwner((this.Be[0] = createOwner()), this.Je);
       }
       return;
     }
     const n = t + e;
     const i = this.et + this.$e;
-    if (this.$e === 0 && this.Xe[0]) this.Xe[0].dispose();
-    for (let e = n; e < i; e++) this.Xe[e - this.et].dispose();
+    if (this.$e === 0 && this.Be[0]) this.Be[0].dispose();
+    for (let e = n; e < i; e++) this.Be[e - this.et].dispose();
     if (this.et < t) {
       let e = this.et;
-      while (e < t && e < this.$e) this.Xe[e++].dispose();
-      this.Xe.splice(0, t - this.et);
+      while (e < t && e < this.$e) this.Be[e++].dispose();
       this.Be.splice(0, t - this.et);
+      this.Ze.splice(0, t - this.et);
     } else if (this.et > t) {
       let n = i - this.et - 1;
       let r = this.et - t;
-      this.Xe.length = this.Be.length = e;
+      this.Be.length = this.Ze.length = e;
       while (n >= r) {
-        this.Xe[n] = this.Xe[n - r];
         this.Be[n] = this.Be[n - r];
+        this.Ze[n] = this.Ze[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.Be[e] = runWithOwner((this.Xe[e] = createOwner()), () => this.Ye(e + t));
+        this.Ze[e] = runWithOwner((this.Be[e] = createOwner()), () => this.Ye(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.Be[e - t] = runWithOwner((this.Xe[e - t] = createOwner()), () => this.Ye(e));
+      this.Ze[e - t] = runWithOwner((this.Be[e - t] = createOwner()), () => this.Ye(e));
     }
-    this.Be = this.Be.slice(0, e);
+    this.Ze = this.Ze.slice(0, e);
     this.et = t;
     this.$e = e;
   });
-  return this.Be;
+  return this.Ze;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
@@ -2747,12 +2752,12 @@ function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
   n.Ae = (e, t) => {
     const i = e !== undefined ? e : n.Ee;
-    const r = t !== undefined ? t : n.q;
+    const r = t !== undefined ? t : n.X;
     n.Ee &= ~n.it;
     n.ce.notify(n, n.it, i, r);
   };
   n.it = t;
-  n.Ce = true;
+  n.Ne = true;
   recompute(n, true);
   return n;
 }
@@ -2781,7 +2786,7 @@ class CollectionQueue extends Queue {
   notify(e, t, n, i) {
     if (!(t & this.rt) || (this.rt & STATUS_PENDING && this.ut)) return super.notify(e, t, n, i);
     if (n & this.rt) {
-      const t = i?.source || e.q?.source;
+      const t = i?.source || e.X?.source;
       if (t) {
         const e = this.st.size === 0;
         this.st.add(t);
@@ -2820,7 +2825,7 @@ function createLoadBoundary(e, t) {
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(STATUS_ERROR, e, e => {
     let n = e.st.values().next().value;
-    const i = n.q?.cause ?? n.q;
+    const i = n.X?.cause ?? n.X;
     return t(i, () => {
       for (const t of e.st) recompute(t);
       schedule();