@solidjs/signals 2.0.0-beta.10 → 2.0.0-beta.12

package/dist/prod.js

@@ -33,12 +33,14 @@ const REACTIVE_DISPOSED = 1 << 6;
 const REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
 const REACTIVE_SNAPSHOT_STALE = 1 << 8;
 const REACTIVE_LAZY = 1 << 9;
+const REACTIVE_MANUAL_WRITE = 1 << 10;
 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 CONFIG_SYNC = 1 << 6;
 const STATUS_PENDING = 1 << 0;
 const STATUS_ERROR = 1 << 1;
 const STATUS_UNINITIALIZED = 1 << 2;
@@ -51,6 +53,16 @@ const STORE_SNAPSHOT_PROPS = "sp";
 const SUPPORTS_PROXY = typeof Proxy === "function";
 const defaultContext = {};
 const $REFRESH = Symbol("refresh");
+const diagnosticListeners = new Set();
+const diagnosticCaptures = new Set();
+let diagnosticSequence = 0;
+const DEV$1 = undefined;
+function emitDiagnostic(e) {
+  const t = { sequence: ++diagnosticSequence, ...e };
+  for (const e of diagnosticListeners) e(t);
+  for (const e of diagnosticCaptures) e.push(t);
+  return t;
+}
 function actualInsertIntoHeap(e, t) {
   const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
   if (n >= e.o) e.o = n + 1;
@@ -58,76 +70,80 @@ function actualInsertIntoHeap(e, t) {
   const r = t.l[i];
   if (r === undefined) t.l[i] = e;
   else {
-    const t = r.T;
-    t.S = e;
-    e.T = t;
-    r.T = e;
+    const t = r.S;
+    t.T = e;
+    e.S = t;
+    r.S = e;
   }
   if (i > t.O) t.O = i;
 }
 function insertIntoHeap(e, t) {
-  let n = e.R;
-  if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS)) return;
+  let n = e._;
+  if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_MANUAL_WRITE)) return;
   if (n & REACTIVE_CHECK) {
-    e.R = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
-  } else e.R = n | REACTIVE_IN_HEAP;
+    e._ = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
+  } else e._ = n | REACTIVE_IN_HEAP;
   if (!(n & REACTIVE_IN_HEAP_HEIGHT)) actualInsertIntoHeap(e, t);
 }
 function insertIntoHeapHeight(e, t) {
-  let n = e.R;
-  if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_IN_HEAP_HEIGHT)) return;
-  e.R = n | REACTIVE_IN_HEAP_HEIGHT;
+  let n = e._;
+  if (
+    n &
+    (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_IN_HEAP_HEIGHT | REACTIVE_MANUAL_WRITE)
+  )
+    return;
+  e._ = n | REACTIVE_IN_HEAP_HEIGHT;
   actualInsertIntoHeap(e, t);
 }
 function deleteFromHeap(e, t) {
-  const n = e.R;
+  const n = e._;
   if (!(n & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
-  e.R = n & -25;
+  e._ = n & -25;
   const i = e.o;
-  if (e.T === e) t.l[i] = undefined;
+  if (e.S === e) t.l[i] = undefined;
   else {
-    const n = e.S;
+    const n = e.T;
     const r = t.l[i];
     const s = n ?? r;
     if (e === r) t.l[i] = n;
-    else e.T.S = n;
-    s.T = e.T;
+    else e.S.T = n;
+    s.S = e.S;
   }
-  e.T = e;
-  e.S = undefined;
+  e.S = e;
+  e.T = undefined;
 }
 function markHeap(e) {
-  if (e._) return;
-  e._ = true;
+  if (e.R) return;
+  e.R = true;
   for (let t = 0; t <= e.O; t++) {
-    for (let n = e.l[t]; n !== undefined; n = n.S) {
-      if (n.R & REACTIVE_IN_HEAP) markNode(n);
+    for (let n = e.l[t]; n !== undefined; n = n.T) {
+      if (n._ & REACTIVE_IN_HEAP) markNode(n);
     }
   }
 }
 function markNode(e, t = REACTIVE_DIRTY) {
-  const n = e.R;
+  const n = e._;
   if ((n & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= t) return;
-  e.R = (n & -4) | t;
-  for (let t = e.I; t !== null; t = t.h) {
-    markNode(t.p, REACTIVE_CHECK);
+  e._ = (n & -4) | t;
+  for (let t = e.I; t !== null; t = t.p) {
+    markNode(t.h, REACTIVE_CHECK);
   }
   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);
+      for (let e = t.I; e !== null; e = e.p) {
+        markNode(e.h, REACTIVE_CHECK);
       }
     }
   }
 }
 function runHeap(e, t) {
-  e._ = false;
-  for (e.P = 0; e.P <= e.O; e.P++) {
-    let n = e.l[e.P];
+  e.R = false;
+  for (e.C = 0; e.C <= e.O; e.C++) {
+    let n = e.l[e.C];
     while (n !== undefined) {
-      if (n.R & REACTIVE_IN_HEAP) t(n);
+      if (n._ & REACTIVE_IN_HEAP) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.P];
+      n = e.l[e.C];
     }
   }
   e.O = 0;
@@ -135,31 +151,105 @@ function runHeap(e, t) {
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.C; t; t = t.D) {
+  for (let t = e.P; t; t = t.D) {
     const e = t.m;
     const i = e.V || e;
     if (i.L && i.o >= n) n = i.o + 1;
   }
   if (e.o !== n) {
     e.o = n;
-    for (let n = e.I; n !== null; n = n.h) {
-      insertIntoHeapHeight(n.p, t);
+    for (let n = e.I; n !== null; n = n.p) {
+      insertIntoHeapHeight(n.h, t);
     }
   }
 }
-const DEV$1 = undefined;
+const signalLanes = new WeakMap();
+const activeLanes = new Set();
+function getOrCreateLane(e) {
+  let t = signalLanes.get(e);
+  if (t) {
+    return findLane(t);
+  }
+  const n = e.U;
+  const i = n?.G ? findLane(n.G) : null;
+  t = { F: e, k: new Set(), W: [[], []], H: null, M: activeTransition, j: i };
+  signalLanes.set(e, t);
+  activeLanes.add(t);
+  e.$ = false;
+  return t;
+}
+function findLane(e) {
+  while (e.H) e = e.H;
+  return e;
+}
+function mergeLanes(e, t) {
+  e = findLane(e);
+  t = findLane(t);
+  if (e === t) return e;
+  t.H = e;
+  for (const n of t.k) e.k.add(n);
+  e.W[0].push(...t.W[0]);
+  e.W[1].push(...t.W[1]);
+  return e;
+}
+function resolveLane(e) {
+  const t = e.G;
+  if (!t) return undefined;
+  const n = findLane(t);
+  if (activeLanes.has(n)) return n;
+  e.G = undefined;
+  return undefined;
+}
+function resolveTransition(e) {
+  return resolveLane(e)?.M ?? e.M;
+}
+function hasActiveOverride(e) {
+  return !!(e.K !== undefined && e.K !== NOT_PENDING);
+}
+function assignOrMergeLane(e, t) {
+  const n = findLane(t);
+  const i = e.G;
+  if (i) {
+    if (i.H) {
+      e.G = t;
+      return;
+    }
+    const r = findLane(i);
+    if (activeLanes.has(r)) {
+      if (r !== n && !hasActiveOverride(e)) {
+        if (n.j && findLane(n.j) === r) {
+          e.G = t;
+        } else if (r.j && findLane(r.j) === n);
+        else mergeLanes(n, r);
+      }
+      return;
+    }
+  }
+  e.G = t;
+}
 const transitions = new Set();
-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 };
+const dirtyQueue = { l: new Array(2e3).fill(undefined), R: false, C: 0, O: 0 };
+const zombieQueue = { l: new Array(2e3).fill(undefined), R: false, C: 0, O: 0 };
 let clock = 0;
 let activeTransition = null;
 let scheduled = false;
+let syncDepth = 0;
 let projectionWriteActive = false;
 let stashedOptimisticReads = null;
 const transientStoreNodes = new Set();
 function registerTransientStoreNode(e) {
   transientStoreNodes.add(e);
 }
+function canUseSimpleSyncFlush(e) {
+  return (
+    transitions.size === 0 &&
+    activeLanes.size === 0 &&
+    e.Y.length === 0 &&
+    e.Z.length === 0 &&
+    e.q.size === 0 &&
+    transientStoreNodes.size === 0
+  );
+}
 function sweepTransientStoreNodes() {
   if (transientStoreNodes.size === 0) return;
   for (const e of transientStoreNodes) {
@@ -167,10 +257,10 @@ function sweepTransientStoreNodes() {
       transientStoreNodes.delete(e);
       continue;
     }
-    if (e.U !== NOT_PENDING) continue;
-    if (e.G !== undefined && e.G !== NOT_PENDING) continue;
+    if (e.B !== NOT_PENDING) continue;
+    if (e.K !== undefined && e.K !== NOT_PENDING) continue;
     transientStoreNodes.delete(e);
-    e.k?.();
+    e.X?.();
   }
 }
 function enforceLoadingBoundary(e) {}
@@ -179,27 +269,27 @@ function shouldReadStashedOptimisticValue(e) {
 }
 function runLaneEffects(e) {
   for (const t of activeLanes) {
-    if (t.F || t.W.size > 0) continue;
-    const n = t.H[e - 1];
+    if (t.H || t.k.size > 0) continue;
+    const n = t.W[e - 1];
     if (n.length) {
-      t.H[e - 1] = [];
+      t.W[e - 1] = [];
       runQueue(n, e);
     }
   }
 }
 function queueStashedOptimisticEffects(e) {
-  for (let t = e.I; t !== null; t = t.h) {
-    const e = t.p;
-    if (!e.M) continue;
-    if (e.M === EFFECT_TRACKED) {
-      if (!e.j) {
-        e.j = true;
-        e.$.enqueue(EFFECT_USER, e.K);
+  for (let t = e.I; t !== null; t = t.p) {
+    const e = t.h;
+    if (!e.J) continue;
+    if (e.J === EFFECT_TRACKED) {
+      if (!e.ee) {
+        e.ee = true;
+        e.te.enqueue(EFFECT_USER, e.ne);
       }
       continue;
     }
-    const n = e.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (n.P > e.o) n.P = e.o;
+    const n = e._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+    if (n.C > e.o) n.C = e.o;
     insertIntoHeap(e, n);
   }
 }
@@ -207,67 +297,67 @@ function setProjectionWriteActive(e) {
   projectionWriteActive = e;
 }
 function mergeTransitionState(e, t) {
-  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()));
+  t.ie = e;
+  e.re.push(...t.re);
+  for (const n of activeLanes) if (n.M === t) n.M = e;
+  e.Z.push(...t.Z);
+  for (const n of t.q) e.q.add(n);
+  for (const [n, i] of t.se) {
+    let t = e.se.get(n);
+    if (!t) e.se.set(n, (t = new Set()));
     for (const e of i) t.add(e);
   }
-  for (const n of t.ee) e.ee.add(n);
+  for (const n of t.oe) e.oe.add(n);
 }
 function resolveOptimisticNodes(e) {
   for (let t = 0; t < e.length; t++) {
     const n = e[t];
-    n.te = undefined;
-    if (n.U !== NOT_PENDING) {
-      n.ne = n.U;
-      n.U = NOT_PENDING;
+    n.G = undefined;
+    if (n.B !== NOT_PENDING) {
+      n.ue = n.B;
+      n.B = NOT_PENDING;
     }
-    const i = n.G;
-    n.G = NOT_PENDING;
-    if (i !== NOT_PENDING && n.ne !== i) insertSubs(n, true);
-    n.Z = null;
+    const i = n.K;
+    n.K = NOT_PENDING;
+    if (i !== NOT_PENDING && n.ue !== i) insertSubs(n, true);
+    n.M = null;
   }
   e.length = 0;
 }
 function cleanupCompletedLanes(e) {
   for (const t of activeLanes) {
-    const n = e ? t.Z === e : !t.Z;
+    const n = e ? t.M === e : !t.M;
     if (!n) continue;
-    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;
+    if (!t.H) {
+      if (t.W[0].length) runQueue(t.W[0], EFFECT_RENDER);
+      if (t.W[1].length) runQueue(t.W[1], EFFECT_USER);
+    }
+    if (t.F.G === t) t.F.G = undefined;
+    t.k.clear();
+    t.W[0].length = 0;
+    t.W[1].length = 0;
     activeLanes.delete(t);
-    signalLanes.delete(t.ie);
+    signalLanes.delete(t.F);
   }
 }
 function schedule() {
   if (scheduled) return;
   scheduled = true;
-  if (!globalQueue.re && !projectionWriteActive) queueMicrotask(flush);
+  if (!syncDepth && !globalQueue.le && !projectionWriteActive) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  se = [[], []];
-  oe = [];
+  ce = [[], []];
+  Y = [];
   created = clock;
   addChild(e) {
-    this.oe.push(e);
+    this.Y.push(e);
     e.i = this;
   }
   removeChild(e) {
-    const t = this.oe.indexOf(e);
+    const t = this.Y.indexOf(e);
     if (t >= 0) {
-      this.oe.splice(t, 1);
+      this.Y.splice(t, 1);
       e.i = null;
     }
   }
@@ -276,81 +366,84 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.se[e - 1].length) {
-      const t = this.se[e - 1];
-      this.se[e - 1] = [];
+    if (this.ce[e - 1].length) {
+      const t = this.ce[e - 1];
+      this.ce[e - 1] = [];
       runQueue(t, e);
     }
-    for (let t = 0; t < this.oe.length; t++) this.oe[t].run?.(e);
+    for (let t = 0; t < this.Y.length; t++) this.Y[t].run?.(e);
   }
   enqueue(e, t) {
     if (e) {
       if (currentOptimisticLane) {
         const n = findLane(currentOptimisticLane);
-        n.H[e - 1].push(t);
+        n.W[e - 1].push(t);
       } else {
-        this.se[e - 1].push(t);
+        this.ce[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    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];
+    e.ce[0].push(...this.ce[0]);
+    e.ce[1].push(...this.ce[1]);
+    this.ce = [[], []];
+    for (let t = 0; t < this.Y.length; t++) {
+      let n = this.Y[t];
+      let i = e.Y[t];
       if (!i) {
-        i = { se: [[], []], oe: [] };
-        e.oe[t] = i;
+        i = { ce: [[], []], Y: [] };
+        e.Y[t] = i;
       }
       n.stashQueues(i);
     }
   }
   restoreQueues(e) {
-    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];
+    this.ce[0].push(...e.ce[0]);
+    this.ce[1].push(...e.ce[1]);
+    for (let t = 0; t < e.Y.length; t++) {
+      const n = e.Y[t];
+      let i = this.Y[t];
       if (i) i.restoreQueues(n);
     }
   }
 }
 class GlobalQueue extends Queue {
-  re = false;
-  ue = [];
-  q = [];
-  X = new Set();
-  static ce;
-  static ae;
-  static le = null;
+  le = false;
+  ae = null;
+  fe = [];
+  Z = [];
+  q = new Set();
+  static Ee;
+  static Se;
+  static Te;
+  static de = null;
   flush() {
-    if (this.re) return;
-    this.re = true;
+    if (this.le) return;
+    this.le = true;
     try {
-      runHeap(dirtyQueue, GlobalQueue.ce);
+      runHeap(dirtyQueue, GlobalQueue.Ee);
       if (activeTransition) {
         const e = transitionComplete(activeTransition);
         if (!e) {
           const e = activeTransition;
-          runHeap(zombieQueue, GlobalQueue.ce);
-          this.ue = [];
-          this.q = [];
-          this.X = new Set();
+          runHeap(zombieQueue, GlobalQueue.Ee);
+          this.ae = null;
+          this.fe = [];
+          this.Z = [];
+          this.q = new Set();
           runLaneEffects(EFFECT_RENDER);
           runLaneEffects(EFFECT_USER);
-          this.stashQueues(e.fe);
+          this.stashQueues(e.Oe);
           clock++;
-          scheduled = dirtyQueue.O >= dirtyQueue.P;
-          reassignPendingTransition(e.ue);
+          scheduled = dirtyQueue.O >= dirtyQueue.C;
+          reassignPendingTransition(e.fe);
           activeTransition = null;
-          if (!e.B.length && !e.J.size && e.q.length) {
+          if (!e.re.length && !e.se.size && e.Z.length) {
             stashedOptimisticReads = new Set();
-            for (let t = 0; t < e.q.length; t++) {
-              const n = e.q[t];
-              if (n.L || n.Ee & CONFIG_OWNED_WRITE) continue;
+            for (let t = 0; t < e.Z.length; t++) {
+              const n = e.Z[t];
+              if (n.L || n._e & CONFIG_OWNED_WRITE) continue;
               stashedOptimisticReads.add(n);
               queueStashedOptimisticEffects(n);
             }
@@ -362,36 +455,44 @@ class GlobalQueue extends Queue {
           }
           return;
         }
-        this.ue !== activeTransition.ue && this.ue.push(...activeTransition.ue);
-        this.restoreQueues(activeTransition.fe);
+        this.fe !== activeTransition.fe && this.fe.push(...activeTransition.fe);
+        this.restoreQueues(activeTransition.Oe);
         transitions.delete(activeTransition);
         const t = activeTransition;
         activeTransition = null;
-        reassignPendingTransition(this.ue);
+        reassignPendingTransition(this.fe);
         finalizePureQueue(t);
       } else {
-        if (transitions.size) runHeap(zombieQueue, GlobalQueue.ce);
-        finalizePureQueue();
+        if (canUseSimpleSyncFlush(this)) {
+          commitPendingNodes();
+          if (dirtyQueue.O >= dirtyQueue.C) {
+            runHeap(dirtyQueue, GlobalQueue.Ee);
+            commitPendingNodes();
+          }
+        } else {
+          if (transitions.size) runHeap(zombieQueue, GlobalQueue.Ee);
+          finalizePureQueue();
+        }
       }
       clock++;
-      scheduled = dirtyQueue.O >= dirtyQueue.P;
-      runLaneEffects(EFFECT_RENDER);
+      scheduled = dirtyQueue.O >= dirtyQueue.C;
+      activeLanes.size && runLaneEffects(EFFECT_RENDER);
       this.run(EFFECT_RENDER);
-      runLaneEffects(EFFECT_USER);
+      activeLanes.size && runLaneEffects(EFFECT_USER);
       this.run(EFFECT_USER);
       if (false);
     } finally {
-      this.re = false;
+      this.le = false;
     }
   }
   notify(e, t, n, i) {
     if (t & STATUS_PENDING) {
       if (n & STATUS_PENDING) {
-        const t = i !== undefined ? i : e.Te;
+        const t = i !== undefined ? i : e.Re;
         if (activeTransition && t) {
           const n = t.source;
-          let i = activeTransition.J.get(n);
-          if (!i) activeTransition.J.set(n, (i = new Set()));
+          let i = activeTransition.se.get(n);
+          if (!i) activeTransition.se.set(n, (i = new Set()));
           const r = i.size;
           i.add(e);
           if (i.size !== r) schedule();
@@ -404,18 +505,18 @@ class GlobalQueue extends Queue {
   initTransition(e) {
     if (e) e = currentTransition(e);
     if (e && e === activeTransition) return;
-    if (!e && activeTransition && activeTransition.Se === clock) return;
+    if (!e && activeTransition && activeTransition.Ie === clock) return;
     if (!activeTransition) {
       activeTransition = e ?? {
-        Se: clock,
-        ue: [],
-        J: new Map(),
-        q: [],
-        X: new Set(),
-        B: [],
-        fe: { se: [[], []], oe: [] },
-        Y: false,
-        ee: new Set()
+        Ie: clock,
+        fe: [],
+        se: new Map(),
+        Z: [],
+        q: new Set(),
+        re: [],
+        Oe: { ce: [[], []], Y: [] },
+        ie: false,
+        oe: new Set()
       };
     } else if (e) {
       const t = activeTransition;
@@ -424,102 +525,138 @@ class GlobalQueue extends Queue {
       activeTransition = e;
     }
     transitions.add(activeTransition);
-    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);
+    activeTransition.Ie = clock;
+    if (this.ae !== null) {
+      this.ae.M = activeTransition;
+      activeTransition.fe.push(this.ae);
+      this.ae = null;
+    }
+    if (this.fe !== activeTransition.fe) {
+      for (let e = 0; e < this.fe.length; e++) {
+        const t = this.fe[e];
+        t.M = activeTransition;
+        activeTransition.fe.push(t);
       }
-      this.ue = activeTransition.ue;
+      this.fe = activeTransition.fe;
     }
-    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);
+    if (this.Z !== activeTransition.Z) {
+      for (let e = 0; e < this.Z.length; e++) {
+        const t = this.Z[e];
+        t.M = activeTransition;
+        activeTransition.Z.push(t);
       }
-      this.q = activeTransition.q;
+      this.Z = activeTransition.Z;
     }
     for (const e of activeLanes) {
-      if (!e.Z) e.Z = activeTransition;
+      if (!e.M) e.M = activeTransition;
     }
-    if (this.X !== activeTransition.X) {
-      for (const e of this.X) activeTransition.X.add(e);
-      this.X = activeTransition.X;
+    if (this.q !== activeTransition.q) {
+      for (const e of this.q) activeTransition.q.add(e);
+      this.q = activeTransition.q;
     }
   }
 }
+function queuePendingNode(e) {
+  if (activeTransition) {
+    globalQueue.fe.push(e);
+    return;
+  }
+  if (globalQueue.ae === null && globalQueue.fe.length === 0) {
+    globalQueue.ae = e;
+    return;
+  }
+  if (globalQueue.ae !== null) {
+    globalQueue.fe.push(globalQueue.ae);
+    globalQueue.ae = null;
+  }
+  globalQueue.fe.push(e);
+}
 function insertSubs(e, t = false) {
-  const n = e.te || currentOptimisticLane;
-  const i = e.de !== undefined;
-  for (let r = e.I; r !== null; r = r.h) {
-    if (i && r.p.Ee & CONFIG_IN_SNAPSHOT_SCOPE) {
-      r.p.R |= REACTIVE_SNAPSHOT_STALE;
+  const n = e.G || currentOptimisticLane;
+  const i = e.pe !== undefined;
+  for (let r = e.I; r !== null; r = r.p) {
+    if (i && r.h._e & CONFIG_IN_SNAPSHOT_SCOPE) {
+      r.h._ |= REACTIVE_SNAPSHOT_STALE;
       continue;
     }
     if (t && n) {
-      r.p.R |= REACTIVE_OPTIMISTIC_DIRTY;
-      assignOrMergeLane(r.p, n);
+      r.h._ |= REACTIVE_OPTIMISTIC_DIRTY;
+      assignOrMergeLane(r.h, n);
     } else if (t) {
-      r.p.R |= REACTIVE_OPTIMISTIC_DIRTY;
-      r.p.te = undefined;
+      r.h._ |= REACTIVE_OPTIMISTIC_DIRTY;
+      r.h.G = undefined;
     }
-    const e = r.p;
-    if (e.M === EFFECT_TRACKED) {
-      if (!e.j) {
-        e.j = true;
-        e.$.enqueue(EFFECT_USER, e.K);
+    const e = r.h;
+    if (e.J === EFFECT_TRACKED) {
+      if (!e.ee) {
+        e.ee = true;
+        e.te.enqueue(EFFECT_USER, e.ne);
       }
       continue;
     }
-    const s = r.p.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (s.P > r.p.o) s.P = r.p.o;
-    insertIntoHeap(r.p, s);
+    const s = r.h._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+    if (s.C > r.h.o) s.C = r.h.o;
+    insertIntoHeap(r.h, s);
   }
 }
+function commitPendingNode(e) {
+  const t = e;
+  if (!t.L) {
+    if (e.B !== NOT_PENDING) {
+      e.ue = e.B;
+      e.B = NOT_PENDING;
+    }
+    return;
+  }
+  if (e.B !== NOT_PENDING) {
+    e.ue = e.B;
+    e.B = NOT_PENDING;
+    if (e.J && e.J !== EFFECT_TRACKED) e.ee = true;
+  }
+  t._ &= ~REACTIVE_MANUAL_WRITE;
+  if (!(t.he & STATUS_PENDING)) t.he &= ~STATUS_UNINITIALIZED;
+  if (t.Ne !== null || t.Ae !== null) GlobalQueue.Se(t, false, true);
+}
 function commitPendingNodes() {
-  const e = globalQueue.ue;
+  if (globalQueue.ae !== null) {
+    commitPendingNode(globalQueue.ae);
+    globalQueue.ae = null;
+  }
+  const e = globalQueue.fe;
   for (let t = 0; t < e.length; t++) {
-    const n = e[t];
-    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.Oe & STATUS_PENDING)) n.Oe &= ~STATUS_UNINITIALIZED;
-    if (n.L) GlobalQueue.ae(n, false, true);
+    commitPendingNode(e[t]);
   }
   e.length = 0;
 }
 function finalizePureQueue(e = null, t = false) {
   const n = !t;
   if (n) commitPendingNodes();
-  if (!t) checkBoundaryChildren(globalQueue);
-  if (dirtyQueue.O >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.ce);
+  if (!t && globalQueue.Y.length) checkBoundaryChildren(globalQueue);
+  const i = dirtyQueue.O >= dirtyQueue.C;
+  if (i) runHeap(dirtyQueue, GlobalQueue.Ee);
   if (n) {
-    commitPendingNodes();
-    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);
+    if (i) commitPendingNodes();
+    resolveOptimisticNodes(e ? e.Z : globalQueue.Z);
+    if (e && e.oe.size) {
+      for (const t of e.oe) {
+        if (t._ & REACTIVE_DISPOSED) continue;
+        if (t.J === EFFECT_TRACKED) {
+          if (!t.ee) {
+            t.ee = true;
+            t.te.enqueue(EFFECT_USER, t.ne);
           }
           continue;
         }
-        const e = t.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-        if (e.P > t.o) e.P = t.o;
+        const e = t._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+        if (e.C > t.o) e.C = t.o;
         insertIntoHeap(t, e);
       }
-      e.ee.clear();
+      e.oe.clear();
     }
-    const t = e ? e.X : globalQueue.X;
-    if (GlobalQueue.le && t.size) {
+    const t = e ? e.q : globalQueue.q;
+    if (GlobalQueue.de && t.size) {
       for (const e of t) {
-        GlobalQueue.le(e);
+        GlobalQueue.de(e);
       }
       t.clear();
       schedule();
@@ -529,23 +666,32 @@ function finalizePureQueue(e = null, t = false) {
   }
 }
 function checkBoundaryChildren(e) {
-  for (const t of e.oe) {
+  for (const t of e.Y) {
     t.checkSources?.();
     checkBoundaryChildren(t);
   }
 }
 function trackOptimisticStore(e) {
-  globalQueue.X.add(e);
+  globalQueue.q.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].Z = activeTransition;
+    e[t].M = activeTransition;
   }
 }
 const globalQueue = new GlobalQueue();
-function flush() {
-  if (globalQueue.re) {
+function flush(e) {
+  if (e) {
+    syncDepth++;
+    try {
+      return e();
+    } finally {
+      flush();
+      syncDepth--;
+    }
+  }
+  if (globalQueue.le) {
     return;
   }
   while (scheduled || activeTransition) {
@@ -556,22 +702,22 @@ function runQueue(e, t) {
   for (let n = 0; n < e.length; n++) e[n](t);
 }
 function reporterBlocksSource(e, t) {
-  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) {
+  if (e._ & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED)) return false;
+  if (e.Ce === t || e.Pe?.has(t)) return true;
+  for (let n = e.P; n; n = n.D) {
     let e = n.m;
     while (e) {
       if (e === t || e.V === t) return true;
-      e = e.Ie;
+      e = e.U;
     }
   }
-  return !!(e.Oe & STATUS_PENDING && e.Te instanceof NotReadyError && e.Te.source === t);
+  return !!(e.he & STATUS_PENDING && e.Re instanceof NotReadyError && e.Re.source === t);
 }
 function transitionComplete(e) {
-  if (e.Y) return true;
-  if (e.B.length) return false;
+  if (e.ie) return true;
+  if (e.re.length) return false;
   let t = true;
-  for (const [n, i] of e.J) {
+  for (const [n, i] of e.se) {
     let r = false;
     for (const e of i) {
       if (reporterBlocksSource(e, n)) {
@@ -580,32 +726,32 @@ function transitionComplete(e) {
       }
       i.delete(e);
     }
-    if (!r) e.J.delete(n);
-    else if (n.Oe & STATUS_PENDING && n.Te?.source === n) {
+    if (!r) e.se.delete(n);
+    else if (n.he & STATUS_PENDING && n.Re?.source === n) {
       t = false;
       break;
     }
   }
   if (t) {
-    for (let n = 0; n < e.q.length; n++) {
-      const i = e.q[n];
+    for (let n = 0; n < e.Z.length; n++) {
+      const i = e.Z[n];
       if (
         hasActiveOverride(i) &&
-        "Oe" in i &&
-        i.Oe & STATUS_PENDING &&
-        i.Te instanceof NotReadyError &&
-        i.Te.source !== i
+        "he" in i &&
+        i.he & STATUS_PENDING &&
+        i.Re instanceof NotReadyError &&
+        i.Re.source !== i
       ) {
         t = false;
         break;
       }
     }
   }
-  t && (e.Y = true);
+  t && (e.ie = true);
   return t;
 }
 function currentTransition(e) {
-  while (e.Y && typeof e.Y === "object") e = e.Y;
+  while (e.ie && typeof e.ie === "object") e = e.ie;
   return e;
 }
 function setActiveTransition(e) {
@@ -620,182 +766,67 @@ function runInTransition(e, t) {
     activeTransition = n;
   }
 }
-const signalLanes = new WeakMap();
-const activeLanes = new Set();
-function getOrCreateLane(e) {
-  let t = signalLanes.get(e);
-  if (t) {
-    return findLane(t);
-  }
-  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.pe = false;
-  return t;
-}
-function findLane(e) {
-  while (e.F) e = e.F;
-  return e;
-}
-function mergeLanes(e, t) {
-  e = findLane(e);
-  t = findLane(t);
-  if (e === t) return e;
-  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.te;
-  if (!t) return undefined;
-  const n = findLane(t);
-  if (activeLanes.has(n)) return n;
-  e.te = undefined;
-  return undefined;
-}
-function resolveTransition(e) {
-  return resolveLane(e)?.Z ?? e.Z;
-}
-function hasActiveOverride(e) {
-  return !!(e.G !== undefined && e.G !== NOT_PENDING);
-}
-function assignOrMergeLane(e, t) {
-  const n = findLane(t);
-  const i = e.te;
-  if (i) {
-    if (i.F) {
-      e.te = t;
-      return;
-    }
-    const r = findLane(i);
-    if (activeLanes.has(r)) {
-      if (r !== n && !hasActiveOverride(e)) {
-        if (n.he && findLane(n.he) === r) {
-          e.te = t;
-        } else if (r.he && findLane(r.he) === n);
-        else mergeLanes(n, r);
-      }
-      return;
-    }
-  }
-  e.te = t;
-}
-function unlinkSubs(e) {
-  const t = e.m;
-  const n = e.D;
-  const i = e.h;
-  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.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.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  let t = e.C;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.C = null;
-  e.Pe = null;
-  disposeChildren(e, true);
-}
-function link(e, t) {
-  const n = t.Pe;
-  if (n !== null && n.m === e) return;
-  let i = null;
-  const r = t.R & REACTIVE_RECOMPUTING_DEPS;
-  if (r) {
-    i = n !== null ? n.D : t.C;
-    if (i !== null && i.m === e) {
-      t.Pe = i;
-      return;
-    }
-  }
-  const s = e.Ae;
-  if (s !== null && s.p === t && (!r || isValidLink(s, t))) return;
-  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.Pe;
-  if (n !== null) {
-    let i = t.C;
-    do {
-      if (i === e) return true;
-      if (i === n) break;
-      i = i.D;
-    } while (i !== null);
-  }
-  return false;
-}
 const PENDING_OWNER = {};
 function markDisposal(e) {
-  let t = e.Ce;
+  let t = e.ge;
   while (t) {
-    t.R |= REACTIVE_ZOMBIE;
-    if (t.R & REACTIVE_IN_HEAP) {
+    t._ |= REACTIVE_ZOMBIE;
+    if (t._ & REACTIVE_IN_HEAP) {
       deleteFromHeap(t, dirtyQueue);
       insertIntoHeap(t, zombieQueue);
     }
     markDisposal(t);
-    t = t.ge;
+    t = t.De;
   }
 }
 function dispose(e) {
-  let t = e.C || null;
+  let t = e.P || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.C = null;
-  e.Pe = null;
+  e.P = null;
+  e.ye = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
-  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.ge;
-    if (i.C) {
-      const e = i;
-      deleteFromHeap(e, e.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      let t = e.C;
+  const i = e._;
+  if (i & REACTIVE_DISPOSED) return;
+  if (t) e._ = i | REACTIVE_DISPOSED;
+  if (t && e.L) e.ve = null;
+  let r = n ? e.Ne : e.ge;
+  while (r) {
+    const e = r.De;
+    if (r.P) {
+      const e = r;
+      deleteFromHeap(e, e._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+      let t = e.P;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.C = null;
-      e.Pe = null;
+      e.P = null;
+      e.ye = null;
     }
-    disposeChildren(i, true);
-    i = e;
+    disposeChildren(r, true);
+    r = e;
   }
   if (n) {
-    e.ye = null;
+    e.Ne = null;
   } else {
-    e.Ce = null;
-    e.ve = 0;
+    e.ge = null;
+    e.me = 0;
+  }
+  if (t && !n && !(i & REACTIVE_ZOMBIE) && e.i !== null && !(e.i._ & REACTIVE_DISPOSED)) {
+    const t = e.be;
+    const n = e.De;
+    if (t !== null) t.De = n;
+    else e.i.ge = n;
+    if (n !== null) n.be = t;
+    e.be = null;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.me : e.we;
+  let n = t ? e.Ae : e.we;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -805,12 +836,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.me = null) : (e.we = null);
+  t ? (e.Ae = null) : (e.we = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.Ee & CONFIG_TRANSPARENT && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.ve++ : n.ve);
+  while (n._e & CONFIG_TRANSPARENT && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.me++ : n.me);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -839,96 +870,170 @@ function cleanup(e) {
   return e;
 }
 function isDisposed(e) {
-  return !!(e.R & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
+  return !!(e._ & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
+}
+function disposeRootSelf(e = true) {
+  disposeChildren(this, e);
 }
 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),
-    Ee: n ? CONFIG_TRANSPARENT : 0,
+    _e: n ? CONFIG_TRANSPARENT : 0,
     t: true,
     u: t?.t ? t.u : t,
-    Ce: null,
     ge: null,
+    De: null,
+    be: null,
     we: null,
-    $: t?.$ ?? globalQueue,
+    te: t?.te ?? globalQueue,
     Ve: t?.Ve || defaultContext,
-    ve: 0,
-    me: null,
-    ye: null,
+    me: 0,
+    Ae: null,
+    Ne: null,
     i: t,
-    dispose(e = true) {
-      disposeChildren(i, e);
-    }
+    dispose: disposeRootSelf
   };
   if (t) {
-    const e = t.Ce;
+    const e = t.ge;
     if (e === null) {
-      t.Ce = i;
+      t.ge = i;
     } else {
-      i.ge = e;
-      t.Ce = i;
+      i.De = e;
+      e.be = i;
+      t.ge = i;
     }
   }
   return i;
 }
 function createRoot(e, t) {
   const n = createOwner(t);
-  return runWithOwner(n, () => e(n.dispose));
+  return runWithOwner(n, () => e(() => n.dispose()));
+}
+function unlinkSubs(e) {
+  const t = e.m;
+  const n = e.D;
+  const i = e.p;
+  const r = e.Le;
+  if (i !== null) i.Le = r;
+  else t.Ue = r;
+  if (r !== null) r.p = i;
+  else {
+    t.I = i;
+    if (i === null) {
+      t.X?.();
+      const e = t;
+      e.L && e._e & CONFIG_AUTO_DISPOSE && !(e._ & REACTIVE_ZOMBIE) && unobserved(e);
+    }
+  }
+  return n;
+}
+function trimStaleDeps(e) {
+  const t = e.ye;
+  let n = t !== null ? t.D : e.P;
+  if (n !== null) {
+    do {
+      n = unlinkSubs(n);
+    } while (n !== null);
+    if (t !== null) t.D = null;
+    else e.P = null;
+  }
+}
+function unobserved(e) {
+  deleteFromHeap(e, e._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+  let t = e.P;
+  while (t !== null) {
+    t = unlinkSubs(t);
+  }
+  e.P = null;
+  e.ye = null;
+  disposeChildren(e, true);
+}
+function link(e, t) {
+  const n = t.ye;
+  if (n !== null && n.m === e) return;
+  let i = null;
+  const r = t._ & REACTIVE_RECOMPUTING_DEPS;
+  if (r) {
+    i = n !== null ? n.D : t.P;
+    if (i !== null && i.m === e) {
+      t.ye = i;
+      return;
+    }
+  }
+  const s = e.Ue;
+  if (s !== null && s.h === t && (!r || isValidLink(s, t))) return;
+  const o = (t.ye = e.Ue = { m: e, h: t, D: i, Le: s, p: null });
+  if (n !== null) n.D = o;
+  else t.P = o;
+  if (s !== null) s.p = o;
+  else e.I = o;
+}
+function isValidLink(e, t) {
+  const n = t.ye;
+  if (n !== null) {
+    let i = t.P;
+    do {
+      if (i === e) return true;
+      if (i === n) break;
+      i = i.D;
+    } while (i !== null);
+  }
+  return false;
 }
 function addPendingSource(e, t) {
-  if (e.Re === t || e._e?.has(t)) return false;
-  if (!e.Re) {
-    e.Re = t;
+  if (e.Ce === t || e.Pe?.has(t)) return false;
+  if (!e.Ce) {
+    e.Ce = t;
     return true;
   }
-  if (!e._e) {
-    e._e = new Set([e.Re, t]);
+  if (!e.Pe) {
+    e.Pe = new Set([e.Ce, t]);
   } else {
-    e._e.add(t);
+    e.Pe.add(t);
   }
-  e.Re = undefined;
+  e.Ce = undefined;
   return true;
 }
 function removePendingSource(e, t) {
-  if (e.Re) {
-    if (e.Re !== t) return false;
-    e.Re = undefined;
+  if (e.Ce) {
+    if (e.Ce !== t) return false;
+    e.Ce = undefined;
     return true;
   }
-  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;
+  if (!e.Pe?.delete(t)) return false;
+  if (e.Pe.size === 1) {
+    e.Ce = e.Pe.values().next().value;
+    e.Pe = undefined;
+  } else if (e.Pe.size === 0) {
+    e.Pe = undefined;
   }
   return true;
 }
 function clearPendingSources(e) {
-  e.Re = undefined;
-  e._e?.clear();
-  e._e = undefined;
+  e.Ce = undefined;
+  e.Pe?.clear();
+  e.Pe = undefined;
 }
 function setPendingError(e, t, n) {
   if (!t) {
-    e.Te = null;
+    e.Re = null;
     return;
   }
   if (n instanceof NotReadyError && n.source === t) {
-    e.Te = n;
+    e.Re = n;
     return;
   }
-  const i = e.Te;
+  const i = e.Re;
   if (!(i instanceof NotReadyError) || i.source !== t) {
-    e.Te = new NotReadyError(t);
+    e.Re = new NotReadyError(t);
   }
 }
 function forEachDependent(e, t) {
-  for (let n = e.I; n !== null; n = n.h) t(n.p);
+  for (let n = e.I; n !== null; n = n.p) t(n.h);
   for (let n = e.N; n !== null; n = n.A) {
-    for (let e = n.I; e !== null; e = e.h) t(e.p);
+    for (let e = n.I; e !== null; e = e.p) t(e.h);
   }
 }
 function settlePendingSource(e) {
@@ -937,30 +1042,30 @@ function settlePendingSource(e) {
   const settle = i => {
     if (n.has(i) || !removePendingSource(i, e)) return;
     n.add(i);
-    i.Se = clock;
-    const r = i.Re ?? i._e?.values().next().value;
+    i.Ie = clock;
+    const r = i.Ce ?? i.Pe?.values().next().value;
     if (r) {
       setPendingError(i, r);
       updatePendingSignal(i);
     } else {
-      i.Oe &= ~STATUS_PENDING;
+      i.he &= ~STATUS_PENDING;
       setPendingError(i);
       updatePendingSignal(i);
-      if (i.be) {
-        if (i.M === EFFECT_TRACKED) {
+      if (i.Ge) {
+        if (i.J === EFFECT_TRACKED) {
           const e = i;
-          if (!e.j) {
-            e.j = true;
-            e.$.enqueue(EFFECT_USER, e.K);
+          if (!e.ee) {
+            e.ee = true;
+            e.te.enqueue(EFFECT_USER, e.ne);
           }
         } else {
-          const e = i.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-          if (e.P > i.o) e.P = i.o;
+          const e = i._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+          if (e.C > i.o) e.C = i.o;
           insertIntoHeap(i, e);
         }
         t = true;
       }
-      i.be = false;
+      i.Ge = false;
     }
     forEachDependent(i, settle);
   };
@@ -968,46 +1073,52 @@ function settlePendingSource(e) {
   if (t) schedule();
 }
 function handleAsync(e, t, n) {
-  const i = typeof t === "object" && t !== null;
-  const r = i && untrack(() => t[Symbol.asyncIterator]);
-  const s = !r && i && untrack(() => typeof t.then === "function");
-  if (!s && !r) {
-    e.De = null;
+  let i = false;
+  let r = false;
+  if (typeof t === "object" && t !== null) {
+    untrack(() => {
+      i = t[Symbol.asyncIterator];
+      r = !i && typeof t.then === "function";
+    });
+  }
+  if (!r && !i) {
+    e.ve = null;
     return t;
   }
-  e.De = t;
-  let o;
+  e.ve = t;
+  let s;
   const handleError = n => {
-    if (e.De !== t) return;
+    if (e.ve !== t) return;
     globalQueue.initTransition(resolveTransition(e));
     notifyStatus(e, n instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n);
-    e.Se = clock;
+    e.Ie = clock;
   };
   const asyncWrite = (i, r) => {
-    if (e.De !== t) return;
-    if (e.R & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
+    if (e.ve !== t) return;
+    if (e._ & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
     globalQueue.initTransition(resolveTransition(e));
-    const s = !!(e.Oe & STATUS_UNINITIALIZED);
+    const s = !!(e.he & STATUS_UNINITIALIZED);
+    trimStaleDeps(e);
     clearStatus(e);
     const o = resolveLane(e);
-    if (o) o.W.delete(e);
+    if (o) o.k.delete(e);
     if (n) n(i);
-    else if (e.G !== undefined) {
-      if (e.G !== undefined && e.G !== NOT_PENDING) e.U = i;
+    else if (e.K !== undefined) {
+      if (e.K !== undefined && e.K !== NOT_PENDING) e.B = i;
       else {
-        e.ne = i;
+        e.ue = i;
         insertSubs(e);
       }
-      e.Se = clock;
+      e.Ie = clock;
     } else if (o) {
-      const t = e.M;
-      const n = e.ne;
-      const r = e.Le;
+      const t = e.J;
+      const n = e.ue;
+      const r = e.Fe;
       if ((!t && s) || !r || !r(i, n)) {
-        e.ne = i;
-        e.Se = clock;
-        if (e.Ue) {
-          setSignal(e.Ue, i);
+        e.ue = i;
+        e.Ie = clock;
+        if (e.ke) {
+          setSignal(e.ke, i);
         }
         insertSubs(e, true);
       }
@@ -1019,13 +1130,13 @@ function handleAsync(e, t, n) {
     flush();
     r?.();
   };
-  if (s) {
+  if (r) {
     let n = false,
       i = true;
     t.then(
       e => {
         if (i) {
-          o = e;
+          s = e;
           n = true;
         } else asyncWrite(e);
       },
@@ -1039,7 +1150,7 @@ function handleAsync(e, t, n) {
       throw new NotReadyError(context);
     }
   }
-  if (r) {
+  if (i) {
     const n = t[Symbol.asyncIterator]();
     let i = false;
     let r = false;
@@ -1054,16 +1165,16 @@ function handleAsync(e, t, n) {
       } catch {}
     });
     const iterate = () => {
-      let s,
+      let o,
         u = false,
-        c = true;
+        l = true;
       n.next().then(
         n => {
-          if (c) {
-            s = n;
+          if (l) {
+            o = n;
             u = true;
             if (n.done) r = true;
-          } else if (e.De !== t) {
+          } else if (e.ve !== t) {
             return;
           } else if (!n.done) asyncWrite(n.value, iterate);
           else {
@@ -1073,79 +1184,79 @@ function handleAsync(e, t, n) {
           }
         },
         n => {
-          if (!c && e.De === t) {
+          if (!l && e.ve === t) {
             r = true;
             handleError(n);
           }
         }
       );
-      c = false;
-      if (u && !s.done) {
-        o = s.value;
+      l = false;
+      if (u && !o.done) {
+        s = o.value;
         i = true;
         return iterate();
       }
-      return u && s.done;
+      return u && o.done;
     };
-    const s = iterate();
-    if (!i && !s) {
+    const o = iterate();
+    if (!i && !o) {
       globalQueue.initTransition(resolveTransition(e));
       throw new NotReadyError(context);
     }
   }
-  return o;
+  return s;
 }
 function clearStatus(e, t = false) {
-  clearPendingSources(e);
-  e.be = false;
-  e.Oe = t ? 0 : e.Oe & STATUS_UNINITIALIZED;
-  setPendingError(e);
-  updatePendingSignal(e);
-  e.Ge?.();
+  if (e.Ce || e.Pe) clearPendingSources(e);
+  if (e.Ge) e.Ge = false;
+  e.he = t ? 0 : e.he & STATUS_UNINITIALIZED;
+  if (e.Re) setPendingError(e);
+  if (e.We) updatePendingSignal(e);
+  if (e.xe) e.xe();
 }
 function notifyStatus(e, t, n, i, r) {
   if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const s = t === STATUS_PENDING && n instanceof NotReadyError ? n.source : undefined;
   const o = s === e;
-  const u = t === STATUS_PENDING && e.G !== undefined && !o;
-  const c = u && hasActiveOverride(e);
+  const u = t === STATUS_PENDING && e.K !== undefined && !o;
+  const l = u && hasActiveOverride(e);
   if (!i) {
     if (t === STATUS_PENDING && s) {
       addPendingSource(e, s);
-      e.Oe = STATUS_PENDING | (e.Oe & STATUS_UNINITIALIZED);
+      e.he = STATUS_PENDING | (e.he & STATUS_UNINITIALIZED);
       setPendingError(e, s, n);
     } else {
       clearPendingSources(e);
-      e.Oe = t | (t !== STATUS_ERROR ? e.Oe & STATUS_UNINITIALIZED : 0);
-      e.Te = n;
+      e.he = t | (t !== STATUS_ERROR ? e.he & STATUS_UNINITIALIZED : 0);
+      e.Re = n;
     }
     updatePendingSignal(e);
   }
   if (r && !i) {
     assignOrMergeLane(e, r);
   }
-  const a = i || c;
-  const l = i || u ? undefined : r;
-  if (e.Ge) {
+  const c = i || l;
+  const a = i || u ? undefined : r;
+  if (e.xe) {
     if (i && t === STATUS_PENDING) {
       return;
     }
-    if (a) {
-      e.Ge(t, n);
+    if (c) {
+      e.xe(t, n);
     } else {
-      e.Ge();
+      e.xe();
     }
     return;
   }
   forEachDependent(e, e => {
-    e.Se = clock;
+    e.Ie = clock;
     if (
-      (t === STATUS_PENDING && s && e.Re !== s && !e._e?.has(s)) ||
-      (t !== STATUS_PENDING && (e.Te !== n || e.Re || e._e))
+      (t === STATUS_PENDING && s && e.Ce !== s && !e.Pe?.has(s)) ||
+      (t !== STATUS_PENDING && (e.Re !== n || e.Ce || e.Pe))
     ) {
-      if (!a && !e.Z) globalQueue.ue.push(e);
-      notifyStatus(e, t, n, a, l);
+      if (!c && !e.M) queuePendingNode(e);
+      notifyStatus(e, t, n, c, a);
     }
   });
 }
@@ -1172,8 +1283,8 @@ function enableExternalSource(e) {
     externalSourceConfig = { factory: t, untrack: n };
   }
 }
-GlobalQueue.ce = recompute;
-GlobalQueue.ae = disposeChildren;
+GlobalQueue.Ee = recompute;
+GlobalQueue.Se = disposeChildren;
 let tracking = false;
 let stale = false;
 let refreshing = false;
@@ -1186,7 +1297,7 @@ let snapshotCaptureActive = false;
 let snapshotSources = null;
 function ownerInSnapshotScope(e) {
   while (e) {
-    if (e.ke) return true;
+    if (e.He) return true;
     e = e.i;
   }
   return false;
@@ -1196,38 +1307,38 @@ function setSnapshotCapture(e) {
   if (e && !snapshotSources) snapshotSources = new Set();
 }
 function markSnapshotScope(e) {
-  e.ke = true;
+  e.He = true;
 }
 function releaseSnapshotScope(e) {
-  e.ke = false;
+  e.He = false;
   releaseSubtree(e);
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.Ce;
+  let t = e.ge;
   while (t) {
-    if (t.ke) {
-      t = t.ge;
+    if (t.He) {
+      t = t.De;
       continue;
     }
     if (t.L) {
       const e = t;
-      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;
+      e._e &= ~CONFIG_IN_SNAPSHOT_SCOPE;
+      if (e._ & REACTIVE_SNAPSHOT_STALE) {
+        e._ &= ~REACTIVE_SNAPSHOT_STALE;
+        e._ |= REACTIVE_DIRTY;
+        if (dirtyQueue.C > e.o) dirtyQueue.C = e.o;
         insertIntoHeap(e, dirtyQueue);
       }
     }
     releaseSubtree(t);
-    t = t.ge;
+    t = t.De;
   }
 }
 function clearSnapshots() {
   if (snapshotSources) {
     for (const e of snapshotSources) {
-      delete e.de;
+      delete e.pe;
       delete e[STORE_SNAPSHOT_PROPS];
     }
     snapshotSources = null;
@@ -1235,236 +1346,307 @@ function clearSnapshots() {
   snapshotCaptureActive = false;
 }
 function recompute(e, t = false) {
-  const n = e.M;
+  const n = e.J;
   if (!t) {
-    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 {
+    if (e.M && (!n || activeTransition) && activeTransition !== e.M)
+      globalQueue.initTransition(e.M);
+    deleteFromHeap(e, e._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+    e.ve = null;
+    if (e.M || n === EFFECT_TRACKED) disposeChildren(e);
+    else if (e.ge !== null || e.we !== null) {
       markDisposal(e);
-      e.me = e.we;
-      e.ye = e.Ce;
+      e.Ae = e.we;
+      e.Ne = e.ge;
       e.we = null;
-      e.Ce = null;
-      e.ve = 0;
-    }
-  }
-  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);
+      e.ge = null;
+      e.me = 0;
+    } else;
+  }
+  let i = !!(e._ & REACTIVE_OPTIMISTIC_DIRTY);
+  const r = e.K !== undefined && e.K !== NOT_PENDING;
+  const s = !!(e.he & STATUS_PENDING);
+  const o = !!(e.he & STATUS_UNINITIALIZED);
   const u = context;
   context = e;
-  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;
+  e.ye = null;
+  e._ = REACTIVE_RECOMPUTING_DEPS;
+  e.Ie = clock;
+  let l = e.B === NOT_PENDING ? e.ue : e.B;
+  let c = e.o;
+  let a = tracking;
   let f = currentOptimisticLane;
   tracking = true;
   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) {
+  } else if (activeTransition && !t && activeTransition.Z.length) {
+    for (let t = e.P; t; t = t.D) {
       const n = t.m;
-      if (n.R & REACTIVE_OPTIMISTIC_DIRTY) {
+      if (n._ & REACTIVE_OPTIMISTIC_DIRTY) {
         const t = resolveLane(n);
         if (t) {
           i = true;
           currentOptimisticLane = t;
-          e.R |= REACTIVE_OPTIMISTIC_DIRTY;
+          e._ |= REACTIVE_OPTIMISTIC_DIRTY;
           assignOrMergeLane(e, t);
           break;
         }
       }
     }
   }
+  const E = n && n !== EFFECT_USER;
+  const S = stale;
+  if (E) stale = true;
   try {
-    const n = e.De;
-    const i = e.L(c);
-    c = e.De !== n ? i : handleAsync(e, i);
+    if (!false && e._e & CONFIG_SYNC) {
+      l = e.L(l);
+      e.ve = null;
+    } else {
+      const t = e.ve;
+      const n = e.L(l);
+      const i = typeof n === "object" && n !== null;
+      const r = e.ve !== t;
+      l = r || !i ? n : handleAsync(e, n);
+      if (!r && !i) e.ve = null;
+    }
     clearStatus(e, t);
-    const r = resolveLane(e);
-    if (r) {
-      r.W.delete(e);
-      updatePendingSignal(r.ie);
+    if (e.G) {
+      const t = resolveLane(e);
+      if (t) {
+        t.k.delete(e);
+        updatePendingSignal(t.F);
+      }
     }
   } catch (t) {
     if (t instanceof NotReadyError && currentOptimisticLane) {
       const t = findLane(currentOptimisticLane);
-      if (t.ie !== e) {
-        t.W.add(e);
-        e.te = t;
-        updatePendingSignal(t.ie);
+      if (t.F !== e) {
+        t.k.add(e);
+        e.G = t;
+        updatePendingSignal(t.F);
       }
     }
-    if (t instanceof NotReadyError) e.be = true;
+    if (t instanceof NotReadyError) e.Ge = true;
     notifyStatus(
       e,
       t instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR,
       t,
       undefined,
-      t instanceof NotReadyError ? e.te : undefined
+      t instanceof NotReadyError ? e.G : undefined
     );
   } finally {
-    tracking = l;
-    e.R = REACTIVE_NONE | (t ? e.R & REACTIVE_SNAPSHOT_STALE : 0);
+    tracking = a;
+    if (E) stale = S;
+    e._ = REACTIVE_NONE | (t ? e._ & REACTIVE_SNAPSHOT_STALE : 0);
     context = u;
   }
-  if (!e.Te) {
-    const u = e.Pe;
-    let l = u !== null ? u.D : e.C;
-    if (l !== null) {
-      do {
-        l = unlinkSubs(l);
-      } while (l !== null);
-      if (u !== null) u.D = null;
-      else e.C = null;
-    }
-    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.G : undefined;
-      if (t || (n && activeTransition !== e.Z) || i) {
-        e.ne = c;
+  if (!e.Re) {
+    trimStaleDeps(e);
+    const u = r ? e.K : e.B === NOT_PENDING ? e.ue : e.B;
+    const a = (!n && o) || !e.Fe || !e.Fe(u, l);
+    if (n && a) {
+      e.ee = !e.Re;
+      if (!t) e.te.enqueue(n, GlobalQueue.Te.bind(null, e));
+    }
+    if (a) {
+      const o = r ? e.K : undefined;
+      if (t || (n && activeTransition !== e.M) || i) {
+        e.ue = l;
         if (r && i) {
-          e.G = c;
-          e.U = c;
+          e.K = l;
+          e.B = l;
         }
-      } else e.U = c;
-      if (r && !i && s && !e.pe) e.G = c;
-      if (!r || i || e.G !== o) insertSubs(e, i || r);
+      } else e.B = l;
+      if (r && !i && s && !e.$) e.K = l;
+      if (!r || i || e.K !== o) insertSubs(e, i || r);
     } else if (r) {
-      e.U = c;
-    } else if (e.o != a) {
-      for (let t = e.I; t !== null; t = t.h) {
-        insertIntoHeapHeight(t.p, t.p.R & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+      e.B = l;
+    } else if (e.o != c) {
+      for (let t = e.I; t !== null; t = t.p) {
+        insertIntoHeapHeight(t.h, t.h._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
       }
     }
   }
   currentOptimisticLane = f;
-  (!t || e.Oe & STATUS_PENDING) && !e.Z && !(activeTransition && r) && globalQueue.ue.push(e);
-  e.Z && n && activeTransition !== e.Z && runInTransition(e.Z, () => recompute(e));
+  const T =
+    e.B !== NOT_PENDING ||
+    e.Ne !== null ||
+    e.Ae !== null ||
+    !!(e.he & (STATUS_PENDING | STATUS_UNINITIALIZED));
+  T && (!t || e.he & STATUS_PENDING) && !e.M && !(activeTransition && r) && queuePendingNode(e);
+  e.M && n && activeTransition !== e.M && runInTransition(e.M, () => recompute(e));
 }
 function updateIfNecessary(e) {
-  if (e.R & REACTIVE_CHECK) {
-    for (let t = e.C; t; t = t.D) {
+  if (e._ & REACTIVE_CHECK) {
+    for (let t = e.P; t; t = t.D) {
       const n = t.m;
       const i = n.V || n;
       if (i.L) {
         updateIfNecessary(i);
       }
-      if (e.R & REACTIVE_DIRTY) {
+      if (e._ & REACTIVE_DIRTY) {
         break;
       }
     }
   }
-  if (e.R & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.Te && e.Se < clock && !e.De)) {
+  if (e._ & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.Re && e.Ie < clock && !e.ve)) {
     recompute(e);
   }
-  e.R = e.R & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
+  e._ = e._ & (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:
+    _e:
       (n ? CONFIG_TRANSPARENT : 0) |
       (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) |
       (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) |
+      (t?.sync ? CONFIG_SYNC : 0) |
       (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-    Le: t?.equals != null ? t.equals : isEqual,
-    k: t?.unobserved,
+    Fe: t?.equals != null ? t.equals : isEqual,
+    X: t?.unobserved,
     we: null,
-    $: context?.$ ?? globalQueue,
+    te: context?.te ?? globalQueue,
     Ve: context?.Ve ?? defaultContext,
-    ve: 0,
+    me: 0,
     L: e,
-    ne: undefined,
+    ue: undefined,
     o: 0,
     N: null,
-    S: undefined,
-    T: null,
-    C: null,
-    Pe: null,
+    T: undefined,
+    S: null,
+    P: null,
+    ye: null,
     I: null,
-    Ae: null,
+    Ue: null,
     i: context,
+    De: null,
+    be: null,
     ge: null,
-    Ce: null,
-    R: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
-    Oe: STATUS_UNINITIALIZED,
-    Se: clock,
-    U: NOT_PENDING,
-    me: null,
+    _: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
+    he: STATUS_UNINITIALIZED,
+    Ie: clock,
+    B: NOT_PENDING,
+    Ae: null,
+    Ne: null,
+    ve: null,
+    M: null
+  };
+  setupComputedNode(i, t);
+  return i;
+}
+function createEffectNode(e, t, n, i, r, s) {
+  const o = s?.transparent ?? false;
+  const u = {
+    id: s?.id ?? (o ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
+    _e:
+      (o ? CONFIG_TRANSPARENT : 0) |
+      (s?.ownedWrite ? CONFIG_OWNED_WRITE : 0) |
+      (s?.sync ? CONFIG_SYNC : 0) |
+      (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+    Fe: false,
+    X: s?.unobserved,
+    we: null,
+    te: context?.te ?? globalQueue,
+    Ve: context?.Ve ?? defaultContext,
+    me: 0,
+    L: e,
+    ue: undefined,
+    o: 0,
+    N: null,
+    T: undefined,
+    S: null,
+    P: null,
     ye: null,
+    I: null,
+    Ue: null,
+    i: context,
     De: null,
-    Z: null
+    be: null,
+    ge: null,
+    _: REACTIVE_LAZY,
+    he: STATUS_UNINITIALIZED,
+    Ie: clock,
+    B: NOT_PENDING,
+    Ae: null,
+    Ne: null,
+    ve: null,
+    M: null,
+    ee: false,
+    Me: undefined,
+    Qe: t,
+    je: n,
+    $e: undefined,
+    Ke: false,
+    J: i,
+    xe: r
   };
-  i.T = i;
-  const r = context?.t ? context.u : context;
+  setupComputedNode(u, lazyOptions);
+  return u;
+}
+const lazyOptions = { lazy: true };
+function setupComputedNode(e, t) {
+  e.S = e;
+  const n = context?.t ? context.u : context;
   if (context) {
-    const e = context.Ce;
-    if (e === null) {
-      context.Ce = i;
+    const t = context.ge;
+    if (t === null) {
+      context.ge = e;
     } else {
-      i.ge = e;
-      context.Ce = i;
+      e.De = t;
+      t.be = e;
+      context.ge = e;
     }
   }
-  if (r) i.o = r.o + 1;
+  if (n) e.o = n.o + 1;
   if (externalSourceConfig) {
-    const e = signal(undefined, { equals: false, ownedWrite: true });
-    const t = externalSourceConfig.factory(i.L, () => {
-      setSignal(e, undefined);
+    const t = signal(undefined, { equals: false, ownedWrite: true });
+    const n = externalSourceConfig.factory(e.L, () => {
+      setSignal(t, undefined);
     });
-    cleanup(() => t.dispose());
-    i.L = n => {
-      read(e);
-      return t.track(n);
+    cleanup(() => n.dispose());
+    e.L = e => {
+      read(t);
+      return n.track(e);
     };
   }
-  !t?.lazy && recompute(i, true);
+  !t?.lazy && recompute(e, true);
   if (snapshotCaptureActive && !t?.lazy) {
-    if (!(i.Oe & STATUS_PENDING)) {
-      i.de = i.ne === undefined ? NO_SNAPSHOT : i.ne;
-      snapshotSources.add(i);
+    if (!(e.he & STATUS_PENDING)) {
+      e.pe = e.ue === undefined ? NO_SNAPSHOT : e.ue;
+      snapshotSources.add(e);
     }
   }
-  return i;
 }
 function signal(e, t, n = null) {
   const i = {
-    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,
+    Fe: t?.equals != null ? t.equals : isEqual,
+    _e: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.Ye ? CONFIG_NO_SNAPSHOT : 0),
+    X: t?.unobserved,
+    ue: e,
     I: null,
-    Ae: null,
-    Se: clock,
+    Ue: null,
+    Ie: clock,
     V: n,
     A: n?.N || null,
-    U: NOT_PENDING
+    B: NOT_PENDING
   };
   n && (n.N = i);
-  if (snapshotCaptureActive && !(i.Ee & CONFIG_NO_SNAPSHOT) && !((n?.Oe ?? 0) & STATUS_PENDING)) {
-    i.de = e === undefined ? NO_SNAPSHOT : e;
+  if (snapshotCaptureActive && !(i._e & CONFIG_NO_SNAPSHOT) && !((n?.he ?? 0) & STATUS_PENDING)) {
+    i.pe = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources.add(i);
   }
   return i;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.G = NOT_PENDING;
+  n.K = NOT_PENDING;
   return n;
 }
 function optimisticComputed(e, t) {
   const n = computed(e, t);
-  n.G = NOT_PENDING;
+  n.K = NOT_PENDING;
   return n;
 }
 function isEqual(e, t) {
@@ -1486,7 +1668,7 @@ function read(e) {
     const t = getLatestValueComputed(e);
     const n = latestReadActive;
     latestReadActive = false;
-    const i = e.G !== undefined && e.G !== NOT_PENDING ? e.G : e.ne;
+    const i = e.K !== undefined && e.K !== NOT_PENDING ? e.K : e.ue;
     let r;
     try {
       r = read(t);
@@ -1496,11 +1678,11 @@ function read(e) {
     } finally {
       latestReadActive = n;
     }
-    if (t.Oe & STATUS_PENDING) return i;
-    if (stale && currentOptimisticLane && t.te) {
-      const e = findLane(t.te);
+    if (t.he & STATUS_PENDING) return i;
+    if (stale && currentOptimisticLane && t.G) {
+      const e = findLane(t.G);
       const n = findLane(currentOptimisticLane);
-      if (e !== n && e.W.size > 0) {
+      if (e !== n && e.k.size > 0) {
         return i;
       }
     }
@@ -1510,8 +1692,8 @@ function read(e) {
     const t = e.V;
     const n = pendingCheckActive;
     pendingCheckActive = false;
-    if (t && e.G !== undefined) {
-      if (e.G !== NOT_PENDING && (t.De || !!(t.Oe & STATUS_PENDING))) {
+    if (t && e.K !== undefined) {
+      if (e.K !== NOT_PENDING && (t.ve || !!(t.he & STATUS_PENDING))) {
         foundPending = true;
       }
       let n = context;
@@ -1524,27 +1706,39 @@ function read(e) {
       if (t && read(getPendingSignal(t))) foundPending = true;
     }
     pendingCheckActive = n;
-    return e.ne;
+    return e.ue;
   }
   let t = context;
   if (t?.t) t = t.u;
   const n = e;
   if (typeof n.L === "function") {
     const t = e;
-    if (refreshing && !(t.R & REACTIVE_DISPOSED)) recompute(t);
-    if (t.R & REACTIVE_LAZY) {
-      t.R &= ~REACTIVE_LAZY;
+    if (t._ & REACTIVE_LAZY) {
+      t._ &= ~REACTIVE_LAZY;
       recompute(t, true);
-    } else if (t.R & REACTIVE_DISPOSED) {
+    } else if (t._ & REACTIVE_DISPOSED) {
       recompute(t, true);
     }
   }
   const i = e.V || e;
+  if (
+    !n.L &&
+    i === e &&
+    e.K === undefined &&
+    e.pe === undefined &&
+    activeTransition === null &&
+    currentOptimisticLane === null &&
+    !snapshotCaptureActive &&
+    true
+  ) {
+    if (t && tracking) link(e, t);
+    return !t || e.B === NOT_PENDING ? e.ue : e.B;
+  }
   if (t && tracking) {
     link(e, t);
     if (i.L) {
-      const n = e.R & REACTIVE_ZOMBIE;
-      if (i.o >= (n ? zombieQueue.P : dirtyQueue.P)) {
+      const n = e._ & REACTIVE_ZOMBIE;
+      if (i.o >= (n ? zombieQueue.C : dirtyQueue.C)) {
         markNode(t);
         markHeap(n ? zombieQueue : dirtyQueue);
         updateIfNecessary(i);
@@ -1555,71 +1749,71 @@ function read(e) {
       }
     }
   }
-  if (i.Oe & STATUS_PENDING) {
-    if (t && !(stale && i.Z && activeTransition !== i.Z)) {
+  if (i.he & STATUS_PENDING) {
+    if (t && !(stale && i.M && activeTransition !== i.M)) {
       if (currentOptimisticLane) {
-        const n = i.te;
+        const n = i.G;
         const r = findLane(currentOptimisticLane);
         if (n && findLane(n) === r && !hasActiveOverride(i)) {
           if (!tracking && e !== t) link(e, t);
-          throw i.Te;
+          throw i.Re;
         }
       } else {
         if (!tracking && e !== t) link(e, t);
-        throw i.Te;
+        throw i.Re;
       }
-    } else if (t && i !== e && i.Oe & STATUS_UNINITIALIZED) {
+    } else if (t && i !== e && i.he & STATUS_UNINITIALIZED) {
       if (!tracking && e !== t) link(e, t);
-      throw i.Te;
-    } else if (!t && i.Oe & STATUS_UNINITIALIZED) {
-      throw i.Te;
+      throw i.Re;
+    } else if (!t && i.he & STATUS_UNINITIALIZED) {
+      throw i.Re;
     }
   }
-  if (e.L && e.Oe & STATUS_ERROR) {
-    if (e.Se < clock) {
+  if (e.L && e.he & STATUS_ERROR) {
+    if (e.Ie < clock) {
       recompute(e);
       return read(e);
-    } else throw e.Te;
+    } else throw e.Re;
   }
-  if (snapshotCaptureActive && t && t.Ee & CONFIG_IN_SNAPSHOT_SCOPE) {
-    const n = e.de;
+  if (snapshotCaptureActive && t && t._e & CONFIG_IN_SNAPSHOT_SCOPE) {
+    const n = e.pe;
     if (n !== undefined) {
       const i = n === NO_SNAPSHOT ? undefined : n;
-      const r = e.U !== NOT_PENDING ? e.U : e.ne;
-      if (r !== i) t.R |= REACTIVE_SNAPSHOT_STALE;
+      const r = e.B !== NOT_PENDING ? e.B : e.ue;
+      if (r !== i) t._ |= REACTIVE_SNAPSHOT_STALE;
       return i;
     }
   }
-  if (e.G !== undefined && e.G !== NOT_PENDING) {
-    if (t && stale && shouldReadStashedOptimisticValue(e)) return e.ne;
-    return e.G;
+  if (e.K !== undefined && e.K !== NOT_PENDING) {
+    if (t && stale && shouldReadStashedOptimisticValue(e)) return e.ue;
+    return e.K;
   }
   if (
     activeTransition !== null &&
     currentOptimisticLane !== null &&
     !latestReadActive &&
-    e.U !== NOT_PENDING &&
+    e.B !== NOT_PENDING &&
     i === e &&
     !e.L &&
     t
   ) {
-    activeTransition.ee.add(t);
-    return e.ne;
+    activeTransition.oe.add(t);
+    return e.ue;
   }
   const r =
     !t ||
     (currentOptimisticLane !== null &&
-      (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;
+      (e.K !== undefined || e.G || (i === e && stale) || !!(i.he & STATUS_PENDING))) ||
+    e.B === NOT_PENDING ||
+    (stale && e.M && activeTransition !== e.M)
+      ? e.ue
+      : e.B;
   if (
     !t &&
     i === e &&
     typeof n.L === "function" &&
-    e.Ee & CONFIG_AUTO_DISPOSE &&
-    !(i.Oe & STATUS_PENDING) &&
+    e._e & CONFIG_AUTO_DISPOSE &&
+    !(i.he & STATUS_PENDING) &&
     !e.I
   ) {
     unobserved(e);
@@ -1627,12 +1821,12 @@ function read(e) {
   return r;
 }
 function setSignal(e, t) {
-  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 (e.M && activeTransition !== e.M) globalQueue.initTransition(e.M);
+  const n = e.K !== undefined && !projectionWriteActive;
+  const i = e.K !== undefined && e.K !== NOT_PENDING;
+  const r = n ? (i ? e.K : e.ue) : e.B === NOT_PENDING ? e.ue : e.B;
   if (typeof t === "function") t = t(r);
-  const s = !e.Le || !e.Le(r, t) || !!(e.Oe & STATUS_UNINITIALIZED);
+  const s = !e.Fe || !e.Fe(r, t) || !!(e.he & STATUS_UNINITIALIZED);
   if (!s) {
     if (n && i && e.L) {
       insertSubs(e, true);
@@ -1641,29 +1835,39 @@ function setSignal(e, t) {
     return t;
   }
   if (n) {
-    const n = e.G === NOT_PENDING;
+    const n = e.K === NOT_PENDING;
     if (!n) globalQueue.initTransition(resolveTransition(e));
     if (n) {
-      e.U = e.ne;
-      globalQueue.q.push(e);
+      e.B = e.ue;
+      globalQueue.Z.push(e);
     }
-    e.pe = true;
+    e.$ = true;
     const i = getOrCreateLane(e);
-    e.te = i;
-    e.G = t;
+    e.G = i;
+    e.K = t;
   } else {
-    if (e.U === NOT_PENDING) globalQueue.ue.push(e);
-    e.U = t;
+    if (e.B === NOT_PENDING) queuePendingNode(e);
+    e.B = t;
   }
-  updatePendingSignal(e);
-  if (e.Ue) {
-    setSignal(e.Ue, t);
+  if (e.We) updatePendingSignal(e);
+  if (e.ke) {
+    setSignal(e.ke, t);
   }
-  e.Se = clock;
+  e.Ie = clock;
   insertSubs(e, n);
   schedule();
   return t;
 }
+function suppressComputedRecompute(e) {
+  deleteFromHeap(e, e._ & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+  if (!(e._ & REACTIVE_MANUAL_WRITE) && e.B === NOT_PENDING) queuePendingNode(e);
+  e._ = (e._ & -4) | REACTIVE_MANUAL_WRITE;
+}
+function setMemo(e, t) {
+  const n = setSignal(e, t);
+  suppressComputedRecompute(e);
+  return n;
+}
 function runWithOwner(e, t) {
   const n = context;
   const i = tracking;
@@ -1679,8 +1883,8 @@ function runWithOwner(e, t) {
 function getPendingSignal(e) {
   if (!e.We) {
     e.We = optimisticSignal(false, { ownedWrite: true });
-    if (e.Ie) {
-      e.We.Ie = e;
+    if (e.U) {
+      e.We.U = e;
     }
     if (computePendingState(e)) setSignal(e.We, true);
   }
@@ -1689,56 +1893,56 @@ function getPendingSignal(e) {
 function computePendingState(e) {
   const t = e;
   const n = e.V;
-  if (n && e.U !== NOT_PENDING) {
-    return !n.De && !(n.Oe & STATUS_PENDING);
+  if (n && e.B !== NOT_PENDING) {
+    return !n.ve && !(n.he & STATUS_PENDING);
   }
-  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);
+  if (e.K !== undefined && e.K !== NOT_PENDING) {
+    if (t.he & STATUS_PENDING && !(t.he & STATUS_UNINITIALIZED)) return true;
+    if (e.U) {
+      const t = e.G ? findLane(e.G) : null;
+      return !!(t && t.k.size > 0);
     }
     return true;
   }
-  if (e.G !== undefined && e.G === NOT_PENDING && !e.Ie) {
+  if (e.K !== undefined && e.K === NOT_PENDING && !e.U) {
     return false;
   }
-  if (e.U !== NOT_PENDING && !(t.Oe & STATUS_UNINITIALIZED)) return true;
-  return !!(t.Oe & STATUS_PENDING && !(t.Oe & STATUS_UNINITIALIZED));
+  if (e.B !== NOT_PENDING && !(t.he & STATUS_UNINITIALIZED)) return true;
+  return !!(t.he & STATUS_PENDING && !(t.he & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
   if (e.We) {
     const t = computePendingState(e);
     const n = e.We;
     setSignal(n, t);
-    if (!t && n.te) {
+    if (!t && n.G) {
       const t = resolveLane(e);
-      if (t && t.W.size > 0) {
-        const e = findLane(n.te);
+      if (t && t.k.size > 0) {
+        const e = findLane(n.G);
         if (e !== t) {
           mergeLanes(t, e);
         }
       }
       signalLanes.delete(n);
-      n.te = undefined;
+      n.G = undefined;
     }
   }
 }
 function getLatestValueComputed(e) {
-  if (!e.Ue) {
+  if (!e.ke) {
     const t = latestReadActive;
     latestReadActive = false;
     const n = pendingCheckActive;
     pendingCheckActive = false;
     const i = context;
     context = null;
-    e.Ue = optimisticComputed(() => read(e));
-    e.Ue.Ie = e;
+    e.ke = optimisticComputed(() => read(e));
+    e.ke.U = e;
     context = i;
     pendingCheckActive = n;
     latestReadActive = t;
   }
-  return e.Ue;
+  return e.ke;
 }
 function staleValues(e, t = true) {
   const n = stale;
@@ -1777,11 +1981,11 @@ function refresh(e) {
   let t = refreshing;
   refreshing = true;
   try {
-    if (typeof e !== "function") {
-      recompute(e[$REFRESH]);
-      return e;
+    const t = e?.[$REFRESH];
+    if (false && !t);
+    if (t && typeof t.L === "function" && !(t._ & REACTIVE_DISPOSED)) {
+      recompute(t);
     }
-    return untrack(e);
   } finally {
     refreshing = t;
     if (!t) {
@@ -1818,102 +2022,92 @@ function isUndefined(e) {
   return typeof e === "undefined";
 }
 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.j = !o.Te;
-      if (r) o.$.enqueue(o.M, runEffect.bind(o));
-      return false;
-    },
-    lazy: true
-  });
-  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.Oe;
-    const i = t !== undefined ? t : o.Te;
-    if (n & STATUS_ERROR) {
-      let e = i;
-      o.$.notify(o, STATUS_PENDING, 0);
-      if (o.M === EFFECT_USER) {
-        try {
-          return o.Me
-            ? o.Me(e, () => {
-                o.Qe?.();
-                o.Qe = undefined;
-              })
-            : console.error(e);
-        } catch (t) {
-          e = t;
-        }
+  const r = !!i?.user;
+  const s = createEffectNode(e, t, n, r ? EFFECT_USER : EFFECT_RENDER, notifyEffectStatus, i);
+  recompute(s, true);
+  !i?.defer &&
+    (s.J === EFFECT_USER || i?.schedule
+      ? s.te.enqueue(s.J, runEffect.bind(null, s))
+      : runEffect(s));
+}
+function notifyEffectStatus(e, t) {
+  const n = e !== undefined ? e : this.he;
+  const i = t !== undefined ? t : this.Re;
+  if (n & STATUS_ERROR) {
+    let e = i;
+    this.te.notify(this, STATUS_PENDING, 0);
+    if (this.J === EFFECT_USER) {
+      try {
+        return this.je
+          ? this.je(e, () => {
+              this.$e?.();
+              this.$e = undefined;
+            })
+          : console.error(e);
+      } catch (t) {
+        e = t;
       }
-      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);
-  !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.j || this.R & REACTIVE_DISPOSED) return;
-  this.Qe?.();
-  this.Qe = undefined;
+    if (!this.te.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
+  } else if (this.J === EFFECT_RENDER) {
+    this.te.notify(this, STATUS_PENDING | STATUS_ERROR, n, i);
+  }
+}
+function runEffect(e) {
+  if (!e.ee || e._ & REACTIVE_DISPOSED) return;
+  e.$e?.();
+  e.$e = undefined;
   try {
-    const e = this.He(this.ne, this.xe);
-    if (false && e !== undefined && typeof e !== "function");
-    this.Qe = e;
-  } catch (e) {
-    this.Te = new StatusError(this, e);
-    this.Oe |= STATUS_ERROR;
-    if (!this.$.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
+    const t = e.Qe(e.ue, e.Me);
+    if (false && t !== undefined && typeof t !== "function");
+    e.$e = t;
+    if (e.$e && !e.Ke) {
+      e.Ke = true;
+      runWithOwner(e.i, () => cleanup(() => e.$e?.()));
+    }
+  } catch (t) {
+    e.Re = new StatusError(e, t);
+    e.he |= STATUS_ERROR;
+    if (!e.te.notify(e, STATUS_ERROR, STATUS_ERROR)) throw t;
   } finally {
-    this.xe = this.ne;
-    this.j = false;
+    e.Me = e.ue;
+    e.ee = false;
   }
 }
+GlobalQueue.Te = runEffect;
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.j || n.R & REACTIVE_DISPOSED) return;
+    if (!n.ee || n._ & REACTIVE_DISPOSED) return;
     try {
-      n.j = false;
+      n.ee = false;
       recompute(n);
     } finally {
     }
   };
   const n = computed(
     () => {
-      n.Qe?.();
-      n.Qe = undefined;
+      n.$e?.();
+      n.$e = undefined;
       const t = staleValues(e);
-      n.Qe = t;
+      n.$e = t;
     },
     { ...t, lazy: true }
   );
-  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.Oe;
+  n.$e = undefined;
+  n._e = (n._e & ~CONFIG_AUTO_DISPOSE) | CONFIG_CHILDREN_FORBIDDEN;
+  n.ee = true;
+  n.J = EFFECT_TRACKED;
+  n.xe = (e, t) => {
+    const i = e !== undefined ? e : n.he;
     if (i & STATUS_ERROR) {
-      n.$.notify(n, STATUS_PENDING, 0);
-      const e = t !== undefined ? t : n.Te;
-      if (!n.$.notify(n, STATUS_ERROR, STATUS_ERROR)) throw e;
+      n.te.notify(n, STATUS_PENDING, 0);
+      const e = t !== undefined ? t : n.Re;
+      if (!n.te.notify(n, STATUS_ERROR, STATUS_ERROR)) throw e;
     }
   };
-  n.K = run;
-  n.$.enqueue(EFFECT_USER, run);
-  cleanup(() => n.Qe?.());
+  n.ne = run;
+  n.te.enqueue(EFFECT_USER, run);
+  cleanup(() => n.$e?.());
 }
 function restoreTransition(e, t) {
   globalQueue.initTransition(e);
@@ -1927,11 +2121,11 @@ function action(e) {
       const r = e(...t);
       globalQueue.initTransition();
       let s = activeTransition;
-      s.B.push(r);
+      s.re.push(r);
       const done = (e, t) => {
         s = currentTransition(s);
-        const o = s.B.indexOf(r);
-        if (o >= 0) s.B.splice(o, 1);
+        const o = s.re.indexOf(r);
+        if (o >= 0) s.re.splice(o, 1);
         setActiveTransition(s);
         schedule();
         t ? i(t) : n(e);
@@ -1963,13 +2157,15 @@ function onCleanup(e) {
   return cleanup(e);
 }
 function accessor(e) {
-  return read.bind(null, e);
+  const t = read.bind(null, e);
+  t[$REFRESH] = e;
+  return t;
 }
 function createSignal(e, t) {
   if (typeof e === "function") {
     const n = computed(e, t);
-    n.Ee &= ~CONFIG_AUTO_DISPOSE;
-    return [accessor(n), setSignal.bind(null, n)];
+    n._e &= ~CONFIG_AUTO_DISPOSE;
+    return [accessor(n), setMemo.bind(null, n)];
   }
   const n = signal(e, t);
   return [accessor(n), setSignal.bind(null, n)];
@@ -2025,7 +2221,7 @@ function resolve(e) {
 function createOptimistic(e, t) {
   if (typeof e === "function") {
     const n = optimisticComputed(e, t);
-    n.Ee &= ~CONFIG_AUTO_DISPOSE;
+    n._e &= ~CONFIG_AUTO_DISPOSE;
     return [accessor(n), setSignal.bind(null, n)];
   }
   const n = optimisticSignal(e, t);
@@ -2033,7 +2229,7 @@ function createOptimistic(e, t) {
 }
 function onSettled(e) {
   const t = getOwner();
-  t && !(t.Ee & CONFIG_CHILDREN_FORBIDDEN)
+  t && !(t._e & CONFIG_CHILDREN_FORBIDDEN)
     ? createTrackedEffect(() => untrack(e), undefined)
     : globalQueue.enqueue(EFFECT_USER, () => {
         const t = e();
@@ -2043,9 +2239,9 @@ function onSettled(e) {
 function unwrap(e) {
   return e?.[$TARGET]?.[STORE_NODE] ?? e;
 }
-function getOverrideValue(e, t, n, i, r) {
-  if (r && i in r) return r[i];
-  return t && i in t ? t[i] : e[i];
+function getOverrideValue(e, t, n, i) {
+  if (i && n in i) return i[n];
+  return t && n in t ? t[n] : e[n];
 }
 function getAllKeys(e, t, n) {
   const i = getKeys(e, t);
@@ -2055,114 +2251,225 @@ function getAllKeys(e, t, n) {
 function applyState(e, t, n) {
   const i = t?.[$TARGET];
   if (!i) return;
-  const r = i[STORE_VALUE];
-  const s = i[STORE_OVERRIDE];
-  const o = i[STORE_OPTIMISTIC_OVERRIDE];
-  let u = i[STORE_NODE];
-  if (e === r && !s && !o) return;
-  (i[STORE_LOOKUP] || storeLookup).set(e, i[$PROXY]);
-  i[STORE_VALUE] = e;
-  i[STORE_OVERRIDE] = undefined;
-  if (Array.isArray(r)) {
-    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, T, S, d, O;
+  if (i[STORE_OVERRIDE] || i[STORE_OPTIMISTIC_OVERRIDE]) {
+    applyStateSlow(e, i, n);
+  } else {
+    applyStateFast(e, i, n);
+  }
+}
+function applyStateFast(e, t, n) {
+  const i = t[STORE_VALUE];
+  if (e === i) return;
+  (t[STORE_LOOKUP] || storeLookup).set(e, t[$PROXY]);
+  t[STORE_VALUE] = e;
+  if (Array.isArray(i)) {
+    let r = false;
+    const s = i.length;
+    if (e.length && s && e[0] && n(e[0]) != null) {
+      let o, u, l, c, a, f, E, S;
+      for (
+        l = 0, c = Math.min(s, e.length);
+        l < c && ((f = i[l]) === e[l] || (f && e[l] && n(f) === n(e[l])));
+        l++
+      ) {
+        applyState(e[l], wrap(f, t), n);
+      }
+      const T = new Array(e.length),
+        d = new Map();
+      for (
+        c = s - 1, a = e.length - 1;
+        c >= l && a >= l && ((f = i[c]) === e[a] || (f && e[a] && n(f) === n(e[a])));
+        c--, a--
+      ) {
+        T[a] = f;
+      }
+      if (l > a || l > c) {
+        for (u = l; u <= a; u++) {
+          r = true;
+          t[STORE_NODE][u] && setSignal(t[STORE_NODE][u], wrap(e[u], t));
+        }
+        for (; u < e.length; u++) {
+          r = true;
+          const i = wrap(T[u], t);
+          t[STORE_NODE][u] && setSignal(t[STORE_NODE][u], i);
+          applyState(e[u], i, n);
+        }
+        r && t[STORE_NODE][$TRACK] && setSignal(t[STORE_NODE][$TRACK], void 0);
+        s !== e.length && t[STORE_NODE].length && setSignal(t[STORE_NODE].length, e.length);
+        return;
+      }
+      E = new Array(a + 1);
+      for (u = a; u >= l; u--) {
+        f = e[u];
+        S = f ? n(f) : f;
+        o = d.get(S);
+        E[u] = o === undefined ? -1 : o;
+        d.set(S, u);
+      }
+      for (o = l; o <= c; o++) {
+        f = i[o];
+        S = f ? n(f) : f;
+        u = d.get(S);
+        if (u !== undefined && u !== -1) {
+          T[u] = f;
+          u = E[u];
+          d.set(S, u);
+        }
+      }
+      for (u = l; u < e.length; u++) {
+        if (u in T) {
+          const i = wrap(T[u], t);
+          t[STORE_NODE][u] && setSignal(t[STORE_NODE][u], i);
+          applyState(e[u], i, n);
+        } else t[STORE_NODE][u] && setSignal(t[STORE_NODE][u], wrap(e[u], t));
+      }
+      if (l < e.length) r = true;
+    } else if (e.length) {
+      for (let r = 0, s = e.length; r < s; r++) {
+        const s = i[r];
+        isWrappable(s)
+          ? applyState(e[r], wrap(s, t), n)
+          : t[STORE_NODE][r] && setSignal(t[STORE_NODE][r], e[r]);
+      }
+    }
+    if (s !== e.length) {
+      r = true;
+      t[STORE_NODE].length && setSignal(t[STORE_NODE].length, e.length);
+    }
+    r && t[STORE_NODE][$TRACK] && setSignal(t[STORE_NODE][$TRACK], void 0);
+    return;
+  }
+  let r = t[STORE_NODE];
+  if (r) {
+    const s = r[$TRACK];
+    const o = s ? getAllKeys(i, undefined, e) : Object.keys(r);
+    for (let u = 0, l = o.length; u < l; u++) {
+      const l = o[u];
+      const c = r[l];
+      const a = unwrap(i[l]);
+      let f = unwrap(e[l]);
+      if (a === f) continue;
+      if (!a || !isWrappable(a) || !isWrappable(f) || (n(a) != null && n(a) !== n(f))) {
+        s && setSignal(s, void 0);
+        c && setSignal(c, isWrappable(f) ? wrap(f, t) : f);
+      } else applyState(f, wrap(a, t), n);
+    }
+  }
+  if ((r = t[STORE_HAS])) {
+    const t = Object.keys(r);
+    for (let n = 0, i = t.length; n < i; n++) {
+      const i = t[n];
+      setSignal(r[i], i in e);
+    }
+  }
+}
+function applyStateSlow(e, t, n) {
+  const i = t[STORE_VALUE];
+  const r = t[STORE_OVERRIDE];
+  const s = t[STORE_OPTIMISTIC_OVERRIDE];
+  let o = t[STORE_NODE];
+  (t[STORE_LOOKUP] || storeLookup).set(e, t[$PROXY]);
+  t[STORE_VALUE] = e;
+  t[STORE_OVERRIDE] = undefined;
+  if (Array.isArray(i)) {
+    let o = false;
+    const u = getOverrideValue(i, r, "length", s);
+    if (e.length && u && e[0] && n(e[0]) != null) {
+      let l, c, a, f, E, S, T, d;
       for (
-        f = 0, E = Math.min(c, e.length);
-        f < E &&
-        ((S = getOverrideValue(r, s, u, f, o)) === e[f] || (S && e[f] && n(S) === n(e[f])));
-        f++
+        a = 0, f = Math.min(u, e.length);
+        a < f && ((S = getOverrideValue(i, r, a, s)) === e[a] || (S && e[a] && n(S) === n(e[a])));
+        a++
       ) {
-        applyState(e[f], wrap(S, i), n);
+        applyState(e[a], wrap(S, t), n);
       }
-      const R = new Array(e.length),
+      const O = new Array(e.length),
         _ = new Map();
       for (
-        E = c - 1, T = e.length - 1;
-        E >= f &&
-        T >= f &&
-        ((S = getOverrideValue(r, s, u, E, o)) === e[T] || (S && e[T] && n(S) === n(e[T])));
-        E--, T--
+        f = u - 1, E = e.length - 1;
+        f >= a &&
+        E >= a &&
+        ((S = getOverrideValue(i, r, f, s)) === e[E] || (S && e[E] && n(S) === n(e[E])));
+        f--, E--
       ) {
-        R[T] = S;
+        O[E] = S;
       }
-      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));
+      if (a > E || a > f) {
+        for (c = a; c <= E; c++) {
+          o = true;
+          t[STORE_NODE][c] && setSignal(t[STORE_NODE][c], wrap(e[c], t));
         }
-        for (; l < e.length; l++) {
-          t = true;
-          const r = wrap(R[l], i);
-          i[STORE_NODE][l] && setSignal(i[STORE_NODE][l], r);
-          applyState(e[l], r, n);
+        for (; c < e.length; c++) {
+          o = true;
+          const i = wrap(O[c], t);
+          t[STORE_NODE][c] && setSignal(t[STORE_NODE][c], i);
+          applyState(e[c], i, n);
         }
-        t && i[STORE_NODE][$TRACK] && setSignal(i[STORE_NODE][$TRACK], void 0);
-        c !== e.length && i[STORE_NODE].length && setSignal(i[STORE_NODE].length, e.length);
+        o && t[STORE_NODE][$TRACK] && setSignal(t[STORE_NODE][$TRACK], void 0);
+        u !== e.length && t[STORE_NODE].length && setSignal(t[STORE_NODE].length, e.length);
         return;
       }
-      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++) {
-        S = getOverrideValue(r, s, u, a, o);
-        O = S ? n(S) : S;
-        l = _.get(O);
-        if (l !== undefined && l !== -1) {
-          R[l] = S;
-          l = d[l];
-          _.set(O, l);
+      T = new Array(E + 1);
+      for (c = E; c >= a; c--) {
+        S = e[c];
+        d = S ? n(S) : S;
+        l = _.get(d);
+        T[c] = l === undefined ? -1 : l;
+        _.set(d, c);
+      }
+      for (l = a; l <= f; l++) {
+        S = getOverrideValue(i, r, l, s);
+        d = S ? n(S) : S;
+        c = _.get(d);
+        if (c !== undefined && c !== -1) {
+          O[c] = S;
+          c = T[c];
+          _.set(d, c);
         }
       }
-      for (l = f; l < e.length; l++) {
-        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));
+      for (c = a; c < e.length; c++) {
+        if (c in O) {
+          const i = wrap(O[c], t);
+          t[STORE_NODE][c] && setSignal(t[STORE_NODE][c], i);
+          applyState(e[c], i, n);
+        } else t[STORE_NODE][c] && setSignal(t[STORE_NODE][c], wrap(e[c], t));
       }
-      if (f < e.length) t = true;
+      if (a < e.length) o = true;
     } else if (e.length) {
-      for (let t = 0, c = e.length; t < c; t++) {
-        const c = getOverrideValue(r, s, u, t, o);
-        isWrappable(c)
-          ? applyState(e[t], wrap(c, i), n)
-          : i[STORE_NODE][t] && setSignal(i[STORE_NODE][t], e[t]);
+      for (let o = 0, u = e.length; o < u; o++) {
+        const u = getOverrideValue(i, r, o, s);
+        isWrappable(u)
+          ? applyState(e[o], wrap(u, t), n)
+          : t[STORE_NODE][o] && setSignal(t[STORE_NODE][o], e[o]);
       }
     }
-    if (c !== e.length) {
-      t = true;
-      i[STORE_NODE].length && setSignal(i[STORE_NODE].length, e.length);
+    if (u !== e.length) {
+      o = true;
+      t[STORE_NODE].length && setSignal(t[STORE_NODE].length, e.length);
     }
-    t && i[STORE_NODE][$TRACK] && setSignal(i[STORE_NODE][$TRACK], void 0);
+    o && t[STORE_NODE][$TRACK] && setSignal(t[STORE_NODE][$TRACK], void 0);
     return;
   }
-  if (u) {
-    const t = u[$TRACK];
-    const c = t ? getAllKeys(r, s, e) : Object.keys(u);
-    for (let a = 0, l = c.length; a < l; a++) {
-      const l = c[a];
-      const f = u[l];
-      const E = unwrap(getOverrideValue(r, s, u, l, o));
-      let 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(T) ? wrap(T, i) : T);
-      } else applyState(T, wrap(E, i), n);
-    }
-  }
-  if ((u = i[STORE_HAS])) {
-    const t = Object.keys(u);
+  if (o) {
+    const u = o[$TRACK];
+    const l = u ? getAllKeys(i, r, e) : Object.keys(o);
+    for (let c = 0, a = l.length; c < a; c++) {
+      const a = l[c];
+      const f = o[a];
+      const E = unwrap(getOverrideValue(i, r, a, s));
+      let S = unwrap(e[a]);
+      if (E === S) continue;
+      if (!E || !isWrappable(E) || !isWrappable(S) || (n(E) != null && n(E) !== n(S))) {
+        u && setSignal(u, void 0);
+        f && setSignal(f, isWrappable(S) ? wrap(S, t) : S);
+      } else applyState(S, wrap(E, t), n);
+    }
+  }
+  if ((o = t[STORE_HAS])) {
+    const t = Object.keys(o);
     for (let n = 0, i = t.length; n < i; n++) {
       const i = t[n];
-      setSignal(u[i], i in e);
+      setSignal(o[i], i in e);
     }
   }
 }
@@ -2201,7 +2508,7 @@ function createProjectionInternal(e, t, n) {
     if (!i) i = getOwner();
     runProjectionComputed(s, e, n?.key || "id");
   }, undefined);
-  i.Ee &= ~CONFIG_AUTO_DISPOSE;
+  i._e &= ~CONFIG_AUTO_DISPOSE;
   return { store: s, node: i };
 }
 function createProjection(e, t, n) {
@@ -2213,7 +2520,7 @@ function runProjectionComputed(e, t, n, i) {
   let o;
   const u = new Proxy(
     e,
-    createWriteTraps(() => !s || r.De === o)
+    createWriteTraps(() => !s || r.ve === o)
   );
   storeSetter(u, u => {
     o = t(u);
@@ -2299,8 +2606,14 @@ function createStoreProxy(e, t = storeTraps, n) {
   if (Array.isArray(e)) {
     i = [];
     i.v = e;
-  } else i = { v: e };
-  i[STORE_CUSTOM_PROTO] = hasCustomPrototype(unwrapStoreValue(e));
+  } else {
+    i = { v: e };
+    const t = e?.[$TARGET]?.[STORE_VALUE] ?? e;
+    const n = Object.getPrototypeOf(t);
+    if (n !== null && n !== Object.prototype) {
+      i[STORE_CUSTOM_PROTO] = true;
+    }
+  }
   n && n(i);
   return (i[$PROXY] = new Proxy(i, t));
 }
@@ -2312,12 +2625,8 @@ function wrap(e, t) {
   return n;
 }
 function isWrappable(e) {
-  return (
-    e != null &&
-    typeof e === "object" &&
-    !Object.isFrozen(e) &&
-    !(typeof Node !== "undefined" && e instanceof Node)
-  );
+  if (e == null || typeof e !== "object" || Object.isFrozen(e)) return false;
+  return typeof Node === "undefined" || !(e instanceof Node);
 }
 let writeOverride = false;
 function setWriteOverride(e) {
@@ -2329,11 +2638,6 @@ function writeOnly(e) {
 function unwrapStoreValue(e) {
   return e?.[$TARGET]?.[STORE_VALUE] ?? e;
 }
-function hasCustomPrototype(e) {
-  if (Array.isArray(e)) return false;
-  const t = Object.getPrototypeOf(e);
-  return t !== null && t !== Object.prototype;
-}
 function hasInheritedAccessor(e, t) {
   let n = Object.getPrototypeOf(e);
   while (n && n !== Object.prototype) {
@@ -2361,11 +2665,11 @@ function getNode(e, t, n, i, r = isEqual, s, o) {
     i
   );
   if (s) {
-    u.G = NOT_PENDING;
+    u.K = NOT_PENDING;
   }
   if (o && t in o) {
     const e = o[t];
-    u.de = e === undefined ? NO_SNAPSHOT : e;
+    u.pe = e === undefined ? NO_SNAPSHOT : e;
     snapshotSources?.add(u);
   }
   return (e[t] = u);
@@ -2398,8 +2702,8 @@ function getPropertyDescriptor(e, t, n) {
 function prepareStoreWrite(e, t, n) {
   if (e[STORE_OPTIMISTIC]) {
     const t = e[STORE_FIREWALL];
-    if (t?.Z) {
-      globalQueue.initTransition(t.Z);
+    if (t?.M) {
+      globalQueue.initTransition(t.M);
     }
   }
   const i = e[STORE_VALUE];
@@ -2407,7 +2711,7 @@ function prepareStoreWrite(e, t, n) {
   if (
     snapshotCaptureActive &&
     typeof n !== "symbol" &&
-    !((e[STORE_FIREWALL]?.Oe ?? 0) & STATUS_PENDING)
+    !((e[STORE_FIREWALL]?.he ?? 0) & STATUS_PENDING)
   ) {
     if (!e[STORE_SNAPSHOT_PROPS]) {
       e[STORE_SNAPSHOT_PROPS] = Object.create(null);
@@ -2432,35 +2736,35 @@ function upsertStoreNode(e, t, n, i, r) {
 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);
+  const l = e[STORE_HAS]?.[t];
+  if (l) {
+    setSignal(l, 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);
+  const c = getNodes(e, STORE_NODE);
   if (n === "set") {
-    if (a[t]) {
-      setSignal(a[t], () => (isWrappable(i) ? wrap(i, e) : i));
+    if (c[t]) {
+      setSignal(c[t], () => (isWrappable(i) ? wrap(i, e) : i));
     } else if (!o) {
-      const n = upsertStoreNode(e, a, t, r, e[STORE_SNAPSHOT_PROPS]);
+      const n = upsertStoreNode(e, c, t, r, e[STORE_SNAPSHOT_PROPS]);
       setSignal(n, () => (isWrappable(i) ? wrap(i, e) : i));
     }
   } else if (n === "invalidate") {
-    if (a[t]) {
-      setSignal(a[t], {});
-      delete a[t];
+    if (c[t]) {
+      setSignal(c[t], {});
+      delete c[t];
     }
   } else {
-    if (a[t]) {
-      setSignal(a[t], undefined);
+    if (c[t]) {
+      setSignal(c[t], undefined);
     } else if (!o) {
-      const n = upsertStoreNode(e, a, t, r, e[STORE_SNAPSHOT_PROPS]);
+      const n = upsertStoreNode(e, c, t, r, e[STORE_SNAPSHOT_PROPS]);
       setSignal(n, undefined);
     }
   }
-  a[$TRACK] && setSignal(a[$TRACK], undefined);
+  c[$TRACK] && setSignal(c[$TRACK], undefined);
 }
 let Writing = null;
 const storeTraps = {
@@ -2474,10 +2778,25 @@ const storeTraps = {
     }
     const i = getNodes(e, STORE_NODE);
     const r = i[t];
-    const s = e[STORE_OPTIMISTIC_OVERRIDE] && t in e[STORE_OPTIMISTIC_OVERRIDE];
-    const o = s || (e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]);
-    const u = !!e[STORE_VALUE][$TARGET];
-    const c = s
+    const s = e[STORE_VALUE];
+    if (
+      !r &&
+      !e[STORE_OVERRIDE] &&
+      !e[STORE_OPTIMISTIC_OVERRIDE] &&
+      !e[STORE_CUSTOM_PROTO] &&
+      !e[STORE_OPTIMISTIC] &&
+      !e[STORE_SNAPSHOT_PROPS] &&
+      !s[$TARGET] &&
+      !(t in s) &&
+      getObserver() &&
+      !writeOnly(n)
+    ) {
+      return read(getNode(i, t, undefined, e[STORE_FIREWALL]));
+    }
+    const o = e[STORE_OPTIMISTIC_OVERRIDE] && t in e[STORE_OPTIMISTIC_OVERRIDE];
+    const u = o || (e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]);
+    const l = !!e[STORE_VALUE][$TARGET];
+    const c = o
       ? e[STORE_OPTIMISTIC_OVERRIDE]
       : e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]
         ? e[STORE_OVERRIDE]
@@ -2485,7 +2804,7 @@ const storeTraps = {
     if (!r) {
       const i = Object.getOwnPropertyDescriptor(c, t);
       if (i && i.get) return i.get.call(n);
-      if (!i && !o && e[STORE_CUSTOM_PROTO]) {
+      if (!i && !u && e[STORE_CUSTOM_PROTO]) {
         const e = unwrapStoreValue(c);
         if (hasInheritedAccessor(e, t)) {
           return Reflect.get(c, t, n);
@@ -2494,12 +2813,12 @@ const storeTraps = {
     }
     if (writeOnly(n)) {
       let n =
-        r && (o || !u)
-          ? r.G !== undefined && r.G !== NOT_PENDING
-            ? r.G
-            : r.U !== NOT_PENDING
-              ? r.U
-              : r.ne
+        r && (u || !l)
+          ? r.K !== undefined && r.K !== NOT_PENDING
+            ? r.K
+            : r.B !== NOT_PENDING
+              ? r.B
+              : r.ue
           : c[t];
       n === $DELETED && (n = undefined);
       if (!isWrappable(n)) return n;
@@ -2507,10 +2826,10 @@ const storeTraps = {
       Writing?.add(i);
       return i;
     }
-    let a = r ? (o || !u ? read(i[t]) : (read(i[t]), c[t])) : c[t];
+    let a = r ? (u || !l ? read(i[t]) : (read(i[t]), c[t])) : c[t];
     a === $DELETED && (a = undefined);
     if (!r) {
-      if (!o && typeof a === "function" && !c.hasOwnProperty(t)) {
+      if (!u && typeof a === "function" && !c.hasOwnProperty(t)) {
         let t;
         return !Array.isArray(e[STORE_VALUE]) &&
           (t = Object.getPrototypeOf(e[STORE_VALUE])) &&
@@ -2560,38 +2879,38 @@ const storeTraps = {
             : e[STORE_OVERRIDE] && t in e[STORE_OVERRIDE]
               ? e[STORE_OVERRIDE][t]
               : r;
-        const c =
+        const l =
           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 = unwrapStoreValue(n);
-        const l = Array.isArray(o) && t !== "length";
-        const f = l ? parseInt(t) + 1 : 0;
+        const c = unwrapStoreValue(n);
+        const a = Array.isArray(o) && t !== "length";
+        const f = a ? parseInt(t) + 1 : 0;
         const E =
-          l &&
+          a &&
           (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 T = l && f > E ? f : undefined;
-        if (u === a && T === undefined) return true;
-        if (a !== undefined && a === r && T === undefined) delete e[s]?.[t];
+        const S = a && f > E ? f : undefined;
+        if (u === c && S === undefined) return true;
+        if (c !== undefined && c === r && S === undefined) delete e[s]?.[t];
         else {
           const n = e[s] || (e[s] = Object.create(null));
-          n[t] = a;
-          if (T !== undefined) n.length = T;
+          n[t] = c;
+          if (S !== undefined) n.length = S;
         }
-        notifyStoreProperty(e, t, "set", a, u, c);
-        if (Array.isArray(o) && t !== "length" && T !== undefined) {
+        notifyStoreProperty(e, t, "set", c, u, l);
+        if (Array.isArray(o) && t !== "length" && S !== undefined) {
           const t = getNodes(e, STORE_NODE);
           if (t.length) {
-            setSignal(t.length, T);
+            setSignal(t.length, S);
           } else if (!projectionWriteActive && !e[STORE_OPTIMISTIC]) {
             const n = upsertStoreNode(e, t, "length", E, e[STORE_SNAPSHOT_PROPS]);
-            setSignal(n, T);
+            setSignal(n, S);
           }
         }
         if (false);
@@ -2698,10 +3017,13 @@ function storeSetter(e, t) {
 function createStore(e, t, n) {
   const i = typeof e === "function",
     r = i ? createProjectionInternal(e, t, n).store : wrap(e);
-  return [r, e => storeSetter(r, e)];
+  return [
+    r,
+    i ? e => (storeSetter(r, e), suppressComputedRecompute(r[$REFRESH])) : e => storeSetter(r, e)
+  ];
 }
 function createOptimisticStore(e, t, n) {
-  GlobalQueue.le ||= clearOptimisticStore;
+  GlobalQueue.de ||= clearOptimisticStore;
   const i = typeof e === "function";
   const r = i ? t : e;
   const s = i ? e : undefined;
@@ -2718,7 +3040,7 @@ function clearOptimisticStore(e) {
     if (i) {
       for (const e of Reflect.ownKeys(n)) {
         if (i[e]) {
-          i[e].te = undefined;
+          i[e].G = 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;
@@ -2726,7 +3048,7 @@ function clearOptimisticStore(e) {
         }
       }
       if (i[$TRACK]) {
-        i[$TRACK].te = undefined;
+        i[$TRACK].G = undefined;
         setSignal(i[$TRACK], undefined);
       }
     }
@@ -2774,7 +3096,7 @@ function createOptimisticProjectionInternal(e, t, n) {
         setProjectionWriteActive(false);
       }
     }, undefined);
-    i.Ee &= ~CONFIG_AUTO_DISPOSE;
+    i._e &= ~CONFIG_AUTO_DISPOSE;
   }
   return { store: s, node: i };
 }
@@ -2851,7 +3173,7 @@ const storePath = Object.assign(
   { DELETE: DELETE }
 );
 function snapshotImpl(e, t, n, i) {
-  let r, s, o, u, c, a;
+  let r, s, o, u, l, c;
   if (!isWrappable(e)) return e;
   if (n && n.has(e)) return n.get(e);
   if (!n) n = new Map();
@@ -2871,29 +3193,29 @@ function snapshotImpl(e, t, n, i) {
   }
   if (s) {
     const s = o?.length || e.length;
-    for (let l = 0; l < s; l++) {
-      a = o && l in o ? o[l] : e[l];
-      if (a === $DELETED) continue;
-      if (t && isWrappable(a)) wrap(a, r);
-      if ((c = snapshotImpl(a, t, n, i)) !== a || u) {
+    for (let a = 0; a < s; a++) {
+      c = o && a in o ? o[a] : e[a];
+      if (c === $DELETED) continue;
+      if (t && isWrappable(c)) wrap(c, r);
+      if ((l = snapshotImpl(c, t, n, i)) !== c || u) {
         if (!u) n.set(e, (u = [...e]));
-        u[l] = c;
+        u[a] = l;
       }
     }
   } else {
     const s = getKeys(e, o);
-    for (let l = 0, f = s.length; l < f; l++) {
-      let f = s[l];
+    for (let a = 0, f = s.length; a < f; a++) {
+      let f = s[a];
       const E = getPropertyDescriptor(e, o, f);
       if (E.get) continue;
-      a = o && f in o ? o[f] : e[f];
-      if (t && isWrappable(a)) wrap(a, r);
-      if ((c = snapshotImpl(a, t, n, i)) !== e[f] || u) {
+      c = o && f in o ? o[f] : e[f];
+      if (t && isWrappable(c)) wrap(c, r);
+      if ((l = snapshotImpl(c, t, n, i)) !== e[f] || u) {
         if (!u) {
           u = Object.create(Object.getPrototypeOf(e));
           Object.assign(u, e);
         }
-        u[f] = c;
+        u[f] = l;
       }
     }
   }
@@ -2946,8 +3268,9 @@ function merge(...e) {
     const r = e[i];
     t = t || (!!r && $PROXY in r);
     const s = !!r && r[$SOURCES];
-    if (s) n.push(...s);
-    else n.push(typeof r === "function" ? ((t = true), createMemo(r)) : r);
+    if (s) {
+      for (let e = 0; e < s.length; e++) n.push(s[e]);
+    } else n.push(typeof r === "function" ? ((t = true), createMemo(r)) : r);
   }
   if (SUPPORTS_PROXY && t) {
     return new Proxy(
@@ -2966,9 +3289,12 @@ function merge(...e) {
           return false;
         },
         keys() {
-          const e = [];
-          for (let t = 0; t < n.length; t++) e.push(...Object.keys(resolveSource(n[t])));
-          return [...new Set(e)];
+          const e = new Set();
+          for (let t = 0; t < n.length; t++) {
+            const i = Object.keys(resolveSource(n[t]));
+            for (let t = 0; t < i.length; t++) e.add(i[t]);
+          }
+          return [...e];
         }
       },
       propTraps
@@ -3007,261 +3333,268 @@ function merge(...e) {
   return o;
 }
 function omit(e, ...t) {
-  const n = new Set(t);
   if (SUPPORTS_PROXY && $PROXY in e) {
     return new Proxy(
       {
-        get(t) {
-          return n.has(t) ? undefined : e[t];
+        get(n) {
+          return t.includes(n) ? undefined : e[n];
         },
-        has(t) {
-          return !n.has(t) && t in e;
+        has(n) {
+          return !t.includes(n) && n in e;
         },
         keys() {
-          return Object.keys(e).filter(e => !n.has(e));
+          return Object.keys(e).filter(e => !t.includes(e));
         }
       },
       propTraps
     );
   }
-  const i = {};
-  for (const t of Object.getOwnPropertyNames(e)) {
-    if (!n.has(t)) {
-      const n = Object.getOwnPropertyDescriptor(e, t);
-      !n.get && !n.set && n.enumerable && n.writable && n.configurable
-        ? (i[t] = n.value)
-        : Object.defineProperty(i, t, n);
+  const n = {};
+  const i = Object.getOwnPropertyNames(e);
+  const r = t.length > 4 && i.length > t.length ? new Set(t) : undefined;
+  for (const s of i) {
+    if (r ? !r.has(s) : !t.includes(s)) {
+      const t = Object.getOwnPropertyDescriptor(e, s);
+      !t.get && !t.set && t.enumerable && t.writable && t.configurable
+        ? (n[s] = t.value)
+        : Object.defineProperty(n, s, t);
     }
   }
-  return i;
+  return n;
 }
 function mapArray(e, t, n) {
   const i = typeof n?.keyed === "function" ? n.keyed : undefined;
   const r = t.length > 1;
   const s = t;
   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
+    Ze: createOwner(),
+    qe: 0,
+    Be: e,
+    ze: [],
+    Xe: s,
+    Je: [],
+    et: [],
+    tt: i,
+    nt: i || n?.keyed === false ? [] : undefined,
+    it: r && n?.keyed !== false ? [] : undefined,
+    rt: n?.keyed === false,
+    st: n?.fallback
   };
   const u = computed(updateKeyedMap.bind(o));
-  o.je.u = u;
-  u.Ee &= ~CONFIG_AUTO_DISPOSE;
+  o.Ze.u = u;
+  u._e &= ~CONFIG_AUTO_DISPOSE;
   return accessor(u);
 }
 const pureOptions = { ownedWrite: true };
 function updateKeyedMap() {
-  const e = this.Ke() || [],
+  const e = this.Be() || [],
     t = e.length;
   e[$TRACK];
-  runWithOwner(this.je, () => {
+  runWithOwner(this.Ze, () => {
     let n,
       i,
-      r = this.Xe
-        ? () => {
-            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.Je
+      r = this.nt
+        ? this.rt
+          ? () => {
+              this.nt[i] = signal(e[i], pureOptions);
+              return this.Xe(accessor(this.nt[i]), i);
+            }
+          : () => {
+              this.nt[i] = signal(e[i], pureOptions);
+              this.it && (this.it[i] = signal(i, pureOptions));
+              return this.Xe(accessor(this.nt[i]), this.it ? accessor(this.it[i]) : undefined);
+            }
+        : this.it
           ? () => {
               const t = e[i];
-              this.Je[i] = signal(i, pureOptions);
-              return this.Be(() => t, accessor(this.Je[i]));
+              this.it[i] = signal(i, pureOptions);
+              return this.Xe(t, accessor(this.it[i]));
             }
           : () => {
               const t = e[i];
-              return this.Be(() => t);
+              return this.Xe(t);
             };
     if (t === 0) {
-      if (this.$e !== 0) {
-        this.je.dispose(false);
-        this.qe = [];
-        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);
+      if (this.qe !== 0) {
+        this.Ze.dispose(false);
+        this.et = [];
+        this.ze = [];
+        this.Je = [];
+        this.qe = 0;
+        this.nt && (this.nt = []);
+        this.it && (this.it = []);
+      }
+      if (this.st && !this.Je[0]) {
+        this.Je[0] = runWithOwner((this.et[0] = createOwner()), this.st);
+      }
+    } else if (this.qe === 0) {
+      if (this.et[0]) this.et[0].dispose();
+      this.Je = new Array(t);
       for (i = 0; i < t; i++) {
-        this.Ye[i] = e[i];
-        this.Ze[i] = runWithOwner((this.qe[i] = createOwner()), r);
+        this.ze[i] = e[i];
+        this.Je[i] = runWithOwner((this.et[i] = createOwner()), r);
       }
-      this.$e = t;
+      this.qe = t;
     } else {
       let s,
         o,
         u,
+        l,
         c,
         a,
-        l,
         f,
         E = new Array(t),
-        T = new Array(t),
-        S = this.Xe ? new Array(t) : undefined,
-        d = this.Je ? new Array(t) : undefined;
+        S = new Array(t),
+        T = this.nt ? new Array(t) : undefined,
+        d = this.it ? new Array(t) : undefined;
       for (
-        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 = 0, o = Math.min(this.qe, t);
+        s < o && (this.ze[s] === e[s] || (this.nt && compare(this.tt, this.ze[s], e[s])));
         s++
       ) {
-        if (this.Xe) setSignal(this.Xe[s], e[s]);
+        if (this.nt) setSignal(this.nt[s], e[s]);
       }
       for (
-        o = this.$e - 1, u = t - 1;
+        o = this.qe - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Ye[o] === e[u] || (this.Xe && compare(this.ze, this.Ye[o], e[u])));
+        (this.ze[o] === e[u] || (this.nt && compare(this.tt, this.ze[o], e[u])));
         o--, u--
       ) {
-        E[u] = this.Ze[o];
-        T[u] = this.qe[o];
-        S && (S[u] = this.Xe[o]);
-        d && (d[u] = this.Je[o]);
+        E[u] = this.Je[o];
+        S[u] = this.et[o];
+        T && (T[u] = this.nt[o]);
+        d && (d[u] = this.it[o]);
       }
-      l = new Map();
+      a = new Map();
       f = new Array(u + 1);
       for (i = u; i >= s; i--) {
-        c = e[i];
-        a = this.ze ? this.ze(c) : c;
-        n = l.get(a);
+        l = e[i];
+        c = this.tt ? this.tt(l) : l;
+        n = a.get(c);
         f[i] = n === undefined ? -1 : n;
-        l.set(a, i);
+        a.set(c, i);
       }
       for (n = s; n <= o; n++) {
-        c = this.Ye[n];
-        a = this.ze ? this.ze(c) : c;
-        i = l.get(a);
+        l = this.ze[n];
+        c = this.tt ? this.tt(l) : l;
+        i = a.get(c);
         if (i !== undefined && i !== -1) {
-          E[i] = this.Ze[n];
-          T[i] = this.qe[n];
-          S && (S[i] = this.Xe[n]);
-          d && (d[i] = this.Je[n]);
+          E[i] = this.Je[n];
+          S[i] = this.et[n];
+          T && (T[i] = this.nt[n]);
+          d && (d[i] = this.it[n]);
           i = f[i];
-          l.set(a, i);
-        } else this.qe[n].dispose();
+          a.set(c, i);
+        } else this.et[n].dispose();
       }
       for (i = s; i < t; i++) {
         if (i in E) {
-          this.Ze[i] = E[i];
-          this.qe[i] = T[i];
-          if (S) {
-            this.Xe[i] = S[i];
-            setSignal(this.Xe[i], e[i]);
+          this.Je[i] = E[i];
+          this.et[i] = S[i];
+          if (T) {
+            this.nt[i] = T[i];
+            setSignal(this.nt[i], e[i]);
           }
           if (d) {
-            this.Je[i] = d[i];
-            setSignal(this.Je[i], i);
+            this.it[i] = d[i];
+            setSignal(this.it[i], i);
           }
         } else {
-          this.Ze[i] = runWithOwner((this.qe[i] = createOwner()), r);
+          this.Je[i] = runWithOwner((this.et[i] = createOwner()), r);
         }
       }
-      this.Ze = this.Ze.slice(0, (this.$e = t));
-      this.Ye = e.slice(0);
+      this.Je = this.Je.slice(0, (this.qe = t));
+      this.ze = e.slice(0);
     }
   });
-  return this.Ze;
+  return this.Je;
 }
 function repeat(e, t, n) {
   const i = t;
   const r = computed(
     updateRepeat.bind({
-      je: createOwner(),
-      $e: 0,
-      tt: 0,
-      nt: e,
-      Be: i,
-      qe: [],
-      Ze: [],
-      it: n?.from,
-      et: n?.fallback
+      Ze: createOwner(),
+      qe: 0,
+      ot: 0,
+      ut: e,
+      Xe: i,
+      et: [],
+      Je: [],
+      lt: n?.from,
+      st: n?.fallback
     })
   );
-  r.Ee &= ~CONFIG_AUTO_DISPOSE;
+  r._e &= ~CONFIG_AUTO_DISPOSE;
   return accessor(r);
 }
 function updateRepeat() {
-  const e = this.nt();
-  const t = this.it?.() || 0;
-  runWithOwner(this.je, () => {
+  const e = this.ut();
+  const t = this.lt?.() || 0;
+  runWithOwner(this.Ze, () => {
     if (e === 0) {
-      if (this.$e !== 0) {
-        this.je.dispose(false);
-        this.qe = [];
-        this.Ze = [];
-        this.$e = 0;
+      if (this.qe !== 0) {
+        this.Ze.dispose(false);
+        this.et = [];
+        this.Je = [];
+        this.qe = 0;
       }
-      if (this.et && !this.Ze[0]) {
-        this.Ze[0] = runWithOwner((this.qe[0] = createOwner()), this.et);
+      if (this.st && !this.Je[0]) {
+        this.Je[0] = runWithOwner((this.et[0] = createOwner()), this.st);
       }
       return;
     }
     const n = t + 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;
+    const i = this.ot + this.qe;
+    if (this.qe === 0 && this.et[0]) this.et[0].dispose();
+    for (let e = n; e < i; e++) this.et[e - this.ot].dispose();
+    if (this.ot < t) {
+      let e = this.ot;
+      while (e < t && e < this.qe) this.et[e++].dispose();
+      this.et.splice(0, t - this.ot);
+      this.Je.splice(0, t - this.ot);
+    } else if (this.ot > t) {
+      let n = i - this.ot - 1;
+      let r = this.ot - t;
+      this.et.length = this.Je.length = e;
       while (n >= r) {
-        this.qe[n] = this.qe[n - r];
-        this.Ze[n] = this.Ze[n - r];
+        this.et[n] = this.et[n - r];
+        this.Je[n] = this.Je[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.Ze[e] = runWithOwner((this.qe[e] = createOwner()), () => this.Be(e + t));
+        this.Je[e] = runWithOwner((this.et[e] = createOwner()), () => this.Xe(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.Ze[e - t] = runWithOwner((this.qe[e - t] = createOwner()), () => this.Be(e));
+      this.Je[e - t] = runWithOwner((this.et[e - t] = createOwner()), () => this.Xe(e));
     }
-    this.Ze = this.Ze.slice(0, e);
-    this.tt = t;
-    this.$e = e;
+    this.Je = this.Je.slice(0, e);
+    this.ot = t;
+    this.qe = e;
   });
-  return this.Ze;
+  return this.Je;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, { lazy: true });
-  n.Ge = (e, t) => {
-    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.xe = (e, t) => {
+    const i = e !== undefined ? e : n.he;
+    const r = t !== undefined ? t : n.Re;
+    n.he &= ~n.ct;
+    n.te.notify(n, n.ct, i, r);
   };
-  n.rt = t;
-  n.Ee &= ~CONFIG_AUTO_DISPOSE;
+  n.ct = t;
+  n._e &= ~CONFIG_AUTO_DISPOSE;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, i) {
-  const r = e.$;
-  r.addChild((e.$ = n));
-  cleanup(() => r.removeChild(e.$));
+  const r = e.te;
+  r.addChild((e.te = n));
+  cleanup(() => r.removeChild(e.te));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), i);
@@ -3276,52 +3609,52 @@ function isRevealController(e) {
   return e instanceof RevealController;
 }
 function isSlotReady(e) {
-  return isRevealController(e) ? e.isReady() : e.st.size === 0 && !e.ot;
+  return isRevealController(e) ? e.isReady() : e.ft.size === 0 && !e.Et;
 }
 function isSlotMinimallyReady(e) {
   return isRevealController(e) ? e.isMinimallyReady() : isSlotReady(e);
 }
 function setSlotState(e, t, n, i) {
-  setSignal(e.ut, n);
-  setSignal(e.ct, i);
+  setSignal(e.St, n);
+  setSignal(e.Tt, i);
   if (isRevealController(e)) {
-    if (!n && e.lt === t) e.lt = undefined;
+    if (!n && e.dt === t) e.dt = undefined;
     return e.evaluate(n, i);
   }
-  if (!n && e.ft === t && e.Et) e.ft = undefined;
+  if (!n && e.Ot === t && e._t) e.Ot = undefined;
 }
 class RevealController {
-  Tt;
-  St;
-  dt = [];
-  lt;
-  ut = signal(false, { ownedWrite: true, Fe: true });
-  ct = signal(false, { ownedWrite: true, Fe: true });
-  Ot = true;
-  Rt = true;
-  _t = false;
+  Rt;
+  It;
+  ht = [];
+  dt;
+  St = signal(false, { ownedWrite: true, Ye: true });
+  Tt = signal(false, { ownedWrite: true, Ye: true });
+  Nt = true;
+  At = true;
+  Ct = false;
   constructor(e, t) {
-    this.Tt = e;
-    this.St = t;
+    this.Rt = e;
+    this.It = t;
   }
-  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;
+  Pt(e) {
+    for (let t = 0; t < this.ht.length; t++) {
+      const n = this.ht[t];
+      if ((isRevealController(n) ? n.dt : n.Ot) !== this) continue;
       if (e(n) === false) return false;
     }
     return true;
   }
   isReady() {
-    return this.It(isSlotReady);
+    return this.Pt(isSlotReady);
   }
   isMinimallyReady() {
-    const e = untrack(this.Tt);
+    const e = untrack(this.Rt);
     if (e === "together") return this.isReady();
     if (e === "natural") {
       let e = false;
       let t = false;
-      this.It(n => {
+      this.Pt(n => {
         e = true;
         if (isSlotMinimallyReady(n)) {
           t = true;
@@ -3331,58 +3664,58 @@ class RevealController {
       return !e || t;
     }
     let t = true;
-    this.It(e => {
+    this.Pt(e => {
       t = isSlotMinimallyReady(e);
       return false;
     });
     return t;
   }
   register(e) {
-    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));
+    if (this.ht.includes(e)) return;
+    this.ht.push(e);
+    const t = untrack(this.Rt);
+    (setSignal(e.St, true), setSignal(e.Tt, t === "sequential" ? !!untrack(this.It) : false));
     untrack(() => this.evaluate());
   }
   unregister(e) {
-    const t = this.dt.indexOf(e);
-    if (t >= 0) this.dt.splice(t, 1);
+    const t = this.ht.indexOf(e);
+    if (t >= 0) this.ht.splice(t, 1);
     untrack(() => this.evaluate());
   }
   evaluate(e, t) {
-    if (this._t) return;
-    this._t = true;
-    const n = this.Ot;
-    const i = this.Rt;
+    if (this.Ct) return;
+    this.Ct = true;
+    const n = this.Nt;
+    const i = this.At;
     try {
-      const n = e ?? read(this.ut),
-        i = untrack(this.Tt),
-        r = i === "sequential" && !!untrack(this.St),
+      const n = e ?? read(this.St),
+        i = untrack(this.Rt),
+        r = i === "sequential" && !!untrack(this.It),
         s = t ?? r;
       if (n) {
-        this.It(e => setSlotState(e, this, true, s));
+        this.Pt(e => setSlotState(e, this, true, s));
       } else if (i === "natural") {
-        this.It(e => {
+        this.Pt(e => {
           if (isRevealController(e)) {
-            setSignal(e.ct, false);
-            setSignal(e.ut, false);
+            setSignal(e.Tt, false);
+            setSignal(e.St, 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));
+        const e = this.Pt(isSlotMinimallyReady);
+        this.Pt(t => setSlotState(t, this, !e, false));
       } else {
         let e = false;
-        this.It(t => {
+        this.Pt(t => {
           if (e) return setSlotState(t, this, true, r);
           if (isSlotReady(t)) return setSlotState(t, this, false, false);
           e = true;
           if (isRevealController(t)) {
-            setSignal(t.ct, false);
-            setSignal(t.ut, false);
+            setSignal(t.Tt, false);
+            setSignal(t.St, false);
             t.evaluate(false, false);
           } else {
             setSlotState(t, this, true, false);
@@ -3390,96 +3723,96 @@ class RevealController {
         });
       }
     } finally {
-      this.Ot = this.isReady();
-      this.Rt = this.isMinimallyReady();
-      this._t = false;
+      this.Nt = this.isReady();
+      this.At = this.isMinimallyReady();
+      this.Ct = false;
     }
-    if (this.lt && (n !== this.Ot || i !== this.Rt)) this.lt.evaluate();
+    if (this.dt && (n !== this.Nt || i !== this.At)) this.dt.evaluate();
   }
 }
 class CollectionQueue extends Queue {
-  ht;
-  st = new Set();
-  Nt;
-  ot = true;
-  ut = signal(false, { ownedWrite: true, Fe: true });
-  ct = signal(false, { ownedWrite: true, Fe: true });
-  ft;
-  Et = false;
-  At;
-  Pt = ON_INIT;
+  gt;
+  ft = new Set();
+  Dt;
+  Et = true;
+  St = signal(false, { ownedWrite: true, Ye: true });
+  Tt = signal(false, { ownedWrite: true, Ye: true });
+  Ot;
+  _t = false;
+  yt;
+  vt = ON_INIT;
   constructor(e) {
     super();
-    this.ht = e;
+    this.gt = e;
   }
   run(e) {
-    if (!e || (read(this.ut) && (!_revealUsed || read(this.ct)))) return;
+    if (!e || (read(this.St) && (!_revealUsed || read(this.Tt)))) return;
     return super.run(e);
   }
   notify(e, t, n, i) {
-    if (!(t & this.ht)) return super.notify(e, t, n, i);
-    if (this.Et && this.At) {
+    if (!(t & this.gt)) return super.notify(e, t, n, i);
+    if (this._t && this.yt) {
       const e = untrack(() => {
         try {
-          return this.At();
+          return this.yt();
         } catch {
           return ON_INIT;
         }
       });
-      if (e !== this.Pt) {
-        this.Pt = e;
-        this.Et = false;
-        this.st.clear();
+      if (e !== this.vt) {
+        this.vt = e;
+        this._t = false;
+        this.ft.clear();
       }
     }
-    if (this.ht & STATUS_PENDING && this.Et) return super.notify(e, t, n, i);
-    if (this.ht & STATUS_PENDING && n & STATUS_ERROR) {
+    if (this.gt & STATUS_PENDING && this._t) return super.notify(e, t, n, i);
+    if (this.gt & STATUS_PENDING && n & STATUS_ERROR) {
       return super.notify(e, STATUS_ERROR, n, i);
     }
-    if (n & this.ht) {
-      this.ot = true;
-      const t = i?.source || e.Te?.source;
+    if (n & this.gt) {
+      this.Et = true;
+      const t = i?.source || e.Re?.source;
       if (t) {
-        const e = this.st.size === 0;
-        this.st.add(t);
-        if (e) setSignal(this.ut, true);
+        const e = this.ft.size === 0;
+        this.ft.add(t);
+        if (e) setSignal(this.St, true);
       }
     }
-    t &= ~this.ht;
+    t &= ~this.gt;
     return t ? super.notify(e, t, n, i) : true;
   }
   checkSources() {
-    for (const e of this.st) {
+    for (const e of this.ft) {
       if (
-        e.R & REACTIVE_DISPOSED ||
-        (!(e.Oe & this.ht) && !(this.ht & STATUS_ERROR && e.Oe & STATUS_PENDING))
+        e._ & REACTIVE_DISPOSED ||
+        (!(e.he & this.gt) && !(this.gt & STATUS_ERROR && e.he & STATUS_PENDING))
       )
-        this.st.delete(e);
+        this.ft.delete(e);
     }
-    if (!this.st.size) {
-      if (this.ht & STATUS_PENDING && this.ot && !this.Et && this.Nt) {
-        this.ot = !!(this.Nt.Oe & this.ht);
+    if (!this.ft.size) {
+      if (this.gt & STATUS_PENDING && this.Et && !this._t && this.Dt) {
+        this.Et = !!(this.Dt.he & this.gt);
       } else {
-        this.ot = false;
+        this.Et = false;
       }
-      if (!this.ot) {
-        setSignal(this.ut, false);
-        if (this.At) {
+      if (!this.Et) {
+        setSignal(this.St, false);
+        if (this.yt) {
           try {
-            this.Pt = untrack(() => this.At());
+            this.vt = untrack(() => this.yt());
           } catch {}
         }
       }
     }
-    if (_revealUsed) this.ft?.evaluate();
+    if (_revealUsed) this.Ot?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, i) {
   const r = createOwner();
   if (_revealUsed) setContext(RevealControllerContext, null, r);
   const s = new CollectionQueue(e);
-  if (i) s.At = i;
-  const o = (s.Nt = createBoundChildren(r, t, s, e));
+  if (i) s.yt = i;
+  const o = (s.Dt = createBoundChildren(r, t, s, e));
   untrack(() => {
     let t = false;
     try {
@@ -3488,21 +3821,21 @@ function createCollectionBoundary(e, t, n, i) {
       if (e instanceof NotReadyError) t = true;
       else throw e;
     }
-    s.ot = t || !!(o.Oe & e) || o.Te instanceof NotReadyError;
+    s.Et = t || !!(o.he & e) || o.Re instanceof NotReadyError;
   });
   const u = _revealUsed && e === STATUS_PENDING ? getContext(RevealControllerContext) : null;
   if (u) {
-    s.ft = u;
+    s.Ot = u;
     u.register(s);
     cleanup(() => u.unregister(s));
   }
   return accessor(
     computed(() => {
-      if (!read(s.ut)) {
+      if (!read(s.St)) {
         const e = read(o);
-        if (!untrack(() => read(s.ut))) return ((s.Et = true), e);
+        if (!untrack(() => read(s.St))) return ((s._t = true), e);
       }
-      if (_revealUsed && read(s.ct)) return undefined;
+      if (_revealUsed && read(s.Tt)) return undefined;
       return n(s);
     })
   );
@@ -3512,10 +3845,10 @@ function createLoadingBoundary(e, t, n) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(STATUS_ERROR, e, e => {
-    let n = e.st.values().next().value;
-    const i = n.Te?.cause ?? n.Te;
+    let n = e.ft.values().next().value;
+    const i = n.Re?.cause ?? n.Re;
     return t(i, () => {
-      for (const t of e.st) recompute(t);
+      for (const t of e.ft) recompute(t);
       schedule();
     });
   });
@@ -3536,7 +3869,7 @@ function createRevealOrder(e, t) {
       o.evaluate();
     });
     if (i) {
-      o.lt = i;
+      o.dt = i;
       i.register(o);
       cleanup(() => i.unregister(o));
     }