@solidjs/signals 0.10.4 → 0.10.6

package/dist/prod.js

@@ -31,6 +31,7 @@ const REACTIVE_IN_HEAP_HEIGHT = 1 << 4;
 const REACTIVE_ZOMBIE = 1 << 5;
 const REACTIVE_DISPOSED = 1 << 6;
 const REACTIVE_OPTIMISTIC_DIRTY = 1 << 7;
+const REACTIVE_SNAPSHOT_STALE = 1 << 8;
 const STATUS_PENDING = 1 << 0;
 const STATUS_ERROR = 1 << 1;
 const STATUS_UNINITIALIZED = 1 << 2;
@@ -38,6 +39,8 @@ const EFFECT_RENDER = 1;
 const EFFECT_USER = 2;
 const EFFECT_TRACKED = 3;
 const NOT_PENDING = {};
+const NO_SNAPSHOT = {};
+const STORE_SNAPSHOT_PROPS = "sp";
 const SUPPORTS_PROXY = typeof Proxy === "function";
 const defaultContext = {};
 const $REFRESH = Symbol("refresh");
@@ -49,61 +52,61 @@ function actualInsertIntoHeap(e, t) {
   if (r === undefined) t.l[i] = e;
   else {
     const t = r.T;
-    t.R = e;
+    t.S = e;
     e.T = t;
     r.T = e;
   }
-  if (i > t.O) t.O = i;
+  if (i > t.R) t.R = i;
 }
 function insertIntoHeap(e, t) {
-  let n = e.S;
+  let n = e.O;
   if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS)) return;
   if (n & REACTIVE_CHECK) {
-    e.S = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
-  } else e.S = n | REACTIVE_IN_HEAP;
+    e.O = (n & -4) | REACTIVE_DIRTY | REACTIVE_IN_HEAP;
+  } else e.O = n | REACTIVE_IN_HEAP;
   if (!(n & REACTIVE_IN_HEAP_HEIGHT)) actualInsertIntoHeap(e, t);
 }
 function insertIntoHeapHeight(e, t) {
-  let n = e.S;
+  let n = e.O;
   if (n & (REACTIVE_IN_HEAP | REACTIVE_RECOMPUTING_DEPS | REACTIVE_IN_HEAP_HEIGHT)) return;
-  e.S = n | REACTIVE_IN_HEAP_HEIGHT;
+  e.O = n | REACTIVE_IN_HEAP_HEIGHT;
   actualInsertIntoHeap(e, t);
 }
 function deleteFromHeap(e, t) {
-  const n = e.S;
+  const n = e.O;
   if (!(n & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT))) return;
-  e.S = n & -25;
+  e.O = n & -25;
   const i = e.o;
   if (e.T === e) t.l[i] = undefined;
   else {
-    const n = e.R;
+    const n = e.S;
     const r = t.l[i];
     const o = n ?? r;
     if (e === r) t.l[i] = n;
-    else e.T.R = n;
+    else e.T.S = n;
     o.T = e.T;
   }
   e.T = e;
