@solidjs/signals 2.0.0-beta.9 → 2.0.0-rc.0

package/dist/prod/core/core.js

@@ -0,0 +1,817 @@
+import { handleAsync, clearStatus, parkLoadingWindow, notifyStatus, settleErroredDependents } from "./async.js";
+
+import { EFFECT_TRACKED, REACTIVE_OPTIMISTIC_DIRTY, NOT_PENDING, STATUS_UNINITIALIZED, STATUS_ERROR, REACTIVE_REASK, REACTIVE_RECOMPUTING_DEPS, CONFIG_SYNC, STATUS_PENDING, REACTIVE_NONE, REACTIVE_SNAPSHOT_STALE, unwrapOverride, OVERRIDE_UNDEFINED, REACTIVE_LAZY, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, REACTIVE_CHECK, REACTIVE_DIRTY, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, defaultContext, CONFIG_IN_SNAPSHOT_SCOPE, CONFIG_TRANSPARENT, CONFIG_OWNED_WRITE, CONFIG_NO_SNAPSHOT, $REFRESH, REACTIVE_MANUAL_WRITE, NO_SNAPSHOT, STORE_SNAPSHOT_PROPS, EFFECT_USER } from "./constants.js";
+
+import { NotReadyError } from "./error.js";
+
+import { trimStaleDeps, link, unobserved } from "./graph.js";
+
+import { deleteFromHeap, queueFor, insertIntoHeapHeight, markNode, markHeap, insertIntoHeap } from "./heap.js";
+
+import { GlobalQueue, activeTransition, globalQueue, clock, insertSubs, queuePendingNode, runInTransition, schedule, dirtyQueue, projectionWriteActive, armReaskClear } from "./scheduler.js";
+
+import "./invariants.js";
+
+import { disposeChildren, markDisposal, inheritId } from "./owner.js";
+
+GlobalQueue.Ce = recompute;
+
+GlobalQueue.me = disposeChildren;
+
+let tracking = false;
+
+/** @internal verdict-module glue */ function setPendingCheckActive(e) {
+    pendingCheckActive = e;
+}
+
+/** @internal verdict-module glue */ function setLatestReadActive(e) {
+    latestReadActive = e;
+}
+
+/** @internal verdict-module glue */ function setContextInternal(e) {
+    context = e;
+}
+
+let stale = false;
+
+let pendingCheckActive = false;
+
+let latestReadActive = false;
+
+let context = null;
+
+let currentOptimisticLane = null;
+
+let snapshotCaptureActive = false;
+
+let snapshotSources = null;
+
+function ownerInSnapshotScope(e) {
+    while (e) {
+        if (e.ve) return true;
+        e = e.ke;
+    }
+    return false;
+}
+
+function setSnapshotCapture(e) {
+    snapshotCaptureActive = e;
+    if (e && !snapshotSources) snapshotSources = new Set;
+}
+
+function markSnapshotScope(e) {
+    e.ve = true;
+}
+
+function releaseSnapshotScope(e) {
+    e.ve = false;
+    releaseSubtree(e);
+    schedule();
+}
+
+function releaseSubtree(e) {
+    let t = e.Fe;
+    while (t) {
+        if (t.ve) {
+            t = t.He;
+            continue;
+        }
+        if (t.ce) {
+            const e = t;
+            e.T &= ~CONFIG_IN_SNAPSHOT_SCOPE;
+            if (e.se & REACTIVE_SNAPSHOT_STALE) {
+                e.se &= ~REACTIVE_SNAPSHOT_STALE;
+                e.se |= REACTIVE_DIRTY;
+                if (dirtyQueue.Ve > e.xe) dirtyQueue.Ve = e.xe;
+                insertIntoHeap(e, dirtyQueue);
+            }
+        }
+        releaseSubtree(t);
+        t = t.He;
+    }
+}
+
+function clearSnapshots() {
+    if (snapshotSources) {
+        for (const e of snapshotSources) {
+            delete e.Le;
+            // 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.
+                        if (e[STORE_SNAPSHOT_PROPS] !== undefined) e[STORE_SNAPSHOT_PROPS] = undefined;
+        }
+        snapshotSources = null;
+    }
+    snapshotCaptureActive = false;
+}
+
+function recompute(e, t = false) {
+    const n = e.Re;
+    if (!t) {
+        if (e.Ne && (!n || activeTransition) && activeTransition !== e.Ne) globalQueue.initTransition(e.Ne);
+        deleteFromHeap(e, queueFor(e));
+        e.Te = null;
+        // Tracked effects run after finalizePureQueue, so dispose immediately instead of deferring
+                if (e.Ne || n === EFFECT_TRACKED) disposeChildren(e); else if (e.Fe !== null || e.ye !== null) {
+            markDisposal(e);
+            e.Qe = e.ye;
+            e.We = e.Fe;
+            e.ye = null;
+            e.Fe = null;
+            e.qe = 0;
+        } else ;
+    }
+    let i = !!(e.se & REACTIVE_OPTIMISTIC_DIRTY);
+    const l = e._e !== undefined && e._e !== NOT_PENDING;
+    const u = !!(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
+    // be swept (settleErroredDependents, #2949).
+        const o = e.S & STATUS_ERROR ? e._ : undefined;
+    // Re-ask classification lives in the verdict module; capture the flag before
+    // the recompute wipes _flags below.
+        const s = (e.se & REACTIVE_REASK) !== 0;
+    // Captured before the compute clears it on a sync landing: if that landing
+    // is transition-held below, the window must stay open until the hold
+    // commits (commitPendingNode) — a closed window plus a held value reads as
+    // a pending frame to live observers of the verdict (#2990).
+        const a = e.Ee;
+    const r = context;
+    context = e;
+    e.Ye = null;
+    e.Ze++;
+    e.se = REACTIVE_RECOMPUTING_DEPS;
+    e.de = clock;
+    let c = e.De === NOT_PENDING ? e.Ue : e.De;
+    let _ = e.xe;
+    let f = tracking;
+    let E = currentOptimisticLane;
+    tracking = true;
+    // A computed's fn establishes its OWN dependencies, so it must never run
+    // inside a latest() read window: read() short-circuits through the
+    // companion path before dependency linking, so a memo created (eagerly
+    // computed) inside latest(fn) came out permanently dependency-less (#2926).
+    // latestRead() already suspends the flag for its pull-recomputes; this
+    // covers creation-time computes and flushes that run inside the window.
+        const T = latestReadActive;
+    latestReadActive = false;
+    // Lane posture lives with the engine: OPTIMISTIC_DIRTY is only ever set by
+    // engine-driven paths, and _optimisticNodes is only pushed by
+    // _optimisticWrite, so the hook is installed whenever either gate holds.
+        if (i) {
+        const t = GlobalQueue.je(e, true);
+        if (t) currentOptimisticLane = t;
+    } else if (activeTransition && !t && activeTransition.Me.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.je(e, false);
+        if (t) {
+            i = true;
+            currentOptimisticLane = t;
+        }
+    }
+    const N = n && n !== EFFECT_USER;
+    const d = stale;
+    if (N) stale = true;
+    try {
+        if (!false && e.T & CONFIG_SYNC) {
+            c = e.ce(c);
+            e.Te = null;
+            e.Ee = false;
+        } else {
+            // Snapshot `_inFlight` so we can detect whether `_fn` self-registered an async
+            // subscription (e.g. `createProjection` calls `handleAsync` from inside its body
+            // with a setter callback). In that case, the outer `handleAsync` call below would
+            // clobber the fresh subscription, so we skip it and let the internally-registered
+            // iteration drive updates.
+            const t = e.Te;
+            const n = e.ce(c);
+            const i = typeof n === "object" && n !== null;
+            const l = e.Te !== t;
+            c = l || !i ? n : handleAsync(e, n);
+            if (!l && !i) {
+                e.Te = null;
+                // A sync (non-object) return is the first real answer; async-shaped
+                // results clear inside handleAsync at their own landing points, and a
+                // self-registered flight (inFlightChanged — projections) clears when
+                // its internal handleAsync lands.
+                                e.Ee = false;
+            }
+        }
+        // On a status-free node clearStatus is a guaranteed no-op: every branch
+        // in its body is gated on one of these fields, and with _statusFlags === 0
+        // the flags write (create or not) stores the 0 already there.
+                if (e.S !== 0 || e.i !== undefined || e._ || e.he || e.ue || e.oe !== undefined || e.ge !== undefined || e.pe !== undefined || e.u !== null) clearStatus(e, t);
+        // _optimisticLane is only ever assigned by engine paths.
+                if (e.Ke) GlobalQueue.ze(e);
+    } catch (t) {
+        const n = t instanceof NotReadyError;
+        if (n && e.Ee) {
+            // Loading window with an unready sync dependency: register for the
+            // source's settle (the settlePendingSource walk runs off
+            // _pendingSources + _blocked alone) but take NO read-visible pending
+            // status, no downstream propagation, no transition, no lane
+            // registration — the committed loading value keeps serving. If the
+            // node is currently errored the error stays the answer until this
+            // retry can actually run.
+            parkLoadingWindow(e, t);
+        } 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);
+            let i = false;
+            if (n) {
+                e.ue = true;
+                if (GlobalQueue.Be !== null) i = GlobalQueue.Be(e, s);
+            }
+            notifyStatus(e, n ? STATUS_PENDING : STATUS_ERROR, t, undefined, n ? e.Ke : undefined);
+            if (i) GlobalQueue.k(e);
+        }
+    } finally {
+        tracking = f;
+        latestReadActive = T;
+        if (N) stale = d;
+        e.se = REACTIVE_NONE | (t ? e.se & REACTIVE_SNAPSHOT_STALE : 0);
+        context = r;
+    }
+    if (!e._) {
+        trimStaleDeps(e);
+        const s = l ? unwrapOverride(e._e) : e.De === NOT_PENDING ? e.Ue : e.De;
+        let r = false;
+        try {
+            r = !n && u || !e.be || !e.be(s, 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
+            // error boundaries contain it; otherwise it unwinds the scheduler
+            // flush, bypassing every boundary and wedging the queue (#2837).
+            notifyStatus(e, STATUS_ERROR, t);
+        }
+        // Effects use `_equals: false` (no per-effect closure). The side effects that
+        // the equals closure used to perform — flagging the effect dirty and enqueueing
+        // 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 && r) {
+            e.Je = !e._;
+            // 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.Xe ??= GlobalQueue.et.bind(null, e));
+        }
+        if (e._) ; else if (r) {
+            const u = l ? e._e : undefined;
+            if (t || 
+            // Plain sync flush (no transition on either side) commits effect
+            // values directly — the pending round-trip (queuePendingNode +
+            // commitPendingNodes) exists to sequence transition reveals, and
+            // paying it per effect on the plain path is pure overhead.
+            n && (activeTransition !== e.Ne || activeTransition === null) || i) {
+                e.Ue = 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 (l && i) {
+                    e._e = c === undefined ? OVERRIDE_UNDEFINED : c;
+                    e.De = NOT_PENDING;
+                }
+            } else {
+                e.De = 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 (a) e.Ee = true;
+                // Transition-held sync recompute is a write path like setSignal/asyncWrite,
+                // so sync derivations of held sources stay visible to isPending()/latest()
+                // (#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.Ne) && GlobalQueue.Pe !== null) GlobalQueue.Pe(e, c);
+            }
+            // insertSubs only walks _subs (no scheduling of its own), so a
+            // subscriber-less node has nothing to notify.
+                        if (e.o !== null && (!l || i || e._e !== u)) insertSubs(e, i || l);
+        } else if (l) {
+            // 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.De === NOT_PENDING) queuePendingNode(e);
+            e.De = c;
+            if (a) e.Ee = true;
+ // see the held branch above (#2990)
+                } else if (e.xe != _) {
+            for (let t = e.o; t !== null; t = t.le) {
+                insertIntoHeapHeight(t.fe, queueFor(t.fe));
+            }
+        }
+        // Silent recovery: errored → unchanged value fires no notification, but
+        // dependents still holding the propagated error consumed their dirty flag
+        // 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._error re-set), so this only runs on a genuinely clean recovery.
+                if (o !== undefined && !r && !e._) settleErroredDependents(e, o);
+    }
+    currentOptimisticLane = E;
+    const I = e.De !== NOT_PENDING || e.We !== null || e.Qe !== 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
+    // unqueued covered hold would leak (INV-7) once the revert clears
+    // _transition.
+        I && (!t || e.S & STATUS_PENDING) && (!e.Ne || l) && queuePendingNode(e);
+    e.Ne && n && activeTransition !== e.Ne && runInTransition(e.Ne, () => recompute(e));
+}
+
+function updateIfNecessary(e) {
+    if (e.se & REACTIVE_CHECK) {
+        for (let t = e.tt; t; t = t.nt) {
+            const n = t.it;
+            const i = n.lt || n;
+            if (i.ce) {
+                updateIfNecessary(i);
+            }
+            if (e.se & REACTIVE_DIRTY) {
+                break;
+            }
+        }
+    }
+    if (e.se & (REACTIVE_DIRTY | REACTIVE_OPTIMISTIC_DIRTY) || e._ && e.de < clock && !e.Te) {
+        recompute(e);
+    }
+    e.se = e.se & (REACTIVE_SNAPSHOT_STALE | REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT);
+}
+
+function computed(e, t) {
+    const n = t?.transparent ?? false;
+    // `in` (not `!== undefined`): an explicit `loadingValue: undefined` on a
+    // `T | undefined` node is a real commit #0. The typeof guard tolerates
+    // non-object option values that older call shapes force through `as any`.
+        const i = t !== null && typeof t === "object" && "loadingValue" in t;
+    const l = {
+        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?.V ? CONFIG_NO_SNAPSHOT : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        be: t?.equals != null ? t.equals : isEqual,
+        ut: t?.unobserved,
+        ye: null,
+        C: context?.C ?? globalQueue,
+        we: context?.we ?? defaultContext,
+        qe: 0,
+        ce: e,
+        Ue: i ? t.loadingValue : undefined,
+        xe: 0,
+        u: null,
+        ot: undefined,
+        st: null,
+        tt: null,
+        Ye: null,
+        Ze: 0,
+        o: null,
+        rt: null,
+        ke: context,
+        He: null,
+        ct: null,
+        Fe: null,
+        se: t?.lazy ? REACTIVE_LAZY : REACTIVE_NONE,
+        // A loadingValue node is born committed: commit #0 is already in _value.
+        S: i ? 0 : STATUS_UNINITIALIZED,
+        de: clock,
+        De: NOT_PENDING,
+        Qe: null,
+        We: null,
+        Te: null,
+        Ne: null,
+        he: false,
+        Ee: i
+    };
+    setupComputedNode(l, t);
+    return l;
+}
+
+/**
+ * Build an Effect node with all effect-specific fields baked into a single object literal,
+ * so V8 sees the full hidden class shape at construction time. Effects always run in lazy
+ * mode (recompute is called explicitly by `effect()`), so we hardcode the lazy bits and skip
+ * the auto-dispose CONFIG bit (effect() previously cleared it post-construction).
+ */ function createEffectNode(e, t, n, i, l, u) {
+    const o = u?.transparent ?? false;
+    const s = {
+        id: inheritId(u, o, context),
+        T: (o ? CONFIG_TRANSPARENT : 0) | (u?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (u?.sync ? CONFIG_SYNC : 0) | (snapshotCaptureActive && ownerInSnapshotScope(context) ? CONFIG_IN_SNAPSHOT_SCOPE : 0),
+        be: false,
+        ut: u?.unobserved,
+        ye: null,
+        C: context?.C ?? globalQueue,
+        we: context?.we ?? defaultContext,
+        qe: 0,
+        ce: e,
+        Ue: undefined,
+        xe: 0,
+        u: null,
+        ot: undefined,
+        st: null,
+        tt: null,
+        Ye: null,
+        Ze: 0,
+        o: null,
+        rt: null,
+        ke: context,
+        He: null,
+        ct: null,
+        Fe: null,
+        se: REACTIVE_LAZY,
+        S: STATUS_UNINITIALIZED,
+        de: clock,
+        De: NOT_PENDING,
+        Qe: null,
+        We: null,
+        Te: null,
+        Ne: null,
+        he: false,
+        Ee: false,
+        Je: false,
+        _t: undefined,
+        ft: t,
+        Et: n,
+        Tt: undefined,
+        Re: i,
+        i: l
+    };
+    setupComputedNode(s, lazyOptions);
+    return s;
+}
+
+const lazyOptions = {
+    lazy: true
+};
+
+function setupComputedNode(e, t) {
+    e.st = e;
+    const n = context?.Nt ? context.dt : context;
+    if (context) {
+        const t = context.Fe;
+        if (t === null) {
+            context.Fe = e;
+        } else {
+            e.He = t;
+            t.ct = e;
+            context.Fe = e;
+        }
+    }
+    if (n) e.xe = n.xe + 1;
+    if (GlobalQueue.It !== null) GlobalQueue.It(e);
+    !t?.lazy && recompute(e, true);
+    if (snapshotCaptureActive && !t?.lazy) {
+        if (!(e.S & STATUS_PENDING) && !(e.T & CONFIG_NO_SNAPSHOT)) {
+            e.Le = e.Ue === undefined ? NO_SNAPSHOT : e.Ue;
+            snapshotSources.add(e);
+        }
+    }
+}
+
+function signal(e, t, n = null) {
+    const i = {
+        be: t?.equals != null ? t.equals : isEqual,
+        T: (t?.ownedWrite ? CONFIG_OWNED_WRITE : 0) | (t?.V ? CONFIG_NO_SNAPSHOT : 0),
+        ut: t?.unobserved,
+        Ue: e,
+        o: null,
+        rt: null,
+        de: clock,
+        lt: n,
+        ae: n?.u || null,
+        De: NOT_PENDING
+    };
+    n && (n.u = i);
+    if (snapshotCaptureActive && !(i.T & CONFIG_NO_SNAPSHOT) && !((n?.S ?? 0) & STATUS_PENDING)) {
+        i.Le = e === undefined ? NO_SNAPSHOT : e;
+        snapshotSources.add(i);
+    }
+    return i;
+}
+
+function optimisticSignal(e, t) {
+    const n = signal(e, t);
+    n._e = NOT_PENDING;
+    return n;
+}
+
+function optimisticComputed(e, t) {
+    const n = computed(e, t);
+    n._e = NOT_PENDING;
+    return n;
+}
+
+function isEqual(e, t) {
+    return e === t;
+}
+
+/**
+ * Runs `fn` outside of any reactive tracking — reads inside `fn` will not
+ * subscribe the current scope. Returns whatever `fn` returns.
+ *
+ * Use `untrack` inside a memo or effect when you need to read a signal once
+ * without making the surrounding computation depend on its future changes.
+ *
+ * Pass a `strictReadLabel` string to enable a dev-mode warning: any reactive
+ * read inside `fn` that isn't inside a nested tracking scope will log a
+ * warning naming the label.
+ *
+ * @example
+ * ```ts
+ * createEffect(
+ *   () => trigger(),                 // tracks `trigger` only
+ *   () => {
+ *     const snapshot = untrack(() => state); // read once, untracked
+ *     log(snapshot);
+ *   }
+ * );
+ * ```
+ */ function untrack(e, t) {
+    if (GlobalQueue.St === null && !tracking && true) return e();
+    const n = tracking;
+    tracking = false;
+    try {
+        if (GlobalQueue.St !== null) return GlobalQueue.St(e);
+        return e();
+    } finally {
+        tracking = n;
+    }
+}
+
+/**
+ * Bring a computed to a readable state: lazy/disposed nodes are (re)computed;
+ * an isPending() probe (`refresh`) additionally pulls the node fully up to
+ * date so its status flags reflect the current graph.
+ */ function prepareComputed(e, t) {
+    if (e.se & REACTIVE_LAZY) {
+        e.se &= ~REACTIVE_LAZY;
+        recompute(e, true);
+    } else if (e.se & REACTIVE_DISPOSED) {
+        recompute(e, true);
+    } else if (t) {
+        updateIfNecessary(e);
+    }
+}
+
+/**
+ * Sentinel returned by readNodeFast when the plain-signal fast path does not
+ * apply and the caller must fall back to the full read().
+ */ const READ_SLOW = Symbol("read-slow");
+
+/**
+ * read()'s plain-signal fast path as a standalone entry for hot callers
+ * (store traps). Safe to substitute for read() only because the bail
+ * conditions mirror read()'s prelude and fast-path guard exactly: the
+ * latestRead and pendingCheck windows run side-effectful hooks before the
+ * fast path, `_fn` nodes need prepareComputed, and firewall / override /
+ * snapshot / transition / lane / dev-strictRead state all take the full
+ * resolution. Anything slow returns READ_SLOW; the caller then calls read().
+ */ function readNodeFast(e) {
+    if (latestReadActive || pendingCheckActive || e.ce || e.lt || e._e !== undefined || e.Le !== undefined || activeTransition !== null || currentOptimisticLane !== null || snapshotCaptureActive || false) return READ_SLOW;
+    let t = context;
+    if (t?.Nt) t = t.dt;
+    if (t && tracking) link(e, t);
+    return !t || e.De === NOT_PENDING ? e.Ue : e.De;
+}
+
+function read(e) {
+    // Handle latest() mode: read from _latestValueComputed
+    // 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.At(e);
+    let t = context;
+    if (t?.Nt) t = t.dt;
+    const n = e;
+    const i = e.lt;
+    const l = 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.Ct(e, t, l, i);
+    } else if (typeof n.ce === "function") {
+        prepareComputed(e, false);
+    }
+    if (!n.ce && l === e && e._e === undefined && e.Le === undefined && activeTransition === null && currentOptimisticLane === null && !snapshotCaptureActive && true) {
+        if (t && tracking) link(e, t);
+        return !t || e.De === NOT_PENDING ? e.Ue : e.De;
+    }
+    if (t && tracking) {
+        link(e, t, pendingCheckActive);
+        if (l.ce) {
+            const n = queueFor(e);
+            if (l.xe >= n.Ve) {
+                markNode(t);
+                markHeap(n);
+                updateIfNecessary(l);
+            }
+            const i = l.xe;
+            // parent check is shallow, might need to be recursive
+                        if (i >= t.xe && e.ke !== t) {
+                t.xe = i + 1;
+            }
+        }
+    }
+    if (l.S & STATUS_PENDING) {
+        if (t && !(stale && l.Ne && activeTransition !== l.Ne)) {
+            // 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.Ot(l)) {
+                if (!tracking && e !== t) link(e, t);
+                throw l._;
+            }
+        } else if (t && l !== e && l.S & STATUS_UNINITIALIZED) {
+            if (!tracking && e !== t) link(e, t);
+            throw l._;
+        } else if (!t && l.S & STATUS_UNINITIALIZED) {
+            throw l._;
+        }
+    }
+    // `owner` is the computed itself, or the firewall behind a store node —
+    // firewall-backed reads follow the same rules (memo parity, #2897 ruling):
+    // an errored derive throws for every late reader instead of silently
+    // serving node values (the seed, or last-good data after a failed refetch).
+        if (l.ce && l.S & STATUS_ERROR) {
+        // Only a genuine reactive re-read may retry an errored async source:
+        // - tracking: owned/tracked scope only (never events / `untrack` / effect side-effect phase)
+        // - !pendingCheckActive: an `isPending` probe observes the error, never refetches
+        // - owner._time < clock: only on a later cycle than the one the error was found
+        if (tracking && !pendingCheckActive && l.de < clock) {
+            recompute(l);
+            return read(e);
+        } else throw l._;
+    }
+    if (snapshotCaptureActive && t && t.T & CONFIG_IN_SNAPSHOT_SCOPE) {
+        const n = e.Le;
+        if (n !== undefined) {
+            const i = n === NO_SNAPSHOT ? undefined : n;
+            const l = e.De !== NOT_PENDING ? e.De : e.Ue;
+            if (l !== i) t.se |= REACTIVE_SNAPSHOT_STALE;
+            return i;
+        }
+    }
+    if (e._e !== undefined && e._e !== NOT_PENDING) {
+        // A17: the override IS the value for every reader.
+        return unwrapOverride(e._e);
+    }
+    // Entanglement gate: a reader recomputing under an optimistic lane that reads
+    // a pending mid-transition write sees the committed value. Projection-store
+    // manual writes use the firewall's manual-write flag to opt into this path.
+    // Async drivers are not under an optimistic lane and so bypass this, reading
+    // _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.Rt(e, l, t)) {
+        return e.Ue;
+    }
+    // In optimistic lane context, return _value for optimistic/lane-assigned signals
+    // and for regular signals in stale mode (render effects). Non-stale readers (user
+    // effects) see _pendingValue so that latest() and direct reads stay consistent.
+    // (The lane-context clause lives with the engine.)
+        const u = !t || currentOptimisticLane !== null && GlobalQueue.Pt(e, l, t) || e.De === NOT_PENDING || stale && e.Ne && activeTransition !== e.Ne ? e.Ue : e.De;
+    // 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.ht(e, u);
+    if (!t && l === e && typeof n.ce === "function" && e.T & CONFIG_AUTO_DISPOSE && !(l.S & STATUS_PENDING) && !e.o) {
+        unobserved(e);
+    }
+    return u;
+}
+
+function setSignal(e, t) {
+    if (e.Ne && activeTransition !== e.Ne) globalQueue.initTransition(e.Ne);
+    // The optimistic write path lives with the engine: only optimisticSignal /
+    // optimisticComputed callers and optimistic store nodes carry an
+    // _overrideValue slot, and every module that creates one installs the
+    // engine first.
+        if (e._e !== undefined && !projectionWriteActive) return GlobalQueue.Gt(e, t);
+    const n = e.De === NOT_PENDING ? e.Ue : e.De;
+    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.be || !e.be(n, t);
+    if (!i) return t;
+    if (e.De === NOT_PENDING) queuePendingNode(e);
+    e.De = 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).
+        (e.ge !== undefined || e.pe !== undefined) && GlobalQueue.Pe !== null && GlobalQueue.Pe(e, t);
+    e.de = clock;
+    insertSubs(e);
+    schedule();
+    return t;
+}
+
+/**
+ * Suppresses automatic recomputation of `el` until the scheduler drains. Used
+ * when a manual write should win over dependency changes queued in the same
+ * tick. The MANUAL_WRITE flag is cleared by the pending-node drain; projection
+ * computeds don't commit values, but they still need the same end-of-tick
+ * cleanup point.
+ */ function suppressComputedRecompute(e) {
+    deleteFromHeap(e, queueFor(e));
+    if (!(e.se & REACTIVE_MANUAL_WRITE) && e.De === NOT_PENDING) {
+        queuePendingNode(e);
+        schedule();
+    }
+    e.se = e.se & -4 | REACTIVE_MANUAL_WRITE;
+}
+
+/**
+ * User-facing setter for the memo form of `createSignal(fn)`. Behaves like
+ * `setSignal`, but also cancels any pending recompute of the memo so the
+ * manual value wins over a value that would otherwise be produced by an
+ * upstream change in the same tick.
+ */ function setMemo(e, t) {
+    const n = setSignal(e, t);
+    suppressComputedRecompute(e);
+    return n;
+}
+
+/**
+ * Executes `fn` with the given `owner` set as the current owner. Any reactive
+ * primitives (`createSignal`, `createMemo`, `createEffect`, `onCleanup`,
+ * `cleanup`, etc.) created inside `fn` are attached to that owner, so they
+ * are disposed when the owner is disposed.
+ *
+ * The classic pattern: capture the current owner with `getOwner()` inside a
+ * component, then re-enter it from a callback (event handler, async resolve,
+ * setTimeout) so disposables created in the callback get cleaned up with the
+ * component.
+ *
+ * @example
+ * ```ts
+ * function delayed<T>(ms: number, fn: () => T) {
+ *   const owner = getOwner();
+ *   setTimeout(() => runWithOwner(owner, fn), ms);
+ * }
+ * ```
+ */ function runWithOwner(e, t) {
+    const n = context;
+    const i = tracking;
+    context = e;
+    tracking = false;
+    try {
+        return t();
+    } finally {
+        context = n;
+        tracking = i;
+    }
+}
+
+function staleValues(e, t = true) {
+    const n = stale;
+    stale = t;
+    try {
+        return e();
+    } finally {
+        stale = n;
+    }
+}
+
+/**
+ * Invalidates one reactive source, forcing it to re-execute even if its inputs
+ * haven't changed.
+ *
+ * Pass either a Solid-created accessor or a projected store created from
+ * `createStore(fn, ...)` / `createProjection(...)`. `refresh()` is a
+ * write-like invalidation operation: it does not read the target's value, and
+ * refreshing a plain signal accessor is a no-op.
+ *
+ * Use it to invalidate cached async values (e.g. force a re-fetch) without
+ * tearing the consumer down.
+ *
+ * @example
+ * ```ts
+ * const user = createMemo(async () => fetch(`/users/${id()}`).then(r => r.json()));
+ *
+ * // Re-fetch on demand
+ * <button onClick={() => refresh(user)}>Reload</button>
+ * ```
+ */ function refresh(e) {
+    const t = e?.[$REFRESH];
+    if (!t) {
+        return;
+    }
+    if (typeof t.ce === "function" && !(t.se & (REACTIVE_DISPOSED | REACTIVE_MANUAL_WRITE))) {
+        // 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
+        // pending window as quiet (not pending). If the node is already dirty
+        // from a real input change, the question changed — don't mark.
+        // 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.
+        if (!(t.se & (REACTIVE_DIRTY | REACTIVE_CHECK | REACTIVE_IN_HEAP))) {
+            t.se |= REACTIVE_REASK;
+            armReaskClear();
+        }
+        t.se = t.se & ~REACTIVE_CHECK | REACTIVE_DIRTY;
+        insertIntoHeap(t, queueFor(t));
+        schedule();
+    }
+}
+
+export { READ_SLOW, clearSnapshots, computed, context, createEffectNode, currentOptimisticLane, isEqual, latestReadActive, markSnapshotScope, optimisticComputed, optimisticSignal, pendingCheckActive, prepareComputed, read, readNodeFast, recompute, refresh, releaseSnapshotScope, runWithOwner, setContextInternal, setLatestReadActive, setMemo, setPendingCheckActive, setSignal, setSnapshotCapture, signal, snapshotCaptureActive, snapshotSources, stale, staleValues, suppressComputedRecompute, tracking, untrack };