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

package/dist/node.cjs

@@ -108,7 +108,7 @@ function markNode(e, r = n) {
     markNode(n.k, t);
   }
   if (e.C !== null) {
-    for (let n = e.C; n !== null; n = n.W) {
+    for (let n = e.C; n !== null; n = n.N) {
       for (let e = n.O; e !== null; e = e.P) {
         markNode(e.k, t);
       }
@@ -117,12 +117,12 @@ function markNode(e, r = n) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.j = 0; e.j <= e.S; e.j++) {
-    let n = e.l[e.j];
+  for (e.W = 0; e.W <= e.S; e.W++) {
+    let n = e.l[e.W];
     while (n !== undefined) {
       if (n.m & i) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.j];
+      n = e.l[e.W];
     }
   }
   e.S = 0;
@@ -130,8 +130,8 @@ 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.R;
+  for (let t = e.j; t; t = t.R) {
+    const e = t.A;
     const r = e.L || e;
     if (r.I && r.o >= n) n = r.o + 1;
   }
@@ -142,25 +142,42 @@ function adjustHeight(e, t) {
     }
   }
 }
-const x = undefined;
-const v = new Set();
-const P = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
-const k = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
+const v = undefined;
+const x = new Set();
+const P = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+const k = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
 let E = 0;
 let C = null;
+let N = false;
 let W = false;
-let j = false;
-let A = null;
+let j = null;
+const R = new Set();
+function registerTransientStoreNode(e) {
+  R.add(e);
+}
+function sweepTransientStoreNodes() {
+  if (R.size === 0) return;
+  for (const e of R) {
+    if (e.O !== null) {
+      R.delete(e);
+      continue;
+    }
+    if (e.T !== S) continue;
+    if (e.H !== undefined && e.H !== S) continue;
+    R.delete(e);
+    e.q?.();
+  }
+}
 function enforceLoadingBoundary(e) {}
 function shouldReadStashedOptimisticValue(e) {
-  return !!A?.has(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.M || t.D.size > 0) continue;
+    const n = t.F[e - 1];
     if (n.length) {
-      t.q[e - 1] = [];
+      t.F[e - 1] = [];
       runQueue(n, e);
     }
   }
