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

package/dist/types-cjs/store/next/store.d.cts

@@ -1,121 +0,0 @@
-import type { Signal } from "../../core/types.cjs";
-import { type StoreNextFamily, type StoreNextTarget } from "./target.cjs";
-export declare function wrapNext<T extends Record<PropertyKey, any>>(value: T, parent?: StoreNextTarget | null, parentKey?: PropertyKey | null, fam?: StoreNextFamily | null): T;
-/** Unwrap our own proxies to their current backing; leave everything else. */
-export declare function unwrapValue(v: any): any;
-export declare function getNode(target: StoreNextTarget, key: PropertyKey, current: any, accKnown?: -1 | 0 | 1): Signal<any>;
-export declare function getHasNode(target: StoreNextTarget, key: PropertyKey, present: boolean): Signal<boolean>;
-export declare function getKeySetNode(target: StoreNextTarget): Signal<number>;
-/** Deep-witness bump: any value/shape change on a record with a live deep()
- * subscriber notifies it. One null check when unused. */
-export declare function bumpDeep(t: StoreNextTarget): void;
-/** Downgrade a prototype-overlay pending backing to the clone path: builds
- * the real container (committed + overlay writes − deletes) that fold will
- * SWAP in as the committed backing, exactly as if the draft had started on
- * the clone path. Consumers that need a complete container (reconcile's
- * diff walks, drafts escaping into other storage) call this. */
-export declare function materializePB(target: StoreNextTarget): void;
-/**
- * Adoption (2026-08-16c): the incoming object becomes the committed backing
- * IMMEDIATELY — reconcile is eagerly visible to every reader (shipped
- * contract; only its notifications batch), unlike setter writes which stay
- * pending until flush. Ownership resets (incoming is unowned/user data). Any
- * staged draft clone folds into the diff and is discarded — next is the
- * authoritative base (R21/R32).
- */
-export declare function adoptPB(target: StoreNextTarget, incoming: Record<PropertyKey, any>, eager?: boolean): void;
-/** Parked truth-staged pending backings (#3164 fold): a tentative draft that
- * opens while a folded landing's backing is live moves the staged container
- * here (see ensurePB); the tentative discard in notifyOptimisticWrites
- * restores it in place of the usual null. */
-export declare const stagedTruthPB: WeakMap<StoreNextTarget, Record<PropertyKey, any>>;
-/** Same logical slot: both values resolve to one (re-pointed) child target —
- * adoption preserved identity, so the slot did not change (R9). */
-export declare function targetsEqual(ov: any, nv: any): boolean;
-export declare function arrayStructureChanged(old: any[], neu: any[]): boolean;
-export declare function membershipChanged(old: Record<PropertyKey, any>, neu: Record<PropertyKey, any>): boolean;
-/**
- * The fold diff walks SUBSCRIPTION KEYS ONLY (legacy parity: `for key in
- * nodes`): nodes exist exactly where something tracked, so unobserved data
- * costs nothing here regardless of object size. Accessor safety rides the
- * sticky `t.a` flag — a node's key was necessarily read, so the get trap has
- * already seen whether it is an accessor.
- */
-/** One node's fold notification (shared by notifyFold's walk and the fused
- * adoption walk): accessor-aware compare + equality/identity-gated setSignal. */
-export declare function notifyKeyDiff(node: Signal<any>, key: PropertyKey, old: Record<PropertyKey, any>, neu: Record<PropertyKey, any>, probe?: boolean): void;
-/** Accessor-flag probe for the fused walk's early-continue (accessor keys
- * can never identity-skip: their VALUE is the descriptor's product). */
-export declare function hasAccessorFlag(node: Signal<any>): boolean;
-/** Fused-walk per-key notification with values already in hand: the caller
- * fetched both sides and handled the identity skip; this applies the
- * accessor branch (cached flag only — reconcile channel) or the plain
- * equality/identity-gated write. */
-export declare function notifyKeyValue(node: Signal<any>, key: PropertyKey, ov: any, nv: any, old: Record<PropertyKey, any>, neu: Record<PropertyKey, any>): void;
-/** Presence + membership halves of a fold notification (shared tail). */
-export declare function notifyFoldTail(t: StoreNextTarget, old: Record<PropertyKey, any>, neu: Record<PropertyKey, any>): void;
-export declare function notifyFold(t: StoreNextTarget, old: Record<PropertyKey, any>, neu: Record<PropertyKey, any>): void;
-/** Authoritative-write wrapper exported for the optimistic module: sets the
- * scheduler's projectionWriteActive through THIS module's binding (proven to
- * share the instance core reads — cross-module live-binding writes from other
- * store modules were observed not to propagate under the test transform). */
-export declare function runAuthoritative<T>(fn: () => T): T;
-/** Active optimistic override on an armed node (armed slot idles at
- * NOT_PENDING; undefined = unarmed plain node). */
-export declare function hasActiveOverride(node: Signal<any>): boolean;
-/** The reading computation is until()'s authoritative-view predicate — same
- * source of truth as core read()'s A17 carve-out (`context`, which persists
- * under untrack). optimisticView()'s composition gate consults exactly this:
- * write-side machinery (patch emission, tentative re-application) must keep
- * composing even when it runs inside an authoritative-write bracket. */
-export declare function authoritativeRead(): boolean;
-/** Serve-side authoritative gate: until()'s predicate PLUS truth authors —
- * the projection derive's draft (wrapDraft trap brackets, runAuthoritative;
- * the same posture pair ensurePB classifies drafts by). A source computing
- * the next truth must never read its callers' tentative overlays: a derive
- * continuation's `store.push` computing its index from an action's
- * optimistic row landed truth in the wrong slot and corrupted committed
- * state (#3108). Trap-level overlay serves gate on this so values, length,
- * membership, and keys leave the authoritative view together. */
-export declare function authoritativeServe(): boolean;
-export type SetStoreNextFunction<T> = (fn: (draft: T) => T | void) => void;
-/** Low-level setter primitive: opens write mode on a next proxy, runs `fn`,
- * emits write-time notifications at outermost exit, applies returned
- * replacements as adoptions. `guard=false` skips the owned-scope dev guard —
- * projection recomputes legitimately write from inside their computed. */
-export declare function storeSetterNext<T>(proxy: T, fn: (draft: T) => T | void, guard?: boolean): void;
-export declare function createStoreNext<T extends Record<PropertyKey, any>>(initialValue: T, shallow?: boolean): [T, SetStoreNextFunction<T>];
-/** True when `proxy` is a SHALLOW store (children served verbatim, slots
- * replaced by reference — #2932). The list driver uses this to choose the
- * slot-patch channel (collected row bodies) over per-record registration. */
-export declare function storeIsShallow(proxy: any): boolean;
-/** True when `proxy` belongs to a projection/optimistic FAMILY. The list
- * driver must DECLINE family arrays (external audit finding): family
- * structural changes never emit row/slot ops (the setter channel is
- * fam-gated; optimistic writes ride node overrides), and the proxy identity
- * is stable so the each-watch cannot catch the change either — an engaged
- * list would freeze on optimistic/projection structural updates. Record-
- * level family patches are unaffected (they have their own emission). */
-export declare function storeHasFamily(proxy: any): boolean;
-/** True when `proxy` belongs to an OPTIMISTIC family specifically. The list
- * driver declines these (audit finding, narrowed): optimistic user writes
- * ride node-level overrides — they never enter the reconcile walk, so no
- * row/slot ops are emitted and an engaged list would freeze on optimistic
- * structural changes. PROJECTION (non-optimistic) families are drivable:
- * their recomputes go through the reconcile walk, whose emissions are
- * transition-stamped in the apply queue like any other (equivalence-matrix
- * gated). Re-admitting optimistic families requires a lane-timed structural
- * emission mirroring emitPatchOptimistic, plus revert resync. */
-export declare function storeHasOptimisticFamily(proxy: any): boolean;
-/** Tracking deep snapshot (`deep()` for next targets): subscribes to the
- * key-set and deep-witness node at every reachable level, then returns the
- * plain view. Shared references and cycles handled via the visited set. */
-export declare function deepNext<T>(value: T): T;
-/**
- * Snapshot with per-object registration resolution (RUL-12 DAG ruling): every
- * reachable wrappable resolves through its target's CURRENT backing, so
- * privatized subtrees are seen through any parent path. Identity-preserving:
- * a subtree with no substitutions below returns its own object (zero copy for
- * settled, never-diverged graphs).
- */
-export declare function snapshotNext<T>(value: T): T;

