@solidjs/signals 0.13.6 → 0.13.8

package/dist/node.cjs

@@ -44,8 +44,8 @@ const S = {};
 const w = {};
 const m = "sp";
 const b = typeof Proxy === "function";
-const _ = {};
-const O = Symbol("refresh");
+const O = {};
+const _ = Symbol("refresh");
 function actualInsertIntoHeap(e, t) {
   const n = (e.i?.t ? e.i.u?.o : e.i?.o) ?? -1;
   if (n >= e.o) e.o = n + 1;
@@ -92,8 +92,8 @@ function deleteFromHeap(e, t) {
   e.h = undefined;
 }
 function markHeap(e) {
-  if (e._) return;
-  e._ = true;
+  if (e.O) return;
+  e.O = true;
   for (let t = 0; t <= e.S; t++) {
     for (let n = e.l[t]; n !== undefined; n = n.h) {
       if (n.m & i) markNode(n);
@@ -104,19 +104,19 @@ function markNode(e, r = n) {
   const i = e.m;
   if ((i & (t | n)) >= r) return;
   e.m = (i & -4) | r;
-  for (let n = e.O; n !== null; n = n.P) {
+  for (let n = e._; n !== null; n = n.P) {
     markNode(n.k, t);
   }
-  if (e.C !== null) {
-    for (let n = e.C; n !== null; n = n.W) {
-      for (let e = n.O; e !== null; e = e.P) {
+  if (e.W !== null) {
+    for (let n = e.W; n !== null; n = n.C) {
+      for (let e = n._; e !== null; e = e.P) {
         markNode(e.k, t);
       }
     }
   }
 }
 function runHeap(e, t) {
-  e._ = false;
+  e.O = false;
   for (e.j = 0; e.j <= e.S; e.j++) {
     let n = e.l[e.j];
     while (n !== undefined) {
@@ -137,18 +137,18 @@ function adjustHeight(e, t) {
   }
   if (e.o !== n) {
     e.o = n;
-    for (let n = e.O; n !== null; n = n.P) {
+    for (let n = e._; n !== null; n = n.P) {
       insertIntoHeapHeight(n.k, t);
     }
   }
 }
 const x = new Set();
-const P = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
-const v = { l: new Array(2e3).fill(undefined), _: false, j: 0, S: 0 };
+const P = { l: new Array(2e3).fill(undefined), O: false, j: 0, S: 0 };
+const v = { l: new Array(2e3).fill(undefined), O: false, j: 0, S: 0 };
 let E = 0;
 let k = null;
-let C = false;
 let W = false;
+let C = false;
 let j = null;
 function enforceLoadingBoundary(e) {}
 function shouldReadStashedOptimisticValue(e) {
@@ -165,7 +165,7 @@ function runLaneEffects(e) {
   }
 }
 function queueStashedOptimisticEffects(e) {
-  for (let t = e.O; t !== null; t = t.P) {
+  for (let t = e._; t !== null; t = t.P) {
     const e = t.k;
     if (!e.D) continue;
     if (e.D === y) {
@@ -181,7 +181,7 @@ function queueStashedOptimisticEffects(e) {
   }
 }
 function setProjectionWriteActive(e) {
-  W = e;
+  C = e;
 }
 function mergeTransitionState(e, t) {
   t.B = e;
@@ -227,9 +227,9 @@ function cleanupCompletedLanes(e) {
   }
 }
 function schedule() {
-  if (C) return;
-  C = true;
-  if (!A.ne && !W) queueMicrotask(flush);
+  if (W) return;
+  W = true;
+  if (!A.ne && !C) queueMicrotask(flush);
 }
 class Queue {
   i = null;
@@ -319,7 +319,7 @@ class GlobalQueue extends Queue {
           runLaneEffects(g);
           this.stashQueues(e.ce);
           E++;
-          C = P.S >= P.j;
+          W = P.S >= P.j;
           reassignPendingTransition(e.se);
           k = null;
           if (!e.G.length && e.U.length) {
@@ -350,7 +350,7 @@ class GlobalQueue extends Queue {
         finalizePureQueue();
       }
       E++;
-      C = P.S >= P.j;
+      W = P.S >= P.j;
       runLaneEffects(h);
       this.run(h);
       runLaneEffects(g);
@@ -426,7 +426,7 @@ class GlobalQueue extends Queue {
 function insertSubs(e, t = false) {
   const n = e.Y || M;
   const r = e.pe !== undefined;
-  for (let i = e.O; i !== null; i = i.P) {
+  for (let i = e._; i !== null; i = i.P) {
     if (r && i.k.he) {
       i.k.m |= c;
       continue;
@@ -504,7 +504,7 @@ function flush() {
   if (A.ne) {
     return;
   }
-  while (C || k) {
+  while (W || k) {
     A.flush();
   }
 }
@@ -620,39 +620,230 @@ function assignOrMergeLane(e, t) {
   }
   e.Y = t;
 }
+function unlinkSubs(e) {
+  const t = e.L;
+  const n = e.N;
+  const r = e.P;
+  const i = e.me;
+  if (r !== null) r.me = i;
+  else t.be = i;
+  if (i !== null) i.P = r;
+  else {
+    t._ = r;
+    if (r === null) {
+      t.Oe?.();
+      t.R && !t._e && !(t.m & o) && unobserved(t);
+    }
+  }
+  return n;
+}
+function unobserved(e) {
+  deleteFromHeap(e, e.m & o ? v : P);
+  let t = e.A;
+  while (t !== null) {
+    t = unlinkSubs(t);
+  }
+  e.A = null;
+  disposeChildren(e, true);
+}
+function link(e, t) {
+  const n = t.xe;
+  if (n !== null && n.L === e) return;
+  let i = null;
+  const s = t.m & r;
+  if (s) {
+    i = n !== null ? n.N : t.A;
+    if (i !== null && i.L === e) {
+      t.xe = i;
+      return;
+    }
+  }
+  const o = e.be;
+  if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
+  const u = (t.xe = e.be = { L: e, k: t, N: i, me: o, P: null });
+  if (n !== null) n.N = u;
+  else t.A = u;
+  if (o !== null) o.P = u;
+  else e._ = u;
+}
+function isValidLink(e, t) {
+  const n = t.xe;
+  if (n !== null) {
+    let r = t.A;
+    do {
+      if (r === e) return true;
+      if (r === n) break;
+      r = r.N;
+    } while (r !== null);
+  }
+  return false;
+}
+const I = {};
+function markDisposal(e) {
+  let t = e.Pe;
+  while (t) {
+    t.m |= o;
+    if (t.m & i) {
+      deleteFromHeap(t, P);
+      insertIntoHeap(t, v);
+    }
+    markDisposal(t);
+    t = t.ve;
+  }
+}
+function dispose(e) {
+  let t = e.A || null;
+  do {
+    t = unlinkSubs(t);
+  } while (t !== null);
+  e.A = null;
+  e.xe = null;
+  disposeChildren(e, true);
+}
+function disposeChildren(e, t = false, n) {
+  if (e.m & u) return;
+  if (t) e.m = u;
+  if (t && e.R) e.Ee = null;
+  let r = n ? e.ke : e.Pe;
+  while (r) {
+    const e = r.ve;
+    if (r.A) {
+      const e = r;
+      deleteFromHeap(e, e.m & o ? v : P);
+      let t = e.A;
+      do {
+        t = unlinkSubs(t);
+      } while (t !== null);
+      e.A = null;
+      e.xe = null;
+    }
+    disposeChildren(r, true);
+    r = e;
+  }
+  if (n) {
+    e.ke = null;
+  } else {
+    e.Pe = null;
+    e.We = 0;
+  }
+  runDisposal(e, n);
+}
+function runDisposal(e, t) {
+  let n = t ? e.Ce : e.je;
+  if (!n) return;
+  if (Array.isArray(n)) {
+    for (let e = 0; e < n.length; e++) {
+      const t = n[e];
+      t.call(t);
+    }
+  } else {
+    n.call(n);
+  }
+  t ? (e.Ce = null) : (e.je = null);
+}
+function childId(e, t) {
+  let n = e;
+  while (n.Ae && n.i) n = n.i;
+  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) {
+  return childId(e, true);
+}
+function peekNextChildId(e) {
+  return childId(e, false);
+}
+function formatId(e, t) {
+  const n = t.toString(36),
+    r = n.length - 1;
+  return e + (r ? String.fromCharCode(64 + r) : "") + n;
+}
+function getObserver() {
+  if (q || F) return I;
+  return T ? V : null;
+}
+function getOwner() {
+  return V;
+}
+function cleanup(e) {
+  if (!V) return e;
+  if (!V.je) V.je = e;
+  else if (Array.isArray(V.je)) V.je.push(e);
+  else V.je = [V.je, e];
+  return e;
+}
+function isDisposed(e) {
+  return !!(e.m & (u | o));
+}
+function createOwner(e) {
+  const t = V;
+  const n = e?.transparent ?? false;
+  const r = {
+    id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
+    Ae: n || undefined,
+    t: true,
+    u: t?.t ? t.u : t,
+    Pe: null,
+    ve: null,
+    je: null,
+    V: t?.V ?? A,
+    Ne: t?.Ne || O,
+    We: 0,
+    Ce: null,
+    ke: null,
+    i: t,
+    dispose(e = true) {
+      disposeChildren(r, e);
+    }
+  };
+  if (t) {
+    const e = t.Pe;
+    if (e === null) {
+      t.Pe = r;
+    } else {
+      r.ve = e;
+      t.Pe = r;
+    }
+  }
+  return r;
+}
+function createRoot(e, t) {
+  const n = createOwner(t);
+  return runWithOwner(n, () => e(n.dispose));
+}
 function addPendingSource(e, t) {
-  if (e.me === t || e.be?.has(t)) return false;
-  if (!e.me) {
-    e.me = t;
+  if (e.Le === t || e.Ie?.has(t)) return false;
+  if (!e.Le) {
+    e.Le = t;
     return true;
   }
-  if (!e.be) {
-    e.be = new Set([e.me, t]);
+  if (!e.Ie) {
+    e.Ie = new Set([e.Le, t]);
   } else {
-    e.be.add(t);
+    e.Ie.add(t);
   }
-  e.me = undefined;
+  e.Le = undefined;
   return true;
 }
 function removePendingSource(e, t) {
-  if (e.me) {
-    if (e.me !== t) return false;
-    e.me = undefined;
+  if (e.Le) {
+    if (e.Le !== t) return false;
+    e.Le = undefined;
     return true;
   }
-  if (!e.be?.delete(t)) return false;
-  if (e.be.size === 1) {
-    e.me = e.be.values().next().value;
-    e.be = undefined;
-  } else if (e.be.size === 0) {
-    e.be = undefined;
+  if (!e.Ie?.delete(t)) return false;
+  if (e.Ie.size === 1) {
+    e.Le = e.Ie.values().next().value;
+    e.Ie = undefined;
+  } else if (e.Ie.size === 0) {
+    e.Ie = undefined;
   }
   return true;
 }
 function clearPendingSources(e) {
-  e.me = undefined;
-  e.be?.clear();
-  e.be = undefined;
+  e.Le = undefined;
+  e.Ie?.clear();
+  e.Ie = undefined;
 }
 function setPendingError(e, t, n) {
   if (!t) {
@@ -669,9 +860,9 @@ function setPendingError(e, t, n) {
   }
 }
 function forEachDependent(e, t) {
-  for (let n = e.O; n !== null; n = n.P) t(n.k);
-  for (let n = e.C; n !== null; n = n.W) {
-    for (let e = n.O; e !== null; e = e.P) t(e.k);
+  for (let n = e._; n !== null; n = n.P) t(n.k);
+  for (let n = e.W; n !== null; n = n.C) {
+    for (let e = n._; e !== null; e = e.P) t(e.k);
   }
 }
 function settlePendingSource(e) {
@@ -681,7 +872,7 @@ function settlePendingSource(e) {
     if (n.has(r) || !removePendingSource(r, e)) return;
     n.add(r);
     r.de = E;
-    const i = r.me ?? r.be?.values().next().value;
+    const i = r.Le ?? r.Ie?.values().next().value;
     if (i) {
       setPendingError(r, i);
       updatePendingSignal(r);
@@ -689,7 +880,7 @@ function settlePendingSource(e) {
       r.ge &= ~a;
       setPendingError(r);
       updatePendingSignal(r);
-      if (r._e) {
+      if (r.Re) {
         if (r.D === y) {
           const e = r;
           if (!e.F) {
@@ -703,7 +894,7 @@ function settlePendingSource(e) {
         }
         t = true;
       }
-      r._e = false;
+      r.Re = false;
     }
     forEachDependent(r, settle);
   };
@@ -715,19 +906,19 @@ function handleAsync(e, t, r) {
   const s = i && untrack(() => t[Symbol.asyncIterator]);
   const o = !s && i && untrack(() => typeof t.then === "function");
   if (!o && !s) {
-    e.Oe = null;
+    e.Ee = null;
     return t;
   }
-  e.Oe = t;
+  e.Ee = t;
   let u;
   const handleError = n => {
-    if (e.Oe !== t) return;
+    if (e.Ee !== t) return;
     A.initTransition(resolveTransition(e));
     notifyStatus(e, n instanceof NotReadyError ? a : d, n);
     e.de = E;
   };
   const asyncWrite = (i, s) => {
-    if (e.Oe !== t) return;
+    if (e.Ee !== t) return;
     if (e.m & (n | f)) return;
     A.initTransition(resolveTransition(e));
     clearStatus(e);
@@ -743,12 +934,12 @@ function handleAsync(e, t, r) {
       e.de = E;
     } else if (o) {
       const t = e.$;
-      const n = e.xe;
+      const n = e.Te;
       if (!n || !n(i, t)) {
         e.$ = i;
         e.de = E;
-        if (e.Pe) {
-          setSignal(e.Pe, i);
+        if (e.He) {
+          setSignal(e.He, i);
         }
         insertSubs(e, true);
       }
@@ -783,35 +974,53 @@ function handleAsync(e, t, r) {
   if (s) {
     const n = t[Symbol.asyncIterator]();
     let r = false;
+    let i = false;
+    cleanup(() => {
+      if (i) return;
+      i = true;
+      try {
+        const e = n.return?.();
+        if (e && typeof e.then === "function") {
+          e.then(undefined, () => {});
+        }
+      } catch {}
+    });
     const iterate = () => {
-      let e,
-        t = false,
-        i = true;
+      let s,
+        o = false,
+        f = true;
       n.next().then(
         n => {
-          if (i) {
-            e = n;
-            t = true;
+          if (f) {
+            s = n;
+            o = true;
+            if (n.done) i = true;
+          } else if (e.Ee !== t) {
+            return;
           } else if (!n.done) asyncWrite(n.value, iterate);
           else {
+            i = true;
             schedule();
             flush();
           }
         },
-        e => {
-          if (!i) handleError(e);
+        n => {
+          if (!f && e.Ee === t) {
+            i = true;
+            handleError(n);
+          }
         }
       );
-      i = false;
-      if (t && !e.done) {
-        u = e.value;
+      f = false;
+      if (o && !s.done) {
+        u = s.value;
         r = true;
         return iterate();
       }
-      return t && e.done;
+      return o && s.done;
     };
-    const i = iterate();
-    if (!r && !i) {
+    const s = iterate();
+    if (!r && !s) {
       A.initTransition(resolveTransition(e));
       throw new NotReadyError(V);
     }
@@ -820,11 +1029,11 @@ function handleAsync(e, t, r) {
 }
 function clearStatus(e, t = false) {
   clearPendingSources(e);
-  e._e = false;
+  e.Re = false;
   e.ge = t ? 0 : e.ge & p;
   setPendingError(e);
   updatePendingSignal(e);
-  e.ve?.();
+  e.Qe?.();
 }
 function notifyStatus(e, t, n, r, i) {
   if (t === d && !(n instanceof StatusError) && !(n instanceof NotReadyError))
@@ -850,34 +1059,34 @@ function notifyStatus(e, t, n, r, i) {
   }
   const c = r || f;
   const l = r || u ? undefined : i;
-  if (e.ve) {
+  if (e.Qe) {
     if (r && t === a) {
       return;
     }
     if (c) {
-      e.ve(t, n);
+      e.Qe(t, n);
     } else {
-      e.ve();
+      e.Qe();
     }
     return;
   }
   forEachDependent(e, e => {
     e.de = E;
     if (
-      (t === a && s && e.me !== s && !e.be?.has(s)) ||
-      (t !== a && (e.ae !== n || e.me || e.be))
+      (t === a && s && e.Le !== s && !e.Ie?.has(s)) ||
+      (t !== a && (e.ae !== n || e.Le || e.Ie))
     ) {
       if (!c && !e.K) A.se.push(e);
       notifyStatus(e, t, n, c, l);
     }
   });
 }
-let I = null;
+let R = null;
 function enableExternalSource(e) {
   const { factory: t, untrack: n = e => e() } = e;
-  if (I) {
-    const { factory: e, untrack: r } = I;
-    I = {
+  if (R) {
+    const { factory: e, untrack: r } = R;
+    R = {
       factory: (n, r) => {
         const i = e(n, r);
         const s = t(e => i.track(e), r);
@@ -892,199 +1101,9 @@ function enableExternalSource(e) {
       untrack: e => r(() => n(e))
     };
   } else {
-    I = { factory: t, untrack: n };
+    R = { factory: t, untrack: n };
   }
 }
-const R = {};
-function markDisposal(e) {
-  let t = e.Ee;
-  while (t) {
-    t.m |= o;
-    if (t.m & i) {
-      deleteFromHeap(t, P);
-      insertIntoHeap(t, v);
-    }
-    markDisposal(t);
-    t = t.ke;
-  }
-}
-function dispose(e) {
-  let t = e.A || null;
-  do {
-    t = unlinkSubs(t);
-  } while (t !== null);
-  e.A = null;
-  e.Ce = null;
-  disposeChildren(e, true);
-}
-function disposeChildren(e, t = false, n) {
-  if (e.m & u) return;
-  if (t) e.m = u;
-  let r = n ? e.We : e.Ee;
-  while (r) {
-    const e = r.ke;
-    if (r.A) {
-      const e = r;
-      deleteFromHeap(e, e.m & o ? v : P);
-      let t = e.A;
-      do {
-        t = unlinkSubs(t);
-      } while (t !== null);
-      e.A = null;
-      e.Ce = null;
-    }
-    disposeChildren(r, true);
-    r = e;
-  }
-  if (n) {
-    e.We = null;
-  } else {
-    e.Ee = null;
-    e.je = 0;
-  }
-  runDisposal(e, n);
-}
-function runDisposal(e, t) {
-  let n = t ? e.Ae : e.Ne;
-  if (!n) return;
-  if (Array.isArray(n)) {
-    for (let e = 0; e < n.length; e++) {
-      const t = n[e];
-      t.call(t);
-    }
-  } else {
-    n.call(n);
-  }
-  t ? (e.Ae = null) : (e.Ne = null);
-}
-function childId(e, t) {
-  let n = e;
-  while (n.Le && n.i) n = n.i;
-  if (n.id != null) return formatId(n.id, t ? n.je++ : n.je);
-  throw new Error("Cannot get child id from owner without an id");
-}
-function getNextChildId(e) {
-  return childId(e, true);
-}
-function peekNextChildId(e) {
-  return childId(e, false);
-}
-function formatId(e, t) {
-  const n = t.toString(36),
-    r = n.length - 1;
-  return e + (r ? String.fromCharCode(64 + r) : "") + n;
-}
-function getObserver() {
-  if (q || F) return R;
-  return T ? V : null;
-}
-function getOwner() {
-  return V;
-}
-function cleanup(e) {
-  if (!V) return e;
-  if (!V.Ne) V.Ne = e;
-  else if (Array.isArray(V.Ne)) V.Ne.push(e);
-  else V.Ne = [V.Ne, e];
-  return e;
-}
-function isDisposed(e) {
-  return !!(e.m & (u | o));
-}
-function createOwner(e) {
-  const t = V;
-  const n = e?.transparent ?? false;
-  const r = {
-    id: e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined),
-    Le: n || undefined,
-    t: true,
-    u: t?.t ? t.u : t,
-    Ee: null,
-    ke: null,
-    Ne: null,
-    V: t?.V ?? A,
-    Ie: t?.Ie || _,
-    je: 0,
-    Ae: null,
-    We: null,
-    i: t,
-    dispose(e = true) {
-      disposeChildren(r, e);
-    }
-  };
-  if (t) {
-    const e = t.Ee;
-    if (e === null) {
-      t.Ee = r;
-    } else {
-      r.ke = e;
-      t.Ee = r;
-    }
-  }
-  return r;
-}
-function createRoot(e, t) {
-  const n = createOwner(t);
-  return runWithOwner(n, () => e(n.dispose));
-}
-function unlinkSubs(e) {
-  const t = e.L;
-  const n = e.N;
-  const r = e.P;
-  const i = e.Re;
-  if (r !== null) r.Re = i;
-  else t.Te = i;
-  if (i !== null) i.P = r;
-  else {
-    t.O = r;
-    if (r === null) {
-      t.He?.();
-      t.R && !t.Qe && !(t.m & o) && unobserved(t);
-    }
-  }
-  return n;
-}
-function unobserved(e) {
-  deleteFromHeap(e, e.m & o ? v : P);
-  let t = e.A;
-  while (t !== null) {
-    t = unlinkSubs(t);
-  }
-  e.A = null;
-  disposeChildren(e, true);
-}
-function link(e, t) {
-  const n = t.Ce;
-  if (n !== null && n.L === e) return;
-  let i = null;
-  const s = t.m & r;
-  if (s) {
-    i = n !== null ? n.N : t.A;
-    if (i !== null && i.L === e) {
-      t.Ce = i;
-      return;
-    }
-  }
-  const o = e.Te;
-  if (o !== null && o.k === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Ce = e.Te = { L: e, k: t, N: i, Re: o, P: null });
-  if (n !== null) n.N = u;
-  else t.A = u;
-  if (o !== null) o.P = u;
-  else e.O = u;
-}
-function isValidLink(e, t) {
-  const n = t.Ce;
-  if (n !== null) {
-    let r = t.A;
-    do {
-      if (r === e) return true;
-      if (r === n) break;
-      r = r.N;
-    } while (r !== null);
-  }
-  return false;
-}
 GlobalQueue.oe = recompute;
 GlobalQueue.ue = disposeChildren;
 let T = false;
@@ -1117,10 +1136,10 @@ function releaseSnapshotScope(e) {
   schedule();
 }
 function releaseSubtree(e) {
-  let t = e.Ee;
+  let t = e.Pe;
   while (t) {
     if (t.qe) {
-      t = t.ke;
+      t = t.ve;
       continue;
     }
     if (t.R) {
@@ -1134,7 +1153,7 @@ function releaseSubtree(e) {
       }
     }
     releaseSubtree(t);
-    t = t.ke;
+    t = t.ve;
   }
 }
 function clearSnapshots() {
@@ -1152,14 +1171,15 @@ function recompute(t, n = false) {
   if (!n) {
     if (t.K && (!i || k) && k !== t.K) A.initTransition(t.K);
     deleteFromHeap(t, t.m & o ? v : P);
+    t.Ee = null;
     if (t.K || i === y) disposeChildren(t);
     else {
       markDisposal(t);
-      t.Ae = t.Ne;
-      t.We = t.Ee;
-      t.Ne = null;
-      t.Ee = null;
-      t.je = 0;
+      t.Ce = t.je;
+      t.ke = t.Pe;
+      t.je = null;
+      t.Pe = null;
+      t.We = 0;
     }
   }
   const s = !!(t.m & f);
@@ -1167,7 +1187,7 @@ function recompute(t, n = false) {
   const l = !!(t.ge & a);
   const p = V;
   V = t;
-  t.Ce = null;
+  t.xe = null;
   t.m = r;
   t.de = E;
   let h = t.Z === S ? t.$ : t.Z;
@@ -1196,7 +1216,7 @@ function recompute(t, n = false) {
         updatePendingSignal(e.te);
       }
     }
-    if (e instanceof NotReadyError) t._e = true;
+    if (e instanceof NotReadyError) t.Re = true;
     notifyStatus(
       t,
       e instanceof NotReadyError ? a : d,
@@ -1210,7 +1230,7 @@ function recompute(t, n = false) {
     V = p;
   }
   if (!t.ae) {
-    const e = t.Ce;
+    const e = t.xe;
     let r = e !== null ? e.N : t.A;
     if (r !== null) {
       do {
@@ -1220,7 +1240,7 @@ function recompute(t, n = false) {
       else t.A = null;
     }
     const f = u ? t.ee : t.Z === S ? t.$ : t.Z;
-    const c = !t.xe || !t.xe(f, h);
+    const c = !t.Te || !t.Te(f, h);
     if (c) {
       const e = u ? t.ee : undefined;
       if (n || (i && k !== t.K) || s) {
@@ -1235,7 +1255,7 @@ function recompute(t, n = false) {
     } else if (u) {
       t.Z = h;
     } else if (t.o != g) {
-      for (let e = t.O; e !== null; e = e.P) {
+      for (let e = t._; e !== null; e = e.P) {
         insertIntoHeapHeight(e.k, e.k.m & o ? v : P);
       }
     }
@@ -1257,7 +1277,7 @@ function updateIfNecessary(r) {
       }
     }
   }
-  if (r.m & (n | f) || (r.ae && r.de < E && !r.Oe)) {
+  if (r.m & (n | f) || (r.ae && r.de < E && !r.Ee)) {
     recompute(r);
   }
   r.m = e | (r.m & c);
@@ -1266,52 +1286,52 @@ function computed(t, n, r) {
   const i = r?.transparent ?? false;
   const s = {
     id: r?.id ?? (i ? V?.id : V?.id != null ? getNextChildId(V) : undefined),
-    Le: i || undefined,
-    xe: r?.equals != null ? r.equals : isEqual,
+    Ae: i || undefined,
+    Te: r?.equals != null ? r.equals : isEqual,
     le: !!r?.pureWrite,
-    He: r?.unobserved,
-    Ne: null,
+    Oe: r?.unobserved,
+    je: null,
     V: V?.V ?? A,
-    Ie: V?.Ie ?? _,
-    je: 0,
+    Ne: V?.Ne ?? O,
+    We: 0,
     R: t,
     $: n,
     o: 0,
-    C: null,
+    W: null,
     h: undefined,
     p: null,
     A: null,
-    Ce: null,
-    O: null,
-    Te: null,
+    xe: null,
+    _: null,
+    be: null,
     i: V,
-    ke: null,
-    Ee: null,
+    ve: null,
+    Pe: null,
     m: r?.lazy ? l : e,
     ge: p,
     de: E,
     Z: S,
-    Ae: null,
-    We: null,
-    Oe: null,
+    Ce: null,
+    ke: null,
+    Ee: null,
     K: null
   };
   s.p = s;
   const o = V?.t ? V.u : V;
   if (V) {
-    const e = V.Ee;
+    const e = V.Pe;
     if (e === null) {
-      V.Ee = s;
+      V.Pe = s;
     } else {
-      s.ke = e;
-      V.Ee = s;
+      s.ve = e;
+      V.Pe = s;
     }
   }
   if (o) s.o = o.o + 1;
   if (B && ownerInSnapshotScope(V)) s.he = true;
-  if (I) {
+  if (R) {
     const e = signal(undefined, { equals: false, pureWrite: true });
-    const t = I.factory(s.R, () => {
+    const t = R.factory(s.R, () => {
       setSignal(e, undefined);
     });
     cleanup(() => t.dispose());
@@ -1331,19 +1351,19 @@ function computed(t, n, r) {
 }
 function signal(e, t, n = null) {
   const r = {
-    xe: t?.equals != null ? t.equals : isEqual,
+    Te: t?.equals != null ? t.equals : isEqual,
     le: !!t?.pureWrite,
     De: !!t?.De,
-    He: t?.unobserved,
+    Oe: t?.unobserved,
     $: e,
-    O: null,
-    Te: null,
+    _: null,
+    be: null,
     de: E,
     I: n,
-    W: n?.C || null,
+    C: n?.W || null,
     Z: S
   };
-  n && (n.C = r);
+  n && (n.W = r);
   if (B && !r.De && !((n?.ge ?? 0) & a)) {
     r.pe = e === undefined ? w : e;
     G.add(r);
@@ -1364,11 +1384,11 @@ function isEqual(e, t) {
   return e === t;
 }
 function untrack(e, t) {
-  if (!I && !T && true) return e();
+  if (!R && !T && true) return e();
   const n = T;
   T = false;
   try {
-    if (I) return I.untrack(e);
+    if (R) return R.untrack(e);
     return e();
   } finally {
     T = n;
@@ -1404,9 +1424,14 @@ function read(e) {
     const n = q;
     q = false;
     if (t && e.ee !== undefined) {
-      if (e.ee !== S && (t.Oe || !!(t.ge & a))) {
+      if (e.ee !== S && (t.Ee || !!(t.ge & a))) {
         D = true;
       }
+      let n = V;
+      if (n?.t) n = n.u;
+      if (n && T) link(e, n);
+      read(getPendingSignal(e));
+      read(getPendingSignal(t));
     } else {
       if (read(getPendingSignal(e))) D = true;
       if (t && read(getPendingSignal(t))) D = true;
@@ -1486,11 +1511,11 @@ function read(e) {
 }
 function setSignal(e, t) {
   if (e.K && k !== e.K) A.initTransition(e.K);
-  const n = e.ee !== undefined && !W;
+  const n = e.ee !== undefined && !C;
   const r = e.ee !== undefined && e.ee !== S;
   const i = n ? (r ? e.ee : e.$) : e.Z === S ? e.$ : e.Z;
   if (typeof t === "function") t = t(i);
-  const s = !e.xe || !e.xe(i, t) || !!(e.ge & p);
+  const s = !e.Te || !e.Te(i, t) || !!(e.ge & p);
   if (!s) {
     if (n && r && e.R) {
       insertSubs(e, true);
@@ -1514,8 +1539,8 @@ function setSignal(e, t) {
     e.Z = t;
   }
   updatePendingSignal(e);
-  if (e.Pe) {
-    setSignal(e.Pe, t);
+  if (e.He) {
+    setSignal(e.He, t);
   }
   e.de = E;
   insertSubs(e, n);
@@ -1548,7 +1573,7 @@ function computePendingState(e) {
   const t = e;
   const n = e.I;
   if (n && e.Z !== S) {
-    return !n.Oe && !(n.ge & a);
+    return !n.Ee && !(n.ge & a);
   }
   if (e.ee !== undefined && e.ee !== S) {
     if (t.ge & a && !(t.ge & p)) return true;
@@ -1583,20 +1608,20 @@ function updatePendingSignal(e) {
   }
 }
 function getLatestValueComputed(e) {
-  if (!e.Pe) {
+  if (!e.He) {
     const t = F;
     F = false;
     const n = q;
     q = false;
     const r = V;
     V = null;
-    e.Pe = optimisticComputed(() => read(e));
-    e.Pe.ye = e;
+    e.He = optimisticComputed(() => read(e));
+    e.He.ye = e;
     V = r;
     q = n;
     F = t;
   }
-  return e.Pe;
+  return e.He;
 }
 function staleValues(e, t = true) {
   const n = H;
@@ -1636,7 +1661,7 @@ function refresh(e) {
   Q = true;
   try {
     if (typeof e !== "function") {
-      recompute(e[O]);
+      recompute(e[_]);
       return e;
     }
     return untrack(e);
@@ -1657,7 +1682,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.Ie[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.Ne[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -1667,10 +1692,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.Ie = { ...n.Ie, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.Ne = { ...n.Ne, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.Ie[e.id]);
+  return !isUndefined(t?.Ne[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -1691,7 +1716,7 @@ function effect(e, t, n, r, i) {
   o.Be = n;
   o.Ge = undefined;
   o.D = i?.render ? h : g;
-  o.ve = (e, t) => {
+  o.Qe = (e, t) => {
     const n = e !== undefined ? e : o.ge;
     const r = t !== undefined ? t : o.ae;
     if (n & d) {
@@ -1724,7 +1749,9 @@ function runEffect() {
   this.Ge?.();
   this.Ge = undefined;
   try {
-    this.Ge = this.Me(this.$, this.Ve);
+    const e = this.Me(this.$, this.Ve);
+    if (false && e !== undefined && typeof e !== "function");
+    this.Ge = e;
   } catch (e) {
     this.ae = new StatusError(this, e);
     this.ge |= d;
@@ -1747,7 +1774,8 @@ function trackedEffect(e, t) {
     () => {
       n.Ge?.();
       n.Ge = undefined;
-      n.Ge = staleValues(e) || undefined;
+      const t = staleValues(e);
+      n.Ge = t;
     },
     undefined,
     { ...t, lazy: true }
@@ -1756,7 +1784,7 @@ function trackedEffect(e, t) {
   n.Ke = true;
   n.F = true;
   n.D = y;
-  n.ve = (e, t) => {
+  n.Qe = (e, t) => {
     const r = e !== undefined ? e : n.ge;
     if (r & d) {
       n.V.notify(n, a, 0);
@@ -1851,7 +1879,9 @@ function createReaction(e, t) {
         () => (i(), getOwner()),
         t => {
           n?.();
-          n = (e.effect || e)?.();
+          const r = (e.effect || e)?.();
+          if (false && r !== undefined && typeof r !== "function");
+          n = r;
           dispose(t);
         },
         e.error,
@@ -1883,7 +1913,7 @@ function createOptimistic(e, t, n) {
 function onSettled(e) {
   const t = getOwner();
   t && !t.Ke
-    ? createTrackedEffect(() => untrack(e))
+    ? createTrackedEffect(() => untrack(e), undefined)
     : A.enqueue(g, () => {
         const t = e();
         t?.();
@@ -2050,7 +2080,7 @@ function createProjectionInternal(e, t = {}, n) {
     let i;
     const o = new Proxy(
       s,
-      createWriteTraps(() => !r || t.Oe === i)
+      createWriteTraps(() => !r || t.Ee === i)
     );
     storeSetter(o, o => {
       i = e(o);
@@ -2061,7 +2091,7 @@ function createProjectionInternal(e, t = {}, n) {
       u !== o && u !== undefined && reconcile(u, n?.key || "id")(s);
     });
   });
-  r.Qe = true;
+  r._e = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
@@ -2081,6 +2111,18 @@ function createWriteTraps(e) {
       }
       return typeof r === "object" && r !== null ? new Proxy(r, t) : r;
     },
+    has(e, t) {
+      let n;
+      setWriteOverride(true);
+      setProjectionWriteActive(true);
+      try {
+        n = t in e;
+      } finally {
+        setWriteOverride(false);
+        setProjectionWriteActive(false);
+      }
+      return n;
+    },
     set(t, n, r) {
       if (e && !e()) return true;
       setWriteOverride(true);
@@ -2138,7 +2180,12 @@ function wrap(e, t) {
   return n;
 }
 function isWrappable(e) {
-  return e != null && typeof e === "object" && !Object.isFrozen(e);
+  return (
+    e != null &&
+    typeof e === "object" &&
+    !Object.isFrozen(e) &&
+    !(typeof Node !== "undefined" && e instanceof Node)
+  );
 }
 let oe = false;
 function setWriteOverride(e) {
@@ -2201,7 +2248,7 @@ const fe = {
   get(e, t, n) {
     if (t === z) return e;
     if (t === U) return n;
-    if (t === O) return e[re];
+    if (t === _) return e[re];
     if (t === K) {
       trackSelf(e);
       return n;
@@ -2242,7 +2289,9 @@ const fe = {
   has(e, t) {
     if (t === U || t === K || t === "__proto__") return true;
     const n = e[Z] && t in e[Z] ? e[Z][t] !== J : e[Y] && t in e[Y] ? e[Y][t] !== J : t in e[X];
-    getObserver() && read(getNode(getNodes(e, ee), t, n, e[re], isEqual, e[ie]));
+    if (!writeOnly(e[U])) {
+      getObserver() && read(getNode(getNodes(e, ee), t, n, e[re], isEqual, e[ie]));
+    }
     return n;
   },
   set(e, t, n) {
@@ -2266,28 +2315,37 @@ const fe = {
             e[m][t] = s;
           }
         }
-        const o = e[ie] && !W;
+        const o = e[ie] && !C;
         const u = o ? Z : Y;
         if (o) trackOptimisticStore(r);
         const f = e[Z] && t in e[Z] ? e[Z][t] : e[Y] && t in e[Y] ? e[Y][t] : s;
         const c = n?.[z]?.[X] ?? n;
-        if (f === c) return true;
-        const l = e[Z]?.length || e[Y]?.length || i.length;
-        if (c !== undefined && c === s) delete e[u][t];
-        else (e[u] || (e[u] = Object.create(null)))[t] = c;
-        const d = isWrappable(c);
+        const l = Array.isArray(i) && t !== "length";
+        const d = l ? parseInt(t) + 1 : 0;
+        const p =
+          l &&
+          (e[Z] && "length" in e[Z]
+            ? e[Z].length
+            : e[Y] && "length" in e[Y]
+              ? e[Y].length
+              : i.length);
+        const h = l && d > p ? d : undefined;
+        if (f === c && h === undefined) return true;
+        if (c !== undefined && c === s && h === undefined) delete e[u]?.[t];
+        else {
+          const n = e[u] || (e[u] = Object.create(null));
+          n[t] = c;
+          if (h !== undefined) n.length = h;
+        }
+        const g = isWrappable(c);
         e[ee]?.[t] && setSignal(e[ee][t], true);
-        const p = getNodes(e, $);
-        p[t] && setSignal(p[t], () => (d ? wrap(c, e) : c));
+        const y = getNodes(e, $);
+        y[t] && setSignal(y[t], () => (g ? wrap(c, e) : c));
         if (Array.isArray(i)) {
-          if (t === "length") {
-            p.length && setSignal(p.length, c);
-          } else {
-            const e = parseInt(t) + 1;
-            if (e > l) p.length && setSignal(p.length, e);
-          }
+          const e = t === "length" ? c : h;
+          e !== undefined && y.length && setSignal(y.length, e);
         }
-        p[K] && setSignal(p[K], undefined);
+        y[K] && setSignal(y[K], undefined);
       });
     }
     return true;
@@ -2297,7 +2355,7 @@ const fe = {
     const r = e[Y]?.[t] === J;
     if (writeOnly(e[U]) && !n && !r) {
       untrack(() => {
-        const n = e[ie] && !W;
+        const n = e[ie] && !C;
         const r = n ? Z : Y;
         if (n) trackOptimisticStore(e[U]);
         const i = e[Z] && t in e[Z] ? e[Z][t] : e[Y] && t in e[Y] ? e[Y][t] : e[X][t];
@@ -2434,7 +2492,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
       let i;
       const o = new Proxy(
         s,
-        createWriteTraps(() => !r || t.Oe === i)
+        createWriteTraps(() => !r || t.Ee === i)
       );
       setProjectionWriteActive(true);
       try {
@@ -2455,7 +2513,7 @@ function createOptimisticProjectionInternal(e, t = {}, n) {
         setProjectionWriteActive(false);
       }
     });
-    r.Qe = true;
+    r._e = true;
   }
   return { store: s, node: r };
 }
@@ -2909,14 +2967,14 @@ function compare(e, t, n) {
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, { lazy: true });
-  n.ve = (e, t) => {
+  n.Qe = (e, t) => {
     const r = e !== undefined ? e : n.ge;
     const i = t !== undefined ? t : n.ae;
     n.ge &= ~n.ut;
     n.V.notify(n, n.ut, r, i);
   };
   n.ut = t;
-  n.Qe = true;
+  n._e = true;
   recompute(n, true);
   return n;
 }
@@ -2978,7 +3036,7 @@ class CollectionQueue extends Queue {
   }
   checkSources() {
     for (const e of this.ct) {
-      if (!(e.ge & this.ft) && !(this.ft & d && e.ge & a)) this.ct.delete(e);
+      if (e.m & u || (!(e.ge & this.ft) && !(this.ft & d && e.ge & a))) this.ct.delete(e);
     }
     if (!this.ct.size) {
       setSignal(this.lt, false);
@@ -3070,7 +3128,7 @@ function flattenArray(e, t = [], n) {
   return i;
 }
 exports.$PROXY = U;
-exports.$REFRESH = O;
+exports.$REFRESH = _;
 exports.$TARGET = z;
 exports.$TRACK = K;
 exports.ContextNotFoundError = ContextNotFoundError;