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

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

@@ -1,495 +0,0 @@
-import type { Computed } from "./types.cjs";
-/**
- * Dev-mode "why did this run" attribution.
- *
- * The runtime already knows the full dependency set of every scope; this
- * module surfaces it. Every value commit stamps its node with a ChangeRecord
- * (a write, an async landing, a refresh() invalidation, or a derived change
- * whose `causes` chain back to root writes). When a computation re-executes,
- * the deps whose stamp is newer than the node's last run are its causes, so
- * each re-run can be explained as a chain down to the originating write:
- *
- *   [why-run] effect "docTitle" ran (run 4)
- *     ← memo "userLabel" changed (#6)
- *       ← signal "notifications" write (#5) 2 → 3
- *
- * This module is the attribution ENGINE: all semantics live here, and it is
- * decoupled from the core. `enable()` installs it into the core's narrow
- * dev-only hook points (attribution-hooks.ts); core's only obligation is to
- * call those hooks with true facts. Disabled cost is one null check per hook
- * site; prod builds fold the sites out entirely. The same hook surface is the
- * intended substrate for external consumers (devtools) — one mechanism, two
- * front-ends.
- */
-export type ChangeKind = "write" | "derived" | "async" | "refresh";
-/**
- * Provenance of a root change: the imperative frame that performed it.
- *
- * - `interaction` — a user event handler (the web runtime marks dispatch via
- *   `withInteraction`). `name` is the event type, `target` the element hit
- *   (`button#next "Next →"`), `at` the dispatch time on the `performance.now()`
- *   clock — the base every feedback-latency number is measured from.
- * - `effect` — an effect callback (`name` = the effect's name; `run` = the
- *   compute run whose effect phase performed the write, when that run was
- *   recorded — so a write can be joined to the re-run that produced it).
- * - `action` — a step of an `action()` generator (`name` = the generator's
- *   name, when it has one). Writes after an `await` (not a `yield`) run in a
- *   bare microtask and stamp `external` — the documented escape.
- * - `async` — an async landing (`name` = the node whose flight landed).
- * - `external` — none of the above: timers, sockets, promise callbacks, setup.
- *
- * `interaction` on a non-interaction frame is the user event the frame runs
- * under — an action started by a click, an effect whose run was caused by a
- * click's write, a landing whose flight a click started. It is what lets
- * every downstream cost be keyed by the interaction that paid for it.
- */
-export interface ChangeOrigin {
-    kind: "interaction" | "effect" | "action" | "async" | "external";
-    name?: string;
-    target?: string;
-    at?: number;
-    interaction?: ChangeOrigin;
-    /** `effect` only: the `RerunEvent.run` of the compute run this callback belongs to. */
-    run?: number;
-}
-/** A user interaction, as the web runtime describes it to `withInteraction`. */
-export interface InteractionRef {
-    /** Event type — `click`, `keydown`, `input`… */
-    type: string;
-    /** The element hit, e.g. `button#next "Next →"`. */
-    target?: string;
-    /** Dispatch time on the `performance.now()` clock; defaults to now. */
-    at?: number;
-}
-export interface ChangeRecord {
-    /** Global monotonic change sequence — orders causes across the app. */
-    seq: number;
-    kind: ChangeKind;
-    name: string;
-    /** Short previews of the value transition (writes only). */
-    prev?: string;
-    value?: string;
-    /** First user frames of the triggering write's stack (opt-in). */
-    stack?: string[];
-    /** For derived changes: the upstream changes that produced this one. */
-    causes?: ChangeRecord[];
-    /** Root changes only: who performed the write. */
-    origin?: ChangeOrigin;
-    /** Root changes only: when the write was stamped (`performance.now()` clock). */
-    at?: number;
-}
-export interface RerunEvent {
-    /** Global monotonic run sequence. */
-    run: number;
-    /** How many times this node has re-run since attribution was enabled. */
-    nodeRuns: number;
-    nodeKind: "effect" | "memo";
-    nodeName: string;
-    node: Computed<any>;
-    /**
-     * The deps that changed since this node's previous run. Empty means the
-     * re-run was not triggered by a tracked value change (creation-adjacent
-     * pull, error retry, or a cause this prototype does not stamp yet).
-     */
-    causes: ChangeRecord[];
-    /** Dependency count after this run. */
-    depCount: number;
-    /** Names of deps this run subscribed to that the previous run did not. */
-    depsAdded: string[];
-    /** Names of deps the previous run had that this run dropped. */
-    depsRemoved: string[];
-    /** Wall time of this run excluding nested recomputes (ms). */
-    selfMs: number;
-    /** Wall time of this run including nested recomputes (ms). */
-    totalMs: number;
-    /**
-     * Whether the run produced a changed value. A PLAIN memo run with
-     * `changed: false` was pure waste — the equality cutoff stopped it from
-     * notifying anyone. Effects run with `_equals: false` in core (their
-     * effect phase re-fires on every recompute), so the engine derives this
-     * fact itself: an effect run whose compute output is identical to the
-     * previous run's reports `changed: false` — the phase re-fired with the
-     * same input, pure waste. Side-effect-only computes (`undefined` output)
-     * are exempt: identity of `undefined` proves nothing about their work.
-     * Summed as `wastedMs` in costs() (plain, non-held runs only — see
-     * `phase`).
-     */
-    changed: boolean;
-    /**
-     * Which posture this run executed under. "optimistic" = under an
-     * optimistic lane (overlay recompute); "held" = a hold was open or owns
-     * the node (the run may be replayed/settled later); "plain" = an ordinary
-     * committed run. Overlay runs are real work (they count toward time
-     * budgets) but are never blamed as waste, and costs() reports their time
-     * separately as `overlayMs`.
-     */
-    phase: "plain" | "held" | "optimistic";
-    /**
-     * The changed value was parked in `_pendingValue` (held) rather than
-     * committed directly; its reveal happens on the hold's own schedule. Held
-     * runs are excluded from waste accounting.
-     */
-    held: boolean;
-    /** The user interaction this run traces back to through its causes, if any. */
-    interaction?: ChangeOrigin;
-}
-export interface AttributionOptions {
-    /** Pretty-print each re-run to the console (default true). */
-    log?: boolean;
-    /** Capture the user stack frame of each write — slow (default false). */
-    stacks?: boolean;
-    /** Ring-buffer size for `history()` (default 200). */
-    historyLimit?: number;
-    /**
-     * Hot-scope warning: emit a diagnostic when one scope re-runs `count`
-     * times within `windowMs` (default 120 runs / 1000ms — deliberately above
-     * animation-frame cadence, so a legitimate rAF-driven scope at 60/s does
-     * not cry wolf). `false` disables.
-     */
-    hotRuns?: {
-        count: number;
-        windowMs: number;
-    } | false;
-    /**
-     * Wide-scope warning: emit a diagnostic when a scope's dependency count
-     * reaches this (default 30) — the coarse-read / helper-leak signature.
-     * Re-warns only if the count then grows by another 50%. `false` disables.
-     */
-    wideDeps?: number | false;
-    /**
-     * Time-budget warning: emit a diagnostic when one scope's summed self-time
-     * inside `windowMs` exceeds `budgetMs` (default 8ms / 1000ms — half a frame
-     * spent in one scope). Unlike `hotRuns` this catches the few-but-expensive
-     * scope that run counts miss. `false` disables.
-     */
-    hotTime?: {
-        budgetMs: number;
-        windowMs: number;
-    } | false;
-    /**
-     * Unstable-output warning: emit a diagnostic when a memo commits a
-     * referentially-new but shallowly-equivalent plain object/array on this
-     * many consecutive runs (default 4). Such a memo's equality gate never
-     * closes — every subscriber re-runs on every upstream change — which makes
-     * it a fan-out amplifier that is otherwise only findable by profiling.
-     * `false` disables.
-     */
-    unstableMemos?: number | false;
-    /**
-     * Written-fan-out warning: emit a diagnostic when a committed root
-     * invalidation (write, refresh, async landing) reaches a node with at
-     * least this many subscribers (default 250). Complements the always-on
-     * HUGE_FAN_OUT graph-size warning, specced against it deliberately:
-     * HUGE_FAN_OUT fires at LINK time from GRAPH_SIZE_WARN_AT (2000) up —
-     * static structure so large it warns even if never written — while this
-     * fires at WRITE time from a much lower bar, because fan-out only costs
-     * anything when the node actually changes. Once per node, re-warning only
-     * on 2x subscriber growth, so the two never spam the same node. `false`
-     * disables.
-     */
-    wideWrites?: number | false;
-    /**
-     * Async-waterfall warning: emit a diagnostic when an async flight that
-     * could only start after an upstream flight resolved (its recompute's
-     * cause chain reaches the upstream's async landing, and its origin
-     * post-dates that landing) forms a sequential chain of 2+ flights, each
-     * of which took at least `minFlightMs` (default 50ms). The duration gate
-     * is one safety valve for what the graph cannot see: a settled
-     * preload/cache hit resolves fast and never warns. In-flight preloads are
-     * absolved by origin: `markFlight()` stamps (and first-seen identity)
-     * prove work predated the upstream landing — parallel, not sequential.
-     * Chains of 2 emit at `info` severity, structured channel only (a
-     * dependent fetch is sometimes intrinsic, and unmarked external preloads
-     * are invisible); 3+ escalate to `warn` with console output. `false`
-     * disables.
-     */
-    waterfalls?: {
-        minFlightMs: number;
-    } | false;
-    /**
-     * Silent-hold warning: emit a diagnostic when a user's writes were held
-     * behind async work for at least `infoMs` (default 100ms — RAIL's "feels
-     * instant" ceiling) and the screen never acknowledged the wait — no
-     * `isPending()`/`latest()` reader downstream of the held writes or their
-     * blockers, no optimistic value, no `affects()` mark, and no lane effect
-     * painted while held. Below `warnMs`
-     * (default 200ms — the INP "good" ceiling) the event is advisory
-     * (structured channel only); at or above it the console gets the finding.
-     * The engine measures to the commit, not the paint, so every number is a
-     * floor on what the user saw; the thresholds sit at the strict end of the
-     * band on purpose. Holds that staged no root write (initial loads, bare
-     * `refresh()`) are never judged: nothing the user did went unanswered.
-     * `false` disables hold tracking altogether (`longHolds` included).
-     */
-    holds?: {
-        infoMs: number;
-        warnMs: number;
-    } | false;
-    /**
-     * Long-hold warning: emit a diagnostic when a hold's quiescent tail — the
-     * time from the LAST write to join it until it committed — reached
-     * `infoMs` (default 500ms), `warn` from `warnMs` (default 1000ms, where
-     * RAIL says the user loses the thread). Measured from the last join so a
-     * hold that keeps taking input (typing) is judged by each wait, not by its
-     * lifetime. A hold this long is past what a stale screen should carry,
-     * acknowledged or not: the honest UI is a fallback, which a `Loading`
-     * boundary gives only when it has not revealed yet or its `on` prop
-     * changed. Reported as LONG_HOLD when the hold was acknowledged; a silent
-     * long hold stays one SILENT_HOLD with the boundary repair appended.
-     * `false` disables.
-     */
-    longHolds?: {
-        infoMs: number;
-        warnMs: number;
-    } | false;
-}
-export interface ScopeCost {
-    name: string;
-    kind: "effect" | "memo";
-    runs: number;
-    selfMs: number;
-    /**
-     * Self-time of PLAIN, non-held runs that produced an unchanged value —
-     * the recoverable number. Overlay runs (optimistic/transition) are never
-     * counted here: an optimistic recompute landing back on the committed
-     * value is the mechanism working, not waste.
-     */
-    wastedMs: number;
-    /** Self-time spent in optimistic/transition (overlay) runs. */
-    overlayMs: number;
-}
-export interface WriteCost {
-    /** Root cause name (a signal write, async landing, or refresh target). */
-    name: string;
-    /** Number of downstream re-runs this root triggered. */
-    runs: number;
-    /** Summed self-time of every downstream re-run it caused. */
-    downstreamMs: number;
-}
-/**
- * Run `fn` as the handler of a user interaction: every root write it performs
- * (and every action step or effect the write causes) carries the interaction
- * as provenance. The web runtime wraps event dispatch in this; it is dev-only
- * and safe to call with no engine enabled.
- */
-export declare function withInteraction<T>(ref: InteractionRef, fn: () => T): T;
-/** `click on button#next "Next →"`, `effect "syncTitle"`, `action "save"`, … */
-export declare function formatOrigin(origin: ChangeOrigin): string;
-export declare function formatRerun(event: RerunEvent): string;
-export interface Attribution {
-    enable(opts?: AttributionOptions): void;
-    disable(): void;
-    subscribe(listener: (event: RerunEvent) => void): () => void;
-    history(): readonly RerunEvent[];
-    /** Re-run history for one node — pass a memo/effect accessor or raw node. */
-    why(target: unknown): RerunEvent[];
-    /** Current dependency names of one scope — the devtools subscription view. */
-    subscriptions(target: unknown): string[];
-    /**
-     * Aggregated cost tables since enable(): `scopes` ranked by self-time
-     * (with `wastedMs` = time spent on unchanged-value runs), `writes` ranked
-     * by total downstream re-run time each root write caused.
-     */
-    costs(): {
-        scopes: ScopeCost[];
-        writes: WriteCost[];
-    };
-    /**
-     * Every graph-provable sequential flight chain observed since enable()
-     * (ring-buffered like history()). Facts, not verdicts: chains are recorded
-     * regardless of the duration gate — the ASYNC_WATERFALL diagnostic is the
-     * thresholded view of the same data.
-     */
-    waterfalls(): readonly WaterfallRecord[];
-    /**
-     * Every settled transition hold that staged at least one root write since
-     * enable() (ring-buffered like history()). Facts, not verdicts: recorded
-     * regardless of duration or acknowledgment — the SILENT_HOLD diagnostic is
-     * the thresholded, unacknowledged subset.
-     */
-    holds(): readonly HoldEvent[];
-    /**
-     * What the user waited on, folded from holds() and the interaction on each
-     * re-run: `sources` ranks async sources by the silent time writes spent
-     * held behind them (with which affordances answered, how often, and which
-     * interactions were held); `interactions` ranks user events by the total
-     * time they cost — re-run work caused (long-flush hazard) beside time held
-     * (silent-hold hazard). Facts at every duration; SILENT_HOLD is the
-     * thresholded verdict. Two more tables round out the picture: `flights`
-     * counts each async source's flights and how many were abandoned before
-     * landing (the re-ask storm), and `fallbacks` measures how long each
-     * loading boundary showed its fallback and how often that was a flash.
-     */
-    feedback(): AttributionFeedbackTables;
-    /**
-     * Cooperative preload declaration: stamp a flight object (promise or async
-     * iterable) with its true kickoff time BEFORE the reactive graph sees it.
-     * A route preloader or query cache calls this on the promise it hands out
-     * (on the WRAPPER it mints, with the original kickoff time — wrapping
-     * defeats identity tracking otherwise); any dependent that later awaits it
-     * is then judged against the real start — work already in the air when its
-     * upstream landed is parallel, never a waterfall link. Callable while
-     * attribution is disabled (marks made at navigation time must survive a
-     * later enable()). Dev-only, like the whole DEV surface.
-     */
-    markFlight(flight: object, startedAt?: number): void;
-    /**
-     * Run `fn` as a user interaction's handler: root writes inside stamp it as
-     * their origin, and actions/effects/flights it causes carry it. The web
-     * runtime wraps every event dispatch in this; custom renderers and test
-     * harnesses call it themselves. Callable while attribution is disabled.
-     */
-    withInteraction: typeof withInteraction;
-    format: typeof formatRerun;
-    formatOrigin: typeof formatOrigin;
-}
-/** One landed flight: its node name, wall duration, and upstream chain. */
-export interface FlightLink {
-    name: string;
-    ms: number;
-}
-export interface WaterfallRecord {
-    /** Sequential flights, oldest first, ending at the flight that landed. */
-    chain: FlightLink[];
-    /** Summed wall time of the chain — the serialized cost. */
-    sequentialMs: number;
-}
-export interface HeldWrite {
-    name: string;
-    prev?: string;
-    value?: string;
-    origin?: ChangeOrigin;
-}
-export interface HoldEvent {
-    /**
-     * Wall time the user waited: from the interaction that performed the held
-     * writes when one is known (`interaction.at`) or the first flush that
-     * parked them, whichever is earlier, to the commit.
-     */
-    holdMs: number;
-    /**
-     * The quiescent tail: from the LAST held write to join (the user's final
-     * input) to the commit. Equal to `holdMs` for a single write; shorter when
-     * the hold kept taking input. The LONG_HOLD measure.
-     */
-    tailMs: number;
-    /** The user interaction whose writes were held, when the stamp is known. */
-    interaction?: ChangeOrigin;
-    /** Flushes that ended with the hold still open. */
-    flushes: number;
-    /** Root signal writes staged behind the hold (the user's unanswered input). */
-    heldWrites: HeldWrite[];
-    /** Async nodes the hold waited on (union across its parked flushes). */
-    blockers: string[];
-    /**
-     * Feedback the graph provably rendered for this hold, as `"<kind>:<node>"`
-     * — `isPending:posts`, `latest:page`, `optimistic:todos`, `affects:list`.
-     * Empty and `paintedDuringHold === 0` is the SILENT_HOLD signature.
-     */
-    acknowledgedBy: string[];
-    /**
-     * Effect callbacks that ran inside the hold's parked flushes. Mainline
-     * effects are stashed while a hold is open, so these are lane effects —
-     * readers of optimistic values and of `isPending()`/`latest()` companions,
-     * i.e. the screen changing in response to the hold. An unrelated effect
-     * cannot land here: it waits with everything else.
-     */
-    paintedDuringHold: number;
-    /** The hold was opened (or joined) by an `action()`. */
-    action: boolean;
-}
-export interface FeedbackSource {
-    /** The async nodes the holds waited on; empty when an action alone kept them open. */
-    sources: string[];
-    holds: number;
-    /** Summed wait across the holds (ms). */
-    heldMs: number;
-    worstMs: number;
-    /** Holds with no acknowledgment at all — the SILENT_HOLD signature, at any duration. */
-    silent: number;
-    silentMs: number;
-    /** Holds whose only acknowledgment was a `latest()` shadow: the input showed, nothing said "loading". */
-    latestOnly: number;
-    /**
-     * Holds whose quiescent tail (last write to join → commit) reached
-     * `longHolds.infoMs`, acknowledged or not — the LONG_HOLD signature at the
-     * table level. The affordance is not the whole answer there: a fallback
-     * (`Loading` keyed with `on`), a preload, a cache, or a faster source is.
-     * `longMs` sums the tails.
-     */
-    long: number;
-    longMs: number;
-    /** Which affordances answered, and in how many holds — ranked. */
-    acknowledgedBy: {
-        by: string;
-        holds: number;
-    }[];
-    /** Interactions whose writes were held here, ranked by holds. */
-    interactions: {
-        interaction: string;
-        holds: number;
-    }[];
-    /** Distinct root writes that were held. */
-    writes: string[];
-    /** Holds an action opened or joined. */
-    actions: number;
-}
-export interface FeedbackInteraction {
-    /** `click on button#next "Next →"` — type and target; repeated dispatches fold together. */
-    interaction: string;
-    /** Distinct dispatches seen (by dispatch time). */
-    dispatches: number;
-    /** Re-runs traced back to this interaction, and their summed self-time. */
-    runs: number;
-    selfMs: number;
-    /** The most re-run self-time a single dispatch caused — the long-flush hazard. */
-    worstDispatchMs: number;
-    /** Holds this interaction's writes waited in — the silent-hold hazard. */
-    holds: number;
-    heldMs: number;
-    silentMs: number;
-    worstHoldMs: number;
-}
-/** Per async source: how many flights it started, and how many it threw away. */
-export interface FlightStats {
-    source: string;
-    /** Flights registered (a recompute that produced a new promise/iterable). */
-    flights: number;
-    /** Flights that landed (whether or not the value changed). */
-    landed: number;
-    /**
-     * Flights superseded by a newer one before landing — the search-as-you-type
-     * signature when large: every keystroke asked, most answers were discarded.
-     * A debounced/equality-gated derivation between input and fetch is the repair.
-     */
-    abandoned: number;
-    /** Summed and worst wall time of landed flights (ms). */
-    landedMs: number;
-    worstMs: number;
-}
-/** Per loading boundary: how long, and how briefly, it showed its fallback. */
-export interface FallbackStats {
-    /** The boundary's owner path (`<App> › <Feed>`), or `boundary` when unnamed. */
-    boundary: string;
-    /** Times the fallback was shown. */
-    shows: number;
-    /** Summed and worst fallback duration (ms) across completed shows. */
-    shownMs: number;
-    worstMs: number;
-    /**
-     * Shows shorter than the flash window (default 150ms): a spinner that
-     * appeared and vanished — the other end of the SILENT_HOLD spectrum, too
-     * much feedback for too little wait. A preload, a cache, or lifting the
-     * fetch above the boundary removes the flash.
-     */
-    flashes: number;
-}
-export interface AttributionFeedbackTables {
-    sources: FeedbackSource[];
-    interactions: FeedbackInteraction[];
-    /** Async sources ranked by abandoned flights, then by flights. */
-    flights: FlightStats[];
-    /** Loading boundaries ranked by flashes, then by time shown. */
-    fallbacks: FallbackStats[];
-}
-export declare const attribution: Attribution;

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

