@solidjs/signals 2.0.0-beta.11 → 2.0.0-beta.12

package/dist/node.cjs

@@ -57,7 +57,7 @@ const j = Symbol("refresh");
 const W = new Set();
 const R = new Set();
 let A = 0;
-const L = undefined;
+const I = undefined;
 function emitDiagnostic(e) {
   const t = { sequence: ++A, ...e };
   for (const e of W) e(t);
@@ -150,8 +150,8 @@ function adjustHeight(e, t) {
   let n = e.o;
   for (let t = e.W; t; t = t.R) {
     const e = t.A;
-    const r = e.L || e;
-    if (r.I && r.o >= n) n = r.o + 1;
+    const r = e.I || e;
+    if (r.L && r.o >= n) n = r.o + 1;
   }
   if (e.o !== n) {
     e.o = n;
@@ -160,17 +160,17 @@ function adjustHeight(e, t) {
     }
   }
 }
-const I = new WeakMap();
+const L = new WeakMap();
 const T = new Set();
 function getOrCreateLane(e) {
-  let t = I.get(e);
+  let t = L.get(e);
   if (t) {
     return findLane(t);
   }
   const n = e.T;
   const r = n?.H ? findLane(n.H) : null;
   t = { q: e, F: new Set(), M: [[], []], D: null, V: M, K: r };
-  I.set(e, t);
+  L.set(e, t);
   T.add(t);
   e.B = false;
   return t;
@@ -334,7 +334,7 @@ function cleanupCompletedLanes(e) {
     t.M[0].length = 0;
     t.M[1].length = 0;
     T.delete(t);
-    I.delete(t.q);
+    L.delete(t.q);
   }
 }
 function schedule() {
@@ -440,7 +440,7 @@ class GlobalQueue extends Queue {
             B = new Set();
             for (let t = 0; t < e.J.length; t++) {
               const n = e.J[t];
-              if (n.I || n.ye & d) continue;
+              if (n.L || n.ye & d) continue;
               B.add(n);
               queueStashedOptimisticEffects(n);
             }
@@ -598,7 +598,7 @@ function insertSubs(e, t = false) {
 }
 function commitPendingNode(e) {
   const t = e;
-  if (!t.I) {
+  if (!t.L) {
     if (e.Y !== x) {
       e.ue = e.Y;
       e.Y = x;
@@ -704,7 +704,7 @@ function reporterBlocksSource(e, t) {
   for (let n = e.W; n; n = n.R) {
     let e = n.A;
     while (e) {
-      if (e === t || e.L === t) return true;
+      if (e === t || e.I === t) return true;
       e = e.T;
     }
   }
@@ -789,7 +789,7 @@ function disposeChildren(e, t = false, n) {
   const r = e.m;
   if (r & u) return;
   if (t) e.m = r | u;
-  if (t && e.I) e.ke = null;
+  if (t && e.L) e.ke = null;
   let i = n ? e.Oe : e.Ce;
   while (i) {
     const e = i.Ne;
@@ -912,16 +912,16 @@ function unlinkSubs(e) {
   const t = e.A;
   const n = e.R;
   const r = e.P;
-  const i = e.Le;
-  if (r !== null) r.Le = i;
-  else t.Ie = i;
+  const i = e.Ie;
+  if (r !== null) r.Ie = i;
+  else t.Le = i;
   if (i !== null) i.P = r;
   else {
     t.O = r;
     if (r === null) {
       t.Z?.();
       const e = t;
-      e.I && e.ye & y && !(e.m & o) && unobserved(e);
+      e.L && e.ye & y && !(e.m & o) && unobserved(e);
     }
   }
   return n;
@@ -959,9 +959,9 @@ function link(e, t) {
       return;
     }
   }
-  const o = e.Ie;
+  const o = e.Le;
   if (o !== null && o.C === t && (!s || isValidLink(o, t))) return;
-  const u = (t.Ee = e.Ie = { A: e, C: t, R: i, Le: o, P: null });
+  const u = (t.Ee = e.Le = { A: e, C: t, R: i, Ie: o, P: null });
   if (n !== null) n.R = u;
   else t.W = u;
   if (o !== null) o.P = u;
@@ -1318,7 +1318,7 @@ function releaseSubtree(e) {
       t = t.Ne;
       continue;
     }
-    if (t.I) {
+    if (t.L) {
       const e = t;
       e.ye &= ~g;
       if (e.m & f) {
@@ -1395,11 +1395,11 @@ function recompute(t, n = false) {
   if (y) Y = true;
   try {
     if (!false && t.ye & w) {
-      p = t.I(p);
+      p = t.L(p);
       t.ke = null;
     } else {
       const e = t.ke;
-      const n = t.I(p);
+      const n = t.L(p);
       const r = typeof n === "object" && n !== null;
       const i = t.ke !== e;
       p = i || !r ? n : handleAsync(t, n);
@@ -1472,8 +1472,8 @@ function updateIfNecessary(e) {
   if (e.m & t) {
     for (let t = e.W; t; t = t.R) {
       const r = t.A;
-      const i = r.L || r;
-      if (i.I) {
+      const i = r.I || r;
+      if (i.L) {
         updateIfNecessary(i);
       }
       if (e.m & n) {
@@ -1502,7 +1502,7 @@ function computed(t, n) {
     te: ne?.te ?? z,
     Ae: ne?.Ae ?? k,
     je: 0,
-    I: t,
+    L: t,
     ue: undefined,
     o: 0,
     N: null,
@@ -1511,7 +1511,7 @@ function computed(t, n) {
     W: null,
     Ee: null,
     O: null,
-    Ie: null,
+    Le: null,
     i: ne,
     Ne: null,
     We: null,
@@ -1543,7 +1543,7 @@ function createEffectNode(e, t, n, r, i, s) {
     te: ne?.te ?? z,
     Ae: ne?.Ae ?? k,
     je: 0,
-    I: e,
+    L: e,
     ue: undefined,
     o: 0,
     N: null,
@@ -1552,7 +1552,7 @@ function createEffectNode(e, t, n, r, i, s) {
     W: null,
     Ee: null,
     O: null,
-    Ie: null,
+    Le: null,
     i: ne,
     Ne: null,
     We: null,
@@ -1594,11 +1594,11 @@ function setupComputedNode(e, t) {
   if (n) e.o = n.o + 1;
   if (J) {
     const t = signal(undefined, { equals: false, ownedWrite: true });
-    const n = J.factory(e.I, () => {
+    const n = J.factory(e.L, () => {
       setSignal(t, undefined);
     });
     cleanup(() => n.dispose());
-    e.I = e => {
+    e.L = e => {
       read(t);
       return n.track(e);
     };
@@ -1618,9 +1618,9 @@ function signal(e, t, n = null) {
     Z: t?.unobserved,
     ue: e,
     O: null,
-    Ie: null,
+    Le: null,
     me: F,
-    L: n,
+    I: n,
     k: n?.N || null,
     Y: x
   };
@@ -1681,7 +1681,7 @@ function read(e) {
     return i;
   }
   if ($) {
-    const t = e.L;
+    const t = e.I;
     const n = $;
     $ = false;
     if (t && e.G !== undefined) {
@@ -1703,7 +1703,7 @@ function read(e) {
   let t = ne;
   if (t?.t) t = t.u;
   const n = e;
-  if (typeof n.I === "function") {
+  if (typeof n.L === "function") {
     const t = e;
     if (t.m & c) {
       t.m &= ~c;
@@ -1712,9 +1712,9 @@ function read(e) {
       recompute(t, true);
     }
   }
-  const r = e.L || e;
+  const r = e.I || e;
   if (
-    !n.I &&
+    !n.L &&
     r === e &&
     e.G === undefined &&
     e._e === undefined &&
@@ -1728,7 +1728,7 @@ function read(e) {
   }
   if (t && X) {
     link(e, t);
-    if (r.I) {
+    if (r.L) {
       const n = e.m & o;
       if (r.o >= (n ? Q.j : q.j)) {
         markNode(t);
@@ -1761,7 +1761,7 @@ function read(e) {
       throw r.we;
     }
   }
-  if (e.I && e.be & _) {
+  if (e.L && e.be & _) {
     if (e.me < F) {
       recompute(e);
       return read(e);
@@ -1780,7 +1780,7 @@ function read(e) {
     if (t && Y && shouldReadStashedOptimisticValue(e)) return e.ue;
     return e.G;
   }
-  if (M !== null && re !== null && !te && e.Y !== x && r === e && !e.I && t) {
+  if (M !== null && re !== null && !te && e.Y !== x && r === e && !e.L && t) {
     M.oe.add(t);
     return e.ue;
   }
@@ -1791,7 +1791,7 @@ function read(e) {
     (Y && e.V && M !== e.V)
       ? e.ue
       : e.Y;
-  if (!t && r === e && typeof n.I === "function" && e.ye & y && !(r.be & m) && !e.O) {
+  if (!t && r === e && typeof n.L === "function" && e.ye & y && !(r.be & m) && !e.O) {
     unobserved(e);
   }
   return i;
@@ -1804,7 +1804,7 @@ function setSignal(e, t) {
   if (typeof t === "function") t = t(i);
   const s = !e.He || !e.He(i, t) || !!(e.be & b);
   if (!s) {
-    if (n && r && e.I) {
+    if (n && r && e.L) {
       insertSubs(e, true);
       schedule();
     }
@@ -1868,7 +1868,7 @@ function getPendingSignal(e) {
 }
 function computePendingState(e) {
   const t = e;
-  const n = e.L;
+  const n = e.I;
   if (n && e.Y !== x) {
     return !n.ke && !(n.be & m);
   }
@@ -1899,7 +1899,7 @@ function updatePendingSignal(e) {
           mergeLanes(t, e);
         }
       }
-      I.delete(n);
+      L.delete(n);
       n.H = undefined;
     }
   }
@@ -1959,7 +1959,7 @@ function refresh(e) {
   try {
     const t = e?.[j];
     if (false && !t);
-    if (t && typeof t.I === "function" && !(t.m & u)) {
+    if (t && typeof t.L === "function" && !(t.m & u)) {
       recompute(t);
     }
   } finally {
@@ -3294,8 +3294,9 @@ function mapArray(e, t, n) {
     et: [],
     tt: r,
     nt: r || n?.keyed === false ? [] : undefined,
-    rt: i ? [] : undefined,
-    it: n?.fallback
+    rt: i && n?.keyed !== false ? [] : undefined,
+    it: n?.keyed === false,
+    st: n?.fallback
   };
   const u = computed(updateKeyedMap.bind(o));
   o.Ue.u = u;
@@ -3311,20 +3312,25 @@ function updateKeyedMap() {
     let n,
       r,
       i = this.nt
-        ? () => {
-            this.nt[r] = signal(e[r], ke);
-            this.rt && (this.rt[r] = signal(r, ke));
-            return this.Ze(accessor(this.nt[r]), this.rt ? accessor(this.rt[r]) : undefined);
-          }
+        ? this.it
+          ? () => {
+              this.nt[r] = signal(e[r], ke);
+              return this.Ze(accessor(this.nt[r]), r);
+            }
+          : () => {
+              this.nt[r] = signal(e[r], ke);
+              this.rt && (this.rt[r] = signal(r, ke));
+              return this.Ze(accessor(this.nt[r]), this.rt ? accessor(this.rt[r]) : undefined);
+            }
         : this.rt
           ? () => {
               const t = e[r];
               this.rt[r] = signal(r, ke);
-              return this.Ze(() => t, accessor(this.rt[r]));
+              return this.Ze(t, accessor(this.rt[r]));
             }
           : () => {
               const t = e[r];
-              return this.Ze(() => t);
+              return this.Ze(t);
             };
     if (t === 0) {
       if (this.Je !== 0) {
@@ -3336,8 +3342,8 @@ function updateKeyedMap() {
         this.nt && (this.nt = []);
         this.rt && (this.rt = []);
       }
-      if (this.it && !this.$e[0]) {
-        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.it);
+      if (this.st && !this.$e[0]) {
+        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.st);
       }
     } else if (this.Je === 0) {
       if (this.et[0]) this.et[0].dispose();
@@ -3428,21 +3434,21 @@ function repeat(e, t, n) {
     updateRepeat.bind({
       Ue: createOwner(),
       Je: 0,
-      st: 0,
-      ot: e,
+      ot: 0,
+      ut: e,
       Ze: r,
       et: [],
       $e: [],
-      ut: n?.from,
-      it: n?.fallback
+      lt: n?.from,
+      st: n?.fallback
     })
   );
   i.ye &= ~y;
   return accessor(i);
 }
 function updateRepeat() {
-  const e = this.ot();
-  const t = this.ut?.() || 0;
+  const e = this.ut();
+  const t = this.lt?.() || 0;
   runWithOwner(this.Ue, () => {
     if (e === 0) {
       if (this.Je !== 0) {
@@ -3451,23 +3457,23 @@ function updateRepeat() {
         this.$e = [];
         this.Je = 0;
       }
-      if (this.it && !this.$e[0]) {
-        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.it);
+      if (this.st && !this.$e[0]) {
+        this.$e[0] = runWithOwner((this.et[0] = createOwner()), this.st);
       }
       return;
     }
     const n = t + e;
-    const r = this.st + this.Je;
+    const r = this.ot + this.Je;
     if (this.Je === 0 && this.et[0]) this.et[0].dispose();
-    for (let e = n; e < r; e++) this.et[e - this.st].dispose();
-    if (this.st < t) {
-      let e = this.st;
+    for (let e = n; e < r; e++) this.et[e - this.ot].dispose();
+    if (this.ot < t) {
+      let e = this.ot;
       while (e < t && e < this.Je) this.et[e++].dispose();
-      this.et.splice(0, t - this.st);
-      this.$e.splice(0, t - this.st);
-    } else if (this.st > t) {
-      let n = r - this.st - 1;
-      let i = this.st - t;
+      this.et.splice(0, t - this.ot);
+      this.$e.splice(0, t - this.ot);
+    } else if (this.ot > t) {
+      let n = r - this.ot - 1;
+      let i = this.ot - t;
       this.et.length = this.$e.length = e;
       while (n >= i) {
         this.et[n] = this.et[n - i];
@@ -3482,7 +3488,7 @@ function updateRepeat() {
       this.$e[e - t] = runWithOwner((this.et[e - t] = createOwner()), () => this.Ze(e));
     }
     this.$e = this.$e.slice(0, e);
-    this.st = t;
+    this.ot = t;
     this.Je = e;
   });
   return this.$e;
@@ -3495,10 +3501,10 @@ function boundaryComputed(e, t) {
   n.Fe = (e, t) => {
     const r = e !== undefined ? e : n.be;
     const i = t !== undefined ? t : n.we;
-    n.be &= ~n.lt;
-    n.te.notify(n, n.lt, r, i);
+    n.be &= ~n.ft;
+    n.te.notify(n, n.ft, r, i);
   };
-  n.lt = t;
+  n.ft = t;
   n.ye &= ~y;
   recompute(n, true);
   return n;
@@ -3521,52 +3527,52 @@ function isRevealController(e) {
   return e instanceof RevealController;
 }
 function isSlotReady(e) {
-  return isRevealController(e) ? e.isReady() : e.ft.size === 0 && !e.ct;
+  return isRevealController(e) ? e.isReady() : e.ct.size === 0 && !e.dt;
 }
 function isSlotMinimallyReady(e) {
   return isRevealController(e) ? e.isMinimallyReady() : isSlotReady(e);
 }
 function setSlotState(e, t, n, r) {
-  setSignal(e.dt, n);
-  setSignal(e.ht, r);
+  setSignal(e.ht, n);
+  setSignal(e.gt, r);
   if (isRevealController(e)) {
-    if (!n && e.gt === t) e.gt = undefined;
+    if (!n && e.St === t) e.St = undefined;
     return e.evaluate(n, r);
   }
-  if (!n && e.St === t && e.yt) e.St = undefined;
+  if (!n && e.yt === t && e.wt) e.yt = undefined;
 }
 class RevealController {
-  wt;
   _t;
-  bt = [];
-  gt;
-  dt = signal(false, { ownedWrite: true, ze: true });
+  bt;
+  Ot = [];
+  St;
   ht = signal(false, { ownedWrite: true, ze: true });
-  Ot = true;
+  gt = signal(false, { ownedWrite: true, ze: true });
   vt = true;
-  Pt = false;
+  Pt = true;
+  xt = false;
   constructor(e, t) {
-    this.wt = e;
-    this._t = t;
+    this._t = e;
+    this.bt = t;
   }
-  xt(e) {
-    for (let t = 0; t < this.bt.length; t++) {
-      const n = this.bt[t];
-      if ((isRevealController(n) ? n.gt : n.St) !== this) continue;
+  Ct(e) {
+    for (let t = 0; t < this.Ot.length; t++) {
+      const n = this.Ot[t];
+      if ((isRevealController(n) ? n.St : n.yt) !== this) continue;
       if (e(n) === false) return false;
     }
     return true;
   }
   isReady() {
-    return this.xt(isSlotReady);
+    return this.Ct(isSlotReady);
   }
   isMinimallyReady() {
-    const e = untrack(this.wt);
+    const e = untrack(this._t);
     if (e === "together") return this.isReady();
     if (e === "natural") {
       let e = false;
       let t = false;
-      this.xt(n => {
+      this.Ct(n => {
         e = true;
         if (isSlotMinimallyReady(n)) {
           t = true;
@@ -3576,58 +3582,58 @@ class RevealController {
       return !e || t;
     }
     let t = true;
-    this.xt(e => {
+    this.Ct(e => {
       t = isSlotMinimallyReady(e);
       return false;
     });
     return t;
   }
   register(e) {
-    if (this.bt.includes(e)) return;
-    this.bt.push(e);
-    const t = untrack(this.wt);
-    (setSignal(e.dt, true), setSignal(e.ht, t === "sequential" ? !!untrack(this._t) : false));
+    if (this.Ot.includes(e)) return;
+    this.Ot.push(e);
+    const t = untrack(this._t);
+    (setSignal(e.ht, true), setSignal(e.gt, t === "sequential" ? !!untrack(this.bt) : false));
     untrack(() => this.evaluate());
   }
   unregister(e) {
-    const t = this.bt.indexOf(e);
-    if (t >= 0) this.bt.splice(t, 1);
+    const t = this.Ot.indexOf(e);
+    if (t >= 0) this.Ot.splice(t, 1);
     untrack(() => this.evaluate());
   }
   evaluate(e, t) {
-    if (this.Pt) return;
-    this.Pt = true;
-    const n = this.Ot;
-    const r = this.vt;
+    if (this.xt) return;
+    this.xt = true;
+    const n = this.vt;
+    const r = this.Pt;
     try {
-      const n = e ?? read(this.dt),
-        r = untrack(this.wt),
-        i = r === "sequential" && !!untrack(this._t),
+      const n = e ?? read(this.ht),
+        r = untrack(this._t),
+        i = r === "sequential" && !!untrack(this.bt),
         s = t ?? i;
       if (n) {
-        this.xt(e => setSlotState(e, this, true, s));
+        this.Ct(e => setSlotState(e, this, true, s));
       } else if (r === "natural") {
-        this.xt(e => {
+        this.Ct(e => {
           if (isRevealController(e)) {
+            setSignal(e.gt, false);
             setSignal(e.ht, false);
-            setSignal(e.dt, false);
             e.evaluate(false, false);
           } else {
             setSlotState(e, this, !isSlotReady(e), false);
           }
         });
       } else if (r === "together") {
-        const e = this.xt(isSlotMinimallyReady);
-        this.xt(t => setSlotState(t, this, !e, false));
+        const e = this.Ct(isSlotMinimallyReady);
+        this.Ct(t => setSlotState(t, this, !e, false));
       } else {
         let e = false;
-        this.xt(t => {
+        this.Ct(t => {
           if (e) return setSlotState(t, this, true, i);
           if (isSlotReady(t)) return setSlotState(t, this, false, false);
           e = true;
           if (isRevealController(t)) {
+            setSignal(t.gt, false);
             setSignal(t.ht, false);
-            setSignal(t.dt, false);
             t.evaluate(false, false);
           } else {
             setSlotState(t, this, true, false);
@@ -3635,92 +3641,92 @@ class RevealController {
         });
       }
     } finally {
-      this.Ot = this.isReady();
-      this.vt = this.isMinimallyReady();
-      this.Pt = false;
+      this.vt = this.isReady();
+      this.Pt = this.isMinimallyReady();
+      this.xt = false;
     }
-    if (this.gt && (n !== this.Ot || r !== this.vt)) this.gt.evaluate();
+    if (this.St && (n !== this.vt || r !== this.Pt)) this.St.evaluate();
   }
 }
 class CollectionQueue extends Queue {
-  Ct;
-  ft = new Set();
   Nt;
-  ct = true;
-  dt = signal(false, { ownedWrite: true, ze: true });
-  ht = signal(false, { ownedWrite: true, ze: true });
-  St;
-  yt = false;
+  ct = new Set();
   Et;
-  kt = je;
+  dt = true;
+  ht = signal(false, { ownedWrite: true, ze: true });
+  gt = signal(false, { ownedWrite: true, ze: true });
+  yt;
+  wt = false;
+  kt;
+  jt = je;
   constructor(e) {
     super();
-    this.Ct = e;
+    this.Nt = e;
   }
   run(e) {
-    if (!e || (read(this.dt) && (!Re || read(this.ht)))) return;
+    if (!e || (read(this.ht) && (!Re || read(this.gt)))) return;
     return super.run(e);
   }
   notify(e, t, n, r) {
-    if (!(t & this.Ct)) return super.notify(e, t, n, r);
-    if (this.yt && this.Et) {
+    if (!(t & this.Nt)) return super.notify(e, t, n, r);
+    if (this.wt && this.kt) {
       const e = untrack(() => {
         try {
-          return this.Et();
+          return this.kt();
         } catch {
           return je;
         }
       });
-      if (e !== this.kt) {
-        this.kt = e;
-        this.yt = false;
-        this.ft.clear();
+      if (e !== this.jt) {
+        this.jt = e;
+        this.wt = false;
+        this.ct.clear();
       }
     }
-    if (this.Ct & m && this.yt) return super.notify(e, t, n, r);
-    if (this.Ct & m && n & _) {
+    if (this.Nt & m && this.wt) return super.notify(e, t, n, r);
+    if (this.Nt & m && n & _) {
       return super.notify(e, _, n, r);
     }
-    if (n & this.Ct) {
-      this.ct = true;
+    if (n & this.Nt) {
+      this.dt = true;
       const t = r?.source || e.we?.source;
       if (t) {
-        const e = this.ft.size === 0;
-        this.ft.add(t);
-        if (e) setSignal(this.dt, true);
+        const e = this.ct.size === 0;
+        this.ct.add(t);
+        if (e) setSignal(this.ht, true);
       }
     }
-    t &= ~this.Ct;
+    t &= ~this.Nt;
     return t ? super.notify(e, t, n, r) : true;
   }
   checkSources() {
-    for (const e of this.ft) {
-      if (e.m & u || (!(e.be & this.Ct) && !(this.Ct & _ && e.be & m))) this.ft.delete(e);
+    for (const e of this.ct) {
+      if (e.m & u || (!(e.be & this.Nt) && !(this.Nt & _ && e.be & m))) this.ct.delete(e);
     }
-    if (!this.ft.size) {
-      if (this.Ct & m && this.ct && !this.yt && this.Nt) {
-        this.ct = !!(this.Nt.be & this.Ct);
+    if (!this.ct.size) {
+      if (this.Nt & m && this.dt && !this.wt && this.Et) {
+        this.dt = !!(this.Et.be & this.Nt);
       } else {
-        this.ct = false;
+        this.dt = false;
       }
-      if (!this.ct) {
-        setSignal(this.dt, false);
-        if (this.Et) {
+      if (!this.dt) {
+        setSignal(this.ht, false);
+        if (this.kt) {
           try {
-            this.kt = untrack(() => this.Et());
+            this.jt = untrack(() => this.kt());
           } catch {}
         }
       }
     }
-    if (Re) this.St?.evaluate();
+    if (Re) this.yt?.evaluate();
   }
 }
 function createCollectionBoundary(e, t, n, r) {
   const i = createOwner();
   if (Re) setContext(We, null, i);
   const s = new CollectionQueue(e);
-  if (r) s.Et = r;
-  const o = (s.Nt = createBoundChildren(i, t, s, e));
+  if (r) s.kt = r;
+  const o = (s.Et = createBoundChildren(i, t, s, e));
   untrack(() => {
     let t = false;
     try {
@@ -3729,21 +3735,21 @@ function createCollectionBoundary(e, t, n, r) {
       if (e instanceof NotReadyError) t = true;
       else throw e;
     }
-    s.ct = t || !!(o.be & e) || o.we instanceof NotReadyError;
+    s.dt = t || !!(o.be & e) || o.we instanceof NotReadyError;
   });
   const u = Re && e === m ? getContext(We) : null;
   if (u) {
-    s.St = u;
+    s.yt = u;
     u.register(s);
     cleanup(() => u.unregister(s));
   }
   return accessor(
     computed(() => {
-      if (!read(s.dt)) {
+      if (!read(s.ht)) {
         const e = read(o);
-        if (!untrack(() => read(s.dt))) return ((s.yt = true), e);
+        if (!untrack(() => read(s.ht))) return ((s.wt = true), e);
       }
-      if (Re && read(s.ht)) return undefined;
+      if (Re && read(s.gt)) return undefined;
       return n(s);
     })
   );
@@ -3753,10 +3759,10 @@ function createLoadingBoundary(e, t, n) {
 }
 function createErrorBoundary(e, t) {
   return createCollectionBoundary(_, e, e => {
-    let n = e.ft.values().next().value;
+    let n = e.ct.values().next().value;
     const r = n.we?.cause ?? n.we;
     return t(r, () => {
-      for (const t of e.ft) recompute(t);
+      for (const t of e.ct) recompute(t);
       schedule();
     });
   });
@@ -3777,7 +3783,7 @@ function createRevealOrder(e, t) {
       o.evaluate();
     });
     if (r) {
-      o.gt = r;
+      o.St = r;
       r.register(o);
       cleanup(() => r.unregister(o));
     }