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

package/dist/types-cjs/core/core.d.cts

@@ -2,11 +2,17 @@ import { type Refreshable } from "./constants.cjs";
 import { type OptimisticLane } from "./lanes.cjs";
 import type { Computed, FirewallSignal, NodeOptions, Owner, Signal } from "./types.cjs";
 export declare const PRIMITIVE_IN_FORBIDDEN_SCOPE_MESSAGE = "[PRIMITIVE_IN_FORBIDDEN_SCOPE] Cannot create reactive primitives inside createTrackedEffect or owner-backed onSettled";
+export declare const REACTIVE_WRITE_IN_OWNED_SCOPE_SIGNAL_MESSAGE: string;
+export declare const REACTIVE_WRITE_IN_OWNED_SCOPE_REFRESH_MESSAGE: string;
 export declare let tracking: boolean;
+/** @internal verdict-module glue */
+export declare function setPendingCheckActive(v: boolean): void;
+/** @internal verdict-module glue */
+export declare function setLatestReadActive(v: boolean): void;
+/** @internal verdict-module glue */
+export declare function setContextInternal(v: Owner | null): void;
 export declare let stale: boolean;
-export declare let refreshing: boolean;
 export declare let pendingCheckActive: boolean;
-export declare let foundPending: boolean;
 export declare let latestReadActive: boolean;
 export declare let context: Owner | null;
 export declare let currentOptimisticLane: OptimisticLane | null;
@@ -19,6 +25,13 @@ export declare function clearSnapshots(): void;
 export declare function recompute(el: Computed<any>, create?: boolean): void;
 export declare function computed<T>(fn: (prev?: T) => T | PromiseLike<T> | AsyncIterable<T>): Computed<T>;
 export declare function computed<T>(fn: (prev: T) => T | PromiseLike<T> | AsyncIterable<T>, options?: NodeOptions<T>): Computed<T>;
+/**
+ * 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).
+ */
+export declare function createEffectNode<T>(fn: (prev?: T) => T, effectFn: (val: T, prev: T | undefined) => void | (() => void), errorFn: ((err: unknown, cleanup: () => void) => void | (() => void)) | undefined, type: number, notifyStatus: ((status?: number, error?: any) => void) | undefined, options: NodeOptions<T> | undefined): any;
 export declare function signal<T>(v: T, options?: NodeOptions<T>): Signal<T>;
 export declare function signal<T>(v: T, options?: NodeOptions<T>, firewall?: Computed<any>): FirewallSignal<T>;
 export declare function optimisticSignal<T>(v: T, options?: NodeOptions<T>): Signal<T>;
@@ -53,8 +66,44 @@ export declare function setStrictRead(v: string | false): string | false;
  * ```
  */
 export declare function untrack<T>(fn: () => T, strictReadLabel?: string | false): T;
+/**
+ * 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.
+ */
+export declare function prepareComputed(comp: Computed<unknown>, refresh: boolean): void;
+/**
+ * Sentinel returned by readNodeFast when the plain-signal fast path does not
+ * apply and the caller must fall back to the full read().
+ */
+export declare const READ_SLOW: unique symbol;
+/**
+ * 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().
+ */
+export declare function readNodeFast<T>(el: Signal<T>): T | typeof READ_SLOW;
 export declare function read<T>(el: Signal<T> | Computed<T>): T;
 export declare function setSignal<T>(el: Signal<T> | Computed<T>, v: T | ((prev: T) => T)): 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.
+ */
+export declare function suppressComputedRecompute(el: Computed<unknown>): void;
+/**
+ * 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.
+ */
+export declare function setMemo<T>(el: Computed<T>, v: T | ((prev: T) => T)): T;
 /**
  * Executes `fn` with the given `owner` set as the current owner. Any reactive
  * primitives (`createSignal`, `createMemo`, `createEffect`, `onCleanup`,
@@ -75,56 +124,15 @@ export declare function setSignal<T>(el: Signal<T> | Computed<T>, v: T | ((prev:
  * ```
  */
 export declare function runWithOwner<T>(owner: Owner | null, fn: () => T): T;
