@solidjs/signals 2.0.0-rc.0 → 2.0.0-rc.10

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

@@ -1,170 +0,0 @@
-import { type Heap } from "./heap.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";
-export declare const dirtyQueue: Heap;
-export declare const zombieQueue: Heap;
-export declare let clock: number;
-export declare let activeTransition: Transition | null;
-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 setProjectionWriteActive(value: boolean): void;
-export declare function setTrackedQueueCallback(value: boolean): void;
-export type QueueCallback = (type: number) => void;
-type QueueStub = {
-    _queues: [QueueCallback[], QueueCallback[]];
-    _children: QueueStub[];
-};
-type OptimisticNode = Signal<any> | Computed<any>;
-export interface Transition {
-    _time: number;
-    _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;
-    _done: boolean | 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;
-    addChild(child: IQueue): void;
-    removeChild(child: IQueue): void;
-    created: number;
-    notify(node: Computed<any>, mask: number, flags: number, error?: any): boolean;
-    stashQueues(stub: QueueStub): void;
-    restoreQueues(stub: QueueStub): void;
-    _parent: IQueue | null;
-}
-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;
-    notify(node: Computed<any>, mask: number, flags: number, error?: any): boolean;
-    run(type: number): void;
-    enqueue(type: number, fn: QueueCallback): void;
-    stashQueues(stub: QueueStub): void;
-    restoreQueues(stub: QueueStub): void;
-}
-export declare class GlobalQueue extends Queue {
-    _running: boolean;
-    _batch: Transition;
-    static _update: (el: Computed<unknown>) => void;
-    static _dispose: (el: Computed<unknown>, self: boolean, zombie: boolean) => void;
-    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;
-/**
- * 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, 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. Pass a
- * callback when the writes themselves should bypass microtask scheduling and
- * drain synchronously when the callback returns.
- *
- * @example
- * ```ts
- * const [count, setCount] = createSignal(0);
- * const doubled = createMemo(() => count() * 2);
- *
- * 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;

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

@@ -1,148 +0,0 @@
-import type { NOT_PENDING } from "./constants.cjs";
-import type { OptimisticLane } from "./lanes.cjs";
-import type { IQueue, Transition } from "./scheduler.cjs";
-export interface Disposable {
-    (): void;
-}
-export interface Link {
-    _dep: Signal<unknown> | Computed<unknown>;
-    _sub: Computed<unknown>;
-    _nextDep: Link | null;
-    _prevSub: Link | null;
-    _nextSub: Link | null;
-    /**
-     * `_sub._depGen` at the time this link was created or last revalidated
-     * in-order. A link stamped with the subscriber's current pass generation is
-     * inside the validated `[deps.._depsTail]` prefix — an O(1) replacement for
-     * scanning the dep list to answer membership (see `link()`).
-     */
-    _gen: number;
-    _pendingObserver?: boolean;
-}
-export interface NodeOptions<T> {
-    id?: string;
-    name?: string;
-    transparent?: boolean;
-    equals?: ((prev: T, next: T) => boolean) | false;
-    ownedWrite?: boolean;
-    /** Exclude this signal from snapshot capture (internal — not part of public API) */
-    _noSnapshot?: boolean;
-    unobserved?: () => void;
-    lazy?: boolean;
-    sync?: boolean;
-    /**
-     * Commit #0. When present (checked with `in`, so an explicit `undefined`
-     * counts), the node is born committed with this value instead of
-     * STATUS_UNINITIALIZED: reads serve it everywhere, nothing suspends to
-     * Loading boundaries, transitions are never held, and the window is
-     * verdict-quiet (`isPending` stays false — commit #0 answers the question
-     * by declaration; first-load affordances live in the value itself). After
-     * the first real answer lands, normal refetch/pending semantics apply.
-     */
-    loadingValue?: T;
-}
-export interface RawSignal<T> {
-    _subs: Link | null;
-    _subsTail: Link | null;
-    _value: T;
-    _snapshotValue?: any;
-    _name?: string;
-    _equals: false | ((a: T, b: T) => boolean);
-    _config: number;
-    _unobserved?: () => void;
-    _time: number;
-    _transition: Transition | null;
-    _pendingValue: T | typeof NOT_PENDING;
-    _overrideValue?: T | typeof NOT_PENDING;
-    /**
-     * The transaction that owns the active override (stamped at optimistic
-     * write, cleared at settle). Ownership must live on the node: a lane's
-     * _transition is a scheduling affinity that a shared subscriber can merge
-     * across transactions (#2912) — following it would let one action's settle
-     * revert another action's live override. Node-level sibling of the store
-     * layer's STORE_OPTIMISTIC_OWNERS stamps (#2899). `null` = ambient write.
-     */
-    _overrideOwner?: Transition | null;
-    _optimisticLane?: OptimisticLane;
-    _pendingSignal?: Signal<boolean>;
-    _latestValueComputed?: Computed<T>;
-    _parentSource?: Signal<any> | Computed<any>;
-    /**
-     * Live `affects()` marks on this node (refcount). Non-zero is declared
-     * motion: the node — and, via the verdict layer's dep-graph coverage walk,
-     * everything derived from it — reads pending regardless of graph state,
-     * until every declaring transaction settles/reverts and releases its mark.
-     * This count is the mark's ONLY graph state: the dedicated channel stores
-     * nothing downstream and never touches status flags, errors, or pending
-     * sources.
-     */
-    _affectsCount?: number;
-}
-export interface FirewallSignal<T> extends RawSignal<T> {
-    _firewall: Computed<any>;
-    _nextChild: FirewallSignal<unknown> | null;
-}
-export type Signal<T> = RawSignal<T> | FirewallSignal<T>;
-export interface Owner {
-    id?: string;
-    _config: number;
-    _snapshotScope?: boolean;
-    /** Effect-returned cleanup; managed across reruns, invoked at true disposal */
-    _cleanup?: () => void;
-    _disposal: Disposable | Disposable[] | null;
-    _parent: Owner | null;
-    _context: Record<symbol | string, unknown>;
-    _childCount: number;
-    _queue: IQueue;
-    _firstChild: Owner | null;
-    _nextSibling: Owner | null;
-    _prevSibling: Owner | null;
-    _pendingDisposal: Disposable | Disposable[] | null;
-    _pendingFirstChild: Owner | null;
-}
-export interface Computed<T> extends RawSignal<T>, Owner {
-    _deps: Link | null;
-    _depsTail: Link | null;
-    /** Recompute-pass counter; bumped when dep revalidation starts. */
-    _depGen: number;
-    _flags: number;
-    _blocked?: boolean;
-    _pendingSources?: Set<Computed<any>>;
-    _error?: unknown;
-    _statusFlags: number;
-    _height: number;
-    _nextHeap: Computed<any> | undefined;
-    _prevHeap: Computed<any>;
-    _fn: (prev?: T) => T;
-    _inFlight: PromiseLike<T> | AsyncIterable<T> | null;
-    _child: FirewallSignal<any> | null;
-    _notifyStatus?: (status?: number, error?: any) => void;
-    /**
-     * Question-scoped pending classification of the node's CURRENT pending
-     * window: `true` means the in-flight recompute is a re-ask of the same
-     * question (refresh/poll/confirm — no tracked input changed value), so the
-     * shown answer still answers the question and the node reads NOT pending.
-     * Set by `recompute` from `REACTIVE_REASK`, cleared on landing
-     * (`clearStatus`). Meaningless while not STATUS_PENDING.
-     */
-    _reask: boolean;
-    /**
-     * True while a `loadingValue` node's first real answer hasn't landed: the
-     * node was born committed (commit #0 = the loading value) and `handleAsync`
-     * serves that committed value instead of throwing NotReadyError, so first
-     * flights never suspend readers, trip boundaries, or hold transitions.
-     * The window is verdict-quiet: `isPending` stays false, because commit #0
-     * answers the question by declaration (first-load affordances belong to
-     * the value channel). Cleared by the first value landing on any path (sync
-     * return, sync-resolved promise, first iterator yield, async settle); a
-     * real error leaves it set — errors answer reads but don't enter the value
-     * lineage, so a retry serves the loading value again. Once cleared, normal
-     * pending/refetch semantics apply forever.
-     */
-    _loading: boolean;
-}
-export interface Root extends Owner {
-    _root: true;
-    _parentComputed: Computed<any> | null;
-    dispose(self?: boolean): void;
-}

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

