@solidjs/signals 0.10.8 → 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,7 +129,7 @@ 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.R && r.o >= n) n = r.o + 1;
@@ -142,14 +142,14 @@ 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) {
+  for (const t of W) {
     if (t.H || t.T.size > 0) continue;
     const n = t.M[e - 1];
     if (n.length) {
@@ -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) {
@@ -389,7 +389,7 @@ function finalizePureQueue(e = null, t = false) {
       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,7 +410,7 @@ 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.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,18 +480,18 @@ 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: [[], []], H: null, ne: k, ye: r };
-  E.set(e, t);
-  j.add(t);
+  j.set(e, t);
+  W.add(t);
   e.ge = e.Se || 0;
   return t;
 }
@@ -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;
 }
@@ -529,7 +529,7 @@ function assignOrMergeLane(e, 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,21 +546,21 @@ 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);
@@ -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);
       }
     }
@@ -717,37 +717,37 @@ function unlinkSubs(e) {
 }
 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) {
@@ -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,
-    Re: t?.Re || 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;
@@ -960,7 +960,7 @@ function trackedEffect(e, t) {
       }
     },
     undefined,
-    { ...t, lazy: true, pureWrite: true }
+    { ...t, lazy: true }
   );
   n.Me = undefined;
   n.ue = true;
@@ -1001,10 +1001,10 @@ 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.R) {
@@ -1013,12 +1013,12 @@ function releaseSubtree(e) {
       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,13 +1051,13 @@ 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);
@@ -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,13 +1124,13 @@ 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.R) {
@@ -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,
-    Re: M?.Re ?? b,
-    je: 0,
+    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);
@@ -1252,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;
@@ -1294,7 +1294,7 @@ function read(e) {
     const n = e.I || e;
     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);
@@ -1341,11 +1341,11 @@ 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.R) {
       insertSubs(e, true);
@@ -1354,22 +1354,22 @@ function setSignal(e, t) {
     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);
@@ -1429,12 +1429,12 @@ 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;
@@ -1459,7 +1459,7 @@ function staleValues(e, t = true) {
     I = n;
   }
 }
-function pending(e) {
+function latest(e) {
   const t = T;
   T = true;
   try {
@@ -1528,7 +1528,7 @@ function isUndefined(e) {
   return typeof e === "undefined";
 }
 function restoreTransition(e, t) {
-  W.initTransition(e);
+  E.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1537,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) => {
@@ -1634,7 +1634,7 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   getOwner()
     ? createTrackedEffect(() => untrack(e))
-    : W.enqueue(h, () => {
+    : E.enqueue(h, () => {
         const t = e();
         t?.();
       });
@@ -1676,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 &&
@@ -1705,18 +1705,18 @@ function applyState(e, t, n, r) {
       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++) {
@@ -1988,7 +1988,7 @@ const le = {
       if (e[se]) {
         const t = e[ie];
         if (t?.ne) {
-          W.initTransition(t.ne);
+          E.initTransition(t.ne);
         }
       }
       untrack(() => {
@@ -2003,7 +2003,7 @@ const le = {
             e[w][t] = s;
           }
         }
-        const o = e[se] && !A;
+        const o = e[se] && !C;
         const u = o ? $ : Z;
         if (o) trackOptimisticStore(r);
         const f = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : s;
@@ -2039,7 +2039,7 @@ const le = {
     const r = e[Z]?.[t] === J;
     if (writeOnly(e[U]) && !n && !r) {
       untrack(() => {
-        const n = e[se] && !A;
+        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];
@@ -2250,6 +2250,68 @@ 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;
@@ -2296,7 +2358,7 @@ function snapshot(e, t, n) {
 function trueFn() {
   return true;
 }
-const ce = {
+const de = {
   get(e, t, n) {
     if (t === U) return n;
     return e.get(t);
@@ -2325,7 +2387,7 @@ const ce = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const ae = Symbol(0);
+const pe = Symbol(0);
 function merge(...e) {
   if (e.length === 1 && typeof e[0] !== "function") return e[0];
   let t = false;
@@ -2333,15 +2395,15 @@ function merge(...e) {
   for (let r = 0; r < e.length; r++) {
     const i = e[r];
     t = t || (!!i && U in i);
-    const s = !!i && i[ae];
+    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 === ae) 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];
@@ -2359,7 +2421,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      ce
+      de
     );
   }
   const r = Object.create(null);
@@ -2391,12 +2453,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[ae] = n;
+  o[pe] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (m && U in e) {
+  if (b && U in e) {
     return new Proxy(
       {
         get(t) {
@@ -2409,7 +2471,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      ce
+      de
     );
   }
   const r = {};
@@ -2443,7 +2505,7 @@ function mapArray(e, t, n) {
     })
   );
 }
-const de = { pureWrite: true };
+const he = { pureWrite: true };
 function updateKeyedMap() {
   const e = this.Ge() || [],
     t = e.length;
@@ -2453,8 +2515,8 @@ function updateKeyedMap() {
       r,
       i = this.Ye
         ? () => {
-            this.Ye[r] = signal(e[r], de);
-            this.Ze && (this.Ze[r] = signal(r, de));
+            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
@@ -2463,7 +2525,7 @@ function updateKeyedMap() {
         : this.Ze
           ? () => {
               const t = e[r];
-              this.Ze[r] = signal(r, de);
+              this.Ze[r] = signal(r, he);
               return this.ze(() => t, read.bind(null, this.Ze[r]));
             }
           : () => {
@@ -2769,7 +2831,7 @@ 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;
@@ -2799,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;
@@ -2806,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;
@@ -2817,4 +2879,5 @@ exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
 exports.setStrictRead = setStrictRead;
 exports.snapshot = snapshot;
+exports.storePath = ae;
 exports.untrack = untrack;