@solidjs/signals 0.11.0 → 0.11.2

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;
@@ -167,17 +168,17 @@ function schedule() {
 }
 class Queue {
   i = null;
-  M = [[], []];
-  G = [];
+  G = [[], []];
+  M = [];
   created = clock;
   addChild(e) {
-    this.G.push(e);
+    this.M.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.G.indexOf(e);
+    const t = this.M.indexOf(e);
     if (t >= 0) {
-      this.G.splice(t, 1);
+      this.M.splice(t, 1);
       e.i = null;
     }
   }
@@ -186,12 +187,12 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.M[e - 1].length) {
-      const t = this.M[e - 1];
-      this.M[e - 1] = [];
+    if (this.G[e - 1].length) {
+      const t = this.G[e - 1];
+      this.G[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.G.length; t++) this.G[t].run?.(e);
+    for (let t = 0; t < this.M.length; t++) this.M[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
@@ -199,31 +200,31 @@ class Queue {
         const n = findLane(currentOptimisticLane);
         n.W[e - 1].push(t);
       } else {
-        this.M[e - 1].push(t);
+        this.G[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.M[0].push(...this.M[0]);
-    e.M[1].push(...this.M[1]);
-    this.M = [[], []];
-    for (let t = 0; t < this.G.length; t++) {
-      let n = this.G[t];
-      let i = e.G[t];
+    e.G[0].push(...this.G[0]);
+    e.G[1].push(...this.G[1]);
+    this.G = [[], []];
+    for (let t = 0; t < this.M.length; t++) {
+      let n = this.M[t];
+      let i = e.M[t];
       if (!i) {
-        i = { M: [[], []], G: [] };
-        e.G[t] = i;
+        i = { G: [[], []], M: [] };
+        e.M[t] = i;
       }
       n.stashQueues(i);
     }
   }
   restoreQueues(e) {
-    this.M[0].push(...e.M[0]);
-    this.M[1].push(...e.M[1]);
-    for (let t = 0; t < e.G.length; t++) {
-      const n = e.G[t];
-      let i = this.G[t];
+    this.G[0].push(...e.G[0]);
+    this.G[1].push(...e.G[1]);
+    for (let t = 0; t < e.M.length; t++) {
+      const n = e.M[t];
+      let i = this.M[t];
       if (i) i.restoreQueues(n);
     }
   }
@@ -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,7 +252,7 @@ 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;
           reassignPendingTransition(activeTransition.F);
@@ -260,7 +261,7 @@ class GlobalQueue extends Queue {
           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;
@@ -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: { G: [[], []], M: [] },
         te: false
       };
     } else if (e) {
@@ -384,7 +385,7 @@ function finalizePureQueue(e = null, t = false) {
         n.ae = NOT_PENDING;
         if (n.oe && n.oe !== EFFECT_TRACKED) n.ue = true;
       }
-      n.Ee &= ~STATUS_UNINITIALIZED;
+      if (!(n.Ee & STATUS_PENDING)) n.Ee &= ~STATUS_UNINITIALIZED;
       if (n.L) GlobalQueue.Y(n, false, true);
     }
     t.length = 0;
@@ -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();
@@ -426,7 +427,7 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.G) {
+  for (const t of e.M) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
@@ -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;
     }
@@ -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);
       }
@@ -703,12 +704,12 @@ function unlinkSubs(e) {
   const i = e.p;
   const r = e.Pe;
   if (i !== null) i.Pe = r;
-  else t.ge = r;
+  else t.Ne = r;
   if (r !== null) r.p = i;
   else {
     t.I = i;
     if (i === null) {
-      t.Ne?.();
+      t.ge?.();
       t.L && !t.Ce && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
     }
   }
@@ -735,9 +736,9 @@ function link(e, t) {
       return;
     }
   }
-  const s = e.ge;
+  const s = e.Ne;
   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 });
+  const o = (t.ye = e.Ne = { V: e, h: t, D: i, Pe: s, p: null });
   if (n !== null) n.D = o;
   else t.C = o;
   if (s !== null) s.p = o;