package/dist/types-cjs/store/next/target.d.cts

@@ -1,166 +0,0 @@
-/**
- * Store rewrite — target & ownership (INTERNALS-STORE-STATE.md §1, §5b).
- *
- * The proxy wraps this internal target, never the raw (proxy-target
- * indirection, decision 2026-08-16d). `b` is the single committed home; `pb`
- * is the per-target pending backing (RUL-1's pending home): the CoW clone
- * created at first draft write, mutated natively by the draft, folded into
- * `b` at flush commit. Adoption (setter replacement / reconcile) parks an
- * UNOWNED incoming object in `pb` — fold swaps it in and ownership resets.
- *
- * Creation budget (§5b): one minimal target + one proxy + one storeLookup
- * entry per read-through object; zero layer slots; nodes, has-nodes, and the
- * key-set node are lazy, materialized only by subscription.
- */
-import type { Computed, Signal } from "../../core/types.cjs";
-/** Projection family (§7b): children wrap into the family's own map (writes
- * land in the projection, never the source family), and every node created
- * under the family carries the projection computed as its firewall. */
-export interface StoreNextFamily {
-    /** Optimistic family: nodes are born armed (`_overrideValue` slot) so every
-     * write rides the core optimistic engine — lanes, per-transaction ownership,
-     * reverts all core-native (§3, RUL-3). */
-    opt?: boolean;
-    /** Root proxy (registered with the scheduler's optimistic-store set for the
-     * transitionBlocked store-half, #2951). */
-    px?: any;
-    /** Targets currently carrying active node overrides (landing-consumption
-     * walk, RUL-2: visible landed truth replaces optimism). */
-    overlaid?: Set<any>;
-    /** Retaining transactions (#3164 fold ruling): every transaction that made
-     * an optimistic setter call on this family and may still be open. While
-     * any member is live, truth landings FOLD — they stage into the retaining
-     * transaction and reveal atomically at its settle, exactly like a signal
-     * landing under an active override. Dead members prune lazily at each
-     * landing (retainingTransition). */
-    rt?: Set<any>;
-    /** Flight-owned transaction (#3146): declared when a truth-flight
-     * registers (the ask's transaction — created by the flight's own pending
-     * throw when none was ambient, the causing write's when one was), renewed
-     * per settle event once the previous reveal committed. Bare optimistic
-     * writes and landings route into it BY DECLARATION; the transitionBlocked
-     * store-half checks it for ownership instead of reconstructing it from
-     * `_optimisticStores` membership. null = no flight declared one (sync
-     * derive, or a loading-window flight — the loading rail is
-     * transaction-invisible, #2933). */
-    ft?: any;
-    /** Normalized row-key fn (same resolution as the projection channels:
-     * `options.key`, "id" default, null = unkeyed). The staged-landing walk
-     * reads it: key-matched rows keep their proxy identity across a fold. */
-    key?: ((item: any) => any) | null;
-    map: WeakMap<object, StoreNextTarget>;
-    /** The projection computed — assigned after creation (accessor pattern). */
-    node: Computed<any> | null;
-    shallow?: boolean;
-}
-export interface StoreNextTarget {
-    /** Committed backing: source object (shared) or owned clone. */
-    v: Record<PropertyKey, any>;
-    /** Pending backing for the current flush (null when settled). */
-    pb: Record<PropertyKey, any> | null;
-    /** cached: committed backing is another store's proxy (§7b chained). */
-    ch: boolean;
-    /** live value-node count (deleted-key sweep fast-out in the fused walk). */
-    nc: number;
-    /** Lazy per-property subscription nodes (real core signals). */
-    n: Record<PropertyKey, Signal<any>> | null;
-    /** Lazy per-key presence nodes (`in` tracks presence, not value — R13). */
-    h: Record<PropertyKey, Signal<boolean>> | null;
-    /** Lazy key-set node: membership/iteration/$TRACK subscriptions (§6). */
-    k: Signal<number> | null;
-    /** Keys written through the traps since the last fold commit. Bounds the
-     * setter notify/hold-check to O(written) instead of O(subscribed nodes) —
-     * a record with thousands of per-key subscriptions (selection maps) would
-     * otherwise pay a full node scan on every write. null = no trap writes
-     * this batch (bulk paths fall back to the full scan); WK_ALL = bound
-     * unusable (array length write). LOAD-BEARING SHAPE RULE: array proxy
-     * targets carry their fields as named properties on a real array, and V8
-     * normalizes an array to dictionary properties as the named count grows
-     * (empirically at counts ≡ 0 mod 3 from 18 up on V8 13.x) — every trap
-     * field read then becomes a hash lookup (~15% uibench, tree suites
-     * worst). Future write-side state MUST ride an extension object, not new
-     * named fields. */
-    wk: Set<PropertyKey> | null;
-    /** Lazy deep-witness node: `deep()` subscribes ONE node per record instead
-     * of one per path; write paths bump it only when it exists. Separate from
-     * `k` so $TRACK/mapArray never rerun on leaf value changes (R9). */
-    dk: Signal<number> | null;
-    /** Parent target (path copying walks this at commit). */
-    u: StoreNextTarget | null;
-    /** Property key of this target in the parent's backing. */
-    pk: PropertyKey | null;
-    /** The proxy for this target (stable outward identity). */
-    px: any;
-    /** Sticky descendants flag (§6d). */
-    d: boolean;
-    /** Sticky accessors-seen flag: an own accessor property was observed on
-     * this target (first-read scan, defineProperty, or clone scan). Gates the
-     * fold diff's descriptor-safe path and the get trap's descriptor path. */
-    a: boolean;
-    /** Accessor scan performed (scan-once on first trap read; adopted data is
-     * not rescanned — legacy-parity behavior). */
-    sc: boolean;
-    /** Adoption diff base, non-null when the backing was swapped by adoption
-     * this batch: the view the nodes were LAST TOLD — the pre-batch committed
-     * backing, or the draft's pending backing when a draft preceded the
-     * adoption (its setter-exit notifications already moved the nodes, #3296).
-     * The deferred fold diffs incoming against this, never against committed. */
-    ab: Record<PropertyKey, any> | null;
-    /** Pending backing is a prototype-chain OVERLAY of the committed backing
-     * (`Object.create(v)` — own keys are this batch's writes, everything else
-     * reads through). O(written) per flush instead of O(container) clones
-     * (#3044); commit flattens own keys onto an owned committed backing in
-     * place. Only plain-data non-array non-family containers qualify;
-     * `materializePB` downgrades to the clone path when a consumer needs a
-     * real container (reconcile, draft escape). */
-    ovl: boolean;
-    /** Keys deleted in the overlay window (a prototype overlay cannot shadow
-     * a delete); null when none. */
-    del: Set<PropertyKey> | null;
-    /** Projection family, null for plain stores (§7b). */
-    fam: StoreNextFamily | null;
-    /** Shallow store root (values served raw). */
-    s: boolean;
-    /** Held committed view (#3074/#3075): the pre-hold committed backing,
-     * served to committed-visibility readers while `ht` is live. Adoption is
-     * eager by contract, but a projection recompute deriving from uncommitted
-     * inputs (a transition-held source, or a latest()-pull ahead of the flush)
-     * swaps the backing SPECULATIVELY — the old view must stay servable until
-     * the hold resolves. */
-    hv: Record<PropertyKey, any> | null;
-    /** The holder for `hv`: a live transition (cleared lazily when it is done)
-     * or the PLAIN_HOLD sentinel (a latest()-pull staging — cleared by the
-     * fold commit). null = no hold. */
-    ht: any;
-}
-/**
- * Ownership (first cut, decision 2026-08-16d): one WeakSet of store-owned
- * backings serving both the production identity-skip guard and the __TEST__
- * no-mutation oracle.
- */
-export declare const ownedRaw: WeakSet<object>;
-/** raw → target. The only raw-keyed lookup; boundary mechanism (O8). */
-export declare const storeNextLookup: WeakMap<object, StoreNextTarget>;
-/** __TEST__ oracle: every object ingested from a user (never mutate). */
-export declare const ingestedRaw: WeakSet<object> | null;
-export declare function devAssertNeverUserMutation(target: object): void;
-/** Injection table for optimistic-only store machinery (next/optimistic.ts).
- * Every call site is gated on `fam?.opt`, and optimistic families can only
- * be created by createOptimisticStore — whose install populates this — so
- * the non-null assertions at the sites hold by construction. Keeping the
- * implementations out of next/store.ts lets plain-store bundles tree-shake
- * the optimistic channel entirely. */
-export interface OptStoreHooks {
-    notifyOptimisticWrites(t: any, pb: Record<PropertyKey, any>): void;
-    optimisticView(t: any, src: Record<PropertyKey, any>): Record<PropertyKey, any>;
-    applyTentative(t: any, incoming: any, keyFn: ((item: any) => any) | null): void;
-    /** #3164 fold: does this live transaction still retain optimism (armed
-     * nodes or tracked stores)? Backs the held-truth masks in next/store.ts so
-     * plain-store bundles don't carry the transition-optimism probe. */
-    retainsOptimism(t: any): boolean;
-}
-export declare let optHooks: OptStoreHooks | null;
-export declare function setOptHooks(h: OptStoreHooks): void;
-/** Sticky descendants flag walk (§6d): reconcile's keyed pruning descends
- * only where subscriptions exist at/below. Nodes AND patches count. */
-export declare function markDescendants(target: StoreNextTarget): void;

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

