@solidjs/signals 2.0.0-rc.6 → 2.0.0-rc.7

package/dist/prod/core/scheduler.js

@@ -1,6 +1,6 @@
-import { EFFECT_RENDER, EFFECT_USER, STATUS_PENDING, REACTIVE_IN_HEAP_HEIGHT, REACTIVE_DISPOSED, CONFIG_HELD_TRUTH, REACTIVE_ZOMBIE, CONFIG_HAS_LANE, CONFIG_HAS_SNAPSHOT, REACTIVE_RECOMPUTING_DEPS, REACTIVE_MISSED_WAKE, CONFIG_IN_SNAPSHOT_SCOPE, REACTIVE_SNAPSHOT_STALE, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, CONFIG_HAS_COMPANIONS, EFFECT_TRACKED, REACTIVE_REASK, REACTIVE_MANUAL_WRITE, STATUS_UNINITIALIZED, CONFIG_AUTHORITATIVE_READ } from "./constants.js";
+import { EFFECT_RENDER, EFFECT_USER, STATUS_PENDING, REACTIVE_IN_HEAP_HEIGHT, REACTIVE_DISPOSED, CONFIG_HELD_TRUTH, REACTIVE_ZOMBIE, CONFIG_HAS_LANE, CONFIG_HAS_SNAPSHOT, REACTIVE_RECOMPUTING_DEPS, REACTIVE_MISSED_WAKE, CONFIG_IN_SNAPSHOT_SCOPE, REACTIVE_SNAPSHOT_STALE, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, CONFIG_SLOT_NODE, CONFIG_HAS_COMPANIONS, EFFECT_TRACKED, REACTIVE_REASK, REACTIVE_MANUAL_WRITE, STATUS_UNINITIALIZED, CONFIG_AUTHORITATIVE_READ } from "./constants.js";
 
-import { currentOptimisticLane } from "./core.js";
+import { currentOptimisticLane, slotUnobservedHook } from "./core.js";
 
 import { DEV } from "./dev.js";
 
@@ -21,14 +21,14 @@ const transitions = new Set;
 const dirtyQueue = {
     eE: new Array(2e3).fill(undefined),
     tE: false,
-    Qe: 0,
+    Me: 0,
     EE: 0
 };
 
 const zombieQueue = {
     eE: new Array(2e3).fill(undefined),
     tE: false,
-    Qe: 0,
+    Me: 0,
     EE: 0
 };
 
@@ -63,7 +63,7 @@ const transientStoreNodes = new Set;
 
 function canUseSimpleSyncFlush(e) {
     const t = e.m;
-    return transitions.size === 0 && activeLanes.size === 0 && e.Qt.length === 0 && t.ze.length === 0 && t.A.length === 0 && t.En.size === 0 && transientStoreNodes.size === 0;
+    return transitions.size === 0 && activeLanes.size === 0 && e.Bt.length === 0 && t.Xe.length === 0 && t.A.length === 0 && t.En.size === 0 && transientStoreNodes.size === 0;
 }
 
 function sweepTransientStoreNodes() {
@@ -80,7 +80,7 @@ function sweepTransientStoreNodes() {
         // unmarked node for the same property).
                 if (e.o?.t) continue;
         transientStoreNodes.delete(e);
-        e.o?.Et?.();
+        if (e.T & CONFIG_SLOT_NODE) slotUnobservedHook(e); else e.o?.Nt?.();
     }
 }
 