@@ -1,185 +0,0 @@
-import { type OptimisticLane } from "./lanes.cjs";
-import type { Computed, FirewallSignal, NodeExtension, 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 pendingCheckActive: boolean;
-export declare let latestReadActive: boolean;
-export declare let context: Owner | null;
-export declare let currentOptimisticLane: OptimisticLane | null;
-export declare let snapshotCaptureActive: boolean;
-export declare let snapshotSources: Set<any> | null;
-export declare function setSnapshotCapture(active: boolean): void;
-export declare function markSnapshotScope(owner: Owner): void;
-export declare function releaseSnapshotScope(owner: Owner): void;
-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>;
-/** Lazily allocate a node's cold extension (ONE shape for signals and
- * computeds — `_x` access stays monomorphic). Installers write through
- * this; hot paths read `el._x?._field` gated by the _config presence bits.
- * Never call ext() just to store a field's default. */
-export declare function ext(el: {
-    _x: NodeExtension | null;
-}): NodeExtension;
-/**
- * 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, options: NodeOptions<T> | undefined): any;
-/**
- * The shared status notifier for effect nodes, installed once by effect.ts
- * at module evaluation (`this`-dispatched — one function serves every
- * effect, so nodes never store it). Boundary computeds keep their own
- * per-node channel on `_x._notifyStatus`, which takes precedence.
- */
-export declare let effectStatusNotify: ((this: any, status?: number, error?: any) => void) | null;
-export declare function setEffectStatusNotify(fn: NonNullable<typeof effectStatusNotify>): void;
-/** Resolve a node's status notifier: an own `_x` channel (boundaries) wins;
- * effect nodes (`_type` — EFFECT_PURE is 0, and only effect literals carry
- * the field) fall back to the shared notifier. Presence doubles as the
- * "display consumer" membership test in the status walks, exactly as the
- * per-node field did when every effect carried one. */
-export declare function statusNotifierOf(el: any): ((this: any, status?: number, error?: any) => void) | undefined;
-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>;
-/** 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). */
-export declare let slotUnobservedHook: (node: Signal<any>) => void;
-/** Install the shared slot-node unobserved handler (store module, once). */
-export declare function setSlotUnobserved(fn: (node: Signal<any>) => void): void;
-export declare function slotSignal<T>(v: T, equals: (a: T, b: T) => boolean, host: object, key: PropertyKey, acc: boolean, firewall?: Computed<unknown> | null): Signal<T>;
-export declare function optimisticSignal<T>(v: T, options?: NodeOptions<T>): Signal<T>;
-export declare function optimisticComputed<T>(fn: (prev?: T) => T | PromiseLike<T> | AsyncIterable<T>, options?: NodeOptions<T>): Computed<T>;
-export declare function isEqual<T>(a: T, b: T): boolean;
-/**
- * When set to a component name string, any reactive read that is not inside a nested tracking
- * scope will log a dev-mode warning. Managed automatically by `untrack(fn, strictReadLabel)`.
- */
-export declare let strictRead: string | false;
-export declare function setStrictRead(v: string | false): string | false;
-/**
- * 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);
- *   }
- * );
- * ```
- */
-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().
- */
-/**
- * Wake only authoritative-view readers (until() predicates) subscribed to `el`.
- * The A17-silent ack paths — an authoritative arrival equal to the active
- * override — use this so the predicate re-evaluates without re-firing
- * ordinary subscribers whose visible (override) value did not change.
- * Pay-for-use: reached through GlobalQueue._notifyAuthoritativeObservers,
- * installed at first until() call — apps that never use until() shake it.
- */
-export declare function notifyAuthoritativeObservers(el: Signal<any> | Computed<any>): void;
-/** 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). */
-export declare function installAuthoritativeRead(): void;
-export declare function readNodeFast<T>(el: Signal<T>): T | typeof READ_SLOW;
-export declare function read<T>(el: Signal<T> | Computed<T>): T;
-/**
- * Store-rewrite setter guard: the rewrite parks writes in a pending backing
- * (no setSignal at write time), so the owned-scope write protection must
- * fire at the setter entry instead. Mirrors setSignal's guard condition
- * minus the node-specific exemptions (ownedWrite/firewall), which don't
- * apply to plain store setters.
- */
-export declare function devGuardStoreSetterWrite(): void;
-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`,
- * `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);
- * }
- * ```
- */
-export declare function runWithOwner<T>(owner: Owner | null, fn: () => T): T;
-export declare function staleValues<T>(fn: () => T, set?: boolean): T;
-/**
- * Core marking half of `refresh()` (the public wrapper lives in signals.ts —
- * it validates the target, marks through here, then builds the quiescence
- * promise on the resolve()/until() effect machinery). Flags the node's next
- * recompute as a quiet re-ask and schedules it; no-ops for non-derived or
- * disposed targets and for same-tick manual writes.
- */
-export declare function markRefresh(node: Computed<any>): void;