@solidjs/signals 0.13.9 → 0.13.10

package/dist/node.cjs

@@ -32,20 +32,20 @@ const s = 1 << 4;
 const o = 1 << 5;
 const u = 1 << 6;
 const f = 1 << 7;
-const c = 1 << 8;
-const l = 1 << 9;
+const l = 1 << 8;
+const c = 1 << 9;
 const a = 1 << 0;
 const d = 1 << 1;
-const p = 1 << 2;
-const h = 1;
+const h = 1 << 2;
+const p = 1;
 const g = 2;
 const y = 3;
 const S = {};
 const w = {};
 const m = "sp";
-const b = typeof Proxy === "function";
-const O = {};
-const _ = Symbol("refresh");
+const _ = typeof Proxy === "function";
+const b = {};
+const O = Symbol("refresh");
 function actualInsertIntoHeap(e, t) {
   const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
   if (n >= e.o) e.o = n + 1;
@@ -53,10 +53,10 @@ function actualInsertIntoHeap(e, t) {
   const i = t.l[r];
   if (i === undefined) t.l[r] = e;
   else {
-    const t = i.p;
-    t.h = e;
-    e.p = t;
-    i.p = e;
+    const t = i.h;
+    t.p = e;
+    e.h = t;
+    i.h = e;
   }
   if (r > t.S) t.S = r;
 }
@@ -79,23 +79,23 @@ function deleteFromHeap(e, t) {
   if (!(n & (i | s))) return;
   e.m = n & -25;
   const r = e.o;
-  if (e.p === e) t.l[r] = undefined;
+  if (e.h === e) t.l[r] = undefined;
   else {
-    const n = e.h;
+    const n = e.p;
     const i = t.l[r];
     const s = n ?? i;
     if (e === i) t.l[r] = n;
-    else e.p.h = n;
-    s.p = e.p;
+    else e.h.p = n;
+    s.h = e.h;
   }
-  e.p = e;
-  e.h = undefined;
+  e.h = e;
+  e.p = undefined;
 }
 function markHeap(e) {
-  if (e.O) return;
-  e.O = true;
+  if (e._) return;
+  e._ = true;
   for (let t = 0; t <= e.S; t++) {
-    for (let n = e.l[t]; n !== undefined; n = n.h) {
+    for (let n = e.l[t]; n !== undefined; n = n.p) {
       if (n.m & i) markNode(n);
     }
   }
@@ -104,25 +104,25 @@ function markNode(e, r = n) {
   const i = e.m;
   if ((i & (t | n)) >= r) return;
   e.m = (i & -4) | r;
-  for (let n = e._; n !== null; n = n.P) {
+  for (let n = e.O; n !== null; n = n.P) {
     markNode(n.k, t);
   }
-  if (e.W !== null) {
-    for (let n = e.W; n !== null; n = n.C) {
-      for (let e = n._; e !== null; e = e.P) {
+  if (e.C !== null) {
+    for (let n = e.C; n !== null; n = n.W) {
+      for (let e = n.O; e !== null; e = e.P) {
         markNode(e.k, t);
       }
     }
   }
 }
 function runHeap(e, t) {
-  e.O = false;
-  for (e.j = 0; e.j <= e.S; e.j++) {
-    let n = e.l[e.j];
+  e._ = false;
+  for (e.A = 0; e.A <= e.S; e.A++) {
+    let n = e.l[e.A];
     while (n !== undefined) {
       if (n.m & i) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.j];
+      n = e.l[e.A];
     }
   }
   e.S = 0;
@@ -130,120 +130,162 @@ function runHeap(e, t) {
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.A; t; t = t.N) {
-    const e = t.L;
-    const r = e.I || e;
-    if (r.R && r.o >= n) n = r.o + 1;
+  for (let t = e.N; t; t = t.j) {
+    const e = t.R;
+    const r = e.L || e;
+    if (r.I && r.o >= n) n = r.o + 1;
   }
   if (e.o !== n) {
     e.o = n;
-    for (let n = e._; n !== null; n = n.P) {
+    for (let n = e.O; n !== null; n = n.P) {
       insertIntoHeapHeight(n.k, t);
     }
   }
 }
-const x = new Set();
-const P = { l: new Array(2e3).fill(undefined), O: false, j: 0, S: 0 };
-const v = { l: new Array(2e3).fill(undefined), O: false, j: 0, S: 0 };
-let E = 0;
-let k = null;
-let W = false;
-let C = false;
+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 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 A = false;
+let N = false;
 let j = null;
 function enforceLoadingBoundary(e) {}
 function shouldReadStashedOptimisticValue(e) {
   return !!j?.has(e);
 }
 function runLaneEffects(e) {
-  for (const t of L) {
-    if (t.T || t.H.size > 0) continue;
-    const n = t.q[e - 1];
+  for (const t of I) {
+    if (t.D || t.F.size > 0) continue;
+    const n = t.V[e - 1];
     if (n.length) {
-      t.q[e - 1] = [];
+      t.V[e - 1] = [];
       runQueue(n, e);
     }
   }
 }
 function queueStashedOptimisticEffects(e) {
-  for (let t = e._; t !== null; t = t.P) {
+  for (let t = e.O; t !== null; t = t.P) {
     const e = t.k;
-    if (!e.D) continue;
-    if (e.D === y) {
-      if (!e.F) {
-        e.F = true;
-        e.V.enqueue(g, e.M);
+    if (!e.M) continue;
+    if (e.M === y) {
+      if (!e.B) {
+        e.B = true;
+        e.G.enqueue(g, e.K);
       }
       continue;
     }
-    const n = e.m & o ? v : P;
-    if (n.j > e.o) n.j = e.o;
+    const n = e.m & o ? E : k;
+    if (n.A > e.o) n.A = e.o;
     insertIntoHeap(e, n);
   }
 }
 function setProjectionWriteActive(e) {
-  C = e;
+  N = e;
 }
 function mergeTransitionState(e, t) {
-  t.B = e;
-  e.G.push(...t.G);
-  for (const n of L) {
-    if (n.K === t) n.K = e;
+  t.U = e;
+  e.J.push(...t.J);
+  for (const n of I) {
+    if (n.X === t) n.X = e;
   }
-  e.U.push(...t.U);
-  for (const n of t.J) e.J.add(n);
-  for (const n of t.X) {
-    if (!e.X.includes(n)) e.X.push(n);
+  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);
   }
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.Y = undefined;
-    if (n.Z !== S) {
-      n.$ = n.Z;
-      n.Z = S;
+    n.ee = undefined;
+    if (n.te !== S) {
+      n.ne = n.te;
+      n.te = S;
     }
-    const r = n.ee;
-    n.ee = S;
-    if (r !== S && n.$ !== r) insertSubs(n, true);
-    n.K = null;
+    const r = n.re;
+    n.re = S;
+    if (r !== S && n.ne !== r) insertSubs(n, true);
+    n.X = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
-  for (const t of L) {
-    const n = e ? t.K === e : !t.K;
+  for (const t of I) {
+    const n = e ? t.X === e : !t.X;
     if (!n) continue;
-    if (!t.T) {
-      if (t.q[0].length) runQueue(t.q[0], h);
-      if (t.q[1].length) runQueue(t.q[1], g);
+    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.te.Y === t) t.te.Y = undefined;
-    t.H.clear();
-    t.q[0].length = 0;
-    t.q[1].length = 0;
-    L.delete(t);
-    N.delete(t.te);
+    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);
   }
 }
 function schedule() {
-  if (W) return;
-  W = true;
-  if (!A.ne && !C) queueMicrotask(flush);
+  if (A) return;
+  A = true;
+  if (!R.se && !N) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  re = [[], []];
-  ie = [];
-  created = E;
+  oe = [[], []];
+  ue = [];
+  created = C;
   addChild(e) {
-    this.ie.push(e);
+    this.ue.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.ie.indexOf(e);
+    const t = this.ue.indexOf(e);
     if (t >= 0) {
-      this.ie.splice(t, 1);
+      this.ue.splice(t, 1);
       e.i = null;
     }
   }
@@ -252,81 +294,81 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.re[e - 1].length) {
-      const t = this.re[e - 1];
-      this.re[e - 1] = [];
+    if (this.oe[e - 1].length) {
+      const t = this.oe[e - 1];
+      this.oe[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.ie.length; t++) this.ie[t].run?.(e);
+    for (let t = 0; t < this.ue.length; t++) this.ue[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
-      if (M) {
-        const n = findLane(M);
-        n.q[e - 1].push(t);
+      if (G) {
+        const n = findLane(G);
+        n.V[e - 1].push(t);
       } else {
-        this.re[e - 1].push(t);
+        this.oe[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    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];
+    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];
       if (!r) {
-        r = { re: [[], []], ie: [] };
-        e.ie[t] = r;
+        r = { oe: [[], []], ue: [] };
+        e.ue[t] = r;
       }
       n.stashQueues(r);
     }
   }
   restoreQueues(e) {
-    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];
+    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];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  ne = false;
-  se = [];
-  U = [];
-  J = new Set();
-  static oe;
-  static ue;
-  static fe = null;
+  se = false;
+  fe = [];
+  Y = [];
+  Z = new Set();
+  static le;
+  static ce;
+  static ae = null;
   flush() {
-    if (this.ne) return;
-    this.ne = true;
+    if (this.se) return;
+    this.se = true;
     try {
-      runHeap(P, GlobalQueue.oe);
-      if (k) {
-        const e = transitionComplete(k);
+      runHeap(k, GlobalQueue.le);
+      if (W) {
+        const e = transitionComplete(W);
         if (!e) {
-          const e = k;
-          runHeap(v, GlobalQueue.oe);
-          this.se = [];
-          this.U = [];
-          this.J = new Set();
-          runLaneEffects(h);
+          const e = W;
+          runHeap(E, GlobalQueue.le);
+          this.fe = [];
+          this.Y = [];
+          this.Z = new Set();
+          runLaneEffects(p);
           runLaneEffects(g);
-          this.stashQueues(e.ce);
-          E++;
-          W = P.S >= P.j;
-          reassignPendingTransition(e.se);
-          k = null;
-          if (!e.G.length && e.U.length) {
+          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.U.length; t++) {
-              const n = e.U[t];
-              if (n.R || n.le) continue;
+            for (let t = 0; t < e.Y.length; t++) {
+              const n = e.Y[t];
+              if (n.I || n.he) continue;
               j.add(n);
               queueStashedOptimisticEffects(n);
             }
@@ -338,35 +380,36 @@ class GlobalQueue extends Queue {
           }
           return;
         }
-        this.se !== k.se && this.se.push(...k.se);
-        this.restoreQueues(k.ce);
-        x.delete(k);
-        const t = k;
-        k = null;
-        reassignPendingTransition(this.se);
+        this.fe !== W.fe && this.fe.push(...W.fe);
+        this.restoreQueues(W.de);
+        P.delete(W);
+        const t = W;
+        W = null;
+        reassignPendingTransition(this.fe);
         finalizePureQueue(t);
       } else {
-        if (x.size) runHeap(v, GlobalQueue.oe);
+        if (P.size) runHeap(E, GlobalQueue.le);
         finalizePureQueue();
       }
-      E++;
-      W = P.S >= P.j;
-      runLaneEffects(h);
-      this.run(h);
+      C++;
+      A = k.S >= k.A;
+      runLaneEffects(p);
+      this.run(p);
       runLaneEffects(g);
       this.run(g);
+      if (false);
     } finally {
-      this.ne = false;
+      this.se = false;
     }
   }
   notify(e, t, n, r) {
     if (t & a) {
       if (n & a) {
-        const t = r !== undefined ? r : e.ae;
-        if (k && t) {
+        const t = r !== undefined ? r : e.pe;
+        if (W && t) {
           const e = t.source;
-          if (!k.X.includes(e)) {
-            k.X.push(e);
+          if (!W.$.includes(e)) {
+            W.$.push(e);
             schedule();
           }
         }
@@ -377,58 +420,58 @@ class GlobalQueue extends Queue {
   }
   initTransition(e) {
     if (e) e = currentTransition(e);
-    if (e && e === k) return;
-    if (!e && k && k.de === E) return;
-    if (!k) {
-      k = e ?? {
-        de: E,
-        se: [],
-        X: [],
-        U: [],
-        J: new Set(),
-        G: [],
-        ce: { re: [[], []], ie: [] },
-        B: false
+    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
       };
     } else if (e) {
-      const t = k;
+      const t = W;
       mergeTransitionState(e, t);
-      x.delete(t);
-      k = e;
+      P.delete(t);
+      W = e;
     }
-    x.add(k);
-    k.de = E;
-    if (this.se !== k.se) {
-      for (let e = 0; e < this.se.length; e++) {
-        const t = this.se[e];
-        t.K = k;
-        k.se.push(t);
+    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);
       }
-      this.se = k.se;
+      this.fe = W.fe;
     }
-    if (this.U !== k.U) {
-      for (let e = 0; e < this.U.length; e++) {
-        const t = this.U[e];
-        t.K = k;
-        k.U.push(t);
+    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);
       }
-      this.U = k.U;
+      this.Y = W.Y;
     }
-    for (const e of L) {
-      if (!e.K) e.K = k;
+    for (const e of I) {
+      if (!e.X) e.X = W;
     }
-    if (this.J !== k.J) {
-      for (const e of this.J) k.J.add(e);
-      this.J = k.J;
+    if (this.Z !== W.Z) {
+      for (const e of this.Z) W.Z.add(e);
+      this.Z = W.Z;
     }
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.Y || M;
-  const r = e.pe !== undefined;
-  for (let i = e._; i !== null; i = i.P) {
-    if (r && i.k.he) {
-      i.k.m |= c;
+  const n = e.ee || G;
+  const r = e.ye !== undefined;
+  for (let i = e.O; i !== null; i = i.P) {
+    if (r && i.k.Se) {
+      i.k.m |= l;
       continue;
     }
     if (t && n) {
@@ -436,47 +479,47 @@ function insertSubs(e, t = false) {
       assignOrMergeLane(i.k, n);
     } else if (t) {
       i.k.m |= f;
-      i.k.Y = undefined;
+      i.k.ee = undefined;
     }
     const e = i.k;
-    if (e.D === y) {
-      if (!e.F) {
-        e.F = true;
-        e.V.enqueue(g, e.M);
+    if (e.M === y) {
+      if (!e.B) {
+        e.B = true;
+        e.G.enqueue(g, e.K);
       }
       continue;
     }
-    const s = i.k.m & o ? v : P;
-    if (s.j > i.k.o) s.j = i.k.o;
+    const s = i.k.m & o ? E : k;
+    if (s.A > i.k.o) s.A = i.k.o;
     insertIntoHeap(i.k, s);
   }
 }
 function commitPendingNodes() {
-  const e = A.se;
+  const e = R.fe;
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    if (n.Z !== S) {
-      n.$ = n.Z;
-      n.Z = S;
-      if (n.D && n.D !== y) n.F = true;
+    if (n.te !== S) {
+      n.ne = n.te;
+      n.te = S;
+      if (n.M && n.M !== y) n.B = true;
     }
-    if (!(n.ge & a)) n.ge &= ~p;
-    if (n.R) GlobalQueue.ue(n, false, true);
+    if (!(n.we & a)) n.we &= ~h;
+    if (n.I) GlobalQueue.ce(n, false, true);
   }
   e.length = 0;
 }
 function finalizePureQueue(e = null, t = false) {
   const n = !t;
   if (n) commitPendingNodes();
-  if (!t) checkBoundaryChildren(A);
-  if (P.S >= P.j) runHeap(P, GlobalQueue.oe);
+  if (!t) checkBoundaryChildren(R);
+  if (k.S >= k.A) runHeap(k, GlobalQueue.le);
   if (n) {
     commitPendingNodes();
-    resolveOptimisticNodes(e ? e.U : A.U);
-    const t = e ? e.J : A.J;
-    if (GlobalQueue.fe && t.size) {
+    resolveOptimisticNodes(e ? e.Y : R.Y);
+    const t = e ? e.Z : R.Z;
+    if (GlobalQueue.ae && t.size) {
       for (const e of t) {
-        GlobalQueue.fe(e);
+        GlobalQueue.ae(e);
       }
       t.clear();
       schedule();
@@ -485,251 +528,251 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.ie) {
+  for (const t of e.ue) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  A.J.add(e);
+  R.Z.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].K = k;
+    e[t].X = W;
   }
 }
-const A = new GlobalQueue();
+const R = new GlobalQueue();
 function flush() {
-  if (A.ne) {
+  if (R.se) {
     return;
   }
-  while (W || k) {
-    A.flush();
+  while (A || W) {
+    R.flush();
   }
 }
 function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function transitionComplete(e) {
-  if (e.B) return true;
-  if (e.G.length) return false;
+  if (e.U) return true;
+  if (e.J.length) return false;
   let t = true;
-  for (let n = 0; n < e.X.length; n++) {
-    const r = e.X[n];
-    if (r.ge & a && r.ae?.source === r) {
+  for (let n = 0; n < e.$.length; n++) {
+    const r = e.$[n];
+    if (r.we & a && r.pe?.source === r) {
       t = false;
       break;
     }
   }
   if (t) {
-    for (let n = 0; n < e.U.length; n++) {
-      const r = e.U[n];
+    for (let n = 0; n < e.Y.length; n++) {
+      const r = e.Y[n];
       if (
         hasActiveOverride(r) &&
-        "ge" in r &&
-        r.ge & a &&
-        r.ae instanceof NotReadyError &&
-        r.ae.source !== r
+        "we" in r &&
+        r.we & a &&
+        r.pe instanceof NotReadyError &&
+        r.pe.source !== r
       ) {
         t = false;
         break;
       }
     }
   }
-  t && (e.B = true);
+  t && (e.U = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.B && typeof e.B === "object") e = e.B;
+  while (e.U && typeof e.U === "object") e = e.U;
   return e;
 }
 function setActiveTransition(e) {
-  k = e;
+  W = e;
 }
 function runInTransition(e, t) {
-  const n = k;
+  const n = W;
   try {
-    k = currentTransition(e);
+    W = currentTransition(e);
     return t();
   } finally {
-    k = n;
+    W = n;
   }
 }
-const N = new WeakMap();
-const L = new Set();
+const L = new WeakMap();
+const I = new Set();
 function getOrCreateLane(e) {
-  let t = N.get(e);
+  let t = L.get(e);
   if (t) {
     return findLane(t);
   }
-  const n = e.ye;
-  const r = n?.Y ? findLane(n.Y) : null;
-  t = { te: e, H: new Set(), q: [[], []], T: null, K: k, Se: r };
-  N.set(e, t);
-  L.add(t);
-  e.we = false;
+  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;
   return t;
 }
 function findLane(e) {
-  while (e.T) e = e.T;
+  while (e.D) e = e.D;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.T = e;
-  for (const n of t.H) e.H.add(n);
-  e.q[0].push(...t.q[0]);
-  e.q[1].push(...t.q[1]);
+  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]);
   return e;
 }
 function resolveLane(e) {
-  const t = e.Y;
+  const t = e.ee;
   if (!t) return undefined;
   const n = findLane(t);
-  if (L.has(n)) return n;
-  e.Y = undefined;
+  if (I.has(n)) return n;
+  e.ee = undefined;
   return undefined;
 }
 function resolveTransition(e) {
-  return resolveLane(e)?.K ?? e.K;
+  return resolveLane(e)?.X ?? e.X;
 }
 function hasActiveOverride(e) {
-  return !!(e.ee !== undefined && e.ee !== S);
+  return !!(e.re !== undefined && e.re !== S);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const r = e.Y;
+  const r = e.ee;
   if (r) {
-    if (r.T) {
-      e.Y = t;
+    if (r.D) {
+      e.ee = t;
       return;
     }
     const i = findLane(r);
-    if (L.has(i)) {
+    if (I.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
-        if (n.Se && findLane(n.Se) === i) {
-          e.Y = t;
-        } else if (i.Se && findLane(i.Se) === n);
+        if (n._e && findLane(n._e) === i) {
+          e.ee = t;
+        } else if (i._e && findLane(i._e) === n);
         else mergeLanes(n, i);
       }
       return;
     }
   }
-  e.Y = t;
+  e.ee = t;
 }
 function unlinkSubs(e) {
-  const t = e.L;
-  const n = e.N;
+  const t = e.R;
+  const n = e.j;
   const r = e.P;
-  const i = e.me;
-  if (r !== null) r.me = i;
-  else t.be = i;
+  const i = e.Oe;
+  if (r !== null) r.Oe = i;
+  else t.xe = i;
   if (i !== null) i.P = r;
   else {
-    t._ = r;
+    t.O = r;
     if (r === null) {
-      t.Oe?.();
-      t.R && !t._e && !(t.m & o) && unobserved(t);
+      t.ve?.();
+      t.I && !t.Pe && !(t.m & o) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? v : P);
-  let t = e.A;
+  deleteFromHeap(e, e.m & o ? E : k);
+  let t = e.N;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.A = null;
+  e.N = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.xe;
-  if (n !== null && n.L === e) return;
+  const n = t.ke;
+  if (n !== null && n.R === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
-    i = n !== null ? n.N : t.A;
-    if (i !== null && i.L === e) {
-      t.xe = i;
+    i = n !== null ? n.j : t.N;
+    if (i !== null && i.R === e) {
+      t.ke = i;
       return;
     }
   }
-  const o = e.be;
+  const o = e.xe;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.xe = e.be = { L: e, k: t, N: i, me: o, P: null });
-  if (n !== null) n.N = u;
-  else t.A = u;
+  const u = (t.ke = e.xe = { R: e, k: t, j: i, Oe: o, P: null });
+  if (n !== null) n.j = u;
+  else t.N = u;
   if (o !== null) o.P = u;
-  else e._ = u;
+  else e.O = u;
 }
 function isValidLink(e, t) {
-  const n = t.xe;
+  const n = t.ke;
   if (n !== null) {
-    let r = t.A;
+    let r = t.N;
     do {
       if (r === e) return true;
       if (r === n) break;
-      r = r.N;
+      r = r.j;
     } while (r !== null);
   }
   return false;
 }
-const I = {};
+const T = {};
 function markDisposal(e) {
-  let t = e.Pe;
+  let t = e.T;
   while (t) {
     t.m |= o;
     if (t.m & i) {
-      deleteFromHeap(t, P);
-      insertIntoHeap(t, v);
+      deleteFromHeap(t, k);
+      insertIntoHeap(t, E);
     }
     markDisposal(t);
-    t = t.ve;
+    t = t.H;
   }
 }
 function dispose(e) {
-  let t = e.A || null;
+  let t = e.N || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.A = null;
-  e.xe = null;
+  e.N = null;
+  e.ke = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
-  if (t && e.R) e.Ee = null;
-  let r = n ? e.ke : e.Pe;
+  if (t && e.I) e.Ee = null;
+  let r = n ? e.Ce : e.T;
   while (r) {
-    const e = r.ve;
-    if (r.A) {
+    const e = r.H;
+    if (r.N) {
       const e = r;
-      deleteFromHeap(e, e.m & o ? v : P);
-      let t = e.A;
+      deleteFromHeap(e, e.m & o ? E : k);
+      let t = e.N;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.A = null;
-      e.xe = null;
+      e.N = null;
+      e.ke = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.ke = null;
+    e.Ce = null;
   } else {
-    e.Pe = null;
+    e.T = null;
     e.We = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.Ce : e.je;
+  let n = t ? e.Ae : e.Ne;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -739,11 +782,11 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.Ce = null) : (e.je = null);
+  t ? (e.Ae = null) : (e.Ne = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.Ae && n.i) n = n.i;
+  while (n.je && n.i) n = n.i;
   if (n.id != null) return formatId(n.id, t ? n.We++ : n.We);
   throw new Error("Cannot get child id from owner without an id");
 }
@@ -759,50 +802,50 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (q || F) return I;
-  return T ? V : null;
+  if (F || M) return T;
+  return Q ? B : null;
 }
 function getOwner() {
-  return V;
+  return B;
 }
 function cleanup(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];
+  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];
   return e;
 }
 function isDisposed(e) {
   return !!(e.m & (u | o));
 }
 function createOwner(e) {
-  const t = V;
+  const t = B;
   const n = e?.transparent ?? false;
   const r = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    Ae: n || undefined,
+    je: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    Pe: null,
-    ve: null,
-    je: null,
-    V: t?.V ?? A,
-    Ne: t?.Ne || O,
+    T: null,
+    H: null,
+    Ne: null,
+    G: t?.G ?? R,
+    Re: t?.Re || b,
     We: 0,
+    Ae: null,
     Ce: null,
-    ke: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
     }
   };
   if (t) {
-    const e = t.Pe;
+    const e = t.T;
     if (e === null) {
-      t.Pe = r;
+      t.T = r;
     } else {
-      r.ve = e;
-      t.Pe = r;
+      r.H = e;
+      t.T = r;
     }
   }
   return r;
@@ -847,22 +890,22 @@ function clearPendingSources(e) {
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.ae = null;
+    e.pe = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.ae = n;
+    e.pe = n;
     return;
   }
-  const r = e.ae;
+  const r = e.pe;
   if (!(r instanceof NotReadyError) || r.source !== t) {
-    e.ae = new NotReadyError(t);
+    e.pe = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
-  for (let n = e._; n !== null; n = n.P) t(n.k);
-  for (let n = e.W; n !== null; n = n.C) {
-    for (let e = n._; e !== null; e = e.P) t(e.k);
+  for (let n = e.O; n !== null; n = n.P) t(n.k);
+  for (let n = e.C; n !== null; n = n.W) {
+    for (let e = n.O; e !== null; e = e.P) t(e.k);
   }
 }
 function settlePendingSource(e) {
@@ -871,30 +914,30 @@ function settlePendingSource(e) {
   const settle = r => {
     if (n.has(r) || !removePendingSource(r, e)) return;
     n.add(r);
-    r.de = E;
+    r.ge = C;
     const i = r.Le ?? r.Ie?.values().next().value;
     if (i) {
       setPendingError(r, i);
       updatePendingSignal(r);
     } else {
-      r.ge &= ~a;
+      r.we &= ~a;
       setPendingError(r);
       updatePendingSignal(r);
-      if (r.Re) {
-        if (r.D === y) {
+      if (r.Te) {
+        if (r.M === y) {
           const e = r;
-          if (!e.F) {
-            e.F = true;
-            e.V.enqueue(g, e.M);
+          if (!e.B) {
+            e.B = true;
+            e.G.enqueue(g, e.K);
           }
         } else {
-          const e = r.m & o ? v : P;
-          if (e.j > r.o) e.j = r.o;
+          const e = r.m & o ? E : k;
+          if (e.A > r.o) e.A = r.o;
           insertIntoHeap(r, e);
         }
         t = true;
       }
-      r.Re = false;
+      r.Te = false;
     }
     forEachDependent(r, settle);
   };
@@ -913,33 +956,33 @@ function handleAsync(e, t, r) {
   let u;
   const handleError = n => {
     if (e.Ee !== t) return;
-    A.initTransition(resolveTransition(e));
+    R.initTransition(resolveTransition(e));
     notifyStatus(e, n instanceof NotReadyError ? a : d, n);
-    e.de = E;
+    e.ge = C;
   };
   const asyncWrite = (i, s) => {
     if (e.Ee !== t) return;
     if (e.m & (n | f)) return;
-    A.initTransition(resolveTransition(e));
+    R.initTransition(resolveTransition(e));
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.H.delete(e);
+    if (o) o.F.delete(e);
     if (r) r(i);
-    else if (e.ee !== undefined) {
-      if (e.ee !== undefined && e.ee !== S) e.Z = i;
+    else if (e.re !== undefined) {
+      if (e.re !== undefined && e.re !== S) e.te = i;
       else {
-        e.$ = i;
+        e.ne = i;
         insertSubs(e);
       }
-      e.de = E;
+      e.ge = C;
     } else if (o) {
-      const t = e.$;
-      const n = e.Te;
+      const t = e.ne;
+      const n = e.He;
       if (!n || !n(i, t)) {
-        e.$ = i;
-        e.de = E;
-        if (e.He) {
-          setSignal(e.He, i);
+        e.ne = i;
+        e.ge = C;
+        if (e.Qe) {
+          setSignal(e.Qe, i);
         }
         insertSubs(e, true);
       }
@@ -967,8 +1010,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      A.initTransition(resolveTransition(e));
-      throw new NotReadyError(V);
+      R.initTransition(resolveTransition(e));
+      throw new NotReadyError(B);
     }
   }
   if (s) {
@@ -1021,72 +1064,72 @@ function handleAsync(e, t, r) {
     };
     const s = iterate();
     if (!r && !s) {
-      A.initTransition(resolveTransition(e));
-      throw new NotReadyError(V);
+      R.initTransition(resolveTransition(e));
+      throw new NotReadyError(B);
     }
   }
   return u;
 }
 function clearStatus(e, t = false) {
   clearPendingSources(e);
-  e.Re = false;
-  e.ge = t ? 0 : e.ge & p;
+  e.Te = false;
+  e.we = t ? 0 : e.we & 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.ee !== undefined && !o;
+  const u = t === a && e.re !== undefined && !o;
   const f = u && hasActiveOverride(e);
   if (!r) {
     if (t === a && s) {
       addPendingSource(e, s);
-      e.ge = a | (e.ge & p);
+      e.we = a | (e.we & h);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.ge = t | (t !== d ? e.ge & p : 0);
-      e.ae = n;
+      e.we = t | (t !== d ? e.we & h : 0);
+      e.pe = n;
     }
     updatePendingSignal(e);
   }
   if (i && !r) {
     assignOrMergeLane(e, i);
   }
-  const c = r || f;
-  const l = r || u ? undefined : i;
-  if (e.Qe) {
+  const l = r || f;
+  const c = r || u ? undefined : i;
+  if (e.qe) {
     if (r && t === a) {
       return;
     }
-    if (c) {
-      e.Qe(t, n);
+    if (l) {
+      e.qe(t, n);
     } else {
-      e.Qe();
+      e.qe();
     }
     return;
   }
   forEachDependent(e, e => {
-    e.de = E;
+    e.ge = C;
     if (
       (t === a && s && e.Le !== s && !e.Ie?.has(s)) ||
-      (t !== a && (e.ae !== n || e.Le || e.Ie))
+      (t !== a && (e.pe !== n || e.Le || e.Ie))
     ) {
-      if (!c && !e.K) A.se.push(e);
-      notifyStatus(e, t, n, c, l);
+      if (!l && !e.X) R.fe.push(e);
+      notifyStatus(e, t, n, l, c);
     }
   });
 }
-let R = null;
+let H = null;
 function enableExternalSource(e) {
   const { factory: t, untrack: n = e => e() } = e;
-  if (R) {
-    const { factory: e, untrack: r } = R;
-    R = {
+  if (H) {
+    const { factory: e, untrack: r } = H;
+    H = {
       factory: (n, r) => {
         const i = e(n, r);
         const s = t(e => i.track(e), r);
@@ -1101,175 +1144,175 @@ function enableExternalSource(e) {
       untrack: e => r(() => n(e))
     };
   } else {
-    R = { factory: t, untrack: n };
+    H = { factory: t, untrack: n };
   }
 }
-GlobalQueue.oe = recompute;
-GlobalQueue.ue = disposeChildren;
-let T = false;
-let H = false;
+GlobalQueue.le = recompute;
+GlobalQueue.ce = disposeChildren;
 let Q = false;
 let q = false;
 let D = false;
 let F = false;
-let V = null;
-let M = null;
-let B = false;
+let V = false;
+let M = false;
+let B = null;
 let G = null;
+let K = false;
+let z = null;
 function ownerInSnapshotScope(e) {
   while (e) {
-    if (e.qe) return true;
+    if (e.De) return true;
     e = e.i;
   }
   return false;
 }
 function setSnapshotCapture(e) {
-  B = e;
-  if (e && !G) G = new Set();
+  K = e;
+  if (e && !z) z = new Set();
 }
 function markSnapshotScope(e) {
-  e.qe = true;
+  e.De = true;
 }
 function releaseSnapshotScope(e) {
-  e.qe = false;
+  e.De = false;
   releaseSubtree(e);
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.Pe;
+  let t = e.T;
   while (t) {
-    if (t.qe) {
-      t = t.ve;
+    if (t.De) {
+      t = t.H;
       continue;
     }
-    if (t.R) {
+    if (t.I) {
       const e = t;
-      e.he = false;
-      if (e.m & c) {
-        e.m &= ~c;
+      e.Se = false;
+      if (e.m & l) {
+        e.m &= ~l;
         e.m |= n;
-        if (P.j > e.o) P.j = e.o;
-        insertIntoHeap(e, P);
+        if (k.A > e.o) k.A = e.o;
+        insertIntoHeap(e, k);
       }
     }
     releaseSubtree(t);
-    t = t.ve;
+    t = t.H;
   }
 }
 function clearSnapshots() {
-  if (G) {
-    for (const e of G) {
-      delete e.pe;
+  if (z) {
+    for (const e of z) {
+      delete e.ye;
       delete e[m];
     }
-    G = null;
+    z = null;
   }
-  B = false;
+  K = false;
 }
 function recompute(t, n = false) {
-  const i = t.D;
+  const i = t.M;
   if (!n) {
-    if (t.K && (!i || k) && k !== t.K) A.initTransition(t.K);
-    deleteFromHeap(t, t.m & o ? v : P);
+    if (t.X && (!i || W) && W !== t.X) R.initTransition(t.X);
+    deleteFromHeap(t, t.m & o ? E : k);
     t.Ee = null;
-    if (t.K || i === y) disposeChildren(t);
+    if (t.X || i === y) disposeChildren(t);
     else {
       markDisposal(t);
-      t.Ce = t.je;
-      t.ke = t.Pe;
-      t.je = null;
-      t.Pe = null;
+      t.Ae = t.Ne;
+      t.Ce = t.T;
+      t.Ne = null;
+      t.T = null;
       t.We = 0;
     }
   }
   const s = !!(t.m & f);
-  const u = t.ee !== undefined && t.ee !== S;
-  const l = !!(t.ge & a);
-  const p = V;
-  V = t;
-  t.xe = null;
+  const u = t.re !== undefined && t.re !== S;
+  const c = !!(t.we & a);
+  const h = B;
+  B = t;
+  t.ke = null;
   t.m = r;
-  t.de = E;
-  let h = t.Z === S ? t.$ : t.Z;
+  t.ge = C;
+  let p = t.te === S ? t.ne : t.te;
   let g = t.o;
-  let w = T;
-  let m = M;
-  T = true;
+  let w = Q;
+  let m = G;
+  Q = true;
   if (s) {
     const e = resolveLane(t);
-    if (e) M = e;
+    if (e) G = e;
   }
   try {
-    h = handleAsync(t, t.R(h));
+    p = handleAsync(t, t.I(p));
     clearStatus(t, n);
     const e = resolveLane(t);
     if (e) {
-      e.H.delete(t);
-      updatePendingSignal(e.te);
+      e.F.delete(t);
+      updatePendingSignal(e.ie);
     }
   } catch (e) {
-    if (e instanceof NotReadyError && M) {
-      const e = findLane(M);
-      if (e.te !== t) {
-        e.H.add(t);
-        t.Y = e;
-        updatePendingSignal(e.te);
+    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) t.Re = true;
+    if (e instanceof NotReadyError) t.Te = true;
     notifyStatus(
       t,
       e instanceof NotReadyError ? a : d,
       e,
       undefined,
-      e instanceof NotReadyError ? t.Y : undefined
+      e instanceof NotReadyError ? t.ee : undefined
     );
   } finally {
-    T = w;
-    t.m = e | (n ? t.m & c : 0);
-    V = p;
+    Q = w;
+    t.m = e | (n ? t.m & l : 0);
+    B = h;
   }
-  if (!t.ae) {
-    const e = t.xe;
-    let r = e !== null ? e.N : t.A;
+  if (!t.pe) {
+    const e = t.ke;
+    let r = e !== null ? e.j : t.N;
     if (r !== null) {
       do {
         r = unlinkSubs(r);
       } while (r !== null);
-      if (e !== null) e.N = null;
-      else t.A = null;
-    }
-    const f = u ? t.ee : t.Z === S ? t.$ : t.Z;
-    const c = !t.Te || !t.Te(f, h);
-    if (c) {
-      const e = u ? t.ee : undefined;
-      if (n || (i && k !== t.K) || s) {
-        t.$ = h;
+      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);
+    if (l) {
+      const e = u ? t.re : undefined;
+      if (n || (i && W !== t.X) || s) {
+        t.ne = p;
         if (u && s) {
-          t.ee = h;
-          t.Z = h;
+          t.re = p;
+          t.te = p;
         }
-      } else t.Z = h;
-      if (u && !s && l && !t.we) t.ee = h;
-      if (!u || s || t.ee !== e) insertSubs(t, s || u);
+      } else t.te = p;
+      if (u && !s && c && !t.be) t.re = p;
+      if (!u || s || t.re !== e) insertSubs(t, s || u);
     } else if (u) {
-      t.Z = h;
+      t.te = p;
     } else if (t.o != g) {
-      for (let e = t._; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.k, e.k.m & o ? v : P);
+      for (let e = t.O; e !== null; e = e.P) {
+        insertIntoHeapHeight(e.k, e.k.m & o ? E : k);
       }
     }
   }
-  M = m;
-  (!n || t.ge & a) && !t.K && !(k && u) && A.se.push(t);
-  t.K && i && k !== t.K && runInTransition(t.K, () => recompute(t));
+  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));
 }
 function updateIfNecessary(e) {
   if (e.m & t) {
-    for (let t = e.A; t; t = t.N) {
-      const r = t.L;
-      const i = r.I || r;
-      if (i.R) {
+    for (let t = e.N; t; t = t.j) {
+      const r = t.R;
+      const i = r.L || r;
+      if (i.I) {
         updateIfNecessary(i);
       }
       if (e.m & n) {
@@ -1277,184 +1320,184 @@ function updateIfNecessary(e) {
       }
     }
   }
-  if (e.m & (n | f) || (e.ae && e.de < E && !e.Ee)) {
+  if (e.m & (n | f) || (e.pe && e.ge < C && !e.Ee)) {
     recompute(e);
   }
-  e.m = e.m & (c | i | s);
+  e.m = e.m & (l | i | s);
 }
 function computed(t, n, r) {
   const i = r?.transparent ?? false;
   const s = {
-    id: r?.id ?? (i ? V?.id : V?.id != null ? getNextChildId(V) : undefined),
-    Ae: i || undefined,
-    Te: r?.equals != null ? r.equals : isEqual,
-    le: !!r?.pureWrite,
-    Oe: r?.unobserved,
-    je: null,
-    V: V?.V ?? A,
-    Ne: V?.Ne ?? O,
+    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,
-    R: t,
-    $: n,
+    I: t,
+    ne: n,
     o: 0,
-    W: null,
-    h: undefined,
-    p: null,
-    A: null,
+    C: null,
+    p: undefined,
+    h: null,
+    N: null,
+    ke: null,
+    O: null,
     xe: null,
-    _: null,
-    be: null,
-    i: V,
-    ve: null,
-    Pe: null,
-    m: r?.lazy ? l : e,
-    ge: p,
-    de: E,
-    Z: S,
+    i: B,
+    H: null,
+    T: null,
+    m: r?.lazy ? c : e,
+    we: h,
+    ge: C,
+    te: S,
+    Ae: null,
     Ce: null,
-    ke: null,
     Ee: null,
-    K: null
+    X: null
   };
-  s.p = s;
-  const o = V?.t ? V.u : V;
-  if (V) {
-    const e = V.Pe;
+  s.h = s;
+  const o = B?.t ? B.u : B;
+  if (B) {
+    const e = B.T;
     if (e === null) {
-      V.Pe = s;
+      B.T = s;
     } else {
-      s.ve = e;
-      V.Pe = s;
+      s.H = e;
+      B.T = s;
     }
   }
   if (o) s.o = o.o + 1;
-  if (B && ownerInSnapshotScope(V)) s.he = true;
-  if (R) {
+  if (K && ownerInSnapshotScope(B)) s.Se = true;
+  if (H) {
     const e = signal(undefined, { equals: false, pureWrite: true });
-    const t = R.factory(s.R, () => {
+    const t = H.factory(s.I, () => {
       setSignal(e, undefined);
     });
     cleanup(() => t.dispose());
-    s.R = n => {
+    s.I = n => {
       read(e);
       return t.track(n);
     };
   }
   !r?.lazy && recompute(s, true);
-  if (B && !r?.lazy) {
-    if (!(s.ge & a)) {
-      s.pe = s.$ === undefined ? w : s.$;
-      G.add(s);
+  if (K && !r?.lazy) {
+    if (!(s.we & a)) {
+      s.ye = s.ne === undefined ? w : s.ne;
+      z.add(s);
     }
   }
   return s;
 }
 function signal(e, t, n = null) {
   const r = {
-    Te: t?.equals != null ? t.equals : isEqual,
-    le: !!t?.pureWrite,
-    De: !!t?.De,
-    Oe: t?.unobserved,
-    $: e,
-    _: null,
-    be: null,
-    de: E,
-    I: n,
-    C: n?.W || null,
-    Z: S
+    He: t?.equals != null ? t.equals : isEqual,
+    he: !!t?.pureWrite,
+    Fe: !!t?.Fe,
+    ve: t?.unobserved,
+    ne: e,
+    O: null,
+    xe: null,
+    ge: C,
+    L: n,
+    W: n?.C || null,
+    te: S
   };
-  n && (n.W = r);
-  if (B && !r.De && !((n?.ge ?? 0) & a)) {
-    r.pe = e === undefined ? w : e;
-    G.add(r);
+  n && (n.C = r);
+  if (K && !r.Fe && !((n?.we ?? 0) & a)) {
+    r.ye = e === undefined ? w : e;
+    z.add(r);
   }
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.ee = S;
+  n.re = S;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const r = computed(e, t, n);
-  r.ee = S;
+  r.re = S;
   return r;
 }
 function isEqual(e, t) {
   return e === t;
 }
 function untrack(e, t) {
-  if (!R && !T && true) return e();
-  const n = T;
-  T = false;
+  if (!H && !Q && true) return e();
+  const n = Q;
+  Q = false;
   try {
-    if (R) return R.untrack(e);
+    if (H) return H.untrack(e);
     return e();
   } finally {
-    T = n;
+    Q = n;
   }
 }
 function read(e) {
-  if (F) {
+  if (M) {
     const t = getLatestValueComputed(e);
-    const n = F;
-    F = false;
-    const r = e.ee !== undefined && e.ee !== S ? e.ee : e.$;
+    const n = M;
+    M = false;
+    const r = e.re !== undefined && e.re !== S ? e.re : e.ne;
     let i;
     try {
       i = read(t);
     } catch (e) {
-      if (!V && e instanceof NotReadyError) return r;
+      if (!B && e instanceof NotReadyError) return r;
       throw e;
     } finally {
-      F = n;
+      M = n;
     }
-    if (t.ge & a) return r;
-    if (H && M && t.Y) {
-      const e = findLane(t.Y);
-      const n = findLane(M);
-      if (e !== n && e.H.size > 0) {
+    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) {
         return r;
       }
     }
     return i;
   }
-  if (q) {
-    const t = e.I;
-    const n = q;
-    q = false;
-    if (t && e.ee !== undefined) {
-      if (e.ee !== S && (t.Ee || !!(t.ge & a))) {
-        D = true;
+  if (F) {
+    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;
       }
-      let n = V;
+      let n = B;
       if (n?.t) n = n.u;
-      if (n && T) link(e, n);
+      if (n && Q) link(e, n);
       read(getPendingSignal(e));
       read(getPendingSignal(t));
     } else {
-      if (read(getPendingSignal(e))) D = true;
-      if (t && read(getPendingSignal(t))) D = true;
+      if (read(getPendingSignal(e))) V = true;
+      if (t && read(getPendingSignal(t))) V = true;
     }
-    q = n;
-    return e.$;
+    F = n;
+    return e.ne;
   }
-  let t = V;
+  let t = B;
   if (t?.t) t = t.u;
-  if (Q && e.R) recompute(e);
-  if (e.m & l) {
-    e.m &= ~l;
+  if (D && e.I) recompute(e);
+  if (e.m & c) {
+    e.m &= ~c;
     recompute(e, true);
   }
-  const n = e.I || e;
-  if (t && T) {
-    if (e.R && e.m & u) recompute(e);
+  const n = e.L || e;
+  if (t && Q) {
+    if (e.I && e.m & u) recompute(e);
     link(e, t);
-    if (n.R) {
+    if (n.I) {
       const r = e.m & o;
-      if (n.o >= (r ? v.j : P.j)) {
+      if (n.o >= (r ? E.A : k.A)) {
         markNode(t);
-        markHeap(r ? v : P);
+        markHeap(r ? E : k);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -1463,217 +1506,217 @@ function read(e) {
       }
     }
   }
-  if (n.ge & a) {
-    if (t && !(H && n.K && k !== n.K)) {
-      if (M) {
-        const r = n.Y;
-        const i = findLane(M);
+  if (n.we & a) {
+    if (t && !(q && n.X && W !== n.X)) {
+      if (G) {
+        const r = n.ee;
+        const i = findLane(G);
         if (r && findLane(r) === i && !hasActiveOverride(n)) {
-          if (!T && e !== t) link(e, t);
-          throw n.ae;
+          if (!Q && e !== t) link(e, t);
+          throw n.pe;
         }
       } else {
-        if (!T && e !== t) link(e, t);
-        throw n.ae;
+        if (!Q && e !== t) link(e, t);
+        throw n.pe;
       }
-    } else if (t && n !== e && n.ge & p) {
-      if (!T && e !== t) link(e, t);
-      throw n.ae;
-    } else if (!t && n.ge & p) {
-      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;
     }
   }
-  if (e.R && e.ge & d) {
-    if (e.de < E) {
+  if (e.I && e.we & d) {
+    if (e.ge < C) {
       recompute(e);
       return read(e);
-    } else throw e.ae;
+    } else throw e.pe;
   }
-  if (B && t && t.he) {
-    const n = e.pe;
+  if (K && t && t.Se) {
+    const n = e.ye;
     if (n !== undefined) {
       const r = n === w ? undefined : n;
-      const i = e.Z !== S ? e.Z : e.$;
-      if (i !== r) t.m |= c;
+      const i = e.te !== S ? e.te : e.ne;
+      if (i !== r) t.m |= l;
       return r;
     }
   }
-  if (e.ee !== undefined && e.ee !== S) {
-    if (t && H && shouldReadStashedOptimisticValue(e)) return e.$;
-    return e.ee;
+  if (e.re !== undefined && e.re !== S) {
+    if (t && q && shouldReadStashedOptimisticValue(e)) return e.ne;
+    return e.re;
   }
   return !t ||
-    (M !== null && (e.ee !== undefined || e.Y || (n === e && H) || !!(n.ge & a))) ||
-    e.Z === S ||
-    (H && e.K && k !== e.K)
-    ? e.$
-    : e.Z;
+    (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;
 }
 function setSignal(e, t) {
-  if (e.K && k !== e.K) A.initTransition(e.K);
-  const n = e.ee !== undefined && !C;
-  const r = e.ee !== undefined && e.ee !== S;
-  const i = n ? (r ? e.ee : e.$) : e.Z === S ? e.$ : e.Z;
+  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 (typeof t === "function") t = t(i);
-  const s = !e.Te || !e.Te(i, t) || !!(e.ge & p);
+  const s = !e.He || !e.He(i, t) || !!(e.we & h);
   if (!s) {
-    if (n && r && e.R) {
+    if (n && r && e.I) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = e.ee === S;
-    if (!n) A.initTransition(resolveTransition(e));
+    const n = e.re === S;
+    if (!n) R.initTransition(resolveTransition(e));
     if (n) {
-      e.Z = e.$;
-      A.U.push(e);
+      e.te = e.ne;
+      R.Y.push(e);
     }
-    e.we = true;
+    e.be = true;
     const r = getOrCreateLane(e);
-    e.Y = r;
-    e.ee = t;
+    e.ee = r;
+    e.re = t;
   } else {
-    if (e.Z === S) A.se.push(e);
-    e.Z = t;
+    if (e.te === S) R.fe.push(e);
+    e.te = t;
   }
   updatePendingSignal(e);
-  if (e.He) {
-    setSignal(e.He, t);
+  if (e.Qe) {
+    setSignal(e.Qe, t);
   }
-  e.de = E;
+  e.ge = C;
   insertSubs(e, n);
   schedule();
   return t;
 }
 function runWithOwner(e, t) {
-  const n = V;
-  const r = T;
-  V = e;
-  T = false;
+  const n = B;
+  const r = Q;
+  B = e;
+  Q = false;
   try {
     return t();
   } finally {
-    V = n;
-    T = r;
+    B = n;
+    Q = r;
   }
 }
 function getPendingSignal(e) {
-  if (!e.Fe) {
-    e.Fe = optimisticSignal(false, { pureWrite: true });
-    if (e.ye) {
-      e.Fe.ye = e;
+  if (!e.Ve) {
+    e.Ve = optimisticSignal(false, { pureWrite: true });
+    if (e.me) {
+      e.Ve.me = e;
     }
-    if (computePendingState(e)) setSignal(e.Fe, true);
+    if (computePendingState(e)) setSignal(e.Ve, true);
   }
-  return e.Fe;
+  return e.Ve;
 }
 function computePendingState(e) {
   const t = e;
-  const n = e.I;
-  if (n && e.Z !== S) {
-    return !n.Ee && !(n.ge & a);
+  const n = e.L;
+  if (n && e.te !== S) {
+    return !n.Ee && !(n.we & a);
   }
-  if (e.ee !== undefined && e.ee !== S) {
-    if (t.ge & a && !(t.ge & p)) return true;
-    if (e.ye) {
-      const t = e.Y ? findLane(e.Y) : null;
-      return !!(t && t.H.size > 0);
+  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);
     }
     return true;
   }
-  if (e.ee !== undefined && e.ee === S && !e.ye) {
+  if (e.re !== undefined && e.re === S && !e.me) {
     return false;
   }
-  if (e.Z !== S && !(t.ge & p)) return true;
-  return !!(t.ge & a && !(t.ge & p));
+  if (e.te !== S && !(t.we & h)) return true;
+  return !!(t.we & a && !(t.we & h));
 }
 function updatePendingSignal(e) {
-  if (e.Fe) {
+  if (e.Ve) {
     const t = computePendingState(e);
-    const n = e.Fe;
+    const n = e.Ve;
     setSignal(n, t);
-    if (!t && n.Y) {
+    if (!t && n.ee) {
       const t = resolveLane(e);
-      if (t && t.H.size > 0) {
-        const e = findLane(n.Y);
+      if (t && t.F.size > 0) {
+        const e = findLane(n.ee);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
-      N.delete(n);
-      n.Y = undefined;
+      L.delete(n);
+      n.ee = undefined;
     }
   }
 }
 function getLatestValueComputed(e) {
-  if (!e.He) {
-    const t = F;
+  if (!e.Qe) {
+    const t = M;
+    M = false;
+    const n = F;
     F = false;
-    const n = q;
-    q = false;
-    const r = V;
-    V = null;
-    e.He = optimisticComputed(() => read(e));
-    e.He.ye = e;
-    V = r;
-    q = n;
-    F = t;
+    const r = B;
+    B = null;
+    e.Qe = optimisticComputed(() => read(e));
+    e.Qe.me = e;
+    B = r;
+    F = n;
+    M = t;
   }
-  return e.He;
+  return e.Qe;
 }
 function staleValues(e, t = true) {
-  const n = H;
-  H = t;
+  const n = q;
+  q = t;
   try {
     return e();
   } finally {
-    H = n;
+    q = n;
   }
 }
 function latest(e) {
-  const t = F;
-  F = true;
+  const t = M;
+  M = true;
   try {
     return e();
   } finally {
-    F = t;
+    M = t;
   }
 }
 function isPending(e) {
-  const t = q;
-  const n = D;
-  q = true;
-  D = false;
+  const t = F;
+  const n = V;
+  F = true;
+  V = false;
   try {
     e();
-    return D;
+    return V;
   } catch {
-    return D;
+    return V;
   } finally {
-    q = t;
-    D = n;
+    F = t;
+    V = n;
   }
 }
 function refresh(e) {
-  let t = Q;
-  Q = true;
+  let t = D;
+  D = true;
   try {
     if (typeof e !== "function") {
-      recompute(e[_]);
+      recompute(e[O]);
       return e;
     }
     return untrack(e);
   } finally {
-    Q = t;
+    D = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return Q;
+  return D;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1682,7 +1725,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Ne[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Re[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1692,10 +1735,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Ne = { ...n.Ne, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Re = { ...n.Re, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Ne[e.id]);
+  return !isUndefined(t?.Re[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1705,99 +1748,99 @@ function effect(e, t, n, r, i) {
   const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
     ...i,
     equals: () => {
-      o.F = !o.ae;
-      if (s) o.V.enqueue(o.D, runEffect.bind(o));
+      o.B = !o.pe;
+      if (s) o.G.enqueue(o.M, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Ve = r;
-  o.Me = t;
-  o.Be = n;
-  o.Ge = undefined;
-  o.D = i?.render ? h : g;
-  o.Qe = (e, t) => {
-    const n = e !== undefined ? e : o.ge;
-    const r = t !== undefined ? t : o.ae;
+  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;
     if (n & d) {
       let e = r;
-      o.V.notify(o, a, 0);
-      if (o.D === g) {
+      o.G.notify(o, a, 0);
+      if (o.M === g) {
         try {
-          return o.Be
-            ? o.Be(e, () => {
-                o.Ge?.();
-                o.Ge = undefined;
+          return o.Ge
+            ? o.Ge(e, () => {
+                o.Ke?.();
+                o.Ke = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!o.V.notify(o, d, d)) throw e;
-    } else if (o.D === h) {
-      o.V.notify(o, a | d, n, r);
+      if (!o.G.notify(o, d, d)) throw e;
+    } else if (o.M === p) {
+      o.G.notify(o, a | d, n, r);
     }
   };
   recompute(o, true);
-  !i?.defer && (o.D === g ? o.V.enqueue(o.D, runEffect.bind(o)) : runEffect.call(o));
+  !i?.defer && (o.M === g ? o.G.enqueue(o.M, runEffect.bind(o)) : runEffect.call(o));
   s = true;
-  cleanup(() => o.Ge?.());
+  cleanup(() => o.Ke?.());
 }
 function runEffect() {
-  if (!this.F || this.m & u) return;
-  this.Ge?.();
-  this.Ge = undefined;
+  if (!this.B || this.m & u) return;
+  this.Ke?.();
+  this.Ke = undefined;
   try {
-    const e = this.Me(this.$, this.Ve);
+    const e = this.Be(this.ne, this.Me);
     if (false && e !== undefined && typeof e !== "function");
-    this.Ge = e;
+    this.Ke = e;
   } catch (e) {
-    this.ae = new StatusError(this, e);
-    this.ge |= d;
-    if (!this.V.notify(this, d, d)) throw e;
+    this.pe = new StatusError(this, e);
+    this.we |= d;
+    if (!this.G.notify(this, d, d)) throw e;
   } finally {
-    this.Ve = this.$;
-    this.F = false;
+    this.Me = this.ne;
+    this.B = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.F || n.m & u) return;
+    if (!n.B || n.m & u) return;
     try {
-      n.F = false;
+      n.B = false;
       recompute(n);
     } finally {
     }
   };
   const n = computed(
     () => {
-      n.Ge?.();
-      n.Ge = undefined;
+      n.Ke?.();
+      n.Ke = undefined;
       const t = staleValues(e);
-      n.Ge = t;
+      n.Ke = t;
     },
     undefined,
     { ...t, lazy: true }
   );
-  n.Ge = undefined;
-  n.Ke = true;
-  n.F = true;
-  n.D = y;
-  n.Qe = (e, t) => {
-    const r = e !== undefined ? e : n.ge;
+  n.Ke = undefined;
+  n.ze = true;
+  n.B = true;
+  n.M = y;
+  n.qe = (e, t) => {
+    const r = e !== undefined ? e : n.we;
     if (r & d) {
-      n.V.notify(n, a, 0);
-      const e = t !== undefined ? t : n.ae;
-      if (!n.V.notify(n, d, d)) throw e;
+      n.G.notify(n, a, 0);
+      const e = t !== undefined ? t : n.pe;
+      if (!n.G.notify(n, d, d)) throw e;
     }
   };
-  n.M = run;
-  n.V.enqueue(g, run);
-  cleanup(() => n.Ge?.());
+  n.K = run;
+  n.G.enqueue(g, run);
+  cleanup(() => n.Ke?.());
 }
 function restoreTransition(e, t) {
-  A.initTransition(e);
+  R.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1806,13 +1849,13 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      A.initTransition();
-      let s = k;
-      s.G.push(i);
+      R.initTransition();
+      let s = W;
+      s.J.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.G.indexOf(i);
-        if (o >= 0) s.G.splice(o, 1);
+        const o = s.J.indexOf(i);
+        if (o >= 0) s.J.splice(o, 1);
         setActiveTransition(s);
         schedule();
         t ? r(t) : n(e);
@@ -1907,20 +1950,24 @@ function resolve(e) {
   });
 }
 function createOptimistic(e, t, n) {
-  const r = typeof e === "function" ? optimisticComputed(e, t, n) : optimisticSignal(e, t);
+  if (typeof e === "function") {
+    const r = optimisticComputed(e, t, n);
+    return [accessor(r), setSignal.bind(null, r)];
+  }
+  const r = optimisticSignal(e, t);
   return [accessor(r), setSignal.bind(null, r)];
 }
 function onSettled(e) {
   const t = getOwner();
-  t && !t.Ke
+  t && !t.ze
     ? createTrackedEffect(() => untrack(e), undefined)
-    : A.enqueue(g, () => {
+    : R.enqueue(g, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[z]?.[$] ?? e;
+  return e?.[J]?.[te] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1932,110 +1979,110 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n) {
-  const r = t?.[z];
+  const r = t?.[J];
   if (!r) return;
-  const i = r[X];
-  const s = r[Y];
-  const o = r[Z];
-  let u = r[$];
+  const i = r[Z];
+  const s = r[$];
+  const o = r[ee];
+  let u = r[te];
   if (e === i && !s && !o) return;
-  (r[ne] || se).set(e, r[U]);
-  r[X] = e;
-  r[Y] = undefined;
+  (r[ie] || ue).set(e, r[X]);
+  r[Z] = e;
+  r[$] = undefined;
   if (Array.isArray(i)) {
     let t = false;
     const f = getOverrideValue(i, s, u, "length", o);
     if (e.length && f && e[0] && n(e[0]) != null) {
-      let c, l, a, d, p, h, g, y;
+      let l, c, a, d, h, p, g, y;
       for (
         a = 0, d = Math.min(f, e.length);
         a < d &&
-        ((h = getOverrideValue(i, s, u, a, o)) === e[a] || (h && e[a] && n(h) === n(e[a])));
+        ((p = getOverrideValue(i, s, u, a, o)) === e[a] || (p && e[a] && n(p) === n(e[a])));
         a++
       ) {
-        applyState(e[a], wrap(h, r), n);
+        applyState(e[a], wrap(p, r), n);
       }
       const S = new Array(e.length),
         w = new Map();
       for (
-        d = f - 1, p = e.length - 1;
+        d = f - 1, h = e.length - 1;
         d >= a &&
-        p >= a &&
-        ((h = getOverrideValue(i, s, u, d, o)) === e[p] || (h && e[p] && n(h) === n(e[p])));
-        d--, p--
+        h >= a &&
+        ((p = getOverrideValue(i, s, u, d, o)) === e[h] || (p && e[h] && n(p) === n(e[h])));
+        d--, h--
       ) {
-        S[p] = h;
+        S[h] = p;
       }
-      if (a > p || a > d) {
-        for (l = a; l <= p; l++) {
+      if (a > h || a > d) {
+        for (c = a; c <= h; c++) {
           t = true;
-          r[$][l] && setSignal(r[$][l], wrap(e[l], r));
+          r[te][c] && setSignal(r[te][c], wrap(e[c], r));
         }
-        for (; l < e.length; l++) {
+        for (; c < e.length; c++) {
           t = true;
-          const i = wrap(S[l], r);
-          r[$][l] && setSignal(r[$][l], i);
-          applyState(e[l], i, n);
+          const i = wrap(S[c], r);
+          r[te][c] && setSignal(r[te][c], i);
+          applyState(e[c], i, n);
         }
-        t && r[$][K] && setSignal(r[$][K], void 0);
-        f !== e.length && r[$].length && setSignal(r[$].length, e.length);
+        t && r[te][U] && setSignal(r[te][U], void 0);
+        f !== e.length && r[te].length && setSignal(r[te].length, e.length);
         return;
       }
-      g = new Array(p + 1);
-      for (l = p; l >= a; l--) {
-        h = e[l];
-        y = h ? n(h) : h;
-        c = w.get(y);
-        g[l] = c === undefined ? -1 : c;
-        w.set(y, l);
-      }
-      for (c = a; c <= d; c++) {
-        h = getOverrideValue(i, s, u, c, o);
-        y = h ? n(h) : h;
+      g = new Array(h + 1);
+      for (c = h; c >= a; c--) {
+        p = e[c];
+        y = p ? n(p) : p;
         l = w.get(y);
-        if (l !== undefined && l !== -1) {
-          S[l] = h;
-          l = g[l];
-          w.set(y, l);
+        g[c] = l === undefined ? -1 : l;
+        w.set(y, c);
+      }
+      for (l = a; l <= d; l++) {
+        p = getOverrideValue(i, s, u, l, o);
+        y = p ? n(p) : p;
+        c = w.get(y);
+        if (c !== undefined && c !== -1) {
+          S[c] = p;
+          c = g[c];
+          w.set(y, c);
         }
       }
-      for (l = a; l < e.length; l++) {
-        if (l in S) {
-          const t = wrap(S[l], r);
-          r[$][l] && setSignal(r[$][l], t);
-          applyState(e[l], t, n);
-        } else r[$][l] && setSignal(r[$][l], wrap(e[l], r));
+      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);
+          applyState(e[c], t, n);
+        } else r[te][c] && setSignal(r[te][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[$][t] && setSignal(r[$][t], e[t]);
+        isWrappable(f) ? applyState(e[t], wrap(f, r), n) : r[te][t] && setSignal(r[te][t], e[t]);
       }
     }
     if (f !== e.length) {
       t = true;
-      r[$].length && setSignal(r[$].length, e.length);
+      r[te].length && setSignal(r[te].length, e.length);
     }
-    t && r[$][K] && setSignal(r[$][K], void 0);
+    t && r[te][U] && setSignal(r[te][U], void 0);
     return;
   }
   if (u) {
-    const t = u[K];
+    const t = u[U];
     const f = t ? getAllKeys(i, s, e) : Object.keys(u);
-    for (let c = 0, l = f.length; c < l; c++) {
-      const l = f[c];
-      const a = u[l];
-      const d = unwrap(getOverrideValue(i, s, u, l, o));
-      let p = unwrap(e[l]);
-      if (d === p) continue;
-      if (!d || !isWrappable(d) || !isWrappable(p) || (n(d) != null && n(d) !== n(p))) {
+    for (let l = 0, c = f.length; l < c; l++) {
+      const c = f[l];
+      const a = u[c];
+      const d = unwrap(getOverrideValue(i, s, u, c, o));
+      let h = unwrap(e[c]);
+      if (d === h) continue;
+      if (!d || !isWrappable(d) || !isWrappable(h) || (n(d) != null && n(d) !== n(h))) {
         t && setSignal(t, void 0);
-        a && setSignal(a, isWrappable(p) ? wrap(p, r) : p);
-      } else applyState(p, wrap(d, r), n);
+        a && setSignal(a, isWrappable(h) ? wrap(h, r) : h);
+      } else applyState(h, wrap(d, r), n);
     }
   }
-  if ((u = r[ee])) {
+  if ((u = r[ne])) {
     const t = Object.keys(u);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -2057,9 +2104,9 @@ function createProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[te] = wrapProjection;
-    e[ne] = i;
-    Object.defineProperty(e, re, {
+    e[re] = wrapProjection;
+    e[ie] = i;
+    Object.defineProperty(e, se, {
       get() {
         return r;
       },
@@ -2068,8 +2115,8 @@ function createProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[z]?.[te] === wrapProjection) return e;
-    const t = createStoreProxy(e, fe, wrapper);
+    if (e[J]?.[re] === wrapProjection) return e;
+    const t = createStoreProxy(e, ce, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2091,7 +2138,7 @@ function createProjectionInternal(e, t = {}, n) {
       u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
     });
   });
-  r._e = true;
+  r.Pe = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -2150,33 +2197,33 @@ function createWriteTraps(e) {
   };
   return t;
 }
-const K = Symbol(0),
-  z = Symbol(0),
-  U = Symbol(0),
-  J = Symbol(0);
-const X = "v",
-  Y = "o",
-  Z = "x",
-  $ = "n",
-  ee = "h",
-  te = "w",
-  ne = "l",
-  re = "f",
-  ie = "p";
-function createStoreProxy(e, t = fe, n) {
+const U = Symbol(0),
+  J = Symbol(0),
+  X = Symbol(0),
+  Y = Symbol(0);
+const Z = "v",
+  $ = "o",
+  ee = "x",
+  te = "n",
+  ne = "h",
+  re = "w",
+  ie = "l",
+  se = "f",
+  oe = "p";
+function createStoreProxy(e, t = ce, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
     r.v = e;
   } else r = { v: e };
   n && n(r);
-  return (r[U] = new Proxy(r, t));
+  return (r[X] = new Proxy(r, t));
 }
-const se = new WeakMap();
+const ue = new WeakMap();
 function wrap(e, t) {
-  if (t?.[te]) return t[te](e, t);
-  let n = e[U] || se.get(e);
-  if (!n) se.set(e, (n = createStoreProxy(e)));
+  if (t?.[re]) return t[re](e, t);
+  let n = e[X] || ue.get(e);
+  if (!n) ue.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
@@ -2187,12 +2234,12 @@ function isWrappable(e) {
     !(typeof Node !== "undefined" && e instanceof Node)
   );
 }
-let oe = false;
+let fe = false;
 function setWriteOverride(e) {
-  oe = e;
+  fe = e;
 }
 function writeOnly(e) {
-  return oe || !!ue?.has(e);
+  return fe || !!le?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -2212,17 +2259,17 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
     r
   );
   if (s) {
-    u.ee = S;
+    u.re = S;
   }
   if (o && t in o) {
     const e = o[t];
-    u.pe = e === undefined ? w : e;
-    G?.add(u);
+    u.ye = e === undefined ? w : e;
+    z?.add(u);
   }
   return (e[t] = u);
 }
-function trackSelf(e, t = K) {
-  getObserver() && read(getNode(getNodes(e, $), t, undefined, e[re], false, e[ie]));
+function trackSelf(e, t = U) {
+  getObserver() && read(getNode(getNodes(e, te), t, undefined, e[se], false, e[oe]));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -2230,7 +2277,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] !== J) i.add(e);
+    if (t[e] !== Y) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -2238,147 +2285,154 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === J) return void 0;
+    if (r[n] === Y) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let ue = null;
-const fe = {
+let le = null;
+const ce = {
   get(e, t, n) {
-    if (t === z) return e;
-    if (t === U) return n;
-    if (t === _) return e[re];
-    if (t === K) {
+    if (t === J) return e;
+    if (t === X) return n;
+    if (t === O) return e[se];
+    if (t === U) {
       trackSelf(e);
       return n;
     }
-    const r = getNodes(e, $);
+    const r = getNodes(e, te);
     const i = r[t];
-    const s = e[Z] && t in e[Z];
-    const o = s || (e[Y] && t in e[Y]);
-    const u = !!e[X][z];
-    const f = s ? e[Z] : e[Y] && t in e[Y] ? e[Y] : e[X];
+    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];
     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.ee !== undefined && i.ee !== S ? i.ee : i.Z !== S ? i.Z : i.$) : f[t];
-      n === J && (n = undefined);
+        i && (o || !u)
+          ? i.re !== undefined && i.re !== S
+            ? i.re
+            : i.te !== S
+              ? i.te
+              : i.ne
+          : f[t];
+      n === Y && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      ue?.add(r);
+      le?.add(r);
       return r;
     }
-    let c = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    c === J && (c = undefined);
+    let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
+    l === Y && (l = undefined);
     if (!i) {
-      if (!o && typeof c === "function" && !f.hasOwnProperty(t)) {
+      if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[X]) && (t = Object.getPrototypeOf(e[X])) && t !== Object.prototype
-          ? c.bind(f)
-          : c;
+        return !Array.isArray(e[Z]) && (t = Object.getPrototypeOf(e[Z])) && t !== Object.prototype
+          ? l.bind(f)
+          : l;
       } else if (getObserver()) {
-        return read(getNode(r, t, isWrappable(c) ? wrap(c, e) : c, e[re], isEqual, e[ie], e[m]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[se], isEqual, e[oe], e[m]));
       }
     }
-    return isWrappable(c) ? wrap(c, e) : c;
+    return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    if (t === U || t === K || t === "__proto__") return true;
-    const n = e[Z] && t in e[Z] ? e[Z][t] !== J : e[Y] && t in e[Y] ? e[Y][t] !== J : t in e[X];
-    if (!writeOnly(e[U])) {
-      getObserver() && read(getNode(getNodes(e, ee), t, n, e[re], isEqual, e[ie]));
+    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]));
     }
     return n;
   },
   set(e, t, n) {
-    const r = e[U];
+    const r = e[X];
     if (writeOnly(r)) {
-      if (e[ie]) {
-        const t = e[re];
-        if (t?.K) {
-          A.initTransition(t.K);
+      if (e[oe]) {
+        const t = e[se];
+        if (t?.X) {
+          R.initTransition(t.X);
         }
       }
       untrack(() => {
-        const i = e[X];
+        const i = e[Z];
         const s = i[t];
-        if (B && typeof t !== "symbol" && !((e[re]?.ge ?? 0) & a)) {
+        if (K && typeof t !== "symbol" && !((e[se]?.we ?? 0) & a)) {
           if (!e[m]) {
             e[m] = Object.create(null);
-            G?.add(e);
+            z?.add(e);
           }
           if (!(t in e[m])) {
             e[m][t] = s;
           }
         }
-        const o = e[ie] && !C;
-        const u = o ? Z : Y;
+        const o = e[oe] && !N;
+        const u = o ? ee : $;
         if (o) trackOptimisticStore(r);
-        const f = e[Z] && t in e[Z] ? e[Z][t] : e[Y] && t in e[Y] ? e[Y][t] : s;
-        const c = n?.[z]?.[X] ?? n;
-        const l = Array.isArray(i) && t !== "length";
-        const d = l ? parseInt(t) + 1 : 0;
-        const p =
-          l &&
-          (e[Z] && "length" in e[Z]
-            ? e[Z].length
-            : e[Y] && "length" in e[Y]
-              ? e[Y].length
+        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 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
               : i.length);
-        const h = l && d > p ? d : undefined;
-        if (f === c && h === undefined) return true;
-        if (c !== undefined && c === s && h === undefined) delete e[u]?.[t];
+        const p = c && d > h ? d : undefined;
+        if (f === l && p === undefined) return true;
+        if (l !== undefined && l === s && p === undefined) delete e[u]?.[t];
         else {
           const n = e[u] || (e[u] = Object.create(null));
-          n[t] = c;
-          if (h !== undefined) n.length = h;
+          n[t] = l;
+          if (p !== undefined) n.length = p;
         }
-        const g = isWrappable(c);
-        e[ee]?.[t] && setSignal(e[ee][t], true);
-        const y = getNodes(e, $);
-        y[t] && setSignal(y[t], () => (g ? wrap(c, e) : c));
+        const g = isWrappable(l);
+        e[ne]?.[t] && setSignal(e[ne][t], true);
+        const y = getNodes(e, te);
+        y[t] && setSignal(y[t], () => (g ? wrap(l, e) : l));
         if (Array.isArray(i)) {
-          const e = t === "length" ? c : h;
+          const e = t === "length" ? l : p;
           e !== undefined && y.length && setSignal(y.length, e);
         }
-        y[K] && setSignal(y[K], undefined);
+        y[U] && setSignal(y[U], undefined);
+        if (false);
       });
     }
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[Z]?.[t] === J;
-    const r = e[Y]?.[t] === J;
-    if (writeOnly(e[U]) && !n && !r) {
+    const n = e[ee]?.[t] === Y;
+    const r = e[$]?.[t] === Y;
+    if (writeOnly(e[X]) && !n && !r) {
       untrack(() => {
-        const n = e[ie] && !C;
-        const r = n ? Z : Y;
-        if (n) trackOptimisticStore(e[U]);
-        const i = e[Z] && t in e[Z] ? e[Z][t] : e[Y] && t in e[Y] ? e[Y][t] : e[X][t];
-        if (t in e[X] || (e[Y] && t in e[Y])) {
-          (e[r] || (e[r] = Object.create(null)))[t] = J;
+        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;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
-        if (e[ee]?.[t]) setSignal(e[ee][t], false);
-        const s = getNodes(e, $);
+        if (e[ne]?.[t]) setSignal(e[ne][t], false);
+        const s = getNodes(e, te);
         s[t] && setSignal(s[t], undefined);
-        s[K] && setSignal(s[K], undefined);
+        s[U] && setSignal(s[U], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[X], e[Y], false);
-    if (e[Z]) {
+    let t = getKeys(e[Z], e[$], false);
+    if (e[ee]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[Z])) {
-        if (e[Z][t] !== J) n.add(t);
+      for (const t of Reflect.ownKeys(e[ee])) {
+        if (e[ee][t] !== Y) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -2386,25 +2440,25 @@ const fe = {
     return t;
   },
   getOwnPropertyDescriptor(e, t) {
-    if (t === U) return { value: e[U], writable: true, configurable: true };
-    if (e[Z] && t in e[Z]) {
-      if (e[Z][t] === J) return undefined;
-      const n = getPropertyDescriptor(e[X], e[Y], 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 (n) {
-        return { ...n, value: e[Z][t] };
+        return { ...n, value: e[ee][t] };
       }
-      return { value: e[Z][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[ee][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[X], e[Y], t);
+    return getPropertyDescriptor(e[Z], e[$], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[X]);
+    return Object.getPrototypeOf(e[Z]);
   }
 };
 function storeSetter(e, t) {
-  const n = ue;
-  ue = new Set();
-  ue.add(e);
+  const n = le;
+  le = new Set();
+  le.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2420,8 +2474,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    ue.clear();
-    ue = n;
+    le.clear();
+    le = n;
   }
 }
 function createStore(e, t, n) {
@@ -2430,7 +2484,7 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.fe ||= clearOptimisticStore;
+  GlobalQueue.ae ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = (r ? t : e) ?? {};
   const s = r ? e : undefined;
@@ -2438,39 +2492,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[z];
-  if (!t || !t[Z]) return;
-  const n = t[Z];
-  const r = t[$];
+  const t = e[J];
+  if (!t || !t[ee]) return;
+  const n = t[ee];
+  const r = t[te];
   setProjectionWriteActive(true);
   try {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
-          r[e].Y = undefined;
-          const n = t[Y] && e in t[Y] ? t[Y][e] : t[X][e];
-          const i = n === J ? undefined : n;
+          r[e].ee = undefined;
+          const n = t[$] && e in t[$] ? t[$][e] : t[Z][e];
+          const i = n === Y ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
-      if (r[K]) {
-        r[K].Y = undefined;
-        setSignal(r[K], undefined);
+      if (r[U]) {
+        r[U].ee = undefined;
+        setSignal(r[U], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[Z];
+  delete t[ee];
 }
 function createOptimisticProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[te] = wrapProjection;
-    e[ne] = i;
-    e[ie] = true;
-    Object.defineProperty(e, re, {
+    e[re] = wrapProjection;
+    e[ie] = i;
+    e[oe] = true;
+    Object.defineProperty(e, se, {
       get() {
         return r;
       },
@@ -2479,8 +2533,8 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[z]?.[te] === wrapProjection) return e;
-    const t = createStoreProxy(e, fe, wrapper);
+    if (e[J]?.[re] === wrapProjection) return e;
+    const t = createStoreProxy(e, ce, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2513,11 +2567,11 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r._e = true;
+    r.Pe = true;
   }
   return { store: s, node: r };
 }
-const ce = Symbol(0);
+const ae = Symbol(0);
 function updatePath(e, t, n = 0) {
   let r,
     i = e;
@@ -2561,7 +2615,7 @@ function updatePath(e, t, n = 0) {
     if (s === i) return;
   }
   if (r === undefined && s == undefined) return;
-  if (s === ce) {
+  if (s === ae) {
     delete e[r];
   } else if (r === undefined || (isWrappable(i) && isWrappable(s) && !Array.isArray(s))) {
     const t = r !== undefined ? e[r] : e;
@@ -2571,50 +2625,50 @@ function updatePath(e, t, n = 0) {
     e[r] = s;
   }
 }
-const le = Object.assign(
+const de = Object.assign(
   function storePath(...e) {
     return t => {
       updatePath(t, e);
     };
   },
-  { DELETE: ce }
+  { DELETE: ae }
 );
 function snapshotImpl(e, t, n, r) {
-  let i, s, o, u, f, c;
+  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[z] || r?.get(e)?.[z])) {
-    if (t) trackSelf(i, K);
-    o = i[Y];
-    s = Array.isArray(i[X]);
-    n.set(e, o ? (u = s ? [] : Object.create(Object.getPrototypeOf(i[X]))) : i[X]);
-    e = i[X];
-    r = se;
+  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;
   } else {
     s = Array.isArray(e);
     n.set(e, e);
   }
   if (s) {
     const s = o?.length || e.length;
-    for (let l = 0; l < s; l++) {
-      c = o && l in o ? o[l] : e[l];
-      if (c === J) continue;
-      if (t && isWrappable(c)) wrap(c, i);
-      if ((f = snapshotImpl(c, t, n, r)) !== c || u) {
+    for (let c = 0; c < s; c++) {
+      l = o && c in o ? o[c] : e[c];
+      if (l === Y) continue;
+      if (t && isWrappable(l)) wrap(l, i);
+      if ((f = snapshotImpl(l, t, n, r)) !== l || u) {
         if (!u) n.set(e, (u = [...e]));
-        u[l] = f;
+        u[c] = f;
       }
     }
   } else {
     const s = getKeys(e, o);
-    for (let l = 0, a = s.length; l < a; l++) {
-      let a = s[l];
+    for (let c = 0, a = s.length; c < a; c++) {
+      let a = s[c];
       const d = getPropertyDescriptor(e, o, a);
       if (d.get) continue;
-      c = o && a in o ? o[a] : e[a];
-      if (t && isWrappable(c)) wrap(c, i);
-      if ((f = snapshotImpl(c, t, n, r)) !== e[a] || u) {
+      l = o && a in o ? o[a] : e[a];
+      if (t && isWrappable(l)) wrap(l, i);
+      if ((f = snapshotImpl(l, t, n, r)) !== e[a] || u) {
         if (!u) {
           u = Object.create(Object.getPrototypeOf(e));
           Object.assign(u, e);
@@ -2634,13 +2688,13 @@ function deep(e) {
 function trueFn() {
   return true;
 }
-const ae = {
+const he = {
   get(e, t, n) {
-    if (t === U) return n;
+    if (t === X) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === U) return true;
+    if (t === X) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2663,23 +2717,23 @@ const ae = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const de = Symbol(0);
+const pe = 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 && U in i);
-    const s = !!i && i[de];
+    t = t || (!!i && X in i);
+    const s = !!i && i[pe];
     if (s) n.push(...s);
     else n.push(typeof i === "function" ? ((t = true), createMemo(i)) : i);
   }
-  if (b && t) {
+  if (_ && t) {
     return new Proxy(
       {
         get(e) {
-          if (e === de) return n;
+          if (e === pe) return n;
           for (let t = n.length - 1; t >= 0; t--) {
             const r = resolveSource(n[t]);
             if (e in r) return r[e];
@@ -2697,7 +2751,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      ae
+      he
     );
   }
   const r = Object.create(null);
@@ -2729,12 +2783,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[de] = n;
+  o[pe] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (b && U in e) {
+  if (_ && X in e) {
     return new Proxy(
       {
         get(t) {
@@ -2747,7 +2801,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      ae
+      he
     );
   }
   const r = {};
@@ -2767,317 +2821,450 @@ function mapArray(e, t, n) {
   const s = t;
   return createMemo(
     updateKeyedMap.bind({
-      ze: createOwner(),
-      Ue: 0,
-      Je: e,
-      Xe: [],
-      Ye: s,
-      Ze: [],
+      Ue: createOwner(),
+      Je: 0,
+      Xe: e,
+      Ye: [],
+      Ze: s,
       $e: [],
-      et: r,
-      tt: r || n?.keyed === false ? [] : undefined,
-      nt: i ? [] : undefined,
-      rt: n?.fallback
+      et: [],
+      tt: r,
+      nt: r || n?.keyed === false ? [] : undefined,
+      rt: i ? [] : undefined,
+      it: n?.fallback
     })
   );
 }
-const pe = { pureWrite: true };
+const ge = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Je() || [],
+  const e = this.Xe() || [],
     t = e.length;
-  e[K];
-  runWithOwner(this.ze, () => {
+  e[U];
+  runWithOwner(this.Ue, () => {
     let n,
       r,
-      i = this.tt
+      i = this.nt
         ? () => {
-            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.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.nt
+        : this.rt
           ? () => {
               const t = e[r];
-              this.nt[r] = signal(r, pe);
-              return this.Ye(() => t, accessor(this.nt[r]));
+              this.rt[r] = signal(r, ge);
+              return this.Ze(() => t, accessor(this.rt[r]));
             }
           : () => {
               const t = e[r];
-              return this.Ye(() => t);
+              return this.Ze(() => t);
             };
     if (t === 0) {
-      if (this.Ue !== 0) {
-        this.ze.dispose(false);
+      if (this.Je !== 0) {
+        this.Ue.dispose(false);
+        this.et = [];
+        this.Ye = [];
         this.$e = [];
-        this.Xe = [];
-        this.Ze = [];
-        this.Ue = 0;
-        this.tt && (this.tt = []);
+        this.Je = 0;
         this.nt && (this.nt = []);
+        this.rt && (this.rt = []);
       }
-      if (this.rt && !this.Ze[0]) {
-        this.Ze[0] = runWithOwner((this.$e[0] = createOwner()), this.rt);
+      if (this.it && !this.$e[0]) {
+        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.it);
       }
-    } else if (this.Ue === 0) {
-      if (this.$e[0]) this.$e[0].dispose();
-      this.Ze = new Array(t);
+    } else if (this.Je === 0) {
+      if (this.et[0]) this.et[0].dispose();
+      this.$e = new Array(t);
       for (r = 0; r < t; r++) {
-        this.Xe[r] = e[r];
-        this.Ze[r] = runWithOwner((this.$e[r] = createOwner()), i);
+        this.Ye[r] = e[r];
+        this.$e[r] = runWithOwner((this.et[r] = createOwner()), i);
       }
-      this.Ue = t;
+      this.Je = t;
     } else {
       let s,
         o,
         u,
         f,
-        c,
         l,
+        c,
         a,
         d = new Array(t),
-        p = new Array(t),
-        h = this.tt ? new Array(t) : undefined,
-        g = this.nt ? new Array(t) : undefined;
+        h = new Array(t),
+        p = this.nt ? new Array(t) : undefined,
+        g = this.rt ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Ue, t);
-        s < o && (this.Xe[s] === e[s] || (this.tt && compare(this.et, this.Xe[s], e[s])));
+        s = 0, o = Math.min(this.Je, t);
+        s < o && (this.Ye[s] === e[s] || (this.nt && compare(this.tt, this.Ye[s], e[s])));
         s++
       ) {
-        if (this.tt) setSignal(this.tt[s], e[s]);
+        if (this.nt) setSignal(this.nt[s], e[s]);
       }
       for (
-        o = this.Ue - 1, u = t - 1;
+        o = this.Je - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Xe[o] === e[u] || (this.tt && compare(this.et, this.Xe[o], e[u])));
+        (this.Ye[o] === e[u] || (this.nt && compare(this.tt, this.Ye[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Ze[o];
-        p[u] = this.$e[o];
-        h && (h[u] = this.tt[o]);
-        g && (g[u] = this.nt[o]);
+        d[u] = this.$e[o];
+        h[u] = this.et[o];
+        p && (p[u] = this.nt[o]);
+        g && (g[u] = this.rt[o]);
       }
-      l = new Map();
+      c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        c = this.et ? this.et(f) : f;
-        n = l.get(c);
+        l = this.tt ? this.tt(f) : f;
+        n = c.get(l);
         a[r] = n === undefined ? -1 : n;
-        l.set(c, r);
+        c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.Xe[n];
-        c = this.et ? this.et(f) : f;
-        r = l.get(c);
+        f = this.Ye[n];
+        l = this.tt ? this.tt(f) : f;
+        r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Ze[n];
-          p[r] = this.$e[n];
-          h && (h[r] = this.tt[n]);
-          g && (g[r] = this.nt[n]);
+          d[r] = this.$e[n];
+          h[r] = this.et[n];
+          p && (p[r] = this.nt[n]);
+          g && (g[r] = this.rt[n]);
           r = a[r];
-          l.set(c, r);
-        } else this.$e[n].dispose();
+          c.set(l, r);
+        } else this.et[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Ze[r] = d[r];
-          this.$e[r] = p[r];
-          if (h) {
-            this.tt[r] = h[r];
-            setSignal(this.tt[r], e[r]);
+          this.$e[r] = d[r];
+          this.et[r] = h[r];
+          if (p) {
+            this.nt[r] = p[r];
+            setSignal(this.nt[r], e[r]);
           }
           if (g) {
-            this.nt[r] = g[r];
-            setSignal(this.nt[r], r);
+            this.rt[r] = g[r];
+            setSignal(this.rt[r], r);
           }
         } else {
-          this.Ze[r] = runWithOwner((this.$e[r] = createOwner()), i);
+          this.$e[r] = runWithOwner((this.et[r] = createOwner()), i);
         }
       }
-      this.Ze = this.Ze.slice(0, (this.Ue = t));
-      this.Xe = e.slice(0);
+      this.$e = this.$e.slice(0, (this.Je = t));
+      this.Ye = e.slice(0);
     }
   });
-  return this.Ze;
+  return this.$e;
 }
 function repeat(e, t, n) {
   const r = t;
   return updateRepeat.bind({
-    ze: createOwner(),
-    Ue: 0,
-    it: 0,
-    st: e,
-    Ye: r,
+    Ue: createOwner(),
+    Je: 0,
+    st: 0,
+    ot: e,
+    Ze: r,
+    et: [],
     $e: [],
-    Ze: [],
-    ot: n?.from,
-    rt: n?.fallback
+    ut: n?.from,
+    it: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.st();
-  const t = this.ot?.() || 0;
-  runWithOwner(this.ze, () => {
+  const e = this.ot();
+  const t = this.ut?.() || 0;
+  runWithOwner(this.Ue, () => {
     if (e === 0) {
-      if (this.Ue !== 0) {
-        this.ze.dispose(false);
+      if (this.Je !== 0) {
+        this.Ue.dispose(false);
+        this.et = [];
         this.$e = [];
-        this.Ze = [];
-        this.Ue = 0;
+        this.Je = 0;
       }
-      if (this.rt && !this.Ze[0]) {
-        this.Ze[0] = runWithOwner((this.$e[0] = createOwner()), this.rt);
+      if (this.it && !this.$e[0]) {
+        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.it);
       }
       return;
     }
     const n = t + e;
-    const r = this.it + this.Ue;
-    if (this.Ue === 0 && this.$e[0]) this.$e[0].dispose();
-    for (let e = n; e < r; e++) this.$e[e - this.it].dispose();
-    if (this.it < t) {
-      let e = this.it;
-      while (e < t && e < this.Ue) this.$e[e++].dispose();
-      this.$e.splice(0, t - this.it);
-      this.Ze.splice(0, t - this.it);
-    } else if (this.it > t) {
-      let n = r - this.it - 1;
-      let i = this.it - t;
-      this.$e.length = this.Ze.length = e;
+    const r = this.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;
       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.Ze[e] = runWithOwner((this.$e[e] = createOwner()), () => this.Ye(e + t));
+        this.$e[e] = runWithOwner((this.et[e] = createOwner()), () => this.Ze(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Ze[e - t] = runWithOwner((this.$e[e - t] = createOwner()), () => this.Ye(e));
+      this.$e[e - t] = runWithOwner((this.et[e - t] = createOwner()), () => this.Ze(e));
     }
-    this.Ze = this.Ze.slice(0, e);
-    this.it = t;
-    this.Ue = e;
+    this.$e = this.$e.slice(0, e);
+    this.st = t;
+    this.Je = e;
   });
-  return this.Ze;
+  return this.$e;
 }
 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.ge;
-    const i = t !== undefined ? t : n.ae;
-    n.ge &= ~n.ut;
-    n.V.notify(n, n.ut, r, i);
+  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.ut = t;
-  n._e = true;
+  n.ft = t;
+  n.Pe = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.V;
-  i.addChild((e.V = n));
-  cleanup(() => i.removeChild(e.V));
+  const i = e.G;
+  i.addChild((e.G = n));
+  cleanup(() => i.removeChild(e.G));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
-const he = Symbol();
+const ye = Symbol();
+const Se = createContext(null);
+let we = 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;
+}
+function setSlotState(e, t, n, r) {
+  setSignal(e.dt, n);
+  setSignal(e.ht, r);
+  if (isRevealController(e)) {
+    if (!n && e.gt === t) e.gt = undefined;
+    return e.evaluate(n, r);
+  }
+  if (!n && e.yt === t && e.St) e.yt = undefined;
+}
+class RevealController {
+  wt;
+  _t;
+  bt = [];
+  gt;
+  dt = signal(false, { pureWrite: true, Fe: true });
+  ht = signal(false, { pureWrite: true, Fe: true });
+  Ot = true;
+  xt = false;
+  constructor(e, t) {
+    this.wt = e;
+    this._t = 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;
+      if (e(n) === false) return false;
+    }
+    return true;
+  }
+  isReady() {
+    return this.vt(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));
+    untrack(() => this.evaluate());
+  }
+  unregister(e) {
+    const t = this.bt.indexOf(e);
+    if (t >= 0) this.bt.splice(t, 1);
+    untrack(() => this.evaluate());
+  }
+  evaluate(e, t) {
+    if (this.xt) return;
+    this.xt = true;
+    const n = this.Ot;
+    try {
+      const n = e ?? read(this.dt),
+        r = !!untrack(this._t),
+        i = t ?? r;
+      if (n && i) this.vt(e => setSlotState(e, this, true, true));
+      else if (!!untrack(this.wt)) {
+        const e = this.isReady();
+        this.vt(t => setSlotState(t, this, !e, false));
+      } else {
+        let e = false;
+        this.vt(t => {
+          if (e) return setSlotState(t, this, true, r);
+          if (isSlotReady(t)) return setSlotState(t, this, false, false);
+          e = true;
+          setSlotState(t, this, true, false);
+        });
+      }
+    } finally {
+      this.Ot = this.isReady();
+      this.xt = false;
+    }
+    if (this.gt && n !== this.Ot) this.gt.evaluate();
+  }
+}
 class CollectionQueue extends Queue {
-  ft;
-  ct = new Set();
-  lt = signal(false, { pureWrite: true, De: true });
-  dt = false;
-  ht;
-  gt = he;
+  Pt;
+  lt = new Set();
+  kt;
+  ct = true;
+  dt = signal(false, { pureWrite: true, Fe: true });
+  ht = signal(false, { pureWrite: true, Fe: true });
+  yt;
+  St = false;
+  Et;
+  Ct = ye;
   constructor(e) {
     super();
-    this.ft = e;
+    this.Pt = e;
   }
   run(e) {
-    if (!e || read(this.lt)) return;
+    if (!e || (read(this.dt) && (!we || read(this.ht)))) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.ft)) return super.notify(e, t, n, r);
-    if (this.dt && this.ht) {
+    if (!(t & this.Pt)) return super.notify(e, t, n, r);
+    if (this.St && this.Et) {
       const e = untrack(() => {
         try {
-          return this.ht();
+          return this.Et();
         } catch {
-          return he;
+          return ye;
         }
       });
-      if (e !== this.gt) {
-        this.gt = e;
-        this.dt = false;
-        this.ct.clear();
+      if (e !== this.Ct) {
+        this.Ct = e;
+        this.St = false;
+        this.lt.clear();
       }
     }
-    if (this.ft & a && this.dt) return super.notify(e, t, n, r);
-    if (this.ft & a && n & d) {
+    if (this.Pt & a && this.St) return super.notify(e, t, n, r);
+    if (this.Pt & a && n & d) {
       return super.notify(e, d, n, r);
     }
-    if (n & this.ft) {
-      const t = r?.source || e.ae?.source;
+    if (n & this.Pt) {
+      this.ct = true;
+      const t = r?.source || e.pe?.source;
       if (t) {
-        const e = this.ct.size === 0;
-        this.ct.add(t);
-        if (e) setSignal(this.lt, true);
+        const e = this.lt.size === 0;
+        this.lt.add(t);
+        if (e) setSignal(this.dt, true);
       }
     }
-    t &= ~this.ft;
+    t &= ~this.Pt;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.ct) {
-      if (e.m & u || (!(e.ge & this.ft) && !(this.ft & d && e.ge & a))) this.ct.delete(e);
+    for (const e of this.lt) {
+      if (e.m & u || (!(e.we & this.Pt) && !(this.Pt & d && e.we & a))) this.lt.delete(e);
     }
-    if (!this.ct.size) {
-      setSignal(this.lt, false);
-      if (this.ht) {
-        try {
-          this.gt = untrack(() => this.ht());
-        } catch {}
+    if (!this.lt.size) {
+      if (this.Pt & a && this.ct && !this.St && this.kt) {
+        this.ct = !!(this.kt.we & this.Pt);
+      } else {
+        this.ct = false;
+      }
+      if (!this.ct) {
+        setSignal(this.dt, false);
+        if (this.Et) {
+          try {
+            this.Ct = untrack(() => this.Et());
+          } catch {}
+        }
       }
     }
+    if (we) this.yt?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, r) {
   const i = createOwner();
+  if (we) setContext(Se, null, i);
   const s = new CollectionQueue(e);
-  if (r) s.ht = r;
-  const o = createBoundChildren(i, t, s, e);
-  const u = computed(() => {
-    if (!read(s.lt)) {
+  if (r) s.Et = r;
+  const o = (s.kt = createBoundChildren(i, t, s, e));
+  untrack(() => {
+    let t = false;
+    try {
+      read(o);
+    } catch (e) {
+      if (e instanceof NotReadyError) t = true;
+      else throw e;
+    }
+    s.ct = t || !!(o.we & e) || o.pe instanceof NotReadyError;
+  });
+  const u = we && e === a ? getContext(Se) : null;
+  if (u) {
+    s.yt = u;
+    u.register(s);
+    cleanup(() => u.unregister(s));
+  }
+  const f = computed(() => {
+    if (!read(s.dt)) {
       const e = read(o);
-      if (!untrack(() => read(s.lt))) {
-        s.dt = true;
-        return e;
-      }
+      if (!untrack(() => read(s.dt))) return (s.St = true), e;
     }
+    if (we && read(s.ht)) return undefined;
     return n(s);
   });
-  return accessor(u);
+  return accessor(f);
 }
 function createLoadingBoundary(e, t, n) {
   return createCollectionBoundary(a, e, () => t(), n?.on);
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(d, e, e => {
-    let n = e.ct.values().next().value;
-    const r = n.ae?.cause ?? n.ae;
+    let n = e.lt.values().next().value;
+    const r = n.pe?.cause ?? n.pe;
     return t(r, () => {
-      for (const t of e.ct) recompute(t);
+      for (const t of e.lt) recompute(t);
       schedule();
     });
   });
 }
+function createRevealOrder(e, t) {
+  we = true;
+  const n = createOwner();
+  const r = getContext(Se);
+  const i = t?.together || FALSE_ACCESSOR,
+    s = t?.collapsed || FALSE_ACCESSOR;
+  const o = new RevealController(i, s);
+  setContext(Se, o, n);
+  return runWithOwner(n, () => {
+    const t = e();
+    computed(() => {
+      i();
+      s();
+      o.evaluate();
+    });
+    if (r) {
+      o.gt = r;
+      r.register(o);
+      cleanup(() => r.unregister(o));
+    }
+    return t;
+  });
+}
 function flatten(e, t) {
   if (typeof e === "function" && !e.length) {
     if (t?.doNotUnwrap) return e;
@@ -3127,14 +3314,15 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = U;
-exports.$REFRESH = _;
-exports.$TARGET = z;
-exports.$TRACK = K;
+exports.$PROXY = X;
+exports.$REFRESH = O;
+exports.$TARGET = J;
+exports.$TRACK = U;
 exports.ContextNotFoundError = ContextNotFoundError;
+exports.DEV = v;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
-exports.SUPPORTS_PROXY = b;
+exports.SUPPORTS_PROXY = _;
 exports.action = action;
 exports.clearSnapshots = clearSnapshots;
 exports.createContext = createContext;
@@ -3148,6 +3336,7 @@ exports.createOwner = createOwner;
 exports.createProjection = createProjection;
 exports.createReaction = createReaction;
 exports.createRenderEffect = createRenderEffect;
+exports.createRevealOrder = createRevealOrder;
 exports.createRoot = createRoot;
 exports.createSignal = createSignal;
 exports.createStore = createStore;
@@ -3183,5 +3372,5 @@ exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
 exports.snapshot = snapshot;
-exports.storePath = le;
+exports.storePath = de;
 exports.untrack = untrack;