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

package/dist/prod/core/core.js

@@ -1,6 +1,6 @@
-import { releaseFlightTeardown, handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settleErroredDependents, settlePendingSource } from "./async.js";
+import { releaseFlightTeardown, handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settlePendingSource, settleErroredDependents } from "./async.js";
 
-import { EFFECT_TRACKED, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_OPTIMISTIC, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, STATUS_PENDING, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, CONFIG_HAS_LANE, REACTIVE_MISSED_WAKE, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, CONFIG_DIRECT_COMMIT, OVERRIDE_UNDEFINED, CONFIG_AUTHORITATIVE_OBSERVED, CONFIG_HAS_COMPANIONS, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, CONFIG_FRESH_READ, CONFIG_AUTHORITATIVE_READ, CONFIG_HELD_TRUTH, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, defaultContext, CONFIG_IN_SNAPSHOT_SCOPE, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, CONFIG_FW_CHILDREN, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, REACTIVE_MANUAL_WRITE, STORE_SNAPSHOT_PROPS, EFFECT_USER } from "./constants.js";
+import { EFFECT_TRACKED, EFFECT_USER, REACTIVE_OPTIMISTIC_DIRTY, CONFIG_OPTIMISTIC, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, CONFIG_HAS_LANE, STATUS_PENDING, REACTIVE_MISSED_WAKE, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, CONFIG_DIRECT_COMMIT, OVERRIDE_UNDEFINED, CONFIG_AUTHORITATIVE_OBSERVED, CONFIG_HAS_COMPANIONS, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, CONFIG_CHILDREN_FORBIDDEN, CONFIG_FRESH_READ, CONFIG_AUTHORITATIVE_READ, CONFIG_HELD_TRUTH, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, defaultContext, CONFIG_IN_SNAPSHOT_SCOPE, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, CONFIG_FW_CHILDREN, NO_SNAPSHOT, CONFIG_HAS_SNAPSHOT, REACTIVE_MANUAL_WRITE, CONFIG_SLOT_NODE, STORE_SNAPSHOT_PROPS } from "./constants.js";
 
 import { NotReadyError } from "./error.js";
 
@@ -14,9 +14,23 @@ import "./invariants.js";
 
 import { disposeChildren, markDisposal, inheritId } from "./owner.js";
 
-GlobalQueue.Fe = recompute;
+// The heap's per-node step. A tracked effect's heap visit is its compute
+// phase — empty, like a user effect whose compute reads nothing — and hands
+// the callback to the user queue. Routing the wake through the heap, rather
+// than straight into the queue at notify time, is what orders the run after
+// the commit regardless of which phase the write came from: a write in a
+// render-effect callback stages its value for the next pass, but a wake pushed
+// directly into the user queue ran in the SAME pass, read the old value, and
+// nothing re-notified it when the value landed (#3291).
+GlobalQueue.Fe = e => {
+    if (e.ge === EFFECT_TRACKED) {
+        deleteFromHeap(e, queueFor(e));
+        e.He = true;
+        e.C.enqueue(EFFECT_USER, e.Ve);
+    } else recompute(e);
+};
 
-GlobalQueue.He = disposeChildren;
+GlobalQueue.ke = disposeChildren;
 
 let tracking = false;
 
@@ -48,8 +62,8 @@ let snapshotSources = null;
 
 function ownerInSnapshotScope(e) {
     while (e) {
-        if (e.Ve) return true;
-        e = e.ke;
+        if (e.xe) return true;
+        e = e.Le;
     }
     return false;
 }
