@solidjs/signals 0.13.11 → 0.13.12

package/dist/node.cjs

@@ -142,66 +142,25 @@ function adjustHeight(e, t) {
     }
   }
 }
-const x = {};
-const v = {
-  hooks: x,
-  getChildren: getChildren,
-  getSignals: getSignals,
-  getParent: getParent,
-  getSources: getSources,
-  getObservers: getObservers
-};
-function getChildren(e) {
-  const t = [];
-  let n = e.T;
-  while (n) {
-    t.push(n);
-    n = n.H;
-  }
-  return t;
-}
-function getSignals(e) {
-  return e.q ? [...e.q] : [];
-}
-function getParent(e) {
-  return e.i;
-}
-function getSources(e) {
-  const t = [];
-  let n = e.N;
-  while (n) {
-    t.push(n.R);
-    n = n.j;
-  }
-  return t;
-}
-function getObservers(e) {
-  const t = [];
-  let n = e.O;
-  while (n) {
-    t.push(n.k);
-    n = n.P;
-  }
-  return t;
-}
-const P = new Set();
+const x = undefined;
+const v = new Set();
+const P = { l: new Array(2e3).fill(undefined), _: false, A: 0, S: 0 };
 const k = { l: new Array(2e3).fill(undefined), _: false, A: 0, S: 0 };
-const E = { l: new Array(2e3).fill(undefined), _: false, A: 0, S: 0 };
-let C = 0;
-let W = null;
+let E = 0;
+let C = null;
+let W = false;
 let A = false;
