@solidjs/signals 0.10.0 → 0.10.1

package/dist/node.cjs

@@ -1,16 +1,16 @@
 "use strict";
 class NotReadyError extends Error {
-  t;
+  source;
   constructor(e) {
     super();
-    this.t = e;
+    this.source = e;
   }
 }
 class StatusError extends Error {
-  t;
+  source;
   constructor(e, t) {
     super(t instanceof Error ? t.message : String(t), { cause: t });
-    this.t = e;
+    this.source = e;
   }
 }
 class NoOwnerError extends Error {
@@ -43,114 +43,114 @@ const g = typeof Proxy === "function";
 const w = {};
 const S = Symbol("refresh");
 function actualInsertIntoHeap(e, t) {
-  const n = (e.o?.i ? e.o.l?.u : e.o?.u) ?? -1;
-  if (n >= e.u) e.u = n + 1;
-  const r = e.u;
-  const i = t.p[r];
-  if (i === undefined) t.p[r] = e;
+  const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
+  if (n >= e.o) e.o = n + 1;
+  const r = e.o;
+  const i = t.l[r];
+  if (i === undefined) t.l[r] = e;
   else {
-    const t = i.h;
-    t.S = e;
-    e.h = t;
-    i.h = e;
+    const t = i.p;
+    t.h = e;
+    e.p = t;
+    i.p = e;
   }
-  if (r > t.m) t.m = r;
+  if (r > t.S) t.S = r;
 }
 function insertIntoHeap(e, o) {
-  let u = e._;
+  let u = e.m;
   if (u & (i | r)) return;
   if (u & t) {
-    e._ = (u & -4) | n | i;
-  } else e._ = u | i;
+    e.m = (u & -4) | n | i;
+  } else e.m = u | i;
   if (!(u & s)) actualInsertIntoHeap(e, o);
 }
 function insertIntoHeapHeight(e, t) {
-  let n = e._;
+  let n = e.m;
   if (n & (i | r | s)) return;
-  e._ = n | s;
+  e.m = n | s;
   actualInsertIntoHeap(e, t);
 }
 function deleteFromHeap(e, t) {
-  const n = e._;
+  const n = e.m;
   if (!(n & (i | s))) return;
-  e._ = n & -25;
-  const r = e.u;
-  if (e.h === e) t.p[r] = undefined;
+  e.m = n & -25;
+  const r = e.o;
+  if (e.p === e) t.l[r] = undefined;
   else {
-    const n = e.S;
-    const i = t.p[r];
+    const n = e.h;
+    const i = t.l[r];
     const s = n ?? i;
-    if (e === i) t.p[r] = n;
-    else e.h.S = n;
-    s.h = e.h;
+    if (e === i) t.l[r] = n;
+    else e.p.h = n;
+    s.p = e.p;
   }
-  e.h = e;
-  e.S = undefined;
+  e.p = e;
+  e.h = undefined;
 }
 function markHeap(e) {
-  if (e.O) return;
-  e.O = true;
-  for (let t = 0; t <= e.m; t++) {
-    for (let n = e.p[t]; n !== undefined; n = n.S) {
-      if (n._ & i) markNode(n);
+  if (e._) return;
+  e._ = true;
+  for (let t = 0; t <= e.S; t++) {
+    for (let n = e.l[t]; n !== undefined; n = n.h) {
+      if (n.m & i) markNode(n);
     }
   }
 }
 function markNode(e, r = n) {
-  const i = e._;
+  const i = e.m;
   if ((i & (t | n)) >= r) return;
-  e._ = (i & -4) | r;
-  for (let n = e.P; n !== null; n = n.A) {
-    markNode(n.k, t);
+  e.m = (i & -4) | r;
+  for (let n = e.O; n !== null; n = n.P) {
+    markNode(n.A, t);
   }
-  if (e.C !== null) {
-    for (let n = e.C; n !== null; n = n.W) {
-      for (let e = n.P; e !== null; e = e.A) {
-        markNode(e.k, t);
+  if (e.k !== null) {
+    for (let n = e.k; n !== null; n = n.C) {
+      for (let e = n.O; e !== null; e = e.P) {
+        markNode(e.A, t);
       }
     }
   }
 }
 function runHeap(e, t) {
-  e.O = false;
-  for (e.j = 0; e.j <= e.m; e.j++) {
-    let n = e.p[e.j];
+  e._ = false;
+  for (e.W = 0; e.W <= e.S; e.W++) {
+    let n = e.l[e.W];
     while (n !== undefined) {
-      if (n._ & i) t(n);
+      if (n.m & i) t(n);
       else adjustHeight(n, e);
-      n = e.p[e.j];
+      n = e.l[e.W];
     }
   }
-  e.m = 0;
+  e.S = 0;
 }
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
-  let n = e.u;
-  for (let t = e.N; t; t = t.L) {
-    const e = t.I;
-    const r = e.H || e;
-    if (r.R && r.u >= n) n = r.u + 1;
+  let n = e.o;
+  for (let t = e.j; t; t = t.N) {
+    const e = t.L;
+    const r = e.I || e;
+    if (r.H && r.o >= n) n = r.o + 1;
   }
-  if (e.u !== n) {
-    e.u = n;
-    for (let n = e.P; n !== null; n = n.A) {
-      insertIntoHeapHeight(n.k, t);
+  if (e.o !== n) {
+    e.o = n;
+    for (let n = e.O; n !== null; n = n.P) {
+      insertIntoHeapHeight(n.A, t);
     }
   }
 }
 const m = new Set();
-const _ = { p: new Array(2e3).fill(undefined), O: false, j: 0, m: 0 };
-const b = { p: new Array(2e3).fill(undefined), O: false, j: 0, m: 0 };
+const b = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+const _ = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
 let O = 0;
 let x = null;
 let v = false;
 let P = false;
 function runLaneEffects(e) {
   for (const t of C) {
-    if (t.T || t.M.size > 0) continue;
-    const n = t.q[e - 1];
+    if (t.R || t.T.size > 0) continue;
+    const n = t.M[e - 1];
     if (n.length) {
-      t.q[e - 1] = [];
+      t.M[e - 1] = [];
       runQueue(n, e);
     }
   }
@@ -161,129 +161,129 @@ function setProjectionWriteActive(e) {
 function schedule() {
   if (v) return;
   v = true;
-  if (!A.F) queueMicrotask(flush);
+  if (!A.q) queueMicrotask(flush);
 }
 class Queue {
-  o = null;
-  V = [[], []];
-  D = [];
+  i = null;
+  F = [[], []];
+  V = [];
   created = O;
   addChild(e) {
-    this.D.push(e);
-    e.o = this;
+    this.V.push(e);
+    e.i = this;
   }
   removeChild(e) {
-    const t = this.D.indexOf(e);
+    const t = this.V.indexOf(e);
     if (t >= 0) {
-      this.D.splice(t, 1);
-      e.o = null;
+      this.V.splice(t, 1);
+      e.i = null;
     }
   }
   notify(e, t, n, r) {
-    if (this.o) return this.o.notify(e, t, n, r);
+    if (this.i) return this.i.notify(e, t, n, r);
     return false;
   }
   run(e) {
-    if (this.V[e - 1].length) {
-      const t = this.V[e - 1];
-      this.V[e - 1] = [];
+    if (this.F[e - 1].length) {
+      const t = this.F[e - 1];
+      this.F[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.D.length; t++) this.D[t].run?.(e);
+    for (let t = 0; t < this.V.length; t++) this.V[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
       if (R) {
         const n = findLane(R);
-        n.q[e - 1].push(t);
+        n.M[e - 1].push(t);
       } else {
-        this.V[e - 1].push(t);
+        this.F[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.V[0].push(...this.V[0]);
-    e.V[1].push(...this.V[1]);
-    this.V = [[], []];
-    for (let t = 0; t < this.D.length; t++) {
-      let n = this.D[t];
-      let r = e.D[t];
+    e.F[0].push(...this.F[0]);
+    e.F[1].push(...this.F[1]);
+    this.F = [[], []];
+    for (let t = 0; t < this.V.length; t++) {
+      let n = this.V[t];
+      let r = e.V[t];
       if (!r) {
-        r = { V: [[], []], D: [] };
-        e.D[t] = r;
+        r = { F: [[], []], V: [] };
+        e.V[t] = r;
       }
       n.stashQueues(r);
     }
   }
   restoreQueues(e) {
-    this.V[0].push(...e.V[0]);
-    this.V[1].push(...e.V[1]);
-    for (let t = 0; t < e.D.length; t++) {
-      const n = e.D[t];
-      let r = this.D[t];
+    this.F[0].push(...e.F[0]);
+    this.F[1].push(...e.F[1]);
+    for (let t = 0; t < e.V.length; t++) {
+      const n = e.V[t];
+      let r = this.V[t];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  F = false;
+  q = false;
+  D = [];
   B = [];
-  G = [];
-  K = new Set();
+  G = new Set();
+  static K;
   static U;
-  static J;
-  static X = null;
+  static J = null;
   flush() {
-    if (this.F) return;
-    this.F = true;
+    if (this.q) return;
+    this.q = true;
     try {
-      runHeap(_, GlobalQueue.U);
+      runHeap(b, GlobalQueue.K);
       if (x) {
         const e = transitionComplete(x);
         if (!e) {
           let e = x;
-          runHeap(b, GlobalQueue.U);
+          runHeap(_, GlobalQueue.K);
+          this.D = [];
           this.B = [];
-          this.G = [];
-          this.K = new Set();
+          this.G = new Set();
           runLaneEffects(d);
           runLaneEffects(p);
-          this.stashQueues(x.Y);
+          this.stashQueues(x.X);
           O++;
-          v = _.m >= _.j;
-          reassignPendingTransition(x.B);
+          v = b.S >= b.W;
+          reassignPendingTransition(x.D);
           x = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.B !== x.B && this.B.push(...x.B);
-        this.restoreQueues(x.Y);
+        this.D !== x.D && this.D.push(...x.D);
+        this.restoreQueues(x.X);
         m.delete(x);
         const t = x;
         x = null;
-        reassignPendingTransition(this.B);
+        reassignPendingTransition(this.D);
         finalizePureQueue(t);
       } else {
-        if (m.size) runHeap(b, GlobalQueue.U);
+        if (m.size) runHeap(_, GlobalQueue.K);
         finalizePureQueue();
       }
       O++;
-      v = _.m >= _.j;
+      v = b.S >= b.W;
       runLaneEffects(d);
       this.run(d);
       runLaneEffects(p);
       this.run(p);
     } finally {
-      this.F = false;
+      this.q = false;
     }
   }
   notify(e, t, n, r) {
     if (t & l) {
       if (n & l) {
-        const t = r !== undefined ? r : e.Z;
-        if (x && t && !x.$.includes(t.t)) {
-          x.$.push(t.t);
+        const t = r !== undefined ? r : e.Y;
+        if (x && t && !x.Z.includes(t.source)) {
+          x.Z.push(t.source);
           schedule();
         }
       }
@@ -294,143 +294,143 @@ class GlobalQueue extends Queue {
   initTransition(e) {
     if (e) e = currentTransition(e);
     if (e && e === x) return;
-    if (!e && x && x.ee === O) return;
+    if (!e && x && x.$ === O) return;
     if (!x) {
       x = e ?? {
-        ee: O,
+        $: O,
+        D: [],
+        Z: [],
         B: [],
-        $: [],
-        G: [],
-        K: new Set(),
-        te: [],
-        Y: { V: [[], []], D: [] },
-        ne: false
+        G: new Set(),
+        ee: [],
+        X: { F: [[], []], V: [] },
+        te: false
       };
     } else if (e) {
       const t = x;
-      t.ne = e;
-      e.te.push(...t.te);
+      t.te = e;
+      e.ee.push(...t.ee);
       for (const n of C) {
-        if (n.re === t) n.re = e;
+        if (n.ne === t) n.ne = e;
       }
-      e.G.push(...t.G);
-      for (const n of t.K) {
-        e.K.add(n);
+      e.B.push(...t.B);
+      for (const n of t.G) {
+        e.G.add(n);
       }
       m.delete(t);
       x = e;
     }
     m.add(x);
-    x.ee = O;
+    x.$ = O;
+    for (let e = 0; e < this.D.length; e++) {
+      const t = this.D[e];
+      t.ne = x;
+      x.D.push(t);
+    }
+    this.D = x.D;
     for (let e = 0; e < this.B.length; e++) {
       const t = this.B[e];
-      t.re = x;
+      t.ne = x;
       x.B.push(t);
     }
     this.B = x.B;
-    for (let e = 0; e < this.G.length; e++) {
-      const t = this.G[e];
-      t.re = x;
-      x.G.push(t);
-    }
-    this.G = x.G;
     for (const e of C) {
-      if (!e.re) e.re = x;
+      if (!e.ne) e.ne = x;
     }
-    for (const e of this.K) x.K.add(e);
-    this.K = x.K;
+    for (const e of this.G) x.G.add(e);
+    this.G = x.G;
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.ie || R;
-  for (let r = e.P; r !== null; r = r.A) {
+  const n = e.re || R;
+  for (let r = e.O; r !== null; r = r.P) {
     if (t && n) {
-      r.k._ |= f;
-      assignOrMergeLane(r.k, n);
+      r.A.m |= f;
+      assignOrMergeLane(r.A, n);
     } else if (t) {
-      r.k._ |= f;
-      r.k.ie = undefined;
+      r.A.m |= f;
+      r.A.re = undefined;
     }
-    const e = r.k;
-    if (e.se === h) {
-      if (!e.oe) {
-        e.oe = true;
-        e.ue.enqueue(p, e.fe);
+    const e = r.A;
+    if (e.ie === h) {
+      if (!e.se) {
+        e.se = true;
+        e.oe.enqueue(p, e.ue);
       }
       continue;
     }
-    const i = r.k._ & o ? b : _;
-    if (i.j > r.k.u) i.j = r.k.u;
-    insertIntoHeap(r.k, i);
+    const i = r.A.m & o ? _ : b;
+    if (i.W > r.A.o) i.W = r.A.o;
+    insertIntoHeap(r.A, i);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(A);
-  if (_.m >= _.j) runHeap(_, GlobalQueue.U);
+  if (b.S >= b.W) runHeap(b, GlobalQueue.K);
   if (n) {
-    const t = A.B;
+    const t = A.D;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
-      if (n.le !== y) {
-        n.ce = n.le;
-        n.le = y;
-        if (n.se && n.se !== h) n.oe = true;
+      if (n.fe !== y) {
+        n.le = n.fe;
+        n.fe = y;
+        if (n.ie && n.ie !== h) n.se = true;
       }
-      n.ae &= ~a;
-      if (n.R) GlobalQueue.J(n, false, true);
+      n.ce &= ~a;
+      if (n.H) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.G : A.G;
+    const n = e ? e.B : A.B;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
-      const r = t.le;
-      t.ie = undefined;
-      if (r !== y && t.ce !== r) {
-        t.ce = r;
+      const r = t.fe;
+      t.re = undefined;
+      if (r !== y && t.le !== r) {
+        t.le = r;
         insertSubs(t, true);
       }
-      t.le = y;
-      t.re = null;
+      t.fe = y;
+      t.ne = null;
     }
     n.length = 0;
-    const r = e ? e.K : A.K;
-    if (GlobalQueue.X && r.size) {
+    const r = e ? e.G : A.G;
+    if (GlobalQueue.J && r.size) {
       for (const e of r) {
-        GlobalQueue.X(e);
+        GlobalQueue.J(e);
       }
       r.clear();
       schedule();
     }
     for (const t of C) {
-      const n = e ? t.re === e : !t.re;
+      const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
-      if (!t.T) {
-        if (t.q[0].length) runQueue(t.q[0], d);
-        if (t.q[1].length) runQueue(t.q[1], p);
-      }
-      if (t.t.ie === t) t.t.ie = undefined;
-      t.M.clear();
-      t.q[0].length = 0;
-      t.q[1].length = 0;
+      if (!t.R) {
+        if (t.M[0].length) runQueue(t.M[0], d);
+        if (t.M[1].length) runQueue(t.M[1], p);
+      }
+      if (t.ae.re === t) t.ae.re = undefined;
+      t.T.clear();
+      t.M[0].length = 0;
+      t.M[1].length = 0;
       C.delete(t);
-      k.delete(t.t);
+      k.delete(t.ae);
     }
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.D) {
+  for (const t of e.V) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  A.K.add(e);
+  A.G.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].re = x;
+    e[t].ne = x;
   }
 }
 const A = new GlobalQueue();
@@ -443,21 +443,21 @@ function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function transitionComplete(e) {
-  if (e.ne) return true;
-  if (e.te.length) return false;
+  if (e.te) return true;
+  if (e.ee.length) return false;
   let t = true;
-  for (let n = 0; n < e.$.length; n++) {
-    const r = e.$[n];
-    if (r.ae & l && r.Z?.t === r) {
+  for (let n = 0; n < e.Z.length; n++) {
+    const r = e.Z[n];
+    if (r.ce & l && r.Y?.source === r) {
       t = false;
       break;
     }
   }
-  t && (e.ne = true);
+  t && (e.te = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.ne && typeof e.ne === "object") e = e.ne;
+  while (e.te && typeof e.te === "object") e = e.te;
   return e;
 }
 function setActiveTransition(e) {
@@ -480,58 +480,58 @@ function getOrCreateLane(e) {
     return findLane(t);
   }
   const n = e.de;
-  const r = n?.ie ? findLane(n.ie) : null;
-  t = { t: e, M: new Set(), q: [[], []], T: null, re: x, pe: r };
+  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);
   e.he = e.ye || 0;
   return t;
 }
 function findLane(e) {
-  while (e.T) e = e.T;
+  while (e.R) e = e.R;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.T = e;
-  for (const n of t.M) e.M.add(n);
-  e.q[0].push(...t.q[0]);
-  e.q[1].push(...t.q[1]);
+  t.R = 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]);
   return e;
 }
 function resolveLane(e) {
-  const t = e.ie;
+  const t = e.re;
   if (!t) return undefined;
   const n = findLane(t);
   if (C.has(n)) return n;
-  e.ie = undefined;
+  e.re = undefined;
   return undefined;
 }
 function hasActiveOverride(e) {
-  return !!(e.ge && e.le !== y);
+  return !!(e.ge && e.fe !== y);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const r = e.ie;
+  const r = e.re;
   if (r) {
-    if (r.T) {
-      e.ie = t;
+    if (r.R) {
+      e.re = t;
       return;
     }
     const i = findLane(r);
     if (C.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
         if (n.pe && findLane(n.pe) === i) {
-          e.ie = t;
+          e.re = t;
         } else if (i.pe && findLane(i.pe) === n);
         else mergeLanes(n, i);
       }
       return;
     }
   }
-  e.ie = t;
+  e.re = t;
 }
 function handleAsync(e, t, r) {
   const i = typeof t === "object" && t !== null;
@@ -545,32 +545,32 @@ function handleAsync(e, t, r) {
   let u;
   const handleError = n => {
     if (e.we !== t) return;
-    A.initTransition(e.re);
+    A.initTransition(e.ne);
     notifyStatus(e, n instanceof NotReadyError ? l : c, n);
-    e.ee = O;
+    e.$ = O;
   };
   const asyncWrite = (i, s) => {
     if (e.we !== t) return;
-    if (e._ & (n | f)) return;
-    A.initTransition(e.re);
+    if (e.m & (n | f)) return;
+    A.initTransition(e.ne);
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.M.delete(e);
+    if (o) o.T.delete(e);
     if (r) r(i);
     else if (e.ge) {
-      const t = e.le !== y;
-      if (e.R) e.le = i;
+      const t = e.fe !== y;
+      if (e.H) e.fe = i;
       if (!t) {
-        e.ce = i;
+        e.le = i;
         insertSubs(e);
       }
-      e.ee = O;
+      e.$ = O;
     } else if (o) {
-      const t = e.ce;
+      const t = e.le;
       const n = e.Se;
       if (!n || !n(i, t)) {
-        e.ce = i;
-        e.ee = O;
+        e.le = i;
+        e.$ = O;
         if (e.me) {
           setSignal(e.me, i);
         }
@@ -599,7 +599,7 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      A.initTransition(e.re);
+      A.initTransition(e.ne);
       throw new NotReadyError(Q);
     }
   }
@@ -631,61 +631,61 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      A.initTransition(e.re);
+      A.initTransition(e.ne);
       throw new NotReadyError(Q);
     }
   }
   return u;
 }
 function clearStatus(e) {
-  e.ae = e.ae & a;
-  e.Z = null;
+  e.ce = e.ce & a;
+  e.Y = null;
   updatePendingSignal(e);
-  e._e?.();
+  e.be?.();
 }
 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 s = n instanceof NotReadyError && n.source === e;
   const o = t === l && e.ge && !s;
   const u = o && hasActiveOverride(e);
   if (!r) {
-    e.ae = t | (t !== c ? e.ae & a : 0);
-    e.Z = n;
+    e.ce = t | (t !== c ? e.ce & a : 0);
+    e.Y = n;
     updatePendingSignal(e);
   }
   if (i && !r) {
     assignOrMergeLane(e, i);
   }
   if (u && x && n instanceof NotReadyError) {
-    const e = n.t;
-    if (!x.$.includes(e)) {
-      x.$.push(e);
+    const e = n.source;
+    if (!x.Z.includes(e)) {
+      x.Z.push(e);
     }
   }
   const f = r || u;
   const d = r || o ? undefined : i;
-  if (e._e) {
+  if (e.be) {
     if (f) {
-      e._e(t, n);
+      e.be(t, n);
     } else {
-      e._e();
+      e.be();
     }
     return;
   }
-  for (let r = e.P; r !== null; r = r.A) {
-    r.k.ee = O;
-    if (r.k.Z !== n) {
-      !r.k.re && A.B.push(r.k);
-      notifyStatus(r.k, t, n, f, d);
+  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);
     }
   }
-  for (let r = e.C; r !== null; r = r.W) {
-    for (let e = r.P; e !== null; e = e.A) {
-      e.k.ee = O;
-      if (e.k.Z !== n) {
-        !e.k.re && A.B.push(e.k);
-        notifyStatus(e.k, t, n, f, d);
+  for (let r = e.k; r !== null; r = r.C) {
+    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);
       }
     }
   }
@@ -695,24 +695,24 @@ function effect(e, t, n, r, i) {
   const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
     ...i,
     equals: () => {
-      o.oe = !o.Z;
-      if (s) o.ue.enqueue(o.se, runEffect.bind(o));
+      o.se = !o.Y;
+      if (s) o.oe.enqueue(o.ie, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.be = r;
+  o._e = r;
   o.Oe = t;
   o.xe = n;
   o.ve = undefined;
-  o.se = i?.render ? d : p;
-  o._e = (e, t) => {
-    const n = e !== undefined ? e : o.ae;
-    const r = t !== undefined ? t : o.Z;
+  o.ie = i?.render ? d : p;
+  o.be = (e, t) => {
+    const n = e !== undefined ? e : o.ce;
+    const r = t !== undefined ? t : o.Y;
     if (n & c) {
       let e = r;
-      o.ue.notify(o, l, 0);
-      if (o.se === p) {
+      o.oe.notify(o, l, 0);
+      if (o.ie === p) {
         try {
           return o.xe
             ? o.xe(e, () => {
@@ -724,31 +724,31 @@ function effect(e, t, n, r, i) {
           e = t;
         }
       }
-      if (!o.ue.notify(o, c, c)) throw e;
-    } else if (o.se === d) o.ue.notify(o, l | c, n, r);
+      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.se === p ? o.ue.enqueue(o.se, runEffect.bind(o)) : runEffect.call(o));
+  !i?.defer && (o.ie === p ? o.oe.enqueue(o.ie, runEffect.bind(o)) : runEffect.call(o));
   s = true;
   onCleanup(() => o.ve?.());
 }
 function runEffect() {
-  if (!this.oe || this._ & u) return;
+  if (!this.se || this.m & u) return;
   this.ve?.();
   this.ve = undefined;
   try {
-    this.ve = this.Oe(this.ce, this.be);
+    this.ve = this.Oe(this.le, this._e);
   } catch (e) {
-    if (!this.ue.notify(this, c, c)) throw e;
+    if (!this.oe.notify(this, c, c)) throw e;
   } finally {
-    this.be = this.ce;
-    this.oe = false;
+    this._e = this.le;
+    this.se = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.oe || n._ & u) return;
-    n.oe = false;
+    if (!n.se || n.m & u) return;
+    n.se = false;
     recompute(n);
   };
   const n = computed(
@@ -764,48 +764,48 @@ function trackedEffect(e, t) {
     { ...t, lazy: true, pureWrite: true }
   );
   n.ve = undefined;
-  n.oe = true;
-  n.se = h;
-  n.fe = run;
-  n.ue.enqueue(p, run);
+  n.se = true;
+  n.ie = h;
+  n.ue = run;
+  n.oe.enqueue(p, run);
   onCleanup(() => n.ve?.());
 }
 const W = {};
 function markDisposal(e) {
   let t = e.Pe;
   while (t) {
-    t._ |= o;
-    if (t._ & i) {
-      deleteFromHeap(t, _);
-      insertIntoHeap(t, b);
+    t.m |= o;
+    if (t.m & i) {
+      deleteFromHeap(t, b);
+      insertIntoHeap(t, _);
     }
     markDisposal(t);
     t = t.Ae;
   }
 }
 function dispose(e) {
-  let t = e.N || null;
+  let t = e.j || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.N = null;
+  e.j = null;
   e.ke = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
-  if (e._ & u) return;
-  if (t) e._ = u;
+  if (e.m & u) return;
+  if (t) e.m = u;
   let r = n ? e.Ce : e.Pe;
   while (r) {
     const e = r.Ae;
-    if (r.N) {
+    if (r.j) {
       const e = r;
-      deleteFromHeap(e, e._ & o ? b : _);
-      let t = e.N;
+      deleteFromHeap(e, e.m & o ? _ : b);
+      let t = e.j;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.N = null;
+      e.j = null;
       e.ke = null;
     }
     disposeChildren(r, true);
@@ -859,17 +859,17 @@ function createOwner(e) {
   const t = Q;
   const n = {
     id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
-    i: true,
-    l: t?.i ? t.l : t,
+    t: true,
+    u: t?.t ? t.u : t,
     Pe: null,
     Ae: null,
     Ee: null,
-    ue: t?.ue ?? A,
+    oe: t?.oe ?? A,
     Ne: t?.Ne || w,
     je: 0,
     We: null,
     Ce: null,
-    o: t,
+    i: t,
     dispose(e = true) {
       disposeChildren(n, e);
     }
@@ -890,65 +890,65 @@ function createRoot(e, t) {
   return runWithOwner(n, () => e(n.dispose));
 }
 function unlinkSubs(e) {
-  const t = e.I;
-  const n = e.L;
-  const r = e.A;
+  const t = e.L;
+  const n = e.N;
+  const r = e.P;
   const i = e.Le;
   if (r !== null) r.Le = i;
   else t.Ie = i;
-  if (i !== null) i.A = r;
+  if (i !== null) i.P = r;
   else {
-    t.P = r;
+    t.O = r;
     if (r === null) {
       t.He?.();
-      t.R && !t.Qe && unobserved(t);
+      t.H && !t.Qe && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e._ & o ? b : _);
-  let t = e.N;
+  deleteFromHeap(e, e.m & o ? _ : b);
+  let t = e.j;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.N = null;
+  e.j = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
   const n = t.ke;
-  if (n !== null && n.I === e) return;
+  if (n !== null && n.L === e) return;
   let i = null;
-  const s = t._ & r;
+  const s = t.m & r;
   if (s) {
-    i = n !== null ? n.L : t.N;
-    if (i !== null && i.I === e) {
+    i = n !== null ? n.N : t.j;
+    if (i !== null && i.L === e) {
       t.ke = i;
       return;
     }
   }
   const o = e.Ie;
-  if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.ke = e.Ie = { I: e, k: t, L: i, Le: o, A: null });
-  if (n !== null) n.L = u;
-  else t.N = u;
-  if (o !== null) o.A = u;
-  else e.P = u;
+  if (o !== null && o.A === t && (!s || isValidLink(o, t))) return;
+  const u = (t.ke = e.Ie = { L: e, A: t, N: i, Le: o, P: null });
+  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.N;
+    let r = t.j;
     do {
       if (r === e) return true;
       if (r === n) break;
-      r = r.L;
+      r = r.N;
     } while (r !== null);
   }
   return false;
 }
-GlobalQueue.U = recompute;
-GlobalQueue.J = disposeChildren;
+GlobalQueue.K = recompute;
+GlobalQueue.U = disposeChildren;
 let E = false;
 let j = false;
 let N = false;
@@ -958,11 +958,11 @@ let H = false;
 let Q = null;
 let R = null;
 function recompute(t, n = false) {
-  const i = t.se;
+  const i = t.ie;
   if (!n) {
-    if (t.re && (!i || x) && x !== t.re) A.initTransition(t.re);
-    deleteFromHeap(t, t._ & o ? b : _);
-    if (t.re || i === h) disposeChildren(t);
+    if (t.ne && (!i || x) && x !== t.ne) A.initTransition(t.ne);
+    deleteFromHeap(t, t.m & o ? _ : b);
+    if (t.ne || i === h) disposeChildren(t);
     else {
       markDisposal(t);
       t.We = t.Ee;
@@ -971,16 +971,16 @@ function recompute(t, n = false) {
       t.Pe = null;
     }
   }
-  const s = !!(t._ & f);
+  const s = !!(t.m & f);
   const u = hasActiveOverride(t);
-  const a = !!(t.ae & l);
+  const a = !!(t.ce & l);
   const d = Q;
   Q = t;
   t.ke = null;
-  t._ = r;
-  t.ee = O;
-  let p = t.le === y ? t.ce : t.le;
-  let g = t.u;
+  t.m = r;
+  t.$ = O;
+  let p = t.fe === y ? t.le : t.fe;
+  let g = t.o;
   let w = E;
   let S = R;
   E = true;
@@ -989,20 +989,20 @@ function recompute(t, n = false) {
     if (e) R = e;
   }
   try {
-    p = handleAsync(t, t.R(p));
+    p = handleAsync(t, t.H(p));
     clearStatus(t);
     const e = resolveLane(t);
     if (e) {
-      e.M.delete(t);
-      updatePendingSignal(e.t);
+      e.T.delete(t);
+      updatePendingSignal(e.ae);
     }
   } catch (e) {
     if (e instanceof NotReadyError && R) {
       const e = findLane(R);
-      if (e.t !== t) {
-        e.M.add(t);
-        t.ie = e;
-        updatePendingSignal(e.t);
+      if (e.ae !== t) {
+        e.T.add(t);
+        t.re = e;
+        updatePendingSignal(e.ae);
       }
     }
     notifyStatus(
@@ -1010,66 +1010,66 @@ function recompute(t, n = false) {
       e instanceof NotReadyError ? l : c,
       e,
       undefined,
-      e instanceof NotReadyError ? t.ie : undefined
+      e instanceof NotReadyError ? t.re : undefined
     );
   } finally {
     E = w;
-    t._ = e;
+    t.m = e;
     Q = d;
   }
-  if (!t.Z) {
+  if (!t.Y) {
     const e = t.ke;
-    let r = e !== null ? e.L : t.N;
+    let r = e !== null ? e.N : t.j;
     if (r !== null) {
       do {
         r = unlinkSubs(r);
       } while (r !== null);
-      if (e !== null) e.L = null;
-      else t.N = null;
+      if (e !== null) e.N = null;
+      else t.j = null;
     }
-    const f = u ? t.ce : t.le === y ? t.ce : t.le;
+    const f = u ? t.le : t.fe === y ? t.le : t.fe;
     const l = !t.Se || !t.Se(f, p);
     if (l) {
-      const e = u ? t.ce : undefined;
-      if (n || (i && x !== t.re) || s) t.ce = p;
-      else t.le = p;
+      const e = u ? t.le : undefined;
+      if (n || (i && x !== t.ne) || s) t.le = p;
+      else t.fe = p;
       if (u && !s && a) {
         const e = t.ye || 0;
         const n = t.he || 0;
-        if (e <= n) t.ce = p;
+        if (e <= n) t.le = p;
       }
-      if (!u || s || t.ce !== e) {
+      if (!u || s || t.le !== e) {
         insertSubs(t, s || u);
       }
     } else if (u) {
-      t.le = p;
-    } else if (t.u != g) {
-      for (let e = t.P; e !== null; e = e.A) {
-        insertIntoHeapHeight(e.k, e.k._ & o ? b : _);
+      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);
       }
     }
   }
   R = S;
-  (!n || t.ae & l) && !t.re && !(x && t.ge) && A.B.push(t);
-  t.re && i && x !== t.re && runInTransition(t.re, () => recompute(t));
+  (!n || t.ce & l) && !t.ne && !(x && t.ge) && A.D.push(t);
+  t.ne && i && x !== t.ne && runInTransition(t.ne, () => recompute(t));
 }
 function updateIfNecessary(r) {
-  if (r._ & t) {
-    for (let e = r.N; e; e = e.L) {
-      const t = e.I;
-      const i = t.H || t;
-      if (i.R) {
+  if (r.m & t) {
+    for (let e = r.j; e; e = e.N) {
+      const t = e.L;
+      const i = t.I || t;
+      if (i.H) {
         updateIfNecessary(i);
       }
-      if (r._ & n) {
+      if (r.m & n) {
         break;
       }
     }
   }
-  if (r._ & (n | f) || (r.Z && r.ee < O)) {
+  if (r.m & (n | f) || (r.Y && r.$ < O)) {
     recompute(r);
   }
-  r._ = e;
+  r.m = e;
 }
 function computed(t, n, r) {
   const i = {
@@ -1078,33 +1078,33 @@ function computed(t, n, r) {
     Re: !!r?.pureWrite,
     He: r?.unobserved,
     Ee: null,
-    ue: Q?.ue ?? A,
+    oe: Q?.oe ?? A,
     Ne: Q?.Ne ?? w,
     je: 0,
-    R: t,
-    ce: n,
-    u: 0,
-    C: null,
-    S: undefined,
-    h: null,
-    N: null,
+    H: t,
+    le: n,
+    o: 0,
+    k: null,
+    h: undefined,
+    p: null,
+    j: null,
     ke: null,
-    P: null,
+    O: null,
     Ie: null,
-    o: Q,
+    i: Q,
     Ae: null,
     Pe: null,
-    _: e,
-    ae: a,
-    ee: O,
-    le: y,
+    m: e,
+    ce: a,
+    $: O,
+    fe: y,
     We: null,
     Ce: null,
     we: null,
-    re: null
+    ne: null
   };
-  i.h = i;
-  const s = Q?.i ? Q.l : Q;
+  i.p = i;
+  const s = Q?.t ? Q.u : Q;
   if (Q) {
     const e = Q.Pe;
     if (e === null) {
@@ -1114,7 +1114,7 @@ function computed(t, n, r) {
       Q.Pe = i;
     }
   }
-  if (s) i.u = s.u + 1;
+  if (s) i.o = s.o + 1;
   !r?.lazy && recompute(i, true);
   return i;
 }
@@ -1123,15 +1123,15 @@ function signal(e, t, n = null) {
     Se: t?.equals != null ? t.equals : isEqual,
     Re: !!t?.pureWrite,
     He: t?.unobserved,
-    ce: e,
-    P: null,
+    le: e,
+    O: null,
     Ie: null,
-    ee: O,
-    H: n,
-    W: n?.C || null,
-    le: y
+    $: O,
+    I: n,
+    C: n?.k || null,
+    fe: y
   };
-  n && (n.C = r);
+  n && (n.k = r);
   return r;
 }
 function optimisticSignal(e, t) {
@@ -1163,18 +1163,18 @@ function read(e) {
     H = false;
     const r = read(t);
     H = n;
-    if (t.ae & l) return e.ce;
-    if (j && R && t.ie) {
-      const n = findLane(t.ie);
+    if (t.ce & l) return e.le;
+    if (j && R && t.re) {
+      const n = findLane(t.re);
       const r = findLane(R);
-      if (n !== r && n.M.size > 0) {
-        return e.ce;
+      if (n !== r && n.T.size > 0) {
+        return e.le;
       }
     }
     return r;
   }
   if (L) {
-    const t = e.H || e;
+    const t = e.I || e;
     const n = getPendingSignal(t);
     const r = L;
     L = false;
@@ -1182,87 +1182,87 @@ function read(e) {
       I = true;
     }
     L = r;
-    return e.ce;
+    return e.le;
   }
   let t = Q;
-  if (t?.i) t = t.l;
-  if (N && e.R) recompute(e);
+  if (t?.t) t = t.u;
+  if (N && e.H) recompute(e);
   if (t && E) {
-    if (e.R && e._ & u) recompute(e);
+    if (e.H && e.m & u) recompute(e);
     link(e, t);
-    const n = e.H || e;
-    if (n.R) {
-      const r = e._ & o;
-      if (n.u >= (r ? b.j : _.j)) {
+    const n = e.I || e;
+    if (n.H) {
+      const r = e.m & o;
+      if (n.o >= (r ? _.W : b.W)) {
         markNode(t);
-        markHeap(r ? b : _);
+        markHeap(r ? _ : b);
         updateIfNecessary(n);
       }
-      const i = n.u;
-      if (i >= t.u && e.o !== t) {
-        t.u = i + 1;
+      const i = n.o;
+      if (i >= t.o && e.i !== t) {
+        t.o = i + 1;
       }
     }
   }
-  const n = e.H || e;
-  if (t && n.ae & l && !(j && n.re && x !== n.re)) {
+  const n = e.I || e;
+  if (t && n.ce & l && !(j && n.ne && x !== n.ne)) {
     if (R) {
-      const r = n.ie;
+      const r = n.re;
       const i = findLane(R);
       if (r && findLane(r) === i && !hasActiveOverride(n)) {
         if (!E) link(e, t);
-        throw n.Z;
+        throw n.Y;
       }
     } else {
       if (!E) link(e, t);
-      throw n.Z;
+      throw n.Y;
     }
   }
-  if (e.R && e.ae & c) {
-    if (e.ee < O) {
+  if (e.H && e.ce & c) {
+    if (e.$ < O) {
       recompute(e, true);
       return read(e);
-    } else throw e.Z;
+    } else throw e.Y;
   }
-  return !t || R !== null || e.le === y || (j && e.re && x !== e.re) ? e.ce : e.le;
+  return !t || R !== null || e.fe === y || (j && e.ne && x !== e.ne) ? e.le : e.fe;
 }
 function setSignal(e, t) {
-  if (e.re && x !== e.re) A.initTransition(e.re);
+  if (e.ne && x !== e.ne) A.initTransition(e.ne);
   const n = e.ge && !P;
-  const r = n ? e.ce : e.le === y ? e.ce : e.le;
+  const r = n ? e.le : e.fe === y ? e.le : e.fe;
   if (typeof t === "function") t = t(r);
   const i = !e.Se || !e.Se(r, t);
   if (!i) {
-    if (n && e.le !== y && e.R) {
+    if (n && e.fe !== y && e.H) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = A.G.includes(e);
-    if (e.re && n) {
-      A.initTransition(e.re);
+    const n = A.B.includes(e);
+    if (e.ne && n) {
+      A.initTransition(e.ne);
     }
-    if (e.le === y) {
-      e.le = e.ce;
+    if (e.fe === y) {
+      e.fe = e.le;
     }
     if (!n) {
-      A.G.push(e);
+      A.B.push(e);
     }
     e.ye = (e.ye || 0) + 1;
     const r = getOrCreateLane(e);
-    e.ie = r;
-    e.ce = t;
-  } else {
-    if (e.le === y) A.B.push(e);
+    e.re = r;
     e.le = t;
+  } else {
+    if (e.fe === y) A.D.push(e);
+    e.fe = t;
   }
   updatePendingSignal(e);
   if (e.me) {
     setSignal(e.me, t);
   }
-  e.ee = O;
+  e.$ = O;
   insertSubs(e, n);
   schedule();
   return t;
@@ -1291,32 +1291,32 @@ function getPendingSignal(e) {
 }
 function computePendingState(e) {
   const t = e;
-  if (e.ge && e.le !== y) {
-    if (t.ae & l && !(t.ae & a)) return true;
+  if (e.ge && e.fe !== y) {
+    if (t.ce & l && !(t.ce & a)) return true;
     if (e.de) {
-      const t = e.ie ? findLane(e.ie) : null;
-      return !!(t && t.M.size > 0);
+      const t = e.re ? findLane(e.re) : null;
+      return !!(t && t.T.size > 0);
     }
     return true;
   }
-  if (e.le !== y && !(t.ae & a)) return true;
-  return !!(t.ae & l && !(t.ae & a));
+  if (e.fe !== y && !(t.ce & a)) return true;
+  return !!(t.ce & l && !(t.ce & a));
 }
 function updatePendingSignal(e) {
   if (e.Te) {
     const t = computePendingState(e);
     const n = e.Te;
     setSignal(n, t);
-    if (!t && n.ie) {
+    if (!t && n.re) {
       const t = resolveLane(e);
-      if (t && t.M.size > 0) {
-        const e = findLane(n.ie);
+      if (t && t.T.size > 0) {
+        const e = findLane(n.re);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
       k.delete(n);
-      n.ie = undefined;
+      n.re = undefined;
     }
   }
 }
@@ -1425,11 +1425,11 @@ function action(e) {
       const i = e(...t);
       A.initTransition();
       let s = x;
-      s.te.push(i);
+      s.ee.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.te.indexOf(i);
-        if (o >= 0) s.te.splice(o, 1);
+        const o = s.ee.indexOf(i);
+        if (o >= 0) s.ee.splice(o, 1);
         setActiveTransition(s);
         schedule();
         t ? r(t) : n(e);
@@ -1528,7 +1528,8 @@ function onSettled(e) {
 function unwrap(e) {
   return e?.[F]?.[U] ?? e;
 }
-function getOverrideValue(e, t, n, r) {
+function getOverrideValue(e, t, n, r, i) {
+  if (i && r in i) return i[r];
   return t && r in t ? t[r] : e[r];
 }
 function getAllKeys(e, t, n) {
@@ -1541,108 +1542,110 @@ function applyState(e, t, n, r) {
   if (!i) return;
   const s = i[G];
   const o = i[K];
-  let u = i[U];
-  if (e === s && !o) return;
+  const u = i[z];
+  let f = i[U];
+  if (e === s && !o && !u) return;
   (i[Y] || ee).set(e, i[V]);
   i[G] = e;
   i[K] = undefined;
   if (Array.isArray(s)) {
     let t = false;
-    const f = getOverrideValue(s, o, u, "length");
-    if (e.length && f && e[0] && n(e[0]) != null) {
-      let l, c, a, d, p, h, y, g;
+    const l = getOverrideValue(s, o, f, "length", u);
+    if (e.length && l && e[0] && n(e[0]) != null) {
+      let c, a, d, p, h, y, g, w;
       for (
-        a = 0, d = Math.min(f, e.length);
-        a < d && ((h = getOverrideValue(s, o, u, a)) === e[a] || (h && e[a] && n(h) === n(e[a])));
-        a++
+        d = 0, p = Math.min(l, e.length);
+        d < p &&
+        ((y = getOverrideValue(s, o, f, d, u)) === e[d] || (y && e[d] && n(y) === n(e[d])));
+        d++
       ) {
-        applyState(e[a], wrap(h, i), n, r);
+        applyState(e[d], wrap(y, i), n, r);
       }
-      const w = new Array(e.length),
-        S = new Map();
+      const S = new Array(e.length),
+        m = new Map();
       for (
-        d = f - 1, p = e.length - 1;
-        d >= a &&
-        p >= a &&
-        ((h = getOverrideValue(s, o, u, d)) === e[p] || (h && e[p] && n(h) === n(e[p])));
-        d--, p--
+        p = l - 1, h = e.length - 1;
+        p >= d &&
+        h >= d &&
+        ((y = getOverrideValue(s, o, f, p, u)) === e[h] || (y && e[h] && n(y) === n(e[h])));
+        p--, h--
       ) {
-        w[p] = h;
+        S[h] = y;
       }
-      if (a > p || a > d) {
-        for (c = a; c <= p; c++) {
+      if (d > h || d > p) {
+        for (a = d; a <= h; a++) {
           t = true;
-          i[U][c] && setSignal(i[U][c], wrap(e[c], i));
+          i[U][a] && setSignal(i[U][a], wrap(e[a], i));
         }
-        for (; c < e.length; c++) {
+        for (; a < e.length; a++) {
           t = true;
-          const s = wrap(w[c], i);
-          i[U][c] && setSignal(i[U][c], s);
-          applyState(e[c], s, n, r);
+          const s = wrap(S[a], i);
+          i[U][a] && setSignal(i[U][a], s);
+          applyState(e[a], s, n, r);
         }
         t && i[U][M] && setSignal(i[U][M], void 0);
-        f !== e.length && i[U].length && setSignal(i[U].length, e.length);
+        l !== e.length && i[U].length && setSignal(i[U].length, e.length);
         return;
       }
-      y = new Array(p + 1);
-      for (c = p; c >= a; c--) {
-        h = e[c];
-        g = h ? n(h) : h;
-        l = S.get(g);
-        y[c] = l === undefined ? -1 : l;
-        S.set(g, c);
-      }
-      for (l = a; l <= d; l++) {
-        h = getOverrideValue(s, o, u, l);
-        g = h ? n(h) : h;
-        c = S.get(g);
-        if (c !== undefined && c !== -1) {
-          w[c] = h;
-          c = y[c];
-          S.set(g, c);
+      g = new Array(h + 1);
+      for (a = h; a >= d; a--) {
+        y = e[a];
+        w = y ? n(y) : y;
+        c = m.get(w);
+        g[a] = c === undefined ? -1 : c;
+        m.set(w, a);
+      }
+      for (c = d; c <= p; c++) {
+        y = getOverrideValue(s, o, f, c, u);
+        w = y ? n(y) : y;
+        a = m.get(w);
+        if (a !== undefined && a !== -1) {
+          S[a] = y;
+          a = g[a];
+          m.set(w, a);
         }
       }
-      for (c = a; c < e.length; c++) {
-        if (c in w) {
-          const t = wrap(w[c], i);
-          i[U][c] && setSignal(i[U][c], t);
-          applyState(e[c], t, n, r);
-        } else i[U][c] && setSignal(i[U][c], wrap(e[c], i));
+      for (a = d; a < e.length; a++) {
+        if (a in S) {
+          const t = wrap(S[a], i);
+          i[U][a] && setSignal(i[U][a], t);
+          applyState(e[a], t, n, r);
+        } else i[U][a] && setSignal(i[U][a], wrap(e[a], i));
       }
-      if (a < e.length) t = true;
+      if (d < e.length) t = true;
     } else if (e.length) {
-      for (let t = 0, f = e.length; t < f; t++) {
-        const f = getOverrideValue(s, o, u, t);
-        isWrappable(f) ? applyState(e[t], wrap(f, i), n, r) : i[U][t] && setSignal(i[U][t], e[t]);
+      for (let t = 0, l = e.length; t < l; t++) {
+        const l = getOverrideValue(s, o, f, t, u);
+        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[U][t] && setSignal(i[U][t], e[t]);
       }
     }
-    if (f !== e.length) {
+    if (l !== e.length) {
       t = true;
       i[U].length && setSignal(i[U].length, e.length);
     }
     t && i[U][M] && setSignal(i[U][M], void 0);
     return;
   }
-  if (u) {
-    const t = u[M];
-    const f = t || r ? getAllKeys(s, o, e) : Object.keys(u);
-    for (let l = 0, c = f.length; l < c; l++) {
-      const c = f[l];
-      const a = u[c];
-      const d = unwrap(getOverrideValue(s, o, u, c));
-      let p = unwrap(e[c]);
-      if (d === p) continue;
-      if (!d || !isWrappable(d) || !isWrappable(p) || (n(d) != null && n(d) !== n(p))) {
+  if (f) {
+    const t = f[M];
+    const l = t || r ? getAllKeys(s, o, e) : Object.keys(f);
+    for (let c = 0, a = l.length; c < a; c++) {
+      const a = l[c];
+      const d = f[a];
+      const p = unwrap(getOverrideValue(s, o, f, a, u));
+      let h = unwrap(e[a]);
+      if (p === h) continue;
+      if (!p || !isWrappable(p) || !isWrappable(h) || (n(p) != null && n(p) !== n(h))) {
         t && setSignal(t, void 0);
-        a && setSignal(a, isWrappable(p) ? wrap(p, i) : p);
-      } else applyState(p, wrap(d, i), n, r);
+        d && setSignal(d, isWrappable(h) ? wrap(h, i) : h);
+      } else applyState(h, wrap(p, i), n, r);
     }
   }
-  if ((u = i[J])) {
-    const t = Object.keys(u);
+  if ((f = i[J])) {
+    const t = Object.keys(f);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
-      setSignal(u[r], r in e);
+      setSignal(f[r], r in e);
     }
   }
 }
@@ -1833,7 +1836,7 @@ const re = {
       if (e && e.get) return e.get.call(n);
     }
     if (writeOnly(n)) {
-      let n = i && (o || !u) ? (i.le !== y ? (i.ge ? i.ce : i.le) : i.ce) : f[t];
+      let n = i && (o || !u) ? (i.fe !== y ? (i.ge ? i.le : i.fe) : i.le) : f[t];
       n === D && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
@@ -1865,8 +1868,8 @@ const re = {
     if (writeOnly(r)) {
       if (e[$]) {
         const t = e[Z];
-        if (t?.re) {
-          A.initTransition(t.re);
+        if (t?.ne) {
+          A.initTransition(t.ne);
         }
       }
       untrack(() => {
@@ -2040,7 +2043,7 @@ function deep(e) {
   return e[q];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.X ||= clearOptimisticStore;
+  GlobalQueue.J ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = (r ? t : e) ?? {};
   const s = r ? e : undefined;
@@ -2057,14 +2060,14 @@ function clearOptimisticStore(e) {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
-          r[e].ie = undefined;
+          r[e].re = undefined;
           const n = t[K] && e in t[K] ? t[K][e] : t[G][e];
           const i = n === D ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
       if (r[M]) {
-        r[M].ie = undefined;
+        r[M].re = undefined;
         setSignal(r[M], undefined);
       }
     }
@@ -2498,11 +2501,11 @@ function compare(e, t, n) {
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n._e = (e, t) => {
-    const r = e !== undefined ? e : n.ae;
-    const i = t !== undefined ? t : n.Z;
-    n.ae &= ~n.$e;
-    n.ue.notify(n, n.$e, r, i);
+  n.be = (e, t) => {
+    const r = e !== undefined ? e : n.ce;
+    const i = t !== undefined ? t : n.Y;
+    n.ce &= ~n.$e;
+    n.oe.notify(n, n.$e, r, i);
   };
   n.$e = t;
   n.Qe = true;
@@ -2510,9 +2513,9 @@ function boundaryComputed(e, t) {
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.ue;
-  i.addChild((e.ue = n));
-  onCleanup(() => i.removeChild(e.ue));
+  const i = e.oe;
+  i.addChild((e.oe = n));
+  onCleanup(() => i.removeChild(e.oe));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
@@ -2534,7 +2537,7 @@ class CollectionQueue extends Queue {
   notify(e, t, n, r) {
     if (!(t & this.et) || (this.et & l && this.rt)) return super.notify(e, t, n, r);
     if (n & this.et) {
-      const t = r?.t || e.Z?.t;
+      const t = r?.source || e.Y?.source;
       if (t) {
         const e = this.tt.size === 0;
         this.tt.add(t);
@@ -2546,7 +2549,7 @@ class CollectionQueue extends Queue {
   }
   checkSources() {
     for (const e of this.tt) {
-      if (!(e.ae & this.et)) this.tt.delete(e);
+      if (!(e.ce & this.et)) this.tt.delete(e);
     }
     if (!this.tt.size) setSignal(this.nt, false);
   }
@@ -2573,7 +2576,7 @@ function createLoadBoundary(e, t) {
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
     let n = e.tt.values().next().value;
-    const r = n.Z?.cause ?? n.Z;
+    const r = n.Y?.cause ?? n.Y;
     return t(r, () => {
       for (const t of e.tt) recompute(t);
       schedule();