@solidjs/signals 0.10.7 → 0.11.0

package/dist/node.cjs

@@ -42,8 +42,8 @@ const y = 3;
 const g = {};
 const S = {};
 const w = "sp";
-const m = typeof Proxy === "function";
-const b = {};
+const b = typeof Proxy === "function";
+const m = {};
 const _ = Symbol("refresh");
 function actualInsertIntoHeap(e, t) {
   const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
@@ -106,8 +106,8 @@ function markNode(e, r = n) {
   for (let n = e.O; n !== null; n = n.P) {
     markNode(n.k, t);
   }
-  if (e.C !== null) {
-    for (let n = e.C; n !== null; n = n.A) {
+  if (e.A !== null) {
+    for (let n = e.A; n !== null; n = n.C) {
       for (let e = n.O; e !== null; e = e.P) {
         markNode(e.k, t);
       }
@@ -116,12 +116,12 @@ function markNode(e, r = n) {
 }
 function runHeap(e, t) {
   e._ = false;
-  for (e.W = 0; e.W <= e.S; e.W++) {
-    let n = e.l[e.W];
+  for (e.j = 0; e.j <= e.S; e.j++) {
+    let n = e.l[e.j];
     while (n !== undefined) {
       if (n.m & i) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.W];
+      n = e.l[e.j];
     }
   }
   e.S = 0;
@@ -129,10 +129,10 @@ function runHeap(e, t) {
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.j; t; t = t.N) {
+  for (let t = e.W; t; t = t.N) {
     const e = t.L;
     const r = e.I || e;
-    if (r.H && r.o >= n) n = r.o + 1;
+    if (r.R && r.o >= n) n = r.o + 1;
   }
   if (e.o !== n) {
     e.o = n;
@@ -142,15 +142,15 @@ function adjustHeight(e, t) {
   }
 }
 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 };
+const x = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
+const v = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
 let P = 0;
 let k = null;
-let C = false;
 let A = false;
+let C = false;
 function runLaneEffects(e) {
-  for (const t of j) {
-    if (t.R || t.T.size > 0) continue;
+  for (const t of W) {
+    if (t.H || t.T.size > 0) continue;
     const n = t.M[e - 1];
     if (n.length) {
       t.M[e - 1] = [];
@@ -159,12 +159,12 @@ function runLaneEffects(e) {
   }
 }
 function setProjectionWriteActive(e) {
-  A = e;
+  C = e;
 }
 function schedule() {
-  if (C) return;
-  C = true;
-  if (!W.q) queueMicrotask(flush);
+  if (A) return;
+  A = true;
+  if (!E.q) queueMicrotask(flush);
 }
 class Queue {
   i = null;
@@ -254,7 +254,7 @@ class GlobalQueue extends Queue {
           runLaneEffects(h);
           this.stashQueues(k.X);
           P++;
-          C = x.S >= x.W;
+          A = x.S >= x.j;
           reassignPendingTransition(k.D);
           k = null;
           finalizePureQueue(null, true);
@@ -272,7 +272,7 @@ class GlobalQueue extends Queue {
         finalizePureQueue();
       }
       P++;
-      C = x.S >= x.W;
+      A = x.S >= x.j;
       runLaneEffects(p);
       this.run(p);
       runLaneEffects(h);
@@ -313,7 +313,7 @@ class GlobalQueue extends Queue {
       const t = k;
       t.te = e;
       e.ee.push(...t.ee);
-      for (const n of j) {
+      for (const n of W) {
         if (n.ne === t) n.ne = e;
       }
       e.B.push(...t.B);
@@ -337,7 +337,7 @@ class GlobalQueue extends Queue {
       k.B.push(t);
     }
     this.B = k.B;
-    for (const e of j) {
+    for (const e of W) {
       if (!e.ne) e.ne = k;
     }
     for (const e of this.G) k.G.add(e);
@@ -368,16 +368,16 @@ function insertSubs(e, t = false) {
       continue;
     }
     const s = i.k.m & o ? v : x;
-    if (s.W > i.k.o) s.W = i.k.o;
+    if (s.j > i.k.o) s.j = i.k.o;
     insertIntoHeap(i.k, s);
   }
 }
 function finalizePureQueue(e = null, t = false) {
   let n = !t;
-  if (!t) checkBoundaryChildren(W);
-  if (x.S >= x.W) runHeap(x, GlobalQueue.K);
+  if (!t) checkBoundaryChildren(E);
+  if (x.S >= x.j) runHeap(x, GlobalQueue.K);
   if (n) {
-    const t = W.D;
+    const t = E.D;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
       if (n.ce !== g) {
@@ -386,10 +386,10 @@ function finalizePureQueue(e = null, t = false) {
         if (n.oe && n.oe !== y) n.ue = true;
       }
       n.de &= ~d;
-      if (n.H) GlobalQueue.U(n, false, true);
+      if (n.R) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.B : W.B;
+    const n = e ? e.B : E.B;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
       const r = t.ce;
@@ -402,7 +402,7 @@ function finalizePureQueue(e = null, t = false) {
       t.ne = null;
     }
     n.length = 0;
-    const r = e ? e.G : W.G;
+    const r = e ? e.G : E.G;
     if (GlobalQueue.J && r.size) {
       for (const e of r) {
         GlobalQueue.J(e);
@@ -410,10 +410,10 @@ function finalizePureQueue(e = null, t = false) {
       r.clear();
       schedule();
     }
-    for (const t of j) {
+    for (const t of W) {
       const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
-      if (!t.R) {
+      if (!t.H) {
         if (t.M[0].length) runQueue(t.M[0], p);
         if (t.M[1].length) runQueue(t.M[1], h);
       }
@@ -421,8 +421,8 @@ function finalizePureQueue(e = null, t = false) {
       t.T.clear();
       t.M[0].length = 0;
       t.M[1].length = 0;
-      j.delete(t);
-      E.delete(t.pe);
+      W.delete(t);
+      j.delete(t.pe);
     }
   }
 }
@@ -433,7 +433,7 @@ function checkBoundaryChildren(e) {
   }
 }
 function trackOptimisticStore(e) {
-  W.G.add(e);
+  E.G.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
@@ -441,10 +441,10 @@ function reassignPendingTransition(e) {
     e[t].ne = k;
   }
 }
-const W = new GlobalQueue();
+const E = new GlobalQueue();
 function flush() {
-  while (C) {
-    W.flush();
+  while (A) {
+    E.flush();
   }
 }
 function runQueue(e, t) {
@@ -480,30 +480,30 @@ function runInTransition(e, t) {
     k = n;
   }
 }
-const E = new WeakMap();
-const j = new Set();
+const j = new WeakMap();
+const W = new Set();
 function getOrCreateLane(e) {
-  let t = E.get(e);
+  let t = j.get(e);
   if (t) {
     return findLane(t);
   }
   const n = e.he;
   const r = n?.re ? findLane(n.re) : null;
-  t = { pe: e, T: new Set(), M: [[], []], R: null, ne: k, ye: r };
-  E.set(e, t);
-  j.add(t);
+  t = { pe: e, T: new Set(), M: [[], []], H: null, ne: k, ye: r };
+  j.set(e, t);
+  W.add(t);
   e.ge = e.Se || 0;
   return t;
 }
 function findLane(e) {
-  while (e.R) e = e.R;
+  while (e.H) e = e.H;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.R = e;
+  t.H = e;
   for (const n of t.T) e.T.add(n);
   e.M[0].push(...t.M[0]);
   e.M[1].push(...t.M[1]);
@@ -513,7 +513,7 @@ function resolveLane(e) {
   const t = e.re;
   if (!t) return undefined;
   const n = findLane(t);
-  if (j.has(n)) return n;
+  if (W.has(n)) return n;
   e.re = undefined;
   return undefined;
 }
@@ -524,12 +524,12 @@ function assignOrMergeLane(e, t) {
   const n = findLane(t);
   const r = e.re;
   if (r) {
-    if (r.R) {
+    if (r.H) {
       e.re = t;
       return;
     }
     const i = findLane(r);
-    if (j.has(i)) {
+    if (W.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
         if (n.ye && findLane(n.ye) === i) {
           e.re = t;
@@ -546,28 +546,28 @@ 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.me = null;
+    e.be = null;
     return t;
   }
-  e.me = t;
+  e.be = t;
   let u;
   const handleError = n => {
-    if (e.me !== t) return;
-    W.initTransition(e.ne);
+    if (e.be !== t) return;
+    E.initTransition(e.ne);
     notifyStatus(e, n instanceof NotReadyError ? c : a, n);
     e.$ = P;
   };
   const asyncWrite = (i, s) => {
-    if (e.me !== t) return;
+    if (e.be !== t) return;
     if (e.m & (n | f)) return;
-    W.initTransition(e.ne);
+    E.initTransition(e.ne);
     clearStatus(e);
     const o = resolveLane(e);
     if (o) o.T.delete(e);
     if (r) r(i);
     else if (e.we) {
       const t = e.ce !== g;
-      if (e.H) e.ce = i;
+      if (e.R) e.ce = i;
       if (!t) {
         e.ae = i;
         insertSubs(e);
@@ -575,7 +575,7 @@ function handleAsync(e, t, r) {
       e.$ = P;
     } else if (o) {
       const t = e.ae;
-      const n = e.be;
+      const n = e.me;
       if (!n || !n(i, t)) {
         e.ae = i;
         e.$ = P;
@@ -607,7 +607,7 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      W.initTransition(e.ne);
+      E.initTransition(e.ne);
       throw new NotReadyError(M);
     }
   }
@@ -639,7 +639,7 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      W.initTransition(e.ne);
+      E.initTransition(e.ne);
       throw new NotReadyError(M);
     }
   }
@@ -684,15 +684,15 @@ function notifyStatus(e, t, n, r, i) {
   for (let r = e.O; r !== null; r = r.P) {
     r.k.$ = P;
     if (r.k.Y !== n) {
-      !r.k.ne && W.D.push(r.k);
+      !r.k.ne && E.D.push(r.k);
       notifyStatus(r.k, t, n, f, l);
     }
   }
-  for (let r = e.C; r !== null; r = r.A) {
+  for (let r = e.A; r !== null; r = r.C) {
     for (let e = r.O; e !== null; e = e.P) {
       e.k.$ = P;
       if (e.k.Y !== n) {
-        !e.k.ne && W.D.push(e.k);
+        !e.k.ne && E.D.push(e.k);
         notifyStatus(e.k, t, n, f, l);
       }
     }
@@ -710,44 +710,44 @@ function unlinkSubs(e) {
     t.O = r;
     if (r === null) {
       t.Pe?.();
-      t.H && !t.ke && !(t.m & o) && unobserved(t);
+      t.R && !t.ke && !(t.m & o) && unobserved(t);
     }
   }
   return n;
 }
 function unobserved(e) {
   deleteFromHeap(e, e.m & o ? v : x);
-  let t = e.j;
+  let t = e.W;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.j = null;
+  e.W = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.Ce;
+  const n = t.Ae;
   if (n !== null && n.L === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
-    i = n !== null ? n.N : t.j;
+    i = n !== null ? n.N : t.W;
     if (i !== null && i.L === e) {
-      t.Ce = i;
+      t.Ae = i;
       return;
     }
   }
   const o = e.ve;
   if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Ce = e.ve = { L: e, k: t, N: i, xe: o, P: null });
+  const u = (t.Ae = e.ve = { L: e, k: t, N: i, xe: o, P: null });
   if (n !== null) n.N = u;
-  else t.j = u;
+  else t.W = u;
   if (o !== null) o.P = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
-  const n = t.Ce;
+  const n = t.Ae;
   if (n !== null) {
-    let r = t.j;
+    let r = t.W;
     do {
       if (r === e) return true;
       if (r === n) break;
@@ -758,7 +758,7 @@ function isValidLink(e, t) {
 }
 const N = {};
 function markDisposal(e) {
-  let t = e.Ae;
+  let t = e.Ce;
   while (t) {
     t.m |= o;
     if (t.m & i) {
@@ -766,43 +766,43 @@ function markDisposal(e) {
       insertIntoHeap(t, v);
     }
     markDisposal(t);
-    t = t.We;
+    t = t.Ee;
   }
 }
 function dispose(e) {
-  let t = e.j || null;
+  let t = e.W || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.j = null;
-  e.Ce = null;
+  e.W = null;
+  e.Ae = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
   if (e.m & u) return;
   if (t) e.m = u;
-  let r = n ? e.Ee : e.Ae;
+  let r = n ? e.je : e.Ce;
   while (r) {
-    const e = r.We;
-    if (r.j) {
+    const e = r.Ee;
+    if (r.W) {
       const e = r;
       deleteFromHeap(e, e.m & o ? v : x);
-      let t = e.j;
+      let t = e.W;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.j = null;
-      e.Ce = null;
+      e.W = null;
+      e.Ae = null;
     }
     disposeChildren(r, true);
     r = e;
   }
   if (n) {
-    e.Ee = null;
+    e.je = null;
   } else {
-    e.Ae = null;
-    e.We = null;
-    e.je = 0;
+    e.Ce = null;
+    e.Ee = null;
+    e.We = 0;
   }
   runDisposal(e, n);
 }
@@ -822,7 +822,7 @@ function runDisposal(e, t) {
 function childId(e, t) {
   let n = e;
   while (n.Ie && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.je++ : n.je);
+  if (n.id != null) return formatId(n.id, t ? n.We++ : n.We);
   throw new Error("Cannot get child id from owner without an id");
 }
 function getNextChildId(e) {
@@ -837,7 +837,7 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (R || T) return N;
+  if (H || T) return N;
   return L ? M : null;
 }
 function getOwner() {
@@ -861,26 +861,26 @@ function createOwner(e) {
     Ie: n || undefined,
     t: true,
     u: t?.t ? t.u : t,
-    Ae: null,
-    We: null,
+    Ce: null,
+    Ee: null,
     Le: null,
-    fe: t?.fe ?? W,
-    He: t?.He || b,
-    je: 0,
+    fe: t?.fe ?? E,
+    Re: t?.Re || m,
+    We: 0,
     Ne: null,
-    Ee: null,
+    je: null,
     i: t,
     dispose(e = true) {
       disposeChildren(r, e);
     }
   };
   if (t) {
-    const e = t.Ae;
+    const e = t.Ce;
     if (e === null) {
-      t.Ae = r;
+      t.Ce = r;
     } else {
-      r.We = e;
-      t.Ae = r;
+      r.Ee = e;
+      t.Ce = r;
     }
   }
   return r;
@@ -900,7 +900,7 @@ function effect(e, t, n, r, i) {
     },
     lazy: true
   });
-  o.Re = r;
+  o.He = r;
   o.Qe = t;
   o.Te = n;
   o.Me = undefined;
@@ -936,11 +936,11 @@ function runEffect() {
   this.Me?.();
   this.Me = undefined;
   try {
-    this.Me = this.Qe(this.ae, this.Re);
+    this.Me = this.Qe(this.ae, this.He);
   } catch (e) {
     if (!this.fe.notify(this, a, a)) throw e;
   } finally {
-    this.Re = this.ae;
+    this.He = this.ae;
     this.ue = false;
   }
 }
@@ -960,7 +960,7 @@ function trackedEffect(e, t) {
       }
     },
     undefined,
-    { ...t, lazy: true, pureWrite: true }
+    { ...t, lazy: true }
   );
   n.Me = undefined;
   n.ue = true;
@@ -973,8 +973,8 @@ GlobalQueue.K = recompute;
 GlobalQueue.U = disposeChildren;
 let L = false;
 let I = false;
-let H = false;
 let R = false;
+let H = false;
 let Q = false;
 let T = false;
 let M = null;
@@ -1001,24 +1001,24 @@ function releaseSnapshotScope(e) {
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.Ae;
+  let t = e.Ce;
   while (t) {
     if (t.qe) {
-      t = t.We;
+      t = t.Ee;
       continue;
     }
-    if (t.H) {
+    if (t.R) {
       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;
+        if (x.j > e.o) x.j = e.o;
         insertIntoHeap(e, x);
       }
     }
     releaseSubtree(t);
-    t = t.We;
+    t = t.Ee;
   }
 }
 function clearSnapshots() {
@@ -1034,16 +1034,16 @@ function clearSnapshots() {
 function recompute(t, n = false) {
   const i = t.oe;
   if (!n) {
-    if (t.ne && (!i || k) && k !== t.ne) W.initTransition(t.ne);
+    if (t.ne && (!i || k) && k !== t.ne) E.initTransition(t.ne);
     deleteFromHeap(t, t.m & o ? v : x);
     if (t.ne || i === y) disposeChildren(t);
     else {
       markDisposal(t);
       t.Ne = t.Le;
-      t.Ee = t.Ae;
+      t.je = t.Ce;
       t.Le = null;
-      t.Ae = null;
-      t.je = 0;
+      t.Ce = null;
+      t.We = 0;
     }
   }
   const s = !!(t.m & f);
@@ -1051,20 +1051,20 @@ function recompute(t, n = false) {
   const d = !!(t.de & c);
   const p = M;
   M = t;
-  t.Ce = null;
+  t.Ae = null;
   t.m = r;
   t.$ = P;
   let h = t.ce === g ? t.ae : t.ce;
   let S = t.o;
   let w = L;
-  let m = q;
+  let b = q;
   L = true;
   if (s) {
     const e = resolveLane(t);
     if (e) q = e;
   }
   try {
-    h = handleAsync(t, t.H(h));
+    h = handleAsync(t, t.R(h));
     clearStatus(t);
     const e = resolveLane(t);
     if (e) {
@@ -1093,17 +1093,17 @@ function recompute(t, n = false) {
     M = p;
   }
   if (!t.Y) {
-    const e = t.Ce;
-    let r = e !== null ? e.N : t.j;
+    const e = t.Ae;
+    let r = e !== null ? e.N : t.W;
     if (r !== null) {
       do {
         r = unlinkSubs(r);
       } while (r !== null);
       if (e !== null) e.N = null;
-      else t.j = null;
+      else t.W = null;
     }
     const f = u ? t.ae : t.ce === g ? t.ae : t.ce;
-    const l = !t.be || !t.be(f, h);
+    const l = !t.me || !t.me(f, h);
     if (l) {
       const e = u ? t.ae : undefined;
       if (n || (i && k !== t.ne) || s) t.ae = h;
@@ -1124,16 +1124,16 @@ function recompute(t, n = false) {
       }
     }
   }
-  q = m;
-  (!n || t.de & c) && !t.ne && !(k && t.we) && W.D.push(t);
+  q = b;
+  (!n || t.de & c) && !t.ne && !(k && t.we) && E.D.push(t);
   t.ne && i && k !== t.ne && runInTransition(t.ne, () => recompute(t));
 }
 function updateIfNecessary(r) {
   if (r.m & t) {
-    for (let e = r.j; e; e = e.N) {
+    for (let e = r.W; e; e = e.N) {
       const t = e.L;
       const i = t.I || t;
-      if (i.H) {
+      if (i.R) {
         updateIfNecessary(i);
       }
       if (r.m & n) {
@@ -1151,44 +1151,44 @@ function computed(t, n, r) {
   const s = {
     id: r?.id ?? (i ? M?.id : M?.id != null ? getNextChildId(M) : undefined),
     Ie: i || undefined,
-    be: r?.equals != null ? r.equals : isEqual,
+    me: 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,
+    fe: M?.fe ?? E,
+    Re: M?.Re ?? m,
+    We: 0,
+    R: t,
     ae: n,
     o: 0,
-    C: null,
+    A: null,
     h: undefined,
     p: null,
-    j: null,
-    Ce: null,
+    W: null,
+    Ae: null,
     O: null,
     ve: null,
     i: M,
-    We: null,
-    Ae: null,
+    Ee: null,
+    Ce: null,
     m: e,
     de: d,
     $: P,
     ce: g,
     Ne: null,
-    Ee: null,
-    me: null,
+    je: null,
+    be: null,
     ne: null
   };
   s.p = s;
   const o = M?.t ? M.u : M;
   if (M) {
-    const e = M.Ae;
+    const e = M.Ce;
     if (e === null) {
-      M.Ae = s;
+      M.Ce = s;
     } else {
-      s.We = e;
-      M.Ae = s;
+      s.Ee = e;
+      M.Ce = s;
     }
   }
   if (o) s.o = o.o + 1;
@@ -1204,7 +1204,7 @@ function computed(t, n, r) {
 }
 function signal(e, t, n = null) {
   const r = {
-    be: t?.equals != null ? t.equals : isEqual,
+    me: t?.equals != null ? t.equals : isEqual,
     Fe: !!t?.pureWrite,
     Pe: t?.unobserved,
     ae: e,
@@ -1212,10 +1212,10 @@ function signal(e, t, n = null) {
     ve: null,
     $: P,
     I: n,
-    A: n?.C || null,
+    C: n?.A || null,
     ce: g
   };
-  n && (n.C = r);
+  n && (n.A = r);
   if (F && !r.Fe) {
     r.ie = e === undefined ? S : e;
     V.add(r);
@@ -1235,8 +1235,14 @@ function optimisticComputed(e, t, n) {
 function isEqual(e, t) {
   return e === t;
 }
+let D = false;
+function setStrictRead(e) {
+  const t = D;
+  D = e;
+  return t;
+}
 function untrack(e) {
-  if (!L) return e();
+  if (!L && true) return e();
   L = false;
   try {
     return e();
@@ -1246,7 +1252,7 @@ function untrack(e) {
 }
 function read(e) {
   if (T) {
-    const t = getPendingValueComputed(e);
+    const t = getLatestValueComputed(e);
     const n = T;
     T = false;
     let r;
@@ -1268,27 +1274,27 @@ function read(e) {
     }
     return r;
   }
-  if (R) {
+  if (H) {
     const t = e.I || e;
     const n = getPendingSignal(t);
-    const r = R;
-    R = false;
+    const r = H;
+    H = false;
     if (read(n)) {
       Q = true;
     }
-    R = r;
+    H = r;
     return e.ae;
   }
   let t = M;
   if (t?.t) t = t.u;
-  if (H && e.H) recompute(e);
+  if (R && e.R) recompute(e);
   if (t && L) {
-    if (e.H && e.m & u) recompute(e);
+    if (e.R && e.m & u) recompute(e);
     link(e, t);
     const n = e.I || e;
-    if (n.H) {
+    if (n.R) {
       const r = e.m & o;
-      if (n.o >= (r ? v.W : x.W)) {
+      if (n.o >= (r ? v.j : x.j)) {
         markNode(t);
         markHeap(r ? v : x);
         updateIfNecessary(n);
@@ -1317,7 +1323,7 @@ function read(e) {
       throw n.Y;
     }
   }
-  if (e.H && e.de & a) {
+  if (e.R && e.de & a) {
     if (e.$ < P) {
       recompute(e, true);
       return read(e);
@@ -1335,35 +1341,35 @@ function read(e) {
   return !t || q !== null || e.ce === g || (I && e.ne && k !== e.ne) ? e.ae : e.ce;
 }
 function setSignal(e, t) {
-  if (e.ne && k !== e.ne) W.initTransition(e.ne);
-  const n = e.we && !A;
+  if (e.ne && k !== e.ne) E.initTransition(e.ne);
+  const n = e.we && !C;
   const r = n ? e.ae : e.ce === g ? e.ae : e.ce;
   if (typeof t === "function") t = t(r);
-  const i = !e.be || !e.be(r, t);
+  const i = !e.me || !e.me(r, t);
   if (!i) {
-    if (n && e.ce !== g && e.H) {
+    if (n && e.ce !== g && e.R) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = W.B.includes(e);
+    const n = E.B.includes(e);
     if (e.ne && n) {
-      W.initTransition(e.ne);
+      E.initTransition(e.ne);
     }
     if (e.ce === g) {
       e.ce = e.ae;
     }
     if (!n) {
-      W.B.push(e);
+      E.B.push(e);
     }
     e.Se = (e.Se || 0) + 1;
     const r = getOrCreateLane(e);
     e.re = r;
     e.ae = t;
   } else {
-    if (e.ce === g) W.D.push(e);
+    if (e.ce === g) E.D.push(e);
     e.ce = t;
   }
   updatePendingSignal(e);
@@ -1423,23 +1429,23 @@ function updatePendingSignal(e) {
           mergeLanes(t, e);
         }
       }
-      E.delete(n);
+      j.delete(n);
       n.re = undefined;
     }
   }
 }
-function getPendingValueComputed(e) {
+function getLatestValueComputed(e) {
   if (!e._e) {
     const t = T;
     T = false;
-    const n = R;
-    R = false;
+    const n = H;
+    H = false;
     const r = M;
     M = null;
     e._e = optimisticComputed(() => read(e));
     e._e.he = e;
     M = r;
-    R = n;
+    H = n;
     T = t;
   }
   return e._e;
@@ -1453,7 +1459,7 @@ function staleValues(e, t = true) {
     I = n;
   }
 }
-function pending(e) {
+function latest(e) {
   const t = T;
   T = true;
   try {
@@ -1463,9 +1469,9 @@ function pending(e) {
   }
 }
 function isPending(e) {
-  const t = R;
+  const t = H;
   const n = Q;
-  R = true;
+  H = true;
   Q = false;
   try {
     e();
@@ -1473,13 +1479,13 @@ function isPending(e) {
   } catch {
     return Q;
   } finally {
-    R = t;
+    H = t;
     Q = n;
   }
 }
 function refresh(e) {
-  let t = H;
-  H = true;
+  let t = R;
+  R = true;
   try {
     if (typeof e !== "function") {
       recompute(e[_]);
@@ -1487,14 +1493,14 @@ function refresh(e) {
     }
     return untrack(e);
   } finally {
-    H = t;
+    R = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return H;
+  return R;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1503,7 +1509,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.He[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Re[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1513,16 +1519,16 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.He = { ...n.He, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Re = { ...n.Re, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.He[e.id]);
+  return !isUndefined(t?.Re[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
 }
 function restoreTransition(e, t) {
-  W.initTransition(e);
+  E.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1531,7 +1537,7 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      W.initTransition();
+      E.initTransition();
       let s = k;
       s.ee.push(i);
       const done = (e, t) => {
@@ -1628,13 +1634,13 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   getOwner()
     ? createTrackedEffect(() => untrack(e))
-    : W.enqueue(h, () => {
+    : E.enqueue(h, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[K]?.[$] ?? e;
+  return e?.[z]?.[ee] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1646,16 +1652,16 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n, r) {
-  const i = t?.[K];
+  const i = t?.[z];
   if (!i) return;
-  const s = i[X];
-  const o = i[Y];
-  const u = i[Z];
-  let f = i[$];
+  const s = i[Y];
+  const o = i[Z];
+  const u = i[$];
+  let f = i[ee];
   if (e === s && !o && !u) return;
-  (i[ne] || se).set(e, i[z]);
-  i[X] = e;
-  i[Y] = undefined;
+  (i[re] || oe).set(e, i[U]);
+  i[Y] = e;
+  i[Z] = undefined;
   if (Array.isArray(s)) {
     let t = false;
     const l = getOverrideValue(s, o, f, "length", u);
@@ -1670,7 +1676,7 @@ function applyState(e, t, n, r) {
         applyState(e[d], wrap(y, i), n, r);
       }
       const w = new Array(e.length),
-        m = new Map();
+        b = new Map();
       for (
         p = l - 1, h = e.length - 1;
         p >= d &&
@@ -1683,59 +1689,59 @@ function applyState(e, t, n, r) {
       if (d > h || d > p) {
         for (a = d; a <= h; a++) {
           t = true;
-          i[$][a] && setSignal(i[$][a], wrap(e[a], i));
+          i[ee][a] && setSignal(i[ee][a], wrap(e[a], i));
         }
         for (; a < e.length; a++) {
           t = true;
           const s = wrap(w[a], i);
-          i[$][a] && setSignal(i[$][a], s);
+          i[ee][a] && setSignal(i[ee][a], s);
           applyState(e[a], s, n, r);
         }
-        t && i[$][B] && setSignal(i[$][B], void 0);
-        l !== e.length && i[$].length && setSignal(i[$].length, e.length);
+        t && i[ee][G] && setSignal(i[ee][G], void 0);
+        l !== e.length && i[ee].length && setSignal(i[ee].length, e.length);
         return;
       }
       g = new Array(h + 1);
       for (a = h; a >= d; a--) {
         y = e[a];
         S = y ? n(y) : y;
-        c = m.get(S);
+        c = b.get(S);
         g[a] = c === undefined ? -1 : c;
-        m.set(S, a);
+        b.set(S, a);
       }
       for (c = d; c <= p; c++) {
         y = getOverrideValue(s, o, f, c, u);
         S = y ? n(y) : y;
-        a = m.get(S);
+        a = b.get(S);
         if (a !== undefined && a !== -1) {
           w[a] = y;
           a = g[a];
-          m.set(S, a);
+          b.set(S, a);
         }
       }
       for (a = d; a < e.length; a++) {
         if (a in w) {
           const t = wrap(w[a], i);
-          i[$][a] && setSignal(i[$][a], t);
+          i[ee][a] && setSignal(i[ee][a], t);
           applyState(e[a], t, n, r);
-        } else i[$][a] && setSignal(i[$][a], wrap(e[a], i));
+        } else i[ee][a] && setSignal(i[ee][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[$][t] && setSignal(i[$][t], e[t]);
+        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[ee][t] && setSignal(i[ee][t], e[t]);
       }
     }
     if (l !== e.length) {
       t = true;
-      i[$].length && setSignal(i[$].length, e.length);
+      i[ee].length && setSignal(i[ee].length, e.length);
     }
-    t && i[$][B] && setSignal(i[$][B], void 0);
+    t && i[ee][G] && setSignal(i[ee][G], void 0);
     return;
   }
   if (f) {
-    const t = f[B];
+    const t = f[G];
     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];
@@ -1749,7 +1755,7 @@ function applyState(e, t, n, r) {
       } else applyState(h, wrap(p, i), n, r);
     }
   }
-  if ((f = i[ee])) {
+  if ((f = i[te])) {
     const t = Object.keys(f);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -1771,9 +1777,9 @@ function createProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[te] = wrapProjection;
-    e[ne] = i;
-    Object.defineProperty(e, re, {
+    e[ne] = wrapProjection;
+    e[re] = i;
+    Object.defineProperty(e, ie, {
       get() {
         return r;
       },
@@ -1782,15 +1788,15 @@ function createProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[K]?.[te] === wrapProjection) return e;
-    const t = createStoreProxy(e, fe, wrapper);
+    if (e[z]?.[ne] === wrapProjection) return e;
+    const t = createStoreProxy(e, le, wrapper);
     i.set(e, t);
     return t;
   };
   const s = wrapProjection(t);
   r = computed(() => {
     const t = getOwner();
-    storeSetter(new Proxy(s, D), r => {
+    storeSetter(new Proxy(s, B), r => {
       const i = handleAsync(t, e(r), e => {
         e !== r && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id", n?.all));
         setSignal(t, undefined);
@@ -1804,7 +1810,7 @@ function createProjectionInternal(e, t = {}, n) {
 function createProjection(e, t = {}, n) {
   return createProjectionInternal(e, t, n).store;
 }
-const D = {
+const B = {
   get(e, t) {
     let n;
     setWriteOverride(true);
@@ -1815,7 +1821,7 @@ const D = {
       setWriteOverride(false);
       setProjectionWriteActive(false);
     }
-    return typeof n === "object" && n !== null ? new Proxy(n, D) : n;
+    return typeof n === "object" && n !== null ? new Proxy(n, B) : n;
   },
   set(e, t, n) {
     setWriteOverride(true);
@@ -1840,46 +1846,46 @@ const D = {
     return true;
   }
 };
-const B = Symbol(0),
-  G = Symbol(0),
+const 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) {
+  U = Symbol(0),
+  J = Symbol(0);
+const X = new WeakMap();
+const Y = "v",
+  Z = "o",
+  $ = "x",
+  ee = "n",
+  te = "h",
+  ne = "w",
+  re = "l",
+  ie = "f",
+  se = "p";
+function createStoreProxy(e, t = le, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
     r.v = e;
   } else r = { v: e };
   n && n(r);
-  return (r[z] = new Proxy(r, t));
+  return (r[U] = new Proxy(r, t));
 }
-const se = new WeakMap();
+const oe = new WeakMap();
 function wrap(e, t) {
-  if (t?.[te]) return t[te](e, t);
-  let n = e[z] || se.get(e);
-  if (!n) se.set(e, (n = createStoreProxy(e)));
+  if (t?.[ne]) return t[ne](e, t);
+  let n = e[U] || oe.get(e);
+  if (!n) oe.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
   return e != null && typeof e === "object" && !Object.isFrozen(e);
 }
-let oe = false;
+let ue = false;
 function setWriteOverride(e) {
-  oe = e;
+  ue = e;
 }
 function writeOnly(e) {
-  return oe || !!ue?.has(e);
+  return ue || !!fe?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -1906,8 +1912,8 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
   }
   return (e[t] = u);
 }
-function trackSelf(e, t = B) {
-  getObserver() && read(getNode(getNodes(e, $), t, undefined, e[re], false, e[ie]));
+function trackSelf(e, t = G) {
+  getObserver() && read(getNode(getNodes(e, ee), t, undefined, e[ie], false, e[se]));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -1915,7 +1921,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] !== U) i.add(e);
+    if (t[e] !== J) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -1923,70 +1929,70 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === U) return void 0;
+    if (r[n] === J) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let ue = null;
-const fe = {
+let fe = null;
+const le = {
   get(e, t, n) {
-    if (t === K) return e;
-    if (t === z) return n;
-    if (t === _) return e[re];
-    if (t === B || t === G) {
+    if (t === z) return e;
+    if (t === U) return n;
+    if (t === _) return e[ie];
+    if (t === G || t === K) {
       trackSelf(e, t);
       return n;
     }
-    const r = getNodes(e, $);
+    const r = getNodes(e, ee);
     const i = r[t];
-    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];
+    const s = e[$] && t in e[$];
+    const o = s || (e[Z] && t in e[Z]);
+    const u = !!e[Y][z];
+    const f = s ? e[$] : e[Z] && t in e[Z] ? e[Z] : e[Y];
     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.ce !== g ? (i.we ? i.ae : i.ce) : i.ae) : f[t];
-      n === U && (n = undefined);
+      n === J && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      ue?.add(r);
+      fe?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === U && (l = undefined);
+    l === J && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[X]) && (t = Object.getPrototypeOf(e[X])) && t !== Object.prototype
+        return !Array.isArray(e[Y]) && (t = Object.getPrototypeOf(e[Y])) && t !== Object.prototype
           ? l.bind(f)
           : l;
       } else if (getObserver()) {
-        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[re], isEqual, e[ie], e[w]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[ie], isEqual, e[se], e[w]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    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]));
+    if (t === U || t === G || t === "__proto__") return true;
+    const n = e[$] && t in e[$] ? e[$][t] !== J : e[Z] && t in e[Z] ? e[Z][t] !== J : t in e[Y];
+    getObserver() && read(getNode(getNodes(e, te), t, n, e[ie], isEqual, e[se]));
     return n;
   },
   set(e, t, n) {
-    const r = e[z];
+    const r = e[U];
     if (writeOnly(r)) {
-      if (e[ie]) {
-        const t = e[re];
+      if (e[se]) {
+        const t = e[ie];
         if (t?.ne) {
-          W.initTransition(t.ne);
+          E.initTransition(t.ne);
         }
       }
       untrack(() => {
-        const i = e[X];
+        const i = e[Y];
         const s = i[t];
         if (F && typeof t !== "symbol") {
           if (!e[w]) {
@@ -1997,23 +2003,23 @@ const fe = {
             e[w][t] = s;
           }
         }
-        const o = e[ie] && !A;
-        const u = o ? Z : Y;
+        const o = e[se] && !C;
+        const u = o ? $ : Z;
         if (o) trackOptimisticStore(r);
-        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;
+        const f = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : s;
+        const l = n?.[z]?.[Y] ?? n;
         if (f === l) return true;
-        const c = e[Z]?.length || e[Y]?.length || i.length;
+        const c = e[$]?.length || e[Z]?.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 = J.get(f);
-          e && (e instanceof Set ? e.delete(r) : J.delete(f));
+          const e = X.get(f);
+          e && (e instanceof Set ? e.delete(r) : X.delete(f));
         }
-        if (recursivelyNotify(r, se) && a) recursivelyAddParent(l, r);
-        e[ee]?.[t] && setSignal(e[ee][t], true);
-        const d = getNodes(e, $);
+        if (recursivelyNotify(r, oe) && a) recursivelyAddParent(l, r);
+        e[te]?.[t] && setSignal(e[te][t], true);
+        const d = getNodes(e, ee);
         d[t] && setSignal(d[t], () => (a ? wrap(l, e) : l));
         if (Array.isArray(i)) {
           if (t === "length") {
@@ -2023,44 +2029,44 @@ const fe = {
             if (e > c) d.length && setSignal(d.length, e);
           }
         }
-        d[B] && setSignal(d[B], undefined);
+        d[G] && setSignal(d[G], undefined);
       });
     }
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[Z]?.[t] === U;
-    const r = e[Y]?.[t] === U;
-    if (writeOnly(e[z]) && !n && !r) {
+    const n = e[$]?.[t] === J;
+    const r = e[Z]?.[t] === J;
+    if (writeOnly(e[U]) && !n && !r) {
       untrack(() => {
-        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;
+        const n = e[se] && !C;
+        const r = n ? $ : Z;
+        if (n) trackOptimisticStore(e[U]);
+        const i = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : e[Y][t];
+        if (t in e[Y] || (e[Z] && t in e[Z])) {
+          (e[r] || (e[r] = Object.create(null)))[t] = J;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
         if (isWrappable(i)) {
-          const t = J.get(i);
-          t && (t instanceof Set ? t.delete(e) : J.delete(i));
+          const t = X.get(i);
+          t && (t instanceof Set ? t.delete(e) : X.delete(i));
         }
-        if (e[ee]?.[t]) setSignal(e[ee][t], false);
-        const s = getNodes(e, $);
+        if (e[te]?.[t]) setSignal(e[te][t], false);
+        const s = getNodes(e, ee);
         s[t] && setSignal(s[t], undefined);
-        s[B] && setSignal(s[B], undefined);
+        s[G] && setSignal(s[G], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[X], e[Y], false);
-    if (e[Z]) {
+    let t = getKeys(e[Y], e[Z], false);
+    if (e[$]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[Z])) {
-        if (e[Z][t] !== U) n.add(t);
+      for (const t of Reflect.ownKeys(e[$])) {
+        if (e[$][t] !== J) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -2068,25 +2074,25 @@ const fe = {
     return t;
   },
   getOwnPropertyDescriptor(e, 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 (t === U) return { value: e[U], writable: true, configurable: true };
+    if (e[$] && t in e[$]) {
+      if (e[$][t] === J) return undefined;
+      const n = getPropertyDescriptor(e[Y], e[Z], t);
       if (n) {
-        return { ...n, value: e[Z][t] };
+        return { ...n, value: e[$][t] };
       }
-      return { value: e[Z][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[$][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[X], e[Y], t);
+    return getPropertyDescriptor(e[Y], e[Z], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[X]);
+    return Object.getPrototypeOf(e[Y]);
   }
 };
 function storeSetter(e, t) {
-  const n = ue;
-  ue = new Set();
-  ue.add(e);
+  const n = fe;
+  fe = new Set();
+  fe.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2102,8 +2108,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    ue.clear();
-    ue = n;
+    fe.clear();
+    fe = n;
   }
 }
 function createStore(e, t, n) {
@@ -2112,17 +2118,17 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function recursivelyNotify(e, t) {
-  let n = e[K] || t?.get(e)?.[K];
+  let n = e[z] || t?.get(e)?.[z];
   let r = false;
   if (n) {
-    const e = getNodes(n, $)[G];
+    const e = getNodes(n, ee)[K];
     if (e) {
       setSignal(e, undefined);
       r = true;
     }
-    t = n[ne] || t;
+    t = n[re] || t;
   }
-  const i = J.get(n?.[X] || e);
+  const i = X.get(n?.[Y] || e);
   if (!i) return r;
   if (i instanceof Set) {
     for (let e of i) r = recursivelyNotify(e, t) || r;
@@ -2131,16 +2137,16 @@ function recursivelyNotify(e, t) {
 }
 function recursivelyAddParent(e, t) {
   let n;
-  const r = e[K];
+  const r = e[z];
   if (r) {
-    n = r[Y];
-    e = r[X];
+    n = r[Z];
+    e = r[Y];
   }
   if (t) {
-    let n = J.get(e);
-    if (!n) J.set(e, t);
+    let n = X.get(e);
+    if (!n) X.set(e, t);
     else if (n !== t) {
-      if (!(n instanceof Set)) J.set(e, (n = new Set([n])));
+      if (!(n instanceof Set)) X.set(e, (n = new Set([n])));
       else if (n.has(t)) return;
       n.add(t);
     } else return;
@@ -2162,7 +2168,7 @@ function recursivelyAddParent(e, t) {
 }
 function deep(e) {
   recursivelyAddParent(e);
-  return e[G];
+  return e[K];
 }
 function createOptimisticStore(e, t, n) {
   GlobalQueue.J ||= clearOptimisticStore;
@@ -2173,39 +2179,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[K];
-  if (!t || !t[Z]) return;
-  const n = t[Z];
-  const r = t[$];
+  const t = e[z];
+  if (!t || !t[$]) return;
+  const n = t[$];
+  const r = t[ee];
   setProjectionWriteActive(true);
   try {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
           r[e].re = undefined;
-          const n = t[Y] && e in t[Y] ? t[Y][e] : t[X][e];
-          const i = n === U ? undefined : n;
+          const n = t[Z] && e in t[Z] ? t[Z][e] : t[Y][e];
+          const i = n === J ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
-      if (r[B]) {
-        r[B].re = undefined;
-        setSignal(r[B], undefined);
+      if (r[G]) {
+        r[G].re = undefined;
+        setSignal(r[G], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[Z];
+  delete t[$];
 }
 function createOptimisticProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[te] = wrapProjection;
-    e[ne] = i;
-    e[ie] = true;
-    Object.defineProperty(e, re, {
+    e[ne] = wrapProjection;
+    e[re] = i;
+    e[se] = true;
+    Object.defineProperty(e, ie, {
       get() {
         return r;
       },
@@ -2214,8 +2220,8 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[K]?.[te] === wrapProjection) return e;
-    const t = createStoreProxy(e, fe, wrapper);
+    if (e[z]?.[ne] === wrapProjection) return e;
+    const t = createStoreProxy(e, le, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2225,7 +2231,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       const t = getOwner();
       setProjectionWriteActive(true);
       try {
-        storeSetter(new Proxy(s, D), r => {
+        storeSetter(new Proxy(s, B), r => {
           const i = handleAsync(t, e(r), e => {
             setProjectionWriteActive(true);
             try {
@@ -2244,17 +2250,79 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   }
   return { store: s, node: r };
 }
+const ce = Symbol(0);
+function updatePath(e, t, n = 0) {
+  let r,
+    i = e;
+  if (n < t.length - 1) {
+    r = t[n];
+    const s = typeof r;
+    const o = Array.isArray(e);
+    if (Array.isArray(r)) {
+      for (let i = 0; i < r.length; i++) {
+        t[n] = r[i];
+        updatePath(e, t, n);
+      }
+      t[n] = r;
+      return;
+    } else if (o && s === "function") {
+      for (let i = 0; i < e.length; i++) {
+        if (r(e[i], i)) {
+          t[n] = i;
+          updatePath(e, t, n);
+        }
+      }
+      t[n] = r;
+      return;
+    } else if (o && s === "object") {
+      const { from: i = 0, to: s = e.length - 1, by: o = 1 } = r;
+      for (let r = i; r <= s; r += o) {
+        t[n] = r;
+        updatePath(e, t, n);
+      }
+      t[n] = r;
+      return;
+    } else if (n < t.length - 2) {
+      updatePath(e[r], t, n + 1);
+      return;
+    }
+    i = e[r];
+  }
+  let s = t[t.length - 1];
+  if (typeof s === "function") {
+    s = s(i);
+    if (s === i) return;
+  }
+  if (r === undefined && s == undefined) return;
+  if (s === ce) {
+    delete e[r];
+  } else if (r === undefined || (isWrappable(i) && isWrappable(s) && !Array.isArray(s))) {
+    const t = r !== undefined ? e[r] : e;
+    const n = Object.keys(s);
+    for (let e = 0; e < n.length; e++) t[n[e]] = s[n[e]];
+  } else {
+    e[r] = s;
+  }
+}
+const ae = Object.assign(
+  function storePath(...e) {
+    return t => {
+      updatePath(t, e);
+    };
+  },
+  { DELETE: ce }
+);
 function snapshot(e, t, n) {
   let r, i, s, o, u, f;
   if (!isWrappable(e)) return e;
   if (t && t.has(e)) return t.get(e);
   if (!t) t = new Map();
-  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;
+  if ((r = e[z] || n?.get(e)?.[z])) {
+    s = r[Z];
+    i = Array.isArray(r[Y]);
+    t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[Y]))) : r[Y]);
+    e = r[Y];
+    n = oe;
   } else {
     i = Array.isArray(e);
     t.set(e, e);
@@ -2263,7 +2331,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 === U) continue;
+      if (f === J) continue;
       if ((u = snapshot(f, t, n)) !== f || o) {
         if (!o) t.set(e, (o = [...e]));
         o[i] = u;
@@ -2290,13 +2358,13 @@ function snapshot(e, t, n) {
 function trueFn() {
   return true;
 }
-const le = {
+const de = {
   get(e, t, n) {
-    if (t === z) return n;
+    if (t === U) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === z) return true;
+    if (t === U) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2319,23 +2387,23 @@ const le = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const ce = Symbol(0);
+const pe = 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 && z in i);
-    const s = !!i && i[ce];
+    t = t || (!!i && U in i);
+    const s = !!i && i[pe];
     if (s) n.push(...s);
     else n.push(typeof i === "function" ? ((t = true), createMemo(i)) : i);
   }
-  if (m && t) {
+  if (b && t) {
     return new Proxy(
       {
         get(e) {
-          if (e === ce) return n;
+          if (e === pe) return n;
           for (let t = n.length - 1; t >= 0; t--) {
             const r = resolveSource(n[t]);
             if (e in r) return r[e];
@@ -2353,7 +2421,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      le
+      de
     );
   }
   const r = Object.create(null);
@@ -2385,12 +2453,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[ce] = n;
+  o[pe] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (m && z in e) {
+  if (b && U in e) {
     return new Proxy(
       {
         get(t) {
@@ -2403,7 +2471,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      le
+      de
     );
   }
   const r = {};
@@ -2419,34 +2487,36 @@ function omit(e, ...t) {
 }
 function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
+  const i = t.length > 1;
+  const s = t;
   return createMemo(
     updateKeyedMap.bind({
       De: createOwner(),
       Be: 0,
       Ge: e,
       Ke: [],
-      ze: t,
+      ze: s,
       Ue: [],
       Je: [],
       Xe: r,
       Ye: r || n?.keyed === false ? [] : undefined,
-      Ze: t.length > 1 ? [] : undefined,
+      Ze: i ? [] : undefined,
       $e: n?.fallback
     })
   );
 }
-const ae = { pureWrite: true };
+const he = { pureWrite: true };
 function updateKeyedMap() {
   const e = this.Ge() || [],
     t = e.length;
-  e[B];
+  e[G];
   runWithOwner(this.De, () => {
     let n,
       r,
       i = this.Ye
         ? () => {
-            this.Ye[r] = signal(e[r], ae);
-            this.Ze && (this.Ze[r] = signal(r, ae));
+            this.Ye[r] = signal(e[r], he);
+            this.Ze && (this.Ze[r] = signal(r, he));
             return this.ze(
               read.bind(null, this.Ye[r]),
               this.Ze ? read.bind(null, this.Ze[r]) : undefined
@@ -2455,7 +2525,7 @@ function updateKeyedMap() {
         : this.Ze
           ? () => {
               const t = e[r];
-              this.Ze[r] = signal(r, ae);
+              this.Ze[r] = signal(r, he);
               return this.ze(() => t, read.bind(null, this.Ze[r]));
             }
           : () => {
@@ -2559,12 +2629,13 @@ function updateKeyedMap() {
   return this.Ue;
 }
 function repeat(e, t, n) {
+  const r = t;
   return updateRepeat.bind({
     De: createOwner(),
     Be: 0,
     et: 0,
     tt: e,
-    ze: t,
+    ze: r,
     Je: [],
     Ue: [],
     nt: n?.from,
@@ -2754,13 +2825,13 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = z;
-exports.$TARGET = K;
-exports.$TRACK = B;
+exports.$PROXY = U;
+exports.$TARGET = z;
+exports.$TRACK = G;
 exports.ContextNotFoundError = ContextNotFoundError;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
-exports.SUPPORTS_PROXY = m;
+exports.SUPPORTS_PROXY = b;
 exports.action = action;
 exports.clearSnapshots = clearSnapshots;
 exports.createContext = createContext;
@@ -2790,6 +2861,7 @@ exports.isEqual = isEqual;
 exports.isPending = isPending;
 exports.isRefreshing = isRefreshing;
 exports.isWrappable = isWrappable;
+exports.latest = latest;
 exports.mapArray = mapArray;
 exports.markSnapshotScope = markSnapshotScope;
 exports.merge = merge;
@@ -2797,7 +2869,6 @@ exports.omit = omit;
 exports.onCleanup = onCleanup;
 exports.onSettled = onSettled;
 exports.peekNextChildId = peekNextChildId;
-exports.pending = pending;
 exports.reconcile = reconcile;
 exports.refresh = refresh;
 exports.releaseSnapshotScope = releaseSnapshotScope;
@@ -2806,5 +2877,7 @@ exports.resolve = resolve;
 exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
+exports.setStrictRead = setStrictRead;
 exports.snapshot = snapshot;
+exports.storePath = ae;
 exports.untrack = untrack;