@@ -168,83 +185,83 @@ function runLaneEffects(e) {
 function queueStashedOptimisticEffects(e) {
   for (let t = e.O; t !== null; t = t.P) {
     const e = t.k;
-    if (!e.D) continue;
-    if (e.D === g) {
-      if (!e.F) {
-        e.F = true;
-        e.V.enqueue(y, e.M);
+    if (!e.V) continue;
+    if (e.V === g) {
+      if (!e.B) {
+        e.B = true;
+        e.K.enqueue(y, e.G);
       }
       continue;
     }
     const n = e.m & o ? k : P;
-    if (n.j > e.o) n.j = e.o;
+    if (n.W > e.o) n.W = e.o;
     insertIntoHeap(e, n);
   }
 }
 function setProjectionWriteActive(e) {
-  j = e;
+  W = e;
 }
 function mergeTransitionState(e, t) {
-  t.B = e;
-  e.K.push(...t.K);
-  for (const n of L) if (n.G === t) n.G = e;
-  e.U.push(...t.U);
-  for (const n of t.J) e.J.add(n);
-  for (const [n, r] of t.X) {
-    let t = e.X.get(n);
-    if (!t) e.X.set(n, (t = new Set()));
+  t.U = e;
+  e.J.push(...t.J);
+  for (const n of I) if (n.X === t) n.X = e;
+  e.Y.push(...t.Y);
+  for (const n of t.Z) e.Z.add(n);
+  for (const [n, r] of t.$) {
+    let t = e.$.get(n);
+    if (!t) e.$.set(n, (t = new Set()));
     for (const e of r) t.add(e);
   }
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.Y = undefined;
-    if (n.Z !== S) {
-      n.$ = n.Z;
-      n.Z = S;
+    n.ee = undefined;
+    if (n.T !== S) {
+      n.te = n.T;
+      n.T = S;
     }
-    const r = n.ee;
-    n.ee = S;
-    if (r !== S && n.$ !== r) insertSubs(n, true);
-    n.G = null;
+    const r = n.H;
+    n.H = S;
+    if (r !== S && n.te !== r) insertSubs(n, true);
+    n.X = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
-  for (const t of L) {
-    const n = e ? t.G === e : !t.G;
+  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], p);
-      if (t.q[1].length) runQueue(t.q[1], y);
+    if (!t.M) {
+      if (t.F[0].length) runQueue(t.F[0], p);
+      if (t.F[1].length) runQueue(t.F[1], y);
     }
-    if (t.te.Y === t) t.te.Y = undefined;
-    t.H.clear();
-    t.q[0].length = 0;
-    t.q[1].length = 0;
-    L.delete(t);
-    R.delete(t.te);
+    if (t.ne.ee === t) t.ne.ee = undefined;
+    t.D.clear();
+    t.F[0].length = 0;
+    t.F[1].length = 0;
+    I.delete(t);
+    L.delete(t.ne);
   }
 }
 function schedule() {
-  if (W) return;
-  W = true;
-  if (!N.ne && !j) queueMicrotask(flush);
+  if (N) return;
+  N = true;
+  if (!A.re && !W) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  re = [[], []];
-  ie = [];
+  ie = [[], []];
+  se = [];
   created = E;
   addChild(e) {
-    this.ie.push(e);
+    this.se.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.ie.indexOf(e);
+    const t = this.se.indexOf(e);
     if (t >= 0) {
-      this.ie.splice(t, 1);
+      this.se.splice(t, 1);
       e.i = null;
     }
   }
@@ -253,122 +270,122 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.re[e - 1].length) {
-      const t = this.re[e - 1];
-      this.re[e - 1] = [];
+    if (this.ie[e - 1].length) {
+      const t = this.ie[e - 1];
+      this.ie[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.se.length; t++) this.se[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
-      if (B) {
-        const n = findLane(B);
-        n.q[e - 1].push(t);
+      if (K) {
+        const n = findLane(K);
+        n.F[e - 1].push(t);
       } else {
-        this.re[e - 1].push(t);
+        this.ie[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.ie[0].push(...this.ie[0]);
+    e.ie[1].push(...this.ie[1]);
+    this.ie = [[], []];
+    for (let t = 0; t < this.se.length; t++) {
+      let n = this.se[t];
+      let r = e.se[t];
       if (!r) {
-        r = { re: [[], []], ie: [] };
-        e.ie[t] = r;
+        r = { ie: [[], []], se: [] };
+        e.se[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.ie[0].push(...e.ie[0]);
+    this.ie[1].push(...e.ie[1]);
+    for (let t = 0; t < e.se.length; t++) {
+      const n = e.se[t];
+      let r = this.se[t];
       if (r) r.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  ne = false;
-  se = [];
-  U = [];
-  J = new Set();
-  static oe;
+  re = false;
+  oe = [];
+  Y = [];
+  Z = new Set();
   static ue;
-  static fe = null;
+  static fe;
+  static le = null;
   flush() {
-    if (this.ne) return;
-    this.ne = true;
+    if (this.re) return;
+    this.re = true;
     try {
-      runHeap(P, GlobalQueue.oe);
+      runHeap(P, GlobalQueue.ue);
       if (C) {
         const e = transitionComplete(C);
         if (!e) {
           const e = C;
-          runHeap(k, GlobalQueue.oe);
-          this.se = [];
-          this.U = [];
-          this.J = new Set();
+          runHeap(k, GlobalQueue.ue);
+          this.oe = [];
+          this.Y = [];
+          this.Z = new Set();
           runLaneEffects(p);
           runLaneEffects(y);
-          this.stashQueues(e.le);
+          this.stashQueues(e.ce);
           E++;
-          W = P.S >= P.j;
-          reassignPendingTransition(e.se);
+          N = P.S >= P.W;
+          reassignPendingTransition(e.oe);
           C = null;
-          if (!e.K.length && e.U.length) {
-            A = new Set();
-            for (let t = 0; t < e.U.length; t++) {
-              const n = e.U[t];
-              if (n.I || n.ce) continue;
-              A.add(n);
+          if (!e.J.length && e.Y.length) {
+            j = new Set();
+            for (let t = 0; t < e.Y.length; t++) {
+              const n = e.Y[t];
+              if (n.I || n.ae) continue;
+              j.add(n);
               queueStashedOptimisticEffects(n);
             }
           }
           try {
             finalizePureQueue(null, true);
           } finally {
-            A = null;
+            j = null;
           }
           return;
         }
-        this.se !== C.se && this.se.push(...C.se);
-        this.restoreQueues(C.le);
-        v.delete(C);
+        this.oe !== C.oe && this.oe.push(...C.oe);
+        this.restoreQueues(C.ce);
+        x.delete(C);
         const t = C;
         C = null;
-        reassignPendingTransition(this.se);
+        reassignPendingTransition(this.oe);
         finalizePureQueue(t);
       } else {
-        if (v.size) runHeap(k, GlobalQueue.oe);
+        if (x.size) runHeap(k, GlobalQueue.ue);
         finalizePureQueue();
       }
       E++;
-      W = P.S >= P.j;
+      N = P.S >= P.W;
       runLaneEffects(p);
       this.run(p);
       runLaneEffects(y);
       this.run(y);
       if (false);
     } finally {
-      this.ne = false;
+      this.re = false;
     }
   }
   notify(e, t, n, r) {
     if (t & a) {
       if (n & a) {
-        const t = r !== undefined ? r : e.ae;
+        const t = r !== undefined ? r : e.de;
         if (C && t) {
           const n = t.source;
-          let r = C.X.get(n);
-          if (!r) C.X.set(n, (r = new Set()));
+          let r = C.$.get(n);
+          if (!r) C.$.set(n, (r = new Set()));
           const i = r.size;
           r.add(e);
           if (r.size !== i) schedule();
@@ -381,56 +398,56 @@ class GlobalQueue extends Queue {
   initTransition(e) {
     if (e) e = currentTransition(e);
     if (e && e === C) return;
-    if (!e && C && C.de === E) return;
+    if (!e && C && C.he === E) return;
     if (!C) {
       C = e ?? {
-        de: E,
-        se: [],
-        X: new Map(),
-        U: [],
-        J: new Set(),
-        K: [],
-        le: { re: [[], []], ie: [] },
-        B: false
+        he: E,
+        oe: [],
+        $: new Map(),
+        Y: [],
+        Z: new Set(),
+        J: [],
+        ce: { ie: [[], []], se: [] },
+        U: false
       };
     } else if (e) {
       const t = C;
       mergeTransitionState(e, t);
-      v.delete(t);
+      x.delete(t);
       C = e;
     }
-    v.add(C);
-    C.de = E;
-    if (this.se !== C.se) {
-      for (let e = 0; e < this.se.length; e++) {
-        const t = this.se[e];
-        t.G = C;
-        C.se.push(t);
+    x.add(C);
+    C.he = E;
+    if (this.oe !== C.oe) {
+      for (let e = 0; e < this.oe.length; e++) {
+        const t = this.oe[e];
+        t.X = C;
+        C.oe.push(t);
       }
-      this.se = C.se;
+      this.oe = C.oe;
     }
-    if (this.U !== C.U) {
-      for (let e = 0; e < this.U.length; e++) {
-        const t = this.U[e];
-        t.G = C;
-        C.U.push(t);
+    if (this.Y !== C.Y) {
+      for (let e = 0; e < this.Y.length; e++) {
+        const t = this.Y[e];
+        t.X = C;
+        C.Y.push(t);
       }
-      this.U = C.U;
+      this.Y = C.Y;
     }
-    for (const e of L) {
-      if (!e.G) e.G = C;
+    for (const e of I) {
+      if (!e.X) e.X = C;
     }
-    if (this.J !== C.J) {
-      for (const e of this.J) C.J.add(e);
-      this.J = C.J;
+    if (this.Z !== C.Z) {
+      for (const e of this.Z) C.Z.add(e);
+      this.Z = C.Z;
     }
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.Y || B;
-  const r = e.he !== undefined;
+  const n = e.ee || K;
+  const r = e.pe !== undefined;
   for (let i = e.O; i !== null; i = i.P) {
-    if (r && i.k.pe) {
+    if (r && i.k.ye) {
       i.k.m |= l;
       continue;
     }
@@ -439,76 +456,77 @@ 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 === g) {
-      if (!e.F) {
-        e.F = true;
-        e.V.enqueue(y, e.M);
+    if (e.V === g) {
+      if (!e.B) {
+        e.B = true;
+        e.K.enqueue(y, e.G);
       }
       continue;
     }
     const s = i.k.m & o ? k : P;
-    if (s.j > i.k.o) s.j = i.k.o;
+    if (s.W > i.k.o) s.W = i.k.o;
     insertIntoHeap(i.k, s);
   }
 }
 function commitPendingNodes() {
-  const e = N.se;
+  const e = A.oe;
   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 !== g) n.F = true;
+    if (n.T !== S) {
+      n.te = n.T;
+      n.T = S;
+      if (n.V && n.V !== g) n.B = true;
     }
-    if (!(n.ye & a)) n.ye &= ~h;
-    if (n.I) GlobalQueue.ue(n, false, true);
+    if (!(n.ge & a)) n.ge &= ~h;
+    if (n.I) GlobalQueue.fe(n, false, true);
   }
   e.length = 0;
 }
 function finalizePureQueue(e = null, t = false) {
   const n = !t;
   if (n) commitPendingNodes();
-  if (!t) checkBoundaryChildren(N);
-  if (P.S >= P.j) runHeap(P, GlobalQueue.oe);
+  if (!t) checkBoundaryChildren(A);
+  if (P.S >= P.W) runHeap(P, GlobalQueue.ue);
   if (n) {
     commitPendingNodes();
-    resolveOptimisticNodes(e ? e.U : N.U);
-    const t = e ? e.J : N.J;
-    if (GlobalQueue.fe && t.size) {
+    resolveOptimisticNodes(e ? e.Y : A.Y);
+    const t = e ? e.Z : A.Z;
+    if (GlobalQueue.le && t.size) {
       for (const e of t) {
-        GlobalQueue.fe(e);
+        GlobalQueue.le(e);
       }
       t.clear();
       schedule();
     }
+    sweepTransientStoreNodes();
     cleanupCompletedLanes(e);
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.ie) {
+  for (const t of e.se) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  N.J.add(e);
+  A.Z.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].G = C;
+    e[t].X = C;
   }
 }
-const N = new GlobalQueue();
+const A = new GlobalQueue();
 function flush() {
-  if (N.ne) {
+  if (A.re) {
     return;
   }
-  while (W || C) {
-    N.flush();
+  while (N || C) {
+    A.flush();
   }
 }
 function runQueue(e, t) {
@@ -516,21 +534,21 @@ function runQueue(e, t) {
 }
 function reporterBlocksSource(e, t) {
   if (e.m & (o | u)) return false;
-  if (e.ge === t || e.Se?.has(t)) return true;
-  for (let n = e.A; n; n = n.N) {
-    let e = n.R;
+  if (e.Se === t || e.we?.has(t)) return true;
+  for (let n = e.j; n; n = n.R) {
+    let e = n.A;
     while (e) {
       if (e === t || e.L === t) return true;
-      e = e.we;
+      e = e.me;
     }
   }
-  return !!(e.ye & a && e.ae instanceof NotReadyError && e.ae.source === t);
+  return !!(e.ge & a && e.de instanceof NotReadyError && e.de.source === t);
 }
 function transitionComplete(e) {
-  if (e.B) return true;
-  if (e.K.length) return false;
+  if (e.U) return true;
+  if (e.J.length) return false;
   let t = true;
-  for (const [n, r] of e.X) {
+  for (const [n, r] of e.$) {
     let i = false;
     for (const e of r) {
       if (reporterBlocksSource(e, n)) {
@@ -539,32 +557,32 @@ function transitionComplete(e) {
       }
       r.delete(e);
     }
-    if (!i) e.X.delete(n);
-    else if (n.ye & a && n.ae?.source === n) {
+    if (!i) e.$.delete(n);
+    else if (n.ge & a && n.de?.source === n) {
       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) &&
-        "ye" in r &&
-        r.ye & a &&
-        r.ae instanceof NotReadyError &&
-        r.ae.source !== r
+        "ge" in r &&
+        r.ge & a &&
+        r.de instanceof NotReadyError &&
+        r.de.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) {
@@ -579,130 +597,130 @@ function runInTransition(e, t) {
     C = n;
   }
 }
-const R = new WeakMap();
-const L = new Set();
+const L = new WeakMap();
+const I = new Set();
 function getOrCreateLane(e) {
-  let t = R.get(e);
+  let t = L.get(e);
   if (t) {
     return findLane(t);
   }
-  const n = e.we;
-  const r = n?.Y ? findLane(n.Y) : null;
-  t = { te: e, H: new Set(), q: [[], []], T: null, G: C, me: r };
-  R.set(e, t);
-  L.add(t);
-  e.be = false;
+  const n = e.me;
+  const r = n?.ee ? findLane(n.ee) : null;
+  t = { ne: e, D: new Set(), F: [[], []], M: null, X: C, be: r };
+  L.set(e, t);
+  I.add(t);
+  e._e = false;
   return t;
 }
 function findLane(e) {
-  while (e.T) e = e.T;
+  while (e.M) e = e.M;
   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.M = e;
+  for (const n of t.D) e.D.add(n);
+  e.F[0].push(...t.F[0]);
+  e.F[1].push(...t.F[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)?.G ?? e.G;
+  return resolveLane(e)?.X ?? e.X;
 }
 function hasActiveOverride(e) {
-  return !!(e.ee !== undefined && e.ee !== S);
+  return !!(e.H !== undefined && e.H !== 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.M) {
+      e.ee = t;
       return;
     }
     const i = findLane(r);
-    if (L.has(i)) {
+    if (I.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
-        if (n.me && findLane(n.me) === i) {
-          e.Y = t;
-        } else if (i.me && findLane(i.me) === n);
+        if (n.be && findLane(n.be) === i) {
+          e.ee = t;
+        } else if (i.be && findLane(i.be) === n);
         else mergeLanes(n, i);
       }
       return;
     }
   }
-  e.Y = t;
+  e.ee = t;
 }
 function unlinkSubs(e) {
-  const t = e.R;
-  const n = e.N;
+  const t = e.A;
+  const n = e.R;
   const r = e.P;
-  const i = e._e;
-  if (r !== null) r._e = i;
-  else t.Oe = i;
+  const i = e.Oe;
+  if (r !== null) r.Oe = i;
+  else t.ve = i;
   if (i !== null) i.P = r;
   else {
     t.O = r;
     if (r === null) {
-      t.xe?.();
-      t.I && !t.ve && !(t.m & o) && unobserved(t);
+      t.q?.();
+      t.I && !t.xe && !(t.m & o) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
   deleteFromHeap(e, e.m & o ? k : P);
-  let t = e.A;
+  let t = e.j;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.A = null;
+  e.j = null;
   e.Pe = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
   const n = t.Pe;
-  if (n !== null && n.R === e) return;
+  if (n !== null && n.A === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
-    i = n !== null ? n.N : t.A;
-    if (i !== null && i.R === e) {
+    i = n !== null ? n.R : t.j;
+    if (i !== null && i.A === e) {
       t.Pe = i;
       return;
     }
   }
-  const o = e.Oe;
+  const o = e.ve;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Pe = e.Oe = { R: e, k: t, N: i, _e: o, P: null });
-  if (n !== null) n.N = u;
-  else t.A = u;
+  const u = (t.Pe = e.ve = { A: e, k: t, R: i, Oe: o, P: null });
+  if (n !== null) n.R = u;
+  else t.j = u;
   if (o !== null) o.P = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
   const n = t.Pe;
   if (n !== null) {
-    let r = t.A;
+    let r = t.j;
     do {
       if (r === e) return true;
       if (r === n) break;
-      r = r.N;
+      r = r.R;
     } while (r !== null);
   }
   return false;
 }
-const I = {};
+const T = {};
 function markDisposal(e) {
   let t = e.ke;
   while (t) {
@@ -716,11 +734,11 @@ function markDisposal(e) {
   }
 }
 function dispose(e) {
-  let t = e.A || null;
+  let t = e.j || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.A = null;
+  e.j = null;
   e.Pe = null;
   disposeChildren(e, true);
 }
@@ -728,32 +746,32 @@ function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
   if (t && e.I) e.Ce = null;
-  let r = n ? e.We : e.ke;
+  let r = n ? e.Ne : e.ke;
   while (r) {
     const e = r.Ee;
-    if (r.A) {
+    if (r.j) {
       const e = r;
       deleteFromHeap(e, e.m & o ? k : P);
-      let t = e.A;
+      let t = e.j;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.A = null;
+      e.j = null;
       e.Pe = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.We = null;
+    e.Ne = null;
   } else {
     e.ke = null;
-    e.je = 0;
+    e.We = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.Ae : e.Ne;
+  let n = t ? e.je : e.Re;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -763,12 +781,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.Ae = null) : (e.Ne = null);
+  t ? (e.je = null) : (e.Re = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.Re && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.je++ : n.je);
+  while (n.Ae && 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");
 }
 function getNextChildId(e) {
@@ -783,38 +801,38 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (D || V) return I;
-  return H ? M : null;
+  if (D || V) return T;
+  return Q ? B : null;
 }
 function getOwner() {
-  return M;
+  return B;
 }
 function cleanup(e) {
-  if (!M) return e;
-  if (!M.Ne) M.Ne = e;
-  else if (Array.isArray(M.Ne)) M.Ne.push(e);
-  else M.Ne = [M.Ne, e];
+  if (!B) return e;
+  if (!B.Re) B.Re = e;
+  else if (Array.isArray(B.Re)) B.Re.push(e);
+  else B.Re = [B.Re, e];
   return e;
 }
 function isDisposed(e) {
   return !!(e.m & (u | o));
 }
 function createOwner(e) {
-  const t = M;
+  const t = B;
   const n = e?.transparent ?? false;
   const r = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    Re: n || undefined,
+    Ae: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
     ke: null,
     Ee: null,
-    Ne: null,
-    V: t?.V ?? N,
+    Re: null,
+    K: t?.K ?? A,
     Le: t?.Le || _,
-    je: 0,
-    Ae: null,
-    We: null,
+    We: 0,
+    je: null,
+    Ne: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
@@ -836,56 +854,56 @@ function createRoot(e, t) {
   return runWithOwner(n, () => e(n.dispose));
 }
 function addPendingSource(e, t) {
-  if (e.ge === t || e.Se?.has(t)) return false;
-  if (!e.ge) {
-    e.ge = t;
+  if (e.Se === t || e.we?.has(t)) return false;
+  if (!e.Se) {
+    e.Se = t;
     return true;
   }
-  if (!e.Se) {
-    e.Se = new Set([e.ge, t]);
+  if (!e.we) {
+    e.we = new Set([e.Se, t]);
   } else {
-    e.Se.add(t);
+    e.we.add(t);
   }
-  e.ge = undefined;
+  e.Se = undefined;
   return true;
 }
 function removePendingSource(e, t) {
-  if (e.ge) {
-    if (e.ge !== t) return false;
-    e.ge = undefined;
+  if (e.Se) {
+    if (e.Se !== t) return false;
+    e.Se = undefined;
     return true;
   }
-  if (!e.Se?.delete(t)) return false;
-  if (e.Se.size === 1) {
-    e.ge = e.Se.values().next().value;
-    e.Se = undefined;
-  } else if (e.Se.size === 0) {
-    e.Se = undefined;
+  if (!e.we?.delete(t)) return false;
+  if (e.we.size === 1) {
+    e.Se = e.we.values().next().value;
+    e.we = undefined;
+  } else if (e.we.size === 0) {
+    e.we = undefined;
   }
   return true;
 }
 function clearPendingSources(e) {
-  e.ge = undefined;
-  e.Se?.clear();
   e.Se = undefined;
+  e.we?.clear();
+  e.we = undefined;
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.ae = null;
+    e.de = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.ae = n;
+    e.de = n;
     return;
   }
-  const r = e.ae;
+  const r = e.de;
   if (!(r instanceof NotReadyError) || r.source !== t) {
-    e.ae = new NotReadyError(t);
+    e.de = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
   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 n = e.C; n !== null; n = n.N) {
     for (let e = n.O; e !== null; e = e.P) t(e.k);
   }
 }
@@ -895,25 +913,25 @@ function settlePendingSource(e) {
   const settle = r => {
     if (n.has(r) || !removePendingSource(r, e)) return;
     n.add(r);
-    r.de = E;
-    const i = r.ge ?? r.Se?.values().next().value;
+    r.he = E;
+    const i = r.Se ?? r.we?.values().next().value;
     if (i) {
       setPendingError(r, i);
       updatePendingSignal(r);
     } else {
-      r.ye &= ~a;
+      r.ge &= ~a;
       setPendingError(r);
       updatePendingSignal(r);
       if (r.Ie) {
-        if (r.D === g) {
+        if (r.V === g) {
           const e = r;
-          if (!e.F) {
-            e.F = true;
-            e.V.enqueue(y, e.M);
+          if (!e.B) {
+            e.B = true;
+            e.K.enqueue(y, e.G);
           }
         } else {
           const e = r.m & o ? k : P;
-          if (e.j > r.o) e.j = r.o;
+          if (e.W > r.o) e.W = r.o;
           insertIntoHeap(r, e);
         }
         t = true;
@@ -937,33 +955,33 @@ function handleAsync(e, t, r) {
   let u;
   const handleError = n => {
     if (e.Ce !== t) return;
-    N.initTransition(resolveTransition(e));
+    A.initTransition(resolveTransition(e));
     notifyStatus(e, n instanceof NotReadyError ? a : d, n);
-    e.de = E;
+    e.he = E;
   };
   const asyncWrite = (i, s) => {
     if (e.Ce !== t) return;
     if (e.m & (n | f)) return;
-    N.initTransition(resolveTransition(e));
-    const o = !!(e.ye & h);
+    A.initTransition(resolveTransition(e));
+    const o = !!(e.ge & h);
     clearStatus(e);
     const u = resolveLane(e);
-    if (u) u.H.delete(e);
+    if (u) u.D.delete(e);
     if (r) r(i);
-    else if (e.ee !== undefined) {
-      if (e.ee !== undefined && e.ee !== S) e.Z = i;
+    else if (e.H !== undefined) {
+      if (e.H !== undefined && e.H !== S) e.T = i;
       else {
-        e.$ = i;
+        e.te = i;
         insertSubs(e);
       }
-      e.de = E;
+      e.he = E;
     } else if (u) {
-      const t = e.D;
-      const n = e.$;
+      const t = e.V;
+      const n = e.te;
       const r = e.Te;
       if ((!t && o) || !r || !r(i, n)) {
-        e.$ = i;
-        e.de = E;
+        e.te = i;
+        e.he = E;
         if (e.He) {
           setSignal(e.He, i);
         }
@@ -993,8 +1011,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      N.initTransition(resolveTransition(e));
-      throw new NotReadyError(M);
+      A.initTransition(resolveTransition(e));
+      throw new NotReadyError(B);
     }
   }
   if (s) {
@@ -1047,8 +1065,8 @@ function handleAsync(e, t, r) {
     };
     const s = iterate();
     if (!r && !s) {
-      N.initTransition(resolveTransition(e));
-      throw new NotReadyError(M);
+      A.initTransition(resolveTransition(e));
+      throw new NotReadyError(B);
     }
   }
   return u;
@@ -1056,7 +1074,7 @@ function handleAsync(e, t, r) {
 function clearStatus(e, t = false) {
   clearPendingSources(e);
   e.Ie = false;
-  e.ye = t ? 0 : e.ye & h;
+  e.ge = t ? 0 : e.ge & h;
   setPendingError(e);
   updatePendingSignal(e);
   e.Qe?.();
@@ -1066,17 +1084,17 @@ function notifyStatus(e, t, n, r, i) {
     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.H !== undefined && !o;
   const f = u && hasActiveOverride(e);
   if (!r) {
     if (t === a && s) {
       addPendingSource(e, s);
-      e.ye = a | (e.ye & h);
+      e.ge = a | (e.ge & h);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.ye = t | (t !== d ? e.ye & h : 0);
-      e.ae = n;
+      e.ge = t | (t !== d ? e.ge & h : 0);
+      e.de = n;
     }
     updatePendingSignal(e);
   }
@@ -1097,22 +1115,22 @@ function notifyStatus(e, t, n, r, i) {
     return;
   }
   forEachDependent(e, e => {
-    e.de = E;
+    e.he = E;
     if (
-      (t === a && s && e.ge !== s && !e.Se?.has(s)) ||
-      (t !== a && (e.ae !== n || e.ge || e.Se))
+      (t === a && s && e.Se !== s && !e.we?.has(s)) ||
+      (t !== a && (e.de !== n || e.Se || e.we))
     ) {
-      if (!l && !e.G) N.se.push(e);
+      if (!l && !e.X) A.oe.push(e);
       notifyStatus(e, t, n, l, c);
     }
   });
 }
-let T = null;
+let H = null;
 function enableExternalSource(e) {
   const { factory: t, untrack: n = e => e() } = e;
-  if (T) {
-    const { factory: e, untrack: r } = T;
-    T = {
+  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);
@@ -1127,21 +1145,21 @@ function enableExternalSource(e) {
       untrack: e => r(() => n(e))
     };
   } else {
-    T = { factory: t, untrack: n };
+    H = { factory: t, untrack: n };
   }
 }
-GlobalQueue.oe = recompute;
-GlobalQueue.ue = disposeChildren;
-let H = false;
+GlobalQueue.ue = recompute;
+GlobalQueue.fe = disposeChildren;
 let Q = false;
 let q = false;
+let M = false;
 let D = false;
 let F = false;
 let V = false;
-let M = null;
 let B = null;
-let K = false;
-let G = null;
+let K = null;
+let G = false;
+let z = null;
 function ownerInSnapshotScope(e) {
   while (e) {
     if (e.qe) return true;
@@ -1150,8 +1168,8 @@ function ownerInSnapshotScope(e) {
   return false;
 }
 function setSnapshotCapture(e) {
-  K = e;
-  if (e && !G) G = new Set();
+  G = e;
+  if (e && !z) z = new Set();
 }
 function markSnapshotScope(e) {
   e.qe = true;
@@ -1170,11 +1188,11 @@ function releaseSubtree(e) {
     }
     if (t.I) {
       const e = t;
-      e.pe = false;
+      e.ye = false;
       if (e.m & l) {
         e.m &= ~l;
         e.m |= n;
-        if (P.j > e.o) P.j = e.o;
+        if (P.W > e.o) P.W = e.o;
         insertIntoHeap(e, P);
       }
     }
@@ -1183,64 +1201,66 @@ function releaseSubtree(e) {
   }
 }
 function clearSnapshots() {
-  if (G) {
-    for (const e of G) {
-      delete e.he;
+  if (z) {
+    for (const e of z) {
+      delete e.pe;
       delete e[m];
     }
-    G = null;
+    z = null;
   }
-  K = false;
+  G = false;
 }
 function recompute(t, n = false) {
-  const i = t.D;
+  const i = t.V;
   if (!n) {
-    if (t.G && (!i || C) && C !== t.G) N.initTransition(t.G);
+    if (t.X && (!i || C) && C !== t.X) A.initTransition(t.X);
     deleteFromHeap(t, t.m & o ? k : P);
     t.Ce = null;
-    if (t.G || i === g) disposeChildren(t);
+    if (t.X || i === g) disposeChildren(t);
     else {
       markDisposal(t);
-      t.Ae = t.Ne;
-      t.We = t.ke;
-      t.Ne = null;
+      t.je = t.Re;
+      t.Ne = t.ke;
+      t.Re = null;
       t.ke = null;
-      t.je = 0;
+      t.We = 0;
     }
   }
   const s = !!(t.m & f);
-  const u = t.ee !== undefined && t.ee !== S;
-  const c = !!(t.ye & a);
-  const p = !!(t.ye & h);
-  const y = M;
-  M = t;
+  const u = t.H !== undefined && t.H !== S;
+  const c = !!(t.ge & a);
+  const p = !!(t.ge & h);
+  const y = B;
+  B = t;
   t.Pe = null;
   t.m = r;
-  t.de = E;
-  let w = t.Z === S ? t.$ : t.Z;
+  t.he = E;
+  let w = t.T === S ? t.te : t.T;
   let m = t.o;
-  let b = H;
-  let _ = B;
-  H = true;
+  let b = Q;
+  let _ = K;
+  Q = true;
   if (s) {
     const e = resolveLane(t);
-    if (e) B = e;
+    if (e) K = e;
   }
   try {
-    w = handleAsync(t, t.I(w));
+    const e = t.Ce;
+    const r = t.I(w);
+    w = t.Ce !== e ? r : handleAsync(t, r);
     clearStatus(t, n);
-    const e = resolveLane(t);
-    if (e) {
-      e.H.delete(t);
-      updatePendingSignal(e.te);
+    const i = resolveLane(t);
+    if (i) {
+      i.D.delete(t);
+      updatePendingSignal(i.ne);
     }
   } catch (e) {
-    if (e instanceof NotReadyError && B) {
-      const e = findLane(B);
-      if (e.te !== t) {
-        e.H.add(t);
-        t.Y = e;
-        updatePendingSignal(e.te);
+    if (e instanceof NotReadyError && K) {
+      const e = findLane(K);
+      if (e.ne !== t) {
+        e.D.add(t);
+        t.ee = e;
+        updatePendingSignal(e.ne);
       }
     }
     if (e instanceof NotReadyError) t.Ie = true;
@@ -1249,52 +1269,52 @@ function recompute(t, n = false) {
       e instanceof NotReadyError ? a : d,
       e,
       undefined,
-      e instanceof NotReadyError ? t.Y : undefined
+      e instanceof NotReadyError ? t.ee : undefined
     );
   } finally {
-    H = b;
+    Q = b;
     t.m = e | (n ? t.m & l : 0);
-    M = y;
+    B = y;
   }
-  if (!t.ae) {
+  if (!t.de) {
     const e = t.Pe;
-    let r = e !== null ? e.N : t.A;
+    let r = e !== null ? e.R : t.j;
     if (r !== null) {
       do {
         r = unlinkSubs(r);
       } while (r !== null);
-      if (e !== null) e.N = null;
-      else t.A = null;
+      if (e !== null) e.R = null;
+      else t.j = null;
     }
-    const f = u ? t.ee : t.Z === S ? t.$ : t.Z;
+    const f = u ? t.H : t.T === S ? t.te : t.T;
     const l = (!i && p) || !t.Te || !t.Te(f, w);
     if (l) {
-      const e = u ? t.ee : undefined;
-      if (n || (i && C !== t.G) || s) {
-        t.$ = w;
+      const e = u ? t.H : undefined;
+      if (n || (i && C !== t.X) || s) {
+        t.te = w;
         if (u && s) {
-          t.ee = w;
-          t.Z = w;
+          t.H = w;
+          t.T = w;
         }
-      } else t.Z = w;
-      if (u && !s && c && !t.be) t.ee = w;
-      if (!u || s || t.ee !== e) insertSubs(t, s || u);
+      } else t.T = w;
+      if (u && !s && c && !t._e) t.H = w;
+      if (!u || s || t.H !== e) insertSubs(t, s || u);
     } else if (u) {
-      t.Z = w;
+      t.T = w;
     } else if (t.o != m) {
       for (let e = t.O; e !== null; e = e.P) {
         insertIntoHeapHeight(e.k, e.k.m & o ? k : P);
       }
     }
   }
-  B = _;
-  (!n || t.ye & a) && !t.G && !(C && u) && N.se.push(t);
-  t.G && i && C !== t.G && runInTransition(t.G, () => recompute(t));
+  K = _;
+  (!n || t.ge & a) && !t.X && !(C && u) && A.oe.push(t);
+  t.X && i && C !== 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.R;
+    for (let t = e.j; t; t = t.R) {
+      const r = t.A;
       const i = r.L || r;
       if (i.I) {
         updateIfNecessary(i);
@@ -1304,121 +1324,121 @@ function updateIfNecessary(e) {
       }
     }
   }
-  if (e.m & (n | f) || (e.ae && e.de < E && !e.Ce)) {
+  if (e.m & (n | f) || (e.de && e.he < E && !e.Ce)) {
     recompute(e);
   }
   e.m = e.m & (l | i | s);
 }
-function computed(t, n, r) {
-  const i = r?.transparent ?? false;
-  const s = {
-    id: r?.id ?? (i ? M?.id : M?.id != null ? getNextChildId(M) : undefined),
-    Re: i || undefined,
-    Te: r?.equals != null ? r.equals : isEqual,
-    ce: !!r?.ownedWrite,
-    xe: r?.unobserved,
-    Ne: null,
-    V: M?.V ?? N,
-    Le: M?.Le ?? _,
-    je: 0,
+function computed(t, n) {
+  const r = n?.transparent ?? false;
+  const i = {
+    id: n?.id ?? (r ? B?.id : B?.id != null ? getNextChildId(B) : undefined),
+    Ae: r || undefined,
+    Te: n?.equals != null ? n.equals : isEqual,
+    ae: !!n?.ownedWrite,
+    q: n?.unobserved,
+    Re: null,
+    K: B?.K ?? A,
+    Le: B?.Le ?? _,
+    We: 0,
     I: t,
-    $: n,
+    te: undefined,
     o: 0,
     C: null,
     p: undefined,
     h: null,
-    A: null,
+    j: null,
     Pe: null,
     O: null,
-    Oe: null,
-    i: M,
+    ve: null,
+    i: B,
     Ee: null,
     ke: null,
-    m: r?.lazy ? c : e,
-    ye: h,
-    de: E,
-    Z: S,
-    Ae: null,
-    We: null,
+    m: n?.lazy ? c : e,
+    ge: h,
+    he: E,
+    T: S,
+    je: null,
+    Ne: null,
     Ce: null,
-    G: null
+    X: null
   };
-  s.h = s;
-  const o = M?.t ? M.u : M;
-  if (M) {
-    const e = M.ke;
+  i.h = i;
+  const s = B?.t ? B.u : B;
+  if (B) {
+    const e = B.ke;
     if (e === null) {
-      M.ke = s;
+      B.ke = i;
     } else {
-      s.Ee = e;
-      M.ke = s;
+      i.Ee = e;
+      B.ke = i;
     }
   }
-  if (o) s.o = o.o + 1;
-  if (K && ownerInSnapshotScope(M)) s.pe = true;
-  if (T) {
+  if (s) i.o = s.o + 1;
+  if (G && ownerInSnapshotScope(B)) i.ye = true;
+  if (H) {
     const e = signal(undefined, { equals: false, ownedWrite: true });
-    const t = T.factory(s.I, () => {
+    const t = H.factory(i.I, () => {
       setSignal(e, undefined);
     });
     cleanup(() => t.dispose());
-    s.I = n => {
+    i.I = n => {
       read(e);
       return t.track(n);
     };
   }
-  !r?.lazy && recompute(s, true);
-  if (K && !r?.lazy) {
-    if (!(s.ye & a)) {
-      s.he = s.$ === undefined ? w : s.$;
-      G.add(s);
+  !n?.lazy && recompute(i, true);
+  if (G && !n?.lazy) {
+    if (!(i.ge & a)) {
+      i.pe = i.te === undefined ? w : i.te;
+      z.add(i);
     }
   }
-  return s;
+  return i;
 }
 function signal(e, t, n = null) {
   const r = {
     Te: t?.equals != null ? t.equals : isEqual,
-    ce: !!t?.ownedWrite,
-    De: !!t?.De,
-    xe: t?.unobserved,
-    $: e,
+    ae: !!t?.ownedWrite,
+    Me: !!t?.Me,
+    q: t?.unobserved,
+    te: e,
     O: null,
-    Oe: null,
-    de: E,
+    ve: null,
+    he: E,
     L: n,
-    W: n?.C || null,
-    Z: S
+    N: n?.C || null,
+    T: S
   };
   n && (n.C = r);
-  if (K && !r.De && !((n?.ye ?? 0) & a)) {
-    r.he = e === undefined ? w : e;
-    G.add(r);
+  if (G && !r.Me && !((n?.ge ?? 0) & a)) {
+    r.pe = e === undefined ? w : e;
+    z.add(r);
   }
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.ee = S;
+  n.H = S;
   return n;
 }
-function optimisticComputed(e, t, n) {
-  const r = computed(e, t, n);
-  r.ee = S;
-  return r;
+function optimisticComputed(e, t) {
+  const n = computed(e, t);
+  n.H = S;
+  return n;
 }
 function isEqual(e, t) {
   return e === t;
 }
 function untrack(e, t) {
-  if (!T && !H && true) return e();
-  const n = H;
-  H = false;
+  if (!H && !Q && true) return e();
+  const n = Q;
+  Q = false;
   try {
-    if (T) return T.untrack(e);
+    if (H) return H.untrack(e);
     return e();
   } finally {
-    H = n;
+    Q = n;
   }
 }
 function read(e) {
@@ -1426,21 +1446,21 @@ function read(e) {
     const t = getLatestValueComputed(e);
     const n = V;
     V = false;
-    const r = e.ee !== undefined && e.ee !== S ? e.ee : e.$;
+    const r = e.H !== undefined && e.H !== S ? e.H : e.te;
     let i;
     try {
       i = read(t);
     } catch (e) {
-      if (!M && e instanceof NotReadyError) return r;
+      if (!B && e instanceof NotReadyError) return r;
       throw e;
     } finally {
       V = n;
     }
-    if (t.ye & a) return r;
-    if (Q && B && t.Y) {
-      const e = findLane(t.Y);
-      const n = findLane(B);
-      if (e !== n && e.H.size > 0) {
+    if (t.ge & a) return r;
+    if (q && K && t.ee) {
+      const e = findLane(t.ee);
+      const n = findLane(K);
+      if (e !== n && e.D.size > 0) {
         return r;
       }
     }
@@ -1450,13 +1470,13 @@ function read(e) {
     const t = e.L;
     const n = D;
     D = false;
-    if (t && e.ee !== undefined) {
-      if (e.ee !== S && (t.Ce || !!(t.ye & a))) {
+    if (t && e.H !== undefined) {
+      if (e.H !== S && (t.Ce || !!(t.ge & a))) {
         F = true;
       }
-      let n = M;
+      let n = B;
       if (n?.t) n = n.u;
-      if (n && H) link(e, n);
+      if (n && Q) link(e, n);
       read(getPendingSignal(e));
       read(getPendingSignal(t));
     } else {
@@ -1464,14 +1484,14 @@ function read(e) {
       if (t && read(getPendingSignal(t))) F = true;
     }
     D = n;
-    return e.$;
+    return e.te;
   }
-  let t = M;
+  let t = B;
   if (t?.t) t = t.u;
   const n = e;
   if (typeof n.I === "function") {
     const t = e;
-    if (q && !(t.m & u)) recompute(t);
+    if (M && !(t.m & u)) recompute(t);
     if (t.m & c) {
       t.m &= ~c;
       recompute(t, true);
@@ -1480,11 +1500,11 @@ function read(e) {
     }
   }
   const r = e.L || e;
-  if (t && H) {
+  if (t && Q) {
     link(e, t);
     if (r.I) {
       const n = e.m & o;
-      if (r.o >= (n ? k.j : P.j)) {
+      if (r.o >= (n ? k.W : P.W)) {
         markNode(t);
         markHeap(n ? k : P);
         updateIfNecessary(r);
@@ -1495,64 +1515,64 @@ function read(e) {
       }
     }
   }
-  if (r.ye & a) {
-    if (t && !(Q && r.G && C !== r.G)) {
-      if (B) {
-        const n = r.Y;
-        const i = findLane(B);
+  if (r.ge & a) {
+    if (t && !(q && r.X && C !== r.X)) {
+      if (K) {
+        const n = r.ee;
+        const i = findLane(K);
         if (n && findLane(n) === i && !hasActiveOverride(r)) {
-          if (!H && e !== t) link(e, t);
-          throw r.ae;
+          if (!Q && e !== t) link(e, t);
+          throw r.de;
         }
       } else {
-        if (!H && e !== t) link(e, t);
-        throw r.ae;
+        if (!Q && e !== t) link(e, t);
+        throw r.de;
       }
-    } else if (t && r !== e && r.ye & h) {
-      if (!H && e !== t) link(e, t);
-      throw r.ae;
-    } else if (!t && r.ye & h) {
-      throw r.ae;
+    } else if (t && r !== e && r.ge & h) {
+      if (!Q && e !== t) link(e, t);
+      throw r.de;
+    } else if (!t && r.ge & h) {
+      throw r.de;
     }
   }
-  if (e.I && e.ye & d) {
-    if (e.de < E) {
+  if (e.I && e.ge & d) {
+    if (e.he < E) {
       recompute(e);
       return read(e);
-    } else throw e.ae;
+    } else throw e.de;
   }
-  if (K && t && t.pe) {
-    const n = e.he;
+  if (G && t && t.ye) {
+    const n = e.pe;
     if (n !== undefined) {
       const r = n === w ? undefined : n;
-      const i = e.Z !== S ? e.Z : e.$;
+      const i = e.T !== S ? e.T : e.te;
       if (i !== r) t.m |= l;
       return r;
     }
   }
-  if (e.ee !== undefined && e.ee !== S) {
-    if (t && Q && shouldReadStashedOptimisticValue(e)) return e.$;
-    return e.ee;
+  if (e.H !== undefined && e.H !== S) {
+    if (t && q && shouldReadStashedOptimisticValue(e)) return e.te;
+    return e.H;
   }
   const i =
     !t ||
-    (B !== null && (e.ee !== undefined || e.Y || (r === e && Q) || !!(r.ye & a))) ||
-    e.Z === S ||
-    (Q && e.G && C !== e.G)
-      ? e.$
-      : e.Z;
-  if (!t && r === e && typeof n.I === "function" && !n.ve && !(r.ye & a) && !n.i && !e.O) {
+    (K !== null && (e.H !== undefined || e.ee || (r === e && q) || !!(r.ge & a))) ||
+    e.T === S ||
+    (q && e.X && C !== e.X)
+      ? e.te
+      : e.T;
+  if (!t && r === e && typeof n.I === "function" && !n.xe && !(r.ge & a) && !n.i && !e.O) {
     unobserved(e);
   }
   return i;
 }
 function setSignal(e, t) {
-  if (e.G && C !== e.G) N.initTransition(e.G);
-  const n = e.ee !== undefined && !j;
-  const r = e.ee !== undefined && e.ee !== S;
-  const i = n ? (r ? e.ee : e.$) : e.Z === S ? e.$ : e.Z;
+  if (e.X && C !== e.X) A.initTransition(e.X);
+  const n = e.H !== undefined && !W;
+  const r = e.H !== undefined && e.H !== S;
+  const i = n ? (r ? e.H : e.te) : e.T === S ? e.te : e.T;
   if (typeof t === "function") t = t(i);
-  const s = !e.Te || !e.Te(i, t) || !!(e.ye & h);
+  const s = !e.Te || !e.Te(i, t) || !!(e.ge & h);
   if (!s) {
     if (n && r && e.I) {
       insertSubs(e, true);
@@ -1561,86 +1581,86 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = e.ee === S;
-    if (!n) N.initTransition(resolveTransition(e));
+    const n = e.H === S;
+    if (!n) A.initTransition(resolveTransition(e));
     if (n) {
-      e.Z = e.$;
-      N.U.push(e);
+      e.T = e.te;
+      A.Y.push(e);
     }
-    e.be = true;
+    e._e = true;
     const r = getOrCreateLane(e);
-    e.Y = r;
-    e.ee = t;
+    e.ee = r;
+    e.H = t;
   } else {
-    if (e.Z === S) N.se.push(e);
-    e.Z = t;
+    if (e.T === S) A.oe.push(e);
+    e.T = t;
   }
   updatePendingSignal(e);
   if (e.He) {
     setSignal(e.He, t);
   }
-  e.de = E;
+  e.he = E;
   insertSubs(e, n);
   schedule();
   return t;
 }
 function runWithOwner(e, t) {
-  const n = M;
-  const r = H;
-  M = e;
-  H = false;
+  const n = B;
+  const r = Q;
+  B = e;
+  Q = false;
   try {
     return t();
   } finally {
-    M = n;
-    H = r;
+    B = n;
+    Q = r;
   }
 }
 function getPendingSignal(e) {
-  if (!e.Fe) {
-    e.Fe = optimisticSignal(false, { ownedWrite: true });
-    if (e.we) {
-      e.Fe.we = e;
+  if (!e.De) {
+    e.De = optimisticSignal(false, { ownedWrite: true });
+    if (e.me) {
+      e.De.me = e;
     }
-    if (computePendingState(e)) setSignal(e.Fe, true);
+    if (computePendingState(e)) setSignal(e.De, true);
   }
-  return e.Fe;
+  return e.De;
 }
 function computePendingState(e) {
   const t = e;
   const n = e.L;
-  if (n && e.Z !== S) {
-    return !n.Ce && !(n.ye & a);
+  if (n && e.T !== S) {
+    return !n.Ce && !(n.ge & a);
   }
-  if (e.ee !== undefined && e.ee !== S) {
-    if (t.ye & a && !(t.ye & h)) return true;
-    if (e.we) {
-      const t = e.Y ? findLane(e.Y) : null;
-      return !!(t && t.H.size > 0);
+  if (e.H !== undefined && e.H !== S) {
+    if (t.ge & a && !(t.ge & h)) return true;
+    if (e.me) {
+      const t = e.ee ? findLane(e.ee) : null;
+      return !!(t && t.D.size > 0);
     }
     return true;
   }
-  if (e.ee !== undefined && e.ee === S && !e.we) {
+  if (e.H !== undefined && e.H === S && !e.me) {
     return false;
   }
-  if (e.Z !== S && !(t.ye & h)) return true;
-  return !!(t.ye & a && !(t.ye & h));
+  if (e.T !== S && !(t.ge & h)) return true;
+  return !!(t.ge & a && !(t.ge & h));
 }
 function updatePendingSignal(e) {
-  if (e.Fe) {
+  if (e.De) {
     const t = computePendingState(e);
-    const n = e.Fe;
+    const n = e.De;
     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.D.size > 0) {
+        const e = findLane(n.ee);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
-      R.delete(n);
-      n.Y = undefined;
+      L.delete(n);
+      n.ee = undefined;
     }
   }
 }
@@ -1650,23 +1670,23 @@ function getLatestValueComputed(e) {
     V = false;
     const n = D;
     D = false;
-    const r = M;
-    M = null;
+    const r = B;
+    B = null;
     e.He = optimisticComputed(() => read(e));
-    e.He.we = e;
-    M = r;
+    e.He.me = e;
+    B = r;
     D = n;
     V = t;
   }
   return e.He;
 }
 function staleValues(e, t = true) {
-  const n = Q;
-  Q = t;
+  const n = q;
+  q = t;
   try {
     return e();
   } finally {
-    Q = n;
+    q = n;
   }
 }
 function latest(e) {
@@ -1694,8 +1714,8 @@ function isPending(e) {
   }
 }
 function refresh(e) {
-  let t = q;
-  q = true;
+  let t = M;
+  M = true;
   try {
     if (typeof e !== "function") {
       recompute(e[O]);
@@ -1703,14 +1723,14 @@ function refresh(e) {
     }
     return untrack(e);
   } finally {
-    q = t;
+    M = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return q;
+  return M;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1737,29 +1757,30 @@ function hasContext(e, t) {
 function isUndefined(e) {
   return typeof e === "undefined";
 }
-function effect(e, t, n, r, i) {
-  let s = false;
-  const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
-    ...i,
+function effect(e, t, n, r) {
+  let i = false;
+  const s = !!r?.user;
+  const o = computed(s ? e : t => staleValues(() => e(t)), {
+    ...r,
     equals: () => {
-      o.F = !o.ae;
-      if (s) o.V.enqueue(o.D, runEffect.bind(o));
+      o.B = !o.de;
+      if (i) o.K.enqueue(o.V, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Ve = r;
-  o.Me = t;
+  o.Fe = undefined;
+  o.Ve = t;
   o.Be = n;
   o.Ke = undefined;
-  o.D = i?.render ? p : y;
+  o.V = s ? y : p;
   o.Qe = (e, t) => {
-    const n = e !== undefined ? e : o.ye;
-    const r = t !== undefined ? t : o.ae;
+    const n = e !== undefined ? e : o.ge;
+    const r = t !== undefined ? t : o.de;
     if (n & d) {
       let e = r;
-      o.V.notify(o, a, 0);
-      if (o.D === y) {
+      o.K.notify(o, a, 0);
+      if (o.V === y) {
         try {
           return o.Be
             ? o.Be(e, () => {
@@ -1771,38 +1792,38 @@ function effect(e, t, n, r, i) {
           e = t;
         }
       }
-      if (!o.V.notify(o, d, d)) throw e;
-    } else if (o.D === p) {
-      o.V.notify(o, a | d, n, r);
+      if (!o.K.notify(o, d, d)) throw e;
+    } else if (o.V === p) {
+      o.K.notify(o, a | d, n, r);
     }
   };
   recompute(o, true);
-  !i?.defer && (o.D === y ? o.V.enqueue(o.D, runEffect.bind(o)) : runEffect.call(o));
-  s = true;
+  !r?.defer && (o.V === y || r?.schedule ? o.K.enqueue(o.V, runEffect.bind(o)) : runEffect.call(o));
+  i = true;
   cleanup(() => o.Ke?.());
 }
 function runEffect() {
-  if (!this.F || this.m & u) return;
+  if (!this.B || this.m & u) return;
   this.Ke?.();
   this.Ke = undefined;
   try {
-    const e = this.Me(this.$, this.Ve);
+    const e = this.Ve(this.te, this.Fe);
     if (false && e !== undefined && typeof e !== "function");
     this.Ke = e;
   } catch (e) {
-    this.ae = new StatusError(this, e);
-    this.ye |= d;
-    if (!this.V.notify(this, d, d)) throw e;
+    this.de = new StatusError(this, e);
+    this.ge |= d;
+    if (!this.K.notify(this, d, d)) throw e;
   } finally {
-    this.Ve = this.$;
-    this.F = false;
+    this.Fe = this.te;
+    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 {
     }
@@ -1814,27 +1835,26 @@ function trackedEffect(e, t) {
       const t = staleValues(e);
       n.Ke = t;
     },
-    undefined,
     { ...t, lazy: true }
   );
   n.Ke = undefined;
   n.Ge = true;
-  n.F = true;
-  n.D = g;
+  n.B = true;
+  n.V = g;
   n.Qe = (e, t) => {
-    const r = e !== undefined ? e : n.ye;
+    const r = e !== undefined ? e : n.ge;
     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.K.notify(n, a, 0);
+      const e = t !== undefined ? t : n.de;
+      if (!n.K.notify(n, d, d)) throw e;
     }
   };
-  n.M = run;
-  n.V.enqueue(y, run);
+  n.G = run;
+  n.K.enqueue(y, run);
   cleanup(() => n.Ke?.());
 }
 function restoreTransition(e, t) {
-  N.initTransition(e);
+  A.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1843,13 +1863,13 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      N.initTransition();
+      A.initTransition();
       let s = C;
-      s.K.push(i);
+      s.J.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.K.indexOf(i);
-        if (o >= 0) s.K.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);
@@ -1887,22 +1907,22 @@ function accessor(e) {
 }
 function createSignal(e, t) {
   if (typeof e === "function") {
-    const n = computed(e, undefined, t);
-    n.ve = true;
+    const n = computed(e, t);
+    n.xe = true;
     return [accessor(n), setSignal.bind(null, n)];
   }
   const n = signal(e, t);
   return [accessor(n), setSignal.bind(null, n)];
 }
 function createMemo(e, t) {
-  let n = computed(e, undefined, t);
+  let n = computed(e, t);
   return accessor(n);
 }
 function createEffect(e, t, n) {
-  effect(e, t.effect || t, t.error, undefined, n);
+  effect(e, t.effect || t, t.error, { user: true, ...n });
 }
 function createRenderEffect(e, t, n) {
-  effect(e, t, undefined, undefined, { render: true, ...n });
+  effect(e, t, undefined, n);
 }
 function createTrackedEffect(e, t) {
   trackedEffect(e, t);
@@ -1923,8 +1943,7 @@ function createReaction(e, t) {
           dispose(t);
         },
         e.error,
-        undefined,
-        { defer: true, ...(false ? { ...t, name: t?.name ?? "effect" } : t) }
+        { ...(false ? { ...t, name: t?.name ?? "effect" } : t), user: true, defer: true }
       );
     });
   };
@@ -1946,8 +1965,8 @@ function resolve(e) {
 }
 function createOptimistic(e, t) {
   if (typeof e === "function") {
-    const n = optimisticComputed(e, undefined, t);
-    n.ve = true;
+    const n = optimisticComputed(e, t);
+    n.xe = true;
     return [accessor(n), setSignal.bind(null, n)];
   }
   const n = optimisticSignal(e, t);
@@ -1957,13 +1976,13 @@ function onSettled(e) {
   const t = getOwner();
   t && !t.Ge
     ? createTrackedEffect(() => untrack(e), undefined)
-    : N.enqueue(y, () => {
+    : A.enqueue(y, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[U]?.[ee] ?? e;
+  return e?.[J]?.[te] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1975,16 +1994,16 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n) {
-  const r = t?.[U];
+  const r = t?.[J];
   if (!r) return;
-  const i = r[Y];
-  const s = r[Z];
-  const o = r[$];
-  let u = r[ee];
+  const i = r[Z];
+  const s = r[$];
+  const o = r[ee];
+  let u = r[te];
   if (e === i && !s && !o) return;
-  (r[re] || oe).set(e, r[J]);
-  r[Y] = e;
-  r[Z] = 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);
@@ -2012,16 +2031,16 @@ function applyState(e, t, n) {
       if (a > h || a > d) {
         for (c = a; c <= h; c++) {
           t = true;
-          r[ee][c] && setSignal(r[ee][c], wrap(e[c], r));
+          r[te][c] && setSignal(r[te][c], wrap(e[c], r));
         }
         for (; c < e.length; c++) {
           t = true;
           const i = wrap(S[c], r);
-          r[ee][c] && setSignal(r[ee][c], i);
+          r[te][c] && setSignal(r[te][c], i);
           applyState(e[c], i, n);
         }
-        t && r[ee][z] && setSignal(r[ee][z], void 0);
-        f !== e.length && r[ee].length && setSignal(r[ee].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;
       }
       y = new Array(h + 1);
@@ -2045,26 +2064,26 @@ function applyState(e, t, n) {
       for (c = a; c < e.length; c++) {
         if (c in S) {
           const t = wrap(S[c], r);
-          r[ee][c] && setSignal(r[ee][c], t);
+          r[te][c] && setSignal(r[te][c], t);
           applyState(e[c], t, n);
-        } else r[ee][c] && setSignal(r[ee][c], wrap(e[c], r));
+        } 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[ee][t] && setSignal(r[ee][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[ee].length && setSignal(r[ee].length, e.length);
+      r[te].length && setSignal(r[te].length, e.length);
     }
-    t && r[ee][z] && setSignal(r[ee][z], void 0);
+    t && r[te][U] && setSignal(r[te][U], void 0);
     return;
   }
   if (u) {
-    const t = u[z];
+    const t = u[U];
     const f = t ? getAllKeys(i, s, e) : Object.keys(u);
     for (let l = 0, c = f.length; l < c; l++) {
       const c = f[l];
@@ -2078,7 +2097,7 @@ function applyState(e, t, n) {
       } else applyState(h, wrap(d, r), n);
     }
   }
-  if ((u = r[te])) {
+  if ((u = r[ne])) {
     const t = Object.keys(u);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -2100,9 +2119,9 @@ function createProjectionInternal(e, t, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[ne] = wrapProjection;
-    e[re] = i;
-    Object.defineProperty(e, ie, {
+    e[re] = wrapProjection;
+    e[ie] = i;
+    Object.defineProperty(e, se, {
       get() {
         return r;
       },
@@ -2111,35 +2130,42 @@ function createProjectionInternal(e, t, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[U]?.[ne] === wrapProjection) return e;
-    const t = createStoreProxy(e, le, wrapper);
+    if (e[J]?.[re] === wrapProjection) return e;
+    const t = createStoreProxy(e, ce, wrapper);
     i.set(e, t);
     return t;
   };
   const s = wrapProjection(t);
   r = computed(() => {
-    const t = getOwner();
-    let r = false;
-    let i;
-    const o = new Proxy(
-      s,
-      createWriteTraps(() => !r || t.Ce === i)
-    );
-    storeSetter(o, o => {
-      i = e(o);
-      r = true;
-      const u = handleAsync(t, i, e => {
-        e !== o && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id"));
-      });
-      u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
-    });
-  });
-  r.ve = true;
+    if (!r) r = getOwner();
+    runProjectionComputed(s, e, n?.key || "id");
+  }, undefined);
+  r.xe = true;
   return { store: s, node: r };
 }
 function createProjection(e, t, n) {
   return createProjectionInternal(e, t, n).store;
 }
+function runProjectionComputed(e, t, n, r) {
+  const i = getOwner();
+  let s = false;
+  let o;
+  const u = new Proxy(
+    e,
+    createWriteTraps(() => !s || i.Ce === o)
+  );
+  storeSetter(u, u => {
+    o = t(u);
+    s = true;
+    const commit = t => {
+      if (t === u || t === undefined) return;
+      const write = () => storeSetter(e, reconcile(t, n));
+      r ? r(write) : write();
+    };
+    commit(handleAsync(i, o, commit));
+  });
+  return i;
+}
 function createWriteTraps(e) {
   const t = {
     get(e, n) {
@@ -2193,33 +2219,33 @@ function createWriteTraps(e) {
   };
   return t;
 }
-const z = Symbol(0),
-  U = Symbol(0),
+const U = Symbol(0),
   J = Symbol(0),
-  X = Symbol(0);
-const Y = "v",
-  Z = "o",
-  $ = "x",
-  ee = "n",
-  te = "h",
-  ne = "w",
-  re = "l",
-  ie = "f",
-  se = "p";
-function createStoreProxy(e, t = le, n) {
+  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[J] = new Proxy(r, t));
+  return (r[X] = new Proxy(r, t));
 }
-const oe = new WeakMap();
+const ue = new WeakMap();
 function wrap(e, t) {
-  if (t?.[ne]) return t[ne](e, t);
-  let n = e[J] || oe.get(e);
-  if (!n) oe.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) {
@@ -2230,12 +2256,12 @@ function isWrappable(e) {
     !(typeof Node !== "undefined" && e instanceof Node)
   );
 }
-let ue = false;
+let fe = false;
 function setWriteOverride(e) {
-  ue = e;
+  fe = e;
 }
 function writeOnly(e) {
-  return ue || !!fe?.has(e);
+  return fe || !!le?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -2249,23 +2275,23 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
     {
       equals: i,
       unobserved() {
-        delete e[t];
+        if (e[t] === u) delete e[t];
       }
     },
     r
   );
   if (s) {
-    u.ee = S;
+    u.H = S;
   }
   if (o && t in o) {
     const e = o[t];
-    u.he = e === undefined ? w : e;
-    G?.add(u);
+    u.pe = e === undefined ? w : e;
+    z?.add(u);
   }
   return (e[t] = u);
 }
-function trackSelf(e, t = z) {
-  getObserver() && read(getNode(getNodes(e, ee), t, undefined, e[ie], false, e[se]));
+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)));
@@ -2273,137 +2299,171 @@ function getKeys(e, t, n = true) {
   const i = new Set(r);
   const s = Reflect.ownKeys(t);
   for (const e of s) {
-    if (t[e] !== X) i.add(e);
+    if (t[e] !== Y) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
 }
 function getPropertyDescriptor(e, t, n) {
   if (t && n in t) {
-    if (t[n] === X) return void 0;
+    if (t[n] === Y) return void 0;
     const r = Reflect.getOwnPropertyDescriptor(t, n);
     if (r?.get || r?.set || !(n in e)) return r;
   }
   return Reflect.getOwnPropertyDescriptor(e, n);
 }
 function prepareStoreWrite(e, t, n) {
-  if (e[se]) {
-    const t = e[ie];
-    if (t?.G) {
-      N.initTransition(t.G);
+  if (e[oe]) {
+    const t = e[se];
+    if (t?.X) {
+      A.initTransition(t.X);
     }
   }
-  const r = e[Y];
+  const r = e[Z];
   const i = r[n];
-  if (K && typeof n !== "symbol" && !((e[ie]?.ye ?? 0) & a)) {
+  if (G && typeof n !== "symbol" && !((e[se]?.ge ?? 0) & a)) {
     if (!e[m]) {
       e[m] = Object.create(null);
-      G?.add(e);
+      z?.add(e);
     }
     if (!(n in e[m])) {
       e[m][n] = i;
     }
   }
-  const s = e[se] && !j;
-  const o = s ? $ : Z;
+  const s = e[oe] && !W;
+  const o = s ? ee : $;
   if (s) trackOptimisticStore(t);
   return { base: i, overrideKey: o, state: r };
 }
-function notifyStoreProperty(e, t, n, r) {
-  if (e[te]?.[t]) setSignal(e[te][t], n !== "delete");
-  const i = getNodes(e, ee);
+function upsertStoreNode(e, t, n, r, i) {
+  if (t[n]) return t[n];
+  const s = isWrappable(r) ? wrap(r, e) : r;
+  const o = getNode(t, n, s, e[se], isEqual, e[oe], i);
+  registerTransientStoreNode(o);
+  return o;
+}
+function notifyStoreProperty(e, t, n, r, i, s) {
+  const o = W || e[oe];
+  const u = n !== "delete";
+  const f = e[ne]?.[t];
+  if (f) {
+    setSignal(f, u);
+  } else if (!o && n !== "invalidate" && s !== u) {
+    const n = upsertStoreNode(e, getNodes(e, ne), t, s);
+    setSignal(n, u);
+  }
+  const l = getNodes(e, te);
   if (n === "set") {
-    i[t] && setSignal(i[t], () => (isWrappable(r) ? wrap(r, e) : r));
+    if (l[t]) {
+      setSignal(l[t], () => (isWrappable(r) ? wrap(r, e) : r));
+    } else if (!o) {
+      const n = upsertStoreNode(e, l, t, i, e[m]);
+      setSignal(n, () => (isWrappable(r) ? wrap(r, e) : r));
+    }
   } else if (n === "invalidate") {
-    if (i[t]) {
-      setSignal(i[t], {});
-      delete i[t];
+    if (l[t]) {
+      setSignal(l[t], {});
+      delete l[t];
     }
   } else {
-    i[t] && setSignal(i[t], undefined);
+    if (l[t]) {
+      setSignal(l[t], undefined);
+    } else if (!o) {
+      const n = upsertStoreNode(e, l, t, i, e[m]);
+      setSignal(n, undefined);
+    }
   }
-  i[z] && setSignal(i[z], undefined);
+  l[U] && setSignal(l[U], undefined);
 }
-let fe = null;
-const le = {
+let le = null;
+const ce = {
   get(e, t, n) {
-    if (t === U) return e;
-    if (t === J) return n;
-    if (t === O) return e[ie];
-    if (t === z) {
+    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, ee);
+    const r = getNodes(e, te);
     const i = r[t];
-    const s = e[$] && t in e[$];
-    const o = s || (e[Z] && t in e[Z]);
-    const u = !!e[Y][U];
-    const f = s ? e[$] : e[Z] && t in e[Z] ? e[Z] : e[Y];
+    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 === X && (n = undefined);
+        i && (o || !u) ? (i.H !== undefined && i.H !== S ? i.H : i.T !== S ? i.T : i.te) : f[t];
+      n === Y && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      fe?.add(r);
+      le?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === X && (l = undefined);
+    l === Y && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[Y]) && (t = Object.getPrototypeOf(e[Y])) && t !== Object.prototype
+        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(l) ? wrap(l, e) : l, e[ie], isEqual, e[se], e[m]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[se], isEqual, e[oe], e[m]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    if (t === J || t === z || t === "__proto__") return true;
-    const n = e[$] && t in e[$] ? e[$][t] !== X : e[Z] && t in e[Z] ? e[Z][t] !== X : t in e[Y];
-    if (!writeOnly(e[J])) {
-      getObserver() && read(getNode(getNodes(e, te), t, n, e[ie], isEqual, e[se]));
+    if (t === X || t === U || t === "__proto__") return true;
+    const n = e[ee] && t in e[ee] ? e[ee][t] !== Y : e[$] && t in e[$] ? e[$][t] !== Y : t in e[Z];
+    if (writeOnly(e[X])) return n;
+    const r = getNodes(e, ne);
+    if (r[t]) return read(r[t]);
+    if (getObserver()) {
+      return read(getNode(r, t, n, e[se], isEqual, e[oe]));
     }
     return n;
   },
   set(e, t, n) {
-    const r = e[J];
+    const r = e[X];
     if (writeOnly(r)) {
       untrack(() => {
         const { base: i, overrideKey: s, state: o } = prepareStoreWrite(e, r, t);
-        const u = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : i;
-        const f = n?.[U]?.[Y] ?? n;
-        const l = Array.isArray(o) && t !== "length";
-        const c = l ? parseInt(t) + 1 : 0;
-        const a =
-          l &&
-          (e[$] && "length" in e[$]
-            ? e[$].length
-            : e[Z] && "length" in e[Z]
-              ? e[Z].length
+        const u = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : i;
+        const f =
+          e[ee] && t in e[ee] ? e[ee][t] !== Y : e[$] && t in e[$] ? e[$][t] !== Y : t in e[Z];
+        const l = n?.[J]?.[Z] ?? n;
+        const c = Array.isArray(o) && t !== "length";
+        const a = c ? parseInt(t) + 1 : 0;
+        const d =
+          c &&
+          (e[ee] && "length" in e[ee]
+            ? e[ee].length
+            : e[$] && "length" in e[$]
+              ? e[$].length
               : o.length);
-        const d = l && c > a ? c : undefined;
-        if (u === f && d === undefined) return true;
-        if (f !== undefined && f === i && d === undefined) delete e[s]?.[t];
+        const h = c && a > d ? a : undefined;
+        if (u === l && h === undefined) return true;
+        if (l !== undefined && l === i && h === undefined) delete e[s]?.[t];
         else {
           const n = e[s] || (e[s] = Object.create(null));
-          n[t] = f;
-          if (d !== undefined) n.length = d;
+          n[t] = l;
+          if (h !== undefined) n.length = h;
         }
-        notifyStoreProperty(e, t, "set", f);
-        if (Array.isArray(o)) {
-          const n = getNodes(e, ee);
-          const r = t === "length" ? f : d;
-          r !== undefined && n.length && setSignal(n.length, r);
+        notifyStoreProperty(e, t, "set", l, u, f);
+        if (Array.isArray(o) && t !== "length" && h !== undefined) {
+          const t = getNodes(e, te);
+          if (t.length) {
+            setSignal(t.length, h);
+          } else if (!W && !e[oe]) {
+            const n = upsertStoreNode(e, t, "length", d, e[m]);
+            setSignal(n, h);
+          }
         }
         if (false);
       });
@@ -2411,11 +2471,11 @@ const le = {
     return true;
   },
   defineProperty(e, t, n) {
-    const r = e[J];
+    const r = e[X];
     if (writeOnly(r)) {
       untrack(() => {
         const { base: i, overrideKey: s } = prepareStoreWrite(e, r, t);
-        const o = "value" in n ? { ...n, value: n.value?.[U]?.[Y] ?? n.value } : n;
+        const o = "value" in n ? { ...n, value: n.value?.[J]?.[Z] ?? n.value } : n;
         Object.defineProperty(e[s] || (e[s] = Object.create(null)), t, o);
         notifyStoreProperty(e, t, "invalidate");
         if (false);
@@ -2424,31 +2484,31 @@ const le = {
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[$]?.[t] === X;
-    const r = e[Z]?.[t] === X;
-    if (writeOnly(e[J]) && !n && !r) {
+    const n = e[ee]?.[t] === Y;
+    const r = e[$]?.[t] === Y;
+    if (writeOnly(e[X]) && !n && !r) {
       untrack(() => {
-        const n = e[se] && !j;
-        const r = n ? $ : Z;
-        if (n) trackOptimisticStore(e[J]);
-        const i = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : e[Y][t];
-        if (t in e[Y] || (e[Z] && t in e[Z])) {
-          (e[r] || (e[r] = Object.create(null)))[t] = X;
+        const n = e[oe] && !W;
+        const r = n ? ee : $;
+        if (n) trackOptimisticStore(e[X]);
+        const i = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : e[Z][t];
+        if (t in e[Z] || (e[$] && t in e[$])) {
+          (e[r] || (e[r] = Object.create(null)))[t] = Y;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
-        notifyStoreProperty(e, t, "delete");
+        notifyStoreProperty(e, t, "delete", undefined, i, true);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[Y], e[Z], false);
-    if (e[$]) {
+    let t = getKeys(e[Z], e[$], false);
+    if (e[ee]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[$])) {
-        if (e[$][t] !== X) 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);
@@ -2456,27 +2516,27 @@ const le = {
     return t;
   },
   getOwnPropertyDescriptor(e, t) {
-    if (t === J) return { value: e[J], writable: true, configurable: true };
-    if (e[$] && t in e[$]) {
-      if (e[$][t] === X) return undefined;
-      const n = Reflect.getOwnPropertyDescriptor(e[$], t);
-      if (n?.get || n?.set || !(t in e[Y])) return n;
-      const r = getPropertyDescriptor(e[Y], e[Z], t);
+    if (t === X) return { value: e[X], writable: true, configurable: true };
+    if (e[ee] && t in e[ee]) {
+      if (e[ee][t] === Y) return undefined;
+      const n = Reflect.getOwnPropertyDescriptor(e[ee], t);
+      if (n?.get || n?.set || !(t in e[Z])) return n;
+      const r = getPropertyDescriptor(e[Z], e[$], t);
       if (r) {
-        return { ...r, value: e[$][t] };
+        return { ...r, value: e[ee][t] };
       }
-      return { value: e[$][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[ee][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[Y], e[Z], t);
+    return getPropertyDescriptor(e[Z], e[$], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[Y]);
+    return Object.getPrototypeOf(e[Z]);
   }
 };
 function storeSetter(e, t) {
-  const n = fe;
-  fe = new Set();
-  fe.add(e);
+  const n = le;
+  le = new Set();
+  le.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2492,8 +2552,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    fe.clear();
-    fe = n;
+    le.clear();
+    le = n;
   }
 }
 function createStore(e, t, n) {
@@ -2502,7 +2562,7 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.fe ||= clearOptimisticStore;
+  GlobalQueue.le ||= clearOptimisticStore;
   const r = typeof e === "function";
   const i = r ? t : e;
   const s = r ? e : undefined;
@@ -2510,39 +2570,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[U];
-  if (!t || !t[$]) return;
-  const n = t[$];
-  const r = t[ee];
+  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[Z] && e in t[Z] ? t[Z][e] : t[Y][e];
-          const i = n === X ? 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[z]) {
-        r[z].Y = undefined;
-        setSignal(r[z], undefined);
+      if (r[U]) {
+        r[U].ee = undefined;
+        setSignal(r[U], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[$];
+  delete t[ee];
 }
 function createOptimisticProjectionInternal(e, t, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[ne] = wrapProjection;
-    e[re] = i;
-    e[se] = true;
-    Object.defineProperty(e, ie, {
+    e[re] = wrapProjection;
+    e[ie] = i;
+    e[oe] = true;
+    Object.defineProperty(e, se, {
       get() {
         return r;
       },
@@ -2551,45 +2611,34 @@ function createOptimisticProjectionInternal(e, t, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[U]?.[ne] === wrapProjection) return e;
-    const t = createStoreProxy(e, le, wrapper);
+    if (e[J]?.[re] === wrapProjection) return e;
+    const t = createStoreProxy(e, ce, wrapper);
     i.set(e, t);
     return t;
   };
   const s = wrapProjection(t);
   if (e) {
+    const wrapCommit = e => {
+      setProjectionWriteActive(true);
+      try {
+        e();
+      } finally {
+        setProjectionWriteActive(false);
+      }
+    };
     r = computed(() => {
-      const t = getOwner();
-      let r = false;
-      let i;
-      const o = new Proxy(
-        s,
-        createWriteTraps(() => !r || t.Ce === i)
-      );
       setProjectionWriteActive(true);
       try {
-        storeSetter(o, o => {
-          i = e(o);
-          r = true;
-          const u = handleAsync(t, i, e => {
-            setProjectionWriteActive(true);
-            try {
-              e !== o && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id"));
-            } finally {
-              setProjectionWriteActive(false);
-            }
-          });
-          u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
-        });
+        runProjectionComputed(s, e, n?.key || "id", wrapCommit);
       } finally {
         setProjectionWriteActive(false);
       }
-    });
-    r.ve = true;
+    }, undefined);
+    r.xe = true;
   }
   return { store: s, node: r };
 }
-const ce = Symbol(0);
+const ae = Symbol(0);
 function updatePath(e, t, n = 0) {
   let r,
     i = e;
@@ -2633,7 +2682,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;
@@ -2648,26 +2697,26 @@ function updatePath(e, t, n = 0) {
     e[r] = s;
   }
 }
-const ae = 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, l;
   if (!isWrappable(e)) return e;
   if (n && n.has(e)) return n.get(e);
   if (!n) n = new Map();
-  if ((i = e[U] || r?.get(e)?.[U])) {
-    if (t) trackSelf(i, z);
-    o = i[Z];
-    s = Array.isArray(i[Y]);
-    n.set(e, o ? (u = s ? [] : Object.create(Object.getPrototypeOf(i[Y]))) : i[Y]);
-    e = i[Y];
-    r = oe;
+  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);
@@ -2676,7 +2725,7 @@ function snapshotImpl(e, t, n, r) {
     const s = o?.length || e.length;
     for (let c = 0; c < s; c++) {
       l = o && c in o ? o[c] : e[c];
-      if (l === X) continue;
+      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]));
@@ -2711,13 +2760,13 @@ function deep(e) {
 function trueFn() {
   return true;
 }
-const de = {
+const he = {
   get(e, t, n) {
-    if (t === J) return n;
+    if (t === X) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === J) return true;
+    if (t === X) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2740,15 +2789,15 @@ const de = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const he = 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 && J in i);
-    const s = !!i && i[he];
+    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);
   }
@@ -2756,7 +2805,7 @@ function merge(...e) {
     return new Proxy(
       {
         get(e) {
-          if (e === he) 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];
@@ -2774,7 +2823,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      de
+      he
     );
   }
   const r = Object.create(null);
@@ -2806,12 +2855,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[he] = n;
+  o[pe] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (b && J in e) {
+  if (b && X in e) {
     return new Proxy(
       {
         get(t) {
@@ -2824,7 +2873,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      de
+      he
     );
   }
   const r = {};
@@ -2857,27 +2906,27 @@ function mapArray(e, t, n) {
       rt: n?.fallback
     })
   );
-  o.ve = true;
+  o.xe = true;
   return accessor(o);
 }
-const pe = { ownedWrite: true };
+const ye = { ownedWrite: true };
 function updateKeyedMap() {
   const e = this.Je() || [],
     t = e.length;
-  e[z];
+  e[U];
   runWithOwner(this.ze, () => {
     let n,
       r,
       i = this.tt
         ? () => {
-            this.tt[r] = signal(e[r], pe);
-            this.nt && (this.nt[r] = signal(r, pe));
+            this.tt[r] = signal(e[r], ye);
+            this.nt && (this.nt[r] = signal(r, ye));
             return this.Ye(accessor(this.tt[r]), this.nt ? accessor(this.nt[r]) : undefined);
           }
         : this.nt
           ? () => {
               const t = e[r];
-              this.nt[r] = signal(r, pe);
+              this.nt[r] = signal(r, ye);
               return this.Ye(() => t, accessor(this.nt[r]));
             }
           : () => {
@@ -2995,7 +3044,7 @@ function repeat(e, t, n) {
       rt: n?.fallback
     })
   );
-  i.ve = true;
+  i.xe = true;
   return accessor(i);
 }
 function updateRepeat() {
@@ -3049,37 +3098,41 @@ function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
-  const n = computed(e, undefined, { lazy: true });
+  const n = computed(e, { lazy: true });
   n.Qe = (e, t) => {
-    const r = e !== undefined ? e : n.ye;
-    const i = t !== undefined ? t : n.ae;
-    n.ye &= ~n.ut;
-    n.V.notify(n, n.ut, r, i);
+    const r = e !== undefined ? e : n.ge;
+    const i = t !== undefined ? t : n.de;
+    n.ge &= ~n.ut;
+    n.K.notify(n, n.ut, r, i);
   };
   n.ut = t;
-  n.ve = true;
+  n.xe = 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.K;
+  i.addChild((e.K = n));
+  cleanup(() => i.removeChild(e.K));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
-const ye = Symbol();
-const ge = createContext(null);
-let Se = false;
+const ge = Symbol();
+const Se = createContext(null);
+let we = false;
 const FALSE_ACCESSOR = () => false;
+const SEQUENTIAL_ACCESSOR = () => "sequential";
 function isRevealController(e) {
   return e instanceof RevealController;
 }
 function isSlotReady(e) {
   return isRevealController(e) ? e.isReady() : e.ft.size === 0 && !e.lt;
 }
+function isSlotMinimallyReady(e) {
+  return isRevealController(e) ? e.isMinimallyReady() : isSlotReady(e);
+}
 function setSlotState(e, t, n, r) {
   setSignal(e.ct, n);
   setSignal(e.dt, r);
@@ -3094,10 +3147,11 @@ class RevealController {
   wt;
   bt = [];
   ht;
-  ct = signal(false, { ownedWrite: true, De: true });
-  dt = signal(false, { ownedWrite: true, De: true });
+  ct = signal(false, { ownedWrite: true, Me: true });
+  dt = signal(false, { ownedWrite: true, Me: true });
   _t = true;
-  Ot = false;
+  Ot = true;
+  vt = false;
   constructor(e, t) {
     this.St = e;
     this.wt = t;
@@ -3113,11 +3167,33 @@ class RevealController {
   isReady() {
     return this.xt(isSlotReady);
   }
+  isMinimallyReady() {
+    const e = untrack(this.St);
+    if (e === "together") return this.isReady();
+    if (e === "natural") {
+      let e = false;
+      let t = false;
+      this.xt(n => {
+        e = true;
+        if (isSlotMinimallyReady(n)) {
+          t = true;
+          return false;
+        }
+      });
+      return !e || t;
+    }
+    let t = true;
+    this.xt(e => {
+      t = isSlotMinimallyReady(e);
+      return false;
+    });
+    return t;
+  }
   register(e) {
     if (this.bt.includes(e)) return;
     this.bt.push(e);
-    const t = !!untrack(this.St);
-    (setSignal(e.ct, true), setSignal(e.dt, t ? false : !!untrack(this.wt)));
+    const t = untrack(this.St);
+    (setSignal(e.ct, true), setSignal(e.dt, t === "sequential" ? !!untrack(this.wt) : false));
     untrack(() => this.evaluate());
   }
   unregister(e) {
@@ -3126,112 +3202,132 @@ class RevealController {
     untrack(() => this.evaluate());
   }
   evaluate(e, t) {
-    if (this.Ot) return;
-    this.Ot = true;
+    if (this.vt) return;
+    this.vt = true;
     const n = this._t;
+    const r = this.Ot;
     try {
       const n = e ?? read(this.ct),
-        r = !!untrack(this.wt),
-        i = t ?? r;
-      if (n && i) this.xt(e => setSlotState(e, this, true, true));
-      else if (!!untrack(this.St)) {
-        const e = this.isReady();
+        r = untrack(this.St),
+        i = r === "sequential" && !!untrack(this.wt),
+        s = t ?? i;
+      if (n) {
+        this.xt(e => setSlotState(e, this, true, s));
+      } else if (r === "natural") {
+        this.xt(e => {
+          if (isRevealController(e)) {
+            setSignal(e.dt, false);
+            setSignal(e.ct, false);
+            e.evaluate(false, false);
+          } else {
+            setSlotState(e, this, !isSlotReady(e), false);
+          }
+        });
+      } else if (r === "together") {
+        const e = this.xt(isSlotMinimallyReady);
         this.xt(t => setSlotState(t, this, !e, false));
       } else {
         let e = false;
         this.xt(t => {
-          if (e) return setSlotState(t, this, true, r);
+          if (e) return setSlotState(t, this, true, i);
           if (isSlotReady(t)) return setSlotState(t, this, false, false);
           e = true;
-          setSlotState(t, this, true, false);
+          if (isRevealController(t)) {
+            setSignal(t.dt, false);
+            setSignal(t.ct, false);
+            t.evaluate(false, false);
+          } else {
+            setSlotState(t, this, true, false);
+          }
         });
       }
     } finally {
       this._t = this.isReady();
-      this.Ot = false;
+      this.Ot = this.isMinimallyReady();
+      this.vt = false;
     }
-    if (this.ht && n !== this._t) this.ht.evaluate();
+    if (this.ht && (n !== this._t || r !== this.Ot)) this.ht.evaluate();
   }
 }
 class CollectionQueue extends Queue {
-  vt;
-  ft = new Set();
   Pt;
+  ft = new Set();
+  kt;
   lt = true;
-  ct = signal(false, { ownedWrite: true, De: true });
-  dt = signal(false, { ownedWrite: true, De: true });
+  ct = signal(false, { ownedWrite: true, Me: true });
+  dt = signal(false, { ownedWrite: true, Me: true });
   yt;
   gt = false;
-  kt;
-  Et = ye;
+  Et;
+  Ct = ge;
   constructor(e) {
     super();
-    this.vt = e;
+    this.Pt = e;
   }
   run(e) {
-    if (!e || (read(this.ct) && (!Se || read(this.dt)))) return;
+    if (!e || (read(this.ct) && (!we || read(this.dt)))) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.vt)) return super.notify(e, t, n, r);
-    if (this.gt && this.kt) {
+    if (!(t & this.Pt)) return super.notify(e, t, n, r);
+    if (this.gt && this.Et) {
       const e = untrack(() => {
         try {
-          return this.kt();
+          return this.Et();
         } catch {
-          return ye;
+          return ge;
         }
       });
-      if (e !== this.Et) {
-        this.Et = e;
+      if (e !== this.Ct) {
+        this.Ct = e;
         this.gt = false;
         this.ft.clear();
       }
     }
-    if (this.vt & a && this.gt) return super.notify(e, t, n, r);
-    if (this.vt & a && n & d) {
+    if (this.Pt & a && this.gt) return super.notify(e, t, n, r);
+    if (this.Pt & a && n & d) {
       return super.notify(e, d, n, r);
     }
-    if (n & this.vt) {
+    if (n & this.Pt) {
       this.lt = true;
-      const t = r?.source || e.ae?.source;
+      const t = r?.source || e.de?.source;
       if (t) {
         const e = this.ft.size === 0;
         this.ft.add(t);
         if (e) setSignal(this.ct, true);
       }
     }
-    t &= ~this.vt;
+    t &= ~this.Pt;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
     for (const e of this.ft) {
-      if (e.m & u || (!(e.ye & this.vt) && !(this.vt & d && e.ye & a))) this.ft.delete(e);
+      if (e.m & u || (!(e.ge & this.Pt) && !(this.Pt & d && e.ge & a))) this.ft.delete(e);
     }
     if (!this.ft.size) {
-      if (this.vt & a && this.lt && !this.gt && this.Pt) {
-        this.lt = !!(this.Pt.ye & this.vt);
+      if (this.Pt & a && this.lt && !this.gt && this.kt) {
+        this.lt = !!(this.kt.ge & this.Pt);
       } else {
         this.lt = false;
       }
       if (!this.lt) {
         setSignal(this.ct, false);
-        if (this.kt) {
+        if (this.Et) {
           try {
-            this.Et = untrack(() => this.kt());
+            this.Ct = untrack(() => this.Et());
           } catch {}
         }
       }
     }
-    if (Se) this.yt?.evaluate();
+    if (we) this.yt?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, r) {
   const i = createOwner();
-  if (Se) setContext(ge, null, i);
+  if (we) setContext(Se, null, i);
   const s = new CollectionQueue(e);
-  if (r) s.kt = r;
-  const o = (s.Pt = createBoundChildren(i, t, s, e));
+  if (r) s.Et = r;
+  const o = (s.kt = createBoundChildren(i, t, s, e));
   untrack(() => {
     let t = false;
     try {
@@ -3240,9 +3336,9 @@ function createCollectionBoundary(e, t, n, r) {
       if (e instanceof NotReadyError) t = true;
       else throw e;
     }
-    s.lt = t || !!(o.ye & e) || o.ae instanceof NotReadyError;
+    s.lt = t || !!(o.ge & e) || o.de instanceof NotReadyError;
   });
-  const u = Se && e === a ? getContext(ge) : null;
+  const u = we && e === a ? getContext(Se) : null;
   if (u) {
     s.yt = u;
     u.register(s);
@@ -3253,7 +3349,7 @@ function createCollectionBoundary(e, t, n, r) {
       const e = read(o);
       if (!untrack(() => read(s.ct))) return ((s.gt = true), e);
     }
-    if (Se && read(s.dt)) return undefined;
+    if (we && read(s.dt)) return undefined;
     return n(s);
   });
   return accessor(f);
@@ -3264,7 +3360,7 @@ function createLoadingBoundary(e, t, n) {
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(d, e, e => {
     let n = e.ft.values().next().value;
-    const r = n.ae?.cause ?? n.ae;
+    const r = n.de?.cause ?? n.de;
     return t(r, () => {
       for (const t of e.ft) recompute(t);
       schedule();
@@ -3272,13 +3368,13 @@ function createErrorBoundary(e, t) {
   });
 }
 function createRevealOrder(e, t) {
-  Se = true;
+  we = true;
   const n = createOwner();
-  const r = getContext(ge);
-  const i = t?.together || FALSE_ACCESSOR,
+  const r = getContext(Se);
+  const i = t?.order || SEQUENTIAL_ACCESSOR,
     s = t?.collapsed || FALSE_ACCESSOR;
   const o = new RevealController(i, s);
-  setContext(ge, o, n);
+  setContext(Se, o, n);
   return runWithOwner(n, () => {
     const t = e();
     computed(() => {
@@ -3343,13 +3439,13 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-const we = undefined;
-exports.$PROXY = J;
+const me = undefined;
+exports.$PROXY = X;
 exports.$REFRESH = O;
-exports.$TARGET = U;
-exports.$TRACK = z;
+exports.$TARGET = J;
+exports.$TRACK = U;
 exports.ContextNotFoundError = ContextNotFoundError;
-exports.DEV = we;
+exports.DEV = me;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
 exports.SUPPORTS_PROXY = b;
@@ -3402,5 +3498,5 @@ exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
 exports.snapshot = snapshot;
-exports.storePath = ae;
+exports.storePath = de;
 exports.untrack = untrack;