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

package/dist/prod/store/next/optimistic.js

@@ -1,8 +1,10 @@
-import { computed, ext, setSignal, isEqual } from "../../core/core.js";
+import { CONFIG_AUTO_DISPOSE, STATUS_PENDING, NOT_PENDING, CONFIG_OPTIMISTIC, CONFIG_HELD_TRUTH, unwrapOverride } from "../../core/constants.js";
 
-import { CONFIG_AUTO_DISPOSE, STATUS_PENDING, NOT_PENDING, unwrapOverride, CONFIG_OPTIMISTIC } from "../../core/constants.js";
+import { computed, setSignal, isEqual } from "../../core/core.js";
 
-import { GlobalQueue, insertSubs, schedule, globalQueue } from "../../core/scheduler.js";
+import { getOwner } from "../../core/owner.js";
+
+import { activeTransition, GlobalQueue, currentTransition, globalQueue, createTransition, runAsTransitionBatch } from "../../core/scheduler.js";
 
 import "../../core/invariants.js";
 
@@ -16,11 +18,11 @@ import { $TARGET, markRawIngest, setNextOptimisticViewResolver, isWrappable, raw
 
 import { runProjectionComputedNext } from "./projection.js";
 
-import { wrapNext, runAuthoritative, storeSetterNext, hasActiveOverride, unwrapValue, getNode, getHasNode, targetsEqual, getKeySetNode, bumpDeep } from "./store.js";
+import { wrapNext, runAuthoritative, storeSetterNext, hasActiveOverride, unwrapValue, targetsEqual, getNode, getHasNode, getKeySetNode, bumpDeep, stagedTruthPB, authoritativeRead } from "./store.js";
 
 import { patchHooks, rowHooks } from "./patch-hooks.js";
 
-import { buildIdentityRowOps, sameKey } from "./reconcile.js";
+import { sameKey, buildIdentityRowOps } from "./reconcile.js";
 
 import { setOptHooks } from "./target.js";
 
@@ -33,12 +35,32 @@ import { setOptHooks } from "./target.js";
  * armed presence nodes (the §6 overlay), so structural optimism reverts with
  * the same per-transaction granularity (FINDING-2's fix by construction).
  *
- * Derived form = an optimistic projection: the derive's recompute and its
- * async commits run under projectionWriteActive (authoritative landings
- * commit silently beneath any active overrides). The transitionBlocked
- * store-half (#2951) is installed here for next-shaped targets, chaining the
+ * Derived form = an optimistic projection. Landings follow the fold rule
+ * (#3164, RUL-2 as re-ruled): while a transaction retains optimistic edits
+ * on the family, truth that lands STAGES into that transaction — a keyed
+ * identity-preserving walk written through the ordinary staged setter
+ * channel — and reveals atomically at settle, exactly like a signal landing
+ * under an active override (asyncWrite's held branch). Optimistic edits are
+ * never consumed by landings; they live exactly as long as their transaction
+ * and die by engine-native revert. With no retainer, landings commit
+ * immediately under projectionWriteActive (authoritative, silently beneath
+ * any bare-write overrides — those ride the flight's own transition, #2951).
+ * Authoritative readers (until()'s predicate) tunnel into staged truth via
+ * the node read path's pending-value arm. The transitionBlocked store-half
+ * (#2951) is installed here for next-shaped targets, chaining the
  * legacy/engine checks.
- */ let blockedInstalled = false;
+ */
+/** #3164 fold: a stamped truth is HELD (masked from ordinary readers until
+ * the reveal) only while its transition is live AND retaining optimism —
+ * overrides are what make partial-coverage composition a tear. A plain
+ * async transition carries no overrides, so downstream computes must see
+ * staged values to converge (normal speculation). Resolves merges first:
+ * merge unions optimistic nodes/stores into the target. */ function transitionHoldsOptimism(e) {
+    const t = currentTransition(e);
+    return t.sn !== true && (t.ze.length !== 0 || t.En.size !== 0);
+}
+
+let blockedInstalled = false;
 
 function installNextBlockedHalf() {
     if (blockedInstalled) return;
@@ -49,14 +71,15 @@ function installNextBlockedHalf() {
         setOptHooks({
         notifyOptimisticWrites: notifyOptimisticWrites,
         optimisticView: optimisticView,
-        applyTentative: applyTentative
+        applyTentative: applyTentative,
+        retainsOptimism: transitionHoldsOptimism
     });
     setNextOptimisticViewResolver((e, t) => optimisticView(e, t));
     // Scheduler flush tails call _clearOptimisticStores whenever tracked
     // stores exist; next has no layer to clear — reverts are engine-native —
     // so the hook only empties the batch set.
-        if (!GlobalQueue.Bt) {
-        GlobalQueue.Bt = e => {
+        if (!GlobalQueue.qt) {
+        GlobalQueue.qt = e => {
             // Patch channel (revert site): engine-native reverts flip node values
             // back to committed; patched records need a forced DOM re-apply from
             // the post-revert view. Emission only — next keeps no layer to clear.
@@ -71,23 +94,38 @@ function installNextBlockedHalf() {
                         // row identity against the post-revert view (resolved from the
                         // target at drain — overrides are gone by then).
                                                 if (e.pc !== null && e.pc.ro !== null) rowHooks.emitRowOpsOptimistic(e, null, null);
+                        // Keyset resync (classic channel twin): the keyset node's own
+                        // revert can compare EQUAL (a landing's bump matched the
+                        // tentative bump) while the arrangement underneath changed —
+                        // mapArray/ownKeys subscribers must re-read the post-revert
+                        // view. Authoritative bump: never re-arm the node we are
+                        // clearing.
+                                                if (e.k !== null) runAuthoritative(() => setSignal(e.k, e => e + 1));
                     }
                 }
             }
             e.clear();
         };
     }
-    const e = GlobalQueue.In;
-    GlobalQueue.In = t => {
-        for (const e of t.Tn) {
-            const t = e?.[$TARGET];
-            const n = t?.fam?.node;
+    const e = GlobalQueue.dn;
+    GlobalQueue.dn = t => {
+        for (const e of t.En) {
+            const n = e?.[$TARGET];
+            const i = n?.fam;
+            const o = i?.node;
             // The hold exists to keep optimistic state alive until the store's own
             // truth lands (#2951). Once the family carries NO live overrides (a
             // landing consumed them, or they never existed), a pending firewall is
             // no reason to park the transaction — blocking then leaks it forever
             // when the in-flight question is never answered (undisposed fixtures).
-                        if (n != null && n.S & STATUS_PENDING && familyHasLiveOverrides(t.fam)) return true;
+                        if (o == null || !(o.S & STATUS_PENDING)) continue;
+            // Ownership is declared (#3146): only the flight's OWN transaction
+            // parks on the flight (the #2951 anchor routed the bare write there).
+            // A transaction that merely brushed the store never waits for truth
+            // it does not carry.
+                        const r = i.ft != null ? liveTransition(i.ft) : null;
+            if (r !== null && r !== currentTransition(t)) continue;
+            if (familyHasLiveOverrides(i)) return true;
         }
         return e(t);
     };
@@ -101,10 +139,10 @@ function familyHasLiveOverrides(e) {
             if (t === null) continue;
             for (const e of Reflect.ownKeys(t)) {
                 const n = t[e];
-                if (n.o?.De !== undefined && n.o?.De !== NOT_PENDING) return true;
+                if (n.o?.Pe !== undefined && n.o?.Pe !== NOT_PENDING) return true;
             }
         }
-        if (e.k !== null && e.k.o?.De !== undefined && e.k.o?.De !== NOT_PENDING) return true;
+        if (e.k !== null && e.k.o?.Pe !== undefined && e.k.o?.Pe !== NOT_PENDING) return true;
     }
     t.clear();
  // nothing live — drop the bookkeeping
@@ -125,34 +163,276 @@ function createOptimisticStoreNext(e, t, n) {
         shallow: !!n?.shallow,
         opt: true
     };
-    const s = wrapNext(o, null, null, r);
-    r.px = s;
+    const l = wrapNext(o, null, null, r);
+    r.px = l;
+    // Same key resolution the projection channels use ("id" default) — replay's
+    // satisfaction rule reads it off the family.
+        const s = n?.key === undefined ? "id" : n.key;
+    r.key = typeof s === "function" ? s : s === null ? null : e => isWrappable(e) ? e[s] : undefined;
     if (r.shallow) {
-        s[$TARGET].s = true;
+        l[$TARGET].s = true;
         markRawIngest(o);
     }
     if (i) {
         const t = e;
-        // Async commits land outside the computed's sync body — re-apply the
-        // authoritative-write posture there too. Landings consume the family's
-        // tentative overrides (RUL-2: visible landed truth replaces optimism) —
-        // both the reconcile-channel commit and per-op post-await draft writes.
-                const consume = () => consumeOverridesNext(r);
-        const wrapCommit = e => {
+        // #3146: an async settle event belongs to the flight's OWN transaction.
+        // A live declared one re-enters (a merge if the generic settle path
+        // already entered a graph-stamped stranger — the landing supersedes any
+        // recompute deriving from that stranger's world); a dead one renews (per
+        // A18(1) each arrival reveals on its own schedule, so per-yield
+        // transactions die with their commit and the next settle event opens the
+        // flight's next one — still declared, never anonymous). An UNDECLARED
+        // flight (loading window) keeps the ambient reveal (#2933: the loading
+        // rail is transaction-invisible).
+                const enterFlightTransition = () => {
+            const e = r.ft;
+            if (e == null) return;
+            let t = liveTransition(e);
+            if (t === null) r.ft = t = createTransition();
+            r.node.Ae = t;
+            globalQueue.initTransition(t);
+        };
+        // Landing router (#3164 fold ruling): while a transaction retains
+        // optimistic edits on this family, truth landings stage INTO it and
+        // reveal atomically at settle; with no retainer they commit immediately
+        // under the authoritative posture (async commits land outside the
+        // computed's sync body, so the posture is re-applied here) — inside the
+        // flight-owned transaction (#3146). Sync commits (the derive's body,
+        // owner is the firewall itself) reveal with their own recompute's flush.
+                const wrapCommit = (e, t) => {
+            const n = retainingTransition(r);
+            if (n !== null) return void stageLanding(r, n, t);
+            if (getOwner() !== r.node) enterFlightTransition();
             runAuthoritative(e);
-            consume();
+        };
+        // Draft writes (the derive mutating its draft, sync body and post-await
+        // continuations alike) are the same truth channel per-operation: bind
+        // each op to the retaining transaction so its node writes stage and its
+        // backing fold defers (ensurePB stamps foldBatches with the swapped-in
+        // batch; the write-override eager-commit branch in notifyWrites yields
+        // to any active transaction).
+                const aroundDraftWrite = e => {
+            const t = retainingTransition(r);
+            if (t === null) e(); else runFolded(t, e);
+        };
+        // Flight declaration (#3146): a recompute that registered a truth-flight
+        // OWNS its transaction. The ask's transaction is recorded on the family
+        // (created by the flight's own pending throw when none was ambient, the
+        // causing write's/refresh's when one was — graph-driven causality) and
+        // the firewall is stamped so every settle path resolves the flight's
+        // transaction by construction, not by whatever last brushed the node.
+        // When the ask took none (a dead stale stamp — the previous flight's,
+        // cleared nowhere — bare-returns the pre-throw entry), the flight opens
+        // its own here, same activation point as the pre-throw's creation: the
+        // ambient batch (the causing write, same-tick bare optimism) adopts into
+        // it exactly as it would have there, and the pending notification that
+        // follows this unwind registers observers against it. The flight
+        // also registers as its own async reporter: the transaction lives
+        // exactly as long as the question is unanswered, observed or not — the
+        // #2951 refetch-hold no longer depends on a tracked observer having
+        // happened to register one. Loading-window flights declare nothing
+        // (#2933: the loading rail is transaction-invisible); a sync run clears
+        // the declaration.
+                const declareFlight = e => {
+            if (e.o?.Ie == null) {
+                if (!e.Ne) r.ft = null;
+                return;
+            }
+            if (e.Ne) return;
+            let t = activeTransition;
+            if (t === null) globalQueue.initTransition(t = createTransition());
+            r.ft = t;
+            e.Ae = t;
+            let n = t._e.get(e);
+            if (n === undefined) t._e.set(e, n = new Set);
+            n.add(e);
         };
         let i;
         if (n?.seedLoadingValue) i = {
             loadingValue: undefined
         };
         const o = computed(() => {
-            runAuthoritative(() => runProjectionComputedNext(s, t, n?.key === undefined ? "id" : n.key, wrapCommit, consume));
+            const e = getOwner();
+            try {
+                runAuthoritative(() => runProjectionComputedNext(l, t, n?.key === undefined ? "id" : n.key, wrapCommit, aroundDraftWrite));
+            } finally {
+                declareFlight(e);
+            }
         }, i);
         o.T &= ~CONFIG_AUTO_DISPOSE;
         r.node = o;
     }
-    return [ s, e => storeSetterNext(s, e) ];
+    return [ l, e => {
+        // Retention ledger (#3164): record the owning transaction so landings
+        // know to fold. Captured at entry — the action machinery has the
+        // transaction ambient while user code runs; a bare write with no
+        // transaction retains nothing (it rides the flight's own transition
+        // per #2951 and dies with it).
+        const t = activeTransition;
+        storeSetterNext(l, e);
+        if (t !== null) (r.rt ??= new Set).add(t);
+    } ];
+}
+
+/** Resolve a retained transition through its merge chain (`_done` holds the
+ * merge target while merged, `true` once settled). Null = dead. */ function liveTransition(e) {
+    while (typeof e.sn === "object") e = e.sn;
+    return e.sn === true ? null : e;
+}
+
+/** The transaction truth landings fold into: the first live member of the
+ * family's retention ledger (dead members prune here). Multiple live
+ * retainers entangle through their shared family writes and settle
+ * together, so folding into the first reaches all of them. */ function retainingTransition(e) {
+    const t = e.rt;
+    if (t === undefined || t.size === 0) return null;
+    let n = null;
+    for (const e of t) {
+        const i = liveTransition(e);
+        if (i === null) t.delete(e); else n ??= i;
+    }
+    return n;
+}
+
+/** Fold a landing into the retaining transaction (#3164): the landed value
+ * is written through the ORDINARY staged setter channel — node writes park
+ * as `_pendingValue` registered with the transaction's batch (speculation
+ * and until()'s authoritative tunnel see them; live view stays coherent),
+ * and the backing fold defers via the foldBatches stamp — under the
+ * authoritative posture, so armed nodes take the engine bypass and no
+ * override is created. The engine's own commit machinery reveals everything
+ * atomically when the transaction settles (transitions never abort: failed
+ * actions still commit — only optimistic overrides revert). */ function stageLanding(e, t, n) {
+    runFolded(t, () => runAuthoritative(() => storeSetterNext(e.px, t => {
+        stagedApply(t, unwrapValue(n), e.key ?? null);
+    }, false)));
+}
+
+/** Run a fold write inside the retaining transaction's batch, then
+ * transition-stamp its staged nodes NOW (parity with the parked-transition
+ * flush path's reassignPendingTransition): the stamp is what routes stale
+ * (render) readers to the committed value — core read's cross-transaction
+ * guard — and what makes foldHeld defer the backing for context-free
+ * readers. A microtask staging never crosses that flush path, so without
+ * the stamp a render effect's speculative recompute would compose staged
+ * truth with live overrides — the #3164 tear, one window later. Armed
+ * nodes additionally raise CONFIG_HELD_TRUTH: their staged value is
+ * confirming truth masked from ordinary readers until the reveal (plain
+ * staged nodes stay visible — normal speculation; override-covered nodes
+ * stay unarmed — the override is their display and its revert their
+ * notification, A17). */ function runFolded(e, t) {
+    runAsTransitionBatch(e, t);
+    const n = e.Lt;
+    for (let t = 0; t < n.length; t++) {
+        const i = n[t];
+        i.Ae = e;
+        if (i.T & CONFIG_OPTIMISTIC && !hasActiveOverride(i)) i.T |= CONFIG_HELD_TRUTH;
+    }
+}
+
+/** Keyed identity-preserving deep merge through live draft proxies — the
+ * staged twin of the adoption walk. Reads see the pending backing (staged
+ * view), so consecutive landings during one hold compose; key-matched rows
+ * keep their raw (and so their proxy) in the slot with only changed leaves
+ * written; unmatched rows land wholesale. Runs inside stageLanding's
+ * authoritative bracket: drafts seed from committed truth, never overlays. */ function stagedApply(e, t, n) {
+    const i = Array.isArray(e);
+    if (i && Array.isArray(t)) {
+        const i = t.length;
+        if (n !== null) {
+            // Occurrence-aware key queues (parity with the adoption window):
+            // duplicate keys match per occurrence, each current row consumed once.
+            let o = null;
+            const r = e.length;
+            for (let t = 0; t < r; t++) {
+                const i = unwrapValue(e[t]);
+                if (!isWrappable(i)) continue;
+                const r = n(i);
+                if (r === undefined) continue;
+                const l = (o ??= new Map).get(r);
+                if (l === undefined) o.set(r, [ i ]); else l.push(i);
+            }
+            // Echo adoption: an optimistic structural add whose key the landing
+            // confirms must keep its raw (and so its proxy — list drivers keep the
+            // DOM row). Tentative rows never reach committed truth (they live in
+            // node overrides), so key-match the draft target's active override
+            // rows as a secondary pool. Committed rows queued first own their
+            // keys; overlay rows only extend coverage. Adopted raws enter staged
+            // truth; at settle the override reverts and the reveal re-seats the
+            // same raw.
+                        const l = e[$TARGET]?.n;
+            if (l != null) {
+                for (const e of Reflect.ownKeys(l)) {
+                    const t = l[e];
+                    if (!hasActiveOverride(t)) continue;
+                    const i = unwrapValue(unwrapOverride(t.o.Pe));
+                    if (!isWrappable(i)) continue;
+                    const r = n(i);
+                    if (r === undefined) continue;
+                    const s = (o ??= new Map).get(r);
+                    if (s === undefined) o.set(r, [ i ]); else s.push(i);
+                }
+            }
+            for (let r = 0; r < i; r++) {
+                const i = t[r];
+                let l;
+                if (isWrappable(i) && o !== null) {
+                    const e = n(i);
+                    if (e !== undefined) {
+                        for (const [t, n] of o) {
+                            if (!sameKey(t, e)) continue;
+                            l = n.shift();
+                            if (n.length === 0) o.delete(t);
+                            break;
+                        }
+                    }
+                }
+                if (l !== undefined) {
+                    if (unwrapValue(e[r]) !== l) e[r] = l;
+                    stagedApply(e[r], i, n);
+                } else {
+                    const t = unwrapValue(e[r]);
+                    if (!isEqual(t, i) && !targetsEqual(t, i)) e[r] = i;
+                }
+            }
+        } else {
+            for (let o = 0; o < i; o++) {
+                const i = t[o];
+                const r = unwrapValue(e[o]);
+                if (r === i) continue;
+                if (isWrappable(i) && isWrappable(r) && Array.isArray(i) === Array.isArray(r)) stagedApply(e[o], i, n); else if (!isEqual(r, i) && !targetsEqual(r, i)) e[o] = i;
+            }
+        }
+        if (e.length !== i) e.length = i;
+        return;
+    }
+    // Object merge; also the degenerate root-kind-change shape (arrays accept
+    // keyed writes/deletes, so a wholesale restatement still lands staged).
+        for (const o of Reflect.ownKeys(t)) {
+        if (i && o === "length") continue;
+        const r = t[o];
+        const l = unwrapValue(e[o]);
+        if (l === r) continue;
+        if (isWrappable(r) && isWrappable(l) && Array.isArray(r) === Array.isArray(l)) {
+            // Different-keyed entities never merge (tentative-channel parity):
+            // the incoming object replaces the slot wholesale.
+            if (n !== null) {
+                const t = n(l);
+                const i = n(r);
+                if (t !== undefined && i !== undefined && !sameKey(t, i)) {
+                    e[o] = r;
+                    continue;
+                }
+            }
+            stagedApply(e[o], r, n);
+        } else if (!isEqual(l, r) && !targetsEqual(l, r)) {
+            e[o] = r;
+        }
+    }
+    for (const n of Reflect.ownKeys(e)) {
+        if (i && n === "length" || n in t) continue;
+        delete e[n];
+    }
 }
 
 // ---- optimistic-only store machinery (moved from next/store.ts /
@@ -161,13 +441,18 @@ function createOptimisticStoreNext(e, t, n) {
  * overrides — the same view the draft was seeded from) and emit engine writes
  * for exactly the changed keys. Visible-view diffing keeps no-op writes from
  * entangling lanes (RUL-10 / opt R38). */ function notifyOptimisticWrites(e, t) {
-    // A bare write while the store's own truth is in flight rides THAT
-    // transaction (#2951, legacy parity): entangle the firewall's transition so
-    // the override survives until the refetch settles instead of flash-reverting
+    // A bare write while the store's own truth is in flight rides the FLIGHT'S
+    // OWN transaction (#2951 via the #3146 declaration): entangle it so the
+    // override survives until the refetch settles instead of flash-reverting
     // at plain flush end. The blocked-check store-half keeps that transaction
-    // from settling while the firewall is pending.
-    const n = e.fam?.node;
-    if (n?._e) globalQueue.initTransition(n._e);
+    // from settling while the firewall is pending. Declared ownership replaces
+    // the old circumstantial route through the firewall's `_transition` stamp,
+    // which was whatever last brushed the node.
+    const n = e.fam?.ft;
+    if (n != null) {
+        const e = liveTransition(n);
+        if (e !== null) globalQueue.initTransition(e);
+    }
     const i = e.v;
     // Patch channel (override-application site): the draft IS the intended
     // visible state; prev is the view before these overrides apply. Bypasses
@@ -186,26 +471,26 @@ function createOptimisticStoreNext(e, t, n) {
     }
     const visible = (t, n) => {
         const i = e.n?.[t];
-        return i !== undefined && hasActiveOverride(i) ? unwrapOverride(i.o?.De) : n;
+        return i !== undefined && hasActiveOverride(i) ? unwrapOverride(i.o?.Pe) : n;
     };
     const visiblePresent = t => {
         const n = e.h?.[t];
-        return n !== undefined && hasActiveOverride(n) ? !!unwrapOverride(n.o?.De) : t in i;
+        return n !== undefined && hasActiveOverride(n) ? !!unwrapOverride(n.o?.Pe) : t in i;
     };
     let o = false;
     const r = Array.isArray(t);
     for (const n of Reflect.ownKeys(t)) {
         if (r && n === "length") continue;
-        const s = unwrapValue(t[n]);
+        const l = unwrapValue(t[n]);
         if (!visiblePresent(n)) {
             // Optimistic add: value node + presence node + membership bump.
-            setSignal(getNode(e, n, i[n]), () => s);
+            setSignal(getNode(e, n, i[n]), () => l);
             setSignal(getHasNode(e, n, n in i), true);
             o = true;
         } else {
             const t = visible(n, i[n]);
-            if (!isEqual(t, s) && !targetsEqual(t, s)) {
-                setSignal(getNode(e, n, t), () => s);
+            if (!isEqual(t, l) && !targetsEqual(t, l)) {
+                setSignal(getNode(e, n, t), () => l);
                 if (r) o = true;
             }
         }
@@ -230,95 +515,22 @@ function createOptimisticStoreNext(e, t, n) {
     // (structural ones already ride the key-set bump above).
         bumpDeep(e);
     // Discard the draft — committed raw is untouched (revert target by
-    // construction). Register the root store for the scheduler's settle hooks
-    // and the target for landing consumption (RUL-2).
-        e.pb = null;
+    // construction) — restoring any truth-staged backing this draft displaced
+    // (#3164 fold: ensurePB parked it so tentative writes could not pollute
+    // staged truth). Register the root store for the scheduler's settle hooks.
+        e.pb = stagedTruthPB.get(e) ?? null;
+    if (e.pb !== null) stagedTruthPB.delete(e);
     (e.fam.overlaid ??= new Set).add(e);
-    GlobalQueue.An?.(e.fam.px ?? e.px);
-}
-
-/**
- * Landing consumption (RUL-2): fresh authoritative data supersedes every
- * tentative override in the family. Mirrors legacy clearProjectionOverride —
- * drop the override, clear lane/ownership, notify subscribers whose visible
- * value changes (reversion effects go to regular queues via the projection
- * write posture the caller holds).
- */ function consumeOverridesNext(e) {
-    const t = e.overlaid;
-    if (t === undefined || t.size === 0) return;
-    runAuthoritative(() => {
-        for (const e of t) {
-            const drop = (e, t) => {
-                if (!hasActiveOverride(e)) return;
-                const n = unwrapOverride(e.o?.De);
-                // Full legacy reset (clearOptimisticOverride parity): the landing is
-                // authoritative NOW — fold committed into the node directly instead
-                // of riding a transaction's commit (whose queues may be stashed with
-                // the transaction parked; the wake would strand until it settles).
-                                ext(e).De = NOT_PENDING;
-                e.T |= CONFIG_OPTIMISTIC;
-                const i = e.o;
-                if (i) {
-                    i.Nt = null;
-                    i.Be = undefined;
-                }
-                e.Pe = NOT_PENDING;
-                e.be = t;
-                if (!e.Ue || !e.Ue(n, t)) {
-                    insertSubs(e, true);
-                    schedule();
-                }
-            };
-            // Landing consumes STRUCTURAL optimism only (legacy layer parity):
-            // membership edits, array length, and the value overrides written WITH
-            // them (a key carrying an active presence override is an add/delete —
-            // classified BEFORE the adoption may have made the key exist in landed
-            // data). A pure value override on a key the landing carries stays with
-            // its owning transaction (rapid-toggle contract: a live action's edit
-            // of an existing entity rides on top of landed truth).
-                        const t = Array.isArray(e.v);
-            const n = e.h;
-            let i = null;
-            if (n !== null) {
-                for (const e of Reflect.ownKeys(n)) {
-                    if (hasActiveOverride(n[e])) (i ??= new Set).add(e);
-                }
-            }
-            const o = e.n;
-            if (o !== null) {
-                for (const n of Reflect.ownKeys(o)) {
-                    const r = i?.has(n) || !(n in e.v) || t && n === "length";
-                    if (!r) continue;
-                    drop(o[n], t && n === "length" ? e.v.length : e.v[n]);
-                }
-            }
-            if (n !== null) {
-                for (const t of Reflect.ownKeys(n)) drop(n[t], t in e.v);
-            }
-            if (e.k !== null && hasActiveOverride(e.k)) {
-                ext(e.k).De = NOT_PENDING;
-                e.k.T |= CONFIG_OPTIMISTIC;
-                const t = e.k.o;
-                if (t) {
-                    t.Nt = null;
-                    t.Be = undefined;
-                }
-                insertSubs(e.k, true);
-                schedule();
-            }
-            // Patch channel (override-consumption site): visible truth flipped to
-            // committed for the consumed keys — force a re-apply from the live
-            // view so the DOM leaves the override state.
-                        if (e.pc !== null && e.pc.p !== null) patchHooks.emitPatchOptimistic(e, null, null);
-        }
-        t.clear();
-    });
+    GlobalQueue._n?.(e.fam.px ?? e.px);
 }
 
 /** Optimistic-view composition for snapshot/deep (O1: snapshot is the CURRENT
  * view, lane values included; a fresh copy per call during pending windows —
- * RUL-12). Returns `src` untouched when no override is active on `t`. */ function optimisticView(e, t) {
-    if (e.fam?.opt !== true) return t;
+ * RUL-12). Returns `src` untouched when no override is active on `t`.
+ * Authoritative-view reads (until()'s predicate) skip composition entirely:
+ * the predicate observes authoritative truth, never the caller's tentative
+ * overlay. (Write-side emission callers never run under such a compute.) */ function optimisticView(e, t) {
+    if (e.fam?.opt !== true || authoritativeRead()) return t;
     let n = null;
     const ensure = () => n ??= Array.isArray(t) ? [ ...t ] : {
         ...t
@@ -328,7 +540,7 @@ function createOptimisticStoreNext(e, t, n) {
         for (const e of Reflect.ownKeys(i)) {
             const n = i[e];
             if (!hasActiveOverride(n)) continue;
-            const o = unwrapOverride(n.o?.De);
+            const o = unwrapOverride(n.o?.Pe);
             if (e === "length" && Array.isArray(t)) {
                 if (t.length !== o) ensure().length = o;
             } else if (!isEqual(t[e], o)) ensure()[e] = o;
@@ -339,7 +551,7 @@ function createOptimisticStoreNext(e, t, n) {
         for (const e of Reflect.ownKeys(o)) {
             const i = o[e];
             if (!hasActiveOverride(i)) continue;
-            const r = !!unwrapOverride(i.o?.De);
+            const r = !!unwrapOverride(i.o?.Pe);
             if (!r && e in (n ?? t)) delete ensure()[e];
         }
     }
@@ -350,11 +562,11 @@ function applyTentative(e, t, n) {
     const i = e.pb ?? e.v;
     const o = optimisticView(e, i);
     const r = e.fam.map;
-    const s = Array.isArray(t);
-    if (Array.isArray(o) !== s) return;
+    const l = Array.isArray(t);
+    if (Array.isArray(o) !== l) return;
  // kind change at root: flat overrides below
-        const l = [];
-    const u = s ? [ ...t ] : shallowWithSymbols(t);
+        const s = [];
+    const u = l ? [ ...t ] : shallowWithSymbols(t);
     const match = (e, t) => {
         if (!isWrappable(e) || !isWrappable(t)) return null;
         if (rawValuesUsed && (isRawValue(e) || isRawValue(t))) return null;
@@ -368,13 +580,13 @@ function applyTentative(e, t, n) {
         }
         return r.get(unwrapValue(e)) ?? null;
     };
-    if (s) {
+    if (l) {
         const e = o;
         let i = null;
         for (let o = 0; o < t.length; o++) {
             const r = t[o];
             if (!isWrappable(r)) continue;
-            let s;
+            let l;
             if (n) {
                 const t = n(r);
                 if (t !== undefined) {
@@ -394,20 +606,20 @@ function applyTentative(e, t, n) {
                         }
                     }
                     const o = i.get(t);
-                    if (o === undefined) s = undefined; else if (Array.isArray(o)) {
-                        s = unwrapValue(e[o.shift()]);
+                    if (o === undefined) l = undefined; else if (Array.isArray(o)) {
+                        l = unwrapValue(e[o.shift()]);
                         if (o.length === 1) i.set(t, o[0]);
                     } else {
-                        s = unwrapValue(e[o]);
+                        l = unwrapValue(e[o]);
                         i.delete(t);
                     }
-                } else s = unwrapValue(e[o]);
-            } else s = unwrapValue(e[o]);
-            const c = match(s, r);
-            if (c !== null) {
+                } else l = unwrapValue(e[o]);
+            } else l = unwrapValue(e[o]);
+            const a = match(l, r);
+            if (a !== null) {
                 // Keep the existing row in the slot (identity preserved); recurse.
-                u[o] = unwrapValue(s);
-                l.push([ c, r ]);
+                u[o] = unwrapValue(l);
+                s.push([ a, r ]);
             }
         }
     } else {
@@ -417,17 +629,17 @@ function applyTentative(e, t, n) {
             const r = match(n, i);
             if (r !== null) {
                 u[e] = n;
-                l.push([ r, i ]);
+                s.push([ r, i ]);
             }
         }
     }
     // Flat overrides for this level (adds, removals, moved slots, length, leaf
     // values) — preserve any live user draft backing across the call.
-        const c = e.pb;
+        const a = e.pb;
     e.pb = null;
     notifyOptimisticWrites(e, u);
-    e.pb = c;
-    for (let e = 0; e < l.length; e++) applyTentative(l[e][0], unwrapValue(l[e][1]), n);
+    e.pb = a;
+    for (let e = 0; e < s.length; e++) applyTentative(s[e][0], unwrapValue(s[e][1]), n);
 }
 
 function shallowWithSymbols(e) {
@@ -436,4 +648,4 @@ function shallowWithSymbols(e) {
     return t;
 }
 
-export { consumeOverridesNext, createOptimisticStoreNext, notifyOptimisticWrites, optimisticView };
+export { createOptimisticStoreNext, notifyOptimisticWrites, optimisticView, transitionHoldsOptimism };