@@ -1,143 +0,0 @@
-import { type Signal } from "../core/index.cjs";
-import type { Refreshable } from "../core/index.cjs";
-/** A reactive view of a store's value. Update it through the paired `StoreSetter`. */
-export type Store<T> = T;
-/**
- * A store setter. The callback receives a writable **draft** of the store.
- *
- * - **Mutate in place (canonical):** `s.foo = 1`, `s.list.push(x)`,
- *   `s.list.splice(i, 1)`. This is the default form for most updates.
- * - **Return a new value:** for shapes where mutation is awkward, most
- *   commonly removing items (`s => s.list.filter(...)`). Arrays are replaced
- *   by index (length adjusted); objects are shallow-diffed at the top level
- *   (keys present in the returned value are written, missing keys deleted).
- *
- * The setter does **not** perform keyed reconciliation. If you need surviving
- * items to keep their store identity across full-array replacement, use the
- * projection form — `createStore(fn, seed, { key })` or
- * `createProjection(fn, seed, { key })` — whose derive function reconciles
- * its return by `options.key`.
- */
-export type StoreSetter<T> = (fn: (state: T) => T | void) => void;
-/** Tuple returned by the plain `createStore(initialValue, options?)` form. */
-export type StoreReturn<T> = [get: Store<T>, set: StoreSetter<T>];
-/** Tuple returned by the derived `createStore(fn, seed, options?)` form. */
-export type ProjectionStoreReturn<T> = [get: Refreshable<Store<T>>, set: StoreSetter<T>];
-/** Options shared by all store primitives. */
-export interface StoreOptions {
-    /** Debug name (dev mode only) */
-    name?: string;
-    /** Single-layer store: root keys reactive, values raw records replaced by reference */
-    shallow?: boolean;
-}
-/**
- * Options for derived/projected stores created with
- * `createStore(fn, seed, options?)`, `createProjection(fn, seed, options?)`,
- * or `createOptimisticStore(fn, seed, options?)`.
- */
-export interface ProjectionOptions extends StoreOptions {
-    /** Key property name or function for reconciliation identity; `null` merges positionally */
-    key?: string | ((item: NonNullable<any>) => any) | null;
-    /**
-     * Treat the seed as commit #0: the store is born committed with the seed's
-     * contents, shown until the derive's first real answer lands. While that
-     * first answer is in flight, reads serve the seed everywhere — nothing
-     * suspends to a `<Loading>` boundary, no transition is held, and
-     * `isPending` stays false (the seed answers by declaration; first-load
-     * affordances belong to the data, e.g. a `skeleton: true` field in the
-     * seed). Once the first answer lands (reconciled into the seed), refetches
-     * use normal pending semantics with `isPending` true.
-     *
-     * The store equivalent of `MemoOptions.loadingValue`; the seed already
-     * carries the placeholder shape, so this is just the opt-in.
-     */
-    seedLoadingValue?: boolean;
-}
-export type NoFn<T> = T extends Function ? never : T;
-type DataNode = Signal<any>;
-type DataNodes = Record<PropertyKey, DataNode>;
-/**
- * Brand symbols used internally by the store proxy / projection plumbing.
- * Cross-package wiring; not part of the user-facing API.
- *
- * @internal
- */
-export declare const $TRACK: unique symbol, $TARGET: unique symbol, $PROXY: unique symbol, $DELETED: unique symbol, $AFFECTS: unique symbol;
-export declare const STORE_VALUE = "v", STORE_NODE = "n", STORE_HAS = "h", STORE_PARENT = "u", STORE_DESC = "d", STORE_SHALLOW = "s";
-/** Structural view of a store target as shared machinery sees it (the real
- * shape is `StoreNextTarget` in ./next/target.ts). */
-export type StoreNode = {
-    [$PROXY]: any;
-    [STORE_VALUE]: Record<PropertyKey, any>;
-    [STORE_NODE]?: DataNodes;
-    [STORE_HAS]?: DataNodes;
-    [STORE_PARENT]?: StoreNode;
-    [STORE_SHALLOW]?: boolean;
-    [STORE_DESC]?: boolean;
-};
-export declare namespace SolidStore {
-    interface Unwrappable {
-    }
-}
-export type NotWrappable = string | number | bigint | symbol | boolean | Function | null | undefined | SolidStore.Unwrappable[keyof SolidStore.Unwrappable];
-/**
- * Marks a value as raw: no store will ever wrap it — every store presents it
- * as-is, tracked by reference at whatever slot holds it and updated by
- * replacement. Useful for class instances and external objects (editors,
- * scene graphs, Maps) and for record-shaped data updated wholesale. Sticky
- * for the value's lifetime.
- */
-export declare let rawValuesUsed: boolean;
-export declare function isRawValue(value: any): boolean;
-export declare function markRaw<T>(value: T): T;
-export declare function markRawOne(v: any): void;
-export declare function markRawIngest(container: any): void;
-export declare function isWrappable<T>(obj: T | NotWrappable): obj is T;
-export declare function setWriteOverride(value: boolean): void;
-export declare function getWriteOverride(): boolean;
-export declare function ownEnumerableKeys(o: object): (string | symbol)[];
-/**
- * Scope inheritance for late-created nodes: every live mark whose identity
- * scope contains the owning record's raw — and, for keyed marks, whose key
- * is this property — gets counted on the new node. Inherited marks live
- * exactly as long as the scope's carrier — the release hook below drops
- * them with the entry.
- */
-export declare function inheritAffectsMarks(node: DataNode, raw: object, property: PropertyKey): void;
-/** Next-store node factory for affects carriers/slots: injected by the
- * rewrite module (next targets alias the legacy field names, so everything
- * here EXCEPT node creation works on them structurally). */
-export declare let nextAffectsNodeResolver: ((target: any, key: PropertyKey) => DataNode) | null;
-export declare function setNextAffectsNodeResolver(fn: (target: any, key: PropertyKey) => DataNode): void;
-/** Next-store optimistic view for the declaration walk (optimistic rows
- * pushed before the declaration are in motion too — legacy reads its write
- * overlays; next composes armed-node overrides). */
-export declare let nextOptimisticViewResolver: ((target: any, raw: any) => any) | null;
-export declare function setNextOptimisticViewResolver(fn: (target: any, raw: any) => any): void;
-/** @internal birth inheritance for nodes created inside a live mark window —
- * exported for the rewrite's node factories. */
-export declare function affectsScopesLive(): boolean;
-/**
- * Witness live mark coverage of a record into the active isPending() probe.
- * Tracked reads don't need this — they go through real signal nodes, which
- * carry marks directly (declaration walk or birth inheritance). This covers
- * UNTRACKED probes reading through records whose nodes never materialized
- * (no observer ever subscribed, so no node exists to carry the mark).
- * Callers guard on `pendingCheckActive`, so plain reads never pay for this.
- *
- * @internal
- */
-export declare function witnessAffectsMark(target: StoreNode, property?: PropertyKey): void;
-/**
- * Resolves the store nodes an `affects()` declaration marks: with a `key`,
- * the named slot's leaf node (upserted so the mark has an addressable
- * carrier); without, the record's $AFFECTS carrier plus every LIVE node in
- * its subtree (the edges existing readers subscribed through), with the
- * subtree's identities snapshotted into the mark's scope so nodes created
- * during the window — and untracked probes over captured proxies — resolve
- * against it (#2882).
- *
- * @internal
- */
-export declare function getStoreAffectsNodes(target: StoreNode, key?: PropertyKey): DataNode[];
-export {};

