@solidjs/signals 2.0.0-rc.19 → 2.0.0-rc.20

package/dist/prod/core/owner.js

@@ -67,7 +67,7 @@ function disposeChildren(e, n = false, r) {
     // cleanups never run and it stays subscribed, rerunning in a torn-down
     // tree (#3561). Death only (`self`): a re-pass leaves the frame reacting
     // until the commit.
-        if (n && !r && e.T !== null && (e.T.Ue !== null || e.T.me !== null)) disposeChildren(e, false, true);
+        if (n && !r && e.T !== null && (e.T.me !== null || e.T.Le !== null)) disposeChildren(e, false, true);
     if (n) {
         e.R = t | REACTIVE_DISPOSED;
     }
@@ -80,8 +80,8 @@ function disposeChildren(e, n = false, r) {
         // Nothing else re-examines a dead node, so make sure a seam comes.
                 if (e.m & STATUS_PENDING && e.T?.Re != null || t & REACTIVE_FRAME_READ || pendingNodes.length) schedule();
     }
-    let l = r ? e.T.Ue : e.pe;
-    if (r) e.T.Ue = null; else e.pe = null;
+    let l = r ? e.T.me : e.pe;
+    if (r) e.T.me = null; else e.pe = null;
     while (l) {
         const e = l;
         // Owner teardown is death regardless of the child's own lifecycle
@@ -105,7 +105,7 @@ function disposeChildren(e, n = false, r) {
         // on the fresh head and survives. Pointing each drained child's prev at
         // itself routes its later splice onto the detached chain, never the head,
         // and keeps the dev owner-chain-head invariant honest for those children.
-                l.Ze = l;
+                l.we = l;
         disposeChildren(l, true);
         // Read after, not before: a sibling this disposal made dormant spliced
         // itself out of the detached chain, and a cleanup may then have linked
@@ -113,34 +113,34 @@ function disposeChildren(e, n = false, r) {
         // would still be holding.
                 l = l.Ge;
     }
-    if (!r) e.ye = 0;
+    if (!r) e.be = 0;
     // O(1) splice out of parent's chain on individual dispose. Skipped during
     // batch dispose (parent already disposed) and for a zombie (it sits on the
     // parent's parked frame, drained whole by the commit). We leave
     // node._nextSibling intact so outer walks that already advanced past us
     // still reach later siblings.
         if (n && !r && !(t & REACTIVE_ZOMBIE) && e._parent !== null && !(e._parent.R & REACTIVE_DISPOSED)) {
-        const n = e.Ze;
+        const n = e.we;
         const r = e.Ge;
         if (n !== null) n.Ge = r; else e._parent.pe = r;
-        if (r !== null) r.Ze = n;
-        e.Ze = null;
+        if (r !== null) r.we = n;
+        e.we = null;
     }
     runDisposal(e, r);
     // Final effect-returned cleanup fires at true disposal, after `_disposal`
     // to mirror rerun ordering (compute-phase teardown first, cleanup last).
-        if (n && e.Je) {
-        const n = e.Je;
-        e.Je = undefined;
+        if (n && e.ze) {
+        const n = e.ze;
+        e.ze = undefined;
         runCleanup(n);
     }
 }
 
 function linkChild(e, n) {
     const r = e.pe;
-    n.Ze = null;
+    n.we = null;
     n.Ge = r;
-    if (r !== null) r.Ze = n;
+    if (r !== null) r.we = n;
     e.pe = n;
 }
 
@@ -151,9 +151,9 @@ function runDisposal(e, n) {
     // walk ran every entry a second time. Detached, the re-entrant drain finds
     // nothing. The same shape latched a throwing cleanup: the list survived the
     // throw and every later drain re-ran and re-threw it.
-    const r = n ? e.T.me : e.He;
+    const r = n ? e.T.Le : e.ke;
     if (!r) return;
-    if (n) e.T.me = null; else e.He = null;
+    if (n) e.T.Le = null; else e.ke = null;
     if (Array.isArray(r)) {
         // Unwind order (#3572, restores 1.x #1562): later registrations run
         // before earlier ones. Children have already been disposed by the caller,
@@ -170,7 +170,7 @@ function runDisposal(e, n) {
 function childId(e, n) {
     let r = e;
     while (r.l & CONFIG_TRANSPARENT && r._parent) r = r._parent;
-    if (r.id != null) return formatId(r.id, n ? r.ye++ : r.ye);
+    if (r.id != null) return formatId(r.id, n ? r.be++ : r.be);
     throw new Error("");
 }
 
@@ -252,7 +252,7 @@ function formatId(e, n) {
  * one.
  */ function cleanup(e, n = context) {
     if (!n) return e;
-    if (!n.He) n.He = e; else if (Array.isArray(n.He)) n.He.push(e); else n.He = [ n.He, e ];
+    if (!n.ke) n.ke = e; else if (Array.isArray(n.ke)) n.ke.push(e); else n.ke = [ n.ke, e ];
     return e;
 }
 
@@ -279,7 +279,7 @@ function disposeRootSelf(e = true) {
     disposeChildren(this, e);
     // Outside a flush the dispose call rethrows; inside one, the flush does.
     // Kept out of `disposeChildren`, whose hot path it slows.
-        if (cleanupError && !globalQueue.q) rethrowCleanupError();
+        if (cleanupError && !globalQueue.Y) rethrowCleanupError();
 }
 
 /**
@@ -306,13 +306,13 @@ function disposeRootSelf(e = true) {
         // was 12 KB and most of disposal's time (2026-10-17).
         R: REACTIVE_NONE,
         Qe: true,
-        Ye: n?.Qe ? n.Ye : n,
+        Ke: n?.Qe ? n.Ke : n,
         pe: null,
         Ge: null,
-        Ze: null,
-        He: null,
+        we: null,
+        ke: null,
         A: n?.A || defaultContext,
-        ye: 0,
+        be: 0,
         T: null,
         _parent: n,
         dispose: disposeRootSelf