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

package/dist/prod/core/verdict.js

@@ -0,0 +1,369 @@
+import { NOT_PENDING, REACTIVE_DISPOSED, REACTIVE_DIRTY, REACTIVE_CHECK, unwrapOverride, REACTIVE_ZOMBIE, STATUS_UNINITIALIZED, STATUS_PENDING, REACTIVE_MANUAL_WRITE, STATUS_ERROR, REACTIVE_RECOMPUTING_DEPS } from "./constants.js";
+
+import { setSignal, prepareComputed, read, context, stale, currentOptimisticLane, tracking, setLatestReadActive, setContextInternal, optimisticComputed, setPendingCheckActive, latestReadActive, optimisticSignal, pendingCheckActive } from "./core.js";
+
+import { NotReadyError } from "./error.js";
+
+import { link } from "./graph.js";
+
+import { insertIntoHeap, queueFor, markHeap } from "./heap.js";
+
+import "./invariants.js";
+
+import { findLane, hasActiveOverride } from "./lanes.js";
+
+import { installOptimisticEngine } from "./optimistic.js";
+
+import { GlobalQueue, clock, insertSubs, schedule, activeTransition, activeAffectsMarks } from "./scheduler.js";
+
+/**
+ * The isPending()/latest() verdict layer, moved out of core.ts. Importing this
+ * module installs the companion-maintenance hooks on GlobalQueue; apps that
+ * never import isPending/latest never pay for any of it.
+ */
+// Companions (pending signals / latest shadows) are optimistic nodes: their
+// writes go through the optimistic write path and their reversion rides the
+// same lanes, so the verdict layer brings the engine with it.
+installOptimisticEngine();
+
+let pendingProbe = null;
+
+/**
+ * Get or create the pending signal for a node (lazy).
+ * Used by isPending() to track pending state reactively.
+ */ function getPendingSignal(e) {
+    if (!e.ge) {
+        // Start false, write true if pending - ensures reversion returns to false
+        e.ge = optimisticSignal(false, {
+            ownedWrite: true
+        });
+        e.ge.nn = e;
+        if (computePendingState(e)) setSignal(e.ge, true);
+    }
+    return e.ge;
+}
+
+function collectPendingSources(e) {
+    if (!pendingProbe) return;
+    pendingProbe.sources.add(e);
+    const t = e.lt || e;
+    if (t !== e) pendingProbe.sources.add(t);
+}
+
+/**
+ * Adds a node to the active isPending() probe without reading it. The store's
+ * untracked-probe fallback (`witnessAffectsMark`) reaches this through
+ * `GlobalQueue._witnessAffects` — its callers guard on `pendingCheckActive`,
+ * which only flips inside `isPending()`, so the hook is always installed by
+ * the time it can fire.
+ */ function witnessAffects(e) {
+    pendingProbe?.sources.add(e);
+}
+
+/**
+ * The affects() coverage walk — the read half of the dedicated mark channel.
+ * A node is covered by a live mark iff it carries one (`_affectsCount`) or
+ * derives, through its CURRENT deps (hopping store firewalls), from a node
+ * that does. Pull-based coverage means graph rewires, mid-window recomputes,
+ * and probe-triggered recomputes can never strand or strip a mark — there is
+ * nothing stored downstream to corrupt. Probe-created links
+ * (`_pendingObserver`) are skipped so an `isPending` wrapper memo never
+ * inherits the coverage it reports on.
+ */ function markWalk(e, t) {
+    if (e.t) return true;
+    // A real error outranks an inherited mark (A16/A24c): an errored node
+    // answers probes with its error, not a coverage verdict, and coverage does
+    // not flow through it — matching the rails' behavior, where propagation
+    // stopped at errored nodes. A DIRECT mark on an errored node still reads
+    // pending (the count check above), also matching.
+        if (e.S & STATUS_ERROR) return false;
+    if (t.has(e)) return false;
+    t.add(e);
+    const n = e.lt;
+    if (n && markWalk(n, t)) return true;
+    // Mid-recompute (the clearStatus companion poke runs before
+    // trimStaleDeps), only the validated prefix [_deps.._depsTail] is this
+    // pass's dependency set — walking past it would read dropped deps and
+    // latch a stale verdict on the companion.
+        const i = e;
+    const r = i.se & REACTIVE_RECOMPUTING_DEPS ? i.Ye : undefined;
+    if (r !== null) {
+        for (let e = i.tt ?? null; e !== null; e = e.nt) {
+            if (!e.Ge && markWalk(e.it, t)) return true;
+            if (e === r) break;
+        }
+    }
+    return false;
+}
+
+/** Gated entry: apps with no live mark pay one integer compare. */ function markCovered(e) {
+    return activeAffectsMarks !== 0 && markWalk(e, new Set);
+}
+
+function quietPending(e) {
+    if (e.oe) {
+        for (const t of e.oe) if (!t.he) return false;
+        return true;
+    }
+    return e.he;
+}
+
+// NOTE: a loadingValue node's open loading window (_loading) is verdict-quiet
+// on purpose: commit #0 answers the question by declaration, so the window
+// reads NOT pending — first-load affordances live in the value channel
+// (null / skeleton provenance the author encoded), and isPending stays what
+// it always was: refetch truth for an answered question. This keeps the
+// verdict fully correlated with transition-class machinery and keeps server
+// (always false) and client hydration trivially consistent.
+function newQuestionInFlight(e) {
+    return !!(e.S & STATUS_PENDING) && !(e.S & STATUS_UNINITIALIZED) && !quietPending(e);
+}
+
+function computePendingState(e) {
+    const t = e;
+    if (t.se & REACTIVE_DISPOSED) return false;
+    // Mark coverage is transitive by dep-graph reachability: a latest() shadow
+    // reaches its owner (and a store leaf its firewall) through its own deps,
+    // so the one walk covers direct marks, derivation, and companion chains.
+        if (markCovered(e)) return true;
+    const n = e.lt;
+    if (e.nn) {
+        const t = e.nn;
+        const n = t.lt || t;
+        return newQuestionInFlight(n);
+    }
+    if (n && e.De !== NOT_PENDING && !hasActiveOverride(e)) {
+        return !!(n.se & REACTIVE_MANUAL_WRITE) || !n.Te && !(n.S & STATUS_PENDING) || !!(n.S & STATUS_PENDING) && quietPending(n);
+    }
+    // `!comp._loading`: a hold created while the loading window is still open is
+    // the window's own landing in flight to its commit — verdict-quiet like the
+    // rest of the window (the UNINITIALIZED check suppresses exactly this frame
+    // for windowless first loads; born-committed nodes need their own gate, #2990).
+        if (e.De !== NOT_PENDING && !(t.S & STATUS_UNINITIALIZED) && !t.Ee) {
+        if (hasActiveOverride(e)) return !e.be || !e.be(e.De, unwrapOverride(e._e));
+        return true;
+    }
+    return newQuestionInFlight(t);
+}
+
+function syncCompanions(e, t) {
+    if (e.ge) updatePendingSignal(e);
+    if (e.pe) setSignal(e.pe, t);
+}
+
+function updatePendingSignal(e) {
+    if (e.ge) {
+        setSignal(e.ge, computePendingState(e));
+    }
+    if (e.pe) updatePendingSignal(e.pe);
+}
+
+function updateChildCompanions(e) {
+    for (let t = e.u; t !== null; t = t.ae) {
+        if (t.ge || t.pe) updatePendingSignal(t);
+    }
+}
+
+/**
+ * Re-derive every verdict companion downstream of `el` (subs + firewall
+ * children, dedup'd). The affects() channel's poke walk: registration and
+ * re-ask flips use the live write path (companion setSignal — its own lane
+ * lets the wake escape an incomplete transition's effect stash, #2887);
+ * mark release passes `snap` because it runs inside queue finalization,
+ * where companion writes must land committed (a setSignal there would open
+ * a fresh override window that nothing settles).
+ */ function repollDownstreamVerdicts(e, t = false) {
+    const n = t ? snapCompanionsToState : updatePendingSignal;
+    const i = new Set;
+    const visit = e => {
+        if (i.has(e)) return;
+        i.add(e);
+        if (e.ge || e.pe) n(e);
+        for (let t = e.o; t !== null; t = t.le) visit(t.fe);
+        for (let t = e.u ?? null; t !== null; t = t.ae) {
+            visit(t);
+        }
+    };
+    visit(e);
+}
+
+function snapCompanionsToState(e) {
+    const t = e.ge;
+    if (t && (t._e === undefined || t._e === NOT_PENDING)) {
+        const n = computePendingState(e);
+        if (t.Ue !== n || t.De !== NOT_PENDING) {
+            t.Ue = n;
+            t.De = NOT_PENDING;
+            t.de = clock;
+            insertSubs(t);
+            schedule();
+        }
+    }
+    const n = e.pe;
+    if (n && !(n.se & REACTIVE_DISPOSED)) {
+        if ((n._e === undefined || n._e === NOT_PENDING) && n.De === NOT_PENDING && !Object.is(n.Ue, e.Ue) && !(n.se & (REACTIVE_DIRTY | REACTIVE_CHECK))) {
+            n.se |= REACTIVE_DIRTY;
+            insertIntoHeap(n, queueFor(n));
+            insertSubs(n);
+            schedule();
+        }
+        snapCompanionsToState(n);
+    }
+}
+
+function getLatestValueComputed(e) {
+    if (!e.pe) {
+        const t = latestReadActive;
+        setLatestReadActive(false);
+        const n = pendingCheckActive;
+        setPendingCheckActive(false);
+        const i = context;
+        setContextInternal(null);
+ // Detach from owner so it isn't disposed with effects
+                e.pe = optimisticComputed(() => read(e));
+        e.pe.nn = e;
+ // Parent-child lane relationship
+                setContextInternal(i);
+        setPendingCheckActive(n);
+        setLatestReadActive(t);
+    }
+    return e.pe;
+}
+
+/** The latest()-mode read path, installed as GlobalQueue._latestRead. */ function latestRead(e) {
+    const t = getLatestValueComputed(e);
+    const n = latestReadActive;
+    setLatestReadActive(false);
+    const i = e._e !== undefined && e._e !== NOT_PENDING ? unwrapOverride(e._e) : e.Ue;
+    let r;
+    try {
+        // An untracked latest() read has no reading context, so read() never
+        // performs its mid-tick pull — a plain write queued between two latest()
+        // calls left a still-subscribed shadow at its previous speculative value
+        // until the flush (#2922). Mirror the tracked-read pull here: mark the
+        // queued staleness through the graph, then bring the shadow up to date.
+        const e = queueFor(t);
+        if (t.xe >= e.Ve && !(t.se & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE))) {
+            markHeap(e);
+            prepareComputed(t, true);
+        }
+        r = read(t);
+    } catch (t) {
+        if (t instanceof NotReadyError && (!context || !(e.S & STATUS_UNINITIALIZED))) return i;
+        throw t;
+    } finally {
+        setLatestReadActive(n);
+    }
+    if (t.S & STATUS_PENDING) return i;
+    if (stale && currentOptimisticLane && t.Ke) {
+        const e = findLane(t.Ke);
+        const n = findLane(currentOptimisticLane);
+        if (e !== n && e.Ae.size > 0) {
+            return i;
+        }
+    }
+    // A shadow recomputed by the pull above (not at creation) holds its fresh
+    // speculative value in _pendingValue; a contextless read() only surfaces
+    // _value. Overrides stay authoritative (A17), and stale readers keep the
+    // other transition's committed view, matching read()'s own selection.
+        if (t.De !== NOT_PENDING && !hasActiveOverride(t) && !(stale && t.Ne && activeTransition !== t.Ne)) return t.De;
+    return r;
+}
+
+/** The isPending()-probe read path, installed as GlobalQueue._pendingCheck. */ function pendingCheckRead(e, t, n, i) {
+    setPendingCheckActive(false);
+    if (typeof e.ce === "function") prepareComputed(e, true);
+    const r = n.S;
+    if (t && r & STATUS_PENDING && r & STATUS_UNINITIALIZED) {
+        if (tracking && e !== t) link(e, t);
+        setPendingCheckActive(true);
+        throw n._;
+    }
+    collectPendingSources(e);
+    if (i) collectPendingSources(i);
+    setPendingCheckActive(true);
+}
+
+function recordFreshRead(e, t) {
+    if (pendingProbe !== null && e.De !== NOT_PENDING && t === e.De) pendingProbe.freshReads.add(e);
+}
+
+function applyReask(e, t) {
+    const n = !!(e.S & STATUS_PENDING);
+    const i = t && !(n && !e.he);
+    const r = n && e.he !== i;
+    e.he = i;
+    return r;
+}
+
+function latest(e) {
+    const t = latestReadActive;
+    setLatestReadActive(true);
+    try {
+        return e();
+    } finally {
+        setLatestReadActive(t);
+    }
+}
+
+function isPending(e) {
+    const t = pendingCheckActive;
+    const n = pendingProbe;
+    setPendingCheckActive(true);
+    const i = pendingProbe = {
+        found: false,
+        sources: new Set,
+        freshReads: new Set
+    };
+    const collectPending = () => {
+        setPendingCheckActive(false);
+        try {
+            i.sources.forEach(e => {
+                if (read(getPendingSignal(e)) && !i.freshReads.has(e)) i.found = true;
+            });
+        } finally {
+            setPendingCheckActive(true);
+        }
+    };
+    try {
+        e();
+        collectPending();
+        return i.found;
+    } catch (e) {
+        collectPending();
+        if (e instanceof NotReadyError) {
+            const t = !!(e.source?.S & STATUS_UNINITIALIZED);
+            if (i.found && !t) return true;
+            if (context && t) throw e;
+        }
+        return i.found;
+    } finally {
+        setPendingCheckActive(t);
+        pendingProbe = n;
+    }
+}
+
+// Hook installation (same late-binding pattern as GlobalQueue._update /
+// _propagateAffects): core call sites fire these behind the same guards the
+// direct calls used, so behavior is identical once this module loads.
+GlobalQueue.Pe = syncCompanions;
+
+GlobalQueue.Se = updatePendingSignal;
+
+GlobalQueue.Oe = updateChildCompanions;
+
+GlobalQueue.un = snapCompanionsToState;
+
+GlobalQueue.At = latestRead;
+
+GlobalQueue.Ct = pendingCheckRead;
+
+GlobalQueue.ht = recordFreshRead;
+
+GlobalQueue.Be = applyReask;
+
+GlobalQueue.k = repollDownstreamVerdicts;
+
+GlobalQueue.Lt = witnessAffects;
+
+export { isPending, latest };

