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

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

@@ -1,239 +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";
-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[];
-}
-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); "transition" = a transition was
-     * active 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" | "transition" | "optimistic";
-    /**
-     * The changed value was held in `_pendingValue` (a transition hold) rather
-     * than committed directly; its reveal happens on the transition's own
-     * schedule. Held runs are excluded from waste accounting.
-     */
-    held: boolean;
-}
-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;
-}
-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;
-}
-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[];
-    /**
-     * 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;
-    format: typeof formatRerun;
-}
-/** 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 declare const attribution: Attribution;

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

@@ -1,176 +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>;
-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 until() machinery hook. Idempotent; called by until() before
- * any authoritative-view read happens (same late-binding contract as the
- * optimistic engine). */
-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;

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

@@ -1,95 +0,0 @@
-import { type Attribution } from "./attribution.cjs";
-import type { Computed, Link, Owner, Signal } from "./types.cjs";
-export interface DevHooks {
-    onOwner?: (owner: Owner) => void;
-    onGraph?: (value: any, owner: Owner | null) => void;
-    onUpdate?: () => void;
-    onStoreNodeUpdate?: (state: any, property: PropertyKey, value: any, prev: any) => void;
-}
-/**
- * `info` is the advisory tier: a structural fact worth surfacing that is not
- * presumptively a bug (e.g. a 2-deep sequential fetch chain, which may be an
- * intrinsic data dependency). Budget/assertion consumers should treat only
- * `warn`/`error` as failures unless they opt in to `info`.
- */
-export type DiagnosticSeverity = "info" | "warn" | "error";
-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" | "SETTLE_WALK_UNINITIALIZED_SOURCE" | "FLUSH_IN_EFFECT_CALLBACK" | "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" | "HUGE_FAN_OUT" | "HUGE_FAN_IN" | "HOT_SCOPE_RERUNS" | "HOT_SCOPE_TIME" | "WIDE_SCOPE_DEPS" | "UNSTABLE_MEMO_OUTPUT" | "WIDE_WRITE" | "ASYNC_WATERFALL" | "HOT_SCOPE_FANOUT";
-export type DiagnosticKind = "strict-read" | "async" | "write" | "lifecycle" | "owner" | "error" | "perf" | "graph";
-/** First warning when a node's live edge count reaches this size. */
-export declare const GRAPH_SIZE_WARN_AT = 2000;
-/** Repeat the warning at this interval after the first. */
-export declare const GRAPH_SIZE_WARN_EVERY = 500;
-export interface DiagnosticEvent {
-    sequence: number;
-    code: DiagnosticCode;
-    kind: DiagnosticKind;
-    severity: DiagnosticSeverity;
-    message: string;
-    ownerId?: string;
-    ownerName?: string;
-    nodeName?: string;
-    data?: Record<string, unknown>;
-}
-export type DiagnosticListener = (event: DiagnosticEvent) => void;
-export interface DiagnosticCapture {
-    readonly events: readonly DiagnosticEvent[];
-    clear(): void;
-    stop(): DiagnosticEvent[];
-}
-export interface Diagnostics {
-    subscribe(listener: DiagnosticListener): () => void;
-    capture(): DiagnosticCapture;
-    /**
-     * Registers a console footer printed after the first console report of
-     * each diagnostic code — a discovery pointer to deeper guidance (e.g.
-     * solid-js registers its shipped repair skill). Returning undefined for
-     * an event suppresses the footer. Passing undefined unregisters and
-     * resets the once-per-code memory.
-     */
-    setConsoleFooter(footer: ((event: DiagnosticEvent) => string | undefined) | undefined): void;
-}
-export interface Dev {
-    hooks: DevHooks;
-    diagnostics: Diagnostics;
-    /** "Why did this run" re-run attribution — see attribution.ts. */
-    attribution: Attribution;
-    getChildren: typeof getChildren;
-    getSignals: typeof getSignals;
-    getParent: typeof getParent;
-    getSources: typeof getSources;
-    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[];
-export declare function getSignals(owner: Owner): any[];
-export declare function getParent(owner: Owner): Owner | null;
-export declare function getSources(computation: Computed<any>): (Signal<any> | Computed<any>)[];
-export declare function getObservers(node: Signal<any> | Computed<any>): Computed<any>[];
-/**
- * DEV-only: bump live edge counts after a new graph link and warn when a
- * node grows an unusually large fan-out (many subscribers on one source) or
- * fan-in (many sources on one computation). Repeat-reads that `link()`
- * dedupes never reach here. Always-on in dev — unlike the opt-in attribution
- * engine, a graph-size pathology should surface without asking.
- */
-export declare function noteGraphLink(dep: Signal<any> | Computed<any>, sub: Computed<any>): void;
-/** DEV-only: drop live edge counts when a link is removed. */
-export declare function unnoteGraphLink(link: Link): void;

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

@@ -1,30 +0,0 @@
-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;
-    _modified: boolean;
-    _prevValue: T | undefined;
-    _type: number;
-    _boundRunEffect?: () => void;
-}
-/**
- * Effects are the leaf nodes of our reactive graph. When their sources change, they are
- * automatically added to the queue of effects to re-execute, which will cause them to fetch their
- * sources and recompute
- */
-export declare function effect<T>(compute: (prev: T | undefined) => T, effect: (val: T, prev: T | undefined) => void | (() => void), error?: (err: unknown, cleanup: () => void) => void | (() => void), options?: NodeOptions<any> & {
-    user?: boolean;
-    defer?: boolean;
-    schedule?: boolean;
-}): void;
-export interface TrackedEffect extends Computed<void> {
-    _modified: boolean;
-    _type: number;
-    _run: () => void;
-}
-/**
- * Internal tracked effect - bypasses heap, goes directly to effect queue.
- * Runs as a leaf owner: child primitives and onCleanup are forbidden (__DEV__ throws).
- * Uses stale reads.
- */
-export declare function trackedEffect(fn: () => void | (() => void), options?: NodeOptions<any>): void;

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

