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

package/dist/prod.js

@@ -33,6 +33,12 @@ const REACTIVE_DISPOSED = 1 << 6;
 const REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
 const REACTIVE_SNAPSHOT_STALE = 1 << 8;
 const REACTIVE_LAZY = 1 << 9;
+const CONFIG_OWNED_WRITE = 1 << 0;
+const CONFIG_NO_SNAPSHOT = 1 << 1;
+const CONFIG_TRANSPARENT = 1 << 2;
+const CONFIG_IN_SNAPSHOT_SCOPE = 1 << 3;
+const CONFIG_CHILDREN_FORBIDDEN = 1 << 4;
+const CONFIG_AUTO_DISPOSE = 1 << 5;
 const STATUS_PENDING = 1 << 0;
 const STATUS_ERROR = 1 << 1;
 const STATUS_UNINITIALIZED = 1 << 2;
@@ -57,26 +63,26 @@ function actualInsertIntoHeap(e, t) {
     e.T = t;
     r.T = e;
   }
-  if (i > t.R) t.R = i;
+  if (i > t.O) t.O = i;
 }
 function insertIntoHeap(e, t) {
-  let n = e.O;
+  let n = e.R;
   if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS)) return;
   if (n & REACTIVE_CHECK) {
-    e.O = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
-  } else e.O = n | REACTIVE_IN_HEAP;
+    e.R = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
+  } else e.R = n | REACTIVE_IN_HEAP;
   if (!(n & REACTIVE_IN_HEAP_HEIGHT)) actualInsertIntoHeap(e, t);
 }
 function insertIntoHeapHeight(e, t) {
-  let n = e.O;
+  let n = e.R;
   if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_IN_HEAP_HEIGHT)) return;
