@solidjs/signals 0.9.2 → 0.9.4

package/dist/node.cjs

@@ -33,6 +33,7 @@ const h = 2;
 const p = {};
 const y = typeof Proxy === "function";
 const g = {};
+const w = 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;
@@ -104,12 +105,12 @@ function markNode(e, r = n) {
 }
 function runHeap(e, t) {
   e.m = false;
-  for (e.A = 0; e.A <= e._; e.A++) {
-    let n = e.l[e.A];
+  for (e.P = 0; e.P <= e._; e.P++) {
+    let n = e.l[e.P];
     while (n !== undefined) {
       if (n.S & i) t(n);
       else adjustHeight(n, e);
-      n = e.l[e.A];
+      n = e.l[e.P];
     }
   }
   e._ = 0;
@@ -117,7 +118,7 @@ function runHeap(e, t) {
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.P; t; t = t.W) {
+  for (let t = e.W; t; t = t.A) {
     const e = t.I;
     const r = e.F || e;
     if (r.H && r.o >= n) n = r.o + 1;
@@ -129,23 +130,23 @@ function adjustHeight(e, t) {
     }
   }
 }
-const w = new Set();
-let _ = false;
-const S = { l: new Array(2e3).fill(undefined), m: false, A: 0, _: 0 };
-const b = { l: new Array(2e3).fill(undefined), m: false, A: 0, _: 0 };
-let m = 0;
-let O = null;
-let x = false;
+const _ = new Set();
+let S = false;
+const b = { l: new Array(2e3).fill(undefined), m: false, P: 0, _: 0 };
+const m = { l: new Array(2e3).fill(undefined), m: false, P: 0, _: 0 };
+let O = 0;
+let x = null;
+let v = false;
 function schedule() {
-  if (x) return;
-  x = true;
-  if (!C.R) queueMicrotask(flush);
+  if (v) return;
+  v = true;
+  if (!C.R) Promise.resolve().then(() => queueMicrotask(flush));
 }
 class Queue {
   i = null;
   V = [[], []];
   q = [];
-  created = m;
+  created = O;
   addChild(e) {
     this.q.push(e);
     e.i = this;
@@ -202,36 +203,37 @@ class Queue {
 class GlobalQueue extends Queue {
   R = false;
   M = [];
-  D = [];
+  T = [];
+  static D;
   static B;
-  static T;
   flush() {
     if (this.R) return;
     this.R = true;
     try {
-      runHeap(S, GlobalQueue.B);
-      if (O) {
-        if (!transitionComplete(O)) {
-          let e = O;
-          runHeap(b, GlobalQueue.B);
+      runHeap(b, GlobalQueue.D);
+      if (x) {
+        if (!transitionComplete(x)) {
+          let e = x;
+          runHeap(m, GlobalQueue.D);
           this.M = [];
-          this.stashQueues(O.queueStash);
-          m++;
-          x = false;
-          runTransitionPending(O.pendingNodes, true);
-          O = null;
+          this.stashQueues(x.queueStash);
+          O++;
+          v = false;
+          runTransitionPending(x.pendingNodes, true);
+          x = null;
           runOptimistic(e);
           return;
         }
-        this.M.push(...O.pendingNodes);
-        this.restoreQueues(O.queueStash);
-        w.delete(O);
-        O = null;
+        this.M.push(...x.pendingNodes);
+        this.T !== x.optimisticNodes && this.T.push(...x.optimisticNodes);
+        this.restoreQueues(x.queueStash);
+        _.delete(x);
+        x = null;
         runTransitionPending(this.M, false);
-      } else if (w.size) runHeap(b, GlobalQueue.B);
+      } else if (_.size) runHeap(m, GlobalQueue.D);
       runOptimistic();
-      m++;
-      x = false;
+      O++;
+      v = false;
       this.run(d);
       this.run(h);
     } finally {
@@ -241,8 +243,8 @@ class GlobalQueue extends Queue {
   notify(e, t, n) {
     if (t & f) {
       if (n & f) {
-        if (O && !O.asyncNodes.includes(e.K.cause)) {
-          O.asyncNodes.push(e.K.cause);
+        if (x && !x.asyncNodes.includes(e.K.cause)) {
+          x.asyncNodes.push(e.K.cause);
           schedule();
         }
       }
@@ -251,44 +253,45 @@ class GlobalQueue extends Queue {
     return false;
   }
   initTransition(e) {
-    if (O && O.time === m) return;
-    if (!O) {
-      O = e.G ?? {
-        time: m,
+    if (x && x.time === O) return;
+    if (!x) {
+      x = e?.G ?? {
+        time: O,
         pendingNodes: [],
         asyncNodes: [],
         optimisticNodes: [],
+        actions: [],
         queueStash: { V: [[], []], q: [] },
         done: false
       };
     }
-    w.add(O);
-    O.time = m;
+    _.add(x);
+    x.time = O;
     for (let e = 0; e < this.M.length; e++) {
       const t = this.M[e];
-      t.G = O;
-      O.pendingNodes.push(t);
+      t.G = x;
+      x.pendingNodes.push(t);
     }
-    for (let e = 0; e < this.D.length; e++) {
-      const t = this.D[e];
-      t.G = O;
-      O.optimisticNodes.push(t);
+    for (let e = 0; e < this.T.length; e++) {
+      const t = this.T[e];
+      t.G = x;
+      x.optimisticNodes.push(t);
     }
-    this.M = O.pendingNodes;
-    this.D = O.optimisticNodes;
+    this.M = x.pendingNodes;
+    this.T = x.optimisticNodes;
   }
 }
 function notifySubs(e) {
   for (let t = e.O; t !== null; t = t.C) {
-    const e = t.N.S & o ? b : S;
-    if (e.A > t.N.o) e.A = t.N.o;
+    const e = t.N.S & o ? m : b;
+    if (e.P > t.N.o) e.P = t.N.o;
     insertIntoHeap(t.N, e);
   }
 }
 function runOptimistic(e = null) {
   let t = !e;
-  const n = C.D;
-  _ = true;
+  const n = C.T;
+  S = true;
   for (let t = 0; t < n.length; t++) {
     const r = n[t];
     if (!e && (!r.G || r.G.done) && r.U !== p) {
@@ -298,12 +301,12 @@ function runOptimistic(e = null) {
     r.G = e;
     notifySubs(r);
   }
-  C.D = [];
-  if (S._ >= S.A) {
+  C.T = [];
+  if (b._ >= b.P) {
     t = true;
-    runHeap(S, GlobalQueue.B);
+    runHeap(b, GlobalQueue.D);
   }
-  _ = false;
+  S = false;
   t && runPending(C.M);
 }
 function runPending(e) {
@@ -314,7 +317,7 @@ function runPending(e) {
       n.U = p;
       if (n.J) n.X = true;
     }
-    if (n.H) GlobalQueue.T(n, false, true);
+    if (n.H) GlobalQueue.B(n, false, true);
   }
   e.length = 0;
 }
@@ -322,13 +325,13 @@ function runTransitionPending(e, t) {
   const n = e.slice();
   for (let e = 0; e < n.length; e++) {
     const r = n[e];
-    r.G = O;
+    r.G = x;
     if (r.Y) r.Y.Z(t);
   }
 }
 const C = new GlobalQueue();
 function flush() {
-  while (x) {
+  while (v) {
     C.flush();
   }
 }
@@ -337,6 +340,7 @@ function runQueue(e, t) {
 }
 function transitionComplete(e) {
   if (e.done) return true;
+  if (e.actions.length) return false;
   let t = true;
   for (let n = 0; n < e.asyncNodes.length; n++) {
     if (e.asyncNodes[n].$ & f) {
@@ -348,24 +352,53 @@ function transitionComplete(e) {
   return t;
 }
 function runInTransition(e, t) {
-  const n = O;
-  O = e.G;
-  t(e);
-  O = n;
+  const n = x;
+  try {
+    x = e;
+    return t();
+  } finally {
+    x = n;
+  }
+}
+function action(e) {
+  return (...t) => {
+    const n = e(...t);
+    C.initTransition();
+    let r = x;
+    r.actions.push(n);
+    const step = e => {
+      let t = n.next(e);
+      if (t instanceof Promise) return t.then(process);
+      process(t);
+    };
+    const process = e => {
+      if (e.done) {
+        r.actions.splice(r.actions.indexOf(n), 1);
+        x = r;
+        schedule();
+        flush();
+        return;
+      }
+      const t = e.value;
+      if (t instanceof Promise) return t.then(step);
+      runInTransition(r, () => step(t));
+    };
+    runInTransition(r, () => step());
+  };
 }
-GlobalQueue.B = recompute;
-GlobalQueue.T = disposeChildren;
+GlobalQueue.D = recompute;
+GlobalQueue.B = disposeChildren;
 let N = false;
-let v = false;
 let k = false;
-let j = null;
-let A = false;
-let E = null;
+let j = false;
+let P = null;
+let W = false;
+let A = null;
 function recompute(t, n = false) {
-  const i = t.J && t.G != O;
+  const i = t.J && t.G != x;
   if (!n) {
-    if (t.G && O !== t.G && !i) C.initTransition(t);
-    deleteFromHeap(t, t.S & o ? b : S);
+    if (t.G && x !== t.G && !i) C.initTransition(t);
+    deleteFromHeap(t, t.S & o ? m : b);
     if (t.G) disposeChildren(t);
     else {
       markDisposal(t);
@@ -375,11 +408,11 @@ function recompute(t, n = false) {
       t.re = null;
     }
   }
-  const s = E;
-  E = t;
+  const s = A;
+  A = t;
   t.ie = null;
   t.S = r;
-  t.se = m;
+  t.se = O;
   let u = t.U === p || (t.oe && t.G) ? t.L : t.U;
   let d = t.o;
   let h = t.$;
@@ -399,36 +432,36 @@ function recompute(t, n = false) {
     N = g;
   }
   t.S = e;
-  E = s;
+  A = s;
   if (!(t.$ & f)) {
     const e = t.ie;
-    let n = e !== null ? e.W : t.P;
+    let n = e !== null ? e.A : t.W;
     if (n !== null) {
       do {
         n = unlinkSubs(n);
       } while (n !== null);
-      if (e !== null) e.W = null;
-      else t.P = null;
+      if (e !== null) e.A = null;
+      else t.W = null;
     }
   }
-  const w = !t.ue || !t.ue(t.U === p || t.oe || i ? t.L : t.U, u);
-  const x = t.$ !== h || t.K !== y;
-  t.le?.(x, h);
-  if (w || x) {
+  const w = !t.ue || !t.ue(t.U === p || (t.oe && t.G) || i ? t.L : t.U, u);
+  const _ = t.$ !== h || t.K !== y;
+  t.le?.(_, h);
+  if (w || _) {
     if (w) {
       if (n || t.oe || i) t.L = u;
       else t.U = u;
       if (t.fe) setSignal(t.fe, u);
     }
-    (!t.oe || _) && notifySubs(t);
+    (!t.oe || S) && notifySubs(t);
   } else if (t.o != d) {
     for (let e = t.O; e !== null; e = e.C) {
-      insertIntoHeapHeight(e.N, e.N.S & o ? b : S);
+      insertIntoHeapHeight(e.N, e.N.S & o ? m : b);
     }
   }
-  t.oe && !_ && C.D.push(t);
+  t.oe && !S && C.T.push(t);
   (!n || t.$ & f) && !t.G && C.M.push(t);
-  t.G && i && runInTransition(t, recompute);
+  t.G && i && runInTransition(t.G, () => recompute(t));
 }
 function handleAsync(e, t, n) {
   const r = typeof t === "object" && t !== null;
@@ -449,7 +482,7 @@ function handleAsync(e, t, n) {
       if (e.ce !== t) return;
       C.initTransition(e);
       setStatusFlags(e, c, n);
-      e.se = m;
+      e.se = O;
       notifySubs(e);
       schedule();
       flush();
@@ -467,7 +500,7 @@ function handleAsync(e, t, n) {
         if (e.ce !== t) return;
         C.initTransition(e);
         setStatusFlags(e, c, n);
-        e.se = m;
+        e.se = O;
         notifySubs(e);
         schedule();
         flush();
@@ -475,11 +508,11 @@ function handleAsync(e, t, n) {
     })();
   }
   C.initTransition(e);
-  throw new NotReadyError(E);
+  throw new NotReadyError(A);
 }
 function updateIfNecessary(r) {
   if (r.S & t) {
-    for (let e = r.P; e; e = e.W) {
+    for (let e = r.W; e; e = e.A) {
       const t = e.I;
       const i = t.F || t;
       if (i.H) {
@@ -497,7 +530,7 @@ function updateIfNecessary(r) {
 }
 function unlinkSubs(e) {
   const t = e.I;
-  const n = e.W;
+  const n = e.A;
   const r = e.C;
   const i = e.ae;
   if (r !== null) r.ae = i;
@@ -513,12 +546,12 @@ function unlinkSubs(e) {
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.S & o ? b : S);
-  let t = e.P;
+  deleteFromHeap(e, e.S & o ? m : b);
+  let t = e.W;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.P = null;
+  e.W = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
@@ -527,7 +560,7 @@ function link(e, t) {
   let i = null;
   const s = t.S & r;
   if (s) {
-    i = n !== null ? n.W : t.P;
+    i = n !== null ? n.A : t.W;
     if (i !== null && i.I === e) {
       t.ie = i;
       return;
@@ -535,20 +568,20 @@ function link(e, t) {
   }
   const o = e.de;
   if (o !== null && o.N === t && (!s || isValidLink(o, t))) return;
-  const u = (t.ie = e.de = { I: e, N: t, W: i, ae: o, C: null });
-  if (n !== null) n.W = u;
-  else t.P = u;
+  const u = (t.ie = e.de = { I: e, N: t, A: i, ae: o, C: null });
+  if (n !== null) n.A = u;
+  else t.W = u;
   if (o !== null) o.C = u;
   else e.O = u;
 }
 function isValidLink(e, t) {
   const n = t.ie;
   if (n !== null) {
-    let r = t.P;
+    let r = t.W;
     do {
       if (r === e) return true;
       if (r === n) break;
-      r = r.W;
+      r = r.A;
     } while (r !== null);
   }
   return false;
@@ -562,19 +595,19 @@ function markDisposal(e) {
   while (t) {
     t.S |= o;
     if (t.S & i) {
-      deleteFromHeap(t, S);
-      insertIntoHeap(t, b);
+      deleteFromHeap(t, b);
+      insertIntoHeap(t, m);
     }
     markDisposal(t);
     t = t.ye;
   }
 }
 function dispose(e) {
-  let t = e.P || null;
+  let t = e.W || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.P = null;
+  e.W = null;
   e.ie = null;
   disposeChildren(e, true);
 }
@@ -584,14 +617,14 @@ function disposeChildren(e, t = false, n) {
   let r = n ? e.ne : e.re;
   while (r) {
     const e = r.ye;
-    if (r.P) {
+    if (r.W) {
       const e = r;
-      deleteFromHeap(e, e.S & o ? b : S);
-      let t = e.P;
+      deleteFromHeap(e, e.S & o ? m : b);
+      let t = e.W;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.P = null;
+      e.W = null;
       e.ie = null;
     }
     disposeChildren(r, true);
@@ -629,13 +662,13 @@ function formatId(e, t) {
 }
 function computed(t, n, r) {
   const i = {
-    id: r?.id ?? (E?.id != null ? getNextChildId(E) : undefined),
+    id: r?.id ?? (A?.id != null ? getNextChildId(A) : undefined),
     ue: r?.equals != null ? r.equals : isEqual,
     we: !!r?.pureWrite,
     he: r?.unobserved,
     te: null,
-    _e: E?._e ?? C,
-    Se: E?.Se ?? g,
+    _e: A?._e ?? C,
+    Se: A?.Se ?? g,
     ge: 0,
     H: t,
     L: n,
@@ -643,16 +676,16 @@ function computed(t, n, r) {
     k: null,
     p: undefined,
     h: null,
-    P: null,
+    W: null,
     ie: null,
     O: null,
     de: null,
-    i: E,
+    i: A,
     ye: null,
     re: null,
     S: e,
     $: a,
-    se: m,
+    se: O,
     U: p,
     ee: null,
     ne: null,
@@ -661,14 +694,14 @@ function computed(t, n, r) {
   };
   if (r?.be) Object.assign(i, r.be);
   i.h = i;
-  const s = E?.t ? E.u : E;
-  if (E) {
-    const e = E.re;
+  const s = A?.t ? A.u : A;
+  if (A) {
+    const e = A.re;
     if (e === null) {
-      E.re = i;
+      A.re = i;
     } else {
       i.ye = e;
-      E.re = i;
+      A.re = i;
     }
   }
   if (s) i.o = s.o + 1;
@@ -677,7 +710,7 @@ function computed(t, n, r) {
 }
 function signal(e, t, n = null) {
   const r = {
-    id: t?.id ?? (E?.id != null ? getNextChildId(E) : undefined),
+    id: t?.id ?? (A?.id != null ? getNextChildId(A) : undefined),
     ue: t?.equals != null ? t.equals : isEqual,
     we: !!t?.pureWrite,
     he: t?.unobserved,
@@ -685,7 +718,7 @@ function signal(e, t, n = null) {
     O: null,
     de: null,
     $: l,
-    se: m,
+    se: O,
     F: n,
     j: n?.k || null,
     U: p
@@ -706,18 +739,18 @@ function untrack(e) {
   }
 }
 function read(e) {
-  let t = E;
+  let t = A;
   if (t?.t) t = t.u;
-  if (A && e.H) recompute(e);
-  if (t && N && !j && !k) {
+  if (W && e.H) recompute(e);
+  if (t && N && !P && !j) {
     if (e.H && e.S & u) recompute(e);
     link(e, t);
     const n = e.F || e;
     if (n.H) {
       const r = e.S & o;
-      if (n.o >= (r ? b.A : S.A)) {
+      if (n.o >= (r ? m.P : b.P)) {
         markNode(t);
-        markHeap(r ? b : S);
+        markHeap(r ? m : b);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -727,49 +760,50 @@ function read(e) {
     }
   }
   if (j) {
-    if (!e.Y) {
-      e.Y = signal(false);
-      e.Y.oe = true;
-      e.Y.Z = t => setSignal(e.Y, t);
-    }
-    const t = j;
-    j = null;
-    t.L = read(e.Y) || t.L;
-    j = t;
-  }
-  if (k) {
     if (!e.fe) {
       e.fe = signal(e.L);
       e.fe.oe = true;
     }
-    k = false;
+    j = false;
     try {
       return read(e.fe);
     } finally {
-      k = true;
+      j = true;
+    }
+  }
+  const n = e.F || e;
+  if (P) {
+    if (!n.Y) {
+      n.Y = signal(false);
+      n.Y.oe = true;
+      n.Y.Z = e => setSignal(n.Y, e);
     }
+    const e = P;
+    P = null;
+    e.L = read(n.Y) || e.L;
+    P = e;
   }
-  if (e.$ & f && !j) {
-    if ((t && !v) || e.$ & a) throw e.K;
-    else if (t && v) {
-      setStatusFlags(t, t.$ | 1, e.K);
+  if (!P && n.$ & f) {
+    if ((t && !k) || n.$ & a || e.F) throw n.K;
+    else if (t && k) {
+      setStatusFlags(t, t.$ | f, n.K);
     }
   }
   if (e.$ & c) {
-    if (e.se < m) {
+    if (e.se < O) {
       recompute(e, true);
       return read(e);
     } else {
       throw e.K;
     }
   }
-  return !t || e.oe || e.U === p || (v && !j && (t.oe || (e.G && O !== e.G))) ? e.L : e.U;
+  return !t || e.oe || e.U === p || (k && !P && (t.oe || (e.G && x !== e.G))) ? e.L : e.U;
 }
 function setSignal(e, t) {
   if (typeof t === "function") {
     t = t(e.U === p || (e.oe && e.G) ? e.L : e.U);
   }
-  const n = !e.ue || !e.ue(e.U === p || e.oe ? e.L : e.U, t);
+  const n = !e.ue || !e.ue(e.U === p || (e.oe && e.G) ? e.L : e.U, t);
   if (!n && !e.$) return t;
   if (n) {
     if (e.oe) e.L = t;
@@ -780,20 +814,20 @@ function setSignal(e, t) {
     if (e.fe) setSignal(e.fe, t);
   }
   setStatusFlags(e, l);
-  e.se = m;
-  e.oe && !_ ? C.D.push(e) : notifySubs(e);
+  e.se = O;
+  e.oe && !S ? C.T.push(e) : notifySubs(e);
   schedule();
   return t;
 }
 function getObserver() {
-  return N ? E : null;
+  return N ? A : null;
 }
 function getOwner() {
-  return E;
+  return A;
 }
 function onCleanup(e) {
-  if (!E) return e;
-  const t = E;
+  if (!A) return e;
+  const t = A;
   if (!t.te) {
     t.te = e;
   } else if (Array.isArray(t.te)) {
@@ -804,7 +838,7 @@ function onCleanup(e) {
   return e;
 }
 function createOwner(e) {
-  const t = E;
+  const t = A;
   const n = {
     t: true,
     u: t?.t ? t.u : t,
@@ -838,52 +872,56 @@ function createRoot(e, t) {
   return runWithOwner(n, () => e(n.dispose));
 }
 function runWithOwner(e, t) {
-  const n = E;
-  E = e;
+  const n = A;
+  A = e;
   try {
     return t();
   } finally {
-    E = n;
+    A = n;
   }
 }
 function staleValues(e, t = true) {
-  const n = v;
-  v = t;
+  const n = k;
+  k = t;
   try {
     return e();
   } finally {
-    v = n;
+    k = n;
   }
 }
 function pending(e) {
-  const t = k;
-  k = true;
+  const t = j;
+  j = true;
   try {
     return staleValues(e, false);
   } finally {
-    k = t;
+    j = t;
   }
 }
 function isPending(e) {
-  const t = j;
-  j = { L: false };
+  const t = P;
+  P = { L: false };
   try {
     staleValues(e);
-    return j.L;
+    return P.L;
   } catch (e) {
     if (!(e instanceof NotReadyError)) return false;
     throw e;
   } finally {
-    j = t;
+    P = t;
   }
 }
 function refresh(e) {
-  let t = A;
-  A = true;
+  let t = W;
+  W = true;
   try {
+    if (typeof e !== "function") {
+      recompute(e[w]);
+      return e;
+    }
     return untrack(e);
   } finally {
-    A = t;
+    W = t;
     if (!t) {
       schedule();
       flush();
@@ -891,7 +929,7 @@ function refresh(e) {
   }
 }
 function isRefreshing() {
-  return A;
+  return W;
 }
 function createContext(e, t) {
   return { id: Symbol(t), defaultValue: e };
@@ -927,7 +965,7 @@ function effect(e, t, n, r, i) {
       me: r,
       Oe: t,
       xe: n,
-      Ce: undefined,
+      ve: undefined,
       J: i?.render ? d : h,
       le(e, t) {
         if (s) {
@@ -942,8 +980,8 @@ function effect(e, t, n, r, i) {
             try {
               return this.xe
                 ? this.xe(e, () => {
-                    this.Ce?.();
-                    this.Ce = undefined;
+                    this.ve?.();
+                    this.ve = undefined;
                   })
                 : console.error(e);
             } catch (t) {
@@ -962,14 +1000,14 @@ function effect(e, t, n, r, i) {
   !i?.defer &&
     !(o.$ & (c | f)) &&
     (o.J === h ? o._e.enqueue(o.J, runEffect.bind(o)) : runEffect.call(o));
-  onCleanup(() => o.Ce?.());
+  onCleanup(() => o.ve?.());
 }
 function runEffect() {
   if (!this.X || this.S & u) return;
-  this.Ce?.();
-  this.Ce = undefined;
+  this.ve?.();
+  this.ve = undefined;
   try {
-    this.Ce = this.Oe(this.L, this.me);
+    this.ve = this.Oe(this.L, this.me);
   } catch (e) {
     if (!this._e.notify(this, c, c)) throw e;
   } finally {
@@ -982,10 +1020,8 @@ function createSignal(e, t, n) {
     const r = computed(e, t, n);
     return [read.bind(null, r), setSignal.bind(null, r)];
   }
-  const r = getOwner();
-  const i = r?.id != null;
-  const s = signal(e, i ? { id: getNextChildId(r), ...t } : t);
-  return [read.bind(null, s), setSignal.bind(null, s)];
+  const r = signal(e, t);
+  return [read.bind(null, r), setSignal.bind(null, r)];
 }
 function createMemo(e, t, n) {
   let r = computed(e, t, n);
@@ -1037,8 +1073,10 @@ function createOptimistic(e, t, n) {
   if (typeof e === "function") {
     const r = computed(
       t => {
-        let n = r || getOwner();
-        n.U = e(t);
+        const n = getOwner();
+        const r = e(t);
+        if (n.$ & a) return r;
+        n.U = r;
         return t;
       },
       t,
@@ -1047,15 +1085,13 @@ function createOptimistic(e, t, n) {
     r.oe = true;
     return [read.bind(null, r), setSignal.bind(null, r)];
   }
-  const r = getOwner();
-  const i = r?.id != null;
-  const s = signal(e, i ? { id: getNextChildId(r), ...t } : t);
-  s.oe = true;
+  const r = signal(e, t);
+  r.oe = true;
   return [
-    read.bind(null, s),
+    read.bind(null, r),
     t => {
-      s.U = e;
-      return setSignal(s, t);
+      r.U = e;
+      return setSignal(r, t);
     }
   ];
 }
@@ -1069,10 +1105,10 @@ function onSettled(e) {
   });
 }
 function unwrap(e) {
-  return e?.[I]?.[q] ?? e;
+  return e?.[H]?.[T] ?? e;
 }
 function getOverrideValue(e, t, n, r) {
-  return n && r in n ? read(n[r]) : t && r in t ? t[r] : e[r];
+  return t && r in t ? t[r] : e[r];
 }
 function getAllKeys(e, t, n) {
   const r = getKeys(e, t);
@@ -1080,15 +1116,15 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n, r) {
-  const i = t?.[I];
+  const i = t?.[H];
   if (!i) return;
-  const s = i[R];
-  const o = i[V];
-  let u = i[q];
+  const s = i[q];
+  const o = i[M];
+  let u = i[T];
   if (e === s && !o) return;
-  (i[B] || K).set(e, i[F]);
-  i[R] = e;
-  i[V] = undefined;
+  (i[K] || U).set(e, i[Q]);
+  i[q] = e;
+  i[M] = undefined;
   if (Array.isArray(s)) {
     let t = false;
     const l = getOverrideValue(s, o, u, "length");
@@ -1115,16 +1151,16 @@ function applyState(e, t, n, r) {
       if (a > h || a > d) {
         for (c = a; c <= h; c++) {
           t = true;
-          i[q][c] && setSignal(i[q][c], wrap(e[c], i));
+          i[T][c] && setSignal(i[T][c], wrap(e[c], i));
         }
         for (; c < e.length; c++) {
           t = true;
           const s = wrap(w[c], i);
-          i[q][c] && setSignal(i[q][c], s);
+          i[T][c] && setSignal(i[T][c], s);
           applyState(e[c], s, n, r);
         }
-        t && i[q][P] && setSignal(i[q][P], void 0);
-        l !== e.length && i[q].length && setSignal(i[q].length, e.length);
+        t && i[T][I] && setSignal(i[T][I], void 0);
+        l !== e.length && i[T].length && setSignal(i[T].length, e.length);
         return;
       }
       y = new Array(h + 1);
@@ -1148,26 +1184,26 @@ function applyState(e, t, n, r) {
       for (c = a; c < e.length; c++) {
         if (c in w) {
           const t = wrap(w[c], i);
-          i[q][c] && setSignal(i[q][c], t);
+          i[T][c] && setSignal(i[T][c], t);
           applyState(e[c], t, n, r);
-        } else i[q][c] && setSignal(i[q][c], wrap(e[c], i));
+        } else i[T][c] && setSignal(i[T][c], wrap(e[c], i));
       }
       if (a < e.length) t = true;
-    } else if (l && e.length) {
+    } else if (e.length) {
       for (let t = 0, l = e.length; t < l; t++) {
         const l = getOverrideValue(s, o, u, t);
-        isWrappable(l) && applyState(e[t], wrap(l, i), n, r);
+        isWrappable(l) ? applyState(e[t], wrap(l, i), n, r) : i[T][t] && setSignal(i[T][t], e[t]);
       }
     }
     if (l !== e.length) {
       t = true;
-      i[q].length && setSignal(i[q].length, e.length);
+      i[T].length && setSignal(i[T].length, e.length);
     }
-    t && i[q][P] && setSignal(i[q][P], void 0);
+    t && i[T][I] && setSignal(i[T][I], void 0);
     return;
   }
   if (u) {
-    const t = u[P];
+    const t = u[I];
     const l = t || r ? getAllKeys(s, o, e) : Object.keys(u);
     for (let f = 0, c = l.length; f < c; f++) {
       const c = l[f];
@@ -1181,7 +1217,7 @@ function applyState(e, t, n, r) {
       } else applyState(h, wrap(d, i), n, r);
     }
   }
-  if ((u = i[M])) {
+  if ((u = i[D])) {
     const t = Object.keys(u);
     for (let n = 0, r = t.length; n < r; n++) {
       const r = t[n];
@@ -1202,66 +1238,109 @@ function reconcile(e, t, n = false) {
 function createProjectionInternal(e, t = {}, n) {
   let r;
   const i = new WeakMap();
-  const wrapProjection = e => {
-    if (i.has(e)) return i.get(e);
-    if (e[I]?.[D] === wrapProjection) return e;
-    const t = createStoreProxy(e, U, {
-      [D]: wrapProjection,
-      [B]: i,
-      [T]() {
+  const wrapper = e => {
+    e[B] = wrapProjection;
+    e[K] = i;
+    Object.defineProperty(e, G, {
+      get() {
         return r;
-      }
+      },
+      configurable: true
     });
+  };
+  const wrapProjection = e => {
+    if (i.has(e)) return i.get(e);
+    if (e[H]?.[B] === wrapProjection) return e;
+    const t = createStoreProxy(e, J, wrapper);
     i.set(e, t);
     return t;
   };
   const s = wrapProjection(t);
   r = computed(() => {
-    const t = r || getOwner();
-    storeSetter(s, r => {
+    const t = getOwner();
+    storeSetter(new Proxy(s, E), r => {
       const i = handleAsync(t, e(r), e => {
-        e !== r && e !== undefined && storeSetter(s, reconcile(e, n?.key || "id", n?.all));
+        e !== s && 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)(r);
+      i !== s && i !== undefined && reconcile(i, n?.key || "id", n?.all)(s);
     });
   });
+  r.pe = true;
   return { store: s, node: r };
 }
 function createProjection(e, t = {}, n) {
   return createProjectionInternal(e, t, n).store;
 }
-const P = Symbol(0),
-  W = Symbol(0),
-  I = Symbol(0),
+const E = {
+  get(e, t) {
+    let n;
+    setWriteOverride(true);
+    try {
+      n = e[t];
+    } finally {
+      setWriteOverride(false);
+    }
+    return typeof n === "object" && n !== null ? new Proxy(n, E) : n;
+  },
+  set(e, t, n) {
+    setWriteOverride(true);
+    try {
+      e[t] = n;
+    } finally {
+      setWriteOverride(false);
+    }
+    return true;
+  },
+  deleteProperty(e, t) {
+    setWriteOverride(true);
+    try {
+      delete e[t];
+    } finally {
+      setWriteOverride(false);
+    }
+    return true;
+  }
+};
+const I = Symbol(0),
   F = Symbol(0),
-  H = Symbol(0);
-const Q = new WeakMap();
-const R = "v",
-  V = "o",
-  q = "n",
-  M = "h",
-  D = "w",
-  B = "l",
-  T = "f";
-function createStoreProxy(e, t = U, n) {
+  H = Symbol(0),
+  Q = Symbol(0),
+  R = Symbol(0);
+const V = new WeakMap();
+const q = "v",
+  M = "o",
+  T = "n",
+  D = "h",
+  B = "w",
+  K = "l",
+  G = "f";
+function createStoreProxy(e, t = J, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
     r.v = e;
   } else r = { v: e };
-  n && Object.assign(r, n);
-  return (r[F] = new Proxy(r, t));
+  n && n(r);
+  return (r[Q] = new Proxy(r, t));
 }
-const K = new WeakMap();
+const U = new WeakMap();
 function wrap(e, t) {
-  if (t?.[D]) return t[D](e, t);
-  let n = e[F] || K.get(e);
-  if (!n) K.set(e, (n = createStoreProxy(e)));
+  if (t?.[B]) return t[B](e, t);
+  let n = e[Q] || U.get(e);
+  if (!n) U.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
   return e != null && typeof e === "object" && !Object.isFrozen(e);
 }
+let L = false;
+function setWriteOverride(e) {
+  L = e;
+}
+function writeOnly(e) {
+  return L || !!z?.has(e);
+}
 function getNodes(e, t) {
   let n = e[t];
   if (!n) e[t] = n = Object.create(null);
@@ -1280,8 +1359,8 @@ function getNode(e, t, n, r, i = isEqual) {
     r
   ));
 }
-function trackSelf(e, t = P) {
-  getObserver() && read(getNode(getNodes(e, q), t, undefined, e[T]?.(), false));
+function trackSelf(e, t = I) {
+  getObserver() && read(getNode(getNodes(e, T), t, undefined, e[G], false));
 }
 function getKeys(e, t, n = true) {
   const r = untrack(() => (n ? Object.keys(e) : Reflect.ownKeys(e)));
@@ -1289,7 +1368,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] !== H) i.add(e);
+    if (t[e] !== R) i.add(e);
     else i.delete(e);
   }
   return Array.from(i);
@@ -1297,124 +1376,125 @@ function getKeys(e, t, n = true) {
 function getPropertyDescriptor(e, t, n) {
   let r = e;
   if (t && n in t) {
-    if (r[n] === H) return void 0;
+    if (r[n] === R) return void 0;
     if (!(n in r)) r = t;
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let G = null;
-const U = {
+let z = null;
+const J = {
   get(e, t, n) {
-    if (t === I) return e;
-    if (t === F) return n;
-    if (t === P || t === W) {
+    if (t === H) return e;
+    if (t === Q) return n;
+    if (t === w) return e[G];
+    if (t === I || t === F) {
       trackSelf(e, t);
       return n;
     }
-    const r = getNodes(e, q);
+    const r = getNodes(e, T);
     const i = r[t];
-    const s = e[V] && t in e[V];
-    const o = !!e[R][I];
-    const u = s ? e[V] : e[R];
+    const s = e[M] && t in e[M];
+    const o = !!e[q][H];
+    const u = s ? e[M] : e[q];
     if (!i) {
       const e = Object.getOwnPropertyDescriptor(u, t);
       if (e && e.get) return e.get.call(n);
     }
-    if (G?.has(n)) {
+    if (writeOnly(n)) {
       let n = i && (s || !o) ? (i.U !== p ? i.U : i.L) : u[t];
-      n === H && (n = undefined);
+      n === R && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      G.add(r);
+      z?.add(r);
       return r;
     }
     let l = i ? (s || !o ? read(r[t]) : (read(r[t]), u[t])) : u[t];
-    l === H && (l = undefined);
+    l === R && (l = undefined);
     if (!i) {
       if (!s && typeof l === "function" && !u.hasOwnProperty(t)) {
         let t;
-        return !Array.isArray(e[R]) && (t = Object.getPrototypeOf(e[R])) && t !== Object.prototype
+        return !Array.isArray(e[q]) && (t = Object.getPrototypeOf(e[q])) && t !== Object.prototype
           ? l.bind(u)
           : l;
       } else if (getObserver()) {
-        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[T]?.()));
+        return read(getNode(r, t, isWrappable(l) ? wrap(l, e) : l, e[G]));
       }
     }
     return isWrappable(l) ? wrap(l, e) : l;
   },
   has(e, t) {
-    if (t === F || t === P || t === "__proto__") return true;
-    const n = e[V] && t in e[V] ? e[V][t] !== H : t in e[R];
-    getObserver() && read(getNode(getNodes(e, M), t, n, e[T]?.()));
+    if (t === Q || t === I || t === "__proto__") return true;
+    const n = e[M] && t in e[M] ? e[M][t] !== R : t in e[q];
+    getObserver() && read(getNode(getNodes(e, D), t, n, e[G]));
     return n;
   },
   set(e, t, n) {
-    const r = e[F];
-    if (G?.has(e[F])) {
+    const r = e[Q];
+    if (writeOnly(r)) {
       untrack(() => {
-        const i = e[R];
+        const i = e[q];
         const s = i[t];
-        const o = e[V] && t in e[V] ? e[V][t] : s;
-        const u = n?.[I]?.[R] ?? n;
+        const o = e[M] && t in e[M] ? e[M][t] : s;
+        const u = n?.[H]?.[q] ?? n;
         if (o === u) return true;
-        const l = e[V]?.length || i.length;
-        if (u !== undefined && u === s) delete e[V][t];
-        else (e[V] || (e[V] = Object.create(null)))[t] = u;
+        const l = e[M]?.length || i.length;
+        if (u !== undefined && u === s) delete e[M][t];
+        else (e[M] || (e[M] = Object.create(null)))[t] = u;
         const f = isWrappable(u);
         if (isWrappable(o)) {
-          const e = Q.get(o);
-          e && (e instanceof Set ? e.delete(r) : Q.delete(o));
+          const e = V.get(o);
+          e && (e instanceof Set ? e.delete(r) : V.delete(o));
         }
-        if (recursivelyNotify(r, K) && f) recursivelyAddParent(u, r);
-        e[M]?.[t] && setSignal(e[M][t], true);
-        const c = getNodes(e, q);
+        if (recursivelyNotify(r, U) && f) recursivelyAddParent(u, r);
+        e[D]?.[t] && setSignal(e[D][t], true);
+        const c = getNodes(e, T);
         c[t] && setSignal(c[t], () => (f ? wrap(u, e) : u));
         if (Array.isArray(i)) {
           const e = parseInt(t) + 1;
           if (e > l) c.length && setSignal(c.length, e);
         }
-        c[P] && setSignal(c[P], undefined);
+        c[I] && setSignal(c[I], undefined);
       });
     }
     return true;
   },
   deleteProperty(e, t) {
-    if (G?.has(e[F]) && e[V]?.[t] !== H) {
+    if (writeOnly(e[Q]) && e[M]?.[t] !== R) {
       untrack(() => {
-        const n = e[V] && t in e[V] ? e[V][t] : e[R][t];
-        if (t in e[R]) {
-          (e[V] || (e[V] = Object.create(null)))[t] = H;
-        } else if (e[V] && t in e[V]) {
-          delete e[V][t];
+        const n = e[M] && t in e[M] ? e[M][t] : e[q][t];
+        if (t in e[q]) {
+          (e[M] || (e[M] = Object.create(null)))[t] = R;
+        } else if (e[M] && t in e[M]) {
+          delete e[M][t];
         } else return true;
         if (isWrappable(n)) {
-          const t = Q.get(n);
-          t && (t instanceof Set ? t.delete(e) : Q.delete(n));
+          const t = V.get(n);
+          t && (t instanceof Set ? t.delete(e) : V.delete(n));
         }
-        if (e[M]?.[t]) setSignal(e[M][t], false);
-        const r = getNodes(e, q);
+        if (e[D]?.[t]) setSignal(e[D][t], false);
+        const r = getNodes(e, T);
         r[t] && setSignal(r[t], undefined);
-        r[P] && setSignal(r[P], undefined);
+        r[I] && setSignal(r[I], undefined);
       });
     }
     return true;
   },
   ownKeys(e) {
     trackSelf(e);
-    return getKeys(e[R], e[V], false);
+    return getKeys(e[q], e[M], false);
   },
   getOwnPropertyDescriptor(e, t) {
-    if (t === F) return { value: e[F], writable: true, configurable: true };
-    return getPropertyDescriptor(e[R], e[V], t);
+    if (t === Q) return { value: e[Q], writable: true, configurable: true };
+    return getPropertyDescriptor(e[q], e[M], t);
   },
   getPrototypeOf(e) {
-    return Object.getPrototypeOf(e[R]);
+    return Object.getPrototypeOf(e[q]);
   }
 };
 function storeSetter(e, t) {
-  const n = G;
-  G = new Set();
-  G.add(e);
+  const n = z;
+  z = new Set();
+  z.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -1430,8 +1510,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    G.clear();
-    G = n;
+    z.clear();
+    z = n;
   }
 }
 function createStore(e, t, n) {
@@ -1440,17 +1520,17 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function recursivelyNotify(e, t) {
-  let n = e[I] || t?.get(e)?.[I];
+  let n = e[H] || t?.get(e)?.[H];
   let r = false;
   if (n) {
-    const e = getNodes(n, q)[W];
+    const e = getNodes(n, T)[F];
     if (e) {
       setSignal(e, undefined);
       r = true;
     }
-    t = n[B] || t;
+    t = n[K] || t;
   }
-  const i = Q.get(n?.[R] || e);
+  const i = V.get(n?.[q] || e);
   if (!i) return r;
   if (i instanceof Set) {
     for (let e of i) r = recursivelyNotify(e, t) || r;
@@ -1459,16 +1539,16 @@ function recursivelyNotify(e, t) {
 }
 function recursivelyAddParent(e, t) {
   let n;
-  const r = e[I];
+  const r = e[H];
   if (r) {
-    n = r[V];
-    e = r[R];
+    n = r[M];
+    e = r[q];
   }
   if (t) {
-    let n = Q.get(e);
-    if (!n) Q.set(e, t);
+    let n = V.get(e);
+    if (!n) V.set(e, t);
     else if (n !== t) {
-      if (!(n instanceof Set)) Q.set(e, (n = new Set([n])));
+      if (!(n instanceof Set)) V.set(e, (n = new Set([n])));
       else if (n.has(t)) return;
       n.add(t);
     } else return;
@@ -1490,7 +1570,7 @@ function recursivelyAddParent(e, t) {
 }
 function deep(e) {
   recursivelyAddParent(e);
-  return e[W];
+  return e[F];
 }
 function createOptimisticStore(e, t, n) {
   return [];
@@ -1500,12 +1580,12 @@ function snapshot(e, t, n) {
   if (!isWrappable(e)) return e;
   if (t && t.has(e)) return t.get(e);
   if (!t) t = new Map();
-  if ((r = e[I] || n?.get(e)?.[I])) {
-    s = r[V];
-    i = Array.isArray(r[R]);
-    t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[R]))) : r[R]);
-    e = r[R];
-    n = K;
+  if ((r = e[H] || n?.get(e)?.[H])) {
+    s = r[M];
+    i = Array.isArray(r[q]);
+    t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[q]))) : r[q]);
+    e = r[q];
+    n = U;
   } else {
     i = Array.isArray(e);
     t.set(e, e);
@@ -1514,7 +1594,7 @@ function snapshot(e, t, n) {
     const r = s?.length || e.length;
     for (let i = 0; i < r; i++) {
       l = s && i in s ? s[i] : e[i];
-      if (l === H) continue;
+      if (l === R) continue;
       if ((u = snapshot(l, t, n)) !== l || o) {
         if (!o) t.set(e, (o = [...e]));
         o[i] = u;
@@ -1541,13 +1621,13 @@ function snapshot(e, t, n) {
 function trueFn() {
   return true;
 }
-const L = {
+const X = {
   get(e, t, n) {
-    if (t === F) return n;
+    if (t === Q) return n;
     return e.get(t);
   },
   has(e, t) {
-    if (t === F) return true;
+    if (t === Q) return true;
     return e.has(t);
   },
   set: trueFn,
@@ -1570,15 +1650,15 @@ const L = {
 function resolveSource(e) {
   return !(e = typeof e === "function" ? e() : e) ? {} : e;
 }
-const z = Symbol(0);
+const Y = 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 && F in i);
-    const s = !!i && i[z];
+    t = t || (!!i && Q in i);
+    const s = !!i && i[Y];
     if (s) n.push(...s);
     else n.push(typeof i === "function" ? ((t = true), createMemo(i)) : i);
   }
@@ -1586,7 +1666,7 @@ function merge(...e) {
     return new Proxy(
       {
         get(e) {
-          if (e === z) return n;
+          if (e === Y) return n;
           for (let t = n.length - 1; t >= 0; t--) {
             const r = resolveSource(n[t]);
             if (e in r) return r[e];
@@ -1604,7 +1684,7 @@ function merge(...e) {
           return [...new Set(e)];
         }
       },
-      L
+      X
     );
   }
   const r = Object.create(null);
@@ -1636,12 +1716,12 @@ function merge(...e) {
     if (n.get) Object.defineProperty(o, t, n);
     else o[t] = n.value;
   }
-  o[z] = n;
+  o[Y] = n;
   return o;
 }
 function omit(e, ...t) {
   const n = new Set(t);
-  if (y && F in e) {
+  if (y && Q in e) {
     return new Proxy(
       {
         get(t) {
@@ -1654,7 +1734,7 @@ function omit(e, ...t) {
           return Object.keys(e).filter(e => !n.has(e));
         }
       },
-      L
+      X
     );
   }
   const r = {};
@@ -1672,33 +1752,33 @@ function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      Ne: createOwner(),
-      ve: 0,
+      Ce: createOwner(),
+      Ne: 0,
       ke: e,
       je: [],
-      Ae: t,
-      Ee: [],
-      Pe: [],
-      We: r,
+      Pe: t,
+      We: [],
+      Ae: [],
+      Ee: r,
       Ie: r || n?.keyed === false ? [] : undefined,
       Fe: t.length > 1 ? [] : undefined,
       He: n?.fallback
     })
   );
 }
-const J = { pureWrite: true };
+const Z = { pureWrite: true };
 function updateKeyedMap() {
   const e = this.ke() || [],
     t = e.length;
-  e[P];
-  runWithOwner(this.Ne, () => {
+  e[I];
+  runWithOwner(this.Ce, () => {
     let n,
       r,
       i = this.Ie
         ? () => {
-            this.Ie[r] = signal(e[r], J);
-            this.Fe && (this.Fe[r] = signal(r, J));
-            return this.Ae(
+            this.Ie[r] = signal(e[r], Z);
+            this.Fe && (this.Fe[r] = signal(r, Z));
+            return this.Pe(
               read.bind(null, this.Ie[r]),
               this.Fe ? read.bind(null, this.Fe[r]) : undefined
             );
@@ -1706,34 +1786,34 @@ function updateKeyedMap() {
         : this.Fe
           ? () => {
               const t = e[r];
-              this.Fe[r] = signal(r, J);
-              return this.Ae(() => t, read.bind(null, this.Fe[r]));
+              this.Fe[r] = signal(r, Z);
+              return this.Pe(() => t, read.bind(null, this.Fe[r]));
             }
           : () => {
               const t = e[r];
-              return this.Ae(() => t);
+              return this.Pe(() => t);
             };
     if (t === 0) {
-      if (this.ve !== 0) {
-        this.Ne.dispose(false);
-        this.Pe = [];
+      if (this.Ne !== 0) {
+        this.Ce.dispose(false);
+        this.Ae = [];
         this.je = [];
-        this.Ee = [];
-        this.ve = 0;
+        this.We = [];
+        this.Ne = 0;
         this.Ie && (this.Ie = []);
         this.Fe && (this.Fe = []);
       }
-      if (this.He && !this.Ee[0]) {
-        this.Ee[0] = runWithOwner((this.Pe[0] = createOwner()), this.He);
+      if (this.He && !this.We[0]) {
+        this.We[0] = runWithOwner((this.Ae[0] = createOwner()), this.He);
       }
-    } else if (this.ve === 0) {
-      if (this.Pe[0]) this.Pe[0].dispose();
-      this.Ee = new Array(t);
+    } else if (this.Ne === 0) {
+      if (this.Ae[0]) this.Ae[0].dispose();
+      this.We = new Array(t);
       for (r = 0; r < t; r++) {
         this.je[r] = e[r];
-        this.Ee[r] = runWithOwner((this.Pe[r] = createOwner()), i);
+        this.We[r] = runWithOwner((this.Ae[r] = createOwner()), i);
       }
-      this.ve = t;
+      this.Ne = t;
     } else {
       let s,
         o,
@@ -1747,21 +1827,21 @@ function updateKeyedMap() {
         p = this.Ie ? new Array(t) : undefined,
         y = this.Fe ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.ve, t);
-        s < o && (this.je[s] === e[s] || (this.Ie && compare(this.We, this.je[s], e[s])));
+        s = 0, o = Math.min(this.Ne, t);
+        s < o && (this.je[s] === e[s] || (this.Ie && compare(this.Ee, this.je[s], e[s])));
         s++
       ) {
         if (this.Ie) setSignal(this.Ie[s], e[s]);
       }
       for (
-        o = this.ve - 1, u = t - 1;
+        o = this.Ne - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.je[o] === e[u] || (this.Ie && compare(this.We, this.je[o], e[u])));
+        (this.je[o] === e[u] || (this.Ie && compare(this.Ee, this.je[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Ee[o];
-        h[u] = this.Pe[o];
+        d[u] = this.We[o];
+        h[u] = this.Ae[o];
         p && (p[u] = this.Ie[o]);
         y && (y[u] = this.Fe[o]);
       }
@@ -1769,28 +1849,28 @@ function updateKeyedMap() {
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         l = e[r];
-        f = this.We ? this.We(l) : l;
+        f = this.Ee ? this.Ee(l) : l;
         n = c.get(f);
         a[r] = n === undefined ? -1 : n;
         c.set(f, r);
       }
       for (n = s; n <= o; n++) {
         l = this.je[n];
-        f = this.We ? this.We(l) : l;
+        f = this.Ee ? this.Ee(l) : l;
         r = c.get(f);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Ee[n];
-          h[r] = this.Pe[n];
+          d[r] = this.We[n];
+          h[r] = this.Ae[n];
           p && (p[r] = this.Ie[n]);
           y && (y[r] = this.Fe[n]);
           r = a[r];
           c.set(f, r);
-        } else this.Pe[n].dispose();
+        } else this.Ae[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Ee[r] = d[r];
-          this.Pe[r] = h[r];
+          this.We[r] = d[r];
+          this.Ae[r] = h[r];
           if (p) {
             this.Ie[r] = p[r];
             setSignal(this.Ie[r], e[r]);
@@ -1800,24 +1880,24 @@ function updateKeyedMap() {
             setSignal(this.Fe[r], r);
           }
         } else {
-          this.Ee[r] = runWithOwner((this.Pe[r] = createOwner()), i);
+          this.We[r] = runWithOwner((this.Ae[r] = createOwner()), i);
         }
       }
-      this.Ee = this.Ee.slice(0, (this.ve = t));
+      this.We = this.We.slice(0, (this.Ne = t));
       this.je = e.slice(0);
     }
   });
-  return this.Ee;
+  return this.We;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    Ne: createOwner(),
-    ve: 0,
+    Ce: createOwner(),
+    Ne: 0,
     Qe: 0,
     Re: e,
-    Ae: t,
-    Pe: [],
-    Ee: [],
+    Pe: t,
+    Ae: [],
+    We: [],
     Ve: n?.from,
     He: n?.fallback
   });
@@ -1825,49 +1905,49 @@ function repeat(e, t, n) {
 function updateRepeat() {
   const e = this.Re();
   const t = this.Ve?.() || 0;
-  runWithOwner(this.Ne, () => {
+  runWithOwner(this.Ce, () => {
     if (e === 0) {
-      if (this.ve !== 0) {
-        this.Ne.dispose(false);
-        this.Pe = [];
-        this.Ee = [];
-        this.ve = 0;
+      if (this.Ne !== 0) {
+        this.Ce.dispose(false);
+        this.Ae = [];
+        this.We = [];
+        this.Ne = 0;
       }
-      if (this.He && !this.Ee[0]) {
-        this.Ee[0] = runWithOwner((this.Pe[0] = createOwner()), this.He);
+      if (this.He && !this.We[0]) {
+        this.We[0] = runWithOwner((this.Ae[0] = createOwner()), this.He);
       }
       return;
     }
     const n = t + e;
-    const r = this.Qe + this.ve;
-    if (this.ve === 0 && this.Pe[0]) this.Pe[0].dispose();
-    for (let e = n; e < r; e++) this.Pe[e - this.Qe].dispose();
+    const r = this.Qe + this.Ne;
+    if (this.Ne === 0 && this.Ae[0]) this.Ae[0].dispose();
+    for (let e = n; e < r; e++) this.Ae[e - this.Qe].dispose();
     if (this.Qe < t) {
       let e = this.Qe;
-      while (e < t && e < this.ve) this.Pe[e++].dispose();
-      this.Pe.splice(0, t - this.Qe);
-      this.Ee.splice(0, t - this.Qe);
+      while (e < t && e < this.Ne) this.Ae[e++].dispose();
+      this.Ae.splice(0, t - this.Qe);
+      this.We.splice(0, t - this.Qe);
     } else if (this.Qe > t) {
       let n = r - this.Qe - 1;
       let i = this.Qe - t;
-      this.Pe.length = this.Ee.length = e;
+      this.Ae.length = this.We.length = e;
       while (n >= i) {
-        this.Pe[n] = this.Pe[n - i];
-        this.Ee[n] = this.Ee[n - i];
+        this.Ae[n] = this.Ae[n - i];
+        this.We[n] = this.We[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.Ee[e] = runWithOwner((this.Pe[e] = createOwner()), () => this.Ae(e + t));
+        this.We[e] = runWithOwner((this.Ae[e] = createOwner()), () => this.Pe(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Ee[e - t] = runWithOwner((this.Pe[e - t] = createOwner()), () => this.Ae(e));
+      this.We[e - t] = runWithOwner((this.Ae[e - t] = createOwner()), () => this.Pe(e));
     }
-    this.Ee = this.Ee.slice(0, e);
+    this.We = this.We.slice(0, e);
     this.Qe = t;
-    this.ve = e;
+    this.Ne = e;
   });
-  return this.Ee;
+  return this.We;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
@@ -1901,7 +1981,7 @@ function createBoundChildren(e, t, n, r) {
 }
 class ConditionalQueue extends Queue {
   Me;
-  De = new Set();
+  Te = new Set();
   M = new Set();
   constructor(e) {
     super();
@@ -1921,57 +2001,57 @@ class ConditionalQueue extends Queue {
       }
       if (t & c) {
         if (n & c) {
-          this.De.add(e);
+          this.Te.add(e);
           t &= ~c;
-        } else if (this.De.delete(e)) t &= ~c;
+        } else if (this.Te.delete(e)) t &= ~c;
       }
     }
     return t ? super.notify(e, t, n) : true;
   }
 }
 class CollectionQueue extends Queue {
-  Be;
-  Pe = new Set();
+  De;
+  Ae = new Set();
   Me = signal(false, { pureWrite: true });
-  Te = false;
+  Be = false;
   constructor(e) {
     super();
-    this.Be = e;
+    this.De = e;
   }
   run(e) {
     if (!e || read(this.Me)) return;
     return super.run(e);
   }
   notify(e, t, n) {
-    if (!(t & this.Be) || (this.Be & f && this.Te)) return super.notify(e, t, n);
-    if (n & this.Be) {
-      this.Pe.add(e);
-      if (this.Pe.size === 1) setSignal(this.Me, true);
-    } else if (this.Pe.size > 0) {
-      this.Pe.delete(e);
-      if (this.Pe.size === 0) setSignal(this.Me, false);
-    }
-    t &= ~this.Be;
+    if (!(t & this.De) || (this.De & f && this.Be)) return super.notify(e, t, n);
+    if (n & this.De) {
+      this.Ae.add(e);
+      if (this.Ae.size === 1) setSignal(this.Me, true);
+    } else if (this.Ae.size > 0) {
+      this.Ae.delete(e);
+      if (this.Ae.size === 0) setSignal(this.Me, false);
+    }
+    t &= ~this.De;
     return t ? super.notify(e, t, n) : true;
   }
 }
-var X;
+var $;
 (function (e) {
   e["VISIBLE"] = "visible";
   e["HIDDEN"] = "hidden";
-})(X || (X = {}));
+})($ || ($ = {}));
 function createBoundary(e, t) {
   const n = createOwner();
-  const r = new ConditionalQueue(computed(() => t() === X.HIDDEN));
+  const r = new ConditionalQueue(computed(() => t() === $.HIDDEN));
   const i = createBoundChildren(n, e, r, 0);
   computed(() => {
     const e = read(r.Me);
     i.qe = e ? c | f : 0;
     if (!e) {
       r.M.forEach(e => r.notify(e, f, f));
-      r.De.forEach(e => r.notify(e, c, c));
+      r.Te.forEach(e => r.notify(e, c, c));
       r.M.clear();
-      r.De.clear();
+      r.Te.clear();
     }
   });
   return () => (read(r.Me) ? undefined : read(i));
@@ -1983,7 +2063,7 @@ function createCollectionBoundary(e, t, n) {
   const o = computed(() => {
     if (!read(i.Me)) {
       const e = read(s);
-      if (!untrack(() => read(i.Me))) i.Te = true;
+      if (!untrack(() => read(i.Me))) i.Be = true;
       return e;
     }
     return n(i);
@@ -1995,23 +2075,23 @@ function createLoadBoundary(e, t) {
 }
 function collectErrorSources(e, t) {
   let n = true;
-  let r = e.P;
+  let r = e.W;
   while (r !== null) {
     const e = r.I;
-    if (e.P && e.$ & c) {
+    if (e.W && e.$ & c) {
       n = false;
       collectErrorSources(e, t);
     }
-    r = r.W;
+    r = r.A;
   }
   n && t.push(e);
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
-    let n = e.Pe.values().next().value;
+    let n = e.Ae.values().next().value;
     return t(n.K, () => {
       const t = [];
-      for (const n of e.Pe) collectErrorSources(n, t);
+      for (const n of e.Ae) collectErrorSources(n, t);
       for (const e of t) recompute(e);
       schedule();
     });
@@ -2066,13 +2146,14 @@ function flattenArray(e, t = [], n) {
   if (r) throw r;
   return i;
 }
-exports.$PROXY = F;
-exports.$TARGET = I;
-exports.$TRACK = P;
+exports.$PROXY = Q;
+exports.$TARGET = H;
+exports.$TRACK = I;
 exports.ContextNotFoundError = ContextNotFoundError;
 exports.NoOwnerError = NoOwnerError;
 exports.NotReadyError = NotReadyError;
 exports.SUPPORTS_PROXY = y;
+exports.action = action;
 exports.createBoundary = createBoundary;
 exports.createContext = createContext;
 exports.createEffect = createEffect;