-  e.R = undefined;
+  e.S = undefined;
 }
 function markHeap(e) {
   if (e._) return;
   e._ = true;
-  for (let t = 0; t <= e.O; t++) {
-    for (let n = e.l[t]; n !== undefined; n = n.R) {
-      if (n.S & REACTIVE_IN_HEAP) markNode(n);
+  for (let t = 0; t <= e.R; t++) {
+    for (let n = e.l[t]; n !== undefined; n = n.S) {
+      if (n.O & REACTIVE_IN_HEAP) markNode(n);
     }
   }
 }
 function markNode(e, t = REACTIVE_DIRTY) {
-  const n = e.S;
+  const n = e.O;
   if ((n & (REACTIVE_CHECK | REACTIVE_DIRTY)) >= t) return;
-  e.S = (n & -4) | t;
+  e.O = (n & -4) | t;
   for (let t = e.I; t !== null; t = t.p) {
     markNode(t.h, REACTIVE_CHECK);
   }
   if (e.A !== null) {
-    for (let t = e.A; t !== null; t = t.C) {
+    for (let t = e.A; t !== null; t = t.P) {
       for (let e = t.I; e !== null; e = e.p) {
         markNode(e.h, REACTIVE_CHECK);
       }
@@ -112,20 +115,20 @@ function markNode(e, t = REACTIVE_DIRTY) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.P = 0; e.P <= e.O; e.P++) {
-    let n = e.l[e.P];
+  for (e.N = 0; e.N <= e.R; e.N++) {
+    let n = e.l[e.N];
     while (n !== undefined) {
-      if (n.S & REACTIVE_IN_HEAP) t(n);
+      if (n.O & REACTIVE_IN_HEAP) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.P];
+      n = e.l[e.N];
     }
   }
-  e.O = 0;
+  e.R = 0;
 }
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.N; t; t = t.D) {
+  for (let t = e.C; t; t = t.D) {
     const e = t.V;
     const i = e.m || e;
     if (i.L && i.o >= n) n = i.o + 1;
@@ -138,8 +141,8 @@ function adjustHeight(e, 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), _: false, N: 0, R: 0 };
+const zombieQueue = { l: new Array(2e3).fill(undefined), _: false, N: 0, R: 0 };
 let clock = 0;
 let activeTransition = null;
 let scheduled = false;
@@ -160,11 +163,11 @@ function setProjectionWriteActive(e) {
 function schedule() {
   if (scheduled) return;
   scheduled = true;
-  if (!globalQueue.M) queueMicrotask(flush);
+  if (!globalQueue.H) queueMicrotask(flush);
 }
 class Queue {
   i = null;
-  F = [[], []];
+  M = [[], []];
   G = [];
   created = clock;
   addChild(e) {
@@ -183,9 +186,9 @@ class Queue {
     return false;
   }
   run(e) {
-    if (this.F[e - 1].length) {
-      const t = this.F[e - 1];
-      this.F[e - 1] = [];
+    if (this.M[e - 1].length) {
+      const t = this.M[e - 1];
+      this.M[e - 1] = [];
       runQueue(t, e);
     }
     for (let t = 0; t < this.G.length; t++) this.G[t].run?.(e);
@@ -196,28 +199,28 @@ class Queue {
         const n = findLane(currentOptimisticLane);
         n.W[e - 1].push(t);
       } else {
-        this.F[e - 1].push(t);
+        this.M[e - 1].push(t);
       }
     }
     schedule();
   }
   stashQueues(e) {
-    e.F[0].push(...this.F[0]);
-    e.F[1].push(...this.F[1]);
-    this.F = [[], []];
+    e.M[0].push(...this.M[0]);
+    e.M[1].push(...this.M[1]);
+    this.M = [[], []];
     for (let t = 0; t < this.G.length; t++) {
       let n = this.G[t];
       let i = e.G[t];
       if (!i) {
-        i = { F: [[], []], G: [] };
+        i = { M: [[], []], G: [] };
         e.G[t] = i;
       }
       n.stashQueues(i);
     }
   }
   restoreQueues(e) {
-    this.F[0].push(...e.F[0]);
-    this.F[1].push(...e.F[1]);
+    this.M[0].push(...e.M[0]);
+    this.M[1].push(...e.M[1]);
     for (let t = 0; t < e.G.length; t++) {
       const n = e.G[t];
       let i = this.G[t];
@@ -226,16 +229,16 @@ class Queue {
   }
 }
 class GlobalQueue extends Queue {
-  M = false;
+  H = false;
+  F = [];
   $ = [];
-  H = [];
   j = new Set();
   static K;
   static Y;
   static B = null;
   flush() {
-    if (this.M) return;
-    this.M = true;
+    if (this.H) return;
+    this.H = true;
     try {
       runHeap(dirtyQueue, GlobalQueue.K);
       if (activeTransition) {
@@ -243,38 +246,38 @@ class GlobalQueue extends Queue {
         if (!e) {
           let e = activeTransition;
           runHeap(zombieQueue, GlobalQueue.K);
+          this.F = [];
           this.$ = [];
-          this.H = [];
           this.j = new Set();
           runLaneEffects(EFFECT_RENDER);
           runLaneEffects(EFFECT_USER);
           this.stashQueues(activeTransition.X);
           clock++;
-          scheduled = dirtyQueue.O >= dirtyQueue.P;
-          reassignPendingTransition(activeTransition.$);
+          scheduled = dirtyQueue.R >= dirtyQueue.N;
+          reassignPendingTransition(activeTransition.F);
           activeTransition = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.$ !== activeTransition.$ && this.$.push(...activeTransition.$);
+        this.F !== activeTransition.F && this.F.push(...activeTransition.F);
         this.restoreQueues(activeTransition.X);
         transitions.delete(activeTransition);
         const t = activeTransition;
         activeTransition = null;
-        reassignPendingTransition(this.$);
+        reassignPendingTransition(this.F);
         finalizePureQueue(t);
       } else {
         if (transitions.size) runHeap(zombieQueue, GlobalQueue.K);
         finalizePureQueue();
       }
       clock++;
-      scheduled = dirtyQueue.O >= dirtyQueue.P;
+      scheduled = dirtyQueue.R >= dirtyQueue.N;
       runLaneEffects(EFFECT_RENDER);
       this.run(EFFECT_RENDER);
       runLaneEffects(EFFECT_USER);
       this.run(EFFECT_USER);
     } finally {
-      this.M = false;
+      this.H = false;
     }
   }
   notify(e, t, n, i) {
@@ -297,12 +300,12 @@ class GlobalQueue extends Queue {
     if (!activeTransition) {
       activeTransition = e ?? {
         J: clock,
-        $: [],
+        F: [],
         Z: [],
-        H: [],
+        $: [],
         j: new Set(),
         ee: [],
-        X: { F: [[], []], G: [] },
+        X: { M: [[], []], G: [] },
         te: false
       };
     } else if (e) {
@@ -312,7 +315,7 @@ class GlobalQueue extends Queue {
       for (const n of activeLanes) {
         if (n.ne === t) n.ne = e;
       }
-      e.H.push(...t.H);
+      e.$.push(...t.$);
       for (const n of t.j) {
         e.j.add(n);
       }
@@ -321,18 +324,18 @@ class GlobalQueue extends Queue {
     }
     transitions.add(activeTransition);
     activeTransition.J = clock;
+    for (let e = 0; e < this.F.length; e++) {
+      const t = this.F[e];
+      t.ne = activeTransition;
+      activeTransition.F.push(t);
+    }
+    this.F = activeTransition.F;
     for (let e = 0; e < this.$.length; e++) {
       const t = this.$[e];
       t.ne = activeTransition;
       activeTransition.$.push(t);
     }
     this.$ = activeTransition.$;
-    for (let e = 0; e < this.H.length; e++) {
-      const t = this.H[e];
-      t.ne = activeTransition;
-      activeTransition.H.push(t);
-    }
-    this.H = activeTransition.H;
     for (const e of activeLanes) {
       if (!e.ne) e.ne = activeTransition;
     }
@@ -342,54 +345,59 @@ class GlobalQueue extends Queue {
 }
 function insertSubs(e, t = false) {
   const n = e.ie || currentOptimisticLane;
-  for (let i = e.I; i !== null; i = i.p) {
+  const i = e.re !== undefined;
+  for (let r = e.I; r !== null; r = r.p) {
+    if (i && r.h.oe) {
+      r.h.O |= REACTIVE_SNAPSHOT_STALE;
+      continue;
+    }
     if (t && n) {
-      i.h.S |= REACTIVE_OPTIMISTIC_DIRTY;
-      assignOrMergeLane(i.h, n);
+      r.h.O |= REACTIVE_OPTIMISTIC_DIRTY;
+      assignOrMergeLane(r.h, n);
     } else if (t) {
-      i.h.S |= REACTIVE_OPTIMISTIC_DIRTY;
-      i.h.ie = undefined;
+      r.h.O |= REACTIVE_OPTIMISTIC_DIRTY;
+      r.h.ie = undefined;
     }
-    const e = i.h;
-    if (e.re === EFFECT_TRACKED) {
-      if (!e.oe) {
-        e.oe = true;
-        e.se.enqueue(EFFECT_USER, e.ue);
+    const e = r.h;
+    if (e.se === EFFECT_TRACKED) {
+      if (!e.ue) {
+        e.ue = true;
+        e.ce.enqueue(EFFECT_USER, e.le);
       }
       continue;
     }
-    const r = i.h.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
-    if (r.P > i.h.o) r.P = i.h.o;
-    insertIntoHeap(i.h, r);
+    const o = r.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue;
+    if (o.N > r.h.o) o.N = r.h.o;
+    insertIntoHeap(r.h, o);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
   if (!t) checkBoundaryChildren(globalQueue);
-  if (dirtyQueue.O >= dirtyQueue.P) runHeap(dirtyQueue, GlobalQueue.K);
+  if (dirtyQueue.R >= dirtyQueue.N) runHeap(dirtyQueue, GlobalQueue.K);
   if (n) {
-    const t = globalQueue.$;
+    const t = globalQueue.F;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
-      if (n.ce !== NOT_PENDING) {
-        n.le = n.ce;
-        n.ce = NOT_PENDING;
-        if (n.re && n.re !== EFFECT_TRACKED) n.oe = true;
+      if (n.ae !== NOT_PENDING) {
+        n.fe = n.ae;
+        n.ae = NOT_PENDING;
+        if (n.se && n.se !== EFFECT_TRACKED) n.ue = true;
       }
-      n.ae &= ~STATUS_UNINITIALIZED;
+      n.Ee &= ~STATUS_UNINITIALIZED;
       if (n.L) GlobalQueue.Y(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.H : globalQueue.H;
+    const n = e ? e.$ : globalQueue.$;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
-      const i = t.ce;
+      const i = t.ae;
       t.ie = undefined;
-      if (i !== NOT_PENDING && t.le !== i) {
-        t.le = i;
+      if (i !== NOT_PENDING && t.fe !== i) {
+        t.fe = i;
         insertSubs(t, true);
       }
-      t.ce = NOT_PENDING;
+      t.ae = NOT_PENDING;
       t.ne = null;
     }
     n.length = 0;
@@ -408,12 +416,12 @@ function finalizePureQueue(e = null, t = false) {
         if (t.W[0].length) runQueue(t.W[0], EFFECT_RENDER);
         if (t.W[1].length) runQueue(t.W[1], EFFECT_USER);
       }
-      if (t.fe.ie === t) t.fe.ie = undefined;
+      if (t.Te.ie === t) t.Te.ie = undefined;
       t.U.clear();
       t.W[0].length = 0;
       t.W[1].length = 0;
       activeLanes.delete(t);
-      signalLanes.delete(t.fe);
+      signalLanes.delete(t.Te);
     }
   }
 }
@@ -447,7 +455,7 @@ function transitionComplete(e) {
   let t = true;
   for (let n = 0; n < e.Z.length; n++) {
     const i = e.Z[n];
-    if (i.ae & STATUS_PENDING && i.q?.source === i) {
+    if (i.Ee & STATUS_PENDING && i.q?.source === i) {
       t = false;
       break;
     }
@@ -478,12 +486,12 @@ function getOrCreateLane(e) {
   if (t) {
     return findLane(t);
   }
-  const n = e.Ee;
+  const n = e.de;
   const i = n?.ie ? findLane(n.ie) : null;
-  t = { fe: e, U: new Set(), W: [[], []], k: null, ne: activeTransition, Te: i };
+  t = { Te: e, U: new Set(), W: [[], []], k: null, ne: activeTransition, Se: i };
   signalLanes.set(e, t);
   activeLanes.add(t);
-  e.de = e.Re || 0;
+  e.Re = e.Oe || 0;
   return t;
 }
 function findLane(e) {
@@ -509,7 +517,7 @@ function resolveLane(e) {
   return undefined;
 }
 function hasActiveOverride(e) {
-  return !!(e.Oe && e.ce !== NOT_PENDING);
+  return !!(e._e && e.ae !== NOT_PENDING);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
@@ -522,9 +530,9 @@ function assignOrMergeLane(e, t) {
     const r = findLane(i);
     if (activeLanes.has(r)) {
       if (r !== n && !hasActiveOverride(e)) {
-        if (n.Te && findLane(n.Te) === r) {
+        if (n.Se && findLane(n.Se) === r) {
           e.ie = t;
-        } else if (r.Te && findLane(r.Te) === n);
+        } else if (r.Se && findLane(r.Se) === n);
         else mergeLanes(n, r);
       }
       return;
@@ -537,41 +545,41 @@ function handleAsync(e, t, n) {
   const r = i && untrack(() => t[Symbol.asyncIterator]);
   const o = !r && i && untrack(() => typeof t.then === "function");
   if (!o && !r) {
-    e.Se = null;
+    e.Ie = null;
     return t;
   }
-  e.Se = t;
+  e.Ie = t;
   let s;
   const handleError = n => {
-    if (e.Se !== t) return;
+    if (e.Ie !== t) return;
     globalQueue.initTransition(e.ne);
     notifyStatus(e, n instanceof NotReadyError ? STATUS_PENDING : STATUS_ERROR, n);
     e.J = clock;
   };
   const asyncWrite = (i, r) => {
-    if (e.Se !== t) return;
-    if (e.S & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
+    if (e.Ie !== t) return;
+    if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY)) return;
     globalQueue.initTransition(e.ne);
     clearStatus(e);
     const o = resolveLane(e);
     if (o) o.U.delete(e);
     if (n) n(i);
-    else if (e.Oe) {
-      const t = e.ce !== NOT_PENDING;
-      if (e.L) e.ce = i;
+    else if (e._e) {
+      const t = e.ae !== NOT_PENDING;
+      if (e.L) e.ae = i;
       if (!t) {
-        e.le = i;
+        e.fe = i;
         insertSubs(e);
       }
       e.J = clock;
     } else if (o) {
-      const t = e.le;
-      const n = e._e;
+      const t = e.fe;
+      const n = e.pe;
       if (!n || !n(i, t)) {
-        e.le = i;
+        e.fe = i;
         e.J = clock;
-        if (e.Ie) {
-          setSignal(e.Ie, i);
+        if (e.he) {
+          setSignal(e.he, i);
         }
         insertSubs(e, true);
       }
@@ -637,19 +645,19 @@ function handleAsync(e, t, n) {
   return s;
 }
 function clearStatus(e) {
-  e.ae = e.ae & STATUS_UNINITIALIZED;
+  e.Ee = e.Ee & STATUS_UNINITIALIZED;
   e.q = null;
   updatePendingSignal(e);
-  e.pe?.();
+  e.Ae?.();
 }
 function notifyStatus(e, t, n, i, r) {
   if (t === STATUS_ERROR && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const o = n instanceof NotReadyError && n.source === e;
-  const s = t === STATUS_PENDING && e.Oe && !o;
+  const s = t === STATUS_PENDING && e._e && !o;
   const u = s && hasActiveOverride(e);
   if (!i) {
-    e.ae = t | (t !== STATUS_ERROR ? e.ae & STATUS_UNINITIALIZED : 0);
+    e.Ee = t | (t !== STATUS_ERROR ? e.Ee & STATUS_UNINITIALIZED : 0);
     e.q = n;
     updatePendingSignal(e);
   }
@@ -664,26 +672,26 @@ function notifyStatus(e, t, n, i, r) {
   }
   const c = i || u;
   const l = i || s ? undefined : r;
-  if (e.pe) {
+  if (e.Ae) {
     if (c) {
-      e.pe(t, n);
+      e.Ae(t, n);
     } else {
-      e.pe();
+      e.Ae();
     }
     return;
   }
   for (let i = e.I; i !== null; i = i.p) {
     i.h.J = clock;
     if (i.h.q !== n) {
-      !i.h.ne && globalQueue.$.push(i.h);
+      !i.h.ne && globalQueue.F.push(i.h);
       notifyStatus(i.h, t, n, c, l);
     }
   }
-  for (let i = e.A; i !== null; i = i.C) {
+  for (let i = e.A; i !== null; i = i.P) {
     for (let e = i.I; e !== null; e = e.p) {
       e.h.J = clock;
       if (e.h.q !== n) {
-        !e.h.ne && globalQueue.$.push(e.h);
+        !e.h.ne && globalQueue.F.push(e.h);
         notifyStatus(e.h, t, n, c, l);
       }
     }
@@ -693,52 +701,52 @@ function unlinkSubs(e) {
   const t = e.V;
   const n = e.D;
   const i = e.p;
-  const r = e.he;
-  if (i !== null) i.he = r;
-  else t.Ae = r;
+  const r = e.ge;
+  if (i !== null) i.ge = r;
+  else t.Pe = r;
   if (r !== null) r.p = i;
   else {
     t.I = i;
     if (i === null) {
-      t.ge?.();
-      t.L && !t.Ce && unobserved(t);
+      t.Ne?.();
+      t.L && !t.Ce && !(t.O & REACTIVE_ZOMBIE) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-  let t = e.N;
+  deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+  let t = e.C;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.N = null;
+  e.C = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.Pe;
+  const n = t.ye;
   if (n !== null && n.V === e) return;
   let i = null;
-  const r = t.S & REACTIVE_RECOMPUTING_DEPS;
+  const r = t.O & REACTIVE_RECOMPUTING_DEPS;
   if (r) {
-    i = n !== null ? n.D : t.N;
+    i = n !== null ? n.D : t.C;
     if (i !== null && i.V === e) {
-      t.Pe = i;
+      t.ye = i;
       return;
     }
   }
-  const o = e.Ae;
+  const o = e.Pe;
   if (o !== null && o.h === t && (!r || isValidLink(o, t))) return;
-  const s = (t.Pe = e.Ae = { V: e, h: t, D: i, he: o, p: null });
+  const s = (t.ye = e.Pe = { V: e, h: t, D: i, ge: o, p: null });
   if (n !== null) n.D = s;
-  else t.N = s;
+  else t.C = s;
   if (o !== null) o.p = s;
   else e.I = s;
 }
 function isValidLink(e, t) {
-  const n = t.Pe;
+  const n = t.ye;
   if (n !== null) {
-    let i = t.N;
+    let i = t.C;
     do {
       if (i === e) return true;
       if (i === n) break;
@@ -749,56 +757,56 @@ function isValidLink(e, t) {
 }
 const PENDING_OWNER = {};
 function markDisposal(e) {
-  let t = e.Ne;
+  let t = e.De;
   while (t) {
-    t.S |= REACTIVE_ZOMBIE;
-    if (t.S & REACTIVE_IN_HEAP) {
+    t.O |= REACTIVE_ZOMBIE;
+    if (t.O & REACTIVE_IN_HEAP) {
       deleteFromHeap(t, dirtyQueue);
       insertIntoHeap(t, zombieQueue);
     }
     markDisposal(t);
-    t = t.ye;
+    t = t.ve;
   }
 }
 function dispose(e) {
-  let t = e.N || null;
+  let t = e.C || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.N = null;
-  e.Pe = null;
+  e.C = null;
+  e.ye = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
-  if (e.S & REACTIVE_DISPOSED) return;
-  if (t) e.S = REACTIVE_DISPOSED;
-  let i = n ? e.De : e.Ne;
+  if (e.O & REACTIVE_DISPOSED) return;
+  if (t) e.O = REACTIVE_DISPOSED;
+  let i = n ? e.we : e.De;
   while (i) {
-    const e = i.ye;
-    if (i.N) {
+    const e = i.ve;
+    if (i.C) {
       const e = i;
-      deleteFromHeap(e, e.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-      let t = e.N;
+      deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+      let t = e.C;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.N = null;
-      e.Pe = null;
+      e.C = null;
+      e.ye = null;
     }
     disposeChildren(i, true);
     i = e;
   }
   if (n) {
-    e.De = null;
+    e.we = null;
   } else {
-    e.Ne = null;
-    e.ye = null;
-    e.ve = 0;
+    e.De = null;
+    e.ve = null;
+    e.Ve = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.we : e.be;
+  let n = t ? e.be : e.me;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -808,12 +816,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.we = null) : (e.be = null);
+  t ? (e.be = null) : (e.me = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.Ve && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.ve++ : n.ve);
+  while (n.Le && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.Ve++ : n.Ve);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -836,39 +844,42 @@ function getOwner() {
 }
 function onCleanup(e) {
   if (!context) return e;
-  if (!context.be) context.be = e;
-  else if (Array.isArray(context.be)) context.be.push(e);
-  else context.be = [context.be, e];
+  if (!context.me) context.me = e;
+  else if (Array.isArray(context.me)) context.me.push(e);
+  else context.me = [context.me, e];
   return e;
 }
+function isDisposed(e) {
+  return !!(e.O & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
+}
 function createOwner(e) {
   const t = context;
   const n = e?.transparent ?? false;
   const i = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    Ve: n || undefined,
+    Le: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    Ne: null,
-    ye: null,
+    De: null,
+    ve: null,
+    me: null,
+    ce: t?.ce ?? globalQueue,
+    ke: t?.ke || defaultContext,
+    Ve: 0,
     be: null,
-    se: t?.se ?? globalQueue,
-    me: t?.me || defaultContext,
-    ve: 0,
     we: null,
-    De: null,
     i: t,
     dispose(e = true) {
       disposeChildren(i, e);
     }
   };
   if (t) {
-    const e = t.Ne;
+    const e = t.De;
     if (e === null) {
-      t.Ne = i;
+      t.De = i;
     } else {
-      i.ye = e;
-      t.Ne = i;
+      i.ve = e;
+      t.De = i;
     }
   }
   return i;
@@ -882,80 +893,80 @@ function effect(e, t, n, i, r) {
   const s = computed(r?.render ? t => staleValues(() => e(t)) : e, i, {
     ...r,
     equals: () => {
-      s.oe = !s.q;
-      if (o) s.se.enqueue(s.re, runEffect.bind(s));
+      s.ue = !s.q;
+      if (o) s.ce.enqueue(s.se, runEffect.bind(s));
       return false;
     },
     lazy: true
   });
-  s.Le = i;
-  s.ke = t;
-  s.Ue = n;
-  s.We = undefined;
-  s.re = r?.render ? EFFECT_RENDER : EFFECT_USER;
-  s.pe = (e, t) => {
-    const n = e !== undefined ? e : s.ae;
+  s.Ue = i;
+  s.We = t;
+  s.He = n;
+  s.xe = undefined;
+  s.se = r?.render ? EFFECT_RENDER : EFFECT_USER;
+  s.Ae = (e, t) => {
+    const n = e !== undefined ? e : s.Ee;
     const i = t !== undefined ? t : s.q;
     if (n & STATUS_ERROR) {
       let e = i;
-      s.se.notify(s, STATUS_PENDING, 0);
-      if (s.re === EFFECT_USER) {
+      s.ce.notify(s, STATUS_PENDING, 0);
+      if (s.se === EFFECT_USER) {
         try {
-          return s.Ue
-            ? s.Ue(e, () => {
-                s.We?.();
-                s.We = undefined;
+          return s.He
+            ? s.He(e, () => {
+                s.xe?.();
+                s.xe = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!s.se.notify(s, STATUS_ERROR, STATUS_ERROR)) throw e;
-    } else if (s.re === EFFECT_RENDER) s.se.notify(s, STATUS_PENDING | STATUS_ERROR, n, i);
+      if (!s.ce.notify(s, STATUS_ERROR, STATUS_ERROR)) throw e;
+    } else if (s.se === EFFECT_RENDER) s.ce.notify(s, STATUS_PENDING | STATUS_ERROR, n, i);
   };
   recompute(s, true);
-  !r?.defer && (s.re === EFFECT_USER ? s.se.enqueue(s.re, runEffect.bind(s)) : runEffect.call(s));
+  !r?.defer && (s.se === EFFECT_USER ? s.ce.enqueue(s.se, runEffect.bind(s)) : runEffect.call(s));
   o = true;
-  onCleanup(() => s.We?.());
+  onCleanup(() => s.xe?.());
 }
 function runEffect() {
-  if (!this.oe || this.S & REACTIVE_DISPOSED) return;
-  this.We?.();
-  this.We = undefined;
+  if (!this.ue || this.O & REACTIVE_DISPOSED) return;
+  this.xe?.();
+  this.xe = undefined;
   try {
-    this.We = this.ke(this.le, this.Le);
+    this.xe = this.We(this.fe, this.Ue);
   } catch (e) {
-    if (!this.se.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
+    if (!this.ce.notify(this, STATUS_ERROR, STATUS_ERROR)) throw e;
   } finally {
-    this.Le = this.le;
-    this.oe = false;
+    this.Ue = this.fe;
+    this.ue = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.oe || n.S & REACTIVE_DISPOSED) return;
-    n.oe = false;
+    if (!n.ue || n.O & REACTIVE_DISPOSED) return;
+    n.ue = false;
     recompute(n);
   };
   const n = computed(
     () => {
       try {
-        n.We?.();
-        n.We = undefined;
-        n.We = staleValues(e) || undefined;
+        n.xe?.();
+        n.xe = undefined;
+        n.xe = staleValues(e) || undefined;
       } finally {
       }
     },
     undefined,
     { ...t, lazy: true, pureWrite: true }
   );
-  n.We = undefined;
-  n.oe = true;
-  n.re = EFFECT_TRACKED;
-  n.ue = run;
-  n.se.enqueue(EFFECT_USER, run);
-  onCleanup(() => n.We?.());
+  n.xe = undefined;
+  n.ue = true;
+  n.se = EFFECT_TRACKED;
+  n.le = run;
+  n.ce.enqueue(EFFECT_USER, run);
+  onCleanup(() => n.xe?.());
 }
 GlobalQueue.K = recompute;
 GlobalQueue.Y = disposeChildren;
@@ -967,31 +978,83 @@ let foundPending = false;
 let pendingReadActive = false;
 let context = null;
 let currentOptimisticLane = null;
+let snapshotCaptureActive = false;
+let snapshotSources = null;
+function ownerInSnapshotScope(e) {
+  while (e) {
+    if (e.Qe) return true;
+    e = e.i;
+  }
+  return false;
+}
+function setSnapshotCapture(e) {
+  snapshotCaptureActive = e;
+  if (e && !snapshotSources) snapshotSources = new Set();
+}
+function markSnapshotScope(e) {
+  e.Qe = true;
+}
+function releaseSnapshotScope(e) {
+  e.Qe = false;
+  releaseSubtree(e);
+  schedule();
+}
+function releaseSubtree(e) {
+  let t = e.De;
+  while (t) {
+    if (t.Qe) {
+      t = t.ve;
+      continue;
+    }
+    if (t.L) {
+      const e = t;
+      e.oe = false;
+      if (e.O & REACTIVE_SNAPSHOT_STALE) {
+        e.O &= ~REACTIVE_SNAPSHOT_STALE;
+        e.O |= REACTIVE_DIRTY;
+        if (dirtyQueue.N > e.o) dirtyQueue.N = e.o;
+        insertIntoHeap(e, dirtyQueue);
+      }
+    }
+    releaseSubtree(t);
+    t = t.ve;
+  }
+}
+function clearSnapshots() {
+  if (snapshotSources) {
+    for (const e of snapshotSources) {
+      delete e.re;
+      delete e[STORE_SNAPSHOT_PROPS];
+    }
+    snapshotSources = null;
+  }
+  snapshotCaptureActive = false;
+}
 function recompute(e, t = false) {
-  const n = e.re;
+  const n = e.se;
   if (!t) {
     if (e.ne && (!n || activeTransition) && activeTransition !== e.ne)
       globalQueue.initTransition(e.ne);
-    deleteFromHeap(e, e.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+    deleteFromHeap(e, e.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
     if (e.ne || n === EFFECT_TRACKED) disposeChildren(e);
     else {
       markDisposal(e);
-      e.we = e.be;
-      e.De = e.Ne;
-      e.be = null;
-      e.Ne = null;
-      e.ve = 0;
+      e.be = e.me;
+      e.we = e.De;
+      e.me = null;
+      e.De = null;
+      e.Ve = 0;
     }
   }
-  const i = !!(e.S & REACTIVE_OPTIMISTIC_DIRTY);
+  const i = !!(e.O & REACTIVE_OPTIMISTIC_DIRTY);
   const r = hasActiveOverride(e);
-  const o = !!(e.ae & STATUS_PENDING);
+  const o = !!(e.Ee & STATUS_PENDING);
   const s = context;
   context = e;
-  e.Pe = null;
-  e.S = REACTIVE_RECOMPUTING_DEPS;
+  e.ye = null;
+  e.O = REACTIVE_RECOMPUTING_DEPS;
   e.J = clock;
-  let u = e.ce === NOT_PENDING ? e.le : e.ce;
+  let u = e.ae === NOT_PENDING ? e.fe : e.ae;
   let c = e.o;
   let l = tracking;
   let a = currentOptimisticLane;
@@ -1006,15 +1069,15 @@ function recompute(e, t = false) {
     const t = resolveLane(e);
     if (t) {
       t.U.delete(e);
-      updatePendingSignal(t.fe);
+      updatePendingSignal(t.Te);
     }
   } catch (t) {
     if (t instanceof NotReadyError && currentOptimisticLane) {
       const t = findLane(currentOptimisticLane);
-      if (t.fe !== e) {
+      if (t.Te !== e) {
         t.U.add(e);
         e.ie = t;
-        updatePendingSignal(t.fe);
+        updatePendingSignal(t.Te);
       }
     }
     notifyStatus(
@@ -1026,136 +1089,147 @@ function recompute(e, t = false) {
     );
   } finally {
     tracking = l;
-    e.S = REACTIVE_NONE;
+    e.O = REACTIVE_NONE | (t ? e.O & REACTIVE_SNAPSHOT_STALE : 0);
     context = s;
   }
   if (!e.q) {
-    const s = e.Pe;
-    let l = s !== null ? s.D : e.N;
+    const s = e.ye;
+    let l = s !== null ? s.D : e.C;
     if (l !== null) {
       do {
         l = unlinkSubs(l);
       } while (l !== null);
       if (s !== null) s.D = null;
-      else e.N = null;
+      else e.C = null;
     }
-    const a = r ? e.le : e.ce === NOT_PENDING ? e.le : e.ce;
-    const f = !e._e || !e._e(a, u);
+    const a = r ? e.fe : e.ae === NOT_PENDING ? e.fe : e.ae;
+    const f = !e.pe || !e.pe(a, u);
     if (f) {
-      const s = r ? e.le : undefined;
-      if (t || (n && activeTransition !== e.ne) || i) e.le = u;
-      else e.ce = u;
+      const s = r ? e.fe : undefined;
+      if (t || (n && activeTransition !== e.ne) || i) e.fe = u;
+      else e.ae = u;
       if (r && !i && o) {
-        const t = e.Re || 0;
-        const n = e.de || 0;
-        if (t <= n) e.le = u;
+        const t = e.Oe || 0;
+        const n = e.Re || 0;
+        if (t <= n) e.fe = u;
       }
-      if (!r || i || e.le !== s) {
+      if (!r || i || e.fe !== s) {
         insertSubs(e, i || r);
       }
     } else if (r) {
-      e.ce = u;
+      e.ae = u;
     } else if (e.o != c) {
       for (let t = e.I; t !== null; t = t.p) {
-        insertIntoHeapHeight(t.h, t.h.S & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
+        insertIntoHeapHeight(t.h, t.h.O & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
       }
     }
   }
   currentOptimisticLane = a;
-  (!t || e.ae & STATUS_PENDING) && !e.ne && !(activeTransition && e.Oe) && globalQueue.$.push(e);
+  (!t || e.Ee & STATUS_PENDING) && !e.ne && !(activeTransition && e._e) && globalQueue.F.push(e);
   e.ne && n && activeTransition !== e.ne && runInTransition(e.ne, () => recompute(e));
 }
 function updateIfNecessary(e) {
-  if (e.S & REACTIVE_CHECK) {
-    for (let t = e.N; t; t = t.D) {
+  if (e.O & REACTIVE_CHECK) {
+    for (let t = e.C; t; t = t.D) {
       const n = t.V;
       const i = n.m || n;
       if (i.L) {
         updateIfNecessary(i);
       }
-      if (e.S & REACTIVE_DIRTY) {
+      if (e.O & REACTIVE_DIRTY) {
         break;
       }
     }
   }
-  if (e.S & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.q && e.J < clock)) {
+  if (e.O & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || (e.q && e.J < clock)) {
     recompute(e);
   }
-  e.S = REACTIVE_NONE;
+  e.O = REACTIVE_NONE | (e.O & REACTIVE_SNAPSHOT_STALE);
 }
 function computed(e, t, n) {
   const i = n?.transparent ?? false;
   const r = {
     id: n?.id ?? (i ? context?.id : context?.id != null ? getNextChildId(context) : undefined),
-    Ve: i || undefined,
-    _e: n?.equals != null ? n.equals : isEqual,
-    xe: !!n?.pureWrite,
-    ge: n?.unobserved,
-    be: null,
-    se: context?.se ?? globalQueue,
-    me: context?.me ?? defaultContext,
-    ve: 0,
+    Le: i || undefined,
+    pe: n?.equals != null ? n.equals : isEqual,
+    Me: !!n?.pureWrite,
+    Ne: n?.unobserved,
+    me: null,
+    ce: context?.ce ?? globalQueue,
+    ke: context?.ke ?? defaultContext,
+    Ve: 0,
     L: e,
-    le: t,
+    fe: t,
     o: 0,
     A: null,
-    R: undefined,
+    S: undefined,
     T: null,
-    N: null,
-    Pe: null,
+    C: null,
+    ye: null,
     I: null,
-    Ae: null,
+    Pe: null,
     i: context,
-    ye: null,
-    Ne: null,
-    S: REACTIVE_NONE,
-    ae: STATUS_UNINITIALIZED,
+    ve: null,
+    De: null,
+    O: REACTIVE_NONE,
+    Ee: STATUS_UNINITIALIZED,
     J: clock,
-    ce: NOT_PENDING,
+    ae: NOT_PENDING,
+    be: null,
     we: null,
-    De: null,
-    Se: null,
+    Ie: null,
     ne: null
   };
   r.T = r;
   const o = context?.t ? context.u : context;
   if (context) {
-    const e = context.Ne;
+    const e = context.De;
     if (e === null) {
-      context.Ne = r;
+      context.De = r;
     } else {
-      r.ye = e;
-      context.Ne = r;
+      r.ve = e;
+      context.De = r;
     }
   }
   if (o) r.o = o.o + 1;
+  if (snapshotCaptureActive && ownerInSnapshotScope(context)) r.oe = true;
   !n?.lazy && recompute(r, true);
+  if (snapshotCaptureActive && !n?.lazy) {
+    if (!(r.Ee & STATUS_PENDING)) {
+      r.re = r.fe === undefined ? NO_SNAPSHOT : r.fe;
+      snapshotSources.add(r);
+    }
+  }
   return r;
 }
 function signal(e, t, n = null) {
   const i = {
-    _e: t?.equals != null ? t.equals : isEqual,
-    xe: !!t?.pureWrite,
-    ge: t?.unobserved,
-    le: e,
+    pe: t?.equals != null ? t.equals : isEqual,
+    Me: !!t?.pureWrite,
+    Ne: t?.unobserved,
+    fe: e,
     I: null,
-    Ae: null,
+    Pe: null,
     J: clock,
     m: n,
-    C: n?.A || null,
-    ce: NOT_PENDING
+    P: n?.A || null,
+    ae: NOT_PENDING
   };
   n && (n.A = i);
+  if (snapshotCaptureActive) {
+    i.re = e === undefined ? NO_SNAPSHOT : e;
+    snapshotSources.add(i);
+  }
   return i;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.Oe = true;
+  n._e = true;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const i = computed(e, t, n);
-  i.Oe = true;
+  i._e = true;
   return i;
 }
 function isEqual(e, t) {
@@ -1175,14 +1249,21 @@ function read(e) {
     const t = getPendingValueComputed(e);
     const n = pendingReadActive;
     pendingReadActive = false;
-    const i = read(t);
-    pendingReadActive = n;
-    if (t.ae & STATUS_PENDING) return e.le;
+    let i;
+    try {
+      i = read(t);
+    } catch (t) {
+      if (!context && t instanceof NotReadyError) return e.fe;
+      throw t;
+    } finally {
+      pendingReadActive = n;
+    }
+    if (t.Ee & STATUS_PENDING) return e.fe;
     if (stale && currentOptimisticLane && t.ie) {
       const n = findLane(t.ie);
       const i = findLane(currentOptimisticLane);
       if (n !== i && n.U.size > 0) {
-        return e.le;
+        return e.fe;
       }
     }
     return i;
@@ -1196,18 +1277,18 @@ function read(e) {
       foundPending = true;
     }
     pendingCheckActive = i;
-    return e.le;
+    return e.fe;
   }
   let t = context;
   if (t?.t) t = t.u;
   if (refreshing && e.L) recompute(e);
   if (t && tracking) {
-    if (e.L && e.S & REACTIVE_DISPOSED) recompute(e);
+    if (e.L && e.O & REACTIVE_DISPOSED) recompute(e);
     link(e, t);
     const n = e.m || e;
     if (n.L) {
-      const i = e.S & REACTIVE_ZOMBIE;
-      if (n.o >= (i ? zombieQueue.P : dirtyQueue.P)) {
+      const i = e.O & REACTIVE_ZOMBIE;
+      if (n.o >= (i ? zombieQueue.N : dirtyQueue.N)) {
         markNode(t);
         markHeap(i ? zombieQueue : dirtyQueue);
         updateIfNecessary(n);
@@ -1219,67 +1300,80 @@ function read(e) {
     }
   }
   const n = e.m || e;
-  if (t && n.ae & STATUS_PENDING && !(stale && n.ne && activeTransition !== n.ne)) {
-    if (currentOptimisticLane) {
-      const i = n.ie;
-      const r = findLane(currentOptimisticLane);
-      if (i && findLane(i) === r && !hasActiveOverride(n)) {
+  if (n.Ee & STATUS_PENDING) {
+    if (t && !(stale && n.ne && activeTransition !== n.ne)) {
+      if (currentOptimisticLane) {
+        const i = n.ie;
+        const r = findLane(currentOptimisticLane);
+        if (i && findLane(i) === r && !hasActiveOverride(n)) {
+          if (!tracking) link(e, t);
+          throw n.q;
+        }
+      } else {
         if (!tracking) link(e, t);
         throw n.q;
       }
-    } else {
-      if (!tracking) link(e, t);
+    } else if (!t && n.Ee & STATUS_UNINITIALIZED) {
       throw n.q;
     }
   }
-  if (e.L && e.ae & STATUS_ERROR) {
+  if (e.L && e.Ee & STATUS_ERROR) {
     if (e.J < clock) {
       recompute(e, true);
       return read(e);
     } else throw e.q;
   }
+  if (snapshotCaptureActive && t && t.oe) {
+    const n = e.re;
+    if (n !== undefined) {
+      const i = n === NO_SNAPSHOT ? undefined : n;
+      const r = e.ae !== NOT_PENDING ? e.ae : e.fe;
+      if (r !== i) t.O |= REACTIVE_SNAPSHOT_STALE;
+      return i;
+    }
+  }
   return !t ||
     currentOptimisticLane !== null ||
-    e.ce === NOT_PENDING ||
+    e.ae === NOT_PENDING ||
     (stale && e.ne && activeTransition !== e.ne)
-    ? e.le
-    : e.ce;
+    ? e.fe
+    : e.ae;
 }
 function setSignal(e, t) {
   if (e.ne && activeTransition !== e.ne) globalQueue.initTransition(e.ne);
-  const n = e.Oe && !projectionWriteActive;
-  const i = n ? e.le : e.ce === NOT_PENDING ? e.le : e.ce;
+  const n = e._e && !projectionWriteActive;
+  const i = n ? e.fe : e.ae === NOT_PENDING ? e.fe : e.ae;
   if (typeof t === "function") t = t(i);
-  const r = !e._e || !e._e(i, t);
+  const r = !e.pe || !e.pe(i, t);
   if (!r) {
-    if (n && e.ce !== NOT_PENDING && e.L) {
+    if (n && e.ae !== NOT_PENDING && e.L) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = globalQueue.H.includes(e);
+    const n = globalQueue.$.includes(e);
     if (e.ne && n) {
       globalQueue.initTransition(e.ne);
     }
-    if (e.ce === NOT_PENDING) {
-      e.ce = e.le;
+    if (e.ae === NOT_PENDING) {
+      e.ae = e.fe;
     }
     if (!n) {
-      globalQueue.H.push(e);
+      globalQueue.$.push(e);
     }
-    e.Re = (e.Re || 0) + 1;
+    e.Oe = (e.Oe || 0) + 1;
     const i = getOrCreateLane(e);
     e.ie = i;
-    e.le = t;
+    e.fe = t;
   } else {
-    if (e.ce === NOT_PENDING) globalQueue.$.push(e);
-    e.ce = t;
+    if (e.ae === NOT_PENDING) globalQueue.F.push(e);
+    e.ae = t;
   }
   updatePendingSignal(e);
-  if (e.Ie) {
-    setSignal(e.Ie, t);
+  if (e.he) {
+    setSignal(e.he, t);
   }
   e.J = clock;
   insertSubs(e, n);
@@ -1299,32 +1393,32 @@ function runWithOwner(e, t) {
   }
 }
 function getPendingSignal(e) {
-  if (!e.Qe) {
-    e.Qe = optimisticSignal(false, { pureWrite: true });
-    if (e.Ee) {
-      e.Qe.Ee = e;
+  if (!e.Ge) {
+    e.Ge = optimisticSignal(false, { pureWrite: true });
+    if (e.de) {
+      e.Ge.de = e;
     }
-    if (computePendingState(e)) setSignal(e.Qe, true);
+    if (computePendingState(e)) setSignal(e.Ge, true);
   }
-  return e.Qe;
+  return e.Ge;
 }
 function computePendingState(e) {
   const t = e;
-  if (e.Oe && e.ce !== NOT_PENDING) {
-    if (t.ae & STATUS_PENDING && !(t.ae & STATUS_UNINITIALIZED)) return true;
-    if (e.Ee) {
+  if (e._e && e.ae !== NOT_PENDING) {
+    if (t.Ee & STATUS_PENDING && !(t.Ee & STATUS_UNINITIALIZED)) return true;
+    if (e.de) {
       const t = e.ie ? findLane(e.ie) : null;
       return !!(t && t.U.size > 0);
     }
     return true;
   }
-  if (e.ce !== NOT_PENDING && !(t.ae & STATUS_UNINITIALIZED)) return true;
-  return !!(t.ae & STATUS_PENDING && !(t.ae & STATUS_UNINITIALIZED));
+  if (e.ae !== NOT_PENDING && !(t.Ee & STATUS_UNINITIALIZED)) return true;
+  return !!(t.Ee & STATUS_PENDING && !(t.Ee & STATUS_UNINITIALIZED));
 }
 function updatePendingSignal(e) {
-  if (e.Qe) {
+  if (e.Ge) {
     const t = computePendingState(e);
-    const n = e.Qe;
+    const n = e.Ge;
     setSignal(n, t);
     if (!t && n.ie) {
       const t = resolveLane(e);
@@ -1340,20 +1434,20 @@ function updatePendingSignal(e) {
   }
 }
 function getPendingValueComputed(e) {
-  if (!e.Ie) {
+  if (!e.he) {
     const t = pendingReadActive;
     pendingReadActive = false;
     const n = pendingCheckActive;
     pendingCheckActive = false;
     const i = context;
     context = null;
-    e.Ie = optimisticComputed(() => read(e));
-    e.Ie.Ee = e;
+    e.he = optimisticComputed(() => read(e));
+    e.he.de = e;
     context = i;
     pendingCheckActive = n;
     pendingReadActive = t;
   }
-  return e.Ie;
+  return e.he;
 }
 function staleValues(e, t = true) {
   const n = stale;
@@ -1414,7 +1508,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.me[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.ke[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1424,10 +1518,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.me = { ...n.me, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.ke = { ...n.ke, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.me[e.id]);
+  return !isUndefined(t?.ke[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1571,14 +1665,14 @@ function applyState(e, t, n, i) {
     let t = false;
     const l = getOverrideValue(o, s, c, "length", u);
     if (e.length && l && e[0] && n(e[0]) != null) {
-      let a, f, E, T, d, R, O, S;
+      let a, f, E, T, d, S, R, O;
       for (
         E = 0, T = Math.min(l, e.length);
         E < T &&
-        ((R = getOverrideValue(o, s, c, E, u)) === e[E] || (R && e[E] && n(R) === n(e[E])));
+        ((S = getOverrideValue(o, s, c, E, u)) === e[E] || (S && e[E] && n(S) === n(e[E])));
         E++
       ) {
-        applyState(e[E], wrap(R, r), n, i);
+        applyState(e[E], wrap(S, r), n, i);
       }
       const _ = new Array(e.length),
         I = new Map();
@@ -1586,10 +1680,10 @@ function applyState(e, t, n, i) {
         T = l - 1, d = e.length - 1;
         T >= E &&
         d >= E &&
-        ((R = getOverrideValue(o, s, c, T, u)) === e[d] || (R && e[d] && n(R) === n(e[d])));
+        ((S = getOverrideValue(o, s, c, T, u)) === e[d] || (S && e[d] && n(S) === n(e[d])));
         T--, d--
       ) {
-        _[d] = R;
+        _[d] = S;
       }
       if (E > d || E > T) {
         for (f = E; f <= d; f++) {
@@ -1606,22 +1700,22 @@ function applyState(e, t, n, i) {
         l !== e.length && r[STORE_NODE].length && setSignal(r[STORE_NODE].length, e.length);
         return;
       }
-      O = new Array(d + 1);
+      R = new Array(d + 1);
       for (f = d; f >= E; f--) {
-        R = e[f];
-        S = R ? n(R) : R;
-        a = I.get(S);
-        O[f] = a === undefined ? -1 : a;
-        I.set(S, f);
+        S = e[f];
+        O = S ? n(S) : S;
+        a = I.get(O);
+        R[f] = a === undefined ? -1 : a;
+        I.set(O, f);
       }
       for (a = E; a <= T; a++) {
-        R = getOverrideValue(o, s, c, a, u);
-        S = R ? n(R) : R;
-        f = I.get(S);
+        S = getOverrideValue(o, s, c, a, u);
+        O = S ? n(S) : S;
+        f = I.get(O);
         if (f !== undefined && f !== -1) {
-          _[f] = R;
-          f = O[f];
-          I.set(S, f);
+          _[f] = S;
+          f = R[f];
+          I.set(O, f);
         }
       }
       for (f = E; f < e.length; f++) {
@@ -1799,9 +1893,9 @@ function getNodes(e, t) {
   if (!n) e[t] = n = Object.create(null);
   return n;
 }
-function getNode(e, t, n, i, r = isEqual, o) {
+function getNode(e, t, n, i, r = isEqual, o, s) {
   if (e[t]) return e[t];
-  const s = signal(
+  const u = signal(
     n,
     {
       equals: r,
@@ -1811,8 +1905,13 @@ function getNode(e, t, n, i, r = isEqual, o) {
     },
     i
   );
-  if (o) s.Oe = true;
-  return (e[t] = s);
+  if (o) u._e = true;
+  if (s && t in s) {
+    const e = s[t];
+    u.re = e === undefined ? NO_SNAPSHOT : e;
+    snapshotSources?.add(u);
+  }
+  return (e[t] = u);
 }
 function trackSelf(e, t = $TRACK) {
   getObserver() &&
@@ -1864,7 +1963,7 @@ const storeTraps = {
       if (e && e.get) return e.get.call(n);
     }
     if (writeOnly(n)) {
-      let n = r && (s || !u) ? (r.ce !== NOT_PENDING ? (r.Oe ? r.le : r.ce) : r.le) : c[t];
+      let n = r && (s || !u) ? (r.ae !== NOT_PENDING ? (r._e ? r.fe : r.ae) : r.fe) : c[t];
       n === $DELETED && (n = undefined);
       if (!isWrappable(n)) return n;
       const i = wrap(n, e);
@@ -1889,7 +1988,8 @@ const storeTraps = {
             isWrappable(l) ? wrap(l, e) : l,
             e[STORE_FIREWALL],
             isEqual,
-            e[STORE_OPTIMISTIC]
+            e[STORE_OPTIMISTIC],
+            e[STORE_SNAPSHOT_PROPS]
           )
         );
       }
@@ -1920,6 +2020,15 @@ const storeTraps = {
       untrack(() => {
         const r = e[STORE_VALUE];
         const o = r[t];
+        if (snapshotCaptureActive && typeof t !== "symbol") {
+          if (!e[STORE_SNAPSHOT_PROPS]) {
+            e[STORE_SNAPSHOT_PROPS] = Object.create(null);
+            snapshotSources?.add(e);
+          }
+          if (!(t in e[STORE_SNAPSHOT_PROPS])) {
+            e[STORE_SNAPSHOT_PROPS][t] = o;
+          }
+        }
         const s = e[STORE_OPTIMISTIC] && !projectionWriteActive;
         const u = s ? STORE_OPTIMISTIC_OVERRIDE : STORE_OVERRIDE;
         if (s) trackOptimisticStore(i);
@@ -2363,68 +2472,68 @@ function mapArray(e, t, n) {
   const i = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      Me: createOwner(),
-      Fe: 0,
-      Ge: e,
-      $e: [],
-      He: t,
-      je: [],
+      Fe: createOwner(),
+      $e: 0,
+      je: e,
       Ke: [],
-      Ye: i,
-      Be: i || n?.keyed === false ? [] : undefined,
-      Xe: t.length > 1 ? [] : undefined,
-      qe: n?.fallback
+      Ye: t,
+      Be: [],
+      Xe: [],
+      qe: i,
+      ze: i || n?.keyed === false ? [] : undefined,
+      Ze: t.length > 1 ? [] : undefined,
+      Je: n?.fallback
     })
   );
 }
 const pureOptions = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Ge() || [],
+  const e = this.je() || [],
     t = e.length;
   e[$TRACK];
-  runWithOwner(this.Me, () => {
+  runWithOwner(this.Fe, () => {
     let n,
       i,
-      r = this.Be
+      r = this.ze
         ? () => {
-            this.Be[i] = signal(e[i], pureOptions);
-            this.Xe && (this.Xe[i] = signal(i, pureOptions));
-            return this.He(
-              read.bind(null, this.Be[i]),
-              this.Xe ? read.bind(null, this.Xe[i]) : undefined
+            this.ze[i] = signal(e[i], pureOptions);
+            this.Ze && (this.Ze[i] = signal(i, pureOptions));
+            return this.Ye(
+              read.bind(null, this.ze[i]),
+              this.Ze ? read.bind(null, this.Ze[i]) : undefined
             );
           }
-        : this.Xe
+        : this.Ze
           ? () => {
               const t = e[i];
-              this.Xe[i] = signal(i, pureOptions);
-              return this.He(() => t, read.bind(null, this.Xe[i]));
+              this.Ze[i] = signal(i, pureOptions);
+              return this.Ye(() => t, read.bind(null, this.Ze[i]));
             }
           : () => {
               const t = e[i];
-              return this.He(() => t);
+              return this.Ye(() => t);
             };
     if (t === 0) {
-      if (this.Fe !== 0) {
-        this.Me.dispose(false);
+      if (this.$e !== 0) {
+        this.Fe.dispose(false);
+        this.Xe = [];
         this.Ke = [];
-        this.$e = [];
-        this.je = [];
-        this.Fe = 0;
-        this.Be && (this.Be = []);
-        this.Xe && (this.Xe = []);
-      }
-      if (this.qe && !this.je[0]) {
-        this.je[0] = runWithOwner((this.Ke[0] = createOwner()), this.qe);
-      }
-    } else if (this.Fe === 0) {
-      if (this.Ke[0]) this.Ke[0].dispose();
-      this.je = new Array(t);
+        this.Be = [];
+        this.$e = 0;
+        this.ze && (this.ze = []);
+        this.Ze && (this.Ze = []);
+      }
+      if (this.Je && !this.Be[0]) {
+        this.Be[0] = runWithOwner((this.Xe[0] = createOwner()), this.Je);
+      }
+    } else if (this.$e === 0) {
+      if (this.Xe[0]) this.Xe[0].dispose();
+      this.Be = new Array(t);
       for (i = 0; i < t; i++) {
-        this.$e[i] = e[i];
-        this.je[i] = runWithOwner((this.Ke[i] = createOwner()), r);
+        this.Ke[i] = e[i];
+        this.Be[i] = runWithOwner((this.Xe[i] = createOwner()), r);
       }
-      this.Fe = t;
+      this.$e = t;
     } else {
       let o,
         s,
@@ -2435,187 +2544,187 @@ function updateKeyedMap() {
         f,
         E = new Array(t),
         T = new Array(t),
-        d = this.Be ? new Array(t) : undefined,
-        R = this.Xe ? new Array(t) : undefined;
+        d = this.ze ? new Array(t) : undefined,
+        S = this.Ze ? new Array(t) : undefined;
       for (
-        o = 0, s = Math.min(this.Fe, t);
-        o < s && (this.$e[o] === e[o] || (this.Be && compare(this.Ye, this.$e[o], e[o])));
+        o = 0, s = Math.min(this.$e, t);
+        o < s && (this.Ke[o] === e[o] || (this.ze && compare(this.qe, this.Ke[o], e[o])));
         o++
       ) {
-        if (this.Be) setSignal(this.Be[o], e[o]);
+        if (this.ze) setSignal(this.ze[o], e[o]);
       }
       for (
-        s = this.Fe - 1, u = t - 1;
+        s = this.$e - 1, u = t - 1;
         s >= o &&
         u >= o &&
-        (this.$e[s] === e[u] || (this.Be && compare(this.Ye, this.$e[s], e[u])));
+        (this.Ke[s] === e[u] || (this.ze && compare(this.qe, this.Ke[s], e[u])));
         s--, u--
       ) {
-        E[u] = this.je[s];
-        T[u] = this.Ke[s];
-        d && (d[u] = this.Be[s]);
-        R && (R[u] = this.Xe[s]);
+        E[u] = this.Be[s];
+        T[u] = this.Xe[s];
+        d && (d[u] = this.ze[s]);
+        S && (S[u] = this.Ze[s]);
       }
       a = new Map();
       f = new Array(u + 1);
       for (i = u; i >= o; i--) {
         c = e[i];
-        l = this.Ye ? this.Ye(c) : c;
+        l = this.qe ? this.qe(c) : c;
         n = a.get(l);
         f[i] = n === undefined ? -1 : n;
         a.set(l, i);
       }
       for (n = o; n <= s; n++) {
-        c = this.$e[n];
-        l = this.Ye ? this.Ye(c) : c;
+        c = this.Ke[n];
+        l = this.qe ? this.qe(c) : c;
         i = a.get(l);
         if (i !== undefined && i !== -1) {
-          E[i] = this.je[n];
-          T[i] = this.Ke[n];
-          d && (d[i] = this.Be[n]);
-          R && (R[i] = this.Xe[n]);
+          E[i] = this.Be[n];
+          T[i] = this.Xe[n];
+          d && (d[i] = this.ze[n]);
+          S && (S[i] = this.Ze[n]);
           i = f[i];
           a.set(l, i);
-        } else this.Ke[n].dispose();
+        } else this.Xe[n].dispose();
       }
       for (i = o; i < t; i++) {
         if (i in E) {
-          this.je[i] = E[i];
-          this.Ke[i] = T[i];
+          this.Be[i] = E[i];
+          this.Xe[i] = T[i];
           if (d) {
-            this.Be[i] = d[i];
-            setSignal(this.Be[i], e[i]);
+            this.ze[i] = d[i];
+            setSignal(this.ze[i], e[i]);
           }
-          if (R) {
-            this.Xe[i] = R[i];
-            setSignal(this.Xe[i], i);
+          if (S) {
+            this.Ze[i] = S[i];
+            setSignal(this.Ze[i], i);
           }
         } else {
-          this.je[i] = runWithOwner((this.Ke[i] = createOwner()), r);
+          this.Be[i] = runWithOwner((this.Xe[i] = createOwner()), r);
         }
       }
-      this.je = this.je.slice(0, (this.Fe = t));
-      this.$e = e.slice(0);
+      this.Be = this.Be.slice(0, (this.$e = t));
+      this.Ke = e.slice(0);
     }
   });
-  return this.je;
+  return this.Be;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    Me: createOwner(),
-    Fe: 0,
-    ze: 0,
-    Ze: e,
-    He: t,
-    Ke: [],
-    je: [],
-    Je: n?.from,
-    qe: n?.fallback
+    Fe: createOwner(),
+    $e: 0,
+    et: 0,
+    tt: e,
+    Ye: t,
+    Xe: [],
+    Be: [],
+    nt: n?.from,
+    Je: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.Ze();
-  const t = this.Je?.() || 0;
-  runWithOwner(this.Me, () => {
+  const e = this.tt();
+  const t = this.nt?.() || 0;
+  runWithOwner(this.Fe, () => {
     if (e === 0) {
-      if (this.Fe !== 0) {
-        this.Me.dispose(false);
-        this.Ke = [];
-        this.je = [];
-        this.Fe = 0;
+      if (this.$e !== 0) {
+        this.Fe.dispose(false);
+        this.Xe = [];
+        this.Be = [];
+        this.$e = 0;
       }
-      if (this.qe && !this.je[0]) {
-        this.je[0] = runWithOwner((this.Ke[0] = createOwner()), this.qe);
+      if (this.Je && !this.Be[0]) {
+        this.Be[0] = runWithOwner((this.Xe[0] = createOwner()), this.Je);
       }
       return;
     }
     const n = t + e;
-    const i = this.ze + this.Fe;
-    if (this.Fe === 0 && this.Ke[0]) this.Ke[0].dispose();
-    for (let e = n; e < i; e++) this.Ke[e - this.ze].dispose();
-    if (this.ze < t) {
-      let e = this.ze;
-      while (e < t && e < this.Fe) this.Ke[e++].dispose();
-      this.Ke.splice(0, t - this.ze);
-      this.je.splice(0, t - this.ze);
-    } else if (this.ze > t) {
-      let n = i - this.ze - 1;
-      let r = this.ze - t;
-      this.Ke.length = this.je.length = e;
+    const i = this.et + this.$e;
+    if (this.$e === 0 && this.Xe[0]) this.Xe[0].dispose();
+    for (let e = n; e < i; e++) this.Xe[e - this.et].dispose();
+    if (this.et < t) {
+      let e = this.et;
+      while (e < t && e < this.$e) this.Xe[e++].dispose();
+      this.Xe.splice(0, t - this.et);
+      this.Be.splice(0, t - this.et);
+    } else if (this.et > t) {
+      let n = i - this.et - 1;
+      let r = this.et - t;
+      this.Xe.length = this.Be.length = e;
       while (n >= r) {
-        this.Ke[n] = this.Ke[n - r];
-        this.je[n] = this.je[n - r];
+        this.Xe[n] = this.Xe[n - r];
+        this.Be[n] = this.Be[n - r];
         n--;
       }
       for (let e = 0; e < r; e++) {
-        this.je[e] = runWithOwner((this.Ke[e] = createOwner()), () => this.He(e + t));
+        this.Be[e] = runWithOwner((this.Xe[e] = createOwner()), () => this.Ye(e + t));
       }
     }
     for (let e = i; e < n; e++) {
-      this.je[e - t] = runWithOwner((this.Ke[e - t] = createOwner()), () => this.He(e));
+      this.Be[e - t] = runWithOwner((this.Xe[e - t] = createOwner()), () => this.Ye(e));
     }
-    this.je = this.je.slice(0, e);
-    this.ze = t;
-    this.Fe = e;
+    this.Be = this.Be.slice(0, e);
+    this.et = t;
+    this.$e = e;
   });
-  return this.je;
+  return this.Be;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.pe = (e, t) => {
-    const i = e !== undefined ? e : n.ae;
+  n.Ae = (e, t) => {
+    const i = e !== undefined ? e : n.Ee;
     const r = t !== undefined ? t : n.q;
-    n.ae &= ~n.et;
-    n.se.notify(n, n.et, i, r);
+    n.Ee &= ~n.it;
+    n.ce.notify(n, n.it, i, r);
   };
-  n.et = t;
+  n.it = t;
   n.Ce = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, i) {
-  const r = e.se;
-  r.addChild((e.se = n));
-  onCleanup(() => r.removeChild(e.se));
+  const r = e.ce;
+  r.addChild((e.ce = n));
+  onCleanup(() => r.removeChild(e.ce));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), i);
   });
 }
 class CollectionQueue extends Queue {
-  tt;
-  nt = new Set();
-  it = signal(false, { pureWrite: true });
-  rt = false;
+  rt;
+  ot = new Set();
+  st = signal(false, { pureWrite: true });
+  ut = false;
   constructor(e) {
     super();
-    this.tt = e;
+    this.rt = e;
   }
   run(e) {
-    if (!e || read(this.it)) return;
+    if (!e || read(this.st)) return;
     return super.run(e);
   }
   notify(e, t, n, i) {
-    if (!(t & this.tt) || (this.tt & STATUS_PENDING && this.rt)) return super.notify(e, t, n, i);
-    if (n & this.tt) {
+    if (!(t & this.rt) || (this.rt & STATUS_PENDING && this.ut)) return super.notify(e, t, n, i);
+    if (n & this.rt) {
       const t = i?.source || e.q?.source;
       if (t) {
-        const e = this.nt.size === 0;
-        this.nt.add(t);
-        if (e) setSignal(this.it, true);
+        const e = this.ot.size === 0;
+        this.ot.add(t);
+        if (e) setSignal(this.st, true);
       }
     }
-    t &= ~this.tt;
+    t &= ~this.rt;
     return t ? super.notify(e, t, n, i) : true;
   }
   checkSources() {
-    for (const e of this.nt) {
-      if (!(e.ae & this.tt)) this.nt.delete(e);
+    for (const e of this.ot) {
+      if (!(e.Ee & this.rt)) this.ot.delete(e);
     }
-    if (!this.nt.size) setSignal(this.it, false);
+    if (!this.ot.size) setSignal(this.st, false);
   }
 }
 function createCollectionBoundary(e, t, n) {
@@ -2623,10 +2732,10 @@ function createCollectionBoundary(e, t, n) {
   const r = new CollectionQueue(e);
   const o = createBoundChildren(i, t, r, e);
   const s = computed(() => {
-    if (!read(r.it)) {
+    if (!read(r.st)) {
       const e = read(o);
-      if (!untrack(() => read(r.it))) {
-        r.rt = true;
+      if (!untrack(() => read(r.st))) {
+        r.ut = true;
         return e;
       }
     }
@@ -2639,10 +2748,10 @@ function createLoadBoundary(e, t) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(STATUS_ERROR, e, e => {
-    let n = e.nt.values().next().value;
+    let n = e.ot.values().next().value;
     const i = n.q?.cause ?? n.q;
     return t(i, () => {
-      for (const t of e.nt) recompute(t);
+      for (const t of e.ot) recompute(t);
       schedule();
     });
   });
@@ -2705,6 +2814,7 @@ export {
   NotReadyError,
   SUPPORTS_PROXY,
   action,
+  clearSnapshots,
   createContext,
   createEffect,
   createErrorBoundary,
@@ -2727,11 +2837,13 @@ export {
   getNextChildId,
   getObserver,
   getOwner,
+  isDisposed,
   isEqual,
   isPending,
   isRefreshing,
   isWrappable,
   mapArray,
+  markSnapshotScope,
   merge,
   omit,
   onCleanup,
@@ -2740,10 +2852,12 @@ export {
   pending,
   reconcile,
   refresh,
+  releaseSnapshotScope,
   repeat,
   resolve,
   runWithOwner,
   setContext,
+  setSnapshotCapture,
   snapshot,
   untrack
 };