@solidjs/signals 0.8.5 → 0.8.6

package/dist/node.cjs

@@ -328,74 +328,76 @@ function notifySubs(e) {
   }
 }
 function recompute(t, n = false) {
-  deleteFromHeap(t, t.S & o ? S : _);
-  if (t.K !== p || t.ee || t.te) disposeChildren(t);
-  else {
-    markDisposal(t);
-    O.M.push(t);
-    t.te = t.ne;
-    t.ee = t.re;
-    t.ne = null;
-    t.re = null;
+  const i = t.T && t.J != m;
+  if (!n) {
+    if (t.J && m !== t.J && !i) O.initTransition(t);
+    deleteFromHeap(t, t.S & o ? S : _);
+    if (t.J) disposeChildren(t);
+    else {
+      markDisposal(t);
+      t.ee = t.te;
+      t.ne = t.re;
+      t.te = null;
+      t.re = null;
+    }
   }
-  const i = E;
+  const s = E;
   E = t;
   t.ie = null;
   t.S = r;
   t.se = b;
-  let s = t.K === p ? t.G : t.K;
-  let u = t.o;
-  let d = t.$;
-  let h = t.L;
-  let y = C;
-  setStatusFlags(t, l | (d & a));
+  let u = t.K === p ? t.G : t.K;
+  let d = t.o;
+  let h = t.$;
+  let y = t.L;
+  let g = C;
+  setStatusFlags(t, l | (h & a));
   C = true;
   try {
-    s = t.F(s);
+    u = t.F(u);
     t.$ &= ~a;
   } catch (e) {
     if (e instanceof NotReadyError) {
       if (e.cause !== t) link(e.cause, t);
-      setStatusFlags(t, (d & ~c) | f, e);
+      setStatusFlags(t, (h & ~c) | f, e);
     } else setStatusFlags(t, c, e);
   } finally {
-    C = y;
+    C = g;
   }
   t.S = e;
-  E = i;
-  const g = t.ie;
-  let w = g !== null ? g.P : t.W;
-  if (w !== null) {
-    do {
-      w = unlinkSubs(w);
-    } while (w !== null);
-    if (g !== null) g.P = null;
-    else t.W = null;
-  }
-  const x = t.T && t.J != m;
-  const v = !t.oe || !t.oe(t.K === p || t.ue || x ? t.G : t.K, s);
-  const N = t.$ !== d || t.L !== h;
-  t.le?.(N, d);
-  if (v || N) {
-    if (v) {
-      if (n || t.ue || x) t.G = s;
-      else {
-        if (t.K === p) O.M.push(t);
-        t.K = s;
-      }
-      if (t.Z) t.Z.Y(s);
+  E = s;
+  if (!(t.$ & f)) {
+    const e = t.ie;
+    let n = e !== null ? e.P : t.W;
+    if (n !== null) {
+      do {
+        n = unlinkSubs(n);
+      } while (n !== null);
+      if (e !== null) e.P = null;
+      else t.W = 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;
+  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;
     }
     for (let e = t.O; e !== null; e = e.C) {
       const n = e.N.S & o ? S : _;
       if (e.N.o < t.o && n.A > e.N.o) n.A = e.N.o;
       insertIntoHeap(e.N, n);
     }
-  } else if (t.o != u) {
+  } else if (t.o != d) {
     for (let e = t.O; e !== null; e = e.C) {
       insertIntoHeapHeight(e.N, e.N.S & o ? S : _);
     }
   }
-  if (t.J && x) runInTransition(t, recompute);
+  if ((!n || t.$ & f) && !t.ue && !i && !t.J) O.M.push(t);
+  if (t.J && i) runInTransition(t, recompute);
 }
 function updateIfNecessary(r) {
   if (r.S & t) {
@@ -427,7 +429,7 @@ function unlinkSubs(e) {
     t.O = r;
     if (r === null) {
       t.ae?.();
-      t.F && unobserved(t);
+      t.F && !t.de && unobserved(t);
     }
   }
   return n;
@@ -439,7 +441,7 @@ function unobserved(e) {
     t = unlinkSubs(t);
   }
   e.W = null;
-  runDisposal(e);
+  disposeChildren(e, true);
 }
 function link(e, t) {
   const n = t.ie;
@@ -486,7 +488,7 @@ function markDisposal(e) {
       insertIntoHeap(t, S);
     }
     markDisposal(t);
-    t = t.de;
+    t = t.he;
   }
 }
 function dispose(e) {
@@ -501,9 +503,9 @@ function dispose(e) {
 function disposeChildren(e, t = false, n) {
   if (e.S & u) return;
   if (t) e.S = u;
-  let r = n ? e.ee : e.re;
+  let r = n ? e.ne : e.re;
   while (r) {
-    const e = r.de;
+    const e = r.he;
     if (r.W) {
       const e = r;
       deleteFromHeap(e, e.S & o ? S : _);
@@ -518,15 +520,15 @@ function disposeChildren(e, t = false, n) {
     r = e;
   }
   if (n) {
-    e.ee = null;
+    e.ne = null;
   } else {
     e.re = null;
-    e.de = null;
+    e.he = null;
   }
   runDisposal(e, n);
 }
 function runDisposal(e, t) {
-  let n = t ? e.te : e.ne;
+  let n = t ? e.ee : e.te;
   if (!n) return;
   if (Array.isArray(n)) {
     for (let e = 0; e < n.length; e++) {
@@ -536,10 +538,10 @@ function runDisposal(e, t) {
   } else {
     n.call(n);
   }
-  t ? (e.te = null) : (e.ne = null);
+  t ? (e.ee = null) : (e.te = null);
 }
 function getNextChildId(e) {
-  if (e.id != null) return formatId(e.id, e.he++);
+  if (e.id != null) return formatId(e.id, e.pe++);
   throw new Error("Cannot get child id from owner without an id");
 }
 function formatId(e, t) {
@@ -551,12 +553,12 @@ function computed(t, n, r) {
   const i = {
     id: r?.id ?? (E?.id != null ? getNextChildId(E) : undefined),
     oe: r?.equals != null ? r.equals : isEqual,
-    pe: !!r?.pureWrite,
+    ye: !!r?.pureWrite,
     ae: r?.unobserved,
-    ne: null,
-    ye: E?.ye ?? O,
-    ge: E?.ge ?? g,
-    he: 0,
+    te: null,
+    ge: E?.ge ?? O,
+    we: E?.we ?? g,
+    pe: 0,
     F: t,
     G: n,
     o: 0,
@@ -568,17 +570,17 @@ function computed(t, n, r) {
     O: null,
     ce: null,
     i: E,
-    de: null,
+    he: null,
     re: null,
     S: e,
     $: a,
     se: b,
     K: p,
-    te: null,
     ee: null,
+    ne: null,
     J: null
   };
-  if (r?.we) Object.assign(i, r.we);
+  if (r?._e) Object.assign(i, r._e);
   i.h = i;
   const s = E?.t ? E.u : E;
   if (E) {
@@ -586,7 +588,7 @@ function computed(t, n, r) {
     if (e === null) {
       E.re = i;
     } else {
-      i.de = e;
+      i.he = e;
       E.re = i;
     }
   }
@@ -645,7 +647,7 @@ function asyncComputed(e, t, n) {
     throw new NotReadyError(E);
   };
   const s = computed(fn, t, n);
-  s._e = () => {
+  s.Se = () => {
     i = true;
     recompute(s);
     schedule();
@@ -657,7 +659,7 @@ function signal(e, t, n = null) {
   const r = {
     id: t?.id ?? (E?.id != null ? getNextChildId(E) : undefined),
     oe: t?.equals != null ? t.equals : isEqual,
-    pe: !!t?.pureWrite,
+    ye: !!t?.pureWrite,
     ae: t?.unobserved,
     G: e,
     O: null,
@@ -687,6 +689,7 @@ function read(e) {
   let t = E;
   if (t?.t) t = t.u;
   if (t && C && !k && !N) {
+    if (e.F && e.S & u) recompute(e);
     link(e, t);
     const n = e.I || e;
     if (n.F) {
@@ -771,12 +774,12 @@ function getOwner() {
 function onCleanup(e) {
   if (!E) return e;
   const t = E;
-  if (!t.ne) {
-    t.ne = e;
-  } else if (Array.isArray(t.ne)) {
-    t.ne.push(e);
+  if (!t.te) {
+    t.te = e;
+  } else if (Array.isArray(t.te)) {
+    t.te.push(e);
   } else {
-    t.ne = [t.ne, e];
+    t.te = [t.te, e];
   }
   return e;
 }
@@ -786,14 +789,14 @@ function createOwner(e) {
     t: true,
     u: t?.t ? t.u : t,
     re: null,
-    de: null,
-    ne: null,
-    id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
-    ye: t?.ye ?? O,
-    ge: t?.ge || g,
-    he: 0,
+    he: null,
     te: null,
+    id: e?.id ?? (t?.id != null ? getNextChildId(t) : undefined),
+    ge: t?.ge ?? O,
+    we: t?.we || g,
+    pe: 0,
     ee: null,
+    ne: null,
     i: t,
     dispose(e = true) {
       disposeChildren(n, e);
@@ -804,7 +807,7 @@ function createOwner(e) {
     if (e === null) {
       t.re = n;
     } else {
-      n.de = e;
+      n.he = e;
       t.re = n;
     }
   }
@@ -861,7 +864,7 @@ function getContext(e, t = getOwner()) {
   if (!t) {
     throw new NoOwnerError();
   }
-  const n = hasContext(e, t) ? t.ge[e.id] : e.defaultValue;
+  const n = hasContext(e, t) ? t.we[e.id] : e.defaultValue;
   if (isUndefined(n)) {
     throw new ContextNotFoundError();
   }
@@ -871,10 +874,10 @@ function setContext(e, t, n = getOwner()) {
   if (!n) {
     throw new NoOwnerError();
   }
-  n.ge = { ...n.ge, [e.id]: isUndefined(t) ? e.defaultValue : t };
+  n.we = { ...n.we, [e.id]: isUndefined(t) ? e.defaultValue : t };
 }
 function hasContext(e, t) {
-  return !isUndefined(t?.ge[e.id]);
+  return !isUndefined(t?.we[e.id]);
 }
 function isUndefined(e) {
   return typeof e === "undefined";
@@ -883,37 +886,37 @@ function effect(e, t, n, r, i) {
   let s = false;
   const o = computed(e, r, {
     ...i,
-    we: {
+    _e: {
       U: true,
-      Se: r,
-      be: t,
-      me: n,
-      xe: undefined,
+      be: r,
+      me: t,
+      xe: n,
+      Oe: undefined,
       T: 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.ye.enqueue(this.T, runEffect.bind(this));
+          if (this.U) this.ge.enqueue(this.T, runEffect.bind(this));
         }
         if (this.$ & c) {
           let e = this.L;
-          this.ye.notify(this, f, 0);
+          this.ge.notify(this, f, 0);
           if (this.T === h) {
             try {
-              return this.me
-                ? this.me(e, () => {
-                    this.xe?.();
-                    this.xe = undefined;
+              return this.xe
+                ? this.xe(e, () => {
+                    this.Oe?.();
+                    this.Oe = undefined;
                   })
                 : console.error(e);
             } catch (t) {
               e = t;
             }
           }
-          if (!this.ye.notify(this, c, c)) throw e;
+          if (!this.ge.notify(this, c, c)) throw e;
         } else if (this.T === d) {
-          this.ye.notify(this, f | c, this.$);
+          this.ge.notify(this, f | c, this.$);
         }
       }
     }
@@ -922,19 +925,19 @@ function effect(e, t, n, r, i) {
   if (o.T === d) o.F = t => staleValues(() => e(t));
   !i?.defer &&
     !(o.$ & (c | f)) &&
-    (o.T === h ? o.ye.enqueue(o.T, runEffect.bind(o)) : runEffect.call(o));
-  onCleanup(() => o.xe?.());
+    (o.T === h ? o.ge.enqueue(o.T, runEffect.bind(o)) : runEffect.call(o));
+  onCleanup(() => o.Oe?.());
 }
 function runEffect() {
   if (!this.U || this.S & u) return;
-  this.xe?.();
-  this.xe = undefined;
+  this.Oe?.();
+  this.Oe = undefined;
   try {
-    this.xe = this.be(this.G, this.Se);
+    this.Oe = this.me(this.G, this.be);
   } catch (e) {
-    if (!this.ye.notify(this, c, c)) throw e;
+    if (!this.ge.notify(this, c, c)) throw e;
   } finally {
-    this.Se = this.G;
+    this.be = this.G;
     this.U = false;
   }
 }
@@ -955,7 +958,7 @@ function createMemo(e, t, n) {
 function createAsync(e, t, n) {
   const r = asyncComputed(e, t, n);
   const i = read.bind(null, r);
-  i.refresh = r._e;
+  i.refresh = r.Se;
   return i;
 }
 function createEffect(e, t, n, r) {
@@ -1615,68 +1618,68 @@ function mapArray(e, t, n) {
   const r = typeof n?.keyed === "function" ? n.keyed : undefined;
   return createMemo(
     updateKeyedMap.bind({
-      Oe: createOwner(),
-      Ce: 0,
-      ve: e,
-      Ne: [],
-      ke: t,
-      Ee: [],
+      Ce: createOwner(),
+      ve: 0,
+      Ne: e,
+      ke: [],
+      Ee: t,
       je: [],
-      Ae: r,
-      We: r || n?.keyed === false ? [] : undefined,
-      Pe: t.length > 1 ? [] : undefined,
-      He: n?.fallback
+      Ae: [],
+      We: r,
+      Pe: r || n?.keyed === false ? [] : undefined,
+      He: t.length > 1 ? [] : undefined,
+      Ie: n?.fallback
     })
   );
 }
 const L = { pureWrite: true };
 function updateKeyedMap() {
-  const e = this.ve() || [],
+  const e = this.Ne() || [],
     t = e.length;
   e[j];
-  runWithOwner(this.Oe, () => {
+  runWithOwner(this.Ce, () => {
     let n,
       r,
-      i = this.We
+      i = this.Pe
         ? () => {
-            this.We[r] = signal(e[r], L);
-            this.Pe && (this.Pe[r] = signal(r, L));
-            return this.ke(
-              read.bind(null, this.We[r]),
-              this.Pe ? read.bind(null, this.Pe[r]) : undefined
+            this.Pe[r] = signal(e[r], L);
+            this.He && (this.He[r] = signal(r, L));
+            return this.Ee(
+              read.bind(null, this.Pe[r]),
+              this.He ? read.bind(null, this.He[r]) : undefined
             );
           }
-        : this.Pe
+        : this.He
           ? () => {
               const t = e[r];
-              this.Pe[r] = signal(r, L);
-              return this.ke(() => t, read.bind(null, this.Pe[r]));
+              this.He[r] = signal(r, L);
+              return this.Ee(() => t, read.bind(null, this.He[r]));
             }
           : () => {
               const t = e[r];
-              return this.ke(() => t);
+              return this.Ee(() => t);
             };
     if (t === 0) {
-      if (this.Ce !== 0) {
-        this.Oe.dispose(false);
+      if (this.ve !== 0) {
+        this.Ce.dispose(false);
+        this.Ae = [];
+        this.ke = [];
         this.je = [];
-        this.Ne = [];
-        this.Ee = [];
-        this.Ce = 0;
-        this.We && (this.We = []);
+        this.ve = 0;
         this.Pe && (this.Pe = []);
+        this.He && (this.He = []);
       }
-      if (this.He && !this.Ee[0]) {
-        this.Ee[0] = runWithOwner((this.je[0] = createOwner()), this.He);
+      if (this.Ie && !this.je[0]) {
+        this.je[0] = runWithOwner((this.Ae[0] = createOwner()), this.Ie);
       }
-    } else if (this.Ce === 0) {
-      if (this.je[0]) this.je[0].dispose();
-      this.Ee = new Array(t);
+    } else if (this.ve === 0) {
+      if (this.Ae[0]) this.Ae[0].dispose();
+      this.je = new Array(t);
       for (r = 0; r < t; r++) {
-        this.Ne[r] = e[r];
-        this.Ee[r] = runWithOwner((this.je[r] = createOwner()), i);
+        this.ke[r] = e[r];
+        this.je[r] = runWithOwner((this.Ae[r] = createOwner()), i);
       }
-      this.Ce = t;
+      this.ve = t;
     } else {
       let s,
         o,
@@ -1687,174 +1690,175 @@ function updateKeyedMap() {
         a,
         d = new Array(t),
         h = new Array(t),
-        p = this.We ? new Array(t) : undefined,
-        y = this.Pe ? new Array(t) : undefined;
+        p = this.Pe ? new Array(t) : undefined,
+        y = this.He ? new Array(t) : undefined;
       for (
-        s = 0, o = Math.min(this.Ce, t);
-        s < o && (this.Ne[s] === e[s] || (this.We && compare(this.Ae, this.Ne[s], e[s])));
+        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++
       ) {
-        if (this.We) setSignal(this.We[s], e[s]);
+        if (this.Pe) setSignal(this.Pe[s], e[s]);
       }
       for (
-        o = this.Ce - 1, u = t - 1;
+        o = this.ve - 1, u = t - 1;
         o >= s &&
         u >= s &&
-        (this.Ne[o] === e[u] || (this.We && compare(this.Ae, this.Ne[o], e[u])));
+        (this.ke[o] === e[u] || (this.Pe && compare(this.We, this.ke[o], e[u])));
         o--, u--
       ) {
-        d[u] = this.Ee[o];
-        h[u] = this.je[o];
-        p && (p[u] = this.We[o]);
-        y && (y[u] = this.Pe[o]);
+        d[u] = this.je[o];
+        h[u] = this.Ae[o];
+        p && (p[u] = this.Pe[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.Ae ? this.Ae(l) : l;
+        f = this.We ? this.We(l) : l;
         n = c.get(f);
         a[r] = n === undefined ? -1 : n;
         c.set(f, r);
       }
       for (n = s; n <= o; n++) {
-        l = this.Ne[n];
-        f = this.Ae ? this.Ae(l) : l;
+        l = this.ke[n];
+        f = this.We ? this.We(l) : l;
         r = c.get(f);
         if (r !== undefined && r !== -1) {
-          d[r] = this.Ee[n];
-          h[r] = this.je[n];
-          p && (p[r] = this.We[n]);
-          y && (y[r] = this.Pe[n]);
+          d[r] = this.je[n];
+          h[r] = this.Ae[n];
+          p && (p[r] = this.Pe[n]);
+          y && (y[r] = this.He[n]);
           r = a[r];
           c.set(f, r);
-        } else this.je[n].dispose();
+        } else this.Ae[n].dispose();
       }
       for (r = s; r < t; r++) {
         if (r in d) {
-          this.Ee[r] = d[r];
-          this.je[r] = h[r];
+          this.je[r] = d[r];
+          this.Ae[r] = h[r];
           if (p) {
-            this.We[r] = p[r];
-            setSignal(this.We[r], e[r]);
+            this.Pe[r] = p[r];
+            setSignal(this.Pe[r], e[r]);
           }
           if (y) {
-            this.Pe[r] = y[r];
-            setSignal(this.Pe[r], r);
+            this.He[r] = y[r];
+            setSignal(this.He[r], r);
           }
         } else {
-          this.Ee[r] = runWithOwner((this.je[r] = createOwner()), i);
+          this.je[r] = runWithOwner((this.Ae[r] = createOwner()), i);
         }
       }
-      this.Ee = this.Ee.slice(0, (this.Ce = t));
-      this.Ne = e.slice(0);
+      this.je = this.je.slice(0, (this.ve = t));
+      this.ke = e.slice(0);
     }
   });
-  return this.Ee;
+  return this.je;
 }
 function repeat(e, t, n) {
   return updateRepeat.bind({
-    Oe: createOwner(),
-    Ce: 0,
-    Ie: 0,
-    Fe: e,
-    ke: t,
+    Ce: createOwner(),
+    ve: 0,
+    Fe: 0,
+    Qe: e,
+    Ee: t,
+    Ae: [],
     je: [],
-    Ee: [],
-    Qe: n?.from,
-    He: n?.fallback
+    Re: n?.from,
+    Ie: n?.fallback
   });
 }
 function updateRepeat() {
-  const e = this.Fe();
-  const t = this.Qe?.() || 0;
-  runWithOwner(this.Oe, () => {
+  const e = this.Qe();
+  const t = this.Re?.() || 0;
+  runWithOwner(this.Ce, () => {
     if (e === 0) {
-      if (this.Ce !== 0) {
-        this.Oe.dispose(false);
+      if (this.ve !== 0) {
+        this.Ce.dispose(false);
+        this.Ae = [];
         this.je = [];
-        this.Ee = [];
-        this.Ce = 0;
+        this.ve = 0;
       }
-      if (this.He && !this.Ee[0]) {
-        this.Ee[0] = runWithOwner((this.je[0] = createOwner()), this.He);
+      if (this.Ie && !this.je[0]) {
+        this.je[0] = runWithOwner((this.Ae[0] = createOwner()), this.Ie);
       }
       return;
     }
     const n = t + e;
-    const r = this.Ie + this.Ce;
-    if (this.Ce === 0 && this.je[0]) this.je[0].dispose();
-    for (let e = n; e < r; e++) this.je[e - this.Ie].dispose();
-    if (this.Ie < t) {
-      let e = this.Ie;
-      while (e < t && e < this.Ce) this.je[e++].dispose();
-      this.je.splice(0, t - this.Ie);
-      this.Ee.splice(0, t - this.Ie);
-    } else if (this.Ie > t) {
-      let n = r - this.Ie - 1;
-      let i = this.Ie - t;
-      this.je.length = this.Ee.length = e;
+    const r = this.Fe + this.ve;
+    if (this.ve === 0 && this.Ae[0]) this.Ae[0].dispose();
+    for (let e = n; e < r; e++) this.Ae[e - this.Fe].dispose();
+    if (this.Fe < t) {
+      let e = this.Fe;
+      while (e < t && e < this.ve) this.Ae[e++].dispose();
+      this.Ae.splice(0, t - this.Fe);
+      this.je.splice(0, t - this.Fe);
+    } else if (this.Fe > t) {
+      let n = r - this.Fe - 1;
+      let i = this.Fe - t;
+      this.Ae.length = this.je.length = e;
       while (n >= i) {
+        this.Ae[n] = this.Ae[n - i];
         this.je[n] = this.je[n - i];
-        this.Ee[n] = this.Ee[n - i];
         n--;
       }
       for (let e = 0; e < i; e++) {
-        this.Ee[e] = runWithOwner((this.je[e] = createOwner()), () => this.ke(e + t));
+        this.je[e] = runWithOwner((this.Ae[e] = createOwner()), () => this.Ee(e + t));
       }
     }
     for (let e = r; e < n; e++) {
-      this.Ee[e - t] = runWithOwner((this.je[e - t] = createOwner()), () => this.ke(e));
+      this.je[e - t] = runWithOwner((this.Ae[e - t] = createOwner()), () => this.Ee(e));
     }
-    this.Ee = this.Ee.slice(0, e);
-    this.Ie = t;
-    this.Ce = e;
+    this.je = this.je.slice(0, e);
+    this.Fe = t;
+    this.ve = e;
   });
-  return this.Ee;
+  return this.je;
 }
 function compare(e, t, n) {
   return e ? e(t) === e(n) : true;
 }
 function boundaryComputed(e, t) {
   const n = computed(e, undefined, {
-    we: {
+    _e: {
       le() {
         let e = this.$;
-        this.$ &= ~this.Re;
-        if (this.Re & f && !(this.$ & a)) {
+        this.$ &= ~this.Ve;
+        if (this.Ve & f && !(this.$ & a)) {
           e &= ~f;
         }
-        this.ye.notify(this, this.Re, e);
+        this.ge.notify(this, this.Ve, e);
       },
-      Re: t
+      Ve: t
     }
   });
-  n.Re = t;
+  n.Ve = t;
+  n.de = true;
   return n;
 }
 function createBoundChildren(e, t, n, r) {
-  const i = e.ye;
-  i.addChild((e.ye = n));
-  onCleanup(() => i.removeChild(e.ye));
+  const i = e.ge;
+  i.addChild((e.ge = n));
+  onCleanup(() => i.removeChild(e.ge));
   return runWithOwner(e, () => {
     const e = computed(t);
     return boundaryComputed(() => staleValues(() => flatten(read(e))), r);
   });
 }
 class ConditionalQueue extends Queue {
-  Ve;
-  qe = new Set();
+  qe;
+  Me = new Set();
   M = new Set();
   constructor(e) {
     super();
-    this.Ve = e;
+    this.qe = e;
   }
   run(e) {
-    if (!e || read(this.Ve)) return;
+    if (!e || read(this.qe)) return;
     return super.run(e);
   }
   notify(e, t, n) {
-    if (read(this.Ve)) {
+    if (read(this.qe)) {
       if (t & f) {
         if (n & f) {
           this.M.add(e);
@@ -1863,37 +1867,37 @@ class ConditionalQueue extends Queue {
       }
       if (t & c) {
         if (n & c) {
-          this.qe.add(e);
+          this.Me.add(e);
           t &= ~c;
-        } else if (this.qe.delete(e)) t &= ~c;
+        } else if (this.Me.delete(e)) t &= ~c;
       }
     }
     return t ? super.notify(e, t, n) : true;
   }
 }
 class CollectionQueue extends Queue {
-  Me;
-  je = new Set();
-  Ve = signal(false, { pureWrite: true });
-  De = false;
+  De;
+  Ae = new Set();
+  qe = signal(false, { pureWrite: true });
+  Be = false;
   constructor(e) {
     super();
-    this.Me = e;
+    this.De = e;
   }
   run(e) {
-    if (!e || read(this.Ve)) return;
+    if (!e || read(this.qe)) return;
     return super.run(e);
   }
   notify(e, t, n) {
-    if (!(t & this.Me) || (this.Me & f && this.De)) return super.notify(e, t, n);
-    if (n & this.Me) {
-      this.je.add(e);
-      if (this.je.size === 1) setSignal(this.Ve, true);
-    } else if (this.je.size > 0) {
-      this.je.delete(e);
-      if (this.je.size === 0) setSignal(this.Ve, false);
-    }
-    t &= ~this.Me;
+    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.qe, true);
+    } else if (this.Ae.size > 0) {
+      this.Ae.delete(e);
+      if (this.Ae.size === 0) setSignal(this.qe, false);
+    }
+    t &= ~this.De;
     return t ? super.notify(e, t, n) : true;
   }
 }
@@ -1907,25 +1911,25 @@ function createBoundary(e, t) {
   const r = new ConditionalQueue(computed(() => t() === z.HIDDEN));
   const i = createBoundChildren(n, e, r, 0);
   computed(() => {
-    const e = read(r.Ve);
-    i.Re = e ? c | f : 0;
+    const e = read(r.qe);
+    i.Ve = e ? c | f : 0;
     if (!e) {
       r.M.forEach(e => r.notify(e, f, f));
-      r.qe.forEach(e => r.notify(e, c, c));
+      r.Me.forEach(e => r.notify(e, c, c));
       r.M.clear();
-      r.qe.clear();
+      r.Me.clear();
     }
   });
-  return () => (read(r.Ve) ? undefined : read(i));
+  return () => (read(r.qe) ? undefined : read(i));
 }
 function createCollectionBoundary(e, t, n) {
   const r = createOwner();
   const i = new CollectionQueue(e);
   const s = createBoundChildren(r, t, i, e);
   const o = computed(() => {
-    if (!read(i.Ve)) {
+    if (!read(i.qe)) {
       const e = read(s);
-      if (!untrack(() => read(i.Ve))) i.De = true;
+      if (!untrack(() => read(i.qe))) i.Be = true;
       return e;
     }
     return n(i);
@@ -1950,10 +1954,10 @@ function collectErrorSources(e, t) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(c, e, e => {
-    let n = e.je.values().next().value;
+    let n = e.Ae.values().next().value;
     return t(n.L, () => {
       const t = [];
-      for (const n of e.je) collectErrorSources(n, t);
+      for (const n of e.Ae) collectErrorSources(n, t);
       for (const e of t) recompute(e);
       schedule();
     });