@@ -1,2 +0,0 @@
-export declare function latest<T>(fn: () => T): T;
-export declare function isPending(fn: () => any): boolean;

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

@@ -1,10 +0,0 @@
-export { $REFRESH, ContextNotFoundError, NoOwnerError, NotReadyError, action, createContext, createOwner, createRoot, runWithOwner, flush, getNextChildId, peekNextChildId, getContext, setContext, getOwner, isDisposed, getObserver, isEqual, untrack, isPending, latest, refresh, SUPPORTS_PROXY, setSnapshotCapture, markSnapshotScope, releaseSnapshotScope, clearSnapshots, enforceLoadingBoundary, enableExternalSource, resetErrorHalt } from "./core/index.cjs";
-import { type Dev } from "./core/index.cjs";
-export declare const DEV: Dev | undefined;
-export type { Owner, Context, ContextRecord, IQueue, ExternalSourceFactory, ExternalSource, ExternalSourceConfig, Refreshable, Dev, DevHooks, DiagnosticCapture, DiagnosticCode, DiagnosticEvent, DiagnosticKind, Diagnostics, DiagnosticSeverity } from "./core/index.cjs";
-export { createSignal, createMemo, createEffect, createRenderEffect, createTrackedEffect, createReaction, createOptimistic, resolve, onSettled, onCleanup } from "./signals.cjs";
-export type { Accessor, SourceAccessor, Setter, Signal, ComputeFunction, EffectFunction, EffectBundle, EffectOptions, SignalOptions, MemoOptions, NoInfer } from "./signals.cjs";
-export { affects } from "./affects.cjs";
-export { mapArray, repeat, type Maybe } from "./map.cjs";
-export * from "./store/index.cjs";
-export { createLoadingBoundary, createErrorBoundary, createRevealOrder, flatten, type RevealOrder } from "./boundaries.cjs";

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

