@solidjs/signals 0.10.3 → 0.10.5

package/dist/node.cjs

@@ -101,12 +101,12 @@ function markNode(e, r = n) {
   if ((i & (t | n)) >= r) return;
   e.m = (i & -4) | r;
   for (let n = e.O; n !== null; n = n.P) {
-    markNode(n.A, t);
+    markNode(n.k, t);
   }
-  if (e.k !== null) {
-    for (let n = e.k; n !== null; n = n.C) {
+  if (e.C !== null) {
+    for (let n = e.C; n !== null; n = n.A) {
       for (let e = n.O; e !== null; e = e.P) {
-        markNode(e.A, t);
+        markNode(e.k, t);
       }
     }
   }
@@ -134,7 +134,7 @@ function adjustHeight(e, t) {
   if (e.o !== n) {
     e.o = n;
     for (let n = e.O; n !== null; n = n.P) {
-      insertIntoHeapHeight(n.A, t);
+      insertIntoHeapHeight(n.k, t);
     }
   }
 }
@@ -146,7 +146,7 @@ let x = null;
 let v = false;
 let P = false;
 function runLaneEffects(e) {
-  for (const t of C) {
+  for (const t of A) {
     if (t.R || t.T.size > 0) continue;
     const n = t.M[e - 1];
     if (n.length) {
@@ -161,7 +161,7 @@ function setProjectionWriteActive(e) {
 function schedule() {
   if (v) return;
   v = true;
-  if (!A.q) queueMicrotask(flush);
+  if (!k.q) queueMicrotask(flush);
 }
 class Queue {
   i = null;
@@ -310,7 +310,7 @@ class GlobalQueue extends Queue {
       const t = x;
       t.te = e;
       e.ee.push(...t.ee);
-      for (const n of C) {
+      for (const n of A) {
         if (n.ne === t) n.ne = e;
       }
       e.B.push(...t.B);
@@ -334,7 +334,7 @@ class GlobalQueue extends Queue {
       x.B.push(t);
     }
     this.B = x.B;
-    for (const e of C) {
+    for (const e of A) {
       if (!e.ne) e.ne = x;
     }
     for (const e of this.G) x.G.add(e);
@@ -345,13 +345,13 @@ function insertSubs(e, t = false) {
   const n = e.re || R;
   for (let r = e.O; r !== null; r = r.P) {
     if (t && n) {
-      r.A.m |= f;
-      assignOrMergeLane(r.A, n);
+      r.k.m |= f;
+      assignOrMergeLane(r.k, n);
     } else if (t) {
-      r.A.m |= f;
-      r.A.re = undefined;
+      r.k.m |= f;
+      r.k.re = undefined;
     }
-    const e = r.A;
+    const e = r.k;
     if (e.ie === h) {
       if (!e.se) {
         e.se = true;
@@ -359,17 +359,17 @@ function insertSubs(e, t = false) {
       }
       continue;
     }
-    const i = r.A.m & o ? b : _;
-    if (i.W > r.A.o) i.W = r.A.o;
-    insertIntoHeap(r.A, i);
+    const i = r.k.m & o ? b : _;
+    if (i.W > r.k.o) i.W = r.k.o;
+    insertIntoHeap(r.k, i);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
-  if (!t) checkBoundaryChildren(A);
+  if (!t) checkBoundaryChildren(k);
   if (_.S >= _.W) runHeap(_, GlobalQueue.K);
   if (n) {
-    const t = A.D;
+    const t = k.D;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
       if (n.fe !== y) {
@@ -381,7 +381,7 @@ function finalizePureQueue(e = null, t = false) {
       if (n.H) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.B : A.B;
+    const n = e ? e.B : k.B;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
       const r = t.fe;
@@ -394,7 +394,7 @@ function finalizePureQueue(e = null, t = false) {
       t.ne = null;
     }
     n.length = 0;
-    const r = e ? e.G : A.G;
+    const r = e ? e.G : k.G;
     if (GlobalQueue.J && r.size) {
       for (const e of r) {
         GlobalQueue.J(e);
@@ -402,7 +402,7 @@ function finalizePureQueue(e = null, t = false) {
       r.clear();
       schedule();
     }
-    for (const t of C) {
+    for (const t of A) {
       const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
       if (!t.R) {
@@ -413,8 +413,8 @@ function finalizePureQueue(e = null, t = false) {
       t.T.clear();
       t.M[0].length = 0;
       t.M[1].length = 0;
-      C.delete(t);
-      k.delete(t.ae);
+      A.delete(t);
+      C.delete(t.ae);
     }
   }
 }
@@ -425,7 +425,7 @@ function checkBoundaryChildren(e) {
   }
 }
 function trackOptimisticStore(e) {
-  A.G.add(e);
+  k.G.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
@@ -433,10 +433,10 @@ function reassignPendingTransition(e) {
     e[t].ne = x;
   }
 }
-const A = new GlobalQueue();
+const k = new GlobalQueue();
 function flush() {
   while (v) {
-    A.flush();
+    k.flush();
   }
 }
 function runQueue(e, t) {
@@ -472,18 +472,18 @@ function runInTransition(e, t) {
     x = n;
   }
 }
-const k = new WeakMap();
-const C = new Set();
+const C = new WeakMap();
+const A = new Set();
 function getOrCreateLane(e) {
-  let t = k.get(e);
+  let t = C.get(e);
   if (t) {
     return findLane(t);
   }
   const n = e.de;
   const r = n?.re ? findLane(n.re) : null;
   t = { ae: e, T: new Set(), M: [[], []], R: null, ne: x, pe: r };
-  k.set(e, t);
-  C.add(t);
+  C.set(e, t);
+  A.add(t);
   e.he = e.ye || 0;
   return t;
 }
@@ -505,7 +505,7 @@ function resolveLane(e) {
   const t = e.re;
   if (!t) return undefined;
   const n = findLane(t);
-  if (C.has(n)) return n;
+  if (A.has(n)) return n;
   e.re = undefined;
   return undefined;
 }
@@ -521,7 +521,7 @@ function assignOrMergeLane(e, t) {
       return;
     }
     const i = findLane(r);
-    if (C.has(i)) {
+    if (A.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
         if (n.pe && findLane(n.pe) === i) {
           e.re = t;
@@ -545,14 +545,14 @@ function handleAsync(e, t, r) {
   let u;
   const handleError = n => {
     if (e.we !== t) return;
-    A.initTransition(e.ne);
+    k.initTransition(e.ne);
     notifyStatus(e, n instanceof NotReadyError ? l : c, n);
     e.$ = O;
   };
   const asyncWrite = (i, s) => {
     if (e.we !== t) return;
     if (e.m & (n | f)) return;
-    A.initTransition(e.ne);
+    k.initTransition(e.ne);
     clearStatus(e);
     const o = resolveLane(e);
     if (o) o.T.delete(e);
@@ -599,7 +599,7 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      A.initTransition(e.ne);
+      k.initTransition(e.ne);
       throw new NotReadyError(Q);
     }
   }
@@ -631,7 +631,7 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      A.initTransition(e.ne);
+      k.initTransition(e.ne);
       throw new NotReadyError(Q);
     }
   }
@@ -674,105 +674,83 @@ function notifyStatus(e, t, n, r, i) {
     return;
   }
   for (let r = e.O; r !== null; r = r.P) {
-    r.A.$ = O;
-    if (r.A.Y !== n) {
-      !r.A.ne && A.D.push(r.A);
-      notifyStatus(r.A, t, n, f, d);
+    r.k.$ = O;
+    if (r.k.Y !== n) {
+      !r.k.ne && k.D.push(r.k);
+      notifyStatus(r.k, t, n, f, d);
     }
   }
-  for (let r = e.k; r !== null; r = r.C) {
+  for (let r = e.C; r !== null; r = r.A) {
     for (let e = r.O; e !== null; e = e.P) {
-      e.A.$ = O;
-      if (e.A.Y !== n) {
-        !e.A.ne && A.D.push(e.A);
-        notifyStatus(e.A, t, n, f, d);
+      e.k.$ = O;
+      if (e.k.Y !== n) {
+        !e.k.ne && k.D.push(e.k);
+        notifyStatus(e.k, t, n, f, d);
       }
     }
   }
 }
-function effect(e, t, n, r, i) {
-  let s = false;
-  const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
-    ...i,
-    equals: () => {
-      o.se = !o.Y;
-      if (s) o.oe.enqueue(o.ie, runEffect.bind(o));
-      return false;
-    },
-    lazy: true
-  });
-  o.be = r;
-  o.Oe = t;
-  o.xe = n;
-  o.ve = undefined;
-  o.ie = i?.render ? d : p;
-  o._e = (e, t) => {
-    const n = e !== undefined ? e : o.ce;
-    const r = t !== undefined ? t : o.Y;
-    if (n & c) {
-      let e = r;
-      o.oe.notify(o, l, 0);
-      if (o.ie === p) {
-        try {
-          return o.xe
-            ? o.xe(e, () => {
-                o.ve?.();
-                o.ve = undefined;
-              })
-            : console.error(e);
-        } catch (t) {
-          e = t;
-        }
-      }
-      if (!o.oe.notify(o, c, c)) throw e;
-    } else if (o.ie === d) o.oe.notify(o, l | c, n, r);
-  };
-  recompute(o, true);
-  !i?.defer && (o.ie === p ? o.oe.enqueue(o.ie, runEffect.bind(o)) : runEffect.call(o));
-  s = true;
-  onCleanup(() => o.ve?.());
+function unlinkSubs(e) {
+  const t = e.L;
+  const n = e.N;
+  const r = e.P;
+  const i = e.be;
+  if (r !== null) r.be = i;
+  else t.Oe = i;
+  if (i !== null) i.P = r;
+  else {
+    t.O = r;
+    if (r === null) {
+      t.xe?.();
+      t.H && !t.ve && !(t.m & o) && unobserved(t);
+    }
+  }
+  return n;
 }
-function runEffect() {
-  if (!this.se || this.m & u) return;
-  this.ve?.();
-  this.ve = undefined;
-  try {
-    this.ve = this.Oe(this.le, this.be);
-  } catch (e) {
-    if (!this.oe.notify(this, c, c)) throw e;
-  } finally {
-    this.be = this.le;
-    this.se = false;
+function unobserved(e) {
+  deleteFromHeap(e, e.m & o ? b : _);
+  let t = e.j;
+  while (t !== null) {
+    t = unlinkSubs(t);
+  }
+  e.j = null;
+  disposeChildren(e, true);
+}
+function link(e, t) {
+  const n = t.Pe;
+  if (n !== null && n.L === e) return;
+  let i = null;
+  const s = t.m & r;
+  if (s) {
+    i = n !== null ? n.N : t.j;
+    if (i !== null && i.L === e) {
+      t.Pe = i;
+      return;
+    }
   }
+  const o = e.Oe;
+  if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
+  const u = (t.Pe = e.Oe = { L: e, k: t, N: i, be: o, P: null });
+  if (n !== null) n.N = u;
+  else t.j = u;
+  if (o !== null) o.P = u;
+  else e.O = u;
 }
-function trackedEffect(e, t) {
-  const run = () => {
-    if (!n.se || n.m & u) return;
-    n.se = false;
-    recompute(n);
-  };
-  const n = computed(
-    () => {
-      try {
-        n.ve?.();
-        n.ve = undefined;
-        n.ve = staleValues(e) || undefined;
-      } finally {
-      }
-    },
-    undefined,
-    { ...t, lazy: true, pureWrite: true }
-  );
-  n.ve = undefined;
-  n.se = true;
-  n.ie = h;
-  n.ue = run;
-  n.oe.enqueue(p, run);
-  onCleanup(() => n.ve?.());
+function isValidLink(e, t) {
+  const n = t.Pe;
+  if (n !== null) {
+    let r = t.j;
+    do {
+      if (r === e) return true;
+      if (r === n) break;
+      r = r.N;
+    } while (r !== null);
+  }
+  return false;
 }
 const W = {};
 function markDisposal(e) {
-  let t = e.Pe;
+  let t = e.ke;
   while (t) {
     t.m |= o;
     if (t.m & i) {
@@ -780,7 +758,7 @@ function markDisposal(e) {
       insertIntoHeap(t, b);
     }
     markDisposal(t);
-    t = t.Ae;
+    t = t.Ce;
   }
 }
 function dispose(e) {
@@ -789,15 +767,15 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.j = null;
-  e.ke = null;
+  e.Pe = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
-  let r = n ? e.Ce : e.Pe;
+  let r = n ? e.Ae : e.ke;
   while (r) {
-    const e = r.Ae;
+    const e = r.Ce;
     if (r.j) {
       const e = r;
       deleteFromHeap(e, e.m & o ? b : _);
@@ -806,16 +784,16 @@ function disposeChildren(e, t = false, n) {
         t = unlinkSubs(t);
       } while (t !== null);
       e.j = null;
-      e.ke = null;
+      e.Pe = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.Ce = null;
-  } else {
-    e.Pe = null;
     e.Ae = null;
+  } else {
+    e.ke = null;
+    e.Ce = null;
     e.We = 0;
   }
   runDisposal(e, n);
@@ -833,12 +811,18 @@ function runDisposal(e, t) {
   }
   t ? (e.Ee = null) : (e.je = null);
 }
-function getNextChildId(e) {
-  let t = e;
-  while (t.Ne && t.i) t = t.i;
-  if (t.id != null) return formatId(t.id, t.We++);
+function childId(e, t) {
+  let n = e;
+  while (n.Ne && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.We++ : n.We);
   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),
     r = n.length - 1;
@@ -866,26 +850,26 @@ function createOwner(e) {
     Ne: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    Pe: null,
-    Ae: null,
+    ke: null,
+    Ce: null,
     je: null,
-    oe: t?.oe ?? A,
+    oe: t?.oe ?? k,
     Le: t?.Le || w,
     We: 0,
     Ee: null,
-    Ce: null,
+    Ae: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
     }
   };
   if (t) {
-    const e = t.Pe;
+    const e = t.ke;
     if (e === null) {
-      t.Pe = r;
+      t.ke = r;
     } else {
-      r.Ae = e;
-      t.Pe = r;
+      r.Ce = e;
+      t.ke = r;
     }
   }
   return r;
@@ -894,63 +878,85 @@ function createRoot(e, t) {
   const n = createOwner(t);
   return runWithOwner(n, () => e(n.dispose));
 }
-function unlinkSubs(e) {
-  const t = e.L;
-  const n = e.N;
-  const r = e.P;
-  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.Qe?.();
-      t.H && !t.Re && unobserved(t);
-    }
-  }
-  return n;
-}
-function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? b : _);
-  let t = e.j;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.j = null;
-  disposeChildren(e, true);
+function effect(e, t, n, r, i) {
+  let s = false;
+  const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
+    ...i,
+    equals: () => {
+      o.se = !o.Y;
+      if (s) o.oe.enqueue(o.ie, runEffect.bind(o));
+      return false;
+    },
+    lazy: true
+  });
+  o.Ie = r;
+  o.He = t;
+  o.Qe = n;
+  o.Re = undefined;
+  o.ie = i?.render ? d : p;
+  o._e = (e, t) => {
+    const n = e !== undefined ? e : o.ce;
+    const r = t !== undefined ? t : o.Y;
+    if (n & c) {
+      let e = r;
+      o.oe.notify(o, l, 0);
+      if (o.ie === p) {
+        try {
+          return o.Qe
+            ? o.Qe(e, () => {
+                o.Re?.();
+                o.Re = undefined;
+              })
+            : console.error(e);
+        } catch (t) {
+          e = t;
+        }
+      }
+      if (!o.oe.notify(o, c, c)) throw e;
+    } else if (o.ie === d) o.oe.notify(o, l | c, n, r);
+  };
+  recompute(o, true);
+  !i?.defer && (o.ie === p ? o.oe.enqueue(o.ie, runEffect.bind(o)) : runEffect.call(o));
+  s = true;
+  onCleanup(() => o.Re?.());
 }
-function link(e, t) {
-  const n = t.ke;
-  if (n !== null && n.L === e) return;
-  let i = null;
-  const s = t.m & r;
-  if (s) {
-    i = n !== null ? n.N : t.j;
-    if (i !== null && i.L === e) {
-      t.ke = i;
-      return;
-    }
+function runEffect() {
+  if (!this.se || this.m & u) return;
+  this.Re?.();
+  this.Re = undefined;
+  try {
+    this.Re = this.He(this.le, this.Ie);
+  } catch (e) {
+    if (!this.oe.notify(this, c, c)) throw e;
+  } finally {
+    this.Ie = this.le;
+    this.se = false;
   }
-  const o = e.He;
-  if (o !== null && o.A === t && (!s || isValidLink(o, t))) return;
-  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;
-  else e.O = u;
 }
-function isValidLink(e, t) {
-  const n = t.ke;
-  if (n !== null) {
-    let r = t.j;
-    do {
-      if (r === e) return true;
-      if (r === n) break;
-      r = r.N;
-    } while (r !== null);
-  }
-  return false;
+function trackedEffect(e, t) {
+  const run = () => {
+    if (!n.se || n.m & u) return;
+    n.se = false;
+    recompute(n);
+  };
+  const n = computed(
+    () => {
+      try {
+        n.Re?.();
+        n.Re = undefined;
+        n.Re = staleValues(e) || undefined;
+      } finally {
+      }
+    },
+    undefined,
+    { ...t, lazy: true, pureWrite: true }
+  );
+  n.Re = undefined;
+  n.se = true;
+  n.ie = h;
+  n.ue = run;
+  n.oe.enqueue(p, run);
+  onCleanup(() => n.Re?.());
 }
 GlobalQueue.K = recompute;
 GlobalQueue.U = disposeChildren;
@@ -965,15 +971,15 @@ let R = null;
 function recompute(t, n = false) {
   const i = t.ie;
   if (!n) {
-    if (t.ne && (!i || x) && x !== t.ne) A.initTransition(t.ne);
+    if (t.ne && (!i || x) && x !== t.ne) k.initTransition(t.ne);
     deleteFromHeap(t, t.m & o ? b : _);
     if (t.ne || i === h) disposeChildren(t);
     else {
       markDisposal(t);
       t.Ee = t.je;
-      t.Ce = t.Pe;
+      t.Ae = t.ke;
       t.je = null;
-      t.Pe = null;
+      t.ke = null;
       t.We = 0;
     }
   }
@@ -982,7 +988,7 @@ function recompute(t, n = false) {
   const a = !!(t.ce & l);
   const d = Q;
   Q = t;
-  t.ke = null;
+  t.Pe = null;
   t.m = r;
   t.$ = O;
   let p = t.fe === y ? t.le : t.fe;
@@ -1024,7 +1030,7 @@ function recompute(t, n = false) {
     Q = d;
   }
   if (!t.Y) {
-    const e = t.ke;
+    const e = t.Pe;
     let r = e !== null ? e.N : t.j;
     if (r !== null) {
       do {
@@ -1051,12 +1057,12 @@ 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.k, e.k.m & o ? b : _);
       }
     }
   }
   R = S;
-  (!n || t.ce & l) && !t.ne && !(x && t.ge) && A.D.push(t);
+  (!n || t.ce & l) && !t.ne && !(x && t.ge) && k.D.push(t);
   t.ne && i && x !== t.ne && runInTransition(t.ne, () => recompute(t));
 }
 function updateIfNecessary(r) {
@@ -1084,42 +1090,42 @@ function computed(t, n, r) {
     Ne: i || undefined,
     Se: r?.equals != null ? r.equals : isEqual,
     Te: !!r?.pureWrite,
-    Qe: r?.unobserved,
+    xe: r?.unobserved,
     je: null,
-    oe: Q?.oe ?? A,
+    oe: Q?.oe ?? k,
     Le: Q?.Le ?? w,
     We: 0,
     H: t,
     le: n,
     o: 0,
-    k: null,
+    C: null,
     h: undefined,
     p: null,
     j: null,
-    ke: null,
+    Pe: null,
     O: null,
-    He: null,
+    Oe: null,
     i: Q,
-    Ae: null,
-    Pe: null,
+    Ce: null,
+    ke: null,
     m: e,
     ce: a,
     $: O,
     fe: y,
     Ee: null,
-    Ce: null,
+    Ae: null,
     we: null,
     ne: null
   };
   s.p = s;
   const o = Q?.t ? Q.u : Q;
   if (Q) {
-    const e = Q.Pe;
+    const e = Q.ke;
     if (e === null) {
-      Q.Pe = s;
+      Q.ke = s;
     } else {
-      s.Ae = e;
-      Q.Pe = s;
+      s.Ce = e;
+      Q.ke = s;
     }
   }
   if (o) s.o = o.o + 1;
@@ -1130,16 +1136,16 @@ function signal(e, t, n = null) {
   const r = {
     Se: t?.equals != null ? t.equals : isEqual,
     Te: !!t?.pureWrite,
-    Qe: t?.unobserved,
+    xe: t?.unobserved,
     le: e,
     O: null,
-    He: null,
+    Oe: null,
     $: O,
     I: n,
-    C: n?.k || null,
+    A: n?.C || null,
     fe: y
   };
-  n && (n.k = r);
+  n && (n.C = r);
   return r;
 }
 function optimisticSignal(e, t) {
@@ -1235,7 +1241,7 @@ function read(e) {
   return !t || R !== null || e.fe === y || (j && e.ne && x !== e.ne) ? e.le : e.fe;
 }
 function setSignal(e, t) {
-  if (e.ne && x !== e.ne) A.initTransition(e.ne);
+  if (e.ne && x !== e.ne) k.initTransition(e.ne);
   const n = e.ge && !P;
   const r = n ? e.le : e.fe === y ? e.le : e.fe;
   if (typeof t === "function") t = t(r);
@@ -1248,22 +1254,22 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = A.B.includes(e);
+    const n = k.B.includes(e);
     if (e.ne && n) {
-      A.initTransition(e.ne);
+      k.initTransition(e.ne);
     }
     if (e.fe === y) {
       e.fe = e.le;
     }
     if (!n) {
-      A.B.push(e);
+      k.B.push(e);
     }
     e.ye = (e.ye || 0) + 1;
     const r = getOrCreateLane(e);
     e.re = r;
     e.le = t;
   } else {
-    if (e.fe === y) A.D.push(e);
+    if (e.fe === y) k.D.push(e);
     e.fe = t;
   }
   updatePendingSignal(e);
@@ -1323,7 +1329,7 @@ function updatePendingSignal(e) {
           mergeLanes(t, e);
         }
       }
-      k.delete(n);
+      C.delete(n);
       n.re = undefined;
     }
   }
@@ -1422,7 +1428,7 @@ function isUndefined(e) {
   return typeof e === "undefined";
 }
 function restoreTransition(e, t) {
-  A.initTransition(e);
+  k.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1431,7 +1437,7 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      A.initTransition();
+      k.initTransition();
       let s = x;
       s.ee.push(i);
       const done = (e, t) => {
@@ -1528,7 +1534,7 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   getOwner()
     ? createTrackedEffect(() => untrack(e))
-    : A.enqueue(p, () => {
+    : k.enqueue(p, () => {
         const t = e();
         t?.();
       });
@@ -1698,7 +1704,7 @@ function createProjectionInternal(e, t = {}, n) {
       i !== r && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
-  r.Re = true;
+  r.ve = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -1877,7 +1883,7 @@ const re = {
       if (e[$]) {
         const t = e[Z];
         if (t?.ne) {
-          A.initTransition(t.ne);
+          k.initTransition(t.ne);
         }
       }
       untrack(() => {
@@ -2126,7 +2132,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.Re = true;
+    r.ve = true;
   }
   return { store: s, node: r };
 }
@@ -2516,7 +2522,7 @@ function boundaryComputed(e, t) {
     n.oe.notify(n, n.et, r, i);
   };
   n.et = t;
-  n.Re = true;
+  n.ve = true;
   recompute(n, true);
   return n;
 }
@@ -2679,6 +2685,7 @@ exports.merge = merge;
 exports.omit = omit;
 exports.onCleanup = onCleanup;
 exports.onSettled = onSettled;
+exports.peekNextChildId = peekNextChildId;
 exports.pending = pending;
 exports.reconcile = reconcile;
 exports.refresh = refresh;