@solidjs/signals 0.10.1 → 0.10.3

package/dist/node.cjs

@@ -139,8 +139,8 @@ function adjustHeight(e, t) {
   }
 }
 const m = new Set();
-const b = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
 const _ = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+const b = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
 let O = 0;
 let x = null;
 let v = false;
@@ -238,12 +238,12 @@ class GlobalQueue extends Queue {
     if (this.q) return;
     this.q = true;
     try {
-      runHeap(b, GlobalQueue.K);
+      runHeap(_, GlobalQueue.K);
       if (x) {
         const e = transitionComplete(x);
         if (!e) {
           let e = x;
-          runHeap(_, GlobalQueue.K);
+          runHeap(b, GlobalQueue.K);
           this.D = [];
           this.B = [];
           this.G = new Set();
@@ -251,7 +251,7 @@ class GlobalQueue extends Queue {
           runLaneEffects(p);
           this.stashQueues(x.X);
           O++;
-          v = b.S >= b.W;
+          v = _.S >= _.W;
           reassignPendingTransition(x.D);
           x = null;
           finalizePureQueue(null, true);
@@ -265,11 +265,11 @@ class GlobalQueue extends Queue {
         reassignPendingTransition(this.D);
         finalizePureQueue(t);
       } else {
-        if (m.size) runHeap(_, GlobalQueue.K);
+        if (m.size) runHeap(b, GlobalQueue.K);
         finalizePureQueue();
       }
       O++;
-      v = b.S >= b.W;
+      v = _.S >= _.W;
       runLaneEffects(d);
       this.run(d);
       runLaneEffects(p);
@@ -359,7 +359,7 @@ function insertSubs(e, t = false) {
       }
       continue;
     }
-    const i = r.A.m & o ? _ : b;
+    const i = r.A.m & o ? b : _;
     if (i.W > r.A.o) i.W = r.A.o;
     insertIntoHeap(r.A, i);
   }
@@ -367,7 +367,7 @@ function insertSubs(e, t = false) {
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(A);
-  if (b.S >= b.W) runHeap(b, GlobalQueue.K);
+  if (_.S >= _.W) runHeap(_, GlobalQueue.K);
   if (n) {
     const t = A.D;
     for (let e = 0; e < t.length; e++) {
@@ -641,7 +641,7 @@ function clearStatus(e) {
   e.ce = e.ce & a;
   e.Y = null;
   updatePendingSignal(e);
-  e.be?.();
+  e._e?.();
 }
 function notifyStatus(e, t, n, r, i) {
   if (t === c && !(n instanceof StatusError) && !(n instanceof NotReadyError))
@@ -665,11 +665,11 @@ function notifyStatus(e, t, n, r, i) {
   }
   const f = r || u;
   const d = r || o ? undefined : i;
-  if (e.be) {
+  if (e._e) {
     if (f) {
-      e.be(t, n);
+      e._e(t, n);
     } else {
-      e.be();
+      e._e();
     }
     return;
   }
@@ -701,12 +701,12 @@ function effect(e, t, n, r, i) {
     },
     lazy: true
   });
-  o._e = r;
+  o.be = r;
   o.Oe = t;
   o.xe = n;
   o.ve = undefined;
   o.ie = i?.render ? d : p;
-  o.be = (e, t) => {
+  o._e = (e, t) => {
     const n = e !== undefined ? e : o.ce;
     const r = t !== undefined ? t : o.Y;
     if (n & c) {
@@ -737,11 +737,11 @@ function runEffect() {
   this.ve?.();
   this.ve = undefined;
   try {
-    this.ve = this.Oe(this.le, this._e);
+    this.ve = this.Oe(this.le, this.be);
   } catch (e) {
     if (!this.oe.notify(this, c, c)) throw e;
   } finally {
-    this._e = this.le;
+    this.be = this.le;
     this.se = false;
   }
 }
@@ -776,8 +776,8 @@ function markDisposal(e) {
   while (t) {
     t.m |= o;
     if (t.m & i) {
-      deleteFromHeap(t, b);
-      insertIntoHeap(t, _);
+      deleteFromHeap(t, _);
+      insertIntoHeap(t, b);
     }
     markDisposal(t);
     t = t.Ae;
@@ -800,7 +800,7 @@ function disposeChildren(e, t = false, n) {
     const e = r.Ae;
     if (r.j) {
       const e = r;
-      deleteFromHeap(e, e.m & o ? _ : b);
+      deleteFromHeap(e, e.m & o ? b : _);
       let t = e.j;
       do {
         t = unlinkSubs(t);
@@ -816,11 +816,12 @@ function disposeChildren(e, t = false, n) {
   } else {
     e.Pe = null;
     e.Ae = null;
+    e.We = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.We : e.Ee;
+  let n = t ? e.Ee : e.je;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -830,10 +831,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.We = null) : (e.Ee = null);
+  t ? (e.Ee = null) : (e.je = null);
 }
 function getNextChildId(e) {
-  if (e.id != null) return formatId(e.id, e.je++);
+  let t = e;
+  while (t.Ne && t.i) t = t.i;
+  if (t.id != null) return formatId(t.id, t.We++);
   throw new Error("Cannot get child id from owner without an id");
 }
 function formatId(e, t) {
@@ -850,40 +853,42 @@ function getOwner() {
 }
 function onCleanup(e) {
   if (!Q) return e;
-  if (!Q.Ee) Q.Ee = e;
-  else if (Array.isArray(Q.Ee)) Q.Ee.push(e);
-  else Q.Ee = [Q.Ee, e];
+  if (!Q.je) Q.je = e;
+  else if (Array.isArray(Q.je)) Q.je.push(e);
+  else Q.je = [Q.je, e];
   return e;
 }
 function createOwner(e) {
   const t = Q;
-  const n = {
-    id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
+  const n = e?.transparent ?? false;
+  const r = {
+    id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
+    Ne: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
     Pe: null,
     Ae: null,
-    Ee: null,
+    je: null,
     oe: t?.oe ?? A,
-    Ne: t?.Ne || w,
-    je: 0,
-    We: null,
+    Le: t?.Le || w,
+    We: 0,
+    Ee: null,
     Ce: null,
     i: t,
     dispose(e = true) {
-      disposeChildren(n, e);
+      disposeChildren(r, e);
     }
   };
   if (t) {
     const e = t.Pe;
     if (e === null) {
-      t.Pe = n;
+      t.Pe = r;
     } else {
-      n.Ae = e;
-      t.Pe = n;
+      r.Ae = e;
+      t.Pe = r;
     }
   }
-  return n;
+  return r;
 }
 function createRoot(e, t) {
   const n = createOwner(t);
@@ -893,21 +898,21 @@ function unlinkSubs(e) {
   const t = e.L;
   const n = e.N;
   const r = e.P;
-  const i = e.Le;
-  if (r !== null) r.Le = i;
-  else t.Ie = i;
+  const i = e.Ie;
+  if (r !== null) r.Ie = i;
+  else t.He = i;
   if (i !== null) i.P = r;
   else {
     t.O = r;
     if (r === null) {
-      t.He?.();
-      t.H && !t.Qe && unobserved(t);
+      t.Qe?.();
+      t.H && !t.Re && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? _ : b);
+  deleteFromHeap(e, e.m & o ? b : _);
   let t = e.j;
   while (t !== null) {
     t = unlinkSubs(t);
@@ -927,9 +932,9 @@ function link(e, t) {
       return;
     }
   }
-  const o = e.Ie;
+  const o = e.He;
   if (o !== null && o.A === t && (!s || isValidLink(o, t))) return;
-  const u = (t.ke = e.Ie = { L: e, A: t, N: i, Le: o, P: null });
+  const u = (t.ke = e.He = { L: e, A: t, N: i, Ie: o, P: null });
   if (n !== null) n.N = u;
   else t.j = u;
   if (o !== null) o.P = u;
@@ -961,14 +966,15 @@ function recompute(t, n = false) {
   const i = t.ie;
   if (!n) {
     if (t.ne && (!i || x) && x !== t.ne) A.initTransition(t.ne);
-    deleteFromHeap(t, t.m & o ? _ : b);
+    deleteFromHeap(t, t.m & o ? b : _);
     if (t.ne || i === h) disposeChildren(t);
     else {
       markDisposal(t);
-      t.We = t.Ee;
+      t.Ee = t.je;
       t.Ce = t.Pe;
-      t.Ee = null;
+      t.je = null;
       t.Pe = null;
+      t.We = 0;
     }
   }
   const s = !!(t.m & f);
@@ -1045,7 +1051,7 @@ function recompute(t, n = false) {
       t.fe = p;
     } else if (t.o != g) {
       for (let e = t.O; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.A, e.A.m & o ? _ : b);
+        insertIntoHeapHeight(e.A, e.A.m & o ? b : _);
       }
     }
   }
@@ -1072,15 +1078,17 @@ function updateIfNecessary(r) {
   r.m = e;
 }
 function computed(t, n, r) {
-  const i = {
-    id: r?.id ?? (Q?.id != null ? getNextChildId(Q) : undefined),
+  const i = r?.transparent ?? false;
+  const s = {
+    id: r?.id ?? (i ? Q?.id : Q?.id != null ? getNextChildId(Q) : undefined),
+    Ne: i || undefined,
     Se: r?.equals != null ? r.equals : isEqual,
-    Re: !!r?.pureWrite,
-    He: r?.unobserved,
-    Ee: null,
+    Te: !!r?.pureWrite,
+    Qe: r?.unobserved,
+    je: null,
     oe: Q?.oe ?? A,
-    Ne: Q?.Ne ?? w,
-    je: 0,
+    Le: Q?.Le ?? w,
+    We: 0,
     H: t,
     le: n,
     o: 0,
@@ -1090,7 +1098,7 @@ function computed(t, n, r) {
     j: null,
     ke: null,
     O: null,
-    Ie: null,
+    He: null,
     i: Q,
     Ae: null,
     Pe: null,
@@ -1098,34 +1106,34 @@ function computed(t, n, r) {
     ce: a,
     $: O,
     fe: y,
-    We: null,
+    Ee: null,
     Ce: null,
     we: null,
     ne: null
   };
-  i.p = i;
-  const s = Q?.t ? Q.u : Q;
+  s.p = s;
+  const o = Q?.t ? Q.u : Q;
   if (Q) {
     const e = Q.Pe;
     if (e === null) {
-      Q.Pe = i;
+      Q.Pe = s;
     } else {
-      i.Ae = e;
-      Q.Pe = i;
+      s.Ae = e;
+      Q.Pe = s;
     }
   }
-  if (s) i.o = s.o + 1;
-  !r?.lazy && recompute(i, true);
-  return i;
+  if (o) s.o = o.o + 1;
+  !r?.lazy && recompute(s, true);
+  return s;
 }
 function signal(e, t, n = null) {
   const r = {
     Se: t?.equals != null ? t.equals : isEqual,
-    Re: !!t?.pureWrite,
-    He: t?.unobserved,
+    Te: !!t?.pureWrite,
+    Qe: t?.unobserved,
     le: e,
     O: null,
-    Ie: null,
+    He: null,
     $: O,
     I: n,
     C: n?.k || null,
@@ -1193,9 +1201,9 @@ function read(e) {
     const n = e.I || e;
     if (n.H) {
       const r = e.m & o;
-      if (n.o >= (r ? _.W : b.W)) {
+      if (n.o >= (r ? b.W : _.W)) {
         markNode(t);
-        markHeap(r ? _ : b);
+        markHeap(r ? b : _);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -1280,14 +1288,14 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Te) {
-    e.Te = optimisticSignal(false, { pureWrite: true });
+  if (!e.Me) {
+    e.Me = optimisticSignal(false, { pureWrite: true });
     if (e.de) {
-      e.Te.de = e;
+      e.Me.de = e;
     }
-    if (computePendingState(e)) setSignal(e.Te, true);
+    if (computePendingState(e)) setSignal(e.Me, true);
   }
-  return e.Te;
+  return e.Me;
 }
 function computePendingState(e) {
   const t = e;
@@ -1303,9 +1311,9 @@ function computePendingState(e) {
   return !!(t.ce & l && !(t.ce & a));
 }
 function updatePendingSignal(e) {
-  if (e.Te) {
+  if (e.Me) {
     const t = computePendingState(e);
-    const n = e.Te;
+    const n = e.Me;
     setSignal(n, t);
     if (!t && n.re) {
       const t = resolveLane(e);
@@ -1395,7 +1403,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Ne[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1405,10 +1413,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Ne = { ...n.Ne, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Le = { ...n.Le, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Ne[e.id]);
+  return !isUndefined(t?.Le[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1690,7 +1698,7 @@ function createProjectionInternal(e, t = {}, n) {
       i !== r && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
-  r.Qe = true;
+  r.Re = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -2118,7 +2126,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.Qe = true;
+    r.Re = true;
   }
   return { store: s, node: r };
 }
@@ -2299,68 +2307,68 @@ function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      Me: createOwner(),
-      qe: 0,
-      Fe: e,
-      Ve: [],
-      De: t,
-      Be: [],
+      qe: createOwner(),
+      Fe: 0,
+      Ve: e,
+      De: [],
+      Be: t,
       Ge: [],
-      Ke: r,
-      ze: r || n?.keyed === false ? [] : undefined,
-      Ue: t.length > 1 ? [] : undefined,
-      Je: n?.fallback
+      Ke: [],
+      ze: r,
+      Ue: r || n?.keyed === false ? [] : undefined,
+      Je: t.length > 1 ? [] : undefined,
+      Xe: n?.fallback
     })
   );
 }
 const oe = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Fe() || [],
+  const e = this.Ve() || [],
     t = e.length;
   e[M];
-  runWithOwner(this.Me, () => {
+  runWithOwner(this.qe, () => {
     let n,
       r,
-      i = this.ze
+      i = this.Ue
         ? () => {
-            this.ze[r] = signal(e[r], oe);
-            this.Ue && (this.Ue[r] = signal(r, oe));
-            return this.De(
-              read.bind(null, this.ze[r]),
-              this.Ue ? read.bind(null, this.Ue[r]) : undefined
+            this.Ue[r] = signal(e[r], oe);
+            this.Je && (this.Je[r] = signal(r, oe));
+            return this.Be(
+              read.bind(null, this.Ue[r]),
+              this.Je ? read.bind(null, this.Je[r]) : undefined
             );
           }
-        : this.Ue
+        : this.Je
           ? () => {
               const t = e[r];
-              this.Ue[r] = signal(r, oe);
-              return this.De(() => t, read.bind(null, this.Ue[r]));
+              this.Je[r] = signal(r, oe);
+              return this.Be(() => t, read.bind(null, this.Je[r]));
             }
           : () => {
               const t = e[r];
-              return this.De(() => t);
+              return this.Be(() => t);
             };
     if (t === 0) {
-      if (this.qe !== 0) {
-        this.Me.dispose(false);
+      if (this.Fe !== 0) {
+        this.qe.dispose(false);
+        this.Ke = [];
+        this.De = [];
         this.Ge = [];
-        this.Ve = [];
-        this.Be = [];
-        this.qe = 0;
-        this.ze && (this.ze = []);
+        this.Fe = 0;
         this.Ue && (this.Ue = []);
+        this.Je && (this.Je = []);
       }
-      if (this.Je && !this.Be[0]) {
-        this.Be[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
+      if (this.Xe && !this.Ge[0]) {
+        this.Ge[0] = runWithOwner((this.Ke[0] = createOwner()), this.Xe);
       }
-    } else if (this.qe === 0) {
-      if (this.Ge[0]) this.Ge[0].dispose();
-      this.Be = new Array(t);
+    } else if (this.Fe === 0) {
+      if (this.Ke[0]) this.Ke[0].dispose();
+      this.Ge = new Array(t);
       for (r = 0; r < t; r++) {
-        this.Ve[r] = e[r];
-        this.Be[r] = runWithOwner((this.Ge[r] = createOwner()), i);
+        this.De[r] = e[r];
+        this.Ge[r] = runWithOwner((this.Ke[r] = createOwner()), i);
       }
-      this.qe = t;
+      this.Fe = t;
     } else {
       let s,
         o,
@@ -2371,144 +2379,144 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         p = new Array(t),
-        h = this.ze ? new Array(t) : undefined,
-        y = this.Ue ? new Array(t) : undefined;
+        h = this.Ue ? new Array(t) : undefined,
+        y = this.Je ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.qe, t);
-        s < o && (this.Ve[s] === e[s] || (this.ze && compare(this.Ke, this.Ve[s], e[s])));
+        s = 0, o = Math.min(this.Fe, t);
+        s < o && (this.De[s] === e[s] || (this.Ue && compare(this.ze, this.De[s], e[s])));
         s++
       ) {
-        if (this.ze) setSignal(this.ze[s], e[s]);
+        if (this.Ue) setSignal(this.Ue[s], e[s]);
       }
       for (
-        o = this.qe - 1, u = t - 1;
+        o = this.Fe - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Ve[o] === e[u] || (this.ze && compare(this.Ke, this.Ve[o], e[u])));
+        (this.De[o] === e[u] || (this.Ue && compare(this.ze, this.De[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Be[o];
-        p[u] = this.Ge[o];
-        h && (h[u] = this.ze[o]);
-        y && (y[u] = this.Ue[o]);
+        d[u] = this.Ge[o];
+        p[u] = this.Ke[o];
+        h && (h[u] = this.Ue[o]);
+        y && (y[u] = this.Je[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        l = this.Ke ? this.Ke(f) : f;
+        l = this.ze ? this.ze(f) : f;
         n = c.get(l);
         a[r] = n === undefined ? -1 : n;
         c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.Ve[n];
-        l = this.Ke ? this.Ke(f) : f;
+        f = this.De[n];
+        l = this.ze ? this.ze(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Be[n];
-          p[r] = this.Ge[n];
-          h && (h[r] = this.ze[n]);
-          y && (y[r] = this.Ue[n]);
+          d[r] = this.Ge[n];
+          p[r] = this.Ke[n];
+          h && (h[r] = this.Ue[n]);
+          y && (y[r] = this.Je[n]);
           r = a[r];
           c.set(l, r);
-        } else this.Ge[n].dispose();
+        } else this.Ke[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Be[r] = d[r];
-          this.Ge[r] = p[r];
+          this.Ge[r] = d[r];
+          this.Ke[r] = p[r];
           if (h) {
-            this.ze[r] = h[r];
-            setSignal(this.ze[r], e[r]);
+            this.Ue[r] = h[r];
+            setSignal(this.Ue[r], e[r]);
           }
           if (y) {
-            this.Ue[r] = y[r];
-            setSignal(this.Ue[r], r);
+            this.Je[r] = y[r];
+            setSignal(this.Je[r], r);
           }
         } else {
-          this.Be[r] = runWithOwner((this.Ge[r] = createOwner()), i);
+          this.Ge[r] = runWithOwner((this.Ke[r] = createOwner()), i);
         }
       }
-      this.Be = this.Be.slice(0, (this.qe = t));
-      this.Ve = e.slice(0);
+      this.Ge = this.Ge.slice(0, (this.Fe = t));
+      this.De = e.slice(0);
     }
   });
-  return this.Be;
+  return this.Ge;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    Me: createOwner(),
-    qe: 0,
-    Xe: 0,
-    Ye: e,
-    De: t,
+    qe: createOwner(),
+    Fe: 0,
+    Ye: 0,
+    Ze: e,
+    Be: t,
+    Ke: [],
     Ge: [],
-    Be: [],
-    Ze: n?.from,
-    Je: n?.fallback
+    $e: n?.from,
+    Xe: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.Ye();
-  const t = this.Ze?.() || 0;
-  runWithOwner(this.Me, () => {
+  const e = this.Ze();
+  const t = this.$e?.() || 0;
+  runWithOwner(this.qe, () => {
     if (e === 0) {
-      if (this.qe !== 0) {
-        this.Me.dispose(false);
+      if (this.Fe !== 0) {
+        this.qe.dispose(false);
+        this.Ke = [];
         this.Ge = [];
-        this.Be = [];
-        this.qe = 0;
+        this.Fe = 0;
       }
-      if (this.Je && !this.Be[0]) {
-        this.Be[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
+      if (this.Xe && !this.Ge[0]) {
+        this.Ge[0] = runWithOwner((this.Ke[0] = createOwner()), this.Xe);
       }
       return;
     }
     const n = t + e;
-    const r = this.Xe + this.qe;
-    if (this.qe === 0 && this.Ge[0]) this.Ge[0].dispose();
-    for (let e = n; e < r; e++) this.Ge[e - this.Xe].dispose();
-    if (this.Xe < t) {
-      let e = this.Xe;
-      while (e < t && e < this.qe) this.Ge[e++].dispose();
-      this.Ge.splice(0, t - this.Xe);
-      this.Be.splice(0, t - this.Xe);
-    } else if (this.Xe > t) {
-      let n = r - this.Xe - 1;
-      let i = this.Xe - t;
-      this.Ge.length = this.Be.length = e;
+    const r = this.Ye + this.Fe;
+    if (this.Fe === 0 && this.Ke[0]) this.Ke[0].dispose();
+    for (let e = n; e < r; e++) this.Ke[e - this.Ye].dispose();
+    if (this.Ye < t) {
+      let e = this.Ye;
+      while (e < t && e < this.Fe) this.Ke[e++].dispose();
+      this.Ke.splice(0, t - this.Ye);
+      this.Ge.splice(0, t - this.Ye);
+    } else if (this.Ye > t) {
+      let n = r - this.Ye - 1;
+      let i = this.Ye - t;
+      this.Ke.length = this.Ge.length = e;
       while (n >= i) {
+        this.Ke[n] = this.Ke[n - i];
         this.Ge[n] = this.Ge[n - i];
-        this.Be[n] = this.Be[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.Be[e] = runWithOwner((this.Ge[e] = createOwner()), () => this.De(e + t));
+        this.Ge[e] = runWithOwner((this.Ke[e] = createOwner()), () => this.Be(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Be[e - t] = runWithOwner((this.Ge[e - t] = createOwner()), () => this.De(e));
+      this.Ge[e - t] = runWithOwner((this.Ke[e - t] = createOwner()), () => this.Be(e));
     }
-    this.Be = this.Be.slice(0, e);
-    this.Xe = t;
-    this.qe = e;
+    this.Ge = this.Ge.slice(0, e);
+    this.Ye = t;
+    this.Fe = e;
   });
-  return this.Be;
+  return this.Ge;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.be = (e, t) => {
+  n._e = (e, t) => {
     const r = e !== undefined ? e : n.ce;
     const i = t !== undefined ? t : n.Y;
-    n.ce &= ~n.$e;
-    n.oe.notify(n, n.$e, r, i);
+    n.ce &= ~n.et;
+    n.oe.notify(n, n.et, r, i);
   };
-  n.$e = t;
-  n.Qe = true;
+  n.et = t;
+  n.Re = true;
   recompute(n, true);
   return n;
 }
@@ -2522,36 +2530,36 @@ function createBoundChildren(e, t, n, r) {
   });
 }
 class CollectionQueue extends Queue {
-  et;
-  tt = new Set();
-  nt = signal(false, { pureWrite: true });
-  rt = false;
+  tt;
+  nt = new Set();
+  rt = signal(false, { pureWrite: true });
+  it = false;
   constructor(e) {
     super();
-    this.et = e;
+    this.tt = e;
   }
   run(e) {
-    if (!e || read(this.nt)) return;
+    if (!e || read(this.rt)) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.et) || (this.et & l && this.rt)) return super.notify(e, t, n, r);
-    if (n & this.et) {
+    if (!(t & this.tt) || (this.tt & l && this.it)) return super.notify(e, t, n, r);
+    if (n & this.tt) {
       const t = r?.source || e.Y?.source;
       if (t) {
-        const e = this.tt.size === 0;
-        this.tt.add(t);
-        if (e) setSignal(this.nt, true);
+        const e = this.nt.size === 0;
+        this.nt.add(t);
+        if (e) setSignal(this.rt, true);
       }
     }
-    t &= ~this.et;
+    t &= ~this.tt;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.tt) {
-      if (!(e.ce & this.et)) this.tt.delete(e);
+    for (const e of this.nt) {
+      if (!(e.ce & this.tt)) this.nt.delete(e);
     }
-    if (!this.tt.size) setSignal(this.nt, false);
+    if (!this.nt.size) setSignal(this.rt, false);
   }
 }
 function createCollectionBoundary(e, t, n) {
@@ -2559,10 +2567,10 @@ function createCollectionBoundary(e, t, n) {
   const i = new CollectionQueue(e);
   const s = createBoundChildren(r, t, i, e);
   const o = computed(() => {
-    if (!read(i.nt)) {
+    if (!read(i.rt)) {
       const e = read(s);
-      if (!untrack(() => read(i.nt))) {
-        i.rt = true;
+      if (!untrack(() => read(i.rt))) {
+        i.it = true;
         return e;
       }
     }
@@ -2575,10 +2583,10 @@ function createLoadBoundary(e, t) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
-    let n = e.tt.values().next().value;
+    let n = e.nt.values().next().value;
     const r = n.Y?.cause ?? n.Y;
     return t(r, () => {
-      for (const t of e.tt) recompute(t);
+      for (const t of e.nt) recompute(t);
       schedule();
     });
   });