@solidjs/signals 0.9.9 → 0.9.11

package/dist/node.cjs

@@ -156,64 +156,69 @@ function getOrCreateLane(e) {
   if (t) {
     return findLane(t);
   }
-  t = { t: e, T: new Set(), M: [[], []], q: null, F: x };
+  const n = e.T;
+  const r = n?.M ? findLane(n.M) : null;
+  t = { t: e, q: new Set(), F: [[], []], V: null, B: x, D: r };
   C.set(e, t);
   k.add(t);
-  e.V = e.B || 0;
+  e.G = e.K || 0;
   return t;
 }
 function findLane(e) {
-  while (e.q) e = e.q;
+  while (e.V) e = e.V;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.q = e;
-  for (const n of t.T) e.T.add(n);
-  e.M[0].push(...t.M[0]);
-  e.M[1].push(...t.M[1]);
+  t.V = e;
+  for (const n of t.q) e.q.add(n);
+  e.F[0].push(...t.F[0]);
+  e.F[1].push(...t.F[1]);
   return e;
 }
 function clearLaneEntry(e) {
   C.delete(e);
 }
 function resolveLane(e) {
-  const t = e.D;
+  const t = e.M;
   if (!t) return undefined;
   const n = findLane(t);
   if (k.has(n)) return n;
-  e.D = undefined;
+  e.M = undefined;
   return undefined;
 }
 function hasActiveOverride(e) {
-  return !!(e.G && e.K !== y);
+  return !!(e.U && e.J !== y);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const r = e.D;
+  const r = e.M;
   if (r) {
-    if (r.q) {
-      e.D = t;
+    if (r.V) {
+      e.M = t;
       return;
     }
     const i = findLane(r);
     if (k.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
-        mergeLanes(n, i);
+        if (n.D && findLane(n.D) === i) {
+          e.M = t;
+        } else if (i.D && findLane(i.D) === n);
+        else mergeLanes(n, i);
       }
       return;
     }
   }
-  e.D = t;
+  e.M = t;
 }
 function runLaneEffects(e) {
   for (const t of k) {
-    if (t.q || t.T.size > 0) continue;
-    const n = t.M[e - 1];
+    if (t.V || t.q.size > 0) continue;
+    const n = t.F[e - 1];
     if (n.length) {
-      t.M[e - 1] = [];
+      t.F[e - 1] = [];
       runQueue(n, e);
     }
   }
@@ -224,21 +229,21 @@ function setProjectionWriteActive(e) {
 function schedule() {
   if (v) return;
   v = true;
-  if (!E.U) queueMicrotask(flush);
+  if (!E.X) queueMicrotask(flush);
 }
 class Queue {
   o = null;
-  J = [[], []];
-  X = [];
+  Y = [[], []];
+  Z = [];
   created = O;
   addChild(e) {
-    this.X.push(e);
+    this.Z.push(e);
     e.o = this;
   }
   removeChild(e) {
-    const t = this.X.indexOf(e);
+    const t = this.Z.indexOf(e);
     if (t >= 0) {
-      this.X.splice(t, 1);
+      this.Z.splice(t, 1);
       e.o = null;
     }
   }
@@ -247,88 +252,88 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.J[e - 1].length) {
-      const t = this.J[e - 1];
-      this.J[e - 1] = [];
+    if (this.Y[e - 1].length) {
+      const t = this.Y[e - 1];
+      this.Y[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.X.length; t++) this.X[t].run?.(e);
+    for (let t = 0; t < this.Z.length; t++) this.Z[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
       if (A) {
         const n = findLane(A);
-        n.M[e - 1].push(t);
+        n.F[e - 1].push(t);
       } else {
-        this.J[e - 1].push(t);
+        this.Y[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.J[0].push(...this.J[0]);
-    e.J[1].push(...this.J[1]);
-    this.J = [[], []];
-    for (let t = 0; t < this.X.length; t++) {
-      let n = this.X[t];
-      let r = e.X[t];
+    e.Y[0].push(...this.Y[0]);
+    e.Y[1].push(...this.Y[1]);
+    this.Y = [[], []];
+    for (let t = 0; t < this.Z.length; t++) {
+      let n = this.Z[t];
+      let r = e.Z[t];
       if (!r) {
-        r = { J: [[], []], X: [] };
-        e.X[t] = r;
+        r = { Y: [[], []], Z: [] };
+        e.Z[t] = r;
       }
       n.stashQueues(r);
     }
   }
   restoreQueues(e) {
-    this.J[0].push(...e.J[0]);
-    this.J[1].push(...e.J[1]);
-    for (let t = 0; t < e.X.length; t++) {
-      const n = e.X[t];
-      let r = this.X[t];
+    this.Y[0].push(...e.Y[0]);
+    this.Y[1].push(...e.Y[1]);
+    for (let t = 0; t < e.Z.length; t++) {
+      const n = e.Z[t];
+      let r = this.Z[t];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  U = false;
-  Y = [];
-  Z = [];
-  $ = new Set();
-  static ee;
-  static te;
-  static ne = null;
+  X = false;
+  $ = [];
+  ee = [];
+  te = new Set();
+  static ne;
+  static re;
+  static ie = null;
   flush() {
-    if (this.U) return;
-    this.U = true;
+    if (this.X) return;
+    this.X = true;
     try {
-      runHeap(_, GlobalQueue.ee);
+      runHeap(_, GlobalQueue.ne);
       if (x) {
         const e = transitionComplete(x);
         if (!e) {
           let e = x;
-          runHeap(b, GlobalQueue.ee);
-          this.Y = [];
-          this.Z = [];
-          this.$ = new Set();
+          runHeap(b, GlobalQueue.ne);
+          this.$ = [];
+          this.ee = [];
+          this.te = new Set();
           runLaneEffects(d);
           runLaneEffects(p);
-          this.stashQueues(x.re);
+          this.stashQueues(x.se);
           O++;
           v = _.m >= _.j;
-          reassignPendingTransition(x.Y);
+          reassignPendingTransition(x.$);
           x = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.Y !== x.Y && this.Y.push(...x.Y);
-        this.restoreQueues(x.re);
+        this.$ !== x.$ && this.$.push(...x.$);
+        this.restoreQueues(x.se);
         m.delete(x);
         const t = x;
         x = null;
-        reassignPendingTransition(this.Y);
+        reassignPendingTransition(this.$);
         finalizePureQueue(t);
       } else {
-        if (m.size) runHeap(b, GlobalQueue.ee);
+        if (m.size) runHeap(b, GlobalQueue.ne);
         finalizePureQueue();
       }
       O++;
@@ -338,15 +343,15 @@ class GlobalQueue extends Queue {
       runLaneEffects(p);
       this.run(p);
     } finally {
-      this.U = false;
+      this.X = false;
     }
   }
   notify(e, t, n, r) {
     if (t & l) {
       if (n & l) {
-        const t = r !== undefined ? r : e.ie;
-        if (x && t && !x.se.includes(t.t)) {
-          x.se.push(t.t);
+        const t = r !== undefined ? r : e.oe;
+        if (x && t && !x.ue.includes(t.t)) {
+          x.ue.push(t.t);
           schedule();
         }
       }
@@ -357,68 +362,68 @@ class GlobalQueue extends Queue {
   initTransition(e) {
     if (e) e = currentTransition(e);
     if (e && e === x) return;
-    if (!e && x && x.oe === O) return;
+    if (!e && x && x.fe === O) return;
     if (!x) {
       x = e ?? {
-        oe: O,
-        Y: [],
-        se: [],
-        Z: [],
-        $: new Set(),
+        fe: O,
+        $: [],
         ue: [],
-        re: { J: [[], []], X: [] },
-        fe: false
+        ee: [],
+        te: new Set(),
+        le: [],
+        se: { Y: [[], []], Z: [] },
+        ce: false
       };
     } else if (e) {
       const t = x;
-      t.fe = e;
-      e.ue.push(...t.ue);
+      t.ce = e;
+      e.le.push(...t.le);
       for (const n of k) {
-        if (n.F === t) n.F = e;
+        if (n.B === t) n.B = e;
       }
-      e.Z.push(...t.Z);
-      for (const n of t.$) {
-        e.$.add(n);
+      e.ee.push(...t.ee);
+      for (const n of t.te) {
+        e.te.add(n);
       }
       m.delete(t);
       x = e;
     }
     m.add(x);
-    x.oe = O;
-    for (let e = 0; e < this.Y.length; e++) {
-      const t = this.Y[e];
-      t.F = x;
-      x.Y.push(t);
-    }
-    this.Y = x.Y;
-    for (let e = 0; e < this.Z.length; e++) {
-      const t = this.Z[e];
-      t.F = x;
-      x.Z.push(t);
-    }
-    this.Z = x.Z;
-    for (const e of k) {
-      if (!e.F) e.F = x;
+    x.fe = O;
+    for (let e = 0; e < this.$.length; e++) {
+      const t = this.$[e];
+      t.B = x;
+      x.$.push(t);
     }
-    for (const e of this.$) x.$.add(e);
     this.$ = x.$;
+    for (let e = 0; e < this.ee.length; e++) {
+      const t = this.ee[e];
+      t.B = x;
+      x.ee.push(t);
+    }
+    this.ee = x.ee;
+    for (const e of k) {
+      if (!e.B) e.B = x;
+    }
+    for (const e of this.te) x.te.add(e);
+    this.te = x.te;
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.D || A;
+  const n = e.M || A;
   for (let r = e.P; r !== null; r = r.C) {
     if (t && n) {
       r.k._ |= f;
       assignOrMergeLane(r.k, n);
     } else if (t) {
       r.k._ |= f;
-      r.k.D = undefined;
+      r.k.M = undefined;
     }
     const e = r.k;
-    if (e.le === h) {
-      if (!e.ce) {
-        e.ce = true;
-        e.ae.enqueue(p, e.de);
+    if (e.ae === h) {
+      if (!e.de) {
+        e.de = true;
+        e.pe.enqueue(p, e.he);
       }
       continue;
     }
@@ -430,70 +435,70 @@ function insertSubs(e, t = false) {
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(E);
-  if (_.m >= _.j) runHeap(_, GlobalQueue.ee);
+  if (_.m >= _.j) runHeap(_, GlobalQueue.ne);
   if (n) {
-    const t = E.Y;
+    const t = E.$;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
-      if (n.K !== y) {
-        n.pe = n.K;
-        n.K = y;
-        if (n.le && n.le !== h) n.ce = true;
+      if (n.J !== y) {
+        n.ye = n.J;
+        n.J = y;
+        if (n.ae && n.ae !== h) n.de = true;
       }
-      n.he &= ~a;
-      if (n.R) GlobalQueue.te(n, false, true);
+      n.ge &= ~a;
+      if (n.R) GlobalQueue.re(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.Z : E.Z;
+    const n = e ? e.ee : E.ee;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
-      const r = t.K;
-      t.D = undefined;
-      if (r !== y && t.pe !== r) {
-        t.pe = r;
+      const r = t.J;
+      t.M = undefined;
+      if (r !== y && t.ye !== r) {
+        t.ye = r;
         insertSubs(t, true);
       }
-      t.K = y;
-      t.F = null;
+      t.J = y;
+      t.B = null;
     }
     n.length = 0;
-    const r = e ? e.$ : E.$;
-    if (GlobalQueue.ne && r.size) {
+    const r = e ? e.te : E.te;
+    if (GlobalQueue.ie && r.size) {
       for (const e of r) {
-        GlobalQueue.ne(e);
+        GlobalQueue.ie(e);
       }
       r.clear();
       schedule();
     }
     for (const t of k) {
-      const n = e ? t.F === e : !t.F;
+      const n = e ? t.B === e : !t.B;
       if (!n) continue;
-      if (!t.q) {
-        if (t.M[0].length) runQueue(t.M[0], d);
-        if (t.M[1].length) runQueue(t.M[1], p);
-      }
-      if (t.t.D === t) t.t.D = undefined;
-      t.T.clear();
-      t.M[0].length = 0;
-      t.M[1].length = 0;
+      if (!t.V) {
+        if (t.F[0].length) runQueue(t.F[0], d);
+        if (t.F[1].length) runQueue(t.F[1], p);
+      }
+      if (t.t.M === t) t.t.M = undefined;
+      t.q.clear();
+      t.F[0].length = 0;
+      t.F[1].length = 0;
       k.delete(t);
       C.delete(t.t);
     }
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.X) {
+  for (const t of e.Z) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  E.$.add(e);
+  E.te.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].F = x;
+    e[t].B = x;
   }
 }
 const E = new GlobalQueue();
@@ -506,20 +511,21 @@ function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function transitionComplete(e) {
-  if (e.fe) return true;
-  if (e.ue.length) return false;
+  if (e.ce) return true;
+  if (e.le.length) return false;
   let t = true;
-  for (let n = 0; n < e.se.length; n++) {
-    if (e.se[n].he & l) {
+  for (let n = 0; n < e.ue.length; n++) {
+    const r = e.ue[n];
+    if (r.ge & l && r.oe?.t === r) {
       t = false;
       break;
     }
   }
-  t && (e.fe = true);
+  t && (e.ce = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.fe && typeof e.fe === "object") e = e.fe;
+  while (e.ce && typeof e.ce === "object") e = e.ce;
   return e;
 }
 function runInTransition(e, t) {
@@ -543,11 +549,11 @@ function action(e) {
       const i = e(...t);
       E.initTransition();
       let s = x;
-      s.ue.push(i);
+      s.le.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.ue.indexOf(i);
-        if (o >= 0) s.ue.splice(o, 1);
+        const o = s.le.indexOf(i);
+        if (o >= 0) s.le.splice(o, 1);
         x = s;
         schedule();
         t ? r(t) : n(e);
@@ -575,8 +581,8 @@ function action(e) {
       step();
     });
 }
-GlobalQueue.ee = recompute;
-GlobalQueue.te = disposeChildren;
+GlobalQueue.ne = recompute;
+GlobalQueue.re = disposeChildren;
 let W = false;
 let j = false;
 let N = false;
@@ -585,28 +591,28 @@ let Q = false;
 let I = false;
 let H = null;
 function recompute(t, n = false) {
-  const i = t.le;
+  const i = t.ae;
   if (!n) {
-    if (t.F && (!i || x) && x !== t.F) E.initTransition(t.F);
+    if (t.B && (!i || x) && x !== t.B) E.initTransition(t.B);
     deleteFromHeap(t, t._ & o ? b : _);
-    if (t.F || i === h) disposeChildren(t);
+    if (t.B || i === h) disposeChildren(t);
     else {
       markDisposal(t);
-      t.ye = t.ge;
       t.we = t.Se;
-      t.ge = null;
+      t.me = t._e;
       t.Se = null;
+      t._e = null;
     }
   }
   const s = !!(t._ & f);
   const u = hasActiveOverride(t);
-  const a = !!(t.he & l);
+  const a = !!(t.ge & l);
   const d = H;
   H = t;
-  t.me = null;
+  t.be = null;
   t._ = r;
-  t.oe = O;
-  let p = t.K === y ? t.pe : t.K;
+  t.fe = O;
+  let p = t.J === y ? t.ye : t.J;
   let g = t.u;
   let w = W;
   let S = A;
@@ -619,13 +625,17 @@ function recompute(t, n = false) {
     p = handleAsync(t, t.R(p));
     clearStatus(t);
     const e = resolveLane(t);
-    if (e) e.T.delete(t);
+    if (e) {
+      e.q.delete(t);
+      updatePendingSignal(e.t);
+    }
   } catch (e) {
     if (e instanceof NotReadyError && A) {
       const e = findLane(A);
       if (e.t !== t) {
-        e.T.add(t);
-        t.D = e;
+        e.q.add(t);
+        t.M = e;
+        updatePendingSignal(e.t);
       }
     }
     notifyStatus(
@@ -633,15 +643,15 @@ function recompute(t, n = false) {
       e instanceof NotReadyError ? l : c,
       e,
       undefined,
-      e instanceof NotReadyError ? t.D : undefined
+      e instanceof NotReadyError ? t.M : undefined
     );
   } finally {
     W = w;
     t._ = e;
     H = d;
   }
-  if (!t.ie) {
-    const e = t.me;
+  if (!t.oe) {
+    const e = t.be;
     let r = e !== null ? e.L : t.N;
     if (r !== null) {
       do {
@@ -650,22 +660,22 @@ function recompute(t, n = false) {
       if (e !== null) e.L = null;
       else t.N = null;
     }
-    const f = u ? t.pe : t.K === y ? t.pe : t.K;
-    const l = !t._e || !t._e(f, p);
+    const f = u ? t.ye : t.J === y ? t.ye : t.J;
+    const l = !t.Oe || !t.Oe(f, p);
     if (l) {
-      const e = u ? t.pe : undefined;
-      if (n || (i && x !== t.F) || s) t.pe = p;
-      else t.K = p;
+      const e = u ? t.ye : undefined;
+      if (n || (i && x !== t.B) || s) t.ye = p;
+      else t.J = p;
       if (u && !s && a) {
-        const e = t.B || 0;
-        const n = t.V || 0;
-        if (e <= n) t.pe = p;
+        const e = t.K || 0;
+        const n = t.G || 0;
+        if (e <= n) t.ye = p;
       }
-      if (!u || s || t.pe !== e) {
+      if (!u || s || t.ye !== e) {
         insertSubs(t, s || u);
       }
     } else if (u) {
-      t.K = p;
+      t.J = p;
     } else if (t.u != g) {
       for (let e = t.P; e !== null; e = e.C) {
         insertIntoHeapHeight(e.k, e.k._ & o ? b : _);
@@ -673,49 +683,49 @@ function recompute(t, n = false) {
     }
   }
   setCurrentOptimisticLane(S);
-  (!n || t.he & l) && !t.F && !(x && t.G) && E.Y.push(t);
-  t.F && i && x !== t.F && runInTransition(t.F, () => recompute(t));
+  (!n || t.ge & l) && !t.B && !(x && t.U) && E.$.push(t);
+  t.B && i && x !== t.B && runInTransition(t.B, () => recompute(t));
 }
 function handleAsync(e, t, r) {
   const i = typeof t === "object" && t !== null;
   const s = i && untrack(() => t[Symbol.asyncIterator]);
   const o = !s && i && untrack(() => typeof t.then === "function");
   if (!o && !s) {
-    e.be = null;
+    e.xe = null;
     return t;
   }
-  e.be = t;
+  e.xe = t;
   let u;
   const handleError = n => {
-    if (e.be !== t) return;
-    E.initTransition(e.F);
+    if (e.xe !== t) return;
+    E.initTransition(e.B);
     notifyStatus(e, n instanceof NotReadyError ? l : c, n);
-    e.oe = O;
+    e.fe = O;
   };
   const asyncWrite = (i, s) => {
-    if (e.be !== t) return;
+    if (e.xe !== t) return;
     if (e._ & (n | f)) return;
-    E.initTransition(e.F);
+    E.initTransition(e.B);
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.T.delete(e);
+    if (o) o.q.delete(e);
     if (r) r(i);
-    else if (e.G) {
-      const t = e.K !== y;
-      if (e.R) e.K = i;
+    else if (e.U) {
+      const t = e.J !== y;
+      if (e.R) e.J = i;
       if (!t) {
-        e.pe = i;
+        e.ye = i;
         insertSubs(e);
       }
-      e.oe = O;
+      e.fe = O;
     } else if (o) {
-      const t = e.pe;
-      const n = e._e;
+      const t = e.ye;
+      const n = e.Oe;
       if (!n || !n(i, t)) {
-        e.pe = i;
-        e.oe = O;
-        if (e.Oe) {
-          setSignal(e.Oe, i);
+        e.ye = i;
+        e.fe = O;
+        if (e.ve) {
+          setSignal(e.ve, i);
         }
         insertSubs(e, true);
       }
@@ -742,7 +752,7 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      E.initTransition(e.F);
+      E.initTransition(e.B);
       throw new NotReadyError(H);
     }
   }
@@ -774,27 +784,27 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      E.initTransition(e.F);
+      E.initTransition(e.B);
       throw new NotReadyError(H);
     }
   }
   return u;
 }
 function clearStatus(e) {
-  e.he = e.he & a;
-  e.ie = null;
+  e.ge = e.ge & a;
+  e.oe = null;
   updatePendingSignal(e);
-  e.xe?.();
+  e.Pe?.();
 }
 function notifyStatus(e, t, n, r, i) {
   if (t === c && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const s = n instanceof NotReadyError && n.t === e;
-  const o = t === l && e.G && !s;
+  const o = t === l && e.U && !s;
   const u = o && hasActiveOverride(e);
   if (!r) {
-    e.he = t | (t !== c ? e.he & a : 0);
-    e.ie = n;
+    e.ge = t | (t !== c ? e.ge & a : 0);
+    e.oe = n;
     updatePendingSignal(e);
   }
   if (i && !r) {
@@ -802,32 +812,32 @@ function notifyStatus(e, t, n, r, i) {
   }
   if (u && x && n instanceof NotReadyError) {
     const e = n.t;
-    if (!x.se.includes(e)) {
-      x.se.push(e);
+    if (!x.ue.includes(e)) {
+      x.ue.push(e);
     }
   }
   const f = r || u;
   const d = r || o ? undefined : i;
-  if (e.xe) {
+  if (e.Pe) {
     if (f) {
-      e.xe(t, n);
+      e.Pe(t, n);
     } else {
-      e.xe();
+      e.Pe();
     }
     return;
   }
   for (let r = e.P; r !== null; r = r.C) {
-    r.k.oe = O;
-    if (r.k.ie !== n) {
-      !r.k.F && E.Y.push(r.k);
+    r.k.fe = O;
+    if (r.k.oe !== n) {
+      !r.k.B && E.$.push(r.k);
       notifyStatus(r.k, t, n, f, d);
     }
   }
   for (let r = e.A; r !== null; r = r.W) {
     for (let e = r.P; e !== null; e = e.C) {
-      e.k.oe = O;
-      if (e.k.ie !== n) {
-        !e.k.F && E.Y.push(e.k);
+      e.k.fe = O;
+      if (e.k.oe !== n) {
+        !e.k.B && E.$.push(e.k);
         notifyStatus(e.k, t, n, f, d);
       }
     }
@@ -846,7 +856,7 @@ function updateIfNecessary(r) {
       }
     }
   }
-  if (r._ & (n | f) || (r.ie && r.oe < O)) {
+  if (r._ & (n | f) || (r.oe && r.fe < O)) {
     recompute(r);
   }
   r._ = e;
@@ -855,15 +865,15 @@ function unlinkSubs(e) {
   const t = e.I;
   const n = e.L;
   const r = e.C;
-  const i = e.ve;
-  if (r !== null) r.ve = i;
-  else t.Pe = i;
+  const i = e.Ce;
+  if (r !== null) r.Ce = i;
+  else t.ke = i;
   if (i !== null) i.C = r;
   else {
     t.P = r;
     if (r === null) {
-      t.Ce?.();
-      t.R && !t.ke && unobserved(t);
+      t.Ae?.();
+      t.R && !t.Ee && unobserved(t);
     }
   }
   return n;
@@ -878,27 +888,27 @@ function unobserved(e) {
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.me;
+  const n = t.be;
   if (n !== null && n.I === e) return;
   let i = null;
   const s = t._ & r;
   if (s) {
     i = n !== null ? n.L : t.N;
     if (i !== null && i.I === e) {
-      t.me = i;
+      t.be = i;
       return;
     }
   }
-  const o = e.Pe;
+  const o = e.ke;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.me = e.Pe = { I: e, k: t, L: i, ve: o, C: null });
+  const u = (t.be = e.ke = { I: e, k: t, L: i, Ce: o, C: null });
   if (n !== null) n.L = u;
   else t.N = u;
   if (o !== null) o.C = u;
   else e.P = u;
 }
 function isValidLink(e, t) {
-  const n = t.me;
+  const n = t.be;
   if (n !== null) {
     let r = t.N;
     do {
@@ -910,7 +920,7 @@ function isValidLink(e, t) {
   return false;
 }
 function markDisposal(e) {
-  let t = e.Se;
+  let t = e._e;
   while (t) {
     t._ |= o;
     if (t._ & i) {
@@ -918,7 +928,7 @@ function markDisposal(e) {
       insertIntoHeap(t, b);
     }
     markDisposal(t);
-    t = t.Ae;
+    t = t.We;
   }
 }
 function dispose(e) {
@@ -927,15 +937,15 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.N = null;
-  e.me = null;
+  e.be = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e._ & u) return;
   if (t) e._ = u;
-  let r = n ? e.we : e.Se;
+  let r = n ? e.me : e._e;
   while (r) {
-    const e = r.Ae;
+    const e = r.We;
     if (r.N) {
       const e = r;
       deleteFromHeap(e, e._ & o ? b : _);
@@ -944,21 +954,21 @@ function disposeChildren(e, t = false, n) {
         t = unlinkSubs(t);
       } while (t !== null);
       e.N = null;
-      e.me = null;
+      e.be = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.we = null;
+    e.me = null;
   } else {
-    e.Se = null;
-    e.Ae = null;
+    e._e = null;
+    e.We = null;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.ye : e.ge;
+  let n = t ? e.we : e.Se;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -968,10 +978,10 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.ye = null) : (e.ge = null);
+  t ? (e.we = null) : (e.Se = null);
 }
 function getNextChildId(e) {
-  if (e.id != null) return formatId(e.id, e.Ee++);
+  if (e.id != null) return formatId(e.id, e.je++);
   throw new Error("Cannot get child id from owner without an id");
 }
 function formatId(e, t) {
@@ -982,44 +992,44 @@ function formatId(e, t) {
 function computed(t, n, r) {
   const i = {
     id: r?.id ?? (H?.id != null ? getNextChildId(H) : undefined),
-    _e: r?.equals != null ? r.equals : isEqual,
-    We: !!r?.pureWrite,
-    Ce: r?.unobserved,
-    ge: null,
-    ae: H?.ae ?? E,
-    je: H?.je ?? w,
-    Ee: 0,
+    Oe: r?.equals != null ? r.equals : isEqual,
+    Ne: !!r?.pureWrite,
+    Ae: r?.unobserved,
+    Se: null,
+    pe: H?.pe ?? E,
+    Le: H?.Le ?? w,
+    je: 0,
     R: t,
-    pe: n,
+    ye: n,
     u: 0,
     A: null,
     S: undefined,
     h: null,
     N: null,
-    me: null,
+    be: null,
     P: null,
-    Pe: null,
+    ke: null,
     o: H,
-    Ae: null,
-    Se: null,
+    We: null,
+    _e: null,
     _: e,
-    he: a,
-    oe: O,
-    K: y,
-    ye: null,
+    ge: a,
+    fe: O,
+    J: y,
     we: null,
-    be: null,
-    F: null
+    me: null,
+    xe: null,
+    B: null
   };
   i.h = i;
   const s = H?.i ? H.l : H;
   if (H) {
-    const e = H.Se;
+    const e = H._e;
     if (e === null) {
-      H.Se = i;
+      H._e = i;
     } else {
-      i.Ae = e;
-      H.Se = i;
+      i.We = e;
+      H._e = i;
     }
   }
   if (s) i.u = s.u + 1;
@@ -1028,69 +1038,84 @@ function computed(t, n, r) {
 }
 function signal(e, t, n = null) {
   const r = {
-    _e: t?.equals != null ? t.equals : isEqual,
-    We: !!t?.pureWrite,
-    Ce: t?.unobserved,
-    pe: e,
+    Oe: t?.equals != null ? t.equals : isEqual,
+    Ne: !!t?.pureWrite,
+    Ae: t?.unobserved,
+    ye: e,
     P: null,
-    Pe: null,
-    oe: O,
+    ke: null,
+    fe: O,
     H: n,
     W: n?.A || null,
-    K: y
+    J: y
   };
   n && (n.A = r);
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.G = true;
+  n.U = true;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const r = computed(e, t, n);
-  r.G = true;
+  r.U = true;
   return r;
 }
 function getPendingSignal(e) {
-  if (!e.Ne) {
-    e.Ne = optimisticSignal(false, { pureWrite: true });
-    if (computePendingState(e)) setSignal(e.Ne, true);
+  if (!e.Qe) {
+    e.Qe = optimisticSignal(false, { pureWrite: true });
+    if (e.T) {
+      e.Qe.T = e;
+    }
+    if (computePendingState(e)) setSignal(e.Qe, true);
   }
-  return e.Ne;
+  return e.Qe;
 }
 function computePendingState(e) {
   const t = e;
-  if (e.K !== y && !(t.he & a)) return true;
-  return !!(t.he & l && !(t.he & a));
+  if (e.U && e.J !== y) {
+    if (t.ge & l && !(t.ge & a)) return true;
+    if (e.T) {
+      const t = e.M ? findLane(e.M) : null;
+      return !!(t && t.q.size > 0);
+    }
+    return true;
+  }
+  if (e.J !== y && !(t.ge & a)) return true;
+  return !!(t.ge & l && !(t.ge & a));
 }
 function getPendingValueComputed(e) {
-  if (!e.Oe) {
+  if (!e.ve) {
     const t = I;
     I = false;
-    const n = H;
+    const n = L;
+    L = false;
+    const r = H;
     H = null;
-    e.Oe = optimisticComputed(() => read(e));
-    H = n;
+    e.ve = optimisticComputed(() => read(e));
+    e.ve.T = e;
+    H = r;
+    L = n;
     I = t;
   }
-  return e.Oe;
+  return e.ve;
 }
 function updatePendingSignal(e) {
-  if (e.Ne) {
+  if (e.Qe) {
     const t = computePendingState(e);
-    const n = e.Ne;
+    const n = e.Qe;
     setSignal(n, t);
-    if (!t && n.D) {
+    if (!t && n.M) {
       const t = resolveLane(e);
-      if (t && t.T.size > 0) {
-        const e = findLane(n.D);
+      if (t && t.q.size > 0) {
+        const e = findLane(n.M);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
       clearLaneEntry(n);
-      n.D = undefined;
+      n.M = undefined;
     }
   }
 }
@@ -1107,6 +1132,22 @@ function untrack(e) {
   }
 }
 function read(e) {
+  if (I) {
+    const t = getPendingValueComputed(e);
+    const n = I;
+    I = false;
+    const r = read(t);
+    I = n;
+    if (t.ge & l) return e.ye;
+    if (j && A && t.M) {
+      const n = findLane(t.M);
+      const r = findLane(A);
+      if (n !== r && n.q.size > 0) {
+        return e.ye;
+      }
+    }
+    return r;
+  }
   if (L) {
     const t = e.H || e;
     const n = getPendingSignal(t);
@@ -1116,16 +1157,7 @@ function read(e) {
       Q = true;
     }
     L = r;
-    return e.pe;
-  }
-  if (I) {
-    const t = getPendingValueComputed(e);
-    const n = I;
-    I = false;
-    const r = read(t);
-    I = n;
-    if (t.he & l) return e.pe;
-    return r;
+    return e.ye;
   }
   let t = H;
   if (t?.i) t = t.l;
@@ -1148,64 +1180,64 @@ function read(e) {
     }
   }
   const n = e.H || e;
-  if (t && n.he & l && !(j && n.F && x !== n.F)) {
+  if (t && n.ge & l && !(j && n.B && x !== n.B)) {
     if (A) {
-      const r = n.D;
+      const r = n.M;
       const i = findLane(A);
       if (r && findLane(r) === i && !hasActiveOverride(n)) {
         if (!W) link(e, t);
-        throw n.ie;
+        throw n.oe;
       }
     } else {
       if (!W) link(e, t);
-      throw n.ie;
+      throw n.oe;
     }
   }
-  if (e.R && e.he & c) {
-    if (e.oe < O) {
+  if (e.R && e.ge & c) {
+    if (e.fe < O) {
       recompute(e, true);
       return read(e);
-    } else throw e.ie;
+    } else throw e.oe;
   }
-  return !t || A !== null || e.K === y || (j && e.F && x !== e.F) ? e.pe : e.K;
+  return !t || A !== null || e.J === y || (j && e.B && x !== e.B) ? e.ye : e.J;
 }
 function setSignal(e, t) {
-  if (e.F && x !== e.F) E.initTransition(e.F);
-  const n = e.G && !P;
-  const r = n ? e.pe : e.K === y ? e.pe : e.K;
+  if (e.B && x !== e.B) E.initTransition(e.B);
+  const n = e.U && !P;
+  const r = n ? e.ye : e.J === y ? e.ye : e.J;
   if (typeof t === "function") t = t(r);
-  const i = !e._e || !e._e(r, t);
+  const i = !e.Oe || !e.Oe(r, t);
   if (!i) {
-    if (n && e.K !== y && e.R) {
+    if (n && e.J !== y && e.R) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = E.Z.includes(e);
-    if (e.F && n) {
-      E.initTransition(e.F);
+    const n = E.ee.includes(e);
+    if (e.B && n) {
+      E.initTransition(e.B);
     }
-    if (e.K === y) {
-      e.K = e.pe;
+    if (e.J === y) {
+      e.J = e.ye;
     }
     if (!n) {
-      E.Z.push(e);
+      E.ee.push(e);
     }
-    e.B = (e.B || 0) + 1;
+    e.K = (e.K || 0) + 1;
     const r = getOrCreateLane(e);
-    e.D = r;
-    e.pe = t;
+    e.M = r;
+    e.ye = t;
   } else {
-    if (e.K === y) E.Y.push(e);
-    e.K = t;
+    if (e.J === y) E.$.push(e);
+    e.J = t;
   }
   updatePendingSignal(e);
-  if (e.Oe) {
-    setSignal(e.Oe, t);
+  if (e.ve) {
+    setSignal(e.ve, t);
   }
-  e.oe = O;
+  e.fe = O;
   insertSubs(e, n);
   schedule();
   return t;
@@ -1220,9 +1252,9 @@ function getOwner() {
 }
 function onCleanup(e) {
   if (!H) return e;
-  if (!H.ge) H.ge = e;
-  else if (Array.isArray(H.ge)) H.ge.push(e);
-  else H.ge = [H.ge, e];
+  if (!H.Se) H.Se = e;
+  else if (Array.isArray(H.Se)) H.Se.push(e);
+  else H.Se = [H.Se, e];
   return e;
 }
 function createOwner(e) {
@@ -1231,26 +1263,26 @@ function createOwner(e) {
     id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
     i: true,
     l: t?.i ? t.l : t,
+    _e: null,
+    We: null,
     Se: null,
-    Ae: null,
-    ge: null,
-    ae: t?.ae ?? E,
-    je: t?.je || w,
-    Ee: 0,
-    ye: null,
+    pe: t?.pe ?? E,
+    Le: t?.Le || w,
+    je: 0,
     we: null,
+    me: null,
     o: t,
     dispose(e = true) {
       disposeChildren(n, e);
     }
   };
   if (t) {
-    const e = t.Se;
+    const e = t._e;
     if (e === null) {
-      t.Se = n;
+      t._e = n;
     } else {
-      n.Ae = e;
-      t.Se = n;
+      n.We = e;
+      t._e = n;
     }
   }
   return n;
@@ -1330,7 +1362,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.je[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1340,10 +1372,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.je = { ...n.je, [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?.je[e.id]);
+  return !isUndefined(t?.Le[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1353,80 +1385,80 @@ function effect(e, t, n, r, i) {
   const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
     ...i,
     equals: () => {
-      o.ce = !o.ie;
-      if (s) o.ae.enqueue(o.le, runEffect.bind(o));
+      o.de = !o.oe;
+      if (s) o.pe.enqueue(o.ae, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Le = r;
-  o.Qe = t;
-  o.Ie = n;
-  o.He = undefined;
-  o.le = i?.render ? d : p;
-  o.xe = (e, t) => {
-    const n = e !== undefined ? e : o.he;
-    const r = t !== undefined ? t : o.ie;
+  o.Ie = r;
+  o.He = t;
+  o.Re = n;
+  o.Te = undefined;
+  o.ae = i?.render ? d : p;
+  o.Pe = (e, t) => {
+    const n = e !== undefined ? e : o.ge;
+    const r = t !== undefined ? t : o.oe;
     if (n & c) {
       let e = r;
-      o.ae.notify(o, l, 0);
-      if (o.le === p) {
+      o.pe.notify(o, l, 0);
+      if (o.ae === p) {
         try {
-          return o.Ie
-            ? o.Ie(e, () => {
-                o.He?.();
-                o.He = undefined;
+          return o.Re
+            ? o.Re(e, () => {
+                o.Te?.();
+                o.Te = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!o.ae.notify(o, c, c)) throw e;
-    } else if (o.le === d) o.ae.notify(o, l | c, n, r);
+      if (!o.pe.notify(o, c, c)) throw e;
+    } else if (o.ae === d) o.pe.notify(o, l | c, n, r);
   };
   recompute(o, true);
-  !i?.defer && (o.le === p ? o.ae.enqueue(o.le, runEffect.bind(o)) : runEffect.call(o));
+  !i?.defer && (o.ae === p ? o.pe.enqueue(o.ae, runEffect.bind(o)) : runEffect.call(o));
   s = true;
-  onCleanup(() => o.He?.());
+  onCleanup(() => o.Te?.());
 }
 function runEffect() {
-  if (!this.ce || this._ & u) return;
-  this.He?.();
-  this.He = undefined;
+  if (!this.de || this._ & u) return;
+  this.Te?.();
+  this.Te = undefined;
   try {
-    this.He = this.Qe(this.pe, this.Le);
+    this.Te = this.He(this.ye, this.Ie);
   } catch (e) {
-    if (!this.ae.notify(this, c, c)) throw e;
+    if (!this.pe.notify(this, c, c)) throw e;
   } finally {
-    this.Le = this.pe;
-    this.ce = false;
+    this.Ie = this.ye;
+    this.de = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.ce || n._ & u) return;
-    n.ce = false;
+    if (!n.de || n._ & u) return;
+    n.de = false;
     recompute(n);
   };
   const n = computed(
     () => {
       try {
-        n.He?.();
-        n.He = undefined;
-        n.He = staleValues(e) || undefined;
+        n.Te?.();
+        n.Te = undefined;
+        n.Te = staleValues(e) || undefined;
       } finally {
       }
     },
     undefined,
     { ...t, lazy: true, pureWrite: true }
   );
-  n.He = undefined;
-  n.ce = true;
-  n.le = h;
-  n.de = run;
-  n.ae.enqueue(p, run);
-  onCleanup(() => n.He?.());
+  n.Te = undefined;
+  n.de = true;
+  n.ae = h;
+  n.he = run;
+  n.pe.enqueue(p, run);
+  onCleanup(() => n.Te?.());
 }
 function createSignal(e, t, n) {
   if (typeof e === "function") {
@@ -1603,7 +1635,7 @@ function applyState(e, t, n, r) {
       const d = unwrap(getOverrideValue(s, o, u, c));
       let p = unwrap(e[c]);
       if (d === p) continue;
-      if (!d || !isWrappable(d) || (n(d) != null && n(d) !== n(p))) {
+      if (!d || !isWrappable(d) || !isWrappable(p) || (n(d) != null && n(d) !== n(p))) {
         t && setSignal(t, void 0);
         a && setSignal(a, isWrappable(p) ? wrap(p, i) : p);
       } else applyState(p, wrap(d, i), n, r);
@@ -1658,7 +1690,7 @@ function createProjectionInternal(e, t = {}, n) {
       i !== r && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
-  r.ke = true;
+  r.Ee = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -1758,7 +1790,7 @@ function getNode(e, t, n, r, i = isEqual, s) {
     },
     r
   );
-  if (s) o.G = true;
+  if (s) o.U = true;
   return (e[t] = o);
 }
 function trackSelf(e, t = M) {
@@ -1804,7 +1836,7 @@ const re = {
       if (e && e.get) return e.get.call(n);
     }
     if (writeOnly(n)) {
-      let n = i && (o || !u) ? (i.K !== y ? (i.G ? i.pe : i.K) : i.pe) : f[t];
+      let n = i && (o || !u) ? (i.J !== y ? (i.U ? i.ye : i.J) : i.ye) : f[t];
       n === B && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
@@ -1836,8 +1868,8 @@ const re = {
     if (writeOnly(r)) {
       if (e[$]) {
         const t = e[Z];
-        if (t?.F) {
-          E.initTransition(t.F);
+        if (t?.B) {
+          E.initTransition(t.B);
         }
       }
       untrack(() => {
@@ -2011,7 +2043,7 @@ function deep(e) {
   return e[q];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.ne ||= clearOptimisticStore;
+  GlobalQueue.ie ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = (r ? t : e) ?? {};
   const s = r ? e : undefined;
@@ -2028,14 +2060,14 @@ function clearOptimisticStore(e) {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
-          r[e].D = undefined;
+          r[e].M = undefined;
           const n = t[K] && e in t[K] ? t[K][e] : t[G][e];
           const i = n === B ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
       if (r[M]) {
-        r[M].D = undefined;
+        r[M].M = undefined;
         setSignal(r[M], undefined);
       }
     }
@@ -2086,7 +2118,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.ke = true;
+    r.Ee = true;
   }
   return { store: s, node: r };
 }
@@ -2267,68 +2299,68 @@ function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      Re: createOwner(),
-      Te: 0,
-      Me: e,
-      qe: [],
-      Fe: t,
+      Me: createOwner(),
+      qe: 0,
+      Fe: e,
       Ve: [],
-      Be: [],
-      De: r,
-      Ge: r || n?.keyed === false ? [] : undefined,
-      Ke: t.length > 1 ? [] : undefined,
-      ze: n?.fallback
+      Be: t,
+      De: [],
+      Ge: [],
+      Ke: r,
+      ze: r || n?.keyed === false ? [] : undefined,
+      Ue: t.length > 1 ? [] : undefined,
+      Je: n?.fallback
     })
   );
 }
 const oe = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Me() || [],
+  const e = this.Fe() || [],
     t = e.length;
   e[M];
-  runWithOwner(this.Re, () => {
+  runWithOwner(this.Me, () => {
     let n,
       r,
-      i = this.Ge
+      i = this.ze
         ? () => {
-            this.Ge[r] = signal(e[r], oe);
-            this.Ke && (this.Ke[r] = signal(r, oe));
-            return this.Fe(
-              read.bind(null, this.Ge[r]),
-              this.Ke ? read.bind(null, this.Ke[r]) : undefined
+            this.ze[r] = signal(e[r], oe);
+            this.Ue && (this.Ue[r] = signal(r, oe));
+            return this.Be(
+              read.bind(null, this.ze[r]),
+              this.Ue ? read.bind(null, this.Ue[r]) : undefined
             );
           }
-        : this.Ke
+        : this.Ue
           ? () => {
               const t = e[r];
-              this.Ke[r] = signal(r, oe);
-              return this.Fe(() => t, read.bind(null, this.Ke[r]));
+              this.Ue[r] = signal(r, oe);
+              return this.Be(() => t, read.bind(null, this.Ue[r]));
             }
           : () => {
               const t = e[r];
-              return this.Fe(() => t);
+              return this.Be(() => t);
             };
     if (t === 0) {
-      if (this.Te !== 0) {
-        this.Re.dispose(false);
-        this.Be = [];
-        this.qe = [];
+      if (this.qe !== 0) {
+        this.Me.dispose(false);
+        this.Ge = [];
         this.Ve = [];
-        this.Te = 0;
-        this.Ge && (this.Ge = []);
-        this.Ke && (this.Ke = []);
+        this.De = [];
+        this.qe = 0;
+        this.ze && (this.ze = []);
+        this.Ue && (this.Ue = []);
       }
-      if (this.ze && !this.Ve[0]) {
-        this.Ve[0] = runWithOwner((this.Be[0] = createOwner()), this.ze);
+      if (this.Je && !this.De[0]) {
+        this.De[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
       }
-    } else if (this.Te === 0) {
-      if (this.Be[0]) this.Be[0].dispose();
-      this.Ve = new Array(t);
+    } else if (this.qe === 0) {
+      if (this.Ge[0]) this.Ge[0].dispose();
+      this.De = new Array(t);
       for (r = 0; r < t; r++) {
-        this.qe[r] = e[r];
-        this.Ve[r] = runWithOwner((this.Be[r] = createOwner()), i);
+        this.Ve[r] = e[r];
+        this.De[r] = runWithOwner((this.Ge[r] = createOwner()), i);
       }
-      this.Te = t;
+      this.qe = t;
     } else {
       let s,
         o,
@@ -2339,217 +2371,217 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         p = new Array(t),
-        h = this.Ge ? new Array(t) : undefined,
-        y = this.Ke ? new Array(t) : undefined;
+        h = this.ze ? new Array(t) : undefined,
+        y = this.Ue ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Te, t);
-        s < o && (this.qe[s] === e[s] || (this.Ge && compare(this.De, this.qe[s], e[s])));
+        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++
       ) {
-        if (this.Ge) setSignal(this.Ge[s], e[s]);
+        if (this.ze) setSignal(this.ze[s], e[s]);
       }
       for (
-        o = this.Te - 1, u = t - 1;
+        o = this.qe - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.qe[o] === e[u] || (this.Ge && compare(this.De, this.qe[o], e[u])));
+        (this.Ve[o] === e[u] || (this.ze && compare(this.Ke, this.Ve[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Ve[o];
-        p[u] = this.Be[o];
-        h && (h[u] = this.Ge[o]);
-        y && (y[u] = this.Ke[o]);
+        d[u] = this.De[o];
+        p[u] = this.Ge[o];
+        h && (h[u] = this.ze[o]);
+        y && (y[u] = this.Ue[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        l = this.De ? this.De(f) : f;
+        l = this.Ke ? this.Ke(f) : f;
         n = c.get(l);
         a[r] = n === undefined ? -1 : n;
         c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.qe[n];
-        l = this.De ? this.De(f) : f;
+        f = this.Ve[n];
+        l = this.Ke ? this.Ke(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Ve[n];
-          p[r] = this.Be[n];
-          h && (h[r] = this.Ge[n]);
-          y && (y[r] = this.Ke[n]);
+          d[r] = this.De[n];
+          p[r] = this.Ge[n];
+          h && (h[r] = this.ze[n]);
+          y && (y[r] = this.Ue[n]);
           r = a[r];
           c.set(l, r);
-        } else this.Be[n].dispose();
+        } else this.Ge[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Ve[r] = d[r];
-          this.Be[r] = p[r];
+          this.De[r] = d[r];
+          this.Ge[r] = p[r];
           if (h) {
-            this.Ge[r] = h[r];
-            setSignal(this.Ge[r], e[r]);
+            this.ze[r] = h[r];
+            setSignal(this.ze[r], e[r]);
           }
           if (y) {
-            this.Ke[r] = y[r];
-            setSignal(this.Ke[r], r);
+            this.Ue[r] = y[r];
+            setSignal(this.Ue[r], r);
           }
         } else {
-          this.Ve[r] = runWithOwner((this.Be[r] = createOwner()), i);
+          this.De[r] = runWithOwner((this.Ge[r] = createOwner()), i);
         }
       }
-      this.Ve = this.Ve.slice(0, (this.Te = t));
-      this.qe = e.slice(0);
+      this.De = this.De.slice(0, (this.qe = t));
+      this.Ve = e.slice(0);
     }
   });
-  return this.Ve;
+  return this.De;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    Re: createOwner(),
-    Te: 0,
-    Ue: 0,
-    Je: e,
-    Fe: t,
-    Be: [],
-    Ve: [],
-    Xe: n?.from,
-    ze: n?.fallback
+    Me: createOwner(),
+    qe: 0,
+    Xe: 0,
+    Ye: e,
+    Be: t,
+    Ge: [],
+    De: [],
+    Ze: n?.from,
+    Je: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.Je();
-  const t = this.Xe?.() || 0;
-  runWithOwner(this.Re, () => {
+  const e = this.Ye();
+  const t = this.Ze?.() || 0;
+  runWithOwner(this.Me, () => {
     if (e === 0) {
-      if (this.Te !== 0) {
-        this.Re.dispose(false);
-        this.Be = [];
-        this.Ve = [];
-        this.Te = 0;
+      if (this.qe !== 0) {
+        this.Me.dispose(false);
+        this.Ge = [];
+        this.De = [];
+        this.qe = 0;
       }
-      if (this.ze && !this.Ve[0]) {
-        this.Ve[0] = runWithOwner((this.Be[0] = createOwner()), this.ze);
+      if (this.Je && !this.De[0]) {
+        this.De[0] = runWithOwner((this.Ge[0] = createOwner()), this.Je);
       }
       return;
     }
     const n = t + e;
-    const r = this.Ue + this.Te;
-    if (this.Te === 0 && this.Be[0]) this.Be[0].dispose();
-    for (let e = n; e < r; e++) this.Be[e - this.Ue].dispose();
-    if (this.Ue < t) {
-      let e = this.Ue;
-      while (e < t && e < this.Te) this.Be[e++].dispose();
-      this.Be.splice(0, t - this.Ue);
-      this.Ve.splice(0, t - this.Ue);
-    } else if (this.Ue > t) {
-      let n = r - this.Ue - 1;
-      let i = this.Ue - t;
-      this.Be.length = this.Ve.length = 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.De.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.De.length = e;
       while (n >= i) {
-        this.Be[n] = this.Be[n - i];
-        this.Ve[n] = this.Ve[n - i];
+        this.Ge[n] = this.Ge[n - i];
+        this.De[n] = this.De[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.Ve[e] = runWithOwner((this.Be[e] = createOwner()), () => this.Fe(e + t));
+        this.De[e] = runWithOwner((this.Ge[e] = createOwner()), () => this.Be(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Ve[e - t] = runWithOwner((this.Be[e - t] = createOwner()), () => this.Fe(e));
+      this.De[e - t] = runWithOwner((this.Ge[e - t] = createOwner()), () => this.Be(e));
     }
-    this.Ve = this.Ve.slice(0, e);
-    this.Ue = t;
-    this.Te = e;
+    this.De = this.De.slice(0, e);
+    this.Xe = t;
+    this.qe = e;
   });
-  return this.Ve;
+  return this.De;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.xe = (e, t) => {
-    const r = e !== undefined ? e : n.he;
-    const i = t !== undefined ? t : n.ie;
-    n.he &= ~n.Ye;
-    n.ae.notify(n, n.Ye, r, i);
+  n.Pe = (e, t) => {
+    const r = e !== undefined ? e : n.ge;
+    const i = t !== undefined ? t : n.oe;
+    n.ge &= ~n.$e;
+    n.pe.notify(n, n.$e, r, i);
   };
-  n.Ye = t;
-  n.ke = true;
+  n.$e = t;
+  n.Ee = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.ae;
-  i.addChild((e.ae = n));
-  onCleanup(() => i.removeChild(e.ae));
+  const i = e.pe;
+  i.addChild((e.pe = n));
+  onCleanup(() => i.removeChild(e.pe));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
 class ConditionalQueue extends Queue {
-  Ze;
-  $e = new Set();
-  Y = new Set();
+  et;
+  tt = new Set();
+  $ = new Set();
   constructor(e) {
     super();
-    this.Ze = e;
+    this.et = e;
   }
   run(e) {
-    if (!e || read(this.Ze)) return;
+    if (!e || read(this.et)) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (read(this.Ze)) {
+    if (read(this.et)) {
       if (t & l) {
         if (n & l) {
-          this.Y.add(e);
+          this.$.add(e);
           t &= ~l;
-        } else if (this.Y.delete(e)) t &= ~l;
+        } else if (this.$.delete(e)) t &= ~l;
       }
       if (t & c) {
         if (n & c) {
-          this.$e.add(e);
+          this.tt.add(e);
           t &= ~c;
-        } else if (this.$e.delete(e)) t &= ~c;
+        } else if (this.tt.delete(e)) t &= ~c;
       }
     }
-    return t ? super.notify(e, t, n, r ?? e.ie) : true;
+    return t ? super.notify(e, t, n, r ?? e.oe) : true;
   }
 }
 class CollectionQueue extends Queue {
-  et;
-  tt = new Set();
-  Ze = signal(false, { pureWrite: true });
-  nt = false;
+  nt;
+  rt = new Set();
+  et = signal(false, { pureWrite: true });
+  it = false;
   constructor(e) {
     super();
-    this.et = e;
+    this.nt = e;
   }
   run(e) {
-    if (!e || read(this.Ze)) return;
+    if (!e || read(this.et)) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.et) || (this.et & l && this.nt)) return super.notify(e, t, n, r);
-    if (n & this.et) {
-      const t = r?.t || e.ie?.t;
+    if (!(t & this.nt) || (this.nt & l && this.it)) return super.notify(e, t, n, r);
+    if (n & this.nt) {
+      const t = r?.t || e.oe?.t;
       if (t) {
-        const e = this.tt.size === 0;
-        this.tt.add(t);
-        if (e) setSignal(this.Ze, true);
+        const e = this.rt.size === 0;
+        this.rt.add(t);
+        if (e) setSignal(this.et, true);
       }
     }
-    t &= ~this.et;
+    t &= ~this.nt;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.tt) {
-      if (!(e.he & this.et)) this.tt.delete(e);
+    for (const e of this.rt) {
+      if (!(e.ge & this.nt)) this.rt.delete(e);
     }
-    if (!this.tt.size) setSignal(this.Ze, false);
+    if (!this.rt.size) setSignal(this.et, false);
   }
 }
 var ue;
@@ -2562,26 +2594,26 @@ function createBoundary(e, t) {
   const r = new ConditionalQueue(computed(() => t() === ue.HIDDEN));
   const i = createBoundChildren(n, e, r, 0);
   computed(() => {
-    const e = read(r.Ze);
-    i.Ye = e ? c | l : 0;
+    const e = read(r.et);
+    i.$e = e ? c | l : 0;
     if (!e) {
-      r.Y.forEach(e => r.notify(e, l, l, e.ie));
-      r.$e.forEach(e => r.notify(e, c, c, e.ie));
-      r.Y.clear();
-      r.$e.clear();
+      r.$.forEach(e => r.notify(e, l, l, e.oe));
+      r.tt.forEach(e => r.notify(e, c, c, e.oe));
+      r.$.clear();
+      r.tt.clear();
     }
   });
-  return () => (read(r.Ze) ? undefined : read(i));
+  return () => (read(r.et) ? undefined : read(i));
 }
 function createCollectionBoundary(e, t, n) {
   const r = createOwner();
   const i = new CollectionQueue(e);
   const s = createBoundChildren(r, t, i, e);
   const o = computed(() => {
-    if (!read(i.Ze)) {
+    if (!read(i.et)) {
       const e = read(s);
-      if (!untrack(() => read(i.Ze))) {
-        i.nt = true;
+      if (!untrack(() => read(i.et))) {
+        i.it = true;
         return e;
       }
     }
@@ -2594,10 +2626,10 @@ function createLoadBoundary(e, t) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
-    let n = e.tt.values().next().value;
-    const r = n.ie?.cause ?? n.ie;
+    let n = e.rt.values().next().value;
+    const r = n.oe?.cause ?? n.oe;
     return t(r, () => {
-      for (const t of e.tt) recompute(t);
+      for (const t of e.rt) recompute(t);
       schedule();
     });
   });