-  e.O = n | REACTIVE_IN_HEAP_HEIGHT;
+  e.R = n | REACTIVE_IN_HEAP_HEIGHT;
   actualInsertIntoHeap(e, t);
 }
 function deleteFromHeap(e, t) {
-  const n = e.O;
+  const n = e.R;
   if (!(n & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
-  e.O = n & -25;
+  e.R = n & -25;
   const i = e.o;
   if (e.T === e) t.l[i] = undefined;
   else {
@@ -93,21 +99,21 @@ function deleteFromHeap(e, t) {
 function markHeap(e) {
   if (e._) return;
   e._ = true;
-  for (let t = 0; t <= e.R; t++) {
+  for (let t = 0; t <= e.O; t++) {
     for (let n = e.l[t]; n !== undefined; n = n.S) {
-      if (n.O & REACTIVE_IN_HEAP) markNode(n);
+      if (n.R & REACTIVE_IN_HEAP) markNode(n);
     }
   }
 }
 function markNode(e, t = REACTIVE_DIRTY) {
-  const n = e.O;
+  const n = e.R;
   if ((n & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= t) return;
-  e.O = (n & -4) | t;
+  e.R = (n & -4) | t;
   for (let t = e.I; t !== null; t = t.h) {
     markNode(t.p, REACTIVE_CHECK);
   }
-  if (e.A !== null) {
-    for (let t = e.A; t !== null; t = t.N) {
+  if (e.N !== null) {
+    for (let t = e.N; t !== null; t = t.A) {
       for (let e = t.I; e !== null; e = e.h) {
         markNode(e.p, REACTIVE_CHECK);
       }
@@ -116,15 +122,15 @@ function markNode(e, t = REACTIVE_DIRTY) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.P = 0; e.P <= e.R; e.P++) {
+  for (e.P = 0; e.P <= e.O; e.P++) {
     let n = e.l[e.P];
     while (n !== undefined) {
-      if (n.O & REACTIVE_IN_HEAP) t(n);
+      if (n.R & REACTIVE_IN_HEAP) t(n);
       else adjustHeight(n, e);
       n = e.l[e.P];
     }
   }
-  e.R = 0;
+  e.O = 0;
 }
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
@@ -143,23 +149,40 @@ function adjustHeight(e, t) {
 }
 const DEV$1 = undefined;
 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 };
+const dirtyQueue = { l: new Array(2e3).fill(undefined), _: false, P: 0, O: 0 };
+const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, P: 0, O: 0 };
 let clock = 0;
 let activeTransition = null;
 let scheduled = false;
 let projectionWriteActive = false;
 let stashedOptimisticReads = null;
+const transientStoreNodes = new Set();
+function registerTransientStoreNode(e) {
+  transientStoreNodes.add(e);
+}
+function sweepTransientStoreNodes() {
+  if (transientStoreNodes.size === 0) return;
+  for (const e of transientStoreNodes) {
+    if (e.I !== null) {
+      transientStoreNodes.delete(e);
+      continue;
+    }
+    if (e.U !== NOT_PENDING) continue;
+    if (e.G !== undefined && e.G !== NOT_PENDING) continue;
+    transientStoreNodes.delete(e);
+    e.k?.();
+  }
+}
 function enforceLoadingBoundary(e) {}
 function shouldReadStashedOptimisticValue(e) {
   return !!stashedOptimisticReads?.has(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.F || t.W.size > 0) continue;
+    const n = t.H[e - 1];
     if (n.length) {
-      t.G[e - 1] = [];
+      t.H[e - 1] = [];
       runQueue(n, e);
     }
   }
@@ -167,15 +190,15 @@ function runLaneEffects(e) {
 function queueStashedOptimisticEffects(e) {
   for (let t = e.I; t !== null; t = t.h) {
     const e = t.p;
-    if (!e.W) continue;
-    if (e.W === EFFECT_TRACKED) {
-      if (!e.H) {
-        e.H = true;
-        e.F.enqueue(EFFECT_USER, e.M);
+    if (!e.M) continue;
+    if (e.M === EFFECT_TRACKED) {
+      if (!e.j) {
+        e.j = true;
+        e.$.enqueue(EFFECT_USER, e.K);
       }
       continue;
     }
-    const n = e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+    const n = e.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
     if (n.P > e.o) n.P = e.o;
     insertIntoHeap(e, n);
   }
@@ -184,66 +207,67 @@ function setProjectionWriteActive(e) {
   projectionWriteActive = e;
 }
 function mergeTransitionState(e, t) {
-  t.j = e;
-  e.$.push(...t.$);
-  for (const n of activeLanes) if (n.K === t) n.K = e;
-  e.Y.push(...t.Y);
-  for (const n of t.Z) e.Z.add(n);
-  for (const [n, i] of t.B) {
-    let t = e.B.get(n);
-    if (!t) e.B.set(n, (t = new Set()));
+  t.Y = e;
+  e.B.push(...t.B);
+  for (const n of activeLanes) if (n.Z === t) n.Z = e;
+  e.q.push(...t.q);
+  for (const n of t.X) e.X.add(n);
+  for (const [n, i] of t.J) {
+    let t = e.J.get(n);
+    if (!t) e.J.set(n, (t = new Set()));
     for (const e of i) t.add(e);
   }
+  for (const n of t.ee) e.ee.add(n);
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.q = undefined;
-    if (n.X !== NOT_PENDING) {
-      n.J = n.X;
-      n.X = NOT_PENDING;
+    n.te = undefined;
+    if (n.U !== NOT_PENDING) {
+      n.ne = n.U;
+      n.U = 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.G;
+    n.G = NOT_PENDING;
+    if (i !== NOT_PENDING && n.ne !== i) insertSubs(n, true);
+    n.Z = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
   for (const t of activeLanes) {
-    const n = e ? t.K === e : !t.K;
+    const n = e ? t.Z === e : !t.Z;
     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.F) {
+      if (t.H[0].length) runQueue(t.H[0], EFFECT_RENDER);
+      if (t.H[1].length) runQueue(t.H[1], EFFECT_USER);
+    }
+    if (t.ie.te === t) t.ie.te = undefined;
+    t.W.clear();
+    t.H[0].length = 0;
+    t.H[1].length = 0;
     activeLanes.delete(t);
-    signalLanes.delete(t.te);
+    signalLanes.delete(t.ie);
   }
 }
 function schedule() {
   if (scheduled) return;
   scheduled = true;
-  if (!globalQueue.ne && !projectionWriteActive) queueMicrotask(flush);
+  if (!globalQueue.re && !projectionWriteActive) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  ie = [[], []];
-  re = [];
+  se = [[], []];
+  oe = [];
   created = clock;
   addChild(e) {
-    this.re.push(e);
+    this.oe.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.re.indexOf(e);
+    const t = this.oe.indexOf(e);
     if (t >= 0) {
-      this.re.splice(t, 1);
+      this.oe.splice(t, 1);
       e.i = null;
     }
   }
@@ -252,81 +276,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.se[e - 1].length) {
+      const t = this.se[e - 1];
+      this.se[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.oe.length; t++) this.oe[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
       if (currentOptimisticLane) {
         const n = findLane(currentOptimisticLane);
-        n.G[e - 1].push(t);
+        n.H[e - 1].push(t);
       } else {
-        this.ie[e - 1].push(t);
+        this.se[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.ie[0].push(...this.ie[0]);
-    e.ie[1].push(...this.ie[1]);
-    this.ie = [[], []];
-    for (let t = 0; t < this.re.length; t++) {
-      let n = this.re[t];
-      let i = e.re[t];
+    e.se[0].push(...this.se[0]);
+    e.se[1].push(...this.se[1]);
+    this.se = [[], []];
+    for (let t = 0; t < this.oe.length; t++) {
+      let n = this.oe[t];
+      let i = e.oe[t];
       if (!i) {
-        i = { ie: [[], []], re: [] };
-        e.re[t] = i;
+        i = { se: [[], []], oe: [] };
+        e.oe[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.se[0].push(...e.se[0]);
+    this.se[1].push(...e.se[1]);
+    for (let t = 0; t < e.oe.length; t++) {
+      const n = e.oe[t];
+      let i = this.oe[t];
       if (i) i.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  ne = false;
-  se = [];
-  Y = [];
-  Z = new Set();
-  static oe;
-  static ue;
-  static ce = null;
+  re = false;
+  ue = [];
+  q = [];
+  X = new Set();
+  static ce;
+  static ae;
+  static le = null;
   flush() {
-    if (this.ne) return;
-    this.ne = true;
+    if (this.re) return;
+    this.re = true;
     try {
-      runHeap(dirtyQueue, GlobalQueue.oe);
+      runHeap(dirtyQueue, GlobalQueue.ce);
       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.ce);
+          this.ue = [];
+          this.q = [];
+          this.X = new Set();
           runLaneEffects(EFFECT_RENDER);
           runLaneEffects(EFFECT_USER);
-          this.stashQueues(e.ae);
+          this.stashQueues(e.fe);
           clock++;
-          scheduled = dirtyQueue.R >= dirtyQueue.P;
-          reassignPendingTransition(e.se);
+          scheduled = dirtyQueue.O >= dirtyQueue.P;
+          reassignPendingTransition(e.ue);
           activeTransition = null;
-          if (!e.$.length && e.Y.length) {
+          if (!e.B.length && !e.J.size && e.q.length) {
             stashedOptimisticReads = new Set();
-            for (let t = 0; t < e.Y.length; t++) {
-              const n = e.Y[t];
-              if (n.L || n.le) continue;
+            for (let t = 0; t < e.q.length; t++) {
+              const n = e.q[t];
+              if (n.L || n.Ee & CONFIG_OWNED_WRITE) continue;
               stashedOptimisticReads.add(n);
               queueStashedOptimisticEffects(n);
             }
@@ -338,36 +362,36 @@ class GlobalQueue extends Queue {
           }
           return;
         }
-        this.se !== activeTransition.se && this.se.push(...activeTransition.se);
-        this.restoreQueues(activeTransition.ae);
+        this.ue !== activeTransition.ue && this.ue.push(...activeTransition.ue);
+        this.restoreQueues(activeTransition.fe);
         transitions.delete(activeTransition);
         const t = activeTransition;
         activeTransition = null;
-        reassignPendingTransition(this.se);
+        reassignPendingTransition(this.ue);
         finalizePureQueue(t);
       } else {
-        if (transitions.size) runHeap(zombieQueue, GlobalQueue.oe);
+        if (transitions.size) runHeap(zombieQueue, GlobalQueue.ce);
         finalizePureQueue();
       }
       clock++;
-      scheduled = dirtyQueue.R >= dirtyQueue.P;
+      scheduled = dirtyQueue.O >= dirtyQueue.P;
       runLaneEffects(EFFECT_RENDER);
       this.run(EFFECT_RENDER);
       runLaneEffects(EFFECT_USER);
       this.run(EFFECT_USER);
       if (false);
     } finally {
-      this.ne = false;
+      this.re = false;
     }
   }
   notify(e, t, n, i) {
     if (t & STATUS_PENDING) {
       if (n & STATUS_PENDING) {
-        const t = i !== undefined ? i : e.fe;
+        const t = i !== undefined ? i : e.Te;
         if (activeTransition && t) {
           const n = t.source;
-          let i = activeTransition.B.get(n);
-          if (!i) activeTransition.B.set(n, (i = new Set()));
+          let i = activeTransition.J.get(n);
+          if (!i) activeTransition.J.set(n, (i = new Set()));
           const r = i.size;
           i.add(e);
           if (i.size !== r) schedule();
@@ -380,17 +404,18 @@ 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: new Map(),
-        Y: [],
-        Z: new Set(),
-        $: [],
-        ae: { ie: [[], []], re: [] },
-        j: false
+        Se: clock,
+        ue: [],
+        J: new Map(),
+        q: [],
+        X: new Set(),
+        B: [],
+        fe: { se: [[], []], oe: [] },
+        Y: false,
+        ee: new Set()
       };
     } else if (e) {
       const t = activeTransition;
@@ -399,71 +424,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.ue !== activeTransition.ue) {
+      for (let e = 0; e < this.ue.length; e++) {
+        const t = this.ue[e];
+        t.Z = activeTransition;
+        activeTransition.ue.push(t);
       }
-      this.se = activeTransition.se;
+      this.ue = activeTransition.ue;
     }
-    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.Z = 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.Z) e.Z = 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 n = e.te || currentOptimisticLane;
   const i = e.de !== undefined;
   for (let r = e.I; r !== null; r = r.h) {
-    if (i && r.p.Te) {
-      r.p.O |= REACTIVE_SNAPSHOT_STALE;
+    if (i && r.p.Ee & CONFIG_IN_SNAPSHOT_SCOPE) {
+      r.p.R |= REACTIVE_SNAPSHOT_STALE;
       continue;
     }
     if (t && n) {
-      r.p.O |= REACTIVE_OPTIMISTIC_DIRTY;
+      r.p.R |= REACTIVE_OPTIMISTIC_DIRTY;
       assignOrMergeLane(r.p, n);
     } else if (t) {
-      r.p.O |= REACTIVE_OPTIMISTIC_DIRTY;
-      r.p.q = undefined;
+      r.p.R |= REACTIVE_OPTIMISTIC_DIRTY;
+      r.p.te = undefined;
     }
     const e = r.p;
-    if (e.W === EFFECT_TRACKED) {
-      if (!e.H) {
-        e.H = true;
-        e.F.enqueue(EFFECT_USER, e.M);
+    if (e.M === EFFECT_TRACKED) {
+      if (!e.j) {
+        e.j = true;
+        e.$.enqueue(EFFECT_USER, e.K);
       }
       continue;
     }
-    const s = r.p.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+    const s = r.p.R & 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.ue;
   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.U !== NOT_PENDING) {
+      n.ne = n.U;
+      n.U = NOT_PENDING;
+      if (n.M && n.M !== EFFECT_TRACKED) n.j = true;
     }
-    if (!(n.Se & STATUS_PENDING)) n.Se &= ~STATUS_UNINITIALIZED;
-    if (n.L) GlobalQueue.ue(n, false, true);
+    if (!(n.Oe & STATUS_PENDING)) n.Oe &= ~STATUS_UNINITIALIZED;
+    if (n.L) GlobalQueue.ae(n, false, true);
   }
   e.length = 0;
 }
@@ -471,39 +496,56 @@ 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.O >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.ce);
   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);
+    if (e && e.ee.size) {
+      for (const t of e.ee) {
+        if (t.R & REACTIVE_DISPOSED) continue;
+        if (t.M === EFFECT_TRACKED) {
+          if (!t.j) {
+            t.j = true;
+            t.$.enqueue(EFFECT_USER, t.K);
+          }
+          continue;
+        }
+        const e = t.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+        if (e.P > t.o) e.P = t.o;
+        insertIntoHeap(t, e);
+      }
+      e.ee.clear();
+    }
+    const t = e ? e.X : globalQueue.X;
+    if (GlobalQueue.le && t.size) {
       for (const e of t) {
-        GlobalQueue.ce(e);
+        GlobalQueue.le(e);
       }
       t.clear();
       schedule();
     }
+    sweepTransientStoreNodes();
     cleanupCompletedLanes(e);
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.re) {
+  for (const t of e.oe) {
     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].Z = activeTransition;
   }
 }
 const globalQueue = new GlobalQueue();
 function flush() {
-  if (globalQueue.ne) {
+  if (globalQueue.re) {
     return;
   }
   while (scheduled || activeTransition) {
@@ -514,22 +556,22 @@ function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function reporterBlocksSource(e, t) {
-  if (e.O & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED)) return false;
-  if (e.Re === t || e.Oe?.has(t)) return true;
+  if (e.R & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED)) return false;
+  if (e.Re === t || e._e?.has(t)) return true;
   for (let n = e.C; n; n = n.D) {
     let e = n.m;
     while (e) {
       if (e === t || e.V === t) return true;
-      e = e._e;
+      e = e.Ie;
     }
   }
-  return !!(e.Se & STATUS_PENDING && e.fe instanceof NotReadyError && e.fe.source === t);
+  return !!(e.Oe & STATUS_PENDING && e.Te instanceof NotReadyError && e.Te.source === t);
 }
 function transitionComplete(e) {
-  if (e.j) return true;
-  if (e.$.length) return false;
+  if (e.Y) return true;
+  if (e.B.length) return false;
   let t = true;
-  for (const [n, i] of e.B) {
+  for (const [n, i] of e.J) {
     let r = false;
     for (const e of i) {
       if (reporterBlocksSource(e, n)) {
@@ -538,32 +580,32 @@ function transitionComplete(e) {
       }
       i.delete(e);
     }
-    if (!r) e.B.delete(n);
-    else if (n.Se & STATUS_PENDING && n.fe?.source === n) {
+    if (!r) e.J.delete(n);
+    else if (n.Oe & STATUS_PENDING && n.Te?.source === n) {
       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.fe instanceof NotReadyError &&
-        i.fe.source !== i
+        "Oe" in i &&
+        i.Oe & STATUS_PENDING &&
+        i.Te instanceof NotReadyError &&
+        i.Te.source !== i
       ) {
         t = false;
         break;
       }
     }
   }
-  t && (e.j = true);
+  t && (e.Y = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.j && typeof e.j === "object") e = e.j;
+  while (e.Y && typeof e.Y === "object") e = e.Y;
   return e;
 }
 function setActiveTransition(e) {
@@ -585,112 +627,113 @@ function getOrCreateLane(e) {
   if (t) {
     return findLane(t);
   }
-  const n = e._e;
-  const i = n?.q ? findLane(n.q) : null;
-  t = { te: e, k: new Set(), G: [[], []], U: null, K: activeTransition, Ie: i };
+  const n = e.Ie;
+  const i = n?.te ? findLane(n.te) : null;
+  t = { ie: e, W: new Set(), H: [[], []], F: null, Z: activeTransition, he: i };
   signalLanes.set(e, t);
   activeLanes.add(t);
-  e.he = false;
+  e.pe = false;
   return t;
 }
 function findLane(e) {
-  while (e.U) e = e.U;
+  while (e.F) e = e.F;
   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.F = e;
+  for (const n of t.W) e.W.add(n);
+  e.H[0].push(...t.H[0]);
+  e.H[1].push(...t.H[1]);
   return e;
 }
 function resolveLane(e) {
-  const t = e.q;
+  const t = e.te;
   if (!t) return undefined;
   const n = findLane(t);
   if (activeLanes.has(n)) return n;
-  e.q = undefined;
+  e.te = undefined;
   return undefined;
 }
 function resolveTransition(e) {
-  return resolveLane(e)?.K ?? e.K;
+  return resolveLane(e)?.Z ?? e.Z;
 }
 function hasActiveOverride(e) {
-  return !!(e.ee !== undefined && e.ee !== NOT_PENDING);
+  return !!(e.G !== undefined && e.G !== NOT_PENDING);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
-  const i = e.q;
+  const i = e.te;
   if (i) {
-    if (i.U) {
-      e.q = t;
+    if (i.F) {
+      e.te = t;
       return;
     }
     const r = findLane(i);
     if (activeLanes.has(r)) {
       if (r !== n && !hasActiveOverride(e)) {
-        if (n.Ie && findLane(n.Ie) === r) {
-          e.q = t;
-        } else if (r.Ie && findLane(r.Ie) === n);
+        if (n.he && findLane(n.he) === r) {
+          e.te = t;
+        } else if (r.he && findLane(r.he) === n);
         else mergeLanes(n, r);
       }
       return;
     }
   }
-  e.q = t;
+  e.te = t;
 }
 function unlinkSubs(e) {
   const t = e.m;
   const n = e.D;
   const i = e.h;
-  const r = e.pe;
-  if (i !== null) i.pe = r;
+  const r = e.Ne;
+  if (i !== null) i.Ne = r;
   else t.Ae = r;
   if (r !== null) r.h = i;
   else {
     t.I = i;
     if (i === null) {
-      t.Ne?.();
-      t.L && !t.Pe && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
+      t.k?.();
+      const e = t;
+      e.L && e.Ee & CONFIG_AUTO_DISPOSE && !(e.R & REACTIVE_ZOMBIE) && unobserved(e);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+  deleteFromHeap(e, e.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
   let t = e.C;
   while (t !== null) {
     t = unlinkSubs(t);
   }
   e.C = null;
-  e.ge = null;
+  e.Pe = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.ge;
+  const n = t.Pe;
   if (n !== null && n.m === e) return;
   let i = null;
-  const r = t.O & REACTIVE_RECOMPUTING_DEPS;
+  const r = t.R & REACTIVE_RECOMPUTING_DEPS;
   if (r) {
     i = n !== null ? n.D : t.C;
     if (i !== null && i.m === e) {
-      t.ge = i;
+      t.Pe = i;
       return;
     }
   }
   const s = e.Ae;
   if (s !== null && s.p === t && (!r || isValidLink(s, t))) return;
-  const o = (t.ge = e.Ae = { m: e, p: t, D: i, pe: s, h: null });
+  const o = (t.Pe = e.Ae = { m: e, p: t, D: i, Ne: s, h: null });
   if (n !== null) n.D = o;
   else t.C = o;
   if (s !== null) s.h = o;
   else e.I = o;
 }
 function isValidLink(e, t) {
-  const n = t.ge;
+  const n = t.Pe;
   if (n !== null) {
     let i = t.C;
     do {
@@ -705,13 +748,13 @@ const PENDING_OWNER = {};
 function markDisposal(e) {
   let t = e.Ce;
   while (t) {
-    t.O |= REACTIVE_ZOMBIE;
-    if (t.O & REACTIVE_IN_HEAP) {
+    t.R |= REACTIVE_ZOMBIE;
+    if (t.R & REACTIVE_IN_HEAP) {
       deleteFromHeap(t, dirtyQueue);
       insertIntoHeap(t, zombieQueue);
     }
     markDisposal(t);
-    t = t.De;
+    t = t.ge;
   }
 }
 function dispose(e) {
@@ -720,39 +763,39 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.C = null;
-  e.ge = null;
+  e.Pe = 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.ye = null;
-  let i = n ? e.ve : e.Ce;
+  if (e.R & REACTIVE_DISPOSED) return;
+  if (t) e.R = REACTIVE_DISPOSED;
+  if (t && e.L) e.De = null;
+  let i = n ? e.ye : e.Ce;
   while (i) {
-    const e = i.De;
+    const e = i.ge;
     if (i.C) {
       const e = i;
-      deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+      deleteFromHeap(e, e.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
       let t = e.C;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
       e.C = null;
-      e.ge = null;
+      e.Pe = null;
     }
     disposeChildren(i, true);
     i = e;
   }
   if (n) {
-    e.ve = null;
+    e.ye = null;
   } else {
     e.Ce = null;
-    e.we = 0;
+    e.ve = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.me : e.Ve;
+  let n = t ? e.me : e.we;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -762,12 +805,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.me = null) : (e.Ve = null);
+  t ? (e.me = null) : (e.we = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.be && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.we++ : n.we);
+  while (n.Ee & CONFIG_TRANSPARENT && n.i) n = n.i;
+  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) {
@@ -790,30 +833,30 @@ function getOwner() {
 }
 function cleanup(e) {
   if (!context) return e;
-  if (!context.Ve) context.Ve = e;
-  else if (Array.isArray(context.Ve)) context.Ve.push(e);
-  else context.Ve = [context.Ve, 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) {
-  return !!(e.O & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
+  return !!(e.R & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
 }
 function createOwner(e) {
   const t = context;
   const n = e?.transparent ?? false;
   const i = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    be: n || undefined,
+    Ee: n ? CONFIG_TRANSPARENT : 0,
     t: true,
     u: t?.t ? t.u : t,
     Ce: null,
-    De: null,
-    Ve: null,
-    F: t?.F ?? globalQueue,
-    Le: t?.Le || defaultContext,
-    we: 0,
+    ge: null,
+    we: null,
+    $: t?.$ ?? globalQueue,
+    Ve: t?.Ve || defaultContext,
+    ve: 0,
     me: null,
-    ve: null,
+    ye: null,
     i: t,
     dispose(e = true) {
       disposeChildren(i, e);
@@ -824,7 +867,7 @@ function createOwner(e) {
     if (e === null) {
       t.Ce = i;
     } else {
-      i.De = e;
+      i.ge = e;
       t.Ce = i;
     }
   }
@@ -835,15 +878,15 @@ function createRoot(e, t) {
   return runWithOwner(n, () => e(n.dispose));
 }
 function addPendingSource(e, t) {
-  if (e.Re === t || e.Oe?.has(t)) return false;
+  if (e.Re === t || e._e?.has(t)) return false;
   if (!e.Re) {
     e.Re = t;
     return true;
   }
-  if (!e.Oe) {
-    e.Oe = new Set([e.Re, t]);
+  if (!e._e) {
+    e._e = new Set([e.Re, t]);
   } else {
-    e.Oe.add(t);
+    e._e.add(t);
   }
   e.Re = undefined;
   return true;
@@ -854,37 +897,37 @@ function removePendingSource(e, t) {
     e.Re = undefined;
     return true;
   }
-  if (!e.Oe?.delete(t)) return false;
-  if (e.Oe.size === 1) {
-    e.Re = e.Oe.values().next().value;
-    e.Oe = undefined;
-  } else if (e.Oe.size === 0) {
-    e.Oe = undefined;
+  if (!e._e?.delete(t)) return false;
+  if (e._e.size === 1) {
+    e.Re = e._e.values().next().value;
+    e._e = undefined;
+  } else if (e._e.size === 0) {
+    e._e = undefined;
   }
   return true;
 }
 function clearPendingSources(e) {
   e.Re = undefined;
-  e.Oe?.clear();
-  e.Oe = undefined;
+  e._e?.clear();
+  e._e = undefined;
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.fe = null;
+    e.Te = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.fe = n;
+    e.Te = n;
     return;
   }
-  const i = e.fe;
+  const i = e.Te;
   if (!(i instanceof NotReadyError) || i.source !== t) {
-    e.fe = new NotReadyError(t);
+    e.Te = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
   for (let n = e.I; n !== null; n = n.h) t(n.p);
-  for (let n = e.A; n !== null; n = n.N) {
+  for (let n = e.N; n !== null; n = n.A) {
     for (let e = n.I; e !== null; e = e.h) t(e.p);
   }
 }
@@ -894,30 +937,30 @@ function settlePendingSource(e) {
   const settle = i => {
     if (n.has(i) || !removePendingSource(i, e)) return;
     n.add(i);
-    i.Ee = clock;
-    const r = i.Re ?? i.Oe?.values().next().value;
+    i.Se = clock;
+    const r = i.Re ?? i._e?.values().next().value;
     if (r) {
       setPendingError(i, r);
       updatePendingSignal(i);
     } else {
-      i.Se &= ~STATUS_PENDING;
+      i.Oe &= ~STATUS_PENDING;
       setPendingError(i);
       updatePendingSignal(i);
-      if (i.Ue) {
-        if (i.W === EFFECT_TRACKED) {
+      if (i.be) {
+        if (i.M === EFFECT_TRACKED) {
           const e = i;
-          if (!e.H) {
-            e.H = true;
-            e.F.enqueue(EFFECT_USER, e.M);
+          if (!e.j) {
+            e.j = true;
+            e.$.enqueue(EFFECT_USER, e.K);
           }
         } else {
-          const e = i.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+          const e = i.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
           if (e.P > i.o) e.P = i.o;
           insertIntoHeap(i, e);
         }
         t = true;
       }
-      i.Ue = false;
+      i.be = false;
     }
     forEachDependent(i, settle);
   };
@@ -929,42 +972,42 @@ 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.ye = null;
+    e.De = null;
     return t;
   }
-  e.ye = t;
+  e.De = t;
   let o;
   const handleError = n => {
-    if (e.ye !== 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.ye !== t) return;
-    if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
+    if (e.De !== t) return;
+    if (e.R & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
     globalQueue.initTransition(resolveTransition(e));
-    const s = !!(e.Se & STATUS_UNINITIALIZED);
+    const s = !!(e.Oe & STATUS_UNINITIALIZED);
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.k.delete(e);
+    if (o) o.W.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.G !== undefined) {
+      if (e.G !== undefined && e.G !== NOT_PENDING) e.U = i;
       else {
-        e.J = i;
+        e.ne = i;
         insertSubs(e);
       }
-      e.Ee = clock;
+      e.Se = clock;
     } else if (o) {
-      const t = e.W;
-      const n = e.J;
-      const r = e.ke;
+      const t = e.M;
+      const n = e.ne;
+      const r = e.Le;
       if ((!t && s) || !r || !r(i, n)) {
-        e.J = i;
-        e.Ee = clock;
-        if (e.xe) {
-          setSignal(e.xe, i);
+        e.ne = i;
+        e.Se = clock;
+        if (e.Ue) {
+          setSignal(e.Ue, i);
         }
         insertSubs(e, true);
       }
@@ -1020,7 +1063,7 @@ function handleAsync(e, t, n) {
             s = n;
             u = true;
             if (n.done) r = true;
-          } else if (e.ye !== t) {
+          } else if (e.De !== t) {
             return;
           } else if (!n.done) asyncWrite(n.value, iterate);
           else {
@@ -1030,7 +1073,7 @@ function handleAsync(e, t, n) {
           }
         },
         n => {
-          if (!c && e.ye === t) {
+          if (!c && e.De === t) {
             r = true;
             handleError(n);
           }
@@ -1054,8 +1097,8 @@ function handleAsync(e, t, n) {
 }
 function clearStatus(e, t = false) {
   clearPendingSources(e);
-  e.Ue = false;
-  e.Se = t ? 0 : e.Se & STATUS_UNINITIALIZED;
+  e.be = false;
+  e.Oe = t ? 0 : e.Oe & STATUS_UNINITIALIZED;
   setPendingError(e);
   updatePendingSignal(e);
   e.Ge?.();
@@ -1065,17 +1108,17 @@ function notifyStatus(e, t, n, i, r) {
     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.G !== 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.Oe = STATUS_PENDING | (e.Oe & STATUS_UNINITIALIZED);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.Se = t | (t !== STATUS_ERROR ? e.Se & STATUS_UNINITIALIZED : 0);
-      e.fe = n;
+      e.Oe = t | (t !== STATUS_ERROR ? e.Oe & STATUS_UNINITIALIZED : 0);
+      e.Te = n;
     }
     updatePendingSignal(e);
   }
@@ -1096,12 +1139,12 @@ function notifyStatus(e, t, n, i, r) {
     return;
   }
   forEachDependent(e, e => {
-    e.Ee = clock;
+    e.Se = clock;
     if (
-      (t === STATUS_PENDING && s && e.Re !== s && !e.Oe?.has(s)) ||
-      (t !== STATUS_PENDING && (e.fe !== n || e.Re || e.Oe))
+      (t === STATUS_PENDING && s && e.Re !== s && !e._e?.has(s)) ||
+      (t !== STATUS_PENDING && (e.Te !== n || e.Re || e._e))
     ) {
-      if (!a && !e.K) globalQueue.se.push(e);
+      if (!a && !e.Z) globalQueue.ue.push(e);
       notifyStatus(e, t, n, a, l);
     }
   });
@@ -1129,8 +1172,8 @@ function enableExternalSource(e) {
     externalSourceConfig = { factory: t, untrack: n };
   }
 }
-GlobalQueue.oe = recompute;
-GlobalQueue.ue = disposeChildren;
+GlobalQueue.ce = recompute;
+GlobalQueue.ae = disposeChildren;
 let tracking = false;
 let stale = false;
 let refreshing = false;
@@ -1143,7 +1186,7 @@ let snapshotCaptureActive = false;
 let snapshotSources = null;
 function ownerInSnapshotScope(e) {
   while (e) {
-    if (e.We) return true;
+    if (e.ke) return true;
     e = e.i;
   }
   return false;
@@ -1153,32 +1196,32 @@ function setSnapshotCapture(e) {
   if (e && !snapshotSources) snapshotSources = new Set();
 }
 function markSnapshotScope(e) {
-  e.We = true;
+  e.ke = true;
 }
 function releaseSnapshotScope(e) {
-  e.We = false;
+  e.ke = false;
   releaseSubtree(e);
   schedule();
 }
 function releaseSubtree(e) {
   let t = e.Ce;
   while (t) {
-    if (t.We) {
-      t = t.De;
+    if (t.ke) {
+      t = t.ge;
       continue;
     }
     if (t.L) {
       const e = t;
-      e.Te = false;
-      if (e.O & REACTIVE_SNAPSHOT_STALE) {
-        e.O &= ~REACTIVE_SNAPSHOT_STALE;
-        e.O |= REACTIVE_DIRTY;
+      e.Ee &= ~CONFIG_IN_SNAPSHOT_SCOPE;
+      if (e.R & REACTIVE_SNAPSHOT_STALE) {
+        e.R &= ~REACTIVE_SNAPSHOT_STALE;
+        e.R |= REACTIVE_DIRTY;
         if (dirtyQueue.P > e.o) dirtyQueue.P = e.o;
         insertIntoHeap(e, dirtyQueue);
       }
     }
     releaseSubtree(t);
-    t = t.De;
+    t = t.ge;
   }
 }
 function clearSnapshots() {
@@ -1192,32 +1235,32 @@ 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);
-    deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-    e.ye = null;
-    if (e.K || n === EFFECT_TRACKED) disposeChildren(e);
+    if (e.Z && (!n || activeTransition) && activeTransition !== e.Z)
+      globalQueue.initTransition(e.Z);
+    deleteFromHeap(e, e.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+    e.De = null;
+    if (e.Z || n === EFFECT_TRACKED) disposeChildren(e);
     else {
       markDisposal(e);
-      e.me = e.Ve;
-      e.ve = e.Ce;
-      e.Ve = null;
+      e.me = e.we;
+      e.ye = e.Ce;
+      e.we = null;
       e.Ce = null;
-      e.we = 0;
+      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 o = !!(e.Se & STATUS_UNINITIALIZED);
+  let i = !!(e.R & REACTIVE_OPTIMISTIC_DIRTY);
+  const r = e.G !== undefined && e.G !== NOT_PENDING;
+  const s = !!(e.Oe & STATUS_PENDING);
+  const o = !!(e.Oe & STATUS_UNINITIALIZED);
   const u = context;
   context = e;
-  e.ge = null;
-  e.O = REACTIVE_RECOMPUTING_DEPS;
-  e.Ee = clock;
-  let c = e.X === NOT_PENDING ? e.J : e.X;
+  e.Pe = null;
+  e.R = REACTIVE_RECOMPUTING_DEPS;
+  e.Se = clock;
+  let c = e.U === NOT_PENDING ? e.ne : e.U;
   let a = e.o;
   let l = tracking;
   let f = currentOptimisticLane;
@@ -1225,39 +1268,55 @@ function recompute(e, t = false) {
   if (i) {
     const t = resolveLane(e);
     if (t) currentOptimisticLane = t;
+  } else if (activeTransition && !t && activeTransition.q.length) {
+    for (let t = e.C; t; t = t.D) {
+      const n = t.m;
+      if (n.R & REACTIVE_OPTIMISTIC_DIRTY) {
+        const t = resolveLane(n);
+        if (t) {
+          i = true;
+          currentOptimisticLane = t;
+          e.R |= REACTIVE_OPTIMISTIC_DIRTY;
+          assignOrMergeLane(e, t);
+          break;
+        }
+      }
+    }
   }
   try {
-    c = handleAsync(e, e.L(c));
+    const n = e.De;
+    const i = e.L(c);
+    c = e.De !== n ? i : handleAsync(e, i);
     clearStatus(e, t);
-    const n = resolveLane(e);
-    if (n) {
-      n.k.delete(e);
-      updatePendingSignal(n.te);
+    const r = resolveLane(e);
+    if (r) {
+      r.W.delete(e);
+      updatePendingSignal(r.ie);
     }
   } 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.ie !== e) {
+        t.W.add(e);
+        e.te = t;
+        updatePendingSignal(t.ie);
       }
     }
-    if (t instanceof NotReadyError) e.Ue = true;
+    if (t instanceof NotReadyError) e.be = true;
     notifyStatus(
       e,
       t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
       t,
       undefined,
-      t instanceof NotReadyError ? e.q : undefined
+      t instanceof NotReadyError ? e.te : undefined
     );
   } finally {
     tracking = l;
-    e.O = REACTIVE_NONE | (t ? e.O & REACTIVE_SNAPSHOT_STALE : 0);
+    e.R = REACTIVE_NONE | (t ? e.R & REACTIVE_SNAPSHOT_STALE : 0);
     context = u;
   }
-  if (!e.fe) {
-    const u = e.ge;
+  if (!e.Te) {
+    const u = e.Pe;
     let l = u !== null ? u.D : e.C;
     if (l !== null) {
       do {
@@ -1266,132 +1325,133 @@ function recompute(e, t = false) {
       if (u !== null) u.D = null;
       else e.C = null;
     }
-    const f = r ? e.ee : e.X === NOT_PENDING ? e.J : e.X;
-    const E = (!n && o) || !e.ke || !e.ke(f, c);
+    const f = r ? e.G : e.U === NOT_PENDING ? e.ne : e.U;
+    const E = (!n && o) || !e.Le || !e.Le(f, c);
     if (E) {
-      const o = r ? e.ee : undefined;
-      if (t || (n && activeTransition !== e.K) || i) {
-        e.J = c;
+      const o = r ? e.G : undefined;
+      if (t || (n && activeTransition !== e.Z) || i) {
+        e.ne = c;
         if (r && i) {
-          e.ee = c;
-          e.X = c;
+          e.G = c;
+          e.U = c;
         }
-      } else e.X = c;
-      if (r && !i && s && !e.he) e.ee = c;
-      if (!r || i || e.ee !== o) insertSubs(e, i || r);
+      } else e.U = c;
+      if (r && !i && s && !e.pe) e.G = c;
+      if (!r || i || e.G !== o) insertSubs(e, i || r);
     } else if (r) {
-      e.X = c;
+      e.U = c;
     } else if (e.o != a) {
       for (let t = e.I; t !== null; t = t.h) {
-        insertIntoHeapHeight(t.p, t.p.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+        insertIntoHeapHeight(t.p, t.p.R & 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));
+  (!t || e.Oe & STATUS_PENDING) && !e.Z && !(activeTransition && r) && globalQueue.ue.push(e);
+  e.Z && n && activeTransition !== e.Z && runInTransition(e.Z, () => recompute(e));
 }
 function updateIfNecessary(e) {
-  if (e.O & REACTIVE_CHECK) {
+  if (e.R & REACTIVE_CHECK) {
     for (let t = e.C; t; t = t.D) {
       const n = t.m;
       const i = n.V || n;
       if (i.L) {
         updateIfNecessary(i);
       }
-      if (e.O & REACTIVE_DIRTY) {
+      if (e.R & REACTIVE_DIRTY) {
         break;
       }
     }
   }
-  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.fe && e.Ee < clock && !e.ye)) {
+  if (e.R & (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);
-}
-function computed(e, t, n) {
-  const i = n?.transparent ?? false;
-  const r = {
-    id: n?.id ?? (i ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
-    be: i || undefined,
-    ke: n?.equals != null ? n.equals : isEqual,
-    le: !!n?.ownedWrite,
-    Ne: n?.unobserved,
-    Ve: null,
-    F: context?.F ?? globalQueue,
-    Le: context?.Le ?? defaultContext,
-    we: 0,
+  e.R = e.R & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
+}
+function computed(e, t) {
+  const n = t?.transparent ?? false;
+  const i = {
+    id: t?.id ?? (n ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
+    Ee:
+      (n ? CONFIG_TRANSPARENT : 0) |
+      (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) |
+      (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) |
+      (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+    Le: t?.equals != null ? t.equals : isEqual,
+    k: t?.unobserved,
+    we: null,
+    $: context?.$ ?? globalQueue,
+    Ve: context?.Ve ?? defaultContext,
+    ve: 0,
     L: e,
-    J: t,
+    ne: undefined,
     o: 0,
-    A: null,
+    N: null,
     S: undefined,
     T: null,
     C: null,
-    ge: null,
+    Pe: null,
     I: null,
     Ae: null,
     i: context,
-    De: null,
+    ge: null,
     Ce: null,
-    O: n?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
-    Se: STATUS_UNINITIALIZED,
-    Ee: clock,
-    X: NOT_PENDING,
+    R: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
+    Oe: STATUS_UNINITIALIZED,
+    Se: clock,
+    U: NOT_PENDING,
     me: null,
-    ve: null,
     ye: null,
-    K: null
+    De: null,
+    Z: null
   };
-  r.T = r;
-  const s = context?.t ? context.u : context;
+  i.T = i;
+  const r = context?.t ? context.u : context;
   if (context) {
     const e = context.Ce;
     if (e === null) {
-      context.Ce = r;
+      context.Ce = i;
     } else {
-      r.De = e;
-      context.Ce = r;
+      i.ge = e;
+      context.Ce = i;
     }
   }
-  if (s) r.o = s.o + 1;
-  if (snapshotCaptureActive && ownerInSnapshotScope(context)) r.Te = true;
+  if (r) i.o = r.o + 1;
   if (externalSourceConfig) {
     const e = signal(undefined, { equals: false, ownedWrite: true });
-    const t = externalSourceConfig.factory(r.L, () => {
+    const t = externalSourceConfig.factory(i.L, () => {
       setSignal(e, undefined);
     });
     cleanup(() => t.dispose());
-    r.L = n => {
+    i.L = n => {
       read(e);
       return t.track(n);
     };
   }
-  !n?.lazy && recompute(r, true);
-  if (snapshotCaptureActive && !n?.lazy) {
-    if (!(r.Se & STATUS_PENDING)) {
-      r.de = r.J === undefined ? NO_SNAPSHOT : r.J;
-      snapshotSources.add(r);
+  !t?.lazy && recompute(i, true);
+  if (snapshotCaptureActive && !t?.lazy) {
+    if (!(i.Oe & STATUS_PENDING)) {
+      i.de = i.ne === undefined ? NO_SNAPSHOT : i.ne;
+      snapshotSources.add(i);
     }
   }
-  return r;
+  return i;
 }
 function signal(e, t, n = null) {
   const i = {
-    ke: t?.equals != null ? t.equals : isEqual,
-    le: !!t?.ownedWrite,
-    He: !!t?.He,
-    Ne: t?.unobserved,
-    J: e,
+    Le: t?.equals != null ? t.equals : isEqual,
+    Ee: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.Fe ? CONFIG_NO_SNAPSHOT : 0),
+    k: t?.unobserved,
+    ne: e,
     I: null,
     Ae: null,
-    Ee: clock,
+    Se: clock,
     V: n,
-    N: n?.A || null,
-    X: NOT_PENDING
+    A: n?.N || null,
+    U: NOT_PENDING
   };
-  n && (n.A = i);
-  if (snapshotCaptureActive && !i.He && !((n?.Se ?? 0) & STATUS_PENDING)) {
+  n && (n.N = i);
+  if (snapshotCaptureActive && !(i.Ee & CONFIG_NO_SNAPSHOT) && !((n?.Oe ?? 0) & STATUS_PENDING)) {
     i.de = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
@@ -1399,13 +1459,13 @@ function signal(e, t, n = null) {
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.ee = NOT_PENDING;
+  n.G = NOT_PENDING;
   return n;
 }
-function optimisticComputed(e, t, n) {
-  const i = computed(e, t, n);
-  i.ee = NOT_PENDING;
-  return i;
+function optimisticComputed(e, t) {
+  const n = computed(e, t);
+  n.G = NOT_PENDING;
+  return n;
 }
 function isEqual(e, t) {
   return e === t;
@@ -1426,7 +1486,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.G !== undefined && e.G !== NOT_PENDING ? e.G : e.ne;
     let r;
     try {
       r = read(t);
@@ -1436,11 +1496,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.Oe & STATUS_PENDING) return i;
+    if (stale && currentOptimisticLane && t.te) {
+      const e = findLane(t.te);
       const n = findLane(currentOptimisticLane);
-      if (e !== n && e.k.size > 0) {
+      if (e !== n && e.W.size > 0) {
         return i;
       }
     }
@@ -1450,8 +1510,8 @@ function read(e) {
     const t = e.V;
     const n = pendingCheckActive;
     pendingCheckActive = false;
-    if (t && e.ee !== undefined) {
-      if (e.ee !== NOT_PENDING && (t.ye || !!(t.Se & STATUS_PENDING))) {
+    if (t && e.G !== undefined) {
+      if (e.G !== NOT_PENDING && (t.De || !!(t.Oe & STATUS_PENDING))) {
         foundPending = true;
       }
       let n = context;
@@ -1464,18 +1524,18 @@ 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;
   const n = e;
   if (typeof n.L === "function") {
     const t = e;
-    if (refreshing && !(t.O & REACTIVE_DISPOSED)) recompute(t);
-    if (t.O & REACTIVE_LAZY) {
-      t.O &= ~REACTIVE_LAZY;
+    if (refreshing && !(t.R & REACTIVE_DISPOSED)) recompute(t);
+    if (t.R & REACTIVE_LAZY) {
+      t.R &= ~REACTIVE_LAZY;
       recompute(t, true);
-    } else if (t.O & REACTIVE_DISPOSED) {
+    } else if (t.R & REACTIVE_DISPOSED) {
       recompute(t, true);
     }
   }
@@ -1483,7 +1543,7 @@ function read(e) {
   if (t && tracking) {
     link(e, t);
     if (i.L) {
-      const n = e.O & REACTIVE_ZOMBIE;
+      const n = e.R & REACTIVE_ZOMBIE;
       if (i.o >= (n ? zombieQueue.P : dirtyQueue.P)) {
         markNode(t);
         markHeap(n ? zombieQueue : dirtyQueue);
@@ -1495,60 +1555,71 @@ function read(e) {
       }
     }
   }
-  if (i.Se & STATUS_PENDING) {
-    if (t && !(stale && i.K && activeTransition !== i.K)) {
+  if (i.Oe & STATUS_PENDING) {
+    if (t && !(stale && i.Z && activeTransition !== i.Z)) {
       if (currentOptimisticLane) {
-        const n = i.q;
+        const n = i.te;
         const r = findLane(currentOptimisticLane);
         if (n && findLane(n) === r && !hasActiveOverride(i)) {
           if (!tracking && e !== t) link(e, t);
-          throw i.fe;
+          throw i.Te;
         }
       } else {
         if (!tracking && e !== t) link(e, t);
-        throw i.fe;
+        throw i.Te;
       }
-    } else if (t && i !== e && i.Se & STATUS_UNINITIALIZED) {
+    } else if (t && i !== e && i.Oe & STATUS_UNINITIALIZED) {
       if (!tracking && e !== t) link(e, t);
-      throw i.fe;
-    } else if (!t && i.Se & STATUS_UNINITIALIZED) {
-      throw i.fe;
+      throw i.Te;
+    } else if (!t && i.Oe & STATUS_UNINITIALIZED) {
+      throw i.Te;
     }
   }
-  if (e.L && e.Se & STATUS_ERROR) {
-    if (e.Ee < clock) {
+  if (e.L && e.Oe & STATUS_ERROR) {
+    if (e.Se < clock) {
       recompute(e);
       return read(e);
-    } else throw e.fe;
+    } else throw e.Te;
   }
-  if (snapshotCaptureActive && t && t.Te) {
+  if (snapshotCaptureActive && t && t.Ee & CONFIG_IN_SNAPSHOT_SCOPE) {
     const n = e.de;
     if (n !== undefined) {
       const i = n === NO_SNAPSHOT ? undefined : n;
-      const r = e.X !== NOT_PENDING ? e.X : e.J;
-      if (r !== i) t.O |= REACTIVE_SNAPSHOT_STALE;
+      const r = e.U !== NOT_PENDING ? e.U : e.ne;
+      if (r !== i) t.R |= 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.G !== undefined && e.G !== NOT_PENDING) {
+    if (t && stale && shouldReadStashedOptimisticValue(e)) return e.ne;
+    return e.G;
+  }
+  if (
+    activeTransition !== null &&
+    currentOptimisticLane !== null &&
+    !latestReadActive &&
+    e.U !== NOT_PENDING &&
+    i === e &&
+    !e.L &&
+    t
+  ) {
+    activeTransition.ee.add(t);
+    return e.ne;
   }
   const r =
     !t ||
     (currentOptimisticLane !== null &&
-      (e.ee !== undefined || e.q || (i === e && stale) || !!(i.Se & STATUS_PENDING))) ||
-    e.X === NOT_PENDING ||
-    (stale && e.K && activeTransition !== e.K)
-      ? e.J
-      : e.X;
+      (e.G !== undefined || e.te || (i === e && stale) || !!(i.Oe & STATUS_PENDING))) ||
+    e.U === NOT_PENDING ||
+    (stale && e.Z && activeTransition !== e.Z)
+      ? e.ne
+      : e.U;
   if (
     !t &&
     i === e &&
     typeof n.L === "function" &&
-    !n.Pe &&
-    !(i.Se & STATUS_PENDING) &&
-    !n.i &&
+    e.Ee & CONFIG_AUTO_DISPOSE &&
+    !(i.Oe & STATUS_PENDING) &&
     !e.I
   ) {
     unobserved(e);
@@ -1556,12 +1627,12 @@ function read(e) {
   return r;
 }
 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.Z && activeTransition !== e.Z) globalQueue.initTransition(e.Z);
+  const n = e.G !== undefined && !projectionWriteActive;
+  const i = e.G !== undefined && e.G !== NOT_PENDING;
+  const r = n ? (i ? e.G : e.ne) : e.U === NOT_PENDING ? e.ne : e.U;
   if (typeof t === "function") t = t(r);
-  const s = !e.ke || !e.ke(r, t) || !!(e.Se & STATUS_UNINITIALIZED);
+  const s = !e.Le || !e.Le(r, t) || !!(e.Oe & STATUS_UNINITIALIZED);
   if (!s) {
     if (n && i && e.L) {
       insertSubs(e, true);
@@ -1570,25 +1641,25 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = e.ee === NOT_PENDING;
+    const n = e.G === NOT_PENDING;
     if (!n) globalQueue.initTransition(resolveTransition(e));
     if (n) {
-      e.X = e.J;
-      globalQueue.Y.push(e);
+      e.U = e.ne;
+      globalQueue.q.push(e);
     }
-    e.he = true;
+    e.pe = true;
     const i = getOrCreateLane(e);
-    e.q = i;
-    e.ee = t;
+    e.te = i;
+    e.G = t;
   } else {
-    if (e.X === NOT_PENDING) globalQueue.se.push(e);
-    e.X = t;
+    if (e.U === NOT_PENDING) globalQueue.ue.push(e);
+    e.U = t;
   }
   updatePendingSignal(e);
-  if (e.xe) {
-    setSignal(e.xe, t);
+  if (e.Ue) {
+    setSignal(e.Ue, t);
   }
-  e.Ee = clock;
+  e.Se = clock;
   insertSubs(e, n);
   schedule();
   return t;
@@ -1606,68 +1677,68 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Fe) {
-    e.Fe = optimisticSignal(false, { ownedWrite: true });
-    if (e._e) {
-      e.Fe._e = e;
+  if (!e.We) {
+    e.We = optimisticSignal(false, { ownedWrite: true });
+    if (e.Ie) {
+      e.We.Ie = e;
     }
-    if (computePendingState(e)) setSignal(e.Fe, true);
+    if (computePendingState(e)) setSignal(e.We, true);
   }
-  return e.Fe;
+  return e.We;
 }
 function computePendingState(e) {
   const t = e;
   const n = e.V;
-  if (n && e.X !== NOT_PENDING) {
-    return !n.ye && !(n.Se & STATUS_PENDING);
+  if (n && e.U !== NOT_PENDING) {
+    return !n.De && !(n.Oe & STATUS_PENDING);
   }
-  if (e.ee !== undefined && e.ee !== NOT_PENDING) {
-    if (t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
-    if (e._e) {
-      const t = e.q ? findLane(e.q) : null;
-      return !!(t && t.k.size > 0);
+  if (e.G !== undefined && e.G !== NOT_PENDING) {
+    if (t.Oe & STATUS_PENDING && !(t.Oe & STATUS_UNINITIALIZED)) return true;
+    if (e.Ie) {
+      const t = e.te ? findLane(e.te) : null;
+      return !!(t && t.W.size > 0);
     }
     return true;
   }
-  if (e.ee !== undefined && e.ee === NOT_PENDING && !e._e) {
+  if (e.G !== undefined && e.G === NOT_PENDING && !e.Ie) {
     return false;
   }
-  if (e.X !== NOT_PENDING && !(t.Se & STATUS_UNINITIALIZED)) return true;
-  return !!(t.Se & STATUS_PENDING && !(t.Se & STATUS_UNINITIALIZED));
+  if (e.U !== NOT_PENDING && !(t.Oe & STATUS_UNINITIALIZED)) return true;
+  return !!(t.Oe & STATUS_PENDING && !(t.Oe & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
-  if (e.Fe) {
+  if (e.We) {
     const t = computePendingState(e);
-    const n = e.Fe;
+    const n = e.We;
     setSignal(n, t);
-    if (!t && n.q) {
+    if (!t && n.te) {
       const t = resolveLane(e);
-      if (t && t.k.size > 0) {
-        const e = findLane(n.q);
+      if (t && t.W.size > 0) {
+        const e = findLane(n.te);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
       signalLanes.delete(n);
-      n.q = undefined;
+      n.te = undefined;
     }
   }
 }
 function getLatestValueComputed(e) {
-  if (!e.xe) {
+  if (!e.Ue) {
     const t = latestReadActive;
     latestReadActive = false;
     const n = pendingCheckActive;
     pendingCheckActive = false;
     const i = context;
     context = null;
-    e.xe = optimisticComputed(() => read(e));
-    e.xe._e = e;
+    e.Ue = optimisticComputed(() => read(e));
+    e.Ue.Ie = e;
     context = i;
     pendingCheckActive = n;
     latestReadActive = t;
   }
-  return e.xe;
+  return e.Ue;
 }
 function staleValues(e, t = true) {
   const n = stale;
@@ -1728,7 +1799,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Ve[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1738,109 +1809,111 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Le = { ...n.Le, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Ve = { ...n.Ve, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Le[e.id]);
+  return !isUndefined(t?.Ve[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
 }
-function effect(e, t, n, i, r) {
-  let s = false;
-  const o = computed(r?.render ? t => staleValues(() => e(t)) : e, i, {
-    ...r,
+function effect(e, t, n, i) {
+  let r = false;
+  const s = !!i?.user;
+  const o = computed(s ? e : t => staleValues(() => e(t)), {
+    ...i,
     equals: () => {
-      o.H = !o.fe;
-      if (s) o.F.enqueue(o.W, runEffect.bind(o));
+      o.j = !o.Te;
+      if (r) o.$.enqueue(o.M, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Qe = i;
-  o.Me = t;
-  o.je = n;
-  o.$e = undefined;
-  o.W = r?.render ? EFFECT_RENDER : EFFECT_USER;
+  o.Ee &= ~CONFIG_AUTO_DISPOSE;
+  o.xe = undefined;
+  o.He = t;
+  o.Me = n;
+  o.Qe = undefined;
+  o.M = s ? EFFECT_USER : EFFECT_RENDER;
   o.Ge = (e, t) => {
-    const n = e !== undefined ? e : o.Se;
-    const i = t !== undefined ? t : o.fe;
+    const n = e !== undefined ? e : o.Oe;
+    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.$.notify(o, STATUS_PENDING, 0);
+      if (o.M === EFFECT_USER) {
         try {
-          return o.je
-            ? o.je(e, () => {
-                o.$e?.();
-                o.$e = undefined;
+          return o.Me
+            ? o.Me(e, () => {
+                o.Qe?.();
+                o.Qe = 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.$.notify(o, STATUS_ERROR, STATUS_ERROR)) throw e;
+    } else if (o.M === EFFECT_RENDER) {
+      o.$.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));
-  s = true;
-  cleanup(() => o.$e?.());
+  !i?.defer &&
+    (o.M === EFFECT_USER || i?.schedule ? o.$.enqueue(o.M, runEffect.bind(o)) : runEffect.call(o));
+  r = true;
+  cleanup(() => o.Qe?.());
 }
 function runEffect() {
-  if (!this.H || this.O & REACTIVE_DISPOSED) return;
-  this.$e?.();
-  this.$e = undefined;
+  if (!this.j || this.R & REACTIVE_DISPOSED) return;
+  this.Qe?.();
+  this.Qe = undefined;
   try {
-    const e = this.Me(this.J, this.Qe);
+    const e = this.He(this.ne, this.xe);
     if (false && e !== undefined && typeof e !== "function");
-    this.$e = e;
+    this.Qe = e;
   } catch (e) {
-    this.fe = 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.Oe |= STATUS_ERROR;
+    if (!this.$.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
   } finally {
-    this.Qe = this.J;
-    this.H = false;
+    this.xe = this.ne;
+    this.j = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.H || n.O & REACTIVE_DISPOSED) return;
+    if (!n.j || n.R & REACTIVE_DISPOSED) return;
     try {
-      n.H = false;
+      n.j = false;
       recompute(n);
     } finally {
     }
   };
   const n = computed(
     () => {
-      n.$e?.();
-      n.$e = undefined;
+      n.Qe?.();
+      n.Qe = undefined;
       const t = staleValues(e);
-      n.$e = t;
+      n.Qe = t;
     },
-    undefined,
     { ...t, lazy: true }
   );
-  n.$e = undefined;
-  n.Ke = true;
-  n.H = true;
-  n.W = EFFECT_TRACKED;
+  n.Qe = undefined;
+  n.Ee = (n.Ee & ~CONFIG_AUTO_DISPOSE) | CONFIG_CHILDREN_FORBIDDEN;
+  n.j = true;
+  n.M = EFFECT_TRACKED;
   n.Ge = (e, t) => {
-    const i = e !== undefined ? e : n.Se;
+    const i = e !== undefined ? e : n.Oe;
     if (i & STATUS_ERROR) {
-      n.F.notify(n, STATUS_PENDING, 0);
-      const e = t !== undefined ? t : n.fe;
-      if (!n.F.notify(n, STATUS_ERROR, STATUS_ERROR)) throw e;
+      n.$.notify(n, STATUS_PENDING, 0);
+      const e = t !== undefined ? t : n.Te;
+      if (!n.$.notify(n, STATUS_ERROR, STATUS_ERROR)) throw e;
     }
   };
-  n.M = run;
-  n.F.enqueue(EFFECT_USER, run);
-  cleanup(() => n.$e?.());
+  n.K = run;
+  n.$.enqueue(EFFECT_USER, run);
+  cleanup(() => n.Qe?.());
 }
 function restoreTransition(e, t) {
   globalQueue.initTransition(e);
@@ -1854,11 +1927,11 @@ function action(e) {
       const r = e(...t);
       globalQueue.initTransition();
       let s = activeTransition;
-      s.$.push(r);
+      s.B.push(r);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.$.indexOf(r);
-        if (o >= 0) s.$.splice(o, 1);
+        const o = s.B.indexOf(r);
+        if (o >= 0) s.B.splice(o, 1);
         setActiveTransition(s);
         schedule();
         t ? i(t) : n(e);
@@ -1890,28 +1963,25 @@ function onCleanup(e) {
   return cleanup(e);
 }
 function accessor(e) {
-  const t = read.bind(null, e);
-  t.$r = true;
-  return t;
+  return read.bind(null, e);
 }
 function createSignal(e, t) {
   if (typeof e === "function") {
-    const n = computed(e, undefined, t);
-    n.Pe = true;
+    const n = computed(e, t);
+    n.Ee &= ~CONFIG_AUTO_DISPOSE;
     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);
-  return accessor(n);
+  return accessor(computed(e, t));
 }
 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);
@@ -1932,8 +2002,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 }
       );
     });
   };
@@ -1955,8 +2024,8 @@ function resolve(e) {
 }
 function createOptimistic(e, t) {
   if (typeof e === "function") {
-    const n = optimisticComputed(e, undefined, t);
-    n.Pe = true;
+    const n = optimisticComputed(e, t);
+    n.Ee &= ~CONFIG_AUTO_DISPOSE;
     return [accessor(n), setSignal.bind(null, n)];
   }
   const n = optimisticSignal(e, t);
@@ -1964,7 +2033,7 @@ function createOptimistic(e, t) {
 }
 function onSettled(e) {
   const t = getOwner();
-  t && !t.Ke
+  t && !(t.Ee & CONFIG_CHILDREN_FORBIDDEN)
     ? createTrackedEffect(() => untrack(e), undefined)
     : globalQueue.enqueue(EFFECT_USER, () => {
         const t = e();
@@ -1998,34 +2067,34 @@ 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, l, f, E, d, T, S, R;
+      let a, l, f, E, T, S, d, O;
       for (
         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])));
+        ((S = getOverrideValue(r, s, u, f, o)) === e[f] || (S && e[f] && n(S) === n(e[f])));
         f++
       ) {
-        applyState(e[f], wrap(T, i), n);
+        applyState(e[f], wrap(S, i), n);
       }
-      const O = new Array(e.length),
+      const R = new Array(e.length),
         _ = new Map();
       for (
-        E = c - 1, d = e.length - 1;
+        E = c - 1, T = 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--
+        T >= f &&
+        ((S = getOverrideValue(r, s, u, E, o)) === e[T] || (S && e[T] && n(S) === n(e[T])));
+        E--, T--
       ) {
-        O[d] = T;
+        R[T] = S;
       }
-      if (f > d || f > E) {
-        for (l = f; l <= d; l++) {
+      if (f > T || f > E) {
+        for (l = f; l <= T; l++) {
           t = true;
           i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], wrap(e[l], i));
         }
         for (; l < e.length; l++) {
           t = true;
-          const r = wrap(O[l], i);
+          const r = wrap(R[l], i);
           i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], r);
           applyState(e[l], r, n);
         }
@@ -2033,27 +2102,27 @@ function applyState(e, t, n) {
         c !== e.length && i[STORE_NODE].length && setSignal(i[STORE_NODE].length, e.length);
         return;
       }
-      S = new Array(d + 1);
-      for (l = d; l >= f; l--) {
-        T = e[l];
-        R = T ? n(T) : T;
-        a = _.get(R);
-        S[l] = a === undefined ? -1 : a;
-        _.set(R, l);
+      d = new Array(T + 1);
+      for (l = T; l >= f; l--) {
+        S = e[l];
+        O = S ? n(S) : S;
+        a = _.get(O);
+        d[l] = a === undefined ? -1 : a;
+        _.set(O, l);
       }
       for (a = f; a <= E; a++) {
-        T = getOverrideValue(r, s, u, a, o);
-        R = T ? n(T) : T;
-        l = _.get(R);
+        S = getOverrideValue(r, s, u, a, o);
+        O = S ? n(S) : S;
+        l = _.get(O);
         if (l !== undefined && l !== -1) {
-          O[l] = T;
-          l = S[l];
-          _.set(R, l);
+          R[l] = S;
+          l = d[l];
+          _.set(O, l);
         }
       }
       for (l = f; l < e.length; l++) {
-        if (l in O) {
-          const t = wrap(O[l], i);
+        if (l in R) {
+          const t = wrap(R[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));
@@ -2081,12 +2150,12 @@ function applyState(e, t, n) {
       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))) {
+      let T = unwrap(e[l]);
+      if (E === T) continue;
+      if (!E || !isWrappable(E) || !isWrappable(T) || (n(E) != null && n(E) !== n(T))) {
         t && setSignal(t, void 0);
-        f && setSignal(f, isWrappable(d) ? wrap(d, i) : d);
-      } else applyState(d, wrap(E, i), n);
+        f && setSignal(f, isWrappable(T) ? wrap(T, i) : T);
+      } else applyState(T, wrap(E, i), n);
     }
   }
   if ((u = i[STORE_HAS])) {
@@ -2129,28 +2198,35 @@ function createProjectionInternal(e, t, n) {
   };
   const s = wrapProjection(t);
   i = computed(() => {
-    const t = getOwner();
-    let i = false;
-    let r;
-    const o = new Proxy(
-      s,
-      createWriteTraps(() => !i || t.ye === r)
-    );
-    storeSetter(o, o => {
-      r = e(o);
-      i = true;
-      const u = handleAsync(t, r, e => {
-        e !== o && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id"));
-      });
-      u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
-    });
-  });
-  i.Pe = true;
+    if (!i) i = getOwner();
+    runProjectionComputed(s, e, n?.key || "id");
+  }, undefined);
+  i.Ee &= ~CONFIG_AUTO_DISPOSE;
   return { store: s, node: i };
 }
 function createProjection(e, t, n) {
   return createProjectionInternal(e, t, n).store;
 }
+function runProjectionComputed(e, t, n, i) {
+  const r = getOwner();
+  let s = false;
+  let o;
+  const u = new Proxy(
+    e,
+    createWriteTraps(() => !s || r.De === 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));
+      i ? i(write) : write();
+    };
+    commit(handleAsync(r, o, commit));
+  });
+  return r;
+}
 function createWriteTraps(e) {
   const t = {
     get(e, n) {
@@ -2260,13 +2336,13 @@ function getNode(e, t, n, i, r = isEqual, s, o) {
     {
       equals: r,
       unobserved() {
-        delete e[t];
+        if (e[t] === u) delete e[t];
       }
     },
     i
   );
   if (s) {
-    u.ee = NOT_PENDING;
+    u.G = NOT_PENDING;
   }
   if (o && t in o) {
     const e = o[t];
@@ -2303,8 +2379,8 @@ function getPropertyDescriptor(e, t, n) {
 function prepareStoreWrite(e, t, n) {
   if (e[STORE_OPTIMISTIC]) {
     const t = e[STORE_FIREWALL];
-    if (t?.K) {
-      globalQueue.initTransition(t.K);
+    if (t?.Z) {
+      globalQueue.initTransition(t.Z);
     }
   }
   const i = e[STORE_VALUE];
@@ -2312,7 +2388,7 @@ function prepareStoreWrite(e, t, n) {
   if (
     snapshotCaptureActive &&
     typeof n !== "symbol" &&
-    !((e[STORE_FIREWALL]?.Se ?? 0) & STATUS_PENDING)
+    !((e[STORE_FIREWALL]?.Oe ?? 0) & STATUS_PENDING)
   ) {
     if (!e[STORE_SNAPSHOT_PROPS]) {
       e[STORE_SNAPSHOT_PROPS] = Object.create(null);
@@ -2327,20 +2403,45 @@ function prepareStoreWrite(e, t, n) {
   if (s) trackOptimisticStore(t);
   return { base: r, overrideKey: o, state: i };
 }
-function notifyStoreProperty(e, t, n, i) {
-  if (e[STORE_HAS]?.[t]) setSignal(e[STORE_HAS][t], n !== "delete");
-  const r = getNodes(e, STORE_NODE);
+function upsertStoreNode(e, t, n, i, r) {
+  if (t[n]) return t[n];
+  const s = isWrappable(i) ? wrap(i, e) : i;
+  const o = getNode(t, n, s, e[STORE_FIREWALL], isEqual, e[STORE_OPTIMISTIC], r);
+  registerTransientStoreNode(o);
+  return o;
+}
+function notifyStoreProperty(e, t, n, i, r, s) {
+  const o = projectionWriteActive || e[STORE_OPTIMISTIC];
+  const u = n !== "delete";
+  const c = e[STORE_HAS]?.[t];
+  if (c) {
+    setSignal(c, u);
+  } else if (!o && n !== "invalidate" && s !== u) {
+    const n = upsertStoreNode(e, getNodes(e, STORE_HAS), t, s);
+    setSignal(n, u);
+  }
+  const a = getNodes(e, STORE_NODE);
   if (n === "set") {
-    r[t] && setSignal(r[t], () => (isWrappable(i) ? wrap(i, e) : i));
+    if (a[t]) {
+      setSignal(a[t], () => (isWrappable(i) ? wrap(i, e) : i));
+    } else if (!o) {
+      const n = upsertStoreNode(e, a, t, r, e[STORE_SNAPSHOT_PROPS]);
+      setSignal(n, () => (isWrappable(i) ? wrap(i, e) : i));
+    }
   } else if (n === "invalidate") {
-    if (r[t]) {
-      setSignal(r[t], {});
-      delete r[t];
+    if (a[t]) {
+      setSignal(a[t], {});
+      delete a[t];
     }
   } else {
-    r[t] && setSignal(r[t], undefined);
+    if (a[t]) {
+      setSignal(a[t], undefined);
+    } else if (!o) {
+      const n = upsertStoreNode(e, a, t, r, e[STORE_SNAPSHOT_PROPS]);
+      setSignal(n, undefined);
+    }
   }
-  r[$TRACK] && setSignal(r[$TRACK], undefined);
+  a[$TRACK] && setSignal(a[$TRACK], undefined);
 }
 let Writing = null;
 const storeTraps = {
@@ -2369,11 +2470,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.G !== undefined && r.G !== NOT_PENDING
+            ? r.G
+            : r.U !== NOT_PENDING
+              ? r.U
+              : r.ne
           : c[t];
       n === $DELETED && (n = undefined);
       if (!isWrappable(n)) return n;
@@ -2415,11 +2516,11 @@ const storeTraps = {
         : e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]
           ? e[STORE_OVERRIDE][t] !== $DELETED
           : t in e[STORE_VALUE];
-    if (!writeOnly(e[$PROXY])) {
-      getObserver() &&
-        read(
-          getNode(getNodes(e, STORE_HAS), t, n, e[STORE_FIREWALL], isEqual, e[STORE_OPTIMISTIC])
-        );
+    if (writeOnly(e[$PROXY])) return n;
+    const i = getNodes(e, STORE_HAS);
+    if (i[t]) return read(i[t]);
+    if (getObserver()) {
+      return read(getNode(i, t, n, e[STORE_FIREWALL], isEqual, e[STORE_OPTIMISTIC]));
     }
     return n;
   },
@@ -2434,29 +2535,39 @@ const storeTraps = {
             : e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]
               ? e[STORE_OVERRIDE][t]
               : r;
-        const c = n?.[$TARGET]?.[STORE_VALUE] ?? n;
-        const a = Array.isArray(o) && t !== "length";
-        const l = a ? parseInt(t) + 1 : 0;
-        const f =
-          a &&
+        const c =
+          e[STORE_OPTIMISTIC_OVERRIDE] && t in e[STORE_OPTIMISTIC_OVERRIDE]
+            ? e[STORE_OPTIMISTIC_OVERRIDE][t] !== $DELETED
+            : e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]
+              ? e[STORE_OVERRIDE][t] !== $DELETED
+              : t in e[STORE_VALUE];
+        const a = n?.[$TARGET]?.[STORE_VALUE] ?? n;
+        const l = Array.isArray(o) && t !== "length";
+        const f = l ? parseInt(t) + 1 : 0;
+        const E =
+          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
               : o.length);
-        const E = a && l > f ? l : undefined;
-        if (u === c && E === undefined) return true;
-        if (c !== undefined && c === r && E === undefined) delete e[s]?.[t];
+        const T = l && f > E ? f : undefined;
+        if (u === a && T === undefined) return true;
+        if (a !== undefined && a === r && T === undefined) delete e[s]?.[t];
         else {
           const n = e[s] || (e[s] = Object.create(null));
-          n[t] = c;
-          if (E !== undefined) n.length = E;
+          n[t] = a;
+          if (T !== undefined) n.length = T;
         }
-        notifyStoreProperty(e, t, "set", c);
-        if (Array.isArray(o)) {
-          const n = getNodes(e, STORE_NODE);
-          const i = t === "length" ? c : E;
-          i !== undefined && n.length && setSignal(n.length, i);
+        notifyStoreProperty(e, t, "set", a, u, c);
+        if (Array.isArray(o) && t !== "length" && T !== undefined) {
+          const t = getNodes(e, STORE_NODE);
+          if (t.length) {
+            setSignal(t.length, T);
+          } else if (!projectionWriteActive && !e[STORE_OPTIMISTIC]) {
+            const n = upsertStoreNode(e, t, "length", E, e[STORE_SNAPSHOT_PROPS]);
+            setSignal(n, T);
+          }
         }
         if (false);
       });
@@ -2495,7 +2606,7 @@ const storeTraps = {
         } else if (e[i] && t in e[i]) {
           delete e[i][t];
         } else return true;
-        notifyStoreProperty(e, t, "delete");
+        notifyStoreProperty(e, t, "delete", undefined, r, true);
       });
     }
     return true;
@@ -2565,7 +2676,7 @@ function createStore(e, t, n) {
   return [r, e => storeSetter(r, e)];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.ce ||= clearOptimisticStore;
+  GlobalQueue.le ||= clearOptimisticStore;
   const i = typeof e === "function";
   const r = i ? t : e;
   const s = i ? e : undefined;
@@ -2582,7 +2693,7 @@ function clearOptimisticStore(e) {
     if (i) {
       for (const e of Reflect.ownKeys(n)) {
         if (i[e]) {
-          i[e].q = undefined;
+          i[e].te = 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;
@@ -2590,7 +2701,7 @@ function clearOptimisticStore(e) {
         }
       }
       if (i[$TRACK]) {
-        i[$TRACK].q = undefined;
+        i[$TRACK].te = undefined;
         setSignal(i[$TRACK], undefined);
       }
     }
@@ -2622,34 +2733,23 @@ function createOptimisticProjectionInternal(e, t, n) {
   };
   const s = wrapProjection(t);
   if (e) {
+    const wrapCommit = e => {
+      setProjectionWriteActive(true);
+      try {
+        e();
+      } finally {
+        setProjectionWriteActive(false);
+      }
+    };
     i = computed(() => {
-      const t = getOwner();
-      let i = false;
-      let r;
-      const o = new Proxy(
-        s,
-        createWriteTraps(() => !i || t.ye === r)
-      );
       setProjectionWriteActive(true);
       try {
-        storeSetter(o, o => {
-          r = e(o);
-          i = true;
-          const u = handleAsync(t, r, 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);
       }
-    });
-    i.Pe = true;
+    }, undefined);
+    i.Ee &= ~CONFIG_AUTO_DISPOSE;
   }
   return { store: s, node: i };
 }
@@ -2909,69 +3009,69 @@ function mapArray(e, t, n) {
   const i = typeof n?.keyed === "function" ? n.keyed : undefined;
   const r = t.length > 1;
   const s = t;
-  const o = computed(
-    updateKeyedMap.bind({
-      Ye: createOwner(),
-      Ze: 0,
-      Be: e,
-      qe: [],
-      Xe: s,
-      ze: [],
-      Je: [],
-      et: i,
-      tt: i || n?.keyed === false ? [] : undefined,
-      nt: r ? [] : undefined,
-      it: n?.fallback
-    })
-  );
-  o.Pe = true;
-  return accessor(o);
+  const o = {
+    je: createOwner(),
+    $e: 0,
+    Ke: e,
+    Ye: [],
+    Be: s,
+    Ze: [],
+    qe: [],
+    ze: i,
+    Xe: i || n?.keyed === false ? [] : undefined,
+    Je: r ? [] : undefined,
+    et: n?.fallback
+  };
+  const u = computed(updateKeyedMap.bind(o));
+  o.je.u = u;
+  u.Ee &= ~CONFIG_AUTO_DISPOSE;
+  return accessor(u);
 }
 const pureOptions = { ownedWrite: true };
 function updateKeyedMap() {
-  const e = this.Be() || [],
+  const e = this.Ke() || [],
     t = e.length;
   e[$TRACK];
-  runWithOwner(this.Ye, () => {
+  runWithOwner(this.je, () => {
     let n,
       i,
-      r = this.tt
+      r = this.Xe
         ? () => {
-            this.tt[i] = signal(e[i], pureOptions);
-            this.nt && (this.nt[i] = signal(i, pureOptions));
-            return this.Xe(accessor(this.tt[i]), this.nt ? accessor(this.nt[i]) : undefined);
+            this.Xe[i] = signal(e[i], pureOptions);
+            this.Je && (this.Je[i] = signal(i, pureOptions));
+            return this.Be(accessor(this.Xe[i]), this.Je ? accessor(this.Je[i]) : undefined);
           }
-        : this.nt
+        : this.Je
           ? () => {
               const t = e[i];
-              this.nt[i] = signal(i, pureOptions);
-              return this.Xe(() => t, accessor(this.nt[i]));
+              this.Je[i] = signal(i, pureOptions);
+              return this.Be(() => t, accessor(this.Je[i]));
             }
           : () => {
               const t = e[i];
-              return this.Xe(() => t);
+              return this.Be(() => t);
             };
     if (t === 0) {
-      if (this.Ze !== 0) {
-        this.Ye.dispose(false);
-        this.Je = [];
+      if (this.$e !== 0) {
+        this.je.dispose(false);
         this.qe = [];
-        this.ze = [];
-        this.Ze = 0;
-        this.tt && (this.tt = []);
-        this.nt && (this.nt = []);
-      }
-      if (this.it && !this.ze[0]) {
-        this.ze[0] = runWithOwner((this.Je[0] = createOwner()), this.it);
-      }
-    } else if (this.Ze === 0) {
-      if (this.Je[0]) this.Je[0].dispose();
-      this.ze = new Array(t);
+        this.Ye = [];
+        this.Ze = [];
+        this.$e = 0;
+        this.Xe && (this.Xe = []);
+        this.Je && (this.Je = []);
+      }
+      if (this.et && !this.Ze[0]) {
+        this.Ze[0] = runWithOwner((this.qe[0] = createOwner()), this.et);
+      }
+    } else if (this.$e === 0) {
+      if (this.qe[0]) this.qe[0].dispose();
+      this.Ze = new Array(t);
       for (i = 0; i < t; i++) {
-        this.qe[i] = e[i];
-        this.ze[i] = runWithOwner((this.Je[i] = createOwner()), r);
+        this.Ye[i] = e[i];
+        this.Ze[i] = runWithOwner((this.qe[i] = createOwner()), r);
       }
-      this.Ze = t;
+      this.$e = t;
     } else {
       let s,
         o,
@@ -2981,157 +3081,157 @@ function updateKeyedMap() {
         l,
         f,
         E = new Array(t),
-        d = new Array(t),
-        T = this.tt ? new Array(t) : undefined,
-        S = this.nt ? new Array(t) : undefined;
+        T = new Array(t),
+        S = this.Xe ? new Array(t) : undefined,
+        d = this.Je ? 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.$e, t);
+        s < o && (this.Ye[s] === e[s] || (this.Xe && compare(this.ze, this.Ye[s], e[s])));
         s++
       ) {
-        if (this.tt) setSignal(this.tt[s], e[s]);
+        if (this.Xe) setSignal(this.Xe[s], e[s]);
       }
       for (
-        o = this.Ze - 1, u = t - 1;
+        o = this.$e - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.qe[o] === e[u] || (this.tt && compare(this.et, this.qe[o], e[u])));
+        (this.Ye[o] === e[u] || (this.Xe && compare(this.ze, this.Ye[o], e[u])));
         o--, u--
       ) {
-        E[u] = this.ze[o];
-        d[u] = this.Je[o];
-        T && (T[u] = this.tt[o]);
-        S && (S[u] = this.nt[o]);
+        E[u] = this.Ze[o];
+        T[u] = this.qe[o];
+        S && (S[u] = this.Xe[o]);
+        d && (d[u] = this.Je[o]);
       }
       l = new Map();
       f = new Array(u + 1);
       for (i = u; i >= s; i--) {
         c = e[i];
-        a = this.et ? this.et(c) : c;
+        a = this.ze ? this.ze(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;
+        c = this.Ye[n];
+        a = this.ze ? this.ze(c) : c;
         i = l.get(a);
         if (i !== undefined && i !== -1) {
-          E[i] = this.ze[n];
-          d[i] = this.Je[n];
-          T && (T[i] = this.tt[n]);
-          S && (S[i] = this.nt[n]);
+          E[i] = this.Ze[n];
+          T[i] = this.qe[n];
+          S && (S[i] = this.Xe[n]);
+          d && (d[i] = this.Je[n]);
           i = f[i];
           l.set(a, i);
-        } else this.Je[n].dispose();
+        } else this.qe[n].dispose();
       }
       for (i = s; i < t; i++) {
         if (i in E) {
-          this.ze[i] = E[i];
-          this.Je[i] = d[i];
-          if (T) {
-            this.tt[i] = T[i];
-            setSignal(this.tt[i], e[i]);
-          }
+          this.Ze[i] = E[i];
+          this.qe[i] = T[i];
           if (S) {
-            this.nt[i] = S[i];
-            setSignal(this.nt[i], i);
+            this.Xe[i] = S[i];
+            setSignal(this.Xe[i], e[i]);
+          }
+          if (d) {
+            this.Je[i] = d[i];
+            setSignal(this.Je[i], i);
           }
         } else {
-          this.ze[i] = runWithOwner((this.Je[i] = createOwner()), r);
+          this.Ze[i] = runWithOwner((this.qe[i] = createOwner()), r);
         }
       }
-      this.ze = this.ze.slice(0, (this.Ze = t));
-      this.qe = e.slice(0);
+      this.Ze = this.Ze.slice(0, (this.$e = t));
+      this.Ye = e.slice(0);
     }
   });
-  return this.ze;
+  return this.Ze;
 }
 function repeat(e, t, n) {
   const i = t;
   const r = computed(
     updateRepeat.bind({
-      Ye: createOwner(),
-      Ze: 0,
-      rt: 0,
-      st: e,
-      Xe: i,
-      Je: [],
-      ze: [],
-      ot: n?.from,
-      it: n?.fallback
+      je: createOwner(),
+      $e: 0,
+      tt: 0,
+      nt: e,
+      Be: i,
+      qe: [],
+      Ze: [],
+      it: n?.from,
+      et: n?.fallback
     })
   );
-  r.Pe = true;
+  r.Ee &= ~CONFIG_AUTO_DISPOSE;
   return accessor(r);
 }
 function updateRepeat() {
-  const e = this.st();
-  const t = this.ot?.() || 0;
-  runWithOwner(this.Ye, () => {
+  const e = this.nt();
+  const t = this.it?.() || 0;
+  runWithOwner(this.je, () => {
     if (e === 0) {
-      if (this.Ze !== 0) {
-        this.Ye.dispose(false);
-        this.Je = [];
-        this.ze = [];
-        this.Ze = 0;
+      if (this.$e !== 0) {
+        this.je.dispose(false);
+        this.qe = [];
+        this.Ze = [];
+        this.$e = 0;
       }
-      if (this.it && !this.ze[0]) {
-        this.ze[0] = runWithOwner((this.Je[0] = createOwner()), this.it);
+      if (this.et && !this.Ze[0]) {
+        this.Ze[0] = runWithOwner((this.qe[0] = createOwner()), this.et);
       }
       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.ze.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.ze.length = e;
+    const i = this.tt + this.$e;
+    if (this.$e === 0 && this.qe[0]) this.qe[0].dispose();
+    for (let e = n; e < i; e++) this.qe[e - this.tt].dispose();
+    if (this.tt < t) {
+      let e = this.tt;
+      while (e < t && e < this.$e) this.qe[e++].dispose();
+      this.qe.splice(0, t - this.tt);
+      this.Ze.splice(0, t - this.tt);
+    } else if (this.tt > t) {
+      let n = i - this.tt - 1;
+      let r = this.tt - t;
+      this.qe.length = this.Ze.length = e;
       while (n >= r) {
-        this.Je[n] = this.Je[n - r];
-        this.ze[n] = this.ze[n - r];
+        this.qe[n] = this.qe[n - r];
+        this.Ze[n] = this.Ze[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.ze[e] = runWithOwner((this.Je[e] = createOwner()), () => this.Xe(e + t));
+        this.Ze[e] = runWithOwner((this.qe[e] = createOwner()), () => this.Be(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.ze[e - t] = runWithOwner((this.Je[e - t] = createOwner()), () => this.Xe(e));
+      this.Ze[e - t] = runWithOwner((this.qe[e - t] = createOwner()), () => this.Be(e));
     }
-    this.ze = this.ze.slice(0, e);
-    this.rt = t;
-    this.Ze = e;
+    this.Ze = this.Ze.slice(0, e);
+    this.tt = t;
+    this.$e = e;
   });
-  return this.ze;
+  return this.Ze;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
-  const n = computed(e, undefined, { lazy: true });
+  const n = computed(e, { lazy: true });
   n.Ge = (e, t) => {
-    const i = e !== undefined ? e : n.Se;
-    const r = t !== undefined ? t : n.fe;
-    n.Se &= ~n.ut;
-    n.F.notify(n, n.ut, i, r);
+    const i = e !== undefined ? e : n.Oe;
+    const r = t !== undefined ? t : n.Te;
+    n.Oe &= ~n.rt;
+    n.$.notify(n, n.rt, i, r);
   };
-  n.ut = t;
-  n.Pe = true;
+  n.rt = t;
+  n.Ee &= ~CONFIG_AUTO_DISPOSE;
   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.$;
+  r.addChild((e.$ = n));
+  cleanup(() => r.removeChild(e.$));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), i);
@@ -3141,168 +3241,215 @@ const ON_INIT = Symbol();
 const RevealControllerContext = createContext(null);
 let _revealUsed = 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.ct.size === 0 && !e.lt;
+  return isRevealController(e) ? e.isReady() : e.st.size === 0 && !e.ot;
+}
+function isSlotMinimallyReady(e) {
+  return isRevealController(e) ? e.isMinimallyReady() : isSlotReady(e);
 }
 function setSlotState(e, t, n, i) {
-  setSignal(e.ft, n);
-  setSignal(e.Et, i);
+  setSignal(e.ut, n);
+  setSignal(e.ct, i);
   if (isRevealController(e)) {
-    if (!n && e.dt === t) e.dt = undefined;
+    if (!n && e.lt === t) e.lt = undefined;
     return e.evaluate(n, i);
   }
-  if (!n && e.Tt === t && e.St) e.Tt = undefined;
+  if (!n && e.ft === t && e.Et) e.ft = undefined;
 }
 class RevealController {
-  Rt;
-  Ot;
-  _t = [];
-  dt;
-  ft = signal(false, { ownedWrite: true, He: true });
-  Et = signal(false, { ownedWrite: true, He: true });
-  It = true;
-  ht = false;
+  Tt;
+  St;
+  dt = [];
+  lt;
+  ut = signal(false, { ownedWrite: true, Fe: true });
+  ct = signal(false, { ownedWrite: true, Fe: true });
+  Ot = true;
+  Rt = true;
+  _t = false;
   constructor(e, t) {
-    this.Rt = e;
-    this.Ot = t;
+    this.Tt = e;
+    this.St = t;
   }
-  At(e) {
-    for (let t = 0; t < this._t.length; t++) {
-      const n = this._t[t];
-      if ((isRevealController(n) ? n.dt : n.Tt) !== this) continue;
+  It(e) {
+    for (let t = 0; t < this.dt.length; t++) {
+      const n = this.dt[t];
+      if ((isRevealController(n) ? n.lt : n.ft) !== this) continue;
       if (e(n) === false) return false;
     }
     return true;
   }
   isReady() {
-    return this.At(isSlotReady);
+    return this.It(isSlotReady);
+  }
+  isMinimallyReady() {
+    const e = untrack(this.Tt);
+    if (e === "together") return this.isReady();
+    if (e === "natural") {
+      let e = false;
+      let t = false;
+      this.It(n => {
+        e = true;
+        if (isSlotMinimallyReady(n)) {
+          t = true;
+          return false;
+        }
+      });
+      return !e || t;
+    }
+    let t = true;
+    this.It(e => {
+      t = isSlotMinimallyReady(e);
+      return false;
+    });
+    return t;
   }
   register(e) {
-    if (this._t.includes(e)) return;
-    this._t.push(e);
-    const t = !!untrack(this.Rt);
-    (setSignal(e.ft, true), setSignal(e.Et, t ? false : !!untrack(this.Ot)));
+    if (this.dt.includes(e)) return;
+    this.dt.push(e);
+    const t = untrack(this.Tt);
+    (setSignal(e.ut, true), setSignal(e.ct, t === "sequential" ? !!untrack(this.St) : false));
     untrack(() => this.evaluate());
   }
   unregister(e) {
-    const t = this._t.indexOf(e);
-    if (t >= 0) this._t.splice(t, 1);
+    const t = this.dt.indexOf(e);
+    if (t >= 0) this.dt.splice(t, 1);
     untrack(() => this.evaluate());
   }
   evaluate(e, t) {
-    if (this.ht) return;
-    this.ht = true;
-    const n = this.It;
+    if (this._t) return;
+    this._t = true;
+    const n = this.Ot;
+    const i = this.Rt;
     try {
-      const n = e ?? read(this.ft),
-        i = !!untrack(this.Ot),
-        r = t ?? i;
-      if (n && r) this.At(e => setSlotState(e, this, true, true));
-      else if (!!untrack(this.Rt)) {
-        const e = this.isReady();
-        this.At(t => setSlotState(t, this, !e, false));
+      const n = e ?? read(this.ut),
+        i = untrack(this.Tt),
+        r = i === "sequential" && !!untrack(this.St),
+        s = t ?? r;
+      if (n) {
+        this.It(e => setSlotState(e, this, true, s));
+      } else if (i === "natural") {
+        this.It(e => {
+          if (isRevealController(e)) {
+            setSignal(e.ct, false);
+            setSignal(e.ut, false);
+            e.evaluate(false, false);
+          } else {
+            setSlotState(e, this, !isSlotReady(e), false);
+          }
+        });
+      } else if (i === "together") {
+        const e = this.It(isSlotMinimallyReady);
+        this.It(t => setSlotState(t, this, !e, false));
       } else {
         let e = false;
-        this.At(t => {
-          if (e) return setSlotState(t, this, true, i);
+        this.It(t => {
+          if (e) return setSlotState(t, this, true, r);
           if (isSlotReady(t)) return setSlotState(t, this, false, false);
           e = true;
-          setSlotState(t, this, true, false);
+          if (isRevealController(t)) {
+            setSignal(t.ct, false);
+            setSignal(t.ut, false);
+            t.evaluate(false, false);
+          } else {
+            setSlotState(t, this, true, false);
+          }
         });
       }
     } finally {
-      this.It = this.isReady();
-      this.ht = false;
+      this.Ot = this.isReady();
+      this.Rt = this.isMinimallyReady();
+      this._t = false;
     }
-    if (this.dt && n !== this.It) this.dt.evaluate();
+    if (this.lt && (n !== this.Ot || i !== this.Rt)) this.lt.evaluate();
   }
 }
 class CollectionQueue extends Queue {
+  ht;
+  st = new Set();
   Nt;
-  ct = new Set();
-  Pt;
-  lt = true;
-  ft = signal(false, { ownedWrite: true, He: true });
-  Et = signal(false, { ownedWrite: true, He: true });
-  Tt;
-  St = false;
-  gt;
-  Ct = ON_INIT;
+  ot = true;
+  ut = signal(false, { ownedWrite: true, Fe: true });
+  ct = signal(false, { ownedWrite: true, Fe: true });
+  ft;
+  Et = false;
+  At;
+  Pt = ON_INIT;
   constructor(e) {
     super();
-    this.Nt = e;
+    this.ht = e;
   }
   run(e) {
-    if (!e || (read(this.ft) && (!_revealUsed || read(this.Et)))) return;
+    if (!e || (read(this.ut) && (!_revealUsed || read(this.ct)))) return;
     return super.run(e);
   }
   notify(e, t, n, i) {
-    if (!(t & this.Nt)) return super.notify(e, t, n, i);
-    if (this.St && this.gt) {
+    if (!(t & this.ht)) return super.notify(e, t, n, i);
+    if (this.Et && this.At) {
       const e = untrack(() => {
         try {
-          return this.gt();
+          return this.At();
         } catch {
           return ON_INIT;
         }
       });
-      if (e !== this.Ct) {
-        this.Ct = e;
-        this.St = false;
-        this.ct.clear();
+      if (e !== this.Pt) {
+        this.Pt = e;
+        this.Et = false;
+        this.st.clear();
       }
     }
-    if (this.Nt & STATUS_PENDING && this.St) return super.notify(e, t, n, i);
-    if (this.Nt & STATUS_PENDING && n & STATUS_ERROR) {
+    if (this.ht & STATUS_PENDING && this.Et) return super.notify(e, t, n, i);
+    if (this.ht & STATUS_PENDING && n & STATUS_ERROR) {
       return super.notify(e, STATUS_ERROR, n, i);
     }
-    if (n & this.Nt) {
-      this.lt = true;
-      const t = i?.source || e.fe?.source;
+    if (n & this.ht) {
+      this.ot = true;
+      const t = i?.source || e.Te?.source;
       if (t) {
-        const e = this.ct.size === 0;
-        this.ct.add(t);
-        if (e) setSignal(this.ft, true);
+        const e = this.st.size === 0;
+        this.st.add(t);
+        if (e) setSignal(this.ut, true);
       }
     }
-    t &= ~this.Nt;
+    t &= ~this.ht;
     return t ? super.notify(e, t, n, i) : true;
   }
   checkSources() {
-    for (const e of this.ct) {
+    for (const e of this.st) {
       if (
-        e.O & REACTIVE_DISPOSED ||
-        (!(e.Se & this.Nt) && !(this.Nt & STATUS_ERROR && e.Se & STATUS_PENDING))
+        e.R & REACTIVE_DISPOSED ||
+        (!(e.Oe & this.ht) && !(this.ht & STATUS_ERROR && e.Oe & STATUS_PENDING))
       )
-        this.ct.delete(e);
+        this.st.delete(e);
     }
-    if (!this.ct.size) {
-      if (this.Nt & STATUS_PENDING && this.lt && !this.St && this.Pt) {
-        this.lt = !!(this.Pt.Se & this.Nt);
+    if (!this.st.size) {
+      if (this.ht & STATUS_PENDING && this.ot && !this.Et && this.Nt) {
+        this.ot = !!(this.Nt.Oe & this.ht);
       } else {
-        this.lt = false;
+        this.ot = false;
       }
-      if (!this.lt) {
-        setSignal(this.ft, false);
-        if (this.gt) {
+      if (!this.ot) {
+        setSignal(this.ut, false);
+        if (this.At) {
           try {
-            this.Ct = untrack(() => this.gt());
+            this.Pt = untrack(() => this.At());
           } catch {}
         }
       }
     }
-    if (_revealUsed) this.Tt?.evaluate();
+    if (_revealUsed) this.ft?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, i) {
   const r = createOwner();
   if (_revealUsed) setContext(RevealControllerContext, null, r);
   const s = new CollectionQueue(e);
-  if (i) s.gt = i;
-  const o = (s.Pt = createBoundChildren(r, t, s, e));
+  if (i) s.At = i;
+  const o = (s.Nt = createBoundChildren(r, t, s, e));
   untrack(() => {
     let t = false;
     try {
@@ -3311,33 +3458,34 @@ function createCollectionBoundary(e, t, n, i) {
       if (e instanceof NotReadyError) t = true;
       else throw e;
     }
-    s.lt = t || !!(o.Se & e) || o.fe instanceof NotReadyError;
+    s.ot = t || !!(o.Oe & e) || o.Te instanceof NotReadyError;
   });
   const u = _revealUsed && e === STATUS_PENDING ? getContext(RevealControllerContext) : null;
   if (u) {
-    s.Tt = u;
+    s.ft = u;
     u.register(s);
     cleanup(() => u.unregister(s));
   }
-  const c = computed(() => {
-    if (!read(s.ft)) {
-      const e = read(o);
-      if (!untrack(() => read(s.ft))) return ((s.St = true), e);
-    }
-    if (_revealUsed && read(s.Et)) return undefined;
-    return n(s);
-  });
-  return accessor(c);
+  return accessor(
+    computed(() => {
+      if (!read(s.ut)) {
+        const e = read(o);
+        if (!untrack(() => read(s.ut))) return ((s.Et = true), e);
+      }
+      if (_revealUsed && read(s.ct)) return undefined;
+      return n(s);
+    })
+  );
 }
 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.ct.values().next().value;
-    const i = n.fe?.cause ?? n.fe;
+    let n = e.st.values().next().value;
+    const i = n.Te?.cause ?? n.Te;
     return t(i, () => {
-      for (const t of e.ct) recompute(t);
+      for (const t of e.st) recompute(t);
       schedule();
     });
   });
@@ -3346,7 +3494,7 @@ function createRevealOrder(e, t) {
   _revealUsed = true;
   const n = createOwner();
   const i = getContext(RevealControllerContext);
-  const r = t?.together || FALSE_ACCESSOR,
+  const r = t?.order || SEQUENTIAL_ACCESSOR,
     s = t?.collapsed || FALSE_ACCESSOR;
   const o = new RevealController(r, s);
   setContext(RevealControllerContext, o, n);
@@ -3358,7 +3506,7 @@ function createRevealOrder(e, t) {
       o.evaluate();
     });
     if (i) {
-      o.dt = i;
+      o.lt = i;
       i.register(o);
       cleanup(() => i.unregister(o));
     }