@@ -108,15 +108,15 @@ function setProjectionWriteActive(e) {
  */ function createBatch() {
     return {
         Te: clock,
-        Lt: [],
+        Mt: [],
         _e: new Map,
-        ze: [],
+        Xe: [],
         A: [],
         En: new Set,
         ue: [],
-        Bt: {
-            Mt: [ [], [] ],
-            Qt: []
+        wt: {
+            jt: [ [], [] ],
+            Bt: []
         },
         sn: false,
         cn: new Set
@@ -127,12 +127,12 @@ function mergeTransitionState(e, t) {
     t.sn = e;
     e.ue.push(...t.ue);
     for (const i of activeLanes) if (i.Ae === t) i.Ae = e;
-    if (t.ze.length) {
+    if (t.Xe.length) {
         // Move (don't copy): the global queue's batch may still be the outgoing
         // transition, and the adoption pass in initTransition would re-push its
         // contents into the target — duplicating every entry.
-        e.ze.push(...t.ze);
-        t.ze.length = 0;
+        e.Xe.push(...t.Xe);
+        t.Xe.length = 0;
     }
     if (t.A.length) {
         // Move (don't copy): the global queue's batch may still be the outgoing
@@ -142,26 +142,6 @@ function mergeTransitionState(e, t) {
         t.A.length = 0;
     }
     for (const i of t.En) e.En.add(i);
-    // Patch-channel stash (store/next/patch.ts): entries held for the outgoing
-    // transition must ride the merge like every other per-transition
-    // collection — releaseBatch only reads the COMMITTING transition's stash,
-    // so a stranded sidecar would silently drop its patches. Move (don't
-    // copy), same aliasing rule as the collections above. The field is an
-    // expando so this module stays free of patch imports (pay-for-use).
-        const i = t.wt;
-    if (i !== undefined) {
-        t.wt = undefined;
-        let n = e.wt;
-        if (n !== undefined) n.push(...i); else n = e.wt = i;
-        // Retarget the entries' coalescing stamps to the surviving stash
-        // (opaque backref contract with store/next/patch.ts): without this a
-        // post-merge emission misses the stamp and pushes a SECOND entry —
-        // the record's patch applies twice at commit (re-audit 5, P1-2).
-                for (let e = 0; e < i.length; e++) {
-            const t = i[e].pc;
-            if (t !== undefined && t.qe === i[e]) t.qa = n;
-        }
-    }
     for (const [i, n] of t._e) {
         let t = e._e.get(i);
         if (!t) e._e.set(i, t = new Set);
@@ -201,8 +181,8 @@ function mergeTransitionState(e, t) {
     // the awaiting transaction to landings that haven't happened; a merged
     // reporter deadlocked exactly that way).
         let i = false;
-    for (let n = e.ut; n !== null; n = n.lt) {
-        const r = n.ot;
+    for (let n = e.lt; n !== null; n = n.ot) {
+        const r = n.st;
         if (r.Re !== NOT_PENDING) {
             const e = r.Ae;
             const n = e != null ? currentTransition(e) : null;
@@ -212,10 +192,10 @@ function mergeTransitionState(e, t) {
             // (t === null) must leave the batch NOW — it commits at this flush's
             // end, which would reveal the confirmation under the live optimism
             // it just confirmed.
-                        const s = n === null ? currentBatch.Lt : n !== t && n.sn !== true ? n.Lt : null;
+                        const s = n === null ? currentBatch.Mt : n !== t && n.sn !== true ? n.Mt : null;
             if (s !== null) i = stealEntangledCargo(s, t) || i;
         }
-        if (n === e.je) break;
+        if (n === e.Be) break;
     }
     // The steal never activates the awaiting transaction: the predicate can
     // flip inside another transaction's finalize heap, and adopting the queue
@@ -244,11 +224,11 @@ function mergeTransitionState(e, t) {
  * committed value — while re-running them would re-derive the OLD world
  * and re-stage it over the held truth. The reveal re-notifies
  * (commitPendingNodes), which is when they re-derive for real. */ function stealEntangledCargo(e, t) {
-    if (e === t.Lt || e.length === 0) return false;
+    if (e === t.Mt || e.length === 0) return false;
     for (let i = 0; i < e.length; i++) {
         const n = e[i];
         n.Ae = t;
-        t.Lt.push(n);
+        t.Mt.push(n);
         // Override-covered nodes stay silent AND unmasked: the override is the
         // display (A17 — its staging never notified, its revert will), so their
         // subs saw nothing and re-running one would break the silence with a
@@ -307,30 +287,30 @@ function notifyHalted() {
 let queueRunToken = 0;
 
 class Queue {
-    ke=null;
-    Mt=[ [], [] ];
-    Qt=[];
-    jt=0;
+    Le=null;
+    jt=[ [], [] ];
+    Bt=[];
+    qt=0;
     created=clock;
     addChild(e) {
-        this.Qt.push(e);
-        e.ke = this;
+        this.Bt.push(e);
+        e.Le = this;
     }
     removeChild(e) {
-        const t = this.Qt.indexOf(e);
+        const t = this.Bt.indexOf(e);
         if (t >= 0) {
-            this.Qt.splice(t, 1);
-            e.ke = null;
+            this.Bt.splice(t, 1);
+            e.Le = null;
         }
     }
     notify(e, t, i, n) {
-        if (this.ke) return this.ke.notify(e, t, i, n);
+        if (this.Le) return this.Le.notify(e, t, i, n);
         return false;
     }
     run(e) {
-        if (this.Mt[e - 1].length) {
-            const t = this.Mt[e - 1];
-            this.Mt[e - 1] = [];
+        if (this.jt[e - 1].length) {
+            const t = this.jt[e - 1];
+            this.jt[e - 1] = [];
             runQueue(t, e);
         }
         // Effects run here can dispose owners, and disposal removes queues from
@@ -340,12 +320,12 @@ class Queue {
         // can be recovered by rescanning from the front and every child still runs
         // exactly once. Children appended mid-pass carry a stale stamp and run,
         // matching the previous live-array behaviour.
-                const t = this.Qt;
+                const t = this.Bt;
         const i = ++queueRunToken;
         for (let n = 0; n < t.length; ) {
             const r = t[n];
-            if (r.jt !== i) {
-                r.jt = i;
+            if (r.qt !== i) {
+                r.qt = i;
                 r.run?.(e);
                 if (t[n] !== r) {
                     n = 0;
@@ -362,34 +342,34 @@ class Queue {
                 const i = findLane(currentOptimisticLane);
                 i.tn[e - 1].push(t);
             } else {
-                this.Mt[e - 1].push(t);
+                this.jt[e - 1].push(t);
             }
         }
         schedule();
     }
     stashQueues(e) {
-        e.Mt[0].push(...this.Mt[0]);
-        e.Mt[1].push(...this.Mt[1]);
-        this.Mt = [ [], [] ];
-        for (let t = 0; t < this.Qt.length; t++) {
-            let i = this.Qt[t];
-            let n = e.Qt[t];
+        e.jt[0].push(...this.jt[0]);
+        e.jt[1].push(...this.jt[1]);
+        this.jt = [ [], [] ];
+        for (let t = 0; t < this.Bt.length; t++) {
+            let i = this.Bt[t];
+            let n = e.Bt[t];
             if (!n) {
                 n = {
-                    Mt: [ [], [] ],
-                    Qt: []
+                    jt: [ [], [] ],
+                    Bt: []
                 };
-                e.Qt[t] = n;
+                e.Bt[t] = n;
             }
             i.stashQueues(n);
         }
     }
     restoreQueues(e) {
-        this.Mt[0].push(...e.Mt[0]);
-        this.Mt[1].push(...e.Mt[1]);
-        for (let t = 0; t < e.Qt.length; t++) {
-            const i = e.Qt[t];
-            let n = this.Qt[t];
+        this.jt[0].push(...e.jt[0]);
+        this.jt[1].push(...e.jt[1]);
+        for (let t = 0; t < e.Bt.length; t++) {
+            const i = e.Bt[t];
+            let n = this.Bt[t];
             if (n) n.restoreQueues(i);
         }
     }
@@ -401,9 +381,9 @@ class GlobalQueue extends Queue {
     // transition is active, the active transition itself after initTransition.
     m=createBatch();
     static Fe;
-    static He;
-    static it;
-    static qt=null;
+    static ke;
+    static ut;
+    static Wt=null;
     // Store-side hook: drops a keyless affects() mark's identity scope when the
     // carrier node's last registration releases (wired by store.ts, mirroring
     // _clearOptimisticStore).
@@ -417,8 +397,8 @@ class GlobalQueue extends Queue {
     static N=null;
     // External-source bridge (wired by enableExternalSource(); null while no
     // config is active — including after _resetExternalSourceConfig()).
-    static Pt=null;
-    static ht=null;
+    static Ft=null;
+    static gt=null;
     // Verdict-layer hooks (wired by verdict.ts when isPending()/latest() are
     // imported; null in apps that never use them). Call sites either guard for
     // null or sit behind state only the verdict layer can create (`!` is safe
@@ -429,15 +409,15 @@ class GlobalQueue extends Queue {
     static de=null;
     static me=null;
     static un=null;
-    static gt=null;
-    static Ht=null;
-    static kt=null;
-    static et=null;
+    static Vt=null;
+    static bt=null;
+    static Lt=null;
+    static nt=null;
     static k=null;
-    static Wt=null;
+    static zt=null;
     // Re-asks probes whose verdict was provisionally suppressed by a fresh read
     // of a held value, once the transaction gains an async blocker (#3028).
-    static zt=null;
+    static Kt=null;
     // Optimistic-engine hooks (wired by core/optimistic.ts via
     // installOptimisticEngine(), called from verdict.ts / createOptimistic /
     // createOptimisticStore — every module that can create optimistic state).
@@ -445,7 +425,7 @@ class GlobalQueue extends Queue {
     // `_overrideValue` slot, a lane in `activeLanes`, an `_optimisticNodes`
     // entry, or a non-null `currentOptimisticLane`, so `!` invocations are safe
     // once the gate holds.
-    static xt=null;
+    static yt=null;
     static Tn=null;
     static dn=null;
     static In=null;
@@ -454,16 +434,17 @@ class GlobalQueue extends Queue {
      * apply at lane-effect timing — visible in flight, unlike the regular
      * effect queues an action stashes. Injected; null when unused. */
     static ln=null;
-    static vt=null;
-    static Vt=null;
-    static bt=null;
-    static Be=null;
-    static $e=null;
-    /** Authoritative-view reader wakeup (until()): installed at first until() call.
-     * Call sites are gated by CONFIG_AUTHORITATIVE_OBSERVED, which only until()'s
-     * carve-out read can set, so `!` invocations are safe once the gate holds. */
+    static Ut=null;
+    static kt=null;
+    static xt=null;
+    static Je=null;
+    static tt=null;
+    /** Authoritative-view reader wakeup: installed by until() and refresh() before
+     * their first read. Call sites are gated by CONFIG_AUTHORITATIVE_OBSERVED, which
+     * only such a reader's carve-out read can set, so `!` invocations are safe once
+     * the gate holds (#3303). */
     static he=null;
-    static Xe=null;
+    static et=null;
     static _n=null;
     flush() {
         if (this.fn) return;
@@ -472,7 +453,7 @@ class GlobalQueue extends Queue {
         // optimistic state. Commit and go; anything a commit hook schedules
         // (companion snaps, store folds notifying subs) re-arms `scheduled`
         // below and the outer drain loop takes the full spine next round.
-                if (activeTransition === null && dirtyQueue.EE < dirtyQueue.Qe && this.Mt[0].length === 0 && this.Mt[1].length === 0 && this.Qt.length === 0 && canUseSimpleSyncFlush(this)) {
+                if (activeTransition === null && dirtyQueue.EE < dirtyQueue.Me && this.jt[0].length === 0 && this.jt[1].length === 0 && this.Bt.length === 0 && canUseSimpleSyncFlush(this)) {
             this.fn = true;
             try {
                 // Sweep first: unobserved() pulls swept nodes out of the dirty heap,
@@ -484,7 +465,7 @@ class GlobalQueue extends Queue {
                 this.fn = false;
             }
             clock++;
-            scheduled = dirtyQueue.EE >= dirtyQueue.Qe || this.Mt[0].length !== 0 || this.Mt[1].length !== 0 || this.m.Lt.length !== 0;
+            scheduled = dirtyQueue.EE >= dirtyQueue.Me || this.jt[0].length !== 0 || this.jt[1].length !== 0 || this.m.Mt.length !== 0;
             return;
         }
         this.fn = true;
@@ -520,32 +501,32 @@ class GlobalQueue extends Queue {
                         GlobalQueue.Nn(EFFECT_RENDER);
                         GlobalQueue.Nn(EFFECT_USER);
                     }
-                    this.stashQueues(e.Bt);
+                    this.stashQueues(e.wt);
                     clock++;
                     // A kept ambient batch may hold pending nodes (#2916): stay
                     // scheduled so the outer drain loop commits them via the plain
                     // flush path instead of leaving them until the next natural flush.
-                                        scheduled = dirtyQueue.EE >= dirtyQueue.Qe || this.m.Lt.length > 0;
-                    reassignPendingTransition(e.Lt);
+                                        scheduled = dirtyQueue.EE >= dirtyQueue.Me || this.m.Mt.length > 0;
+                    reassignPendingTransition(e.Mt);
                     activeTransition = null;
                     finalizePureQueue(null, true);
                     return;
                 }
                 const t = activeTransition;
                 const i = this.m;
-                i !== t && i.Lt.push(...t.Lt);
-                this.restoreQueues(t.Bt);
+                i !== t && i.Mt.push(...t.Mt);
+                this.restoreQueues(t.wt);
                 transitions.delete(t);
                 activeTransition = null;
-                reassignPendingTransition(i.Lt);
+                reassignPendingTransition(i.Mt);
                 finalizePureQueue(t);
                 if (i === t) {
                     // Drop the dead Transition wrapper but keep its (drained) containers
                     // as the ambient batch — late registrations during finalization live
                     // there and must survive to the next flush.
                     const e = createBatch();
-                    e.Lt = i.Lt;
-                    e.ze = i.ze;
+                    e.Mt = i.Mt;
+                    e.Xe = i.Xe;
                     e.A = i.A;
                     e.En = i.En;
                     currentBatch = this.m = e;
@@ -553,7 +534,7 @@ class GlobalQueue extends Queue {
             } else {
                 if (canUseSimpleSyncFlush(this)) {
                     commitPendingNodes();
-                    if (dirtyQueue.EE >= dirtyQueue.Qe) {
+                    if (dirtyQueue.EE >= dirtyQueue.Me) {
                         runHeap(dirtyQueue, GlobalQueue.Fe);
                         commitPendingNodes();
                     }
@@ -564,7 +545,7 @@ class GlobalQueue extends Queue {
             }
             clock++;
             // Check if finalization added items to the heap (from optimistic reversion)
-                        scheduled = dirtyQueue.EE >= dirtyQueue.Qe;
+                        scheduled = dirtyQueue.EE >= dirtyQueue.Me;
             // Run lane effects first (for ready lanes), then regular effects
                         activeLanes.size && GlobalQueue.Nn(EFFECT_RENDER);
             this.run(EFFECT_RENDER);
@@ -581,21 +562,31 @@ class GlobalQueue extends Queue {
         // Only track async if the boundary is propagating STATUS_PENDING (not caught by boundary)
         if (t & STATUS_PENDING) {
             if (i & STATUS_PENDING) {
-                const t = n !== undefined ? n : e.o?._;
+                // Callers pass either nothing or this node's own `_x._error`, so `??`
+                // is exact (a null error falls back to the same null).
+                const t = n ?? e.o?._;
                 // A visibility-only mark notification (the affects() boundary
                 // channel) updates display state on its way up but must be invisible
                 // to completion accounting BY CONSTRUCTION: it never registers a
                 // reporter and never counts toward the loading-boundary diagnostic.
                                 if (t?.l) return true;
-                if (activeTransition && t) {
-                    const i = t.source;
-                    let n = activeTransition._e.get(i);
-                    if (!n) activeTransition._e.set(i, n = new Set);
-                    const r = n.size;
-                    n.add(e);
-                    if (n.size !== r) {
-                        schedule();
-                        GlobalQueue.zt?.(activeTransition);
+                if (t) {
+                    // A reveal can discover a flight started in an earlier flush. Hold
+                    // the staged writes with that reader (A15), even if the reader is
+                    // new. Fresh/reset loading boundaries consume pending before it
+                    // reaches here. A reader already parked in a transition must not
+                    // open a second one.
+                    if (!activeTransition && !e.Ae && currentBatch.Mt.length) this.initTransition();
+                    if (activeTransition) {
+                        const i = t.source;
+                        let n = activeTransition._e.get(i);
+                        if (!n) activeTransition._e.set(i, n = new Set);
+                        const r = n.size;
+                        n.add(e);
+                        if (n.size !== r) {
+                            schedule();
+                            GlobalQueue.Kt?.(activeTransition);
+                        }
                     }
                 }
             }
@@ -621,6 +612,11 @@ class GlobalQueue extends Queue {
         } else if (e) {
             const t = activeTransition;
             mergeTransitionState(e, t);
+            // Effects the outgoing transaction parked belong to the surviving one
+            // now: back onto the live queue, where this flush parks them under
+            // `transition` or runs them at its completion. The outgoing stash is
+            // never read again — the transaction is dead (#3310).
+                        this.restoreQueues(t.wt);
             transitions.delete(t);
             activeTransition = e;
         }
@@ -635,15 +631,15 @@ class GlobalQueue extends Queue {
             // must not entangle unrelated writes to it; the same rule holds one hop
             // downstream: propagation never queues pended subscribers as pending
             // nodes, see propagateAffectsMark, #2893.
-            for (let e = 0; e < t.Lt.length; e++) {
-                const i = t.Lt[e];
+            for (let e = 0; e < t.Mt.length; e++) {
+                const i = t.Mt[e];
                 i.Ae = activeTransition;
-                activeTransition.Lt.push(i);
+                activeTransition.Mt.push(i);
             }
-            for (let e = 0; e < t.ze.length; e++) {
-                const i = t.ze[e];
+            for (let e = 0; e < t.Xe.length; e++) {
+                const i = t.Xe[e];
                 i.Ae = activeTransition;
-                activeTransition.ze.push(i);
+                activeTransition.Xe.push(i);
             }
             if (t.A.length) activeTransition.A.push(...t.A);
             for (const e of t.En) activeTransition.En.add(e);
@@ -671,7 +667,7 @@ class GlobalQueue extends Queue {
 }
 
 function queuePendingNode(e) {
-    currentBatch.Lt.push(e);
+    currentBatch.Mt.push(e);
 }
 
 // Sticky: flips true on the first refresh() ever (the only setter of
@@ -695,7 +691,7 @@ function armReaskClear() {
 function insertSubs(e, t = false) {
     // §12d: stamp before walking — setSignal's staged-rewrite fast path skips
     // the next walk for this node while the epoch holds (marking is idempotent).
-    e.It = notifyEpoch;
+    e.Et = notifyEpoch;
     // Get source lane: prefer node's own lane over current context
     // This is important for isPending signals which need their own lane to flush immediately
     // Presence bits gate the optional-slot probes (see constants.ts): one
@@ -703,8 +699,8 @@ function insertSubs(e, t = false) {
     // lookups in the hottest notify loop. Bits are sticky — the field read
     // stays authoritative when a bit is set.
         const i = e.T;
-    const n = (i & CONFIG_HAS_LANE ? e.o?.Je : undefined) || currentOptimisticLane;
-    const r = (i & CONFIG_HAS_SNAPSHOT) !== 0 && e.o?.We !== undefined;
+    const n = (i & CONFIG_HAS_LANE ? e.o?.$e : undefined) || currentOptimisticLane;
+    const r = (i & CONFIG_HAS_SNAPSHOT) !== 0 && e.o?.Ye !== undefined;
     const s = reaskArmed;
     for (let i = e.u; i !== null; i = i.ae) {
         const e = i.ce;
@@ -719,7 +715,7 @@ function insertSubs(e, t = false) {
         // pass either re-reads them fresh or trims them), and neither does the
         // tail link: it is the read IN FLIGHT — read() links before it pulls, so
         // this very commit is what that read returns.
-                if (e.ie & REACTIVE_RECOMPUTING_DEPS && i.Ft === e.Ke && i !== e.je) e.ie |= REACTIVE_MISSED_WAKE;
+                if (e.ie & REACTIVE_RECOMPUTING_DEPS && i.vt === e.ze && i !== e.Be) e.ie |= REACTIVE_MISSED_WAKE;
         if (r && e.T & CONFIG_IN_SNAPSHOT_SCOPE) {
             e.ie |= REACTIVE_SNAPSHOT_STALE;
             continue;
@@ -730,7 +726,7 @@ function insertSubs(e, t = false) {
         } else if (t) {
             e.ie |= REACTIVE_OPTIMISTIC_DIRTY;
             // No source lane means reversion - clear subscriber's lane so effects go to regular queue
-                        if (e.o) e.o.Je = undefined;
+                        if (e.o) e.o.$e = undefined;
         }
         enqueueSub(e);
     }
@@ -750,7 +746,7 @@ function commitPendingNode(e) {
         e.be = e.Re;
         e.Re = NOT_PENDING;
         // Set _modified for effects, but not for tracked effects (they handle their own scheduling)
-                if (e.ge && e.ge !== EFFECT_TRACKED) e.tt = true;
+                if (e.ge && e.ge !== EFFECT_TRACKED) e.He = true;
         // A quiet re-ask classification preserved through a held landing dies
         // with the value commit — the commit IS the reveal (#3178). Gated on the
         // staged value: status propagation queues pending nodes whose windows
@@ -764,7 +760,7 @@ function commitPendingNode(e) {
         t.Ne = false;
     t.ie &= ~REACTIVE_MANUAL_WRITE;
     if (!(t.S & STATUS_PENDING)) t.S &= ~STATUS_UNINITIALIZED;
-    if (t.o != null && (t.o.Ye !== null || t.o.qe !== null)) GlobalQueue.He(t, false, true);
+    if (t.o != null && (t.o.Ke !== null || t.o.Ze !== null)) GlobalQueue.ke(t, false, true);
     if (e.T & CONFIG_HAS_COMPANIONS) GlobalQueue.un(e);
 }
 
@@ -779,17 +775,6 @@ function setStoreCommitHook(e) {
     storeCommitHook = e;
 }
 
-/** Patch-channel release hook (next/patch.ts): transition-stamped patch
- * emissions are released when THEIR batch commits. Transitions never
- * abort: failed actions still commit (only optimistic overrides revert),
- * and merged-away transitions hand their stash to the survivor
- * (mergeTransitionState) — every stash drains exactly once. Injected like
- * storeCommitHook to stay tree-shakeable. */ let patchCommitHook = null;
-
-function setPatchCommitHook(e) {
-    patchCommitHook = e;
-}
-
 /** Held truth committed this finalize, awaiting its post-revert wake (see
  * finalizePureQueue): the commit IS the reveal, but subscribers must not
  * re-derive until the settling transaction's optimistic overrides have
@@ -798,7 +783,7 @@ function setPatchCommitHook(e) {
  * frame no timeline contains. */ const heldRevealed = [];
 
 function commitPendingNodes() {
-    const e = currentBatch.Lt;
+    const e = currentBatch.Mt;
     for (let t = 0; t < e.length; t++) {
         const i = e[t];
         commitPendingNode(i);
@@ -821,7 +806,6 @@ function commitPendingNodes() {
     }
     e.length = 0;
     storeCommitHook?.();
-    patchCommitHook?.(currentBatch);
 }
 
 function finalizePureQueue(e = null, t = false) {
@@ -829,8 +813,8 @@ function finalizePureQueue(e = null, t = false) {
     // For completing transitions or no-transition, resolve pending and revert optimistic
     const i = !t;
     if (i) commitPendingNodes();
-    if (!t && globalQueue.Qt.length) checkBoundaryChildren(globalQueue);
-    const n = dirtyQueue.EE >= dirtyQueue.Qe;
+    if (!t && globalQueue.Bt.length) checkBoundaryChildren(globalQueue);
+    const n = dirtyQueue.EE >= dirtyQueue.Me;
     if (n) runHeap(dirtyQueue, GlobalQueue.Fe);
     if (i) {
         if (n) commitPendingNodes();
@@ -838,7 +822,7 @@ function finalizePureQueue(e = null, t = false) {
                 const t = e ?? globalQueue.m;
         // Optimistic reversion: a non-empty batch means _optimisticWrite ran,
         // which installed the engine's hooks.
-                if (t.ze.length) GlobalQueue.Tn(t.ze);
+                if (t.Xe.length) GlobalQueue.Tn(t.Xe);
         // Replay entanglement: subs recorded by the read-time gate get rescheduled
         // so they re-run with the now-committed values visible. The ambient batch
         // replays too — laneReadsCommitted records readers whose committed-view
@@ -862,13 +846,13 @@ function finalizePureQueue(e = null, t = false) {
         // (the earlier sweep above ran while the marks were still live).
                 if (t.A.length) {
             GlobalQueue.G(t.A);
-            if (globalQueue.Qt.length) checkBoundaryChildren(globalQueue);
+            if (globalQueue.Bt.length) checkBoundaryChildren(globalQueue);
         }
         // A non-empty set means trackOptimisticStore ran, which installed the
         // hook; the hook iterates, clears, and schedules (keeping the loop out of
         // core lets esbuild shake it — rollup already folds the null guard). The
         // completing transition scopes the clear to its own layer keys (#2899).
-                if (t.En.size) GlobalQueue.qt(t.En, e);
+                if (t.En.size) GlobalQueue.Wt(t.En, e);
         // Held-truth reveal wake (#3164), post-revert by construction: this
         // finalize committed confirming truth whose subscribers were masked all
         // hold — some re-derived against the committed view (the staging, or a
@@ -880,7 +864,7 @@ function finalizePureQueue(e = null, t = false) {
         // committed but the settling transaction's overrides still display.
                 if (heldRevealed.length !== 0) {
             while (heldRevealed.length) insertSubs(heldRevealed.pop());
-            if (dirtyQueue.EE >= dirtyQueue.Qe) {
+            if (dirtyQueue.EE >= dirtyQueue.Me) {
                 runHeap(dirtyQueue, GlobalQueue.Fe);
                 commitPendingNodes();
             }
@@ -892,7 +876,7 @@ function finalizePureQueue(e = null, t = false) {
 }
 
 function checkBoundaryChildren(e) {
-    for (const t of e.Qt) {
+    for (const t of e.Bt) {
         t.se?.();
         checkBoundaryChildren(t);
     }
@@ -962,11 +946,11 @@ function runQueue(e, t) {
 function reporterBlocksSource(e, t) {
     if (e.ie & (REACTIVE_ZOMBIE | REACTIVE_DISPOSED)) return false;
     if (e.o?.le?.has(t)) return true;
-    for (let i = e.ut; i; i = i.lt) {
-        let e = i.ot;
+    for (let i = e.lt; i; i = i.ot) {
+        let e = i.st;
         while (e) {
-            if (e === t || e.st === t) return true;
-            e = e.o?.Tt;
+            if (e === t || e.rt === t) return true;
+            e = e.o?.St;
         }
     }
     return !!(e.S & STATUS_PENDING && e.o?._ instanceof NotReadyError && e.o?._.source === t);
@@ -974,7 +958,9 @@ function reporterBlocksSource(e, t) {
 
 function transitionComplete(e) {
     if (e.sn) return true;
-    if (e.ue.length) return false;
+    if (e.ue.length) {
+        return false;
+    }
     let t = true;
     for (const [i, n] of e._e) {
         let r = false;
@@ -1043,4 +1029,4 @@ function runInTransition(e, t) {
     }
 }
 
-export { GlobalQueue, Queue, activeAffectsMarks, activeLanes, activeTransition, armReaskClear, assignOrMergeLane, bumpNotifyEpoch, clock, createTransition, currentTransition, dirtyQueue, enforceLoadingBoundary, entangleConfirmingTransitions, finalizePureQueue, findLane, flush, globalQueue, haltReactivity, hasActiveOverride, insertSubs, notifyEpoch, patchCommitHook, projectionWriteActive, queuePendingNode, reaskArmed, resetErrorHalt, runAsTransitionBatch, runInTransition, schedule, setPatchCommitHook, setProjectionWriteActive, setStoreCommitHook, shiftAffectsMarks, storeCommitHook, zombieQueue };
+export { GlobalQueue, Queue, activeAffectsMarks, activeLanes, activeTransition, armReaskClear, assignOrMergeLane, bumpNotifyEpoch, clock, createTransition, currentTransition, dirtyQueue, enforceLoadingBoundary, entangleConfirmingTransitions, finalizePureQueue, findLane, flush, globalQueue, haltReactivity, hasActiveOverride, insertSubs, notifyEpoch, projectionWriteActive, queuePendingNode, reaskArmed, resetErrorHalt, runAsTransitionBatch, runInTransition, schedule, setProjectionWriteActive, setStoreCommitHook, shiftAffectsMarks, storeCommitHook, zombieQueue };