@@ -60,20 +74,20 @@ function setSnapshotCapture(e) {
 }
 
 function markSnapshotScope(e) {
-    e.Ve = true;
+    e.xe = true;
 }
 
 function releaseSnapshotScope(e) {
-    e.Ve = false;
+    e.xe = false;
     releaseSubtree(e);
     schedule();
 }
 
 function releaseSubtree(e) {
-    let t = e.xe;
+    let t = e.Qe;
     while (t) {
-        if (t.Ve) {
-            t = t.Le;
+        if (t.xe) {
+            t = t.We;
             continue;
         }
         if (t.oe) {
@@ -82,19 +96,19 @@ function releaseSubtree(e) {
             if (e.ie & REACTIVE_SNAPSHOT_STALE) {
                 e.ie &= ~REACTIVE_SNAPSHOT_STALE;
                 e.ie |= REACTIVE_DIRTY;
-                if (dirtyQueue.Qe > e.Me) dirtyQueue.Qe = e.Me;
+                if (dirtyQueue.Me > e.qe) dirtyQueue.Me = e.qe;
                 insertIntoHeap(e, dirtyQueue);
             }
         }
         releaseSubtree(t);
-        t = t.Le;
+        t = t.We;
     }
 }
 
 function clearSnapshots() {
     if (snapshotSources) {
         for (const e of snapshotSources) {
-            delete e.o?.We;
+            delete e.o?.Ye;
             // StoreNode targets share one pre-initialized hidden class (see
             // createStoreProxy) — assign undefined instead of deleting, and only
             // when present so signal-node sources don't grow the field.
@@ -108,7 +122,7 @@ function clearSnapshots() {
 function recompute(e, t = false) {
     // §12d: any recompute can clean a marked subscriber — invalidate skips.
     bumpNotifyEpoch();
-    const n = e.he;
+    const n = e.ge;
     if (!t) {
         if (e.Ae && (!n || activeTransition) && activeTransition !== e.Ae) globalQueue.initTransition(e.Ae);
         deleteFromHeap(e, queueFor(e));
@@ -122,18 +136,18 @@ function recompute(e, t = false) {
                         releaseFlightTeardown(e);
         }
         // Tracked effects run after finalizePureQueue, so dispose immediately instead of deferring
-                if (e.Ae || n === EFFECT_TRACKED) disposeChildren(e); else if (e.xe !== null || e.pe !== null) {
+                if (e.Ae || n === EFFECT_TRACKED) disposeChildren(e); else if (e.Qe !== null || e.Ge !== null) {
             markDisposal(e);
             const t = ext(e);
-            t.qe = e.pe;
-            t.Ye = e.xe;
-            e.pe = null;
-            e.xe = null;
-            e.Ze = 0;
+            t.Ze = e.Ge;
+            t.Ke = e.Qe;
+            e.Ge = null;
+            e.Qe = null;
+            e.je = 0;
         } else ;
     }
     let i = !!(e.ie & REACTIVE_OPTIMISTIC_DIRTY);
-    const u = (e.T & CONFIG_OPTIMISTIC) !== 0 && e.o?.Oe !== NOT_PENDING && e.o?.Oe !== undefined;
+    const u = (e.T & CONFIG_OPTIMISTIC) !== 0 && e.o?.Pe !== NOT_PENDING && e.o?.Pe !== undefined;
     const l = !!(e.S & STATUS_UNINITIALIZED);
     // Outgoing error, captured before the compute clears status: if this run
     // recovers to an unchanged value, dependents still holding this object must
@@ -145,7 +159,7 @@ function recompute(e, t = false) {
     // settles synchronously, those dependents settle HERE — asyncWrite's
     // settlePendingSource walk never runs for a landing that was preempted
     // (#3181).
-        const s = (e.S & STATUS_PENDING) !== 0 && e.o?.le?.has(e) === true;
+        const s = e.o?.le?.has(e);
     // Re-ask classification lives in the verdict module; capture the flag before
     // the recompute wipes _flags below.
         const a = (e.ie & REACTIVE_REASK) !== 0;
@@ -154,14 +168,14 @@ function recompute(e, t = false) {
     // commits (commitPendingNode) — a closed window plus a held value reads as
     // a pending frame to live observers of the verdict (#2990).
         const r = e.Ne;
-    const c = context;
+    const _ = context;
     context = e;
-    e.je = null;
-    e.Ke++;
+    e.Be = null;
+    e.ze++;
     e.ie = REACTIVE_RECOMPUTING_DEPS;
     e.Te = clock;
-    let _ = e.Pe === NOT_PENDING ? e.be : e.Pe;
-    let f = e.Me;
+    let c = e.Re === NOT_PENDING ? e.be : e.Re;
+    let f = e.qe;
     let I = false;
     let E = tracking;
     let N = currentOptimisticLane;
@@ -178,17 +192,17 @@ function recompute(e, t = false) {
     // engine-driven paths, and _optimisticNodes is only pushed by
     // _optimisticWrite, so the hook is installed whenever either gate holds.
         if (i) {
-        const t = GlobalQueue.Be(e, true);
+        const t = GlobalQueue.Je(e, true);
         if (t) currentOptimisticLane = t;
         // `false` = wake-only lane demotion: recompute plain so a mid-tick
         // latest()/isPending() pull stages instead of direct-committing (#3009).
         // The predicate lives with the engine (recomputeLane).
          else if (t === false) i = false;
-    } else if (activeTransition && !t && activeTransition.ze.length) {
+    } else if (activeTransition && !t && activeTransition.Xe.length) {
         // Lane adoption: parent-deeper-than-owned-child can run before its OPT-dirty
         // child propagates. Walk deps once and inherit the OPT lane so this node
         // recomputes under the right posture and propagates correctly.
-        const t = GlobalQueue.Be(e, false);
+        const t = GlobalQueue.Je(e, false);
         if (t) {
             i = true;
             currentOptimisticLane = t;
@@ -199,7 +213,7 @@ function recompute(e, t = false) {
     if (S) stale = true;
     try {
         if (!false && e.T & CONFIG_SYNC) {
-            _ = e.oe(_);
+            c = e.oe(c);
             if (e.o !== null) e.o.Ie = null;
             e.Ne = false;
         } else {
@@ -209,10 +223,10 @@ function recompute(e, t = false) {
             // clobber the fresh subscription, so we skip it and let the internally-registered
             // iteration drive updates.
             const t = e.o?.Ie;
-            const n = e.oe(_);
+            const n = e.oe(c);
             const i = typeof n === "object" && n !== null;
             const u = e.o?.Ie !== t;
-            _ = u || !i ? n : handleAsync(e, n);
+            c = u || !i ? n : handleAsync(e, n);
             if (!u && !i) {
                 if (e.o !== null) e.o.Ie = null;
                 // A sync (non-object) return is the first real answer; async-shaped
@@ -229,7 +243,7 @@ function recompute(e, t = false) {
                 if (e.S !== 0 || e.o !== null) clearStatus(e, t);
         // _optimisticLane is only ever assigned by engine paths (CONFIG_HAS_LANE
         // is their sticky presence mark).
-                if (e.T & CONFIG_HAS_LANE && e.o?.Je) GlobalQueue.Xe(e);
+                if (e.T & CONFIG_HAS_LANE && e.o?.$e) GlobalQueue.et(e);
     } catch (t) {
         const n = t instanceof NotReadyError;
         if (n && e.Ne) {
@@ -244,13 +258,16 @@ function recompute(e, t = false) {
         } else {
             // Track pending async in the lane (not the lane's source — it creates the lane
             // but doesn't belong to it). Set lane BEFORE notifyStatus for downstream propagation.
-            if (n && currentOptimisticLane) GlobalQueue.$e(e);
+            if (n && currentOptimisticLane) GlobalQueue.tt(e);
             let i = false;
             if (n) {
                 ext(e).fe = true;
-                if (GlobalQueue.et !== null) i = GlobalQueue.et(e, a);
+                if (GlobalQueue.nt !== null) i = GlobalQueue.nt(e, a);
             }
-            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.o?.Je : undefined);
+            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.o?.$e : undefined);
+            // The replacement source is fully propagated now. If no new flight
+            // re-owned self, retire the superseded flight and its dependent copies.
+                        if (n && s && !e.o?.Ie) settlePendingSource(e);
             if (i) GlobalQueue.k(e);
         }
     } finally {
@@ -264,14 +281,14 @@ function recompute(e, t = false) {
         // bookkeeping, and those marks are correctly discarded here.
                 I = (e.ie & REACTIVE_MISSED_WAKE) !== 0;
         e.ie = REACTIVE_NONE | (t ? e.ie & REACTIVE_SNAPSHOT_STALE : 0);
-        context = c;
+        context = _;
     }
     if (!e.o?._) {
         trimStaleDeps(e);
-        const a = u ? unwrapOverride(e.o?.Oe) : e.Pe === NOT_PENDING ? e.be : e.Pe;
-        let c = false;
+        const a = u ? unwrapOverride(e.o?.Pe) : e.Re === NOT_PENDING ? e.be : e.Re;
+        let _ = false;
         try {
-            c = !n && l || !e.ge || !e.ge(a, _);
+            _ = !n && l || !e.pe || !e.pe(a, c);
         } catch (t) {
             // A throwing user comparator is an error of this node's computation.
             // Route it through the same status path as a compute-phase throw so
@@ -284,14 +301,14 @@ function recompute(e, t = false) {
         // its runner — happen here instead. `!create` matches the previous `initialized`
         // gate: the explicit recompute(node, true) inside effect() does not enqueue, so
         // effect() can call its runner synchronously for the first run.
-                if (n && c) {
-            e.tt = !e.o?._;
+                if (n && _) {
+            e.He = !e.o?._;
             // Reuse one bound runner per effect — runEffect no-ops on a stale
             // `_modified`, so re-enqueueing the same function is harmless.
-                        if (!t) e.C.enqueue(n, e.nt ??= GlobalQueue.it.bind(null, e));
+                        if (!t) e.C.enqueue(n, e.it ??= GlobalQueue.ut.bind(null, e));
         }
-        if (e.o?._) ; else if (c) {
-            const l = u ? e.o?.Oe : undefined;
+        if (e.o?._) ; else if (_) {
+            const l = u ? e.o?.Pe : undefined;
             if (t || 
             // Plain sync flush (no transition on either side) commits effect
             // values directly — the pending round-trip (queuePendingNode +
@@ -302,17 +319,17 @@ function recompute(e, t = false) {
             // not the stashed queues, so a staged value would hand the immediate
             // apply stale state — see CONFIG_DIRECT_COMMIT.
             n && (activeTransition !== e.Ae || activeTransition === null || e.T & CONFIG_DIRECT_COMMIT) || i) {
-                e.be = _;
+                e.be = c;
                 // Lane-propagated correction: upstream data is fresh, correct the
                 // override unconditionally. The direct _value commit is the lane's
                 // own reveal schedule; drop any superseded older hold so its queued
                 // commit can't clobber the fresh value.
                                 if (u && i) {
-                    ext(e).Oe = _ === undefined ? OVERRIDE_UNDEFINED : _;
-                    e.Pe = NOT_PENDING;
+                    ext(e).Pe = c === undefined ? OVERRIDE_UNDEFINED : c;
+                    e.Re = NOT_PENDING;
                 }
             } else {
-                e.Pe = _;
+                e.Re = c;
                 // A window landing that gets held re-opens the window until the hold
                 // commits — the verdict's held-value branch is window-gated (#2990).
                                 if (r) e.Ne = true;
@@ -321,26 +338,26 @@ function recompute(e, t = false) {
                 // (#2831). Both companion writes are transition-scoped (optimistic) and
                 // auto-revert/re-derive at commit. Skipped for plain flushes where the
                 // pending value commits before effects run.
-                                if ((activeTransition || e.Ae) && GlobalQueue.Re !== null) GlobalQueue.Re(e, _);
+                                if ((activeTransition || e.Ae) && GlobalQueue.Ue !== null) GlobalQueue.Ue(e, c);
             }
             // insertSubs only walks _subs (no scheduling of its own), so a
             // subscriber-less node has nothing to notify.
-                        if (e.u !== null && (!u || i || e.o?.Oe !== l)) insertSubs(e, i || u);
+                        if (e.u !== null && (!u || i || e.o?.Pe !== l)) insertSubs(e, i || u);
         } else if (u) {
             // Unchanged value (equals the override) recomputed while the override
             // is active: _value may still be stale, so hold the authoritative value
             // for commit on its own transition's schedule — invisibly (A17/A18).
-            if (e.Pe === NOT_PENDING) queuePendingNode(e);
-            e.Pe = _;
+            if (e.Re === NOT_PENDING) queuePendingNode(e);
+            e.Re = c;
             if (r) e.Ne = true;
  // see the held branch above (#2990)
-            // A authoritative-view reader (until()) observed this node past its
-            // override — and "authoritative arrival equal to the override" is
-            // exactly the acknowledgment it waits for. Wake those readers only;
-            // A17 silence holds for every ordinary subscriber. (Hook installed by
-            // until(), the only setter of the gating bit.)
-                        if (e.T & CONFIG_AUTHORITATIVE_OBSERVED) GlobalQueue.Ue(e);
-        } else if (e.Me != f) {
+            // An authoritative-view reader (until()'s predicate, refresh()'s waiter)
+            // observed this node past its override — and "authoritative arrival
+            // equal to the override" is exactly the acknowledgment it waits for.
+            // Wake those readers only; A17 silence holds for every ordinary
+            // subscriber. (Hook installed by both setters of the gating bit, #3303.)
+                        if (e.T & CONFIG_AUTHORITATIVE_OBSERVED) GlobalQueue.he(e);
+        } else if (e.qe != f) {
             for (let t = e.u; t !== null; t = t.ae) {
                 insertIntoHeapHeight(t.ce, queueFor(t.ce));
             }
@@ -350,21 +367,14 @@ function recompute(e, t = false) {
         // in an errored run and may sit on stale commits (#2949). Changed-value
         // recoveries ride insertSubs above; a comparator throw re-errored the node
         // (el._x?._error re-set), so this only runs on a genuinely clean recovery.
-                if (o !== undefined && !c && !e.o?._) settleErroredDependents(e, o);
-        // Pending twin of the sweep above (#3181): a flight superseded by this
-        // synchronous settle leaves every registered dependent still flagged
-        // STATUS_PENDING with a pending source that will never land — asyncWrite
-        // owns the walk only for flights that actually land. An unchanged value
-        // is the dangerous shape (a projection reconciling in place: a memo over
-        // it re-throws its cached NotReadyError forever, and every reader that
-        // suspended through that memo re-parks on the dead source), but the walk
-        // runs on the changed shape too, exactly as the landing path does —
-        // insertSubs notifies value SUBSCRIBERS, not pending REGISTRANTS, and
-        // the two sets only partially overlap.
-                if (s && !(e.S & STATUS_PENDING)) settlePendingSource(e);
+                if (o !== undefined && !_ && !e.o?._) settleErroredDependents(e, o);
+        // #3181: a synchronous settle supersedes the old landing callback, so
+        // recompute owns its pending-source sweep. An uninitialized node without
+        // a replacement source still has no truth to reveal and must stay parked.
+                if (s && !(e.S & (STATUS_PENDING | STATUS_UNINITIALIZED))) settlePendingSource(e);
     }
     currentOptimisticLane = N;
-    const A = e.Pe !== NOT_PENDING || e.o !== null && (e.o.Ye !== null || e.o.qe !== null) || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
+    const A = e.Re !== NOT_PENDING || e.o !== null && (e.o.Ke !== null || e.o.Ze !== null) || (e.S & (STATUS_PENDING | STATUS_UNINITIALIZED)) !== 0;
     // Override-covered holds (hasOverride) always queue: their commit belongs
     // to their own transition's schedule (A18 re-rule) and is unobservable
     // under the override (A17). Revert no longer commits anything, so an
@@ -392,9 +402,9 @@ function updateIfNecessary(e) {
     // would resurrect it (#2983) — readers serve its last value.
     if (e.ie & (REACTIVE_RECOMPUTING_DEPS | REACTIVE_DISPOSED)) return;
     if (e.ie & REACTIVE_CHECK) {
-        for (let t = e.ut; t; t = t.lt) {
-            const n = t.ot;
-            const i = n.st || n;
+        for (let t = e.lt; t; t = t.ot) {
+            const n = t.st;
+            const i = n.rt || n;
             if (i.oe) {
                 updateIfNecessary(i);
             }
@@ -418,32 +428,32 @@ function computed(e, t) {
     const u = {
         id: inheritId(t, n, context),
         T: (n ? CONFIG_TRANSPARENT : 0) | (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (!context || t?.lazy ? CONFIG_AUTO_DISPOSE : 0) | (t?.sync ? CONFIG_SYNC : 0) | (t?.H ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        ge: t?.equals ?? isEqual,
-        pe: null,
+        pe: t?.equals ?? isEqual,
+        Ge: null,
         C: context?.C ?? globalQueue,
         we: context?.we ?? defaultContext,
-        Ze: 0,
+        je: 0,
         oe: e,
         be: i ? t.loadingValue : undefined,
-        Me: 0,
-        rt: undefined,
+        qe: 0,
+        _t: undefined,
         ct: null,
-        ut: null,
-        je: null,
-        Ke: 0,
+        lt: null,
+        Be: null,
+        ze: 0,
         u: null,
-        _t: null,
-        ke: context,
-        Le: null,
         ft: null,
-        xe: null,
+        Le: context,
+        We: null,
+        It: null,
+        Qe: null,
         ie: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
         // A loadingValue node is born committed: commit #0 is already in _value.
         S: i ? 0 : STATUS_UNINITIALIZED,
         Te: clock,
-        Pe: NOT_PENDING,
+        Re: NOT_PENDING,
         Ae: null,
-        It: -1,
+        Et: -1,
         Ne: i,
         // Cold machinery (async/transition/optimistic/verdict slots) lives one
         // hop away in the lazily-allocated extension — the core literal MUST
@@ -451,7 +461,7 @@ function computed(e, t) {
         // allocation spills to a backing store and creation cost ~4x's).
         o: null
     };
-    if (t?.unobserved) ext(u).Et = t.unobserved;
+    if (t?.unobserved) ext(u).Nt = t.unobserved;
     setupComputedNode(u, t);
     return u;
 }
@@ -461,12 +471,12 @@ function computed(e, t) {
  * this; hot paths read `el._x?._field` gated by the _config presence bits.
  * Never call ext() just to store a field's default. */ function ext(e) {
     return e.o ??= {
-        Oe: undefined,
-        Nt: undefined,
-        Je: undefined,
+        Pe: undefined,
+        Tt: undefined,
+        $e: undefined,
         ye: undefined,
         Ce: undefined,
-        Tt: undefined,
+        St: undefined,
         t: 0,
         Ie: null,
         Ee: null,
@@ -474,13 +484,13 @@ function computed(e, t) {
         fe: undefined,
         le: undefined,
         h: undefined,
-        Ge: false,
+        De: false,
         i: null,
-        Et: undefined,
-        We: undefined,
-        qe: null,
-        Ye: null,
-        St: undefined
+        Nt: undefined,
+        Ye: undefined,
+        Ze: null,
+        Ke: null,
+        dt: undefined
     };
 }
 
@@ -493,39 +503,39 @@ function computed(e, t) {
     const l = u?.transparent ?? false;
     const o = {
         id: inheritId(u, l, context),
-        T: (l ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (u?.dt ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
-        ge: false,
-        pe: null,
+        T: (l ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (u?.At ?? 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        pe: false,
+        Ge: null,
         C: context?.C ?? globalQueue,
         we: context?.we ?? defaultContext,
-        Ze: 0,
+        je: 0,
         oe: e,
         be: undefined,
-        Me: 0,
-        rt: undefined,
+        qe: 0,
+        _t: undefined,
         ct: null,
-        ut: null,
-        je: null,
-        Ke: 0,
+        lt: null,
+        Be: null,
+        ze: 0,
         u: null,
-        _t: null,
-        ke: context,
-        Le: null,
         ft: null,
-        xe: null,
+        Le: context,
+        We: null,
+        It: null,
+        Qe: null,
         ie: REACTIVE_LAZY,
         S: STATUS_UNINITIALIZED,
         Te: clock,
-        Pe: NOT_PENDING,
+        Re: NOT_PENDING,
         Ae: null,
-        It: -1,
+        Et: -1,
         Ne: false,
-        tt: false,
-        At: undefined,
-        Ot: t,
-        Ct: n,
-        Rt: undefined,
-        he: i,
+        He: false,
+        Ot: undefined,
+        Ct: t,
+        Rt: n,
+        Gt: undefined,
+        ge: i,
         o: null
     };
     // Effects dispatch status through the SHARED notifier (statusNotifierOf,
@@ -533,7 +543,7 @@ function computed(e, t) {
     // allocation on EVERY effect at creation (an alloc + 19 field stores,
     // +23% effect creation, caught by the creation benches). Only genuinely
     // per-node channels (boundaries) live on _x.
-        if (u?.unobserved) ext(o).Et = u.unobserved;
+        if (u?.unobserved) ext(o).Nt = u.unobserved;
     setupComputedNode(o, lazyOptions);
     return o;
 }
@@ -556,7 +566,7 @@ function setEffectStatusNotify(e) {
  * per-node field did when every effect carried one. */ function statusNotifierOf(e) {
     const t = e.o?.h;
     if (t !== undefined) return t;
-    return e.he ? effectStatusNotify ?? undefined : undefined;
+    return e.ge ? effectStatusNotify ?? undefined : undefined;
 }
 
 const lazyOptions = {
@@ -565,23 +575,23 @@ const lazyOptions = {
 
 function setupComputedNode(e, t) {
     e.ct = e;
-    const n = context?.Gt ? context.Dt : context;
+    const n = context?.Dt ? context.Pt : context;
     if (context) {
-        const t = context.xe;
+        const t = context.Qe;
         if (t === null) {
-            context.xe = e;
+            context.Qe = e;
         } else {
-            e.Le = t;
-            t.ft = e;
-            context.xe = e;
+            e.We = t;
+            t.It = e;
+            context.Qe = e;
         }
     }
-    if (n) e.Me = n.Me + 1;
-    if (GlobalQueue.Pt !== null) GlobalQueue.Pt(e);
+    if (n) e.qe = n.qe + 1;
+    if (GlobalQueue.Ft !== null) GlobalQueue.Ft(e);
     !t?.lazy && recompute(e, true);
     if (snapshotCaptureActive && !t?.lazy) {
         if (!(e.S & STATUS_PENDING) && !(e.T & CONFIG_NO_SNAPSHOT)) {
-            ext(e).We = e.be === undefined ? NO_SNAPSHOT : e.be;
+            ext(e).Ye = e.be === undefined ? NO_SNAPSHOT : e.be;
             e.T |= CONFIG_HAS_SNAPSHOT;
             snapshotSources.add(e);
         }
@@ -590,47 +600,99 @@ function setupComputedNode(e, t) {
 
 function signal(e, t, n = null) {
     const i = {
-        ge: t?.equals ?? isEqual,
+        pe: t?.equals ?? isEqual,
         T: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.H ? CONFIG_NO_SNAPSHOT : 0),
         be: e,
         u: null,
-        _t: null,
+        ft: null,
         Te: clock,
-        st: n,
+        rt: n,
         Se: n?.o?.i || null,
-        Pe: NOT_PENDING,
+        Re: NOT_PENDING,
         // Signal-literal diet (§12e): NO _time/_fn/_statusFlags slots. Stores
         // materialize one signal per touched leaf, so signal bytes are store
         // bytes. _time is write-only on signals (every read site is computed-
         // typed error-retry gating); _fn/_statusFlags read falsy-identically as
         // missing properties on the shared paths (undefined masks to 0).
         Ae: null,
-        It: -1,
+        Et: -1,
         o: null
     };
-    if (t?.unobserved) ext(i).Et = t.unobserved;
+    if (t?.unobserved) ext(i).Nt = t.unobserved;
     if (n) {
         ext(n).i = i;
         n.T |= CONFIG_FW_CHILDREN;
     }
     if (snapshotCaptureActive && !(i.T & CONFIG_NO_SNAPSHOT) && !((n?.S ?? 0) & STATUS_PENDING)) {
-        ext(i).We = e === undefined ? NO_SNAPSHOT : e;
+        ext(i).Ye = e === undefined ? NO_SNAPSHOT : e;
         i.T |= CONFIG_HAS_SNAPSHOT;
         snapshotSources.add(i);
     }
     return i;
 }
 
+// ---------------------------------------------------------------------------
+// SLOT SIGNALS (store leaves) — the create-floor diet. Store mounts
+// materialize one signal per touched leaf (~13 × rows on dbmon), so per-node
+// allocations are mount bytes: the generic path costs an options object, an
+// equals closure, an unobserved closure, a NodeExtension to hold it, and
+// three post-construction expandos (acc/px/pxv → hidden-class transitions).
+// slotSignal bakes everything into ONE literal: `_host`/`_key` backrefs
+// replace the closures (equals is a method call — `this` is the node; the
+// unobserved sweep dispatches CONFIG_SLOT_NODE to one shared hook), and the
+// store's wrap-cache fields are pre-shaped.
+/** The shared slot-node unobserved handler — a live binding read directly by
+ * the sweep sites (no wrapper frame, no null check: a CONFIG_SLOT_NODE node
+ * existing implies the store module loaded and registered the hook). */ let slotUnobservedHook;
+
+/** Install the shared slot-node unobserved handler (store module, once). */ function setSlotUnobserved(e) {
+    slotUnobservedHook = e;
+}
+
+function slotSignal(e, t, n, i, u, l = null) {
+    const o = {
+        pe: t,
+        T: CONFIG_OWNED_WRITE | CONFIG_SLOT_NODE,
+        be: e,
+        u: null,
+        ft: null,
+        Te: clock,
+        rt: l,
+        Se: l?.o?.i || null,
+        Re: NOT_PENDING,
+        Ae: null,
+        Et: -1,
+        o: null,
+        // Slot backrefs: what the equals/unobserved closures used to capture.
+        ht: n,
+        Ht: i,
+        // Store read-path caches, pre-shaped (were post-construction expandos).
+        acc: u,
+        px: undefined,
+        pxv: undefined
+    };
+    if (l) {
+        ext(l).i = o;
+        l.T |= CONFIG_FW_CHILDREN;
+    }
+    if (snapshotCaptureActive && !((l?.S ?? 0) & STATUS_PENDING)) {
+        ext(o).Ye = e === undefined ? NO_SNAPSHOT : e;
+        o.T |= CONFIG_HAS_SNAPSHOT;
+        snapshotSources.add(o);
+    }
+    return o;
+}
+
 function optimisticSignal(e, t) {
     const n = signal(e, t);
-    ext(n).Oe = NOT_PENDING;
+    ext(n).Pe = NOT_PENDING;
     n.T |= CONFIG_OPTIMISTIC;
     return n;
 }
 
 function optimisticComputed(e, t) {
     const n = computed(e, t);
-    ext(n).Oe = NOT_PENDING;
+    ext(n).Pe = NOT_PENDING;
     n.T |= CONFIG_OPTIMISTIC;
     return n;
 }
@@ -661,11 +723,11 @@ function isEqual(e, t) {
  * );
  * ```
  */ function untrack(e, t) {
-    if (GlobalQueue.ht === null && !tracking && true) return e();
+    if (GlobalQueue.gt === null && !tracking && true) return e();
     const n = tracking;
     tracking = false;
     try {
-        if (GlobalQueue.ht !== null) return GlobalQueue.ht(e);
+        if (GlobalQueue.gt !== null) return GlobalQueue.gt(e);
         return e();
     } finally {
         tracking = n;
@@ -722,28 +784,30 @@ function isEqual(e, t) {
         // itself have pulled this recompute (updateIfNecessary from its own
         // read), and the heap refuses RECOMPUTING nodes — latch so recompute's
         // tail reschedules it with the staged value visible.
-                if (e.ie & REACTIVE_RECOMPUTING_DEPS && t.Ft === e.Ke && t !== e.je) e.ie |= REACTIVE_MISSED_WAKE;
+                if (e.ie & REACTIVE_RECOMPUTING_DEPS && t.vt === e.ze && t !== e.Be) e.ie |= REACTIVE_MISSED_WAKE;
         enqueueSub(e);
     }
     schedule();
 }
 
-/** Installs the until() machinery hook. Idempotent; called by until() before
- * any authoritative-view read happens (same late-binding contract as the
- * optimistic engine). */ function installAuthoritativeRead() {
-    if (GlobalQueue.Ue === null) GlobalQueue.Ue = notifyAuthoritativeObservers;
+/** Installs the authoritative-reader wakeup hook. Idempotent; called by every
+ * creator of a CONFIG_AUTHORITATIVE_READ computation — until() and refresh() —
+ * before its first read (same late-binding contract as the optimistic engine;
+ * the gating bit is only ever set by such a read, so the `!` call sites are
+ * safe once every setter installs, #3303). */ function installAuthoritativeRead() {
+    if (GlobalQueue.he === null) GlobalQueue.he = notifyAuthoritativeObservers;
 }
 
 function readNodeFast(e) {
-    if (latestReadActive || pendingCheckActive || e.oe || e.st || e.o?.Oe !== undefined || e.o?.We !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
+    if (latestReadActive || pendingCheckActive || e.oe || e.rt || e.o?.Pe !== undefined || e.o?.Ye !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
     let t = context;
-    if (t?.Gt) t = t.Dt;
+    if (t?.Dt) t = t.Pt;
     if (t && tracking) link(e, t);
     // Children-forbidden readers (createTrackedEffect / onSettled callbacks) get
     // committed visibility: like the effect half of createEffect and event
     // handlers, effect-phase code never observes its own unsettled write — the
     // write lands in the same flush's continuation (#3006).
-        return !t || e.Pe === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Pe;
+        return !t || e.Re === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Re;
 }
 
 function read(e) {
@@ -751,30 +815,30 @@ function read(e) {
     // Checked before isPending so that isPending(() => latest(x)) checks
     // the _pendingSignal of _latestValueComputed (async in flight) rather
     // than the original node (which stays "pending" while held in a transition).
-    if (latestReadActive) return GlobalQueue.gt(e);
+    if (latestReadActive) return GlobalQueue.Vt(e);
     let t = context;
-    if (t?.Gt) t = t.Dt;
+    if (t?.Dt) t = t.Pt;
     const n = e;
-    const i = e.st;
+    const i = e.rt;
     const u = i || e;
     // Handle isPending() mode: collect pending state while preserving normal read semantics.
     // Probe mode is suspended while preparing the node so nested reads during a
     // recompute don't collect into the probe.
         if (pendingCheckActive) {
-        GlobalQueue.Ht(e, t, u, i);
+        GlobalQueue.bt(e, t, u, i);
     } else if (typeof n.oe === "function") {
         prepareComputed(e, false);
     }
-    if (!n.oe && u === e && e.o?.Oe === undefined && e.o?.We === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
+    if (!n.oe && u === e && e.o?.Pe === undefined && e.o?.Ye === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
         if (t && tracking) link(e, t);
         // Committed visibility for children-forbidden readers — see readNodeFast.
-                return !t || e.Pe === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Pe;
+                return !t || e.Re === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN ? e.be : e.Re;
     }
     if (t && tracking) {
         link(e, t, pendingCheckActive);
         if (u.oe) {
             const n = queueFor(e);
-            if (u.Me >= n.Qe) {
+            if (u.qe >= n.Me) {
                 markNode(t);
                 markHeap(n);
                 updateIfNecessary(u);
@@ -786,10 +850,10 @@ function read(e) {
             // node no-ops and updateIfNecessary refuses disposed nodes (#2983) —
             // a dead target serves its last value, which is already quiescent.
              else if (t.T & CONFIG_FRESH_READ) updateIfNecessary(u);
-            const i = u.Me;
+            const i = u.qe;
             // parent check is shallow, might need to be recursive
-                        if (i >= t.Me && e.ke !== t) {
-                t.Me = i + 1;
+                        if (i >= t.qe && e.Le !== t) {
+                t.qe = i + 1;
             }
         }
     }
@@ -797,8 +861,10 @@ function read(e) {
         if (t && !(stale && u.Ae && activeTransition !== u.Ae)) {
             // Per-lane suspension lives with the engine (a non-null lane implies it
             // is installed): under a lane, only same-lane pending async without an
-            // active override throws.
-            if (currentOptimisticLane === null || GlobalQueue.Vt(u)) {
+            // active override throws — plus uninitialized sources regardless of
+            // lane (#3276); that check rides laneSuspends so floor bundles don't
+            // pay for it.
+            if (currentOptimisticLane === null || GlobalQueue.kt(u)) {
                 if (!tracking && e !== t) link(e, t);
                 throw u.o?._;
             }
@@ -834,15 +900,15 @@ function read(e) {
         } else throw u.o?._;
     }
     if (snapshotCaptureActive && t && t.T & CONFIG_IN_SNAPSHOT_SCOPE) {
-        const n = e.o?.We;
+        const n = e.o?.Ye;
         if (n !== undefined) {
             const i = n === NO_SNAPSHOT ? undefined : n;
-            const u = e.Pe !== NOT_PENDING ? e.Pe : e.be;
+            const u = e.Re !== NOT_PENDING ? e.Re : e.be;
             if (u !== i) t.ie |= REACTIVE_SNAPSHOT_STALE;
             return i;
         }
     }
-    if (e.o?.Oe !== undefined && e.o?.Oe !== NOT_PENDING) {
+    if (e.o?.Pe !== undefined && e.o?.Pe !== NOT_PENDING) {
         // A17: the override IS the value for every reader — except an authoritative
         // reader (until()'s predicate carries CONFIG_AUTHORITATIVE_READ): it must
         // observe independently-arriving truth, and serving it the caller's own
@@ -853,7 +919,7 @@ function read(e) {
         // authoritative — optimism never lives there); the sticky mark makes the
         // A17-silent "landing equals override" paths notify this node's subs so
         // the reader re-runs when truth arrives.
-        if (!(t && t.T & CONFIG_AUTHORITATIVE_READ)) return unwrapOverride(e.o?.Oe);
+        if (!(t && t.T & CONFIG_AUTHORITATIVE_READ)) return unwrapOverride(e.o?.Pe);
         e.T |= CONFIG_AUTHORITATIVE_OBSERVED;
     }
     // Entanglement gate: a reader recomputing under an optimistic lane that reads
@@ -863,7 +929,7 @@ function read(e) {
     // _pendingValue for correct fetching. The sub is recorded for replay at commit
     // so it re-runs with the new committed view. (Gate details live with the
     // engine — a non-null lane implies it is installed.)
-        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.vt(e, u, t)) {
+        if (currentOptimisticLane !== null && activeTransition !== null && t !== null && GlobalQueue.Ut(e, u, t)) {
         return e.be;
     }
     // In optimistic lane context, return _value for optimistic/lane-assigned signals
@@ -872,7 +938,7 @@ function read(e) {
     // (The lane-context clause lives with the engine.) Children-forbidden readers
     // (createTrackedEffect / onSettled callbacks) get committed visibility — see
     // readNodeFast (#3006).
-        const l = !t || currentOptimisticLane !== null && GlobalQueue.bt(e, u, t) || e.Pe === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && e.Ae && activeTransition !== e.Ae || 
+        const l = !t || currentOptimisticLane !== null && GlobalQueue.xt(e, u, t) || e.Re === NOT_PENDING || t.T & CONFIG_CHILDREN_FORBIDDEN || stale && e.Ae && activeTransition !== e.Ae || 
     // A17 for HELD truth (#3164, see CONFIG_HELD_TRUTH): staged confirming
     // truth — fold-staged onto an armed family, or entangle-stolen by an
     // awaited until() — is masked from ordinary readers until its
@@ -881,10 +947,10 @@ function read(e) {
     // compose override + staged truth into a state no timeline contains).
     // Authoritative readers (until()'s predicate) and latest() see the
     // staged truth — the tunnel that keeps the hold deadlock-free.
-    e.T & CONFIG_HELD_TRUTH && !latestReadActive && !(t.T & CONFIG_AUTHORITATIVE_READ) ? e.be : e.Pe;
+    e.T & CONFIG_HELD_TRUTH && !latestReadActive && !(t.T & CONFIG_AUTHORITATIVE_READ) ? e.be : e.Re;
     // Record that this isPending() probe observed the fresh pending value, so
     // the probe doesn't pair "pending" with the new value (#2831).
-        if (pendingCheckActive) GlobalQueue.kt(e, l);
+        if (pendingCheckActive) GlobalQueue.Lt(e, l);
     if (!t && u === e && typeof n.oe === "function" && e.T & CONFIG_AUTO_DISPOSE && !(u.S & STATUS_PENDING) && !e.u) {
         // Deferred, not inline (#3078): an inline unobserved() here made untracked
         // reads destructive — dispose on this read, full revival recompute on the
@@ -905,22 +971,22 @@ function setSignal(e, t) {
     // _overrideValue slot (flagged by CONFIG_OPTIMISTIC — a masked read of the
     // always-present config instead of a missing-property probe), and every
     // module that installs one installs the engine first.
-        if (e.T & CONFIG_OPTIMISTIC && !projectionWriteActive) return GlobalQueue.xt(e, t);
-    const n = e.Pe === NOT_PENDING ? e.be : e.Pe;
+        if (e.T & CONFIG_OPTIMISTIC && !projectionWriteActive) return GlobalQueue.yt(e, t);
+    const n = e.Re === NOT_PENDING ? e.be : e.Re;
     if (typeof t === "function") t = t(n);
     // Uninitialized check first: the first commit has no previous value, so the
     // user comparator must not run against `undefined` (matches recompute).
-        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.ge || !e.ge(n, t);
+        const i = !!(e.S & STATUS_UNINITIALIZED) || !e.pe || !e.pe(n, t);
     if (!i) return t;
-    const u = e.Pe !== NOT_PENDING;
+    const u = e.Re !== NOT_PENDING;
     if (!u) queuePendingNode(e);
-    e.Pe = t;
+    e.Re = t;
     // syncCompanions only pokes _pendingSignal/_latestValueComputed — with
     // neither companion present the call is a guaranteed no-op (companions are
     // only ever created, never removed, and creating one installs the hook and
     // sets CONFIG_HAS_COMPANIONS — one masked read replaces two optional-field
     // probes on every write).
-        e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.Re !== null && GlobalQueue.Re(e, t);
+        e.T & CONFIG_HAS_COMPANIONS && GlobalQueue.Ue !== null && GlobalQueue.Ue(e, t);
     // _time is a computed-only slot (§12e): writing it on a signal would fork
     // the lean shape. Every read site is computed-typed.
         if (e.oe !== undefined) e.Te = clock;
@@ -929,7 +995,7 @@ function setSignal(e, t) {
     // (epoch) — re-stages the value and stops. The walk is idempotent (subs
     // marked, heap entries flag-guarded, effects queued once); lane and reask
     // contexts change what a walk MEANS, so they always walk.
-        if (u && e.It === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return t;
+        if (u && e.Et === notifyEpoch && currentOptimisticLane === null && !reaskArmed) return t;
     insertSubs(e);
     schedule();
     return t;
@@ -943,12 +1009,12 @@ function setSignal(e, t) {
  * cleanup point.
  */ function suppressComputedRecompute(e) {
     deleteFromHeap(e, queueFor(e));
-    if (!(e.ie & REACTIVE_MANUAL_WRITE) && e.Pe === NOT_PENDING) {
+    if (!(e.ie & REACTIVE_MANUAL_WRITE) && e.Re === NOT_PENDING) {
         queuePendingNode(e);
         schedule();
     }
     e.ie = e.ie & -4 | REACTIVE_MANUAL_WRITE;
-    e.Ut = clock;
+    e.Qt = clock;
 }
 
 /**
@@ -1018,10 +1084,16 @@ function staleValues(e, t = true) {
             // refresh is a later, explicit re-ask and lifts the mask — otherwise
             // any setStore early in an action silently swallows every refresh()
             // for the rest of the transaction (#3026).
-            if (e.Ut === clock) return;
+            if (e.Qt === clock) return;
             e.ie &= ~REACTIVE_MANUAL_WRITE;
-            // No REASK below: the batch carries a manual value change, so the
-            // recompute is not a quiet re-ask of an unchanged question.
+            // The lift falls through to the re-ask classification below. The held
+            // write's value change already rides the transaction; the refetch it
+            // asks for is the same question with unchanged inputs. Skipping the
+            // mark here classified that refetch as a NEW question, which pends
+            // every leaf (3.1) — an action doing setStore + yield + refresh(store)
+            // lit up every sibling row, and affects() could not narrow it (a mark
+            // only turns pending on). Same-question motion stays silent (3.4);
+            // the written slot and any declared mark carry the pending instead.
                 }
         // A refresh with no value-change dirt already queued is a re-ask of the
         // same question: mark it so the recompute classifies any resulting
@@ -1030,7 +1102,7 @@ function staleValues(e, t = true) {
         // REACTIVE_IN_HEAP counts as dirt: insertSubs schedules subscribers by
         // heap insertion alone (no DIRTY/CHECK flag), so a same-batch value
         // change followed by refresh() must not be laundered into a quiet re-ask.
-         else if (!(e.ie & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
+                if (!(e.ie & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
             e.ie |= REACTIVE_REASK;
             armReaskClear();
         }
@@ -1040,4 +1112,4 @@ function staleValues(e, t = true) {
     }
 }
 
-export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, effectStatusNotify, ext, installAuthoritativeRead, isEqual, latestReadActive, markRefresh, markSnapshotScope, notifyAuthoritativeObservers, optimisticComputed, optimisticSignal, pendingCheckActive, prepareComputed, read, readNodeFast, recompute, releaseSnapshotScope, runWithOwner, setContextInternal, setEffectStatusNotify, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSnapshotCapture, signal, snapshotCaptureActive, snapshotSources, stale, staleValues, statusNotifierOf, suppressComputedRecompute, tracking, untrack };
+export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, effectStatusNotify, ext, installAuthoritativeRead, isEqual, latestReadActive, markRefresh, markSnapshotScope, notifyAuthoritativeObservers, optimisticComputed, optimisticSignal, pendingCheckActive, prepareComputed, read, readNodeFast, recompute, releaseSnapshotScope, runWithOwner, setContextInternal, setEffectStatusNotify, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSlotUnobserved, setSnapshotCapture, signal, slotSignal, slotUnobservedHook, snapshotCaptureActive, snapshotSources, stale, staleValues, statusNotifierOf, suppressComputedRecompute, tracking, untrack };