@solidjs/signals 2.0.0-beta.8 → 2.0.0-beta.9

package/dist/node.cjs

@@ -37,15 +37,21 @@ const c = 1 << 9;
 const a = 1 << 0;
 const d = 1 << 1;
 const h = 1 << 2;
-const p = 1;
-const y = 2;
-const g = 3;
-const S = {};
-const w = {};
-const m = "sp";
-const b = typeof Proxy === "function";
-const _ = {};
-const O = Symbol("refresh");
+const p = 1 << 3;
+const y = 1 << 4;
+const g = 1 << 5;
+const S = 1 << 0;
+const w = 1 << 1;
+const m = 1 << 2;
+const b = 1;
+const _ = 2;
+const O = 3;
+const v = {};
+const x = {};
+const P = "sp";
+const k = typeof Proxy === "function";
+const E = {};
+const C = Symbol("refresh");
 function actualInsertIntoHeap(e, t) {
   const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
   if (n >= e.o) e.o = n + 1;
@@ -142,38 +148,38 @@ function adjustHeight(e, t) {
     }
   }
 }
-const v = undefined;
-const x = new Set();
-const P = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
-const k = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
-let E = 0;
-let C = null;
-let N = false;
-let W = false;
-let j = null;
-const R = new Set();
+const N = undefined;
+const W = new Set();
+const j = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+const R = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+let A = 0;
+let L = null;
+let I = false;
+let T = false;
+let H = null;
+const Q = new Set();
 function registerTransientStoreNode(e) {
-  R.add(e);
+  Q.add(e);
 }
 function sweepTransientStoreNodes() {
-  if (R.size === 0) return;
-  for (const e of R) {
+  if (Q.size === 0) return;
+  for (const e of Q) {
     if (e.O !== null) {
-      R.delete(e);
+      Q.delete(e);
       continue;
     }
-    if (e.T !== S) continue;
-    if (e.H !== undefined && e.H !== S) continue;
-    R.delete(e);
+    if (e.T !== v) continue;
+    if (e.H !== undefined && e.H !== v) continue;
+    Q.delete(e);
     e.q?.();
   }
 }
 function enforceLoadingBoundary(e) {}
 function shouldReadStashedOptimisticValue(e) {
-  return !!j?.has(e);
+  return !!H?.has(e);
 }
 function runLaneEffects(e) {
-  for (const t of I) {
+  for (const t of D) {
     if (t.M || t.D.size > 0) continue;
     const n = t.F[e - 1];
     if (n.length) {
@@ -186,25 +192,25 @@ function queueStashedOptimisticEffects(e) {
   for (let t = e.O; t !== null; t = t.P) {
     const e = t.k;
     if (!e.V) continue;
-    if (e.V === g) {
+    if (e.V === O) {
       if (!e.B) {
         e.B = true;
-        e.K.enqueue(y, e.G);
+        e.K.enqueue(_, e.G);
       }
       continue;
     }
-    const n = e.m & o ? k : P;
+    const n = e.m & o ? R : j;
     if (n.W > e.o) n.W = e.o;
     insertIntoHeap(e, n);
   }
 }
 function setProjectionWriteActive(e) {
-  W = e;
+  T = e;
 }
 function mergeTransitionState(e, t) {
   t.U = e;
   e.J.push(...t.J);
-  for (const n of I) if (n.X === t) n.X = e;
+  for (const n of D) if (n.X === t) n.X = e;
   e.Y.push(...t.Y);
   for (const n of t.Z) e.Z.add(n);
   for (const [n, r] of t.$) {
@@ -212,56 +218,57 @@ function mergeTransitionState(e, t) {
     if (!t) e.$.set(n, (t = new Set()));
     for (const e of r) t.add(e);
   }
+  for (const n of t.ee) e.ee.add(n);
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.ee = undefined;
-    if (n.T !== S) {
-      n.te = n.T;
-      n.T = S;
+    n.te = undefined;
+    if (n.T !== v) {
+      n.ne = n.T;
+      n.T = v;
     }
     const r = n.H;
-    n.H = S;
-    if (r !== S && n.te !== r) insertSubs(n, true);
+    n.H = v;
+    if (r !== v && n.ne !== r) insertSubs(n, true);
     n.X = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
-  for (const t of I) {
+  for (const t of D) {
     const n = e ? t.X === e : !t.X;
     if (!n) continue;
     if (!t.M) {
-      if (t.F[0].length) runQueue(t.F[0], p);
-      if (t.F[1].length) runQueue(t.F[1], y);
+      if (t.F[0].length) runQueue(t.F[0], b);
+      if (t.F[1].length) runQueue(t.F[1], _);
     }
-    if (t.ne.ee === t) t.ne.ee = undefined;
+    if (t.re.te === t) t.re.te = undefined;
     t.D.clear();
     t.F[0].length = 0;
     t.F[1].length = 0;
-    I.delete(t);
-    L.delete(t.ne);
+    D.delete(t);
+    M.delete(t.re);
   }
 }
 function schedule() {
-  if (N) return;
-  N = true;
-  if (!A.re && !W) queueMicrotask(flush);
+  if (I) return;
+  I = true;
+  if (!q.ie && !T) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  ie = [[], []];
-  se = [];
-  created = E;
+  se = [[], []];
+  oe = [];
+  created = A;
   addChild(e) {
-    this.se.push(e);
+    this.oe.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.se.indexOf(e);
+    const t = this.oe.indexOf(e);
     if (t >= 0) {
-      this.se.splice(t, 1);
+      this.oe.splice(t, 1);
       e.i = null;
     }
   }
@@ -270,122 +277,122 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.ie[e - 1].length) {
-      const t = this.ie[e - 1];
-      this.ie[e - 1] = [];
+    if (this.se[e - 1].length) {
+      const t = this.se[e - 1];
+      this.se[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.se.length; t++) this.se[t].run?.(e);
+    for (let t = 0; t < this.oe.length; t++) this.oe[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
-      if (K) {
-        const n = findLane(K);
+      if (Y) {
+        const n = findLane(Y);
         n.F[e - 1].push(t);
       } else {
-        this.ie[e - 1].push(t);
+        this.se[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.ie[0].push(...this.ie[0]);
-    e.ie[1].push(...this.ie[1]);
-    this.ie = [[], []];
-    for (let t = 0; t < this.se.length; t++) {
-      let n = this.se[t];
-      let r = e.se[t];
+    e.se[0].push(...this.se[0]);
+    e.se[1].push(...this.se[1]);
+    this.se = [[], []];
+    for (let t = 0; t < this.oe.length; t++) {
+      let n = this.oe[t];
+      let r = e.oe[t];
       if (!r) {
-        r = { ie: [[], []], se: [] };
-        e.se[t] = r;
+        r = { se: [[], []], oe: [] };
+        e.oe[t] = r;
       }
       n.stashQueues(r);
     }
   }
   restoreQueues(e) {
-    this.ie[0].push(...e.ie[0]);
-    this.ie[1].push(...e.ie[1]);
-    for (let t = 0; t < e.se.length; t++) {
-      const n = e.se[t];
-      let r = this.se[t];
+    this.se[0].push(...e.se[0]);
+    this.se[1].push(...e.se[1]);
+    for (let t = 0; t < e.oe.length; t++) {
+      const n = e.oe[t];
+      let r = this.oe[t];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  re = false;
-  oe = [];
+  ie = false;
+  ue = [];
   Y = [];
   Z = new Set();
-  static ue;
   static fe;
-  static le = null;
+  static le;
+  static ce = null;
   flush() {
-    if (this.re) return;
-    this.re = true;
+    if (this.ie) return;
+    this.ie = true;
     try {
-      runHeap(P, GlobalQueue.ue);
-      if (C) {
-        const e = transitionComplete(C);
+      runHeap(j, GlobalQueue.fe);
+      if (L) {
+        const e = transitionComplete(L);
         if (!e) {
-          const e = C;
-          runHeap(k, GlobalQueue.ue);
-          this.oe = [];
+          const e = L;
+          runHeap(R, GlobalQueue.fe);
+          this.ue = [];
           this.Y = [];
           this.Z = new Set();
-          runLaneEffects(p);
-          runLaneEffects(y);
-          this.stashQueues(e.ce);
-          E++;
-          N = P.S >= P.W;
-          reassignPendingTransition(e.oe);
-          C = null;
-          if (!e.J.length && e.Y.length) {
-            j = new Set();
+          runLaneEffects(b);
+          runLaneEffects(_);
+          this.stashQueues(e.ae);
+          A++;
+          I = j.S >= j.W;
+          reassignPendingTransition(e.ue);
+          L = null;
+          if (!e.J.length && !e.$.size && e.Y.length) {
+            H = new Set();
             for (let t = 0; t < e.Y.length; t++) {
               const n = e.Y[t];
-              if (n.I || n.ae) continue;
-              j.add(n);
+              if (n.I || n.de & a) continue;
+              H.add(n);
               queueStashedOptimisticEffects(n);
             }
           }
           try {
             finalizePureQueue(null, true);
           } finally {
-            j = null;
+            H = null;
           }
           return;
         }
-        this.oe !== C.oe && this.oe.push(...C.oe);
-        this.restoreQueues(C.ce);
-        x.delete(C);
-        const t = C;
-        C = null;
-        reassignPendingTransition(this.oe);
+        this.ue !== L.ue && this.ue.push(...L.ue);
+        this.restoreQueues(L.ae);
+        W.delete(L);
+        const t = L;
+        L = null;
+        reassignPendingTransition(this.ue);
         finalizePureQueue(t);
       } else {
-        if (x.size) runHeap(k, GlobalQueue.ue);
+        if (W.size) runHeap(R, GlobalQueue.fe);
         finalizePureQueue();
       }
-      E++;
-      N = P.S >= P.W;
-      runLaneEffects(p);
-      this.run(p);
-      runLaneEffects(y);
-      this.run(y);
+      A++;
+      I = j.S >= j.W;
+      runLaneEffects(b);
+      this.run(b);
+      runLaneEffects(_);
+      this.run(_);
       if (false);
     } finally {
-      this.re = false;
+      this.ie = false;
     }
   }
   notify(e, t, n, r) {
-    if (t & a) {
-      if (n & a) {
-        const t = r !== undefined ? r : e.de;
-        if (C && t) {
+    if (t & S) {
+      if (n & S) {
+        const t = r !== undefined ? r : e.he;
+        if (L && t) {
           const n = t.source;
-          let r = C.$.get(n);
-          if (!r) C.$.set(n, (r = new Set()));
+          let r = L.$.get(n);
+          if (!r) L.$.set(n, (r = new Set()));
           const i = r.size;
           r.add(e);
           if (r.size !== i) schedule();
@@ -397,57 +404,58 @@ class GlobalQueue extends Queue {
   }
   initTransition(e) {
     if (e) e = currentTransition(e);
-    if (e && e === C) return;
-    if (!e && C && C.he === E) return;
-    if (!C) {
-      C = e ?? {
-        he: E,
-        oe: [],
+    if (e && e === L) return;
+    if (!e && L && L.pe === A) return;
+    if (!L) {
+      L = e ?? {
+        pe: A,
+        ue: [],
         $: new Map(),
         Y: [],
         Z: new Set(),
         J: [],
-        ce: { ie: [[], []], se: [] },
-        U: false
+        ae: { se: [[], []], oe: [] },
+        U: false,
+        ee: new Set()
       };
     } else if (e) {
-      const t = C;
+      const t = L;
       mergeTransitionState(e, t);
-      x.delete(t);
-      C = e;
+      W.delete(t);
+      L = e;
     }
-    x.add(C);
-    C.he = E;
-    if (this.oe !== C.oe) {
-      for (let e = 0; e < this.oe.length; e++) {
-        const t = this.oe[e];
-        t.X = C;
-        C.oe.push(t);
+    W.add(L);
+    L.pe = A;
+    if (this.ue !== L.ue) {
+      for (let e = 0; e < this.ue.length; e++) {
+        const t = this.ue[e];
+        t.X = L;
+        L.ue.push(t);
       }
-      this.oe = C.oe;
+      this.ue = L.ue;
     }
-    if (this.Y !== C.Y) {
+    if (this.Y !== L.Y) {
       for (let e = 0; e < this.Y.length; e++) {
         const t = this.Y[e];
-        t.X = C;
-        C.Y.push(t);
+        t.X = L;
+        L.Y.push(t);
       }
-      this.Y = C.Y;
+      this.Y = L.Y;
     }
-    for (const e of I) {
-      if (!e.X) e.X = C;
+    for (const e of D) {
+      if (!e.X) e.X = L;
     }
-    if (this.Z !== C.Z) {
-      for (const e of this.Z) C.Z.add(e);
-      this.Z = C.Z;
+    if (this.Z !== L.Z) {
+      for (const e of this.Z) L.Z.add(e);
+      this.Z = L.Z;
     }
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.ee || K;
-  const r = e.pe !== undefined;
+  const n = e.te || Y;
+  const r = e.ye !== undefined;
   for (let i = e.O; i !== null; i = i.P) {
-    if (r && i.k.ye) {
+    if (r && i.k.de & p) {
       i.k.m |= l;
       continue;
     }
@@ -456,47 +464,63 @@ function insertSubs(e, t = false) {
       assignOrMergeLane(i.k, n);
     } else if (t) {
       i.k.m |= f;
-      i.k.ee = undefined;
+      i.k.te = undefined;
     }
     const e = i.k;
-    if (e.V === g) {
+    if (e.V === O) {
       if (!e.B) {
         e.B = true;
-        e.K.enqueue(y, e.G);
+        e.K.enqueue(_, e.G);
       }
       continue;
     }
-    const s = i.k.m & o ? k : P;
+    const s = i.k.m & o ? R : j;
     if (s.W > i.k.o) s.W = i.k.o;
     insertIntoHeap(i.k, s);
   }
 }
 function commitPendingNodes() {
-  const e = A.oe;
+  const e = q.ue;
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    if (n.T !== S) {
-      n.te = n.T;
-      n.T = S;
-      if (n.V && n.V !== g) n.B = true;
+    if (n.T !== v) {
+      n.ne = n.T;
+      n.T = v;
+      if (n.V && n.V !== O) n.B = true;
     }
-    if (!(n.ge & a)) n.ge &= ~h;
-    if (n.I) GlobalQueue.fe(n, false, true);
+    if (!(n.ge & S)) n.ge &= ~m;
+    if (n.I) GlobalQueue.le(n, false, true);
   }
   e.length = 0;
 }
 function finalizePureQueue(e = null, t = false) {
   const n = !t;
   if (n) commitPendingNodes();
-  if (!t) checkBoundaryChildren(A);
-  if (P.S >= P.W) runHeap(P, GlobalQueue.ue);
+  if (!t) checkBoundaryChildren(q);
+  if (j.S >= j.W) runHeap(j, GlobalQueue.fe);
   if (n) {
     commitPendingNodes();
-    resolveOptimisticNodes(e ? e.Y : A.Y);
-    const t = e ? e.Z : A.Z;
-    if (GlobalQueue.le && t.size) {
+    resolveOptimisticNodes(e ? e.Y : q.Y);
+    if (e && e.ee.size) {
+      for (const t of e.ee) {
+        if (t.m & u) continue;
+        if (t.V === O) {
+          if (!t.B) {
+            t.B = true;
+            t.K.enqueue(_, t.G);
+          }
+          continue;
+        }
+        const e = t.m & o ? R : j;
+        if (e.W > t.o) e.W = t.o;
+        insertIntoHeap(t, e);
+      }
+      e.ee.clear();
+    }
+    const t = e ? e.Z : q.Z;
+    if (GlobalQueue.ce && t.size) {
       for (const e of t) {
-        GlobalQueue.le(e);
+        GlobalQueue.ce(e);
       }
       t.clear();
       schedule();
@@ -506,27 +530,27 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.se) {
+  for (const t of e.oe) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  A.Z.add(e);
+  q.Z.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].X = C;
+    e[t].X = L;
   }
 }
-const A = new GlobalQueue();
+const q = new GlobalQueue();
 function flush() {
-  if (A.re) {
+  if (q.ie) {
     return;
   }
-  while (N || C) {
-    A.flush();
+  while (I || L) {
+    q.flush();
   }
 }
 function runQueue(e, t) {
@@ -542,7 +566,7 @@ function reporterBlocksSource(e, t) {
       e = e.me;
     }
   }
-  return !!(e.ge & a && e.de instanceof NotReadyError && e.de.source === t);
+  return !!(e.ge & S && e.he instanceof NotReadyError && e.he.source === t);
 }
 function transitionComplete(e) {
   if (e.U) return true;
@@ -558,7 +582,7 @@ function transitionComplete(e) {
       r.delete(e);
     }
     if (!i) e.$.delete(n);
-    else if (n.ge & a && n.de?.source === n) {
+    else if (n.ge & S && n.he?.source === n) {
       t = false;
       break;
     }
@@ -569,9 +593,9 @@ function transitionComplete(e) {
       if (
         hasActiveOverride(r) &&
         "ge" in r &&
-        r.ge & a &&
-        r.de instanceof NotReadyError &&
-        r.de.source !== r
+        r.ge & S &&
+        r.he instanceof NotReadyError &&
+        r.he.source !== r
       ) {
         t = false;
         break;
@@ -586,29 +610,29 @@ function currentTransition(e) {
   return e;
 }
 function setActiveTransition(e) {
-  C = e;
+  L = e;
 }
 function runInTransition(e, t) {
-  const n = C;
+  const n = L;
   try {
-    C = currentTransition(e);
+    L = currentTransition(e);
     return t();
   } finally {
-    C = n;
+    L = n;
   }
 }
-const L = new WeakMap();
-const I = new Set();
+const M = new WeakMap();
+const D = new Set();
 function getOrCreateLane(e) {
-  let t = L.get(e);
+  let t = M.get(e);
   if (t) {
     return findLane(t);
   }
   const n = e.me;
-  const r = n?.ee ? findLane(n.ee) : null;
-  t = { ne: e, D: new Set(), F: [[], []], M: null, X: C, be: r };
-  L.set(e, t);
-  I.add(t);
+  const r = n?.te ? findLane(n.te) : null;
+  t = { re: e, D: new Set(), F: [[], []], M: null, X: L, be: r };
+  M.set(e, t);
+  D.add(t);
   e._e = false;
   return t;
 }
@@ -627,39 +651,39 @@ function mergeLanes(e, t) {
   return e;
 }
 function resolveLane(e) {
-  const t = e.ee;
+  const t = e.te;
   if (!t) return undefined;
   const n = findLane(t);
-  if (I.has(n)) return n;
-  e.ee = undefined;
+  if (D.has(n)) return n;
+  e.te = undefined;
   return undefined;
 }
 function resolveTransition(e) {
   return resolveLane(e)?.X ?? e.X;
 }
 function hasActiveOverride(e) {
-  return !!(e.H !== undefined && e.H !== S);
+  return !!(e.H !== undefined && e.H !== v);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const r = e.ee;
+  const r = e.te;
   if (r) {
     if (r.M) {
-      e.ee = t;
+      e.te = t;
       return;
     }
     const i = findLane(r);
-    if (I.has(i)) {
+    if (D.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
         if (n.be && findLane(n.be) === i) {
-          e.ee = t;
+          e.te = t;
         } else if (i.be && findLane(i.be) === n);
         else mergeLanes(n, i);
       }
       return;
     }
   }
-  e.ee = t;
+  e.te = t;
 }
 function unlinkSubs(e) {
   const t = e.A;
@@ -673,43 +697,44 @@ function unlinkSubs(e) {
     t.O = r;
     if (r === null) {
       t.q?.();
-      t.I && !t.xe && !(t.m & o) && unobserved(t);
+      const e = t;
+      e.I && e.de & g && !(e.m & o) && unobserved(e);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? k : P);
+  deleteFromHeap(e, e.m & o ? R : j);
   let t = e.j;
   while (t !== null) {
     t = unlinkSubs(t);
   }
   e.j = null;
-  e.Pe = null;
+  e.xe = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.Pe;
+  const n = t.xe;
   if (n !== null && n.A === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
     i = n !== null ? n.R : t.j;
     if (i !== null && i.A === e) {
-      t.Pe = i;
+      t.xe = i;
       return;
     }
   }
   const o = e.ve;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Pe = e.ve = { A: e, k: t, R: i, Oe: o, P: null });
+  const u = (t.xe = e.ve = { A: e, k: t, R: i, Oe: o, P: null });
   if (n !== null) n.R = u;
   else t.j = u;
   if (o !== null) o.P = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
-  const n = t.Pe;
+  const n = t.xe;
   if (n !== null) {
     let r = t.j;
     do {
@@ -720,17 +745,17 @@ function isValidLink(e, t) {
   }
   return false;
 }
-const T = {};
+const F = {};
 function markDisposal(e) {
-  let t = e.ke;
+  let t = e.Pe;
   while (t) {
     t.m |= o;
     if (t.m & i) {
-      deleteFromHeap(t, P);
-      insertIntoHeap(t, k);
+      deleteFromHeap(t, j);
+      insertIntoHeap(t, R);
     }
     markDisposal(t);
-    t = t.Ee;
+    t = t.ke;
   }
 }
 function dispose(e) {
@@ -739,39 +764,39 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.j = null;
-  e.Pe = null;
+  e.xe = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
-  if (t && e.I) e.Ce = null;
-  let r = n ? e.Ne : e.ke;
+  if (t && e.I) e.Ee = null;
+  let r = n ? e.Ce : e.Pe;
   while (r) {
-    const e = r.Ee;
+    const e = r.ke;
     if (r.j) {
       const e = r;
-      deleteFromHeap(e, e.m & o ? k : P);
+      deleteFromHeap(e, e.m & o ? R : j);
       let t = e.j;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
       e.j = null;
-      e.Pe = null;
+      e.xe = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.Ne = null;
+    e.Ce = null;
   } else {
-    e.ke = null;
-    e.We = 0;
+    e.Pe = null;
+    e.Ne = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.je : e.Re;
+  let n = t ? e.We : e.je;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -781,12 +806,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.je = null) : (e.Re = null);
+  t ? (e.We = null) : (e.je = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.Ae && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.We++ : n.We);
+  while (n.de & h && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.Ne++ : n.Ne);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -801,50 +826,50 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (D || V) return T;
-  return Q ? B : null;
+  if (z || J) return F;
+  return B ? X : null;
 }
 function getOwner() {
-  return B;
+  return X;
 }
 function cleanup(e) {
-  if (!B) return e;
-  if (!B.Re) B.Re = e;
-  else if (Array.isArray(B.Re)) B.Re.push(e);
-  else B.Re = [B.Re, e];
+  if (!X) return e;
+  if (!X.je) X.je = e;
+  else if (Array.isArray(X.je)) X.je.push(e);
+  else X.je = [X.je, e];
   return e;
 }
 function isDisposed(e) {
   return !!(e.m & (u | o));
 }
 function createOwner(e) {
-  const t = B;
+  const t = X;
   const n = e?.transparent ?? false;
   const r = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    Ae: n || undefined,
+    de: n ? h : 0,
     t: true,
     u: t?.t ? t.u : t,
+    Pe: null,
     ke: null,
-    Ee: null,
-    Re: null,
-    K: t?.K ?? A,
-    Le: t?.Le || _,
-    We: 0,
     je: null,
-    Ne: null,
+    K: t?.K ?? q,
+    Re: t?.Re || E,
+    Ne: 0,
+    We: null,
+    Ce: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
     }
   };
   if (t) {
-    const e = t.ke;
+    const e = t.Pe;
     if (e === null) {
-      t.ke = r;
+      t.Pe = r;
     } else {
-      r.Ee = e;
-      t.ke = r;
+      r.ke = e;
+      t.Pe = r;
     }
   }
   return r;
@@ -889,16 +914,16 @@ function clearPendingSources(e) {
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.de = null;
+    e.he = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.de = n;
+    e.he = n;
     return;
   }
-  const r = e.de;
+  const r = e.he;
   if (!(r instanceof NotReadyError) || r.source !== t) {
-    e.de = new NotReadyError(t);
+    e.he = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
@@ -913,30 +938,30 @@ function settlePendingSource(e) {
   const settle = r => {
     if (n.has(r) || !removePendingSource(r, e)) return;
     n.add(r);
-    r.he = E;
+    r.pe = A;
     const i = r.Se ?? r.we?.values().next().value;
     if (i) {
       setPendingError(r, i);
       updatePendingSignal(r);
     } else {
-      r.ge &= ~a;
+      r.ge &= ~S;
       setPendingError(r);
       updatePendingSignal(r);
-      if (r.Ie) {
-        if (r.V === g) {
+      if (r.Ae) {
+        if (r.V === O) {
           const e = r;
           if (!e.B) {
             e.B = true;
-            e.K.enqueue(y, e.G);
+            e.K.enqueue(_, e.G);
           }
         } else {
-          const e = r.m & o ? k : P;
+          const e = r.m & o ? R : j;
           if (e.W > r.o) e.W = r.o;
           insertIntoHeap(r, e);
         }
         t = true;
       }
-      r.Ie = false;
+      r.Ae = false;
     }
     forEachDependent(r, settle);
   };
@@ -948,42 +973,42 @@ function handleAsync(e, t, r) {
   const s = i && untrack(() => t[Symbol.asyncIterator]);
   const o = !s && i && untrack(() => typeof t.then === "function");
   if (!o && !s) {
-    e.Ce = null;
+    e.Ee = null;
     return t;
   }
-  e.Ce = t;
+  e.Ee = t;
   let u;
   const handleError = n => {
-    if (e.Ce !== t) return;
-    A.initTransition(resolveTransition(e));
-    notifyStatus(e, n instanceof NotReadyError ? a : d, n);
-    e.he = E;
+    if (e.Ee !== t) return;
+    q.initTransition(resolveTransition(e));
+    notifyStatus(e, n instanceof NotReadyError ? S : w, n);
+    e.pe = A;
   };
   const asyncWrite = (i, s) => {
-    if (e.Ce !== t) return;
+    if (e.Ee !== t) return;
     if (e.m & (n | f)) return;
-    A.initTransition(resolveTransition(e));
-    const o = !!(e.ge & h);
+    q.initTransition(resolveTransition(e));
+    const o = !!(e.ge & m);
     clearStatus(e);
     const u = resolveLane(e);
     if (u) u.D.delete(e);
     if (r) r(i);
     else if (e.H !== undefined) {
-      if (e.H !== undefined && e.H !== S) e.T = i;
+      if (e.H !== undefined && e.H !== v) e.T = i;
       else {
-        e.te = i;
+        e.ne = i;
         insertSubs(e);
       }
-      e.he = E;
+      e.pe = A;
     } else if (u) {
       const t = e.V;
-      const n = e.te;
-      const r = e.Te;
+      const n = e.ne;
+      const r = e.Le;
       if ((!t && o) || !r || !r(i, n)) {
-        e.te = i;
-        e.he = E;
-        if (e.He) {
-          setSignal(e.He, i);
+        e.ne = i;
+        e.pe = A;
+        if (e.Ie) {
+          setSignal(e.Ie, i);
         }
         insertSubs(e, true);
       }
@@ -1011,8 +1036,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      A.initTransition(resolveTransition(e));
-      throw new NotReadyError(B);
+      q.initTransition(resolveTransition(e));
+      throw new NotReadyError(X);
     }
   }
   if (s) {
@@ -1039,7 +1064,7 @@ function handleAsync(e, t, r) {
             s = n;
             o = true;
             if (n.done) i = true;
-          } else if (e.Ce !== t) {
+          } else if (e.Ee !== t) {
             return;
           } else if (!n.done) asyncWrite(n.value, iterate);
           else {
@@ -1049,7 +1074,7 @@ function handleAsync(e, t, r) {
           }
         },
         n => {
-          if (!f && e.Ce === t) {
+          if (!f && e.Ee === t) {
             i = true;
             handleError(n);
           }
@@ -1065,36 +1090,36 @@ function handleAsync(e, t, r) {
     };
     const s = iterate();
     if (!r && !s) {
-      A.initTransition(resolveTransition(e));
-      throw new NotReadyError(B);
+      q.initTransition(resolveTransition(e));
+      throw new NotReadyError(X);
     }
   }
   return u;
 }
 function clearStatus(e, t = false) {
   clearPendingSources(e);
-  e.Ie = false;
-  e.ge = t ? 0 : e.ge & h;
+  e.Ae = false;
+  e.ge = t ? 0 : e.ge & m;
   setPendingError(e);
   updatePendingSignal(e);
-  e.Qe?.();
+  e.Te?.();
 }
 function notifyStatus(e, t, n, r, i) {
-  if (t === d && !(n instanceof StatusError) && !(n instanceof NotReadyError))
+  if (t === w && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
-  const s = t === a && n instanceof NotReadyError ? n.source : undefined;
+  const s = t === S && n instanceof NotReadyError ? n.source : undefined;
   const o = s === e;
-  const u = t === a && e.H !== undefined && !o;
+  const u = t === S && e.H !== undefined && !o;
   const f = u && hasActiveOverride(e);
   if (!r) {
-    if (t === a && s) {
+    if (t === S && s) {
       addPendingSource(e, s);
-      e.ge = a | (e.ge & h);
+      e.ge = S | (e.ge & m);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.ge = t | (t !== d ? e.ge & h : 0);
-      e.de = n;
+      e.ge = t | (t !== w ? e.ge & m : 0);
+      e.he = n;
     }
     updatePendingSignal(e);
   }
@@ -1103,34 +1128,34 @@ function notifyStatus(e, t, n, r, i) {
   }
   const l = r || f;
   const c = r || u ? undefined : i;
-  if (e.Qe) {
-    if (r && t === a) {
+  if (e.Te) {
+    if (r && t === S) {
       return;
     }
     if (l) {
-      e.Qe(t, n);
+      e.Te(t, n);
     } else {
-      e.Qe();
+      e.Te();
     }
     return;
   }
   forEachDependent(e, e => {
-    e.he = E;
+    e.pe = A;
     if (
-      (t === a && s && e.Se !== s && !e.we?.has(s)) ||
-      (t !== a && (e.de !== n || e.Se || e.we))
+      (t === S && s && e.Se !== s && !e.we?.has(s)) ||
+      (t !== S && (e.he !== n || e.Se || e.we))
     ) {
-      if (!l && !e.X) A.oe.push(e);
+      if (!l && !e.X) q.ue.push(e);
       notifyStatus(e, t, n, l, c);
     }
   });
 }
-let H = null;
+let V = null;
 function enableExternalSource(e) {
   const { factory: t, untrack: n = e => e() } = e;
-  if (H) {
-    const { factory: e, untrack: r } = H;
-    H = {
+  if (V) {
+    const { factory: e, untrack: r } = V;
+    V = {
       factory: (n, r) => {
         const i = e(n, r);
         const s = t(e => i.track(e), r);
@@ -1145,139 +1170,153 @@ function enableExternalSource(e) {
       untrack: e => r(() => n(e))
     };
   } else {
-    H = { factory: t, untrack: n };
-  }
-}
-GlobalQueue.ue = recompute;
-GlobalQueue.fe = disposeChildren;
-let Q = false;
-let q = false;
-let M = false;
-let D = false;
-let F = false;
-let V = false;
-let B = null;
-let K = null;
+    V = { factory: t, untrack: n };
+  }
+}
+GlobalQueue.fe = recompute;
+GlobalQueue.le = disposeChildren;
+let B = false;
+let K = false;
 let G = false;
-let z = null;
+let z = false;
+let U = false;
+let J = false;
+let X = null;
+let Y = null;
+let Z = false;
+let $ = null;
 function ownerInSnapshotScope(e) {
   while (e) {
-    if (e.qe) return true;
+    if (e.He) return true;
     e = e.i;
   }
   return false;
 }
 function setSnapshotCapture(e) {
-  G = e;
-  if (e && !z) z = new Set();
+  Z = e;
+  if (e && !$) $ = new Set();
 }
 function markSnapshotScope(e) {
-  e.qe = true;
+  e.He = true;
 }
 function releaseSnapshotScope(e) {
-  e.qe = false;
+  e.He = false;
   releaseSubtree(e);
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.ke;
+  let t = e.Pe;
   while (t) {
-    if (t.qe) {
-      t = t.Ee;
+    if (t.He) {
+      t = t.ke;
       continue;
     }
     if (t.I) {
       const e = t;
-      e.ye = false;
+      e.de &= ~p;
       if (e.m & l) {
         e.m &= ~l;
         e.m |= n;
-        if (P.W > e.o) P.W = e.o;
-        insertIntoHeap(e, P);
+        if (j.W > e.o) j.W = e.o;
+        insertIntoHeap(e, j);
       }
     }
     releaseSubtree(t);
-    t = t.Ee;
+    t = t.ke;
   }
 }
 function clearSnapshots() {
-  if (z) {
-    for (const e of z) {
-      delete e.pe;
-      delete e[m];
+  if ($) {
+    for (const e of $) {
+      delete e.ye;
+      delete e[P];
     }
-    z = null;
+    $ = null;
   }
-  G = false;
+  Z = false;
 }
 function recompute(t, n = false) {
   const i = t.V;
   if (!n) {
-    if (t.X && (!i || C) && C !== t.X) A.initTransition(t.X);
-    deleteFromHeap(t, t.m & o ? k : P);
-    t.Ce = null;
-    if (t.X || i === g) disposeChildren(t);
+    if (t.X && (!i || L) && L !== t.X) q.initTransition(t.X);
+    deleteFromHeap(t, t.m & o ? R : j);
+    t.Ee = null;
+    if (t.X || i === O) disposeChildren(t);
     else {
       markDisposal(t);
-      t.je = t.Re;
-      t.Ne = t.ke;
-      t.Re = null;
-      t.ke = null;
-      t.We = 0;
-    }
-  }
-  const s = !!(t.m & f);
-  const u = t.H !== undefined && t.H !== S;
-  const c = !!(t.ge & a);
-  const p = !!(t.ge & h);
-  const y = B;
-  B = t;
-  t.Pe = null;
+      t.We = t.je;
+      t.Ce = t.Pe;
+      t.je = null;
+      t.Pe = null;
+      t.Ne = 0;
+    }
+  }
+  let s = !!(t.m & f);
+  const u = t.H !== undefined && t.H !== v;
+  const c = !!(t.ge & S);
+  const a = !!(t.ge & m);
+  const d = X;
+  X = t;
+  t.xe = null;
   t.m = r;
-  t.he = E;
-  let w = t.T === S ? t.te : t.T;
-  let m = t.o;
-  let b = Q;
-  let _ = K;
-  Q = true;
+  t.pe = A;
+  let h = t.T === v ? t.ne : t.T;
+  let p = t.o;
+  let y = B;
+  let g = Y;
+  B = true;
   if (s) {
     const e = resolveLane(t);
-    if (e) K = e;
+    if (e) Y = e;
+  } else if (L && !n && L.Y.length) {
+    for (let e = t.j; e; e = e.R) {
+      const n = e.A;
+      if (n.m & f) {
+        const e = resolveLane(n);
+        if (e) {
+          s = true;
+          Y = e;
+          t.m |= f;
+          assignOrMergeLane(t, e);
+          break;
+        }
+      }
+    }
   }
   try {
-    const e = t.Ce;
-    const r = t.I(w);
-    w = t.Ce !== e ? r : handleAsync(t, r);
+    const e = t.Ee;
+    const r = t.I(h);
+    h = t.Ee !== e ? r : handleAsync(t, r);
     clearStatus(t, n);
     const i = resolveLane(t);
     if (i) {
       i.D.delete(t);
-      updatePendingSignal(i.ne);
+      updatePendingSignal(i.re);
     }
   } catch (e) {
-    if (e instanceof NotReadyError && K) {
-      const e = findLane(K);
-      if (e.ne !== t) {
+    if (e instanceof NotReadyError && Y) {
+      const e = findLane(Y);
+      if (e.re !== t) {
         e.D.add(t);
-        t.ee = e;
-        updatePendingSignal(e.ne);
+        t.te = e;
+        updatePendingSignal(e.re);
       }
     }
-    if (e instanceof NotReadyError) t.Ie = true;
+    if (e instanceof NotReadyError) t.Ae = true;
     notifyStatus(
       t,
-      e instanceof NotReadyError ? a : d,
+      e instanceof NotReadyError ? S : w,
       e,
       undefined,
-      e instanceof NotReadyError ? t.ee : undefined
+      e instanceof NotReadyError ? t.te : undefined
     );
   } finally {
-    Q = b;
-    t.m = e | (n ? t.m & l : 0);
     B = y;
+    t.m = e | (n ? t.m & l : 0);
+    X = d;
   }
-  if (!t.de) {
-    const e = t.Pe;
+  if (!t.he) {
+    const e = t.xe;
     let r = e !== null ? e.R : t.j;
     if (r !== null) {
       do {
@@ -1286,30 +1325,30 @@ function recompute(t, n = false) {
       if (e !== null) e.R = null;
       else t.j = null;
     }
-    const f = u ? t.H : t.T === S ? t.te : t.T;
-    const l = (!i && p) || !t.Te || !t.Te(f, w);
+    const f = u ? t.H : t.T === v ? t.ne : t.T;
+    const l = (!i && a) || !t.Le || !t.Le(f, h);
     if (l) {
       const e = u ? t.H : undefined;
-      if (n || (i && C !== t.X) || s) {
-        t.te = w;
+      if (n || (i && L !== t.X) || s) {
+        t.ne = h;
         if (u && s) {
-          t.H = w;
-          t.T = w;
+          t.H = h;
+          t.T = h;
         }
-      } else t.T = w;
-      if (u && !s && c && !t._e) t.H = w;
+      } else t.T = h;
+      if (u && !s && c && !t._e) t.H = h;
       if (!u || s || t.H !== e) insertSubs(t, s || u);
     } else if (u) {
-      t.T = w;
-    } else if (t.o != m) {
+      t.T = h;
+    } else if (t.o != p) {
       for (let e = t.O; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.k, e.k.m & o ? k : P);
+        insertIntoHeapHeight(e.k, e.k.m & o ? R : j);
       }
     }
   }
-  K = _;
-  (!n || t.ge & a) && !t.X && !(C && u) && A.oe.push(t);
-  t.X && i && C !== t.X && runInTransition(t.X, () => recompute(t));
+  Y = g;
+  (!n || t.ge & S) && !t.X && !(L && u) && q.ue.push(t);
+  t.X && i && L !== t.X && runInTransition(t.X, () => recompute(t));
 }
 function updateIfNecessary(e) {
   if (e.m & t) {
@@ -1324,7 +1363,7 @@ function updateIfNecessary(e) {
       }
     }
   }
-  if (e.m & (n | f) || (e.de && e.he < E && !e.Ce)) {
+  if (e.m & (n | f) || (e.he && e.pe < A && !e.Ee)) {
     recompute(e);
   }
   e.m = e.m & (l | i | s);
@@ -1332,53 +1371,55 @@ function updateIfNecessary(e) {
 function computed(t, n) {
   const r = n?.transparent ?? false;
   const i = {
-    id: n?.id ?? (r ? B?.id : B?.id != null ? getNextChildId(B) : undefined),
-    Ae: r || undefined,
-    Te: n?.equals != null ? n.equals : isEqual,
-    ae: !!n?.ownedWrite,
+    id: n?.id ?? (r ? X?.id : X?.id != null ? getNextChildId(X) : undefined),
+    de:
+      (r ? h : 0) |
+      (n?.ownedWrite ? a : 0) |
+      (!X || n?.lazy ? g : 0) |
+      (Z && ownerInSnapshotScope(X) ? p : 0),
+    Le: n?.equals != null ? n.equals : isEqual,
     q: n?.unobserved,
-    Re: null,
-    K: B?.K ?? A,
-    Le: B?.Le ?? _,
-    We: 0,
+    je: null,
+    K: X?.K ?? q,
+    Re: X?.Re ?? E,
+    Ne: 0,
     I: t,
-    te: undefined,
+    ne: undefined,
     o: 0,
     C: null,
     p: undefined,
     h: null,
     j: null,
-    Pe: null,
+    xe: null,
     O: null,
     ve: null,
-    i: B,
-    Ee: null,
+    i: X,
     ke: null,
+    Pe: null,
     m: n?.lazy ? c : e,
-    ge: h,
-    he: E,
-    T: S,
-    je: null,
-    Ne: null,
+    ge: m,
+    pe: A,
+    T: v,
+    We: null,
     Ce: null,
+    Ee: null,
     X: null
   };
   i.h = i;
-  const s = B?.t ? B.u : B;
-  if (B) {
-    const e = B.ke;
+  const s = X?.t ? X.u : X;
+  if (X) {
+    const e = X.Pe;
     if (e === null) {
-      B.ke = i;
+      X.Pe = i;
     } else {
-      i.Ee = e;
-      B.ke = i;
+      i.ke = e;
+      X.Pe = i;
     }
   }
   if (s) i.o = s.o + 1;
-  if (G && ownerInSnapshotScope(B)) i.ye = true;
-  if (H) {
+  if (V) {
     const e = signal(undefined, { equals: false, ownedWrite: true });
-    const t = H.factory(i.I, () => {
+    const t = V.factory(i.I, () => {
       setSignal(e, undefined);
     });
     cleanup(() => t.dispose());
@@ -1388,110 +1429,109 @@ function computed(t, n) {
     };
   }
   !n?.lazy && recompute(i, true);
-  if (G && !n?.lazy) {
-    if (!(i.ge & a)) {
-      i.pe = i.te === undefined ? w : i.te;
-      z.add(i);
+  if (Z && !n?.lazy) {
+    if (!(i.ge & S)) {
+      i.ye = i.ne === undefined ? x : i.ne;
+      $.add(i);
     }
   }
   return i;
 }
 function signal(e, t, n = null) {
   const r = {
-    Te: t?.equals != null ? t.equals : isEqual,
-    ae: !!t?.ownedWrite,
-    Me: !!t?.Me,
+    Le: t?.equals != null ? t.equals : isEqual,
+    de: (t?.ownedWrite ? a : 0) | (t?.Qe ? d : 0),
     q: t?.unobserved,
-    te: e,
+    ne: e,
     O: null,
     ve: null,
-    he: E,
+    pe: A,
     L: n,
     N: n?.C || null,
-    T: S
+    T: v
   };
   n && (n.C = r);
-  if (G && !r.Me && !((n?.ge ?? 0) & a)) {
-    r.pe = e === undefined ? w : e;
-    z.add(r);
+  if (Z && !(r.de & d) && !((n?.ge ?? 0) & S)) {
+    r.ye = e === undefined ? x : e;
+    $.add(r);
   }
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.H = S;
+  n.H = v;
   return n;
 }
 function optimisticComputed(e, t) {
   const n = computed(e, t);
-  n.H = S;
+  n.H = v;
   return n;
 }
 function isEqual(e, t) {
   return e === t;
 }
 function untrack(e, t) {
-  if (!H && !Q && true) return e();
-  const n = Q;
-  Q = false;
+  if (!V && !B && true) return e();
+  const n = B;
+  B = false;
   try {
-    if (H) return H.untrack(e);
+    if (V) return V.untrack(e);
     return e();
   } finally {
-    Q = n;
+    B = n;
   }
 }
 function read(e) {
-  if (V) {
+  if (J) {
     const t = getLatestValueComputed(e);
-    const n = V;
-    V = false;
-    const r = e.H !== undefined && e.H !== S ? e.H : e.te;
+    const n = J;
+    J = false;
+    const r = e.H !== undefined && e.H !== v ? e.H : e.ne;
     let i;
     try {
       i = read(t);
     } catch (e) {
-      if (!B && e instanceof NotReadyError) return r;
+      if (!X && e instanceof NotReadyError) return r;
       throw e;
     } finally {
-      V = n;
+      J = n;
     }
-    if (t.ge & a) return r;
-    if (q && K && t.ee) {
-      const e = findLane(t.ee);
-      const n = findLane(K);
+    if (t.ge & S) return r;
+    if (K && Y && t.te) {
+      const e = findLane(t.te);
+      const n = findLane(Y);
       if (e !== n && e.D.size > 0) {
         return r;
       }
     }
     return i;
   }
-  if (D) {
+  if (z) {
     const t = e.L;
-    const n = D;
-    D = false;
+    const n = z;
+    z = false;
     if (t && e.H !== undefined) {
-      if (e.H !== S && (t.Ce || !!(t.ge & a))) {
-        F = true;
+      if (e.H !== v && (t.Ee || !!(t.ge & S))) {
+        U = true;
       }
-      let n = B;
+      let n = X;
       if (n?.t) n = n.u;
-      if (n && Q) link(e, n);
+      if (n && B) link(e, n);
       read(getPendingSignal(e));
       read(getPendingSignal(t));
     } else {
-      if (read(getPendingSignal(e))) F = true;
-      if (t && read(getPendingSignal(t))) F = true;
+      if (read(getPendingSignal(e))) U = true;
+      if (t && read(getPendingSignal(t))) U = true;
     }
-    D = n;
-    return e.te;
+    z = n;
+    return e.ne;
   }
-  let t = B;
+  let t = X;
   if (t?.t) t = t.u;
   const n = e;
   if (typeof n.I === "function") {
     const t = e;
-    if (M && !(t.m & u)) recompute(t);
+    if (G && !(t.m & u)) recompute(t);
     if (t.m & c) {
       t.m &= ~c;
       recompute(t, true);
@@ -1500,13 +1540,13 @@ function read(e) {
     }
   }
   const r = e.L || e;
-  if (t && Q) {
+  if (t && B) {
     link(e, t);
     if (r.I) {
       const n = e.m & o;
-      if (r.o >= (n ? k.W : P.W)) {
+      if (r.o >= (n ? R.W : j.W)) {
         markNode(t);
-        markHeap(n ? k : P);
+        markHeap(n ? R : j);
         updateIfNecessary(r);
       }
       const i = r.o;
@@ -1515,64 +1555,68 @@ function read(e) {
       }
     }
   }
-  if (r.ge & a) {
-    if (t && !(q && r.X && C !== r.X)) {
-      if (K) {
-        const n = r.ee;
-        const i = findLane(K);
+  if (r.ge & S) {
+    if (t && !(K && r.X && L !== r.X)) {
+      if (Y) {
+        const n = r.te;
+        const i = findLane(Y);
         if (n && findLane(n) === i && !hasActiveOverride(r)) {
-          if (!Q && e !== t) link(e, t);
-          throw r.de;
+          if (!B && e !== t) link(e, t);
+          throw r.he;
         }
       } else {
-        if (!Q && e !== t) link(e, t);
-        throw r.de;
+        if (!B && e !== t) link(e, t);
+        throw r.he;
       }
-    } else if (t && r !== e && r.ge & h) {
-      if (!Q && e !== t) link(e, t);
-      throw r.de;
-    } else if (!t && r.ge & h) {
-      throw r.de;
+    } else if (t && r !== e && r.ge & m) {
+      if (!B && e !== t) link(e, t);
+      throw r.he;
+    } else if (!t && r.ge & m) {
+      throw r.he;
     }
   }
-  if (e.I && e.ge & d) {
-    if (e.he < E) {
+  if (e.I && e.ge & w) {
+    if (e.pe < A) {
       recompute(e);
       return read(e);
-    } else throw e.de;
+    } else throw e.he;
   }
-  if (G && t && t.ye) {
-    const n = e.pe;
+  if (Z && t && t.de & p) {
+    const n = e.ye;
     if (n !== undefined) {
-      const r = n === w ? undefined : n;
-      const i = e.T !== S ? e.T : e.te;
+      const r = n === x ? undefined : n;
+      const i = e.T !== v ? e.T : e.ne;
       if (i !== r) t.m |= l;
       return r;
     }
   }
-  if (e.H !== undefined && e.H !== S) {
-    if (t && q && shouldReadStashedOptimisticValue(e)) return e.te;
+  if (e.H !== undefined && e.H !== v) {
+    if (t && K && shouldReadStashedOptimisticValue(e)) return e.ne;
     return e.H;
   }
+  if (L !== null && Y !== null && !J && e.T !== v && r === e && !e.I && t) {
+    L.ee.add(t);
+    return e.ne;
+  }
   const i =
     !t ||
-    (K !== null && (e.H !== undefined || e.ee || (r === e && q) || !!(r.ge & a))) ||
-    e.T === S ||
-    (q && e.X && C !== e.X)
-      ? e.te
+    (Y !== null && (e.H !== undefined || e.te || (r === e && K) || !!(r.ge & S))) ||
+    e.T === v ||
+    (K && e.X && L !== e.X)
+      ? e.ne
       : e.T;
-  if (!t && r === e && typeof n.I === "function" && !n.xe && !(r.ge & a) && !n.i && !e.O) {
+  if (!t && r === e && typeof n.I === "function" && e.de & g && !(r.ge & S) && !e.O) {
     unobserved(e);
   }
   return i;
 }
 function setSignal(e, t) {
-  if (e.X && C !== e.X) A.initTransition(e.X);
-  const n = e.H !== undefined && !W;
-  const r = e.H !== undefined && e.H !== S;
-  const i = n ? (r ? e.H : e.te) : e.T === S ? e.te : e.T;
+  if (e.X && L !== e.X) q.initTransition(e.X);
+  const n = e.H !== undefined && !T;
+  const r = e.H !== undefined && e.H !== v;
+  const i = n ? (r ? e.H : e.ne) : e.T === v ? e.ne : e.T;
   if (typeof t === "function") t = t(i);
-  const s = !e.Te || !e.Te(i, t) || !!(e.ge & h);
+  const s = !e.Le || !e.Le(i, t) || !!(e.ge & m);
   if (!s) {
     if (n && r && e.I) {
       insertSubs(e, true);
@@ -1581,156 +1625,156 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = e.H === S;
-    if (!n) A.initTransition(resolveTransition(e));
+    const n = e.H === v;
+    if (!n) q.initTransition(resolveTransition(e));
     if (n) {
-      e.T = e.te;
-      A.Y.push(e);
+      e.T = e.ne;
+      q.Y.push(e);
     }
     e._e = true;
     const r = getOrCreateLane(e);
-    e.ee = r;
+    e.te = r;
     e.H = t;
   } else {
-    if (e.T === S) A.oe.push(e);
+    if (e.T === v) q.ue.push(e);
     e.T = t;
   }
   updatePendingSignal(e);
-  if (e.He) {
-    setSignal(e.He, t);
+  if (e.Ie) {
+    setSignal(e.Ie, t);
   }
-  e.he = E;
+  e.pe = A;
   insertSubs(e, n);
   schedule();
   return t;
 }
 function runWithOwner(e, t) {
-  const n = B;
-  const r = Q;
-  B = e;
-  Q = false;
+  const n = X;
+  const r = B;
+  X = e;
+  B = false;
   try {
     return t();
   } finally {
-    B = n;
-    Q = r;
+    X = n;
+    B = r;
   }
 }
 function getPendingSignal(e) {
-  if (!e.De) {
-    e.De = optimisticSignal(false, { ownedWrite: true });
+  if (!e.qe) {
+    e.qe = optimisticSignal(false, { ownedWrite: true });
     if (e.me) {
-      e.De.me = e;
+      e.qe.me = e;
     }
-    if (computePendingState(e)) setSignal(e.De, true);
+    if (computePendingState(e)) setSignal(e.qe, true);
   }
-  return e.De;
+  return e.qe;
 }
 function computePendingState(e) {
   const t = e;
   const n = e.L;
-  if (n && e.T !== S) {
-    return !n.Ce && !(n.ge & a);
+  if (n && e.T !== v) {
+    return !n.Ee && !(n.ge & S);
   }
-  if (e.H !== undefined && e.H !== S) {
-    if (t.ge & a && !(t.ge & h)) return true;
+  if (e.H !== undefined && e.H !== v) {
+    if (t.ge & S && !(t.ge & m)) return true;
     if (e.me) {
-      const t = e.ee ? findLane(e.ee) : null;
+      const t = e.te ? findLane(e.te) : null;
       return !!(t && t.D.size > 0);
     }
     return true;
   }
-  if (e.H !== undefined && e.H === S && !e.me) {
+  if (e.H !== undefined && e.H === v && !e.me) {
     return false;
   }
-  if (e.T !== S && !(t.ge & h)) return true;
-  return !!(t.ge & a && !(t.ge & h));
+  if (e.T !== v && !(t.ge & m)) return true;
+  return !!(t.ge & S && !(t.ge & m));
 }
 function updatePendingSignal(e) {
-  if (e.De) {
+  if (e.qe) {
     const t = computePendingState(e);
-    const n = e.De;
+    const n = e.qe;
     setSignal(n, t);
-    if (!t && n.ee) {
+    if (!t && n.te) {
       const t = resolveLane(e);
       if (t && t.D.size > 0) {
-        const e = findLane(n.ee);
+        const e = findLane(n.te);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
-      L.delete(n);
-      n.ee = undefined;
+      M.delete(n);
+      n.te = undefined;
     }
   }
 }
 function getLatestValueComputed(e) {
-  if (!e.He) {
-    const t = V;
-    V = false;
-    const n = D;
-    D = false;
-    const r = B;
-    B = null;
-    e.He = optimisticComputed(() => read(e));
-    e.He.me = e;
-    B = r;
-    D = n;
-    V = t;
-  }
-  return e.He;
+  if (!e.Ie) {
+    const t = J;
+    J = false;
+    const n = z;
+    z = false;
+    const r = X;
+    X = null;
+    e.Ie = optimisticComputed(() => read(e));
+    e.Ie.me = e;
+    X = r;
+    z = n;
+    J = t;
+  }
+  return e.Ie;
 }
 function staleValues(e, t = true) {
-  const n = q;
-  q = t;
+  const n = K;
+  K = t;
   try {
     return e();
   } finally {
-    q = n;
+    K = n;
   }
 }
 function latest(e) {
-  const t = V;
-  V = true;
+  const t = J;
+  J = true;
   try {
     return e();
   } finally {
-    V = t;
+    J = t;
   }
 }
 function isPending(e) {
-  const t = D;
-  const n = F;
-  D = true;
-  F = false;
+  const t = z;
+  const n = U;
+  z = true;
+  U = false;
   try {
     e();
-    return F;
+    return U;
   } catch {
-    return F;
+    return U;
   } finally {
-    D = t;
-    F = n;
+    z = t;
+    U = n;
   }
 }
 function refresh(e) {
-  let t = M;
-  M = true;
+  let t = G;
+  G = true;
   try {
     if (typeof e !== "function") {
-      recompute(e[O]);
+      recompute(e[C]);
       return e;
     }
     return untrack(e);
   } finally {
-    M = t;
+    G = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return M;
+  return G;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1739,7 +1783,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Re[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1749,10 +1793,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Le = { ...n.Le, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Re = { ...n.Re, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Le[e.id]);
+  return !isUndefined(t?.Re[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1763,59 +1807,60 @@ function effect(e, t, n, r) {
   const o = computed(s ? e : t => staleValues(() => e(t)), {
     ...r,
     equals: () => {
-      o.B = !o.de;
+      o.B = !o.he;
       if (i) o.K.enqueue(o.V, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Fe = undefined;
-  o.Ve = t;
-  o.Be = n;
-  o.Ke = undefined;
-  o.V = s ? y : p;
-  o.Qe = (e, t) => {
+  o.de &= ~g;
+  o.Me = undefined;
+  o.De = t;
+  o.Fe = n;
+  o.Ve = undefined;
+  o.V = s ? _ : b;
+  o.Te = (e, t) => {
     const n = e !== undefined ? e : o.ge;
-    const r = t !== undefined ? t : o.de;
-    if (n & d) {
+    const r = t !== undefined ? t : o.he;
+    if (n & w) {
       let e = r;
-      o.K.notify(o, a, 0);
-      if (o.V === y) {
+      o.K.notify(o, S, 0);
+      if (o.V === _) {
         try {
-          return o.Be
-            ? o.Be(e, () => {
-                o.Ke?.();
-                o.Ke = undefined;
+          return o.Fe
+            ? o.Fe(e, () => {
+                o.Ve?.();
+                o.Ve = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!o.K.notify(o, d, d)) throw e;
-    } else if (o.V === p) {
-      o.K.notify(o, a | d, n, r);
+      if (!o.K.notify(o, w, w)) throw e;
+    } else if (o.V === b) {
+      o.K.notify(o, S | w, n, r);
     }
   };
   recompute(o, true);
-  !r?.defer && (o.V === y || r?.schedule ? o.K.enqueue(o.V, runEffect.bind(o)) : runEffect.call(o));
+  !r?.defer && (o.V === _ || r?.schedule ? o.K.enqueue(o.V, runEffect.bind(o)) : runEffect.call(o));
   i = true;
-  cleanup(() => o.Ke?.());
+  cleanup(() => o.Ve?.());
 }
 function runEffect() {
   if (!this.B || this.m & u) return;
-  this.Ke?.();
-  this.Ke = undefined;
+  this.Ve?.();
+  this.Ve = undefined;
   try {
-    const e = this.Ve(this.te, this.Fe);
+    const e = this.De(this.ne, this.Me);
     if (false && e !== undefined && typeof e !== "function");
-    this.Ke = e;
+    this.Ve = e;
   } catch (e) {
-    this.de = new StatusError(this, e);
-    this.ge |= d;
-    if (!this.K.notify(this, d, d)) throw e;
+    this.he = new StatusError(this, e);
+    this.ge |= w;
+    if (!this.K.notify(this, w, w)) throw e;
   } finally {
-    this.Fe = this.te;
+    this.Me = this.ne;
     this.B = false;
   }
 }
@@ -1830,31 +1875,31 @@ function trackedEffect(e, t) {
   };
   const n = computed(
     () => {
-      n.Ke?.();
-      n.Ke = undefined;
+      n.Ve?.();
+      n.Ve = undefined;
       const t = staleValues(e);
-      n.Ke = t;
+      n.Ve = t;
     },
     { ...t, lazy: true }
   );
-  n.Ke = undefined;
-  n.Ge = true;
+  n.Ve = undefined;
+  n.de = (n.de & ~g) | y;
   n.B = true;
-  n.V = g;
-  n.Qe = (e, t) => {
+  n.V = O;
+  n.Te = (e, t) => {
     const r = e !== undefined ? e : n.ge;
-    if (r & d) {
-      n.K.notify(n, a, 0);
-      const e = t !== undefined ? t : n.de;
-      if (!n.K.notify(n, d, d)) throw e;
+    if (r & w) {
+      n.K.notify(n, S, 0);
+      const e = t !== undefined ? t : n.he;
+      if (!n.K.notify(n, w, w)) throw e;
     }
   };
   n.G = run;
-  n.K.enqueue(y, run);
-  cleanup(() => n.Ke?.());
+  n.K.enqueue(_, run);
+  cleanup(() => n.Ve?.());
 }
 function restoreTransition(e, t) {
-  A.initTransition(e);
+  q.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1863,8 +1908,8 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      A.initTransition();
-      let s = C;
+      q.initTransition();
+      let s = L;
       s.J.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
@@ -1901,22 +1946,19 @@ function onCleanup(e) {
   return cleanup(e);
 }
 function accessor(e) {
-  const t = read.bind(null, e);
-  t.$r = true;
-  return t;
+  return read.bind(null, e);
 }
 function createSignal(e, t) {
   if (typeof e === "function") {
     const n = computed(e, t);
-    n.xe = true;
+    n.de &= ~g;
     return [accessor(n), setSignal.bind(null, n)];
   }
   const n = signal(e, t);
   return [accessor(n), setSignal.bind(null, n)];
 }
 function createMemo(e, t) {
-  let n = computed(e, t);
-  return accessor(n);
+  return accessor(computed(e, t));
 }
 function createEffect(e, t, n) {
   effect(e, t.effect || t, t.error, { user: true, ...n });
@@ -1966,7 +2008,7 @@ function resolve(e) {
 function createOptimistic(e, t) {
   if (typeof e === "function") {
     const n = optimisticComputed(e, t);
-    n.xe = true;
+    n.de &= ~g;
     return [accessor(n), setSignal.bind(null, n)];
   }
   const n = optimisticSignal(e, t);
@@ -1974,15 +2016,15 @@ function createOptimistic(e, t) {
 }
 function onSettled(e) {
   const t = getOwner();
-  t && !t.Ge
+  t && !(t.de & y)
     ? createTrackedEffect(() => untrack(e), undefined)
-    : A.enqueue(y, () => {
+    : q.enqueue(_, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[J]?.[te] ?? e;
+  return e?.[te]?.[ue] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1994,16 +2036,16 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n) {
-  const r = t?.[J];
+  const r = t?.[te];
   if (!r) return;
-  const i = r[Z];
-  const s = r[$];
-  const o = r[ee];
-  let u = r[te];
+  const i = r[ie];
+  const s = r[se];
+  const o = r[oe];
+  let u = r[ue];
   if (e === i && !s && !o) return;
-  (r[ie] || ue).set(e, r[X]);
-  r[Z] = e;
-  r[$] = undefined;
+  (r[ce] || he).set(e, r[ne]);
+  r[ie] = e;
+  r[se] = undefined;
   if (Array.isArray(i)) {
     let t = false;
     const f = getOverrideValue(i, s, u, "length", o);
@@ -2031,16 +2073,16 @@ function applyState(e, t, n) {
       if (a > h || a > d) {
         for (c = a; c <= h; c++) {
           t = true;
-          r[te][c] && setSignal(r[te][c], wrap(e[c], r));
+          r[ue][c] && setSignal(r[ue][c], wrap(e[c], r));
         }
         for (; c < e.length; c++) {
           t = true;
           const i = wrap(S[c], r);
-          r[te][c] && setSignal(r[te][c], i);
+          r[ue][c] && setSignal(r[ue][c], i);
           applyState(e[c], i, n);
         }
-        t && r[te][U] && setSignal(r[te][U], void 0);
-        f !== e.length && r[te].length && setSignal(r[te].length, e.length);
+        t && r[ue][ee] && setSignal(r[ue][ee], void 0);
+        f !== e.length && r[ue].length && setSignal(r[ue].length, e.length);
         return;
       }
       y = new Array(h + 1);
@@ -2064,26 +2106,26 @@ function applyState(e, t, n) {
       for (c = a; c < e.length; c++) {
         if (c in S) {
           const t = wrap(S[c], r);
-          r[te][c] && setSignal(r[te][c], t);
+          r[ue][c] && setSignal(r[ue][c], t);
           applyState(e[c], t, n);
-        } else r[te][c] && setSignal(r[te][c], wrap(e[c], r));
+        } else r[ue][c] && setSignal(r[ue][c], wrap(e[c], r));
       }
       if (a < e.length) t = true;
     } else if (e.length) {
       for (let t = 0, f = e.length; t < f; t++) {
         const f = getOverrideValue(i, s, u, t, o);
-        isWrappable(f) ? applyState(e[t], wrap(f, r), n) : r[te][t] && setSignal(r[te][t], e[t]);
+        isWrappable(f) ? applyState(e[t], wrap(f, r), n) : r[ue][t] && setSignal(r[ue][t], e[t]);
       }
     }
     if (f !== e.length) {
       t = true;
-      r[te].length && setSignal(r[te].length, e.length);
+      r[ue].length && setSignal(r[ue].length, e.length);
     }
-    t && r[te][U] && setSignal(r[te][U], void 0);
+    t && r[ue][ee] && setSignal(r[ue][ee], void 0);
     return;
   }
   if (u) {
-    const t = u[U];
+    const t = u[ee];
     const f = t ? getAllKeys(i, s, e) : Object.keys(u);
     for (let l = 0, c = f.length; l < c; l++) {
       const c = f[l];
@@ -2097,7 +2139,7 @@ function applyState(e, t, n) {
       } else applyState(h, wrap(d, r), n);
     }
   }
-  if ((u = r[ne])) {
+  if ((u = r[fe])) {
     const t = Object.keys(u);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -2119,9 +2161,9 @@ function createProjectionInternal(e, t, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[re] = wrapProjection;
-    e[ie] = i;
-    Object.defineProperty(e, se, {
+    e[le] = wrapProjection;
+    e[ce] = i;
+    Object.defineProperty(e, ae, {
       get() {
         return r;
       },
@@ -2130,8 +2172,8 @@ function createProjectionInternal(e, t, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[J]?.[re] === wrapProjection) return e;
-    const t = createStoreProxy(e, ce, wrapper);
+    if (e[te]?.[le] === wrapProjection) return e;
+    const t = createStoreProxy(e, ge, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2140,7 +2182,7 @@ function createProjectionInternal(e, t, n) {
     if (!r) r = getOwner();
     runProjectionComputed(s, e, n?.key || "id");
   }, undefined);
-  r.xe = true;
+  r.de &= ~g;
   return { store: s, node: r };
 }
 function createProjection(e, t, n) {
@@ -2152,7 +2194,7 @@ function runProjectionComputed(e, t, n, r) {
   let o;
   const u = new Proxy(
     e,
-    createWriteTraps(() => !s || i.Ce === o)
+    createWriteTraps(() => !s || i.Ee === o)
   );
   storeSetter(u, u => {
     o = t(u);
@@ -2219,33 +2261,33 @@ function createWriteTraps(e) {
   };
   return t;
 }
-const U = Symbol(0),
-  J = Symbol(0),
-  X = Symbol(0),
-  Y = Symbol(0);
-const Z = "v",
-  $ = "o",
-  ee = "x",
-  te = "n",
-  ne = "h",
-  re = "w",
-  ie = "l",
-  se = "f",
-  oe = "p";
-function createStoreProxy(e, t = ce, n) {
+const ee = Symbol(0),
+  te = Symbol(0),
+  ne = Symbol(0),
+  re = Symbol(0);
+const ie = "v",
+  se = "o",
+  oe = "x",
+  ue = "n",
+  fe = "h",
+  le = "w",
+  ce = "l",
+  ae = "f",
+  de = "p";
+function createStoreProxy(e, t = ge, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
     r.v = e;
   } else r = { v: e };
   n && n(r);
-  return (r[X] = new Proxy(r, t));
+  return (r[ne] = new Proxy(r, t));
 }
-const ue = new WeakMap();
+const he = new WeakMap();
 function wrap(e, t) {
-  if (t?.[re]) return t[re](e, t);
-  let n = e[X] || ue.get(e);
-  if (!n) ue.set(e, (n = createStoreProxy(e)));
+  if (t?.[le]) return t[le](e, t);
+  let n = e[ne] || he.get(e);
+  if (!n) he.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
@@ -2256,12 +2298,12 @@ function isWrappable(e) {
     !(typeof Node !== "undefined" && e instanceof Node)
   );
 }
-let fe = false;
+let pe = false;
 function setWriteOverride(e) {
-  fe = e;
+  pe = e;
 }
 function writeOnly(e) {
-  return fe || !!le?.has(e);
+  return pe || !!ye?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -2281,17 +2323,17 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
     r
   );
   if (s) {
-    u.H = S;
+    u.H = v;
   }
   if (o && t in o) {
     const e = o[t];
-    u.pe = e === undefined ? w : e;
-    z?.add(u);
+    u.ye = e === undefined ? x : e;
+    $?.add(u);
   }
   return (e[t] = u);
 }
-function trackSelf(e, t = U) {
-  getObserver() && read(getNode(getNodes(e, te), t, undefined, e[se], false, e[oe]));
+function trackSelf(e, t = ee) {
+  getObserver() && read(getNode(getNodes(e, ue), t, undefined, e[ae], false, e[de]));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -2299,65 +2341,65 @@ function getKeys(e, t, n = true) {
   const i = new Set(r);
   const s = Reflect.ownKeys(t);
   for (const e of s) {
-    if (t[e] !== Y) i.add(e);
+    if (t[e] !== re) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
 }
 function getPropertyDescriptor(e, t, n) {
   if (t && n in t) {
-    if (t[n] === Y) return void 0;
+    if (t[n] === re) return void 0;
     const r = Reflect.getOwnPropertyDescriptor(t, n);
     if (r?.get || r?.set || !(n in e)) return r;
   }
   return Reflect.getOwnPropertyDescriptor(e, n);
 }
 function prepareStoreWrite(e, t, n) {
-  if (e[oe]) {
-    const t = e[se];
+  if (e[de]) {
+    const t = e[ae];
     if (t?.X) {
-      A.initTransition(t.X);
+      q.initTransition(t.X);
     }
   }
-  const r = e[Z];
+  const r = e[ie];
   const i = r[n];
-  if (G && typeof n !== "symbol" && !((e[se]?.ge ?? 0) & a)) {
-    if (!e[m]) {
-      e[m] = Object.create(null);
-      z?.add(e);
+  if (Z && typeof n !== "symbol" && !((e[ae]?.ge ?? 0) & S)) {
+    if (!e[P]) {
+      e[P] = Object.create(null);
+      $?.add(e);
     }
-    if (!(n in e[m])) {
-      e[m][n] = i;
+    if (!(n in e[P])) {
+      e[P][n] = i;
     }
   }
-  const s = e[oe] && !W;
-  const o = s ? ee : $;
+  const s = e[de] && !T;
+  const o = s ? oe : se;
   if (s) trackOptimisticStore(t);
   return { base: i, overrideKey: o, state: r };
 }
 function upsertStoreNode(e, t, n, r, i) {
   if (t[n]) return t[n];
   const s = isWrappable(r) ? wrap(r, e) : r;
-  const o = getNode(t, n, s, e[se], isEqual, e[oe], i);
+  const o = getNode(t, n, s, e[ae], isEqual, e[de], i);
   registerTransientStoreNode(o);
   return o;
 }
 function notifyStoreProperty(e, t, n, r, i, s) {
-  const o = W || e[oe];
+  const o = T || e[de];
   const u = n !== "delete";
-  const f = e[ne]?.[t];
+  const f = e[fe]?.[t];
   if (f) {
     setSignal(f, u);
   } else if (!o && n !== "invalidate" && s !== u) {
-    const n = upsertStoreNode(e, getNodes(e, ne), t, s);
+    const n = upsertStoreNode(e, getNodes(e, fe), t, s);
     setSignal(n, u);
   }
-  const l = getNodes(e, te);
+  const l = getNodes(e, ue);
   if (n === "set") {
     if (l[t]) {
       setSignal(l[t], () => (isWrappable(r) ? wrap(r, e) : r));
     } else if (!o) {
-      const n = upsertStoreNode(e, l, t, i, e[m]);
+      const n = upsertStoreNode(e, l, t, i, e[P]);
       setSignal(n, () => (isWrappable(r) ? wrap(r, e) : r));
     }
   } else if (n === "invalidate") {
@@ -2369,83 +2411,88 @@ function notifyStoreProperty(e, t, n, r, i, s) {
     if (l[t]) {
       setSignal(l[t], undefined);
     } else if (!o) {
-      const n = upsertStoreNode(e, l, t, i, e[m]);
+      const n = upsertStoreNode(e, l, t, i, e[P]);
       setSignal(n, undefined);
     }
   }
-  l[U] && setSignal(l[U], undefined);
+  l[ee] && setSignal(l[ee], undefined);
 }
-let le = null;
-const ce = {
+let ye = null;
+const ge = {
   get(e, t, n) {
-    if (t === J) return e;
-    if (t === X) return n;
-    if (t === O) return e[se];
-    if (t === U) {
+    if (t === te) return e;
+    if (t === ne) return n;
+    if (t === C) return e[ae];
+    if (t === ee) {
       trackSelf(e);
       return n;
     }
-    const r = getNodes(e, te);
+    const r = getNodes(e, ue);
     const i = r[t];
-    const s = e[ee] && t in e[ee];
-    const o = s || (e[$] && t in e[$]);
-    const u = !!e[Z][J];
-    const f = s ? e[ee] : e[$] && t in e[$] ? e[$] : e[Z];
+    const s = e[oe] && t in e[oe];
+    const o = s || (e[se] && t in e[se]);
+    const u = !!e[ie][te];
+    const f = s ? e[oe] : e[se] && t in e[se] ? e[se] : e[ie];
     if (!i) {
       const e = Object.getOwnPropertyDescriptor(f, t);
       if (e && e.get) return e.get.call(n);
     }
     if (writeOnly(n)) {
       let n =
-        i && (o || !u) ? (i.H !== undefined && i.H !== S ? i.H : i.T !== S ? i.T : i.te) : f[t];
-      n === Y && (n = undefined);
+        i && (o || !u) ? (i.H !== undefined && i.H !== v ? i.H : i.T !== v ? i.T : i.ne) : f[t];
+      n === re && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      le?.add(r);
+      ye?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === Y && (l = undefined);
+    l === re && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[Z]) && (t = Object.getPrototypeOf(e[Z])) && t !== Object.prototype
+        return !Array.isArray(e[ie]) && (t = Object.getPrototypeOf(e[ie])) && t !== Object.prototype
           ? l.bind(f)
           : l;
       } else if (getObserver()) {
-        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[se], isEqual, e[oe], e[m]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[ae], isEqual, e[de], e[P]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    if (t === X || t === U || t === "__proto__") return true;
-    const n = e[ee] && t in e[ee] ? e[ee][t] !== Y : e[$] && t in e[$] ? e[$][t] !== Y : t in e[Z];
-    if (writeOnly(e[X])) return n;
-    const r = getNodes(e, ne);
+    if (t === ne || t === ee || t === "__proto__") return true;
+    const n =
+      e[oe] && t in e[oe] ? e[oe][t] !== re : e[se] && t in e[se] ? e[se][t] !== re : t in e[ie];
+    if (writeOnly(e[ne])) return n;
+    const r = getNodes(e, fe);
     if (r[t]) return read(r[t]);
     if (getObserver()) {
-      return read(getNode(r, t, n, e[se], isEqual, e[oe]));
+      return read(getNode(r, t, n, e[ae], isEqual, e[de]));
     }
     return n;
   },
   set(e, t, n) {
-    const r = e[X];
+    const r = e[ne];
     if (writeOnly(r)) {
       untrack(() => {
         const { base: i, overrideKey: s, state: o } = prepareStoreWrite(e, r, t);
-        const u = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : i;
+        const u = e[oe] && t in e[oe] ? e[oe][t] : e[se] && t in e[se] ? e[se][t] : i;
         const f =
-          e[ee] && t in e[ee] ? e[ee][t] !== Y : e[$] && t in e[$] ? e[$][t] !== Y : t in e[Z];
-        const l = n?.[J]?.[Z] ?? n;
+          e[oe] && t in e[oe]
+            ? e[oe][t] !== re
+            : e[se] && t in e[se]
+              ? e[se][t] !== re
+              : t in e[ie];
+        const l = n?.[te]?.[ie] ?? n;
         const c = Array.isArray(o) && t !== "length";
         const a = c ? parseInt(t) + 1 : 0;
         const d =
           c &&
-          (e[ee] && "length" in e[ee]
-            ? e[ee].length
-            : e[$] && "length" in e[$]
-              ? e[$].length
+          (e[oe] && "length" in e[oe]
+            ? e[oe].length
+            : e[se] && "length" in e[se]
+              ? e[se].length
               : o.length);
         const h = c && a > d ? a : undefined;
         if (u === l && h === undefined) return true;
@@ -2457,11 +2504,11 @@ const ce = {
         }
         notifyStoreProperty(e, t, "set", l, u, f);
         if (Array.isArray(o) && t !== "length" && h !== undefined) {
-          const t = getNodes(e, te);
+          const t = getNodes(e, ue);
           if (t.length) {
             setSignal(t.length, h);
-          } else if (!W && !e[oe]) {
-            const n = upsertStoreNode(e, t, "length", d, e[m]);
+          } else if (!T && !e[de]) {
+            const n = upsertStoreNode(e, t, "length", d, e[P]);
             setSignal(n, h);
           }
         }
@@ -2471,11 +2518,11 @@ const ce = {
     return true;
   },
   defineProperty(e, t, n) {
-    const r = e[X];
+    const r = e[ne];
     if (writeOnly(r)) {
       untrack(() => {
         const { base: i, overrideKey: s } = prepareStoreWrite(e, r, t);
-        const o = "value" in n ? { ...n, value: n.value?.[J]?.[Z] ?? n.value } : n;
+        const o = "value" in n ? { ...n, value: n.value?.[te]?.[ie] ?? n.value } : n;
         Object.defineProperty(e[s] || (e[s] = Object.create(null)), t, o);
         notifyStoreProperty(e, t, "invalidate");
         if (false);
@@ -2484,16 +2531,16 @@ const ce = {
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[ee]?.[t] === Y;
-    const r = e[$]?.[t] === Y;
-    if (writeOnly(e[X]) && !n && !r) {
+    const n = e[oe]?.[t] === re;
+    const r = e[se]?.[t] === re;
+    if (writeOnly(e[ne]) && !n && !r) {
       untrack(() => {
-        const n = e[oe] && !W;
-        const r = n ? ee : $;
-        if (n) trackOptimisticStore(e[X]);
-        const i = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : e[Z][t];
-        if (t in e[Z] || (e[$] && t in e[$])) {
-          (e[r] || (e[r] = Object.create(null)))[t] = Y;
+        const n = e[de] && !T;
+        const r = n ? oe : se;
+        if (n) trackOptimisticStore(e[ne]);
+        const i = e[oe] && t in e[oe] ? e[oe][t] : e[se] && t in e[se] ? e[se][t] : e[ie][t];
+        if (t in e[ie] || (e[se] && t in e[se])) {
+          (e[r] || (e[r] = Object.create(null)))[t] = re;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
@@ -2504,11 +2551,11 @@ const ce = {
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[Z], e[$], false);
-    if (e[ee]) {
+    let t = getKeys(e[ie], e[se], false);
+    if (e[oe]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[ee])) {
-        if (e[ee][t] !== Y) n.add(t);
+      for (const t of Reflect.ownKeys(e[oe])) {
+        if (e[oe][t] !== re) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -2516,27 +2563,27 @@ const ce = {
     return t;
   },
   getOwnPropertyDescriptor(e, t) {
-    if (t === X) return { value: e[X], writable: true, configurable: true };
-    if (e[ee] && t in e[ee]) {
-      if (e[ee][t] === Y) return undefined;
-      const n = Reflect.getOwnPropertyDescriptor(e[ee], t);
-      if (n?.get || n?.set || !(t in e[Z])) return n;
-      const r = getPropertyDescriptor(e[Z], e[$], t);
+    if (t === ne) return { value: e[ne], writable: true, configurable: true };
+    if (e[oe] && t in e[oe]) {
+      if (e[oe][t] === re) return undefined;
+      const n = Reflect.getOwnPropertyDescriptor(e[oe], t);
+      if (n?.get || n?.set || !(t in e[ie])) return n;
+      const r = getPropertyDescriptor(e[ie], e[se], t);
       if (r) {
-        return { ...r, value: e[ee][t] };
+        return { ...r, value: e[oe][t] };
       }
-      return { value: e[ee][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[oe][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[Z], e[$], t);
+    return getPropertyDescriptor(e[ie], e[se], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[Z]);
+    return Object.getPrototypeOf(e[ie]);
   }
 };
 function storeSetter(e, t) {
-  const n = le;
-  le = new Set();
-  le.add(e);
+  const n = ye;
+  ye = new Set();
+  ye.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2552,8 +2599,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    le.clear();
-    le = n;
+    ye.clear();
+    ye = n;
   }
 }
 function createStore(e, t, n) {
@@ -2562,7 +2609,7 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.le ||= clearOptimisticStore;
+  GlobalQueue.ce ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = r ? t : e;
   const s = r ? e : undefined;
@@ -2570,39 +2617,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[J];
-  if (!t || !t[ee]) return;
-  const n = t[ee];
-  const r = t[te];
+  const t = e[te];
+  if (!t || !t[oe]) return;
+  const n = t[oe];
+  const r = t[ue];
   setProjectionWriteActive(true);
   try {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
-          r[e].ee = undefined;
-          const n = t[$] && e in t[$] ? t[$][e] : t[Z][e];
-          const i = n === Y ? undefined : n;
+          r[e].te = undefined;
+          const n = t[se] && e in t[se] ? t[se][e] : t[ie][e];
+          const i = n === re ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
-      if (r[U]) {
-        r[U].ee = undefined;
-        setSignal(r[U], undefined);
+      if (r[ee]) {
+        r[ee].te = undefined;
+        setSignal(r[ee], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[ee];
+  delete t[oe];
 }
 function createOptimisticProjectionInternal(e, t, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[re] = wrapProjection;
-    e[ie] = i;
-    e[oe] = true;
-    Object.defineProperty(e, se, {
+    e[le] = wrapProjection;
+    e[ce] = i;
+    e[de] = true;
+    Object.defineProperty(e, ae, {
       get() {
         return r;
       },
@@ -2611,8 +2658,8 @@ function createOptimisticProjectionInternal(e, t, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[J]?.[re] === wrapProjection) return e;
-    const t = createStoreProxy(e, ce, wrapper);
+    if (e[te]?.[le] === wrapProjection) return e;
+    const t = createStoreProxy(e, ge, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2634,11 +2681,11 @@ function createOptimisticProjectionInternal(e, t, n) {
         setProjectionWriteActive(false);
       }
     }, undefined);
-    r.xe = true;
+    r.de &= ~g;
   }
   return { store: s, node: r };
 }
-const ae = Symbol(0);
+const Se = Symbol(0);
 function updatePath(e, t, n = 0) {
   let r,
     i = e;
@@ -2682,7 +2729,7 @@ function updatePath(e, t, n = 0) {
     if (s === i) return;
   }
   if (r === undefined && s == undefined) return;
-  if (s === ae) {
+  if (s === Se) {
     delete e[r];
   } else if (r === undefined || (isWrappable(i) && isWrappable(s) && !Array.isArray(s))) {
     const t = r !== undefined ? e[r] : e;
@@ -2697,26 +2744,26 @@ function updatePath(e, t, n = 0) {
     e[r] = s;
   }
 }
-const de = Object.assign(
+const we = Object.assign(
   function storePath(...e) {
     return t => {
       updatePath(t, e);
     };
   },
-  { DELETE: ae }
+  { DELETE: Se }
 );
 function snapshotImpl(e, t, n, r) {
   let i, s, o, u, f, l;
   if (!isWrappable(e)) return e;
   if (n && n.has(e)) return n.get(e);
   if (!n) n = new Map();
-  if ((i = e[J] || r?.get(e)?.[J])) {
-    if (t) trackSelf(i, U);
-    o = i[$];
-    s = Array.isArray(i[Z]);
-    n.set(e, o ? (u = s ? [] : Object.create(Object.getPrototypeOf(i[Z]))) : i[Z]);
-    e = i[Z];
-    r = ue;
+  if ((i = e[te] || r?.get(e)?.[te])) {
+    if (t) trackSelf(i, ee);
+    o = i[se];
+    s = Array.isArray(i[ie]);
+    n.set(e, o ? (u = s ? [] : Object.create(Object.getPrototypeOf(i[ie]))) : i[ie]);
+    e = i[ie];
+    r = he;
   } else {
     s = Array.isArray(e);
     n.set(e, e);
@@ -2725,7 +2772,7 @@ function snapshotImpl(e, t, n, r) {
     const s = o?.length || e.length;
     for (let c = 0; c < s; c++) {
       l = o && c in o ? o[c] : e[c];
-      if (l === Y) continue;
+      if (l === re) continue;
       if (t && isWrappable(l)) wrap(l, i);
       if ((f = snapshotImpl(l, t, n, r)) !== l || u) {
         if (!u) n.set(e, (u = [...e]));
@@ -2760,13 +2807,13 @@ function deep(e) {
 function trueFn() {
   return true;
 }
-const he = {
+const me = {
   get(e, t, n) {
-    if (t === X) return n;
+    if (t === ne) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === X) return true;
+    if (t === ne) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2789,23 +2836,23 @@ const he = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const pe = Symbol(0);
+const be = Symbol(0);
 function merge(...e) {
   if (e.length === 1 && typeof e[0] !== "function") return e[0];
   let t = false;
   const n = [];
   for (let r = 0; r < e.length; r++) {
     const i = e[r];
-    t = t || (!!i && X in i);
-    const s = !!i && i[pe];
+    t = t || (!!i && ne in i);
+    const s = !!i && i[be];
     if (s) n.push(...s);
     else n.push(typeof i === "function" ? ((t = true), createMemo(i)) : i);
   }
-  if (b && t) {
+  if (k && t) {
     return new Proxy(
       {
         get(e) {
-          if (e === pe) return n;
+          if (e === be) return n;
           for (let t = n.length - 1; t >= 0; t--) {
             const r = resolveSource(n[t]);
             if (e in r) return r[e];
@@ -2823,7 +2870,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      he
+      me
     );
   }
   const r = Object.create(null);
@@ -2855,12 +2902,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[pe] = n;
+  o[be] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (b && X in e) {
+  if (k && ne in e) {
     return new Proxy(
       {
         get(t) {
@@ -2873,7 +2920,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      he
+      me
     );
   }
   const r = {};
@@ -2891,69 +2938,69 @@ function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
   const i = t.length > 1;
   const s = t;
-  const o = computed(
-    updateKeyedMap.bind({
-      ze: createOwner(),
-      Ue: 0,
-      Je: e,
-      Xe: [],
-      Ye: s,
-      Ze: [],
-      $e: [],
-      et: r,
-      tt: r || n?.keyed === false ? [] : undefined,
-      nt: i ? [] : undefined,
-      rt: n?.fallback
-    })
-  );
-  o.xe = true;
-  return accessor(o);
+  const o = {
+    Be: createOwner(),
+    Ke: 0,
+    Ge: e,
+    ze: [],
+    Ue: s,
+    Je: [],
+    Xe: [],
+    Ye: r,
+    Ze: r || n?.keyed === false ? [] : undefined,
+    $e: i ? [] : undefined,
+    et: n?.fallback
+  };
+  const u = computed(updateKeyedMap.bind(o));
+  o.Be.u = u;
+  u.de &= ~g;
+  return accessor(u);
 }
-const ye = { ownedWrite: true };
+const _e = { ownedWrite: true };
 function updateKeyedMap() {
-  const e = this.Je() || [],
+  const e = this.Ge() || [],
     t = e.length;
-  e[U];
-  runWithOwner(this.ze, () => {
+  e[ee];
+  runWithOwner(this.Be, () => {
     let n,
       r,
-      i = this.tt
+      i = this.Ze
         ? () => {
-            this.tt[r] = signal(e[r], ye);
-            this.nt && (this.nt[r] = signal(r, ye));
-            return this.Ye(accessor(this.tt[r]), this.nt ? accessor(this.nt[r]) : undefined);
+            this.Ze[r] = signal(e[r], _e);
+            this.$e && (this.$e[r] = signal(r, _e));
+            return this.Ue(accessor(this.Ze[r]), this.$e ? accessor(this.$e[r]) : undefined);
           }
-        : this.nt
+        : this.$e
           ? () => {
               const t = e[r];
-              this.nt[r] = signal(r, ye);
-              return this.Ye(() => t, accessor(this.nt[r]));
+              this.$e[r] = signal(r, _e);
+              return this.Ue(() => t, accessor(this.$e[r]));
             }
           : () => {
               const t = e[r];
-              return this.Ye(() => t);
+              return this.Ue(() => t);
             };
     if (t === 0) {
-      if (this.Ue !== 0) {
-        this.ze.dispose(false);
-        this.$e = [];
+      if (this.Ke !== 0) {
+        this.Be.dispose(false);
         this.Xe = [];
-        this.Ze = [];
-        this.Ue = 0;
-        this.tt && (this.tt = []);
-        this.nt && (this.nt = []);
-      }
-      if (this.rt && !this.Ze[0]) {
-        this.Ze[0] = runWithOwner((this.$e[0] = createOwner()), this.rt);
-      }
-    } else if (this.Ue === 0) {
-      if (this.$e[0]) this.$e[0].dispose();
-      this.Ze = new Array(t);
+        this.ze = [];
+        this.Je = [];
+        this.Ke = 0;
+        this.Ze && (this.Ze = []);
+        this.$e && (this.$e = []);
+      }
+      if (this.et && !this.Je[0]) {
+        this.Je[0] = runWithOwner((this.Xe[0] = createOwner()), this.et);
+      }
+    } else if (this.Ke === 0) {
+      if (this.Xe[0]) this.Xe[0].dispose();
+      this.Je = new Array(t);
       for (r = 0; r < t; r++) {
-        this.Xe[r] = e[r];
-        this.Ze[r] = runWithOwner((this.$e[r] = createOwner()), i);
+        this.ze[r] = e[r];
+        this.Je[r] = runWithOwner((this.Xe[r] = createOwner()), i);
       }
-      this.Ue = t;
+      this.Ke = t;
     } else {
       let s,
         o,
@@ -2964,149 +3011,149 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         h = new Array(t),
-        p = this.tt ? new Array(t) : undefined,
-        y = this.nt ? new Array(t) : undefined;
+        p = this.Ze ? new Array(t) : undefined,
+        y = this.$e ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Ue, t);
-        s < o && (this.Xe[s] === e[s] || (this.tt && compare(this.et, this.Xe[s], e[s])));
+        s = 0, o = Math.min(this.Ke, t);
+        s < o && (this.ze[s] === e[s] || (this.Ze && compare(this.Ye, this.ze[s], e[s])));
         s++
       ) {
-        if (this.tt) setSignal(this.tt[s], e[s]);
+        if (this.Ze) setSignal(this.Ze[s], e[s]);
       }
       for (
-        o = this.Ue - 1, u = t - 1;
+        o = this.Ke - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Xe[o] === e[u] || (this.tt && compare(this.et, this.Xe[o], e[u])));
+        (this.ze[o] === e[u] || (this.Ze && compare(this.Ye, this.ze[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Ze[o];
-        h[u] = this.$e[o];
-        p && (p[u] = this.tt[o]);
-        y && (y[u] = this.nt[o]);
+        d[u] = this.Je[o];
+        h[u] = this.Xe[o];
+        p && (p[u] = this.Ze[o]);
+        y && (y[u] = this.$e[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        l = this.et ? this.et(f) : f;
+        l = this.Ye ? this.Ye(f) : f;
         n = c.get(l);
         a[r] = n === undefined ? -1 : n;
         c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.Xe[n];
-        l = this.et ? this.et(f) : f;
+        f = this.ze[n];
+        l = this.Ye ? this.Ye(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Ze[n];
-          h[r] = this.$e[n];
-          p && (p[r] = this.tt[n]);
-          y && (y[r] = this.nt[n]);
+          d[r] = this.Je[n];
+          h[r] = this.Xe[n];
+          p && (p[r] = this.Ze[n]);
+          y && (y[r] = this.$e[n]);
           r = a[r];
           c.set(l, r);
-        } else this.$e[n].dispose();
+        } else this.Xe[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Ze[r] = d[r];
-          this.$e[r] = h[r];
+          this.Je[r] = d[r];
+          this.Xe[r] = h[r];
           if (p) {
-            this.tt[r] = p[r];
-            setSignal(this.tt[r], e[r]);
+            this.Ze[r] = p[r];
+            setSignal(this.Ze[r], e[r]);
           }
           if (y) {
-            this.nt[r] = y[r];
-            setSignal(this.nt[r], r);
+            this.$e[r] = y[r];
+            setSignal(this.$e[r], r);
           }
         } else {
-          this.Ze[r] = runWithOwner((this.$e[r] = createOwner()), i);
+          this.Je[r] = runWithOwner((this.Xe[r] = createOwner()), i);
         }
       }
-      this.Ze = this.Ze.slice(0, (this.Ue = t));
-      this.Xe = e.slice(0);
+      this.Je = this.Je.slice(0, (this.Ke = t));
+      this.ze = e.slice(0);
     }
   });
-  return this.Ze;
+  return this.Je;
 }
 function repeat(e, t, n) {
   const r = t;
   const i = computed(
     updateRepeat.bind({
-      ze: createOwner(),
-      Ue: 0,
-      it: 0,
-      st: e,
-      Ye: r,
-      $e: [],
-      Ze: [],
-      ot: n?.from,
-      rt: n?.fallback
+      Be: createOwner(),
+      Ke: 0,
+      tt: 0,
+      nt: e,
+      Ue: r,
+      Xe: [],
+      Je: [],
+      rt: n?.from,
+      et: n?.fallback
     })
   );
-  i.xe = true;
+  i.de &= ~g;
   return accessor(i);
 }
 function updateRepeat() {
-  const e = this.st();
-  const t = this.ot?.() || 0;
-  runWithOwner(this.ze, () => {
+  const e = this.nt();
+  const t = this.rt?.() || 0;
+  runWithOwner(this.Be, () => {
     if (e === 0) {
-      if (this.Ue !== 0) {
-        this.ze.dispose(false);
-        this.$e = [];
-        this.Ze = [];
-        this.Ue = 0;
+      if (this.Ke !== 0) {
+        this.Be.dispose(false);
+        this.Xe = [];
+        this.Je = [];
+        this.Ke = 0;
       }
-      if (this.rt && !this.Ze[0]) {
-        this.Ze[0] = runWithOwner((this.$e[0] = createOwner()), this.rt);
+      if (this.et && !this.Je[0]) {
+        this.Je[0] = runWithOwner((this.Xe[0] = createOwner()), this.et);
       }
       return;
     }
     const n = t + e;
-    const r = this.it + this.Ue;
-    if (this.Ue === 0 && this.$e[0]) this.$e[0].dispose();
-    for (let e = n; e < r; e++) this.$e[e - this.it].dispose();
-    if (this.it < t) {
-      let e = this.it;
-      while (e < t && e < this.Ue) this.$e[e++].dispose();
-      this.$e.splice(0, t - this.it);
-      this.Ze.splice(0, t - this.it);
-    } else if (this.it > t) {
-      let n = r - this.it - 1;
-      let i = this.it - t;
-      this.$e.length = this.Ze.length = e;
+    const r = this.tt + this.Ke;
+    if (this.Ke === 0 && this.Xe[0]) this.Xe[0].dispose();
+    for (let e = n; e < r; e++) this.Xe[e - this.tt].dispose();
+    if (this.tt < t) {
+      let e = this.tt;
+      while (e < t && e < this.Ke) this.Xe[e++].dispose();
+      this.Xe.splice(0, t - this.tt);
+      this.Je.splice(0, t - this.tt);
+    } else if (this.tt > t) {
+      let n = r - this.tt - 1;
+      let i = this.tt - t;
+      this.Xe.length = this.Je.length = e;
       while (n >= i) {
-        this.$e[n] = this.$e[n - i];
-        this.Ze[n] = this.Ze[n - i];
+        this.Xe[n] = this.Xe[n - i];
+        this.Je[n] = this.Je[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.Ze[e] = runWithOwner((this.$e[e] = createOwner()), () => this.Ye(e + t));
+        this.Je[e] = runWithOwner((this.Xe[e] = createOwner()), () => this.Ue(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Ze[e - t] = runWithOwner((this.$e[e - t] = createOwner()), () => this.Ye(e));
+      this.Je[e - t] = runWithOwner((this.Xe[e - t] = createOwner()), () => this.Ue(e));
     }
-    this.Ze = this.Ze.slice(0, e);
-    this.it = t;
-    this.Ue = e;
+    this.Je = this.Je.slice(0, e);
+    this.tt = t;
+    this.Ke = e;
   });
-  return this.Ze;
+  return this.Je;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, { lazy: true });
-  n.Qe = (e, t) => {
+  n.Te = (e, t) => {
     const r = e !== undefined ? e : n.ge;
-    const i = t !== undefined ? t : n.de;
-    n.ge &= ~n.ut;
-    n.K.notify(n, n.ut, r, i);
+    const i = t !== undefined ? t : n.he;
+    n.ge &= ~n.it;
+    n.K.notify(n, n.it, r, i);
   };
-  n.ut = t;
-  n.xe = true;
+  n.it = t;
+  n.de &= ~g;
   recompute(n, true);
   return n;
 }
@@ -3119,61 +3166,61 @@ function createBoundChildren(e, t, n, r) {
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
-const ge = Symbol();
-const Se = createContext(null);
-let we = false;
+const Oe = Symbol();
+const ve = createContext(null);
+let xe = false;
 const FALSE_ACCESSOR = () => false;
 const SEQUENTIAL_ACCESSOR = () => "sequential";
 function isRevealController(e) {
   return e instanceof RevealController;
 }
 function isSlotReady(e) {
-  return isRevealController(e) ? e.isReady() : e.ft.size === 0 && !e.lt;
+  return isRevealController(e) ? e.isReady() : e.st.size === 0 && !e.ot;
 }
 function isSlotMinimallyReady(e) {
   return isRevealController(e) ? e.isMinimallyReady() : isSlotReady(e);
 }
 function setSlotState(e, t, n, r) {
-  setSignal(e.ct, n);
-  setSignal(e.dt, r);
+  setSignal(e.ut, n);
+  setSignal(e.ft, r);
   if (isRevealController(e)) {
-    if (!n && e.ht === t) e.ht = undefined;
+    if (!n && e.lt === t) e.lt = undefined;
     return e.evaluate(n, r);
   }
-  if (!n && e.yt === t && e.gt) e.yt = undefined;
+  if (!n && e.ct === t && e.dt) e.ct = undefined;
 }
 class RevealController {
-  St;
-  wt;
-  bt = [];
   ht;
-  ct = signal(false, { ownedWrite: true, Me: true });
-  dt = signal(false, { ownedWrite: true, Me: true });
-  _t = true;
-  Ot = true;
-  vt = false;
+  yt;
+  gt = [];
+  lt;
+  ut = signal(false, { ownedWrite: true, Qe: true });
+  ft = signal(false, { ownedWrite: true, Qe: true });
+  St = true;
+  wt = true;
+  bt = false;
   constructor(e, t) {
-    this.St = e;
-    this.wt = t;
+    this.ht = e;
+    this.yt = t;
   }
-  xt(e) {
-    for (let t = 0; t < this.bt.length; t++) {
-      const n = this.bt[t];
-      if ((isRevealController(n) ? n.ht : n.yt) !== this) continue;
+  _t(e) {
+    for (let t = 0; t < this.gt.length; t++) {
+      const n = this.gt[t];
+      if ((isRevealController(n) ? n.lt : n.ct) !== this) continue;
       if (e(n) === false) return false;
     }
     return true;
   }
   isReady() {
-    return this.xt(isSlotReady);
+    return this._t(isSlotReady);
   }
   isMinimallyReady() {
-    const e = untrack(this.St);
+    const e = untrack(this.ht);
     if (e === "together") return this.isReady();
     if (e === "natural") {
       let e = false;
       let t = false;
-      this.xt(n => {
+      this._t(n => {
         e = true;
         if (isSlotMinimallyReady(n)) {
           t = true;
@@ -3183,58 +3230,58 @@ class RevealController {
       return !e || t;
     }
     let t = true;
-    this.xt(e => {
+    this._t(e => {
       t = isSlotMinimallyReady(e);
       return false;
     });
     return t;
   }
   register(e) {
-    if (this.bt.includes(e)) return;
-    this.bt.push(e);
-    const t = untrack(this.St);
-    (setSignal(e.ct, true), setSignal(e.dt, t === "sequential" ? !!untrack(this.wt) : false));
+    if (this.gt.includes(e)) return;
+    this.gt.push(e);
+    const t = untrack(this.ht);
+    (setSignal(e.ut, true), setSignal(e.ft, t === "sequential" ? !!untrack(this.yt) : false));
     untrack(() => this.evaluate());
   }
   unregister(e) {
-    const t = this.bt.indexOf(e);
-    if (t >= 0) this.bt.splice(t, 1);
+    const t = this.gt.indexOf(e);
+    if (t >= 0) this.gt.splice(t, 1);
     untrack(() => this.evaluate());
   }
   evaluate(e, t) {
-    if (this.vt) return;
-    this.vt = true;
-    const n = this._t;
-    const r = this.Ot;
+    if (this.bt) return;
+    this.bt = true;
+    const n = this.St;
+    const r = this.wt;
     try {
-      const n = e ?? read(this.ct),
-        r = untrack(this.St),
-        i = r === "sequential" && !!untrack(this.wt),
+      const n = e ?? read(this.ut),
+        r = untrack(this.ht),
+        i = r === "sequential" && !!untrack(this.yt),
         s = t ?? i;
       if (n) {
-        this.xt(e => setSlotState(e, this, true, s));
+        this._t(e => setSlotState(e, this, true, s));
       } else if (r === "natural") {
-        this.xt(e => {
+        this._t(e => {
           if (isRevealController(e)) {
-            setSignal(e.dt, false);
-            setSignal(e.ct, false);
+            setSignal(e.ft, false);
+            setSignal(e.ut, false);
             e.evaluate(false, false);
           } else {
             setSlotState(e, this, !isSlotReady(e), false);
           }
         });
       } else if (r === "together") {
-        const e = this.xt(isSlotMinimallyReady);
-        this.xt(t => setSlotState(t, this, !e, false));
+        const e = this._t(isSlotMinimallyReady);
+        this._t(t => setSlotState(t, this, !e, false));
       } else {
         let e = false;
-        this.xt(t => {
+        this._t(t => {
           if (e) return setSlotState(t, this, true, i);
           if (isSlotReady(t)) return setSlotState(t, this, false, false);
           e = true;
           if (isRevealController(t)) {
-            setSignal(t.dt, false);
-            setSignal(t.ct, false);
+            setSignal(t.ft, false);
+            setSignal(t.ut, false);
             t.evaluate(false, false);
           } else {
             setSlotState(t, this, true, false);
@@ -3242,92 +3289,92 @@ class RevealController {
         });
       }
     } finally {
-      this._t = this.isReady();
-      this.Ot = this.isMinimallyReady();
-      this.vt = false;
+      this.St = this.isReady();
+      this.wt = this.isMinimallyReady();
+      this.bt = false;
     }
-    if (this.ht && (n !== this._t || r !== this.Ot)) this.ht.evaluate();
+    if (this.lt && (n !== this.St || r !== this.wt)) this.lt.evaluate();
   }
 }
 class CollectionQueue extends Queue {
-  Pt;
-  ft = new Set();
-  kt;
-  lt = true;
-  ct = signal(false, { ownedWrite: true, Me: true });
-  dt = signal(false, { ownedWrite: true, Me: true });
-  yt;
-  gt = false;
-  Et;
-  Ct = ge;
+  Ot;
+  st = new Set();
+  vt;
+  ot = true;
+  ut = signal(false, { ownedWrite: true, Qe: true });
+  ft = signal(false, { ownedWrite: true, Qe: true });
+  ct;
+  dt = false;
+  xt;
+  Pt = Oe;
   constructor(e) {
     super();
-    this.Pt = e;
+    this.Ot = e;
   }
   run(e) {
-    if (!e || (read(this.ct) && (!we || read(this.dt)))) return;
+    if (!e || (read(this.ut) && (!xe || read(this.ft)))) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.Pt)) return super.notify(e, t, n, r);
-    if (this.gt && this.Et) {
+    if (!(t & this.Ot)) return super.notify(e, t, n, r);
+    if (this.dt && this.xt) {
       const e = untrack(() => {
         try {
-          return this.Et();
+          return this.xt();
         } catch {
-          return ge;
+          return Oe;
         }
       });
-      if (e !== this.Ct) {
-        this.Ct = e;
-        this.gt = false;
-        this.ft.clear();
+      if (e !== this.Pt) {
+        this.Pt = e;
+        this.dt = false;
+        this.st.clear();
       }
     }
-    if (this.Pt & a && this.gt) return super.notify(e, t, n, r);
-    if (this.Pt & a && n & d) {
-      return super.notify(e, d, n, r);
+    if (this.Ot & S && this.dt) return super.notify(e, t, n, r);
+    if (this.Ot & S && n & w) {
+      return super.notify(e, w, n, r);
     }
-    if (n & this.Pt) {
-      this.lt = true;
-      const t = r?.source || e.de?.source;
+    if (n & this.Ot) {
+      this.ot = true;
+      const t = r?.source || e.he?.source;
       if (t) {
-        const e = this.ft.size === 0;
-        this.ft.add(t);
-        if (e) setSignal(this.ct, true);
+        const e = this.st.size === 0;
+        this.st.add(t);
+        if (e) setSignal(this.ut, true);
       }
     }
-    t &= ~this.Pt;
+    t &= ~this.Ot;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.ft) {
-      if (e.m & u || (!(e.ge & this.Pt) && !(this.Pt & d && e.ge & a))) this.ft.delete(e);
+    for (const e of this.st) {
+      if (e.m & u || (!(e.ge & this.Ot) && !(this.Ot & w && e.ge & S))) this.st.delete(e);
     }
-    if (!this.ft.size) {
-      if (this.Pt & a && this.lt && !this.gt && this.kt) {
-        this.lt = !!(this.kt.ge & this.Pt);
+    if (!this.st.size) {
+      if (this.Ot & S && this.ot && !this.dt && this.vt) {
+        this.ot = !!(this.vt.ge & this.Ot);
       } else {
-        this.lt = false;
+        this.ot = false;
       }
-      if (!this.lt) {
-        setSignal(this.ct, false);
-        if (this.Et) {
+      if (!this.ot) {
+        setSignal(this.ut, false);
+        if (this.xt) {
           try {
-            this.Ct = untrack(() => this.Et());
+            this.Pt = untrack(() => this.xt());
           } catch {}
         }
       }
     }
-    if (we) this.yt?.evaluate();
+    if (xe) this.ct?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, r) {
   const i = createOwner();
-  if (we) setContext(Se, null, i);
+  if (xe) setContext(ve, null, i);
   const s = new CollectionQueue(e);
-  if (r) s.Et = r;
-  const o = (s.kt = createBoundChildren(i, t, s, e));
+  if (r) s.xt = r;
+  const o = (s.vt = createBoundChildren(i, t, s, e));
   untrack(() => {
     let t = false;
     try {
@@ -3336,45 +3383,46 @@ function createCollectionBoundary(e, t, n, r) {
       if (e instanceof NotReadyError) t = true;
       else throw e;
     }
-    s.lt = t || !!(o.ge & e) || o.de instanceof NotReadyError;
+    s.ot = t || !!(o.ge & e) || o.he instanceof NotReadyError;
   });
-  const u = we && e === a ? getContext(Se) : null;
+  const u = xe && e === S ? getContext(ve) : null;
   if (u) {
-    s.yt = u;
+    s.ct = u;
     u.register(s);
     cleanup(() => u.unregister(s));
   }
-  const f = computed(() => {
-    if (!read(s.ct)) {
-      const e = read(o);
-      if (!untrack(() => read(s.ct))) return ((s.gt = true), e);
-    }
-    if (we && read(s.dt)) return undefined;
-    return n(s);
-  });
-  return accessor(f);
+  return accessor(
+    computed(() => {
+      if (!read(s.ut)) {
+        const e = read(o);
+        if (!untrack(() => read(s.ut))) return ((s.dt = true), e);
+      }
+      if (xe && read(s.ft)) return undefined;
+      return n(s);
+    })
+  );
 }
 function createLoadingBoundary(e, t, n) {
-  return createCollectionBoundary(a, e, () => t(), n?.on);
+  return createCollectionBoundary(S, e, () => t(), n?.on);
 }
 function createErrorBoundary(e, t) {
-  return createCollectionBoundary(d, e, e => {
-    let n = e.ft.values().next().value;
-    const r = n.de?.cause ?? n.de;
+  return createCollectionBoundary(w, e, e => {
+    let n = e.st.values().next().value;
+    const r = n.he?.cause ?? n.he;
     return t(r, () => {
-      for (const t of e.ft) recompute(t);
+      for (const t of e.st) recompute(t);
       schedule();
     });
   });
 }
 function createRevealOrder(e, t) {
-  we = true;
+  xe = true;
   const n = createOwner();
-  const r = getContext(Se);
+  const r = getContext(ve);
   const i = t?.order || SEQUENTIAL_ACCESSOR,
     s = t?.collapsed || FALSE_ACCESSOR;
   const o = new RevealController(i, s);
-  setContext(Se, o, n);
+  setContext(ve, o, n);
   return runWithOwner(n, () => {
     const t = e();
     computed(() => {
@@ -3383,7 +3431,7 @@ function createRevealOrder(e, t) {
       o.evaluate();
     });
     if (r) {
-      o.ht = r;
+      o.lt = r;
       r.register(o);
       cleanup(() => r.unregister(o));
     }
@@ -3439,16 +3487,16 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-const me = undefined;
-exports.$PROXY = X;
-exports.$REFRESH = O;
-exports.$TARGET = J;
-exports.$TRACK = U;
+const Pe = undefined;
+exports.$PROXY = ne;
+exports.$REFRESH = C;
+exports.$TARGET = te;
+exports.$TRACK = ee;
 exports.ContextNotFoundError = ContextNotFoundError;
-exports.DEV = me;
+exports.DEV = Pe;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
-exports.SUPPORTS_PROXY = b;
+exports.SUPPORTS_PROXY = k;
 exports.action = action;
 exports.clearSnapshots = clearSnapshots;
 exports.createContext = createContext;
@@ -3498,5 +3546,5 @@ exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
 exports.snapshot = snapshot;
-exports.storePath = de;
+exports.storePath = we;
 exports.untrack = untrack;