@solidjs/signals 0.10.2 → 0.10.4

package/dist/prod.js

@@ -103,7 +103,7 @@ function markNode(e, t = REACTIVE_DIRTY) {
     markNode(t.h, REACTIVE_CHECK);
   }
   if (e.A !== null) {
-    for (let t = e.A; t !== null; t = t.P) {
+    for (let t = e.A; t !== null; t = t.C) {
       for (let e = t.I; e !== null; e = e.p) {
         markNode(e.h, REACTIVE_CHECK);
       }
@@ -112,12 +112,12 @@ function markNode(e, t = REACTIVE_DIRTY) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.C = 0; e.C <= e.O; e.C++) {
-    let n = e.l[e.C];
+  for (e.P = 0; e.P <= e.O; e.P++) {
+    let n = e.l[e.P];
     while (n !== undefined) {
       if (n.S & REACTIVE_IN_HEAP) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.C];
+      n = e.l[e.P];
     }
   }
   e.O = 0;
@@ -138,8 +138,8 @@ function adjustHeight(e, t) {
   }
 }
 const transitions = new Set();
-const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, C: 0, O: 0 };
-const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, C: 0, O: 0 };
+const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, P: 0, O: 0 };
+const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, P: 0, O: 0 };
 let clock = 0;
 let activeTransition = null;
 let scheduled = false;
