@solidjs/signals 0.13.9 → 0.13.10

package/dist/prod.js

@@ -103,13 +103,13 @@ function markNode(e, t = REACTIVE_DIRTY) {
   const n = e.O;
   if ((n & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= t) return;
   e.O = (n & -4) | t;
-  for (let t = e.I; t !== null; t = t.p) {
-    markNode(t.h, REACTIVE_CHECK);
+  for (let t = e.h; t !== null; t = t.I) {
+    markNode(t.p, REACTIVE_CHECK);
   }
   if (e.A !== null) {
     for (let t = e.A; t !== null; t = t.N) {
-      for (let e = t.I; e !== null; e = e.p) {
-        markNode(e.h, REACTIVE_CHECK);
+      for (let e = t.h; e !== null; e = e.I) {
+        markNode(e.p, REACTIVE_CHECK);
       }
     }
   }
@@ -136,11 +136,53 @@ function adjustHeight(e, t) {
   }
   if (e.o !== n) {
     e.o = n;
-    for (let n = e.I; n !== null; n = n.p) {
-      insertIntoHeapHeight(n.h, t);
+    for (let n = e.h; n !== null; n = n.I) {
+      insertIntoHeapHeight(n.p, t);
     }
   }
 }
+const hooks = {};
+const DEV = {
+  hooks: hooks,
+  getChildren: getChildren,
+  getSignals: getSignals,
+  getParent: getParent,
+  getSources: getSources,
+  getObservers: getObservers
+};
+function getChildren(e) {
+  const t = [];
+  let n = e.U;
+  while (n) {
+    t.push(n);
+    n = n.k;
+  }
+  return t;
+}
+function getSignals(e) {
+  return e.G ? [...e.G] : [];
+}
+function getParent(e) {
+  return e.i;
+}
+function getSources(e) {
+  const t = [];
+  let n = e.C;
+  while (n) {
+    t.push(n.m);
+    n = n.D;
+  }
+  return t;
+}
+function getObservers(e) {
+  const t = [];
+  let n = e.h;
+  while (n) {
+    t.push(n.p);
+    n = n.I;
+  }
+  return t;
+}
 const transitions = new Set();
 const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, P: 0, R: 0 };
 const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, P: 0, R: 0 };
@@ -155,22 +197,22 @@ function shouldReadStashedOptimisticValue(e) {
 }
 function runLaneEffects(e) {
   for (const t of activeLanes) {
-    if (t.U || t.k.size > 0) continue;
-    const n = t.G[e - 1];
+    if (t.W || t.H.size > 0) continue;
+    const n = t.F[e - 1];
     if (n.length) {
-      t.G[e - 1] = [];
+      t.F[e - 1] = [];
       runQueue(n, e);
     }
   }
 }
 function queueStashedOptimisticEffects(e) {
-  for (let t = e.I; t !== null; t = t.p) {
-    const e = t.h;
-    if (!e.W) continue;
-    if (e.W === EFFECT_TRACKED) {
-      if (!e.H) {
-        e.H = true;
-        e.F.enqueue(EFFECT_USER, e.M);
+  for (let t = e.h; t !== null; t = t.I) {
+    const e = t.p;
+    if (!e.M) continue;
+    if (e.M === EFFECT_TRACKED) {
+      if (!e.$) {
+        e.$ = true;
+        e.j.enqueue(EFFECT_USER, e.K);
       }
       continue;
     }
@@ -183,66 +225,66 @@ function setProjectionWriteActive(e) {
   projectionWriteActive = e;
 }
 function mergeTransitionState(e, t) {
-  t.$ = e;
-  e.j.push(...t.j);
+  t.Y = e;
+  e.Z.push(...t.Z);
   for (const n of activeLanes) {
-    if (n.K === t) n.K = e;
+    if (n.B === t) n.B = e;
   }
-  e.Y.push(...t.Y);
-  for (const n of t.Z) e.Z.add(n);
-  for (const n of t.B) {
-    if (!e.B.includes(n)) e.B.push(n);
+  e.q.push(...t.q);
+  for (const n of t.X) e.X.add(n);
+  for (const n of t.J) {
+    if (!e.J.includes(n)) e.J.push(n);
   }
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.q = undefined;
-    if (n.X !== NOT_PENDING) {
-      n.J = n.X;
-      n.X = NOT_PENDING;
+    n.ee = undefined;
+    if (n.te !== NOT_PENDING) {
+      n.ne = n.te;
+      n.te = NOT_PENDING;
     }
-    const i = n.ee;
-    n.ee = NOT_PENDING;
-    if (i !== NOT_PENDING && n.J !== i) insertSubs(n, true);
-    n.K = null;
+    const i = n.ie;
+    n.ie = NOT_PENDING;
+    if (i !== NOT_PENDING && n.ne !== i) insertSubs(n, true);
+    n.B = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
   for (const t of activeLanes) {
-    const n = e ? t.K === e : !t.K;
+    const n = e ? t.B === e : !t.B;
     if (!n) continue;
-    if (!t.U) {
-      if (t.G[0].length) runQueue(t.G[0], EFFECT_RENDER);
-      if (t.G[1].length) runQueue(t.G[1], EFFECT_USER);
-    }
-    if (t.te.q === t) t.te.q = undefined;
-    t.k.clear();
-    t.G[0].length = 0;
-    t.G[1].length = 0;
+    if (!t.W) {
+      if (t.F[0].length) runQueue(t.F[0], EFFECT_RENDER);
+      if (t.F[1].length) runQueue(t.F[1], EFFECT_USER);
+    }
+    if (t.re.ee === t) t.re.ee = undefined;
+    t.H.clear();
+    t.F[0].length = 0;
+    t.F[1].length = 0;
     activeLanes.delete(t);
-    signalLanes.delete(t.te);
+    signalLanes.delete(t.re);
   }
 }
 function schedule() {
   if (scheduled) return;
   scheduled = true;
-  if (!globalQueue.ne && !projectionWriteActive) queueMicrotask(flush);
+  if (!globalQueue.se && !projectionWriteActive) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  ie = [[], []];
-  re = [];
+  oe = [[], []];
+  ue = [];
   created = clock;
   addChild(e) {
-    this.re.push(e);
+    this.ue.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.re.indexOf(e);
+    const t = this.ue.indexOf(e);
     if (t >= 0) {
-      this.re.splice(t, 1);
+      this.ue.splice(t, 1);
       e.i = null;
     }
   }
@@ -251,81 +293,81 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.ie[e - 1].length) {
-      const t = this.ie[e - 1];
-      this.ie[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.re.length; t++) this.re[t].run?.(e);
+    for (let t = 0; t < this.ue.length; t++) this.ue[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
       if (currentOptimisticLane) {
         const n = findLane(currentOptimisticLane);
-        n.G[e - 1].push(t);
+        n.F[e - 1].push(t);
       } else {
-        this.ie[e - 1].push(t);
+        this.oe[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.ie[0].push(...this.ie[0]);
-    e.ie[1].push(...this.ie[1]);
-    this.ie = [[], []];
-    for (let t = 0; t < this.re.length; t++) {
-      let n = this.re[t];
-      let i = e.re[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 i = e.ue[t];
       if (!i) {
-        i = { ie: [[], []], re: [] };
-        e.re[t] = i;
+        i = { oe: [[], []], ue: [] };
+        e.ue[t] = i;
       }
       n.stashQueues(i);
     }
   }
   restoreQueues(e) {
-    this.ie[0].push(...e.ie[0]);
-    this.ie[1].push(...e.ie[1]);
-    for (let t = 0; t < e.re.length; t++) {
-      const n = e.re[t];
-      let i = this.re[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 i = this.ue[t];
       if (i) i.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  ne = false;
-  se = [];
-  Y = [];
-  Z = new Set();
-  static oe;
-  static ue;
-  static ce = null;
+  se = false;
+  ce = [];
+  q = [];
+  X = new Set();
+  static ae;
+  static le;
+  static fe = null;
   flush() {
-    if (this.ne) return;
-    this.ne = true;
+    if (this.se) return;
+    this.se = true;
     try {
-      runHeap(dirtyQueue, GlobalQueue.oe);
+      runHeap(dirtyQueue, GlobalQueue.ae);
       if (activeTransition) {
         const e = transitionComplete(activeTransition);
         if (!e) {
           const e = activeTransition;
-          runHeap(zombieQueue, GlobalQueue.oe);
-          this.se = [];
-          this.Y = [];
-          this.Z = new Set();
+          runHeap(zombieQueue, GlobalQueue.ae);
+          this.ce = [];
+          this.q = [];
+          this.X = new Set();
           runLaneEffects(EFFECT_RENDER);
           runLaneEffects(EFFECT_USER);
-          this.stashQueues(e.ae);
+          this.stashQueues(e.Ee);
           clock++;
           scheduled = dirtyQueue.R >= dirtyQueue.P;
-          reassignPendingTransition(e.se);
+          reassignPendingTransition(e.ce);
           activeTransition = null;
-          if (!e.j.length && e.Y.length) {
+          if (!e.Z.length && e.q.length) {
             stashedOptimisticReads = new Set();
-            for (let t = 0; t < e.Y.length; t++) {
-              const n = e.Y[t];
-              if (n.L || n.fe) continue;
+            for (let t = 0; t < e.q.length; t++) {
+              const n = e.q[t];
+              if (n.L || n.de) continue;
               stashedOptimisticReads.add(n);
               queueStashedOptimisticEffects(n);
             }
@@ -337,15 +379,15 @@ class GlobalQueue extends Queue {
           }
           return;
         }
-        this.se !== activeTransition.se && this.se.push(...activeTransition.se);
-        this.restoreQueues(activeTransition.ae);
+        this.ce !== activeTransition.ce && this.ce.push(...activeTransition.ce);
+        this.restoreQueues(activeTransition.Ee);
         transitions.delete(activeTransition);
         const t = activeTransition;
         activeTransition = null;
-        reassignPendingTransition(this.se);
+        reassignPendingTransition(this.ce);
         finalizePureQueue(t);
       } else {
-        if (transitions.size) runHeap(zombieQueue, GlobalQueue.oe);
+        if (transitions.size) runHeap(zombieQueue, GlobalQueue.ae);
         finalizePureQueue();
       }
       clock++;
@@ -354,18 +396,19 @@ class GlobalQueue extends Queue {
       this.run(EFFECT_RENDER);
       runLaneEffects(EFFECT_USER);
       this.run(EFFECT_USER);
+      if (false);
     } finally {
-      this.ne = false;
+      this.se = false;
     }
   }
   notify(e, t, n, i) {
     if (t & STATUS_PENDING) {
       if (n & STATUS_PENDING) {
-        const t = i !== undefined ? i : e.le;
+        const t = i !== undefined ? i : e.Te;
         if (activeTransition && t) {
           const e = t.source;
-          if (!activeTransition.B.includes(e)) {
-            activeTransition.B.push(e);
+          if (!activeTransition.J.includes(e)) {
+            activeTransition.J.push(e);
             schedule();
           }
         }
@@ -377,17 +420,17 @@ class GlobalQueue extends Queue {
   initTransition(e) {
     if (e) e = currentTransition(e);
     if (e && e === activeTransition) return;
-    if (!e && activeTransition && activeTransition.Ee === clock) return;
+    if (!e && activeTransition && activeTransition.Se === clock) return;
     if (!activeTransition) {
       activeTransition = e ?? {
-        Ee: clock,
-        se: [],
-        B: [],
-        Y: [],
-        Z: new Set(),
-        j: [],
-        ae: { ie: [[], []], re: [] },
-        $: false
+        Se: clock,
+        ce: [],
+        J: [],
+        q: [],
+        X: new Set(),
+        Z: [],
+        Ee: { oe: [[], []], ue: [] },
+        Y: false
       };
     } else if (e) {
       const t = activeTransition;
@@ -396,71 +439,71 @@ class GlobalQueue extends Queue {
       activeTransition = e;
     }
     transitions.add(activeTransition);
-    activeTransition.Ee = clock;
-    if (this.se !== activeTransition.se) {
-      for (let e = 0; e < this.se.length; e++) {
-        const t = this.se[e];
-        t.K = activeTransition;
-        activeTransition.se.push(t);
+    activeTransition.Se = clock;
+    if (this.ce !== activeTransition.ce) {
+      for (let e = 0; e < this.ce.length; e++) {
+        const t = this.ce[e];
+        t.B = activeTransition;
+        activeTransition.ce.push(t);
       }
-      this.se = activeTransition.se;
+      this.ce = activeTransition.ce;
     }
-    if (this.Y !== activeTransition.Y) {
-      for (let e = 0; e < this.Y.length; e++) {
-        const t = this.Y[e];
-        t.K = activeTransition;
-        activeTransition.Y.push(t);
+    if (this.q !== activeTransition.q) {
+      for (let e = 0; e < this.q.length; e++) {
+        const t = this.q[e];
+        t.B = activeTransition;
+        activeTransition.q.push(t);
       }
-      this.Y = activeTransition.Y;
+      this.q = activeTransition.q;
     }
     for (const e of activeLanes) {
-      if (!e.K) e.K = activeTransition;
+      if (!e.B) e.B = activeTransition;
     }
-    if (this.Z !== activeTransition.Z) {
-      for (const e of this.Z) activeTransition.Z.add(e);
-      this.Z = activeTransition.Z;
+    if (this.X !== activeTransition.X) {
+      for (const e of this.X) activeTransition.X.add(e);
+      this.X = activeTransition.X;
     }
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.q || currentOptimisticLane;
-  const i = e.Te !== undefined;
-  for (let r = e.I; r !== null; r = r.p) {
-    if (i && r.h.de) {
-      r.h.O |= REACTIVE_SNAPSHOT_STALE;
+  const n = e.ee || currentOptimisticLane;
+  const i = e.Re !== undefined;
+  for (let r = e.h; r !== null; r = r.I) {
+    if (i && r.p.Oe) {
+      r.p.O |= REACTIVE_SNAPSHOT_STALE;
       continue;
     }
     if (t && n) {
-      r.h.O |= REACTIVE_OPTIMISTIC_DIRTY;
-      assignOrMergeLane(r.h, n);
+      r.p.O |= REACTIVE_OPTIMISTIC_DIRTY;
+      assignOrMergeLane(r.p, n);
     } else if (t) {
-      r.h.O |= REACTIVE_OPTIMISTIC_DIRTY;
-      r.h.q = undefined;
+      r.p.O |= REACTIVE_OPTIMISTIC_DIRTY;
+      r.p.ee = undefined;
     }
-    const e = r.h;
-    if (e.W === EFFECT_TRACKED) {
-      if (!e.H) {
-        e.H = true;
-        e.F.enqueue(EFFECT_USER, e.M);
+    const e = r.p;
+    if (e.M === EFFECT_TRACKED) {
+      if (!e.$) {
+        e.$ = true;
+        e.j.enqueue(EFFECT_USER, e.K);
       }
       continue;
     }
-    const s = r.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (s.P > r.h.o) s.P = r.h.o;
-    insertIntoHeap(r.h, s);
+    const s = r.p.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+    if (s.P > r.p.o) s.P = r.p.o;
+    insertIntoHeap(r.p, s);
   }
 }
 function commitPendingNodes() {
-  const e = globalQueue.se;
+  const e = globalQueue.ce;
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    if (n.X !== NOT_PENDING) {
-      n.J = n.X;
-      n.X = NOT_PENDING;
-      if (n.W && n.W !== EFFECT_TRACKED) n.H = true;
+    if (n.te !== NOT_PENDING) {
+      n.ne = n.te;
+      n.te = NOT_PENDING;
+      if (n.M && n.M !== EFFECT_TRACKED) n.$ = true;
     }
-    if (!(n.Se & STATUS_PENDING)) n.Se &= ~STATUS_UNINITIALIZED;
-    if (n.L) GlobalQueue.ue(n, false, true);
+    if (!(n._e & STATUS_PENDING)) n._e &= ~STATUS_UNINITIALIZED;
+    if (n.L) GlobalQueue.le(n, false, true);
   }
   e.length = 0;
 }
@@ -468,14 +511,14 @@ function finalizePureQueue(e = null, t = false) {
   const n = !t;
   if (n) commitPendingNodes();
   if (!t) checkBoundaryChildren(globalQueue);
-  if (dirtyQueue.R >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.oe);
+  if (dirtyQueue.R >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.ae);
   if (n) {
     commitPendingNodes();
-    resolveOptimisticNodes(e ? e.Y : globalQueue.Y);
-    const t = e ? e.Z : globalQueue.Z;
-    if (GlobalQueue.ce && t.size) {
+    resolveOptimisticNodes(e ? e.q : globalQueue.q);
+    const t = e ? e.X : globalQueue.X;
+    if (GlobalQueue.fe && t.size) {
       for (const e of t) {
-        GlobalQueue.ce(e);
+        GlobalQueue.fe(e);
       }
       t.clear();
       schedule();
@@ -484,23 +527,23 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.re) {
+  for (const t of e.ue) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  globalQueue.Z.add(e);
+  globalQueue.X.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].K = activeTransition;
+    e[t].B = activeTransition;
   }
 }
 const globalQueue = new GlobalQueue();
 function flush() {
-  if (globalQueue.ne) {
+  if (globalQueue.se) {
     return;
   }
   while (scheduled || activeTransition) {
@@ -511,36 +554,36 @@ function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function transitionComplete(e) {
-  if (e.$) return true;
-  if (e.j.length) return false;
+  if (e.Y) return true;
+  if (e.Z.length) return false;
   let t = true;
-  for (let n = 0; n < e.B.length; n++) {
-    const i = e.B[n];
-    if (i.Se & STATUS_PENDING && i.le?.source === i) {
+  for (let n = 0; n < e.J.length; n++) {
+    const i = e.J[n];
+    if (i._e & STATUS_PENDING && i.Te?.source === i) {
       t = false;
       break;
     }
   }
   if (t) {
-    for (let n = 0; n < e.Y.length; n++) {
-      const i = e.Y[n];
+    for (let n = 0; n < e.q.length; n++) {
+      const i = e.q[n];
       if (
         hasActiveOverride(i) &&
-        "Se" in i &&
-        i.Se & STATUS_PENDING &&
-        i.le instanceof NotReadyError &&
-        i.le.source !== i
+        "_e" in i &&
+        i._e & STATUS_PENDING &&
+        i.Te instanceof NotReadyError &&
+        i.Te.source !== i
       ) {
         t = false;
         break;
       }
     }
   }
-  t && (e.$ = true);
+  t && (e.Y = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.$ && typeof e.$ === "object") e = e.$;
+  while (e.Y && typeof e.Y === "object") e = e.Y;
   return e;
 }
 function setActiveTransition(e) {
@@ -562,76 +605,76 @@ function getOrCreateLane(e) {
   if (t) {
     return findLane(t);
   }
-  const n = e.Re;
-  const i = n?.q ? findLane(n.q) : null;
-  t = { te: e, k: new Set(), G: [[], []], U: null, K: activeTransition, Oe: i };
+  const n = e.he;
+  const i = n?.ee ? findLane(n.ee) : null;
+  t = { re: e, H: new Set(), F: [[], []], W: null, B: activeTransition, Ie: i };
   signalLanes.set(e, t);
   activeLanes.add(t);
-  e._e = false;
+  e.pe = false;
   return t;
 }
 function findLane(e) {
-  while (e.U) e = e.U;
+  while (e.W) e = e.W;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.U = e;
-  for (const n of t.k) e.k.add(n);
-  e.G[0].push(...t.G[0]);
-  e.G[1].push(...t.G[1]);
+  t.W = e;
+  for (const n of t.H) e.H.add(n);
+  e.F[0].push(...t.F[0]);
+  e.F[1].push(...t.F[1]);
   return e;
 }
 function resolveLane(e) {
-  const t = e.q;
+  const t = e.ee;
   if (!t) return undefined;
   const n = findLane(t);
   if (activeLanes.has(n)) return n;
-  e.q = undefined;
+  e.ee = undefined;
   return undefined;
 }
 function resolveTransition(e) {
-  return resolveLane(e)?.K ?? e.K;
+  return resolveLane(e)?.B ?? e.B;
 }
 function hasActiveOverride(e) {
-  return !!(e.ee !== undefined && e.ee !== NOT_PENDING);
+  return !!(e.ie !== undefined && e.ie !== NOT_PENDING);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const i = e.q;
+  const i = e.ee;
   if (i) {
-    if (i.U) {
-      e.q = t;
+    if (i.W) {
+      e.ee = t;
       return;
     }
     const r = findLane(i);
     if (activeLanes.has(r)) {
       if (r !== n && !hasActiveOverride(e)) {
-        if (n.Oe && findLane(n.Oe) === r) {
-          e.q = t;
-        } else if (r.Oe && findLane(r.Oe) === n);
+        if (n.Ie && findLane(n.Ie) === r) {
+          e.ee = t;
+        } else if (r.Ie && findLane(r.Ie) === n);
         else mergeLanes(n, r);
       }
       return;
     }
   }
-  e.q = t;
+  e.ee = t;
 }
 function unlinkSubs(e) {
   const t = e.m;
   const n = e.D;
-  const i = e.p;
-  const r = e.Ie;
-  if (i !== null) i.Ie = r;
-  else t.pe = r;
-  if (r !== null) r.p = i;
+  const i = e.I;
+  const r = e.Ae;
+  if (i !== null) i.Ae = r;
+  else t.ge = r;
+  if (r !== null) r.I = i;
   else {
-    t.I = i;
+    t.h = i;
     if (i === null) {
-      t.he?.();
-      t.L && !t.Ae && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
+      t.Ne?.();
+      t.L && !t.Pe && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
     }
   }
   return n;
@@ -646,27 +689,27 @@ function unobserved(e) {
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.Ne;
+  const n = t.Ce;
   if (n !== null && n.m === e) return;
   let i = null;
   const r = t.O & REACTIVE_RECOMPUTING_DEPS;
   if (r) {
     i = n !== null ? n.D : t.C;
     if (i !== null && i.m === e) {
-      t.Ne = i;
+      t.Ce = i;
       return;
     }
   }
-  const s = e.pe;
-  if (s !== null && s.h === t && (!r || isValidLink(s, t))) return;
-  const o = (t.Ne = e.pe = { m: e, h: t, D: i, Ie: s, p: null });
+  const s = e.ge;
+  if (s !== null && s.p === t && (!r || isValidLink(s, t))) return;
+  const o = (t.Ce = e.ge = { m: e, p: t, D: i, Ae: s, I: null });
   if (n !== null) n.D = o;
   else t.C = o;
-  if (s !== null) s.p = o;
-  else e.I = o;
+  if (s !== null) s.I = o;
+  else e.h = o;
 }
 function isValidLink(e, t) {
-  const n = t.Ne;
+  const n = t.Ce;
   if (n !== null) {
     let i = t.C;
     do {
@@ -679,7 +722,7 @@ function isValidLink(e, t) {
 }
 const PENDING_OWNER = {};
 function markDisposal(e) {
-  let t = e.Pe;
+  let t = e.U;
   while (t) {
     t.O |= REACTIVE_ZOMBIE;
     if (t.O & REACTIVE_IN_HEAP) {
@@ -687,7 +730,7 @@ function markDisposal(e) {
       insertIntoHeap(t, zombieQueue);
     }
     markDisposal(t);
-    t = t.ge;
+    t = t.k;
   }
 }
 function dispose(e) {
@@ -696,16 +739,16 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.C = null;
-  e.Ne = null;
+  e.Ce = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.O & REACTIVE_DISPOSED) return;
   if (t) e.O = REACTIVE_DISPOSED;
-  if (t && e.L) e.Ce = null;
-  let i = n ? e.De : e.Pe;
+  if (t && e.L) e.De = null;
+  let i = n ? e.ye : e.U;
   while (i) {
-    const e = i.ge;
+    const e = i.k;
     if (i.C) {
       const e = i;
       deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
@@ -714,21 +757,21 @@ function disposeChildren(e, t = false, n) {
         t = unlinkSubs(t);
       } while (t !== null);
       e.C = null;
-      e.Ne = null;
+      e.Ce = null;
     }
     disposeChildren(i, true);
     i = e;
   }
   if (n) {
-    e.De = null;
+    e.ye = null;
   } else {
-    e.Pe = null;
-    e.ye = 0;
+    e.U = null;
+    e.ve = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.ve : e.me;
+  let n = t ? e.me : e.we;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -738,12 +781,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.ve = null) : (e.me = null);
+  t ? (e.me = null) : (e.we = null);
 }
 function childId(e, t) {
   let n = e;
   while (n.Ve && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.ye++ : n.ye);
+  if (n.id != null) return formatId(n.id, t ? n.ve++ : n.ve);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -766,9 +809,9 @@ function getOwner() {
 }
 function cleanup(e) {
   if (!context) return e;
-  if (!context.me) context.me = e;
-  else if (Array.isArray(context.me)) context.me.push(e);
-  else context.me = [context.me, e];
+  if (!context.we) context.we = e;
+  else if (Array.isArray(context.we)) context.we.push(e);
+  else context.we = [context.we, e];
   return e;
 }
 function isDisposed(e) {
@@ -782,26 +825,26 @@ function createOwner(e) {
     Ve: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    Pe: null,
-    ge: null,
+    U: null,
+    k: null,
+    we: null,
+    j: t?.j ?? globalQueue,
+    be: t?.be || defaultContext,
+    ve: 0,
     me: null,
-    F: t?.F ?? globalQueue,
-    we: t?.we || defaultContext,
-    ye: 0,
-    ve: null,
-    De: null,
+    ye: null,
     i: t,
     dispose(e = true) {
       disposeChildren(i, e);
     }
   };
   if (t) {
-    const e = t.Pe;
+    const e = t.U;
     if (e === null) {
-      t.Pe = i;
+      t.U = i;
     } else {
-      i.ge = e;
-      t.Pe = i;
+      i.k = e;
+      t.U = i;
     }
   }
   return i;
@@ -811,57 +854,57 @@ function createRoot(e, t) {
   return runWithOwner(n, () => e(n.dispose));
 }
 function addPendingSource(e, t) {
-  if (e.be === t || e.Le?.has(t)) return false;
-  if (!e.be) {
-    e.be = t;
+  if (e.Le === t || e.Ue?.has(t)) return false;
+  if (!e.Le) {
+    e.Le = t;
     return true;
   }
-  if (!e.Le) {
-    e.Le = new Set([e.be, t]);
+  if (!e.Ue) {
+    e.Ue = new Set([e.Le, t]);
   } else {
-    e.Le.add(t);
+    e.Ue.add(t);
   }
-  e.be = undefined;
+  e.Le = undefined;
   return true;
 }
 function removePendingSource(e, t) {
-  if (e.be) {
-    if (e.be !== t) return false;
-    e.be = undefined;
+  if (e.Le) {
+    if (e.Le !== t) return false;
+    e.Le = undefined;
     return true;
   }
-  if (!e.Le?.delete(t)) return false;
-  if (e.Le.size === 1) {
-    e.be = e.Le.values().next().value;
-    e.Le = undefined;
-  } else if (e.Le.size === 0) {
-    e.Le = undefined;
+  if (!e.Ue?.delete(t)) return false;
+  if (e.Ue.size === 1) {
+    e.Le = e.Ue.values().next().value;
+    e.Ue = undefined;
+  } else if (e.Ue.size === 0) {
+    e.Ue = undefined;
   }
   return true;
 }
 function clearPendingSources(e) {
-  e.be = undefined;
-  e.Le?.clear();
   e.Le = undefined;
+  e.Ue?.clear();
+  e.Ue = undefined;
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.le = null;
+    e.Te = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.le = n;
+    e.Te = n;
     return;
   }
-  const i = e.le;
+  const i = e.Te;
   if (!(i instanceof NotReadyError) || i.source !== t) {
-    e.le = new NotReadyError(t);
+    e.Te = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
-  for (let n = e.I; n !== null; n = n.p) t(n.h);
+  for (let n = e.h; n !== null; n = n.I) t(n.p);
   for (let n = e.A; n !== null; n = n.N) {
-    for (let e = n.I; e !== null; e = e.p) t(e.h);
+    for (let e = n.h; e !== null; e = e.I) t(e.p);
   }
 }
 function settlePendingSource(e) {
@@ -870,21 +913,21 @@ function settlePendingSource(e) {
   const settle = i => {
     if (n.has(i) || !removePendingSource(i, e)) return;
     n.add(i);
-    i.Ee = clock;
-    const r = i.be ?? i.Le?.values().next().value;
+    i.Se = clock;
+    const r = i.Le ?? i.Ue?.values().next().value;
     if (r) {
       setPendingError(i, r);
       updatePendingSignal(i);
     } else {
-      i.Se &= ~STATUS_PENDING;
+      i._e &= ~STATUS_PENDING;
       setPendingError(i);
       updatePendingSignal(i);
-      if (i.Ue) {
-        if (i.W === EFFECT_TRACKED) {
+      if (i.ke) {
+        if (i.M === EFFECT_TRACKED) {
           const e = i;
-          if (!e.H) {
-            e.H = true;
-            e.F.enqueue(EFFECT_USER, e.M);
+          if (!e.$) {
+            e.$ = true;
+            e.j.enqueue(EFFECT_USER, e.K);
           }
         } else {
           const e = i.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
@@ -893,7 +936,7 @@ function settlePendingSource(e) {
         }
         t = true;
       }
-      i.Ue = false;
+      i.ke = false;
     }
     forEachDependent(i, settle);
   };
@@ -905,38 +948,38 @@ function handleAsync(e, t, n) {
   const r = i && untrack(() => t[Symbol.asyncIterator]);
   const s = !r && i && untrack(() => typeof t.then === "function");
   if (!s && !r) {
-    e.Ce = null;
+    e.De = null;
     return t;
   }
-  e.Ce = t;
+  e.De = t;
   let o;
   const handleError = n => {
-    if (e.Ce !== t) return;
+    if (e.De !== t) return;
     globalQueue.initTransition(resolveTransition(e));
     notifyStatus(e, n instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n);
-    e.Ee = clock;
+    e.Se = clock;
   };
   const asyncWrite = (i, r) => {
-    if (e.Ce !== t) return;
+    if (e.De !== t) return;
     if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
     globalQueue.initTransition(resolveTransition(e));
     clearStatus(e);
     const s = resolveLane(e);
-    if (s) s.k.delete(e);
+    if (s) s.H.delete(e);
     if (n) n(i);
-    else if (e.ee !== undefined) {
-      if (e.ee !== undefined && e.ee !== NOT_PENDING) e.X = i;
+    else if (e.ie !== undefined) {
+      if (e.ie !== undefined && e.ie !== NOT_PENDING) e.te = i;
       else {
-        e.J = i;
+        e.ne = i;
         insertSubs(e);
       }
-      e.Ee = clock;
+      e.Se = clock;
     } else if (s) {
-      const t = e.J;
-      const n = e.ke;
+      const t = e.ne;
+      const n = e.xe;
       if (!n || !n(i, t)) {
-        e.J = i;
-        e.Ee = clock;
+        e.ne = i;
+        e.Se = clock;
         if (e.Ge) {
           setSignal(e.Ge, i);
         }
@@ -994,7 +1037,7 @@ function handleAsync(e, t, n) {
             s = n;
             u = true;
             if (n.done) r = true;
-          } else if (e.Ce !== t) {
+          } else if (e.De !== t) {
             return;
           } else if (!n.done) asyncWrite(n.value, iterate);
           else {
@@ -1004,7 +1047,7 @@ function handleAsync(e, t, n) {
           }
         },
         n => {
-          if (!c && e.Ce === t) {
+          if (!c && e.De === t) {
             r = true;
             handleError(n);
           }
@@ -1028,28 +1071,28 @@ function handleAsync(e, t, n) {
 }
 function clearStatus(e, t = false) {
   clearPendingSources(e);
-  e.Ue = false;
-  e.Se = t ? 0 : e.Se & STATUS_UNINITIALIZED;
+  e.ke = false;
+  e._e = t ? 0 : e._e & STATUS_UNINITIALIZED;
   setPendingError(e);
   updatePendingSignal(e);
-  e.xe?.();
+  e.We?.();
 }
 function notifyStatus(e, t, n, i, r) {
   if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const s = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
   const o = s === e;
-  const u = t === STATUS_PENDING && e.ee !== undefined && !o;
+  const u = t === STATUS_PENDING && e.ie !== undefined && !o;
   const c = u && hasActiveOverride(e);
   if (!i) {
     if (t === STATUS_PENDING && s) {
       addPendingSource(e, s);
-      e.Se = STATUS_PENDING | (e.Se & STATUS_UNINITIALIZED);
+      e._e = STATUS_PENDING | (e._e & STATUS_UNINITIALIZED);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.Se = t | (t !== STATUS_ERROR ? e.Se & STATUS_UNINITIALIZED : 0);
-      e.le = n;
+      e._e = t | (t !== STATUS_ERROR ? e._e & STATUS_UNINITIALIZED : 0);
+      e.Te = n;
     }
     updatePendingSignal(e);
   }
@@ -1057,26 +1100,26 @@ function notifyStatus(e, t, n, i, r) {
     assignOrMergeLane(e, r);
   }
   const a = i || c;
-  const f = i || u ? undefined : r;
-  if (e.xe) {
+  const l = i || u ? undefined : r;
+  if (e.We) {
     if (i && t === STATUS_PENDING) {
       return;
     }
     if (a) {
-      e.xe(t, n);
+      e.We(t, n);
     } else {
-      e.xe();
+      e.We();
     }
     return;
   }
   forEachDependent(e, e => {
-    e.Ee = clock;
+    e.Se = clock;
     if (
-      (t === STATUS_PENDING && s && e.be !== s && !e.Le?.has(s)) ||
-      (t !== STATUS_PENDING && (e.le !== n || e.be || e.Le))
+      (t === STATUS_PENDING && s && e.Le !== s && !e.Ue?.has(s)) ||
+      (t !== STATUS_PENDING && (e.Te !== n || e.Le || e.Ue))
     ) {
-      if (!a && !e.K) globalQueue.se.push(e);
-      notifyStatus(e, t, n, a, f);
+      if (!a && !e.B) globalQueue.ce.push(e);
+      notifyStatus(e, t, n, a, l);
     }
   });
 }
@@ -1103,8 +1146,8 @@ function enableExternalSource(e) {
     externalSourceConfig = { factory: t, untrack: n };
   }
 }
-GlobalQueue.oe = recompute;
-GlobalQueue.ue = disposeChildren;
+GlobalQueue.ae = recompute;
+GlobalQueue.le = disposeChildren;
 let tracking = false;
 let stale = false;
 let refreshing = false;
@@ -1117,7 +1160,7 @@ let snapshotCaptureActive = false;
 let snapshotSources = null;
 function ownerInSnapshotScope(e) {
   while (e) {
-    if (e.We) return true;
+    if (e.He) return true;
     e = e.i;
   }
   return false;
@@ -1127,23 +1170,23 @@ function setSnapshotCapture(e) {
   if (e && !snapshotSources) snapshotSources = new Set();
 }
 function markSnapshotScope(e) {
-  e.We = true;
+  e.He = true;
 }
 function releaseSnapshotScope(e) {
-  e.We = false;
+  e.He = false;
   releaseSubtree(e);
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.Pe;
+  let t = e.U;
   while (t) {
-    if (t.We) {
-      t = t.ge;
+    if (t.He) {
+      t = t.k;
       continue;
     }
     if (t.L) {
       const e = t;
-      e.de = false;
+      e.Oe = false;
       if (e.O & REACTIVE_SNAPSHOT_STALE) {
         e.O &= ~REACTIVE_SNAPSHOT_STALE;
         e.O |= REACTIVE_DIRTY;
@@ -1152,13 +1195,13 @@ function releaseSubtree(e) {
       }
     }
     releaseSubtree(t);
-    t = t.ge;
+    t = t.k;
   }
 }
 function clearSnapshots() {
   if (snapshotSources) {
     for (const e of snapshotSources) {
-      delete e.Te;
+      delete e.Re;
       delete e[STORE_SNAPSHOT_PROPS];
     }
     snapshotSources = null;
@@ -1166,34 +1209,34 @@ function clearSnapshots() {
   snapshotCaptureActive = false;
 }
 function recompute(e, t = false) {
-  const n = e.W;
+  const n = e.M;
   if (!t) {
-    if (e.K && (!n || activeTransition) && activeTransition !== e.K)
-      globalQueue.initTransition(e.K);
+    if (e.B && (!n || activeTransition) && activeTransition !== e.B)
+      globalQueue.initTransition(e.B);
     deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-    e.Ce = null;
-    if (e.K || n === EFFECT_TRACKED) disposeChildren(e);
+    e.De = null;
+    if (e.B || n === EFFECT_TRACKED) disposeChildren(e);
     else {
       markDisposal(e);
-      e.ve = e.me;
-      e.De = e.Pe;
-      e.me = null;
-      e.Pe = null;
-      e.ye = 0;
+      e.me = e.we;
+      e.ye = e.U;
+      e.we = null;
+      e.U = null;
+      e.ve = 0;
     }
   }
   const i = !!(e.O & REACTIVE_OPTIMISTIC_DIRTY);
-  const r = e.ee !== undefined && e.ee !== NOT_PENDING;
-  const s = !!(e.Se & STATUS_PENDING);
+  const r = e.ie !== undefined && e.ie !== NOT_PENDING;
+  const s = !!(e._e & STATUS_PENDING);
   const o = context;
   context = e;
-  e.Ne = null;
+  e.Ce = null;
   e.O = REACTIVE_RECOMPUTING_DEPS;
-  e.Ee = clock;
-  let u = e.X === NOT_PENDING ? e.J : e.X;
+  e.Se = clock;
+  let u = e.te === NOT_PENDING ? e.ne : e.te;
   let c = e.o;
   let a = tracking;
-  let f = currentOptimisticLane;
+  let l = currentOptimisticLane;
   tracking = true;
   if (i) {
     const t = resolveLane(e);
@@ -1204,33 +1247,33 @@ function recompute(e, t = false) {
     clearStatus(e, t);
     const n = resolveLane(e);
     if (n) {
-      n.k.delete(e);
-      updatePendingSignal(n.te);
+      n.H.delete(e);
+      updatePendingSignal(n.re);
     }
   } catch (t) {
     if (t instanceof NotReadyError && currentOptimisticLane) {
       const t = findLane(currentOptimisticLane);
-      if (t.te !== e) {
-        t.k.add(e);
-        e.q = t;
-        updatePendingSignal(t.te);
+      if (t.re !== e) {
+        t.H.add(e);
+        e.ee = t;
+        updatePendingSignal(t.re);
       }
     }
-    if (t instanceof NotReadyError) e.Ue = true;
+    if (t instanceof NotReadyError) e.ke = true;
     notifyStatus(
       e,
       t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
       t,
       undefined,
-      t instanceof NotReadyError ? e.q : undefined
+      t instanceof NotReadyError ? e.ee : undefined
     );
   } finally {
     tracking = a;
     e.O = REACTIVE_NONE | (t ? e.O & REACTIVE_SNAPSHOT_STALE : 0);
     context = o;
   }
-  if (!e.le) {
-    const o = e.Ne;
+  if (!e.Te) {
+    const o = e.Ce;
     let a = o !== null ? o.D : e.C;
     if (a !== null) {
       do {
@@ -1239,30 +1282,30 @@ function recompute(e, t = false) {
       if (o !== null) o.D = null;
       else e.C = null;
     }
-    const f = r ? e.ee : e.X === NOT_PENDING ? e.J : e.X;
-    const l = !e.ke || !e.ke(f, u);
-    if (l) {
-      const o = r ? e.ee : undefined;
-      if (t || (n && activeTransition !== e.K) || i) {
-        e.J = u;
+    const l = r ? e.ie : e.te === NOT_PENDING ? e.ne : e.te;
+    const f = !e.xe || !e.xe(l, u);
+    if (f) {
+      const o = r ? e.ie : undefined;
+      if (t || (n && activeTransition !== e.B) || i) {
+        e.ne = u;
         if (r && i) {
-          e.ee = u;
-          e.X = u;
+          e.ie = u;
+          e.te = u;
         }
-      } else e.X = u;
-      if (r && !i && s && !e._e) e.ee = u;
-      if (!r || i || e.ee !== o) insertSubs(e, i || r);
+      } else e.te = u;
+      if (r && !i && s && !e.pe) e.ie = u;
+      if (!r || i || e.ie !== o) insertSubs(e, i || r);
     } else if (r) {
-      e.X = u;
+      e.te = u;
     } else if (e.o != c) {
-      for (let t = e.I; t !== null; t = t.p) {
-        insertIntoHeapHeight(t.h, t.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+      for (let t = e.h; t !== null; t = t.I) {
+        insertIntoHeapHeight(t.p, t.p.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
       }
     }
   }
-  currentOptimisticLane = f;
-  (!t || e.Se & STATUS_PENDING) && !e.K && !(activeTransition && r) && globalQueue.se.push(e);
-  e.K && n && activeTransition !== e.K && runInTransition(e.K, () => recompute(e));
+  currentOptimisticLane = l;
+  (!t || e._e & STATUS_PENDING) && !e.B && !(activeTransition && r) && globalQueue.ce.push(e);
+  e.B && n && activeTransition !== e.B && runInTransition(e.B, () => recompute(e));
 }
 function updateIfNecessary(e) {
   if (e.O & REACTIVE_CHECK) {
@@ -1277,7 +1320,7 @@ function updateIfNecessary(e) {
       }
     }
   }
-  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.le && e.Ee < clock && !e.Ce)) {
+  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.Te && e.Se < clock && !e.De)) {
     recompute(e);
   }
   e.O = e.O & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
@@ -1287,48 +1330,48 @@ function computed(e, t, n) {
   const r = {
     id: n?.id ?? (i ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
     Ve: i || undefined,
-    ke: n?.equals != null ? n.equals : isEqual,
-    fe: !!n?.pureWrite,
-    he: n?.unobserved,
-    me: null,
-    F: context?.F ?? globalQueue,
-    we: context?.we ?? defaultContext,
-    ye: 0,
+    xe: n?.equals != null ? n.equals : isEqual,
+    de: !!n?.pureWrite,
+    Ne: n?.unobserved,
+    we: null,
+    j: context?.j ?? globalQueue,
+    be: context?.be ?? defaultContext,
+    ve: 0,
     L: e,
-    J: t,
+    ne: t,
     o: 0,
     A: null,
     S: undefined,
     T: null,
     C: null,
-    Ne: null,
-    I: null,
-    pe: null,
-    i: context,
+    Ce: null,
+    h: null,
     ge: null,
-    Pe: null,
+    i: context,
+    k: null,
+    U: null,
     O: n?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
-    Se: STATUS_UNINITIALIZED,
-    Ee: clock,
-    X: NOT_PENDING,
-    ve: null,
+    _e: STATUS_UNINITIALIZED,
+    Se: clock,
+    te: NOT_PENDING,
+    me: null,
+    ye: null,
     De: null,
-    Ce: null,
-    K: null
+    B: null
   };
   r.T = r;
   const s = context?.t ? context.u : context;
   if (context) {
-    const e = context.Pe;
+    const e = context.U;
     if (e === null) {
-      context.Pe = r;
+      context.U = r;
     } else {
-      r.ge = e;
-      context.Pe = r;
+      r.k = e;
+      context.U = r;
     }
   }
   if (s) r.o = s.o + 1;
-  if (snapshotCaptureActive && ownerInSnapshotScope(context)) r.de = true;
+  if (snapshotCaptureActive && ownerInSnapshotScope(context)) r.Oe = true;
   if (externalSourceConfig) {
     const e = signal(undefined, { equals: false, pureWrite: true });
     const t = externalSourceConfig.factory(r.L, () => {
@@ -1342,8 +1385,8 @@ function computed(e, t, n) {
   }
   !n?.lazy && recompute(r, true);
   if (snapshotCaptureActive && !n?.lazy) {
-    if (!(r.Se & STATUS_PENDING)) {
-      r.Te = r.J === undefined ? NO_SNAPSHOT : r.J;
+    if (!(r._e & STATUS_PENDING)) {
+      r.Re = r.ne === undefined ? NO_SNAPSHOT : r.ne;
       snapshotSources.add(r);
     }
   }
@@ -1351,33 +1394,33 @@ function computed(e, t, n) {
 }
 function signal(e, t, n = null) {
   const i = {
-    ke: t?.equals != null ? t.equals : isEqual,
-    fe: !!t?.pureWrite,
-    He: !!t?.He,
-    he: t?.unobserved,
-    J: e,
-    I: null,
-    pe: null,
-    Ee: clock,
+    xe: t?.equals != null ? t.equals : isEqual,
+    de: !!t?.pureWrite,
+    Fe: !!t?.Fe,
+    Ne: t?.unobserved,
+    ne: e,
+    h: null,
+    ge: null,
+    Se: clock,
     V: n,
     N: n?.A || null,
-    X: NOT_PENDING
+    te: NOT_PENDING
   };
   n && (n.A = i);
-  if (snapshotCaptureActive && !i.He && !((n?.Se ?? 0) & STATUS_PENDING)) {
-    i.Te = e === undefined ? NO_SNAPSHOT : e;
+  if (snapshotCaptureActive && !i.Fe && !((n?._e ?? 0) & STATUS_PENDING)) {
+    i.Re = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
   return i;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.ee = NOT_PENDING;
+  n.ie = NOT_PENDING;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const i = computed(e, t, n);
-  i.ee = NOT_PENDING;
+  i.ie = NOT_PENDING;
   return i;
 }
 function isEqual(e, t) {
@@ -1399,7 +1442,7 @@ function read(e) {
     const t = getLatestValueComputed(e);
     const n = latestReadActive;
     latestReadActive = false;
-    const i = e.ee !== undefined && e.ee !== NOT_PENDING ? e.ee : e.J;
+    const i = e.ie !== undefined && e.ie !== NOT_PENDING ? e.ie : e.ne;
     let r;
     try {
       r = read(t);
@@ -1409,11 +1452,11 @@ function read(e) {
     } finally {
       latestReadActive = n;
     }
-    if (t.Se & STATUS_PENDING) return i;
-    if (stale && currentOptimisticLane && t.q) {
-      const e = findLane(t.q);
+    if (t._e & STATUS_PENDING) return i;
+    if (stale && currentOptimisticLane && t.ee) {
+      const e = findLane(t.ee);
       const n = findLane(currentOptimisticLane);
-      if (e !== n && e.k.size > 0) {
+      if (e !== n && e.H.size > 0) {
         return i;
       }
     }
@@ -1423,8 +1466,8 @@ function read(e) {
     const t = e.V;
     const n = pendingCheckActive;
     pendingCheckActive = false;
-    if (t && e.ee !== undefined) {
-      if (e.ee !== NOT_PENDING && (t.Ce || !!(t.Se & STATUS_PENDING))) {
+    if (t && e.ie !== undefined) {
+      if (e.ie !== NOT_PENDING && (t.De || !!(t._e & STATUS_PENDING))) {
         foundPending = true;
       }
       let n = context;
@@ -1437,7 +1480,7 @@ function read(e) {
       if (t && read(getPendingSignal(t))) foundPending = true;
     }
     pendingCheckActive = n;
-    return e.J;
+    return e.ne;
   }
   let t = context;
   if (t?.t) t = t.u;
@@ -1463,60 +1506,60 @@ function read(e) {
       }
     }
   }
-  if (n.Se & STATUS_PENDING) {
-    if (t && !(stale && n.K && activeTransition !== n.K)) {
+  if (n._e & STATUS_PENDING) {
+    if (t && !(stale && n.B && activeTransition !== n.B)) {
       if (currentOptimisticLane) {
-        const i = n.q;
+        const i = n.ee;
         const r = findLane(currentOptimisticLane);
         if (i && findLane(i) === r && !hasActiveOverride(n)) {
           if (!tracking && e !== t) link(e, t);
-          throw n.le;
+          throw n.Te;
         }
       } else {
         if (!tracking && e !== t) link(e, t);
-        throw n.le;
+        throw n.Te;
       }
-    } else if (t && n !== e && n.Se & STATUS_UNINITIALIZED) {
+    } else if (t && n !== e && n._e & STATUS_UNINITIALIZED) {
       if (!tracking && e !== t) link(e, t);
-      throw n.le;
-    } else if (!t && n.Se & STATUS_UNINITIALIZED) {
-      throw n.le;
+      throw n.Te;
+    } else if (!t && n._e & STATUS_UNINITIALIZED) {
+      throw n.Te;
     }
   }
-  if (e.L && e.Se & STATUS_ERROR) {
-    if (e.Ee < clock) {
+  if (e.L && e._e & STATUS_ERROR) {
+    if (e.Se < clock) {
       recompute(e);
       return read(e);
-    } else throw e.le;
+    } else throw e.Te;
   }
-  if (snapshotCaptureActive && t && t.de) {
-    const n = e.Te;
+  if (snapshotCaptureActive && t && t.Oe) {
+    const n = e.Re;
     if (n !== undefined) {
       const i = n === NO_SNAPSHOT ? undefined : n;
-      const r = e.X !== NOT_PENDING ? e.X : e.J;
+      const r = e.te !== NOT_PENDING ? e.te : e.ne;
       if (r !== i) t.O |= REACTIVE_SNAPSHOT_STALE;
       return i;
     }
   }
-  if (e.ee !== undefined && e.ee !== NOT_PENDING) {
-    if (t && stale && shouldReadStashedOptimisticValue(e)) return e.J;
-    return e.ee;
+  if (e.ie !== undefined && e.ie !== NOT_PENDING) {
+    if (t && stale && shouldReadStashedOptimisticValue(e)) return e.ne;
+    return e.ie;
   }
   return !t ||
     (currentOptimisticLane !== null &&
-      (e.ee !== undefined || e.q || (n === e && stale) || !!(n.Se & STATUS_PENDING))) ||
-    e.X === NOT_PENDING ||
-    (stale && e.K && activeTransition !== e.K)
-    ? e.J
-    : e.X;
+      (e.ie !== undefined || e.ee || (n === e && stale) || !!(n._e & STATUS_PENDING))) ||
+    e.te === NOT_PENDING ||
+    (stale && e.B && activeTransition !== e.B)
+    ? e.ne
+    : e.te;
 }
 function setSignal(e, t) {
-  if (e.K && activeTransition !== e.K) globalQueue.initTransition(e.K);
-  const n = e.ee !== undefined && !projectionWriteActive;
-  const i = e.ee !== undefined && e.ee !== NOT_PENDING;
-  const r = n ? (i ? e.ee : e.J) : e.X === NOT_PENDING ? e.J : e.X;
+  if (e.B && activeTransition !== e.B) globalQueue.initTransition(e.B);
+  const n = e.ie !== undefined && !projectionWriteActive;
+  const i = e.ie !== undefined && e.ie !== NOT_PENDING;
+  const r = n ? (i ? e.ie : e.ne) : e.te === NOT_PENDING ? e.ne : e.te;
   if (typeof t === "function") t = t(r);
-  const s = !e.ke || !e.ke(r, t) || !!(e.Se & STATUS_UNINITIALIZED);
+  const s = !e.xe || !e.xe(r, t) || !!(e._e & STATUS_UNINITIALIZED);
   if (!s) {
     if (n && i && e.L) {
       insertSubs(e, true);
@@ -1525,25 +1568,25 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = e.ee === NOT_PENDING;
+    const n = e.ie === NOT_PENDING;
     if (!n) globalQueue.initTransition(resolveTransition(e));
     if (n) {
-      e.X = e.J;
-      globalQueue.Y.push(e);
+      e.te = e.ne;
+      globalQueue.q.push(e);
     }
-    e._e = true;
+    e.pe = true;
     const i = getOrCreateLane(e);
-    e.q = i;
-    e.ee = t;
+    e.ee = i;
+    e.ie = t;
   } else {
-    if (e.X === NOT_PENDING) globalQueue.se.push(e);
-    e.X = t;
+    if (e.te === NOT_PENDING) globalQueue.ce.push(e);
+    e.te = t;
   }
   updatePendingSignal(e);
   if (e.Ge) {
     setSignal(e.Ge, t);
   }
-  e.Ee = clock;
+  e.Se = clock;
   insertSubs(e, n);
   schedule();
   return t;
@@ -1563,8 +1606,8 @@ function runWithOwner(e, t) {
 function getPendingSignal(e) {
   if (!e.Qe) {
     e.Qe = optimisticSignal(false, { pureWrite: true });
-    if (e.Re) {
-      e.Qe.Re = e;
+    if (e.he) {
+      e.Qe.he = e;
     }
     if (computePendingState(e)) setSignal(e.Qe, true);
   }
@@ -1573,38 +1616,38 @@ function getPendingSignal(e) {
 function computePendingState(e) {
   const t = e;
   const n = e.V;
-  if (n && e.X !== NOT_PENDING) {
-    return !n.Ce && !(n.Se & STATUS_PENDING);
+  if (n && e.te !== NOT_PENDING) {
+    return !n.De && !(n._e & STATUS_PENDING);
   }
-  if (e.ee !== undefined && e.ee !== NOT_PENDING) {
-    if (t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
-    if (e.Re) {
-      const t = e.q ? findLane(e.q) : null;
-      return !!(t && t.k.size > 0);
+  if (e.ie !== undefined && e.ie !== NOT_PENDING) {
+    if (t._e & STATUS_PENDING && !(t._e & STATUS_UNINITIALIZED)) return true;
+    if (e.he) {
+      const t = e.ee ? findLane(e.ee) : null;
+      return !!(t && t.H.size > 0);
     }
     return true;
   }
-  if (e.ee !== undefined && e.ee === NOT_PENDING && !e.Re) {
+  if (e.ie !== undefined && e.ie === NOT_PENDING && !e.he) {
     return false;
   }
-  if (e.X !== NOT_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
-  return !!(t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED));
+  if (e.te !== NOT_PENDING && !(t._e & STATUS_UNINITIALIZED)) return true;
+  return !!(t._e & STATUS_PENDING && !(t._e & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
   if (e.Qe) {
     const t = computePendingState(e);
     const n = e.Qe;
     setSignal(n, t);
-    if (!t && n.q) {
+    if (!t && n.ee) {
       const t = resolveLane(e);
-      if (t && t.k.size > 0) {
-        const e = findLane(n.q);
+      if (t && t.H.size > 0) {
+        const e = findLane(n.ee);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
       signalLanes.delete(n);
-      n.q = undefined;
+      n.ee = undefined;
     }
   }
 }
@@ -1617,7 +1660,7 @@ function getLatestValueComputed(e) {
     const i = context;
     context = null;
     e.Ge = optimisticComputed(() => read(e));
-    e.Ge.Re = e;
+    e.Ge.he = e;
     context = i;
     pendingCheckActive = n;
     latestReadActive = t;
@@ -1683,7 +1726,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.we[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.be[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1693,10 +1736,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.we = { ...n.we, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.be = { ...n.be, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.we[e.id]);
+  return !isUndefined(t?.be[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1706,96 +1749,96 @@ function effect(e, t, n, i, r) {
   const o = computed(r?.render ? t => staleValues(() => e(t)) : e, i, {
     ...r,
     equals: () => {
-      o.H = !o.le;
-      if (s) o.F.enqueue(o.W, runEffect.bind(o));
+      o.$ = !o.Te;
+      if (s) o.j.enqueue(o.M, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Fe = i;
-  o.Me = t;
-  o.$e = n;
-  o.je = undefined;
-  o.W = r?.render ? EFFECT_RENDER : EFFECT_USER;
-  o.xe = (e, t) => {
-    const n = e !== undefined ? e : o.Se;
-    const i = t !== undefined ? t : o.le;
+  o.Me = i;
+  o.$e = t;
+  o.je = n;
+  o.Ke = undefined;
+  o.M = r?.render ? EFFECT_RENDER : EFFECT_USER;
+  o.We = (e, t) => {
+    const n = e !== undefined ? e : o._e;
+    const i = t !== undefined ? t : o.Te;
     if (n & STATUS_ERROR) {
       let e = i;
-      o.F.notify(o, STATUS_PENDING, 0);
-      if (o.W === EFFECT_USER) {
+      o.j.notify(o, STATUS_PENDING, 0);
+      if (o.M === EFFECT_USER) {
         try {
-          return o.$e
-            ? o.$e(e, () => {
-                o.je?.();
-                o.je = undefined;
+          return o.je
+            ? o.je(e, () => {
+                o.Ke?.();
+                o.Ke = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!o.F.notify(o, STATUS_ERROR, STATUS_ERROR)) throw e;
-    } else if (o.W === EFFECT_RENDER) {
-      o.F.notify(o, STATUS_PENDING | STATUS_ERROR, n, i);
+      if (!o.j.notify(o, STATUS_ERROR, STATUS_ERROR)) throw e;
+    } else if (o.M === EFFECT_RENDER) {
+      o.j.notify(o, STATUS_PENDING | STATUS_ERROR, n, i);
     }
   };
   recompute(o, true);
-  !r?.defer && (o.W === EFFECT_USER ? o.F.enqueue(o.W, runEffect.bind(o)) : runEffect.call(o));
+  !r?.defer && (o.M === EFFECT_USER ? o.j.enqueue(o.M, runEffect.bind(o)) : runEffect.call(o));
   s = true;
-  cleanup(() => o.je?.());
+  cleanup(() => o.Ke?.());
 }
 function runEffect() {
-  if (!this.H || this.O & REACTIVE_DISPOSED) return;
-  this.je?.();
-  this.je = undefined;
+  if (!this.$ || this.O & REACTIVE_DISPOSED) return;
+  this.Ke?.();
+  this.Ke = undefined;
   try {
-    const e = this.Me(this.J, this.Fe);
+    const e = this.$e(this.ne, this.Me);
     if (false && e !== undefined && typeof e !== "function");
-    this.je = e;
+    this.Ke = e;
   } catch (e) {
-    this.le = new StatusError(this, e);
-    this.Se |= STATUS_ERROR;
-    if (!this.F.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
+    this.Te = new StatusError(this, e);
+    this._e |= STATUS_ERROR;
+    if (!this.j.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
   } finally {
-    this.Fe = this.J;
-    this.H = false;
+    this.Me = this.ne;
+    this.$ = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.H || n.O & REACTIVE_DISPOSED) return;
+    if (!n.$ || n.O & REACTIVE_DISPOSED) return;
     try {
-      n.H = false;
+      n.$ = false;
       recompute(n);
     } finally {
     }
   };
   const n = computed(
     () => {
-      n.je?.();
-      n.je = undefined;
+      n.Ke?.();
+      n.Ke = undefined;
       const t = staleValues(e);
-      n.je = t;
+      n.Ke = t;
     },
     undefined,
     { ...t, lazy: true }
   );
-  n.je = undefined;
-  n.Ke = true;
-  n.H = true;
-  n.W = EFFECT_TRACKED;
-  n.xe = (e, t) => {
-    const i = e !== undefined ? e : n.Se;
+  n.Ke = undefined;
+  n.Ye = true;
+  n.$ = true;
+  n.M = EFFECT_TRACKED;
+  n.We = (e, t) => {
+    const i = e !== undefined ? e : n._e;
     if (i & STATUS_ERROR) {
-      n.F.notify(n, STATUS_PENDING, 0);
-      const e = t !== undefined ? t : n.le;
-      if (!n.F.notify(n, STATUS_ERROR, STATUS_ERROR)) throw e;
+      n.j.notify(n, STATUS_PENDING, 0);
+      const e = t !== undefined ? t : n.Te;
+      if (!n.j.notify(n, STATUS_ERROR, STATUS_ERROR)) throw e;
     }
   };
-  n.M = run;
-  n.F.enqueue(EFFECT_USER, run);
-  cleanup(() => n.je?.());
+  n.K = run;
+  n.j.enqueue(EFFECT_USER, run);
+  cleanup(() => n.Ke?.());
 }
 function restoreTransition(e, t) {
   globalQueue.initTransition(e);
@@ -1809,11 +1852,11 @@ function action(e) {
       const r = e(...t);
       globalQueue.initTransition();
       let s = activeTransition;
-      s.j.push(r);
+      s.Z.push(r);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.j.indexOf(r);
-        if (o >= 0) s.j.splice(o, 1);
+        const o = s.Z.indexOf(r);
+        if (o >= 0) s.Z.splice(o, 1);
         setActiveTransition(s);
         schedule();
         t ? i(t) : n(e);
@@ -1908,12 +1951,16 @@ function resolve(e) {
   });
 }
 function createOptimistic(e, t, n) {
-  const i = typeof e === "function" ? optimisticComputed(e, t, n) : optimisticSignal(e, t);
+  if (typeof e === "function") {
+    const i = optimisticComputed(e, t, n);
+    return [accessor(i), setSignal.bind(null, i)];
+  }
+  const i = optimisticSignal(e, t);
   return [accessor(i), setSignal.bind(null, i)];
 }
 function onSettled(e) {
   const t = getOwner();
-  t && !t.Ke
+  t && !t.Ye
     ? createTrackedEffect(() => untrack(e), undefined)
     : globalQueue.enqueue(EFFECT_USER, () => {
         const t = e();
@@ -1947,67 +1994,67 @@ function applyState(e, t, n) {
     let t = false;
     const c = getOverrideValue(r, s, u, "length", o);
     if (e.length && c && e[0] && n(e[0]) != null) {
-      let a, f, l, E, T, d, S, R;
+      let a, l, f, E, d, T, S, R;
       for (
-        l = 0, E = Math.min(c, e.length);
-        l < E &&
-        ((d = getOverrideValue(r, s, u, l, o)) === e[l] || (d && e[l] && n(d) === n(e[l])));
-        l++
+        f = 0, E = Math.min(c, e.length);
+        f < E &&
+        ((T = getOverrideValue(r, s, u, f, o)) === e[f] || (T && e[f] && n(T) === n(e[f])));
+        f++
       ) {
-        applyState(e[l], wrap(d, i), n);
+        applyState(e[f], wrap(T, i), n);
       }
       const O = new Array(e.length),
         _ = new Map();
       for (
-        E = c - 1, T = e.length - 1;
-        E >= l &&
-        T >= l &&
-        ((d = getOverrideValue(r, s, u, E, o)) === e[T] || (d && e[T] && n(d) === n(e[T])));
-        E--, T--
+        E = c - 1, d = e.length - 1;
+        E >= f &&
+        d >= f &&
+        ((T = getOverrideValue(r, s, u, E, o)) === e[d] || (T && e[d] && n(T) === n(e[d])));
+        E--, d--
       ) {
-        O[T] = d;
+        O[d] = T;
       }
-      if (l > T || l > E) {
-        for (f = l; f <= T; f++) {
+      if (f > d || f > E) {
+        for (l = f; l <= d; l++) {
           t = true;
-          i[STORE_NODE][f] && setSignal(i[STORE_NODE][f], wrap(e[f], i));
+          i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], wrap(e[l], i));
         }
-        for (; f < e.length; f++) {
+        for (; l < e.length; l++) {
           t = true;
-          const r = wrap(O[f], i);
-          i[STORE_NODE][f] && setSignal(i[STORE_NODE][f], r);
-          applyState(e[f], r, n);
+          const r = wrap(O[l], i);
+          i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], r);
+          applyState(e[l], r, n);
         }
         t && i[STORE_NODE][$TRACK] && setSignal(i[STORE_NODE][$TRACK], void 0);
         c !== e.length && i[STORE_NODE].length && setSignal(i[STORE_NODE].length, e.length);
         return;
       }
-      S = new Array(T + 1);
-      for (f = T; f >= l; f--) {
-        d = e[f];
-        R = d ? n(d) : d;
+      S = new Array(d + 1);
+      for (l = d; l >= f; l--) {
+        T = e[l];
+        R = T ? n(T) : T;
         a = _.get(R);
-        S[f] = a === undefined ? -1 : a;
-        _.set(R, f);
-      }
-      for (a = l; a <= E; a++) {
-        d = getOverrideValue(r, s, u, a, o);
-        R = d ? n(d) : d;
-        f = _.get(R);
-        if (f !== undefined && f !== -1) {
-          O[f] = d;
-          f = S[f];
-          _.set(R, f);
+        S[l] = a === undefined ? -1 : a;
+        _.set(R, l);
+      }
+      for (a = f; a <= E; a++) {
+        T = getOverrideValue(r, s, u, a, o);
+        R = T ? n(T) : T;
+        l = _.get(R);
+        if (l !== undefined && l !== -1) {
+          O[l] = T;
+          l = S[l];
+          _.set(R, l);
         }
       }
-      for (f = l; f < e.length; f++) {
-        if (f in O) {
-          const t = wrap(O[f], i);
-          i[STORE_NODE][f] && setSignal(i[STORE_NODE][f], t);
-          applyState(e[f], t, n);
-        } else i[STORE_NODE][f] && setSignal(i[STORE_NODE][f], wrap(e[f], i));
+      for (l = f; l < e.length; l++) {
+        if (l in O) {
+          const t = wrap(O[l], i);
+          i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], t);
+          applyState(e[l], t, n);
+        } else i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], wrap(e[l], i));
       }
-      if (l < e.length) t = true;
+      if (f < e.length) t = true;
     } else if (e.length) {
       for (let t = 0, c = e.length; t < c; t++) {
         const c = getOverrideValue(r, s, u, t, o);
@@ -2026,16 +2073,16 @@ function applyState(e, t, n) {
   if (u) {
     const t = u[$TRACK];
     const c = t ? getAllKeys(r, s, e) : Object.keys(u);
-    for (let a = 0, f = c.length; a < f; a++) {
-      const f = c[a];
-      const l = u[f];
-      const E = unwrap(getOverrideValue(r, s, u, f, o));
-      let T = unwrap(e[f]);
-      if (E === T) continue;
-      if (!E || !isWrappable(E) || !isWrappable(T) || (n(E) != null && n(E) !== n(T))) {
+    for (let a = 0, l = c.length; a < l; a++) {
+      const l = c[a];
+      const f = u[l];
+      const E = unwrap(getOverrideValue(r, s, u, l, o));
+      let d = unwrap(e[l]);
+      if (E === d) continue;
+      if (!E || !isWrappable(E) || !isWrappable(d) || (n(E) != null && n(E) !== n(d))) {
         t && setSignal(t, void 0);
-        l && setSignal(l, isWrappable(T) ? wrap(T, i) : T);
-      } else applyState(T, wrap(E, i), n);
+        f && setSignal(f, isWrappable(d) ? wrap(d, i) : d);
+      } else applyState(d, wrap(E, i), n);
     }
   }
   if ((u = i[STORE_HAS])) {
@@ -2083,7 +2130,7 @@ function createProjectionInternal(e, t = {}, n) {
     let r;
     const o = new Proxy(
       s,
-      createWriteTraps(() => !i || t.Ce === r)
+      createWriteTraps(() => !i || t.De === r)
     );
     storeSetter(o, o => {
       r = e(o);
@@ -2094,7 +2141,7 @@ function createProjectionInternal(e, t = {}, n) {
       u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
     });
   });
-  i.Ae = true;
+  i.Pe = true;
   return { store: s, node: i };
 }
 function createProjection(e, t = {}, n) {
@@ -2215,11 +2262,11 @@ function getNode(e, t, n, i, r = isEqual, s, o) {
     i
   );
   if (s) {
-    u.ee = NOT_PENDING;
+    u.ie = NOT_PENDING;
   }
   if (o && t in o) {
     const e = o[t];
-    u.Te = e === undefined ? NO_SNAPSHOT : e;
+    u.Re = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources?.add(u);
   }
   return (e[t] = u);
@@ -2276,11 +2323,11 @@ const storeTraps = {
     if (writeOnly(n)) {
       let n =
         r && (o || !u)
-          ? r.ee !== undefined && r.ee !== NOT_PENDING
-            ? r.ee
-            : r.X !== NOT_PENDING
-              ? r.X
-              : r.J
+          ? r.ie !== undefined && r.ie !== NOT_PENDING
+            ? r.ie
+            : r.te !== NOT_PENDING
+              ? r.te
+              : r.ne
           : c[t];
       n === $DELETED && (n = undefined);
       if (!isWrappable(n)) return n;
@@ -2335,8 +2382,8 @@ const storeTraps = {
     if (writeOnly(i)) {
       if (e[STORE_OPTIMISTIC]) {
         const t = e[STORE_FIREWALL];
-        if (t?.K) {
-          globalQueue.initTransition(t.K);
+        if (t?.B) {
+          globalQueue.initTransition(t.B);
         }
       }
       untrack(() => {
@@ -2345,7 +2392,7 @@ const storeTraps = {
         if (
           snapshotCaptureActive &&
           typeof t !== "symbol" &&
-          !((e[STORE_FIREWALL]?.Se ?? 0) & STATUS_PENDING)
+          !((e[STORE_FIREWALL]?._e ?? 0) & STATUS_PENDING)
         ) {
           if (!e[STORE_SNAPSHOT_PROPS]) {
             e[STORE_SNAPSHOT_PROPS] = Object.create(null);
@@ -2365,32 +2412,33 @@ const storeTraps = {
               ? e[STORE_OVERRIDE][t]
               : s;
         const a = n?.[$TARGET]?.[STORE_VALUE] ?? n;
-        const f = Array.isArray(r) && t !== "length";
-        const l = f ? parseInt(t) + 1 : 0;
+        const l = Array.isArray(r) && t !== "length";
+        const f = l ? parseInt(t) + 1 : 0;
         const E =
-          f &&
+          l &&
           (e[STORE_OPTIMISTIC_OVERRIDE] && "length" in e[STORE_OPTIMISTIC_OVERRIDE]
             ? e[STORE_OPTIMISTIC_OVERRIDE].length
             : e[STORE_OVERRIDE] && "length" in e[STORE_OVERRIDE]
               ? e[STORE_OVERRIDE].length
               : r.length);
-        const T = f && l > E ? l : undefined;
-        if (c === a && T === undefined) return true;
-        if (a !== undefined && a === s && T === undefined) delete e[u]?.[t];
+        const d = l && f > E ? f : undefined;
+        if (c === a && d === undefined) return true;
+        if (a !== undefined && a === s && d === undefined) delete e[u]?.[t];
         else {
           const n = e[u] || (e[u] = Object.create(null));
           n[t] = a;
-          if (T !== undefined) n.length = T;
+          if (d !== undefined) n.length = d;
         }
-        const d = isWrappable(a);
+        const T = isWrappable(a);
         e[STORE_HAS]?.[t] && setSignal(e[STORE_HAS][t], true);
         const S = getNodes(e, STORE_NODE);
-        S[t] && setSignal(S[t], () => (d ? wrap(a, e) : a));
+        S[t] && setSignal(S[t], () => (T ? wrap(a, e) : a));
         if (Array.isArray(r)) {
-          const e = t === "length" ? a : T;
+          const e = t === "length" ? a : d;
           e !== undefined && S.length && setSignal(S.length, e);
         }
         S[$TRACK] && setSignal(S[$TRACK], undefined);
+        if (false);
       });
     }
     return true;
@@ -2485,7 +2533,7 @@ function createStore(e, t, n) {
   return [r, e => storeSetter(r, e)];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.ce ||= clearOptimisticStore;
+  GlobalQueue.fe ||= clearOptimisticStore;
   const i = typeof e === "function";
   const r = (i ? t : e) ?? {};
   const s = i ? e : undefined;
@@ -2502,7 +2550,7 @@ function clearOptimisticStore(e) {
     if (i) {
       for (const e of Reflect.ownKeys(n)) {
         if (i[e]) {
-          i[e].q = undefined;
+          i[e].ee = undefined;
           const n =
             t[STORE_OVERRIDE] && e in t[STORE_OVERRIDE] ? t[STORE_OVERRIDE][e] : t[STORE_VALUE][e];
           const r = n === $DELETED ? undefined : n;
@@ -2510,7 +2558,7 @@ function clearOptimisticStore(e) {
         }
       }
       if (i[$TRACK]) {
-        i[$TRACK].q = undefined;
+        i[$TRACK].ee = undefined;
         setSignal(i[$TRACK], undefined);
       }
     }
@@ -2548,7 +2596,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       let r;
       const o = new Proxy(
         s,
-        createWriteTraps(() => !i || t.Ce === r)
+        createWriteTraps(() => !i || t.De === r)
       );
       setProjectionWriteActive(true);
       try {
@@ -2569,7 +2617,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    i.Ae = true;
+    i.Pe = true;
   }
   return { store: s, node: i };
 }
@@ -2656,29 +2704,29 @@ function snapshotImpl(e, t, n, i) {
   }
   if (s) {
     const s = o?.length || e.length;
-    for (let f = 0; f < s; f++) {
-      a = o && f in o ? o[f] : e[f];
+    for (let l = 0; l < s; l++) {
+      a = o && l in o ? o[l] : e[l];
       if (a === $DELETED) continue;
       if (t && isWrappable(a)) wrap(a, r);
       if ((c = snapshotImpl(a, t, n, i)) !== a || u) {
         if (!u) n.set(e, (u = [...e]));
-        u[f] = c;
+        u[l] = c;
       }
     }
   } else {
     const s = getKeys(e, o);
-    for (let f = 0, l = s.length; f < l; f++) {
-      let l = s[f];
-      const E = getPropertyDescriptor(e, o, l);
+    for (let l = 0, f = s.length; l < f; l++) {
+      let f = s[l];
+      const E = getPropertyDescriptor(e, o, f);
       if (E.get) continue;
-      a = o && l in o ? o[l] : e[l];
+      a = o && f in o ? o[f] : e[f];
       if (t && isWrappable(a)) wrap(a, r);
-      if ((c = snapshotImpl(a, t, n, i)) !== e[l] || u) {
+      if ((c = snapshotImpl(a, t, n, i)) !== e[f] || u) {
         if (!u) {
           u = Object.create(Object.getPrototypeOf(e));
           Object.assign(u, e);
         }
-        u[l] = c;
+        u[f] = c;
       }
     }
   }
@@ -2826,321 +2874,454 @@ function mapArray(e, t, n) {
   const s = t;
   return createMemo(
     updateKeyedMap.bind({
-      Ye: createOwner(),
-      Ze: 0,
-      Be: e,
-      qe: [],
-      ze: s,
-      Xe: [],
+      Ze: createOwner(),
+      Be: 0,
+      qe: e,
+      ze: [],
+      Xe: s,
       Je: [],
-      et: i,
-      tt: i || n?.keyed === false ? [] : undefined,
-      nt: r ? [] : undefined,
-      it: n?.fallback
+      et: [],
+      tt: i,
+      nt: i || n?.keyed === false ? [] : undefined,
+      it: r ? [] : undefined,
+      rt: n?.fallback
     })
   );
 }
 const pureOptions = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Be() || [],
+  const e = this.qe() || [],
     t = e.length;
   e[$TRACK];
-  runWithOwner(this.Ye, () => {
+  runWithOwner(this.Ze, () => {
     let n,
       i,
-      r = this.tt
+      r = this.nt
         ? () => {
-            this.tt[i] = signal(e[i], pureOptions);
-            this.nt && (this.nt[i] = signal(i, pureOptions));
-            return this.ze(accessor(this.tt[i]), this.nt ? accessor(this.nt[i]) : undefined);
+            this.nt[i] = signal(e[i], pureOptions);
+            this.it && (this.it[i] = signal(i, pureOptions));
+            return this.Xe(accessor(this.nt[i]), this.it ? accessor(this.it[i]) : undefined);
           }
-        : this.nt
+        : this.it
           ? () => {
               const t = e[i];
-              this.nt[i] = signal(i, pureOptions);
-              return this.ze(() => t, accessor(this.nt[i]));
+              this.it[i] = signal(i, pureOptions);
+              return this.Xe(() => t, accessor(this.it[i]));
             }
           : () => {
               const t = e[i];
-              return this.ze(() => t);
+              return this.Xe(() => t);
             };
     if (t === 0) {
-      if (this.Ze !== 0) {
-        this.Ye.dispose(false);
+      if (this.Be !== 0) {
+        this.Ze.dispose(false);
+        this.et = [];
+        this.ze = [];
         this.Je = [];
-        this.qe = [];
-        this.Xe = [];
-        this.Ze = 0;
-        this.tt && (this.tt = []);
+        this.Be = 0;
         this.nt && (this.nt = []);
+        this.it && (this.it = []);
       }
-      if (this.it && !this.Xe[0]) {
-        this.Xe[0] = runWithOwner((this.Je[0] = createOwner()), this.it);
+      if (this.rt && !this.Je[0]) {
+        this.Je[0] = runWithOwner((this.et[0] = createOwner()), this.rt);
       }
-    } else if (this.Ze === 0) {
-      if (this.Je[0]) this.Je[0].dispose();
-      this.Xe = new Array(t);
+    } else if (this.Be === 0) {
+      if (this.et[0]) this.et[0].dispose();
+      this.Je = new Array(t);
       for (i = 0; i < t; i++) {
-        this.qe[i] = e[i];
-        this.Xe[i] = runWithOwner((this.Je[i] = createOwner()), r);
+        this.ze[i] = e[i];
+        this.Je[i] = runWithOwner((this.et[i] = createOwner()), r);
       }
-      this.Ze = t;
+      this.Be = t;
     } else {
       let s,
         o,
         u,
         c,
         a,
-        f,
         l,
+        f,
         E = new Array(t),
-        T = new Array(t),
-        d = this.tt ? new Array(t) : undefined,
-        S = this.nt ? new Array(t) : undefined;
+        d = new Array(t),
+        T = this.nt ? new Array(t) : undefined,
+        S = this.it ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Ze, t);
-        s < o && (this.qe[s] === e[s] || (this.tt && compare(this.et, this.qe[s], e[s])));
+        s = 0, o = Math.min(this.Be, t);
+        s < o && (this.ze[s] === e[s] || (this.nt && compare(this.tt, this.ze[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.Ze - 1, u = t - 1;
+        o = this.Be - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.qe[o] === e[u] || (this.tt && compare(this.et, this.qe[o], e[u])));
+        (this.ze[o] === e[u] || (this.nt && compare(this.tt, this.ze[o], e[u])));
         o--, u--
       ) {
-        E[u] = this.Xe[o];
-        T[u] = this.Je[o];
-        d && (d[u] = this.tt[o]);
-        S && (S[u] = this.nt[o]);
+        E[u] = this.Je[o];
+        d[u] = this.et[o];
+        T && (T[u] = this.nt[o]);
+        S && (S[u] = this.it[o]);
       }
-      f = new Map();
-      l = new Array(u + 1);
+      l = new Map();
+      f = new Array(u + 1);
       for (i = u; i >= s; i--) {
         c = e[i];
-        a = this.et ? this.et(c) : c;
-        n = f.get(a);
-        l[i] = n === undefined ? -1 : n;
-        f.set(a, i);
+        a = this.tt ? this.tt(c) : c;
+        n = l.get(a);
+        f[i] = n === undefined ? -1 : n;
+        l.set(a, i);
       }
       for (n = s; n <= o; n++) {
-        c = this.qe[n];
-        a = this.et ? this.et(c) : c;
-        i = f.get(a);
+        c = this.ze[n];
+        a = this.tt ? this.tt(c) : c;
+        i = l.get(a);
         if (i !== undefined && i !== -1) {
-          E[i] = this.Xe[n];
-          T[i] = this.Je[n];
-          d && (d[i] = this.tt[n]);
-          S && (S[i] = this.nt[n]);
-          i = l[i];
-          f.set(a, i);
-        } else this.Je[n].dispose();
+          E[i] = this.Je[n];
+          d[i] = this.et[n];
+          T && (T[i] = this.nt[n]);
+          S && (S[i] = this.it[n]);
+          i = f[i];
+          l.set(a, i);
+        } else this.et[n].dispose();
       }
       for (i = s; i < t; i++) {
         if (i in E) {
-          this.Xe[i] = E[i];
-          this.Je[i] = T[i];
-          if (d) {
-            this.tt[i] = d[i];
-            setSignal(this.tt[i], e[i]);
+          this.Je[i] = E[i];
+          this.et[i] = d[i];
+          if (T) {
+            this.nt[i] = T[i];
+            setSignal(this.nt[i], e[i]);
           }
           if (S) {
-            this.nt[i] = S[i];
-            setSignal(this.nt[i], i);
+            this.it[i] = S[i];
+            setSignal(this.it[i], i);
           }
         } else {
-          this.Xe[i] = runWithOwner((this.Je[i] = createOwner()), r);
+          this.Je[i] = runWithOwner((this.et[i] = createOwner()), r);
         }
       }
-      this.Xe = this.Xe.slice(0, (this.Ze = t));
-      this.qe = e.slice(0);
+      this.Je = this.Je.slice(0, (this.Be = t));
+      this.ze = e.slice(0);
     }
   });
-  return this.Xe;
+  return this.Je;
 }
 function repeat(e, t, n) {
   const i = t;
   return updateRepeat.bind({
-    Ye: createOwner(),
-    Ze: 0,
-    rt: 0,
-    st: e,
-    ze: i,
+    Ze: createOwner(),
+    Be: 0,
+    st: 0,
+    ot: e,
+    Xe: i,
+    et: [],
     Je: [],
-    Xe: [],
-    ot: n?.from,
-    it: n?.fallback
+    ut: n?.from,
+    rt: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.st();
-  const t = this.ot?.() || 0;
-  runWithOwner(this.Ye, () => {
+  const e = this.ot();
+  const t = this.ut?.() || 0;
+  runWithOwner(this.Ze, () => {
     if (e === 0) {
-      if (this.Ze !== 0) {
-        this.Ye.dispose(false);
+      if (this.Be !== 0) {
+        this.Ze.dispose(false);
+        this.et = [];
         this.Je = [];
-        this.Xe = [];
-        this.Ze = 0;
+        this.Be = 0;
       }
-      if (this.it && !this.Xe[0]) {
-        this.Xe[0] = runWithOwner((this.Je[0] = createOwner()), this.it);
+      if (this.rt && !this.Je[0]) {
+        this.Je[0] = runWithOwner((this.et[0] = createOwner()), this.rt);
       }
       return;
     }
     const n = t + e;
-    const i = this.rt + this.Ze;
-    if (this.Ze === 0 && this.Je[0]) this.Je[0].dispose();
-    for (let e = n; e < i; e++) this.Je[e - this.rt].dispose();
-    if (this.rt < t) {
-      let e = this.rt;
-      while (e < t && e < this.Ze) this.Je[e++].dispose();
-      this.Je.splice(0, t - this.rt);
-      this.Xe.splice(0, t - this.rt);
-    } else if (this.rt > t) {
-      let n = i - this.rt - 1;
-      let r = this.rt - t;
-      this.Je.length = this.Xe.length = e;
+    const i = this.st + this.Be;
+    if (this.Be === 0 && this.et[0]) this.et[0].dispose();
+    for (let e = n; e < i; e++) this.et[e - this.st].dispose();
+    if (this.st < t) {
+      let e = this.st;
+      while (e < t && e < this.Be) this.et[e++].dispose();
+      this.et.splice(0, t - this.st);
+      this.Je.splice(0, t - this.st);
+    } else if (this.st > t) {
+      let n = i - this.st - 1;
+      let r = this.st - t;
+      this.et.length = this.Je.length = e;
       while (n >= r) {
+        this.et[n] = this.et[n - r];
         this.Je[n] = this.Je[n - r];
-        this.Xe[n] = this.Xe[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.Xe[e] = runWithOwner((this.Je[e] = createOwner()), () => this.ze(e + t));
+        this.Je[e] = runWithOwner((this.et[e] = createOwner()), () => this.Xe(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.Xe[e - t] = runWithOwner((this.Je[e - t] = createOwner()), () => this.ze(e));
+      this.Je[e - t] = runWithOwner((this.et[e - t] = createOwner()), () => this.Xe(e));
     }
-    this.Xe = this.Xe.slice(0, e);
-    this.rt = t;
-    this.Ze = e;
+    this.Je = this.Je.slice(0, e);
+    this.st = t;
+    this.Be = e;
   });
-  return this.Xe;
+  return this.Je;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.xe = (e, t) => {
-    const i = e !== undefined ? e : n.Se;
-    const r = t !== undefined ? t : n.le;
-    n.Se &= ~n.ut;
-    n.F.notify(n, n.ut, i, r);
+  n.We = (e, t) => {
+    const i = e !== undefined ? e : n._e;
+    const r = t !== undefined ? t : n.Te;
+    n._e &= ~n.ct;
+    n.j.notify(n, n.ct, i, r);
   };
-  n.ut = t;
-  n.Ae = true;
+  n.ct = t;
+  n.Pe = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, i) {
-  const r = e.F;
-  r.addChild((e.F = n));
-  cleanup(() => r.removeChild(e.F));
+  const r = e.j;
+  r.addChild((e.j = n));
+  cleanup(() => r.removeChild(e.j));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), i);
   });
 }
 const ON_INIT = Symbol();
-class CollectionQueue extends Queue {
-  ct;
-  ft = new Set();
-  lt = signal(false, { pureWrite: true, He: true });
-  Et = false;
+const RevealControllerContext = createContext(null);
+let _revealUsed = 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.ft;
+}
+function setSlotState(e, t, n, i) {
+  setSignal(e.Et, n);
+  setSignal(e.dt, i);
+  if (isRevealController(e)) {
+    if (!n && e.Tt === t) e.Tt = undefined;
+    return e.evaluate(n, i);
+  }
+  if (!n && e.St === t && e.Rt) e.St = undefined;
+}
+class RevealController {
+  Ot;
+  _t;
+  ht = [];
   Tt;
-  dt = ON_INIT;
+  Et = signal(false, { pureWrite: true, Fe: true });
+  dt = signal(false, { pureWrite: true, Fe: true });
+  It = true;
+  At = false;
+  constructor(e, t) {
+    this.Ot = e;
+    this._t = t;
+  }
+  gt(e) {
+    for (let t = 0; t < this.ht.length; t++) {
+      const n = this.ht[t];
+      if ((isRevealController(n) ? n.Tt : n.St) !== this) continue;
+      if (e(n) === false) return false;
+    }
+    return true;
+  }
+  isReady() {
+    return this.gt(isSlotReady);
+  }
+  register(e) {
+    if (this.ht.includes(e)) return;
+    this.ht.push(e);
+    const t = !!untrack(this.Ot);
+    setSignal(e.Et, true), setSignal(e.dt, t ? false : !!untrack(this._t));
+    untrack(() => this.evaluate());
+  }
+  unregister(e) {
+    const t = this.ht.indexOf(e);
+    if (t >= 0) this.ht.splice(t, 1);
+    untrack(() => this.evaluate());
+  }
+  evaluate(e, t) {
+    if (this.At) return;
+    this.At = true;
+    const n = this.It;
+    try {
+      const n = e ?? read(this.Et),
+        i = !!untrack(this._t),
+        r = t ?? i;
+      if (n && r) this.gt(e => setSlotState(e, this, true, true));
+      else if (!!untrack(this.Ot)) {
+        const e = this.isReady();
+        this.gt(t => setSlotState(t, this, !e, false));
+      } else {
+        let e = false;
+        this.gt(t => {
+          if (e) return setSlotState(t, this, true, i);
+          if (isSlotReady(t)) return setSlotState(t, this, false, false);
+          e = true;
+          setSlotState(t, this, true, false);
+        });
+      }
+    } finally {
+      this.It = this.isReady();
+      this.At = false;
+    }
+    if (this.Tt && n !== this.It) this.Tt.evaluate();
+  }
+}
+class CollectionQueue extends Queue {
+  Nt;
+  lt = new Set();
+  Pt;
+  ft = true;
+  Et = signal(false, { pureWrite: true, Fe: true });
+  dt = signal(false, { pureWrite: true, Fe: true });
+  St;
+  Rt = false;
+  Ct;
+  Dt = ON_INIT;
   constructor(e) {
     super();
-    this.ct = e;
+    this.Nt = e;
   }
   run(e) {
-    if (!e || read(this.lt)) return;
+    if (!e || (read(this.Et) && (!_revealUsed || read(this.dt)))) return;
     return super.run(e);
   }
   notify(e, t, n, i) {
-    if (!(t & this.ct)) return super.notify(e, t, n, i);
-    if (this.Et && this.Tt) {
+    if (!(t & this.Nt)) return super.notify(e, t, n, i);
+    if (this.Rt && this.Ct) {
       const e = untrack(() => {
         try {
-          return this.Tt();
+          return this.Ct();
         } catch {
           return ON_INIT;
         }
       });
-      if (e !== this.dt) {
-        this.dt = e;
-        this.Et = false;
-        this.ft.clear();
+      if (e !== this.Dt) {
+        this.Dt = e;
+        this.Rt = false;
+        this.lt.clear();
       }
     }
-    if (this.ct & STATUS_PENDING && this.Et) return super.notify(e, t, n, i);
-    if (this.ct & STATUS_PENDING && n & STATUS_ERROR) {
+    if (this.Nt & STATUS_PENDING && this.Rt) return super.notify(e, t, n, i);
+    if (this.Nt & STATUS_PENDING && n & STATUS_ERROR) {
       return super.notify(e, STATUS_ERROR, n, i);
     }
-    if (n & this.ct) {
-      const t = i?.source || e.le?.source;
+    if (n & this.Nt) {
+      this.ft = true;
+      const t = i?.source || e.Te?.source;
       if (t) {
-        const e = this.ft.size === 0;
-        this.ft.add(t);
-        if (e) setSignal(this.lt, true);
+        const e = this.lt.size === 0;
+        this.lt.add(t);
+        if (e) setSignal(this.Et, true);
       }
     }
-    t &= ~this.ct;
+    t &= ~this.Nt;
     return t ? super.notify(e, t, n, i) : true;
   }
   checkSources() {
-    for (const e of this.ft) {
+    for (const e of this.lt) {
       if (
         e.O & REACTIVE_DISPOSED ||
-        (!(e.Se & this.ct) && !(this.ct & STATUS_ERROR && e.Se & STATUS_PENDING))
+        (!(e._e & this.Nt) && !(this.Nt & STATUS_ERROR && e._e & STATUS_PENDING))
       )
-        this.ft.delete(e);
+        this.lt.delete(e);
     }
-    if (!this.ft.size) {
-      setSignal(this.lt, false);
-      if (this.Tt) {
-        try {
-          this.dt = untrack(() => this.Tt());
-        } catch {}
+    if (!this.lt.size) {
+      if (this.Nt & STATUS_PENDING && this.ft && !this.Rt && this.Pt) {
+        this.ft = !!(this.Pt._e & this.Nt);
+      } else {
+        this.ft = false;
+      }
+      if (!this.ft) {
+        setSignal(this.Et, false);
+        if (this.Ct) {
+          try {
+            this.Dt = untrack(() => this.Ct());
+          } catch {}
+        }
       }
     }
+    if (_revealUsed) this.St?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, i) {
   const r = createOwner();
+  if (_revealUsed) setContext(RevealControllerContext, null, r);
   const s = new CollectionQueue(e);
-  if (i) s.Tt = i;
-  const o = createBoundChildren(r, t, s, e);
-  const u = computed(() => {
-    if (!read(s.lt)) {
+  if (i) s.Ct = i;
+  const o = (s.Pt = createBoundChildren(r, t, s, e));
+  untrack(() => {
+    let t = false;
+    try {
+      read(o);
+    } catch (e) {
+      if (e instanceof NotReadyError) t = true;
+      else throw e;
+    }
+    s.ft = t || !!(o._e & e) || o.Te instanceof NotReadyError;
+  });
+  const u = _revealUsed && e === STATUS_PENDING ? getContext(RevealControllerContext) : null;
+  if (u) {
+    s.St = u;
+    u.register(s);
+    cleanup(() => u.unregister(s));
+  }
+  const c = computed(() => {
+    if (!read(s.Et)) {
       const e = read(o);
-      if (!untrack(() => read(s.lt))) {
-        s.Et = true;
-        return e;
-      }
+      if (!untrack(() => read(s.Et))) return (s.Rt = true), e;
     }
+    if (_revealUsed && read(s.dt)) return undefined;
     return n(s);
   });
-  return accessor(u);
+  return accessor(c);
 }
 function createLoadingBoundary(e, t, n) {
   return createCollectionBoundary(STATUS_PENDING, e, () => t(), n?.on);
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(STATUS_ERROR, e, e => {
-    let n = e.ft.values().next().value;
-    const i = n.le?.cause ?? n.le;
+    let n = e.lt.values().next().value;
+    const i = n.Te?.cause ?? n.Te;
     return t(i, () => {
-      for (const t of e.ft) recompute(t);
+      for (const t of e.lt) recompute(t);
       schedule();
     });
   });
 }
+function createRevealOrder(e, t) {
+  _revealUsed = true;
+  const n = createOwner();
+  const i = getContext(RevealControllerContext);
+  const r = t?.together || FALSE_ACCESSOR,
+    s = t?.collapsed || FALSE_ACCESSOR;
+  const o = new RevealController(r, s);
+  setContext(RevealControllerContext, o, n);
+  return runWithOwner(n, () => {
+    const t = e();
+    computed(() => {
+      r();
+      s();
+      o.evaluate();
+    });
+    if (i) {
+      o.Tt = i;
+      i.register(o);
+      cleanup(() => i.unregister(o));
+    }
+    return t;
+  });
+}
 function flatten(e, t) {
   if (typeof e === "function" && !e.length) {
     if (t?.doNotUnwrap) return e;
@@ -3196,6 +3377,7 @@ export {
   $TARGET,
   $TRACK,
   ContextNotFoundError,
+  DEV,
   NoOwnerError,
   NotReadyError,
   SUPPORTS_PROXY,
@@ -3212,6 +3394,7 @@ export {
   createProjection,
   createReaction,
   createRenderEffect,
+  createRevealOrder,
   createRoot,
   createSignal,
   createStore,