package/dist/types-cjs/store/storePath.d.cts

@@ -1,58 +0,0 @@
-import { type NotWrappable } from "./store.cjs";
-type W<T> = Exclude<T, NotWrappable>;
-type KeyOf<T> = number extends keyof T ? 0 extends 1 & T ? keyof T : [T] extends [never] ? never : [T] extends [readonly unknown[]] ? number : keyof T : keyof T;
-export type CustomPartial<T> = T extends readonly unknown[] ? "0" extends keyof T ? {
-    [K in Extract<keyof T, `${number}`>]?: T[K];
-} : {
-    [x: number]: T[number];
-} : Partial<T>;
-export type StorePathRange = {
-    from?: number;
-    to?: number;
-    by?: number;
-};
-export type ArrayFilterFn<T> = (item: T, index: number) => boolean;
-export type PathSetter<T> = T | CustomPartial<T> | ((prev: T) => T | CustomPartial<T>) | typeof DELETE;
-export type Part<T, K extends KeyOf<T> = KeyOf<T>> = K | ([K] extends [never] ? never : readonly K[]) | ([T] extends [readonly unknown[]] ? ArrayFilterFn<T[number]> | StorePathRange : never);
-declare const DELETE: unique symbol;
-export interface storePath {
-    DELETE: typeof DELETE;
-    <T, K1 extends KeyOf<W<T>>, K2 extends KeyOf<W<W<T>[K1]>>, K3 extends KeyOf<W<W<W<T>[K1]>[K2]>>, K4 extends KeyOf<W<W<W<W<T>[K1]>[K2]>[K3]>>, K5 extends KeyOf<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>>, K6 extends KeyOf<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>>, K7 extends KeyOf<W<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>[K6]>>>(k1: Part<W<T>, K1>, k2: Part<W<W<T>[K1]>, K2>, k3: Part<W<W<W<T>[K1]>[K2]>, K3>, k4: Part<W<W<W<W<T>[K1]>[K2]>[K3]>, K4>, k5: Part<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>, K5>, k6: Part<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>, K6>, k7: Part<W<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>[K6]>, K7>, setter: PathSetter<W<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>[K6]>[K7]>): (state: T) => void;
-    <T, K1 extends KeyOf<W<T>>, K2 extends KeyOf<W<W<T>[K1]>>, K3 extends KeyOf<W<W<W<T>[K1]>[K2]>>, K4 extends KeyOf<W<W<W<W<T>[K1]>[K2]>[K3]>>, K5 extends KeyOf<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>>, K6 extends KeyOf<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>>>(k1: Part<W<T>, K1>, k2: Part<W<W<T>[K1]>, K2>, k3: Part<W<W<W<T>[K1]>[K2]>, K3>, k4: Part<W<W<W<W<T>[K1]>[K2]>[K3]>, K4>, k5: Part<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>, K5>, k6: Part<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>, K6>, setter: PathSetter<W<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>[K6]>): (state: T) => void;
-    <T, K1 extends KeyOf<W<T>>, K2 extends KeyOf<W<W<T>[K1]>>, K3 extends KeyOf<W<W<W<T>[K1]>[K2]>>, K4 extends KeyOf<W<W<W<W<T>[K1]>[K2]>[K3]>>, K5 extends KeyOf<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>>>(k1: Part<W<T>, K1>, k2: Part<W<W<T>[K1]>, K2>, k3: Part<W<W<W<T>[K1]>[K2]>, K3>, k4: Part<W<W<W<W<T>[K1]>[K2]>[K3]>, K4>, k5: Part<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>, K5>, setter: PathSetter<W<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>[K5]>): (state: T) => void;
-    <T, K1 extends KeyOf<W<T>>, K2 extends KeyOf<W<W<T>[K1]>>, K3 extends KeyOf<W<W<W<T>[K1]>[K2]>>, K4 extends KeyOf<W<W<W<W<T>[K1]>[K2]>[K3]>>>(k1: Part<W<T>, K1>, k2: Part<W<W<T>[K1]>, K2>, k3: Part<W<W<W<T>[K1]>[K2]>, K3>, k4: Part<W<W<W<W<T>[K1]>[K2]>[K3]>, K4>, setter: PathSetter<W<W<W<W<T>[K1]>[K2]>[K3]>[K4]>): (state: T) => void;
-    <T, K1 extends KeyOf<W<T>>, K2 extends KeyOf<W<W<T>[K1]>>, K3 extends KeyOf<W<W<W<T>[K1]>[K2]>>>(k1: Part<W<T>, K1>, k2: Part<W<W<T>[K1]>, K2>, k3: Part<W<W<W<T>[K1]>[K2]>, K3>, setter: PathSetter<W<W<W<T>[K1]>[K2]>[K3]>): (state: T) => void;
-    <T, K1 extends KeyOf<W<T>>, K2 extends KeyOf<W<W<T>[K1]>>>(k1: Part<W<T>, K1>, k2: Part<W<W<T>[K1]>, K2>, setter: PathSetter<W<W<T>[K1]>[K2]>): (state: T) => void;
-    <T, K1 extends KeyOf<W<T>>>(k1: Part<W<T>, K1>, setter: PathSetter<W<T>[K1]>): (state: T) => void;
-    <T>(setter: PathSetter<T>): (state: T) => void;
-}
-/**
- * Path-based setter helper for `createStore`. Call `storePath(...path, value)`
- * to produce a draft-mutating function suitable for passing to `setStore`.
- *
- * The canonical setter form in Solid 2.0 is the draft-mutating callback
- * (`setStore(s => { s.user.name = "Ada"; })`). `storePath` is a backwards-
- * compatibility helper for users porting from Solid 1.x's
- * `setStore("user", "name", "Ada")` style — it's optional and you can mix the
- * two styles freely.
- *
- * Path parts can be:
- * - a single key — `"user"`, `0`
- * - an array of keys — `[0, 1, 2]`
- * - a range over an array — `{ from?, to?, by? }`
- * - a filter `(item, index) => boolean` for arrays
- *
- * The final argument is the new value or an updater `(prev) => next`. Use
- * `storePath.DELETE` to remove a property.
- *
- * @example
- * ```ts
- * const [state, setState] = createStore({ user: { name: "Ada" }, todos: [] });
- *
- * setState(storePath("user", "name", "Grace"));
- * setState(storePath("todos", t => !t.done, "done", true)); // mark all undone as done
- * setState(storePath("user", "nickname", storePath.DELETE));
- * ```
- */
-export declare const storePath: storePath;
-export {};