-/**
- * Update _pendingSignal when pending state changes. When the override clears
- * (pending -> not pending), merge the sub-lane into the source's lane so
- * isPending effects are blocked until the full scope resolves.
- */
-export declare function updatePendingSignal(el: Signal<any> | Computed<any>): void;
 export declare function staleValues<T>(fn: () => T, set?: boolean): T;
 /**
- * Reads reactive expressions while bypassing any pending async overlay — i.e.
- * always returns the most-recently-committed value, even when newer reads
- * inside `fn` are still in flight.
- *
- * Useful inside a `<Loading>` boundary's children when you want to keep
- * showing the previous resolved data instead of the fallback while the next
- * value loads.
- *
- * @example
- * ```tsx
- * <Loading fallback={<Skeleton />}>
- *   {/* During a transition, render the previous user instead of skeleton: *\/}
- *   <UserCard user={latest(() => user())} />
- * </Loading>
- * ```
- */
-export declare function latest<T>(fn: () => T): T;
-/**
- * Returns `true` if any reactive read inside `fn` is currently in a pending
- * (async, not-yet-settled) state. Does not subscribe — pair with a tracked
- * memo if you want to react to pending status changes.
- *
- * Useful for showing inline transition indicators alongside the previous
- * value (rather than swapping to a `<Loading>` fallback).
- *
- * @example
- * ```tsx
- * const pending = createMemo(() => isPending(() => user()));
- *
- * <button disabled={pending()}>{pending() ? "Saving…" : "Save"}</button>
- * ```
- */
-export declare function isPending(fn: () => any): boolean;
-/**
- * Forces a reactive source to re-execute, even if its inputs haven't changed.
+ * Invalidates one reactive source, forcing it to re-execute even if its inputs
+ * haven't changed.
  *
- * Two forms:
- * - `refresh(memo)` — pass an accessor (memo / signal getter) and its
- *   underlying computation reruns.
- * - `refresh(store)` — pass a *projected* store created from
- *   `createStore(fn, ...)` or `createProjection(...)` and the projection
- *   recomputes.
+ * 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.
@@ -137,17 +145,4 @@ export declare function isPending(fn: () => any): boolean;
  * <button onClick={() => refresh(user)}>Reload</button>
  * ```
  */
-export declare function refresh<T>(fn: (() => T) | Refreshable<T>): T;
-/**
- * Returns `true` while a `refresh()` call is in progress. Useful for showing
- * a "refreshing" indicator distinct from the initial-load `<Loading>`
- * fallback.
- *
- * @example
- * ```tsx
- * <Show when={isRefreshing()}>
- *   <span class="badge">refreshing…</span>
- * </Show>
- * ```
- */
-export declare function isRefreshing(): boolean;
+export declare function refresh<T>(target: Refreshable<T>): void;

package/dist/types-cjs/core/dev.d.cts

@@ -6,8 +6,8 @@ export interface DevHooks {
     onStoreNodeUpdate?: (state: any, property: PropertyKey, value: any, prev: any) => void;
 }
 export type DiagnosticSeverity = "warn" | "error";
