@solidjs/signals 0.9.0 → 0.9.1

package/dist/node.cjs

@@ -117,7 +117,7 @@ function runHeap(e, t) {
 function adjustHeight(e, t) {
   deleteFromHeap(e, t);
   let n = e.o;
-  for (let t = e.W; t; t = t.P) {
+  for (let t = e.P; t; t = t.W) {
     const e = t.H;
     const r = e.I || e;
     if (r.F && r.o >= n) n = r.o + 1;
@@ -131,8 +131,8 @@ function adjustHeight(e, t) {
 }
 const w = new Set();
 const _ = { l: new Array(2e3).fill(undefined), m: false, A: 0, _: 0 };
-const S = { l: new Array(2e3).fill(undefined), m: false, A: 0, _: 0 };
-let b = 0;
+const b = { l: new Array(2e3).fill(undefined), m: false, A: 0, _: 0 };
+let S = 0;
 let m = null;
 let x = false;
 function schedule() {
@@ -144,7 +144,7 @@ class Queue {
   i = null;
   V = [[], []];
   q = [];
-  created = b;
+  created = S;
   addChild(e) {
     this.q.push(e);
     e.i = this;
@@ -210,12 +210,12 @@ class GlobalQueue extends Queue {
       runHeap(_, GlobalQueue.D);
       if (m) {
         if (!transitionComplete(m)) {
-          runHeap(S, GlobalQueue.D);
+          runHeap(b, GlobalQueue.D);
           this.M = [];
           this.stashQueues(m.queueStash);
-          b++;
+          S++;
           x = false;
-          runPending(m.pendingNodes, true);
+          runTransitionPending(m.pendingNodes, true);
           m = null;
           return;
         }
@@ -223,19 +223,15 @@ class GlobalQueue extends Queue {
         this.restoreQueues(m.queueStash);
         w.delete(m);
         m = null;
-        if (runPending(this.M, false)) runHeap(_, GlobalQueue.D);
-      } else if (w.size) runHeap(S, GlobalQueue.D);
-      for (let e = 0; e < this.M.length; e++) {
-        const t = this.M[e];
-        if (t.K !== p) {
-          t.G = t.K;
-          t.K = p;
-          if (t.T) t.U = true;
-        }
-        if (t.F) GlobalQueue.B(t, false, true);
+        runTransitionPending(this.M, false);
+        _._ >= _.A && runHeap(_, GlobalQueue.D);
+      } else if (w.size) runHeap(b, GlobalQueue.D);
+      runPending(this.M);
+      while (_._ >= _.A) {
+        runHeap(_, GlobalQueue.D);
+        runPending(this.M);
       }
-      this.M.length = 0;
-      b++;
+      S++;
       x = false;
       this.run(d);
       this.run(h);
@@ -246,8 +242,8 @@ class GlobalQueue extends Queue {
   notify(e, t, n) {
     if (t & f) {
       if (n & f) {
-        if (m && !m.asyncNodes.includes(e.L.cause)) {
-          m.asyncNodes.push(e.L.cause);
+        if (m && !m.asyncNodes.includes(e.T.cause)) {
+          m.asyncNodes.push(e.T.cause);
           schedule();
         }
       }
@@ -256,37 +252,44 @@ class GlobalQueue extends Queue {
     return false;
   }
   initTransition(e) {
-    if (m && m.time === b) return;
+    if (m && m.time === S) return;
     if (!m) {
-      m = e.J ?? { time: b, pendingNodes: [], asyncNodes: [], queueStash: { V: [[], []], q: [] } };
+      m = e.K ?? { time: S, pendingNodes: [], asyncNodes: [], queueStash: { V: [[], []], q: [] } };
     }
     w.add(m);
-    m.time = b;
+    m.time = S;
     for (let e = 0; e < this.M.length; e++) {
       const t = this.M[e];
-      t.J = m;
+      t.K = m;
       m.pendingNodes.push(t);
     }
     this.M = m.pendingNodes;
   }
 }
-function runPending(e, t) {
-  let n = false;
-  const r = e.slice();
-  for (let e = 0; e < r.length; e++) {
-    const i = r[e];
-    i.J = m;
-    if (i.X) {
-      i.X.Y(t);
-      n = true;
+function runPending(e) {
+  for (let t = 0; t < e.length; t++) {
+    const n = e[t];
+    if (n.G !== p) {
+      n.U = n.G;
+      n.G = p;
+      if (n.L) n.J = true;
     }
-    if (i.Z && i.Z.K !== p) {
-      i.Z.Y(i.Z.K);
-      i.Z.K = p;
-      n = true;
+    if (n.X && n.X.G !== p) n.X.Y(n.X.G);
+    if (n.F) GlobalQueue.B(n, false, true);
+  }
+  e.length = 0;
+}
+function runTransitionPending(e, t) {
+  const n = e.slice();
+  for (let e = 0; e < n.length; e++) {
+    const r = n[e];
+    r.K = m;
+    if (r.Z) r.Z.Y(t);
+    if (r.X && r.X.G !== p) {
+      r.X.Y(r.X.G);
+      r.X.G = p;
     }
   }
-  return n;
 }
 const O = new GlobalQueue();
 function flush() {
@@ -309,7 +312,7 @@ function transitionComplete(e) {
 }
 function runInTransition(e, t) {
   const n = m;
-  m = e.J;
+  m = e.K;
   t(e);
   m = n;
 }
@@ -323,17 +326,17 @@ let j = false;
 let A = null;
 function notifySubs(e) {
   for (let t = e.O; t !== null; t = t.C) {
-    const e = t.N.S & o ? S : _;
+    const e = t.N.S & o ? b : _;
     if (e.A > t.N.o) e.A = t.N.o;
     insertIntoHeap(t.N, e);
   }
 }
 function recompute(t, n = false) {
-  const i = t.T && t.J != m;
+  const i = t.L && t.K != m;
   if (!n) {
-    if (t.J && m !== t.J && !i) O.initTransition(t);
-    deleteFromHeap(t, t.S & o ? S : _);
-    if (t.J) disposeChildren(t);
+    if (t.K && m !== t.K && !i) O.initTransition(t);
+    deleteFromHeap(t, t.S & o ? b : _);
+    if (t.K) disposeChildren(t);
     else {
       markDisposal(t);
       t.ee = t.te;
@@ -346,11 +349,11 @@ function recompute(t, n = false) {
   A = t;
   t.ie = null;
   t.S = r;
-  t.se = b;
-  let u = t.K === p ? t.G : t.K;
+  t.se = S;
+  let u = t.G === p ? t.U : t.G;
   let d = t.o;
   let h = t.$;
-  let y = t.L;
+  let y = t.T;
   let g = C;
   setStatusFlags(t, l | (h & a));
   C = true;
@@ -369,36 +372,36 @@ function recompute(t, n = false) {
   A = s;
   if (!(t.$ & f)) {
     const e = t.ie;
-    let n = e !== null ? e.P : t.W;
+    let n = e !== null ? e.W : t.P;
     if (n !== null) {
       do {
         n = unlinkSubs(n);
       } while (n !== null);
-      if (e !== null) e.P = null;
-      else t.W = null;
+      if (e !== null) e.W = null;
+      else t.P = null;
     }
   }
-  const w = !t.oe || !t.oe(t.K === p || t.ue || i ? t.G : t.K, u);
-  const x = t.$ !== h || t.L !== y;
+  const w = !t.oe || !t.oe(t.G === p || t.ue || i ? t.U : t.G, u);
+  const x = t.$ !== h || t.T !== y;
   t.le?.(x, h);
   if (w || x) {
     if (w) {
-      if (n || t.ue || i) t.G = u;
-      else t.K = u;
-      if (t.Z) t.Z.K = u;
+      if (n || t.ue || i) t.U = u;
+      else t.G = u;
+      if (t.X) t.X.G = u;
     }
     for (let e = t.O; e !== null; e = e.C) {
-      const n = e.N.S & o ? S : _;
+      const n = e.N.S & o ? b : _;
       if (e.N.o < t.o && n.A > e.N.o) n.A = e.N.o;
       insertIntoHeap(e.N, n);
     }
   } else if (t.o != d) {
     for (let e = t.O; e !== null; e = e.C) {
-      insertIntoHeapHeight(e.N, e.N.S & o ? S : _);
+      insertIntoHeapHeight(e.N, e.N.S & o ? b : _);
     }
   }
-  if ((!n || t.$ & f) && !t.ue && !t.J) O.M.push(t);
-  if (t.J && i) runInTransition(t, recompute);
+  if ((!n || t.$ & f) && !t.ue && !t.K) O.M.push(t);
+  if (t.K && i) runInTransition(t, recompute);
 }
 function handleAsync(e, t, n) {
   const r = typeof t === "object" && t !== null;
@@ -419,7 +422,7 @@ function handleAsync(e, t, n) {
       if (e.fe !== t) return;
       O.initTransition(e);
       setStatusFlags(e, c, n);
-      e.se = b;
+      e.se = S;
       notifySubs(e);
       schedule();
       flush();
@@ -437,7 +440,7 @@ function handleAsync(e, t, n) {
         if (e.fe !== t) return;
         O.initTransition(e);
         setStatusFlags(e, c, n);
-        e.se = b;
+        e.se = S;
         notifySubs(e);
         schedule();
         flush();
@@ -449,7 +452,7 @@ function handleAsync(e, t, n) {
 }
 function updateIfNecessary(r) {
   if (r.S & t) {
-    for (let e = r.W; e; e = e.P) {
+    for (let e = r.P; e; e = e.W) {
       const t = e.H;
       const i = t.I || t;
       if (i.F) {
@@ -467,7 +470,7 @@ function updateIfNecessary(r) {
 }
 function unlinkSubs(e) {
   const t = e.H;
-  const n = e.P;
+  const n = e.W;
   const r = e.C;
   const i = e.ce;
   if (r !== null) r.ce = i;
@@ -483,12 +486,12 @@ function unlinkSubs(e) {
   return n;
 }
 function unobserved(e) {
-  deleteFromHeap(e, e.S & o ? S : _);
-  let t = e.W;
+  deleteFromHeap(e, e.S & o ? b : _);
+  let t = e.P;
   while (t !== null) {
     t = unlinkSubs(t);
   }
-  e.W = null;
+  e.P = null;
   disposeChildren(e, true);
 }
 function link(e, t) {
@@ -497,7 +500,7 @@ function link(e, t) {
   let i = null;
   const s = t.S & r;
   if (s) {
-    i = n !== null ? n.P : t.W;
+    i = n !== null ? n.W : t.P;
     if (i !== null && i.H === e) {
       t.ie = i;
       return;
@@ -505,27 +508,27 @@ function link(e, t) {
   }
   const o = e.ae;
   if (o !== null && o.N === t && (!s || isValidLink(o, t))) return;
-  const u = (t.ie = e.ae = { H: e, N: t, P: i, ce: o, C: null });
-  if (n !== null) n.P = u;
-  else t.W = u;
+  const u = (t.ie = e.ae = { H: e, N: t, W: i, ce: o, C: null });
+  if (n !== null) n.W = u;
+  else t.P = 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.W;
+    let r = t.P;
     do {
       if (r === e) return true;
       if (r === n) break;
-      r = r.P;
+      r = r.W;
     } while (r !== null);
   }
   return false;
 }
 function setStatusFlags(e, t, n = null) {
   e.$ = t;
-  e.L = n;
+  e.T = n;
 }
 function markDisposal(e) {
   let t = e.re;
@@ -533,18 +536,18 @@ function markDisposal(e) {
     t.S |= o;
     if (t.S & i) {
       deleteFromHeap(t, _);
-      insertIntoHeap(t, S);
+      insertIntoHeap(t, b);
     }
     markDisposal(t);
     t = t.pe;
   }
 }
 function dispose(e) {
-  let t = e.W || null;
+  let t = e.P || null;
   do {
     t = unlinkSubs(t);
   } while (t !== null);
-  e.W = null;
+  e.P = null;
   e.ie = null;
   disposeChildren(e, true);
 }
@@ -554,14 +557,14 @@ function disposeChildren(e, t = false, n) {
   let r = n ? e.ne : e.re;
   while (r) {
     const e = r.pe;
-    if (r.W) {
+    if (r.P) {
       const e = r;
-      deleteFromHeap(e, e.S & o ? S : _);
-      let t = e.W;
+      deleteFromHeap(e, e.S & o ? b : _);
+      let t = e.P;
       do {
         t = unlinkSubs(t);
       } while (t !== null);
-      e.W = null;
+      e.P = null;
       e.ie = null;
     }
     disposeChildren(r, true);
@@ -608,12 +611,12 @@ function computed(t, n, r) {
     _e: A?._e ?? g,
     ye: 0,
     F: t,
-    G: n,
+    U: n,
     o: 0,
     k: null,
     p: undefined,
     h: null,
-    W: null,
+    P: null,
     ie: null,
     O: null,
     ae: null,
@@ -622,14 +625,14 @@ function computed(t, n, r) {
     re: null,
     S: e,
     $: a,
-    se: b,
-    K: p,
+    se: S,
+    G: p,
     ee: null,
     ne: null,
     fe: null,
-    J: null
+    K: null
   };
-  if (r?.Se) Object.assign(i, r.Se);
+  if (r?.be) Object.assign(i, r.be);
   i.h = i;
   const s = A?.t ? A.u : A;
   if (A) {
@@ -651,14 +654,14 @@ function signal(e, t, n = null) {
     oe: t?.equals != null ? t.equals : isEqual,
     ge: !!t?.pureWrite,
     de: t?.unobserved,
-    G: e,
+    U: e,
     O: null,
     ae: null,
     $: l,
-    se: b,
+    se: S,
     I: n,
     j: n?.k || null,
-    K: p
+    G: p
   };
   n && (n.k = r);
   return r;
@@ -685,9 +688,9 @@ function read(e) {
     const n = e.I || e;
     if (n.F) {
       const r = e.S & o;
-      if (n.o >= (r ? S.A : _.A)) {
+      if (n.o >= (r ? b.A : _.A)) {
         markNode(t);
-        markHeap(r ? S : _);
+        markHeap(r ? b : _);
         updateIfNecessary(n);
       }
       const i = n.o;
@@ -697,61 +700,61 @@ function read(e) {
     }
   }
   if (k) {
-    if (!e.X) {
-      e.X = signal(false);
-      e.X.ue = true;
-      e.X.Y = t => setSignal(e.X, t);
+    if (!e.Z) {
+      e.Z = signal(false);
+      e.Z.ue = true;
+      e.Z.Y = t => setSignal(e.Z, t);
     }
     const t = k;
     k = null;
-    t.G = read(e.X) || t.G;
+    t.U = read(e.Z) || t.U;
     k = t;
   }
   if (N) {
-    if (!e.Z) {
-      e.Z = signal(e.G);
-      e.Z.ue = true;
-      e.Z.Y = t => setSignal(e.Z, t);
+    if (!e.X) {
+      e.X = signal(e.U);
+      e.X.ue = true;
+      e.X.Y = t => setSignal(e.X, t);
     }
     N = false;
     try {
-      return read(e.Z);
+      return read(e.X);
     } finally {
       N = true;
     }
   }
   if (e.$ & f && !k) {
-    if ((t && !v) || e.$ & a) throw e.L;
+    if ((t && !v) || e.$ & a) throw e.T;
     else if (t && v) {
-      setStatusFlags(t, t.$ | 1, e.L);
+      setStatusFlags(t, t.$ | 1, e.T);
     }
   }
   if (e.$ & c) {
-    if (e.se < b) {
+    if (e.se < S) {
       recompute(e, true);
       return read(e);
     } else {
-      throw e.L;
+      throw e.T;
     }
   }
-  return !t || e.ue || e.K === p || (v && !k && e.J && m !== e.J) ? e.G : e.K;
+  return !t || e.ue || e.G === p || (v && !k && e.K && m !== e.K) ? e.U : e.G;
 }
 function setSignal(e, t) {
   if (typeof t === "function") {
-    t = t(e.K === p ? e.G : e.K);
+    t = t(e.G === p ? e.U : e.G);
   }
-  const n = !e.oe || !e.oe(e.K === p || e.ue ? e.G : e.K, t);
+  const n = !e.oe || !e.oe(e.G === p || e.ue ? e.U : e.G, t);
   if (!n && !e.$) return t;
   if (n) {
-    if (e.ue) e.G = t;
+    if (e.ue) e.U = t;
     else {
-      if (e.K === p) O.M.push(e);
-      e.K = t;
+      if (e.G === p) O.M.push(e);
+      e.G = t;
     }
-    if (e.Z) e.Z.K = t;
+    if (e.X) e.X.G = t;
   }
   setStatusFlags(e, l);
-  e.se = b;
+  e.se = S;
   notifySubs(e);
   schedule();
   return t;
@@ -837,10 +840,10 @@ function pending(e) {
 }
 function isPending(e) {
   const t = k;
-  k = { G: false };
+  k = { U: false };
   try {
     staleValues(e);
-    return k.G;
+    return k.U;
   } catch (e) {
     if (!(e instanceof NotReadyError)) return false;
     throw e;
@@ -893,23 +896,23 @@ function effect(e, t, n, r, i) {
   let s = false;
   const o = computed(e, r, {
     ...i,
-    Se: {
-      U: true,
-      be: r,
+    be: {
+      J: true,
+      Se: r,
       me: t,
       xe: n,
       Oe: undefined,
-      T: i?.render ? d : h,
+      L: i?.render ? d : h,
       le(e, t) {
         if (s) {
           const n = this.$ && this.$ === t && e;
-          this.U = !(this.$ & c) && !(this.$ & f & ~t) && !n;
-          if (this.U) this.we.enqueue(this.T, runEffect.bind(this));
+          this.J = !(this.$ & c) && !(this.$ & f & ~t) && !n;
+          if (this.J) this.we.enqueue(this.L, runEffect.bind(this));
         }
         if (this.$ & c) {
-          let e = this.L;
+          let e = this.T;
           this.we.notify(this, f, 0);
-          if (this.T === h) {
+          if (this.L === h) {
             try {
               return this.xe
                 ? this.xe(e, () => {
@@ -922,30 +925,30 @@ function effect(e, t, n, r, i) {
             }
           }
           if (!this.we.notify(this, c, c)) throw e;
-        } else if (this.T === d) {
+        } else if (this.L === d) {
           this.we.notify(this, f | c, this.$);
         }
       }
     }
   });
   s = true;
-  if (o.T === d) o.F = t => staleValues(() => e(t));
+  if (o.L === d) o.F = t => staleValues(() => e(t));
   !i?.defer &&
     !(o.$ & (c | f)) &&
-    (o.T === h ? o.we.enqueue(o.T, runEffect.bind(o)) : runEffect.call(o));
+    (o.L === h ? o.we.enqueue(o.L, runEffect.bind(o)) : runEffect.call(o));
   onCleanup(() => o.Oe?.());
 }
 function runEffect() {
-  if (!this.U || this.S & u) return;
+  if (!this.J || this.S & u) return;
   this.Oe?.();
   this.Oe = undefined;
   try {
-    this.Oe = this.me(this.G, this.be);
+    this.Oe = this.me(this.U, this.Se);
   } catch (e) {
     if (!this.we.notify(this, c, c)) throw e;
   } finally {
-    this.be = this.G;
-    this.U = false;
+    this.Se = this.U;
+    this.J = false;
   }
 }
 function createSignal(e, t, n) {
@@ -1017,7 +1020,7 @@ function onSettled(e) {
   });
 }
 function unwrap(e) {
-  return e?.[P]?.[V] ?? e;
+  return e?.[W]?.[V] ?? e;
 }
 function getOverrideValue(e, t, n, r) {
   return n && r in n ? read(n[r]) : t && r in t ? t[r] : e[r];
@@ -1028,13 +1031,13 @@ function getAllKeys(e, t, n) {
   return Array.from(new Set([...r, ...i]));
 }
 function applyState(e, t, n, r) {
-  const i = t?.[P];
+  const i = t?.[W];
   if (!i) return;
   const s = i[Q];
   const o = i[R];
   let u = i[V];
   if (e === s && !o) return;
-  (i[D] || K).set(e, i[H]);
+  (i[D] || T).set(e, i[H]);
   i[Q] = e;
   i[R] = undefined;
   if (Array.isArray(s)) {
@@ -1152,8 +1155,8 @@ function createProjectionInternal(e, t = {}, n) {
   const i = new WeakMap();
   const wrapProjection = e => {
     if (i.has(e)) return i.get(e);
-    if (e[P]?.[M] === wrapProjection) return e;
-    const t = createStoreProxy(e, T, {
+    if (e[W]?.[M] === wrapProjection) return e;
+    const t = createStoreProxy(e, G, {
       [M]: wrapProjection,
       [D]: i,
       [B]() {
@@ -1179,8 +1182,8 @@ function createProjection(e, t = {}, n) {
   return createProjectionInternal(e, t, n).store;
 }
 const E = Symbol(0),
-  W = Symbol(0),
   P = Symbol(0),
+  W = Symbol(0),
   H = Symbol(0),
   I = Symbol(0);
 const F = new WeakMap();
@@ -1191,7 +1194,7 @@ const Q = "v",
   M = "w",
   D = "l",
   B = "f";
-function createStoreProxy(e, t = T, n) {
+function createStoreProxy(e, t = G, n) {
   let r;
   if (Array.isArray(e)) {
     r = [];
@@ -1200,11 +1203,11 @@ function createStoreProxy(e, t = T, n) {
   n && Object.assign(r, n);
   return (r[H] = new Proxy(r, t));
 }
-const K = new WeakMap();
+const T = new WeakMap();
 function wrap(e, t) {
   if (t?.[M]) return t[M](e, t);
-  let n = e[H] || K.get(e);
-  if (!n) K.set(e, (n = createStoreProxy(e)));
+  let n = e[H] || T.get(e);
+  if (!n) T.set(e, (n = createStoreProxy(e)));
   return n;
 }
 function isWrappable(e) {
@@ -1250,30 +1253,30 @@ function getPropertyDescriptor(e, t, n) {
   }
   return Reflect.getOwnPropertyDescriptor(r, n);
 }
-let G = null;
-const T = {
+let K = null;
+const G = {
   get(e, t, n) {
-    if (t === P) return e;
+    if (t === W) return e;
     if (t === H) return n;
-    if (t === E || t === W) {
+    if (t === E || t === P) {
       trackSelf(e, t);
       return n;
     }
     const r = getNodes(e, V);
     const i = r[t];
     const s = e[R] && t in e[R];
-    const o = !!e[Q][P];
+    const o = !!e[Q][W];
     const u = s ? e[R] : e[Q];
     if (!i) {
       const e = Object.getOwnPropertyDescriptor(u, t);
       if (e && e.get) return e.get.call(n);
     }
-    if (G?.has(n)) {
-      let n = i && (s || !o) ? (i.K !== p ? i.K : i.G) : u[t];
+    if (K?.has(n)) {
+      let n = i && (s || !o) ? (i.G !== p ? i.G : i.U) : u[t];
       n === I && (n = undefined);
       if (!isWrappable(n)) return n;
       const r = wrap(n, e);
-      G.add(r);
+      K.add(r);
       return r;
     }
     let l = i ? (s || !o ? read(r[t]) : (read(r[t]), u[t])) : u[t];
@@ -1298,12 +1301,12 @@ const T = {
   },
   set(e, t, n) {
     const r = e[H];
-    if (G?.has(e[H])) {
+    if (K?.has(e[H])) {
       untrack(() => {
         const i = e[Q];
         const s = i[t];
         const o = e[R] && t in e[R] ? e[R][t] : s;
-        const u = n?.[P]?.[Q] ?? n;
+        const u = n?.[W]?.[Q] ?? n;
         if (o === u) return true;
         const l = e[R]?.length || i.length;
         if (u !== undefined && u === s) delete e[R][t];
@@ -1313,7 +1316,7 @@ const T = {
           const e = F.get(o);
           e && (e instanceof Set ? e.delete(r) : F.delete(o));
         }
-        if (recursivelyNotify(r, K) && f) recursivelyAddParent(u, r);
+        if (recursivelyNotify(r, T) && f) recursivelyAddParent(u, r);
         e[q]?.[t] && setSignal(e[q][t], true);
         const c = getNodes(e, V);
         c[t] && setSignal(c[t], () => (f ? wrap(u, e) : u));
@@ -1327,7 +1330,7 @@ const T = {
     return true;
   },
   deleteProperty(e, t) {
-    if (G?.has(e[H]) && e[R]?.[t] !== I) {
+    if (K?.has(e[H]) && e[R]?.[t] !== I) {
       untrack(() => {
         const n = e[R] && t in e[R] ? e[R][t] : e[Q][t];
         if (t in e[Q]) {
@@ -1360,9 +1363,9 @@ const T = {
   }
 };
 function storeSetter(e, t) {
-  const n = G;
-  G = new Set();
-  G.add(e);
+  const n = K;
+  K = new Set();
+  K.add(e);
   try {
     const n = t(e);
     if (n !== e && n !== undefined) {
@@ -1378,8 +1381,8 @@ function storeSetter(e, t) {
       }
     }
   } finally {
-    G.clear();
-    G = n;
+    K.clear();
+    K = n;
   }
 }
 function createStore(e, t, n) {
@@ -1388,10 +1391,10 @@ function createStore(e, t, n) {
   return [i, e => storeSetter(i, e)];
 }
 function recursivelyNotify(e, t) {
-  let n = e[P] || t?.get(e)?.[P];
+  let n = e[W] || t?.get(e)?.[W];
   let r = false;
   if (n) {
-    const e = getNodes(n, V)[W];
+    const e = getNodes(n, V)[P];
     if (e) {
       setSignal(e, undefined);
       r = true;
@@ -1407,7 +1410,7 @@ function recursivelyNotify(e, t) {
 }
 function recursivelyAddParent(e, t) {
   let n;
-  const r = e[P];
+  const r = e[W];
   if (r) {
     n = r[R];
     e = r[Q];
@@ -1438,7 +1441,7 @@ function recursivelyAddParent(e, t) {
 }
 function deep(e) {
   recursivelyAddParent(e);
-  return e[W];
+  return e[P];
 }
 function createOptimisticStore(e, t, n) {
   return [];
@@ -1448,12 +1451,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[P] || n?.get(e)?.[P])) {
+  if ((r = e[W] || n?.get(e)?.[W])) {
     s = r[R];
     i = Array.isArray(r[Q]);
     t.set(e, s ? (o = i ? [] : Object.create(Object.getPrototypeOf(r[Q]))) : r[Q]);
     e = r[Q];
-    n = K;
+    n = T;
   } else {
     i = Array.isArray(e);
     t.set(e, e);
@@ -1627,8 +1630,8 @@ function mapArray(e, t, n) {
       je: t,
       Ae: [],
       Ee: [],
-      We: r,
-      Pe: r || n?.keyed === false ? [] : undefined,
+      Pe: r,
+      We: r || n?.keyed === false ? [] : undefined,
       He: t.length > 1 ? [] : undefined,
       Ie: n?.fallback
     })
@@ -1642,12 +1645,12 @@ function updateKeyedMap() {
   runWithOwner(this.Ce, () => {
     let n,
       r,
-      i = this.Pe
+      i = this.We
         ? () => {
-            this.Pe[r] = signal(e[r], z);
+            this.We[r] = signal(e[r], z);
             this.He && (this.He[r] = signal(r, z));
             return this.je(
-              read.bind(null, this.Pe[r]),
+              read.bind(null, this.We[r]),
               this.He ? read.bind(null, this.He[r]) : undefined
             );
           }
@@ -1668,7 +1671,7 @@ function updateKeyedMap() {
         this.ke = [];
         this.Ae = [];
         this.ve = 0;
-        this.Pe && (this.Pe = []);
+        this.We && (this.We = []);
         this.He && (this.He = []);
       }
       if (this.Ie && !this.Ae[0]) {
@@ -1692,44 +1695,44 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         h = new Array(t),
-        p = this.Pe ? new Array(t) : undefined,
+        p = this.We ? new Array(t) : undefined,
         y = this.He ? new Array(t) : undefined;
       for (
         s = 0, o = Math.min(this.ve, t);
-        s < o && (this.ke[s] === e[s] || (this.Pe && compare(this.We, this.ke[s], e[s])));
+        s < o && (this.ke[s] === e[s] || (this.We && compare(this.Pe, this.ke[s], e[s])));
         s++
       ) {
-        if (this.Pe) setSignal(this.Pe[s], e[s]);
+        if (this.We) setSignal(this.We[s], e[s]);
       }
       for (
         o = this.ve - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.ke[o] === e[u] || (this.Pe && compare(this.We, this.ke[o], e[u])));
+        (this.ke[o] === e[u] || (this.We && compare(this.Pe, this.ke[o], e[u])));
         o--, u--
       ) {
         d[u] = this.Ae[o];
         h[u] = this.Ee[o];
-        p && (p[u] = this.Pe[o]);
+        p && (p[u] = this.We[o]);
         y && (y[u] = this.He[o]);
       }
       c = new Map();
       a = new Array(u + 1);
       for (r = u; r >= s; r--) {
         l = e[r];
-        f = this.We ? this.We(l) : l;
+        f = this.Pe ? this.Pe(l) : l;
         n = c.get(f);
         a[r] = n === undefined ? -1 : n;
         c.set(f, r);
       }
       for (n = s; n <= o; n++) {
         l = this.ke[n];
-        f = this.We ? this.We(l) : l;
+        f = this.Pe ? this.Pe(l) : l;
         r = c.get(f);
         if (r !== undefined && r !== -1) {
           d[r] = this.Ae[n];
           h[r] = this.Ee[n];
-          p && (p[r] = this.Pe[n]);
+          p && (p[r] = this.We[n]);
           y && (y[r] = this.He[n]);
           r = a[r];
           c.set(f, r);
@@ -1740,8 +1743,8 @@ function updateKeyedMap() {
           this.Ae[r] = d[r];
           this.Ee[r] = h[r];
           if (p) {
-            this.Pe[r] = p[r];
-            setSignal(this.Pe[r], e[r]);
+            this.We[r] = p[r];
+            setSignal(this.We[r], e[r]);
           }
           if (y) {
             this.He[r] = y[r];
@@ -1822,7 +1825,7 @@ function compare(e, t, n) {
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, {
-    Se: {
+    be: {
       le() {
         let e = this.$;
         this.$ &= ~this.Ve;
@@ -1943,21 +1946,21 @@ function createLoadBoundary(e, t) {
 }
 function collectErrorSources(e, t) {
   let n = true;
-  let r = e.W;
+  let r = e.P;
   while (r !== null) {
     const e = r.H;
-    if (e.W && e.$ & c) {
+    if (e.P && e.$ & c) {
       n = false;
       collectErrorSources(e, t);
     }
-    r = r.P;
+    r = r.W;
   }
   n && t.push(e);
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
     let n = e.Ee.values().next().value;
-    return t(n.L, () => {
+    return t(n.T, () => {
       const t = [];
       for (const n of e.Ee) collectErrorSources(n, t);
       for (const e of t) recompute(e);
@@ -2015,7 +2018,7 @@ function flattenArray(e, t = [], n) {
   return i;
 }
 exports.$PROXY = H;
-exports.$TARGET = P;
+exports.$TARGET = W;
 exports.$TRACK = E;
 exports.ContextNotFoundError = ContextNotFoundError;
 exports.NoOwnerError = NoOwnerError;