@solidjs/signals 0.10.5 → 0.10.7

package/dist/node.cjs

@@ -32,16 +32,19 @@ const s = 1 << 4;
 const o = 1 << 5;
 const u = 1 << 6;
 const f = 1 << 7;
-const l = 1 << 0;
-const c = 1 << 1;
-const a = 1 << 2;
-const d = 1;
-const p = 2;
-const h = 3;
-const y = {};
-const g = typeof Proxy === "function";
-const w = {};
-const S = Symbol("refresh");
+const l = 1 << 8;
+const c = 1 << 0;
+const a = 1 << 1;
+const d = 1 << 2;
+const p = 1;
+const h = 2;
+const y = 3;
+const g = {};
+const S = {};
+const w = "sp";
+const m = typeof Proxy === "function";
+const b = {};
+const _ = Symbol("refresh");
 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;
@@ -138,15 +141,15 @@ function adjustHeight(e, t) {
     }
   }
 }
-const m = new Set();
-const _ = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
-const b = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
-let O = 0;
-let x = null;
-let v = false;
-let P = false;
+const O = new Set();
+const x = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+const v = { l: new Array(2e3).fill(undefined), _: false, W: 0, S: 0 };
+let P = 0;
+let k = null;
+let C = false;
+let A = false;
 function runLaneEffects(e) {
-  for (const t of A) {
+  for (const t of j) {
     if (t.R || t.T.size > 0) continue;
     const n = t.M[e - 1];
     if (n.length) {
@@ -156,18 +159,18 @@ function runLaneEffects(e) {
   }
 }
 function setProjectionWriteActive(e) {
-  P = e;
+  A = e;
 }
 function schedule() {
-  if (v) return;
-  v = true;
-  if (!k.q) queueMicrotask(flush);
+  if (C) return;
+  C = true;
+  if (!W.q) queueMicrotask(flush);
 }
 class Queue {
   i = null;
   F = [[], []];
   V = [];
-  created = O;
+  created = P;
   addChild(e) {
     this.V.push(e);
     e.i = this;
@@ -193,8 +196,8 @@ class Queue {
   }
   enqueue(e, t) {
     if (e) {
-      if (R) {
-        const n = findLane(R);
+      if (q) {
+        const n = findLane(q);
         n.M[e - 1].push(t);
       } else {
         this.F[e - 1].push(t);
@@ -238,52 +241,52 @@ class GlobalQueue extends Queue {
     if (this.q) return;
     this.q = true;
     try {
-      runHeap(_, GlobalQueue.K);
-      if (x) {
-        const e = transitionComplete(x);
+      runHeap(x, GlobalQueue.K);
+      if (k) {
+        const e = transitionComplete(k);
         if (!e) {
-          let e = x;
-          runHeap(b, GlobalQueue.K);
+          let e = k;
+          runHeap(v, GlobalQueue.K);
           this.D = [];
           this.B = [];
           this.G = new Set();
-          runLaneEffects(d);
           runLaneEffects(p);
-          this.stashQueues(x.X);
-          O++;
-          v = _.S >= _.W;
-          reassignPendingTransition(x.D);
-          x = null;
+          runLaneEffects(h);
+          this.stashQueues(k.X);
+          P++;
+          C = x.S >= x.W;
+          reassignPendingTransition(k.D);
+          k = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.D !== x.D && this.D.push(...x.D);
-        this.restoreQueues(x.X);
-        m.delete(x);
-        const t = x;
-        x = null;
+        this.D !== k.D && this.D.push(...k.D);
+        this.restoreQueues(k.X);
+        O.delete(k);
+        const t = k;
+        k = null;
         reassignPendingTransition(this.D);
         finalizePureQueue(t);
       } else {
-        if (m.size) runHeap(b, GlobalQueue.K);
+        if (O.size) runHeap(v, GlobalQueue.K);
         finalizePureQueue();
       }
-      O++;
-      v = _.S >= _.W;
-      runLaneEffects(d);
-      this.run(d);
+      P++;
+      C = x.S >= x.W;
       runLaneEffects(p);
       this.run(p);
+      runLaneEffects(h);
+      this.run(h);
     } finally {
       this.q = false;
     }
   }
   notify(e, t, n, r) {
-    if (t & l) {
-      if (n & l) {
+    if (t & c) {
+      if (n & c) {
         const t = r !== undefined ? r : e.Y;
-        if (x && t && !x.Z.includes(t.source)) {
-          x.Z.push(t.source);
+        if (k && t && !k.Z.includes(t.source)) {
+          k.Z.push(t.source);
           schedule();
         }
       }
@@ -293,11 +296,11 @@ class GlobalQueue extends Queue {
   }
   initTransition(e) {
     if (e) e = currentTransition(e);
-    if (e && e === x) return;
-    if (!e && x && x.$ === O) return;
-    if (!x) {
-      x = e ?? {
-        $: O,
+    if (e && e === k) return;
+    if (!e && k && k.$ === P) return;
+    if (!k) {
+      k = e ?? {
+        $: P,
         D: [],
         Z: [],
         B: [],
@@ -307,94 +310,99 @@ class GlobalQueue extends Queue {
         te: false
       };
     } else if (e) {
-      const t = x;
+      const t = k;
       t.te = e;
       e.ee.push(...t.ee);
-      for (const n of A) {
+      for (const n of j) {
         if (n.ne === t) n.ne = e;
       }
       e.B.push(...t.B);
       for (const n of t.G) {
         e.G.add(n);
       }
-      m.delete(t);
-      x = e;
+      O.delete(t);
+      k = e;
     }
-    m.add(x);
-    x.$ = O;
+    O.add(k);
+    k.$ = P;
     for (let e = 0; e < this.D.length; e++) {
       const t = this.D[e];
-      t.ne = x;
-      x.D.push(t);
+      t.ne = k;
+      k.D.push(t);
     }
-    this.D = x.D;
+    this.D = k.D;
     for (let e = 0; e < this.B.length; e++) {
       const t = this.B[e];
-      t.ne = x;
-      x.B.push(t);
+      t.ne = k;
+      k.B.push(t);
     }
-    this.B = x.B;
-    for (const e of A) {
-      if (!e.ne) e.ne = x;
+    this.B = k.B;
+    for (const e of j) {
+      if (!e.ne) e.ne = k;
     }
-    for (const e of this.G) x.G.add(e);
-    this.G = x.G;
+    for (const e of this.G) k.G.add(e);
+    this.G = k.G;
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.re || R;
-  for (let r = e.O; r !== null; r = r.P) {
+  const n = e.re || q;
+  const r = e.ie !== undefined;
+  for (let i = e.O; i !== null; i = i.P) {
+    if (r && i.k.se) {
+      i.k.m |= l;
+      continue;
+    }
     if (t && n) {
-      r.k.m |= f;
-      assignOrMergeLane(r.k, n);
+      i.k.m |= f;
+      assignOrMergeLane(i.k, n);
     } else if (t) {
-      r.k.m |= f;
-      r.k.re = undefined;
+      i.k.m |= f;
+      i.k.re = undefined;
     }
-    const e = r.k;
-    if (e.ie === h) {
-      if (!e.se) {
-        e.se = true;
-        e.oe.enqueue(p, e.ue);
+    const e = i.k;
+    if (e.oe === y) {
+      if (!e.ue) {
+        e.ue = true;
+        e.fe.enqueue(h, e.le);
       }
       continue;
     }
-    const i = r.k.m & o ? b : _;
-    if (i.W > r.k.o) i.W = r.k.o;
-    insertIntoHeap(r.k, i);
+    const s = i.k.m & o ? v : x;
+    if (s.W > i.k.o) s.W = i.k.o;
+    insertIntoHeap(i.k, s);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
-  if (!t) checkBoundaryChildren(k);
-  if (_.S >= _.W) runHeap(_, GlobalQueue.K);
+  if (!t) checkBoundaryChildren(W);
+  if (x.S >= x.W) runHeap(x, GlobalQueue.K);
   if (n) {
-    const t = k.D;
+    const t = W.D;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
-      if (n.fe !== y) {
-        n.le = n.fe;
-        n.fe = y;
-        if (n.ie && n.ie !== h) n.se = true;
+      if (n.ce !== g) {
+        n.ae = n.ce;
+        n.ce = g;
+        if (n.oe && n.oe !== y) n.ue = true;
       }
-      n.ce &= ~a;
+      n.de &= ~d;
       if (n.H) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.B : k.B;
+    const n = e ? e.B : W.B;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
-      const r = t.fe;
+      const r = t.ce;
       t.re = undefined;
-      if (r !== y && t.le !== r) {
-        t.le = r;
+      if (r !== g && t.ae !== r) {
+        t.ae = r;
         insertSubs(t, true);
       }
-      t.fe = y;
+      t.ce = g;
       t.ne = null;
     }
     n.length = 0;
-    const r = e ? e.G : k.G;
+    const r = e ? e.G : W.G;
     if (GlobalQueue.J && r.size) {
       for (const e of r) {
         GlobalQueue.J(e);
@@ -402,19 +410,19 @@ function finalizePureQueue(e = null, t = false) {
       r.clear();
       schedule();
     }
-    for (const t of A) {
+    for (const t of j) {
       const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
       if (!t.R) {
-        if (t.M[0].length) runQueue(t.M[0], d);
-        if (t.M[1].length) runQueue(t.M[1], p);
+        if (t.M[0].length) runQueue(t.M[0], p);
+        if (t.M[1].length) runQueue(t.M[1], h);
       }
-      if (t.ae.re === t) t.ae.re = undefined;
+      if (t.pe.re === t) t.pe.re = undefined;
       t.T.clear();
       t.M[0].length = 0;
       t.M[1].length = 0;
-      A.delete(t);
-      C.delete(t.ae);
+      j.delete(t);
+      E.delete(t.pe);
     }
   }
 }
@@ -425,18 +433,18 @@ function checkBoundaryChildren(e) {
   }
 }
 function trackOptimisticStore(e) {
-  k.G.add(e);
+  W.G.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].ne = x;
+    e[t].ne = k;
   }
 }
-const k = new GlobalQueue();
+const W = new GlobalQueue();
 function flush() {
-  while (v) {
-    k.flush();
+  while (C) {
+    W.flush();
   }
 }
 function runQueue(e, t) {
@@ -448,7 +456,7 @@ function transitionComplete(e) {
   let t = true;
   for (let n = 0; n < e.Z.length; n++) {
     const r = e.Z[n];
-    if (r.ce & l && r.Y?.source === r) {
+    if (r.de & c && r.Y?.source === r) {
       t = false;
       break;
     }
@@ -461,30 +469,30 @@ function currentTransition(e) {
   return e;
 }
 function setActiveTransition(e) {
-  x = e;
+  k = e;
 }
 function runInTransition(e, t) {
-  const n = x;
+  const n = k;
   try {
-    x = currentTransition(e);
+    k = currentTransition(e);
     return t();
   } finally {
-    x = n;
+    k = n;
   }
 }
-const C = new WeakMap();
-const A = new Set();
+const E = new WeakMap();
+const j = new Set();
 function getOrCreateLane(e) {
-  let t = C.get(e);
+  let t = E.get(e);
   if (t) {
     return findLane(t);
   }
-  const n = e.de;
+  const n = e.he;
   const r = n?.re ? findLane(n.re) : null;
-  t = { ae: e, T: new Set(), M: [[], []], R: null, ne: x, pe: r };
-  C.set(e, t);
-  A.add(t);
-  e.he = e.ye || 0;
+  t = { pe: e, T: new Set(), M: [[], []], R: null, ne: k, ye: r };
+  E.set(e, t);
+  j.add(t);
+  e.ge = e.Se || 0;
   return t;
 }
 function findLane(e) {
@@ -505,12 +513,12 @@ function resolveLane(e) {
   const t = e.re;
   if (!t) return undefined;
   const n = findLane(t);
-  if (A.has(n)) return n;
+  if (j.has(n)) return n;
   e.re = undefined;
   return undefined;
 }
 function hasActiveOverride(e) {
-  return !!(e.ge && e.fe !== y);
+  return !!(e.we && e.ce !== g);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
@@ -521,11 +529,11 @@ function assignOrMergeLane(e, t) {
       return;
     }
     const i = findLane(r);
-    if (A.has(i)) {
+    if (j.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
-        if (n.pe && findLane(n.pe) === i) {
+        if (n.ye && findLane(n.ye) === i) {
           e.re = t;
-        } else if (i.pe && findLane(i.pe) === n);
+        } else if (i.ye && findLane(i.ye) === n);
         else mergeLanes(n, i);
       }
       return;
@@ -538,41 +546,41 @@ function handleAsync(e, t, r) {
   const s = i && untrack(() => t[Symbol.asyncIterator]);
   const o = !s && i && untrack(() => typeof t.then === "function");
   if (!o && !s) {
-    e.we = null;
+    e.me = null;
     return t;
   }
-  e.we = t;
+  e.me = t;
   let u;
   const handleError = n => {
-    if (e.we !== t) return;
-    k.initTransition(e.ne);
-    notifyStatus(e, n instanceof NotReadyError ? l : c, n);
-    e.$ = O;
+    if (e.me !== t) return;
+    W.initTransition(e.ne);
+    notifyStatus(e, n instanceof NotReadyError ? c : a, n);
+    e.$ = P;
   };
   const asyncWrite = (i, s) => {
-    if (e.we !== t) return;
+    if (e.me !== t) return;
     if (e.m & (n | f)) return;
-    k.initTransition(e.ne);
+    W.initTransition(e.ne);
     clearStatus(e);
     const o = resolveLane(e);
     if (o) o.T.delete(e);
     if (r) r(i);
-    else if (e.ge) {
-      const t = e.fe !== y;
-      if (e.H) e.fe = i;
+    else if (e.we) {
+      const t = e.ce !== g;
+      if (e.H) e.ce = i;
       if (!t) {
-        e.le = i;
+        e.ae = i;
         insertSubs(e);
       }
-      e.$ = O;
+      e.$ = P;
     } else if (o) {
-      const t = e.le;
-      const n = e.Se;
+      const t = e.ae;
+      const n = e.be;
       if (!n || !n(i, t)) {
-        e.le = i;
-        e.$ = O;
-        if (e.me) {
-          setSignal(e.me, i);
+        e.ae = i;
+        e.$ = P;
+        if (e._e) {
+          setSignal(e._e, i);
         }
         insertSubs(e, true);
       }
@@ -599,8 +607,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      k.initTransition(e.ne);
-      throw new NotReadyError(Q);
+      W.initTransition(e.ne);
+      throw new NotReadyError(M);
     }
   }
   if (s) {
@@ -631,61 +639,61 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      k.initTransition(e.ne);
-      throw new NotReadyError(Q);
+      W.initTransition(e.ne);
+      throw new NotReadyError(M);
     }
   }
   return u;
 }
 function clearStatus(e) {
-  e.ce = e.ce & a;
+  e.de = e.de & d;
   e.Y = null;
   updatePendingSignal(e);
-  e._e?.();
+  e.Oe?.();
 }
 function notifyStatus(e, t, n, r, i) {
-  if (t === c && !(n instanceof StatusError) && !(n instanceof NotReadyError))
+  if (t === a && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const s = n instanceof NotReadyError && n.source === e;
-  const o = t === l && e.ge && !s;
+  const o = t === c && e.we && !s;
   const u = o && hasActiveOverride(e);
   if (!r) {
-    e.ce = t | (t !== c ? e.ce & a : 0);
+    e.de = t | (t !== a ? e.de & d : 0);
     e.Y = n;
     updatePendingSignal(e);
   }
   if (i && !r) {
     assignOrMergeLane(e, i);
   }
-  if (u && x && n instanceof NotReadyError) {
+  if (u && k && n instanceof NotReadyError) {
     const e = n.source;
-    if (!x.Z.includes(e)) {
-      x.Z.push(e);
+    if (!k.Z.includes(e)) {
+      k.Z.push(e);
     }
   }
   const f = r || u;
-  const d = r || o ? undefined : i;
-  if (e._e) {
+  const l = r || o ? undefined : i;
+  if (e.Oe) {
     if (f) {
-      e._e(t, n);
+      e.Oe(t, n);
     } else {
-      e._e();
+      e.Oe();
     }
     return;
   }
   for (let r = e.O; r !== null; r = r.P) {
-    r.k.$ = O;
+    r.k.$ = P;
     if (r.k.Y !== n) {
-      !r.k.ne && k.D.push(r.k);
-      notifyStatus(r.k, t, n, f, d);
+      !r.k.ne && W.D.push(r.k);
+      notifyStatus(r.k, t, n, f, l);
     }
   }
   for (let r = e.C; r !== null; r = r.A) {
     for (let e = r.O; e !== null; e = e.P) {
-      e.k.$ = O;
+      e.k.$ = P;
       if (e.k.Y !== n) {
-        !e.k.ne && k.D.push(e.k);
-        notifyStatus(e.k, t, n, f, d);
+        !e.k.ne && W.D.push(e.k);
+        notifyStatus(e.k, t, n, f, l);
       }
     }
   }
@@ -694,21 +702,21 @@ function unlinkSubs(e) {
   const t = e.L;
   const n = e.N;
   const r = e.P;
-  const i = e.be;
-  if (r !== null) r.be = i;
-  else t.Oe = i;
+  const i = e.xe;
+  if (r !== null) r.xe = i;
+  else t.ve = i;
   if (i !== null) i.P = r;
   else {
     t.O = r;
     if (r === null) {
-      t.xe?.();
-      t.H && !t.ve && !(t.m & o) && unobserved(t);
+      t.Pe?.();
+      t.H && !t.ke && !(t.m & o) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? b : _);
+  deleteFromHeap(e, e.m & o ? v : x);
   let t = e.j;
   while (t !== null) {
     t = unlinkSubs(t);
@@ -717,27 +725,27 @@ function unobserved(e) {
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.Pe;
+  const n = t.Ce;
   if (n !== null && n.L === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
     i = n !== null ? n.N : t.j;
     if (i !== null && i.L === e) {
-      t.Pe = i;
+      t.Ce = i;
       return;
     }
   }
-  const o = e.Oe;
+  const o = e.ve;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Pe = e.Oe = { L: e, k: t, N: i, be: o, P: null });
+  const u = (t.Ce = e.ve = { L: e, k: t, N: i, xe: o, P: null });
   if (n !== null) n.N = u;
   else t.j = u;
   if (o !== null) o.P = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
-  const n = t.Pe;
+  const n = t.Ce;
   if (n !== null) {
     let r = t.j;
     do {
@@ -748,17 +756,17 @@ function isValidLink(e, t) {
   }
   return false;
 }
-const W = {};
+const N = {};
 function markDisposal(e) {
-  let t = e.ke;
+  let t = e.Ae;
   while (t) {
     t.m |= o;
     if (t.m & i) {
-      deleteFromHeap(t, _);
-      insertIntoHeap(t, b);
+      deleteFromHeap(t, x);
+      insertIntoHeap(t, v);
     }
     markDisposal(t);
-    t = t.Ce;
+    t = t.We;
   }
 }
 function dispose(e) {
@@ -767,39 +775,39 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.j = null;
-  e.Pe = null;
+  e.Ce = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
-  let r = n ? e.Ae : e.ke;
+  let r = n ? e.Ee : e.Ae;
   while (r) {
-    const e = r.Ce;
+    const e = r.We;
     if (r.j) {
       const e = r;
-      deleteFromHeap(e, e.m & o ? b : _);
+      deleteFromHeap(e, e.m & o ? v : x);
       let t = e.j;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
       e.j = null;
-      e.Pe = null;
+      e.Ce = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.Ae = null;
+    e.Ee = null;
   } else {
-    e.ke = null;
-    e.Ce = null;
-    e.We = 0;
+    e.Ae = null;
+    e.We = null;
+    e.je = 0;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.Ee : e.je;
+  let n = t ? e.Ne : e.Le;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -809,12 +817,12 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.Ee = null) : (e.je = null);
+  t ? (e.Ne = null) : (e.Le = null);
 }
 function childId(e, t) {
   let n = e;
-  while (n.Ne && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.We++ : n.We);
+  while (n.Ie && n.i) n = n.i;
+  if (n.id != null) return formatId(n.id, t ? n.je++ : n.je);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -829,47 +837,50 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (L || H) return W;
-  return E ? Q : null;
+  if (R || T) return N;
+  return L ? M : null;
 }
 function getOwner() {
-  return Q;
+  return M;
 }
 function onCleanup(e) {
-  if (!Q) return e;
-  if (!Q.je) Q.je = e;
-  else if (Array.isArray(Q.je)) Q.je.push(e);
-  else Q.je = [Q.je, e];
+  if (!M) return e;
+  if (!M.Le) M.Le = e;
+  else if (Array.isArray(M.Le)) M.Le.push(e);
+  else M.Le = [M.Le, e];
   return e;
 }
+function isDisposed(e) {
+  return !!(e.m & (u | o));
+}
 function createOwner(e) {
-  const t = Q;
+  const t = M;
   const n = e?.transparent ?? false;
   const r = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    Ne: n || undefined,
+    Ie: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    ke: null,
-    Ce: null,
-    je: null,
-    oe: t?.oe ?? k,
-    Le: t?.Le || w,
-    We: 0,
-    Ee: null,
     Ae: null,
+    We: null,
+    Le: null,
+    fe: t?.fe ?? W,
+    He: t?.He || b,
+    je: 0,
+    Ne: null,
+    Ee: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
     }
   };
   if (t) {
-    const e = t.ke;
+    const e = t.Ae;
     if (e === null) {
-      t.ke = r;
+      t.Ae = r;
     } else {
-      r.Ce = e;
-      t.ke = r;
+      r.We = e;
+      t.Ae = r;
     }
   }
   return r;
@@ -883,154 +894,206 @@ function effect(e, t, n, r, i) {
   const o = computed(i?.render ? t => staleValues(() => e(t)) : e, r, {
     ...i,
     equals: () => {
-      o.se = !o.Y;
-      if (s) o.oe.enqueue(o.ie, runEffect.bind(o));
+      o.ue = !o.Y;
+      if (s) o.fe.enqueue(o.oe, runEffect.bind(o));
       return false;
     },
     lazy: true
   });
-  o.Ie = r;
-  o.He = t;
-  o.Qe = n;
-  o.Re = undefined;
-  o.ie = i?.render ? d : p;
-  o._e = (e, t) => {
-    const n = e !== undefined ? e : o.ce;
+  o.Re = r;
+  o.Qe = t;
+  o.Te = n;
+  o.Me = undefined;
+  o.oe = i?.render ? p : h;
+  o.Oe = (e, t) => {
+    const n = e !== undefined ? e : o.de;
     const r = t !== undefined ? t : o.Y;
-    if (n & c) {
+    if (n & a) {
       let e = r;
-      o.oe.notify(o, l, 0);
-      if (o.ie === p) {
+      o.fe.notify(o, c, 0);
+      if (o.oe === h) {
         try {
-          return o.Qe
-            ? o.Qe(e, () => {
-                o.Re?.();
-                o.Re = undefined;
+          return o.Te
+            ? o.Te(e, () => {
+                o.Me?.();
+                o.Me = undefined;
               })
             : console.error(e);
         } catch (t) {
           e = t;
         }
       }
-      if (!o.oe.notify(o, c, c)) throw e;
-    } else if (o.ie === d) o.oe.notify(o, l | c, n, r);
+      if (!o.fe.notify(o, a, a)) throw e;
+    } else if (o.oe === p) o.fe.notify(o, c | a, n, r);
   };
   recompute(o, true);
-  !i?.defer && (o.ie === p ? o.oe.enqueue(o.ie, runEffect.bind(o)) : runEffect.call(o));
+  !i?.defer && (o.oe === h ? o.fe.enqueue(o.oe, runEffect.bind(o)) : runEffect.call(o));
   s = true;
-  onCleanup(() => o.Re?.());
+  onCleanup(() => o.Me?.());
 }
 function runEffect() {
-  if (!this.se || this.m & u) return;
-  this.Re?.();
-  this.Re = undefined;
+  if (!this.ue || this.m & u) return;
+  this.Me?.();
+  this.Me = undefined;
   try {
-    this.Re = this.He(this.le, this.Ie);
+    this.Me = this.Qe(this.ae, this.Re);
   } catch (e) {
-    if (!this.oe.notify(this, c, c)) throw e;
+    if (!this.fe.notify(this, a, a)) throw e;
   } finally {
-    this.Ie = this.le;
-    this.se = false;
+    this.Re = this.ae;
+    this.ue = false;
   }
 }
 function trackedEffect(e, t) {
   const run = () => {
-    if (!n.se || n.m & u) return;
-    n.se = false;
+    if (!n.ue || n.m & u) return;
+    n.ue = false;
     recompute(n);
   };
   const n = computed(
     () => {
       try {
-        n.Re?.();
-        n.Re = undefined;
-        n.Re = staleValues(e) || undefined;
+        n.Me?.();
+        n.Me = undefined;
+        n.Me = staleValues(e) || undefined;
       } finally {
       }
     },
     undefined,
     { ...t, lazy: true, pureWrite: true }
   );
-  n.Re = undefined;
-  n.se = true;
-  n.ie = h;
-  n.ue = run;
-  n.oe.enqueue(p, run);
-  onCleanup(() => n.Re?.());
+  n.Me = undefined;
+  n.ue = true;
+  n.oe = y;
+  n.le = run;
+  n.fe.enqueue(h, run);
+  onCleanup(() => n.Me?.());
 }
 GlobalQueue.K = recompute;
 GlobalQueue.U = disposeChildren;
-let E = false;
-let j = false;
-let N = false;
 let L = false;
 let I = false;
 let H = false;
-let Q = null;
-let R = null;
+let R = false;
+let Q = false;
+let T = false;
+let M = null;
+let q = null;
+let F = false;
+let V = null;
+function ownerInSnapshotScope(e) {
+  while (e) {
+    if (e.qe) return true;
+    e = e.i;
+  }
+  return false;
+}
+function setSnapshotCapture(e) {
+  F = e;
+  if (e && !V) V = new Set();
+}
+function markSnapshotScope(e) {
+  e.qe = true;
+}
+function releaseSnapshotScope(e) {
+  e.qe = false;
+  releaseSubtree(e);
+  schedule();
+}
+function releaseSubtree(e) {
+  let t = e.Ae;
+  while (t) {
+    if (t.qe) {
+      t = t.We;
+      continue;
+    }
+    if (t.H) {
+      const e = t;
+      e.se = false;
+      if (e.m & l) {
+        e.m &= ~l;
+        e.m |= n;
+        if (x.W > e.o) x.W = e.o;
+        insertIntoHeap(e, x);
+      }
+    }
+    releaseSubtree(t);
+    t = t.We;
+  }
+}
+function clearSnapshots() {
+  if (V) {
+    for (const e of V) {
+      delete e.ie;
+      delete e[w];
+    }
+    V = null;
+  }
+  F = false;
+}
 function recompute(t, n = false) {
-  const i = t.ie;
+  const i = t.oe;
   if (!n) {
-    if (t.ne && (!i || x) && x !== t.ne) k.initTransition(t.ne);
-    deleteFromHeap(t, t.m & o ? b : _);
-    if (t.ne || i === h) disposeChildren(t);
+    if (t.ne && (!i || k) && k !== t.ne) W.initTransition(t.ne);
+    deleteFromHeap(t, t.m & o ? v : x);
+    if (t.ne || i === y) disposeChildren(t);
     else {
       markDisposal(t);
-      t.Ee = t.je;
-      t.Ae = t.ke;
-      t.je = null;
-      t.ke = null;
-      t.We = 0;
+      t.Ne = t.Le;
+      t.Ee = t.Ae;
+      t.Le = null;
+      t.Ae = null;
+      t.je = 0;
     }
   }
   const s = !!(t.m & f);
   const u = hasActiveOverride(t);
-  const a = !!(t.ce & l);
-  const d = Q;
-  Q = t;
-  t.Pe = null;
+  const d = !!(t.de & c);
+  const p = M;
+  M = t;
+  t.Ce = null;
   t.m = r;
-  t.$ = O;
-  let p = t.fe === y ? t.le : t.fe;
-  let g = t.o;
-  let w = E;
-  let S = R;
-  E = true;
+  t.$ = P;
+  let h = t.ce === g ? t.ae : t.ce;
+  let S = t.o;
+  let w = L;
+  let m = q;
+  L = true;
   if (s) {
     const e = resolveLane(t);
-    if (e) R = e;
+    if (e) q = e;
   }
   try {
-    p = handleAsync(t, t.H(p));
+    h = handleAsync(t, t.H(h));
     clearStatus(t);
     const e = resolveLane(t);
     if (e) {
       e.T.delete(t);
-      updatePendingSignal(e.ae);
+      updatePendingSignal(e.pe);
     }
   } catch (e) {
-    if (e instanceof NotReadyError && R) {
-      const e = findLane(R);
-      if (e.ae !== t) {
+    if (e instanceof NotReadyError && q) {
+      const e = findLane(q);
+      if (e.pe !== t) {
         e.T.add(t);
         t.re = e;
-        updatePendingSignal(e.ae);
+        updatePendingSignal(e.pe);
       }
     }
     notifyStatus(
       t,
-      e instanceof NotReadyError ? l : c,
+      e instanceof NotReadyError ? c : a,
       e,
       undefined,
       e instanceof NotReadyError ? t.re : undefined
     );
   } finally {
-    E = w;
-    t.m = e;
-    Q = d;
+    L = w;
+    t.m = e | (n ? t.m & l : 0);
+    M = p;
   }
   if (!t.Y) {
-    const e = t.Pe;
+    const e = t.Ce;
     let r = e !== null ? e.N : t.j;
     if (r !== null) {
       do {
@@ -1039,31 +1102,31 @@ function recompute(t, n = false) {
       if (e !== null) e.N = null;
       else t.j = null;
     }
-    const f = u ? t.le : t.fe === y ? t.le : t.fe;
-    const l = !t.Se || !t.Se(f, p);
+    const f = u ? t.ae : t.ce === g ? t.ae : t.ce;
+    const l = !t.be || !t.be(f, h);
     if (l) {
-      const e = u ? t.le : undefined;
-      if (n || (i && x !== t.ne) || s) t.le = p;
-      else t.fe = p;
-      if (u && !s && a) {
-        const e = t.ye || 0;
-        const n = t.he || 0;
-        if (e <= n) t.le = p;
-      }
-      if (!u || s || t.le !== e) {
+      const e = u ? t.ae : undefined;
+      if (n || (i && k !== t.ne) || s) t.ae = h;
+      else t.ce = h;
+      if (u && !s && d) {
+        const e = t.Se || 0;
+        const n = t.ge || 0;
+        if (e <= n) t.ae = h;
+      }
+      if (!u || s || t.ae !== e) {
         insertSubs(t, s || u);
       }
     } else if (u) {
-      t.fe = p;
-    } else if (t.o != g) {
+      t.ce = h;
+    } else if (t.o != S) {
       for (let e = t.O; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.k, e.k.m & o ? b : _);
+        insertIntoHeapHeight(e.k, e.k.m & o ? v : x);
       }
     }
   }
-  R = S;
-  (!n || t.ce & l) && !t.ne && !(x && t.ge) && k.D.push(t);
-  t.ne && i && x !== t.ne && runInTransition(t.ne, () => recompute(t));
+  q = m;
+  (!n || t.de & c) && !t.ne && !(k && t.we) && W.D.push(t);
+  t.ne && i && k !== t.ne && runInTransition(t.ne, () => recompute(t));
 }
 function updateIfNecessary(r) {
   if (r.m & t) {
@@ -1078,138 +1141,156 @@ function updateIfNecessary(r) {
       }
     }
   }
-  if (r.m & (n | f) || (r.Y && r.$ < O)) {
+  if (r.m & (n | f) || (r.Y && r.$ < P)) {
     recompute(r);
   }
-  r.m = e;
+  r.m = e | (r.m & l);
 }
 function computed(t, n, r) {
   const i = r?.transparent ?? false;
   const s = {
-    id: r?.id ?? (i ? Q?.id : Q?.id != null ? getNextChildId(Q) : undefined),
-    Ne: i || undefined,
-    Se: r?.equals != null ? r.equals : isEqual,
-    Te: !!r?.pureWrite,
-    xe: r?.unobserved,
-    je: null,
-    oe: Q?.oe ?? k,
-    Le: Q?.Le ?? w,
-    We: 0,
+    id: r?.id ?? (i ? M?.id : M?.id != null ? getNextChildId(M) : undefined),
+    Ie: i || undefined,
+    be: r?.equals != null ? r.equals : isEqual,
+    Fe: !!r?.pureWrite,
+    Pe: r?.unobserved,
+    Le: null,
+    fe: M?.fe ?? W,
+    He: M?.He ?? b,
+    je: 0,
     H: t,
-    le: n,
+    ae: n,
     o: 0,
     C: null,
     h: undefined,
     p: null,
     j: null,
-    Pe: null,
-    O: null,
-    Oe: null,
-    i: Q,
     Ce: null,
-    ke: null,
+    O: null,
+    ve: null,
+    i: M,
+    We: null,
+    Ae: null,
     m: e,
-    ce: a,
-    $: O,
-    fe: y,
+    de: d,
+    $: P,
+    ce: g,
+    Ne: null,
     Ee: null,
-    Ae: null,
-    we: null,
+    me: null,
     ne: null
   };
   s.p = s;
-  const o = Q?.t ? Q.u : Q;
-  if (Q) {
-    const e = Q.ke;
+  const o = M?.t ? M.u : M;
+  if (M) {
+    const e = M.Ae;
     if (e === null) {
-      Q.ke = s;
+      M.Ae = s;
     } else {
-      s.Ce = e;
-      Q.ke = s;
+      s.We = e;
+      M.Ae = s;
     }
   }
   if (o) s.o = o.o + 1;
+  if (F && ownerInSnapshotScope(M)) s.se = true;
   !r?.lazy && recompute(s, true);
+  if (F && !r?.lazy) {
+    if (!(s.de & c)) {
+      s.ie = s.ae === undefined ? S : s.ae;
+      V.add(s);
+    }
+  }
   return s;
 }
 function signal(e, t, n = null) {
   const r = {
-    Se: t?.equals != null ? t.equals : isEqual,
-    Te: !!t?.pureWrite,
-    xe: t?.unobserved,
-    le: e,
+    be: t?.equals != null ? t.equals : isEqual,
+    Fe: !!t?.pureWrite,
+    Pe: t?.unobserved,
+    ae: e,
     O: null,
-    Oe: null,
-    $: O,
+    ve: null,
+    $: P,
     I: n,
     A: n?.C || null,
-    fe: y
+    ce: g
   };
   n && (n.C = r);
+  if (F && !r.Fe) {
+    r.ie = e === undefined ? S : e;
+    V.add(r);
+  }
   return r;
 }
 function optimisticSignal(e, t) {
   const n = signal(e, t);
-  n.ge = true;
+  n.we = true;
   return n;
 }
 function optimisticComputed(e, t, n) {
   const r = computed(e, t, n);
-  r.ge = true;
+  r.we = true;
   return r;
 }
 function isEqual(e, t) {
   return e === t;
 }
 function untrack(e) {
-  if (!E) return e();
-  E = false;
+  if (!L) return e();
+  L = false;
   try {
     return e();
   } finally {
-    E = true;
+    L = true;
   }
 }
 function read(e) {
-  if (H) {
+  if (T) {
     const t = getPendingValueComputed(e);
-    const n = H;
-    H = false;
-    const r = read(t);
-    H = n;
-    if (t.ce & l) return e.le;
-    if (j && R && t.re) {
+    const n = T;
+    T = false;
+    let r;
+    try {
+      r = read(t);
+    } catch (t) {
+      if (!M && t instanceof NotReadyError) return e.ae;
+      throw t;
+    } finally {
+      T = n;
+    }
+    if (t.de & c) return e.ae;
+    if (I && q && t.re) {
       const n = findLane(t.re);
-      const r = findLane(R);
+      const r = findLane(q);
       if (n !== r && n.T.size > 0) {
-        return e.le;
+        return e.ae;
       }
     }
     return r;
   }
-  if (L) {
+  if (R) {
     const t = e.I || e;
     const n = getPendingSignal(t);
-    const r = L;
-    L = false;
+    const r = R;
+    R = false;
     if (read(n)) {
-      I = true;
+      Q = true;
     }
-    L = r;
-    return e.le;
+    R = r;
+    return e.ae;
   }
-  let t = Q;
+  let t = M;
   if (t?.t) t = t.u;
-  if (N && e.H) recompute(e);
-  if (t && E) {
+  if (H && e.H) recompute(e);
+  if (t && L) {
     if (e.H && e.m & u) recompute(e);
     link(e, t);
     const n = e.I || e;
     if (n.H) {
       const r = e.m & o;
-      if (n.o >= (r ? b.W : _.W)) {
+      if (n.o >= (r ? v.W : x.W)) {
         markNode(t);
-        markHeap(r ? b : _);
+        markHeap(r ? v : x);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -1219,107 +1300,120 @@ function read(e) {
     }
   }
   const n = e.I || e;
-  if (t && n.ce & l && !(j && n.ne && x !== n.ne)) {
-    if (R) {
-      const r = n.re;
-      const i = findLane(R);
-      if (r && findLane(r) === i && !hasActiveOverride(n)) {
-        if (!E) link(e, t);
+  if (n.de & c) {
+    if (t && !(I && n.ne && k !== n.ne)) {
+      if (q) {
+        const r = n.re;
+        const i = findLane(q);
+        if (r && findLane(r) === i && !hasActiveOverride(n)) {
+          if (!L) link(e, t);
+          throw n.Y;
+        }
+      } else {
+        if (!L) link(e, t);
         throw n.Y;
       }
-    } else {
-      if (!E) link(e, t);
+    } else if (!t && n.de & d) {
       throw n.Y;
     }
   }
-  if (e.H && e.ce & c) {
-    if (e.$ < O) {
+  if (e.H && e.de & a) {
+    if (e.$ < P) {
       recompute(e, true);
       return read(e);
     } else throw e.Y;
   }
-  return !t || R !== null || e.fe === y || (j && e.ne && x !== e.ne) ? e.le : e.fe;
+  if (F && t && t.se) {
+    const n = e.ie;
+    if (n !== undefined) {
+      const r = n === S ? undefined : n;
+      const i = e.ce !== g ? e.ce : e.ae;
+      if (i !== r) t.m |= l;
+      return r;
+    }
+  }
+  return !t || q !== null || e.ce === g || (I && e.ne && k !== e.ne) ? e.ae : e.ce;
 }
 function setSignal(e, t) {
-  if (e.ne && x !== e.ne) k.initTransition(e.ne);
-  const n = e.ge && !P;
-  const r = n ? e.le : e.fe === y ? e.le : e.fe;
+  if (e.ne && k !== e.ne) W.initTransition(e.ne);
+  const n = e.we && !A;
+  const r = n ? e.ae : e.ce === g ? e.ae : e.ce;
   if (typeof t === "function") t = t(r);
-  const i = !e.Se || !e.Se(r, t);
+  const i = !e.be || !e.be(r, t);
   if (!i) {
-    if (n && e.fe !== y && e.H) {
+    if (n && e.ce !== g && e.H) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = k.B.includes(e);
+    const n = W.B.includes(e);
     if (e.ne && n) {
-      k.initTransition(e.ne);
+      W.initTransition(e.ne);
     }
-    if (e.fe === y) {
-      e.fe = e.le;
+    if (e.ce === g) {
+      e.ce = e.ae;
     }
     if (!n) {
-      k.B.push(e);
+      W.B.push(e);
     }
-    e.ye = (e.ye || 0) + 1;
+    e.Se = (e.Se || 0) + 1;
     const r = getOrCreateLane(e);
     e.re = r;
-    e.le = t;
+    e.ae = t;
   } else {
-    if (e.fe === y) k.D.push(e);
-    e.fe = t;
+    if (e.ce === g) W.D.push(e);
+    e.ce = t;
   }
   updatePendingSignal(e);
-  if (e.me) {
-    setSignal(e.me, t);
+  if (e._e) {
+    setSignal(e._e, t);
   }
-  e.$ = O;
+  e.$ = P;
   insertSubs(e, n);
   schedule();
   return t;
 }
 function runWithOwner(e, t) {
-  const n = Q;
-  const r = E;
-  Q = e;
-  E = false;
+  const n = M;
+  const r = L;
+  M = e;
+  L = false;
   try {
     return t();
   } finally {
-    Q = n;
-    E = r;
+    M = n;
+    L = r;
   }
 }
 function getPendingSignal(e) {
-  if (!e.Me) {
-    e.Me = optimisticSignal(false, { pureWrite: true });
-    if (e.de) {
-      e.Me.de = e;
+  if (!e.Ve) {
+    e.Ve = optimisticSignal(false, { pureWrite: true });
+    if (e.he) {
+      e.Ve.he = e;
     }
-    if (computePendingState(e)) setSignal(e.Me, true);
+    if (computePendingState(e)) setSignal(e.Ve, true);
   }
-  return e.Me;
+  return e.Ve;
 }
 function computePendingState(e) {
   const t = e;
-  if (e.ge && e.fe !== y) {
-    if (t.ce & l && !(t.ce & a)) return true;
-    if (e.de) {
+  if (e.we && e.ce !== g) {
+    if (t.de & c && !(t.de & d)) return true;
+    if (e.he) {
       const t = e.re ? findLane(e.re) : null;
       return !!(t && t.T.size > 0);
     }
     return true;
   }
-  if (e.fe !== y && !(t.ce & a)) return true;
-  return !!(t.ce & l && !(t.ce & a));
+  if (e.ce !== g && !(t.de & d)) return true;
+  return !!(t.de & c && !(t.de & d));
 }
 function updatePendingSignal(e) {
-  if (e.Me) {
+  if (e.Ve) {
     const t = computePendingState(e);
-    const n = e.Me;
+    const n = e.Ve;
     setSignal(n, t);
     if (!t && n.re) {
       const t = resolveLane(e);
@@ -1329,78 +1423,78 @@ function updatePendingSignal(e) {
           mergeLanes(t, e);
         }
       }
-      C.delete(n);
+      E.delete(n);
       n.re = undefined;
     }
   }
 }
 function getPendingValueComputed(e) {
-  if (!e.me) {
-    const t = H;
-    H = false;
-    const n = L;
-    L = false;
-    const r = Q;
-    Q = null;
-    e.me = optimisticComputed(() => read(e));
-    e.me.de = e;
-    Q = r;
-    L = n;
-    H = t;
-  }
-  return e.me;
+  if (!e._e) {
+    const t = T;
+    T = false;
+    const n = R;
+    R = false;
+    const r = M;
+    M = null;
+    e._e = optimisticComputed(() => read(e));
+    e._e.he = e;
+    M = r;
+    R = n;
+    T = t;
+  }
+  return e._e;
 }
 function staleValues(e, t = true) {
-  const n = j;
-  j = t;
+  const n = I;
+  I = t;
   try {
     return e();
   } finally {
-    j = n;
+    I = n;
   }
 }
 function pending(e) {
-  const t = H;
-  H = true;
+  const t = T;
+  T = true;
   try {
     return e();
   } finally {
-    H = t;
+    T = t;
   }
 }
 function isPending(e) {
-  const t = L;
-  const n = I;
-  L = true;
-  I = false;
+  const t = R;
+  const n = Q;
+  R = true;
+  Q = false;
   try {
     e();
-    return I;
+    return Q;
   } catch {
-    return I;
+    return Q;
   } finally {
-    L = t;
-    I = n;
+    R = t;
+    Q = n;
   }
 }
 function refresh(e) {
-  let t = N;
-  N = true;
+  let t = H;
+  H = true;
   try {
     if (typeof e !== "function") {
-      recompute(e[S]);
+      recompute(e[_]);
       return e;
     }
     return untrack(e);
   } finally {
-    N = t;
+    H = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return N;
+  return H;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1409,7 +1503,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Le[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.He[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1419,16 +1513,16 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Le = { ...n.Le, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.He = { ...n.He, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Le[e.id]);
+  return !isUndefined(t?.He[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
 }
 function restoreTransition(e, t) {
-  k.initTransition(e);
+  W.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1437,8 +1531,8 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      k.initTransition();
-      let s = x;
+      W.initTransition();
+      let s = k;
       s.ee.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
@@ -1534,13 +1628,13 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   getOwner()
     ? createTrackedEffect(() => untrack(e))
-    : k.enqueue(p, () => {
+    : W.enqueue(h, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[F]?.[U] ?? e;
+  return e?.[K]?.[$] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1552,21 +1646,21 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n, r) {
-  const i = t?.[F];
+  const i = t?.[K];
   if (!i) return;
-  const s = i[G];
-  const o = i[K];
-  const u = i[z];
-  let f = i[U];
+  const s = i[X];
+  const o = i[Y];
+  const u = i[Z];
+  let f = i[$];
   if (e === s && !o && !u) return;
-  (i[Y] || ee).set(e, i[V]);
-  i[G] = e;
-  i[K] = undefined;
+  (i[ne] || se).set(e, i[z]);
+  i[X] = e;
+  i[Y] = undefined;
   if (Array.isArray(s)) {
     let t = false;
     const l = getOverrideValue(s, o, f, "length", u);
     if (e.length && l && e[0] && n(e[0]) != null) {
-      let c, a, d, p, h, y, g, w;
+      let c, a, d, p, h, y, g, S;
       for (
         d = 0, p = Math.min(l, e.length);
         d < p &&
@@ -1575,7 +1669,7 @@ function applyState(e, t, n, r) {
       ) {
         applyState(e[d], wrap(y, i), n, r);
       }
-      const S = new Array(e.length),
+      const w = new Array(e.length),
         m = new Map();
       for (
         p = l - 1, h = e.length - 1;
@@ -1584,64 +1678,64 @@ function applyState(e, t, n, r) {
         ((y = getOverrideValue(s, o, f, p, u)) === e[h] || (y && e[h] && n(y) === n(e[h])));
         p--, h--
       ) {
-        S[h] = y;
+        w[h] = y;
       }
       if (d > h || d > p) {
         for (a = d; a <= h; a++) {
           t = true;
-          i[U][a] && setSignal(i[U][a], wrap(e[a], i));
+          i[$][a] && setSignal(i[$][a], wrap(e[a], i));
         }
         for (; a < e.length; a++) {
           t = true;
-          const s = wrap(S[a], i);
-          i[U][a] && setSignal(i[U][a], s);
+          const s = wrap(w[a], i);
+          i[$][a] && setSignal(i[$][a], s);
           applyState(e[a], s, n, r);
         }
-        t && i[U][M] && setSignal(i[U][M], void 0);
-        l !== e.length && i[U].length && setSignal(i[U].length, e.length);
+        t && i[$][B] && setSignal(i[$][B], void 0);
+        l !== e.length && i[$].length && setSignal(i[$].length, e.length);
         return;
       }
       g = new Array(h + 1);
       for (a = h; a >= d; a--) {
         y = e[a];
-        w = y ? n(y) : y;
-        c = m.get(w);
+        S = y ? n(y) : y;
+        c = m.get(S);
         g[a] = c === undefined ? -1 : c;
-        m.set(w, a);
+        m.set(S, a);
       }
       for (c = d; c <= p; c++) {
         y = getOverrideValue(s, o, f, c, u);
-        w = y ? n(y) : y;
-        a = m.get(w);
+        S = y ? n(y) : y;
+        a = m.get(S);
         if (a !== undefined && a !== -1) {
-          S[a] = y;
+          w[a] = y;
           a = g[a];
-          m.set(w, a);
+          m.set(S, a);
         }
       }
       for (a = d; a < e.length; a++) {
-        if (a in S) {
-          const t = wrap(S[a], i);
-          i[U][a] && setSignal(i[U][a], t);
+        if (a in w) {
+          const t = wrap(w[a], i);
+          i[$][a] && setSignal(i[$][a], t);
           applyState(e[a], t, n, r);
-        } else i[U][a] && setSignal(i[U][a], wrap(e[a], i));
+        } else i[$][a] && setSignal(i[$][a], wrap(e[a], i));
       }
       if (d < e.length) t = true;
     } else if (e.length) {
       for (let t = 0, l = e.length; t < l; t++) {
         const l = getOverrideValue(s, o, f, t, u);
-        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[U][t] && setSignal(i[U][t], e[t]);
+        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[$][t] && setSignal(i[$][t], e[t]);
       }
     }
     if (l !== e.length) {
       t = true;
-      i[U].length && setSignal(i[U].length, e.length);
+      i[$].length && setSignal(i[$].length, e.length);
     }
-    t && i[U][M] && setSignal(i[U][M], void 0);
+    t && i[$][B] && setSignal(i[$][B], void 0);
     return;
   }
   if (f) {
-    const t = f[M];
+    const t = f[B];
     const l = t || r ? getAllKeys(s, o, e) : Object.keys(f);
     for (let c = 0, a = l.length; c < a; c++) {
       const a = l[c];
@@ -1655,7 +1749,7 @@ function applyState(e, t, n, r) {
       } else applyState(h, wrap(p, i), n, r);
     }
   }
-  if ((f = i[J])) {
+  if ((f = i[ee])) {
     const t = Object.keys(f);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -1677,9 +1771,9 @@ function createProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[X] = wrapProjection;
-    e[Y] = i;
-    Object.defineProperty(e, Z, {
+    e[te] = wrapProjection;
+    e[ne] = i;
+    Object.defineProperty(e, re, {
       get() {
         return r;
       },
@@ -1688,15 +1782,15 @@ function createProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[F]?.[X] === wrapProjection) return e;
-    const t = createStoreProxy(e, re, wrapper);
+    if (e[K]?.[te] === wrapProjection) return e;
+    const t = createStoreProxy(e, fe, wrapper);
     i.set(e, t);
     return t;
   };
   const s = wrapProjection(t);
   r = computed(() => {
     const t = getOwner();
-    storeSetter(new Proxy(s, T), r => {
+    storeSetter(new Proxy(s, D), r => {
       const i = handleAsync(t, e(r), e => {
         e !== r && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id", n?.all));
         setSignal(t, undefined);
@@ -1704,13 +1798,13 @@ function createProjectionInternal(e, t = {}, n) {
       i !== r && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
-  r.ve = true;
+  r.ke = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
   return createProjectionInternal(e, t, n).store;
 }
-const T = {
+const D = {
   get(e, t) {
     let n;
     setWriteOverride(true);
@@ -1721,7 +1815,7 @@ const T = {
       setWriteOverride(false);
       setProjectionWriteActive(false);
     }
-    return typeof n === "object" && n !== null ? new Proxy(n, T) : n;
+    return typeof n === "object" && n !== null ? new Proxy(n, D) : n;
   },
   set(e, t, n) {
     setWriteOverride(true);
@@ -1746,55 +1840,55 @@ const T = {
     return true;
   }
 };
-const M = Symbol(0),
-  q = Symbol(0),
-  F = Symbol(0),
-  V = Symbol(0),
-  D = Symbol(0);
-const B = new WeakMap();
-const G = "v",
-  K = "o",
-  z = "x",
-  U = "n",
-  J = "h",
-  X = "w",
-  Y = "l",
-  Z = "f",
-  $ = "p";
-function createStoreProxy(e, t = re, n) {
+const B = Symbol(0),
+  G = Symbol(0),
+  K = Symbol(0),
+  z = Symbol(0),
+  U = Symbol(0);
+const J = new WeakMap();
+const X = "v",
+  Y = "o",
+  Z = "x",
+  $ = "n",
+  ee = "h",
+  te = "w",
+  ne = "l",
+  re = "f",
+  ie = "p";
+function createStoreProxy(e, t = fe, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
     r.v = e;
   } else r = { v: e };
   n && n(r);
-  return (r[V] = new Proxy(r, t));
+  return (r[z] = new Proxy(r, t));
 }
-const ee = new WeakMap();
+const se = new WeakMap();
 function wrap(e, t) {
-  if (t?.[X]) return t[X](e, t);
-  let n = e[V] || ee.get(e);
-  if (!n) ee.set(e, (n = createStoreProxy(e)));
+  if (t?.[te]) return t[te](e, t);
+  let n = e[z] || se.get(e);
+  if (!n) se.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
   return e != null && typeof e === "object" && !Object.isFrozen(e);
 }
-let te = false;
+let oe = false;
 function setWriteOverride(e) {
-  te = e;
+  oe = e;
 }
 function writeOnly(e) {
-  return te || !!ne?.has(e);
+  return oe || !!ue?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
   if (!n) e[t] = n = Object.create(null);
   return n;
 }
-function getNode(e, t, n, r, i = isEqual, s) {
+function getNode(e, t, n, r, i = isEqual, s, o) {
   if (e[t]) return e[t];
-  const o = signal(
+  const u = signal(
     n,
     {
       equals: i,
@@ -1804,11 +1898,16 @@ function getNode(e, t, n, r, i = isEqual, s) {
     },
     r
   );
-  if (s) o.ge = true;
-  return (e[t] = o);
+  if (s) u.we = true;
+  if (o && t in o) {
+    const e = o[t];
+    u.ie = e === undefined ? S : e;
+    V?.add(u);
+  }
+  return (e[t] = u);
 }
-function trackSelf(e, t = M) {
-  getObserver() && read(getNode(getNodes(e, U), t, undefined, e[Z], false, e[$]));
+function trackSelf(e, t = B) {
+  getObserver() && read(getNode(getNodes(e, $), t, undefined, e[re], false, e[ie]));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -1816,7 +1915,7 @@ function getKeys(e, t, n = true) {
   const i = new Set(r);
   const s = Reflect.ownKeys(t);
   for (const e of s) {
-    if (t[e] !== D) i.add(e);
+    if (t[e] !== U) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -1824,88 +1923,97 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === D) return void 0;
+    if (r[n] === U) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let ne = null;
-const re = {
+let ue = null;
+const fe = {
   get(e, t, n) {
-    if (t === F) return e;
-    if (t === V) return n;
-    if (t === S) return e[Z];
-    if (t === M || t === q) {
+    if (t === K) return e;
+    if (t === z) return n;
+    if (t === _) return e[re];
+    if (t === B || t === G) {
       trackSelf(e, t);
       return n;
     }
-    const r = getNodes(e, U);
+    const r = getNodes(e, $);
     const i = r[t];
-    const s = e[z] && t in e[z];
-    const o = s || (e[K] && t in e[K]);
-    const u = !!e[G][F];
-    const f = s ? e[z] : e[K] && t in e[K] ? e[K] : e[G];
+    const s = e[Z] && t in e[Z];
+    const o = s || (e[Y] && t in e[Y]);
+    const u = !!e[X][K];
+    const f = s ? e[Z] : e[Y] && t in e[Y] ? e[Y] : e[X];
     if (!i) {
       const e = Object.getOwnPropertyDescriptor(f, t);
       if (e && e.get) return e.get.call(n);
     }
     if (writeOnly(n)) {
-      let n = i && (o || !u) ? (i.fe !== y ? (i.ge ? i.le : i.fe) : i.le) : f[t];
-      n === D && (n = undefined);
+      let n = i && (o || !u) ? (i.ce !== g ? (i.we ? i.ae : i.ce) : i.ae) : f[t];
+      n === U && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      ne?.add(r);
+      ue?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === D && (l = undefined);
+    l === U && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[G]) && (t = Object.getPrototypeOf(e[G])) && t !== Object.prototype
+        return !Array.isArray(e[X]) && (t = Object.getPrototypeOf(e[X])) && t !== Object.prototype
           ? l.bind(f)
           : l;
       } else if (getObserver()) {
-        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[Z], isEqual, e[$]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[re], isEqual, e[ie], e[w]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    if (t === V || t === M || t === "__proto__") return true;
-    const n = e[z] && t in e[z] ? e[z][t] !== D : e[K] && t in e[K] ? e[K][t] !== D : t in e[G];
-    getObserver() && read(getNode(getNodes(e, J), t, n, e[Z], isEqual, e[$]));
+    if (t === z || t === B || t === "__proto__") return true;
+    const n = e[Z] && t in e[Z] ? e[Z][t] !== U : e[Y] && t in e[Y] ? e[Y][t] !== U : t in e[X];
+    getObserver() && read(getNode(getNodes(e, ee), t, n, e[re], isEqual, e[ie]));
     return n;
   },
   set(e, t, n) {
-    const r = e[V];
+    const r = e[z];
     if (writeOnly(r)) {
-      if (e[$]) {
-        const t = e[Z];
+      if (e[ie]) {
+        const t = e[re];
         if (t?.ne) {
-          k.initTransition(t.ne);
+          W.initTransition(t.ne);
         }
       }
       untrack(() => {
-        const i = e[G];
+        const i = e[X];
         const s = i[t];
-        const o = e[$] && !P;
-        const u = o ? z : K;
+        if (F && typeof t !== "symbol") {
+          if (!e[w]) {
+            e[w] = Object.create(null);
+            V?.add(e);
+          }
+          if (!(t in e[w])) {
+            e[w][t] = s;
+          }
+        }
+        const o = e[ie] && !A;
+        const u = o ? Z : Y;
         if (o) trackOptimisticStore(r);
-        const f = e[z] && t in e[z] ? e[z][t] : e[K] && t in e[K] ? e[K][t] : s;
-        const l = n?.[F]?.[G] ?? n;
+        const f = e[Z] && t in e[Z] ? e[Z][t] : e[Y] && t in e[Y] ? e[Y][t] : s;
+        const l = n?.[K]?.[X] ?? n;
         if (f === l) return true;
-        const c = e[z]?.length || e[K]?.length || i.length;
+        const c = e[Z]?.length || e[Y]?.length || i.length;
         if (l !== undefined && l === s) delete e[u][t];
         else (e[u] || (e[u] = Object.create(null)))[t] = l;
         const a = isWrappable(l);
         if (isWrappable(f)) {
-          const e = B.get(f);
-          e && (e instanceof Set ? e.delete(r) : B.delete(f));
+          const e = J.get(f);
+          e && (e instanceof Set ? e.delete(r) : J.delete(f));
         }
-        if (recursivelyNotify(r, ee) && a) recursivelyAddParent(l, r);
-        e[J]?.[t] && setSignal(e[J][t], true);
-        const d = getNodes(e, U);
+        if (recursivelyNotify(r, se) && a) recursivelyAddParent(l, r);
+        e[ee]?.[t] && setSignal(e[ee][t], true);
+        const d = getNodes(e, $);
         d[t] && setSignal(d[t], () => (a ? wrap(l, e) : l));
         if (Array.isArray(i)) {
           if (t === "length") {
@@ -1915,44 +2023,44 @@ const re = {
             if (e > c) d.length && setSignal(d.length, e);
           }
         }
-        d[M] && setSignal(d[M], undefined);
+        d[B] && setSignal(d[B], undefined);
       });
     }
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[z]?.[t] === D;
-    const r = e[K]?.[t] === D;
-    if (writeOnly(e[V]) && !n && !r) {
+    const n = e[Z]?.[t] === U;
+    const r = e[Y]?.[t] === U;
+    if (writeOnly(e[z]) && !n && !r) {
       untrack(() => {
-        const n = e[$] && !P;
-        const r = n ? z : K;
-        if (n) trackOptimisticStore(e[V]);
-        const i = e[z] && t in e[z] ? e[z][t] : e[K] && t in e[K] ? e[K][t] : e[G][t];
-        if (t in e[G] || (e[K] && t in e[K])) {
-          (e[r] || (e[r] = Object.create(null)))[t] = D;
+        const n = e[ie] && !A;
+        const r = n ? Z : Y;
+        if (n) trackOptimisticStore(e[z]);
+        const i = e[Z] && t in e[Z] ? e[Z][t] : e[Y] && t in e[Y] ? e[Y][t] : e[X][t];
+        if (t in e[X] || (e[Y] && t in e[Y])) {
+          (e[r] || (e[r] = Object.create(null)))[t] = U;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
         if (isWrappable(i)) {
-          const t = B.get(i);
-          t && (t instanceof Set ? t.delete(e) : B.delete(i));
+          const t = J.get(i);
+          t && (t instanceof Set ? t.delete(e) : J.delete(i));
         }
-        if (e[J]?.[t]) setSignal(e[J][t], false);
-        const s = getNodes(e, U);
+        if (e[ee]?.[t]) setSignal(e[ee][t], false);
+        const s = getNodes(e, $);
         s[t] && setSignal(s[t], undefined);
-        s[M] && setSignal(s[M], undefined);
+        s[B] && setSignal(s[B], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[G], e[K], false);
-    if (e[z]) {
+    let t = getKeys(e[X], e[Y], false);
+    if (e[Z]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[z])) {
-        if (e[z][t] !== D) n.add(t);
+      for (const t of Reflect.ownKeys(e[Z])) {
+        if (e[Z][t] !== U) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -1960,25 +2068,25 @@ const re = {
     return t;
   },
   getOwnPropertyDescriptor(e, t) {
-    if (t === V) return { value: e[V], writable: true, configurable: true };
-    if (e[z] && t in e[z]) {
-      if (e[z][t] === D) return undefined;
-      const n = getPropertyDescriptor(e[G], e[K], t);
+    if (t === z) return { value: e[z], writable: true, configurable: true };
+    if (e[Z] && t in e[Z]) {
+      if (e[Z][t] === U) return undefined;
+      const n = getPropertyDescriptor(e[X], e[Y], t);
       if (n) {
-        return { ...n, value: e[z][t] };
+        return { ...n, value: e[Z][t] };
       }
-      return { value: e[z][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[Z][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[G], e[K], t);
+    return getPropertyDescriptor(e[X], e[Y], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[G]);
+    return Object.getPrototypeOf(e[X]);
   }
 };
 function storeSetter(e, t) {
-  const n = ne;
-  ne = new Set();
-  ne.add(e);
+  const n = ue;
+  ue = new Set();
+  ue.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -1994,8 +2102,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    ne.clear();
-    ne = n;
+    ue.clear();
+    ue = n;
   }
 }
 function createStore(e, t, n) {
@@ -2004,17 +2112,17 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function recursivelyNotify(e, t) {
-  let n = e[F] || t?.get(e)?.[F];
+  let n = e[K] || t?.get(e)?.[K];
   let r = false;
   if (n) {
-    const e = getNodes(n, U)[q];
+    const e = getNodes(n, $)[G];
     if (e) {
       setSignal(e, undefined);
       r = true;
     }
-    t = n[Y] || t;
+    t = n[ne] || t;
   }
-  const i = B.get(n?.[G] || e);
+  const i = J.get(n?.[X] || e);
   if (!i) return r;
   if (i instanceof Set) {
     for (let e of i) r = recursivelyNotify(e, t) || r;
@@ -2023,16 +2131,16 @@ function recursivelyNotify(e, t) {
 }
 function recursivelyAddParent(e, t) {
   let n;
-  const r = e[F];
+  const r = e[K];
   if (r) {
-    n = r[K];
-    e = r[G];
+    n = r[Y];
+    e = r[X];
   }
   if (t) {
-    let n = B.get(e);
-    if (!n) B.set(e, t);
+    let n = J.get(e);
+    if (!n) J.set(e, t);
     else if (n !== t) {
-      if (!(n instanceof Set)) B.set(e, (n = new Set([n])));
+      if (!(n instanceof Set)) J.set(e, (n = new Set([n])));
       else if (n.has(t)) return;
       n.add(t);
     } else return;
@@ -2054,7 +2162,7 @@ function recursivelyAddParent(e, t) {
 }
 function deep(e) {
   recursivelyAddParent(e);
-  return e[q];
+  return e[G];
 }
 function createOptimisticStore(e, t, n) {
   GlobalQueue.J ||= clearOptimisticStore;
@@ -2065,39 +2173,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[F];
-  if (!t || !t[z]) return;
-  const n = t[z];
-  const r = t[U];
+  const t = e[K];
+  if (!t || !t[Z]) return;
+  const n = t[Z];
+  const r = t[$];
   setProjectionWriteActive(true);
   try {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
           r[e].re = undefined;
-          const n = t[K] && e in t[K] ? t[K][e] : t[G][e];
-          const i = n === D ? undefined : n;
+          const n = t[Y] && e in t[Y] ? t[Y][e] : t[X][e];
+          const i = n === U ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
-      if (r[M]) {
-        r[M].re = undefined;
-        setSignal(r[M], undefined);
+      if (r[B]) {
+        r[B].re = undefined;
+        setSignal(r[B], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[z];
+  delete t[Z];
 }
 function createOptimisticProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[X] = wrapProjection;
-    e[Y] = i;
-    e[$] = true;
-    Object.defineProperty(e, Z, {
+    e[te] = wrapProjection;
+    e[ne] = i;
+    e[ie] = true;
+    Object.defineProperty(e, re, {
       get() {
         return r;
       },
@@ -2106,8 +2214,8 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[F]?.[X] === wrapProjection) return e;
-    const t = createStoreProxy(e, re, wrapper);
+    if (e[K]?.[te] === wrapProjection) return e;
+    const t = createStoreProxy(e, fe, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2117,7 +2225,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       const t = getOwner();
       setProjectionWriteActive(true);
       try {
-        storeSetter(new Proxy(s, T), r => {
+        storeSetter(new Proxy(s, D), r => {
           const i = handleAsync(t, e(r), e => {
             setProjectionWriteActive(true);
             try {
@@ -2132,7 +2240,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.ve = true;
+    r.ke = true;
   }
   return { store: s, node: r };
 }
@@ -2141,12 +2249,12 @@ function snapshot(e, t, n) {
   if (!isWrappable(e)) return e;
   if (t && t.has(e)) return t.get(e);
   if (!t) t = new Map();
-  if ((r = e[F] || n?.get(e)?.[F])) {
-    s = r[K];
-    i = Array.isArray(r[G]);
-    t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[G]))) : r[G]);
-    e = r[G];
-    n = ee;
+  if ((r = e[K] || n?.get(e)?.[K])) {
+    s = r[Y];
+    i = Array.isArray(r[X]);
+    t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[X]))) : r[X]);
+    e = r[X];
+    n = se;
   } else {
     i = Array.isArray(e);
     t.set(e, e);
@@ -2155,7 +2263,7 @@ function snapshot(e, t, n) {
     const r = s?.length || e.length;
     for (let i = 0; i < r; i++) {
       f = s && i in s ? s[i] : e[i];
-      if (f === D) continue;
+      if (f === U) continue;
       if ((u = snapshot(f, t, n)) !== f || o) {
         if (!o) t.set(e, (o = [...e]));
         o[i] = u;
@@ -2182,13 +2290,13 @@ function snapshot(e, t, n) {
 function trueFn() {
   return true;
 }
-const ie = {
+const le = {
   get(e, t, n) {
-    if (t === V) return n;
+    if (t === z) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === V) return true;
+    if (t === z) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2211,23 +2319,23 @@ const ie = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const se = Symbol(0);
+const ce = Symbol(0);
 function merge(...e) {
   if (e.length === 1 && typeof e[0] !== "function") return e[0];
   let t = false;
   const n = [];
   for (let r = 0; r < e.length; r++) {
     const i = e[r];
-    t = t || (!!i && V in i);
-    const s = !!i && i[se];
+    t = t || (!!i && z in i);
+    const s = !!i && i[ce];
     if (s) n.push(...s);
     else n.push(typeof i === "function" ? ((t = true), createMemo(i)) : i);
   }
-  if (g && t) {
+  if (m && t) {
     return new Proxy(
       {
         get(e) {
-          if (e === se) return n;
+          if (e === ce) return n;
           for (let t = n.length - 1; t >= 0; t--) {
             const r = resolveSource(n[t]);
             if (e in r) return r[e];
@@ -2245,7 +2353,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      ie
+      le
     );
   }
   const r = Object.create(null);
@@ -2277,12 +2385,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[se] = n;
+  o[ce] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (g && V in e) {
+  if (m && z in e) {
     return new Proxy(
       {
         get(t) {
@@ -2295,7 +2403,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      ie
+      le
     );
   }
   const r = {};
@@ -2313,68 +2421,68 @@ function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      qe: createOwner(),
-      Fe: 0,
-      Ve: e,
-      De: [],
-      Be: t,
-      Ge: [],
+      De: createOwner(),
+      Be: 0,
+      Ge: e,
       Ke: [],
-      ze: r,
-      Ue: r || n?.keyed === false ? [] : undefined,
-      Je: t.length > 1 ? [] : undefined,
-      Xe: n?.fallback
+      ze: t,
+      Ue: [],
+      Je: [],
+      Xe: r,
+      Ye: r || n?.keyed === false ? [] : undefined,
+      Ze: t.length > 1 ? [] : undefined,
+      $e: n?.fallback
     })
   );
 }
-const oe = { pureWrite: true };
+const ae = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.Ve() || [],
+  const e = this.Ge() || [],
     t = e.length;
-  e[M];
-  runWithOwner(this.qe, () => {
+  e[B];
+  runWithOwner(this.De, () => {
     let n,
       r,
-      i = this.Ue
+      i = this.Ye
         ? () => {
-            this.Ue[r] = signal(e[r], oe);
-            this.Je && (this.Je[r] = signal(r, oe));
-            return this.Be(
-              read.bind(null, this.Ue[r]),
-              this.Je ? read.bind(null, this.Je[r]) : undefined
+            this.Ye[r] = signal(e[r], ae);
+            this.Ze && (this.Ze[r] = signal(r, ae));
+            return this.ze(
+              read.bind(null, this.Ye[r]),
+              this.Ze ? read.bind(null, this.Ze[r]) : undefined
             );
           }
-        : this.Je
+        : this.Ze
           ? () => {
               const t = e[r];
-              this.Je[r] = signal(r, oe);
-              return this.Be(() => t, read.bind(null, this.Je[r]));
+              this.Ze[r] = signal(r, ae);
+              return this.ze(() => t, read.bind(null, this.Ze[r]));
             }
           : () => {
               const t = e[r];
-              return this.Be(() => t);
+              return this.ze(() => t);
             };
     if (t === 0) {
-      if (this.Fe !== 0) {
-        this.qe.dispose(false);
+      if (this.Be !== 0) {
+        this.De.dispose(false);
+        this.Je = [];
         this.Ke = [];
-        this.De = [];
-        this.Ge = [];
-        this.Fe = 0;
-        this.Ue && (this.Ue = []);
-        this.Je && (this.Je = []);
-      }
-      if (this.Xe && !this.Ge[0]) {
-        this.Ge[0] = runWithOwner((this.Ke[0] = createOwner()), this.Xe);
-      }
-    } else if (this.Fe === 0) {
-      if (this.Ke[0]) this.Ke[0].dispose();
-      this.Ge = new Array(t);
+        this.Ue = [];
+        this.Be = 0;
+        this.Ye && (this.Ye = []);
+        this.Ze && (this.Ze = []);
+      }
+      if (this.$e && !this.Ue[0]) {
+        this.Ue[0] = runWithOwner((this.Je[0] = createOwner()), this.$e);
+      }
+    } else if (this.Be === 0) {
+      if (this.Je[0]) this.Je[0].dispose();
+      this.Ue = new Array(t);
       for (r = 0; r < t; r++) {
-        this.De[r] = e[r];
-        this.Ge[r] = runWithOwner((this.Ke[r] = createOwner()), i);
+        this.Ke[r] = e[r];
+        this.Ue[r] = runWithOwner((this.Je[r] = createOwner()), i);
       }
-      this.Fe = t;
+      this.Be = t;
     } else {
       let s,
         o,
@@ -2385,187 +2493,187 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         p = new Array(t),
-        h = this.Ue ? new Array(t) : undefined,
-        y = this.Je ? new Array(t) : undefined;
+        h = this.Ye ? new Array(t) : undefined,
+        y = this.Ze ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Fe, t);
-        s < o && (this.De[s] === e[s] || (this.Ue && compare(this.ze, this.De[s], e[s])));
+        s = 0, o = Math.min(this.Be, t);
+        s < o && (this.Ke[s] === e[s] || (this.Ye && compare(this.Xe, this.Ke[s], e[s])));
         s++
       ) {
-        if (this.Ue) setSignal(this.Ue[s], e[s]);
+        if (this.Ye) setSignal(this.Ye[s], e[s]);
       }
       for (
-        o = this.Fe - 1, u = t - 1;
+        o = this.Be - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.De[o] === e[u] || (this.Ue && compare(this.ze, this.De[o], e[u])));
+        (this.Ke[o] === e[u] || (this.Ye && compare(this.Xe, this.Ke[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Ge[o];
-        p[u] = this.Ke[o];
-        h && (h[u] = this.Ue[o]);
-        y && (y[u] = this.Je[o]);
+        d[u] = this.Ue[o];
+        p[u] = this.Je[o];
+        h && (h[u] = this.Ye[o]);
+        y && (y[u] = this.Ze[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         f = e[r];
-        l = this.ze ? this.ze(f) : f;
+        l = this.Xe ? this.Xe(f) : f;
         n = c.get(l);
         a[r] = n === undefined ? -1 : n;
         c.set(l, r);
       }
       for (n = s; n <= o; n++) {
-        f = this.De[n];
-        l = this.ze ? this.ze(f) : f;
+        f = this.Ke[n];
+        l = this.Xe ? this.Xe(f) : f;
         r = c.get(l);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Ge[n];
-          p[r] = this.Ke[n];
-          h && (h[r] = this.Ue[n]);
-          y && (y[r] = this.Je[n]);
+          d[r] = this.Ue[n];
+          p[r] = this.Je[n];
+          h && (h[r] = this.Ye[n]);
+          y && (y[r] = this.Ze[n]);
           r = a[r];
           c.set(l, r);
-        } else this.Ke[n].dispose();
+        } else this.Je[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Ge[r] = d[r];
-          this.Ke[r] = p[r];
+          this.Ue[r] = d[r];
+          this.Je[r] = p[r];
           if (h) {
-            this.Ue[r] = h[r];
-            setSignal(this.Ue[r], e[r]);
+            this.Ye[r] = h[r];
+            setSignal(this.Ye[r], e[r]);
           }
           if (y) {
-            this.Je[r] = y[r];
-            setSignal(this.Je[r], r);
+            this.Ze[r] = y[r];
+            setSignal(this.Ze[r], r);
           }
         } else {
-          this.Ge[r] = runWithOwner((this.Ke[r] = createOwner()), i);
+          this.Ue[r] = runWithOwner((this.Je[r] = createOwner()), i);
         }
       }
-      this.Ge = this.Ge.slice(0, (this.Fe = t));
-      this.De = e.slice(0);
+      this.Ue = this.Ue.slice(0, (this.Be = t));
+      this.Ke = e.slice(0);
     }
   });
-  return this.Ge;
+  return this.Ue;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    qe: createOwner(),
-    Fe: 0,
-    Ye: 0,
-    Ze: e,
-    Be: t,
-    Ke: [],
-    Ge: [],
-    $e: n?.from,
-    Xe: n?.fallback
+    De: createOwner(),
+    Be: 0,
+    et: 0,
+    tt: e,
+    ze: t,
+    Je: [],
+    Ue: [],
+    nt: n?.from,
+    $e: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.Ze();
-  const t = this.$e?.() || 0;
-  runWithOwner(this.qe, () => {
+  const e = this.tt();
+  const t = this.nt?.() || 0;
+  runWithOwner(this.De, () => {
     if (e === 0) {
-      if (this.Fe !== 0) {
-        this.qe.dispose(false);
-        this.Ke = [];
-        this.Ge = [];
-        this.Fe = 0;
+      if (this.Be !== 0) {
+        this.De.dispose(false);
+        this.Je = [];
+        this.Ue = [];
+        this.Be = 0;
       }
-      if (this.Xe && !this.Ge[0]) {
-        this.Ge[0] = runWithOwner((this.Ke[0] = createOwner()), this.Xe);
+      if (this.$e && !this.Ue[0]) {
+        this.Ue[0] = runWithOwner((this.Je[0] = createOwner()), this.$e);
       }
       return;
     }
     const n = t + e;
-    const r = this.Ye + this.Fe;
-    if (this.Fe === 0 && this.Ke[0]) this.Ke[0].dispose();
-    for (let e = n; e < r; e++) this.Ke[e - this.Ye].dispose();
-    if (this.Ye < t) {
-      let e = this.Ye;
-      while (e < t && e < this.Fe) this.Ke[e++].dispose();
-      this.Ke.splice(0, t - this.Ye);
-      this.Ge.splice(0, t - this.Ye);
-    } else if (this.Ye > t) {
-      let n = r - this.Ye - 1;
-      let i = this.Ye - t;
-      this.Ke.length = this.Ge.length = e;
+    const r = this.et + this.Be;
+    if (this.Be === 0 && this.Je[0]) this.Je[0].dispose();
+    for (let e = n; e < r; e++) this.Je[e - this.et].dispose();
+    if (this.et < t) {
+      let e = this.et;
+      while (e < t && e < this.Be) this.Je[e++].dispose();
+      this.Je.splice(0, t - this.et);
+      this.Ue.splice(0, t - this.et);
+    } else if (this.et > t) {
+      let n = r - this.et - 1;
+      let i = this.et - t;
+      this.Je.length = this.Ue.length = e;
       while (n >= i) {
-        this.Ke[n] = this.Ke[n - i];
-        this.Ge[n] = this.Ge[n - i];
+        this.Je[n] = this.Je[n - i];
+        this.Ue[n] = this.Ue[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.Ge[e] = runWithOwner((this.Ke[e] = createOwner()), () => this.Be(e + t));
+        this.Ue[e] = runWithOwner((this.Je[e] = createOwner()), () => this.ze(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Ge[e - t] = runWithOwner((this.Ke[e - t] = createOwner()), () => this.Be(e));
+      this.Ue[e - t] = runWithOwner((this.Je[e - t] = createOwner()), () => this.ze(e));
     }
-    this.Ge = this.Ge.slice(0, e);
-    this.Ye = t;
-    this.Fe = e;
+    this.Ue = this.Ue.slice(0, e);
+    this.et = t;
+    this.Be = e;
   });
-  return this.Ge;
+  return this.Ue;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n._e = (e, t) => {
-    const r = e !== undefined ? e : n.ce;
+  n.Oe = (e, t) => {
+    const r = e !== undefined ? e : n.de;
     const i = t !== undefined ? t : n.Y;
-    n.ce &= ~n.et;
-    n.oe.notify(n, n.et, r, i);
+    n.de &= ~n.rt;
+    n.fe.notify(n, n.rt, r, i);
   };
-  n.et = t;
-  n.ve = true;
+  n.rt = t;
+  n.ke = true;
   recompute(n, true);
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.oe;
-  i.addChild((e.oe = n));
-  onCleanup(() => i.removeChild(e.oe));
+  const i = e.fe;
+  i.addChild((e.fe = n));
+  onCleanup(() => i.removeChild(e.fe));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
 class CollectionQueue extends Queue {
-  tt;
-  nt = new Set();
-  rt = signal(false, { pureWrite: true });
-  it = false;
+  it;
+  st = new Set();
+  ot = signal(false, { pureWrite: true });
+  ut = false;
   constructor(e) {
     super();
-    this.tt = e;
+    this.it = e;
   }
   run(e) {
-    if (!e || read(this.rt)) return;
+    if (!e || read(this.ot)) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.tt) || (this.tt & l && this.it)) return super.notify(e, t, n, r);
-    if (n & this.tt) {
+    if (!(t & this.it) || (this.it & c && this.ut)) return super.notify(e, t, n, r);
+    if (n & this.it) {
       const t = r?.source || e.Y?.source;
       if (t) {
-        const e = this.nt.size === 0;
-        this.nt.add(t);
-        if (e) setSignal(this.rt, true);
+        const e = this.st.size === 0;
+        this.st.add(t);
+        if (e) setSignal(this.ot, true);
       }
     }
-    t &= ~this.tt;
+    t &= ~this.it;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.nt) {
-      if (!(e.ce & this.tt)) this.nt.delete(e);
+    for (const e of this.st) {
+      if (!(e.de & this.it)) this.st.delete(e);
     }
-    if (!this.nt.size) setSignal(this.rt, false);
+    if (!this.st.size) setSignal(this.ot, false);
   }
 }
 function createCollectionBoundary(e, t, n) {
@@ -2573,10 +2681,10 @@ function createCollectionBoundary(e, t, n) {
   const i = new CollectionQueue(e);
   const s = createBoundChildren(r, t, i, e);
   const o = computed(() => {
-    if (!read(i.rt)) {
+    if (!read(i.ot)) {
       const e = read(s);
-      if (!untrack(() => read(i.rt))) {
-        i.it = true;
+      if (!untrack(() => read(i.ot))) {
+        i.ut = true;
         return e;
       }
     }
@@ -2585,14 +2693,14 @@ function createCollectionBoundary(e, t, n) {
   return read.bind(null, o);
 }
 function createLoadBoundary(e, t) {
-  return createCollectionBoundary(l, e, () => t());
+  return createCollectionBoundary(c, e, () => t());
 }
 function createErrorBoundary(e, t) {
-  return createCollectionBoundary(c, e, e => {
-    let n = e.nt.values().next().value;
+  return createCollectionBoundary(a, e, e => {
+    let n = e.st.values().next().value;
     const r = n.Y?.cause ?? n.Y;
     return t(r, () => {
-      for (const t of e.nt) recompute(t);
+      for (const t of e.st) recompute(t);
       schedule();
     });
   });
@@ -2646,14 +2754,15 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = V;
-exports.$TARGET = F;
-exports.$TRACK = M;
+exports.$PROXY = z;
+exports.$TARGET = K;
+exports.$TRACK = B;
 exports.ContextNotFoundError = ContextNotFoundError;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
-exports.SUPPORTS_PROXY = g;
+exports.SUPPORTS_PROXY = m;
 exports.action = action;
+exports.clearSnapshots = clearSnapshots;
 exports.createContext = createContext;
 exports.createEffect = createEffect;
 exports.createErrorBoundary = createErrorBoundary;
@@ -2676,11 +2785,13 @@ exports.getContext = getContext;
 exports.getNextChildId = getNextChildId;
 exports.getObserver = getObserver;
 exports.getOwner = getOwner;
+exports.isDisposed = isDisposed;
 exports.isEqual = isEqual;
 exports.isPending = isPending;
 exports.isRefreshing = isRefreshing;
 exports.isWrappable = isWrappable;
 exports.mapArray = mapArray;
+exports.markSnapshotScope = markSnapshotScope;
 exports.merge = merge;
 exports.omit = omit;
 exports.onCleanup = onCleanup;
@@ -2689,9 +2800,11 @@ exports.peekNextChildId = peekNextChildId;
 exports.pending = pending;
 exports.reconcile = reconcile;
 exports.refresh = refresh;
+exports.releaseSnapshotScope = releaseSnapshotScope;
 exports.repeat = repeat;
 exports.resolve = resolve;
 exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
+exports.setSnapshotCapture = setSnapshotCapture;
 exports.snapshot = snapshot;
 exports.untrack = untrack;