@@ -1,56 +0,0 @@
-/**
- * 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);
-}
-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;
-/**
- * Rejection value of `until(fn, { timeout })` when the predicate does not turn
- * truthy within the window. Inside an `action()`, the rejection is thrown back
- * in at the `yield` point — catchable there, or the action fails and its
- * optimistic state reverts.
- */
-export declare class TimeoutError extends Error {
-    constructor(message?: string);
-}
-export declare class NoOwnerError extends Error {
-    constructor();
-}
-export declare class ContextNotFoundError extends Error {
-    constructor();
-}

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

@@ -1,15 +0,0 @@
-export type ExternalSourceFactory = (fn: (prev: any) => any, trigger: () => void) => ExternalSource;
-export interface ExternalSource {
-    track: (prev: any) => any;
-    dispose: () => void;
-}
-export interface ExternalSourceConfig {
-    factory: ExternalSourceFactory;
-    untrack?: <T>(fn: () => T) => T;
-}
-export declare let externalSourceConfig: {
-    factory: ExternalSourceFactory;
-    untrack: <T>(fn: () => T) => T;
-} | null;
-export declare function enableExternalSource(config: ExternalSourceConfig): void;
-export declare function _resetExternalSourceConfig(): void;

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

@@ -1,28 +0,0 @@
-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 clearDeps(el: Computed<unknown>): void;
-export declare function unobserved(el: Computed<unknown>): void;
-/**
- * Deferred dormancy for never-observed auto-dispose computeds (#3078).
- *
- * An untracked top-level read of a subscriber-less observation-lifecycle memo
- * used to call unobserved() inline at the end of read(). That kept the leak
- * closed (the compute links the memo into its deps' sub lists — without a
- * teardown point a never-observed memo is retained by its sources forever;
- * upstream alien-signals has exactly this retention), but it made reads
- * destructive: each read disposed the node, the next read revived it with a
- * full recompute in whatever ambient transition/lane context happened to be
- * current, so consecutive reads could return different answers with no write
- * in between.
- *
- * Instead, reads queue the node here and the scheduler sweeps at the top of
- * the next flush (before runHeap, so a same-tick dirtying is reclaimed
- * instead of recomputed). Reads become idempotent within a tick (the node
- * stays alive and serves its cache, uniform with observed memos) while
- * reclamation still happens within one microtask — the enqueue site arms
- * schedule(), so a flush is guaranteed even when no other work is queued.
- */
-export declare const dormantNodes: Set<Computed<unknown>>;
-export declare function sweepDormant(): 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,22 +0,0 @@
-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;
-    _min: number;
-    _max: number;
-}
-export declare function increaseHeapSize(n: number, heap: Heap): void;
-export declare function insertIntoHeap(n: Computed<any>, heap: Heap): void;
-export declare function insertIntoHeapHeight(n: Computed<unknown>, heap: Heap): void;
-export declare function deleteFromHeap(n: Computed<unknown>, heap: Heap): void;
-export declare function markHeap(heap: Heap): void;
-export declare function markNode(el: Computed<unknown>, newState?: number): void;
-export declare function runHeap(heap: Heap, recompute: (el: Computed<unknown>) => void): void;