@@ -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);
@@ -1092,7 +1093,7 @@ 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;
     if (l !== null) {
@@ -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);
@@ -1152,8 +1153,8 @@ function computed(e, t, n) {
     id: n?.id ?? (i ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
     Le: i || undefined,
     pe: n?.equals != null ? n.equals : isEqual,
-    Me: !!n?.pureWrite,
-    Ne: n?.unobserved,
+    Ge: !!n?.pureWrite,
+    ge: n?.unobserved,
     me: null,
     ce: context?.ce ?? globalQueue,
     ke: context?.ke ?? defaultContext,
@@ -1167,11 +1168,11 @@ function computed(e, t, n) {
     C: null,
     ye: null,
     I: null,
-    ge: null,
+    Ne: 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,
@@ -1205,18 +1206,18 @@ function computed(e, t, n) {
 function signal(e, t, n = null) {
   const i = {
     pe: t?.equals != null ? t.equals : isEqual,
-    Me: !!t?.pureWrite,
-    Ne: t?.unobserved,
+    Ge: !!t?.pureWrite,
+    ge: t?.unobserved,
     fe: e,
     I: null,
-    ge: null,
+    Ne: null,
     J: clock,
     m: n,
     P: n?.A || null,
     ae: NOT_PENDING
   };
   n && (n.A = i);
-  if (snapshotCaptureActive && !i.Me) {
+  if (snapshotCaptureActive && !i.Ge) {
     i.re = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
@@ -1288,10 +1289,14 @@ 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);
+  }
+  const n = e.m || e;
   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)) {
@@ -1305,7 +1310,6 @@ function read(e) {
       }
     }
   }
-  const n = e.m || e;
   if (n.Ee & STATUS_PENDING) {
     if (t && !(stale && n.ne && activeTransition !== n.ne)) {
       if (currentOptimisticLane) {
@@ -1313,21 +1317,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;
@@ -1350,7 +1354,7 @@ function setSignal(e, t) {
   const n = e._e && !projectionWriteActive;
   const i = n ? e.fe : e.ae === NOT_PENDING ? e.fe : e.ae;
   if (typeof t === "function") t = t(i);
-  const r = !e.pe || !e.pe(i, t);
+  const r = !e.pe || !e.pe(i, t) || !!(e.Ee & STATUS_UNINITIALIZED);
   if (!r) {
     if (n && e.ae !== NOT_PENDING && e.L) {
       insertSubs(e, true);
@@ -1399,14 +1403,14 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Ge) {
-    e.Ge = optimisticSignal(false, { pureWrite: true });
+  if (!e.Me) {
+    e.Me = optimisticSignal(false, { pureWrite: true });
     if (e.de) {
-      e.Ge.de = e;
+      e.Me.de = e;
     }
-    if (computePendingState(e)) setSignal(e.Ge, true);
+    if (computePendingState(e)) setSignal(e.Me, true);
   }
-  return e.Ge;
+  return e.Me;
 }
 function computePendingState(e) {
   const t = e;
@@ -1422,9 +1426,9 @@ function computePendingState(e) {
   return !!(t.Ee & STATUS_PENDING && !(t.Ee & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
-  if (e.Ge) {
+  if (e.Me) {
     const t = computePendingState(e);
-    const n = e.Ge;
+    const n = e.Me;
     setSignal(n, t);
     if (!t && n.ie) {
       const t = resolveLane(e);
@@ -2218,7 +2222,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;
@@ -2547,11 +2551,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 +2568,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 +2590,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 +2618,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,
+        S = 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]);
+        S && (S[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]);
+          S && (S[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);
+            this.ze[i] = S[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 +2691,8 @@ function repeat(e, t, n) {
     et: 0,
     tt: e,
     Ye: i,
-    Xe: [],
     Be: [],
+    Ze: [],
     nt: n?.from,
     Je: n?.fallback
   });
@@ -2700,45 +2704,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,7 +2751,7 @@ 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);
   };
@@ -2781,7 +2785,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 +2824,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();