@@ -1,69 +0,0 @@
-import { type Accessor } from "./signals.cjs";
-export type Maybe<T> = T | void | null | undefined | false;
-/**
- * Reactively maps an array, reusing the previously-mapped value for unchanged
- * items.
- *
- * The callback shape follows the keying mode:
- * - default / `keyed: true` receives `(item, index)` where `item` is the raw
- *   row value and `index` is an accessor.
- * - `keyed: false` receives `(item, index)` where `item` is an accessor and
- *   `index` is a stable number.
- * - `keyed: item => key` receives accessors for both arguments.
- *
- * This is the underlying helper that powers `<For>`. App code should use
- * `<For>` directly; reach for `mapArray` when implementing custom list
- * components.
- *
- * - `options.keyed` — `true` (default for primitives) compares by identity;
- *   `false` falls back to index-only mapping; pass a function `(item) => key`
- *   for stable identity by extracted key.
- * - `options.fallback` — accessor returning a value to show when the input is
- *   empty.
- *
- * @example
- * ```ts
- * const view = mapArray(
- *   items,
- *   (item, index) => `${index()}: ${item.label}`,
- *   { fallback: () => "no items" }
- * );
- * ```
- *
- * @description https://docs.solidjs.com/reference/reactive-utilities/map-array
- */
-export declare function mapArray<Item, MappedItem>(list: Accessor<Maybe<readonly Item[]>>, map: (value: Item, index: Accessor<number>) => MappedItem, options?: {
-    keyed?: true;
-    fallback?: Accessor<any>;
-    name?: string;
-}): Accessor<MappedItem[]>;
-export declare function mapArray<Item, MappedItem>(list: Accessor<Maybe<readonly Item[]>>, map: (value: Accessor<Item>, index: number) => MappedItem, options: {
-    keyed: false;
-    fallback?: Accessor<any>;
-    name?: string;
-}): Accessor<MappedItem[]>;
-export declare function mapArray<Item, MappedItem>(list: Accessor<Maybe<readonly Item[]>>, map: (value: Accessor<Item>, index: Accessor<number>) => MappedItem, options: {
-    keyed: (item: Item) => any;
-    fallback?: Accessor<any>;
-    name?: string;
-}): Accessor<MappedItem[]>;
-/**
- * Reactively renders a callback `count` times, reusing previously-rendered
- * entries when only the count changes. Underlying helper for `<Repeat>`.
- *
- * - `options.from` — start index (default `0`); useful for offset/windowed
- *   rendering.
- * - `options.fallback` — accessor returning a value to show when count is `0`.
- *
- * @example
- * ```ts
- * const view = repeat(count, i => `Item ${i}`, { fallback: () => "empty" });
- * ```
- *
- * @description https://docs.solidjs.com/reference/reactive-utilities/repeat
- */
-export declare function repeat(count: Accessor<number>, map: (index: number) => any, options?: {
-    from?: Accessor<number | undefined>;
-    fallback?: Accessor<any>;
-    name?: string;
-}): Accessor<any[]>;

package/dist/types-cjs/package.json

@@ -1,3 +0,0 @@
-{
-  "type": "commonjs"
-}