package/dist/prod/index.js

@@ -0,0 +1,45 @@
+export { ContextNotFoundError, NoOwnerError, NotReadyError } from "./core/error.js";
+
+export { clearSnapshots, isEqual, markSnapshotScope, refresh, releaseSnapshotScope, runWithOwner, setSnapshotCapture, untrack } from "./core/core.js";
+
+export { enableExternalSource } from "./core/external.js";
+
+export { createOwner, createRoot, getNextChildId, getObserver, getOwner, isDisposed, peekNextChildId } from "./core/owner.js";
+
+export { createContext, getContext, setContext } from "./core/context.js";
+
+export { $REFRESH, SUPPORTS_PROXY } from "./core/constants.js";
+
+import "./core/invariants.js";
+
+export { enforceLoadingBoundary, flush, resetErrorHalt } from "./core/scheduler.js";
+
+export { isPending, latest } from "./core/verdict.js";
+
+import "./core/effect.js";
+
+export { action } from "./core/action.js";
+
+export { createEffect, createMemo, createOptimistic, createReaction, createRenderEffect, createSignal, createTrackedEffect, onCleanup, onSettled, resolve } from "./signals.js";
+
+export { affects } from "./affects.js";
+
+export { mapArray, repeat } from "./map.js";
+
+export { $PROXY, $TARGET, $TRACK, createStore, isWrappable } from "./store/store.js";
+
+export { createProjection } from "./store/projection.js";
+
+export { createOptimisticStore } from "./store/optimistic.js";
+
+export { reconcile } from "./store/reconcile.js";
+
+export { storePath } from "./store/storePath.js";
+
+export { deep, merge, omit, snapshot } from "./store/utils.js";
+
+export { createErrorBoundary, createLoadingBoundary, createRevealOrder, flatten } from "./boundaries.js";
+
+const DEV = undefined;
+
+export { DEV };