package/dist/types-cjs/store/utils.d.cts

@@ -1,74 +0,0 @@
-type DistributeOverride<T, F> = T extends undefined ? F : T;
-type Override<T, U> = T extends any ? U extends any ? {
-    [K in keyof T]: K extends keyof U ? DistributeOverride<U[K], T[K]> : T[K];
-} & {
-    [K in keyof U]: K extends keyof T ? DistributeOverride<U[K], T[K]> : U[K];
-} : T & U : T & U;
-type OverrideSpread<T, U> = T extends any ? {
-    [K in keyof ({
-        [K in keyof T]: any;
-    } & {
-        [K in keyof U]?: any;
-    } & {
-        [K in U extends any ? keyof U : keyof U]?: any;
-    })]: K extends keyof T ? Exclude<U extends any ? U[K & keyof U] : never, undefined> | T[K] : U extends any ? U[K & keyof U] : never;
-} : T & U;
-type Simplify<T> = T extends any ? {
-    [K in keyof T]: T[K];
-} : T;
-type _Merge<T extends unknown[], Curr = {}> = T extends [
-    infer Next | (() => infer Next),
-    ...infer Rest
-] ? _Merge<Rest, Override<Curr, Next>> : T extends [...infer Rest, infer Next | (() => infer Next)] ? Override<_Merge<Rest, Curr>, Next> : T extends [] ? Curr : T extends (infer I | (() => infer I))[] ? OverrideSpread<Curr, I> : Curr;
-export type Merge<T extends unknown[]> = Simplify<_Merge<T>>;
-/**
- * Merges multiple props-like objects into a single proxy that *preserves
- * reactivity*. Reads are forwarded to the right-most source that defines the
- * property, so later sources override earlier ones (like `Object.assign`).
- *
- * Function arguments are treated as memo-backed sources — useful for passing
- * derived defaults whose computation should track reactively.
- *
- * Use this in component bodies to merge defaults / overrides without losing
- * Solid's per-property tracking.
- *
- * @example
- * ```tsx
- * function Button(_props: { label: string; type?: string; disabled?: boolean }) {
- *   const props = merge({ type: "button", disabled: false }, _props);
- *
- *   return <button type={props.type} disabled={props.disabled}>{props.label}</button>;
- * }
- * ```
- */
-export declare function merge<T extends unknown[]>(...sources: T): Merge<T>;
-export type Omit<T, K extends readonly (keyof T)[]> = {
-    [P in keyof T as Exclude<P, K[number]>]: T[P];
-};
-/**
- * Returns a reactive proxy of `props` with the listed keys hidden. Tracking
- * on the remaining keys is preserved.
- *
- * Use it to forward "rest" props to a child element while pulling out the
- * keys your component handles itself — the equivalent of `splitProps(p, ["a","b"])[1]`.
- *
- * @example
- * ```tsx
- * function Input(props: { label: string; value: string; onInput: (v: string) => void } & JSX.HTMLAttributes<HTMLInputElement>) {
- *   const rest = omit(props, "label", "value", "onInput");
- *
- *   return (
- *     <label>
- *       {props.label}
- *       <input
- *         {...rest}
- *         value={props.value}
- *         onInput={e => props.onInput(e.currentTarget.value)}
- *       />
- *     </label>
- *   );
- * }
- * ```
- */
-export declare function omit<T extends Record<any, any>, K extends readonly (keyof T)[]>(props: T, ...keys: K): Omit<T, K>;
-export {};