@solidjs/signals 0.10.8 → 0.11.1

package/dist/node.cjs

@@ -33,18 +33,19 @@ const o = 1 << 5;
 const u = 1 << 6;
 const f = 1 << 7;
 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 c = 1 << 9;
+const a = 1 << 0;
+const d = 1 << 1;
+const p = 1 << 2;
+const h = 1;
+const y = 2;
+const g = 3;
 const S = {};
-const w = "sp";
-const m = typeof Proxy === "function";
-const b = {};
-const _ = Symbol("refresh");
+const w = {};
+const m = "sp";
+const b = typeof Proxy === "function";
+const _ = {};
+const O = 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;
@@ -106,8 +107,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 +117,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 +130,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;
@@ -141,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 };
-let P = 0;
-let k = null;
+const x = new Set();
+const v = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
+const P = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
+let k = 0;
+let A = null;
 let C = false;
-let A = false;
+let E = false;
 function runLaneEffects(e) {
-  for (const t of j) {
+  for (const t of N) {
     if (t.H || t.T.size > 0) continue;
     const n = t.M[e - 1];
     if (n.length) {
@@ -159,18 +160,18 @@ function runLaneEffects(e) {
   }
 }
 function setProjectionWriteActive(e) {
-  A = e;
+  E = e;
 }
 function schedule() {
   if (C) return;
   C = true;
-  if (!W.q) queueMicrotask(flush);
+  if (!j.q) queueMicrotask(flush);
 }
 class Queue {
   i = null;
   F = [[], []];
   V = [];
-  created = P;
+  created = k;
   addChild(e) {
     this.V.push(e);
     e.i = this;
@@ -196,8 +197,8 @@ class Queue {
   }
   enqueue(e, t) {
     if (e) {
-      if (q) {
-        const n = findLane(q);
+      if (F) {
+        const n = findLane(F);
         n.M[e - 1].push(t);
       } else {
         this.F[e - 1].push(t);
@@ -241,52 +242,52 @@ class GlobalQueue extends Queue {
     if (this.q) return;
     this.q = true;
     try {
-      runHeap(x, GlobalQueue.K);
-      if (k) {
-        const e = transitionComplete(k);
+      runHeap(v, GlobalQueue.K);
+      if (A) {
+        const e = transitionComplete(A);
         if (!e) {
-          let e = k;
-          runHeap(v, GlobalQueue.K);
+          let e = A;
+          runHeap(P, GlobalQueue.K);
           this.D = [];
           this.B = [];
           this.G = new Set();
-          runLaneEffects(p);
           runLaneEffects(h);
-          this.stashQueues(k.X);
-          P++;
-          C = x.S >= x.W;
-          reassignPendingTransition(k.D);
-          k = null;
+          runLaneEffects(y);
+          this.stashQueues(A.X);
+          k++;
+          C = v.S >= v.j;
+          reassignPendingTransition(A.D);
+          A = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.D !== k.D && this.D.push(...k.D);
-        this.restoreQueues(k.X);
-        O.delete(k);
-        const t = k;
-        k = null;
+        this.D !== A.D && this.D.push(...A.D);
+        this.restoreQueues(A.X);
+        x.delete(A);
+        const t = A;
+        A = null;
         reassignPendingTransition(this.D);
         finalizePureQueue(t);
       } else {
-        if (O.size) runHeap(v, GlobalQueue.K);
+        if (x.size) runHeap(P, GlobalQueue.K);
         finalizePureQueue();
       }
-      P++;
-      C = x.S >= x.W;
-      runLaneEffects(p);
-      this.run(p);
+      k++;
+      C = v.S >= v.j;
       runLaneEffects(h);
       this.run(h);
+      runLaneEffects(y);
+      this.run(y);
     } finally {
       this.q = false;
     }
   }
   notify(e, t, n, r) {
-    if (t & c) {
-      if (n & c) {
+    if (t & a) {
+      if (n & a) {
         const t = r !== undefined ? r : e.Y;
-        if (k && t && !k.Z.includes(t.source)) {
-          k.Z.push(t.source);
+        if (A && t && !A.Z.includes(t.source)) {
+          A.Z.push(t.source);
           schedule();
         }
       }
@@ -296,11 +297,11 @@ class GlobalQueue extends Queue {
   }
   initTransition(e) {
     if (e) e = currentTransition(e);
-    if (e && e === k) return;
-    if (!e && k && k.$ === P) return;
-    if (!k) {
-      k = e ?? {
-        $: P,
+    if (e && e === A) return;
+    if (!e && A && A.$ === k) return;
+    if (!A) {
+      A = e ?? {
+        $: k,
         D: [],
         Z: [],
         B: [],
@@ -310,42 +311,42 @@ class GlobalQueue extends Queue {
         te: false
       };
     } else if (e) {
-      const t = k;
+      const t = A;
       t.te = e;
       e.ee.push(...t.ee);
-      for (const n of j) {
+      for (const n of N) {
         if (n.ne === t) n.ne = e;
       }
       e.B.push(...t.B);
       for (const n of t.G) {
         e.G.add(n);
       }
-      O.delete(t);
-      k = e;
+      x.delete(t);
+      A = e;
     }
-    O.add(k);
-    k.$ = P;
+    x.add(A);
+    A.$ = k;
     for (let e = 0; e < this.D.length; e++) {
       const t = this.D[e];
-      t.ne = k;
-      k.D.push(t);
+      t.ne = A;
+      A.D.push(t);
     }
-    this.D = k.D;
+    this.D = A.D;
     for (let e = 0; e < this.B.length; e++) {
       const t = this.B[e];
-      t.ne = k;
-      k.B.push(t);
+      t.ne = A;
+      A.B.push(t);
     }
-    this.B = k.B;
-    for (const e of j) {
-      if (!e.ne) e.ne = k;
+    this.B = A.B;
+    for (const e of N) {
+      if (!e.ne) e.ne = A;
     }
-    for (const e of this.G) k.G.add(e);
-    this.G = k.G;
+    for (const e of this.G) A.G.add(e);
+    this.G = A.G;
   }
 }
 function insertSubs(e, t = false) {
-  const n = e.re || q;
+  const n = e.re || F;
   const r = e.ie !== undefined;
   for (let i = e.O; i !== null; i = i.P) {
     if (r && i.k.se) {
@@ -360,49 +361,49 @@ function insertSubs(e, t = false) {
       i.k.re = undefined;
     }
     const e = i.k;
-    if (e.oe === y) {
+    if (e.oe === g) {
       if (!e.ue) {
         e.ue = true;
-        e.fe.enqueue(h, e.le);
+        e.fe.enqueue(y, e.le);
       }
       continue;
     }
-    const s = i.k.m & o ? v : x;
-    if (s.W > i.k.o) s.W = i.k.o;
+    const s = i.k.m & o ? P : v;
+    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(j);
+  if (v.S >= v.j) runHeap(v, GlobalQueue.K);
   if (n) {
-    const t = W.D;
+    const t = j.D;
     for (let e = 0; e < t.length; e++) {
       const n = t[e];
-      if (n.ce !== g) {
+      if (n.ce !== S) {
         n.ae = n.ce;
-        n.ce = g;
-        if (n.oe && n.oe !== y) n.ue = true;
+        n.ce = S;
+        if (n.oe && n.oe !== g) n.ue = true;
       }
-      n.de &= ~d;
+      n.de &= ~p;
       if (n.R) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
-    const n = e ? e.B : W.B;
+    const n = e ? e.B : j.B;
     for (let e = 0; e < n.length; e++) {
       const t = n[e];
       const r = t.ce;
       t.re = undefined;
-      if (r !== g && t.ae !== r) {
+      if (r !== S && t.ae !== r) {
         t.ae = r;
         insertSubs(t, true);
       }
-      t.ce = g;
+      t.ce = S;
       t.ne = null;
     }
     n.length = 0;
-    const r = e ? e.G : W.G;
+    const r = e ? e.G : j.G;
     if (GlobalQueue.J && r.size) {
       for (const e of r) {
         GlobalQueue.J(e);
@@ -410,19 +411,19 @@ function finalizePureQueue(e = null, t = false) {
       r.clear();
       schedule();
     }
-    for (const t of j) {
+    for (const t of N) {
       const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
       if (!t.H) {
-        if (t.M[0].length) runQueue(t.M[0], p);
-        if (t.M[1].length) runQueue(t.M[1], h);
+        if (t.M[0].length) runQueue(t.M[0], h);
+        if (t.M[1].length) runQueue(t.M[1], y);
       }
       if (t.pe.re === t) t.pe.re = undefined;
       t.T.clear();
       t.M[0].length = 0;
       t.M[1].length = 0;
-      j.delete(t);
-      E.delete(t.pe);
+      N.delete(t);
+      W.delete(t.pe);
     }
   }
 }
@@ -433,18 +434,18 @@ function checkBoundaryChildren(e) {
   }
 }
 function trackOptimisticStore(e) {
-  W.G.add(e);
+  j.G.add(e);
   schedule();
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].ne = k;
+    e[t].ne = A;
   }
 }
-const W = new GlobalQueue();
+const j = new GlobalQueue();
 function flush() {
   while (C) {
-    W.flush();
+    j.flush();
   }
 }
 function runQueue(e, t) {
@@ -456,7 +457,7 @@ function transitionComplete(e) {
   let t = true;
   for (let n = 0; n < e.Z.length; n++) {
     const r = e.Z[n];
-    if (r.de & c && r.Y?.source === r) {
+    if (r.de & a && r.Y?.source === r) {
       t = false;
       break;
     }
@@ -469,29 +470,29 @@ function currentTransition(e) {
   return e;
 }
 function setActiveTransition(e) {
-  k = e;
+  A = e;
 }
 function runInTransition(e, t) {
-  const n = k;
+  const n = A;
   try {
-    k = currentTransition(e);
+    A = currentTransition(e);
     return t();
   } finally {
-    k = n;
+    A = n;
   }
 }
-const E = new WeakMap();
-const j = new Set();
+const W = new WeakMap();
+const N = new Set();
 function getOrCreateLane(e) {
-  let t = E.get(e);
+  let t = W.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);
+  t = { pe: e, T: new Set(), M: [[], []], H: null, ne: A, ye: r };
+  W.set(e, t);
+  N.add(t);
   e.ge = e.Se || 0;
   return t;
 }
@@ -513,12 +514,12 @@ function resolveLane(e) {
   const t = e.re;
   if (!t) return undefined;
   const n = findLane(t);
-  if (j.has(n)) return n;
+  if (N.has(n)) return n;
   e.re = undefined;
   return undefined;
 }
 function hasActiveOverride(e) {
-  return !!(e.we && e.ce !== g);
+  return !!(e.we && e.ce !== S);
 }
 function assignOrMergeLane(e, t) {
   const n = findLane(t);
@@ -529,7 +530,7 @@ function assignOrMergeLane(e, t) {
       return;
     }
     const i = findLane(r);
-    if (j.has(i)) {
+    if (N.has(i)) {
       if (i !== n && !hasActiveOverride(e)) {
         if (n.ye && findLane(n.ye) === i) {
           e.re = t;
@@ -553,32 +554,32 @@ function handleAsync(e, t, r) {
   let u;
   const handleError = n => {
     if (e.me !== t) return;
-    W.initTransition(e.ne);
-    notifyStatus(e, n instanceof NotReadyError ? c : a, n);
-    e.$ = P;
+    j.initTransition(e.ne);
+    notifyStatus(e, n instanceof NotReadyError ? a : d, n);
+    e.$ = k;
   };
   const asyncWrite = (i, s) => {
     if (e.me !== t) return;
     if (e.m & (n | f)) return;
-    W.initTransition(e.ne);
+    j.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;
+      const t = e.ce !== S;
       if (e.R) e.ce = i;
       if (!t) {
         e.ae = i;
         insertSubs(e);
       }
-      e.$ = P;
+      e.$ = k;
     } else if (o) {
       const t = e.ae;
       const n = e.be;
       if (!n || !n(i, t)) {
         e.ae = i;
-        e.$ = P;
+        e.$ = k;
         if (e._e) {
           setSignal(e._e, i);
         }
@@ -607,8 +608,8 @@ function handleAsync(e, t, r) {
     );
     r = false;
     if (!n) {
-      W.initTransition(e.ne);
-      throw new NotReadyError(M);
+      j.initTransition(e.ne);
+      throw new NotReadyError(q);
     }
   }
   if (s) {
@@ -639,36 +640,36 @@ function handleAsync(e, t, r) {
     };
     const i = iterate();
     if (!r && !i) {
-      W.initTransition(e.ne);
-      throw new NotReadyError(M);
+      j.initTransition(e.ne);
+      throw new NotReadyError(q);
     }
   }
   return u;
 }
 function clearStatus(e) {
-  e.de = e.de & d;
+  e.de = e.de & p;
   e.Y = null;
   updatePendingSignal(e);
   e.Oe?.();
 }
 function notifyStatus(e, t, n, r, i) {
-  if (t === a && !(n instanceof StatusError) && !(n instanceof NotReadyError))
+  if (t === d && !(n instanceof StatusError) && !(n instanceof NotReadyError))
     n = new StatusError(e, n);
   const s = n instanceof NotReadyError && n.source === e;
-  const o = t === c && e.we && !s;
+  const o = t === a && e.we && !s;
   const u = o && hasActiveOverride(e);
   if (!r) {
-    e.de = t | (t !== a ? e.de & d : 0);
+    e.de = t | (t !== d ? e.de & p : 0);
     e.Y = n;
     updatePendingSignal(e);
   }
   if (i && !r) {
     assignOrMergeLane(e, i);
   }
-  if (u && k && n instanceof NotReadyError) {
+  if (u && A && n instanceof NotReadyError) {
     const e = n.source;
-    if (!k.Z.includes(e)) {
-      k.Z.push(e);
+    if (!A.Z.includes(e)) {
+      A.Z.push(e);
     }
   }
   const f = r || u;
@@ -682,17 +683,17 @@ function notifyStatus(e, t, n, r, i) {
     return;
   }
   for (let r = e.O; r !== null; r = r.P) {
-    r.k.$ = P;
+    r.k.$ = k;
     if (r.k.Y !== n) {
-      !r.k.ne && W.D.push(r.k);
+      !r.k.ne && j.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;
+      e.k.$ = k;
       if (e.k.Y !== n) {
-        !e.k.ne && W.D.push(e.k);
+        !e.k.ne && j.D.push(e.k);
         notifyStatus(e.k, t, n, f, l);
       }
     }
@@ -716,38 +717,38 @@ function unlinkSubs(e) {
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? v : x);
-  let t = e.j;
+  deleteFromHeap(e, e.m & o ? P : v);
+  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;
@@ -756,53 +757,53 @@ function isValidLink(e, t) {
   }
   return false;
 }
-const N = {};
+const L = {};
 function markDisposal(e) {
-  let t = e.Ae;
+  let t = e.Ce;
   while (t) {
     t.m |= o;
     if (t.m & i) {
-      deleteFromHeap(t, x);
-      insertIntoHeap(t, v);
+      deleteFromHeap(t, v);
+      insertIntoHeap(t, P);
     }
     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;
+      deleteFromHeap(e, e.m & o ? P : v);
+      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 +823,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,50 +838,50 @@ function formatId(e, t) {
   return e + (r ? String.fromCharCode(64 + r) : "") + n;
 }
 function getObserver() {
-  if (H || T) return N;
-  return L ? M : null;
+  if (Q || M) return L;
+  return I ? q : null;
 }
 function getOwner() {
-  return M;
+  return q;
 }
 function onCleanup(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];
+  if (!q) return e;
+  if (!q.Le) q.Le = e;
+  else if (Array.isArray(q.Le)) q.Le.push(e);
+  else q.Le = [q.Le, e];
   return e;
 }
 function isDisposed(e) {
   return !!(e.m & (u | o));
 }
 function createOwner(e) {
-  const t = M;
+  const t = q;
   const n = e?.transparent ?? false;
   const r = {
     id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
     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 ?? j,
+    Re: t?.Re || _,
+    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;
@@ -904,14 +905,14 @@ function effect(e, t, n, r, i) {
   o.Qe = t;
   o.Te = n;
   o.Me = undefined;
-  o.oe = i?.render ? p : h;
+  o.oe = i?.render ? h : y;
   o.Oe = (e, t) => {
     const n = e !== undefined ? e : o.de;
     const r = t !== undefined ? t : o.Y;
-    if (n & a) {
+    if (n & d) {
       let e = r;
-      o.fe.notify(o, c, 0);
-      if (o.oe === h) {
+      o.fe.notify(o, a, 0);
+      if (o.oe === y) {
         try {
           return o.Te
             ? o.Te(e, () => {
@@ -923,11 +924,11 @@ function effect(e, t, n, r, i) {
           e = t;
         }
       }
-      if (!o.fe.notify(o, a, a)) throw e;
-    } else if (o.oe === p) o.fe.notify(o, c | a, n, r);
+      if (!o.fe.notify(o, d, d)) throw e;
+    } else if (o.oe === h) o.fe.notify(o, a | d, n, r);
   };
   recompute(o, true);
-  !i?.defer && (o.oe === h ? o.fe.enqueue(o.oe, runEffect.bind(o)) : runEffect.call(o));
+  !i?.defer && (o.oe === y ? o.fe.enqueue(o.oe, runEffect.bind(o)) : runEffect.call(o));
   s = true;
   onCleanup(() => o.Me?.());
 }
@@ -938,7 +939,7 @@ function runEffect() {
   try {
     this.Me = this.Qe(this.ae, this.He);
   } catch (e) {
-    if (!this.fe.notify(this, a, a)) throw e;
+    if (!this.fe.notify(this, d, d)) throw e;
   } finally {
     this.He = this.ae;
     this.ue = false;
@@ -960,27 +961,27 @@ function trackedEffect(e, t) {
       }
     },
     undefined,
-    { ...t, lazy: true, pureWrite: true }
+    { ...t, lazy: true }
   );
   n.Me = undefined;
   n.ue = true;
-  n.oe = y;
+  n.oe = g;
   n.le = run;
-  n.fe.enqueue(h, run);
+  n.fe.enqueue(y, run);
   onCleanup(() => n.Me?.());
 }
 GlobalQueue.K = recompute;
 GlobalQueue.U = disposeChildren;
-let L = false;
 let I = false;
 let R = false;
 let H = false;
 let Q = false;
 let T = false;
-let M = null;
+let M = false;
 let q = null;
-let F = false;
-let V = null;
+let F = null;
+let V = false;
+let D = null;
 function ownerInSnapshotScope(e) {
   while (e) {
     if (e.qe) return true;
@@ -989,8 +990,8 @@ function ownerInSnapshotScope(e) {
   return false;
 }
 function setSnapshotCapture(e) {
-  F = e;
-  if (e && !V) V = new Set();
+  V = e;
+  if (e && !D) D = new Set();
 }
 function markSnapshotScope(e) {
   e.qe = true;
@@ -1001,10 +1002,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,55 +1014,55 @@ function releaseSubtree(e) {
       if (e.m & l) {
         e.m &= ~l;
         e.m |= n;
-        if (x.W > e.o) x.W = e.o;
-        insertIntoHeap(e, x);
+        if (v.j > e.o) v.j = e.o;
+        insertIntoHeap(e, v);
       }
     }
     releaseSubtree(t);
-    t = t.We;
+    t = t.Ee;
   }
 }
 function clearSnapshots() {
-  if (V) {
-    for (const e of V) {
+  if (D) {
+    for (const e of D) {
       delete e.ie;
-      delete e[w];
+      delete e[m];
     }
-    V = null;
+    D = null;
   }
-  F = false;
+  V = false;
 }
 function recompute(t, n = false) {
   const i = t.oe;
   if (!n) {
-    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);
+    if (t.ne && (!i || A) && A !== t.ne) j.initTransition(t.ne);
+    deleteFromHeap(t, t.m & o ? P : v);
+    if (t.ne || i === g) 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);
   const u = hasActiveOverride(t);
-  const d = !!(t.de & c);
-  const p = M;
-  M = t;
-  t.Ce = null;
+  const c = !!(t.de & a);
+  const p = q;
+  q = t;
+  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;
-  L = true;
+  t.$ = k;
+  let h = t.ce === S ? t.ae : t.ce;
+  let y = t.o;
+  let w = I;
+  let m = F;
+  I = true;
   if (s) {
     const e = resolveLane(t);
-    if (e) q = e;
+    if (e) F = e;
   }
   try {
     h = handleAsync(t, t.R(h));
@@ -1072,8 +1073,8 @@ function recompute(t, n = false) {
       updatePendingSignal(e.pe);
     }
   } catch (e) {
-    if (e instanceof NotReadyError && q) {
-      const e = findLane(q);
+    if (e instanceof NotReadyError && F) {
+      const e = findLane(F);
       if (e.pe !== t) {
         e.T.add(t);
         t.re = e;
@@ -1082,33 +1083,33 @@ function recompute(t, n = false) {
     }
     notifyStatus(
       t,
-      e instanceof NotReadyError ? c : a,
+      e instanceof NotReadyError ? a : d,
       e,
       undefined,
       e instanceof NotReadyError ? t.re : undefined
     );
   } finally {
-    L = w;
+    I = w;
     t.m = e | (n ? t.m & l : 0);
-    M = p;
+    q = 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 f = u ? t.ae : t.ce === S ? t.ae : t.ce;
     const l = !t.be || !t.be(f, h);
     if (l) {
       const e = u ? t.ae : undefined;
-      if (n || (i && k !== t.ne) || s) t.ae = h;
+      if (n || (i && A !== t.ne) || s) t.ae = h;
       else t.ce = h;
-      if (u && !s && d) {
+      if (u && !s && c) {
         const e = t.Se || 0;
         const n = t.ge || 0;
         if (e <= n) t.ae = h;
@@ -1118,19 +1119,19 @@ function recompute(t, n = false) {
       }
     } else if (u) {
       t.ce = h;
-    } else if (t.o != S) {
+    } else if (t.o != y) {
       for (let e = t.O; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.k, e.k.m & o ? v : x);
+        insertIntoHeapHeight(e.k, e.k.m & o ? P : v);
       }
     }
   }
-  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));
+  F = m;
+  (!n || t.de & a) && !t.ne && !(A && t.we) && j.D.push(t);
+  t.ne && i && A !== 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) {
@@ -1141,7 +1142,7 @@ function updateIfNecessary(r) {
       }
     }
   }
-  if (r.m & (n | f) || (r.Y && r.$ < P)) {
+  if (r.m & (n | f) || (r.Y && r.$ < k)) {
     recompute(r);
   }
   r.m = e | (r.m & l);
@@ -1149,55 +1150,55 @@ function updateIfNecessary(r) {
 function computed(t, n, r) {
   const i = r?.transparent ?? false;
   const s = {
-    id: r?.id ?? (i ? M?.id : M?.id != null ? getNextChildId(M) : undefined),
+    id: r?.id ?? (i ? q?.id : q?.id != null ? getNextChildId(q) : undefined),
     Ie: i || undefined,
     be: 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: q?.fe ?? j,
+    Re: q?.Re ?? _,
+    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,
-    m: e,
-    de: d,
-    $: P,
-    ce: g,
-    Ne: null,
+    i: q,
     Ee: null,
+    Ce: null,
+    m: r?.lazy ? c : e,
+    de: p,
+    $: k,
+    ce: S,
+    Ne: null,
+    je: null,
     me: null,
     ne: null
   };
   s.p = s;
-  const o = M?.t ? M.u : M;
-  if (M) {
-    const e = M.Ae;
+  const o = q?.t ? q.u : q;
+  if (q) {
+    const e = q.Ce;
     if (e === null) {
-      M.Ae = s;
+      q.Ce = s;
     } else {
-      s.We = e;
-      M.Ae = s;
+      s.Ee = e;
+      q.Ce = s;
     }
   }
   if (o) s.o = o.o + 1;
-  if (F && ownerInSnapshotScope(M)) s.se = true;
+  if (V && ownerInSnapshotScope(q)) 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);
+  if (V && !r?.lazy) {
+    if (!(s.de & a)) {
+      s.ie = s.ae === undefined ? w : s.ae;
+      D.add(s);
     }
   }
   return s;
@@ -1210,15 +1211,15 @@ function signal(e, t, n = null) {
     ae: e,
     O: null,
     ve: null,
-    $: P,
+    $: k,
     I: n,
-    A: n?.C || null,
-    ce: g
+    C: n?.A || null,
+    ce: S
   };
-  n && (n.C = r);
-  if (F && !r.Fe) {
-    r.ie = e === undefined ? S : e;
-    V.add(r);
+  n && (n.A = r);
+  if (V && !r.Fe) {
+    r.ie = e === undefined ? w : e;
+    D.add(r);
   }
   return r;
 }
@@ -1235,68 +1236,72 @@ function optimisticComputed(e, t, n) {
 function isEqual(e, t) {
   return e === t;
 }
-let D = false;
+let B = false;
 function setStrictRead(e) {
-  const t = D;
-  D = e;
+  const t = B;
+  B = e;
   return t;
 }
 function untrack(e) {
-  if (!L && true) return e();
-  L = false;
+  if (!I && true) return e();
+  I = false;
   try {
     return e();
   } finally {
-    L = true;
+    I = true;
   }
 }
 function read(e) {
-  if (T) {
-    const t = getPendingValueComputed(e);
-    const n = T;
-    T = false;
+  if (M) {
+    const t = getLatestValueComputed(e);
+    const n = M;
+    M = false;
     let r;
     try {
       r = read(t);
     } catch (t) {
-      if (!M && t instanceof NotReadyError) return e.ae;
+      if (!q && t instanceof NotReadyError) return e.ae;
       throw t;
     } finally {
-      T = n;
+      M = n;
     }
-    if (t.de & c) return e.ae;
-    if (I && q && t.re) {
+    if (t.de & a) return e.ae;
+    if (R && F && t.re) {
       const n = findLane(t.re);
-      const r = findLane(q);
+      const r = findLane(F);
       if (n !== r && n.T.size > 0) {
         return e.ae;
       }
     }
     return r;
   }
-  if (H) {
+  if (Q) {
     const t = e.I || e;
     const n = getPendingSignal(t);
-    const r = H;
-    H = false;
+    const r = Q;
+    Q = false;
     if (read(n)) {
-      Q = true;
+      T = true;
     }
-    H = r;
+    Q = r;
     return e.ae;
   }
-  let t = M;
+  let t = q;
   if (t?.t) t = t.u;
-  if (R && e.R) recompute(e);
-  if (t && L) {
+  if (H && e.R) recompute(e);
+  if (e.m & c) {
+    e.m &= ~c;
+    recompute(e, true);
+  }
+  if (t && I) {
     if (e.R && e.m & u) recompute(e);
     link(e, t);
     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 ? P.j : v.j)) {
         markNode(t);
-        markHeap(r ? v : x);
+        markHeap(r ? P : v);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -1306,91 +1311,91 @@ function read(e) {
     }
   }
   const n = e.I || e;
-  if (n.de & c) {
-    if (t && !(I && n.ne && k !== n.ne)) {
-      if (q) {
+  if (n.de & a) {
+    if (t && !(R && n.ne && A !== n.ne)) {
+      if (F) {
         const r = n.re;
-        const i = findLane(q);
+        const i = findLane(F);
         if (r && findLane(r) === i && !hasActiveOverride(n)) {
-          if (!L) link(e, t);
+          if (!I) link(e, t);
           throw n.Y;
         }
       } else {
-        if (!L) link(e, t);
+        if (!I) link(e, t);
         throw n.Y;
       }
-    } else if (!t && n.de & d) {
+    } else if (!t && n.de & p) {
       throw n.Y;
     }
   }
-  if (e.R && e.de & a) {
-    if (e.$ < P) {
+  if (e.R && e.de & d) {
+    if (e.$ < k) {
       recompute(e, true);
       return read(e);
     } else throw e.Y;
   }
-  if (F && t && t.se) {
+  if (V && 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;
+      const r = n === w ? undefined : n;
+      const i = e.ce !== S ? 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;
+  return !t || F !== null || e.ce === S || (R && e.ne && A !== 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;
-  const r = n ? e.ae : e.ce === g ? e.ae : e.ce;
+  if (e.ne && A !== e.ne) j.initTransition(e.ne);
+  const n = e.we && !E;
+  const r = n ? e.ae : e.ce === S ? e.ae : e.ce;
   if (typeof t === "function") t = t(r);
   const i = !e.be || !e.be(r, t);
   if (!i) {
-    if (n && e.ce !== g && e.R) {
+    if (n && e.ce !== S && e.R) {
       insertSubs(e, true);
       schedule();
     }
     return t;
   }
   if (n) {
-    const n = W.B.includes(e);
+    const n = j.B.includes(e);
     if (e.ne && n) {
-      W.initTransition(e.ne);
+      j.initTransition(e.ne);
     }
-    if (e.ce === g) {
+    if (e.ce === S) {
       e.ce = e.ae;
     }
     if (!n) {
-      W.B.push(e);
+      j.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 === S) j.D.push(e);
     e.ce = t;
   }
   updatePendingSignal(e);
   if (e._e) {
     setSignal(e._e, t);
   }
-  e.$ = P;
+  e.$ = k;
   insertSubs(e, n);
   schedule();
   return t;
 }
 function runWithOwner(e, t) {
-  const n = M;
-  const r = L;
-  M = e;
-  L = false;
+  const n = q;
+  const r = I;
+  q = e;
+  I = false;
   try {
     return t();
   } finally {
-    M = n;
-    L = r;
+    q = n;
+    I = r;
   }
 }
 function getPendingSignal(e) {
@@ -1405,16 +1410,16 @@ function getPendingSignal(e) {
 }
 function computePendingState(e) {
   const t = e;
-  if (e.we && e.ce !== g) {
-    if (t.de & c && !(t.de & d)) return true;
+  if (e.we && e.ce !== S) {
+    if (t.de & a && !(t.de & p)) return true;
     if (e.he) {
       const t = e.re ? findLane(e.re) : null;
       return !!(t && t.T.size > 0);
     }
     return true;
   }
-  if (e.ce !== g && !(t.de & d)) return true;
-  return !!(t.de & c && !(t.de & d));
+  if (e.ce !== S && !(t.de & p)) return true;
+  return !!(t.de & a && !(t.de & p));
 }
 function updatePendingSignal(e) {
   if (e.Ve) {
@@ -1429,78 +1434,78 @@ function updatePendingSignal(e) {
           mergeLanes(t, e);
         }
       }
-      E.delete(n);
+      W.delete(n);
       n.re = undefined;
     }
   }
 }
-function getPendingValueComputed(e) {
+function getLatestValueComputed(e) {
   if (!e._e) {
-    const t = T;
-    T = false;
-    const n = H;
-    H = false;
-    const r = M;
-    M = null;
+    const t = M;
+    M = false;
+    const n = Q;
+    Q = false;
+    const r = q;
+    q = null;
     e._e = optimisticComputed(() => read(e));
     e._e.he = e;
-    M = r;
-    H = n;
-    T = t;
+    q = r;
+    Q = n;
+    M = t;
   }
   return e._e;
 }
 function staleValues(e, t = true) {
-  const n = I;
-  I = t;
+  const n = R;
+  R = t;
   try {
     return e();
   } finally {
-    I = n;
+    R = n;
   }
 }
-function pending(e) {
-  const t = T;
-  T = true;
+function latest(e) {
+  const t = M;
+  M = true;
   try {
     return e();
   } finally {
-    T = t;
+    M = t;
   }
 }
 function isPending(e) {
-  const t = H;
-  const n = Q;
-  H = true;
-  Q = false;
+  const t = Q;
+  const n = T;
+  Q = true;
+  T = false;
   try {
     e();
-    return Q;
+    return T;
   } catch {
-    return Q;
+    return T;
   } finally {
-    H = t;
-    Q = n;
+    Q = t;
+    T = n;
   }
 }
 function refresh(e) {
-  let t = R;
-  R = true;
+  let t = H;
+  H = true;
   try {
     if (typeof e !== "function") {
-      recompute(e[_]);
+      recompute(e[O]);
       return e;
     }
     return untrack(e);
   } finally {
-    R = t;
+    H = t;
     if (!t) {
       schedule();
     }
   }
 }
 function isRefreshing() {
-  return R;
+  return H;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -1528,7 +1533,7 @@ function isUndefined(e) {
   return typeof e === "undefined";
 }
 function restoreTransition(e, t) {
-  W.initTransition(e);
+  j.initTransition(e);
   const n = t();
   flush();
   return n;
@@ -1537,8 +1542,8 @@ function action(e) {
   return (...t) =>
     new Promise((n, r) => {
       const i = e(...t);
-      W.initTransition();
-      let s = k;
+      j.initTransition();
+      let s = A;
       s.ee.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
@@ -1634,13 +1639,13 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   getOwner()
     ? createTrackedEffect(() => untrack(e))
-    : W.enqueue(h, () => {
+    : j.enqueue(y, () => {
         const t = e();
         t?.();
       });
 }
 function unwrap(e) {
-  return e?.[z]?.[ee] ?? e;
+  return e?.[U]?.[te] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1652,16 +1657,16 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n, r) {
-  const i = t?.[z];
+  const i = t?.[U];
   if (!i) return;
-  const s = i[Y];
-  const o = i[Z];
-  const u = i[$];
-  let f = i[ee];
+  const s = i[Z];
+  const o = i[$];
+  const u = i[ee];
+  let f = i[te];
   if (e === s && !o && !u) return;
-  (i[re] || oe).set(e, i[U]);
-  i[Y] = e;
-  i[Z] = undefined;
+  (i[ie] || ue).set(e, i[J]);
+  i[Z] = e;
+  i[$] = undefined;
   if (Array.isArray(s)) {
     let t = false;
     const l = getOverrideValue(s, o, f, "length", u);
@@ -1689,16 +1694,16 @@ function applyState(e, t, n, r) {
       if (d > h || d > p) {
         for (a = d; a <= h; a++) {
           t = true;
-          i[ee][a] && setSignal(i[ee][a], wrap(e[a], i));
+          i[te][a] && setSignal(i[te][a], wrap(e[a], i));
         }
         for (; a < e.length; a++) {
           t = true;
           const s = wrap(w[a], i);
-          i[ee][a] && setSignal(i[ee][a], s);
+          i[te][a] && setSignal(i[te][a], s);
           applyState(e[a], s, n, r);
         }
-        t && i[ee][G] && setSignal(i[ee][G], void 0);
-        l !== e.length && i[ee].length && setSignal(i[ee].length, e.length);
+        t && i[te][K] && setSignal(i[te][K], void 0);
+        l !== e.length && i[te].length && setSignal(i[te].length, e.length);
         return;
       }
       g = new Array(h + 1);
@@ -1722,26 +1727,26 @@ function applyState(e, t, n, r) {
       for (a = d; a < e.length; a++) {
         if (a in w) {
           const t = wrap(w[a], i);
-          i[ee][a] && setSignal(i[ee][a], t);
+          i[te][a] && setSignal(i[te][a], t);
           applyState(e[a], t, n, r);
-        } else i[ee][a] && setSignal(i[ee][a], wrap(e[a], i));
+        } else i[te][a] && setSignal(i[te][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[ee][t] && setSignal(i[ee][t], e[t]);
+        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[te][t] && setSignal(i[te][t], e[t]);
       }
     }
     if (l !== e.length) {
       t = true;
-      i[ee].length && setSignal(i[ee].length, e.length);
+      i[te].length && setSignal(i[te].length, e.length);
     }
-    t && i[ee][G] && setSignal(i[ee][G], void 0);
+    t && i[te][K] && setSignal(i[te][K], void 0);
     return;
   }
   if (f) {
-    const t = f[G];
+    const t = f[K];
     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];
@@ -1755,7 +1760,7 @@ function applyState(e, t, n, r) {
       } else applyState(h, wrap(p, i), n, r);
     }
   }
-  if ((f = i[te])) {
+  if ((f = i[ne])) {
     const t = Object.keys(f);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -1777,9 +1782,9 @@ function createProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[ne] = wrapProjection;
-    e[re] = i;
-    Object.defineProperty(e, ie, {
+    e[re] = wrapProjection;
+    e[ie] = i;
+    Object.defineProperty(e, se, {
       get() {
         return r;
       },
@@ -1788,15 +1793,15 @@ function createProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[z]?.[ne] === wrapProjection) return e;
-    const t = createStoreProxy(e, le, wrapper);
+    if (e[U]?.[re] === wrapProjection) return e;
+    const t = createStoreProxy(e, ce, wrapper);
     i.set(e, t);
     return t;
   };
   const s = wrapProjection(t);
   r = computed(() => {
     const t = getOwner();
-    storeSetter(new Proxy(s, B), r => {
+    storeSetter(new Proxy(s, G), r => {
       const i = handleAsync(t, e(r), e => {
         e !== r && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id", n?.all));
         setSignal(t, undefined);
@@ -1810,7 +1815,7 @@ function createProjectionInternal(e, t = {}, n) {
 function createProjection(e, t = {}, n) {
   return createProjectionInternal(e, t, n).store;
 }
-const B = {
+const G = {
   get(e, t) {
     let n;
     setWriteOverride(true);
@@ -1821,7 +1826,7 @@ const B = {
       setWriteOverride(false);
       setProjectionWriteActive(false);
     }
-    return typeof n === "object" && n !== null ? new Proxy(n, B) : n;
+    return typeof n === "object" && n !== null ? new Proxy(n, G) : n;
   },
   set(e, t, n) {
     setWriteOverride(true);
@@ -1846,46 +1851,46 @@ const B = {
     return true;
   }
 };
-const G = Symbol(0),
-  K = Symbol(0),
+const K = Symbol(0),
   z = Symbol(0),
   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) {
+  J = Symbol(0),
+  X = Symbol(0);
+const Y = new WeakMap();
+const Z = "v",
+  $ = "o",
+  ee = "x",
+  te = "n",
+  ne = "h",
+  re = "w",
+  ie = "l",
+  se = "f",
+  oe = "p";
+function createStoreProxy(e, t = ce, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
     r.v = e;
   } else r = { v: e };
   n && n(r);
-  return (r[U] = new Proxy(r, t));
+  return (r[J] = new Proxy(r, t));
 }
-const oe = new WeakMap();
+const ue = new WeakMap();
 function wrap(e, t) {
-  if (t?.[ne]) return t[ne](e, t);
-  let n = e[U] || oe.get(e);
-  if (!n) oe.set(e, (n = createStoreProxy(e)));
+  if (t?.[re]) return t[re](e, t);
+  let n = e[J] || ue.get(e);
+  if (!n) ue.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
   return e != null && typeof e === "object" && !Object.isFrozen(e);
 }
-let ue = false;
+let fe = false;
 function setWriteOverride(e) {
-  ue = e;
+  fe = e;
 }
 function writeOnly(e) {
-  return ue || !!fe?.has(e);
+  return fe || !!le?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -1907,13 +1912,13 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
   if (s) u.we = true;
   if (o && t in o) {
     const e = o[t];
-    u.ie = e === undefined ? S : e;
-    V?.add(u);
+    u.ie = e === undefined ? w : e;
+    D?.add(u);
   }
   return (e[t] = u);
 }
-function trackSelf(e, t = G) {
-  getObserver() && read(getNode(getNodes(e, ee), t, undefined, e[ie], false, e[se]));
+function trackSelf(e, t = K) {
+  getObserver() && read(getNode(getNodes(e, te), t, undefined, e[se], false, e[oe]));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -1921,7 +1926,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] !== J) i.add(e);
+    if (t[e] !== X) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -1929,97 +1934,97 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === J) return void 0;
+    if (r[n] === X) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let fe = null;
-const le = {
+let le = null;
+const ce = {
   get(e, t, n) {
-    if (t === z) return e;
-    if (t === U) return n;
-    if (t === _) return e[ie];
-    if (t === G || t === K) {
+    if (t === U) return e;
+    if (t === J) return n;
+    if (t === O) return e[se];
+    if (t === K || t === z) {
       trackSelf(e, t);
       return n;
     }
-    const r = getNodes(e, ee);
+    const r = getNodes(e, te);
     const i = r[t];
-    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];
+    const s = e[ee] && t in e[ee];
+    const o = s || (e[$] && t in e[$]);
+    const u = !!e[Z][U];
+    const f = s ? e[ee] : e[$] && t in e[$] ? e[$] : e[Z];
     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 === J && (n = undefined);
+      let n = i && (o || !u) ? (i.ce !== S ? (i.we ? i.ae : i.ce) : i.ae) : f[t];
+      n === X && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      fe?.add(r);
+      le?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === J && (l = undefined);
+    l === X && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[Y]) && (t = Object.getPrototypeOf(e[Y])) && t !== Object.prototype
+        return !Array.isArray(e[Z]) && (t = Object.getPrototypeOf(e[Z])) && t !== Object.prototype
           ? l.bind(f)
           : l;
       } else if (getObserver()) {
-        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[ie], isEqual, e[se], e[w]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[se], isEqual, e[oe], e[m]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    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]));
+    if (t === J || t === K || t === "__proto__") return true;
+    const n = e[ee] && t in e[ee] ? e[ee][t] !== X : e[$] && t in e[$] ? e[$][t] !== X : t in e[Z];
+    getObserver() && read(getNode(getNodes(e, ne), t, n, e[se], isEqual, e[oe]));
     return n;
   },
   set(e, t, n) {
-    const r = e[U];
+    const r = e[J];
     if (writeOnly(r)) {
-      if (e[se]) {
-        const t = e[ie];
+      if (e[oe]) {
+        const t = e[se];
         if (t?.ne) {
-          W.initTransition(t.ne);
+          j.initTransition(t.ne);
         }
       }
       untrack(() => {
-        const i = e[Y];
+        const i = e[Z];
         const s = i[t];
-        if (F && typeof t !== "symbol") {
-          if (!e[w]) {
-            e[w] = Object.create(null);
-            V?.add(e);
+        if (V && typeof t !== "symbol") {
+          if (!e[m]) {
+            e[m] = Object.create(null);
+            D?.add(e);
           }
-          if (!(t in e[w])) {
-            e[w][t] = s;
+          if (!(t in e[m])) {
+            e[m][t] = s;
           }
         }
-        const o = e[se] && !A;
-        const u = o ? $ : Z;
+        const o = e[oe] && !E;
+        const u = o ? ee : $;
         if (o) trackOptimisticStore(r);
-        const f = e[$] && t in e[$] ? e[$][t] : e[Z] && t in e[Z] ? e[Z][t] : s;
-        const l = n?.[z]?.[Y] ?? n;
+        const f = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : s;
+        const l = n?.[U]?.[Z] ?? n;
         if (f === l) return true;
-        const c = e[$]?.length || e[Z]?.length || i.length;
+        const c = e[ee]?.length || e[$]?.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 = X.get(f);
-          e && (e instanceof Set ? e.delete(r) : X.delete(f));
+          const e = Y.get(f);
+          e && (e instanceof Set ? e.delete(r) : Y.delete(f));
         }
-        if (recursivelyNotify(r, oe) && a) recursivelyAddParent(l, r);
-        e[te]?.[t] && setSignal(e[te][t], true);
-        const d = getNodes(e, ee);
+        if (recursivelyNotify(r, ue) && a) recursivelyAddParent(l, r);
+        e[ne]?.[t] && setSignal(e[ne][t], true);
+        const d = getNodes(e, te);
         d[t] && setSignal(d[t], () => (a ? wrap(l, e) : l));
         if (Array.isArray(i)) {
           if (t === "length") {
@@ -2029,44 +2034,44 @@ const le = {
             if (e > c) d.length && setSignal(d.length, e);
           }
         }
-        d[G] && setSignal(d[G], undefined);
+        d[K] && setSignal(d[K], undefined);
       });
     }
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[$]?.[t] === J;
-    const r = e[Z]?.[t] === J;
-    if (writeOnly(e[U]) && !n && !r) {
+    const n = e[ee]?.[t] === X;
+    const r = e[$]?.[t] === X;
+    if (writeOnly(e[J]) && !n && !r) {
       untrack(() => {
-        const n = e[se] && !A;
-        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;
+        const n = e[oe] && !E;
+        const r = n ? ee : $;
+        if (n) trackOptimisticStore(e[J]);
+        const i = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : e[Z][t];
+        if (t in e[Z] || (e[$] && t in e[$])) {
+          (e[r] || (e[r] = Object.create(null)))[t] = X;
         } else if (e[r] && t in e[r]) {
           delete e[r][t];
         } else return true;
         if (isWrappable(i)) {
-          const t = X.get(i);
-          t && (t instanceof Set ? t.delete(e) : X.delete(i));
+          const t = Y.get(i);
+          t && (t instanceof Set ? t.delete(e) : Y.delete(i));
         }
-        if (e[te]?.[t]) setSignal(e[te][t], false);
-        const s = getNodes(e, ee);
+        if (e[ne]?.[t]) setSignal(e[ne][t], false);
+        const s = getNodes(e, te);
         s[t] && setSignal(s[t], undefined);
-        s[G] && setSignal(s[G], undefined);
+        s[K] && setSignal(s[K], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[Y], e[Z], false);
-    if (e[$]) {
+    let t = getKeys(e[Z], e[$], false);
+    if (e[ee]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[$])) {
-        if (e[$][t] !== J) n.add(t);
+      for (const t of Reflect.ownKeys(e[ee])) {
+        if (e[ee][t] !== X) n.add(t);
         else n.delete(t);
       }
       t = Array.from(n);
@@ -2074,25 +2079,25 @@ const le = {
     return t;
   },
   getOwnPropertyDescriptor(e, 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 (t === J) return { value: e[J], writable: true, configurable: true };
+    if (e[ee] && t in e[ee]) {
+      if (e[ee][t] === X) return undefined;
+      const n = getPropertyDescriptor(e[Z], e[$], t);
       if (n) {
-        return { ...n, value: e[$][t] };
+        return { ...n, value: e[ee][t] };
       }
-      return { value: e[$][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[ee][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[Y], e[Z], t);
+    return getPropertyDescriptor(e[Z], e[$], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[Y]);
+    return Object.getPrototypeOf(e[Z]);
   }
 };
 function storeSetter(e, t) {
-  const n = fe;
-  fe = new Set();
-  fe.add(e);
+  const n = le;
+  le = new Set();
+  le.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2108,8 +2113,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    fe.clear();
-    fe = n;
+    le.clear();
+    le = n;
   }
 }
 function createStore(e, t, n) {
@@ -2118,17 +2123,17 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function recursivelyNotify(e, t) {
-  let n = e[z] || t?.get(e)?.[z];
+  let n = e[U] || t?.get(e)?.[U];
   let r = false;
   if (n) {
-    const e = getNodes(n, ee)[K];
+    const e = getNodes(n, te)[z];
     if (e) {
       setSignal(e, undefined);
       r = true;
     }
-    t = n[re] || t;
+    t = n[ie] || t;
   }
-  const i = X.get(n?.[Y] || e);
+  const i = Y.get(n?.[Z] || e);
   if (!i) return r;
   if (i instanceof Set) {
     for (let e of i) r = recursivelyNotify(e, t) || r;
@@ -2137,16 +2142,16 @@ function recursivelyNotify(e, t) {
 }
 function recursivelyAddParent(e, t) {
   let n;
-  const r = e[z];
+  const r = e[U];
   if (r) {
-    n = r[Z];
-    e = r[Y];
+    n = r[$];
+    e = r[Z];
   }
   if (t) {
-    let n = X.get(e);
-    if (!n) X.set(e, t);
+    let n = Y.get(e);
+    if (!n) Y.set(e, t);
     else if (n !== t) {
-      if (!(n instanceof Set)) X.set(e, (n = new Set([n])));
+      if (!(n instanceof Set)) Y.set(e, (n = new Set([n])));
       else if (n.has(t)) return;
       n.add(t);
     } else return;
@@ -2168,7 +2173,7 @@ function recursivelyAddParent(e, t) {
 }
 function deep(e) {
   recursivelyAddParent(e);
-  return e[K];
+  return e[z];
 }
 function createOptimisticStore(e, t, n) {
   GlobalQueue.J ||= clearOptimisticStore;
@@ -2179,39 +2184,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[z];
-  if (!t || !t[$]) return;
-  const n = t[$];
-  const r = t[ee];
+  const t = e[U];
+  if (!t || !t[ee]) return;
+  const n = t[ee];
+  const r = t[te];
   setProjectionWriteActive(true);
   try {
     if (r) {
       for (const e of Reflect.ownKeys(n)) {
         if (r[e]) {
           r[e].re = undefined;
-          const n = t[Z] && e in t[Z] ? t[Z][e] : t[Y][e];
-          const i = n === J ? undefined : n;
+          const n = t[$] && e in t[$] ? t[$][e] : t[Z][e];
+          const i = n === X ? undefined : n;
           setSignal(r[e], isWrappable(i) ? wrap(i, t) : i);
         }
       }
-      if (r[G]) {
-        r[G].re = undefined;
-        setSignal(r[G], undefined);
+      if (r[K]) {
+        r[K].re = undefined;
+        setSignal(r[K], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[$];
+  delete t[ee];
 }
 function createOptimisticProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[ne] = wrapProjection;
-    e[re] = i;
-    e[se] = true;
-    Object.defineProperty(e, ie, {
+    e[re] = wrapProjection;
+    e[ie] = i;
+    e[oe] = true;
+    Object.defineProperty(e, se, {
       get() {
         return r;
       },
@@ -2220,8 +2225,8 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[z]?.[ne] === wrapProjection) return e;
-    const t = createStoreProxy(e, le, wrapper);
+    if (e[U]?.[re] === wrapProjection) return e;
+    const t = createStoreProxy(e, ce, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2231,7 +2236,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       const t = getOwner();
       setProjectionWriteActive(true);
       try {
-        storeSetter(new Proxy(s, B), r => {
+        storeSetter(new Proxy(s, G), r => {
           const i = handleAsync(t, e(r), e => {
             setProjectionWriteActive(true);
             try {
@@ -2250,17 +2255,79 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   }
   return { store: s, node: r };
 }
+const ae = 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 === ae) {
+    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 de = Object.assign(
+  function storePath(...e) {
+    return t => {
+      updatePath(t, e);
+    };
+  },
+  { DELETE: ae }
+);
 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[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;
+  if ((r = e[U] || n?.get(e)?.[U])) {
+    s = r[$];
+    i = Array.isArray(r[Z]);
+    t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[Z]))) : r[Z]);
+    e = r[Z];
+    n = ue;
   } else {
     i = Array.isArray(e);
     t.set(e, e);
@@ -2269,7 +2336,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 === J) continue;
+      if (f === X) continue;
       if ((u = snapshot(f, t, n)) !== f || o) {
         if (!o) t.set(e, (o = [...e]));
         o[i] = u;
@@ -2296,13 +2363,13 @@ function snapshot(e, t, n) {
 function trueFn() {
   return true;
 }
-const ce = {
+const pe = {
   get(e, t, n) {
-    if (t === U) return n;
+    if (t === J) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === U) return true;
+    if (t === J) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2325,23 +2392,23 @@ const ce = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const ae = Symbol(0);
+const he = 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 && U in i);
-    const s = !!i && i[ae];
+    t = t || (!!i && J in i);
+    const s = !!i && i[he];
     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 === he) 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 +2426,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      ce
+      pe
     );
   }
   const r = Object.create(null);
@@ -2391,12 +2458,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[ae] = n;
+  o[he] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (m && U in e) {
+  if (b && J in e) {
     return new Proxy(
       {
         get(t) {
@@ -2409,7 +2476,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      ce
+      pe
     );
   }
   const r = {};
@@ -2443,18 +2510,18 @@ function mapArray(e, t, n) {
     })
   );
 }
-const de = { pureWrite: true };
+const ye = { pureWrite: true };
 function updateKeyedMap() {
   const e = this.Ge() || [],
     t = e.length;
-  e[G];
+  e[K];
   runWithOwner(this.De, () => {
     let n,
       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], ye);
+            this.Ze && (this.Ze[r] = signal(r, ye));
             return this.ze(
               read.bind(null, this.Ye[r]),
               this.Ze ? read.bind(null, this.Ze[r]) : undefined
@@ -2463,7 +2530,7 @@ function updateKeyedMap() {
         : this.Ze
           ? () => {
               const t = e[r];
-              this.Ze[r] = signal(r, de);
+              this.Ze[r] = signal(r, ye);
               return this.ze(() => t, read.bind(null, this.Ze[r]));
             }
           : () => {
@@ -2666,7 +2733,7 @@ class CollectionQueue extends Queue {
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.it) || (this.it & c && this.ut)) return super.notify(e, t, n, r);
+    if (!(t & this.it) || (this.it & a && this.ut)) return super.notify(e, t, n, r);
     if (n & this.it) {
       const t = r?.source || e.Y?.source;
       if (t) {
@@ -2702,10 +2769,10 @@ function createCollectionBoundary(e, t, n) {
   return read.bind(null, o);
 }
 function createLoadBoundary(e, t) {
-  return createCollectionBoundary(c, e, () => t());
+  return createCollectionBoundary(a, e, () => t());
 }
 function createErrorBoundary(e, t) {
-  return createCollectionBoundary(a, e, e => {
+  return createCollectionBoundary(d, e, e => {
     let n = e.st.values().next().value;
     const r = n.Y?.cause ?? n.Y;
     return t(r, () => {
@@ -2763,13 +2830,13 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = U;
-exports.$TARGET = z;
-exports.$TRACK = G;
+exports.$PROXY = J;
+exports.$TARGET = U;
+exports.$TRACK = K;
 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 +2866,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 +2874,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 +2884,5 @@ exports.setContext = setContext;
 exports.setSnapshotCapture = setSnapshotCapture;
 exports.setStrictRead = setStrictRead;
 exports.snapshot = snapshot;
+exports.storePath = de;
 exports.untrack = untrack;