@@ -250,7 +250,7 @@ class GlobalQueue extends Queue {
           runLaneEffects(EFFECT_USER);
           this.stashQueues(activeTransition.X);
           clock++;
-          scheduled = dirtyQueue.O >= dirtyQueue.C;
+          scheduled = dirtyQueue.O >= dirtyQueue.P;
           reassignPendingTransition(activeTransition.$);
           activeTransition = null;
           finalizePureQueue(null, true);
@@ -268,7 +268,7 @@ class GlobalQueue extends Queue {
         finalizePureQueue();
       }
       clock++;
-      scheduled = dirtyQueue.O >= dirtyQueue.C;
+      scheduled = dirtyQueue.O >= dirtyQueue.P;
       runLaneEffects(EFFECT_RENDER);
       this.run(EFFECT_RENDER);
       runLaneEffects(EFFECT_USER);
@@ -359,14 +359,14 @@ function insertSubs(e, t = false) {
       continue;
     }
     const r = i.h.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (r.C > i.h.o) r.C = i.h.o;
+    if (r.P > i.h.o) r.P = i.h.o;
     insertIntoHeap(i.h, r);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(globalQueue);
-  if (dirtyQueue.O >= dirtyQueue.C) runHeap(dirtyQueue, GlobalQueue.K);
+  if (dirtyQueue.O >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.K);
   if (n) {
     const t = globalQueue.$;
     for (let e = 0; e < t.length; e++) {
@@ -679,7 +679,7 @@ function notifyStatus(e, t, n, i, r) {
       notifyStatus(i.h, t, n, c, l);
     }
   }
-  for (let i = e.A; i !== null; i = i.P) {
+  for (let i = e.A; i !== null; i = i.C) {
     for (let e = i.I; e !== null; e = e.p) {
       e.h.J = clock;
       if (e.h.q !== n) {
@@ -689,89 +689,67 @@ function notifyStatus(e, t, n, i, r) {
     }
   }
 }
-function effect(e, t, n, i, r) {
-  let o = false;
-  const s = computed(r?.render ? t => staleValues(() => e(t)) : e, i, {
-    ...r,
-    equals: () => {
-      s.oe = !s.q;
-      if (o) s.se.enqueue(s.re, runEffect.bind(s));
-      return false;
-    },
-    lazy: true
-  });
-  s.he = i;
-  s.Ae = t;
-  s.ge = n;
-  s.Pe = undefined;
-  s.re = r?.render ? EFFECT_RENDER : EFFECT_USER;
-  s.pe = (e, t) => {
-    const n = e !== undefined ? e : s.ae;
-    const i = t !== undefined ? t : s.q;
-    if (n & STATUS_ERROR) {
-      let e = i;
-      s.se.notify(s, STATUS_PENDING, 0);
-      if (s.re === EFFECT_USER) {
-        try {
-          return s.ge
-            ? s.ge(e, () => {
-                s.Pe?.();
-                s.Pe = undefined;
-              })
-            : console.error(e);
-        } catch (t) {
-          e = t;
-        }
-      }
-      if (!s.se.notify(s, STATUS_ERROR, STATUS_ERROR)) throw e;
-    } else if (s.re === EFFECT_RENDER) s.se.notify(s, STATUS_PENDING | STATUS_ERROR, n, i);
-  };
-  recompute(s, true);
-  !r?.defer && (s.re === EFFECT_USER ? s.se.enqueue(s.re, runEffect.bind(s)) : runEffect.call(s));
-  o = true;
-  onCleanup(() => s.Pe?.());
+function unlinkSubs(e) {
+  const t = e.V;
+  const n = e.D;
+  const i = e.p;
+  const r = e.he;
+  if (i !== null) i.he = r;
+  else t.Ae = r;
+  if (r !== null) r.p = i;
+  else {
+    t.I = i;
+    if (i === null) {
+      t.ge?.();
+      t.L && !t.Ce && unobserved(t);
+    }
+  }
+  return n;
 }
-function runEffect() {
-  if (!this.oe || this.S & REACTIVE_DISPOSED) return;
-  this.Pe?.();
-  this.Pe = undefined;
-  try {
-    this.Pe = this.Ae(this.le, this.he);
-  } catch (e) {
-    if (!this.se.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
-  } finally {
-    this.he = this.le;
-    this.oe = false;
+function unobserved(e) {
+  deleteFromHeap(e, e.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+  let t = e.N;
+  while (t !== null) {
+    t = unlinkSubs(t);
   }
+  e.N = null;
+  disposeChildren(e, true);
 }
-function trackedEffect(e, t) {
-  const run = () => {
-    if (!n.oe || n.S & REACTIVE_DISPOSED) return;
-    n.oe = false;
-    recompute(n);
-  };
-  const n = computed(
-    () => {
-      try {
-        n.Pe?.();
-        n.Pe = undefined;
-        n.Pe = staleValues(e) || undefined;
-      } finally {
-      }
-    },
-    undefined,
-    { ...t, lazy: true, pureWrite: true }
-  );
-  n.Pe = undefined;
-  n.oe = true;
-  n.re = EFFECT_TRACKED;
-  n.ue = run;
-  n.se.enqueue(EFFECT_USER, run);
-  onCleanup(() => n.Pe?.());
+function link(e, t) {
+  const n = t.Pe;
+  if (n !== null && n.V === e) return;
+  let i = null;
+  const r = t.S & REACTIVE_RECOMPUTING_DEPS;
+  if (r) {
+    i = n !== null ? n.D : t.N;
+    if (i !== null && i.V === e) {
+      t.Pe = i;
+      return;
+    }
+  }
+  const o = e.Ae;
+  if (o !== null && o.h === t && (!r || isValidLink(o, t))) return;
+  const s = (t.Pe = e.Ae = { V: e, h: t, D: i, he: o, p: null });
+  if (n !== null) n.D = s;
+  else t.N = s;
+  if (o !== null) o.p = s;
+  else e.I = s;
+}
+function isValidLink(e, t) {
+  const n = t.Pe;
+  if (n !== null) {
+    let i = t.N;
+    do {
+      if (i === e) return true;
+      if (i === n) break;
+      i = i.D;
+    } while (i !== null);
+  }
+  return false;
 }
 const PENDING_OWNER = {};
 function markDisposal(e) {
-  let t = e.Ce;
+  let t = e.Ne;
   while (t) {
     t.S |= REACTIVE_ZOMBIE;
     if (t.S & REACTIVE_IN_HEAP) {
@@ -779,7 +757,7 @@ function markDisposal(e) {
       insertIntoHeap(t, zombieQueue);
     }
     markDisposal(t);
-    t = t.Ne;
+    t = t.ye;
   }
 }
 function dispose(e) {
@@ -788,15 +766,15 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.N = null;
-  e.ye = null;
+  e.Pe = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.S & REACTIVE_DISPOSED) return;
   if (t) e.S = REACTIVE_DISPOSED;
-  let i = n ? e.De : e.Ce;
+  let i = n ? e.De : e.Ne;
   while (i) {
-    const e = i.Ne;
+    const e = i.ye;
     if (i.N) {
       const e = i;
       deleteFromHeap(e, e.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
@@ -805,7 +783,7 @@ function disposeChildren(e, t = false, n) {
         t = unlinkSubs(t);
       } while (t !== null);
       e.N = null;
-      e.ye = null;
+      e.Pe = null;
     }
     disposeChildren(i, true);
     i = e;
@@ -813,8 +791,8 @@ function disposeChildren(e, t = false, n) {
   if (n) {
     e.De = null;
   } else {
-    e.Ce = null;
     e.Ne = null;
+    e.ye = null;
     e.ve = 0;
   }
   runDisposal(e, n);
@@ -832,10 +810,18 @@ function runDisposal(e, t) {
   }
   t ? (e.we = null) : (e.be = null);
 }
-function getNextChildId(e) {
-  if (e.id != null) return formatId(e.id, e.ve++);
+function childId(e, t) {
+  let n = e;
+  while (n.Ve && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.ve++ : n.ve);
   throw new Error("Cannot get child id from owner without an id");
 }
+function getNextChildId(e) {
+  return childId(e, true);
+}
+function peekNextChildId(e) {
+  return childId(e, false);
+}
 function formatId(e, t) {
   const n = t.toString(36),
     i = n.length - 1;
@@ -857,95 +843,119 @@ function onCleanup(e) {
 }
 function createOwner(e) {
   const t = context;
-  const n = {
-    id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
+  const n = e?.transparent ?? false;
+  const i = {
+    id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
+    Ve: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    Ce: null,
     Ne: null,
+    ye: null,
     be: null,
     se: t?.se ?? globalQueue,
-    Ve: t?.Ve || defaultContext,
+    me: t?.me || defaultContext,
     ve: 0,
     we: null,
     De: null,
     i: t,
     dispose(e = true) {
-      disposeChildren(n, e);
+      disposeChildren(i, e);
     }
   };
   if (t) {
-    const e = t.Ce;
+    const e = t.Ne;
     if (e === null) {
-      t.Ce = n;
+      t.Ne = i;
     } else {
-      n.Ne = e;
-      t.Ce = n;
+      i.ye = e;
+      t.Ne = i;
     }
   }
-  return n;
+  return i;
 }
 function createRoot(e, t) {
   const n = createOwner(t);
   return runWithOwner(n, () => e(n.dispose));
 }
-function unlinkSubs(e) {
-  const t = e.V;
-  const n = e.D;
-  const i = e.p;
-  const r = e.me;
-  if (i !== null) i.me = r;
-  else t.Le = r;
-  if (r !== null) r.p = i;
-  else {
-    t.I = i;
-    if (i === null) {
-      t.ke?.();
-      t.L && !t.Ue && unobserved(t);
-    }
-  }
-  return n;
-}
-function unobserved(e) {
-  deleteFromHeap(e, e.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  let t = e.N;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.N = null;
-  disposeChildren(e, true);
+function effect(e, t, n, i, r) {
+  let o = false;
+  const s = computed(r?.render ? t => staleValues(() => e(t)) : e, i, {
+    ...r,
+    equals: () => {
+      s.oe = !s.q;
+      if (o) s.se.enqueue(s.re, runEffect.bind(s));
+      return false;
+    },
+    lazy: true
+  });
+  s.Le = i;
+  s.ke = t;
+  s.Ue = n;
+  s.We = undefined;
+  s.re = r?.render ? EFFECT_RENDER : EFFECT_USER;
+  s.pe = (e, t) => {
+    const n = e !== undefined ? e : s.ae;
+    const i = t !== undefined ? t : s.q;
+    if (n & STATUS_ERROR) {
+      let e = i;
+      s.se.notify(s, STATUS_PENDING, 0);
+      if (s.re === EFFECT_USER) {
+        try {
+          return s.Ue
+            ? s.Ue(e, () => {
+                s.We?.();
+                s.We = undefined;
+              })
+            : console.error(e);
+        } catch (t) {
+          e = t;
+        }
+      }
+      if (!s.se.notify(s, STATUS_ERROR, STATUS_ERROR)) throw e;
+    } else if (s.re === EFFECT_RENDER) s.se.notify(s, STATUS_PENDING | STATUS_ERROR, n, i);
+  };
+  recompute(s, true);
+  !r?.defer && (s.re === EFFECT_USER ? s.se.enqueue(s.re, runEffect.bind(s)) : runEffect.call(s));
+  o = true;
+  onCleanup(() => s.We?.());
 }
-function link(e, t) {
-  const n = t.ye;
-  if (n !== null && n.V === e) return;
-  let i = null;
-  const r = t.S & REACTIVE_RECOMPUTING_DEPS;
-  if (r) {
-    i = n !== null ? n.D : t.N;
-    if (i !== null && i.V === e) {
-      t.ye = i;
-      return;
-    }
+function runEffect() {
+  if (!this.oe || this.S & REACTIVE_DISPOSED) return;
+  this.We?.();
+  this.We = undefined;
+  try {
+    this.We = this.ke(this.le, this.Le);
+  } catch (e) {
+    if (!this.se.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
+  } finally {
+    this.Le = this.le;
+    this.oe = false;
   }
-  const o = e.Le;
-  if (o !== null && o.h === t && (!r || isValidLink(o, t))) return;
-  const s = (t.ye = e.Le = { V: e, h: t, D: i, me: o, p: null });
-  if (n !== null) n.D = s;
-  else t.N = s;
-  if (o !== null) o.p = s;
-  else e.I = s;
 }
-function isValidLink(e, t) {
-  const n = t.ye;
-  if (n !== null) {
-    let i = t.N;
-    do {
-      if (i === e) return true;
-      if (i === n) break;
-      i = i.D;
-    } while (i !== null);
-  }
-  return false;
+function trackedEffect(e, t) {
+  const run = () => {
+    if (!n.oe || n.S & REACTIVE_DISPOSED) return;
+    n.oe = false;
+    recompute(n);
+  };
+  const n = computed(
+    () => {
+      try {
+        n.We?.();
+        n.We = undefined;
+        n.We = staleValues(e) || undefined;
+      } finally {
+      }
+    },
+    undefined,
+    { ...t, lazy: true, pureWrite: true }
+  );
+  n.We = undefined;
+  n.oe = true;
+  n.re = EFFECT_TRACKED;
+  n.ue = run;
+  n.se.enqueue(EFFECT_USER, run);
+  onCleanup(() => n.We?.());
 }
 GlobalQueue.K = recompute;
 GlobalQueue.Y = disposeChildren;
@@ -967,9 +977,9 @@ function recompute(e, t = false) {
     else {
       markDisposal(e);
       e.we = e.be;
-      e.De = e.Ce;
+      e.De = e.Ne;
       e.be = null;
-      e.Ce = null;
+      e.Ne = null;
       e.ve = 0;
     }
   }
@@ -978,7 +988,7 @@ function recompute(e, t = false) {
   const o = !!(e.ae & STATUS_PENDING);
   const s = context;
   context = e;
-  e.ye = null;
+  e.Pe = null;
   e.S = REACTIVE_RECOMPUTING_DEPS;
   e.J = clock;
   let u = e.ce === NOT_PENDING ? e.le : e.ce;
@@ -1020,7 +1030,7 @@ function recompute(e, t = false) {
     context = s;
   }
   if (!e.q) {
-    const s = e.ye;
+    const s = e.Pe;
     let l = s !== null ? s.D : e.N;
     if (l !== null) {
       do {
@@ -1074,14 +1084,16 @@ function updateIfNecessary(e) {
   e.S = REACTIVE_NONE;
 }
 function computed(e, t, n) {
-  const i = {
-    id: n?.id ?? (context?.id != null ? getNextChildId(context) : undefined),
+  const i = n?.transparent ?? false;
+  const r = {
+    id: n?.id ?? (i ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
+    Ve: i || undefined,
     _e: n?.equals != null ? n.equals : isEqual,
-    We: !!n?.pureWrite,
-    ke: n?.unobserved,
+    xe: !!n?.pureWrite,
+    ge: n?.unobserved,
     be: null,
     se: context?.se ?? globalQueue,
-    Ve: context?.Ve ?? defaultContext,
+    me: context?.me ?? defaultContext,
     ve: 0,
     L: e,
     le: t,
@@ -1090,12 +1102,12 @@ function computed(e, t, n) {
     R: undefined,
     T: null,
     N: null,
-    ye: null,
+    Pe: null,
     I: null,
-    Le: null,
+    Ae: null,
     i: context,
+    ye: null,
     Ne: null,
-    Ce: null,
     S: REACTIVE_NONE,
     ae: STATUS_UNINITIALIZED,
     J: clock,
@@ -1105,32 +1117,32 @@ function computed(e, t, n) {
     Se: null,
     ne: null
   };
-  i.T = i;
-  const r = context?.t ? context.u : context;
+  r.T = r;
+  const o = context?.t ? context.u : context;
   if (context) {
-    const e = context.Ce;
+    const e = context.Ne;
     if (e === null) {
-      context.Ce = i;
+      context.Ne = r;
     } else {
-      i.Ne = e;
-      context.Ce = i;
+      r.ye = e;
+      context.Ne = r;
     }
   }
-  if (r) i.o = r.o + 1;
-  !n?.lazy && recompute(i, true);
-  return i;
+  if (o) r.o = o.o + 1;
+  !n?.lazy && recompute(r, true);
+  return r;
 }
 function signal(e, t, n = null) {
   const i = {
     _e: t?.equals != null ? t.equals : isEqual,
-    We: !!t?.pureWrite,
-    ke: t?.unobserved,
+    xe: !!t?.pureWrite,
+    ge: t?.unobserved,
     le: e,
     I: null,
-    Le: null,
+    Ae: null,
     J: clock,
     m: n,
-    P: n?.A || null,
+    C: n?.A || null,
     ce: NOT_PENDING
   };
   n && (n.A = i);
@@ -1195,7 +1207,7 @@ function read(e) {
     const n = e.m || e;
     if (n.L) {
       const i = e.S & REACTIVE_ZOMBIE;
-      if (n.o >= (i ? zombieQueue.C : dirtyQueue.C)) {
+      if (n.o >= (i ? zombieQueue.P : dirtyQueue.P)) {
         markNode(t);
         markHeap(i ? zombieQueue : dirtyQueue);
         updateIfNecessary(n);
@@ -1402,7 +1414,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Ve[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.me[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1412,10 +1424,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Ve = { ...n.Ve, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.me = { ...n.me, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Ve[e.id]);
+  return !isUndefined(t?.me[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1699,7 +1711,7 @@ function createProjectionInternal(e, t = {}, n) {
       r !== i && r !== undefined && reconcile(r, n?.key || "id", n?.all)(o);
     });
   });
-  i.Ue = true;
+  i.Ce = true;
   return { store: o, node: i };
 }
 function createProjection(e, t = {}, n) {
@@ -2167,7 +2179,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    i.Ue = true;
+    i.Ce = true;
   }
   return { store: o, node: i };
 }
@@ -2351,68 +2363,68 @@ function mapArray(e, t, n) {
   const i = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      xe: createOwner(),
-      Me: 0,
-      Fe: e,
-      Ge: [],
-      $e: t,
-      He: [],
+      Me: createOwner(),
+      Fe: 0,
+      Ge: e,
+      $e: [],
+      He: t,
       je: [],
-      Ke: i,
-      Ye: i || n?.keyed === false ? [] : undefined,
-      Be: t.length > 1 ? [] : undefined,
-      Xe: n?.fallback
+      Ke: [],
+      Ye: i,
+      Be: i || n?.keyed === false ? [] : undefined,
+      Xe: t.length > 1 ? [] : undefined,
+      qe: n?.fallback
     })
   );
 }
 const pureOptions = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Fe() || [],
+  const e = this.Ge() || [],
     t = e.length;
   e[$TRACK];
-  runWithOwner(this.xe, () => {
+  runWithOwner(this.Me, () => {
     let n,
       i,
-      r = this.Ye
+      r = this.Be
         ? () => {
-            this.Ye[i] = signal(e[i], pureOptions);
-            this.Be && (this.Be[i] = signal(i, pureOptions));
-            return this.$e(
-              read.bind(null, this.Ye[i]),
-              this.Be ? read.bind(null, this.Be[i]) : undefined
+            this.Be[i] = signal(e[i], pureOptions);
+            this.Xe && (this.Xe[i] = signal(i, pureOptions));
+            return this.He(
+              read.bind(null, this.Be[i]),
+              this.Xe ? read.bind(null, this.Xe[i]) : undefined
             );
           }
-        : this.Be
+        : this.Xe
           ? () => {
               const t = e[i];
-              this.Be[i] = signal(i, pureOptions);
-              return this.$e(() => t, read.bind(null, this.Be[i]));
+              this.Xe[i] = signal(i, pureOptions);
+              return this.He(() => t, read.bind(null, this.Xe[i]));
             }
           : () => {
               const t = e[i];
-              return this.$e(() => t);
+              return this.He(() => t);
             };
     if (t === 0) {
-      if (this.Me !== 0) {
-        this.xe.dispose(false);
+      if (this.Fe !== 0) {
+        this.Me.dispose(false);
+        this.Ke = [];
+        this.$e = [];
         this.je = [];
-        this.Ge = [];
-        this.He = [];
-        this.Me = 0;
-        this.Ye && (this.Ye = []);
+        this.Fe = 0;
         this.Be && (this.Be = []);
+        this.Xe && (this.Xe = []);
       }
-      if (this.Xe && !this.He[0]) {
-        this.He[0] = runWithOwner((this.je[0] = createOwner()), this.Xe);
+      if (this.qe && !this.je[0]) {
+        this.je[0] = runWithOwner((this.Ke[0] = createOwner()), this.qe);
       }
-    } else if (this.Me === 0) {
-      if (this.je[0]) this.je[0].dispose();
-      this.He = new Array(t);
+    } else if (this.Fe === 0) {
+      if (this.Ke[0]) this.Ke[0].dispose();
+      this.je = new Array(t);
       for (i = 0; i < t; i++) {
-        this.Ge[i] = e[i];
-        this.He[i] = runWithOwner((this.je[i] = createOwner()), r);
+        this.$e[i] = e[i];
+        this.je[i] = runWithOwner((this.Ke[i] = createOwner()), r);
       }
-      this.Me = t;
+      this.Fe = t;
     } else {
       let o,
         s,
@@ -2423,130 +2435,130 @@ function updateKeyedMap() {
         f,
         E = new Array(t),
         T = new Array(t),
-        d = this.Ye ? new Array(t) : undefined,
-        R = this.Be ? new Array(t) : undefined;
+        d = this.Be ? new Array(t) : undefined,
+        R = this.Xe ? new Array(t) : undefined;
       for (
-        o = 0, s = Math.min(this.Me, t);
-        o < s && (this.Ge[o] === e[o] || (this.Ye && compare(this.Ke, this.Ge[o], e[o])));
+        o = 0, s = Math.min(this.Fe, t);
+        o < s && (this.$e[o] === e[o] || (this.Be && compare(this.Ye, this.$e[o], e[o])));
         o++
       ) {
-        if (this.Ye) setSignal(this.Ye[o], e[o]);
+        if (this.Be) setSignal(this.Be[o], e[o]);
       }
       for (
-        s = this.Me - 1, u = t - 1;
+        s = this.Fe - 1, u = t - 1;
         s >= o &&
         u >= o &&
-        (this.Ge[s] === e[u] || (this.Ye && compare(this.Ke, this.Ge[s], e[u])));
+        (this.$e[s] === e[u] || (this.Be && compare(this.Ye, this.$e[s], e[u])));
         s--, u--
       ) {
-        E[u] = this.He[s];
-        T[u] = this.je[s];
-        d && (d[u] = this.Ye[s]);
-        R && (R[u] = this.Be[s]);
+        E[u] = this.je[s];
+        T[u] = this.Ke[s];
+        d && (d[u] = this.Be[s]);
+        R && (R[u] = this.Xe[s]);
       }
       a = new Map();
       f = new Array(u + 1);
       for (i = u; i >= o; i--) {
         c = e[i];
-        l = this.Ke ? this.Ke(c) : c;
+        l = this.Ye ? this.Ye(c) : c;
         n = a.get(l);
         f[i] = n === undefined ? -1 : n;
         a.set(l, i);
       }
       for (n = o; n <= s; n++) {
-        c = this.Ge[n];
-        l = this.Ke ? this.Ke(c) : c;
+        c = this.$e[n];
+        l = this.Ye ? this.Ye(c) : c;
         i = a.get(l);
         if (i !== undefined && i !== -1) {
-          E[i] = this.He[n];
-          T[i] = this.je[n];
-          d && (d[i] = this.Ye[n]);
-          R && (R[i] = this.Be[n]);
+          E[i] = this.je[n];
+          T[i] = this.Ke[n];
+          d && (d[i] = this.Be[n]);
+          R && (R[i] = this.Xe[n]);
           i = f[i];
           a.set(l, i);
-        } else this.je[n].dispose();
+        } else this.Ke[n].dispose();
       }
       for (i = o; i < t; i++) {
         if (i in E) {
-          this.He[i] = E[i];
-          this.je[i] = T[i];
+          this.je[i] = E[i];
+          this.Ke[i] = T[i];
           if (d) {
-            this.Ye[i] = d[i];
-            setSignal(this.Ye[i], e[i]);
+            this.Be[i] = d[i];
+            setSignal(this.Be[i], e[i]);
           }
           if (R) {
-            this.Be[i] = R[i];
-            setSignal(this.Be[i], i);
+            this.Xe[i] = R[i];
+            setSignal(this.Xe[i], i);
           }
         } else {
-          this.He[i] = runWithOwner((this.je[i] = createOwner()), r);
+          this.je[i] = runWithOwner((this.Ke[i] = createOwner()), r);
         }
       }
-      this.He = this.He.slice(0, (this.Me = t));
-      this.Ge = e.slice(0);
+      this.je = this.je.slice(0, (this.Fe = t));
+      this.$e = e.slice(0);
     }
   });
-  return this.He;
+  return this.je;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    xe: createOwner(),
-    Me: 0,
-    qe: 0,
-    ze: e,
-    $e: t,
+    Me: createOwner(),
+    Fe: 0,
+    ze: 0,
+    Ze: e,
+    He: t,
+    Ke: [],
     je: [],
-    He: [],
-    Ze: n?.from,
-    Xe: n?.fallback
+    Je: n?.from,
+    qe: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.ze();
-  const t = this.Ze?.() || 0;
-  runWithOwner(this.xe, () => {
+  const e = this.Ze();
+  const t = this.Je?.() || 0;
+  runWithOwner(this.Me, () => {
     if (e === 0) {
-      if (this.Me !== 0) {
-        this.xe.dispose(false);
+      if (this.Fe !== 0) {
+        this.Me.dispose(false);
+        this.Ke = [];
         this.je = [];
-        this.He = [];
-        this.Me = 0;
+        this.Fe = 0;
       }
-      if (this.Xe && !this.He[0]) {
-        this.He[0] = runWithOwner((this.je[0] = createOwner()), this.Xe);
+      if (this.qe && !this.je[0]) {
+        this.je[0] = runWithOwner((this.Ke[0] = createOwner()), this.qe);
       }
       return;
     }
     const n = t + e;
-    const i = this.qe + this.Me;
-    if (this.Me === 0 && this.je[0]) this.je[0].dispose();
-    for (let e = n; e < i; e++) this.je[e - this.qe].dispose();
-    if (this.qe < t) {
-      let e = this.qe;
-      while (e < t && e < this.Me) this.je[e++].dispose();
-      this.je.splice(0, t - this.qe);
-      this.He.splice(0, t - this.qe);
-    } else if (this.qe > t) {
-      let n = i - this.qe - 1;
-      let r = this.qe - t;
-      this.je.length = this.He.length = e;
+    const i = this.ze + this.Fe;
+    if (this.Fe === 0 && this.Ke[0]) this.Ke[0].dispose();
+    for (let e = n; e < i; e++) this.Ke[e - this.ze].dispose();
+    if (this.ze < t) {
+      let e = this.ze;
+      while (e < t && e < this.Fe) this.Ke[e++].dispose();
+      this.Ke.splice(0, t - this.ze);
+      this.je.splice(0, t - this.ze);
+    } else if (this.ze > t) {
+      let n = i - this.ze - 1;
+      let r = this.ze - t;
+      this.Ke.length = this.je.length = e;
       while (n >= r) {
+        this.Ke[n] = this.Ke[n - r];
         this.je[n] = this.je[n - r];
-        this.He[n] = this.He[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.He[e] = runWithOwner((this.je[e] = createOwner()), () => this.$e(e + t));
+        this.je[e] = runWithOwner((this.Ke[e] = createOwner()), () => this.He(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.He[e - t] = runWithOwner((this.je[e - t] = createOwner()), () => this.$e(e));
+      this.je[e - t] = runWithOwner((this.Ke[e - t] = createOwner()), () => this.He(e));
     }
-    this.He = this.He.slice(0, e);
-    this.qe = t;
-    this.Me = e;
+    this.je = this.je.slice(0, e);
+    this.ze = t;
+    this.Fe = e;
   });
-  return this.He;
+  return this.je;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
@@ -2556,11 +2568,11 @@ function boundaryComputed(e, t) {
   n.pe = (e, t) => {
     const i = e !== undefined ? e : n.ae;
     const r = t !== undefined ? t : n.q;
-    n.ae &= ~n.Je;
-    n.se.notify(n, n.Je, i, r);
+    n.ae &= ~n.et;
+    n.se.notify(n, n.et, i, r);
   };
-  n.Je = t;
-  n.Ue = true;
+  n.et = t;
+  n.Ce = true;
   recompute(n, true);
   return n;
 }
@@ -2574,36 +2586,36 @@ function createBoundChildren(e, t, n, i) {
   });
 }
 class CollectionQueue extends Queue {
-  et;
-  tt = new Set();
-  nt = signal(false, { pureWrite: true });
-  it = false;
+  tt;
+  nt = new Set();
+  it = signal(false, { pureWrite: true });
+  rt = false;
   constructor(e) {
     super();
-    this.et = e;
+    this.tt = e;
   }
   run(e) {
-    if (!e || read(this.nt)) return;
+    if (!e || read(this.it)) return;
     return super.run(e);
   }
   notify(e, t, n, i) {
-    if (!(t & this.et) || (this.et & STATUS_PENDING && this.it)) return super.notify(e, t, n, i);
-    if (n & this.et) {
+    if (!(t & this.tt) || (this.tt & STATUS_PENDING && this.rt)) return super.notify(e, t, n, i);
+    if (n & this.tt) {
       const t = i?.source || e.q?.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.it, true);
       }
     }
-    t &= ~this.et;
+    t &= ~this.tt;
     return t ? super.notify(e, t, n, i) : true;
   }
   checkSources() {
-    for (const e of this.tt) {
-      if (!(e.ae & this.et)) this.tt.delete(e);
+    for (const e of this.nt) {
+      if (!(e.ae & this.tt)) this.nt.delete(e);
     }
-    if (!this.tt.size) setSignal(this.nt, false);
+    if (!this.nt.size) setSignal(this.it, false);
   }
 }
 function createCollectionBoundary(e, t, n) {
@@ -2611,10 +2623,10 @@ function createCollectionBoundary(e, t, n) {
   const r = new CollectionQueue(e);
   const o = createBoundChildren(i, t, r, e);
   const s = computed(() => {
-    if (!read(r.nt)) {
+    if (!read(r.it)) {
       const e = read(o);
-      if (!untrack(() => read(r.nt))) {
-        r.it = true;
+      if (!untrack(() => read(r.it))) {
+        r.rt = true;
         return e;
       }
     }
@@ -2627,10 +2639,10 @@ function createLoadBoundary(e, t) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(STATUS_ERROR, e, e => {
-    let n = e.tt.values().next().value;
+    let n = e.nt.values().next().value;
     const i = n.q?.cause ?? n.q;
     return t(i, () => {
-      for (const t of e.tt) recompute(t);
+      for (const t of e.nt) recompute(t);
       schedule();
     });
   });
@@ -2724,6 +2736,7 @@ export {
   omit,
   onCleanup,
   onSettled,
+  peekNextChildId,
   pending,
   reconcile,
   refresh,