-let N = false;
-let j = null;
+let N = null;
 function enforceLoadingBoundary(e) {}
 function shouldReadStashedOptimisticValue(e) {
-  return !!j?.has(e);
+  return !!N?.has(e);
 }
 function runLaneEffects(e) {
-  for (const t of I) {
-    if (t.D || t.F.size > 0) continue;
-    const n = t.V[e - 1];
+  for (const t of L) {
+    if (t.T || t.H.size > 0) continue;
+    const n = t.q[e - 1];
     if (n.length) {
-      t.V[e - 1] = [];
+      t.q[e - 1] = [];
       runQueue(n, e);
     }
   }
@@ -209,83 +168,83 @@ function runLaneEffects(e) {
 function queueStashedOptimisticEffects(e) {
   for (let t = e.O; t !== null; t = t.P) {
     const e = t.k;
-    if (!e.M) continue;
-    if (e.M === y) {
-      if (!e.B) {
-        e.B = true;
-        e.G.enqueue(g, e.K);
+    if (!e.D) continue;
+    if (e.D === y) {
+      if (!e.F) {
+        e.F = true;
+        e.M.enqueue(g, e.V);
       }
       continue;
     }
-    const n = e.m & o ? E : k;
+    const n = e.m & o ? k : P;
     if (n.A > e.o) n.A = e.o;
     insertIntoHeap(e, n);
   }
 }
 function setProjectionWriteActive(e) {
-  N = e;
+  A = 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;
-  }
-  e.Y.push(...t.Y);
-  for (const n of t.Z) e.Z.add(n);
-  for (const n of t.$) {
-    if (!e.$.includes(n)) e.$.push(n);
+  t.B = e;
+  e.G.push(...t.G);
+  for (const n of L) if (n.K === t) n.K = e;
+  e.U.push(...t.U);
+  for (const n of t.J) e.J.add(n);
+  for (const [n, r] of t.X) {
+    let t = e.X.get(n);
+    if (!t) e.X.set(n, (t = new Set()));
+    for (const e of r) t.add(e);
   }
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.ee = undefined;
-    if (n.te !== S) {
-      n.ne = n.te;
-      n.te = S;
+    n.Y = undefined;
+    if (n.Z !== S) {
+      n.$ = n.Z;
+      n.Z = S;
     }
-    const r = n.re;
-    n.re = S;
-    if (r !== S && n.ne !== r) insertSubs(n, true);
-    n.X = null;
+    const r = n.ee;
+    n.ee = S;
+    if (r !== S && n.$ !== r) insertSubs(n, true);
+    n.K = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
-  for (const t of I) {
-    const n = e ? t.X === e : !t.X;
+  for (const t of L) {
+    const n = e ? t.K === e : !t.K;
     if (!n) continue;
-    if (!t.D) {
-      if (t.V[0].length) runQueue(t.V[0], p);
-      if (t.V[1].length) runQueue(t.V[1], g);
+    if (!t.T) {
+      if (t.q[0].length) runQueue(t.q[0], p);
+      if (t.q[1].length) runQueue(t.q[1], g);
     }
-    if (t.ie.ee === t) t.ie.ee = undefined;
-    t.F.clear();
-    t.V[0].length = 0;
-    t.V[1].length = 0;
-    I.delete(t);
-    L.delete(t.ie);
+    if (t.te.Y === t) t.te.Y = undefined;
+    t.H.clear();
+    t.q[0].length = 0;
+    t.q[1].length = 0;
+    L.delete(t);
+    R.delete(t.te);
   }
 }
 function schedule() {
-  if (A) return;
-  A = true;
-  if (!R.se && !N) queueMicrotask(flush);
+  if (W) return;
+  W = true;
+  if (!j.ne && !A) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  oe = [[], []];
-  ue = [];
-  created = C;
+  re = [[], []];
+  ie = [];
+  created = E;
   addChild(e) {
-    this.ue.push(e);
+    this.ie.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.ue.indexOf(e);
+    const t = this.ie.indexOf(e);
     if (t >= 0) {
-      this.ue.splice(t, 1);
+      this.ie.splice(t, 1);
       e.i = null;
     }
   }
@@ -294,124 +253,125 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.oe[e - 1].length) {
-      const t = this.oe[e - 1];
-      this.oe[e - 1] = [];
+    if (this.re[e - 1].length) {
+      const t = this.re[e - 1];
+      this.re[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.ue.length; t++) this.ue[t].run?.(e);
+    for (let t = 0; t < this.ie.length; t++) this.ie[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
-      if (G) {
-        const n = findLane(G);
-        n.V[e - 1].push(t);
+      if (B) {
+        const n = findLane(B);
+        n.q[e - 1].push(t);
       } else {
-        this.oe[e - 1].push(t);
+        this.re[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.oe[0].push(...this.oe[0]);
-    e.oe[1].push(...this.oe[1]);
-    this.oe = [[], []];
-    for (let t = 0; t < this.ue.length; t++) {
-      let n = this.ue[t];
-      let r = e.ue[t];
+    e.re[0].push(...this.re[0]);
+    e.re[1].push(...this.re[1]);
+    this.re = [[], []];
+    for (let t = 0; t < this.ie.length; t++) {
+      let n = this.ie[t];
+      let r = e.ie[t];
       if (!r) {
-        r = { oe: [[], []], ue: [] };
-        e.ue[t] = r;
+        r = { re: [[], []], ie: [] };
+        e.ie[t] = r;
       }
       n.stashQueues(r);
     }
   }
   restoreQueues(e) {
-    this.oe[0].push(...e.oe[0]);
-    this.oe[1].push(...e.oe[1]);
-    for (let t = 0; t < e.ue.length; t++) {
-      const n = e.ue[t];
-      let r = this.ue[t];
+    this.re[0].push(...e.re[0]);
+    this.re[1].push(...e.re[1]);
+    for (let t = 0; t < e.ie.length; t++) {
+      const n = e.ie[t];
+      let r = this.ie[t];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  se = false;
-  fe = [];
-  Y = [];
-  Z = new Set();
-  static le;
-  static ce;
-  static ae = null;
+  ne = false;
+  se = [];
+  U = [];
+  J = new Set();
+  static oe;
+  static ue;
+  static fe = null;
   flush() {
-    if (this.se) return;
-    this.se = true;
+    if (this.ne) return;
+    this.ne = true;
     try {
-      runHeap(k, GlobalQueue.le);
-      if (W) {
-        const e = transitionComplete(W);
+      runHeap(P, GlobalQueue.oe);
+      if (C) {
+        const e = transitionComplete(C);
         if (!e) {
-          const e = W;
-          runHeap(E, GlobalQueue.le);
-          this.fe = [];
-          this.Y = [];
-          this.Z = new Set();
+          const e = C;
+          runHeap(k, GlobalQueue.oe);
+          this.se = [];
+          this.U = [];
+          this.J = new Set();
           runLaneEffects(p);
           runLaneEffects(g);
-          this.stashQueues(e.de);
-          C++;
-          A = k.S >= k.A;
-          reassignPendingTransition(e.fe);
-          W = null;
-          if (!e.J.length && e.Y.length) {
-            j = new Set();
-            for (let t = 0; t < e.Y.length; t++) {
-              const n = e.Y[t];
-              if (n.I || n.he) continue;
-              j.add(n);
+          this.stashQueues(e.le);
+          E++;
+          W = P.S >= P.A;
+          reassignPendingTransition(e.se);
+          C = null;
+          if (!e.G.length && e.U.length) {
+            N = new Set();
+            for (let t = 0; t < e.U.length; t++) {
+              const n = e.U[t];
+              if (n.I || n.ce) continue;
+              N.add(n);
               queueStashedOptimisticEffects(n);
             }
           }
           try {
             finalizePureQueue(null, true);
           } finally {
-            j = null;
+            N = null;
           }
           return;
         }
-        this.fe !== W.fe && this.fe.push(...W.fe);
-        this.restoreQueues(W.de);
-        P.delete(W);
-        const t = W;
-        W = null;
-        reassignPendingTransition(this.fe);
+        this.se !== C.se && this.se.push(...C.se);
+        this.restoreQueues(C.le);
+        v.delete(C);
+        const t = C;
+        C = null;
+        reassignPendingTransition(this.se);
         finalizePureQueue(t);
       } else {
-        if (P.size) runHeap(E, GlobalQueue.le);
+        if (v.size) runHeap(k, GlobalQueue.oe);
         finalizePureQueue();
       }
-      C++;
-      A = k.S >= k.A;
+      E++;
+      W = P.S >= P.A;
       runLaneEffects(p);
       this.run(p);
       runLaneEffects(g);
       this.run(g);
       if (false);
     } finally {
-      this.se = false;
+      this.ne = false;
     }
   }
   notify(e, t, n, r) {
     if (t & a) {
       if (n & a) {
-        const t = r !== undefined ? r : e.pe;
-        if (W && t) {
-          const e = t.source;
-          if (!W.$.includes(e)) {
-            W.$.push(e);
-            schedule();
-          }
+        const t = r !== undefined ? r : e.ae;
+        if (C && t) {
+          const n = t.source;
+          let r = C.X.get(n);
+          if (!r) C.X.set(n, (r = new Set()));
+          const i = r.size;
+          r.add(e);
+          if (r.size !== i) schedule();
         }
       }
       return true;
@@ -420,57 +380,57 @@ class GlobalQueue extends Queue {
   }
   initTransition(e) {
     if (e) e = currentTransition(e);
-    if (e && e === W) return;
-    if (!e && W && W.ge === C) return;
-    if (!W) {
-      W = e ?? {
-        ge: C,
-        fe: [],
-        $: [],
-        Y: [],
-        Z: new Set(),
-        J: [],
-        de: { oe: [[], []], ue: [] },
-        U: false
+    if (e && e === C) return;
+    if (!e && C && C.de === E) return;
+    if (!C) {
+      C = e ?? {
+        de: E,
+        se: [],
+        X: new Map(),
+        U: [],
+        J: new Set(),
+        G: [],
+        le: { re: [[], []], ie: [] },
+        B: false
       };
     } else if (e) {
-      const t = W;
+      const t = C;
       mergeTransitionState(e, t);
-      P.delete(t);
-      W = e;
+      v.delete(t);
+      C = e;
     }
-    P.add(W);
-    W.ge = C;
-    if (this.fe !== W.fe) {
-      for (let e = 0; e < this.fe.length; e++) {
-        const t = this.fe[e];
-        t.X = W;
-        W.fe.push(t);
+    v.add(C);
+    C.de = E;
+    if (this.se !== C.se) {
+      for (let e = 0; e < this.se.length; e++) {
+        const t = this.se[e];
+        t.K = C;
+        C.se.push(t);
       }
-      this.fe = W.fe;
+      this.se = C.se;
     }
-    if (this.Y !== W.Y) {
-      for (let e = 0; e < this.Y.length; e++) {
-        const t = this.Y[e];
-        t.X = W;
-        W.Y.push(t);
+    if (this.U !== C.U) {
+      for (let e = 0; e < this.U.length; e++) {
+        const t = this.U[e];
+        t.K = C;
+        C.U.push(t);
       }
-      this.Y = W.Y;
+      this.U = C.U;
     }
-    for (const e of I) {
-      if (!e.X) e.X = W;
+    for (const e of L) {
+      if (!e.K) e.K = C;
     }
-    if (this.Z !== W.Z) {
-      for (const e of this.Z) W.Z.add(e);
-      this.Z = W.Z;
+    if (this.J !== C.J) {
+      for (const e of this.J) C.J.add(e);
+      this.J = C.J;
     }
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.ee || G;
-  const r = e.ye !== undefined;
+  const n = e.Y || B;
+  const r = e.he !== undefined;
   for (let i = e.O; i !== null; i = i.P) {
-    if (r && i.k.Se) {
+    if (r && i.k.pe) {
       i.k.m |= l;
       continue;
     }
@@ -479,47 +439,47 @@ function insertSubs(e, t = false) {
       assignOrMergeLane(i.k, n);
     } else if (t) {
       i.k.m |= f;
-      i.k.ee = undefined;
+      i.k.Y = undefined;
     }
     const e = i.k;
-    if (e.M === y) {
-      if (!e.B) {
-        e.B = true;
-        e.G.enqueue(g, e.K);
+    if (e.D === y) {
+      if (!e.F) {
+        e.F = true;
+        e.M.enqueue(g, e.V);
       }
       continue;
     }
-    const s = i.k.m & o ? E : k;
+    const s = i.k.m & o ? k : P;
     if (s.A > i.k.o) s.A = i.k.o;
     insertIntoHeap(i.k, s);
   }
 }
 function commitPendingNodes() {
-  const e = R.fe;
+  const e = j.se;
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    if (n.te !== S) {
-      n.ne = n.te;
-      n.te = S;
-      if (n.M && n.M !== y) n.B = true;
+    if (n.Z !== S) {
+      n.$ = n.Z;
+      n.Z = S;
+      if (n.D && n.D !== y) n.F = true;
     }
-    if (!(n.we & a)) n.we &= ~h;
-    if (n.I) GlobalQueue.ce(n, false, true);
+    if (!(n.ge & a)) n.ge &= ~h;
+    if (n.I) GlobalQueue.ue(n, false, true);
   }
   e.length = 0;
 }
 function finalizePureQueue(e = null, t = false) {
   const n = !t;
   if (n) commitPendingNodes();
-  if (!t) checkBoundaryChildren(R);
-  if (k.S >= k.A) runHeap(k, GlobalQueue.le);
+  if (!t) checkBoundaryChildren(j);
+  if (P.S >= P.A) runHeap(P, GlobalQueue.oe);
   if (n) {
     commitPendingNodes();
-    resolveOptimisticNodes(e ? e.Y : R.Y);
-    const t = e ? e.Z : R.Z;
-    if (GlobalQueue.ae && t.size) {
+    resolveOptimisticNodes(e ? e.U : j.U);
+    const t = e ? e.J : j.J;
+    if (GlobalQueue.fe && t.size) {
       for (const e of t) {
-        GlobalQueue.ae(e);
+        GlobalQueue.fe(e);
       }
       t.clear();
       schedule();
@@ -528,160 +488,180 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.ue) {
+  for (const t of e.ie) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  R.Z.add(e);
+  j.J.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].X = W;
+    e[t].K = C;
   }
 }
-const R = new GlobalQueue();
+const j = new GlobalQueue();
 function flush() {
-  if (R.se) {
+  if (j.ne) {
     return;
   }
-  while (A || W) {
-    R.flush();
+  while (W || C) {
+    j.flush();
   }
 }
 function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
+function reporterBlocksSource(e, t) {
+  if (e.m & (o | u)) return false;
+  if (e.ye === t || e.Se?.has(t)) return true;
+  for (let n = e.N; n; n = n.j) {
+    let e = n.R;
+    while (e) {
+      if (e === t || e.L === t) return true;
+      e = e.we;
+    }
+  }
+  return !!(e.ge & a && e.ae instanceof NotReadyError && e.ae.source === t);
+}
 function transitionComplete(e) {
-  if (e.U) return true;
-  if (e.J.length) return false;
+  if (e.B) return true;
+  if (e.G.length) return false;
   let t = true;
-  for (let n = 0; n < e.$.length; n++) {
-    const r = e.$[n];
-    if (r.we & a && r.pe?.source === r) {
+  for (const [n, r] of e.X) {
+    let i = false;
+    for (const e of r) {
+      if (reporterBlocksSource(e, n)) {
+        i = true;
+        break;
+      }
+      r.delete(e);
+    }
+    if (!i) e.X.delete(n);
+    else if (n.ge & a && n.ae?.source === n) {
       t = false;
       break;
     }
   }
   if (t) {
-    for (let n = 0; n < e.Y.length; n++) {
-      const r = e.Y[n];
+    for (let n = 0; n < e.U.length; n++) {
+      const r = e.U[n];
       if (
         hasActiveOverride(r) &&
-        "we" in r &&
-        r.we & a &&
-        r.pe instanceof NotReadyError &&
-        r.pe.source !== r
+        "ge" in r &&
+        r.ge & a &&
+        r.ae instanceof NotReadyError &&
+        r.ae.source !== r
       ) {
         t = false;
         break;
       }
     }
   }
-  t && (e.U = true);
+  t && (e.B = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.U && typeof e.U === "object") e = e.U;
+  while (e.B && typeof e.B === "object") e = e.B;
   return e;
 }
 function setActiveTransition(e) {
-  W = e;
+  C = e;
 }
 function runInTransition(e, t) {
-  const n = W;
+  const n = C;
   try {
-    W = currentTransition(e);
+    C = currentTransition(e);
     return t();
   } finally {
-    W = n;
+    C = n;
   }
 }
-const L = new WeakMap();
-const I = new Set();
+const R = new WeakMap();
+const L = new Set();
 function getOrCreateLane(e) {
-  let t = L.get(e);
+  let t = R.get(e);
   if (t) {
     return findLane(t);
   }
-  const n = e.me;
-  const r = n?.ee ? findLane(n.ee) : null;
-  t = { ie: e, F: new Set(), V: [[], []], D: null, X: W, _e: r };
-  L.set(e, t);
-  I.add(t);
-  e.be = false;
+  const n = e.we;
+  const r = n?.Y ? findLane(n.Y) : null;
+  t = { te: e, H: new Set(), q: [[], []], T: null, K: C, me: r };
+  R.set(e, t);
+  L.add(t);
+  e._e = false;
   return t;
 }
 function findLane(e) {
-  while (e.D) e = e.D;
+  while (e.T) e = e.T;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.D = e;
-  for (const n of t.F) e.F.add(n);
-  e.V[0].push(...t.V[0]);
-  e.V[1].push(...t.V[1]);
+  t.T = e;
+  for (const n of t.H) e.H.add(n);
+  e.q[0].push(...t.q[0]);
+  e.q[1].push(...t.q[1]);
   return e;
 }
 function resolveLane(e) {
-  const t = e.ee;
+  const t = e.Y;
   if (!t) return undefined;
   const n = findLane(t);
-  if (I.has(n)) return n;
-  e.ee = undefined;
+  if (L.has(n)) return n;
+  e.Y = undefined;
   return undefined;
 }
 function resolveTransition(e) {
-  return resolveLane(e)?.X ?? e.X;
+  return resolveLane(e)?.K ?? e.K;
 }
 function hasActiveOverride(e) {
-  return !!(e.re !== undefined && e.re !== S);
+  return !!(e.ee !== undefined && e.ee !== S);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const r = e.ee;
+  const r = e.Y;
   if (r) {
-    if (r.D) {
-      e.ee = t;
+    if (r.T) {
+      e.Y = t;
       return;
     }
     const i = findLane(r);
-    if (I.has(i)) {
+    if (L.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
-        if (n._e && findLane(n._e) === i) {
-          e.ee = t;
-        } else if (i._e && findLane(i._e) === n);
+        if (n.me && findLane(n.me) === i) {
+          e.Y = t;
+        } else if (i.me && findLane(i.me) === n);
         else mergeLanes(n, i);
       }
       return;
     }
   }
-  e.ee = t;
+  e.Y = t;
 }
 function unlinkSubs(e) {
   const t = e.R;
   const n = e.j;
   const r = e.P;
-  const i = e.Oe;
-  if (r !== null) r.Oe = i;
-  else t.xe = i;
+  const i = e.be;
+  if (r !== null) r.be = i;
+  else t.Oe = i;
   if (i !== null) i.P = r;
   else {
     t.O = r;
     if (r === null) {
-      t.ve?.();
-      t.I && !t.Pe && !(t.m & o) && unobserved(t);
+      t.xe?.();
+      t.I && !t.ve && !(t.m & o) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? E : k);
+  deleteFromHeap(e, e.m & o ? k : P);
   let t = e.N;
   while (t !== null) {
     t = unlinkSubs(t);
@@ -690,27 +670,27 @@ function unobserved(e) {
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.ke;
+  const n = t.Pe;
   if (n !== null && n.R === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
     i = n !== null ? n.j : t.N;
     if (i !== null && i.R === e) {
-      t.ke = i;
+      t.Pe = i;
       return;
     }
   }
-  const o = e.xe;
+  const o = e.Oe;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.ke = e.xe = { R: e, k: t, j: i, Oe: o, P: null });
+  const u = (t.Pe = e.Oe = { R: e, k: t, j: i, be: o, P: null });
   if (n !== null) n.j = u;
   else t.N = u;
   if (o !== null) o.P = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
-  const n = t.ke;
+  const n = t.Pe;
   if (n !== null) {
     let r = t.N;
     do {
@@ -721,17 +701,17 @@ function isValidLink(e, t) {
   }
   return false;
 }
-const T = {};
+const I = {};
 function markDisposal(e) {
-  let t = e.T;
+  let t = e.ke;
   while (t) {
     t.m |= o;
     if (t.m & i) {
-      deleteFromHeap(t, k);
-      insertIntoHeap(t, E);
+      deleteFromHeap(t, P);
+      insertIntoHeap(t, k);
     }
     markDisposal(t);
-    t = t.H;
+    t = t.Ee;
   }
 }
 function dispose(e) {
@@ -740,39 +720,39 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.N = null;
-  e.ke = null;
+  e.Pe = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
-  if (t && e.I) e.Ee = null;
-  let r = n ? e.Ce : e.T;
+  if (t && e.I) e.Ce = null;
+  let r = n ? e.We : e.ke;
   while (r) {
-    const e = r.H;
+    const e = r.Ee;
     if (r.N) {
       const e = r;
-      deleteFromHeap(e, e.m & o ? E : k);
+      deleteFromHeap(e, e.m & o ? k : P);
       let t = e.N;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
       e.N = null;
-      e.ke = null;
+      e.Pe = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.Ce = null;
+    e.We = null;
   } else {
-    e.T = null;
-    e.We = 0;
+    e.ke = null;
+    e.Ae = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.Ae : e.Ne;
+  let n = t ? e.Ne : e.je;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -782,12 +762,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.Ae = null) : (e.Ne = null);
+  t ? (e.Ne = null) : (e.je = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.je && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.We++ : n.We);
+  while (n.Re && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.Ae++ : n.Ae);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -802,50 +782,50 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (F || M) return T;
-  return Q ? B : null;
+  if (D || M) return I;
+  return H ? V : null;
 }
 function getOwner() {
-  return B;
+  return V;
 }
 function cleanup(e) {
-  if (!B) return e;
-  if (!B.Ne) B.Ne = e;
-  else if (Array.isArray(B.Ne)) B.Ne.push(e);
-  else B.Ne = [B.Ne, e];
+  if (!V) return e;
+  if (!V.je) V.je = e;
+  else if (Array.isArray(V.je)) V.je.push(e);
+  else V.je = [V.je, e];
   return e;
 }
 function isDisposed(e) {
   return !!(e.m & (u | o));
 }
 function createOwner(e) {
-  const t = B;
+  const t = V;
   const n = e?.transparent ?? false;
   const r = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    je: n || undefined,
+    Re: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    T: null,
-    H: null,
+    ke: null,
+    Ee: null,
+    je: null,
+    M: t?.M ?? j,
+    Le: t?.Le || b,
+    Ae: 0,
     Ne: null,
-    G: t?.G ?? R,
-    Re: t?.Re || b,
-    We: 0,
-    Ae: null,
-    Ce: null,
+    We: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
     }
   };
   if (t) {
-    const e = t.T;
+    const e = t.ke;
     if (e === null) {
-      t.T = r;
+      t.ke = r;
     } else {
-      r.H = e;
-      t.T = r;
+      r.Ee = e;
+      t.ke = r;
     }
   }
   return r;
@@ -855,51 +835,51 @@ function createRoot(e, t) {
   return runWithOwner(n, () => e(n.dispose));
 }
 function addPendingSource(e, t) {
-  if (e.Le === t || e.Ie?.has(t)) return false;
-  if (!e.Le) {
-    e.Le = t;
+  if (e.ye === t || e.Se?.has(t)) return false;
+  if (!e.ye) {
+    e.ye = t;
     return true;
   }
-  if (!e.Ie) {
-    e.Ie = new Set([e.Le, t]);
+  if (!e.Se) {
+    e.Se = new Set([e.ye, t]);
   } else {
-    e.Ie.add(t);
+    e.Se.add(t);
   }
-  e.Le = undefined;
+  e.ye = undefined;
   return true;
 }
 function removePendingSource(e, t) {
-  if (e.Le) {
-    if (e.Le !== t) return false;
-    e.Le = undefined;
+  if (e.ye) {
+    if (e.ye !== t) return false;
+    e.ye = undefined;
     return true;
   }
-  if (!e.Ie?.delete(t)) return false;
-  if (e.Ie.size === 1) {
-    e.Le = e.Ie.values().next().value;
-    e.Ie = undefined;
-  } else if (e.Ie.size === 0) {
-    e.Ie = undefined;
+  if (!e.Se?.delete(t)) return false;
+  if (e.Se.size === 1) {
+    e.ye = e.Se.values().next().value;
+    e.Se = undefined;
+  } else if (e.Se.size === 0) {
+    e.Se = undefined;
   }
   return true;
 }
 function clearPendingSources(e) {
-  e.Le = undefined;
-  e.Ie?.clear();
-  e.Ie = undefined;
+  e.ye = undefined;
+  e.Se?.clear();
+  e.Se = undefined;
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.pe = null;
+    e.ae = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.pe = n;
+    e.ae = n;
     return;
   }
-  const r = e.pe;
+  const r = e.ae;
   if (!(r instanceof NotReadyError) || r.source !== t) {
-    e.pe = new NotReadyError(t);
+    e.ae = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
@@ -914,30 +894,30 @@ function settlePendingSource(e) {
   const settle = r => {
     if (n.has(r) || !removePendingSource(r, e)) return;
     n.add(r);
-    r.ge = C;
-    const i = r.Le ?? r.Ie?.values().next().value;
+    r.de = E;
+    const i = r.ye ?? r.Se?.values().next().value;
     if (i) {
       setPendingError(r, i);
       updatePendingSignal(r);
     } else {
-      r.we &= ~a;
+      r.ge &= ~a;
       setPendingError(r);
       updatePendingSignal(r);
-      if (r.Te) {
-        if (r.M === y) {
+      if (r.Ie) {
+        if (r.D === y) {
           const e = r;
-          if (!e.B) {
-            e.B = true;
-            e.G.enqueue(g, e.K);
+          if (!e.F) {
+            e.F = true;
+            e.M.enqueue(g, e.V);
           }
         } else {
-          const e = r.m & o ? E : k;
+          const e = r.m & o ? k : P;
           if (e.A > r.o) e.A = r.o;
           insertIntoHeap(r, e);
         }
         t = true;
       }
-      r.Te = false;
+      r.Ie = false;
     }
     forEachDependent(r, settle);
   };
@@ -949,40 +929,40 @@ 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.Ee = null;
+    e.Ce = null;
     return t;
   }
-  e.Ee = t;
+  e.Ce = t;
   let u;
   const handleError = n => {
-    if (e.Ee !== t) return;
-    R.initTransition(resolveTransition(e));
+    if (e.Ce !== t) return;
+    j.initTransition(resolveTransition(e));
     notifyStatus(e, n instanceof NotReadyError ? a : d, n);
-    e.ge = C;
+    e.de = E;
   };
   const asyncWrite = (i, s) => {
-    if (e.Ee !== t) return;
+    if (e.Ce !== t) return;
     if (e.m & (n | f)) return;
-    R.initTransition(resolveTransition(e));
+    j.initTransition(resolveTransition(e));
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.F.delete(e);
+    if (o) o.H.delete(e);
     if (r) r(i);
-    else if (e.re !== undefined) {
-      if (e.re !== undefined && e.re !== S) e.te = i;
+    else if (e.ee !== undefined) {
+      if (e.ee !== undefined && e.ee !== S) e.Z = i;
       else {
-        e.ne = i;
+        e.$ = i;
         insertSubs(e);
       }
-      e.ge = C;
+      e.de = E;
     } else if (o) {
-      const t = e.ne;
-      const n = e.He;
+      const t = e.$;
+      const n = e.Te;
       if (!n || !n(i, t)) {
-        e.ne = i;
-        e.ge = C;
-        if (e.Qe) {
-          setSignal(e.Qe, i);
+        e.$ = i;
+        e.de = E;
+        if (e.He) {
+          setSignal(e.He, i);
         }
         insertSubs(e, true);
       }
@@ -1010,8 +990,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      R.initTransition(resolveTransition(e));
-      throw new NotReadyError(B);
+      j.initTransition(resolveTransition(e));
+      throw new NotReadyError(V);
     }
   }
   if (s) {
@@ -1038,7 +1018,7 @@ function handleAsync(e, t, r) {
             s = n;
             o = true;
             if (n.done) i = true;
-          } else if (e.Ee !== t) {
+          } else if (e.Ce !== t) {
             return;
           } else if (!n.done) asyncWrite(n.value, iterate);
           else {
@@ -1048,7 +1028,7 @@ function handleAsync(e, t, r) {
           }
         },
         n => {
-          if (!f && e.Ee === t) {
+          if (!f && e.Ce === t) {
             i = true;
             handleError(n);
           }
@@ -1064,36 +1044,36 @@ function handleAsync(e, t, r) {
     };
     const s = iterate();
     if (!r && !s) {
-      R.initTransition(resolveTransition(e));
-      throw new NotReadyError(B);
+      j.initTransition(resolveTransition(e));
+      throw new NotReadyError(V);
     }
   }
   return u;
 }
 function clearStatus(e, t = false) {
   clearPendingSources(e);
-  e.Te = false;
-  e.we = t ? 0 : e.we & h;
+  e.Ie = false;
+  e.ge = t ? 0 : e.ge & h;
   setPendingError(e);
   updatePendingSignal(e);
-  e.qe?.();
+  e.Qe?.();
 }
 function notifyStatus(e, t, n, r, i) {
   if (t === d && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const s = t === a && n instanceof NotReadyError ? n.source : undefined;
   const o = s === e;
-  const u = t === a && e.re !== undefined && !o;
+  const u = t === a && e.ee !== undefined && !o;
   const f = u && hasActiveOverride(e);
   if (!r) {
     if (t === a && s) {
       addPendingSource(e, s);
-      e.we = a | (e.we & h);
+      e.ge = a | (e.ge & h);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.we = t | (t !== d ? e.we & h : 0);
-      e.pe = n;
+      e.ge = t | (t !== d ? e.ge & h : 0);
+      e.ae = n;
     }
     updatePendingSignal(e);
   }
@@ -1102,34 +1082,34 @@ function notifyStatus(e, t, n, r, i) {
   }
   const l = r || f;
   const c = r || u ? undefined : i;
-  if (e.qe) {
+  if (e.Qe) {
     if (r && t === a) {
       return;
     }
     if (l) {
-      e.qe(t, n);
+      e.Qe(t, n);
     } else {
-      e.qe();
+      e.Qe();
     }
     return;
   }
   forEachDependent(e, e => {
-    e.ge = C;
+    e.de = E;
     if (
-      (t === a && s && e.Le !== s && !e.Ie?.has(s)) ||
-      (t !== a && (e.pe !== n || e.Le || e.Ie))
+      (t === a && s && e.ye !== s && !e.Se?.has(s)) ||
+      (t !== a && (e.ae !== n || e.ye || e.Se))
     ) {
-      if (!l && !e.X) R.fe.push(e);
+      if (!l && !e.K) j.se.push(e);
       notifyStatus(e, t, n, l, c);
     }
   });
 }
-let H = null;
+let T = null;
 function enableExternalSource(e) {
   const { factory: t, untrack: n = e => e() } = e;
-  if (H) {
-    const { factory: e, untrack: r } = H;
-    H = {
+  if (T) {
+    const { factory: e, untrack: r } = T;
+    T = {
       factory: (n, r) => {
         const i = e(n, r);
         const s = t(e => i.track(e), r);
@@ -1144,136 +1124,136 @@ function enableExternalSource(e) {
       untrack: e => r(() => n(e))
     };
   } else {
-    H = { factory: t, untrack: n };
+    T = { factory: t, untrack: n };
   }
 }
-GlobalQueue.le = recompute;
-GlobalQueue.ce = disposeChildren;
+GlobalQueue.oe = recompute;
+GlobalQueue.ue = disposeChildren;
+let H = false;
 let Q = false;
 let q = false;
 let D = false;
 let F = false;
-let V = false;
 let M = false;
+let V = null;
 let B = null;
-let G = null;
-let K = false;
-let z = null;
+let G = false;
+let K = null;
 function ownerInSnapshotScope(e) {
   while (e) {
-    if (e.De) return true;
+    if (e.qe) return true;
     e = e.i;
   }
   return false;
 }
 function setSnapshotCapture(e) {
-  K = e;
-  if (e && !z) z = new Set();
+  G = e;
+  if (e && !K) K = new Set();
 }
 function markSnapshotScope(e) {
-  e.De = true;
+  e.qe = true;
 }
 function releaseSnapshotScope(e) {
-  e.De = false;
+  e.qe = false;
   releaseSubtree(e);
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.T;
+  let t = e.ke;
   while (t) {
-    if (t.De) {
-      t = t.H;
+    if (t.qe) {
+      t = t.Ee;
       continue;
     }
     if (t.I) {
       const e = t;
-      e.Se = false;
+      e.pe = false;
       if (e.m & l) {
         e.m &= ~l;
         e.m |= n;
-        if (k.A > e.o) k.A = e.o;
-        insertIntoHeap(e, k);
+        if (P.A > e.o) P.A = e.o;
+        insertIntoHeap(e, P);
       }
     }
     releaseSubtree(t);
-    t = t.H;
+    t = t.Ee;
   }
 }
 function clearSnapshots() {
-  if (z) {
-    for (const e of z) {
-      delete e.ye;
+  if (K) {
+    for (const e of K) {
+      delete e.he;
       delete e[m];
     }
-    z = null;
+    K = null;
   }
-  K = false;
+  G = false;
 }
 function recompute(t, n = false) {
-  const i = t.M;
+  const i = t.D;
   if (!n) {
-    if (t.X && (!i || W) && W !== t.X) R.initTransition(t.X);
-    deleteFromHeap(t, t.m & o ? E : k);
-    t.Ee = null;
-    if (t.X || i === y) disposeChildren(t);
+    if (t.K && (!i || C) && C !== t.K) j.initTransition(t.K);
+    deleteFromHeap(t, t.m & o ? k : P);
+    t.Ce = null;
+    if (t.K || i === y) disposeChildren(t);
     else {
       markDisposal(t);
-      t.Ae = t.Ne;
-      t.Ce = t.T;
-      t.Ne = null;
-      t.T = null;
-      t.We = 0;
+      t.Ne = t.je;
+      t.We = t.ke;
+      t.je = null;
+      t.ke = null;
+      t.Ae = 0;
     }
   }
   const s = !!(t.m & f);
-  const u = t.re !== undefined && t.re !== S;
-  const c = !!(t.we & a);
-  const h = B;
-  B = t;
-  t.ke = null;
+  const u = t.ee !== undefined && t.ee !== S;
+  const c = !!(t.ge & a);
+  const h = V;
+  V = t;
+  t.Pe = null;
   t.m = r;
-  t.ge = C;
-  let p = t.te === S ? t.ne : t.te;
+  t.de = E;
+  let p = t.Z === S ? t.$ : t.Z;
   let g = t.o;
-  let w = Q;
-  let m = G;
-  Q = true;
+  let w = H;
+  let m = B;
+  H = true;
   if (s) {
     const e = resolveLane(t);
-    if (e) G = e;
+    if (e) B = e;
   }
   try {
     p = handleAsync(t, t.I(p));
     clearStatus(t, n);
     const e = resolveLane(t);
     if (e) {
-      e.F.delete(t);
-      updatePendingSignal(e.ie);
+      e.H.delete(t);
+      updatePendingSignal(e.te);
     }
   } catch (e) {
-    if (e instanceof NotReadyError && G) {
-      const e = findLane(G);
-      if (e.ie !== t) {
-        e.F.add(t);
-        t.ee = e;
-        updatePendingSignal(e.ie);
+    if (e instanceof NotReadyError && B) {
+      const e = findLane(B);
+      if (e.te !== t) {
+        e.H.add(t);
+        t.Y = e;
+        updatePendingSignal(e.te);
       }
     }
-    if (e instanceof NotReadyError) t.Te = true;
+    if (e instanceof NotReadyError) t.Ie = true;
     notifyStatus(
       t,
       e instanceof NotReadyError ? a : d,
       e,
       undefined,
-      e instanceof NotReadyError ? t.ee : undefined
+      e instanceof NotReadyError ? t.Y : undefined
     );
   } finally {
-    Q = w;
+    H = w;
     t.m = e | (n ? t.m & l : 0);
-    B = h;
+    V = h;
   }
-  if (!t.pe) {
-    const e = t.ke;
+  if (!t.ae) {
+    const e = t.Pe;
     let r = e !== null ? e.j : t.N;
     if (r !== null) {
       do {
@@ -1282,30 +1262,30 @@ function recompute(t, n = false) {
       if (e !== null) e.j = null;
       else t.N = null;
     }
-    const f = u ? t.re : t.te === S ? t.ne : t.te;
-    const l = !t.He || !t.He(f, p);
+    const f = u ? t.ee : t.Z === S ? t.$ : t.Z;
+    const l = !t.Te || !t.Te(f, p);
     if (l) {
-      const e = u ? t.re : undefined;
-      if (n || (i && W !== t.X) || s) {
-        t.ne = p;
+      const e = u ? t.ee : undefined;
+      if (n || (i && C !== t.K) || s) {
+        t.$ = p;
         if (u && s) {
-          t.re = p;
-          t.te = p;
+          t.ee = p;
+          t.Z = p;
         }
-      } else t.te = p;
-      if (u && !s && c && !t.be) t.re = p;
-      if (!u || s || t.re !== e) insertSubs(t, s || u);
+      } else t.Z = p;
+      if (u && !s && c && !t._e) t.ee = p;
+      if (!u || s || t.ee !== e) insertSubs(t, s || u);
     } else if (u) {
-      t.te = p;
+      t.Z = p;
     } else if (t.o != g) {
       for (let e = t.O; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.k, e.k.m & o ? E : k);
+        insertIntoHeapHeight(e.k, e.k.m & o ? k : P);
       }
     }
   }
-  G = m;
-  (!n || t.we & a) && !t.X && !(W && u) && R.fe.push(t);
-  t.X && i && W !== t.X && runInTransition(t.X, () => recompute(t));
+  B = m;
+  (!n || t.ge & a) && !t.K && !(C && u) && j.se.push(t);
+  t.K && i && C !== t.K && runInTransition(t.K, () => recompute(t));
 }
 function updateIfNecessary(e) {
   if (e.m & t) {
@@ -1320,7 +1300,7 @@ function updateIfNecessary(e) {
       }
     }
   }
-  if (e.m & (n | f) || (e.pe && e.ge < C && !e.Ee)) {
+  if (e.m & (n | f) || (e.ae && e.de < E && !e.Ce)) {
     recompute(e);
   }
   e.m = e.m & (l | i | s);
@@ -1328,53 +1308,53 @@ function updateIfNecessary(e) {
 function computed(t, n, r) {
   const i = r?.transparent ?? false;
   const s = {
-    id: r?.id ?? (i ? B?.id : B?.id != null ? getNextChildId(B) : undefined),
-    je: i || undefined,
-    He: r?.equals != null ? r.equals : isEqual,
-    he: !!r?.pureWrite,
-    ve: r?.unobserved,
-    Ne: null,
-    G: B?.G ?? R,
-    Re: B?.Re ?? b,
-    We: 0,
+    id: r?.id ?? (i ? V?.id : V?.id != null ? getNextChildId(V) : undefined),
+    Re: i || undefined,
+    Te: r?.equals != null ? r.equals : isEqual,
+    ce: !!r?.pureWrite,
+    xe: r?.unobserved,
+    je: null,
+    M: V?.M ?? j,
+    Le: V?.Le ?? b,
+    Ae: 0,
     I: t,
-    ne: n,
+    $: n,
     o: 0,
     C: null,
     p: undefined,
     h: null,
     N: null,
-    ke: null,
+    Pe: null,
     O: null,
-    xe: null,
-    i: B,
-    H: null,
-    T: null,
+    Oe: null,
+    i: V,
+    Ee: null,
+    ke: null,
     m: r?.lazy ? c : e,
-    we: h,
-    ge: C,
-    te: S,
-    Ae: null,
+    ge: h,
+    de: E,
+    Z: S,
+    Ne: null,
+    We: null,
     Ce: null,
-    Ee: null,
-    X: null
+    K: null
   };
   s.h = s;
-  const o = B?.t ? B.u : B;
-  if (B) {
-    const e = B.T;
+  const o = V?.t ? V.u : V;
+  if (V) {
+    const e = V.ke;
     if (e === null) {
-      B.T = s;
+      V.ke = s;
     } else {
-      s.H = e;
-      B.T = s;
+      s.Ee = e;
+      V.ke = s;
     }
   }
   if (o) s.o = o.o + 1;
-  if (K && ownerInSnapshotScope(B)) s.Se = true;
-  if (H) {
+  if (G && ownerInSnapshotScope(V)) s.pe = true;
+  if (T) {
     const e = signal(undefined, { equals: false, pureWrite: true });
-    const t = H.factory(s.I, () => {
+    const t = T.factory(s.I, () => {
       setSignal(e, undefined);
     });
     cleanup(() => t.dispose());
@@ -1384,57 +1364,57 @@ function computed(t, n, r) {
     };
   }
   !r?.lazy && recompute(s, true);
-  if (K && !r?.lazy) {
-    if (!(s.we & a)) {
-      s.ye = s.ne === undefined ? w : s.ne;
-      z.add(s);
+  if (G && !r?.lazy) {
+    if (!(s.ge & a)) {
+      s.he = s.$ === undefined ? w : s.$;
+      K.add(s);
     }
   }
   return s;
 }
 function signal(e, t, n = null) {
   const r = {
-    He: t?.equals != null ? t.equals : isEqual,
-    he: !!t?.pureWrite,
-    Fe: !!t?.Fe,
-    ve: t?.unobserved,
-    ne: e,
+    Te: t?.equals != null ? t.equals : isEqual,
+    ce: !!t?.pureWrite,
+    De: !!t?.De,
+    xe: t?.unobserved,
+    $: e,
     O: null,
-    xe: null,
-    ge: C,
+    Oe: null,
+    de: E,
     L: n,
     W: n?.C || null,
-    te: S
+    Z: S
   };
   n && (n.C = r);
-  if (K && !r.Fe && !((n?.we ?? 0) & a)) {
-    r.ye = e === undefined ? w : e;
-    z.add(r);
+  if (G && !r.De && !((n?.ge ?? 0) & a)) {
+    r.he = e === undefined ? w : e;
+    K.add(r);
   }
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.re = S;
+  n.ee = S;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const r = computed(e, t, n);
-  r.re = S;
+  r.ee = S;
   return r;
 }
 function isEqual(e, t) {
   return e === t;
 }
 function untrack(e, t) {
-  if (!H && !Q && true) return e();
-  const n = Q;
-  Q = false;
+  if (!T && !H && true) return e();
+  const n = H;
+  H = false;
   try {
-    if (H) return H.untrack(e);
+    if (T) return T.untrack(e);
     return e();
   } finally {
-    Q = n;
+    H = n;
   }
 }
 function read(e) {
@@ -1442,62 +1422,62 @@ function read(e) {
     const t = getLatestValueComputed(e);
     const n = M;
     M = false;
-    const r = e.re !== undefined && e.re !== S ? e.re : e.ne;
+    const r = e.ee !== undefined && e.ee !== S ? e.ee : e.$;
     let i;
     try {
       i = read(t);
     } catch (e) {
-      if (!B && e instanceof NotReadyError) return r;
+      if (!V && e instanceof NotReadyError) return r;
       throw e;
     } finally {
       M = n;
     }
-    if (t.we & a) return r;
-    if (q && G && t.ee) {
-      const e = findLane(t.ee);
-      const n = findLane(G);
-      if (e !== n && e.F.size > 0) {
+    if (t.ge & a) return r;
+    if (Q && B && t.Y) {
+      const e = findLane(t.Y);
+      const n = findLane(B);
+      if (e !== n && e.H.size > 0) {
         return r;
       }
     }
     return i;
   }
-  if (F) {
+  if (D) {
     const t = e.L;
-    const n = F;
-    F = false;
-    if (t && e.re !== undefined) {
-      if (e.re !== S && (t.Ee || !!(t.we & a))) {
-        V = true;
+    const n = D;
+    D = false;
+    if (t && e.ee !== undefined) {
+      if (e.ee !== S && (t.Ce || !!(t.ge & a))) {
+        F = true;
       }
-      let n = B;
+      let n = V;
       if (n?.t) n = n.u;
-      if (n && Q) link(e, n);
+      if (n && H) link(e, n);
       read(getPendingSignal(e));
       read(getPendingSignal(t));
     } else {
-      if (read(getPendingSignal(e))) V = true;
-      if (t && read(getPendingSignal(t))) V = true;
+      if (read(getPendingSignal(e))) F = true;
+      if (t && read(getPendingSignal(t))) F = true;
     }
-    F = n;
-    return e.ne;
+    D = n;
+    return e.$;
   }
-  let t = B;
+  let t = V;
   if (t?.t) t = t.u;
-  if (D && e.I) recompute(e);
+  if (q && e.I) recompute(e);
   if (e.m & c) {
     e.m &= ~c;
     recompute(e, true);
   }
   const n = e.L || e;
-  if (t && Q) {
+  if (t && H) {
     if (e.I && e.m & u) recompute(e);
     link(e, t);
     if (n.I) {
       const r = e.m & o;
-      if (n.o >= (r ? E.A : k.A)) {
+      if (n.o >= (r ? k.A : P.A)) {
         markNode(t);
-        markHeap(r ? E : k);
+        markHeap(r ? k : P);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -1506,59 +1486,59 @@ function read(e) {
       }
     }
   }
-  if (n.we & a) {
-    if (t && !(q && n.X && W !== n.X)) {
-      if (G) {
-        const r = n.ee;
-        const i = findLane(G);
+  if (n.ge & a) {
+    if (t && !(Q && n.K && C !== n.K)) {
+      if (B) {
+        const r = n.Y;
+        const i = findLane(B);
         if (r && findLane(r) === i && !hasActiveOverride(n)) {
-          if (!Q && e !== t) link(e, t);
-          throw n.pe;
+          if (!H && e !== t) link(e, t);
+          throw n.ae;
         }
       } else {
-        if (!Q && e !== t) link(e, t);
-        throw n.pe;
+        if (!H && e !== t) link(e, t);
+        throw n.ae;
       }
-    } else if (t && n !== e && n.we & h) {
-      if (!Q && e !== t) link(e, t);
-      throw n.pe;
-    } else if (!t && n.we & h) {
-      throw n.pe;
+    } else if (t && n !== e && n.ge & h) {
+      if (!H && e !== t) link(e, t);
+      throw n.ae;
+    } else if (!t && n.ge & h) {
+      throw n.ae;
     }
   }
-  if (e.I && e.we & d) {
-    if (e.ge < C) {
+  if (e.I && e.ge & d) {
+    if (e.de < E) {
       recompute(e);
       return read(e);
-    } else throw e.pe;
+    } else throw e.ae;
   }
-  if (K && t && t.Se) {
-    const n = e.ye;
+  if (G && t && t.pe) {
+    const n = e.he;
     if (n !== undefined) {
       const r = n === w ? undefined : n;
-      const i = e.te !== S ? e.te : e.ne;
+      const i = e.Z !== S ? e.Z : e.$;
       if (i !== r) t.m |= l;
       return r;
     }
   }
-  if (e.re !== undefined && e.re !== S) {
-    if (t && q && shouldReadStashedOptimisticValue(e)) return e.ne;
-    return e.re;
+  if (e.ee !== undefined && e.ee !== S) {
+    if (t && Q && shouldReadStashedOptimisticValue(e)) return e.$;
+    return e.ee;
   }
   return !t ||
-    (G !== null && (e.re !== undefined || e.ee || (n === e && q) || !!(n.we & a))) ||
-    e.te === S ||
-    (q && e.X && W !== e.X)
-    ? e.ne
-    : e.te;
+    (B !== null && (e.ee !== undefined || e.Y || (n === e && Q) || !!(n.ge & a))) ||
+    e.Z === S ||
+    (Q && e.K && C !== e.K)
+    ? e.$
+    : e.Z;
 }
 function setSignal(e, t) {
-  if (e.X && W !== e.X) R.initTransition(e.X);
-  const n = e.re !== undefined && !N;
-  const r = e.re !== undefined && e.re !== S;
-  const i = n ? (r ? e.re : e.ne) : e.te === S ? e.ne : e.te;
+  if (e.K && C !== e.K) j.initTransition(e.K);
+  const n = e.ee !== undefined && !A;
+  const r = e.ee !== undefined && e.ee !== S;
+  const i = n ? (r ? e.ee : e.$) : e.Z === S ? e.$ : e.Z;
   if (typeof t === "function") t = t(i);
-  const s = !e.He || !e.He(i, t) || !!(e.we & h);
+  const s = !e.Te || !e.Te(i, t) || !!(e.ge & h);
   if (!s) {
     if (n && r && e.I) {
       insertSubs(e, true);
@@ -1567,112 +1547,112 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = e.re === S;
-    if (!n) R.initTransition(resolveTransition(e));
+    const n = e.ee === S;
+    if (!n) j.initTransition(resolveTransition(e));
     if (n) {
-      e.te = e.ne;
-      R.Y.push(e);
+      e.Z = e.$;
+      j.U.push(e);
     }
-    e.be = true;
+    e._e = true;
     const r = getOrCreateLane(e);
-    e.ee = r;
-    e.re = t;
+    e.Y = r;
+    e.ee = t;
   } else {
-    if (e.te === S) R.fe.push(e);
-    e.te = t;
+    if (e.Z === S) j.se.push(e);
+    e.Z = t;
   }
   updatePendingSignal(e);
-  if (e.Qe) {
-    setSignal(e.Qe, t);
+  if (e.He) {
+    setSignal(e.He, t);
   }
-  e.ge = C;
+  e.de = E;
   insertSubs(e, n);
   schedule();
   return t;
 }
 function runWithOwner(e, t) {
-  const n = B;
-  const r = Q;
-  B = e;
-  Q = false;
+  const n = V;
+  const r = H;
+  V = e;
+  H = false;
   try {
     return t();
   } finally {
-    B = n;
-    Q = r;
+    V = n;
+    H = r;
   }
 }
 function getPendingSignal(e) {
-  if (!e.Ve) {
-    e.Ve = optimisticSignal(false, { pureWrite: true });
-    if (e.me) {
-      e.Ve.me = e;
+  if (!e.Fe) {
+    e.Fe = optimisticSignal(false, { pureWrite: true });
+    if (e.we) {
+      e.Fe.we = e;
     }
-    if (computePendingState(e)) setSignal(e.Ve, true);
+    if (computePendingState(e)) setSignal(e.Fe, true);
   }
-  return e.Ve;
+  return e.Fe;
 }
 function computePendingState(e) {
   const t = e;
   const n = e.L;
-  if (n && e.te !== S) {
-    return !n.Ee && !(n.we & a);
+  if (n && e.Z !== S) {
+    return !n.Ce && !(n.ge & a);
   }
-  if (e.re !== undefined && e.re !== S) {
-    if (t.we & a && !(t.we & h)) return true;
-    if (e.me) {
-      const t = e.ee ? findLane(e.ee) : null;
-      return !!(t && t.F.size > 0);
+  if (e.ee !== undefined && e.ee !== S) {
+    if (t.ge & a && !(t.ge & h)) return true;
+    if (e.we) {
+      const t = e.Y ? findLane(e.Y) : null;
+      return !!(t && t.H.size > 0);
     }
     return true;
   }
-  if (e.re !== undefined && e.re === S && !e.me) {
+  if (e.ee !== undefined && e.ee === S && !e.we) {
     return false;
   }
-  if (e.te !== S && !(t.we & h)) return true;
-  return !!(t.we & a && !(t.we & h));
+  if (e.Z !== S && !(t.ge & h)) return true;
+  return !!(t.ge & a && !(t.ge & h));
 }
 function updatePendingSignal(e) {
-  if (e.Ve) {
+  if (e.Fe) {
     const t = computePendingState(e);
-    const n = e.Ve;
+    const n = e.Fe;
     setSignal(n, t);
-    if (!t && n.ee) {
+    if (!t && n.Y) {
       const t = resolveLane(e);
-      if (t && t.F.size > 0) {
-        const e = findLane(n.ee);
+      if (t && t.H.size > 0) {
+        const e = findLane(n.Y);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
-      L.delete(n);
-      n.ee = undefined;
+      R.delete(n);
+      n.Y = undefined;
     }
   }
 }
 function getLatestValueComputed(e) {
-  if (!e.Qe) {
+  if (!e.He) {
     const t = M;
     M = false;
-    const n = F;
-    F = false;
-    const r = B;
-    B = null;
-    e.Qe = optimisticComputed(() => read(e));
-    e.Qe.me = e;
-    B = r;
-    F = n;
+    const n = D;
+    D = false;
+    const r = V;
+    V = null;
+    e.He = optimisticComputed(() => read(e));
+    e.He.we = e;
+    V = r;
+    D = n;
     M = t;
   }
-  return e.Qe;
+  return e.He;
 }
 function staleValues(e, t = true) {
-  const n = q;
-  q = t;
+  const n = Q;
+  Q = t;
   try {
     return e();
   } finally {
-    q = n;
+    Q = n;
   }
 }
 function latest(e) {
@@ -1685,23 +1665,23 @@ function latest(e) {
   }
 }
 function isPending(e) {
-  const t = F;
-  const n = V;
-  F = true;
-  V = false;
+  const t = D;
+  const n = F;
+  D = true;
+  F = false;
   try {
     e();
-    return V;
+    return F;
   } catch {
-    return V;
+    return F;
   } finally {
-    F = t;
-    V = n;
+    D = t;
+    F = n;
   }
 }
 function refresh(e) {
-  let t = D;
-  D = true;
+  let t = q;
+  q = true;
   try {
     if (typeof e !== "function") {
       recompute(e[O]);
@@ -1709,14 +1689,14 @@ function refresh(e) {
     }
     return untrack(e);
   } finally {
-    D = t;
+    q = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return D;
+  return q;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1725,7 +1705,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Re[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1735,10 +1715,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Re = { ...n.Re, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Le = { ...n.Le, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Re[e.id]);
+  return !isUndefined(t?.Le[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1748,99 +1728,99 @@ function effect(e, t, n, r, i) {
   const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
     ...i,
     equals: () => {
-      o.B = !o.pe;
-      if (s) o.G.enqueue(o.M, runEffect.bind(o));
+      o.F = !o.ae;
+      if (s) o.M.enqueue(o.D, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
   o.Me = r;
-  o.Be = t;
-  o.Ge = n;
-  o.Ke = undefined;
-  o.M = i?.render ? p : g;
-  o.qe = (e, t) => {
-    const n = e !== undefined ? e : o.we;
-    const r = t !== undefined ? t : o.pe;
+  o.Ve = t;
+  o.Be = n;
+  o.Ge = undefined;
+  o.D = i?.render ? p : g;
+  o.Qe = (e, t) => {
+    const n = e !== undefined ? e : o.ge;
+    const r = t !== undefined ? t : o.ae;
     if (n & d) {
       let e = r;
-      o.G.notify(o, a, 0);
-      if (o.M === g) {
+      o.M.notify(o, a, 0);
+      if (o.D === g) {
         try {
-          return o.Ge
-            ? o.Ge(e, () => {
-                o.Ke?.();
-                o.Ke = undefined;
+          return o.Be
+            ? o.Be(e, () => {
+                o.Ge?.();
+                o.Ge = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!o.G.notify(o, d, d)) throw e;
-    } else if (o.M === p) {
-      o.G.notify(o, a | d, n, r);
+      if (!o.M.notify(o, d, d)) throw e;
+    } else if (o.D === p) {
+      o.M.notify(o, a | d, n, r);
     }
   };
   recompute(o, true);
-  !i?.defer && (o.M === g ? o.G.enqueue(o.M, runEffect.bind(o)) : runEffect.call(o));
+  !i?.defer && (o.D === g ? o.M.enqueue(o.D, runEffect.bind(o)) : runEffect.call(o));
   s = true;
-  cleanup(() => o.Ke?.());
+  cleanup(() => o.Ge?.());
 }
 function runEffect() {
-  if (!this.B || this.m & u) return;
-  this.Ke?.();
-  this.Ke = undefined;
+  if (!this.F || this.m & u) return;
+  this.Ge?.();
+  this.Ge = undefined;
   try {
-    const e = this.Be(this.ne, this.Me);
+    const e = this.Ve(this.$, this.Me);
     if (false && e !== undefined && typeof e !== "function");
-    this.Ke = e;
+    this.Ge = e;
   } catch (e) {
-    this.pe = new StatusError(this, e);
-    this.we |= d;
-    if (!this.G.notify(this, d, d)) throw e;
+    this.ae = new StatusError(this, e);
+    this.ge |= d;
+    if (!this.M.notify(this, d, d)) throw e;
   } finally {
-    this.Me = this.ne;
-    this.B = false;
+    this.Me = this.$;
+    this.F = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.B || n.m & u) return;
+    if (!n.F || n.m & u) return;
     try {
-      n.B = false;
+      n.F = false;
       recompute(n);
     } finally {
     }
   };
   const n = computed(
     () => {
-      n.Ke?.();
-      n.Ke = undefined;
+      n.Ge?.();
+      n.Ge = undefined;
       const t = staleValues(e);
-      n.Ke = t;
+      n.Ge = t;
     },
     undefined,
     { ...t, lazy: true }
   );
-  n.Ke = undefined;
-  n.ze = true;
-  n.B = true;
-  n.M = y;
-  n.qe = (e, t) => {
-    const r = e !== undefined ? e : n.we;
+  n.Ge = undefined;
+  n.Ke = true;
+  n.F = true;
+  n.D = y;
+  n.Qe = (e, t) => {
+    const r = e !== undefined ? e : n.ge;
     if (r & d) {
-      n.G.notify(n, a, 0);
-      const e = t !== undefined ? t : n.pe;
-      if (!n.G.notify(n, d, d)) throw e;
+      n.M.notify(n, a, 0);
+      const e = t !== undefined ? t : n.ae;
+      if (!n.M.notify(n, d, d)) throw e;
     }
   };
-  n.K = run;
-  n.G.enqueue(g, run);
-  cleanup(() => n.Ke?.());
+  n.V = run;
+  n.M.enqueue(g, run);
+  cleanup(() => n.Ge?.());
 }
 function restoreTransition(e, t) {
-  R.initTransition(e);
+  j.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1849,13 +1829,13 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      R.initTransition();
-      let s = W;
-      s.J.push(i);
+      j.initTransition();
+      let s = C;
+      s.G.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.J.indexOf(i);
-        if (o >= 0) s.J.splice(o, 1);
+        const o = s.G.indexOf(i);
+        if (o >= 0) s.G.splice(o, 1);
         setActiveTransition(s);
         schedule();
         t ? r(t) : n(e);
@@ -1959,15 +1939,15 @@ function createOptimistic(e, t, n) {
 }
 function onSettled(e) {
   const t = getOwner();
-  t && !t.ze
+  t && !t.Ke
     ? createTrackedEffect(() => untrack(e), undefined)
-    : R.enqueue(g, () => {
+    : j.enqueue(g, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[J]?.[te] ?? e;
+  return e?.[U]?.[ee] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1979,16 +1959,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?.[U];
   if (!r) return;
-  const i = r[Z];
-  const s = r[$];
-  const o = r[ee];
-  let u = r[te];
+  const i = r[Y];
+  const s = r[Z];
+  const o = r[$];
+  let u = r[ee];
   if (e === i && !s && !o) return;
-  (r[ie] || ue).set(e, r[X]);
-  r[Z] = e;
-  r[$] = undefined;
+  (r[re] || oe).set(e, r[J]);
+  r[Y] = e;
+  r[Z] = undefined;
   if (Array.isArray(i)) {
     let t = false;
     const f = getOverrideValue(i, s, u, "length", o);
@@ -2016,16 +1996,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[ee][c] && setSignal(r[ee][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[ee][c] && setSignal(r[ee][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[ee][z] && setSignal(r[ee][z], void 0);
+        f !== e.length && r[ee].length && setSignal(r[ee].length, e.length);
         return;
       }
       g = new Array(h + 1);
@@ -2049,26 +2029,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[ee][c] && setSignal(r[ee][c], t);
           applyState(e[c], t, n);
-        } else r[te][c] && setSignal(r[te][c], wrap(e[c], r));
+        } else r[ee][c] && setSignal(r[ee][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[ee][t] && setSignal(r[ee][t], e[t]);
       }
     }
     if (f !== e.length) {
       t = true;
-      r[te].length && setSignal(r[te].length, e.length);
+      r[ee].length && setSignal(r[ee].length, e.length);
     }
-    t && r[te][U] && setSignal(r[te][U], void 0);
+    t && r[ee][z] && setSignal(r[ee][z], void 0);
     return;
   }
   if (u) {
-    const t = u[U];
+    const t = u[z];
     const f = t ? getAllKeys(i, s, e) : Object.keys(u);
     for (let l = 0, c = f.length; l < c; l++) {
       const c = f[l];
@@ -2082,7 +2062,7 @@ function applyState(e, t, n) {
       } else applyState(h, wrap(d, r), n);
     }
   }
-  if ((u = r[ne])) {
+  if ((u = r[te])) {
     const t = Object.keys(u);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -2104,9 +2084,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[ne] = wrapProjection;
+    e[re] = i;
+    Object.defineProperty(e, ie, {
       get() {
         return r;
       },
@@ -2115,8 +2095,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[U]?.[ne] === wrapProjection) return e;
+    const t = createStoreProxy(e, le, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2127,7 +2107,7 @@ function createProjectionInternal(e, t = {}, n) {
     let i;
     const o = new Proxy(
       s,
-      createWriteTraps(() => !r || t.Ee === i)
+      createWriteTraps(() => !r || t.Ce === i)
     );
     storeSetter(o, o => {
       i = e(o);
@@ -2138,7 +2118,7 @@ function createProjectionInternal(e, t = {}, n) {
       u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
     });
   });
-  r.Pe = true;
+  r.ve = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -2197,33 +2177,33 @@ function createWriteTraps(e) {
   };
   return t;
 }
-const U = Symbol(0),
+const z = Symbol(0),
+  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) {
+  X = Symbol(0);
+const Y = "v",
+  Z = "o",
+  $ = "x",
+  ee = "n",
+  te = "h",
+  ne = "w",
+  re = "l",
+  ie = "f",
+  se = "p";
+function createStoreProxy(e, t = le, 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[J] = new Proxy(r, t));
 }
-const ue = new WeakMap();
+const oe = 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?.[ne]) return t[ne](e, t);
+  let n = e[J] || oe.get(e);
+  if (!n) oe.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
@@ -2234,12 +2214,12 @@ function isWrappable(e) {
     !(typeof Node !== "undefined" && e instanceof Node)
   );
 }
-let fe = false;
+let ue = false;
 function setWriteOverride(e) {
-  fe = e;
+  ue = e;
 }
 function writeOnly(e) {
-  return fe || !!le?.has(e);
+  return ue || !!fe?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -2259,17 +2239,17 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
     r
   );
   if (s) {
-    u.re = S;
+    u.ee = S;
   }
   if (o && t in o) {
     const e = o[t];
-    u.ye = e === undefined ? w : e;
-    z?.add(u);
+    u.he = e === undefined ? w : e;
+    K?.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 = z) {
+  getObserver() && read(getNode(getNodes(e, ee), t, undefined, e[ie], false, e[se]));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -2277,7 +2257,7 @@ 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] !== X) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -2285,102 +2265,96 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === Y) return void 0;
+    if (r[n] === X) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let le = null;
-const ce = {
+let fe = null;
+const le = {
   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 === U) return e;
+    if (t === J) return n;
+    if (t === O) return e[ie];
+    if (t === z) {
       trackSelf(e);
       return n;
     }
-    const r = getNodes(e, te);
+    const r = getNodes(e, ee);
     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[$] && t in e[$];
+    const o = s || (e[Z] && t in e[Z]);
+    const u = !!e[Y][U];
+    const f = s ? e[$] : e[Z] && t in e[Z] ? e[Z] : e[Y];
     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.re !== undefined && i.re !== S
-            ? i.re
-            : i.te !== S
-              ? i.te
-              : i.ne
-          : f[t];
-      n === Y && (n = undefined);
+        i && (o || !u) ? (i.ee !== undefined && i.ee !== S ? i.ee : i.Z !== S ? i.Z : i.$) : f[t];
+      n === X && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      le?.add(r);
+      fe?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === Y && (l = undefined);
+    l === X && (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[Y]) && (t = Object.getPrototypeOf(e[Y])) && 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[ie], isEqual, e[se], e[m]));
       }
     }
     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])) {
-      getObserver() && read(getNode(getNodes(e, ne), t, n, e[se], isEqual, e[oe]));
+    if (t === J || t === z || t === "__proto__") return true;
+    const n = e[$] && t in e[$] ? e[$][t] !== X : e[Z] && t in e[Z] ? e[Z][t] !== X : t in e[Y];
+    if (!writeOnly(e[J])) {
+      getObserver() && read(getNode(getNodes(e, te), t, n, e[ie], isEqual, e[se]));
     }
     return n;
   },
   set(e, t, n) {
-    const r = e[X];
+    const r = e[J];
     if (writeOnly(r)) {
-      if (e[oe]) {
-        const t = e[se];
-        if (t?.X) {
-          R.initTransition(t.X);
+      if (e[se]) {
+        const t = e[ie];
+        if (t?.K) {
+          j.initTransition(t.K);
         }
       }
       untrack(() => {
-        const i = e[Z];
+        const i = e[Y];
         const s = i[t];
-        if (K && typeof t !== "symbol" && !((e[se]?.we ?? 0) & a)) {
+        if (G && typeof t !== "symbol" && !((e[ie]?.ge ?? 0) & a)) {
           if (!e[m]) {
             e[m] = Object.create(null);
-            z?.add(e);
+            K?.add(e);
           }
           if (!(t in e[m])) {
             e[m][t] = s;
           }
         }
-        const o = e[oe] && !N;
-        const u = o ? ee : $;
+        const o = e[se] && !A;
+        const u = o ? $ : Z;
         if (o) trackOptimisticStore(r);
-        const f = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : s;
-        const l = n?.[J]?.[Z] ?? n;
+        const f = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : s;
+        const l = n?.[U]?.[Y] ?? n;
         const c = Array.isArray(i) && t !== "length";
         const d = c ? parseInt(t) + 1 : 0;
         const h =
           c &&
-          (e[ee] && "length" in e[ee]
-            ? e[ee].length
-            : e[$] && "length" in e[$]
-              ? e[$].length
+          (e[$] && "length" in e[$]
+            ? e[$].length
+            : e[Z] && "length" in e[Z]
+              ? e[Z].length
               : i.length);
         const p = c && d > h ? d : undefined;
         if (f === l && p === undefined) return true;
@@ -2391,48 +2365,48 @@ const ce = {
           if (p !== undefined) n.length = p;
         }
         const g = isWrappable(l);
-        e[ne]?.[t] && setSignal(e[ne][t], true);
-        const y = getNodes(e, te);
+        e[te]?.[t] && setSignal(e[te][t], true);
+        const y = getNodes(e, ee);
         y[t] && setSignal(y[t], () => (g ? wrap(l, e) : l));
         if (Array.isArray(i)) {
           const e = t === "length" ? l : p;
           e !== undefined && y.length && setSignal(y.length, e);
         }
-        y[U] && setSignal(y[U], undefined);
+        y[z] && setSignal(y[z], undefined);
         if (false);
       });
     }
     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[$]?.[t] === X;
+    const r = e[Z]?.[t] === X;
+    if (writeOnly(e[J]) && !n && !r) {
       untrack(() => {
-        const n = e[oe] && !N;
-        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[se] && !A;
+        const r = n ? $ : Z;
+        if (n) trackOptimisticStore(e[J]);
+        const i = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : e[Y][t];
+        if (t in e[Y] || (e[Z] && t in e[Z])) {
+          (e[r] || (e[r] = Object.create(null)))[t] = X;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
-        if (e[ne]?.[t]) setSignal(e[ne][t], false);
-        const s = getNodes(e, te);
+        if (e[te]?.[t]) setSignal(e[te][t], false);
+        const s = getNodes(e, ee);
         s[t] && setSignal(s[t], undefined);
-        s[U] && setSignal(s[U], undefined);
+        s[z] && setSignal(s[z], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[Z], e[$], false);
-    if (e[ee]) {
+    let t = getKeys(e[Y], e[Z], false);
+    if (e[$]) {
       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[$])) {
+        if (e[$][t] !== X) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -2440,25 +2414,25 @@ 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 = getPropertyDescriptor(e[Z], e[$], t);
+    if (t === J) return { value: e[J], writable: true, configurable: true };
+    if (e[$] && t in e[$]) {
+      if (e[$][t] === X) return undefined;
+      const n = getPropertyDescriptor(e[Y], e[Z], t);
       if (n) {
-        return { ...n, value: e[ee][t] };
+        return { ...n, value: e[$][t] };
       }
-      return { value: e[ee][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[$][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[Z], e[$], t);
+    return getPropertyDescriptor(e[Y], e[Z], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[Z]);
+    return Object.getPrototypeOf(e[Y]);
   }
 };
 function storeSetter(e, t) {
-  const n = le;
-  le = new Set();
-  le.add(e);
+  const n = fe;
+  fe = new Set();
+  fe.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2474,8 +2448,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    le.clear();
-    le = n;
+    fe.clear();
+    fe = n;
   }
 }
 function createStore(e, t, n) {
@@ -2484,7 +2458,7 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.ae ||= clearOptimisticStore;
+  GlobalQueue.fe ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = (r ? t : e) ?? {};
   const s = r ? e : undefined;
@@ -2492,39 +2466,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[U];
+  if (!t || !t[$]) return;
+  const n = t[$];
+  const r = t[ee];
   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].Y = undefined;
+          const n = t[Z] && e in t[Z] ? t[Z][e] : t[Y][e];
+          const i = n === X ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
-      if (r[U]) {
-        r[U].ee = undefined;
-        setSignal(r[U], undefined);
+      if (r[z]) {
+        r[z].Y = undefined;
+        setSignal(r[z], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[ee];
+  delete t[$];
 }
 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[ne] = wrapProjection;
+    e[re] = i;
+    e[se] = true;
+    Object.defineProperty(e, ie, {
       get() {
         return r;
       },
@@ -2533,8 +2507,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[U]?.[ne] === wrapProjection) return e;
+    const t = createStoreProxy(e, le, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2546,7 +2520,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       let i;
       const o = new Proxy(
         s,
-        createWriteTraps(() => !r || t.Ee === i)
+        createWriteTraps(() => !r || t.Ce === i)
       );
       setProjectionWriteActive(true);
       try {
@@ -2567,11 +2541,11 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.Pe = true;
+    r.ve = true;
   }
   return { store: s, node: r };
 }
-const ae = Symbol(0);
+const ce = Symbol(0);
 function updatePath(e, t, n = 0) {
   let r,
     i = e;
@@ -2615,7 +2589,7 @@ function updatePath(e, t, n = 0) {
     if (s === i) return;
   }
   if (r === undefined && s == undefined) return;
-  if (s === ae) {
+  if (s === ce) {
     delete e[r];
   } else if (r === undefined || (isWrappable(i) && isWrappable(s) && !Array.isArray(s))) {
     const t = r !== undefined ? e[r] : e;
@@ -2625,26 +2599,26 @@ function updatePath(e, t, n = 0) {
     e[r] = s;
   }
 }
-const de = Object.assign(
+const ae = Object.assign(
   function storePath(...e) {
     return t => {
       updatePath(t, e);
     };
   },
-  { DELETE: ae }
+  { DELETE: ce }
 );
 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[U] || r?.get(e)?.[U])) {
+    if (t) trackSelf(i, z);
+    o = i[Z];
+    s = Array.isArray(i[Y]);
+    n.set(e, o ? (u = s ? [] : Object.create(Object.getPrototypeOf(i[Y]))) : i[Y]);
+    e = i[Y];
+    r = oe;
   } else {
     s = Array.isArray(e);
     n.set(e, e);
@@ -2653,7 +2627,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 === X) continue;
       if (t && isWrappable(l)) wrap(l, i);
       if ((f = snapshotImpl(l, t, n, r)) !== l || u) {
         if (!u) n.set(e, (u = [...e]));
@@ -2688,13 +2662,13 @@ function deep(e) {
 function trueFn() {
   return true;
 }
-const he = {
+const de = {
   get(e, t, n) {
-    if (t === X) return n;
+    if (t === J) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === X) return true;
+    if (t === J) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2717,15 +2691,15 @@ const he = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const pe = Symbol(0);
+const he = 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 && J in i);
+    const s = !!i && i[he];
     if (s) n.push(...s);
     else n.push(typeof i === "function" ? ((t = true), createMemo(i)) : i);
   }
@@ -2733,7 +2707,7 @@ function merge(...e) {
     return new Proxy(
       {
         get(e) {
-          if (e === pe) return n;
+          if (e === he) return n;
           for (let t = n.length - 1; t >= 0; t--) {
             const r = resolveSource(n[t]);
             if (e in r) return r[e];
@@ -2751,7 +2725,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      he
+      de
     );
   }
   const r = Object.create(null);
@@ -2783,12 +2757,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[pe] = n;
+  o[he] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (_ && X in e) {
+  if (_ && J in e) {
     return new Proxy(
       {
         get(t) {
@@ -2801,7 +2775,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      he
+      de
     );
   }
   const r = {};
@@ -2821,65 +2795,65 @@ function mapArray(e, t, n) {
   const s = t;
   return createMemo(
     updateKeyedMap.bind({
-      Ue: createOwner(),
-      Je: 0,
-      Xe: e,
-      Ye: [],
-      Ze: s,
+      ze: createOwner(),
+      Ue: 0,
+      Je: e,
+      Xe: [],
+      Ye: s,
+      Ze: [],
       $e: [],
-      et: [],
-      tt: r,
-      nt: r || n?.keyed === false ? [] : undefined,
-      rt: i ? [] : undefined,
-      it: n?.fallback
+      et: r,
+      tt: r || n?.keyed === false ? [] : undefined,
+      nt: i ? [] : undefined,
+      rt: n?.fallback
     })
   );
 }
-const ge = { pureWrite: true };
+const pe = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Xe() || [],
+  const e = this.Je() || [],
     t = e.length;
-  e[U];
-  runWithOwner(this.Ue, () => {
+  e[z];
+  runWithOwner(this.ze, () => {
     let n,
       r,
-      i = this.nt
+      i = this.tt
         ? () => {
-            this.nt[r] = signal(e[r], ge);
-            this.rt && (this.rt[r] = signal(r, ge));
-            return this.Ze(accessor(this.nt[r]), this.rt ? accessor(this.rt[r]) : undefined);
+            this.tt[r] = signal(e[r], pe);
+            this.nt && (this.nt[r] = signal(r, pe));
+            return this.Ye(accessor(this.tt[r]), this.nt ? accessor(this.nt[r]) : undefined);
           }
-        : this.rt
+        : this.nt
           ? () => {
               const t = e[r];
-              this.rt[r] = signal(r, ge);
-              return this.Ze(() => t, accessor(this.rt[r]));
+              this.nt[r] = signal(r, pe);
+              return this.Ye(() => t, accessor(this.nt[r]));
             }
           : () => {
               const t = e[r];
-              return this.Ze(() => t);
+              return this.Ye(() => t);
             };
     if (t === 0) {
-      if (this.Je !== 0) {
-        this.Ue.dispose(false);
-        this.et = [];
-        this.Ye = [];
+      if (this.Ue !== 0) {
+        this.ze.dispose(false);
         this.$e = [];
-        this.Je = 0;
+        this.Xe = [];
+        this.Ze = [];
+        this.Ue = 0;
+        this.tt && (this.tt = []);
         this.nt && (this.nt = []);
-        this.rt && (this.rt = []);
       }
-      if (this.it && !this.$e[0]) {
-        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.it);
+      if (this.rt && !this.Ze[0]) {
+        this.Ze[0] = runWithOwner((this.$e[0] = createOwner()), this.rt);
       }
-    } else if (this.Je === 0) {
-      if (this.et[0]) this.et[0].dispose();
-      this.$e = new Array(t);
+    } else if (this.Ue === 0) {
+      if (this.$e[0]) this.$e[0].dispose();
+      this.Ze = new Array(t);
       for (r = 0; r < t; r++) {
-        this.Ye[r] = e[r];
-        this.$e[r] = runWithOwner((this.et[r] = createOwner()), i);
+        this.Xe[r] = e[r];
+        this.Ze[r] = runWithOwner((this.$e[r] = createOwner()), i);
       }
-      this.Je = t;
+      this.Ue = t;
     } else {
       let s,
         o,
@@ -2890,227 +2864,227 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         h = new Array(t),
-        p = this.nt ? new Array(t) : undefined,
-        g = this.rt ? new Array(t) : undefined;
+        p = this.tt ? new Array(t) : undefined,
+        g = this.nt ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Je, t);
-        s < o && (this.Ye[s] === e[s] || (this.nt && compare(this.tt, this.Ye[s], e[s])));
+        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++
       ) {
-        if (this.nt) setSignal(this.nt[s], e[s]);
+        if (this.tt) setSignal(this.tt[s], e[s]);
       }
       for (
-        o = this.Je - 1, u = t - 1;
+        o = this.Ue - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Ye[o] === e[u] || (this.nt && compare(this.tt, this.Ye[o], e[u])));
+        (this.Xe[o] === e[u] || (this.tt && compare(this.et, this.Xe[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.$e[o];
-        h[u] = this.et[o];
-        p && (p[u] = this.nt[o]);
-        g && (g[u] = this.rt[o]);
+        d[u] = this.Ze[o];
+        h[u] = this.$e[o];
+        p && (p[u] = this.tt[o]);
+        g && (g[u] = this.nt[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        l = this.tt ? this.tt(f) : f;
+        l = this.et ? this.et(f) : f;
         n = c.get(l);
         a[r] = n === undefined ? -1 : n;
         c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.Ye[n];
-        l = this.tt ? this.tt(f) : f;
+        f = this.Xe[n];
+        l = this.et ? this.et(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.$e[n];
-          h[r] = this.et[n];
-          p && (p[r] = this.nt[n]);
-          g && (g[r] = this.rt[n]);
+          d[r] = this.Ze[n];
+          h[r] = this.$e[n];
+          p && (p[r] = this.tt[n]);
+          g && (g[r] = this.nt[n]);
           r = a[r];
           c.set(l, r);
-        } else this.et[n].dispose();
+        } else this.$e[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.$e[r] = d[r];
-          this.et[r] = h[r];
+          this.Ze[r] = d[r];
+          this.$e[r] = h[r];
           if (p) {
-            this.nt[r] = p[r];
-            setSignal(this.nt[r], e[r]);
+            this.tt[r] = p[r];
+            setSignal(this.tt[r], e[r]);
           }
           if (g) {
-            this.rt[r] = g[r];
-            setSignal(this.rt[r], r);
+            this.nt[r] = g[r];
+            setSignal(this.nt[r], r);
           }
         } else {
-          this.$e[r] = runWithOwner((this.et[r] = createOwner()), i);
+          this.Ze[r] = runWithOwner((this.$e[r] = createOwner()), i);
         }
       }
-      this.$e = this.$e.slice(0, (this.Je = t));
-      this.Ye = e.slice(0);
+      this.Ze = this.Ze.slice(0, (this.Ue = t));
+      this.Xe = e.slice(0);
     }
   });
-  return this.$e;
+  return this.Ze;
 }
 function repeat(e, t, n) {
   const r = t;
   return updateRepeat.bind({
-    Ue: createOwner(),
-    Je: 0,
-    st: 0,
-    ot: e,
-    Ze: r,
-    et: [],
+    ze: createOwner(),
+    Ue: 0,
+    it: 0,
+    st: e,
+    Ye: r,
     $e: [],
-    ut: n?.from,
-    it: n?.fallback
+    Ze: [],
+    ot: n?.from,
+    rt: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.ot();
-  const t = this.ut?.() || 0;
-  runWithOwner(this.Ue, () => {
+  const e = this.st();
+  const t = this.ot?.() || 0;
+  runWithOwner(this.ze, () => {
     if (e === 0) {
-      if (this.Je !== 0) {
-        this.Ue.dispose(false);
-        this.et = [];
+      if (this.Ue !== 0) {
+        this.ze.dispose(false);
         this.$e = [];
-        this.Je = 0;
+        this.Ze = [];
+        this.Ue = 0;
       }
-      if (this.it && !this.$e[0]) {
-        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.it);
+      if (this.rt && !this.Ze[0]) {
+        this.Ze[0] = runWithOwner((this.$e[0] = createOwner()), this.rt);
       }
       return;
     }
     const n = t + e;
-    const r = this.st + this.Je;
-    if (this.Je === 0 && this.et[0]) this.et[0].dispose();
-    for (let e = n; e < r; e++) this.et[e - this.st].dispose();
-    if (this.st < t) {
-      let e = this.st;
-      while (e < t && e < this.Je) this.et[e++].dispose();
-      this.et.splice(0, t - this.st);
-      this.$e.splice(0, t - this.st);
-    } else if (this.st > t) {
-      let n = r - this.st - 1;
-      let i = this.st - t;
-      this.et.length = this.$e.length = 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;
       while (n >= i) {
-        this.et[n] = this.et[n - i];
         this.$e[n] = this.$e[n - i];
+        this.Ze[n] = this.Ze[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.$e[e] = runWithOwner((this.et[e] = createOwner()), () => this.Ze(e + t));
+        this.Ze[e] = runWithOwner((this.$e[e] = createOwner()), () => this.Ye(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.$e[e - t] = runWithOwner((this.et[e - t] = createOwner()), () => this.Ze(e));
+      this.Ze[e - t] = runWithOwner((this.$e[e - t] = createOwner()), () => this.Ye(e));
     }
-    this.$e = this.$e.slice(0, e);
-    this.st = t;
-    this.Je = e;
+    this.Ze = this.Ze.slice(0, e);
+    this.it = t;
+    this.Ue = e;
   });
-  return this.$e;
+  return this.Ze;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.qe = (e, t) => {
-    const r = e !== undefined ? e : n.we;
-    const i = t !== undefined ? t : n.pe;
-    n.we &= ~n.ft;
-    n.G.notify(n, n.ft, r, i);
+  n.Qe = (e, t) => {
+    const r = e !== undefined ? e : n.ge;
+    const i = t !== undefined ? t : n.ae;
+    n.ge &= ~n.ut;
+    n.M.notify(n, n.ut, r, i);
   };
-  n.ft = t;
-  n.Pe = true;
+  n.ut = t;
+  n.ve = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.G;
-  i.addChild((e.G = n));
-  cleanup(() => i.removeChild(e.G));
+  const i = e.M;
+  i.addChild((e.M = n));
+  cleanup(() => i.removeChild(e.M));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
-const ye = Symbol();
-const Se = createContext(null);
-let we = false;
+const ge = Symbol();
+const ye = createContext(null);
+let Se = false;
 const FALSE_ACCESSOR = () => false;
 function isRevealController(e) {
   return e instanceof RevealController;
 }
 function isSlotReady(e) {
-  return isRevealController(e) ? e.isReady() : e.lt.size === 0 && !e.ct;
+  return isRevealController(e) ? e.isReady() : e.ft.size === 0 && !e.lt;
 }
 function setSlotState(e, t, n, r) {
-  setSignal(e.dt, n);
-  setSignal(e.ht, r);
+  setSignal(e.ct, n);
+  setSignal(e.dt, r);
   if (isRevealController(e)) {
-    if (!n && e.gt === t) e.gt = undefined;
+    if (!n && e.ht === t) e.ht = undefined;
     return e.evaluate(n, r);
   }
-  if (!n && e.yt === t && e.St) e.yt = undefined;
+  if (!n && e.gt === t && e.yt) e.gt = undefined;
 }
 class RevealController {
+  St;
   wt;
-  _t;
-  bt = [];
-  gt;
-  dt = signal(false, { pureWrite: true, Fe: true });
-  ht = signal(false, { pureWrite: true, Fe: true });
-  Ot = true;
-  xt = false;
+  _t = [];
+  ht;
+  ct = signal(false, { pureWrite: true, De: true });
+  dt = signal(false, { pureWrite: true, De: true });
+  bt = true;
+  Ot = false;
   constructor(e, t) {
-    this.wt = e;
-    this._t = t;
+    this.St = e;
+    this.wt = t;
   }
-  vt(e) {
-    for (let t = 0; t < this.bt.length; t++) {
-      const n = this.bt[t];
-      if ((isRevealController(n) ? n.gt : n.yt) !== this) continue;
+  xt(e) {
+    for (let t = 0; t < this._t.length; t++) {
+      const n = this._t[t];
+      if ((isRevealController(n) ? n.ht : n.gt) !== this) continue;
       if (e(n) === false) return false;
     }
     return true;
   }
   isReady() {
-    return this.vt(isSlotReady);
+    return this.xt(isSlotReady);
   }
   register(e) {
-    if (this.bt.includes(e)) return;
-    this.bt.push(e);
-    const t = !!untrack(this.wt);
-    setSignal(e.dt, true), setSignal(e.ht, t ? false : !!untrack(this._t));
+    if (this._t.includes(e)) return;
+    this._t.push(e);
+    const t = !!untrack(this.St);
+    setSignal(e.ct, true), setSignal(e.dt, t ? false : !!untrack(this.wt));
     untrack(() => this.evaluate());
   }
   unregister(e) {
-    const t = this.bt.indexOf(e);
-    if (t >= 0) this.bt.splice(t, 1);
+    const t = this._t.indexOf(e);
+    if (t >= 0) this._t.splice(t, 1);
     untrack(() => this.evaluate());
   }
   evaluate(e, t) {
-    if (this.xt) return;
-    this.xt = true;
-    const n = this.Ot;
+    if (this.Ot) return;
+    this.Ot = true;
+    const n = this.bt;
     try {
-      const n = e ?? read(this.dt),
-        r = !!untrack(this._t),
+      const n = e ?? read(this.ct),
+        r = !!untrack(this.wt),
         i = t ?? r;
-      if (n && i) this.vt(e => setSlotState(e, this, true, true));
-      else if (!!untrack(this.wt)) {
+      if (n && i) this.xt(e => setSlotState(e, this, true, true));
+      else if (!!untrack(this.St)) {
         const e = this.isReady();
-        this.vt(t => setSlotState(t, this, !e, false));
+        this.xt(t => setSlotState(t, this, !e, false));
       } else {
         let e = false;
-        this.vt(t => {
+        this.xt(t => {
           if (e) return setSlotState(t, this, true, r);
           if (isSlotReady(t)) return setSlotState(t, this, false, false);
           e = true;
@@ -3118,91 +3092,91 @@ class RevealController {
         });
       }
     } finally {
-      this.Ot = this.isReady();
-      this.xt = false;
+      this.bt = this.isReady();
+      this.Ot = false;
     }
-    if (this.gt && n !== this.Ot) this.gt.evaluate();
+    if (this.ht && n !== this.bt) this.ht.evaluate();
   }
 }
 class CollectionQueue extends Queue {
+  vt;
+  ft = new Set();
   Pt;
-  lt = new Set();
+  lt = true;
+  ct = signal(false, { pureWrite: true, De: true });
+  dt = signal(false, { pureWrite: true, De: true });
+  gt;
+  yt = false;
   kt;
-  ct = true;
-  dt = signal(false, { pureWrite: true, Fe: true });
-  ht = signal(false, { pureWrite: true, Fe: true });
-  yt;
-  St = false;
-  Et;
-  Ct = ye;
+  Et = ge;
   constructor(e) {
     super();
-    this.Pt = e;
+    this.vt = e;
   }
   run(e) {
-    if (!e || (read(this.dt) && (!we || read(this.ht)))) return;
+    if (!e || (read(this.ct) && (!Se || read(this.dt)))) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.Pt)) return super.notify(e, t, n, r);
-    if (this.St && this.Et) {
+    if (!(t & this.vt)) return super.notify(e, t, n, r);
+    if (this.yt && this.kt) {
       const e = untrack(() => {
         try {
-          return this.Et();
+          return this.kt();
         } catch {
-          return ye;
+          return ge;
         }
       });
-      if (e !== this.Ct) {
-        this.Ct = e;
-        this.St = false;
-        this.lt.clear();
+      if (e !== this.Et) {
+        this.Et = e;
+        this.yt = false;
+        this.ft.clear();
       }
     }
-    if (this.Pt & a && this.St) return super.notify(e, t, n, r);
-    if (this.Pt & a && n & d) {
+    if (this.vt & a && this.yt) return super.notify(e, t, n, r);
+    if (this.vt & a && n & d) {
       return super.notify(e, d, n, r);
     }
-    if (n & this.Pt) {
-      this.ct = true;
-      const t = r?.source || e.pe?.source;
+    if (n & this.vt) {
+      this.lt = true;
+      const t = r?.source || e.ae?.source;
       if (t) {
-        const e = this.lt.size === 0;
-        this.lt.add(t);
-        if (e) setSignal(this.dt, true);
+        const e = this.ft.size === 0;
+        this.ft.add(t);
+        if (e) setSignal(this.ct, true);
       }
     }
-    t &= ~this.Pt;
+    t &= ~this.vt;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.lt) {
-      if (e.m & u || (!(e.we & this.Pt) && !(this.Pt & d && e.we & a))) this.lt.delete(e);
+    for (const e of this.ft) {
+      if (e.m & u || (!(e.ge & this.vt) && !(this.vt & d && e.ge & a))) this.ft.delete(e);
     }
-    if (!this.lt.size) {
-      if (this.Pt & a && this.ct && !this.St && this.kt) {
-        this.ct = !!(this.kt.we & this.Pt);
+    if (!this.ft.size) {
+      if (this.vt & a && this.lt && !this.yt && this.Pt) {
+        this.lt = !!(this.Pt.ge & this.vt);
       } else {
-        this.ct = false;
+        this.lt = false;
       }
-      if (!this.ct) {
-        setSignal(this.dt, false);
-        if (this.Et) {
+      if (!this.lt) {
+        setSignal(this.ct, false);
+        if (this.kt) {
           try {
-            this.Ct = untrack(() => this.Et());
+            this.Et = untrack(() => this.kt());
           } catch {}
         }
       }
     }
-    if (we) this.yt?.evaluate();
+    if (Se) this.gt?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, r) {
   const i = createOwner();
-  if (we) setContext(Se, null, i);
+  if (Se) setContext(ye, null, i);
   const s = new CollectionQueue(e);
-  if (r) s.Et = r;
-  const o = (s.kt = createBoundChildren(i, t, s, e));
+  if (r) s.kt = r;
+  const o = (s.Pt = createBoundChildren(i, t, s, e));
   untrack(() => {
     let t = false;
     try {
@@ -3211,20 +3185,20 @@ function createCollectionBoundary(e, t, n, r) {
       if (e instanceof NotReadyError) t = true;
       else throw e;
     }
-    s.ct = t || !!(o.we & e) || o.pe instanceof NotReadyError;
+    s.lt = t || !!(o.ge & e) || o.ae instanceof NotReadyError;
   });
-  const u = we && e === a ? getContext(Se) : null;
+  const u = Se && e === a ? getContext(ye) : null;
   if (u) {
-    s.yt = u;
+    s.gt = u;
     u.register(s);
     cleanup(() => u.unregister(s));
   }
   const f = computed(() => {
-    if (!read(s.dt)) {
+    if (!read(s.ct)) {
       const e = read(o);
-      if (!untrack(() => read(s.dt))) return (s.St = true), e;
+      if (!untrack(() => read(s.ct))) return (s.yt = true), e;
     }
-    if (we && read(s.ht)) return undefined;
+    if (Se && read(s.dt)) return undefined;
     return n(s);
   });
   return accessor(f);
@@ -3234,22 +3208,22 @@ function createLoadingBoundary(e, t, n) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(d, e, e => {
-    let n = e.lt.values().next().value;
-    const r = n.pe?.cause ?? n.pe;
+    let n = e.ft.values().next().value;
+    const r = n.ae?.cause ?? n.ae;
     return t(r, () => {
-      for (const t of e.lt) recompute(t);
+      for (const t of e.ft) recompute(t);
       schedule();
     });
   });
 }
 function createRevealOrder(e, t) {
-  we = true;
+  Se = true;
   const n = createOwner();
-  const r = getContext(Se);
+  const r = getContext(ye);
   const i = t?.together || FALSE_ACCESSOR,
     s = t?.collapsed || FALSE_ACCESSOR;
   const o = new RevealController(i, s);
-  setContext(Se, o, n);
+  setContext(ye, o, n);
   return runWithOwner(n, () => {
     const t = e();
     computed(() => {
@@ -3258,7 +3232,7 @@ function createRevealOrder(e, t) {
       o.evaluate();
     });
     if (r) {
-      o.gt = r;
+      o.ht = r;
       r.register(o);
       cleanup(() => r.unregister(o));
     }
@@ -3314,12 +3288,13 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = X;
+const we = undefined;
+exports.$PROXY = J;
 exports.$REFRESH = O;
-exports.$TARGET = J;
-exports.$TRACK = U;
+exports.$TARGET = U;
+exports.$TRACK = z;
 exports.ContextNotFoundError = ContextNotFoundError;
-exports.DEV = v;
+exports.DEV = we;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
 exports.SUPPORTS_PROXY = _;
@@ -3372,5 +3347,5 @@ exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
 exports.snapshot = snapshot;
-exports.storePath = de;
+exports.storePath = ae;
 exports.untrack = untrack;