-export type DiagnosticCode = "STRICT_READ_UNTRACKED" | "PENDING_ASYNC_UNTRACKED_READ" | "PENDING_ASYNC_FORBIDDEN_SCOPE" | "SIGNAL_WRITE_IN_OWNED_SCOPE" | "RUN_WITH_DISPOSED_OWNER" | "NO_OWNER_CLEANUP" | "CLEANUP_IN_FORBIDDEN_SCOPE" | "PRIMITIVE_IN_FORBIDDEN_SCOPE" | "NO_OWNER_EFFECT" | "NO_OWNER_BOUNDARY" | "ASYNC_OUTSIDE_LOADING_BOUNDARY" | "MISSING_EFFECT_FN";
-export type DiagnosticKind = "strict-read" | "async" | "write" | "lifecycle" | "owner";
+export type DiagnosticCode = "STRICT_READ_UNTRACKED" | "PENDING_ASYNC_UNTRACKED_READ" | "PENDING_ASYNC_FORBIDDEN_SCOPE" | "REACTIVE_WRITE_IN_OWNED_SCOPE" | "ACTION_CALLED_IN_OWNED_SCOPE" | "RUN_WITH_DISPOSED_OWNER" | "NO_OWNER_CLEANUP" | "CLEANUP_IN_FORBIDDEN_SCOPE" | "SETTLED_CLEANUP_UNOWNED" | "PRIMITIVE_IN_FORBIDDEN_SCOPE" | "NO_OWNER_EFFECT" | "NO_OWNER_BOUNDARY" | "ASYNC_OUTSIDE_LOADING_BOUNDARY" | "INVALID_REFRESH_TARGET" | "INVALID_AFFECTS_TARGET" | "MISSING_EFFECT_FN" | "SYNC_NODE_RECEIVED_ASYNC" | "REACTIVITY_HALTED" | "INVARIANT_VIOLATION";
+export type DiagnosticKind = "strict-read" | "async" | "write" | "lifecycle" | "owner" | "error";
 export interface DiagnosticEvent {
     sequence: number;
     code: DiagnosticCode;
@@ -39,7 +39,22 @@ export interface Dev {
     getObservers: typeof getObservers;
 }
 export declare const DEV: Dev;
+/**
+ * Dev-mode internal consistency check. A failure means the reactive system
+ * contradicted itself (not that user code misbehaved) — see
+ * INTERNALS-ASYNC-STATE.md for the invariant catalog. Throws under __TEST__
+ * so the suite (and fuzzing) treats any violation as a hard failure; logs in
+ * dev builds so user apps degrade instead of crashing.
+ */
+export declare function assertInvariant(condition: boolean, name: string, message: string): void;
 export declare function emitDiagnostic(event: Omit<DiagnosticEvent, "sequence">): DiagnosticEvent;
+/**
+ * Shared strict-read diagnostics for core read() and the store proxy traps.
+ * Single source for the message text — the #2897 safeguard parity between
+ * memos and stores is exactly these firing identically from both paths.
+ */
+export declare function throwPendingUntrackedRead(strictReadLabel: string, fields?: Partial<Omit<DiagnosticEvent, "sequence" | "data">>): never;
+export declare function warnStrictReadUntracked(strictReadLabel: string, fields?: Partial<Omit<DiagnosticEvent, "sequence">>): void;
 export declare function registerGraph(value: any, owner: Owner | null): void;
 export declare function clearSignals(node: Owner): void;
 export declare function getChildren(owner: Owner): Owner[];

package/dist/types-cjs/core/effect.d.cts

@@ -2,10 +2,10 @@ import type { Computed, NodeOptions, Owner } from "./types.cjs";
 export interface Effect<T> extends Computed<T>, Owner {
     _effectFn: (val: T, prev: T | undefined) => void | (() => void);
     _errorFn?: (err: unknown, cleanup: () => void) => void;
-    _cleanup?: () => void;
     _modified: boolean;
     _prevValue: T | undefined;
     _type: number;
+    _boundRunEffect?: () => void;
 }
 /**
  * Effects are the leaf nodes of our reactive graph. When their sources change, they are
@@ -18,7 +18,6 @@ export declare function effect<T>(compute: (prev: T | undefined) => T, effect: (
     schedule?: boolean;
 }): void;
 export interface TrackedEffect extends Computed<void> {
-    _cleanup?: () => void;
     _modified: boolean;
     _type: number;
     _run: () => void;

package/dist/types-cjs/core/error.d.cts

@@ -1,4 +1,35 @@
+/**
+ * Thrown by a tracked read whose value is currently pending (an async memo /
+ * `createSignal(asyncFn)` / projection / store derivation that hasn't settled
+ * yet). Surfacing through the reactive graph is what suspends the consumer
+ * scope — the nearest enclosing `<Loading>` boundary catches the throw and
+ * renders its fallback until the source resolves.
+ *
+ * App code rarely catches this directly; `<Loading>` is the canonical
+ * handler. The error type is exposed for advanced cases — e.g. interop layers
+ * that bridge Solid's pending-throw protocol to a different async strategy,
+ * or tests that want to assert on the suspension shape.
+ *
+ * @example
+ * ```ts
+ * // Advanced: distinguish "not ready yet" from a real error in custom
+ * // boundary plumbing. App code should rely on `<Loading>` / `<Errored>`.
+ * try {
+ *   const value = readReactiveSource();
+ * } catch (err) {
+ *   if (err instanceof NotReadyError) throw err; // re-throw to suspend
+ *   reportError(err);
+ * }
+ * ```
+ */
 export declare class NotReadyError extends Error {
+    /**
+     * Tags a visibility-only notification on the affects() boundary channel:
+     * boundaries update display state from it, but the root queue never
+     * registers a reporter — marks are invisible to completion accounting by
+     * construction.
+     */
+    _markVisual?: boolean;
     source: any;
     constructor(source: any);
 }
@@ -6,6 +37,8 @@ export declare class StatusError extends Error {
     source: any;
     constructor(source: any, original: any);
 }
+/** Return the user's error from an internal status wrapper. */
+export declare function unwrapStatusError(error: unknown): unknown;
 export declare class NoOwnerError extends Error {
     constructor();
 }

package/dist/types-cjs/core/external.d.cts

@@ -11,16 +11,5 @@ export declare let externalSourceConfig: {
     factory: ExternalSourceFactory;
     untrack: <T>(fn: () => T) => T;
 } | null;
-/**
- * Registers a factory that bridges external reactive systems (e.g. MobX, Vue refs)
- * into Solid's tracking graph. Every computation will be wrapped so that the
- * external library can track its own dependencies alongside Solid's.
- *
- * Multiple calls pipe together: each new factory wraps the previous one.
- *
- * @param config.factory receives `(fn, trigger)` — wrap fn execution in external tracking,
- *   call trigger when external deps change. Return `{ track, dispose }`.
- * @param config.untrack optional wrapper for `untrack` — disables external tracking too.
- */
 export declare function enableExternalSource(config: ExternalSourceConfig): void;
 export declare function _resetExternalSourceConfig(): void;

package/dist/types-cjs/core/graph.d.cts

@@ -1,4 +1,5 @@
 import type { Computed, Link, Signal } from "./types.cjs";
 export declare function unlinkSubs(link: Link): Link | null;
+export declare function trimStaleDeps(el: Computed<any>): void;
 export declare function unobserved(el: Computed<unknown>): void;
-export declare function link(dep: Signal<any> | Computed<any>, sub: Computed<any>): void;
+export declare function link(dep: Signal<any> | Computed<any>, sub: Computed<any>, pendingObserver?: boolean): void;

package/dist/types-cjs/core/heap.d.cts

@@ -1,4 +1,12 @@
 import type { Computed } from "./types.cjs";
+/** The queue a node belongs to, picked from its own zombie flag. */
+export declare function queueFor(n: Computed<any>): Heap;
+/**
+ * Schedule one subscriber to re-run on the next flush: tracked effects bypass
+ * the heap and go directly to their effect queue; everything else is inserted
+ * into its own (zombie-flag-routed) heap with the `_min` cursor pulled down.
+ */
+export declare function enqueueSub(node: Computed<any>): void;
 export interface Heap {
     _heap: (Computed<unknown> | undefined)[];
     _marked: boolean;

package/dist/types-cjs/core/index.d.cts

@@ -1,12 +1,13 @@
 export { ContextNotFoundError, NoOwnerError, NotReadyError } from "./error.cjs";
-export { isEqual, untrack, runWithOwner, computed, signal, read, setSignal, optimisticSignal, optimisticComputed, isPending, latest, refresh, isRefreshing, staleValues, setSnapshotCapture, markSnapshotScope, releaseSnapshotScope, clearSnapshots } from "./core.cjs";
+export { isEqual, untrack, runWithOwner, computed, signal, read, setSignal, setMemo, suppressComputedRecompute, optimisticSignal, optimisticComputed, refresh, staleValues, setSnapshotCapture, markSnapshotScope, releaseSnapshotScope, clearSnapshots } from "./core.cjs";
 export { enableExternalSource, _resetExternalSourceConfig, type ExternalSourceFactory, type ExternalSource, type ExternalSourceConfig } from "./external.cjs";
 export { createOwner, createRoot, dispose, getNextChildId, getObserver, getOwner, isDisposed, cleanup, peekNextChildId } from "./owner.cjs";
 export { createContext, getContext, setContext, type Context, type ContextRecord } from "./context.cjs";
 export { handleAsync } from "./async.cjs";
+export { isPending, latest } from "./verdict.cjs";
 export type { Computed, Disposable, FirewallSignal, Link, Owner, Root, Signal, NodeOptions } from "./types.cjs";
 export { effect, trackedEffect, type Effect, type TrackedEffect } from "./effect.cjs";
 export { action } from "./action.cjs";
-export { flush, Queue, GlobalQueue, trackOptimisticStore, enforceLoadingBoundary, type IQueue, type QueueCallback } from "./scheduler.cjs";
+export { flush, Queue, GlobalQueue, enforceLoadingBoundary, resetErrorHalt, type IQueue, type QueueCallback } from "./scheduler.cjs";
 export { DEV, type Dev, type DevHooks, type DiagnosticCapture, type DiagnosticCode, type DiagnosticEvent, type DiagnosticKind, type Diagnostics, type DiagnosticSeverity } from "./dev.cjs";
 export * from "./constants.cjs";

package/dist/types-cjs/core/invariants.d.cts

@@ -0,0 +1,59 @@
+import type { OptimisticLane } from "./lanes.cjs";
+import type { Computed, Signal } from "./types.cjs";
+/**
+ * Test-mode invariant checks for the async/transition/lane machinery.
+ * Catalog and rationale: packages/solid-signals/INTERNALS-ASYNC-STATE.md.
+ *
+ * These are implementation self-consistency checks, not semantic rules: a
+ * violation means the reactive system contradicted itself.
+ *
+ * They are gated on `__TEST__` (not just `__DEV__`): the per-write Set
+ * tracking and per-flush quiescence sweep are too expensive for shipped dev
+ * builds and for benchmarks (they showed up as a 5-21% hit across the
+ * CodSpeed suite when they ran under `__DEV__`). Call sites stay `__DEV__`
+ * guarded so production tree-shakes the calls; each entry point here
+ * early-returns unless `__TEST__` is set, so dev builds pay only a no-op
+ * call. The test suite (vitest run) defines `__TEST__: true`; benchmark mode
+ * defines `__TEST__: false`.
+ */
+type AnyNode = Signal<any> | Computed<any>;
+/** Wired by core.ts at module init to avoid import cycles. */
+export declare const InvariantHooks: {
+    pendingProbeActive: (() => boolean) | null;
+    /** Fresh oracle for what an isPending companion SHOULD read right now. */
+    computePendingState: ((node: AnyNode) => boolean) | null;
+};
+export declare function devTrackHeldPending(node: AnyNode): void;
+export declare function devTrackCompanionOwner(node: AnyNode): void;
+export declare function devTrackOptimistic(node: AnyNode): void;
+export declare function devTrackAffects(node: AnyNode): void;
+/**
+ * Open/close the sanctioned registration window. Call sites are `__DEV__`
+ * guarded (no prod cost); the code inside the window must not throw.
+ */
+export declare function beginAsyncReporterWrites(): void;
+export declare function endAsyncReporterWrites(): void;
+export declare function createAsyncReporters(): Map<Computed<any>, Set<Computed<any>>>;
+/**
+ * INV-2: a node with an *active* override must be registered for reversion in
+ * the queue's or a transition's `_optimisticNodes`. An unregistered active
+ * override would survive transition completion forever. Runs at the end of
+ * every flush (not just quiescence — the invariant holds mid-transition).
+ * (There is no revert-target requirement: authoritative values commit
+ * silently into `_value` under the override mask — A17 — so reverting is
+ * just dropping the override.)
+ */
+export declare function devCheckActiveOverrides(isRegisteredForRevert: (node: AnyNode) => boolean): void;
+/** INV-1: an isPending() probe must never leak past its own call. */
+export declare function devCheckFlushStart(): void;
+/** INV-5: a merged lane's work moved to its root on merge and must stay empty. */
+export declare function devCheckMergedLaneEmpty(lane: OptimisticLane): void;
+export declare function devCensusCompanions(isQueuedForCommit?: (node: AnyNode) => boolean): void;
+/**
+ * Quiescence checks. Run only when the system is fully drained: nothing
+ * scheduled, no active/stashed transitions, no live lanes. At that point no
+ * transition-scoped state may survive, and the lazily-created companions must
+ * agree with a fresh computation of their owner's state.
+ */
+export declare function devCheckQuiescent(isQueuedForCommit: (node: AnyNode) => boolean): void;
+export {};

package/dist/types-cjs/core/lanes.d.cts

@@ -37,6 +37,8 @@ export declare function resolveLane(el: {
 export declare function resolveTransition(el: {
     _optimisticLane?: OptimisticLane;
     _transition?: Transition | null;
+    _overrideValue?: any;
+    _overrideOwner?: Transition | null;
 }): Transition | null | undefined;
 /**
  * Check if a node has an active optimistic override.

package/dist/types-cjs/core/optimistic.d.cts

@@ -0,0 +1,6 @@
+/**
+ * Installs the engine's hooks. Idempotent; called by every module that can
+ * create optimistic state (verdict.ts at module top level, createOptimistic
+ * and createOptimisticStore at first call) BEFORE any optimistic node exists.
+ */
+export declare function installOptimisticEngine(): void;

package/dist/types-cjs/core/owner.d.cts

@@ -2,7 +2,27 @@ import type { Computed, Disposable, Owner, Root } from "./types.cjs";
 export declare function markDisposal(el: Owner): void;
 export declare function dispose(node: Computed<unknown>): void;
 export declare function disposeChildren(node: Owner, self?: boolean, zombie?: boolean): void;
+/**
+ * Allocates and returns the next stable child id for `owner`. Used by
+ * hydration plumbing and `createUniqueId`. Not part of the user-facing API.
+ *
+ * @internal
+ */
 export declare function getNextChildId(owner: Owner): string;
+/**
+ * The id a freshly-created node inherits: an explicit `options.id` wins;
+ * transparent nodes share their parent's id; otherwise the parent's next
+ * child id is consumed (or `undefined` outside an id-carrying tree).
+ */
+export declare function inheritId(options: {
+    id?: string;
+} | undefined, transparent: boolean, parent: Owner | null | undefined): string | undefined;
+/**
+ * Returns the *next* child id for `owner` without consuming it. Used by
+ * hydration plumbing to peek at the id a future child will receive.
+ *
+ * @internal
+ */
 export declare function peekNextChildId(owner: Owner): string;
 /**
  * Returns the currently-tracking observer (the computation that subscribes to
@@ -10,6 +30,15 @@ export declare function peekNextChildId(owner: Owner): string;
  * Used by reactive primitives that need to know whether they're inside a
  * tracking scope. App code rarely needs this — see `getOwner()` for the
  * lifecycle owner instead.
+ *
+ * @example
+ * ```ts
+ * // Library predicate: only register a hot-path subscription when the
+ * // caller is inside a tracking scope (memo / effect compute / JSX).
+ * function trackIfTracked(source: () => unknown) {
+ *   if (getObserver()) source();
+ * }
+ * ```
  */
 export declare function getObserver(): Owner | null;
 /**
@@ -36,12 +65,30 @@ export declare function getOwner(): Owner | null;
  * checks. `cleanup()` is the unchecked primitive used by internals.
  */
 export declare function cleanup(fn: Disposable): Disposable;
-/** Returns `true` if the owner has been disposed (or marked zombie pending disposal). */
+/**
+ * Returns `true` if the owner has been disposed (or marked zombie pending
+ * disposal). Pair with a captured owner to bail out of late callbacks whose
+ * surrounding component already unmounted.
+ *
+ * @example
+ * ```ts
+ * function onSettleSafe(fn: () => void) {
+ *   const owner = getOwner();
+ *   queueMicrotask(() => {
+ *     if (owner && isDisposed(owner)) return; // component unmounted; skip
+ *     runWithOwner(owner, fn);
+ *   });
+ * }
+ * ```
+ */
 export declare function isDisposed(node: Owner): boolean;
 /**
  * Creates a fresh owner attached as a child of the current owner (or as a
- * detached root if there is none). Mostly used by framework internals to
- * group cleanups; app code should prefer `createRoot()` or `runWithOwner()`.
+ * detached root if there is none). Used by framework internals to group
+ * cleanups; app code should use `createRoot()` (host a reactive scope outside
+ * a component) or `runWithOwner()` (re-enter a captured owner).
+ *
+ * @internal
  */
 export declare function createOwner(options?: {
     id?: string;

package/dist/types-cjs/core/scheduler.d.cts

@@ -1,5 +1,5 @@
 import { type Heap } from "./heap.cjs";
-import { activeLanes, assignOrMergeLane, findLane } from "./lanes.cjs";
+import { activeLanes, assignOrMergeLane, findLane, type OptimisticLane } from "./lanes.cjs";
 import type { Computed, Signal } from "./types.cjs";
 export { activeLanes, assignOrMergeLane, findLane };
 export { getOrCreateLane, hasActiveOverride, mergeLanes, resolveLane } from "./lanes.cjs";
@@ -11,8 +11,15 @@ export declare let projectionWriteActive: boolean;
 export declare let _hitUnhandledAsync: boolean;
 export declare function registerTransientStoreNode(node: Signal<any>): void;
 export declare function resetUnhandledAsync(): void;
+/**
+ * Toggles the dev-mode "must be inside a `<Loading>` boundary" enforcement
+ * window. Only `render()` calls this — wrapping the initial mount so that a
+ * top-level uncaught async read surfaces the diagnostic. Not part of the
+ * user-facing API.
+ *
+ * @internal
+ */
 export declare function enforceLoadingBoundary(enabled: boolean): void;
-export declare function shouldReadStashedOptimisticValue(node: Signal<any>): boolean;
 export declare function setProjectionWriteActive(value: boolean): void;
 export declare function setTrackedQueueCallback(value: boolean): void;
 export type QueueCallback = (type: number) => void;
@@ -26,6 +33,7 @@ export interface Transition {
     _asyncReporters: Map<Computed<any>, Set<Computed<any>>>;
     _pendingNodes: Signal<any>[];
     _optimisticNodes: OptimisticNode[];
+    _affectsNodes: OptimisticNode[];
     _optimisticStores: Set<any>;
     _actions: Array<Generator<any, any, any> | AsyncGenerator<any, any, any>>;
     _queueStash: QueueStub;
@@ -33,6 +41,14 @@ export interface Transition {
     _gatedSubs: Set<Computed<any>>;
 }
 export declare function schedule(): void;
+/**
+ * Permanently halts the reactive system. Called when a user error escapes
+ * every boundary — app state is undefined at that point, so scheduling stops
+ * entirely rather than limping along with a half-applied update.
+ */
+export declare function haltReactivity(cause?: unknown): void;
+/** @internal Test/dev-reload hook. Revives scheduling after a halt. */
+export declare function resetErrorHalt(): void;
 export interface IQueue {
     enqueue(type: number, fn: QueueCallback): void;
     run(type: number): boolean | void;
@@ -48,6 +64,7 @@ export declare class Queue implements IQueue {
     _parent: IQueue | null;
     _queues: [QueueCallback[], QueueCallback[]];
     _children: IQueue[];
+    _ranAt: number;
     created: number;
     addChild(child: IQueue): void;
     removeChild(child: IQueue): void;
@@ -59,28 +76,72 @@ export declare class Queue implements IQueue {
 }
 export declare class GlobalQueue extends Queue {
     _running: boolean;
-    _pendingNodes: Signal<any>[];
-    _optimisticNodes: OptimisticNode[];
-    _optimisticStores: Set<any>;
+    _batch: Transition;
     static _update: (el: Computed<unknown>) => void;
     static _dispose: (el: Computed<unknown>, self: boolean, zombie: boolean) => void;
-    static _clearOptimisticStore: ((store: any) => void) | null;
+    static _runEffect: (el: Computed<unknown>) => void;
+    static _clearOptimisticStores: ((stores: Set<any>, completing: Transition | null) => void) | null;
+    static _releaseAffectsScope: ((node: OptimisticNode) => void) | null;
+    static _releaseAffectsMarks: ((nodes: OptimisticNode[]) => void) | null;
+    static _markAffects: ((node: OptimisticNode) => void) | null;
+    static _releaseAffectsMark: ((node: OptimisticNode) => void) | null;
+    static _wireExternalSource: ((self: Computed<any>) => void) | null;
+    static _externalUntrack: (<T>(fn: () => T) => T) | null;
+    static _syncCompanions: (<T>(el: Signal<T> | Computed<T>, value: T) => void) | null;
+    static _updatePendingSignal: ((el: OptimisticNode) => void) | null;
+    static _updateChildCompanions: ((el: Computed<any>) => void) | null;
+    static _snapCompanions: ((el: OptimisticNode) => void) | null;
+    static _latestRead: (<T>(el: Signal<T> | Computed<T>) => T) | null;
+    static _pendingCheck: ((el: OptimisticNode, c: Computed<any> | null, owner: OptimisticNode, firewall: Computed<any> | null) => void) | null;
+    static _recordFresh: ((el: OptimisticNode, value: any) => void) | null;
+    static _applyReask: ((el: Computed<any>, hadReask: boolean) => boolean) | null;
+    static _repollVerdicts: ((el: Computed<any>, snap?: boolean) => void) | null;
+    static _witnessAffects: ((node: OptimisticNode) => void) | null;
+    static _optimisticWrite: (<T>(el: Signal<T> | Computed<T>, v: T | ((prev: T) => T)) => T) | null;
+    static _resolveOptimistic: ((nodes: OptimisticNode[]) => void) | null;
+    static _transitionBlocked: ((transition: Transition) => boolean) | null;
+    static _cleanupLanes: ((completingTransition: Transition | null) => void) | null;
+    static _runLaneEffects: ((type: number) => void) | null;
+    static _gatedRead: ((el: Signal<any>, owner: OptimisticNode, c: Computed<any>) => boolean) | null;
+    static _laneSuspends: ((owner: OptimisticNode) => boolean) | null;
+    static _laneReadsCommitted: ((el: OptimisticNode, owner: OptimisticNode, c: Computed<any>) => boolean) | null;
+    static _recomputeLane: ((el: Computed<any>, own: boolean) => OptimisticLane | null) | null;
+    static _laneAsyncPending: ((el: Computed<any>) => void) | null;
+    static _laneAsyncSettled: ((el: Computed<any>) => void) | null;
+    static _trackOptimisticStore: ((store: any) => void) | null;
     flush(): void;
     notify(node: Computed<any>, mask: number, flags: number, error?: any): boolean;
     initTransition(transition?: Transition | null): void;
 }
+export declare function queuePendingNode(node: Signal<any>): void;
+export declare function armReaskClear(): void;
 export declare function insertSubs(node: Signal<any> | Computed<any>, optimistic?: boolean): void;
 export declare function finalizePureQueue(completingTransition?: Transition | null, incomplete?: boolean): void;
-export declare function trackOptimisticStore(store: any): void;
+/**
+ * Count of live `affects()` registrations across the system (including
+ * store-scope inherited marks). Gates the read-path mark check in `read()` so
+ * graphs that never use the feature pay one integer compare.
+ */
+export declare let activeAffectsMarks: number;
+/**
+ * Counter mutation seam for the mark engine in affects.ts: an imported `let`
+ * binding is read-only, and the read-path gate above must stay a plain module
+ * variable so `read()` pays one integer compare, not a function call.
+ *
+ * @internal
+ */
+export declare function shiftAffectsMarks(delta: 1 | -1): void;
 export declare const globalQueue: GlobalQueue;
 /**
- * Synchronously processes the pending reactive queue: runs every scheduled
- * memo/effect/computation that has dirty inputs, until the graph is settled.
+ * Synchronously processes the pending reactive queue, or runs `fn` in a synchronous
+ * flush scope before draining the queue.
  *
  * Reactive updates are normally batched onto the microtask queue, so multiple
  * writes in a row collapse into a single update pass. Call `flush()` when you
  * need to *observe* the result of those writes synchronously — most commonly
- * in tests, but also at the boundary of imperative integration code.
+ * in tests, but also at the boundary of imperative integration code. Pass a
+ * callback when the writes themselves should bypass microtask scheduling and
+ * drain synchronously when the callback returns.
  *
  * @example
  * ```ts
@@ -90,9 +151,20 @@ export declare const globalQueue: GlobalQueue;
  * setCount(5);
  * flush();
  * expect(doubled()).toBe(10);
+ *
+ * flush(() => setCount(6));
+ * expect(doubled()).toBe(12);
+ *
+ * // Nested flushes drain at each level:
+ * flush(() => {
+ *   setCount(7);
+ *   flush(() => setCount(8)); // inner drain — effects fire here
+ *   // outer continues with up-to-date state
+ * });
  * ```
  */
 export declare function flush(): void;
+export declare function flush<T>(fn: () => T): T;
 export declare function currentTransition(transition: Transition): Transition;
 export declare function setActiveTransition(transition: Transition | null): void;
 export declare function runInTransition<T>(transition: Transition, fn: () => T): T;