@solidjs/signals 0.11.3 → 0.12.0

package/dist/node.cjs

@@ -105,12 +105,12 @@ function markNode(e, r = n) {
   if ((i & (t | n)) >= r) return;
   e.m = (i & -4) | r;
   for (let n = e.O; n !== null; n = n.P) {
-    markNode(n.k, t);
+    markNode(n.A, t);
   }
-  if (e.A !== null) {
-    for (let n = e.A; n !== null; n = n.C) {
+  if (e.k !== null) {
+    for (let n = e.k; n !== null; n = n.C) {
       for (let e = n.O; e !== null; e = e.P) {
-        markNode(e.k, t);
+        markNode(e.A, t);
       }
     }
   }
@@ -133,25 +133,26 @@ function adjustHeight(e, t) {
   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;
+    if (r.H && r.o >= n) n = r.o + 1;
   }
   if (e.o !== n) {
     e.o = n;
     for (let n = e.O; n !== null; n = n.P) {
-      insertIntoHeapHeight(n.k, t);
+      insertIntoHeapHeight(n.A, t);
     }
   }
 }
 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 A = 0;
+let k = null;
 let C = false;
 let E = false;
+function setOnUnhandledAsync(e) {}
 function runLaneEffects(e) {
   for (const t of N) {
-    if (t.H || t.T.size > 0) continue;
+    if (t.R || t.T.size > 0) continue;
     const n = t.M[e - 1];
     if (n.length) {
       t.M[e - 1] = [];
@@ -165,13 +166,13 @@ function setProjectionWriteActive(e) {
 function schedule() {
   if (C) return;
   C = true;
-  if (!j.q) queueMicrotask(flush);
+  if (!j.q && !E) queueMicrotask(flush);
 }
 class Queue {
   i = null;
   F = [[], []];
   V = [];
-  created = k;
+  created = A;
   addChild(e) {
     this.V.push(e);
     e.i = this;
@@ -243,36 +244,36 @@ class GlobalQueue extends Queue {
     this.q = true;
     try {
       runHeap(v, GlobalQueue.K);
-      if (A) {
-        const e = transitionComplete(A);
+      if (k) {
+        const e = transitionComplete(k);
         if (!e) {
-          let e = A;
+          let e = k;
           runHeap(P, GlobalQueue.K);
           this.D = [];
           this.B = [];
           this.G = new Set();
           runLaneEffects(h);
           runLaneEffects(y);
-          this.stashQueues(A.X);
-          k++;
+          this.stashQueues(k.X);
+          A++;
           C = v.S >= v.j;
-          reassignPendingTransition(A.D);
-          A = null;
+          reassignPendingTransition(k.D);
+          k = null;
           finalizePureQueue(null, true);
           return;
         }
-        this.D !== A.D && this.D.push(...A.D);
-        this.restoreQueues(A.X);
-        x.delete(A);
-        const t = A;
-        A = null;
+        this.D !== k.D && this.D.push(...k.D);
+        this.restoreQueues(k.X);
+        x.delete(k);
+        const t = k;
+        k = null;
         reassignPendingTransition(this.D);
         finalizePureQueue(t);
       } else {
         if (x.size) runHeap(P, GlobalQueue.K);
         finalizePureQueue();
       }
-      k++;
+      A++;
       C = v.S >= v.j;
       runLaneEffects(h);
       this.run(h);
@@ -286,8 +287,8 @@ class GlobalQueue extends Queue {
     if (t & a) {
       if (n & a) {
         const t = r !== undefined ? r : e.Y;
-        if (A && t && !A.Z.includes(t.source)) {
-          A.Z.push(t.source);
+        if (k && t && !k.Z.includes(t.source)) {
+          k.Z.push(t.source);
           schedule();
         }
       }
@@ -297,11 +298,11 @@ class GlobalQueue extends Queue {
   }
   initTransition(e) {
     if (e) e = currentTransition(e);
-    if (e && e === A) return;
-    if (!e && A && A.$ === k) return;
-    if (!A) {
-      A = e ?? {
-        $: k,
+    if (e && e === k) return;
+    if (!e && k && k.$ === A) return;
+    if (!k) {
+      k = e ?? {
+        $: A,
         D: [],
         Z: [],
         B: [],
@@ -311,7 +312,7 @@ class GlobalQueue extends Queue {
         te: false
       };
     } else if (e) {
-      const t = A;
+      const t = k;
       t.te = e;
       e.ee.push(...t.ee);
       for (const n of N) {
@@ -322,45 +323,45 @@ class GlobalQueue extends Queue {
         e.G.add(n);
       }
       x.delete(t);
-      A = e;
+      k = e;
     }
-    x.add(A);
-    A.$ = k;
+    x.add(k);
+    k.$ = A;
     for (let e = 0; e < this.D.length; e++) {
       const t = this.D[e];
-      t.ne = A;
-      A.D.push(t);
+      t.ne = k;
+      k.D.push(t);
     }
-    this.D = A.D;
+    this.D = k.D;
     for (let e = 0; e < this.B.length; e++) {
       const t = this.B[e];
-      t.ne = A;
-      A.B.push(t);
+      t.ne = k;
+      k.B.push(t);
     }
-    this.B = A.B;
+    this.B = k.B;
     for (const e of N) {
-      if (!e.ne) e.ne = A;
+      if (!e.ne) e.ne = k;
     }
-    for (const e of this.G) A.G.add(e);
-    this.G = A.G;
+    for (const e of this.G) k.G.add(e);
+    this.G = k.G;
   }
 }
 function insertSubs(e, t = false) {
   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) {
-      i.k.m |= l;
+    if (r && i.A.se) {
+      i.A.m |= l;
       continue;
     }
     if (t && n) {
-      i.k.m |= f;
-      assignOrMergeLane(i.k, n);
+      i.A.m |= f;
+      assignOrMergeLane(i.A, n);
     } else if (t) {
-      i.k.m |= f;
-      i.k.re = undefined;
+      i.A.m |= f;
+      i.A.re = undefined;
     }
-    const e = i.k;
+    const e = i.A;
     if (e.oe === g) {
       if (!e.ue) {
         e.ue = true;
@@ -368,9 +369,9 @@ function insertSubs(e, t = false) {
       }
       continue;
     }
-    const s = i.k.m & o ? P : v;
-    if (s.j > i.k.o) s.j = i.k.o;
-    insertIntoHeap(i.k, s);
+    const s = i.A.m & o ? P : v;
+    if (s.j > i.A.o) s.j = i.A.o;
+    insertIntoHeap(i.A, s);
   }
 }
 function finalizePureQueue(e = null, t = false) {
@@ -387,7 +388,7 @@ function finalizePureQueue(e = null, t = false) {
         if (n.oe && n.oe !== g) n.ue = true;
       }
       if (!(n.de & a)) n.de &= ~p;
-      if (n.R) GlobalQueue.U(n, false, true);
+      if (n.H) GlobalQueue.U(n, false, true);
     }
     t.length = 0;
     const n = e ? e.B : j.B;
@@ -414,7 +415,7 @@ function finalizePureQueue(e = null, t = false) {
     for (const t of N) {
       const n = e ? t.ne === e : !t.ne;
       if (!n) continue;
-      if (!t.H) {
+      if (!t.R) {
         if (t.M[0].length) runQueue(t.M[0], h);
         if (t.M[1].length) runQueue(t.M[1], y);
       }
@@ -439,7 +440,7 @@ function trackOptimisticStore(e) {
 }
 function reassignPendingTransition(e) {
   for (let t = 0; t < e.length; t++) {
-    e[t].ne = A;
+    e[t].ne = k;
   }
 }
 const j = new GlobalQueue();
@@ -470,15 +471,15 @@ function currentTransition(e) {
   return e;
 }
 function setActiveTransition(e) {
-  A = e;
+  k = e;
 }
 function runInTransition(e, t) {
-  const n = A;
+  const n = k;
   try {
-    A = currentTransition(e);
+    k = currentTransition(e);
     return t();
   } finally {
-    A = n;
+    k = n;
   }
 }
 const W = new WeakMap();
@@ -490,21 +491,21 @@ function getOrCreateLane(e) {
   }
   const n = e.he;
   const r = n?.re ? findLane(n.re) : null;
-  t = { pe: e, T: new Set(), M: [[], []], H: null, ne: A, ye: r };
+  t = { pe: e, T: new Set(), M: [[], []], R: null, ne: k, ye: r };
   W.set(e, t);
   N.add(t);
   e.ge = e.Se || 0;
   return t;
 }
 function findLane(e) {
-  while (e.H) e = e.H;
+  while (e.R) e = e.R;
   return e;
 }
 function mergeLanes(e, t) {
   e = findLane(e);
   t = findLane(t);
   if (e === t) return e;
-  t.H = e;
+  t.R = 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]);
@@ -525,7 +526,7 @@ function assignOrMergeLane(e, t) {
   const n = findLane(t);
   const r = e.re;
   if (r) {
-    if (r.H) {
+    if (r.R) {
       e.re = t;
       return;
     }
@@ -556,7 +557,7 @@ function handleAsync(e, t, r) {
     if (e.me !== t) return;
     j.initTransition(e.ne);
     notifyStatus(e, n instanceof NotReadyError ? a : d, n);
-    e.$ = k;
+    e.$ = A;
   };
   const asyncWrite = (i, s) => {
     if (e.me !== t) return;
@@ -568,18 +569,18 @@ function handleAsync(e, t, r) {
     if (r) r(i);
     else if (e.we) {
       const t = e.ce !== S;
-      if (e.R) e.ce = i;
+      if (e.H) e.ce = i;
       if (!t) {
         e.ae = i;
         insertSubs(e);
       }
-      e.$ = k;
+      e.$ = A;
     } else if (o) {
       const t = e.ae;
       const n = e.be;
       if (!n || !n(i, t)) {
         e.ae = i;
-        e.$ = k;
+        e.$ = A;
         if (e._e) {
           setSignal(e._e, i);
         }
@@ -625,6 +626,10 @@ function handleAsync(e, t, r) {
             e = n;
             t = true;
           } else if (!n.done) asyncWrite(n.value, iterate);
+          else {
+            schedule();
+            flush();
+          }
         },
         e => {
           if (!i) handleError(e);
@@ -666,10 +671,10 @@ function notifyStatus(e, t, n, r, i) {
   if (i && !r) {
     assignOrMergeLane(e, i);
   }
-  if (u && A && n instanceof NotReadyError) {
+  if (u && k && n instanceof NotReadyError) {
     const e = n.source;
-    if (!A.Z.includes(e)) {
-      A.Z.push(e);
+    if (!k.Z.includes(e)) {
+      k.Z.push(e);
     }
   }
   const f = r || u;
@@ -683,18 +688,18 @@ function notifyStatus(e, t, n, r, i) {
     return;
   }
   for (let r = e.O; r !== null; r = r.P) {
-    r.k.$ = k;
-    if (r.k.Y !== n) {
-      !r.k.ne && j.D.push(r.k);
-      notifyStatus(r.k, t, n, f, l);
+    r.A.$ = A;
+    if (r.A.Y !== n) {
+      !r.A.ne && j.D.push(r.A);
+      notifyStatus(r.A, t, n, f, l);
     }
   }
-  for (let r = e.A; r !== null; r = r.C) {
+  for (let r = e.k; r !== null; r = r.C) {
     for (let e = r.O; e !== null; e = e.P) {
-      e.k.$ = k;
-      if (e.k.Y !== n) {
-        !e.k.ne && j.D.push(e.k);
-        notifyStatus(e.k, t, n, f, l);
+      e.A.$ = A;
+      if (e.A.Y !== n) {
+        !e.A.ne && j.D.push(e.A);
+        notifyStatus(e.A, t, n, f, l);
       }
     }
   }
@@ -711,7 +716,7 @@ function unlinkSubs(e) {
     t.O = r;
     if (r === null) {
       t.Pe?.();
-      t.R && !t.ke && !(t.m & o) && unobserved(t);
+      t.H && !t.Ae && !(t.m & o) && unobserved(t);
     }
   }
   return n;
@@ -726,27 +731,27 @@ function unobserved(e) {
   disposeChildren(e, true);
 }
 function link(e, t) {
-  const n = t.Ae;
+  const n = t.ke;
   if (n !== null && n.L === e) return;
   let i = null;
   const s = t.m & r;
   if (s) {
     i = n !== null ? n.N : t.W;
     if (i !== null && i.L === e) {
-      t.Ae = i;
+      t.ke = i;
       return;
     }
   }
   const o = e.ve;
-  if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Ae = e.ve = { L: e, k: t, N: i, xe: o, P: null });
+  if (o !== null && o.A === t && (!s || isValidLink(o, t))) return;
+  const u = (t.ke = e.ve = { L: e, A: t, N: i, xe: o, P: null });
   if (n !== null) n.N = u;
   else t.W = u;
   if (o !== null) o.P = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
-  const n = t.Ae;
+  const n = t.ke;
   if (n !== null) {
     let r = t.W;
     do {
@@ -776,7 +781,7 @@ function dispose(e) {
     t = unlinkSubs(t);
   } while (t !== null);
   e.W = null;
-  e.Ae = null;
+  e.ke = null;
   disposeChildren(e, true);
 }
 function disposeChildren(e, t = false, n) {
@@ -793,7 +798,7 @@ function disposeChildren(e, t = false, n) {
         t = unlinkSubs(t);
       } while (t !== null);
       e.W = null;
-      e.Ae = null;
+      e.ke = null;
     }
     disposeChildren(r, true);
     r = e;
@@ -866,7 +871,7 @@ function createOwner(e) {
     Ee: null,
     Le: null,
     fe: t?.fe ?? j,
-    Re: t?.Re || _,
+    He: t?.He || _,
     We: 0,
     Ne: null,
     je: null,
@@ -901,7 +906,7 @@ function effect(e, t, n, r, i) {
     },
     lazy: true
   });
-  o.He = r;
+  o.Re = r;
   o.Qe = t;
   o.Te = n;
   o.Me = undefined;
@@ -937,11 +942,11 @@ function runEffect() {
   this.Me?.();
   this.Me = undefined;
   try {
-    this.Me = this.Qe(this.ae, this.He);
+    this.Me = this.Qe(this.ae, this.Re);
   } catch (e) {
     if (!this.fe.notify(this, d, d)) throw e;
   } finally {
-    this.He = this.ae;
+    this.Re = this.ae;
     this.ue = false;
   }
 }
@@ -973,8 +978,8 @@ function trackedEffect(e, t) {
 GlobalQueue.K = recompute;
 GlobalQueue.U = disposeChildren;
 let I = false;
-let R = false;
 let H = false;
+let R = false;
 let Q = false;
 let T = false;
 let M = false;
@@ -1008,7 +1013,7 @@ function releaseSubtree(e) {
       t = t.Ee;
       continue;
     }
-    if (t.R) {
+    if (t.H) {
       const e = t;
       e.se = false;
       if (e.m & l) {
@@ -1035,7 +1040,7 @@ function clearSnapshots() {
 function recompute(t, n = false) {
   const i = t.oe;
   if (!n) {
-    if (t.ne && (!i || A) && A !== t.ne) j.initTransition(t.ne);
+    if (t.ne && (!i || k) && k !== t.ne) j.initTransition(t.ne);
     deleteFromHeap(t, t.m & o ? P : v);
     if (t.ne || i === g) disposeChildren(t);
     else {
@@ -1052,9 +1057,9 @@ function recompute(t, n = false) {
   const c = !!(t.de & a);
   const p = q;
   q = t;
-  t.Ae = null;
+  t.ke = null;
   t.m = r;
-  t.$ = k;
+  t.$ = A;
   let h = t.ce === S ? t.ae : t.ce;
   let y = t.o;
   let w = I;
@@ -1065,7 +1070,7 @@ function recompute(t, n = false) {
     if (e) F = e;
   }
   try {
-    h = handleAsync(t, t.R(h));
+    h = handleAsync(t, t.H(h));
     clearStatus(t);
     const e = resolveLane(t);
     if (e) {
@@ -1094,7 +1099,7 @@ function recompute(t, n = false) {
     q = p;
   }
   if (!t.Y) {
-    const e = t.Ae;
+    const e = t.ke;
     let r = e !== null ? e.N : t.W;
     if (r !== null) {
       do {
@@ -1107,7 +1112,7 @@ function recompute(t, n = false) {
     const l = !t.be || !t.be(f, h);
     if (l) {
       const e = u ? t.ae : undefined;
-      if (n || (i && A !== t.ne) || s) t.ae = h;
+      if (n || (i && k !== t.ne) || s) t.ae = h;
       else t.ce = h;
       if (u && !s && c) {
         const e = t.Se || 0;
@@ -1121,20 +1126,20 @@ function recompute(t, n = false) {
       t.ce = h;
     } else if (t.o != y) {
       for (let e = t.O; e !== null; e = e.P) {
-        insertIntoHeapHeight(e.k, e.k.m & o ? P : v);
+        insertIntoHeapHeight(e.A, e.A.m & o ? P : v);
       }
     }
   }
   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));
+  (!n || t.de & a) && !t.ne && !(k && t.we) && j.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.W; e; e = e.N) {
       const t = e.L;
       const i = t.I || t;
-      if (i.R) {
+      if (i.H) {
         updateIfNecessary(i);
       }
       if (r.m & n) {
@@ -1142,7 +1147,7 @@ function updateIfNecessary(r) {
       }
     }
   }
-  if (r.m & (n | f) || (r.Y && r.$ < k)) {
+  if (r.m & (n | f) || (r.Y && r.$ < A && !r.me)) {
     recompute(r);
   }
   r.m = e | (r.m & l);
@@ -1157,16 +1162,16 @@ function computed(t, n, r) {
     Pe: r?.unobserved,
     Le: null,
     fe: q?.fe ?? j,
-    Re: q?.Re ?? _,
+    He: q?.He ?? _,
     We: 0,
-    R: t,
+    H: t,
     ae: n,
     o: 0,
-    A: null,
+    k: null,
     h: undefined,
     p: null,
     W: null,
-    Ae: null,
+    ke: null,
     O: null,
     ve: null,
     i: q,
@@ -1174,7 +1179,7 @@ function computed(t, n, r) {
     Ce: null,
     m: r?.lazy ? c : e,
     de: p,
-    $: k,
+    $: A,
     ce: S,
     Ne: null,
     je: null,
@@ -1211,12 +1216,12 @@ function signal(e, t, n = null) {
     ae: e,
     O: null,
     ve: null,
-    $: k,
+    $: A,
     I: n,
-    C: n?.A || null,
+    C: n?.k || null,
     ce: S
   };
-  n && (n.A = r);
+  n && (n.k = r);
   if (V && !r.Fe) {
     r.ie = e === undefined ? w : e;
     D.add(r);
@@ -1236,19 +1241,14 @@ function optimisticComputed(e, t, n) {
 function isEqual(e, t) {
   return e === t;
 }
-let B = false;
-function setStrictRead(e) {
-  const t = B;
-  B = e;
-  return t;
-}
-function untrack(e) {
+function untrack(e, t) {
   if (!I && true) return e();
+  const n = I;
   I = false;
   try {
     return e();
   } finally {
-    I = true;
+    I = n;
   }
 }
 function read(e) {
@@ -1266,7 +1266,7 @@ function read(e) {
       M = n;
     }
     if (t.de & a) return e.ae;
-    if (R && F && t.re) {
+    if (H && F && t.re) {
       const n = findLane(t.re);
       const r = findLane(F);
       if (n !== r && n.T.size > 0) {
@@ -1288,16 +1288,16 @@ function read(e) {
   }
   let t = q;
   if (t?.t) t = t.u;
-  if (H && e.R) recompute(e);
+  if (R && e.H) recompute(e);
   if (e.m & c) {
     e.m &= ~c;
     recompute(e, true);
   }
   const n = e.I || e;
   if (t && I) {
-    if (e.R && e.m & u) recompute(e);
+    if (e.H && e.m & u) recompute(e);
     link(e, t);
-    if (n.R) {
+    if (n.H) {
       const r = e.m & o;
       if (n.o >= (r ? P.j : v.j)) {
         markNode(t);
@@ -1311,7 +1311,7 @@ function read(e) {
     }
   }
   if (n.de & a) {
-    if (t && !(R && n.ne && A !== n.ne)) {
+    if (t && !(H && n.ne && k !== n.ne)) {
       if (F) {
         const r = n.re;
         const i = findLane(F);
@@ -1327,8 +1327,8 @@ function read(e) {
       throw n.Y;
     }
   }
-  if (e.R && e.de & d) {
-    if (e.$ < k) {
+  if (e.H && e.de & d) {
+    if (e.$ < A) {
       recompute(e, true);
       return read(e);
     } else throw e.Y;
@@ -1342,16 +1342,21 @@ function read(e) {
       return r;
     }
   }
-  return !t || F !== null || e.ce === S || (R && e.ne && A !== e.ne) ? e.ae : e.ce;
+  return !t ||
+    (F !== null && (e.we || e.re || n === e || !!(n.de & a))) ||
+    e.ce === S ||
+    (H && e.ne && k !== e.ne)
+    ? e.ae
+    : e.ce;
 }
 function setSignal(e, t) {
-  if (e.ne && A !== e.ne) j.initTransition(e.ne);
+  if (e.ne && k !== 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) || !!(e.de & p);
   if (!i) {
-    if (n && e.ce !== S && e.R) {
+    if (n && e.ce !== S && e.H) {
       insertSubs(e, true);
       schedule();
     }
@@ -1380,7 +1385,7 @@ function setSignal(e, t) {
   if (e._e) {
     setSignal(e._e, t);
   }
-  e.$ = k;
+  e.$ = A;
   insertSubs(e, n);
   schedule();
   return t;
@@ -1455,12 +1460,12 @@ function getLatestValueComputed(e) {
   return e._e;
 }
 function staleValues(e, t = true) {
-  const n = R;
-  R = t;
+  const n = H;
+  H = t;
   try {
     return e();
   } finally {
-    R = n;
+    H = n;
   }
 }
 function latest(e) {
@@ -1488,8 +1493,8 @@ function isPending(e) {
   }
 }
 function refresh(e) {
-  let t = H;
-  H = true;
+  let t = R;
+  R = true;
   try {
     if (typeof e !== "function") {
       recompute(e[O]);
@@ -1497,14 +1502,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 };
@@ -1513,7 +1518,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Re[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.He[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1523,10 +1528,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Re = { ...n.Re, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.He = { ...n.He, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Re[e.id]);
+  return !isUndefined(t?.He[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1542,7 +1547,7 @@ function action(e) {
     new Promise((n, r) => {
       const i = e(...t);
       j.initTransition();
-      let s = A;
+      let s = k;
       s.ee.push(i);
       const done = (e, t) => {
         s = currentTransition(s);
@@ -1644,7 +1649,7 @@ function onSettled(e) {
       });
 }
 function unwrap(e) {
-  return e?.[U]?.[te] ?? e;
+  return e?.[z]?.[ee] ?? e;
 }
 function getOverrideValue(e, t, n, r, i) {
   if (i && r in i) return i[r];
@@ -1656,16 +1661,16 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n, r) {
-  const i = t?.[U];
+  const i = t?.[z];
   if (!i) return;
-  const s = i[Z];
-  const o = i[$];
-  const u = i[ee];
-  let f = i[te];
+  const s = i[Y];
+  const o = i[Z];
+  const u = i[$];
+  let f = i[ee];
   if (e === s && !o && !u) return;
-  (i[ie] || ue).set(e, i[J]);
-  i[Z] = e;
-  i[$] = 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);
@@ -1693,16 +1698,16 @@ function applyState(e, t, n, r) {
       if (d > h || d > p) {
         for (a = d; a <= h; a++) {
           t = true;
-          i[te][a] && setSignal(i[te][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[te][a] && setSignal(i[te][a], s);
+          i[ee][a] && setSignal(i[ee][a], s);
           applyState(e[a], s, n, r);
         }
-        t && i[te][K] && setSignal(i[te][K], void 0);
-        l !== e.length && i[te].length && setSignal(i[te].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);
@@ -1726,26 +1731,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[te][a] && setSignal(i[te][a], t);
+          i[ee][a] && setSignal(i[ee][a], t);
           applyState(e[a], t, n, r);
-        } else i[te][a] && setSignal(i[te][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[te][t] && setSignal(i[te][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[te].length && setSignal(i[te].length, e.length);
+      i[ee].length && setSignal(i[ee].length, e.length);
     }
-    t && i[te][K] && setSignal(i[te][K], void 0);
+    t && i[ee][G] && setSignal(i[ee][G], void 0);
     return;
   }
   if (f) {
-    const t = f[K];
+    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];
@@ -1759,7 +1764,7 @@ function applyState(e, t, n, r) {
       } else applyState(h, wrap(p, i), n, r);
     }
   }
-  if ((f = i[ne])) {
+  if ((f = i[te])) {
     const t = Object.keys(f);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -1781,9 +1786,9 @@ function createProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[re] = wrapProjection;
-    e[ie] = i;
-    Object.defineProperty(e, se, {
+    e[ne] = wrapProjection;
+    e[re] = i;
+    Object.defineProperty(e, ie, {
       get() {
         return r;
       },
@@ -1792,29 +1797,28 @@ function createProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[U]?.[re] === wrapProjection) return e;
-    const t = createStoreProxy(e, ce, 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, G), 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);
       });
       i !== r && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
-  r.ke = true;
+  r.Ae = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
   return createProjectionInternal(e, t, n).store;
 }
-const G = {
+const B = {
   get(e, t) {
     let n;
     setWriteOverride(true);
@@ -1825,7 +1829,7 @@ const G = {
       setWriteOverride(false);
       setProjectionWriteActive(false);
     }
-    return typeof n === "object" && n !== null ? new Proxy(n, G) : n;
+    return typeof n === "object" && n !== null ? new Proxy(n, B) : n;
   },
   set(e, t, n) {
     setWriteOverride(true);
@@ -1850,46 +1854,46 @@ const G = {
     return true;
   }
 };
-const K = Symbol(0),
+const G = Symbol(0),
+  K = Symbol(0),
   z = Symbol(0),
   U = Symbol(0),
-  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) {
+  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[J] = new Proxy(r, t));
+  return (r[U] = new Proxy(r, t));
 }
-const ue = new WeakMap();
+const oe = new WeakMap();
 function wrap(e, t) {
-  if (t?.[re]) return t[re](e, t);
-  let n = e[J] || ue.get(e);
-  if (!n) ue.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 fe = false;
+let ue = false;
 function setWriteOverride(e) {
-  fe = e;
+  ue = e;
 }
 function writeOnly(e) {
-  return fe || !!le?.has(e);
+  return ue || !!fe?.has(e);
 }
 function getNodes(e, t) {
   let n = e[t];
@@ -1916,8 +1920,8 @@ function getNode(e, t, n, r, i = isEqual, s, o) {
   }
   return (e[t] = u);
 }
-function trackSelf(e, t = K) {
-  getObserver() && read(getNode(getNodes(e, te), t, undefined, e[se], false, e[oe]));
+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)));
@@ -1925,7 +1929,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] !== X) i.add(e);
+    if (t[e] !== J) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -1933,70 +1937,70 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === X) return void 0;
+    if (r[n] === J) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let le = null;
-const ce = {
+let fe = null;
+const le = {
   get(e, t, n) {
-    if (t === U) return e;
-    if (t === J) return n;
-    if (t === O) return e[se];
-    if (t === K || t === z) {
+    if (t === z) return e;
+    if (t === U) return n;
+    if (t === O) return e[ie];
+    if (t === G || t === K) {
       trackSelf(e, t);
       return n;
     }
-    const r = getNodes(e, te);
+    const r = getNodes(e, ee);
     const i = r[t];
-    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];
+    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 !== S ? (i.we ? i.ae : i.ce) : i.ae) : f[t];
-      n === X && (n = undefined);
+      n === J && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      le?.add(r);
+      fe?.add(r);
       return r;
     }
     let l = i ? (o || !u ? read(r[t]) : (read(r[t]), f[t])) : f[t];
-    l === X && (l = undefined);
+    l === J && (l = undefined);
     if (!i) {
       if (!o && typeof l === "function" && !f.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[Z]) && (t = Object.getPrototypeOf(e[Z])) && 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[se], isEqual, e[oe], e[m]));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[ie], isEqual, e[se], e[m]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    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]));
+    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[J];
+    const r = e[U];
     if (writeOnly(r)) {
-      if (e[oe]) {
-        const t = e[se];
+      if (e[se]) {
+        const t = e[ie];
         if (t?.ne) {
           j.initTransition(t.ne);
         }
       }
       untrack(() => {
-        const i = e[Z];
+        const i = e[Y];
         const s = i[t];
         if (V && typeof t !== "symbol") {
           if (!e[m]) {
@@ -2007,23 +2011,23 @@ const ce = {
             e[m][t] = s;
           }
         }
-        const o = e[oe] && !E;
-        const u = o ? ee : $;
+        const o = e[se] && !E;
+        const u = o ? $ : Z;
         if (o) trackOptimisticStore(r);
-        const f = e[ee] && t in e[ee] ? e[ee][t] : e[$] && t in e[$] ? e[$][t] : s;
-        const l = n?.[U]?.[Z] ?? 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[ee]?.length || e[$]?.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 = Y.get(f);
-          e && (e instanceof Set ? e.delete(r) : Y.delete(f));
+          const e = X.get(f);
+          e && (e instanceof Set ? e.delete(r) : X.delete(f));
         }
-        if (recursivelyNotify(r, ue) && a) recursivelyAddParent(l, r);
-        e[ne]?.[t] && setSignal(e[ne][t], true);
-        const d = getNodes(e, te);
+        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") {
@@ -2033,44 +2037,44 @@ const ce = {
             if (e > c) d.length && setSignal(d.length, e);
           }
         }
-        d[K] && setSignal(d[K], undefined);
+        d[G] && setSignal(d[G], undefined);
       });
     }
     return true;
   },
   deleteProperty(e, t) {
-    const n = e[ee]?.[t] === X;
-    const r = e[$]?.[t] === X;
-    if (writeOnly(e[J]) && !n && !r) {
+    const n = e[$]?.[t] === J;
+    const r = e[Z]?.[t] === J;
+    if (writeOnly(e[U]) && !n && !r) {
       untrack(() => {
-        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;
+        const n = e[se] && !E;
+        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 = Y.get(i);
-          t && (t instanceof Set ? t.delete(e) : Y.delete(i));
+          const t = X.get(i);
+          t && (t instanceof Set ? t.delete(e) : X.delete(i));
         }
-        if (e[ne]?.[t]) setSignal(e[ne][t], false);
-        const s = getNodes(e, te);
+        if (e[te]?.[t]) setSignal(e[te][t], false);
+        const s = getNodes(e, ee);
         s[t] && setSignal(s[t], undefined);
-        s[K] && setSignal(s[K], undefined);
+        s[G] && setSignal(s[G], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    let t = getKeys(e[Z], e[$], false);
-    if (e[ee]) {
+    let t = getKeys(e[Y], e[Z], false);
+    if (e[$]) {
       const n = new Set(t);
-      for (const t of Reflect.ownKeys(e[ee])) {
-        if (e[ee][t] !== X) 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);
@@ -2078,25 +2082,25 @@ const ce = {
     return t;
   },
   getOwnPropertyDescriptor(e, 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 (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[ee][t] };
+        return { ...n, value: e[$][t] };
       }
-      return { value: e[ee][t], writable: true, enumerable: true, configurable: true };
+      return { value: e[$][t], writable: true, enumerable: true, configurable: true };
     }
-    return getPropertyDescriptor(e[Z], e[$], t);
+    return getPropertyDescriptor(e[Y], e[Z], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[Z]);
+    return Object.getPrototypeOf(e[Y]);
   }
 };
 function storeSetter(e, t) {
-  const n = le;
-  le = new Set();
-  le.add(e);
+  const n = fe;
+  fe = new Set();
+  fe.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -2112,8 +2116,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    le.clear();
-    le = n;
+    fe.clear();
+    fe = n;
   }
 }
 function createStore(e, t, n) {
@@ -2122,17 +2126,17 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function recursivelyNotify(e, t) {
-  let n = e[U] || t?.get(e)?.[U];
+  let n = e[z] || t?.get(e)?.[z];
   let r = false;
   if (n) {
-    const e = getNodes(n, te)[z];
+    const e = getNodes(n, ee)[K];
     if (e) {
       setSignal(e, undefined);
       r = true;
     }
-    t = n[ie] || t;
+    t = n[re] || t;
   }
-  const i = Y.get(n?.[Z] || 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;
@@ -2141,16 +2145,16 @@ function recursivelyNotify(e, t) {
 }
 function recursivelyAddParent(e, t) {
   let n;
-  const r = e[U];
+  const r = e[z];
   if (r) {
-    n = r[$];
-    e = r[Z];
+    n = r[Z];
+    e = r[Y];
   }
   if (t) {
-    let n = Y.get(e);
-    if (!n) Y.set(e, t);
+    let n = X.get(e);
+    if (!n) X.set(e, t);
     else if (n !== t) {
-      if (!(n instanceof Set)) Y.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;
@@ -2172,7 +2176,7 @@ function recursivelyAddParent(e, t) {
 }
 function deep(e) {
   recursivelyAddParent(e);
-  return e[z];
+  return e[K];
 }
 function createOptimisticStore(e, t, n) {
   GlobalQueue.J ||= clearOptimisticStore;
@@ -2183,39 +2187,39 @@ function createOptimisticStore(e, t, n) {
   return [o, e => storeSetter(o, e)];
 }
 function clearOptimisticStore(e) {
-  const t = e[U];
-  if (!t || !t[ee]) return;
-  const n = t[ee];
-  const r = t[te];
+  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[$] && e in t[$] ? t[$][e] : t[Z][e];
-          const i = n === X ? 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[K]) {
-        r[K].re = undefined;
-        setSignal(r[K], undefined);
+      if (r[G]) {
+        r[G].re = undefined;
+        setSignal(r[G], undefined);
       }
     }
   } finally {
     setProjectionWriteActive(false);
   }
-  delete t[ee];
+  delete t[$];
 }
 function createOptimisticProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
   const wrapper = e => {
-    e[re] = wrapProjection;
-    e[ie] = i;
-    e[oe] = true;
-    Object.defineProperty(e, se, {
+    e[ne] = wrapProjection;
+    e[re] = i;
+    e[se] = true;
+    Object.defineProperty(e, ie, {
       get() {
         return r;
       },
@@ -2224,8 +2228,8 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
   };
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[U]?.[re] === wrapProjection) return e;
-    const t = createStoreProxy(e, ce, wrapper);
+    if (e[z]?.[ne] === wrapProjection) return e;
+    const t = createStoreProxy(e, le, wrapper);
     i.set(e, t);
     return t;
   };
@@ -2235,7 +2239,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       const t = getOwner();
       setProjectionWriteActive(true);
       try {
-        storeSetter(new Proxy(s, G), r => {
+        storeSetter(new Proxy(s, B), r => {
           const i = handleAsync(t, e(r), e => {
             setProjectionWriteActive(true);
             try {
@@ -2250,11 +2254,11 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.ke = true;
+    r.Ae = true;
   }
   return { store: s, node: r };
 }
-const ae = Symbol(0);
+const ce = Symbol(0);
 function updatePath(e, t, n = 0) {
   let r,
     i = e;
@@ -2298,7 +2302,7 @@ function updatePath(e, t, n = 0) {
     if (s === i) return;
   }
   if (r === undefined && s == undefined) return;
-  if (s === ae) {
+  if (s === ce) {
     delete e[r];
   } else if (r === undefined || (isWrappable(i) && isWrappable(s) && !Array.isArray(s))) {
     const t = r !== undefined ? e[r] : e;
@@ -2308,25 +2312,25 @@ function updatePath(e, t, n = 0) {
     e[r] = s;
   }
 }
-const de = Object.assign(
+const ae = Object.assign(
   function storePath(...e) {
     return t => {
       updatePath(t, e);
     };
   },
-  { DELETE: ae }
+  { 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[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;
+  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);
@@ -2335,7 +2339,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 === X) continue;
+      if (f === J) continue;
       if ((u = snapshot(f, t, n)) !== f || o) {
         if (!o) t.set(e, (o = [...e]));
         o[i] = u;
@@ -2362,13 +2366,13 @@ function snapshot(e, t, n) {
 function trueFn() {
   return true;
 }
-const pe = {
+const de = {
   get(e, t, n) {
-    if (t === J) return n;
+    if (t === U) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === J) return true;
+    if (t === U) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -2391,15 +2395,15 @@ const pe = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const he = 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 && J in i);
-    const s = !!i && i[he];
+    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);
   }
@@ -2407,7 +2411,7 @@ function merge(...e) {
     return new Proxy(
       {
         get(e) {
-          if (e === he) 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];
@@ -2425,7 +2429,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      pe
+      de
     );
   }
   const r = Object.create(null);
@@ -2457,12 +2461,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[he] = n;
+  o[pe] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (b && J in e) {
+  if (b && U in e) {
     return new Proxy(
       {
         get(t) {
@@ -2475,7 +2479,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      pe
+      de
     );
   }
   const r = {};
@@ -2509,18 +2513,18 @@ function mapArray(e, t, n) {
     })
   );
 }
-const ye = { pureWrite: true };
+const he = { pureWrite: true };
 function updateKeyedMap() {
   const e = this.Ge() || [],
     t = e.length;
-  e[K];
+  e[G];
   runWithOwner(this.De, () => {
     let n,
       r,
       i = this.Ye
         ? () => {
-            this.Ye[r] = signal(e[r], ye);
-            this.Ze && (this.Ze[r] = signal(r, ye));
+            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
@@ -2529,7 +2533,7 @@ function updateKeyedMap() {
         : this.Ze
           ? () => {
               const t = e[r];
-              this.Ze[r] = signal(r, ye);
+              this.Ze[r] = signal(r, he);
               return this.ze(() => t, read.bind(null, this.Ze[r]));
             }
           : () => {
@@ -2705,7 +2709,7 @@ function boundaryComputed(e, t) {
     n.fe.notify(n, n.rt, r, i);
   };
   n.rt = t;
-  n.ke = true;
+  n.Ae = true;
   recompute(n, true);
   return n;
 }
@@ -2829,9 +2833,10 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = J;
-exports.$TARGET = U;
-exports.$TRACK = K;
+exports.$PROXY = U;
+exports.$REFRESH = O;
+exports.$TARGET = z;
+exports.$TRACK = G;
 exports.ContextNotFoundError = ContextNotFoundError;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
@@ -2880,8 +2885,8 @@ exports.repeat = repeat;
 exports.resolve = resolve;
 exports.runWithOwner = runWithOwner;
 exports.setContext = setContext;
+exports.setOnUnhandledAsync = setOnUnhandledAsync;
 exports.setSnapshotCapture = setSnapshotCapture;
-exports.setStrictRead = setStrictRead;
 exports.snapshot = snapshot;
-exports.storePath = de;
+exports.storePath = ae;
 exports.untrack = untrack;